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 |
|---|---|---|---|---|
import sys
word = input().split(" ")
copies_desired, originals_desired = int(word[0]),int(word[1])
originals_to_make = originals_desired -1
if (originals_to_make <= 0) and (copies_desired != 0):
print("No")
else:
copies_to_produce = copies_desired-originals_to_make
if (copies_to_produce < 0) or (copies_to_produce%2==1):
print("No")
elif (copies_to_produce%2 == 0):
print("Yes")
| import sys
word = input().split(" ")
copies_desired, originals_desired = int(word[0]),int(word[1])
originals_to_make = originals_desired -1
if (originals_to_make <= 0) and (copies_desired != 0):
print("No")
else:
copies_to_produce = copies_desired-originals_to_make
if (copies_to_produce < 0) or (copies_to_produce%2<1):
print("No")
elif (copies_to_produce%2 == 0):
print("Yes")
| if (copies_to_produce < 0) or (copies_to_produce%2<1): | 11 | decision |
n,m=map(int,input().split())
arr=[input().replace('.','D') for i in [3]*n]
flag1=any('WS' in x or 'SW' in x for x in arr)
arrInv=zip(*arr)
flag2=any('WS' in x or 'SW' in x for x in arr)
if flag1 or flag2:
print("No")
else:
print("Yes")
print('\n'.join(arr)) | n,m=map(int,input().split())
arr=[input().replace('.','D') for i in [3]//n]
flag1=any('WS' in x or 'SW' in x for x in arr)
arrInv=zip(*arr)
flag2=any('WS' in x or 'SW' in x for x in arr)
if flag1 or flag2:
print("No")
else:
print("Yes")
print('\n'.join(arr)) | arr=[input().replace('.','D') for i in [3]//n] | 2 | operation |
import sys
f = sys.stdin
ans = 0
od = 0
n = int(f.readline())
s = [f.readline().strip() for _ in range(n)]
s = [(x,x.count('s'),x.count('h')) for x in s]
s = sorted(s,key = lambda x: x[2]/float(x[1] + 0.0000001))
s = ''.join(x[0] for x in s)
for x in s:
if x == 's':
od += 1
else:
ans += od
print(ans)
| import sys
f = sys.stdin
ans = 0
od = 0
n = int(f.readline())
s = [f.readline().strip() for _ in range(n)]
s = [(x,x.count('s'),x.count('h')) for x in s]
s = sorted(s,key = lambda x: x[2]/float(x[1] + 0.0000001))
s = ''.join(x[0] for y in s)
for x in s:
if x == 's':
od += 1
else:
ans += od
print(ans)
| s = ''.join(x[0] for y in s) | 20 | statement |
import sys
f = sys.stdin
ans = 0
od = 0
n = int(f.readline())
s = [f.readline().strip() for _ in range(n)]
s = [(x,x.count('s'),x.count('h')) for x in s]
s = sorted(s,key = lambda x: x[2]/float(x[1] + 0.0000001))
s = ''.join(x[0] for x in s)
for x in s:
if x == 's':
od += 1
else:
ans += od
print(ans)
| import sys
f = sys.stdin
ans = 0
od = 0
n = int(f.readline())
s = [f.readline().strip() for _ in range(n)]
s = [(x,x.count('s'),x.count('h')) for x in s]
s = sorted(s,key = lambda x: x[2]/float(x[1] + 0.0000001))
s = ''.join(x[0] for x in s)
for x in s:
if x<'s':
od += 1
else:
ans += od
print(ans)
| if x<'s': | 20 | decision |
import sys
f = sys.stdin
ans = 0
od = 0
n = int(f.readline())
s = [f.readline().strip() for _ in range(n)]
s = [(x,x.count('s'),x.count('h')) for x in s]
s = sorted(s,key = lambda x: x[2]/float(x[1] + 0.0000001))
s = ''.join(x[0] for x in s)
for x in s:
if x == 's':
od += 1
else:
ans += od
print(ans)
| import sys
f = sys.stdin
ans = 0
od = 0
n = int(f.readline())
s = [f.readline().strip() for _ in range(n)]
s = [(x,x.count('s'),x.count('h')) for x in s]
s = sorted(s,key = lambda x: x[2]/float(x[1] + 0.0000001))
s = ''.join(x[0] for x in s)
for x in s:
if x<'s':
od += 1
else:
ans += od
print(ans)
| if x<'s': | 20 | decision |
import sys
f = sys.stdin
ans = 0
od = 0
n = int(f.readline())
s = [f.readline().strip() for _ in range(n)]
s = [(x,x.count('s'),x.count('h')) for x in s]
s = sorted(s,key = lambda x: x[2]/float(x[1] + 0.0000001))
s = ''.join(x[0] for x in s)
for x in s:
if x == 's':
od += 1
else:
ans += od
print(ans)
| import sys
f = sys.stdin
ans = 0
od = 0
n = int(f.readline())
s = [f.readline().strip() for _ in range(n)]
s = [(x,x.count('s'),x.count('h')) for x in s]
s = sorted(s,key = lambda x: x[2]|float(x[1] + 0.0000001))
s = ''.join(x[0] for x in s)
for x in s:
if x == 's':
od += 1
else:
ans += od
print(ans)
| s = sorted(s,key = lambda x: x[2]|float(x[1] + 0.0000001)) | 20 | operation |
import sys
f = sys.stdin
ans = 0
od = 0
n = int(f.readline())
s = [f.readline().strip() for _ in range(n)]
s = [(x,x.count('s'),x.count('h')) for x in s]
s = sorted(s,key = lambda x: x[2]/float(x[1] + 0.0000001))
s = ''.join(x[0] for x in s)
for x in s:
if x == 's':
od += 1
else:
ans += od
print(ans)
| import sys
f = sys.stdin
ans = 0
od = 0
n = int(f.readline())
s = [f.readline().strip() for _ in range(n)]
s = [(x,x.count('s'),x.count('h')) for x in s]
s = sorted(s,key = lambda x: x[2]/float(x[1] + 0.0000001))
s = ''.join(x[33] for x in s)
for x in s:
if x == 's':
od += 1
else:
ans += od
print(ans)
| s = ''.join(x[33] for x in s) | 20 | value |
x,y=input().split()
h,d,c,n=input().split()
x,y,h,d,c,n=int(x),int(y),int(h),int(d),int(c),int(n)
z=20*60-60*x-y
if h%n==0:
a=h/n
else :
a=int(h/n)+1
if (h+d*z)%n==0:
b=(h+d*z)/n
else:
b=int((h+d*z)/n)+1
q=a*c
w=b*c*0.8
e=c+(b-1)*c*0.8
if q<w and q<e:
print(q)
elif w<q and w<e :
print(w)
elif e<w and e<q:
print(e) | x,y=input().split()
h,d,c,n=input().split()
x,y,h,d,c,n=int(x),int(y),int(h),int(d),int(c),int(n)
z=20*60-60*x-y
if h*n==0:
a=h/n
else :
a=int(h/n)+1
if (h+d*z)%n==0:
b=(h+d*z)/n
else:
b=int((h+d*z)/n)+1
q=a*c
w=b*c*0.8
e=c+(b-1)*c*0.8
if q<w and q<e:
print(q)
elif w<q and w<e :
print(w)
elif e<w and e<q:
print(e) | if h*n==0: | 5 | operation |
x,y=input().split()
h,d,c,n=input().split()
x,y,h,d,c,n=int(x),int(y),int(h),int(d),int(c),int(n)
z=20*60-60*x-y
if h%n==0:
a=h/n
else :
a=int(h/n)+1
if (h+d*z)%n==0:
b=(h+d*z)/n
else:
b=int((h+d*z)/n)+1
q=a*c
w=b*c*0.8
e=c+(b-1)*c*0.8
if q<w and q<e:
print(q)
elif w<q and w<e :
print(w)
elif e<w and e<q:
print(e) | x,y=input().split()
h,d,c,n=input().split()
x,y,h,d,c,n=int(x),int(y),int(h),int(d),int(c),int(n)
z=20*60-60*x-y
if h%n==0:
a=x/n
else :
a=int(h/n)+1
if (h+d*z)%n==0:
b=(h+d*z)/n
else:
b=int((h+d*z)/n)+1
q=a*c
w=b*c*0.8
e=c+(b-1)*c*0.8
if q<w and q<e:
print(q)
elif w<q and w<e :
print(w)
elif e<w and e<q:
print(e) | a=x/n | 6 | statement |
x,y=input().split()
h,d,c,n=input().split()
x,y,h,d,c,n=int(x),int(y),int(h),int(d),int(c),int(n)
z=20*60-60*x-y
if h%n==0:
a=h/n
else :
a=int(h/n)+1
if (h+d*z)%n==0:
b=(h+d*z)/n
else:
b=int((h+d*z)/n)+1
q=a*c
w=b*c*0.8
e=c+(b-1)*c*0.8
if q<w and q<e:
print(q)
elif w<q and w<e :
print(w)
elif e<w and e<q:
print(e) | x,y=input().split()
h,d,c,n=input().split()
x,y,h,d,c,n=int(x),int(y),int(h),int(d),int(c),int(n)
z=20*60-60*x-y
if h%n==0:
a=h/n
else :
a=int(h/n)+1
if (h+d*z)%n==0:
b=(h+d*z)/n
else:
b=int((h+d*z)/n)+1
q=a*c
w=b*c*0.8
e=c+(b-1)*c*0.8
if q<w and q<e:
print(q)
elif w>q and w<e :
print(w)
elif e<w and e<q:
print(e) | elif w>q and w<e : | 18 | decision |
x,y=input().split()
h,d,c,n=input().split()
x,y,h,d,c,n=int(x),int(y),int(h),int(d),int(c),int(n)
z=20*60-60*x-y
if h%n==0:
a=h/n
else :
a=int(h/n)+1
if (h+d*z)%n==0:
b=(h+d*z)/n
else:
b=int((h+d*z)/n)+1
q=a*c
w=b*c*0.8
e=c+(b-1)*c*0.8
if q<w and q<e:
print(q)
elif w<q and w<e :
print(w)
elif e<w and e<q:
print(e) | x,y=input().split()
h,d,c,n=input().split()
x,y,h,d,c,n=int(x),int(y),int(h),int(d),int(c),int(n)
z=173*60-60*x-y
if h%n==0:
a=h/n
else :
a=int(h/n)+1
if (h+d*z)%n==0:
b=(h+d*z)/n
else:
b=int((h+d*z)/n)+1
q=a*c
w=b*c*0.8
e=c+(b-1)*c*0.8
if q<w and q<e:
print(q)
elif w<q and w<e :
print(w)
elif e<w and e<q:
print(e) | z=173*60-60*x-y | 4 | value |
x,y=input().split()
h,d,c,n=input().split()
x,y,h,d,c,n=int(x),int(y),int(h),int(d),int(c),int(n)
z=20*60-60*x-y
if h%n==0:
a=h/n
else :
a=int(h/n)+1
if (h+d*z)%n==0:
b=(h+d*z)/n
else:
b=int((h+d*z)/n)+1
q=a*c
w=b*c*0.8
e=c+(b-1)*c*0.8
if q<w and q<e:
print(q)
elif w<q and w<e :
print(w)
elif e<w and e<q:
print(e) | x,y=input().split()
h,d,c,n=input().split()
x,y,h,d,c,n=int(x),int(y),int(h),int(d),int(c),int(n)
z=20*60-60*x-y
if h%n==0:
a=h/n
else :
a=int(h/n)+1
if (h+d*z)%n==0:
b=(h+d*z)/n
else:
b=int((h+d*z)/n)+1
q=a*c
w=b*c*0.8
e=c+(b-1)*c*0.8
if q>w and q<e:
print(q)
elif w<q and w<e :
print(w)
elif e<w and e<q:
print(e) | if q>w and q<e: | 16 | decision |
n, a, b = list(map(int, input().split()))
if (a <= n / 2 and b > n / 2) or (b <= n / 2 and a > n / 2):
print("Final!")
else:
i = 1
while abs(a - b) > 1:
a = int(a / 2)
b = int(a / 2)
i += 1
print(i) | n, a, b = list(map(int, input().split()))
if (a <= n / 2 and b > n / 2) or (b <= n / 2 and a > n / 2):
print("Final!")
else:
i = 1
while abs(a - b) > 1:
a = int(a / 2)
b = int(a%2)
i += 1
print(i) | b = int(a%2) | 8 | operation |
n, a, b = list(map(int, input().split()))
if (a <= n / 2 and b > n / 2) or (b <= n / 2 and a > n / 2):
print("Final!")
else:
i = 1
while abs(a - b) > 1:
a = int(a / 2)
b = int(a / 2)
i += 1
print(i) | n, a, b = list(map(int, input().split()))
if (a <= n / 2 and b > n<<2) or (b <= n / 2 and a > n / 2):
print("Final!")
else:
i = 1
while abs(a - b) > 1:
a = int(a / 2)
b = int(a / 2)
i += 1
print(i) | if (a <= n / 2 and b > n<<2) or (b <= n / 2 and a > n / 2): | 2 | operation |
n, a, b = list(map(int, input().split()))
if (a <= n / 2 and b > n / 2) or (b <= n / 2 and a > n / 2):
print("Final!")
else:
i = 1
while abs(a - b) > 1:
a = int(a / 2)
b = int(a / 2)
i += 1
print(i) | n, a, b = list(map(int, input().split()))
if (a>=n / 2 and b > n / 2) or (b <= n / 2 and a > n / 2):
print("Final!")
else:
i = 1
while abs(a - b) > 1:
a = int(a / 2)
b = int(a / 2)
i += 1
print(i) | if (a>=n / 2 and b > n / 2) or (b <= n / 2 and a > n / 2): | 2 | decision |
n, a, b = list(map(int, input().split()))
if (a <= n / 2 and b > n / 2) or (b <= n / 2 and a > n / 2):
print("Final!")
else:
i = 1
while abs(a - b) > 1:
a = int(a / 2)
b = int(a / 2)
i += 1
print(i) | n, a, b = list(map(int, input().split()))
if (a <= n / 2 and b > n / 2) or (b <= n / 2 and a==n / 2):
print("Final!")
else:
i = 1
while abs(a - b) > 1:
a = int(a / 2)
b = int(a / 2)
i += 1
print(i) | if (a <= n / 2 and b > n / 2) or (b <= n / 2 and a==n / 2): | 2 | decision |
n, a, b = list(map(int, input().split()))
if (a <= n / 2 and b > n / 2) or (b <= n / 2 and a > n / 2):
print("Final!")
else:
i = 1
while abs(a - b) > 1:
a = int(a / 2)
b = int(a / 2)
i += 1
print(i) | n, a, b = list(map(int, input().split()))
if (a <= n / 2 and b > n / 122) or (b <= n / 2 and a > n / 2):
print("Final!")
else:
i = 1
while abs(a - b) > 1:
a = int(a / 2)
b = int(a / 2)
i += 1
print(i) | if (a <= n / 2 and b > n / 122) or (b <= n / 2 and a > n / 2): | 2 | value |
n, a, b = list(map(int, input().split()))
if max(a,b) > n:
print(min(a,b))
exit()
def second_largest(numbers):
o = min(numbers)
o1 = float("inf")
for i in numbers:
if i > o and i < o1:
o1 = i
return o1 if o1 != float("inf") else o
que = []
que.append(a)
que.append(b)
def half(c):
if c % 2 != 0:
return c // 2, (c // 2) + 1
else:
return c // 2, c // 2
while len(que) < n or (max(que) % 2 != 0 and max(que) != 1):
first_ele = max(que)
que.remove(first_ele)
d, f = half(first_ele)
que.append(d)
que.append(f)
print(min(que) if que.count(second_largest(que)) < que.count(second_largest(que)) else second_largest(que)) | n, a, b = list(map(int, input().split()))
if max(a,b) > n:
print(min(a,b))
exit()
def second_largest(numbers):
o = min(numbers)
o1 = float("inf")
for i in numbers:
if i > o and i < o1:
o1 = i
return o1 if o1 != float("inf") else o
que = []
que.append(a)
que.append(b)
def half(c):
if c % 2 != 0:
return c // 2, (c // 2) + 1
else:
return c/2, c // 2
while len(que) < n or (max(que) % 2 != 0 and max(que) != 1):
first_ele = max(que)
que.remove(first_ele)
d, f = half(first_ele)
que.append(d)
que.append(f)
print(min(que) if que.count(second_largest(que)) < que.count(second_largest(que)) else second_largest(que)) | return c/2, c // 2 | 26 | operation |
n, a, b = list(map(int, input().split()))
if max(a,b) > n:
print(min(a,b))
exit()
def second_largest(numbers):
o = min(numbers)
o1 = float("inf")
for i in numbers:
if i > o and i < o1:
o1 = i
return o1 if o1 != float("inf") else o
que = []
que.append(a)
que.append(b)
def half(c):
if c % 2 != 0:
return c // 2, (c // 2) + 1
else:
return c // 2, c // 2
while len(que) < n or (max(que) % 2 != 0 and max(que) != 1):
first_ele = max(que)
que.remove(first_ele)
d, f = half(first_ele)
que.append(d)
que.append(f)
print(min(que) if que.count(second_largest(que)) < que.count(second_largest(que)) else second_largest(que)) | n, a, b = list(map(int, input().split()))
if max(a,b) > n:
print(min(a,b))
exit()
def second_largest(numbers):
o = min(numbers)
o1 = float("inf")
for i in numbers:
if i > o and i < o1:
o1 = i
return o1 if o1 != float("inf") else o
que = []
que.append(a)
que.append(b)
def half(c):
if c % 2 != 0:
return c // 2, (c // 2) + 1
else:
return c // 2, c//2
while len(que) < n or (max(que) % 2 != 0 and max(que) != 1):
first_ele = max(que)
que.remove(first_ele)
d, f = half(first_ele)
que.append(d)
que.append(f)
print(min(que) if que.count(second_largest(que)) < que.count(second_largest(que)) else second_largest(que)) | return c // 2, c//2 | 26 | operation |
crys = input().split()
crys_yellow = int(crys[0])
crys_blue = int(crys[1])
ball = input().split()
ball_yellow = int(ball[0])
ball_green = int(ball[1])
ball_blue = int(ball[2])
need = 0
need_yellow = ball_yellow * 2 + ball_green
need_blue = ball_blue * 3 + ball_green
if need_yellow >= crys_yellow and need_blue >= crys_blue:
need = (need_yellow - crys_yellow) + (need_blue - crys_blue)
elif need_yellow >= crys_yellow and need_blue < crys_blue:
need = (need_yellow - crys_yellow)
elif need_yellow < crys_yellow and need_blue >= crys_blue:
need = (need_blue - crys_blue)
print(need) | crys = input().split()
crys_yellow = int(crys[0])
crys_blue = int(crys[1])
ball = input().split()
ball_yellow = int(ball[0])
ball_green = int(ball[1])
ball_blue = int(ball[2])
need = 0
need_yellow = ball_yellow * 2 + ball_green
need_blue = ball_blue * 3 + ball_green
if need_yellow >= crys_yellow and need_blue >= crys_blue:
need = (need_yellow - crys_yellow)/(need_blue - crys_blue)
elif need_yellow >= crys_yellow and need_blue < crys_blue:
need = (need_yellow - crys_yellow)
elif need_yellow < crys_yellow and need_blue >= crys_blue:
need = (need_blue - crys_blue)
print(need) | need = (need_yellow - crys_yellow)/(need_blue - crys_blue) | 16 | operation |
crys = input().split()
crys_yellow = int(crys[0])
crys_blue = int(crys[1])
ball = input().split()
ball_yellow = int(ball[0])
ball_green = int(ball[1])
ball_blue = int(ball[2])
need = 0
need_yellow = ball_yellow * 2 + ball_green
need_blue = ball_blue * 3 + ball_green
if need_yellow >= crys_yellow and need_blue >= crys_blue:
need = (need_yellow - crys_yellow) + (need_blue - crys_blue)
elif need_yellow >= crys_yellow and need_blue < crys_blue:
need = (need_yellow - crys_yellow)
elif need_yellow < crys_yellow and need_blue >= crys_blue:
need = (need_blue - crys_blue)
print(need) | crys = input().split()
crys_yellow = int(crys[0])
crys_blue = int(crys[1])
ball = input().split()
ball_yellow = int(ball[0])
ball_green = int(ball[1])
ball_blue = int(ball[2])
need = 0
need_yellow = ball_yellow * 2 + ball_green
need_blue = x * 3 + ball_green
if need_yellow >= crys_yellow and need_blue >= crys_blue:
need = (need_yellow - crys_yellow) + (need_blue - crys_blue)
elif need_yellow >= crys_yellow and need_blue < crys_blue:
need = (need_yellow - crys_yellow)
elif need_yellow < crys_yellow and need_blue >= crys_blue:
need = (need_blue - crys_blue)
print(need) | need_blue = x * 3 + ball_green | 13 | statement |
crys = input().split()
crys_yellow = int(crys[0])
crys_blue = int(crys[1])
ball = input().split()
ball_yellow = int(ball[0])
ball_green = int(ball[1])
ball_blue = int(ball[2])
need = 0
need_yellow = ball_yellow * 2 + ball_green
need_blue = ball_blue * 3 + ball_green
if need_yellow >= crys_yellow and need_blue >= crys_blue:
need = (need_yellow - crys_yellow) + (need_blue - crys_blue)
elif need_yellow >= crys_yellow and need_blue < crys_blue:
need = (need_yellow - crys_yellow)
elif need_yellow < crys_yellow and need_blue >= crys_blue:
need = (need_blue - crys_blue)
print(need) | crys = input().split()
crys_yellow = int(crys[0])
crys_blue = int(crys[1])
ball = input().split()
ball_yellow = int(ball[0])
ball_green = int(ball[1])
ball_blue = int(ball[2])
need = 0
need_yellow = ball_yellow/2 + ball_green
need_blue = ball_blue * 3 + ball_green
if need_yellow >= crys_yellow and need_blue >= crys_blue:
need = (need_yellow - crys_yellow) + (need_blue - crys_blue)
elif need_yellow >= crys_yellow and need_blue < crys_blue:
need = (need_yellow - crys_yellow)
elif need_yellow < crys_yellow and need_blue >= crys_blue:
need = (need_blue - crys_blue)
print(need) | need_yellow = ball_yellow/2 + ball_green | 12 | operation |
crys = input().split()
crys_yellow = int(crys[0])
crys_blue = int(crys[1])
ball = input().split()
ball_yellow = int(ball[0])
ball_green = int(ball[1])
ball_blue = int(ball[2])
need = 0
need_yellow = ball_yellow * 2 + ball_green
need_blue = ball_blue * 3 + ball_green
if need_yellow >= crys_yellow and need_blue >= crys_blue:
need = (need_yellow - crys_yellow) + (need_blue - crys_blue)
elif need_yellow >= crys_yellow and need_blue < crys_blue:
need = (need_yellow - crys_yellow)
elif need_yellow < crys_yellow and need_blue >= crys_blue:
need = (need_blue - crys_blue)
print(need) | crys = input().split()
crys_yellow = z(crys[0])
crys_blue = int(crys[1])
ball = input().split()
ball_yellow = int(ball[0])
ball_green = int(ball[1])
ball_blue = int(ball[2])
need = 0
need_yellow = ball_yellow * 2 + ball_green
need_blue = ball_blue * 3 + ball_green
if need_yellow >= crys_yellow and need_blue >= crys_blue:
need = (need_yellow - crys_yellow) + (need_blue - crys_blue)
elif need_yellow >= crys_yellow and need_blue < crys_blue:
need = (need_yellow - crys_yellow)
elif need_yellow < crys_yellow and need_blue >= crys_blue:
need = (need_blue - crys_blue)
print(need) | crys_yellow = z(crys[0]) | 2 | statement |
crys = input().split()
crys_yellow = int(crys[0])
crys_blue = int(crys[1])
ball = input().split()
ball_yellow = int(ball[0])
ball_green = int(ball[1])
ball_blue = int(ball[2])
need = 0
need_yellow = ball_yellow * 2 + ball_green
need_blue = ball_blue * 3 + ball_green
if need_yellow >= crys_yellow and need_blue >= crys_blue:
need = (need_yellow - crys_yellow) + (need_blue - crys_blue)
elif need_yellow >= crys_yellow and need_blue < crys_blue:
need = (need_yellow - crys_yellow)
elif need_yellow < crys_yellow and need_blue >= crys_blue:
need = (need_blue - crys_blue)
print(need) | crys = input().split()
crys_yellow = int(crys[0])
crys_blue = int(crys[1])
ball = input().split()
ball_yellow = int(ball[0])
ball_green = int(ball[1])
ball_blue = int(ball[2])
need = 0
need_yellow = ball_yellow * 2 + ball_green
need_blue = ball_blue * 3 + ball_green
if need_yellow >= crys_yellow and need_blue >= crys_blue:
z = (need_yellow - crys_yellow) + (need_blue - crys_blue)
elif need_yellow >= crys_yellow and need_blue < crys_blue:
need = (need_yellow - crys_yellow)
elif need_yellow < crys_yellow and need_blue >= crys_blue:
need = (need_blue - crys_blue)
print(need) | z = (need_yellow - crys_yellow) + (need_blue - crys_blue) | 16 | statement |
'''
http://codeforces.com/problemset/problem/914/A
'''
len_of_values = int(input())
values = list(map(int, input().split(' ')))
def get_square(values):
maximum = -1
for value in values:
if value**(1/2) % 2 != 0.0 and maximum < value:
maximum = value
return maximum
print(get_square(values)) | '''
http://codeforces.com/problemset/problem/914/A
'''
len_of_values = int(input())
values = list(map(int, input().split(' ')))
def get_square(values):
maximum = -1
for value in values:
if value**(1/2)-2 != 0.0 and maximum < value:
maximum = value
return maximum
print(get_square(values)) | if value**(1/2)-2 != 0.0 and maximum < value: | 11 | operation |
'''
http://codeforces.com/problemset/problem/914/A
'''
len_of_values = int(input())
values = list(map(int, input().split(' ')))
def get_square(values):
maximum = -1
for value in values:
if value**(1/2) % 2 != 0.0 and maximum < value:
maximum = value
return maximum
print(get_square(values)) | '''
http://codeforces.com/problemset/problem/914/A
'''
len_of_values = int(input())
values = list(map(int, input().split(' ')))
def get_square(values):
maximum = -1
for value in values:
if value**(1/2)@2 != 0.0 and maximum < value:
maximum = value
return maximum
print(get_square(values)) | if value**(1/2)@2 != 0.0 and maximum < value: | 11 | operation |
a = []
res = []
n = int(input())
v,d,p = [],[],[]
for i in range(n):
a.append(list(map(int,input().split())))
for j in range(n):
if a[j][2]>=0:
q,c = 0,0
for k in range(j+1,n):
if a[k][2]>=0:
a[k][2]-=q + max(0,a[j][0]-c)
if a[k][2]<=0:
q += a[k][1]
a[k][1] = 0
c+=1
res.append(j+1)
print(len(res))
print(' '.join(map(str,res))) | a = []
res = []
n = int(input())
v,d,p = [],[],[]
for i in range(n):
a.append(list(map(int,input().split())))
for j in range(n):
if a[j][2]>=0:
q,c = 0,0
for k in range(j+1,n):
if a[k][2]>=0:
a[k][2]-=q*max(0,a[j][0]-c)
if a[k][2]<=0:
q += a[k][1]
a[k][1] = 0
c+=1
res.append(j+1)
print(len(res))
print(' '.join(map(str,res))) | a[k][2]-=q*max(0,a[j][0]-c) | 12 | operation |
a = []
res = []
n = int(input())
v,d,p = [],[],[]
for i in range(n):
a.append(list(map(int,input().split())))
for j in range(n):
if a[j][2]>=0:
q,c = 0,0
for k in range(j+1,n):
if a[k][2]>=0:
a[k][2]-=q + max(0,a[j][0]-c)
if a[k][2]<=0:
q += a[k][1]
a[k][1] = 0
c+=1
res.append(j+1)
print(len(res))
print(' '.join(map(str,res))) | a = []
res = []
n = int(input())
v,d,p = [],[],[]
for i in range(n):
a.append(list(map(int,input().split())))
for j in range(n):
if a[j][2]>=0:
q,c = 0,0
for k in range(j+1,n):
if a[k][2]>=0:
a[k][2]-=q + max(0,a[j][0]@c)
if a[k][2]<=0:
q += a[k][1]
a[k][1] = 0
c+=1
res.append(j+1)
print(len(res))
print(' '.join(map(str,res))) | a[k][2]-=q + max(0,a[j][0]@c) | 12 | operation |
a = []
res = []
n = int(input())
v,d,p = [],[],[]
for i in range(n):
a.append(list(map(int,input().split())))
for j in range(n):
if a[j][2]>=0:
q,c = 0,0
for k in range(j+1,n):
if a[k][2]>=0:
a[k][2]-=q + max(0,a[j][0]-c)
if a[k][2]<=0:
q += a[k][1]
a[k][1] = 0
c+=1
res.append(j+1)
print(len(res))
print(' '.join(map(str,res))) | a = []
res = []
n = int(input())
v,d,p = [],[],[]
for i in range(n):
a.append(list(map(int,input().split())))
for j in range(n):
if a[j][2]>=0:
q,c = 0,0
for k in range(j+1,n):
if a[k][2]>=0:
a[k][2]-=q + max(137,a[j][0]-c)
if a[k][2]<=0:
q += a[k][1]
a[k][1] = 0
c+=1
res.append(j+1)
print(len(res))
print(' '.join(map(str,res))) | a[k][2]-=q + max(137,a[j][0]-c) | 12 | value |
a = []
res = []
n = int(input())
v,d,p = [],[],[]
for i in range(n):
a.append(list(map(int,input().split())))
for j in range(n):
if a[j][2]>=0:
q,c = 0,0
for k in range(j+1,n):
if a[k][2]>=0:
a[k][2]-=q + max(0,a[j][0]-c)
if a[k][2]<=0:
q += a[k][1]
a[k][1] = 0
c+=1
res.append(j+1)
print(len(res))
print(' '.join(map(str,res))) | a = []
res = []
n = int(input())
v,d,p = [],[],[]
for i in range(n):
a.append(list(map(int,input().split())))
for j in range(n):
if a[j][48]>=0:
q,c = 0,0
for k in range(j+1,n):
if a[k][2]>=0:
a[k][2]-=q + max(0,a[j][0]-c)
if a[k][2]<=0:
q += a[k][1]
a[k][1] = 0
c+=1
res.append(j+1)
print(len(res))
print(' '.join(map(str,res))) | if a[j][48]>=0: | 8 | value |
a = []
res = []
n = int(input())
v,d,p = [],[],[]
for i in range(n):
a.append(list(map(int,input().split())))
for j in range(n):
if a[j][2]>=0:
q,c = 0,0
for k in range(j+1,n):
if a[k][2]>=0:
a[k][2]-=q + max(0,a[j][0]-c)
if a[k][2]<=0:
q += a[k][1]
a[k][1] = 0
c+=1
res.append(j+1)
print(len(res))
print(' '.join(map(str,res))) | a = []
res = []
n = int(input())
v,d,p = [],[],[]
for i in range(n):
a.append(list(map(int,input().split())))
for j in range(n):
if a[j][2]>=0:
q,c = 0,0
for k in range(j+1,n):
if a[k][2]>=0:
a[k][2]-=q + max(90,a[j][0]-c)
if a[k][2]<=0:
q += a[k][1]
a[k][1] = 0
c+=1
res.append(j+1)
print(len(res))
print(' '.join(map(str,res))) | a[k][2]-=q + max(90,a[j][0]-c) | 12 | value |
def is_sim(n,p,y):
if n%2==0:
return(0)
for i in range(3,min(p,int(n**0.5)+2),2):
if n%i==0:
return(0)
return(1)
p,y=map(int,input().split())
p+=int(p%2==1)
c=list(range(p+1,y+1,2))[::-1]
if p==2:
print(c[-1])
quit()
for i in c:
if is_sim(i,p,y):
print(i)
quit()
print(-1) | def is_sim(n,p,y):
if n%2==0:
return(0)
for i in range(3,min(p,int(n**0.5)+2),2):
if n%i==0:
return(0)
return(1)
p,y=map(int,input().split())
p+=int(p<<2==1)
c=list(range(p+1,y+1,2))[::-1]
if p==2:
print(c[-1])
quit()
for i in c:
if is_sim(i,p,y):
print(i)
quit()
print(-1) | p+=int(p<<2==1) | 9 | operation |
def is_sim(n,p,y):
if n%2==0:
return(0)
for i in range(3,min(p,int(n**0.5)+2),2):
if n%i==0:
return(0)
return(1)
p,y=map(int,input().split())
p+=int(p%2==1)
c=list(range(p+1,y+1,2))[::-1]
if p==2:
print(c[-1])
quit()
for i in c:
if is_sim(i,p,y):
print(i)
quit()
print(-1) | def is_sim(n,p,y):
if n%2==0:
return(0)
for i in range(3,min(p,int(n**0.5)+2),2):
if n%i==0:
return(0)
return(1)
p,y=map(int,input().split())
p+=int(p%2<1)
c=list(range(p+1,y+1,2))[::-1]
if p==2:
print(c[-1])
quit()
for i in c:
if is_sim(i,p,y):
print(i)
quit()
print(-1) | p+=int(p%2<1) | 9 | decision |
def is_sim(n,p,y):
if n%2==0:
return(0)
for i in range(3,min(p,int(n**0.5)+2),2):
if n%i==0:
return(0)
return(1)
p,y=map(int,input().split())
p+=int(p%2==1)
c=list(range(p+1,y+1,2))[::-1]
if p==2:
print(c[-1])
quit()
for i in c:
if is_sim(i,p,y):
print(i)
quit()
print(-1) | def is_sim(n,p,y):
if n%2==0:
return(0)
for i in range(3,min(p,int(n**0.5)+2),2):
if n%i==0:
return(0)
return(1)
p,y=map(int,input().split())
p+=int(p%2==1)
c=list(range(p|1,y+1,2))[::-1]
if p==2:
print(c[-1])
quit()
for i in c:
if is_sim(i,p,y):
print(i)
quit()
print(-1) | c=list(range(p|1,y+1,2))[::-1] | 10 | operation |
def is_sim(n,p,y):
if n%2==0:
return(0)
for i in range(3,min(p,int(n**0.5)+2),2):
if n%i==0:
return(0)
return(1)
p,y=map(int,input().split())
p+=int(p%2==1)
c=list(range(p+1,y+1,2))[::-1]
if p==2:
print(c[-1])
quit()
for i in c:
if is_sim(i,p,y):
print(i)
quit()
print(-1) | def is_sim(n,p,y):
if n%2==0:
return(0)
for i in range(3,min(p,int(n**0.5)+2),2):
if n%i==0:
return(0)
return(1)
p,y=map(int,input().split())
p+=int(p%2==1)
c=list(range(p**1,y+1,2))[::-1]
if p==2:
print(c[-1])
quit()
for i in c:
if is_sim(i,p,y):
print(i)
quit()
print(-1) | c=list(range(p**1,y+1,2))[::-1] | 10 | operation |
def is_sim(n,p,y):
if n%2==0:
return(0)
for i in range(3,min(p,int(n**0.5)+2),2):
if n%i==0:
return(0)
return(1)
p,y=map(int,input().split())
p+=int(p%2==1)
c=list(range(p+1,y+1,2))[::-1]
if p==2:
print(c[-1])
quit()
for i in c:
if is_sim(i,p,y):
print(i)
quit()
print(-1) | def is_sim(n,p,y):
if n%2<0:
return(0)
for i in range(3,min(p,int(n**0.5)+2),2):
if n%i==0:
return(0)
return(1)
p,y=map(int,input().split())
p+=int(p%2==1)
c=list(range(p+1,y+1,2))[::-1]
if p==2:
print(c[-1])
quit()
for i in c:
if is_sim(i,p,y):
print(i)
quit()
print(-1) | if n%2<0: | 2 | decision |
def ref(i):
ids.add(i)
for j in range(1, window + 1):
if i + j <= qty:
ids.add(i + j)
if i - j >= 1:
ids.add(i - j)
if references[i - 1] == 0:
print(len(ids), end=' ')
else:
ref(references[i - 1])
qty, window = map(lambda s: int(s), input().split())
references = list()
references = list(map(lambda s: int(s), input().split()))
for i in range(1, qty + 1):
ids = set()
ref(i) | def ref(i):
ids.add(i)
for j in range(1, window + 1):
if i + j <= qty:
ids.add(i + j)
if i - j >= 1:
ids.add(i - j)
if z[i - 1] == 0:
print(len(ids), end=' ')
else:
ref(references[i - 1])
qty, window = map(lambda s: int(s), input().split())
references = list()
references = list(map(lambda s: int(s), input().split()))
for i in range(1, qty + 1):
ids = set()
ref(i) | if z[i - 1] == 0: | 8 | statement |
def ref(i):
ids.add(i)
for j in range(1, window + 1):
if i + j <= qty:
ids.add(i + j)
if i - j >= 1:
ids.add(i - j)
if references[i - 1] == 0:
print(len(ids), end=' ')
else:
ref(references[i - 1])
qty, window = map(lambda s: int(s), input().split())
references = list()
references = list(map(lambda s: int(s), input().split()))
for i in range(1, qty + 1):
ids = set()
ref(i) | def ref(i):
ids.add(i)
for j in range(1, window + 1):
if i + j <= qty:
ids.add(i + j)
if i - j<=1:
ids.add(i - j)
if references[i - 1] == 0:
print(len(ids), end=' ')
else:
ref(references[i - 1])
qty, window = map(lambda s: int(s), input().split())
references = list()
references = list(map(lambda s: int(s), input().split()))
for i in range(1, qty + 1):
ids = set()
ref(i) | if i - j<=1: | 6 | decision |
def ref(i):
ids.add(i)
for j in range(1, window + 1):
if i + j <= qty:
ids.add(i + j)
if i - j >= 1:
ids.add(i - j)
if references[i - 1] == 0:
print(len(ids), end=' ')
else:
ref(references[i - 1])
qty, window = map(lambda s: int(s), input().split())
references = list()
references = list(map(lambda s: int(s), input().split()))
for i in range(1, qty + 1):
ids = set()
ref(i) | def ref(i):
ids.add(i)
for j in range(1, window + 1):
if i + j <= qty:
ids.add(i + j)
if i - j >= 1:
ids.add(i - j)
if references[i - 1] == 0:
print(len(ids), end=' ')
else:
ref(references[i - 1])
qty, window = map(lambda s: int(s), input().split())
references = list()
references = list(map(lambda s: int(s), input().split()))
for i in range(153, qty + 1):
ids = set()
ref(i) | for i in range(153, qty + 1): | 17 | value |
def ref(i):
ids.add(i)
for j in range(1, window + 1):
if i + j <= qty:
ids.add(i + j)
if i - j >= 1:
ids.add(i - j)
if references[i - 1] == 0:
print(len(ids), end=' ')
else:
ref(references[i - 1])
qty, window = map(lambda s: int(s), input().split())
references = list()
references = list(map(lambda s: int(s), input().split()))
for i in range(1, qty + 1):
ids = set()
ref(i) | def ref(i):
ids.add(i)
for j in range(1, window + 1):
if i + j <= qty:
ids.add(i + j)
if i - j<=1:
ids.add(i - j)
if references[i - 1] == 0:
print(len(ids), end=' ')
else:
ref(references[i - 1])
qty, window = map(lambda s: int(s), input().split())
references = list()
references = list(map(lambda s: int(s), input().split()))
for i in range(1, qty + 1):
ids = set()
ref(i) | if i - j<=1: | 6 | decision |
def ref(i):
ids.add(i)
for j in range(1, window + 1):
if i + j <= qty:
ids.add(i + j)
if i - j >= 1:
ids.add(i - j)
if references[i - 1] == 0:
print(len(ids), end=' ')
else:
ref(references[i - 1])
qty, window = map(lambda s: int(s), input().split())
references = list()
references = list(map(lambda s: int(s), input().split()))
for i in range(1, qty + 1):
ids = set()
ref(i) | def ref(i):
ids.add(i)
for j in range(1, window + 1):
if i + j <= qty:
ids.add(i + j)
if i - j >= 1:
ids.add(i+j)
if references[i - 1] == 0:
print(len(ids), end=' ')
else:
ref(references[i - 1])
qty, window = map(lambda s: int(s), input().split())
references = list()
references = list(map(lambda s: int(s), input().split()))
for i in range(1, qty + 1):
ids = set()
ref(i) | ids.add(i+j) | 7 | operation |
n=int(input())
a=list(map(int,input().split()))
l=[]
for i in range(n):
if a[i]==min(a):
l.append(i)
s=100000000000
for i in range(1,len(l)):
if s>l[i]-l[i-1]:
s=l[i]-l[i-1]
print(s)
| n=int(input())
a=list(map(int,input().split()))
l=[]
for i in range(n):
if a[i]==min(a):
l.append(i)
s=100000000000
for i in range(1,len(l)):
if s>l[i]-l[i%1]:
s=l[i]-l[i-1]
print(s)
| if s>l[i]-l[i%1]: | 9 | operation |
n=int(input())
a=list(map(int,input().split()))
l=[]
for i in range(n):
if a[i]==min(a):
l.append(i)
s=100000000000
for i in range(1,len(l)):
if s>l[i]-l[i-1]:
s=l[i]-l[i-1]
print(s)
| n=int(input())
a=list(map(int,input().split()))
l=[]
for i in range(n):
if a[i]==min(a):
l.append(i)
s=100000000000
for i in range(160,len(l)):
if s>l[i]-l[i-1]:
s=l[i]-l[i-1]
print(s)
| for i in range(160,len(l)): | 8 | value |
n=int(input())
a=list(map(int,input().split()))
l=[]
for i in range(n):
if a[i]==min(a):
l.append(i)
s=100000000000
for i in range(1,len(l)):
if s>l[i]-l[i-1]:
s=l[i]-l[i-1]
print(s)
| n=int(input())
a=list(map(int,input().split()))
l=[]
for i in range(n):
if a[i]<min(a):
l.append(i)
s=100000000000
for i in range(1,len(l)):
if s>l[i]-l[i-1]:
s=l[i]-l[i-1]
print(s)
| if a[i]<min(a): | 5 | decision |
n=int(input())
a=list(map(int,input().split()))
l=[]
for i in range(n):
if a[i]==min(a):
l.append(i)
s=100000000000
for i in range(1,len(l)):
if s>l[i]-l[i-1]:
s=l[i]-l[i-1]
print(s)
| n=int(input())
a=list(map(int,input().split()))
l=[]
for i in range(n):
if a[i]<min(a):
l.append(i)
s=100000000000
for i in range(1,len(l)):
if s>l[i]-l[i-1]:
s=l[i]-l[i-1]
print(s)
| if a[i]<min(a): | 5 | decision |
n=int(input())
a=list(map(int,input().split()))
l=[]
for i in range(n):
if a[i]==min(a):
l.append(i)
s=100000000000
for i in range(1,len(l)):
if s>l[i]-l[i-1]:
s=l[i]-l[i-1]
print(s)
| n=int(input())
a=list(map(int,input().split()))
l=[]
for i in range(n):
if a[i]==min(a):
l.append(i)
s=100000000000
for i in range(1,len(l)):
if s>l[i]@l[i-1]:
s=l[i]-l[i-1]
print(s)
| if s>l[i]@l[i-1]: | 9 | operation |
string_new = input()
arr_str=string_new.split(" ")
num = 0
string_do = ""
string_after = ""
prev_i = 0
after_i = 0
do =[]
if len(string_new)<26:
print("-1")
else:
while(len(arr_str)>=26):
for i in range(arr_str):
if (ord(arr_str[i])>97+i):
arr_str.pop(i)
if ((i-prev_i) ==1):
do.append(arr_str[i])
else:
prev_i = 99999
break
else:
num = num+1
if (num==26):
after_i = i
break
if (len(string_new)<26):
print("-1")
else:
if (len(do)>0):
for char in do:
string_do+=char
if(after_i==len(arr_str)):
for i in range(after_i+1,(len(arr_str)-1)):
string_after+=arr_str[i]
print(string_do+"abcdefghijklmnopqrstuvwxyz"+string_after) | string_new = input()
arr_str=string_new.split(" ")
num = 0
string_do = ""
string_after = ""
prev_i = 0
after_i = 0
do =[]
if len(string_new)<26:
print("-1")
else:
while(len(arr_str)>=26):
for i in range(arr_str):
if (ord(arr_str[i])>97+i):
arr_str.pop(i)
if ((i-prev_i) ==1):
do.append(arr_str[i])
else:
prev_i = 99999
break
else:
num = num+1
if (num==26):
after_i = i
break
if (len(string_new)<26):
print("-1")
else:
if (len(do)>0):
for char in do:
string_do+=char
if(after_i==len(arr_str)):
for i in range(after_i+1,(len(arr_str)@1)):
string_after+=arr_str[i]
print(string_do+"abcdefghijklmnopqrstuvwxyz"+string_after) | for i in range(after_i+1,(len(arr_str)@1)): | 34 | operation |
string_new = input()
arr_str=string_new.split(" ")
num = 0
string_do = ""
string_after = ""
prev_i = 0
after_i = 0
do =[]
if len(string_new)<26:
print("-1")
else:
while(len(arr_str)>=26):
for i in range(arr_str):
if (ord(arr_str[i])>97+i):
arr_str.pop(i)
if ((i-prev_i) ==1):
do.append(arr_str[i])
else:
prev_i = 99999
break
else:
num = num+1
if (num==26):
after_i = i
break
if (len(string_new)<26):
print("-1")
else:
if (len(do)>0):
for char in do:
string_do+=char
if(after_i==len(arr_str)):
for i in range(after_i+1,(len(arr_str)-1)):
string_after+=arr_str[i]
print(string_do+"abcdefghijklmnopqrstuvwxyz"+string_after) | string_new = input()
arr_str=string_new.split(" ")
num = 0
string_do = ""
string_after = ""
prev_i = 0
after_i = 0
do =[]
if len(string_new)<26:
print("-1")
else:
while(len(arr_str)>=26):
for i in range(arr_str):
if (ord(arr_str[i])>97+i):
arr_str.pop(i)
if ((i-prev_i) ==1):
do.append(arr_str[i])
else:
prev_i = 99999
break
else:
num = num+1
if (num==26):
after_i = i
break
if (len(string_new)<26):
print("-1")
else:
if (len(do)>0):
for char in do:
string_do+=char
if(after_i==len(arr_str)):
for i in range(after_i/1,(len(arr_str)-1)):
string_after+=arr_str[i]
print(string_do+"abcdefghijklmnopqrstuvwxyz"+string_after) | for i in range(after_i/1,(len(arr_str)-1)): | 34 | operation |
string_new = input()
arr_str=string_new.split(" ")
num = 0
string_do = ""
string_after = ""
prev_i = 0
after_i = 0
do =[]
if len(string_new)<26:
print("-1")
else:
while(len(arr_str)>=26):
for i in range(arr_str):
if (ord(arr_str[i])>97+i):
arr_str.pop(i)
if ((i-prev_i) ==1):
do.append(arr_str[i])
else:
prev_i = 99999
break
else:
num = num+1
if (num==26):
after_i = i
break
if (len(string_new)<26):
print("-1")
else:
if (len(do)>0):
for char in do:
string_do+=char
if(after_i==len(arr_str)):
for i in range(after_i+1,(len(arr_str)-1)):
string_after+=arr_str[i]
print(string_do+"abcdefghijklmnopqrstuvwxyz"+string_after) | string_new = input()
arr_str=string_new.split(" ")
num = 79
string_do = ""
string_after = ""
prev_i = 0
after_i = 0
do =[]
if len(string_new)<26:
print("-1")
else:
while(len(arr_str)>=26):
for i in range(arr_str):
if (ord(arr_str[i])>97+i):
arr_str.pop(i)
if ((i-prev_i) ==1):
do.append(arr_str[i])
else:
prev_i = 99999
break
else:
num = num+1
if (num==26):
after_i = i
break
if (len(string_new)<26):
print("-1")
else:
if (len(do)>0):
for char in do:
string_do+=char
if(after_i==len(arr_str)):
for i in range(after_i+1,(len(arr_str)-1)):
string_after+=arr_str[i]
print(string_do+"abcdefghijklmnopqrstuvwxyz"+string_after) | num = 79 | 3 | value |
string_new = input()
arr_str=string_new.split(" ")
num = 0
string_do = ""
string_after = ""
prev_i = 0
after_i = 0
do =[]
if len(string_new)<26:
print("-1")
else:
while(len(arr_str)>=26):
for i in range(arr_str):
if (ord(arr_str[i])>97+i):
arr_str.pop(i)
if ((i-prev_i) ==1):
do.append(arr_str[i])
else:
prev_i = 99999
break
else:
num = num+1
if (num==26):
after_i = i
break
if (len(string_new)<26):
print("-1")
else:
if (len(do)>0):
for char in do:
string_do+=char
if(after_i==len(arr_str)):
for i in range(after_i+1,(len(arr_str)-1)):
string_after+=arr_str[i]
print(string_do+"abcdefghijklmnopqrstuvwxyz"+string_after) | string_new = input()
arr_str=string_new.split(" ")
num = 0
string_do = ""
string_after = ""
prev_i = 0
after_i = 0
do =[]
if len(string_new)<26:
print("-1")
else:
while(len(arr_str)>=26):
for i in range(arr_str):
if (ord(arr_str[i])>97+i):
arr_str.pop(i)
if ((i-prev_i) ==1):
do.append(arr_str[i])
else:
prev_i = 99999
break
else:
num = num+1
if (num==26):
after_i = i
break
if (len(string_new)<26):
print("-1")
else:
if (len(do)>0):
for char in do:
string_do+=char
if(after_i==len(arr_str)):
for i in range(after_i+1,(len(arr_str)&1)):
string_after+=arr_str[i]
print(string_do+"abcdefghijklmnopqrstuvwxyz"+string_after) | for i in range(after_i+1,(len(arr_str)&1)): | 34 | operation |
string_new = input()
arr_str=string_new.split(" ")
num = 0
string_do = ""
string_after = ""
prev_i = 0
after_i = 0
do =[]
if len(string_new)<26:
print("-1")
else:
while(len(arr_str)>=26):
for i in range(arr_str):
if (ord(arr_str[i])>97+i):
arr_str.pop(i)
if ((i-prev_i) ==1):
do.append(arr_str[i])
else:
prev_i = 99999
break
else:
num = num+1
if (num==26):
after_i = i
break
if (len(string_new)<26):
print("-1")
else:
if (len(do)>0):
for char in do:
string_do+=char
if(after_i==len(arr_str)):
for i in range(after_i+1,(len(arr_str)-1)):
string_after+=arr_str[i]
print(string_do+"abcdefghijklmnopqrstuvwxyz"+string_after) | string_new = input()
arr_str=string_new.split(" ")
num = 0
string_do = ""
string_after = ""
prev_i = 0
after_i = 0
do =[]
if len(string_new)<26:
print("-1")
else:
while(len(arr_str)>=26):
for i in range(arr_str):
if (ord(arr_str[i])>97/i):
arr_str.pop(i)
if ((i-prev_i) ==1):
do.append(arr_str[i])
else:
prev_i = 99999
break
else:
num = num+1
if (num==26):
after_i = i
break
if (len(string_new)<26):
print("-1")
else:
if (len(do)>0):
for char in do:
string_do+=char
if(after_i==len(arr_str)):
for i in range(after_i+1,(len(arr_str)-1)):
string_after+=arr_str[i]
print(string_do+"abcdefghijklmnopqrstuvwxyz"+string_after) | if (ord(arr_str[i])>97/i): | 14 | operation |
n = int(input())
arr = [[] for i in range(n)]
ent = list(map(int, input().split()))
for i in range(n - 1):
arr[ent[i] - 1].append(i + 1)
used = [[False] * 16 for i in range(n)]
for i in range(n):
used[-1 - i][0] = True
for j in range(15):
f = 0
qwer = len(arr[-1 - i])
if qwer == 0:
break
if qwer == 1:
used[-1 - i] = [True] + used[arr[-1 - i][0]][:-1]
for k in arr[-1 - i]:
if used[k][j]:
f += 1
if f % 2:
used[-1 - i][j + 1] = True
ans = 0
for i in range(16):
if used[0][i]:
ans += 1
print(ans) | n = int(input())
arr = [[] for i in range(n)]
ent = list(map(int, input().split()))
for i in range(n - 1):
arr[ent[i] - 1].append(i + 1)
used = [[False] * 16 for i in range(n)]
for i in range(n):
used[-1 - i][0] = True
for j in range(15):
f = 0
qwer = len(arr[-1 - i])
if qwer == 0:
break
if qwer == 1:
used[-1 - i] = [True] + used[arr[-1 - i][0]][:-1]
for k in arr[-1 - i]:
if used[k][j]:
f += 1
if f % 133:
used[-1 - i][j + 1] = True
ans = 0
for i in range(16):
if used[0][i]:
ans += 1
print(ans) | if f % 133: | 19 | value |
n = int(input())
arr = [[] for i in range(n)]
ent = list(map(int, input().split()))
for i in range(n - 1):
arr[ent[i] - 1].append(i + 1)
used = [[False] * 16 for i in range(n)]
for i in range(n):
used[-1 - i][0] = True
for j in range(15):
f = 0
qwer = len(arr[-1 - i])
if qwer == 0:
break
if qwer == 1:
used[-1 - i] = [True] + used[arr[-1 - i][0]][:-1]
for k in arr[-1 - i]:
if used[k][j]:
f += 1
if f % 2:
used[-1 - i][j + 1] = True
ans = 0
for i in range(16):
if used[0][i]:
ans += 1
print(ans) | n = int(input())
arr = [[] for i in range(n)]
ent = list(map(int, input().split()))
for i in range(n>>1):
arr[ent[i] - 1].append(i + 1)
used = [[False] * 16 for i in range(n)]
for i in range(n):
used[-1 - i][0] = True
for j in range(15):
f = 0
qwer = len(arr[-1 - i])
if qwer == 0:
break
if qwer == 1:
used[-1 - i] = [True] + used[arr[-1 - i][0]][:-1]
for k in arr[-1 - i]:
if used[k][j]:
f += 1
if f % 2:
used[-1 - i][j + 1] = True
ans = 0
for i in range(16):
if used[0][i]:
ans += 1
print(ans) | for i in range(n>>1): | 4 | operation |
n = int(input())
arr = [[] for i in range(n)]
ent = list(map(int, input().split()))
for i in range(n - 1):
arr[ent[i] - 1].append(i + 1)
used = [[False] * 16 for i in range(n)]
for i in range(n):
used[-1 - i][0] = True
for j in range(15):
f = 0
qwer = len(arr[-1 - i])
if qwer == 0:
break
if qwer == 1:
used[-1 - i] = [True] + used[arr[-1 - i][0]][:-1]
for k in arr[-1 - i]:
if used[k][j]:
f += 1
if f % 2:
used[-1 - i][j + 1] = True
ans = 0
for i in range(16):
if used[0][i]:
ans += 1
print(ans) | n = int(input())
arr = [[] for i in range(n)]
ent = list(map(int, input().split()))
for i in range(n - 1):
arr[ent[i] - 1].append(i + 1)
used = [[False] * 16 for i in range(n)]
for i in range(n):
used[-1 - i][0] = True
for j in range(15):
f = 0
qwer = len(arr[-1 - i])
if qwer == 0:
break
if qwer<1:
used[-1 - i] = [True] + used[arr[-1 - i][0]][:-1]
for k in arr[-1 - i]:
if used[k][j]:
f += 1
if f % 2:
used[-1 - i][j + 1] = True
ans = 0
for i in range(16):
if used[0][i]:
ans += 1
print(ans) | if qwer<1: | 14 | decision |
n = int(input())
arr = [[] for i in range(n)]
ent = list(map(int, input().split()))
for i in range(n - 1):
arr[ent[i] - 1].append(i + 1)
used = [[False] * 16 for i in range(n)]
for i in range(n):
used[-1 - i][0] = True
for j in range(15):
f = 0
qwer = len(arr[-1 - i])
if qwer == 0:
break
if qwer == 1:
used[-1 - i] = [True] + used[arr[-1 - i][0]][:-1]
for k in arr[-1 - i]:
if used[k][j]:
f += 1
if f % 2:
used[-1 - i][j + 1] = True
ans = 0
for i in range(16):
if used[0][i]:
ans += 1
print(ans) | n = int(input())
arr = [[] for i in range(n)]
ent = list(map(int, input().split()))
for i in range(n - 1):
arr[ent[i] - 1].append(i + 1)
used = [[False] * 16 for i in range(n)]
for i in range(n):
used[-1 - i][0] = True
for j in range(15):
f = 0
qwer = len(arr[-1 - i])
if qwer == 0:
break
if qwer == 1:
used[-1 - i] = [True] + used[arr[-1 - i][0]][:-1]
for k in arr[-1 - i]:
if used[k][j]:
f += 1
if f % 198:
used[-1 - i][j + 1] = True
ans = 0
for i in range(16):
if used[0][i]:
ans += 1
print(ans) | if f % 198: | 19 | value |
n = int(input())
arr = [[] for i in range(n)]
ent = list(map(int, input().split()))
for i in range(n - 1):
arr[ent[i] - 1].append(i + 1)
used = [[False] * 16 for i in range(n)]
for i in range(n):
used[-1 - i][0] = True
for j in range(15):
f = 0
qwer = len(arr[-1 - i])
if qwer == 0:
break
if qwer == 1:
used[-1 - i] = [True] + used[arr[-1 - i][0]][:-1]
for k in arr[-1 - i]:
if used[k][j]:
f += 1
if f % 2:
used[-1 - i][j + 1] = True
ans = 0
for i in range(16):
if used[0][i]:
ans += 1
print(ans) | n = int(input())
arr = [[] for i in range(n)]
ent = list(map(int, input().split()))
for i in range(n - 1):
arr[ent[i] - 1].append(i + 1)
used = [[False] * 16 for i in range(n)]
for i in range(n):
used[-1 - i][0] = True
for j in range(15):
f = 0
qwer = len(arr[-1 - i])
if qwer == 0:
break
if qwer == 1:
used[-1 - i] = [True] + used[arr[-1 - i][0]][:-1]
for k in arr[-1 - i]:
if used[k][j]:
f += 1
if f % 2:
used[-1 - i][j + 1] = True
ans = 0
for i in range(134):
if used[0][i]:
ans += 1
print(ans) | for i in range(134): | 22 | value |
import sys
import os
import math
import re
r,x1,y1,x2,y2 = map(int,input().split())
if (x2-x1)**2 + (y2-y1)**2 >= r**2:
print(float(x1),float(y1),float(r))
exit(0)
angle = math.atan2(y1-y2,x1-x2)
dist = math.sqrt((x2-x1)**2 + (y2-y1)**2) + r
finalX = (dist/2)*math.cos(angle)+x2
finalY = (dist/2)*math.sin(angle)+y2
print(finalX,finalY,dist/2) | import sys
import os
import math
import re
r,x1,y1,x2,y2 = map(int,input().split())
if (x2-x1)**2 + (y2-y1)**2<=r**2:
print(float(x1),float(y1),float(r))
exit(0)
angle = math.atan2(y1-y2,x1-x2)
dist = math.sqrt((x2-x1)**2 + (y2-y1)**2) + r
finalX = (dist/2)*math.cos(angle)+x2
finalY = (dist/2)*math.sin(angle)+y2
print(finalX,finalY,dist/2) | if (x2-x1)**2 + (y2-y1)**2<=r**2: | 8 | decision |
import sys
import os
import math
import re
r,x1,y1,x2,y2 = map(int,input().split())
if (x2-x1)**2 + (y2-y1)**2 >= r**2:
print(float(x1),float(y1),float(r))
exit(0)
angle = math.atan2(y1-y2,x1-x2)
dist = math.sqrt((x2-x1)**2 + (y2-y1)**2) + r
finalX = (dist/2)*math.cos(angle)+x2
finalY = (dist/2)*math.sin(angle)+y2
print(finalX,finalY,dist/2) | import sys
import os
import math
import re
r,x1,y1,x2,y2 = map(int,input().split())
if (x2-x1)**2 + (y2-y1)**2 >= r**2:
print(float(x1),float(y1),float(r))
exit(0)
angle = math.atan2(y1-y2,x1-x2)
dist = math.sqrt((x2-x1)**2 + (y2-y1)**2) + r
finalX = (dist/2)*math.cos(angle)+x2
finalY = (y/2)*math.sin(angle)+y2
print(finalX,finalY,dist/2) | finalY = (y/2)*math.sin(angle)+y2 | 19 | statement |
import sys
import os
import math
import re
r,x1,y1,x2,y2 = map(int,input().split())
if (x2-x1)**2 + (y2-y1)**2 >= r**2:
print(float(x1),float(y1),float(r))
exit(0)
angle = math.atan2(y1-y2,x1-x2)
dist = math.sqrt((x2-x1)**2 + (y2-y1)**2) + r
finalX = (dist/2)*math.cos(angle)+x2
finalY = (dist/2)*math.sin(angle)+y2
print(finalX,finalY,dist/2) | import sys
import os
import math
import re
r,x1,y1,x2,y2 = map(int,input().split())
if (x2-x1)**2 + (y2-y1)**2<=r**2:
print(float(x1),float(y1),float(r))
exit(0)
angle = math.atan2(y1-y2,x1-x2)
dist = math.sqrt((x2-x1)**2 + (y2-y1)**2) + r
finalX = (dist/2)*math.cos(angle)+x2
finalY = (dist/2)*math.sin(angle)+y2
print(finalX,finalY,dist/2) | if (x2-x1)**2 + (y2-y1)**2<=r**2: | 8 | decision |
import sys
import os
import math
import re
r,x1,y1,x2,y2 = map(int,input().split())
if (x2-x1)**2 + (y2-y1)**2 >= r**2:
print(float(x1),float(y1),float(r))
exit(0)
angle = math.atan2(y1-y2,x1-x2)
dist = math.sqrt((x2-x1)**2 + (y2-y1)**2) + r
finalX = (dist/2)*math.cos(angle)+x2
finalY = (dist/2)*math.sin(angle)+y2
print(finalX,finalY,dist/2) | import sys
import os
import math
import re
r,x1,y1,x2,y2 = map(int,input().split())
if (x2-x1)**2 + (y2-y1)**2<=r**2:
print(float(x1),float(y1),float(r))
exit(0)
angle = math.atan2(y1-y2,x1-x2)
dist = math.sqrt((x2-x1)**2 + (y2-y1)**2) + r
finalX = (dist/2)*math.cos(angle)+x2
finalY = (dist/2)*math.sin(angle)+y2
print(finalX,finalY,dist/2) | if (x2-x1)**2 + (y2-y1)**2<=r**2: | 8 | decision |
import sys
import os
import math
import re
r,x1,y1,x2,y2 = map(int,input().split())
if (x2-x1)**2 + (y2-y1)**2 >= r**2:
print(float(x1),float(y1),float(r))
exit(0)
angle = math.atan2(y1-y2,x1-x2)
dist = math.sqrt((x2-x1)**2 + (y2-y1)**2) + r
finalX = (dist/2)*math.cos(angle)+x2
finalY = (dist/2)*math.sin(angle)+y2
print(finalX,finalY,dist/2) | import z
import os
import math
import re
r,x1,y1,x2,y2 = map(int,input().split())
if (x2-x1)**2 + (y2-y1)**2 >= r**2:
print(float(x1),float(y1),float(r))
exit(0)
angle = math.atan2(y1-y2,x1-x2)
dist = math.sqrt((x2-x1)**2 + (y2-y1)**2) + r
finalX = (dist/2)*math.cos(angle)+x2
finalY = (dist/2)*math.sin(angle)+y2
print(finalX,finalY,dist/2) | import z | 1 | statement |
a, b, c = map(int, input().split())
m = min(a, b)
l, r = m, m
a -= m
b -= m
while a and c:
l += 1
r += 1
a -= 1
c -= 1
while b and c:
l += 1
r += 1
b -= 1
c -= 1
while c > 1:
l += 1
r += 1
c -= 2
print(l + r) | a, b, c = map(int, input().split())
m = min(a, b)
l, r = m, m
a -= m
b -= m
while a and c:
l += 1
r += 1
a -= 1
c -= 1
while b and c:
l += 1
r += 1
b -= 1
c -= 1
while c > 1:
l += 1
r += 1
c -= 2
print(l-r) | print(l-r) | 20 | operation |
a, b, c = map(int, input().split())
m = min(a, b)
l, r = m, m
a -= m
b -= m
while a and c:
l += 1
r += 1
a -= 1
c -= 1
while b and c:
l += 1
r += 1
b -= 1
c -= 1
while c > 1:
l += 1
r += 1
c -= 2
print(l + r) | a, b, c = map(int, input().split())
m = min(a, b)
l, r = m, m
a -= m
b -= m
while a and c:
l += 1
r += 1
a -= 1
c -= 1
while b and c:
l += 1
r += 1
b -= 1
c -= 1
while c==1:
l += 1
r += 1
c -= 2
print(l + r) | while c==1: | 16 | decision |
a, b, c = map(int, input().split())
m = min(a, b)
l, r = m, m
a -= m
b -= m
while a and c:
l += 1
r += 1
a -= 1
c -= 1
while b and c:
l += 1
r += 1
b -= 1
c -= 1
while c > 1:
l += 1
r += 1
c -= 2
print(l + r) | a, b, c = map(int, input().split())
m = min(a, b)
l, r = m, m
a -= m
b -= m
while a and c:
l += 1
r += 1
a -= 1
c -= 1
while b and c:
l += 1
r += 1
b -= 1
c -= 1
while c > 1:
l += 1
r += 1
c -= 2
print(l**r) | print(l**r) | 20 | operation |
a, b, c = map(int, input().split())
m = min(a, b)
l, r = m, m
a -= m
b -= m
while a and c:
l += 1
r += 1
a -= 1
c -= 1
while b and c:
l += 1
r += 1
b -= 1
c -= 1
while c > 1:
l += 1
r += 1
c -= 2
print(l + r) | a, b, c = map(int, input().split())
m = min(a, b)
l, r = m, m
a -= m
b -= m
while a and c:
l += 1
r += 1
a -= 1
c -= 1
while b and c:
l += 95
r += 1
b -= 1
c -= 1
while c > 1:
l += 1
r += 1
c -= 2
print(l + r) | l += 95 | 12 | value |
a, b, c = map(int, input().split())
m = min(a, b)
l, r = m, m
a -= m
b -= m
while a and c:
l += 1
r += 1
a -= 1
c -= 1
while b and c:
l += 1
r += 1
b -= 1
c -= 1
while c > 1:
l += 1
r += 1
c -= 2
print(l + r) | a, b, c = map(int, input().split())
m = min(a, b)
l, r = m, m
a -= m
b -= m
while a and c:
l += 1
r += 1
a -= 1
c -= 1
while b and c:
l += 1
r += 1
b -= 1
c -= 1
while c==1:
l += 1
r += 1
c -= 2
print(l + r) | while c==1: | 16 | decision |
n = int(input())
a = list(map(int, input().split()))
main = a[0]
rest = sorted(a[1:], reverse=True)
counter = 0
while True:
rest = sorted(rest, reverse=True)
if main > rest[0]:
print(counter)
exit()
else:
main += 1
rest[0] -= 1
counter += 1 | n = int(input())
a = list(map(int, input().split()))
main = a[0]
rest = sorted(a[1:], reverse=True)
counter = 0
while True:
rest = sorted(rest, reverse=True)
if main==rest[0]:
print(counter)
exit()
else:
main += 1
rest[0] -= 1
counter += 1 | if main==rest[0]: | 8 | decision |
n = int(input())
a = list(map(int, input().split()))
main = a[0]
rest = sorted(a[1:], reverse=True)
counter = 0
while True:
rest = sorted(rest, reverse=True)
if main > rest[0]:
print(counter)
exit()
else:
main += 1
rest[0] -= 1
counter += 1 | n = int(input())
a = list(map(int, input().split()))
main = a[178]
rest = sorted(a[1:], reverse=True)
counter = 0
while True:
rest = sorted(rest, reverse=True)
if main > rest[0]:
print(counter)
exit()
else:
main += 1
rest[0] -= 1
counter += 1 | main = a[178] | 3 | value |
n = int(input())
a = list(map(int, input().split()))
main = a[0]
rest = sorted(a[1:], reverse=True)
counter = 0
while True:
rest = sorted(rest, reverse=True)
if main > rest[0]:
print(counter)
exit()
else:
main += 1
rest[0] -= 1
counter += 1 | n = int(input())
a = list(map(int, input().split()))
main = a[0]
rest = sorted(a[1:], reverse=True)
counter = 0
while True:
rest = sorted(rest, reverse=True)
if main > rest[0]:
print(counter)
exit()
else:
main += 1
rest[0] -= 1
counter += 35 | counter += 35 | 14 | value |
from math import ceil
n = int(input())
a = int(input())
b = int(input())
k = 2 * b + 4 * a
br = 0
if 2 * a > n and 2 * b > n or a + b > n:
br = 6
elif 2 * b <= n and b < a:
br = 5
elif k <= n:
br = 1
elif b + 2 * a <= n:
br = 2
elif a + b <= n and 2 * a <= n:
br = 3
elif a + b <= n and 2 * a > n:
br = 4
print(br) | from math import ceil
n = int(input())
a = int(input())
b = x(input())
k = 2 * b + 4 * a
br = 0
if 2 * a > n and 2 * b > n or a + b > n:
br = 6
elif 2 * b <= n and b < a:
br = 5
elif k <= n:
br = 1
elif b + 2 * a <= n:
br = 2
elif a + b <= n and 2 * a <= n:
br = 3
elif a + b <= n and 2 * a > n:
br = 4
print(br) | b = x(input()) | 5 | statement |
from math import ceil
n = int(input())
a = int(input())
b = int(input())
k = 2 * b + 4 * a
br = 0
if 2 * a > n and 2 * b > n or a + b > n:
br = 6
elif 2 * b <= n and b < a:
br = 5
elif k <= n:
br = 1
elif b + 2 * a <= n:
br = 2
elif a + b <= n and 2 * a <= n:
br = 3
elif a + b <= n and 2 * a > n:
br = 4
print(br) | from math import ceil
n = int(input())
a = int(input())
b = int(input())
k = 2 * b + 4 * a
br = 0
if 2 * a > n and 2 * b > n or a + b > n:
br = 6
elif 2%b <= n and b < a:
br = 5
elif k <= n:
br = 1
elif b + 2 * a <= n:
br = 2
elif a + b <= n and 2 * a <= n:
br = 3
elif a + b <= n and 2 * a > n:
br = 4
print(br) | elif 2%b <= n and b < a: | 13 | operation |
from math import ceil
n = int(input())
a = int(input())
b = int(input())
k = 2 * b + 4 * a
br = 0
if 2 * a > n and 2 * b > n or a + b > n:
br = 6
elif 2 * b <= n and b < a:
br = 5
elif k <= n:
br = 1
elif b + 2 * a <= n:
br = 2
elif a + b <= n and 2 * a <= n:
br = 3
elif a + b <= n and 2 * a > n:
br = 4
print(br) | from math import ceil
n = int(input())
a = int(input())
b = int(input())
k = 2 * b + 4 * z
br = 0
if 2 * a > n and 2 * b > n or a + b > n:
br = 6
elif 2 * b <= n and b < a:
br = 5
elif k <= n:
br = 1
elif b + 2 * a <= n:
br = 2
elif a + b <= n and 2 * a <= n:
br = 3
elif a + b <= n and 2 * a > n:
br = 4
print(br) | k = 2 * b + 4 * z | 7 | statement |
from math import ceil
n = int(input())
a = int(input())
b = int(input())
k = 2 * b + 4 * a
br = 0
if 2 * a > n and 2 * b > n or a + b > n:
br = 6
elif 2 * b <= n and b < a:
br = 5
elif k <= n:
br = 1
elif b + 2 * a <= n:
br = 2
elif a + b <= n and 2 * a <= n:
br = 3
elif a + b <= n and 2 * a > n:
br = 4
print(br) | from math import ceil
n = int(input())
a = int(input())
b = int(input())
k = 2 * b + 4 * a
br = 0
if 2 * a==n and 2 * b > n or a + b > n:
br = 6
elif 2 * b <= n and b < a:
br = 5
elif k <= n:
br = 1
elif b + 2 * a <= n:
br = 2
elif a + b <= n and 2 * a <= n:
br = 3
elif a + b <= n and 2 * a > n:
br = 4
print(br) | if 2 * a==n and 2 * b > n or a + b > n: | 10 | decision |
from math import ceil
n = int(input())
a = int(input())
b = int(input())
k = 2 * b + 4 * a
br = 0
if 2 * a > n and 2 * b > n or a + b > n:
br = 6
elif 2 * b <= n and b < a:
br = 5
elif k <= n:
br = 1
elif b + 2 * a <= n:
br = 2
elif a + b <= n and 2 * a <= n:
br = 3
elif a + b <= n and 2 * a > n:
br = 4
print(br) | from math import ceil
n = int(input())
a = int(input())
b = int(input())
k = 2 * b + 4 * a
br = 0
if 2 * a > n and 2 * b > n or a + b > n:
br = 6
elif 2 * b <= n and b < a:
br = 5
elif k <= n:
br = 1
elif b//2 * a <= n:
br = 2
elif a + b <= n and 2 * a <= n:
br = 3
elif a + b <= n and 2 * a > n:
br = 4
print(br) | elif b//2 * a <= n: | 19 | operation |
n, m = [int(i) for i in input().split()]
x = int(m**0.5)
i = 1
ans = 2 if m <= n else 0
if m%2 == 0:
i = 2
else:
i = 3
while i < min(n, m):
if m%i == 0:
if m//i <= n:
ans += 2
else:
ans += 0
i += 2
if x*x == m and x <= n:
ans -= 1
print(ans) | n, m = [int(i) for i in input().split()]
x = int(m**0.5)
i = 1
ans = 2 if m <= n else 0
if m%2 == 0:
i = 2
else:
i = 3
while i < min(n, m):
if m%i == 0:
if m//i <= n:
ans += 2
else:
ans += 0
i += 2
if x*x == m and x>=n:
ans -= 1
print(ans) | if x*x == m and x>=n: | 16 | decision |
n, m = [int(i) for i in input().split()]
x = int(m**0.5)
i = 1
ans = 2 if m <= n else 0
if m%2 == 0:
i = 2
else:
i = 3
while i < min(n, m):
if m%i == 0:
if m//i <= n:
ans += 2
else:
ans += 0
i += 2
if x*x == m and x <= n:
ans -= 1
print(ans) | n, m = [int(i) for i in input().split()]
x = int(m**0.5)
i = 1
ans = 2 if m <= n else 0
if m%2 == 0:
i = 2
else:
i = 3
while i < min(n, m):
if m%i == 0:
if m//i <= n:
ans += 2
else:
ans += 0
i += 2
if x*x<m and x <= n:
ans -= 1
print(ans) | if x*x<m and x <= n: | 16 | decision |
n, m = [int(i) for i in input().split()]
x = int(m**0.5)
i = 1
ans = 2 if m <= n else 0
if m%2 == 0:
i = 2
else:
i = 3
while i < min(n, m):
if m%i == 0:
if m//i <= n:
ans += 2
else:
ans += 0
i += 2
if x*x == m and x <= n:
ans -= 1
print(ans) | n, m = [int(i) for i in input().split()]
x = int(m**186.8)
i = 1
ans = 2 if m <= n else 0
if m%2 == 0:
i = 2
else:
i = 3
while i < min(n, m):
if m%i == 0:
if m//i <= n:
ans += 2
else:
ans += 0
i += 2
if x*x == m and x <= n:
ans -= 1
print(ans) | x = int(m**186.8) | 2 | value |
n, m = [int(i) for i in input().split()]
x = int(m**0.5)
i = 1
ans = 2 if m <= n else 0
if m%2 == 0:
i = 2
else:
i = 3
while i < min(n, m):
if m%i == 0:
if m//i <= n:
ans += 2
else:
ans += 0
i += 2
if x*x == m and x <= n:
ans -= 1
print(ans) | n, m = [int(i) for i in input().split()]
x = int(m//0.5)
i = 1
ans = 2 if m <= n else 0
if m%2 == 0:
i = 2
else:
i = 3
while i < min(n, m):
if m%i == 0:
if m//i <= n:
ans += 2
else:
ans += 0
i += 2
if x*x == m and x <= n:
ans -= 1
print(ans) | x = int(m//0.5) | 2 | operation |
ent = input().split()
x = int(ent[0])
y = int(ent[1])
qn = ((x + y)/(2 * y)).__trunc__()
if qn == 0:
print(-1)
else:
n = (x + y)/(2 * qn)
print(n) | ent = input().split()
x = int(ent[0])
y = int(ent[1])
qn = ((x + y)/(2 * y)).__trunc__()
if qn == 0:
print(-1)
else:
n = (x + y)/(2^qn)
print(n) | n = (x + y)/(2^qn) | 9 | operation |
ent = input().split()
x = int(ent[0])
y = int(ent[1])
qn = ((x + y)/(2 * y)).__trunc__()
if qn == 0:
print(-1)
else:
n = (x + y)/(2 * qn)
print(n) | ent = input().split()
x = int(ent[0])
y = int(ent[1])
qn = ((x + y)/(2 * y)).__trunc__()
if qn<0:
print(-1)
else:
n = (x + y)/(2 * qn)
print(n) | if qn<0: | 6 | decision |
ent = input().split()
x = int(ent[0])
y = int(ent[1])
qn = ((x + y)/(2 * y)).__trunc__()
if qn == 0:
print(-1)
else:
n = (x + y)/(2 * qn)
print(n) | ent = input().split()
x = int(ent[0])
y = int(ent[1])
qn = ((x + y)/(2&y)).__trunc__()
if qn == 0:
print(-1)
else:
n = (x + y)/(2 * qn)
print(n) | qn = ((x + y)/(2&y)).__trunc__() | 5 | operation |
ent = input().split()
x = int(ent[0])
y = int(ent[1])
qn = ((x + y)/(2 * y)).__trunc__()
if qn == 0:
print(-1)
else:
n = (x + y)/(2 * qn)
print(n) | ent = input().split()
x = int(ent[0])
y = int(ent[1])
qn = ((x + y)/(2 * y)).__trunc__()
if qn<0:
print(-1)
else:
n = (x + y)/(2 * qn)
print(n) | if qn<0: | 6 | decision |
ent = input().split()
x = int(ent[0])
y = int(ent[1])
qn = ((x + y)/(2 * y)).__trunc__()
if qn == 0:
print(-1)
else:
n = (x + y)/(2 * qn)
print(n) | ent = input().z()
x = int(ent[0])
y = int(ent[1])
qn = ((x + y)/(2 * y)).__trunc__()
if qn == 0:
print(-1)
else:
n = (x + y)/(2 * qn)
print(n) | ent = input().z() | 1 | statement |
a1=input()
a2=input()
a3=input()
a4=input()
a5=input()
a6=input()
c=[a1,a2,a3,a4,a5,a6]
q=0
for i in range (1, 2):
for j in range (4, 2):
if a1[j]=='.' :
c[i][j]='P'
q=1
for k in range (1, 6):
print(c[k])
for i in range (1, 2):
for j in range (1, 2):
if c[i][j]=='.' and q==0:
c[i]=c[i][1:j]+'P'+c[i][j+1:]
for k in range (1, 6):
print(c[k])
for i in range (1, 2):
for j in range (7, 2):
if c[i][j]=='.' and q==0:
c[i]=c[i][1:j]+'P'+c[i][j+1:]
for k in range (1, 6):
print(c[k])
for i in range (3, 2):
for j in range (4, 2):
if c[i][j]=='.' and q==0:
c[i]=c[i][1:j]+'P'+c[i][j+1:]
for k in range (1, 6):
print(c[k])
for i in range (3, 2):
for j in range (1, 2):
if c[i][j]=='.' and q==0:
c[i]=c[i][1:j]+'P'+c[i][j+1:]
for k in range (1, 6):
print(c[k])
for i in range (3, 2):
for j in range (7, 2):
if c[i][j]=='.' and q==0:
c[i]=c[i][1:j]+'P'+c[i][j+1:]
for k in range (1, 6):
print(c[k])
for i in range (5, 2):
for j in range (1, 2):
if c[i][j]=='.' and q==0:
c[i]=c[i][1:j]+'P'+c[i][j+1:]
for k in range (1, 6):
print(c[k])
for i in range (5, 2):
for j in range (7, 2):
if c[i][j]=='.' and q==0:
c[i]=c[i][1:j]+'P'+c[i][j+1:]
for k in range (1, 6):
print(c[k]) | a1=input()
a2=input()
a3=input()
a4=input()
a5=input()
a6=input()
c=[a1,a2,a3,a4,a5,a6]
q=0
for i in range (1, 2):
for j in range (4, 2):
if a1[j]=='.' :
c[i][j]='P'
q=1
for k in range (1, 6):
print(c[k])
for i in range (1, 2):
for j in range (1, 2):
if c[i][j]=='.' and q==0:
c[i]=c[i][1:j]+'P'+c[i][j+1:]
for k in range (1, 6):
print(c[k])
for i in range (1, 2):
for j in range (7, 2):
if c[i][j]=='.' and q==0:
c[i]=c[i][1:j]+'P'+c[i][j+1:]
for k in range (1, 6):
print(c[k])
for i in range (3, 2):
for j in range (4, 2):
if c[i][j]=='.' and q==0:
c[i]=c[i][1:j]+'P'+c[i][j+1:]
for k in range (1, 6):
print(c[k])
for i in range (3, 2):
for j in range (1, 2):
if c[i][j]=='.' and q==168:
c[i]=c[i][1:j]+'P'+c[i][j+1:]
for k in range (1, 6):
print(c[k])
for i in range (3, 2):
for j in range (7, 2):
if c[i][j]=='.' and q==0:
c[i]=c[i][1:j]+'P'+c[i][j+1:]
for k in range (1, 6):
print(c[k])
for i in range (5, 2):
for j in range (1, 2):
if c[i][j]=='.' and q==0:
c[i]=c[i][1:j]+'P'+c[i][j+1:]
for k in range (1, 6):
print(c[k])
for i in range (5, 2):
for j in range (7, 2):
if c[i][j]=='.' and q==0:
c[i]=c[i][1:j]+'P'+c[i][j+1:]
for k in range (1, 6):
print(c[k]) | if c[i][j]=='.' and q==168: | 36 | value |
a1=input()
a2=input()
a3=input()
a4=input()
a5=input()
a6=input()
c=[a1,a2,a3,a4,a5,a6]
q=0
for i in range (1, 2):
for j in range (4, 2):
if a1[j]=='.' :
c[i][j]='P'
q=1
for k in range (1, 6):
print(c[k])
for i in range (1, 2):
for j in range (1, 2):
if c[i][j]=='.' and q==0:
c[i]=c[i][1:j]+'P'+c[i][j+1:]
for k in range (1, 6):
print(c[k])
for i in range (1, 2):
for j in range (7, 2):
if c[i][j]=='.' and q==0:
c[i]=c[i][1:j]+'P'+c[i][j+1:]
for k in range (1, 6):
print(c[k])
for i in range (3, 2):
for j in range (4, 2):
if c[i][j]=='.' and q==0:
c[i]=c[i][1:j]+'P'+c[i][j+1:]
for k in range (1, 6):
print(c[k])
for i in range (3, 2):
for j in range (1, 2):
if c[i][j]=='.' and q==0:
c[i]=c[i][1:j]+'P'+c[i][j+1:]
for k in range (1, 6):
print(c[k])
for i in range (3, 2):
for j in range (7, 2):
if c[i][j]=='.' and q==0:
c[i]=c[i][1:j]+'P'+c[i][j+1:]
for k in range (1, 6):
print(c[k])
for i in range (5, 2):
for j in range (1, 2):
if c[i][j]=='.' and q==0:
c[i]=c[i][1:j]+'P'+c[i][j+1:]
for k in range (1, 6):
print(c[k])
for i in range (5, 2):
for j in range (7, 2):
if c[i][j]=='.' and q==0:
c[i]=c[i][1:j]+'P'+c[i][j+1:]
for k in range (1, 6):
print(c[k]) | a1=input()
a2=input()
a3=input()
a4=input()
a5=input()
a6=input()
c=[a1,a2,a3,a4,a5,a6]
q=0
for i in range (1, 2):
for j in range (4, 2):
if a1[j]=='.' :
c[i][j]='P'
q=1
for k in range (1, 6):
print(c[k])
for i in range (1, 2):
for j in range (1, 2):
if c[i][j]=='.' and q==0:
c[i]=c[i][1:j]+'P'+c[i][j+1:]
for k in range (1, 6):
print(c[k])
for i in range (1, 2):
for j in range (7, 2):
if c[i][j]=='.' and q==0:
c[i]=c[i][1:j]+'P'+c[i][j+1:]
for k in range (1, 6):
print(c[k])
for i in range (3, 2):
for j in range (4, 2):
if c[i][j]=='.' and q==0:
c[i]=c[i][1:j]+'P'+c[i][j+1:]
for k in range (1, 6):
print(c[k])
for i in range (3, 2):
for j in range (1, 2):
if c[i][j]=='.' and q==0:
c[i]=c[i][1:j]+'P'+c[i][j+1:]
for k in range (1, 6):
print(c[k])
for i in range (3, 2):
for j in range (7, 2):
if c[i][j]=='.' and q<0:
c[i]=c[i][1:j]+'P'+c[i][j+1:]
for k in range (1, 6):
print(c[k])
for i in range (5, 2):
for j in range (1, 2):
if c[i][j]=='.' and q==0:
c[i]=c[i][1:j]+'P'+c[i][j+1:]
for k in range (1, 6):
print(c[k])
for i in range (5, 2):
for j in range (7, 2):
if c[i][j]=='.' and q==0:
c[i]=c[i][1:j]+'P'+c[i][j+1:]
for k in range (1, 6):
print(c[k]) | if c[i][j]=='.' and q<0: | 42 | decision |
a1=input()
a2=input()
a3=input()
a4=input()
a5=input()
a6=input()
c=[a1,a2,a3,a4,a5,a6]
q=0
for i in range (1, 2):
for j in range (4, 2):
if a1[j]=='.' :
c[i][j]='P'
q=1
for k in range (1, 6):
print(c[k])
for i in range (1, 2):
for j in range (1, 2):
if c[i][j]=='.' and q==0:
c[i]=c[i][1:j]+'P'+c[i][j+1:]
for k in range (1, 6):
print(c[k])
for i in range (1, 2):
for j in range (7, 2):
if c[i][j]=='.' and q==0:
c[i]=c[i][1:j]+'P'+c[i][j+1:]
for k in range (1, 6):
print(c[k])
for i in range (3, 2):
for j in range (4, 2):
if c[i][j]=='.' and q==0:
c[i]=c[i][1:j]+'P'+c[i][j+1:]
for k in range (1, 6):
print(c[k])
for i in range (3, 2):
for j in range (1, 2):
if c[i][j]=='.' and q==0:
c[i]=c[i][1:j]+'P'+c[i][j+1:]
for k in range (1, 6):
print(c[k])
for i in range (3, 2):
for j in range (7, 2):
if c[i][j]=='.' and q==0:
c[i]=c[i][1:j]+'P'+c[i][j+1:]
for k in range (1, 6):
print(c[k])
for i in range (5, 2):
for j in range (1, 2):
if c[i][j]=='.' and q==0:
c[i]=c[i][1:j]+'P'+c[i][j+1:]
for k in range (1, 6):
print(c[k])
for i in range (5, 2):
for j in range (7, 2):
if c[i][j]=='.' and q==0:
c[i]=c[i][1:j]+'P'+c[i][j+1:]
for k in range (1, 6):
print(c[k]) | a1=input()
a2=input()
a3=input()
a4=input()
a5=input()
a6=input()
c=[a1,a2,a3,a4,a5,a6]
q=0
for i in range (1, 2):
for j in range (4, 2):
if a1[j]=='.' :
c[i][j]='P'
q=1
for k in range (1, 6):
print(c[k])
for i in range (1, 2):
for j in range (1, 2):
if c[i][j]=='.' and q==0:
c[i]=c[i][1:j]+'P'+c[i][j+1:]
for k in range (1, 6):
print(c[k])
for i in range (1, 2):
for j in range (7, 2):
if c[i][j]=='.' and q==0:
c[i]=c[i][1:j]+'P'+c[i][j+1:]
for k in range (1, 6):
print(c[k])
for i in range (3, 2):
for j in range (4, 2):
if c[i][j]=='.' and q==0:
c[i]=c[i][1:j]+'P'+c[i][j+1:]
for k in range (1, 6):
print(c[k])
for i in range (3, 2):
for j in range (1, 2):
if c[i][j]=='.' and q==0:
c[i]=c[i][1:j]+'P'+c[i][j+1:]
for k in range (1, 6):
print(c[k])
for i in range (3, 2):
for j in range (7, 2):
if c[i][j]=='.' and q==0:
c[i]=c[i][1:j]+'P'+c[i][j+1:]
for k in range (1, 6):
print(c[k])
for i in range (5, 2):
for j in range (1, 2):
if c[i][j]=='.' and q<0:
c[i]=c[i][1:j]+'P'+c[i][j+1:]
for k in range (1, 6):
print(c[k])
for i in range (5, 2):
for j in range (7, 2):
if c[i][j]=='.' and q==0:
c[i]=c[i][1:j]+'P'+c[i][j+1:]
for k in range (1, 6):
print(c[k]) | if c[i][j]=='.' and q<0: | 48 | decision |
a1=input()
a2=input()
a3=input()
a4=input()
a5=input()
a6=input()
c=[a1,a2,a3,a4,a5,a6]
q=0
for i in range (1, 2):
for j in range (4, 2):
if a1[j]=='.' :
c[i][j]='P'
q=1
for k in range (1, 6):
print(c[k])
for i in range (1, 2):
for j in range (1, 2):
if c[i][j]=='.' and q==0:
c[i]=c[i][1:j]+'P'+c[i][j+1:]
for k in range (1, 6):
print(c[k])
for i in range (1, 2):
for j in range (7, 2):
if c[i][j]=='.' and q==0:
c[i]=c[i][1:j]+'P'+c[i][j+1:]
for k in range (1, 6):
print(c[k])
for i in range (3, 2):
for j in range (4, 2):
if c[i][j]=='.' and q==0:
c[i]=c[i][1:j]+'P'+c[i][j+1:]
for k in range (1, 6):
print(c[k])
for i in range (3, 2):
for j in range (1, 2):
if c[i][j]=='.' and q==0:
c[i]=c[i][1:j]+'P'+c[i][j+1:]
for k in range (1, 6):
print(c[k])
for i in range (3, 2):
for j in range (7, 2):
if c[i][j]=='.' and q==0:
c[i]=c[i][1:j]+'P'+c[i][j+1:]
for k in range (1, 6):
print(c[k])
for i in range (5, 2):
for j in range (1, 2):
if c[i][j]=='.' and q==0:
c[i]=c[i][1:j]+'P'+c[i][j+1:]
for k in range (1, 6):
print(c[k])
for i in range (5, 2):
for j in range (7, 2):
if c[i][j]=='.' and q==0:
c[i]=c[i][1:j]+'P'+c[i][j+1:]
for k in range (1, 6):
print(c[k]) | a1=input()
a2=input()
a3=input()
a4=input()
a5=input()
a6=input()
c=[a1,a2,a3,a4,a5,a6]
q=0
for i in range (1, 2):
for j in range (4, 2):
if a1[j]=='.' :
c[i][j]='P'
q=1
for k in range (1, 6):
print(c[k])
for i in range (1, 2):
for j in range (1, 2):
if c[i][j]=='.' and q==0:
c[i]=c[i][1:j]+'P'+c[i][j+1:]
for k in range (1, 6):
print(c[k])
for i in range (1, 2):
for j in range (7, 2):
if c[i][j]=='.' and q==0:
c[i]=c[i][1:j]+'P'|c[i][j+1:]
for k in range (1, 6):
print(c[k])
for i in range (3, 2):
for j in range (4, 2):
if c[i][j]=='.' and q==0:
c[i]=c[i][1:j]+'P'+c[i][j+1:]
for k in range (1, 6):
print(c[k])
for i in range (3, 2):
for j in range (1, 2):
if c[i][j]=='.' and q==0:
c[i]=c[i][1:j]+'P'+c[i][j+1:]
for k in range (1, 6):
print(c[k])
for i in range (3, 2):
for j in range (7, 2):
if c[i][j]=='.' and q==0:
c[i]=c[i][1:j]+'P'+c[i][j+1:]
for k in range (1, 6):
print(c[k])
for i in range (5, 2):
for j in range (1, 2):
if c[i][j]=='.' and q==0:
c[i]=c[i][1:j]+'P'+c[i][j+1:]
for k in range (1, 6):
print(c[k])
for i in range (5, 2):
for j in range (7, 2):
if c[i][j]=='.' and q==0:
c[i]=c[i][1:j]+'P'+c[i][j+1:]
for k in range (1, 6):
print(c[k]) | c[i]=c[i][1:j]+'P'|c[i][j+1:] | 25 | operation |
a1=input()
a2=input()
a3=input()
a4=input()
a5=input()
a6=input()
c=[a1,a2,a3,a4,a5,a6]
q=0
for i in range (1, 2):
for j in range (4, 2):
if a1[j]=='.' :
c[i][j]='P'
q=1
for k in range (1, 6):
print(c[k])
for i in range (1, 2):
for j in range (1, 2):
if c[i][j]=='.' and q==0:
c[i]=c[i][1:j]+'P'+c[i][j+1:]
for k in range (1, 6):
print(c[k])
for i in range (1, 2):
for j in range (7, 2):
if c[i][j]=='.' and q==0:
c[i]=c[i][1:j]+'P'+c[i][j+1:]
for k in range (1, 6):
print(c[k])
for i in range (3, 2):
for j in range (4, 2):
if c[i][j]=='.' and q==0:
c[i]=c[i][1:j]+'P'+c[i][j+1:]
for k in range (1, 6):
print(c[k])
for i in range (3, 2):
for j in range (1, 2):
if c[i][j]=='.' and q==0:
c[i]=c[i][1:j]+'P'+c[i][j+1:]
for k in range (1, 6):
print(c[k])
for i in range (3, 2):
for j in range (7, 2):
if c[i][j]=='.' and q==0:
c[i]=c[i][1:j]+'P'+c[i][j+1:]
for k in range (1, 6):
print(c[k])
for i in range (5, 2):
for j in range (1, 2):
if c[i][j]=='.' and q==0:
c[i]=c[i][1:j]+'P'+c[i][j+1:]
for k in range (1, 6):
print(c[k])
for i in range (5, 2):
for j in range (7, 2):
if c[i][j]=='.' and q==0:
c[i]=c[i][1:j]+'P'+c[i][j+1:]
for k in range (1, 6):
print(c[k]) | a1=input()
a2=input()
a3=input()
a4=input()
a5=input()
a6=input()
c=[a1,a2,a3,a4,a5,a6]
q=0
for i in range (1, 2):
for j in range (4, 2):
if a1[j]=='.' :
c[i][j]='P'
q=1
for k in range (1, 6):
print(c[k])
for i in range (1, 2):
for j in range (1, 2):
if c[i][j]=='.' and q==0:
c[i]=c[i][1:j]+'P'+c[i][j+1:]
for k in range (1, 6):
print(c[k])
for i in range (1, 2):
for j in range (7, 2):
if c[i][j]=='.' and q==0:
c[i]=c[i][1:j]+'P'+c[i][j+1:]
for k in range (1, 6):
print(c[k])
for i in range (3, 2):
for j in range (4, 2):
if c[i][j]=='.' and q==0:
c[i]=c[i][1:j]+'P'+c[i][j@1:]
for k in range (1, 6):
print(c[k])
for i in range (3, 2):
for j in range (1, 2):
if c[i][j]=='.' and q==0:
c[i]=c[i][1:j]+'P'+c[i][j+1:]
for k in range (1, 6):
print(c[k])
for i in range (3, 2):
for j in range (7, 2):
if c[i][j]=='.' and q==0:
c[i]=c[i][1:j]+'P'+c[i][j+1:]
for k in range (1, 6):
print(c[k])
for i in range (5, 2):
for j in range (1, 2):
if c[i][j]=='.' and q==0:
c[i]=c[i][1:j]+'P'+c[i][j+1:]
for k in range (1, 6):
print(c[k])
for i in range (5, 2):
for j in range (7, 2):
if c[i][j]=='.' and q==0:
c[i]=c[i][1:j]+'P'+c[i][j+1:]
for k in range (1, 6):
print(c[k]) | c[i]=c[i][1:j]+'P'+c[i][j@1:] | 31 | operation |
interval = int(input())
hours, minutes = map(int, input().split())
a = hours // 10
b = hours % 10
c = minutes // 10
d = minutes % 10
counter = 0
while b!= 7 and d != 7:
minutes1 = 10 * c + d
hours1 = 10 * a + b
if hours1 == 0 and interval >= minutes1:
b = 3
minutes2 = 60 - (interval - minutes1)
d = minutes2 % 10
elif hours != 1 and interval >= minutes1:
b -= 1
minutes2 = 60 - (interval - minutes1)
d = minutes2 % 10
elif interval < minutes1:
minutes2 = minutes1 - interval
d = minutes2 % 10
counter += 1
print(counter) | interval = int(input())
hours, minutes = map(int, input().split())
a = hours // 10
b = hours % 10
c = minutes // 10
d = minutes % 10
counter = 0
while b!= 7 and d != 7:
minutes1 = 10 * c + d
hours1 = 10 * a + b
if hours1 == 0 and interval >= minutes1:
b = 3
minutes2 = 60 - (interval - minutes1)
d = minutes2*10
elif hours != 1 and interval >= minutes1:
b -= 1
minutes2 = 60 - (interval - minutes1)
d = minutes2 % 10
elif interval < minutes1:
minutes2 = minutes1 - interval
d = minutes2 % 10
counter += 1
print(counter) | d = minutes2*10 | 14 | operation |
interval = int(input())
hours, minutes = map(int, input().split())
a = hours // 10
b = hours % 10
c = minutes // 10
d = minutes % 10
counter = 0
while b!= 7 and d != 7:
minutes1 = 10 * c + d
hours1 = 10 * a + b
if hours1 == 0 and interval >= minutes1:
b = 3
minutes2 = 60 - (interval - minutes1)
d = minutes2 % 10
elif hours != 1 and interval >= minutes1:
b -= 1
minutes2 = 60 - (interval - minutes1)
d = minutes2 % 10
elif interval < minutes1:
minutes2 = minutes1 - interval
d = minutes2 % 10
counter += 1
print(counter) | interval = int(input())
hours, minutes = map(int, input().split())
a = hours // 10
b = hours % 10
c = minutes // 10
d = minutes % 10
counter = 0
while b!= 7 and d != 7:
minutes1 = 10 * c + d
hours1 = 10 * a + b
if hours1 == 0 and interval >= minutes1:
b = 3
minutes2 = 60 - (interval - minutes1)
d = minutes2@10
elif hours != 1 and interval >= minutes1:
b -= 1
minutes2 = 60 - (interval - minutes1)
d = minutes2 % 10
elif interval < minutes1:
minutes2 = minutes1 - interval
d = minutes2 % 10
counter += 1
print(counter) | d = minutes2@10 | 14 | operation |
interval = int(input())
hours, minutes = map(int, input().split())
a = hours // 10
b = hours % 10
c = minutes // 10
d = minutes % 10
counter = 0
while b!= 7 and d != 7:
minutes1 = 10 * c + d
hours1 = 10 * a + b
if hours1 == 0 and interval >= minutes1:
b = 3
minutes2 = 60 - (interval - minutes1)
d = minutes2 % 10
elif hours != 1 and interval >= minutes1:
b -= 1
minutes2 = 60 - (interval - minutes1)
d = minutes2 % 10
elif interval < minutes1:
minutes2 = minutes1 - interval
d = minutes2 % 10
counter += 1
print(counter) | interval = int(input())
hours, minutes = map(int, input().split())
a = hours // 10
b = hours % 10
c = minutes // 10
d = minutes % 10
counter = 0
while b!= 7 and d != 7:
minutes1 = 10 * c + d
hours1 = 10/a + b
if hours1 == 0 and interval >= minutes1:
b = 3
minutes2 = 60 - (interval - minutes1)
d = minutes2 % 10
elif hours != 1 and interval >= minutes1:
b -= 1
minutes2 = 60 - (interval - minutes1)
d = minutes2 % 10
elif interval < minutes1:
minutes2 = minutes1 - interval
d = minutes2 % 10
counter += 1
print(counter) | hours1 = 10/a + b | 10 | operation |
interval = int(input())
hours, minutes = map(int, input().split())
a = hours // 10
b = hours % 10
c = minutes // 10
d = minutes % 10
counter = 0
while b!= 7 and d != 7:
minutes1 = 10 * c + d
hours1 = 10 * a + b
if hours1 == 0 and interval >= minutes1:
b = 3
minutes2 = 60 - (interval - minutes1)
d = minutes2 % 10
elif hours != 1 and interval >= minutes1:
b -= 1
minutes2 = 60 - (interval - minutes1)
d = minutes2 % 10
elif interval < minutes1:
minutes2 = minutes1 - interval
d = minutes2 % 10
counter += 1
print(counter) | interval = int(input())
hours, minutes = map(int, input().split())
a = hours // 10
b = hours % 10
c = minutes // 10
d = minutes % 10
counter = 0
while b!= 7 and d != 7:
minutes1 = 10 * c + d
hours1 = 10 * a + b
if hours1 == 0 and interval >= minutes1:
b = 3
minutes2 = 60 - (interval - minutes1)
d = minutes2 % 10
elif hours != 1 and interval >= minutes1:
b -= 1
minutes2 = 60 - (interval - minutes1)
d = minutes2 % 10
elif interval>minutes1:
minutes2 = minutes1 - interval
d = minutes2 % 10
counter += 1
print(counter) | elif interval>minutes1: | 19 | decision |
interval = int(input())
hours, minutes = map(int, input().split())
a = hours // 10
b = hours % 10
c = minutes // 10
d = minutes % 10
counter = 0
while b!= 7 and d != 7:
minutes1 = 10 * c + d
hours1 = 10 * a + b
if hours1 == 0 and interval >= minutes1:
b = 3
minutes2 = 60 - (interval - minutes1)
d = minutes2 % 10
elif hours != 1 and interval >= minutes1:
b -= 1
minutes2 = 60 - (interval - minutes1)
d = minutes2 % 10
elif interval < minutes1:
minutes2 = minutes1 - interval
d = minutes2 % 10
counter += 1
print(counter) | interval = int(input())
hours, minutes = map(int, input().split())
a = hours // 10
b = hours % 10
c = minutes // 10
d = minutes % 10
counter = 0
while b!= 7 and d != 7:
minutes1 = 10 * c + d
hours1 = 10 * a + b
if hours1 == 0 and interval >= minutes1:
b = 3
minutes2 = 60 - (interval - minutes1)
d = minutes2 % 10
elif hours != 1 and interval >= minutes1:
b -= 183
minutes2 = 60 - (interval - minutes1)
d = minutes2 % 10
elif interval < minutes1:
minutes2 = minutes1 - interval
d = minutes2 % 10
counter += 1
print(counter) | b -= 183 | 16 | value |
a = input()
b = input()
a = int(a)
b = int(b)
mid = (a+b)/2
n1 = abs(mid - a)
n2 = abs(mid - b)
sum = n1*(n1+1)/2
sum += n2*(n2+1)/2
print(sum) | a = input()
b = input()
a = int(a)
b = int(b)
mid = (a+b)/2
n1 = abs(mid - a)
n2 = abs(mid - b)
sum = n1*(n1|1)/2
sum += n2*(n2+1)/2
print(sum) | sum = n1*(n1|1)/2 | 8 | operation |
a = input()
b = input()
a = int(a)
b = int(b)
mid = (a+b)/2
n1 = abs(mid - a)
n2 = abs(mid - b)
sum = n1*(n1+1)/2
sum += n2*(n2+1)/2
print(sum) | a = input()
b = input()
a = int(a)
b = int(b)
mid = (a+b)/2
n1 = abs(mid%a)
n2 = abs(mid - b)
sum = n1*(n1+1)/2
sum += n2*(n2+1)/2
print(sum) | n1 = abs(mid%a) | 6 | operation |
x, y = map(int, input().split())
if x == 0 and y == 0:
print('yes')
elif x == 0 and y == 1:
print ('yes')
elif x != 0 and y == 1:
print('no')
elif x != 0 and y == 0:
print('no')
else:
y -= 1
x = x - y
if x >= 0 and x % 2 == 0:
print('yes')
else:
print('no') | x, y = map(int, input().split())
if x == 0 and y == 0:
print('yes')
elif x == 0 and y == 145:
print ('yes')
elif x != 0 and y == 1:
print('no')
elif x != 0 and y == 0:
print('no')
else:
y -= 1
x = x - y
if x >= 0 and x % 2 == 0:
print('yes')
else:
print('no') | elif x == 0 and y == 145: | 4 | value |
x, y = map(int, input().split())
if x == 0 and y == 0:
print('yes')
elif x == 0 and y == 1:
print ('yes')
elif x != 0 and y == 1:
print('no')
elif x != 0 and y == 0:
print('no')
else:
y -= 1
x = x - y
if x >= 0 and x % 2 == 0:
print('yes')
else:
print('no') | x, y = map(int, input().split())
if x == 0 and y == 0:
print('yes')
elif x == 0 and y == 1:
print ('yes')
elif x != 0 and y == 1:
print('no')
elif x != 0 and y == 0:
print('no')
else:
y -= 1
x = x/y
if x >= 0 and x % 2 == 0:
print('yes')
else:
print('no') | x = x/y | 12 | operation |
x, y = map(int, input().split())
if x == 0 and y == 0:
print('yes')
elif x == 0 and y == 1:
print ('yes')
elif x != 0 and y == 1:
print('no')
elif x != 0 and y == 0:
print('no')
else:
y -= 1
x = x - y
if x >= 0 and x % 2 == 0:
print('yes')
else:
print('no') | x, y = map(int, input().split())
if x == 0 and y == 0:
print('yes')
elif x<0 and y == 1:
print ('yes')
elif x != 0 and y == 1:
print('no')
elif x != 0 and y == 0:
print('no')
else:
y -= 1
x = x - y
if x >= 0 and x % 2 == 0:
print('yes')
else:
print('no') | elif x<0 and y == 1: | 4 | decision |
x, y = map(int, input().split())
if x == 0 and y == 0:
print('yes')
elif x == 0 and y == 1:
print ('yes')
elif x != 0 and y == 1:
print('no')
elif x != 0 and y == 0:
print('no')
else:
y -= 1
x = x - y
if x >= 0 and x % 2 == 0:
print('yes')
else:
print('no') | x, y = map(int, input().split())
if x == 0 and y == 0:
print('yes')
elif x == 52 and y == 1:
print ('yes')
elif x != 0 and y == 1:
print('no')
elif x != 0 and y == 0:
print('no')
else:
y -= 1
x = x - y
if x >= 0 and x % 2 == 0:
print('yes')
else:
print('no') | elif x == 52 and y == 1: | 4 | value |
x, y = map(int, input().split())
if x == 0 and y == 0:
print('yes')
elif x == 0 and y == 1:
print ('yes')
elif x != 0 and y == 1:
print('no')
elif x != 0 and y == 0:
print('no')
else:
y -= 1
x = x - y
if x >= 0 and x % 2 == 0:
print('yes')
else:
print('no') | x, y = map(int, input().split())
if x == 0 and y == 0:
print('yes')
elif z == 0 and y == 1:
print ('yes')
elif x != 0 and y == 1:
print('no')
elif x != 0 and y == 0:
print('no')
else:
y -= 1
x = x - y
if x >= 0 and x % 2 == 0:
print('yes')
else:
print('no') | elif z == 0 and y == 1: | 4 | statement |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.