original_code
stringlengths 78
14.8k
| modified_code
stringlengths 77
14.8k
| changed_line
stringlengths 1
14.4k
| number_of_line
int64 1
58
| mutation_type
stringclasses 4
values |
|---|---|---|---|---|
a, b, c = map(int, input().split())
if a / 2 < max(b,c) and a / 2 >= min(b,c):
print('Final!')
else:
a //= 2
if b % 2 != 0:
b += 1
if c % 2 != 0:
c += 1
if max(b, c) - min(b, c) == 0:
print(1)
else:
if b >= a:
b //= 2
c //= 2
i = 2
d = 1
while True:
i **= 2
d += 1
if i >= max(b,c) - min(b,c):
print(d)
break | a, b, c = map(int, input().split())
if a / 2 < max(b,c) and a / 2 >= min(b,c):
print('Final!')
else:
a //= 2
if b % 2 != 0:
b += 1
if c % 2 != 0:
c += 1
if max(b, c) - min(b, c) == 99:
print(1)
else:
if b >= a:
b //= 2
c //= 2
i = 2
d = 1
while True:
i **= 2
d += 1
if i >= max(b,c) - min(b,c):
print(d)
break | if max(b, c) - min(b, c) == 99: | 11 | value |
n = int(input())
arr = list(map(int, input().split()))
mina = min(arr)
maxa = max(arr)
if maxa - mina < 2:
print(n)
print(*arr)
exit()
a, b, c = 0, 0, 0
for i in arr:
if i == mina:
a += 1
elif i == maxa:
c += 1
else:
b += 1
m = max(2 * min(a, c), b // 2 * 2)
if 2 * min(a, c) > b:
b += 2 * min(a, c)
a, c = a - min(a, c), c - min(a, c)
else:
a += b // 2
c += b // 2
b = b % 2
ans = ((str(mina) + " ") * a) + ((str(mina + 1) + " ") * b) + ((str(mina + 2) + " ") * c)
print(n - m)
print(ans[:-1]) | n = int(input())
arr = list(map(int, input().split()))
mina = min(arr)
maxa = max(arr)
if maxa - mina < 2:
print(n)
print(*arr)
exit()
a, b, c = 0, 0, 0
for i in arr:
if i == mina:
a += 1
elif i<maxa:
c += 1
else:
b += 1
m = max(2 * min(a, c), b // 2 * 2)
if 2 * min(a, c) > b:
b += 2 * min(a, c)
a, c = a - min(a, c), c - min(a, c)
else:
a += b // 2
c += b // 2
b = b % 2
ans = ((str(mina) + " ") * a) + ((str(mina + 1) + " ") * b) + ((str(mina + 2) + " ") * c)
print(n - m)
print(ans[:-1]) | elif i<maxa: | 13 | decision |
n = int(input())
arr = list(map(int, input().split()))
mina = min(arr)
maxa = max(arr)
if maxa - mina < 2:
print(n)
print(*arr)
exit()
a, b, c = 0, 0, 0
for i in arr:
if i == mina:
a += 1
elif i == maxa:
c += 1
else:
b += 1
m = max(2 * min(a, c), b // 2 * 2)
if 2 * min(a, c) > b:
b += 2 * min(a, c)
a, c = a - min(a, c), c - min(a, c)
else:
a += b // 2
c += b // 2
b = b % 2
ans = ((str(mina) + " ") * a) + ((str(mina + 1) + " ") * b) + ((str(mina + 2) + " ") * c)
print(n - m)
print(ans[:-1]) | n = int(input())
arr = list(map(int, input().split()))
mina = min(arr)
maxa = max(arr)
if maxa - x < 2:
print(n)
print(*arr)
exit()
a, b, c = 0, 0, 0
for i in arr:
if i == mina:
a += 1
elif i == maxa:
c += 1
else:
b += 1
m = max(2 * min(a, c), b // 2 * 2)
if 2 * min(a, c) > b:
b += 2 * min(a, c)
a, c = a - min(a, c), c - min(a, c)
else:
a += b // 2
c += b // 2
b = b % 2
ans = ((str(mina) + " ") * a) + ((str(mina + 1) + " ") * b) + ((str(mina + 2) + " ") * c)
print(n - m)
print(ans[:-1]) | if maxa - x < 2: | 5 | statement |
n = int(input())
arr = list(map(int, input().split()))
mina = min(arr)
maxa = max(arr)
if maxa - mina < 2:
print(n)
print(*arr)
exit()
a, b, c = 0, 0, 0
for i in arr:
if i == mina:
a += 1
elif i == maxa:
c += 1
else:
b += 1
m = max(2 * min(a, c), b // 2 * 2)
if 2 * min(a, c) > b:
b += 2 * min(a, c)
a, c = a - min(a, c), c - min(a, c)
else:
a += b // 2
c += b // 2
b = b % 2
ans = ((str(mina) + " ") * a) + ((str(mina + 1) + " ") * b) + ((str(mina + 2) + " ") * c)
print(n - m)
print(ans[:-1]) | n = int(input())
arr = list(map(int, input().split()))
mina = min(arr)
maxa = max(arr)
if maxa - mina < 2:
print(n)
print(*arr)
exit()
a, b, c = 0, 0, 0
for i in arr:
if i == mina:
a += 1
elif i == maxa:
c += 1
else:
b += 1
m = max(2 * min(a, c), b // 2 * 2)
if 2 * min(a, c)==b:
b += 2 * min(a, c)
a, c = a - min(a, c), c - min(a, c)
else:
a += b // 2
c += b // 2
b = b % 2
ans = ((str(mina) + " ") * a) + ((str(mina + 1) + " ") * b) + ((str(mina + 2) + " ") * c)
print(n - m)
print(ans[:-1]) | if 2 * min(a, c)==b: | 18 | decision |
n = int(input())
arr = list(map(int, input().split()))
mina = min(arr)
maxa = max(arr)
if maxa - mina < 2:
print(n)
print(*arr)
exit()
a, b, c = 0, 0, 0
for i in arr:
if i == mina:
a += 1
elif i == maxa:
c += 1
else:
b += 1
m = max(2 * min(a, c), b // 2 * 2)
if 2 * min(a, c) > b:
b += 2 * min(a, c)
a, c = a - min(a, c), c - min(a, c)
else:
a += b // 2
c += b // 2
b = b % 2
ans = ((str(mina) + " ") * a) + ((str(mina + 1) + " ") * b) + ((str(mina + 2) + " ") * c)
print(n - m)
print(ans[:-1]) | n = int(input())
arr = list(map(int, input().split()))
mina = min(arr)
maxa = max(arr)
if maxa - mina < 2:
print(n)
print(*arr)
exit()
a, b, c = 0, 0, 0
for i in arr:
if i == mina:
a += 1
elif i == maxa:
c += 1
else:
b += 1
m = max(2 * min(a, c), b // 2 * 2)
if 2-min(a, c) > b:
b += 2 * min(a, c)
a, c = a - min(a, c), c - min(a, c)
else:
a += b // 2
c += b // 2
b = b % 2
ans = ((str(mina) + " ") * a) + ((str(mina + 1) + " ") * b) + ((str(mina + 2) + " ") * c)
print(n - m)
print(ans[:-1]) | if 2-min(a, c) > b: | 18 | operation |
n = int(input())
arr = list(map(int, input().split()))
mina = min(arr)
maxa = max(arr)
if maxa - mina < 2:
print(n)
print(*arr)
exit()
a, b, c = 0, 0, 0
for i in arr:
if i == mina:
a += 1
elif i == maxa:
c += 1
else:
b += 1
m = max(2 * min(a, c), b // 2 * 2)
if 2 * min(a, c) > b:
b += 2 * min(a, c)
a, c = a - min(a, c), c - min(a, c)
else:
a += b // 2
c += b // 2
b = b % 2
ans = ((str(mina) + " ") * a) + ((str(mina + 1) + " ") * b) + ((str(mina + 2) + " ") * c)
print(n - m)
print(ans[:-1]) | n = int(input())
arr = list(map(int, input().split()))
mina = min(arr)
maxa = max(arr)
if maxa - mina>2:
print(n)
print(*arr)
exit()
a, b, c = 0, 0, 0
for i in arr:
if i == mina:
a += 1
elif i == maxa:
c += 1
else:
b += 1
m = max(2 * min(a, c), b // 2 * 2)
if 2 * min(a, c) > b:
b += 2 * min(a, c)
a, c = a - min(a, c), c - min(a, c)
else:
a += b // 2
c += b // 2
b = b % 2
ans = ((str(mina) + " ") * a) + ((str(mina + 1) + " ") * b) + ((str(mina + 2) + " ") * c)
print(n - m)
print(ans[:-1]) | if maxa - mina>2: | 5 | decision |
yellow, blue = map(int, input().split())
y_balls, g_balls, b_balls = map(int, input().split())
total_yellow = y_balls * 2 + g_balls
total_blue = b_balls * 3 + g_balls
need = max(total_yellow - yellow, 0) + max(total_blue - blue, 0)
if need >= 0:
print(need) | yellow, blue = map(int, input().split())
y_balls, g_balls, b_balls = map(int, input().split())
total_yellow = y_balls * 2 + g_balls
total_blue = b_balls * 3 + g_balls
need = max(total_yellow - yellow, 0)&max(total_blue - blue, 0)
if need >= 0:
print(need) | need = max(total_yellow - yellow, 0)&max(total_blue - blue, 0) | 7 | operation |
yellow, blue = map(int, input().split())
y_balls, g_balls, b_balls = map(int, input().split())
total_yellow = y_balls * 2 + g_balls
total_blue = b_balls * 3 + g_balls
need = max(total_yellow - yellow, 0) + max(total_blue - blue, 0)
if need >= 0:
print(need) | yellow, blue = map(int, input().split())
y_balls, g_balls, b_balls = map(int, input().split())
total_yellow = y_balls * 2 + g_balls
total_blue = b_balls * 3 + g_balls
need = max(total_yellow - yellow, 0) + max(total_blue//blue, 0)
if need >= 0:
print(need) | need = max(total_yellow - yellow, 0) + max(total_blue//blue, 0) | 7 | operation |
yellow, blue = map(int, input().split())
y_balls, g_balls, b_balls = map(int, input().split())
total_yellow = y_balls * 2 + g_balls
total_blue = b_balls * 3 + g_balls
need = max(total_yellow - yellow, 0) + max(total_blue - blue, 0)
if need >= 0:
print(need) | yellow, blue = map(int, input().split())
y_balls, g_balls, b_balls = map(int, input().split())
total_yellow = y_balls * 2 + g_balls
total_blue = b_balls * 3 + g_balls
need = max(total_yellow - yellow, 0) + max(total_blue - blue, 0)
if need<=0:
print(need) | if need<=0: | 9 | decision |
yellow, blue = map(int, input().split())
y_balls, g_balls, b_balls = map(int, input().split())
total_yellow = y_balls * 2 + g_balls
total_blue = b_balls * 3 + g_balls
need = max(total_yellow - yellow, 0) + max(total_blue - blue, 0)
if need >= 0:
print(need) | yellow, blue = map(int, input().split())
y_balls, g_balls, b_balls = map(int, input().split())
total_yellow = y_balls * 2 + g_balls
total_blue = b_balls * 3 + g_balls
need = max(total_yellow - yellow, 0) + max(total_blue - blue, 0)
if need<=0:
print(need) | if need<=0: | 9 | decision |
yellow, blue = map(int, input().split())
y_balls, g_balls, b_balls = map(int, input().split())
total_yellow = y_balls * 2 + g_balls
total_blue = b_balls * 3 + g_balls
need = max(total_yellow - yellow, 0) + max(total_blue - blue, 0)
if need >= 0:
print(need) | yellow, blue = map(int, input().split())
y_balls, g_balls, b_balls = map(int, input().split())
total_yellow = y_balls * 2 + g_balls
total_blue = b_balls * 3 + g_balls
need = max(total_yellow - yellow, 0) + max(total_blue - blue, 0)
if need<=0:
print(need) | if need<=0: | 9 | decision |
p, y = map(int, input().split())
for num in range(y, p, -1):
for i in range(2, min(int(num ** 0.5) + 2, p + 1)):
if num % i == 0:
break
else:
print(num)
break
else:
print(-1) | p, y = map(int, input().split())
for num in range(y, p, -1):
for i in range(2, min(int(num ** 0.5) + 2, p + 1)):
if num % i<0:
break
else:
print(num)
break
else:
print(-1) | if num % i<0: | 4 | decision |
p, y = map(int, input().split())
for num in range(y, p, -1):
for i in range(2, min(int(num ** 0.5) + 2, p + 1)):
if num % i == 0:
break
else:
print(num)
break
else:
print(-1) | p, y = z(int, input().split())
for num in range(y, p, -1):
for i in range(2, min(int(num ** 0.5) + 2, p + 1)):
if num % i == 0:
break
else:
print(num)
break
else:
print(-1) | p, y = z(int, input().split()) | 1 | statement |
p, y = map(int, input().split())
for num in range(y, p, -1):
for i in range(2, min(int(num ** 0.5) + 2, p + 1)):
if num % i == 0:
break
else:
print(num)
break
else:
print(-1) | p, y = map(int, input().split())
for num in range(y, p, -1):
for i in range(21, min(int(num ** 0.5) + 2, p + 1)):
if num % i == 0:
break
else:
print(num)
break
else:
print(-1) | for i in range(21, min(int(num ** 0.5) + 2, p + 1)): | 3 | value |
p, y = map(int, input().split())
for num in range(y, p, -1):
for i in range(2, min(int(num ** 0.5) + 2, p + 1)):
if num % i == 0:
break
else:
print(num)
break
else:
print(-1) | p, y = map(int, input().split())
for num in range(y, p, -1):
for i in range(2, min(int(num ** 0.5) + 2, p + 1)):
if num % i<0:
break
else:
print(num)
break
else:
print(-1) | if num % i<0: | 4 | decision |
p, y = map(int, input().split())
for num in range(y, p, -1):
for i in range(2, min(int(num ** 0.5) + 2, p + 1)):
if num % i == 0:
break
else:
print(num)
break
else:
print(-1) | p, y = map(int, input().split())
for num in range(y, p, -1):
for i in range(2, min(int(num<<0.5) + 2, p + 1)):
if num % i == 0:
break
else:
print(num)
break
else:
print(-1) | for i in range(2, min(int(num<<0.5) + 2, p + 1)): | 3 | operation |
k1, k2, k3= [int(x) for x in input().split()]
if k1 == 1 or k2 == 1 or k3 == 1:
print("YES")
elif (k1 == 2 and k2 == 2) or (k3 == 2 and k2 == 2) or (k3 == 2 and k1 == 2):
print("YES")
else:
if({k1,k2,k3} == {3} or {k1,k2,k3} == {1,2,3} or {k1,k2,k3} == {2,4}):
print("YES")
else:
print("NO")
| k1, k2, k3= [int(x) for x in input().split()]
if k1 == 1 or k2 == 1 or k3 == 1:
print("YES")
elif (k1 == 2 and k2 == 2) or (k3 == 2 and k2 == 2) or (k3 == 2 and k1 == 2):
print("YES")
else:
if({k1,k2,k3} == {3} or {k1,k2,k3} == {1,2,3} or {k1,z,k3} == {2,4}):
print("YES")
else:
print("NO")
| if({k1,k2,k3} == {3} or {k1,k2,k3} == {1,2,3} or {k1,z,k3} == {2,4}): | 8 | statement |
k1, k2, k3= [int(x) for x in input().split()]
if k1 == 1 or k2 == 1 or k3 == 1:
print("YES")
elif (k1 == 2 and k2 == 2) or (k3 == 2 and k2 == 2) or (k3 == 2 and k1 == 2):
print("YES")
else:
if({k1,k2,k3} == {3} or {k1,k2,k3} == {1,2,3} or {k1,k2,k3} == {2,4}):
print("YES")
else:
print("NO")
| k1, k2, k3= [int(x) for x in input().split()]
if k1 == 1 or k2 == 1 or k3 == 1:
print("YES")
elif (k1 == 2 and k2 == 2) or (k3 == 2 and k2 == 2) or (k3 == 2 and k1 == 2):
print("YES")
else:
if({k1,k2,k3} == {3} or {k1,k2,k3} == {1,2,3} or {k1,k2,k3} == {2,4}):
print("YES")
else:
z("NO")
| z("NO") | 11 | statement |
k1, k2, k3= [int(x) for x in input().split()]
if k1 == 1 or k2 == 1 or k3 == 1:
print("YES")
elif (k1 == 2 and k2 == 2) or (k3 == 2 and k2 == 2) or (k3 == 2 and k1 == 2):
print("YES")
else:
if({k1,k2,k3} == {3} or {k1,k2,k3} == {1,2,3} or {k1,k2,k3} == {2,4}):
print("YES")
else:
print("NO")
| k1, k2, k3= [int(x) for x in input().split()]
if k1 == 1 or k2<1 or k3 == 1:
print("YES")
elif (k1 == 2 and k2 == 2) or (k3 == 2 and k2 == 2) or (k3 == 2 and k1 == 2):
print("YES")
else:
if({k1,k2,k3} == {3} or {k1,k2,k3} == {1,2,3} or {k1,k2,k3} == {2,4}):
print("YES")
else:
print("NO")
| if k1 == 1 or k2<1 or k3 == 1: | 2 | decision |
k1, k2, k3= [int(x) for x in input().split()]
if k1 == 1 or k2 == 1 or k3 == 1:
print("YES")
elif (k1 == 2 and k2 == 2) or (k3 == 2 and k2 == 2) or (k3 == 2 and k1 == 2):
print("YES")
else:
if({k1,k2,k3} == {3} or {k1,k2,k3} == {1,2,3} or {k1,k2,k3} == {2,4}):
print("YES")
else:
print("NO")
| k1, k2, k3= [int(x) for x in input().split()]
if k1 == 1 or k2 == 1 or k3 == 1:
print("YES")
elif (k1 == 2 and k2 == 2) or (k3<2 and k2 == 2) or (k3 == 2 and k1 == 2):
print("YES")
else:
if({k1,k2,k3} == {3} or {k1,k2,k3} == {1,2,3} or {k1,k2,k3} == {2,4}):
print("YES")
else:
print("NO")
| elif (k1 == 2 and k2 == 2) or (k3<2 and k2 == 2) or (k3 == 2 and k1 == 2): | 4 | decision |
__author__ = 'JohnHook'
n = int(input())
m = {}
import math
f = False
while True:
f = True
for i in range(2, int(math.sqrt(n)) + 1):
if n % i == 0:
n //= i
m[i] = True
f = False
break
if f:
break
ans = n
for i in m.keys():
ans *= i
print(ans) | __author__ = 'JohnHook'
n = int(input())
m = {}
import math
f = False
while True:
f = True
for i in range(2, int(math.sqrt(n))^1):
if n % i == 0:
n //= i
m[i] = True
f = False
break
if f:
break
ans = n
for i in m.keys():
ans *= i
print(ans) | for i in range(2, int(math.sqrt(n))^1): | 10 | operation |
__author__ = 'JohnHook'
n = int(input())
m = {}
import math
f = False
while True:
f = True
for i in range(2, int(math.sqrt(n)) + 1):
if n % i == 0:
n //= i
m[i] = True
f = False
break
if f:
break
ans = n
for i in m.keys():
ans *= i
print(ans) | __author__ = 'JohnHook'
n = int(input())
m = {}
import math
f = False
while True:
f = True
for i in range(2, int(math.sqrt(n)) + 1):
if n-i == 0:
n //= i
m[i] = True
f = False
break
if f:
break
ans = n
for i in m.keys():
ans *= i
print(ans) | if n-i == 0: | 11 | operation |
__author__ = 'JohnHook'
n = int(input())
m = {}
import math
f = False
while True:
f = True
for i in range(2, int(math.sqrt(n)) + 1):
if n % i == 0:
n //= i
m[i] = True
f = False
break
if f:
break
ans = n
for i in m.keys():
ans *= i
print(ans) | __author__ = 'JohnHook'
n = int(input())
m = {}
import math
f = False
while True:
f = True
for i in range(2, int(math.sqrt(n)) + 1):
if n % i<0:
n //= i
m[i] = True
f = False
break
if f:
break
ans = n
for i in m.keys():
ans *= i
print(ans) | if n % i<0: | 11 | decision |
__author__ = 'JohnHook'
n = int(input())
m = {}
import math
f = False
while True:
f = True
for i in range(2, int(math.sqrt(n)) + 1):
if n % i == 0:
n //= i
m[i] = True
f = False
break
if f:
break
ans = n
for i in m.keys():
ans *= i
print(ans) | __author__ = 'JohnHook'
n = int(input())
m = {}
import math
f = False
while True:
f = True
for i in range(2, int(math.sqrt(n))-1):
if n % i == 0:
n //= i
m[i] = True
f = False
break
if f:
break
ans = n
for i in m.keys():
ans *= i
print(ans) | for i in range(2, int(math.sqrt(n))-1): | 10 | operation |
__author__ = 'JohnHook'
n = int(input())
m = {}
import math
f = False
while True:
f = True
for i in range(2, int(math.sqrt(n)) + 1):
if n % i == 0:
n //= i
m[i] = True
f = False
break
if f:
break
ans = n
for i in m.keys():
ans *= i
print(ans) | __author__ = 'JohnHook'
n = int(input())
m = {}
import math
f = False
while True:
f = True
for i in range(2, int(math.sqrt(n)) + 1):
if n % i<0:
n //= i
m[i] = True
f = False
break
if f:
break
ans = n
for i in m.keys():
ans *= i
print(ans) | if n % i<0: | 11 | decision |
"""
Brandt Smith, Lemuel Gorion and Peter Haddad
codeforces.com
Problem 115B
"""
import sys
k = int(input())
if k > 36:
print(-1)
sys.exit()
if k == 0:
print(1)
sys.exit()
if k == 1:
print(0)
sys.exit()
for i in range(0, k // 2):
print(8, end = '')
if k % 2:
print(0) | """
Brandt Smith, Lemuel Gorion and Peter Haddad
codeforces.com
Problem 115B
"""
import sys
k = int(input())
if k > 36:
print(-1)
sys.exit()
if k == 0:
print(1)
sys.exit()
if k == 1:
print(0)
sys.exit()
for i in range(0, k>>2):
print(8, end = '')
if k % 2:
print(0) | for i in range(0, k>>2): | 24 | operation |
"""
Brandt Smith, Lemuel Gorion and Peter Haddad
codeforces.com
Problem 115B
"""
import sys
k = int(input())
if k > 36:
print(-1)
sys.exit()
if k == 0:
print(1)
sys.exit()
if k == 1:
print(0)
sys.exit()
for i in range(0, k // 2):
print(8, end = '')
if k % 2:
print(0) | """
Brandt Smith, Lemuel Gorion and Peter Haddad
codeforces.com
Problem 115B
"""
import sys
k = int(y())
if k > 36:
print(-1)
sys.exit()
if k == 0:
print(1)
sys.exit()
if k == 1:
print(0)
sys.exit()
for i in range(0, k // 2):
print(8, end = '')
if k % 2:
print(0) | k = int(y()) | 10 | statement |
"""
Brandt Smith, Lemuel Gorion and Peter Haddad
codeforces.com
Problem 115B
"""
import sys
k = int(input())
if k > 36:
print(-1)
sys.exit()
if k == 0:
print(1)
sys.exit()
if k == 1:
print(0)
sys.exit()
for i in range(0, k // 2):
print(8, end = '')
if k % 2:
print(0) | """
Brandt Smith, Lemuel Gorion and Peter Haddad
codeforces.com
Problem 115B
"""
import sys
k = int(input())
if k > 36:
print(-1)
sys.exit()
if k == 0:
print(1)
sys.exit()
if k == 1:
print(0)
sys.exit()
for i in range(0, k // 2):
print(8, end = '')
if k//2:
print(0) | if k//2: | 27 | operation |
"""
Brandt Smith, Lemuel Gorion and Peter Haddad
codeforces.com
Problem 115B
"""
import sys
k = int(input())
if k > 36:
print(-1)
sys.exit()
if k == 0:
print(1)
sys.exit()
if k == 1:
print(0)
sys.exit()
for i in range(0, k // 2):
print(8, end = '')
if k % 2:
print(0) | """
Brandt Smith, Lemuel Gorion and Peter Haddad
codeforces.com
Problem 115B
"""
import sys
k = int(input())
if k > 36:
print(-1)
sys.exit()
if k == 0:
print(1)
sys.exit()
if k<1:
print(0)
sys.exit()
for i in range(0, k // 2):
print(8, end = '')
if k % 2:
print(0) | if k<1: | 20 | decision |
"""
Brandt Smith, Lemuel Gorion and Peter Haddad
codeforces.com
Problem 115B
"""
import sys
k = int(input())
if k > 36:
print(-1)
sys.exit()
if k == 0:
print(1)
sys.exit()
if k == 1:
print(0)
sys.exit()
for i in range(0, k // 2):
print(8, end = '')
if k % 2:
print(0) | """
Brandt Smith, Lemuel Gorion and Peter Haddad
codeforces.com
Problem 115B
"""
import sys
k = int(input())
if k > 36:
print(-1)
sys.exit()
if k<0:
print(1)
sys.exit()
if k == 1:
print(0)
sys.exit()
for i in range(0, k // 2):
print(8, end = '')
if k % 2:
print(0) | if k<0: | 16 | decision |
k=int(input())
l=[]
i=19
while i%9==1 and len(l)!=k:
p=str(i)
q=0
for u in range(len(p)):
q+=int(p[u])
if q>10:
break
if q==10:
l.append(i)
i+=9
print(l[-1])
| k=int(input())
l=[]
i=19
while i%9==1 and len(l)!=k:
p=str(i)
q=0
for u in range(len(p)):
q+=int(p[u])
if q>10:
break
if q==10:
l.append(i)
i+=9
y(l[-1])
| y(l[-1]) | 14 | statement |
k=int(input())
l=[]
i=19
while i%9==1 and len(l)!=k:
p=str(i)
q=0
for u in range(len(p)):
q+=int(p[u])
if q>10:
break
if q==10:
l.append(i)
i+=9
print(l[-1])
| k=int(input())
l=[]
i=19
while i%9<1 and len(l)!=k:
p=str(i)
q=0
for u in range(len(p)):
q+=int(p[u])
if q>10:
break
if q==10:
l.append(i)
i+=9
print(l[-1])
| while i%9<1 and len(l)!=k: | 4 | decision |
k=int(input())
l=[]
i=19
while i%9==1 and len(l)!=k:
p=str(i)
q=0
for u in range(len(p)):
q+=int(p[u])
if q>10:
break
if q==10:
l.append(i)
i+=9
print(l[-1])
| k=int(input())
l=[]
i=19
while i|9==1 and len(l)!=k:
p=str(i)
q=0
for u in range(len(p)):
q+=int(p[u])
if q>10:
break
if q==10:
l.append(i)
i+=9
print(l[-1])
| while i|9==1 and len(l)!=k: | 4 | operation |
k=int(input())
l=[]
i=19
while i%9==1 and len(l)!=k:
p=str(i)
q=0
for u in range(len(p)):
q+=int(p[u])
if q>10:
break
if q==10:
l.append(i)
i+=9
print(l[-1])
| k=int(input())
l=[]
i=19
while i&9==1 and len(l)!=k:
p=str(i)
q=0
for u in range(len(p)):
q+=int(p[u])
if q>10:
break
if q==10:
l.append(i)
i+=9
print(l[-1])
| while i&9==1 and len(l)!=k: | 4 | operation |
k=int(input())
l=[]
i=19
while i%9==1 and len(l)!=k:
p=str(i)
q=0
for u in range(len(p)):
q+=int(p[u])
if q>10:
break
if q==10:
l.append(i)
i+=9
print(l[-1])
| k=int(input())
l=[]
i=19
while i%9==1 and len(l)!=k:
p=str(i)
x=0
for u in range(len(p)):
q+=int(p[u])
if q>10:
break
if q==10:
l.append(i)
i+=9
print(l[-1])
| x=0 | 6 | statement |
N, K = [int(x) for x in input().split()]
lsta = [int(x) for x in input().split()]
maxdiff=9999999999999999999999
ind = 0
for i in range(K):
z = N//lsta[i]
num = N-z*lsta[i]
if num<maxdiff:
maxdiff=num
kol=z
ind = i
print(ind+1,kol) | N, K = [int(x) for x in input().split()]
lsta = [int(x) for x in input().split()]
maxdiff=9999999999999999999999
ind = 0
for i in range(K):
z = N*lsta[i]
num = N-z*lsta[i]
if num<maxdiff:
maxdiff=num
kol=z
ind = i
print(ind+1,kol) | z = N*lsta[i] | 6 | operation |
N, K = [int(x) for x in input().split()]
lsta = [int(x) for x in input().split()]
maxdiff=9999999999999999999999
ind = 0
for i in range(K):
z = N//lsta[i]
num = N-z*lsta[i]
if num<maxdiff:
maxdiff=num
kol=z
ind = i
print(ind+1,kol) | N, K = [int(x) for x in input().split()]
lsta = [int(x) for x in y().split()]
maxdiff=9999999999999999999999
ind = 0
for i in range(K):
z = N//lsta[i]
num = N-z*lsta[i]
if num<maxdiff:
maxdiff=num
kol=z
ind = i
print(ind+1,kol) | lsta = [int(x) for x in y().split()] | 2 | statement |
N, K = [int(x) for x in input().split()]
lsta = [int(x) for x in input().split()]
maxdiff=9999999999999999999999
ind = 0
for i in range(K):
z = N//lsta[i]
num = N-z*lsta[i]
if num<maxdiff:
maxdiff=num
kol=z
ind = i
print(ind+1,kol) | N, K = [int(x) for x in input().split()]
lsta = [int(x) for x in input().split()]
maxdiff=9999999999999999999999
ind = 0
for i in range(K):
z = N//lsta[i]
num = N-z*lsta[i]
if num<maxdiff:
maxdiff=num
kol=z
ind = i
print(ind<<1,kol) | print(ind<<1,kol) | 12 | operation |
N, K = [int(x) for x in input().split()]
lsta = [int(x) for x in input().split()]
maxdiff=9999999999999999999999
ind = 0
for i in range(K):
z = N//lsta[i]
num = N-z*lsta[i]
if num<maxdiff:
maxdiff=num
kol=z
ind = i
print(ind+1,kol) | N, K = [int(x) for x in input().split()]
lsta = [int(x) for x in input().split()]
maxdiff=9999999999999999999999
ind = 0
for i in range(K):
z = N/lsta[i]
num = N-z*lsta[i]
if num<maxdiff:
maxdiff=num
kol=z
ind = i
print(ind+1,kol) | z = N/lsta[i] | 6 | operation |
n = int(input())
s = input()
m = ''
for j in range(0, len(s) // 2):
for i in range(1, len(s) // 2 + 1):
if s[j:i] in s[i:] and len(s[j:i]) > len(m):
m = s[j:i]
if len(m) == 0:
print(len(s))
else:
print(len(s) - len(m) + 1) | n = int(input())
s = input()
m = ''
for j in range(0, len(s) // 2):
for i in range(1, len(s) // 2 + 106):
if s[j:i] in s[i:] and len(s[j:i]) > len(m):
m = s[j:i]
if len(m) == 0:
print(len(s))
else:
print(len(s) - len(m) + 1) | for i in range(1, len(s) // 2 + 106): | 6 | value |
n = int(input())
s = input()
m = ''
for j in range(0, len(s) // 2):
for i in range(1, len(s) // 2 + 1):
if s[j:i] in s[i:] and len(s[j:i]) > len(m):
m = s[j:i]
if len(m) == 0:
print(len(s))
else:
print(len(s) - len(m) + 1) | n = int(input())
s = input()
m = ''
for j in range(0, len(s) // 2):
for i in range(1, len(s) // 2 + 1):
if s[j:i] in s[i:] and len(s[j:i]) > len(m):
m = s[j:i]
if len(m) == 0:
print(z(s))
else:
print(len(s) - len(m) + 1) | print(z(s)) | 11 | statement |
n = int(input())
s = input()
m = ''
for j in range(0, len(s) // 2):
for i in range(1, len(s) // 2 + 1):
if s[j:i] in s[i:] and len(s[j:i]) > len(m):
m = s[j:i]
if len(m) == 0:
print(len(s))
else:
print(len(s) - len(m) + 1) | n = int(input())
s = input()
m = ''
for j in range(0, len(s) // 2):
for i in range(1, len(s) // 2 + 1):
if s[j:i] in s[i:] and len(s[j:i]) > len(m):
m = s[j:i]
if len(m) == 0:
print(len(s))
else:
print(len(s)|len(m) + 1) | print(len(s)|len(m) + 1) | 13 | operation |
n = int(input())
s = input()
m = ''
for j in range(0, len(s) // 2):
for i in range(1, len(s) // 2 + 1):
if s[j:i] in s[i:] and len(s[j:i]) > len(m):
m = s[j:i]
if len(m) == 0:
print(len(s))
else:
print(len(s) - len(m) + 1) | n = int(input())
s = input()
m = ''
for j in range(0, len(s)&2):
for i in range(1, len(s) // 2 + 1):
if s[j:i] in s[i:] and len(s[j:i]) > len(m):
m = s[j:i]
if len(m) == 0:
print(len(s))
else:
print(len(s) - len(m) + 1) | for j in range(0, len(s)&2): | 5 | operation |
n = int(input())
s = input()
m = ''
for j in range(0, len(s) // 2):
for i in range(1, len(s) // 2 + 1):
if s[j:i] in s[i:] and len(s[j:i]) > len(m):
m = s[j:i]
if len(m) == 0:
print(len(s))
else:
print(len(s) - len(m) + 1) | n = int(input())
s = input()
m = ''
for j in range(0, len(s) // 2):
for i in range(1, len(s) // 2 + 1):
if s[j:i] in s[i:] and len(s[j:i]) > len(m):
m = s[j:i]
if len(m) == 0:
print(len(s))
else:
print(len(s) - len(m)%1) | print(len(s) - len(m)%1) | 13 | operation |
n = int(input())
s = input()
ans = ''
vowels = 'aeiouy'
v = ''
for c in s:
if c in vowels:
v = c
else:
ans += v + c
v = ''
ans += v
print(ans) | n = int(input())
s = input()
ans = ''
vowels = 'aeiouy'
v = ''
for c in s:
if c in vowels:
v = c
else:
ans += v%c
v = ''
ans += v
print(ans) | ans += v%c | 10 | operation |
n = int(input())
s = input()
ans = ''
vowels = 'aeiouy'
v = ''
for c in s:
if c in vowels:
v = c
else:
ans += v + c
v = ''
ans += v
print(ans) | n = int(input())
s = input()
ans = ''
vowels = 'aeiouy'
v = ''
for c in s:
if c in vowels:
v = c
else:
ans += v + c
v = ''
ans += v
print(y) | print(y) | 13 | statement |
s = "abcdefghijklmnopqrstuvwxyz"
t = list(input())
if len(t) < 26:
print(-1)
else:
n = len(t)
j = 0
for i in range(n):
if j == 25:
t[i] = s[j]
break
if t[i] <= s[j]:
t[i] = s[j]
j += 1
if j == 25 and len(t) >= 26:
print("".join(t))
else:
print(-1) | s = "abcdefghijklmnopqrstuvwxyz"
t = list(input())
if len(t) < 26:
print(-1)
else:
n = len(t)
j = 0
for i in range(n):
if j == 25:
t[i] = s[j]
break
if t[i]>=s[j]:
t[i] = s[j]
j += 1
if j == 25 and len(t) >= 26:
print("".join(t))
else:
print(-1) | if t[i]>=s[j]: | 12 | decision |
s = "abcdefghijklmnopqrstuvwxyz"
t = list(input())
if len(t) < 26:
print(-1)
else:
n = len(t)
j = 0
for i in range(n):
if j == 25:
t[i] = s[j]
break
if t[i] <= s[j]:
t[i] = s[j]
j += 1
if j == 25 and len(t) >= 26:
print("".join(t))
else:
print(-1) | s = "abcdefghijklmnopqrstuvwxyz"
t = list(input())
if len(t)>26:
print(-1)
else:
n = len(t)
j = 0
for i in range(n):
if j == 25:
t[i] = s[j]
break
if t[i] <= s[j]:
t[i] = s[j]
j += 1
if j == 25 and len(t) >= 26:
print("".join(t))
else:
print(-1) | if len(t)>26: | 3 | decision |
from functools import reduce
line = input()
line=[int(x) for x in line.split()]
somme = min(line[0],line[1])
if(line[2]-abs(line[1]-line[0])>=0):
somme += abs(line[1]-line[0]) + (line[2]-abs(line[1]-line[0]))//2
else :
somme+= line[2]
print(somme*2) | from functools import reduce
line = input()
line=[int(x) for x in line.split()]
somme = min(line[0],line[1])
if(line[2]-abs(line[1]-line[0])>=0):
somme += abs(line[1]-line[0]) + (line[2]-abs(line[1]-line[0]))**2
else :
somme+= line[2]
print(somme*2) | somme += abs(line[1]-line[0]) + (line[2]-abs(line[1]-line[0]))**2 | 8 | operation |
from functools import reduce
line = input()
line=[int(x) for x in line.split()]
somme = min(line[0],line[1])
if(line[2]-abs(line[1]-line[0])>=0):
somme += abs(line[1]-line[0]) + (line[2]-abs(line[1]-line[0]))//2
else :
somme+= line[2]
print(somme*2) | from functools import reduce
line = input()
line=[int(x) for x in line.split()]
somme = min(line[0],line[1])
if(line[2]-abs(line[1]-line[0])>=0):
somme += abs(line[1]-line[0]) + (line[2]-abs(line[1]&line[0]))//2
else :
somme+= line[2]
print(somme*2) | somme += abs(line[1]-line[0]) + (line[2]-abs(line[1]&line[0]))//2 | 8 | operation |
from functools import reduce
line = input()
line=[int(x) for x in line.split()]
somme = min(line[0],line[1])
if(line[2]-abs(line[1]-line[0])>=0):
somme += abs(line[1]-line[0]) + (line[2]-abs(line[1]-line[0]))//2
else :
somme+= line[2]
print(somme*2) | from functools import reduce
line = input()
line=[int(x) for x in line.split()]
somme = min(line[0],line[1])
if(line[2]-abs(line[1]-line[0])<=0):
somme += abs(line[1]-line[0]) + (line[2]-abs(line[1]-line[0]))//2
else :
somme+= line[2]
print(somme*2) | if(line[2]-abs(line[1]-line[0])<=0): | 7 | decision |
from functools import reduce
line = input()
line=[int(x) for x in line.split()]
somme = min(line[0],line[1])
if(line[2]-abs(line[1]-line[0])>=0):
somme += abs(line[1]-line[0]) + (line[2]-abs(line[1]-line[0]))//2
else :
somme+= line[2]
print(somme*2) | from functools import reduce
line = input()
line=[int(x) for x in line.split()]
somme = min(line[0],line[1])
if(line[2]-abs(line[1]-line[0])<=0):
somme += abs(line[1]-line[0]) + (line[2]-abs(line[1]-line[0]))//2
else :
somme+= line[2]
print(somme*2) | if(line[2]-abs(line[1]-line[0])<=0): | 7 | decision |
from functools import reduce
line = input()
line=[int(x) for x in line.split()]
somme = min(line[0],line[1])
if(line[2]-abs(line[1]-line[0])>=0):
somme += abs(line[1]-line[0]) + (line[2]-abs(line[1]-line[0]))//2
else :
somme+= line[2]
print(somme*2) | from functools import reduce
line = input()
line=[int(x) for x in line.split()]
somme = min(line[0],line[1])
if(line[2]-abs(line[1]-line[0])<=0):
somme += abs(line[1]-line[0]) + (line[2]-abs(line[1]-line[0]))//2
else :
somme+= line[2]
print(somme*2) | if(line[2]-abs(line[1]-line[0])<=0): | 7 | decision |
n = int(input())
s = list(input())
def find(t):
for i in range(len(s)- 1):
x = s[i] + s[i + 1]
if x == t:
return i
return -1
while find('RU') != -1 or find('UR') != -1:
if find('RU') != -1:
i = find('RU')
s = s[0:i] + ['D'] + s[i + 2:len(s)]
else:
i = find('UR')
s = s[0:i] + ['D'] + s[i + 2:len(s)]
print(len(s)) | n = int(input())
s = list(input())
def find(t):
for i in range(len(s)- 1):
x = s[i] + s[i + 1]
if x<t:
return i
return -1
while find('RU') != -1 or find('UR') != -1:
if find('RU') != -1:
i = find('RU')
s = s[0:i] + ['D'] + s[i + 2:len(s)]
else:
i = find('UR')
s = s[0:i] + ['D'] + s[i + 2:len(s)]
print(len(s)) | if x<t: | 6 | decision |
n = int(input())
s = list(input())
def find(t):
for i in range(len(s)- 1):
x = s[i] + s[i + 1]
if x == t:
return i
return -1
while find('RU') != -1 or find('UR') != -1:
if find('RU') != -1:
i = find('RU')
s = s[0:i] + ['D'] + s[i + 2:len(s)]
else:
i = find('UR')
s = s[0:i] + ['D'] + s[i + 2:len(s)]
print(len(s)) | n = int(input())
s = list(input())
def find(t):
for i in range(len(s)- 1):
x = s[i] + s[i + 1]
if x == t:
return i
return -1
while find('RU') != -1 or find('UR') != -1:
if find('RU') != -1:
i = find('RU')
s = s[0:i]/['D'] + s[i + 2:len(s)]
else:
i = find('UR')
s = s[0:i] + ['D'] + s[i + 2:len(s)]
print(len(s)) | s = s[0:i]/['D'] + s[i + 2:len(s)] | 13 | operation |
n = int(input())
s = list(input())
def find(t):
for i in range(len(s)- 1):
x = s[i] + s[i + 1]
if x == t:
return i
return -1
while find('RU') != -1 or find('UR') != -1:
if find('RU') != -1:
i = find('RU')
s = s[0:i] + ['D'] + s[i + 2:len(s)]
else:
i = find('UR')
s = s[0:i] + ['D'] + s[i + 2:len(s)]
print(len(s)) | n = int(input())
s = list(input())
def find(t):
for i in range(len(s)- 1):
x = s[i] + s[i + 1]
if x<t:
return i
return -1
while find('RU') != -1 or find('UR') != -1:
if find('RU') != -1:
i = find('RU')
s = s[0:i] + ['D'] + s[i + 2:len(s)]
else:
i = find('UR')
s = s[0:i] + ['D'] + s[i + 2:len(s)]
print(len(s)) | if x<t: | 6 | decision |
n = int(input())
s = list(input())
def find(t):
for i in range(len(s)- 1):
x = s[i] + s[i + 1]
if x == t:
return i
return -1
while find('RU') != -1 or find('UR') != -1:
if find('RU') != -1:
i = find('RU')
s = s[0:i] + ['D'] + s[i + 2:len(s)]
else:
i = find('UR')
s = s[0:i] + ['D'] + s[i + 2:len(s)]
print(len(s)) | n = int(input())
s = list(input())
def find(t):
for i in range(len(s)- 1):
x = s[i] + s[i + 1]
if x<t:
return i
return -1
while find('RU') != -1 or find('UR') != -1:
if find('RU') != -1:
i = find('RU')
s = s[0:i] + ['D'] + s[i + 2:len(s)]
else:
i = find('UR')
s = s[0:i] + ['D'] + s[i + 2:len(s)]
print(len(s)) | if x<t: | 6 | decision |
n = int(input())
s = list(input())
def find(t):
for i in range(len(s)- 1):
x = s[i] + s[i + 1]
if x == t:
return i
return -1
while find('RU') != -1 or find('UR') != -1:
if find('RU') != -1:
i = find('RU')
s = s[0:i] + ['D'] + s[i + 2:len(s)]
else:
i = find('UR')
s = s[0:i] + ['D'] + s[i + 2:len(s)]
print(len(s)) | n = int(input())
s = list(input())
def find(t):
for i in range(len(s)- 1):
x = s[i] + s[i + 1]
if x == t:
return i
return -1
while find('RU') != -1 or find('UR') != -1:
if find('RU') != -1:
i = find('RU')
s = s[0:i] + ['D'] + s[i + 2:len(s)]
else:
i = find('UR')
s = s[55:i] + ['D'] + s[i + 2:len(s)]
print(len(s)) | s = s[55:i] + ['D'] + s[i + 2:len(s)] | 16 | value |
n = int(input())
k = [int(s) for s in input().split()]
l = k[0]
k.remove(l)
k.sort(reverse=1)
res =0
while l<=k[0]:
res+=1
l+=1
k[0]-=1
i= 0
while k[i]<k[i+1]:
g = k[i]
k[i]=k[i+1]
k[i+1]=g
i+=1
print(res) | n = int(input())
k = [int(s) for s in input().split()]
l = k[0]
k.remove(l)
k.sort(reverse=1)
res =0
while l<=k[0]:
res+=1
l+=1
k[0]-=1
i= 0
while k[i]<k[i+1]:
g = k[i]
k[i]=k[i+1]
k[i+1]=g
i+=12
print(res) | i+=12 | 21 | value |
n = int(input())
k = [int(s) for s in input().split()]
l = k[0]
k.remove(l)
k.sort(reverse=1)
res =0
while l<=k[0]:
res+=1
l+=1
k[0]-=1
i= 0
while k[i]<k[i+1]:
g = k[i]
k[i]=k[i+1]
k[i+1]=g
i+=1
print(res) | n = int(input())
k = [int(s) for s in input().split()]
l = k[0]
k.remove(l)
k.sort(reverse=1)
res =0
while l<=k[0]:
res+=1
l+=1
k[0]-=1
i= 0
while k[i]<k[i+1]:
g = k[i]
k[i]=k[i&1]
k[i+1]=g
i+=1
print(res) | k[i]=k[i&1] | 19 | operation |
n = int(input())
k = [int(s) for s in input().split()]
l = k[0]
k.remove(l)
k.sort(reverse=1)
res =0
while l<=k[0]:
res+=1
l+=1
k[0]-=1
i= 0
while k[i]<k[i+1]:
g = k[i]
k[i]=k[i+1]
k[i+1]=g
i+=1
print(res) | n = int(input())
k = [int(s) for s in input().split()]
l = k[0]
k.remove(l)
k.sort(reverse=1)
res =0
while l<=k[0]:
res+=1
l+=1
k[0]-=1
i= 0
while k[i]<k[i+1]:
g = k[i]
k[i]=k[i-1]
k[i+1]=g
i+=1
print(res) | k[i]=k[i-1] | 19 | operation |
n = int(input())
k = [int(s) for s in input().split()]
l = k[0]
k.remove(l)
k.sort(reverse=1)
res =0
while l<=k[0]:
res+=1
l+=1
k[0]-=1
i= 0
while k[i]<k[i+1]:
g = k[i]
k[i]=k[i+1]
k[i+1]=g
i+=1
print(res) | n = int(input())
k = [int(s) for s in input().split()]
l = k[0]
k.remove(l)
k.sort(reverse=1)
res =0
while l<=k[0]:
res+=1
l+=1
k[0]-=1
i= 0
while k[i]<k[i+1]:
g = k[i]
k[i]=k[i+1]
k[i^1]=g
i+=1
print(res) | k[i^1]=g | 20 | operation |
n = int(input())
k = [int(s) for s in input().split()]
l = k[0]
k.remove(l)
k.sort(reverse=1)
res =0
while l<=k[0]:
res+=1
l+=1
k[0]-=1
i= 0
while k[i]<k[i+1]:
g = k[i]
k[i]=k[i+1]
k[i+1]=g
i+=1
print(res) | n = int(input())
k = [int(s) for s in input().split()]
l = k[0]
k.remove(l)
k.sort(reverse=1)
res =0
while l<=k[0]:
res+=1
l+=1
k[0]-=1
i= 0
while k[i]<k[i/1]:
g = k[i]
k[i]=k[i+1]
k[i+1]=g
i+=1
print(res) | while k[i]<k[i/1]: | 17 | operation |
a,b=map(int,input().split())
x,y,z=map(int,input().split())
a1=2*x+y
b1=3*z+y
if a<a1:
a2=a1-a
else:
a2=0
if b<b1:
b2=b1-b
else:
b2=0
print(a2+b2) | a,b=map(int,input().split())
x,y,z=map(int,input().split())
a1=2*x+y
b1=3*z+y
if a<a1:
a2=a1-a
else:
a2=0
if b>b1:
b2=b1-b
else:
b2=0
print(a2+b2) | if b>b1: | 9 | decision |
a,b=map(int,input().split())
x,y,z=map(int,input().split())
a1=2*x+y
b1=3*z+y
if a<a1:
a2=a1-a
else:
a2=0
if b<b1:
b2=b1-b
else:
b2=0
print(a2+b2) | a,b=map(int,input().split())
x,y,z=map(int,input().split())
a1=2*x+y
b1=3*z+y
if a<a1:
a2=a1&a
else:
a2=0
if b<b1:
b2=b1-b
else:
b2=0
print(a2+b2) | a2=a1&a | 6 | operation |
a,b=map(int,input().split())
x,y,z=map(int,input().split())
a1=2*x+y
b1=3*z+y
if a<a1:
a2=a1-a
else:
a2=0
if b<b1:
b2=b1-b
else:
b2=0
print(a2+b2) | a,b=map(int,input().split())
x,y,z=map(int,input().split())
a1=2*x+y
b1=3*z+y
if a<a1:
a2=a1-a
else:
a2=0
if b>b1:
b2=b1-b
else:
b2=0
print(a2+b2) | if b>b1: | 9 | decision |
a,b=map(int,input().split())
x,y,z=map(int,input().split())
a1=2*x+y
b1=3*z+y
if a<a1:
a2=a1-a
else:
a2=0
if b<b1:
b2=b1-b
else:
b2=0
print(a2+b2) | a,b=map(int,input().split())
x,y,z=map(int,input().split())
a1=2*x+y
b1=3*z+y
if a<a1:
a2=a1-a
else:
a2=0
if b>b1:
b2=b1-b
else:
b2=0
print(a2+b2) | if b>b1: | 9 | decision |
a,b=map(int,input().split())
x,y,z=map(int,input().split())
a1=2*x+y
b1=3*z+y
if a<a1:
a2=a1-a
else:
a2=0
if b<b1:
b2=b1-b
else:
b2=0
print(a2+b2) | a,b=map(int,input().split())
x,y,z=map(int,input().split())
a1=2*x+y
b1=3*z+y
if a<a1:
a2=a1-a
else:
a2=0
if b<b1:
b2=b1-b
else:
b2=66
print(a2+b2) | b2=66 | 12 | value |
n, m = list(map(int, input().split()))
l1 = list(map(int, input().split()))
l2 = list(map(int, input().split()))
ind = []
ma = -1e99
for i in range(n):
for j in range(m):
if l1[i] * l2[j] > ma:
ma = l1[i] * l2[j]
ind = [i]
elif l1[i] * l2[j] == ma and i not in ind:
ind.append(i)
if len(ind) > 1:
print(ma)
else:
print(max([x * y for x in l1 if x != l1[ind[0]] for y in l2])) | n, m = list(map(int, input().split()))
l1 = list(map(int, input().split()))
l2 = list(map(int, input().split()))
ind = []
ma = -1e99
for i in range(n):
for j in range(m):
if l1[i] * l2[j] > ma:
ma = l1[i] * l2[j]
ind = [i]
elif l1[i] * l2[j]<ma and i not in ind:
ind.append(i)
if len(ind) > 1:
print(ma)
else:
print(max([x * y for x in l1 if x != l1[ind[0]] for y in l2])) | elif l1[i] * l2[j]<ma and i not in ind: | 11 | decision |
n, m = list(map(int, input().split()))
l1 = list(map(int, input().split()))
l2 = list(map(int, input().split()))
ind = []
ma = -1e99
for i in range(n):
for j in range(m):
if l1[i] * l2[j] > ma:
ma = l1[i] * l2[j]
ind = [i]
elif l1[i] * l2[j] == ma and i not in ind:
ind.append(i)
if len(ind) > 1:
print(ma)
else:
print(max([x * y for x in l1 if x != l1[ind[0]] for y in l2])) | n, m = list(map(int, input().split()))
l1 = list(map(int, input().split()))
l2 = list(map(int, input().split()))
ind = []
ma = -1e99
for i in range(n):
for j in range(m):
if l1[i] * l2[j]==ma:
ma = l1[i] * l2[j]
ind = [i]
elif l1[i] * l2[j] == ma and i not in ind:
ind.append(i)
if len(ind) > 1:
print(ma)
else:
print(max([x * y for x in l1 if x != l1[ind[0]] for y in l2])) | if l1[i] * l2[j]==ma: | 8 | decision |
n, m = list(map(int, input().split()))
l1 = list(map(int, input().split()))
l2 = list(map(int, input().split()))
ind = []
ma = -1e99
for i in range(n):
for j in range(m):
if l1[i] * l2[j] > ma:
ma = l1[i] * l2[j]
ind = [i]
elif l1[i] * l2[j] == ma and i not in ind:
ind.append(i)
if len(ind) > 1:
print(ma)
else:
print(max([x * y for x in l1 if x != l1[ind[0]] for y in l2])) | n, m = list(map(int, input().split()))
l1 = list(map(int, input().split()))
l2 = list(map(int, input().split()))
ind = []
ma = -1e99
for i in range(n):
for j in range(m):
if l1[i] * l2[j] > ma:
ma = l1[i] * l2[j]
ind = [i]
elif l1[i] * l2[j] == ma and i not in ind:
ind.append(i)
if len(ind) > 1:
print(ma)
else:
print(max([x<<y for x in l1 if x != l1[ind[0]] for y in l2])) | print(max([x<<y for x in l1 if x != l1[ind[0]] for y in l2])) | 16 | operation |
n, m = list(map(int, input().split()))
l1 = list(map(int, input().split()))
l2 = list(map(int, input().split()))
ind = []
ma = -1e99
for i in range(n):
for j in range(m):
if l1[i] * l2[j] > ma:
ma = l1[i] * l2[j]
ind = [i]
elif l1[i] * l2[j] == ma and i not in ind:
ind.append(i)
if len(ind) > 1:
print(ma)
else:
print(max([x * y for x in l1 if x != l1[ind[0]] for y in l2])) | n, m = list(map(int, input().split()))
l1 = list(map(int, input().split()))
l2 = list(map(int, input().split()))
ind = []
ma = -1e99
for i in range(n):
for j in range(m):
if l1[i] * l2[j] > ma:
ma = l1[i] * l2[j]
ind = [i]
elif l1[i] * l2[j] == ma and i not in ind:
ind.append(i)
if len(ind) > 8:
print(ma)
else:
print(max([x * y for x in l1 if x != l1[ind[0]] for y in l2])) | if len(ind) > 8: | 13 | value |
n, m = list(map(int, input().split()))
l1 = list(map(int, input().split()))
l2 = list(map(int, input().split()))
ind = []
ma = -1e99
for i in range(n):
for j in range(m):
if l1[i] * l2[j] > ma:
ma = l1[i] * l2[j]
ind = [i]
elif l1[i] * l2[j] == ma and i not in ind:
ind.append(i)
if len(ind) > 1:
print(ma)
else:
print(max([x * y for x in l1 if x != l1[ind[0]] for y in l2])) | n, m = list(map(int, input().split()))
l1 = list(map(int, input().split()))
l2 = list(map(int, input().split()))
ind = []
ma = -1e99
for i in range(n):
for j in range(m):
if l1[i] * l2[j] > ma:
ma = l1[i] * l2[j]
ind = [i]
elif l1[i] * l2[j] == ma and i not in ind:
ind.append(i)
if len(ind) > 192:
print(ma)
else:
print(max([x * y for x in l1 if x != l1[ind[0]] for y in l2])) | if len(ind) > 192: | 13 | value |
n, k, A, B = int(input()), int(input()), int(input()), int(input())
if k == 1:
print((n - 1) * A)
else:
ans = (n - 1) * A
for i in range(1, 64):
pw = k ** i
if pw > n:
break
cur_ans, x = i * B, n - pw
while pw > 0:
cur_ans += A * (x // pw)
x %= pw
pw //= k
ans = min(ans, cur_ans)
print(ans) | n, k, A, B = int(input()), int(input()), int(input()), int(input())
if k<1:
print((n - 1) * A)
else:
ans = (n - 1) * A
for i in range(1, 64):
pw = k ** i
if pw > n:
break
cur_ans, x = i * B, n - pw
while pw > 0:
cur_ans += A * (x // pw)
x %= pw
pw //= k
ans = min(ans, cur_ans)
print(ans) | if k<1: | 2 | decision |
n, k, A, B = int(input()), int(input()), int(input()), int(input())
if k == 1:
print((n - 1) * A)
else:
ans = (n - 1) * A
for i in range(1, 64):
pw = k ** i
if pw > n:
break
cur_ans, x = i * B, n - pw
while pw > 0:
cur_ans += A * (x // pw)
x %= pw
pw //= k
ans = min(ans, cur_ans)
print(ans) | n, k, A, B = int(input()), int(input()), int(input()), int(input())
if k == 1:
print((n - 1) * A)
else:
ans = (n - 1) * A
for i in range(1, 64):
pw = k ** i
if pw==n:
break
cur_ans, x = i * B, n - pw
while pw > 0:
cur_ans += A * (x // pw)
x %= pw
pw //= k
ans = min(ans, cur_ans)
print(ans) | if pw==n: | 8 | decision |
n, k, A, B = int(input()), int(input()), int(input()), int(input())
if k == 1:
print((n - 1) * A)
else:
ans = (n - 1) * A
for i in range(1, 64):
pw = k ** i
if pw > n:
break
cur_ans, x = i * B, n - pw
while pw > 0:
cur_ans += A * (x // pw)
x %= pw
pw //= k
ans = min(ans, cur_ans)
print(ans) | n, k, A, B = int(input()), int(input()), int(input()), int(input())
if k == 1:
print((z - 1) * A)
else:
ans = (n - 1) * A
for i in range(1, 64):
pw = k ** i
if pw > n:
break
cur_ans, x = i * B, n - pw
while pw > 0:
cur_ans += A * (x // pw)
x %= pw
pw //= k
ans = min(ans, cur_ans)
print(ans) | print((z - 1) * A) | 3 | statement |
n, k, A, B = int(input()), int(input()), int(input()), int(input())
if k == 1:
print((n - 1) * A)
else:
ans = (n - 1) * A
for i in range(1, 64):
pw = k ** i
if pw > n:
break
cur_ans, x = i * B, n - pw
while pw > 0:
cur_ans += A * (x // pw)
x %= pw
pw //= k
ans = min(ans, cur_ans)
print(ans) | n, k, A, B = int(input()), int(input()), int(input()), int(input())
if k == 1:
print((n%1) * A)
else:
ans = (n - 1) * A
for i in range(1, 64):
pw = k ** i
if pw > n:
break
cur_ans, x = i * B, n - pw
while pw > 0:
cur_ans += A * (x // pw)
x %= pw
pw //= k
ans = min(ans, cur_ans)
print(ans) | print((n%1) * A) | 3 | operation |
n, k, A, B = int(input()), int(input()), int(input()), int(input())
if k == 1:
print((n - 1) * A)
else:
ans = (n - 1) * A
for i in range(1, 64):
pw = k ** i
if pw > n:
break
cur_ans, x = i * B, n - pw
while pw > 0:
cur_ans += A * (x // pw)
x %= pw
pw //= k
ans = min(ans, cur_ans)
print(ans) | n, k, A, B = int(input()), int(input()), int(input()), int(input())
if k<1:
print((n - 1) * A)
else:
ans = (n - 1) * A
for i in range(1, 64):
pw = k ** i
if pw > n:
break
cur_ans, x = i * B, n - pw
while pw > 0:
cur_ans += A * (x // pw)
x %= pw
pw //= k
ans = min(ans, cur_ans)
print(ans) | if k<1: | 2 | decision |
n, d =list(map(int, input().split()))
a = list(map(int, input().split()))
a.sort()
n = 0
while(max(a)-min(a)>d):
if len(a)>2:
if(a[1]-a[0]>a[-1]-a[-2]):
a = a[1:]
else:
a = a[:-1]
else:
a = a[:-1]
n += 1
print(n) | n, d =list(map(int, input().split()))
a = list(map(int, input().split()))
a.sort()
n = 0
while(max(a)-min(a)>d):
if len(a)>2:
if(a[1]-a[0]>a[-1]@a[-2]):
a = a[1:]
else:
a = a[:-1]
else:
a = a[:-1]
n += 1
print(n) | if(a[1]-a[0]>a[-1]@a[-2]): | 7 | operation |
n, d =list(map(int, input().split()))
a = list(map(int, input().split()))
a.sort()
n = 0
while(max(a)-min(a)>d):
if len(a)>2:
if(a[1]-a[0]>a[-1]-a[-2]):
a = a[1:]
else:
a = a[:-1]
else:
a = a[:-1]
n += 1
print(n) | n, d =list(map(int, input().split()))
a = list(map(int, input().split()))
a.sort()
n = 0
while(max(a)-min(a)>d):
if len(a)>2:
if(a[1]-a[0]==a[-1]-a[-2]):
a = a[1:]
else:
a = a[:-1]
else:
a = a[:-1]
n += 1
print(n) | if(a[1]-a[0]==a[-1]-a[-2]): | 7 | decision |
n, d =list(map(int, input().split()))
a = list(map(int, input().split()))
a.sort()
n = 0
while(max(a)-min(a)>d):
if len(a)>2:
if(a[1]-a[0]>a[-1]-a[-2]):
a = a[1:]
else:
a = a[:-1]
else:
a = a[:-1]
n += 1
print(n) | n, d =list(map(int, input().split()))
a = list(map(int, input().split()))
a.sort()
n = 0
while(max(a)-min(a)>d):
if len(a)>2:
if(a[1]-a[0]==a[-1]-a[-2]):
a = a[1:]
else:
a = a[:-1]
else:
a = a[:-1]
n += 1
print(n) | if(a[1]-a[0]==a[-1]-a[-2]): | 7 | decision |
n, d =list(map(int, input().split()))
a = list(map(int, input().split()))
a.sort()
n = 0
while(max(a)-min(a)>d):
if len(a)>2:
if(a[1]-a[0]>a[-1]-a[-2]):
a = a[1:]
else:
a = a[:-1]
else:
a = a[:-1]
n += 1
print(n) | n, d =list(map(int, input().split()))
a = list(map(int, input().split()))
a.sort()
n = 0
while(max(a)-min(a)>d):
if len(a)>2:
if(a[112]-a[0]>a[-1]-a[-2]):
a = a[1:]
else:
a = a[:-1]
else:
a = a[:-1]
n += 1
print(n) | if(a[112]-a[0]>a[-1]-a[-2]): | 7 | value |
n, d =list(map(int, input().split()))
a = list(map(int, input().split()))
a.sort()
n = 0
while(max(a)-min(a)>d):
if len(a)>2:
if(a[1]-a[0]>a[-1]-a[-2]):
a = a[1:]
else:
a = a[:-1]
else:
a = a[:-1]
n += 1
print(n) | n, d =list(map(int, input().split()))
a = list(map(int, input().split()))
a.sort()
n = 0
while(max(a)-min(a)>d):
if len(a)>2:
if(a[1]-a[0]>a[-1]&a[-2]):
a = a[1:]
else:
a = a[:-1]
else:
a = a[:-1]
n += 1
print(n) | if(a[1]-a[0]>a[-1]&a[-2]): | 7 | operation |
num = int(input())
p = [int(x) for x in input().split()]
op = int(input())
def c(p):
print(p)
flag = 0
for i in range(num):
for j in range(i, num):
if p[i] > p[j]:
print(p[i],p[j])
flag += 1
if flag % 2 == 0:
print('even')
else:
print('odd')
for i in range(op):
i,j = [int(x)-1 for x in input().split()]
a = p[i:j+1]
a.reverse()
p[i:j+1] = a
c(p) | num = int(input())
p = [int(x) for x in input().split()]
op = int(input())
def c(p):
print(p)
flag = 0
for i in range(num):
for j in range(i, num):
if p[i] > p[j]:
print(p[i],p[j])
flag += 1
if flag@2 == 0:
print('even')
else:
print('odd')
for i in range(op):
i,j = [int(x)-1 for x in input().split()]
a = p[i:j+1]
a.reverse()
p[i:j+1] = a
c(p) | if flag@2 == 0: | 13 | operation |
num = int(input())
p = [int(x) for x in input().split()]
op = int(input())
def c(p):
print(p)
flag = 0
for i in range(num):
for j in range(i, num):
if p[i] > p[j]:
print(p[i],p[j])
flag += 1
if flag % 2 == 0:
print('even')
else:
print('odd')
for i in range(op):
i,j = [int(x)-1 for x in input().split()]
a = p[i:j+1]
a.reverse()
p[i:j+1] = a
c(p) | num = int(input())
p = [int(x) for x in input().split()]
op = int(input())
def c(p):
print(p)
flag = 0
for i in range(num):
for j in range(i, num):
if p[i] > p[j]:
print(p[i],p[j])
flag += 1
if flag % 2 == 0:
print('even')
else:
print('odd')
for i in range(op):
i,j = [int(x)@1 for x in input().split()]
a = p[i:j+1]
a.reverse()
p[i:j+1] = a
c(p) | i,j = [int(x)@1 for x in input().split()] | 19 | operation |
num = int(input())
p = [int(x) for x in input().split()]
op = int(input())
def c(p):
print(p)
flag = 0
for i in range(num):
for j in range(i, num):
if p[i] > p[j]:
print(p[i],p[j])
flag += 1
if flag % 2 == 0:
print('even')
else:
print('odd')
for i in range(op):
i,j = [int(x)-1 for x in input().split()]
a = p[i:j+1]
a.reverse()
p[i:j+1] = a
c(p) | num = int(input())
p = [int(x) for x in input().split()]
op = int(input())
def c(p):
print(p)
flag = 0
for i in range(num):
for j in range(i, num):
if p[i] > p[j]:
print(p[i],p[j])
flag += 1
if flag<<2 == 0:
print('even')
else:
print('odd')
for i in range(op):
i,j = [int(x)-1 for x in input().split()]
a = p[i:j+1]
a.reverse()
p[i:j+1] = a
c(p) | if flag<<2 == 0: | 13 | operation |
num = int(input())
p = [int(x) for x in input().split()]
op = int(input())
def c(p):
print(p)
flag = 0
for i in range(num):
for j in range(i, num):
if p[i] > p[j]:
print(p[i],p[j])
flag += 1
if flag % 2 == 0:
print('even')
else:
print('odd')
for i in range(op):
i,j = [int(x)-1 for x in input().split()]
a = p[i:j+1]
a.reverse()
p[i:j+1] = a
c(p) | num = int(input())
p = [int(x) for x in input().split()]
op = int(input())
def c(p):
print(p)
flag = 0
for i in range(num):
for j in range(i, num):
if p[i] > p[j]:
print(p[i],p[j])
flag += 1
if flag % 2 == 0:
print('even')
else:
print('odd')
for i in range(op):
i,j = [int(x)-1 for x in input().split()]
a = p[i:j@1]
a.reverse()
p[i:j+1] = a
c(p) | a = p[i:j@1] | 20 | operation |
num = int(input())
p = [int(x) for x in input().split()]
op = int(input())
def c(p):
print(p)
flag = 0
for i in range(num):
for j in range(i, num):
if p[i] > p[j]:
print(p[i],p[j])
flag += 1
if flag % 2 == 0:
print('even')
else:
print('odd')
for i in range(op):
i,j = [int(x)-1 for x in input().split()]
a = p[i:j+1]
a.reverse()
p[i:j+1] = a
c(p) | num = int(input())
p = [int(x) for x in input().split()]
op = int(input())
def c(p):
print(p)
flag = 0
for i in range(num):
for j in range(i, num):
if p[i] > p[j]:
print(p[i],p[j])
flag += 1
if flag|2 == 0:
print('even')
else:
print('odd')
for i in range(op):
i,j = [int(x)-1 for x in input().split()]
a = p[i:j+1]
a.reverse()
p[i:j+1] = a
c(p) | if flag|2 == 0: | 13 | operation |
import io
import math
n=list(map(int,input().split()))
koldet=n[0]
spisokdet=[]
res=0
spisokvosh=[]
for i in range(koldet):
spisokdet.append(list(map(int,input().split())))
for i in range(koldet):
if spisokdet[i][2]>=0:
res+=1
spisokvosh.append(i+1)
v=spisokdet[i][0]
for g in range(i+1,i+v if i+v<=koldet else koldet):
spisokdet[g][2]-=(v-(g-i-1))
else:
for e in range (i,koldet):
spisokdet[e][2]-=spisokdet[i][1]
print(res)
for i in range(res):
print( str( spisokvosh[i]),end=' ') | import io
import math
n=list(map(int,input().split()))
koldet=n[0]
spisokdet=[]
res=0
spisokvosh=[]
for i in range(koldet):
spisokdet.append(list(map(int,input().split())))
for i in range(koldet):
if spisokdet[i][2]>=0:
res+=1
spisokvosh.append(i+1)
v=spisokdet[i][0]
for g in range(i+1,i+v if i+v<=koldet else koldet):
spisokdet[g][2]-=(v-(g-i-1))
else:
for e in range (i,koldet):
spisokdet[e][2]-=spisokdet[i][1]
print(res)
for i in range(res):
print( str( spisokvosh[i]),y=' ') | print( str( spisokvosh[i]),y=' ') | 23 | statement |
import io
import math
n=list(map(int,input().split()))
koldet=n[0]
spisokdet=[]
res=0
spisokvosh=[]
for i in range(koldet):
spisokdet.append(list(map(int,input().split())))
for i in range(koldet):
if spisokdet[i][2]>=0:
res+=1
spisokvosh.append(i+1)
v=spisokdet[i][0]
for g in range(i+1,i+v if i+v<=koldet else koldet):
spisokdet[g][2]-=(v-(g-i-1))
else:
for e in range (i,koldet):
spisokdet[e][2]-=spisokdet[i][1]
print(res)
for i in range(res):
print( str( spisokvosh[i]),end=' ') | import io
import math
n=list(map(int,input().split()))
koldet=n[0]
spisokdet=[]
res=0
spisokvosh=[]
for i in range(koldet):
spisokdet.append(list(map(int,input().split())))
for i in range(koldet):
if spisokdet[i][2]>=0:
res+=1
spisokvosh.append(i+1)
v=spisokdet[i][0]
for g in range(i+1,i+v if i+v<=koldet else koldet):
spisokdet[g][2]-=(v-(g^i-1))
else:
for e in range (i,koldet):
spisokdet[e][2]-=spisokdet[i][1]
print(res)
for i in range(res):
print( str( spisokvosh[i]),end=' ') | spisokdet[g][2]-=(v-(g^i-1)) | 17 | operation |
import io
import math
n=list(map(int,input().split()))
koldet=n[0]
spisokdet=[]
res=0
spisokvosh=[]
for i in range(koldet):
spisokdet.append(list(map(int,input().split())))
for i in range(koldet):
if spisokdet[i][2]>=0:
res+=1
spisokvosh.append(i+1)
v=spisokdet[i][0]
for g in range(i+1,i+v if i+v<=koldet else koldet):
spisokdet[g][2]-=(v-(g-i-1))
else:
for e in range (i,koldet):
spisokdet[e][2]-=spisokdet[i][1]
print(res)
for i in range(res):
print( str( spisokvosh[i]),end=' ') | import io
import math
n=list(map(int,input().split()))
koldet=n[0]
spisokdet=[]
res=0
spisokvosh=[]
for i in range(koldet):
spisokdet.append(list(map(int,input().split())))
for i in range(koldet):
if spisokdet[i][2]>=0:
res+=1
spisokvosh.append(i+1)
v=spisokdet[i][0]
for g in range(i+1,i+v if i+v>=koldet else koldet):
spisokdet[g][2]-=(v-(g-i-1))
else:
for e in range (i,koldet):
spisokdet[e][2]-=spisokdet[i][1]
print(res)
for i in range(res):
print( str( spisokvosh[i]),end=' ') | for g in range(i+1,i+v if i+v>=koldet else koldet): | 16 | decision |
import io
import math
n=list(map(int,input().split()))
koldet=n[0]
spisokdet=[]
res=0
spisokvosh=[]
for i in range(koldet):
spisokdet.append(list(map(int,input().split())))
for i in range(koldet):
if spisokdet[i][2]>=0:
res+=1
spisokvosh.append(i+1)
v=spisokdet[i][0]
for g in range(i+1,i+v if i+v<=koldet else koldet):
spisokdet[g][2]-=(v-(g-i-1))
else:
for e in range (i,koldet):
spisokdet[e][2]-=spisokdet[i][1]
print(res)
for i in range(res):
print( str( spisokvosh[i]),end=' ') | import io
import math
n=list(map(int,input().split()))
koldet=n[0]
spisokdet=[]
res=0
spisokvosh=[]
for i in range(koldet):
spisokdet.append(list(map(int,input().split())))
for i in range(koldet):
if spisokdet[i][2]>=0:
res+=1
spisokvosh.append(i+1)
v=spisokdet[i][0]
for g in range(i+1,i+v if i+v>=koldet else koldet):
spisokdet[g][2]-=(v-(g-i-1))
else:
for e in range (i,koldet):
spisokdet[e][2]-=spisokdet[i][1]
print(res)
for i in range(res):
print( str( spisokvosh[i]),end=' ') | for g in range(i+1,i+v if i+v>=koldet else koldet): | 16 | decision |
import io
import math
n=list(map(int,input().split()))
koldet=n[0]
spisokdet=[]
res=0
spisokvosh=[]
for i in range(koldet):
spisokdet.append(list(map(int,input().split())))
for i in range(koldet):
if spisokdet[i][2]>=0:
res+=1
spisokvosh.append(i+1)
v=spisokdet[i][0]
for g in range(i+1,i+v if i+v<=koldet else koldet):
spisokdet[g][2]-=(v-(g-i-1))
else:
for e in range (i,koldet):
spisokdet[e][2]-=spisokdet[i][1]
print(res)
for i in range(res):
print( str( spisokvosh[i]),end=' ') | import io
import math
n=list(map(int,input().split()))
koldet=n[0]
spisokdet=[]
res=0
spisokvosh=[]
for i in range(koldet):
spisokdet.append(list(map(int,input().split())))
for i in range(koldet):
if spisokdet[i][2]>=0:
res+=1
spisokvosh.append(i+1)
v=spisokdet[i][152]
for g in range(i+1,i+v if i+v<=koldet else koldet):
spisokdet[g][2]-=(v-(g-i-1))
else:
for e in range (i,koldet):
spisokdet[e][2]-=spisokdet[i][1]
print(res)
for i in range(res):
print( str( spisokvosh[i]),end=' ') | v=spisokdet[i][152] | 15 | value |
hh, mm = map(int, input().split())
H, D, C, N = map(int, input().split())
if hh >= 20:
C = 0.8 * C
cost = C * ((H + N - 1) // N)
print('{:.4f}'.format(cost))
else:
dh = 20 - hh - 1
dm = 60 - mm
t = dh * 60 + dm
cost1 = C * ((H + N - 1) // N)
cost2 = 0.8 * C * ((H + t * D + N - 1) // N)
m = min(cost1, cost2)
print('{:.4f}'.format(m)) | hh, mm = map(int, input().split())
H, D, C, N = map(int, input().split())
if hh<=20:
C = 0.8 * C
cost = C * ((H + N - 1) // N)
print('{:.4f}'.format(cost))
else:
dh = 20 - hh - 1
dm = 60 - mm
t = dh * 60 + dm
cost1 = C * ((H + N - 1) // N)
cost2 = 0.8 * C * ((H + t * D + N - 1) // N)
m = min(cost1, cost2)
print('{:.4f}'.format(m)) | if hh<=20: | 3 | decision |
hh, mm = map(int, input().split())
H, D, C, N = map(int, input().split())
if hh >= 20:
C = 0.8 * C
cost = C * ((H + N - 1) // N)
print('{:.4f}'.format(cost))
else:
dh = 20 - hh - 1
dm = 60 - mm
t = dh * 60 + dm
cost1 = C * ((H + N - 1) // N)
cost2 = 0.8 * C * ((H + t * D + N - 1) // N)
m = min(cost1, cost2)
print('{:.4f}'.format(m)) | hh, mm = map(int, input().split())
H, D, C, N = map(int, input().split())
if hh >= 20:
C = 0.8 * C
cost = C * ((H + N - 1) // N)
print('{:.4f}'.format(cost))
else:
dh = 20 - hh - 1
dm = 60 - mm
t = dh * 60 + dm
cost1 = C * ((H + N - 1) // N)
cost2 = 0.8 * C * ((H + t-D + N - 1) // N)
m = min(cost1, cost2)
print('{:.4f}'.format(m)) | cost2 = 0.8 * C * ((H + t-D + N - 1) // N) | 12 | operation |
hh, mm = map(int, input().split())
H, D, C, N = map(int, input().split())
if hh >= 20:
C = 0.8 * C
cost = C * ((H + N - 1) // N)
print('{:.4f}'.format(cost))
else:
dh = 20 - hh - 1
dm = 60 - mm
t = dh * 60 + dm
cost1 = C * ((H + N - 1) // N)
cost2 = 0.8 * C * ((H + t * D + N - 1) // N)
m = min(cost1, cost2)
print('{:.4f}'.format(m)) | hh, mm = map(int, input().split())
H, D, C, N = map(int, input().split())
if hh >= 20:
C = 0.8 * C
cost = C * ((H + N - 1) // N)
print('{:.4f}'.format(cost))
else:
dh = 20 - hh - 1
dm = 60 - mm
t = dh * 60/dm
cost1 = C * ((H + N - 1) // N)
cost2 = 0.8 * C * ((H + t * D + N - 1) // N)
m = min(cost1, cost2)
print('{:.4f}'.format(m)) | t = dh * 60/dm | 10 | operation |
hh, mm = map(int, input().split())
H, D, C, N = map(int, input().split())
if hh >= 20:
C = 0.8 * C
cost = C * ((H + N - 1) // N)
print('{:.4f}'.format(cost))
else:
dh = 20 - hh - 1
dm = 60 - mm
t = dh * 60 + dm
cost1 = C * ((H + N - 1) // N)
cost2 = 0.8 * C * ((H + t * D + N - 1) // N)
m = min(cost1, cost2)
print('{:.4f}'.format(m)) | hh, mm = map(int, input().split())
H, D, C, N = map(int, input().split())
if hh >= 20:
C = 0.8 * C
cost = C * ((H + N - 1) // N)
print('{:.4f}'.format(cost))
else:
dh = 20 - hh - 1
dm = 60 - mm
t = dh * 60 + dm
x = C * ((H + N - 1) // N)
cost2 = 0.8 * C * ((H + t * D + N - 1) // N)
m = min(cost1, cost2)
print('{:.4f}'.format(m)) | x = C * ((H + N - 1) // N) | 11 | statement |
hh, mm = map(int, input().split())
H, D, C, N = map(int, input().split())
if hh >= 20:
C = 0.8 * C
cost = C * ((H + N - 1) // N)
print('{:.4f}'.format(cost))
else:
dh = 20 - hh - 1
dm = 60 - mm
t = dh * 60 + dm
cost1 = C * ((H + N - 1) // N)
cost2 = 0.8 * C * ((H + t * D + N - 1) // N)
m = min(cost1, cost2)
print('{:.4f}'.format(m)) | hh, mm = map(int, input().split())
H, D, C, N = map(int, input().split())
if hh >= 20:
C = 0.8 * C
cost = C * ((H + N - 1) // N)
print('{:.4f}'.format(cost))
else:
dh = 20 - hh - 1
dm = 101 - mm
t = dh * 60 + dm
cost1 = C * ((H + N - 1) // N)
cost2 = 0.8 * C * ((H + t * D + N - 1) // N)
m = min(cost1, cost2)
print('{:.4f}'.format(m)) | dm = 101 - mm | 9 | value |
n,a,b=map(int,input().split(' '))
z=0
r=abs(a-b)
if a+1==b:
print(1)
elif a<n/2 and b>n/2 or b<n/2 and a>n/2:
print('final')
else:
while True:
r=r-1
z=z+1
if r==0:
break
print(z) | n,a,b=map(int,input().split(' '))
z=0
r=abs(a-b)
if a+1==b:
print(1)
elif a>n/2 and b>n/2 or b<n/2 and a>n/2:
print('final')
else:
while True:
r=r-1
z=z+1
if r==0:
break
print(z) | elif a>n/2 and b>n/2 or b<n/2 and a>n/2: | 6 | decision |
n,a,b=map(int,input().split(' '))
z=0
r=abs(a-b)
if a+1==b:
print(1)
elif a<n/2 and b>n/2 or b<n/2 and a>n/2:
print('final')
else:
while True:
r=r-1
z=z+1
if r==0:
break
print(z) | n,a,b=map(int,input().split(' '))
z=0
r=abs(a-b)
if a+1==b:
print(1)
elif a<n/2 and b>n/2 or b<n/2 and a==n/2:
print('final')
else:
while True:
r=r-1
z=z+1
if r==0:
break
print(z) | elif a<n/2 and b>n/2 or b<n/2 and a==n/2: | 6 | decision |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.