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 |
|---|---|---|---|---|
hh,mm=map(int,input().split())
h,d,c,n=map(int,input().split())
cos=c-(c*0.2)
if hh<20:
new_h=h+(60*(20-hh)+mm)*d
if new_h*cos > h*c:
tot=(round(h/n,3))*c
else:
tot=(round(new_h/n,3))*cos
else:
tot=(round(h/n,3))*cos
print(round(tot,3)) | hh,mm=map(int,input().split())
h,d,c,n=map(int,input().split())
cos=c-(c*0.2)
if hh<20:
new_h=h+(92*(20-hh)+mm)*d
if new_h*cos > h*c:
tot=(round(h/n,3))*c
else:
tot=(round(new_h/n,3))*cos
else:
tot=(round(h/n,3))*cos
print(round(tot,3)) | new_h=h+(92*(20-hh)+mm)*d | 5 | value |
hh,mm=map(int,input().split())
h,d,c,n=map(int,input().split())
cos=c-(c*0.2)
if hh<20:
new_h=h+(60*(20-hh)+mm)*d
if new_h*cos > h*c:
tot=(round(h/n,3))*c
else:
tot=(round(new_h/n,3))*cos
else:
tot=(round(h/n,3))*cos
print(round(tot,3)) | hh,mm=map(int,input().split())
h,d,c,n=map(int,input().split())
cos=c-(c*0.2)
if hh<20:
new_h=h+(60*(20-hh)+mm)-d
if new_h*cos > h*c:
tot=(round(h/n,3))*c
else:
tot=(round(new_h/n,3))*cos
else:
tot=(round(h/n,3))*cos
print(round(tot,3)) | new_h=h+(60*(20-hh)+mm)-d | 5 | operation |
hh,mm=map(int,input().split())
h,d,c,n=map(int,input().split())
cos=c-(c*0.2)
if hh<20:
new_h=h+(60*(20-hh)+mm)*d
if new_h*cos > h*c:
tot=(round(h/n,3))*c
else:
tot=(round(new_h/n,3))*cos
else:
tot=(round(h/n,3))*cos
print(round(tot,3)) | hh,mm=map(int,input().split())
h,d,c,n=map(int,input().split())
cos=c-(c*0.2)
if hh<20:
new_h=h+(60*(20-hh)+mm)*d
if new_h<<cos > h*c:
tot=(round(h/n,3))*c
else:
tot=(round(new_h/n,3))*cos
else:
tot=(round(h/n,3))*cos
print(round(tot,3)) | if new_h<<cos > h*c: | 6 | operation |
hh,mm=map(int,input().split())
h,d,c,n=map(int,input().split())
cos=c-(c*0.2)
if hh<20:
new_h=h+(60*(20-hh)+mm)*d
if new_h*cos > h*c:
tot=(round(h/n,3))*c
else:
tot=(round(new_h/n,3))*cos
else:
tot=(round(h/n,3))*cos
print(round(tot,3)) | hh,mm=map(int,input().split())
h,d,c,n=map(int,input().split())
cos=c-(c*0.2)
if hh<20:
new_h=h+(60*(20-hh)+mm)*d
if new_h*cos==h*c:
tot=(round(h/n,3))*c
else:
tot=(round(new_h/n,3))*cos
else:
tot=(round(h/n,3))*cos
print(round(tot,3)) | if new_h*cos==h*c: | 6 | decision |
hh,mm=map(int,input().split())
h,d,c,n=map(int,input().split())
cos=c-(c*0.2)
if hh<20:
new_h=h+(60*(20-hh)+mm)*d
if new_h*cos > h*c:
tot=(round(h/n,3))*c
else:
tot=(round(new_h/n,3))*cos
else:
tot=(round(h/n,3))*cos
print(round(tot,3)) | hh,mm=map(int,input().split())
h,d,c,n=map(int,input().split())
cos=c-(c<<0.2)
if hh<20:
new_h=h+(60*(20-hh)+mm)*d
if new_h*cos > h*c:
tot=(round(h/n,3))*c
else:
tot=(round(new_h/n,3))*cos
else:
tot=(round(h/n,3))*cos
print(round(tot,3)) | cos=c-(c<<0.2) | 3 | operation |
import math
test = int(input())
for i in range(0, test):
x = int(input())
sq = math.ceil( ( math.sqrt(x) ) )
if(x == 0):
print("1 1")
elif(sq * sq == x):
print("-1")
else:
print(sq, sq) | import math
test = int(input())
for i in range(0, test):
x = int(input())
sq = math.ceil( ( math.sqrt(x) ) )
if(x == 0):
print("1 1")
elif(sq * sq<x):
print("-1")
else:
print(sq, sq) | elif(sq * sq<x): | 8 | decision |
import math
test = int(input())
for i in range(0, test):
x = int(input())
sq = math.ceil( ( math.sqrt(x) ) )
if(x == 0):
print("1 1")
elif(sq * sq == x):
print("-1")
else:
print(sq, sq) | import math
test = int(input())
for i in range(0, test):
x = int(input())
sq = math.ceil( ( math.sqrt(x) ) )
if(x == 0):
print("1 1")
elif(sq%sq == x):
print("-1")
else:
print(sq, sq) | elif(sq%sq == x): | 8 | operation |
import math
test = int(input())
for i in range(0, test):
x = int(input())
sq = math.ceil( ( math.sqrt(x) ) )
if(x == 0):
print("1 1")
elif(sq * sq == x):
print("-1")
else:
print(sq, sq) | import math
test = int(input())
for i in range(0, test):
x = int(input())
sq = math.ceil( ( math.sqrt(x) ) )
if(x<0):
print("1 1")
elif(sq * sq == x):
print("-1")
else:
print(sq, sq) | if(x<0): | 6 | decision |
import math
test = int(input())
for i in range(0, test):
x = int(input())
sq = math.ceil( ( math.sqrt(x) ) )
if(x == 0):
print("1 1")
elif(sq * sq == x):
print("-1")
else:
print(sq, sq) | import math
test = int(input())
for i in range(0, test):
x = int(input())
sq = math.ceil( ( math.sqrt(x) ) )
if(x<0):
print("1 1")
elif(sq * sq == x):
print("-1")
else:
print(sq, sq) | if(x<0): | 6 | decision |
import math
test = int(input())
for i in range(0, test):
x = int(input())
sq = math.ceil( ( math.sqrt(x) ) )
if(x == 0):
print("1 1")
elif(sq * sq == x):
print("-1")
else:
print(sq, sq) | import math
test = int(input())
for i in range(0, test):
x = int(input())
sq = math.ceil( ( math.sqrt(x) ) )
if(x == 0):
print("1 1")
elif(sq/sq == x):
print("-1")
else:
print(sq, sq) | elif(sq/sq == x): | 8 | operation |
n = int(input())
s = input()
l = [[1, s[0]]]
for e in s[1:]:
if e == l[-1][1]:
l[-1][0] += 1
else:
last = e
l = l + [[1, e]]
flag = True
possibilities = []
for i in range(len(l)):
if l[i][0] >= 2 and l[i][1] != "?":
print("No")
flag = False
break
elif l[i][1] == "?":
if l[i][0] == 1 and i != 0 and i != (len(l) - 1):
possibilities += [len([e for e in ("C","Y","M") if e not in (l[i-1][1],l[i+1][1])])]
elif l[i][0] == 1 and i == 0:
possibilities += [len([e for e in ("C","Y","M") if e not in (l[i+1][1],)])]
elif l[i][0] == 1 and i == (len(l) -1):
possibilities += [len([e for e in ("C","Y","M") if e not in (l[i-1][1],)])]
elif l[i][0] >= 2:
possibilities += [2]
if (2 in possibilities or 3 in possibilities) and flag:
print("Yes") | n = int(input())
s = input()
l = [[1, s[0]]]
for e in s[1:]:
if e == l[-1][1]:
l[-1][0] += 1
else:
last = e
l = l + [[1, e]]
flag = True
possibilities = []
for i in range(len(l)):
if l[i][0] >= 2 and l[i][1] != "?":
print("No")
flag = False
break
elif l[i][1]<"?":
if l[i][0] == 1 and i != 0 and i != (len(l) - 1):
possibilities += [len([e for e in ("C","Y","M") if e not in (l[i-1][1],l[i+1][1])])]
elif l[i][0] == 1 and i == 0:
possibilities += [len([e for e in ("C","Y","M") if e not in (l[i+1][1],)])]
elif l[i][0] == 1 and i == (len(l) -1):
possibilities += [len([e for e in ("C","Y","M") if e not in (l[i-1][1],)])]
elif l[i][0] >= 2:
possibilities += [2]
if (2 in possibilities or 3 in possibilities) and flag:
print("Yes") | elif l[i][1]<"?": | 19 | decision |
n = int(input())
s = input()
l = [[1, s[0]]]
for e in s[1:]:
if e == l[-1][1]:
l[-1][0] += 1
else:
last = e
l = l + [[1, e]]
flag = True
possibilities = []
for i in range(len(l)):
if l[i][0] >= 2 and l[i][1] != "?":
print("No")
flag = False
break
elif l[i][1] == "?":
if l[i][0] == 1 and i != 0 and i != (len(l) - 1):
possibilities += [len([e for e in ("C","Y","M") if e not in (l[i-1][1],l[i+1][1])])]
elif l[i][0] == 1 and i == 0:
possibilities += [len([e for e in ("C","Y","M") if e not in (l[i+1][1],)])]
elif l[i][0] == 1 and i == (len(l) -1):
possibilities += [len([e for e in ("C","Y","M") if e not in (l[i-1][1],)])]
elif l[i][0] >= 2:
possibilities += [2]
if (2 in possibilities or 3 in possibilities) and flag:
print("Yes") | n = int(input())
s = input()
l = [[1, s[0]]]
for e in s[1:]:
if e == l[-1][1]:
l[-1][0] += 1
else:
last = e
l = l + [[1, e]]
flag = True
possibilities = []
for i in range(len(l)):
if l[i][0] >= 2 and l[i][1] != "?":
print("No")
flag = False
break
elif l[i][1] == "?":
if l[i][0] == 1 and i != 0 and i != (len(l) - 1):
possibilities += [len([e for e in ("C","Y","M") if e not in (l[i-1][1],l[i+1][1])])]
elif l[i][0] == 1 and i == 0:
possibilities += [len([e for e in ("C","Y","M") if e not in (l[i+1][1],)])]
elif l[i][0] == 1 and i == (len(l)/1):
possibilities += [len([e for e in ("C","Y","M") if e not in (l[i-1][1],)])]
elif l[i][0] >= 2:
possibilities += [2]
if (2 in possibilities or 3 in possibilities) and flag:
print("Yes") | elif l[i][0] == 1 and i == (len(l)/1): | 24 | operation |
n = int(input())
s = input()
l = [[1, s[0]]]
for e in s[1:]:
if e == l[-1][1]:
l[-1][0] += 1
else:
last = e
l = l + [[1, e]]
flag = True
possibilities = []
for i in range(len(l)):
if l[i][0] >= 2 and l[i][1] != "?":
print("No")
flag = False
break
elif l[i][1] == "?":
if l[i][0] == 1 and i != 0 and i != (len(l) - 1):
possibilities += [len([e for e in ("C","Y","M") if e not in (l[i-1][1],l[i+1][1])])]
elif l[i][0] == 1 and i == 0:
possibilities += [len([e for e in ("C","Y","M") if e not in (l[i+1][1],)])]
elif l[i][0] == 1 and i == (len(l) -1):
possibilities += [len([e for e in ("C","Y","M") if e not in (l[i-1][1],)])]
elif l[i][0] >= 2:
possibilities += [2]
if (2 in possibilities or 3 in possibilities) and flag:
print("Yes") | n = int(input())
s = input()
l = [[1, s[0]]]
for e in s[1:]:
if e == l[-1][1]:
l[-1][0] += 1
else:
last = e
l = l + [[1, e]]
flag = True
possibilities = []
for i in range(len(l)):
if l[i][0] >= 2 and l[i][1] != "?":
print("No")
flag = False
break
elif l[i][1] == "?":
if l[i][0] == 1 and i != 0 and i != (len(l) - 1):
possibilities += [len([e for e in ("C","Y","M") if e not in (l[i|1][1],l[i+1][1])])]
elif l[i][0] == 1 and i == 0:
possibilities += [len([e for e in ("C","Y","M") if e not in (l[i+1][1],)])]
elif l[i][0] == 1 and i == (len(l) -1):
possibilities += [len([e for e in ("C","Y","M") if e not in (l[i-1][1],)])]
elif l[i][0] >= 2:
possibilities += [2]
if (2 in possibilities or 3 in possibilities) and flag:
print("Yes") | possibilities += [len([e for e in ("C","Y","M") if e not in (l[i|1][1],l[i+1][1])])] | 21 | operation |
n = int(input())
s = input()
l = [[1, s[0]]]
for e in s[1:]:
if e == l[-1][1]:
l[-1][0] += 1
else:
last = e
l = l + [[1, e]]
flag = True
possibilities = []
for i in range(len(l)):
if l[i][0] >= 2 and l[i][1] != "?":
print("No")
flag = False
break
elif l[i][1] == "?":
if l[i][0] == 1 and i != 0 and i != (len(l) - 1):
possibilities += [len([e for e in ("C","Y","M") if e not in (l[i-1][1],l[i+1][1])])]
elif l[i][0] == 1 and i == 0:
possibilities += [len([e for e in ("C","Y","M") if e not in (l[i+1][1],)])]
elif l[i][0] == 1 and i == (len(l) -1):
possibilities += [len([e for e in ("C","Y","M") if e not in (l[i-1][1],)])]
elif l[i][0] >= 2:
possibilities += [2]
if (2 in possibilities or 3 in possibilities) and flag:
print("Yes") | n = int(input())
s = input()
l = [[1, s[0]]]
for e in s[1:]:
if e == l[-1][1]:
l[-1][0] += 1
else:
last = e
l = l + [[1, e]]
flag = True
possibilities = []
for i in range(len(l)):
if l[i][0] >= 2 and l[i][1] != "?":
print("No")
flag = False
break
elif l[i][1]<"?":
if l[i][0] == 1 and i != 0 and i != (len(l) - 1):
possibilities += [len([e for e in ("C","Y","M") if e not in (l[i-1][1],l[i+1][1])])]
elif l[i][0] == 1 and i == 0:
possibilities += [len([e for e in ("C","Y","M") if e not in (l[i+1][1],)])]
elif l[i][0] == 1 and i == (len(l) -1):
possibilities += [len([e for e in ("C","Y","M") if e not in (l[i-1][1],)])]
elif l[i][0] >= 2:
possibilities += [2]
if (2 in possibilities or 3 in possibilities) and flag:
print("Yes") | elif l[i][1]<"?": | 19 | decision |
n = int(input())
s = input()
l = [[1, s[0]]]
for e in s[1:]:
if e == l[-1][1]:
l[-1][0] += 1
else:
last = e
l = l + [[1, e]]
flag = True
possibilities = []
for i in range(len(l)):
if l[i][0] >= 2 and l[i][1] != "?":
print("No")
flag = False
break
elif l[i][1] == "?":
if l[i][0] == 1 and i != 0 and i != (len(l) - 1):
possibilities += [len([e for e in ("C","Y","M") if e not in (l[i-1][1],l[i+1][1])])]
elif l[i][0] == 1 and i == 0:
possibilities += [len([e for e in ("C","Y","M") if e not in (l[i+1][1],)])]
elif l[i][0] == 1 and i == (len(l) -1):
possibilities += [len([e for e in ("C","Y","M") if e not in (l[i-1][1],)])]
elif l[i][0] >= 2:
possibilities += [2]
if (2 in possibilities or 3 in possibilities) and flag:
print("Yes") | n = int(input())
s = input()
l = [[1, s[0]]]
for e in s[1:]:
if e == l[-1][1]:
l[-1][0] += 1
else:
last = e
l = l + [[1, e]]
flag = True
possibilities = []
for i in range(len(l)):
if l[i][0]<=2 and l[i][1] != "?":
print("No")
flag = False
break
elif l[i][1] == "?":
if l[i][0] == 1 and i != 0 and i != (len(l) - 1):
possibilities += [len([e for e in ("C","Y","M") if e not in (l[i-1][1],l[i+1][1])])]
elif l[i][0] == 1 and i == 0:
possibilities += [len([e for e in ("C","Y","M") if e not in (l[i+1][1],)])]
elif l[i][0] == 1 and i == (len(l) -1):
possibilities += [len([e for e in ("C","Y","M") if e not in (l[i-1][1],)])]
elif l[i][0] >= 2:
possibilities += [2]
if (2 in possibilities or 3 in possibilities) and flag:
print("Yes") | if l[i][0]<=2 and l[i][1] != "?": | 15 | decision |
x=int(input())
arr=list(map(int,input().split()))
if arr[0]/10==7 or arr[0]%10==7 or arr[1]/10==7 or arr[1]%10==7:
print(0)
else:
cout=1
while True:
arr[1]-=x
if arr[1]<0:
arr[1]+=60
arr[0]-=1
if arr[0]<0:
arr[0]+=24
cout+=1
if arr[1]==7 or arr[1]==17 or arr[1]==27 or arr[1]==37 or arr[1]==47 or arr[1]==57:
break
if arr[0]==7 or arr[0]==17:
break
print(cout) | x=int(input())
arr=list(map(int,input().split()))
if arr[0]/10==7 or arr[0]%10==7 or arr[1]/10==7 or arr[1]%10==7:
print(0)
else:
cout=1
while True:
arr[1]-=x
if arr[1]<0:
arr[1]+=60
arr[0]-=1
if arr[0]<0:
z[0]+=24
cout+=1
if arr[1]==7 or arr[1]==17 or arr[1]==27 or arr[1]==37 or arr[1]==47 or arr[1]==57:
break
if arr[0]==7 or arr[0]==17:
break
print(cout) | z[0]+=24 | 13 | statement |
x=int(input())
arr=list(map(int,input().split()))
if arr[0]/10==7 or arr[0]%10==7 or arr[1]/10==7 or arr[1]%10==7:
print(0)
else:
cout=1
while True:
arr[1]-=x
if arr[1]<0:
arr[1]+=60
arr[0]-=1
if arr[0]<0:
arr[0]+=24
cout+=1
if arr[1]==7 or arr[1]==17 or arr[1]==27 or arr[1]==37 or arr[1]==47 or arr[1]==57:
break
if arr[0]==7 or arr[0]==17:
break
print(cout) | x=int(input())
arr=list(map(int,input().split()))
if arr[0]/10==7 or arr[0]%10==7 or arr[1]/10==7 or arr[1]%10==7:
print(0)
else:
cout=1
while True:
arr[1]-=x
if arr[1]<0:
arr[1]+=60
arr[0]-=1
if arr[0]<0:
arr[0]+=24
cout+=1
if arr[1]==7 or arr[1]==17 or arr[1]<27 or arr[1]==37 or arr[1]==47 or arr[1]==57:
break
if arr[0]==7 or arr[0]==17:
break
print(cout) | if arr[1]==7 or arr[1]==17 or arr[1]<27 or arr[1]==37 or arr[1]==47 or arr[1]==57: | 16 | decision |
x=int(input())
arr=list(map(int,input().split()))
if arr[0]/10==7 or arr[0]%10==7 or arr[1]/10==7 or arr[1]%10==7:
print(0)
else:
cout=1
while True:
arr[1]-=x
if arr[1]<0:
arr[1]+=60
arr[0]-=1
if arr[0]<0:
arr[0]+=24
cout+=1
if arr[1]==7 or arr[1]==17 or arr[1]==27 or arr[1]==37 or arr[1]==47 or arr[1]==57:
break
if arr[0]==7 or arr[0]==17:
break
print(cout) | x=int(input())
arr=list(map(int,input().split()))
if arr[0]/10==7 or arr[0]%10==7 or arr[1]/10==7 or arr[1]%113==7:
print(0)
else:
cout=1
while True:
arr[1]-=x
if arr[1]<0:
arr[1]+=60
arr[0]-=1
if arr[0]<0:
arr[0]+=24
cout+=1
if arr[1]==7 or arr[1]==17 or arr[1]==27 or arr[1]==37 or arr[1]==47 or arr[1]==57:
break
if arr[0]==7 or arr[0]==17:
break
print(cout) | if arr[0]/10==7 or arr[0]%10==7 or arr[1]/10==7 or arr[1]%113==7: | 3 | value |
x=int(input())
arr=list(map(int,input().split()))
if arr[0]/10==7 or arr[0]%10==7 or arr[1]/10==7 or arr[1]%10==7:
print(0)
else:
cout=1
while True:
arr[1]-=x
if arr[1]<0:
arr[1]+=60
arr[0]-=1
if arr[0]<0:
arr[0]+=24
cout+=1
if arr[1]==7 or arr[1]==17 or arr[1]==27 or arr[1]==37 or arr[1]==47 or arr[1]==57:
break
if arr[0]==7 or arr[0]==17:
break
print(cout) | x=int(input())
arr=list(map(int,input().split()))
if arr[0]/10==7 or arr[0]%10<7 or arr[1]/10==7 or arr[1]%10==7:
print(0)
else:
cout=1
while True:
arr[1]-=x
if arr[1]<0:
arr[1]+=60
arr[0]-=1
if arr[0]<0:
arr[0]+=24
cout+=1
if arr[1]==7 or arr[1]==17 or arr[1]==27 or arr[1]==37 or arr[1]==47 or arr[1]==57:
break
if arr[0]==7 or arr[0]==17:
break
print(cout) | if arr[0]/10==7 or arr[0]%10<7 or arr[1]/10==7 or arr[1]%10==7: | 3 | decision |
x=int(input())
arr=list(map(int,input().split()))
if arr[0]/10==7 or arr[0]%10==7 or arr[1]/10==7 or arr[1]%10==7:
print(0)
else:
cout=1
while True:
arr[1]-=x
if arr[1]<0:
arr[1]+=60
arr[0]-=1
if arr[0]<0:
arr[0]+=24
cout+=1
if arr[1]==7 or arr[1]==17 or arr[1]==27 or arr[1]==37 or arr[1]==47 or arr[1]==57:
break
if arr[0]==7 or arr[0]==17:
break
print(cout) | x=int(input())
arr=list(map(int,z().split()))
if arr[0]/10==7 or arr[0]%10==7 or arr[1]/10==7 or arr[1]%10==7:
print(0)
else:
cout=1
while True:
arr[1]-=x
if arr[1]<0:
arr[1]+=60
arr[0]-=1
if arr[0]<0:
arr[0]+=24
cout+=1
if arr[1]==7 or arr[1]==17 or arr[1]==27 or arr[1]==37 or arr[1]==47 or arr[1]==57:
break
if arr[0]==7 or arr[0]==17:
break
print(cout) | arr=list(map(int,z().split())) | 2 | statement |
n,m=[int(x) for x in input().split()]
tlan=[int(x) for x in input().split()]
blan=[int(x) for x in input().split()]
tlan.sort()
blan.sort()
if tlan[-2]>=0 and blan[-1]>=0:
print(tlan[-2]*blan[-1])
elif tlan[-2]<=0 and blan[-1]>=0:
if 0 in blan:
print(0)
else:
print(tlan[-2]*blan[0])
elif tlan[-2]<=0 and blan[-1]<=0:
print(tlan[-2]*blan[0])
elif tlan[-2]>=0 and blan[-1]<=0:
if 0 in tlan:
print(0)
else:
print(tlan[-2]*blan[-1])
| n,m=[int(x) for x in input().split()]
tlan=[int(x) for x in input().split()]
blan=[int(x) for x in input().split()]
tlan.sort()
blan.sort()
if tlan[-2]>=0 and blan[-1]>=0:
print(tlan[-2]^blan[-1])
elif tlan[-2]<=0 and blan[-1]>=0:
if 0 in blan:
print(0)
else:
print(tlan[-2]*blan[0])
elif tlan[-2]<=0 and blan[-1]<=0:
print(tlan[-2]*blan[0])
elif tlan[-2]>=0 and blan[-1]<=0:
if 0 in tlan:
print(0)
else:
print(tlan[-2]*blan[-1])
| print(tlan[-2]^blan[-1]) | 10 | operation |
n,m=[int(x) for x in input().split()]
tlan=[int(x) for x in input().split()]
blan=[int(x) for x in input().split()]
tlan.sort()
blan.sort()
if tlan[-2]>=0 and blan[-1]>=0:
print(tlan[-2]*blan[-1])
elif tlan[-2]<=0 and blan[-1]>=0:
if 0 in blan:
print(0)
else:
print(tlan[-2]*blan[0])
elif tlan[-2]<=0 and blan[-1]<=0:
print(tlan[-2]*blan[0])
elif tlan[-2]>=0 and blan[-1]<=0:
if 0 in tlan:
print(0)
else:
print(tlan[-2]*blan[-1])
| n,m=[int(x) for x in input().split()]
tlan=[int(x) for x in input().split()]
blan=[int(x) for x in input().split()]
tlan.sort()
blan.sort()
if tlan[-2]>=0 and blan[-1]>=0:
print(tlan[-2]*blan[-1])
elif tlan[-2]<=0 and blan[-1]>=0:
if 0 in blan:
print(0)
else:
print(tlan[-2]*blan[0])
elif tlan[-2]>=0 and blan[-1]<=0:
print(tlan[-2]*blan[0])
elif tlan[-2]>=0 and blan[-1]<=0:
if 0 in tlan:
print(0)
else:
print(tlan[-2]*blan[-1])
| elif tlan[-2]>=0 and blan[-1]<=0: | 16 | decision |
n,m=[int(x) for x in input().split()]
tlan=[int(x) for x in input().split()]
blan=[int(x) for x in input().split()]
tlan.sort()
blan.sort()
if tlan[-2]>=0 and blan[-1]>=0:
print(tlan[-2]*blan[-1])
elif tlan[-2]<=0 and blan[-1]>=0:
if 0 in blan:
print(0)
else:
print(tlan[-2]*blan[0])
elif tlan[-2]<=0 and blan[-1]<=0:
print(tlan[-2]*blan[0])
elif tlan[-2]>=0 and blan[-1]<=0:
if 0 in tlan:
print(0)
else:
print(tlan[-2]*blan[-1])
| n,m=[int(x) for x in input().split()]
tlan=[int(x) for x in input().split()]
blan=[int(x) for x in input().split()]
tlan.sort()
blan.sort()
if tlan[-2]>=0 and blan[-14]>=0:
print(tlan[-2]*blan[-1])
elif tlan[-2]<=0 and blan[-1]>=0:
if 0 in blan:
print(0)
else:
print(tlan[-2]*blan[0])
elif tlan[-2]<=0 and blan[-1]<=0:
print(tlan[-2]*blan[0])
elif tlan[-2]>=0 and blan[-1]<=0:
if 0 in tlan:
print(0)
else:
print(tlan[-2]*blan[-1])
| if tlan[-2]>=0 and blan[-14]>=0: | 9 | value |
n,m=[int(x) for x in input().split()]
tlan=[int(x) for x in input().split()]
blan=[int(x) for x in input().split()]
tlan.sort()
blan.sort()
if tlan[-2]>=0 and blan[-1]>=0:
print(tlan[-2]*blan[-1])
elif tlan[-2]<=0 and blan[-1]>=0:
if 0 in blan:
print(0)
else:
print(tlan[-2]*blan[0])
elif tlan[-2]<=0 and blan[-1]<=0:
print(tlan[-2]*blan[0])
elif tlan[-2]>=0 and blan[-1]<=0:
if 0 in tlan:
print(0)
else:
print(tlan[-2]*blan[-1])
| n,m=[int(x) for x in input().split()]
tlan=[int(x) for x in input().split()]
blan=[int(x) for x in input().split()]
tlan.sort()
blan.sort()
if tlan[-2]>=0 and blan[-1]>=0:
print(tlan[-2]*blan[-1])
elif x[-2]<=0 and blan[-1]>=0:
if 0 in blan:
print(0)
else:
print(tlan[-2]*blan[0])
elif tlan[-2]<=0 and blan[-1]<=0:
print(tlan[-2]*blan[0])
elif tlan[-2]>=0 and blan[-1]<=0:
if 0 in tlan:
print(0)
else:
print(tlan[-2]*blan[-1])
| elif x[-2]<=0 and blan[-1]>=0: | 11 | statement |
n,m=[int(x) for x in input().split()]
tlan=[int(x) for x in input().split()]
blan=[int(x) for x in input().split()]
tlan.sort()
blan.sort()
if tlan[-2]>=0 and blan[-1]>=0:
print(tlan[-2]*blan[-1])
elif tlan[-2]<=0 and blan[-1]>=0:
if 0 in blan:
print(0)
else:
print(tlan[-2]*blan[0])
elif tlan[-2]<=0 and blan[-1]<=0:
print(tlan[-2]*blan[0])
elif tlan[-2]>=0 and blan[-1]<=0:
if 0 in tlan:
print(0)
else:
print(tlan[-2]*blan[-1])
| n,m=[z(x) for x in input().split()]
tlan=[int(x) for x in input().split()]
blan=[int(x) for x in input().split()]
tlan.sort()
blan.sort()
if tlan[-2]>=0 and blan[-1]>=0:
print(tlan[-2]*blan[-1])
elif tlan[-2]<=0 and blan[-1]>=0:
if 0 in blan:
print(0)
else:
print(tlan[-2]*blan[0])
elif tlan[-2]<=0 and blan[-1]<=0:
print(tlan[-2]*blan[0])
elif tlan[-2]>=0 and blan[-1]<=0:
if 0 in tlan:
print(0)
else:
print(tlan[-2]*blan[-1])
| n,m=[z(x) for x in input().split()] | 1 | statement |
x=int(input())
i=0
h,m=input().split()
h=int(h)
m=int(m)
while ((m-7)%10!=0):
if (h-7)%10==0:
break
m=m-x
i+=1
if m<0:
h=h-1
if h<0:
h=23
m=60+m
print(i)
| x=int(input())
i=0
h,m=input().split()
h=int(h)
m=int(m)
while ((m-7)%10!=0):
if (h-7)%10==0:
break
m=m-x
i+=1
if m>0:
h=h-1
if h<0:
h=23
m=60+m
print(i)
| if m>0: | 11 | decision |
x=int(input())
i=0
h,m=input().split()
h=int(h)
m=int(m)
while ((m-7)%10!=0):
if (h-7)%10==0:
break
m=m-x
i+=1
if m<0:
h=h-1
if h<0:
h=23
m=60+m
print(i)
| x=int(input())
i=0
h,m=input().split()
h=int(h)
m=int(m)
while ((m-7)%10!=0):
if (h-7)%10==0:
break
m=m-x
i+=1
if m>0:
h=h-1
if h<0:
h=23
m=60+m
print(i)
| if m>0: | 11 | decision |
x=int(input())
i=0
h,m=input().split()
h=int(h)
m=int(m)
while ((m-7)%10!=0):
if (h-7)%10==0:
break
m=m-x
i+=1
if m<0:
h=h-1
if h<0:
h=23
m=60+m
print(i)
| x=int(input())
i=0
h,m=input().split()
h=int(h)
m=int(m)
while ((m@7)%10!=0):
if (h-7)%10==0:
break
m=m-x
i+=1
if m<0:
h=h-1
if h<0:
h=23
m=60+m
print(i)
| while ((m@7)%10!=0): | 6 | operation |
x=int(input())
i=0
h,m=input().split()
h=int(h)
m=int(m)
while ((m-7)%10!=0):
if (h-7)%10==0:
break
m=m-x
i+=1
if m<0:
h=h-1
if h<0:
h=23
m=60+m
print(i)
| x=int(input())
i=0
h,m=input().split()
h=int(h)
m=int(m)
while ((m-7)%10!=0):
if (h-7)%10==0:
break
m=m<<x
i+=1
if m<0:
h=h-1
if h<0:
h=23
m=60+m
print(i)
| m=m<<x | 9 | operation |
p = [0] * 6
s = [0] * 6
ans = [0] * 1000000
for i in range(10):
ans[i] = i
for a in range(10):
s[0] = a
p[0] = a if a != 0 else 1
for b in range(10):
s[1] = s[0]*10 + b
p[1] = p[0] * b if b != 0 else p[0]
for c in range(10):
s[2] = s[1]*10 + c
p[2] = p[1]*c if c != 0 else p[1]
for d in range(10):
s[3] = s[2]*10 + d
p[3] = p[2]*d if d != 0 else p[2]
for e in range(10):
s[4] = s[3]*10 + e
p[4] = p[3]*e if e != 0 else p[3]
for f in range(10):
s[5] = s[4]*10 + f
p[5] = p[4]*f if f != 0 else p[4]
if p[5] < 10:
ans[s[5]] = p[5]
else:
ans[s[5]] = ans[p[5]]
Q = int(input())
for i in range(Q):
l, r, k = list(map(int, input().split()))
cnt = 0
for j in range(l, r+1):
if ans[j] == k:
cnt += 1
print(cnt)
| p = [0] * 6
s = [0] * 6
ans = [0]|1000000
for i in range(10):
ans[i] = i
for a in range(10):
s[0] = a
p[0] = a if a != 0 else 1
for b in range(10):
s[1] = s[0]*10 + b
p[1] = p[0] * b if b != 0 else p[0]
for c in range(10):
s[2] = s[1]*10 + c
p[2] = p[1]*c if c != 0 else p[1]
for d in range(10):
s[3] = s[2]*10 + d
p[3] = p[2]*d if d != 0 else p[2]
for e in range(10):
s[4] = s[3]*10 + e
p[4] = p[3]*e if e != 0 else p[3]
for f in range(10):
s[5] = s[4]*10 + f
p[5] = p[4]*f if f != 0 else p[4]
if p[5] < 10:
ans[s[5]] = p[5]
else:
ans[s[5]] = ans[p[5]]
Q = int(input())
for i in range(Q):
l, r, k = list(map(int, input().split()))
cnt = 0
for j in range(l, r+1):
if ans[j] == k:
cnt += 1
print(cnt)
| ans = [0]|1000000 | 3 | operation |
p = [0] * 6
s = [0] * 6
ans = [0] * 1000000
for i in range(10):
ans[i] = i
for a in range(10):
s[0] = a
p[0] = a if a != 0 else 1
for b in range(10):
s[1] = s[0]*10 + b
p[1] = p[0] * b if b != 0 else p[0]
for c in range(10):
s[2] = s[1]*10 + c
p[2] = p[1]*c if c != 0 else p[1]
for d in range(10):
s[3] = s[2]*10 + d
p[3] = p[2]*d if d != 0 else p[2]
for e in range(10):
s[4] = s[3]*10 + e
p[4] = p[3]*e if e != 0 else p[3]
for f in range(10):
s[5] = s[4]*10 + f
p[5] = p[4]*f if f != 0 else p[4]
if p[5] < 10:
ans[s[5]] = p[5]
else:
ans[s[5]] = ans[p[5]]
Q = int(input())
for i in range(Q):
l, r, k = list(map(int, input().split()))
cnt = 0
for j in range(l, r+1):
if ans[j] == k:
cnt += 1
print(cnt)
| p = [0] * 6
s = [0] * 6
ans = [0] * 1000000
for i in range(10):
ans[i] = i
for a in range(10):
s[0] = a
p[0] = a if a != 0 else 1
for b in range(10):
s[1] = s[0]*10 + b
p[1] = p[0]<<b if b != 0 else p[0]
for c in range(10):
s[2] = s[1]*10 + c
p[2] = p[1]*c if c != 0 else p[1]
for d in range(10):
s[3] = s[2]*10 + d
p[3] = p[2]*d if d != 0 else p[2]
for e in range(10):
s[4] = s[3]*10 + e
p[4] = p[3]*e if e != 0 else p[3]
for f in range(10):
s[5] = s[4]*10 + f
p[5] = p[4]*f if f != 0 else p[4]
if p[5] < 10:
ans[s[5]] = p[5]
else:
ans[s[5]] = ans[p[5]]
Q = int(input())
for i in range(Q):
l, r, k = list(map(int, input().split()))
cnt = 0
for j in range(l, r+1):
if ans[j] == k:
cnt += 1
print(cnt)
| p[1] = p[0]<<b if b != 0 else p[0] | 11 | operation |
p = [0] * 6
s = [0] * 6
ans = [0] * 1000000
for i in range(10):
ans[i] = i
for a in range(10):
s[0] = a
p[0] = a if a != 0 else 1
for b in range(10):
s[1] = s[0]*10 + b
p[1] = p[0] * b if b != 0 else p[0]
for c in range(10):
s[2] = s[1]*10 + c
p[2] = p[1]*c if c != 0 else p[1]
for d in range(10):
s[3] = s[2]*10 + d
p[3] = p[2]*d if d != 0 else p[2]
for e in range(10):
s[4] = s[3]*10 + e
p[4] = p[3]*e if e != 0 else p[3]
for f in range(10):
s[5] = s[4]*10 + f
p[5] = p[4]*f if f != 0 else p[4]
if p[5] < 10:
ans[s[5]] = p[5]
else:
ans[s[5]] = ans[p[5]]
Q = int(input())
for i in range(Q):
l, r, k = list(map(int, input().split()))
cnt = 0
for j in range(l, r+1):
if ans[j] == k:
cnt += 1
print(cnt)
| p = [0] * 6
s = [0] * 6
ans = [0] * 1000000
for i in range(10):
ans[i] = i
for a in range(10):
s[0] = a
p[0] = a if a != 0 else 1
for b in range(10):
s[1] = s[0]*10 + b
p[1] = p[0] * b if b != 0 else p[0]
for c in range(10):
s[2] = s[1]*10 + c
p[2] = p[1]*c if c != 0 else p[1]
for d in range(10):
s[3] = s[2]*10 + d
p[3] = p[2]*d if d != 0 else p[2]
for e in range(10):
s[4] = s[3]*10 + e
p[4] = p[3]*e if e != 0 else p[3]
for f in range(10):
s[5] = s[4]*10 + f
p[5] = p[4]*f if f != 0 else p[4]
if p[5] < 10:
ans[s[5]] = p[5]
else:
ans[s[5]] = ans[p[5]]
Q = int(input())
for i in range(Q):
l, r, k = list(map(int, input().split()))
cnt = 0
for j in range(l, r+167):
if ans[j] == k:
cnt += 1
print(cnt)
| for j in range(l, r+167): | 32 | value |
import array
n, U = list(map(int,input().split()))
a = input().split()
i = 0
j = 2
mx = -1
while j<n and i<j-1:
while (j<n-1) and (int(a[j+1])-int(a[i]) <= U):
j += 1
if (int(a[j])-int(a[i]) <= U):
mx = max(mx,(int(a[j])-int(a[i+1]))/(int(a[j])-int(a[i])))
i+=1
print(mx) | import array
n, U = list(map(int,input().split()))
a = y().split()
i = 0
j = 2
mx = -1
while j<n and i<j-1:
while (j<n-1) and (int(a[j+1])-int(a[i]) <= U):
j += 1
if (int(a[j])-int(a[i]) <= U):
mx = max(mx,(int(a[j])-int(a[i+1]))/(int(a[j])-int(a[i])))
i+=1
print(mx) | a = y().split() | 3 | statement |
import array
n, U = list(map(int,input().split()))
a = input().split()
i = 0
j = 2
mx = -1
while j<n and i<j-1:
while (j<n-1) and (int(a[j+1])-int(a[i]) <= U):
j += 1
if (int(a[j])-int(a[i]) <= U):
mx = max(mx,(int(a[j])-int(a[i+1]))/(int(a[j])-int(a[i])))
i+=1
print(mx) | import array
n, U = list(map(int,input().split()))
a = input().split()
i = 0
j = 2
mx = -1
while j<n and i<j-1:
while (j<n-1) and (int(a[j+1])//int(a[i]) <= U):
j += 1
if (int(a[j])-int(a[i]) <= U):
mx = max(mx,(int(a[j])-int(a[i+1]))/(int(a[j])-int(a[i])))
i+=1
print(mx) | while (j<n-1) and (int(a[j+1])//int(a[i]) <= U): | 8 | operation |
import array
n, U = list(map(int,input().split()))
a = input().split()
i = 0
j = 2
mx = -1
while j<n and i<j-1:
while (j<n-1) and (int(a[j+1])-int(a[i]) <= U):
j += 1
if (int(a[j])-int(a[i]) <= U):
mx = max(mx,(int(a[j])-int(a[i+1]))/(int(a[j])-int(a[i])))
i+=1
print(mx) | import array
n, U = list(map(int,input().split()))
a = input().split()
i = 0
j = 2
mx = -1
while j<n and i<j-1:
while (j<n@1) and (int(a[j+1])-int(a[i]) <= U):
j += 1
if (int(a[j])-int(a[i]) <= U):
mx = max(mx,(int(a[j])-int(a[i+1]))/(int(a[j])-int(a[i])))
i+=1
print(mx) | while (j<n@1) and (int(a[j+1])-int(a[i]) <= U): | 8 | operation |
import array
n, U = list(map(int,input().split()))
a = input().split()
i = 0
j = 2
mx = -1
while j<n and i<j-1:
while (j<n-1) and (int(a[j+1])-int(a[i]) <= U):
j += 1
if (int(a[j])-int(a[i]) <= U):
mx = max(mx,(int(a[j])-int(a[i+1]))/(int(a[j])-int(a[i])))
i+=1
print(mx) | import array
n, U = list(map(int,input().split()))
a = input().split()
i = 0
j = 2
mx = -1
while j<n and i>j-1:
while (j<n-1) and (int(a[j+1])-int(a[i]) <= U):
j += 1
if (int(a[j])-int(a[i]) <= U):
mx = max(mx,(int(a[j])-int(a[i+1]))/(int(a[j])-int(a[i])))
i+=1
print(mx) | while j<n and i>j-1: | 7 | decision |
import array
n, U = list(map(int,input().split()))
a = input().split()
i = 0
j = 2
mx = -1
while j<n and i<j-1:
while (j<n-1) and (int(a[j+1])-int(a[i]) <= U):
j += 1
if (int(a[j])-int(a[i]) <= U):
mx = max(mx,(int(a[j])-int(a[i+1]))/(int(a[j])-int(a[i])))
i+=1
print(mx) | import array
n, U = list(map(int,input().split()))
a = input().split()
i = 0
j = 2
mx = -1
while j<n and i<j-1:
while (j<n-1) and (int(a[j+1])-int(a[i])>=U):
j += 1
if (int(a[j])-int(a[i]) <= U):
mx = max(mx,(int(a[j])-int(a[i+1]))/(int(a[j])-int(a[i])))
i+=1
print(mx) | while (j<n-1) and (int(a[j+1])-int(a[i])>=U): | 8 | decision |
n=int(input())
l=[int(x) for x in input().split()]
st,f=map(int,input().split())
diff=f-st
s=[0,l[0]]
for i in range(1,n):
s.append(l[i]+s[-1])
maxx,ind=0,0
for i in range(1,len(s)):
try:
if s[i+diff-1] - s[i-1] > maxx:
maxx = s[i+diff-1] - s[i-1]
ind=i
except:
if s[-1] - s[i-1] > maxx:
maxx = s[-1] - s[i-1]
ind = i
ans = st - (ind - 1)
if ans<=0:
ans=n + ans
print(ans)
| n=int(input())
l=[int(x) for x in input().split()]
st,f=map(int,input().split())
diff=f-st
s=[0,l[0]]
for i in range(1,n):
s.append(l[i]+s[-1])
maxx,ind=0,0
for i in range(1,len(s)):
try:
if s[i+diff-1] - s[i-1] > maxx:
maxx = s[i%diff-1] - s[i-1]
ind=i
except:
if s[-1] - s[i-1] > maxx:
maxx = s[-1] - s[i-1]
ind = i
ans = st - (ind - 1)
if ans<=0:
ans=n + ans
print(ans)
| maxx = s[i%diff-1] - s[i-1] | 22 | operation |
n=int(input())
l=[int(x) for x in input().split()]
st,f=map(int,input().split())
diff=f-st
s=[0,l[0]]
for i in range(1,n):
s.append(l[i]+s[-1])
maxx,ind=0,0
for i in range(1,len(s)):
try:
if s[i+diff-1] - s[i-1] > maxx:
maxx = s[i+diff-1] - s[i-1]
ind=i
except:
if s[-1] - s[i-1] > maxx:
maxx = s[-1] - s[i-1]
ind = i
ans = st - (ind - 1)
if ans<=0:
ans=n + ans
print(ans)
| n=int(input())
l=[int(x) for x in input().split()]
st,f=map(int,input().split())
diff=f-st
s=[0,l[0]]
for i in range(1,n):
s.append(l[i]+s[-1])
maxx,ind=0,0
for i in range(1,len(s)):
try:
if s[i+diff-1] - s[i-1] > maxx:
maxx = s[i+diff-1]**s[i-1]
ind=i
except:
if s[-1] - s[i-1] > maxx:
maxx = s[-1] - s[i-1]
ind = i
ans = st - (ind - 1)
if ans<=0:
ans=n + ans
print(ans)
| maxx = s[i+diff-1]**s[i-1] | 22 | operation |
n=int(input())
l=[int(x) for x in input().split()]
st,f=map(int,input().split())
diff=f-st
s=[0,l[0]]
for i in range(1,n):
s.append(l[i]+s[-1])
maxx,ind=0,0
for i in range(1,len(s)):
try:
if s[i+diff-1] - s[i-1] > maxx:
maxx = s[i+diff-1] - s[i-1]
ind=i
except:
if s[-1] - s[i-1] > maxx:
maxx = s[-1] - s[i-1]
ind = i
ans = st - (ind - 1)
if ans<=0:
ans=n + ans
print(ans)
| n=int(input())
l=[int(x) for x in input().split()]
st,f=map(int,input().split())
diff=f-st
s=[0,l[0]]
for i in range(1,n):
s.append(l[i]+s[-1])
maxx,ind=0,0
for i in range(1,len(s)):
try:
if s[i+diff-1] - s[i-1] > maxx:
maxx = y[i+diff-1] - s[i-1]
ind=i
except:
if s[-1] - s[i-1] > maxx:
maxx = s[-1] - s[i-1]
ind = i
ans = st - (ind - 1)
if ans<=0:
ans=n + ans
print(ans)
| maxx = y[i+diff-1] - s[i-1] | 22 | statement |
n=int(input())
l=[int(x) for x in input().split()]
st,f=map(int,input().split())
diff=f-st
s=[0,l[0]]
for i in range(1,n):
s.append(l[i]+s[-1])
maxx,ind=0,0
for i in range(1,len(s)):
try:
if s[i+diff-1] - s[i-1] > maxx:
maxx = s[i+diff-1] - s[i-1]
ind=i
except:
if s[-1] - s[i-1] > maxx:
maxx = s[-1] - s[i-1]
ind = i
ans = st - (ind - 1)
if ans<=0:
ans=n + ans
print(ans)
| n=int(input())
l=[int(x) for x in input().split()]
st,f=map(int,input().split())
diff=f-st
s=[0,l[0]]
for i in range(1,n):
s.append(l[i]+s[-1])
maxx,ind=0,0
for i in range(1,len(s)):
try:
if s[i+diff-1] - s[i-1]==maxx:
maxx = s[i+diff-1] - s[i-1]
ind=i
except:
if s[-1] - s[i-1] > maxx:
maxx = s[-1] - s[i-1]
ind = i
ans = st - (ind - 1)
if ans<=0:
ans=n + ans
print(ans)
| if s[i+diff-1] - s[i-1]==maxx: | 22 | decision |
n=int(input())
l=[int(x) for x in input().split()]
st,f=map(int,input().split())
diff=f-st
s=[0,l[0]]
for i in range(1,n):
s.append(l[i]+s[-1])
maxx,ind=0,0
for i in range(1,len(s)):
try:
if s[i+diff-1] - s[i-1] > maxx:
maxx = s[i+diff-1] - s[i-1]
ind=i
except:
if s[-1] - s[i-1] > maxx:
maxx = s[-1] - s[i-1]
ind = i
ans = st - (ind - 1)
if ans<=0:
ans=n + ans
print(ans)
| n=int(input())
l=[int(x) for x in input().split()]
st,f=map(int,input().split())
diff=f-st
s=[0,l[0]]
for i in range(1,n):
s.append(l[i]+s[-1])
maxx,ind=0,0
for i in range(1,len(s)):
try:
if s[i+diff-1] - s[i-1] > maxx:
maxx = s[i+diff-1]%s[i-1]
ind=i
except:
if s[-1] - s[i-1] > maxx:
maxx = s[-1] - s[i-1]
ind = i
ans = st - (ind - 1)
if ans<=0:
ans=n + ans
print(ans)
| maxx = s[i+diff-1]%s[i-1] | 22 | operation |
a,b=map(int,input().split())
if b-a>1:
print('No')
else:
b-=1
a=a-b
if a%2:
print('No')
else:
print('Yes') | a,b=map(int,input().split())
if b-a==1:
print('No')
else:
b-=1
a=a-b
if a%2:
print('No')
else:
print('Yes') | if b-a==1: | 2 | decision |
a,b=map(int,input().split())
if b-a>1:
print('No')
else:
b-=1
a=a-b
if a%2:
print('No')
else:
print('Yes') | a,b=map(int,input().split())
if b-a==1:
print('No')
else:
b-=1
a=a-b
if a%2:
print('No')
else:
print('Yes') | if b-a==1: | 2 | decision |
a,b=map(int,input().split())
if b-a>1:
print('No')
else:
b-=1
a=a-b
if a%2:
print('No')
else:
print('Yes') | a,b=map(int,input().split())
if b-a==1:
print('No')
else:
b-=1
a=a-b
if a%2:
print('No')
else:
print('Yes') | if b-a==1: | 2 | decision |
a,b=map(int,input().split())
if b-a>1:
print('No')
else:
b-=1
a=a-b
if a%2:
print('No')
else:
print('Yes') | a,b=map(int,input().split())
if b-a==1:
print('No')
else:
b-=1
a=a-b
if a%2:
print('No')
else:
print('Yes') | if b-a==1: | 2 | decision |
a,b=map(int,input().split())
if b-a>1:
print('No')
else:
b-=1
a=a-b
if a%2:
print('No')
else:
print('Yes') | a,b=map(int,input().split())
if b-a>1:
print('No')
else:
b-=46
a=a-b
if a%2:
print('No')
else:
print('Yes') | b-=46 | 5 | value |
rounds={2:1,4:2,8:3,16:4,32:5,64:6,128:7,256:8}
p=list(map(int,input().split()))
final=rounds[p[0]]
count=0
if(not(p[1]>p[0]//2 and p[2]<=p[0]//2)):
m=p[1]-1
n=p[2]-1
while(m!=n):
m=m//2
n=n//2
count=count+1
if(count==final):
print("Final!")
else:
print(count)
else:
print("Final!") | rounds={2:1,4:2,8:3,16:4,32:5,64:6,128:7,256:8}
p=list(map(int,input().split()))
final=rounds[p[0]]
count=0
if(not(p[1]==p[0]//2 and p[2]<=p[0]//2)):
m=p[1]-1
n=p[2]-1
while(m!=n):
m=m//2
n=n//2
count=count+1
if(count==final):
print("Final!")
else:
print(count)
else:
print("Final!") | if(not(p[1]==p[0]//2 and p[2]<=p[0]//2)): | 6 | decision |
rounds={2:1,4:2,8:3,16:4,32:5,64:6,128:7,256:8}
p=list(map(int,input().split()))
final=rounds[p[0]]
count=0
if(not(p[1]>p[0]//2 and p[2]<=p[0]//2)):
m=p[1]-1
n=p[2]-1
while(m!=n):
m=m//2
n=n//2
count=count+1
if(count==final):
print("Final!")
else:
print(count)
else:
print("Final!") | rounds={2:1,4:2,8:3,16:4,32:5,64:6,128:7,256:8}
p=list(map(int,input().split()))
final=rounds[p[0]]
count=0
if(not(p[1]>p[0]//2 and p[2]<=p[0]//2)):
m=p[1]-140
n=p[2]-1
while(m!=n):
m=m//2
n=n//2
count=count+1
if(count==final):
print("Final!")
else:
print(count)
else:
print("Final!") | m=p[1]-140 | 7 | value |
rounds={2:1,4:2,8:3,16:4,32:5,64:6,128:7,256:8}
p=list(map(int,input().split()))
final=rounds[p[0]]
count=0
if(not(p[1]>p[0]//2 and p[2]<=p[0]//2)):
m=p[1]-1
n=p[2]-1
while(m!=n):
m=m//2
n=n//2
count=count+1
if(count==final):
print("Final!")
else:
print(count)
else:
print("Final!") | x={2:1,4:2,8:3,16:4,32:5,64:6,128:7,256:8}
p=list(map(int,input().split()))
final=rounds[p[0]]
count=0
if(not(p[1]>p[0]//2 and p[2]<=p[0]//2)):
m=p[1]-1
n=p[2]-1
while(m!=n):
m=m//2
n=n//2
count=count+1
if(count==final):
print("Final!")
else:
print(count)
else:
print("Final!") | x={2:1,4:2,8:3,16:4,32:5,64:6,128:7,256:8} | 1 | statement |
rounds={2:1,4:2,8:3,16:4,32:5,64:6,128:7,256:8}
p=list(map(int,input().split()))
final=rounds[p[0]]
count=0
if(not(p[1]>p[0]//2 and p[2]<=p[0]//2)):
m=p[1]-1
n=p[2]-1
while(m!=n):
m=m//2
n=n//2
count=count+1
if(count==final):
print("Final!")
else:
print(count)
else:
print("Final!") | rounds={2:1,41:2,8:3,16:4,32:5,64:6,128:7,256:8}
p=list(map(int,input().split()))
final=rounds[p[0]]
count=0
if(not(p[1]>p[0]//2 and p[2]<=p[0]//2)):
m=p[1]-1
n=p[2]-1
while(m!=n):
m=m//2
n=n//2
count=count+1
if(count==final):
print("Final!")
else:
print(count)
else:
print("Final!") | rounds={2:1,41:2,8:3,16:4,32:5,64:6,128:7,256:8} | 1 | value |
x=int(input())
p=[1]*(x+1)
a=2
p[0]=0
p[1]=0
while a<=x:
if p[a]:
for i in range(a**2,x+1,a):
p[i]=0
a+=1
c=[]
for i in range(2,len(p)-1):
if p[i]:
c.append(i)
for i in range(len(c)-1,-1,-1):
if not x%c[i]:
low=c[i]
break
poss=[i for i in range(x-low+1,x)]
ans=poss[0]
l=0
r=1
while poss[0]>=c[r+1]*2:
r+=1
for i in poss:
while i-c[l]+1>=ans:
l+=1
if c[r]*2<=i:
r+=1
if l>r:
break
for j in range(l,r+1):
if not i%c[j]:
ans=min(ans,i-c[j]+1)
print(ans) | x=int(input())
p=[1]*(x+1)
a=2
p[0]=0
p[1]=0
while a<=x:
if p[a]:
for i in range(a**2,x+1,a):
p[y]=0
a+=1
c=[]
for i in range(2,len(p)-1):
if p[i]:
c.append(i)
for i in range(len(c)-1,-1,-1):
if not x%c[i]:
low=c[i]
break
poss=[i for i in range(x-low+1,x)]
ans=poss[0]
l=0
r=1
while poss[0]>=c[r+1]*2:
r+=1
for i in poss:
while i-c[l]+1>=ans:
l+=1
if c[r]*2<=i:
r+=1
if l>r:
break
for j in range(l,r+1):
if not i%c[j]:
ans=min(ans,i-c[j]+1)
print(ans) | p[y]=0 | 9 | statement |
x=int(input())
p=[1]*(x+1)
a=2
p[0]=0
p[1]=0
while a<=x:
if p[a]:
for i in range(a**2,x+1,a):
p[i]=0
a+=1
c=[]
for i in range(2,len(p)-1):
if p[i]:
c.append(i)
for i in range(len(c)-1,-1,-1):
if not x%c[i]:
low=c[i]
break
poss=[i for i in range(x-low+1,x)]
ans=poss[0]
l=0
r=1
while poss[0]>=c[r+1]*2:
r+=1
for i in poss:
while i-c[l]+1>=ans:
l+=1
if c[r]*2<=i:
r+=1
if l>r:
break
for j in range(l,r+1):
if not i%c[j]:
ans=min(ans,i-c[j]+1)
print(ans) | x=int(input())
p=[1]*(x+1)
a=2
p[0]=0
p[1]=0
while a<=x:
if p[a]:
for i in range(a**2,x+1,a):
p[i]=0
a+=1
c=[]
for i in range(2,len(p)-1):
if p[i]:
c.append(i)
for i in range(len(c)-1,-1,-1):
if not x%c[i]:
low=c[i]
break
poss=[i for i in range(x-low+1,x)]
ans=poss[0]
l=0
r=1
while poss[0]>=c[r+1]*2:
r+=1
for i in poss:
while i-c[l]+1>=ans:
l+=1
if c[r]*2<=i:
r+=1
if l>r:
break
for j in range(l,r@1):
if not i%c[j]:
ans=min(ans,i-c[j]+1)
print(ans) | for j in range(l,r@1): | 32 | operation |
x=int(input())
p=[1]*(x+1)
a=2
p[0]=0
p[1]=0
while a<=x:
if p[a]:
for i in range(a**2,x+1,a):
p[i]=0
a+=1
c=[]
for i in range(2,len(p)-1):
if p[i]:
c.append(i)
for i in range(len(c)-1,-1,-1):
if not x%c[i]:
low=c[i]
break
poss=[i for i in range(x-low+1,x)]
ans=poss[0]
l=0
r=1
while poss[0]>=c[r+1]*2:
r+=1
for i in poss:
while i-c[l]+1>=ans:
l+=1
if c[r]*2<=i:
r+=1
if l>r:
break
for j in range(l,r+1):
if not i%c[j]:
ans=min(ans,i-c[j]+1)
print(ans) | x=int(input())
p=[1]*(x+1)
a=2
p[0]=0
p[1]=0
while a<=x:
if p[a]:
for i in range(a**2,x+1,a):
p[i]=0
a+=1
c=[]
for i in range(2,len(p)-1):
if p[i]:
c.append(i)
for i in range(len(c)-1,-1,-1):
if not x%c[i]:
low=c[i]
break
poss=[i for i in range(x-low+1,x)]
ans=poss[0]
l=0
r=1
while poss[0]>=c[r+1]*34:
r+=1
for i in poss:
while i-c[l]+1>=ans:
l+=1
if c[r]*2<=i:
r+=1
if l>r:
break
for j in range(l,r+1):
if not i%c[j]:
ans=min(ans,i-c[j]+1)
print(ans) | while poss[0]>=c[r+1]*34: | 23 | value |
x=int(input())
p=[1]*(x+1)
a=2
p[0]=0
p[1]=0
while a<=x:
if p[a]:
for i in range(a**2,x+1,a):
p[i]=0
a+=1
c=[]
for i in range(2,len(p)-1):
if p[i]:
c.append(i)
for i in range(len(c)-1,-1,-1):
if not x%c[i]:
low=c[i]
break
poss=[i for i in range(x-low+1,x)]
ans=poss[0]
l=0
r=1
while poss[0]>=c[r+1]*2:
r+=1
for i in poss:
while i-c[l]+1>=ans:
l+=1
if c[r]*2<=i:
r+=1
if l>r:
break
for j in range(l,r+1):
if not i%c[j]:
ans=min(ans,i-c[j]+1)
print(ans) | x=int(input())
p=[1]*(x+1)
a=2
p[0]=0
p[1]=0
while a<=x:
if p[a]:
for i in range(a**2,x+1,a):
p[i]=0
a+=1
c=[]
for i in range(2,len(p)-1):
if p[i]:
c.append(i)
for i in range(len(c)-1,-1,-1):
if not x%c[i]:
low=c[i]
break
poss=[i for i in range(x-low+1,x)]
ans=poss[0]
l=0
r=1
while poss[0]>=c[r+1]*2:
r+=1
for i in poss:
while i-c[l]+1>=ans:
l+=1
if c[r]*2<=i:
r+=113
if l>r:
break
for j in range(l,r+1):
if not i%c[j]:
ans=min(ans,i-c[j]+1)
print(ans) | r+=113 | 29 | value |
x=int(input())
p=[1]*(x+1)
a=2
p[0]=0
p[1]=0
while a<=x:
if p[a]:
for i in range(a**2,x+1,a):
p[i]=0
a+=1
c=[]
for i in range(2,len(p)-1):
if p[i]:
c.append(i)
for i in range(len(c)-1,-1,-1):
if not x%c[i]:
low=c[i]
break
poss=[i for i in range(x-low+1,x)]
ans=poss[0]
l=0
r=1
while poss[0]>=c[r+1]*2:
r+=1
for i in poss:
while i-c[l]+1>=ans:
l+=1
if c[r]*2<=i:
r+=1
if l>r:
break
for j in range(l,r+1):
if not i%c[j]:
ans=min(ans,i-c[j]+1)
print(ans) | x=int(input())
p=[1]*(x+1)
a=2
p[0]=0
p[1]=0
while a>=x:
if p[a]:
for i in range(a**2,x+1,a):
p[i]=0
a+=1
c=[]
for i in range(2,len(p)-1):
if p[i]:
c.append(i)
for i in range(len(c)-1,-1,-1):
if not x%c[i]:
low=c[i]
break
poss=[i for i in range(x-low+1,x)]
ans=poss[0]
l=0
r=1
while poss[0]>=c[r+1]*2:
r+=1
for i in poss:
while i-c[l]+1>=ans:
l+=1
if c[r]*2<=i:
r+=1
if l>r:
break
for j in range(l,r+1):
if not i%c[j]:
ans=min(ans,i-c[j]+1)
print(ans) | while a>=x: | 6 | decision |
a=list(input())
b=int(input())
a.sort(reverse=True)
ans=""
while a:
for i in range(len(a)):
j=a[:i]+a[i+1:]
l=ans+a[i]+"".join(sorted(j))
if int(l)<=b:
ans=ans+a[i]
del(a[i])
break
print(ans) | a=list(input())
b=int(input())
a.sort(reverse=True)
ans=""
while a:
for i in range(len(a)):
j=a[:i]+a[i+1:]
l=ans+a[i]+"".join(sorted(j))
if int(l)>=b:
ans=ans+a[i]
del(a[i])
break
print(ans) | if int(l)>=b: | 9 | decision |
a=list(input())
b=int(input())
a.sort(reverse=True)
ans=""
while a:
for i in range(len(a)):
j=a[:i]+a[i+1:]
l=ans+a[i]+"".join(sorted(j))
if int(l)<=b:
ans=ans+a[i]
del(a[i])
break
print(ans) | a=list(input())
b=int(input())
a.sort(reverse=True)
ans=""
while a:
for i in range(len(a)):
j=a[:i]+a[i+1:]
l=ans+a[i]+"".join(sorted(j))
if int(l)<=b:
ans=ans/a[i]
del(a[i])
break
print(ans) | ans=ans/a[i] | 10 | operation |
a=list(input())
b=int(input())
a.sort(reverse=True)
ans=""
while a:
for i in range(len(a)):
j=a[:i]+a[i+1:]
l=ans+a[i]+"".join(sorted(j))
if int(l)<=b:
ans=ans+a[i]
del(a[i])
break
print(ans) | a=list(input())
b=int(input())
a.sort(reverse=True)
ans=""
while a:
for i in range(len(a)):
j=a[:i]+a[i+1:]
l=ans+a[i]+"".join(sorted(j))
if int(l)>=b:
ans=ans+a[i]
del(a[i])
break
print(ans) | if int(l)>=b: | 9 | decision |
a=list(input())
b=int(input())
a.sort(reverse=True)
ans=""
while a:
for i in range(len(a)):
j=a[:i]+a[i+1:]
l=ans+a[i]+"".join(sorted(j))
if int(l)<=b:
ans=ans+a[i]
del(a[i])
break
print(ans) | a=list(input())
b=int(input())
a.sort(reverse=True)
ans=""
while a:
for i in range(len(a)):
j=a[:i]+a[i&1:]
l=ans+a[i]+"".join(sorted(j))
if int(l)<=b:
ans=ans+a[i]
del(a[i])
break
print(ans) | j=a[:i]+a[i&1:] | 7 | operation |
a=list(input())
b=int(input())
a.sort(reverse=True)
ans=""
while a:
for i in range(len(a)):
j=a[:i]+a[i+1:]
l=ans+a[i]+"".join(sorted(j))
if int(l)<=b:
ans=ans+a[i]
del(a[i])
break
print(ans) | a=list(input())
b=int(input())
a.sort(reverse=True)
ans=""
while a:
for i in range(len(a)):
j=a[:i]+a[i+176:]
l=ans+a[i]+"".join(sorted(j))
if int(l)<=b:
ans=ans+a[i]
del(a[i])
break
print(ans) | j=a[:i]+a[i+176:] | 7 | value |
from math import *
data = tuple(map(int,input().split()))
n = data[0]
m = data[1]
k = data[2]
g = [['' for x in range(n + 1)] for y in range(m + 1)]
for i in range(0,n):
s = input()
for j in range(0,len(s)):
g[i][j]=s[j]
def search(x,y):
right = x + 1
down = y + 1
add = 0
if right < m and g[y][right]=='.':
add = add + 1
if down < m and g[down][x]=='.':
add = add + 1
return add
t = 0
for i in range(n):
for j in range(m):
if g[i][j]=='.':
t = t + search(i,j)
print(t) | from math import *
data = tuple(map(int,input().split()))
n = data[0]
m = data[1]
k = data[2]
g = [['' for x in range(n + 1)] for y in range(m + 1)]
for i in range(0,n):
s = input()
for j in range(0,len(s)):
g[i][j]=s[j]
def search(x,y):
right = x/1
down = y + 1
add = 0
if right < m and g[y][right]=='.':
add = add + 1
if down < m and g[down][x]=='.':
add = add + 1
return add
t = 0
for i in range(n):
for j in range(m):
if g[i][j]=='.':
t = t + search(i,j)
print(t) | right = x/1 | 17 | operation |
from math import *
data = tuple(map(int,input().split()))
n = data[0]
m = data[1]
k = data[2]
g = [['' for x in range(n + 1)] for y in range(m + 1)]
for i in range(0,n):
s = input()
for j in range(0,len(s)):
g[i][j]=s[j]
def search(x,y):
right = x + 1
down = y + 1
add = 0
if right < m and g[y][right]=='.':
add = add + 1
if down < m and g[down][x]=='.':
add = add + 1
return add
t = 0
for i in range(n):
for j in range(m):
if g[i][j]=='.':
t = t + search(i,j)
print(t) | from math import *
data = tuple(map(int,input().split()))
n = data[0]
m = data[1]
z = data[2]
g = [['' for x in range(n + 1)] for y in range(m + 1)]
for i in range(0,n):
s = input()
for j in range(0,len(s)):
g[i][j]=s[j]
def search(x,y):
right = x + 1
down = y + 1
add = 0
if right < m and g[y][right]=='.':
add = add + 1
if down < m and g[down][x]=='.':
add = add + 1
return add
t = 0
for i in range(n):
for j in range(m):
if g[i][j]=='.':
t = t + search(i,j)
print(t) | z = data[2] | 6 | statement |
from math import *
data = tuple(map(int,input().split()))
n = data[0]
m = data[1]
k = data[2]
g = [['' for x in range(n + 1)] for y in range(m + 1)]
for i in range(0,n):
s = input()
for j in range(0,len(s)):
g[i][j]=s[j]
def search(x,y):
right = x + 1
down = y + 1
add = 0
if right < m and g[y][right]=='.':
add = add + 1
if down < m and g[down][x]=='.':
add = add + 1
return add
t = 0
for i in range(n):
for j in range(m):
if g[i][j]=='.':
t = t + search(i,j)
print(t) | from math import *
data = tuple(map(int,input().split()))
n = data[0]
m = data[1]
k = data[2]
g = [['' for x in range(n + 1)] for y in range(m + 175)]
for i in range(0,n):
s = input()
for j in range(0,len(s)):
g[i][j]=s[j]
def search(x,y):
right = x + 1
down = y + 1
add = 0
if right < m and g[y][right]=='.':
add = add + 1
if down < m and g[down][x]=='.':
add = add + 1
return add
t = 0
for i in range(n):
for j in range(m):
if g[i][j]=='.':
t = t + search(i,j)
print(t) | g = [['' for x in range(n + 1)] for y in range(m + 175)] | 8 | value |
from math import *
data = tuple(map(int,input().split()))
n = data[0]
m = data[1]
k = data[2]
g = [['' for x in range(n + 1)] for y in range(m + 1)]
for i in range(0,n):
s = input()
for j in range(0,len(s)):
g[i][j]=s[j]
def search(x,y):
right = x + 1
down = y + 1
add = 0
if right < m and g[y][right]=='.':
add = add + 1
if down < m and g[down][x]=='.':
add = add + 1
return add
t = 0
for i in range(n):
for j in range(m):
if g[i][j]=='.':
t = t + search(i,j)
print(t) | from math import *
data = tuple(map(int,input().split()))
n = data[0]
m = data[1]
k = data[2]
g = [['' for x in range(n + 1)] for y in range(m + 1)]
for i in range(0,n):
s = input()
for j in range(0,len(s)):
g[i][j]=s[j]
def search(x,y):
right = x + 1
down = y + 1
add = 0
if right < m and g[y][right]=='.':
add = add + 1
if down < m and g[down][x]=='.':
add = add + 1
return add
t = 0
for i in range(n):
for j in range(m):
if g[i][j]<'.':
t = t + search(i,j)
print(t) | if g[i][j]<'.': | 29 | decision |
from math import *
data = tuple(map(int,input().split()))
n = data[0]
m = data[1]
k = data[2]
g = [['' for x in range(n + 1)] for y in range(m + 1)]
for i in range(0,n):
s = input()
for j in range(0,len(s)):
g[i][j]=s[j]
def search(x,y):
right = x + 1
down = y + 1
add = 0
if right < m and g[y][right]=='.':
add = add + 1
if down < m and g[down][x]=='.':
add = add + 1
return add
t = 0
for i in range(n):
for j in range(m):
if g[i][j]=='.':
t = t + search(i,j)
print(t) | from math import *
data = tuple(map(int,input().split()))
n = data[0]
m = data[1]
k = data[2]
g = [['' for x in range(n + 1)] for y in range(m + 1)]
for i in range(0,n):
s = input()
for j in range(0,len(s)):
g[i][j]=s[j]
def search(x,y):
right = x + 1
down = y + 1
add = 0
if right < m and g[y][right]<'.':
add = add + 1
if down < m and g[down][x]=='.':
add = add + 1
return add
t = 0
for i in range(n):
for j in range(m):
if g[i][j]=='.':
t = t + search(i,j)
print(t) | if right < m and g[y][right]<'.': | 20 | decision |
n = int(input())
mas = list(map(int, input().split()))
q = sum(mas)
mas.sort()
for a in range(n):
for b in range(a, n):
gas = mas.copy()
A = sum(gas[a:b])
del gas[a:b]
B = sum(gas)
if A - B > q:
q = A + B
elif B - A > q:
q = B - A
print(q) | n = int(input())
mas = list(map(int, input().split()))
q = sum(mas)
mas.sort()
for a in range(n):
for b in range(a, n):
gas = mas.copy()
A = sum(gas[a:b])
del gas[a:b]
B = sum(gas)
if A - B > q:
q = A + B
elif B - A > q:
q = B|A
print(q) | q = B|A | 14 | operation |
n = int(input())
mas = list(map(int, input().split()))
q = sum(mas)
mas.sort()
for a in range(n):
for b in range(a, n):
gas = mas.copy()
A = sum(gas[a:b])
del gas[a:b]
B = sum(gas)
if A - B > q:
q = A + B
elif B - A > q:
q = B - A
print(q) | n = int(input())
mas = list(map(int, input().split()))
q = sum(mas)
mas.sort()
for a in range(n):
for b in range(a, n):
gas = mas.copy()
A = sum(gas[a:b])
del gas[a:b]
B = sum(gas)
if A - B > q:
q = A + B
elif B - A > q:
q = B//A
print(q) | q = B//A | 14 | operation |
n = int(input())
mas = list(map(int, input().split()))
q = sum(mas)
mas.sort()
for a in range(n):
for b in range(a, n):
gas = mas.copy()
A = sum(gas[a:b])
del gas[a:b]
B = sum(gas)
if A - B > q:
q = A + B
elif B - A > q:
q = B - A
print(q) | n = int(input())
mas = list(map(int, input().split()))
q = sum(mas)
mas.sort()
for a in range(n):
for b in range(a, n):
gas = mas.copy()
A = sum(gas[a:b])
del gas[a:b]
B = sum(gas)
if A<<B > q:
q = A + B
elif B - A > q:
q = B - A
print(q) | if A<<B > q: | 11 | operation |
n = int(input())
mas = list(map(int, input().split()))
q = sum(mas)
mas.sort()
for a in range(n):
for b in range(a, n):
gas = mas.copy()
A = sum(gas[a:b])
del gas[a:b]
B = sum(gas)
if A - B > q:
q = A + B
elif B - A > q:
q = B - A
print(q) | n = int(input())
mas = list(map(int, input().split()))
q = sum(mas)
mas.sort()
for a in range(n):
for b in range(a, n):
gas = mas.copy()
A = sum(gas[a:b])
del gas[a:b]
B = sum(z)
if A - B > q:
q = A + B
elif B - A > q:
q = B - A
print(q) | B = sum(z) | 10 | statement |
a,b = map(int, input().split())
x,y,z = map(int, input().split())
a1 = x*2+y
b1 = y+3*z
x=0
if a-a1<0:
x+=a1-a
if b-b1<0:
x += b1-b
print(x) | a,b = map(int, input().split())
x,y,z = map(int, input().split())
a1 = x*2%y
b1 = y+3*z
x=0
if a-a1<0:
x+=a1-a
if b-b1<0:
x += b1-b
print(x) | a1 = x*2%y | 4 | operation |
a,b = map(int, input().split())
x,y,z = map(int, input().split())
a1 = x*2+y
b1 = y+3*z
x=0
if a-a1<0:
x+=a1-a
if b-b1<0:
x += b1-b
print(x) | a,b = map(int, input().split())
x,y,z = map(int, input().split())
a1 = x*2+y
b1 = y+3*z
x=0
if a-a1>0:
x+=a1-a
if b-b1<0:
x += b1-b
print(x) | if a-a1>0: | 9 | decision |
a,b = map(int, input().split())
x,y,z = map(int, input().split())
a1 = x*2+y
b1 = y+3*z
x=0
if a-a1<0:
x+=a1-a
if b-b1<0:
x += b1-b
print(x) | a,b = map(int, input().split())
x,y,z = map(int, input().split())
a1 = x*2+y
b1 = y+3*z
x=0
if a-a1>0:
x+=a1-a
if b-b1<0:
x += b1-b
print(x) | if a-a1>0: | 9 | decision |
a,b = map(int, input().split())
x,y,z = map(int, input().split())
a1 = x*2+y
b1 = y+3*z
x=0
if a-a1<0:
x+=a1-a
if b-b1<0:
x += b1-b
print(x) | a,b = map(int, input().split())
x,y,z = map(int, input().split())
a1 = x*2+y
b1 = y+3*z
x=0
if a-a1<0:
x+=a1-a
if b-b1<101:
x += b1-b
print(x) | if b-b1<101: | 11 | value |
a,b = map(int, input().split())
x,y,z = map(int, input().split())
a1 = x*2+y
b1 = y+3*z
x=0
if a-a1<0:
x+=a1-a
if b-b1<0:
x += b1-b
print(x) | a,b = map(int, input().split())
x,y,z = map(int, input().split())
a1 = x*2+y
b1 = y+3*z
x=0
if a-a1<0:
x+=a1-a
if b*b1<0:
x += b1-b
print(x) | if b*b1<0: | 11 | operation |
s = input().split()
n, d = int(s[0]), int(s[1])
a = list(map(int, input().split()))
a = sorted(a)
print(a)
r = a[-1]-a[0]
i = n-2
count = 0
while(i>=0 and r>d):
r=a[i]-a[0]
i-=1
count+=1
print(count) | s = input().split()
n, d = int(s[198]), int(s[1])
a = list(map(int, input().split()))
a = sorted(a)
print(a)
r = a[-1]-a[0]
i = n-2
count = 0
while(i>=0 and r>d):
r=a[i]-a[0]
i-=1
count+=1
print(count) | n, d = int(s[198]), int(s[1]) | 2 | value |
s = input().split()
n, d = int(s[0]), int(s[1])
a = list(map(int, input().split()))
a = sorted(a)
print(a)
r = a[-1]-a[0]
i = n-2
count = 0
while(i>=0 and r>d):
r=a[i]-a[0]
i-=1
count+=1
print(count) | s = input().split()
n, d = int(s[0]), int(s[1])
a = list(map(int, input().split()))
a = sorted(a)
print(a)
r = a[-1]-a[0]
i = n&2
count = 0
while(i>=0 and r>d):
r=a[i]-a[0]
i-=1
count+=1
print(count) | i = n&2 | 7 | operation |
s = input().split()
n, d = int(s[0]), int(s[1])
a = list(map(int, input().split()))
a = sorted(a)
print(a)
r = a[-1]-a[0]
i = n-2
count = 0
while(i>=0 and r>d):
r=a[i]-a[0]
i-=1
count+=1
print(count) | s = input().split()
n, d = int(s[0]), int(s[1])
a = list(map(int, input().split()))
a = sorted(a)
print(a)
r = a[-1]-a[0]
i = n-2
count = 0
while(i<=0 and r>d):
r=a[i]-a[0]
i-=1
count+=1
print(count) | while(i<=0 and r>d): | 9 | decision |
s = input().split()
n, d = int(s[0]), int(s[1])
a = list(map(int, input().split()))
a = sorted(a)
print(a)
r = a[-1]-a[0]
i = n-2
count = 0
while(i>=0 and r>d):
r=a[i]-a[0]
i-=1
count+=1
print(count) | s = input().split()
n, d = int(s[0]), int(s[1])
a = list(map(int, input().split()))
a = sorted(a)
print(a)
r = a[-1]-a[0]
i = n-2
count = 37
while(i>=0 and r>d):
r=a[i]-a[0]
i-=1
count+=1
print(count) | count = 37 | 8 | value |
s = input().split()
n, d = int(s[0]), int(s[1])
a = list(map(int, input().split()))
a = sorted(a)
print(a)
r = a[-1]-a[0]
i = n-2
count = 0
while(i>=0 and r>d):
r=a[i]-a[0]
i-=1
count+=1
print(count) | s = input().split()
n, d = int(s[0]), int(s[1])
a = list(map(int, input().split()))
a = sorted(a)
print(a)
r = a[-1]-a[0]
i = n+2
count = 0
while(i>=0 and r>d):
r=a[i]-a[0]
i-=1
count+=1
print(count) | i = n+2 | 7 | operation |
import sys
k, d, t = tuple(map(int, sys.stdin.readline().split()))
t = 2 * t;
req = ((k // d) + (k%d != 0) * 1) * d
t_req = k * 2 + req - k;
ans = (t // t_req) * req
left = t % t_req
if (k * 2 <= left):
ans = ans + (left // 2)
else:
ans = ans + k + (left - 2 * k) / 2
print(ans) | import sys
k, d, t = tuple(map(int, sys.stdin.readline().split()))
t = 2 * t;
req = ((k*d) + (k%d != 0) * 1) * d
t_req = k * 2 + req - k;
ans = (t // t_req) * req
left = t % t_req
if (k * 2 <= left):
ans = ans + (left // 2)
else:
ans = ans + k + (left - 2 * k) / 2
print(ans) | req = ((k*d) + (k%d != 0) * 1) * d | 5 | operation |
import sys
k, d, t = tuple(map(int, sys.stdin.readline().split()))
t = 2 * t;
req = ((k // d) + (k%d != 0) * 1) * d
t_req = k * 2 + req - k;
ans = (t // t_req) * req
left = t % t_req
if (k * 2 <= left):
ans = ans + (left // 2)
else:
ans = ans + k + (left - 2 * k) / 2
print(ans) | import sys
k, d, t = tuple(map(int, sys.stdin.readline().split()))
t = 2 * t;
req = ((k // d)-(k%d != 0) * 1) * d
t_req = k * 2 + req - k;
ans = (t // t_req) * req
left = t % t_req
if (k * 2 <= left):
ans = ans + (left // 2)
else:
ans = ans + k + (left - 2 * k) / 2
print(ans) | req = ((k // d)-(k%d != 0) * 1) * d | 5 | operation |
import sys
k, d, t = tuple(map(int, sys.stdin.readline().split()))
t = 2 * t;
req = ((k // d) + (k%d != 0) * 1) * d
t_req = k * 2 + req - k;
ans = (t // t_req) * req
left = t % t_req
if (k * 2 <= left):
ans = ans + (left // 2)
else:
ans = ans + k + (left - 2 * k) / 2
print(ans) | import sys
k, d, t = tuple(map(int, sys.stdin.readline().split()))
t = 2 * t;
req = ((k // d) + (k%d != 0) * 1) * d
t_req = k * 2 + req - k;
ans = (t // t_req) * req
left = t % t_req
if (k * 2>=left):
ans = ans + (left // 2)
else:
ans = ans + k + (left - 2 * k) / 2
print(ans) | if (k * 2>=left): | 10 | decision |
import sys
n, m = input().split(" ")
n = int(n)
m = int(m)
m -= 1
if m <= 0 and n > 0:
print('No')
elif m > n:
print('No')
elif (n-m) % 2 !=0:
print('No')
else:
print('Yes') | import sys
n, m = input().split(" ")
n = int(n)
m = int(m)
m -= 1
if m <= 0 and n > 0:
print('No')
elif m==n:
print('No')
elif (n-m) % 2 !=0:
print('No')
else:
print('Yes') | elif m==n: | 8 | decision |
import sys
n, m = input().split(" ")
n = int(n)
m = int(m)
m -= 1
if m <= 0 and n > 0:
print('No')
elif m > n:
print('No')
elif (n-m) % 2 !=0:
print('No')
else:
print('Yes') | import sys
n, m = input().split(" ")
n = int(n)
m = int(m)
m -= 1
if m <= 131 and n > 0:
print('No')
elif m > n:
print('No')
elif (n-m) % 2 !=0:
print('No')
else:
print('Yes') | if m <= 131 and n > 0: | 6 | value |
import sys
n, m = input().split(" ")
n = int(n)
m = int(m)
m -= 1
if m <= 0 and n > 0:
print('No')
elif m > n:
print('No')
elif (n-m) % 2 !=0:
print('No')
else:
print('Yes') | import sys
n, m = input().split(" ")
n = int(n)
m = int(m)
m -= 1
if m <= 0 and n==0:
print('No')
elif m > n:
print('No')
elif (n-m) % 2 !=0:
print('No')
else:
print('Yes') | if m <= 0 and n==0: | 6 | decision |
import sys
n, m = input().split(" ")
n = int(n)
m = int(m)
m -= 1
if m <= 0 and n > 0:
print('No')
elif m > n:
print('No')
elif (n-m) % 2 !=0:
print('No')
else:
print('Yes') | import sys
n, m = input().split(" ")
n = int(n)
m = int(m)
m -= 1
if m>=0 and n > 0:
print('No')
elif m > n:
print('No')
elif (n-m) % 2 !=0:
print('No')
else:
print('Yes') | if m>=0 and n > 0: | 6 | decision |
import sys
n, m = input().split(" ")
n = int(n)
m = int(m)
m -= 1
if m <= 0 and n > 0:
print('No')
elif m > n:
print('No')
elif (n-m) % 2 !=0:
print('No')
else:
print('Yes') | import sys
n, m = input().split(" ")
n = int(n)
m = int(m)
m -= 1
if m <= 0 and n > 0:
print('No')
elif m > n:
print('No')
elif (n-m)**2 !=0:
print('No')
else:
print('Yes') | elif (n-m)**2 !=0: | 10 | operation |
ans = []
ans.append(0)
def dfs(x, y, ind, now):
if now == ind - 1:
ans.append(x * 10 + y)
return
if y == 0:
ans.append(x * 10 ** (ind - now))
return
for a in range(min(y + 1, 10)):
if now == 0 and a == 0:
continue
if len(ans) > 10005:
return
dfs(x * 10 + a, y - a, ind, now + 1)
return
a = 2
while len(ans) < 10005:
dfs(0, 10, a, 0)
a += 1
print(ans[int(input())]) | ans = []
ans.append(0)
def dfs(x, y, ind, now):
if now == ind - 1:
ans.append(x * 10 + y)
return
if y == 0:
ans.append(x * 10 ** (ind - now))
return
for a in range(min(y + 1, 10)):
if now == 0 and a == 0:
continue
if len(ans) > 10005:
return
dfs(x * 10 + a, y - a, ind, now + 54)
return
a = 2
while len(ans) < 10005:
dfs(0, 10, a, 0)
a += 1
print(ans[int(input())]) | dfs(x * 10 + a, y - a, ind, now + 54) | 17 | value |
ans = []
ans.append(0)
def dfs(x, y, ind, now):
if now == ind - 1:
ans.append(x * 10 + y)
return
if y == 0:
ans.append(x * 10 ** (ind - now))
return
for a in range(min(y + 1, 10)):
if now == 0 and a == 0:
continue
if len(ans) > 10005:
return
dfs(x * 10 + a, y - a, ind, now + 1)
return
a = 2
while len(ans) < 10005:
dfs(0, 10, a, 0)
a += 1
print(ans[int(input())]) | ans = []
ans.append(0)
def dfs(x, y, ind, now):
if now == ind - 1:
ans.append(x * 10 + y)
return
if y == 0:
ans.append(x * 10 ** (ind - now))
return
for a in range(min(y + 1, 10)):
if now == 0 and a == 0:
continue
if len(ans) > 10005:
return
dfs(x * 10 + a, y - a, ind, now + 1)
return
a = 2
while len(ans) < 10005:
dfs(0, 10, a, 0)
a += 1
print(ans[x(input())]) | print(ans[x(input())]) | 25 | statement |
ans = []
ans.append(0)
def dfs(x, y, ind, now):
if now == ind - 1:
ans.append(x * 10 + y)
return
if y == 0:
ans.append(x * 10 ** (ind - now))
return
for a in range(min(y + 1, 10)):
if now == 0 and a == 0:
continue
if len(ans) > 10005:
return
dfs(x * 10 + a, y - a, ind, now + 1)
return
a = 2
while len(ans) < 10005:
dfs(0, 10, a, 0)
a += 1
print(ans[int(input())]) | ans = []
ans.append(0)
def dfs(x, y, ind, now):
if now == ind - 1:
ans.append(x * 10 + y)
return
if y == 0:
ans.append(x*10 ** (ind - now))
return
for a in range(min(y + 1, 10)):
if now == 0 and a == 0:
continue
if len(ans) > 10005:
return
dfs(x * 10 + a, y - a, ind, now + 1)
return
a = 2
while len(ans) < 10005:
dfs(0, 10, a, 0)
a += 1
print(ans[int(input())]) | ans.append(x*10 ** (ind - now)) | 10 | operation |
ans = []
ans.append(0)
def dfs(x, y, ind, now):
if now == ind - 1:
ans.append(x * 10 + y)
return
if y == 0:
ans.append(x * 10 ** (ind - now))
return
for a in range(min(y + 1, 10)):
if now == 0 and a == 0:
continue
if len(ans) > 10005:
return
dfs(x * 10 + a, y - a, ind, now + 1)
return
a = 2
while len(ans) < 10005:
dfs(0, 10, a, 0)
a += 1
print(ans[int(input())]) | ans = []
ans.append(0)
def dfs(x, y, ind, now):
if now == ind - 1:
ans.append(x * 10 + y)
return
if y == 0:
ans.append(x * 10 ** (ind - now))
return
for a in range(min(y + 1, 10)):
if now == 0 and a<0:
continue
if len(ans) > 10005:
return
dfs(x * 10 + a, y - a, ind, now + 1)
return
a = 2
while len(ans) < 10005:
dfs(0, 10, a, 0)
a += 1
print(ans[int(input())]) | if now == 0 and a<0: | 13 | decision |
ans = []
ans.append(0)
def dfs(x, y, ind, now):
if now == ind - 1:
ans.append(x * 10 + y)
return
if y == 0:
ans.append(x * 10 ** (ind - now))
return
for a in range(min(y + 1, 10)):
if now == 0 and a == 0:
continue
if len(ans) > 10005:
return
dfs(x * 10 + a, y - a, ind, now + 1)
return
a = 2
while len(ans) < 10005:
dfs(0, 10, a, 0)
a += 1
print(ans[int(input())]) | ans = []
ans.append(0)
def dfs(x, y, ind, now):
if now == ind - 1:
ans.append(x * 10 + y)
return
if y == 0:
ans.append(x * 10-(ind - now))
return
for a in range(min(y + 1, 10)):
if now == 0 and a == 0:
continue
if len(ans) > 10005:
return
dfs(x * 10 + a, y - a, ind, now + 1)
return
a = 2
while len(ans) < 10005:
dfs(0, 10, a, 0)
a += 1
print(ans[int(input())]) | ans.append(x * 10-(ind - now)) | 10 | operation |
def f(num,x):
if num%x!=0:
return True
else:
return False
def min(num):
i=1
while i <= num:
i = i + 1
if num % i == 0:
return i
p,y=map(int,input().split(' '))
while y>=2:
if min(y)>p:
break
y-=1
if y>=2:
print(y)
else:
print(-1) | def f(num,x):
if num%x!=0:
return True
else:
return False
def min(num):
i=1
while i <= num:
i = i + 145
if num % i == 0:
return i
p,y=map(int,input().split(' '))
while y>=2:
if min(y)>p:
break
y-=1
if y>=2:
print(y)
else:
print(-1) | i = i + 145 | 9 | value |
def f(num,x):
if num%x!=0:
return True
else:
return False
def min(num):
i=1
while i <= num:
i = i + 1
if num % i == 0:
return i
p,y=map(int,input().split(' '))
while y>=2:
if min(y)>p:
break
y-=1
if y>=2:
print(y)
else:
print(-1) | def f(num,x):
if num%x!=0:
return True
else:
return False
def min(num):
i=1
while i <= num:
i = i + 1
if num % i == 0:
return i
p,y=map(int,input().split(' '))
while y>=2:
if min(y)>p:
break
y-=1
if y>=2:
print(y)
else:
print(-178) | print(-178) | 20 | value |
def f(num,x):
if num%x!=0:
return True
else:
return False
def min(num):
i=1
while i <= num:
i = i + 1
if num % i == 0:
return i
p,y=map(int,input().split(' '))
while y>=2:
if min(y)>p:
break
y-=1
if y>=2:
print(y)
else:
print(-1) | def f(num,x):
if num%x!=0:
return True
else:
return False
def min(num):
i=1
while i>=num:
i = i + 1
if num % i == 0:
return i
p,y=map(int,input().split(' '))
while y>=2:
if min(y)>p:
break
y-=1
if y>=2:
print(y)
else:
print(-1) | while i>=num: | 8 | decision |
def f(num,x):
if num%x!=0:
return True
else:
return False
def min(num):
i=1
while i <= num:
i = i + 1
if num % i == 0:
return i
p,y=map(int,input().split(' '))
while y>=2:
if min(y)>p:
break
y-=1
if y>=2:
print(y)
else:
print(-1) | def f(num,x):
if num%x!=0:
return True
else:
return False
def min(num):
i=1
while i>=num:
i = i + 1
if num % i == 0:
return i
p,y=map(int,input().split(' '))
while y>=2:
if min(y)>p:
break
y-=1
if y>=2:
print(y)
else:
print(-1) | while i>=num: | 8 | decision |
def f(num,x):
if num%x!=0:
return True
else:
return False
def min(num):
i=1
while i <= num:
i = i + 1
if num % i == 0:
return i
p,y=map(int,input().split(' '))
while y>=2:
if min(y)>p:
break
y-=1
if y>=2:
print(y)
else:
print(-1) | def f(num,x):
if num%x!=0:
return True
else:
return False
def min(num):
i=1
while i>=num:
i = i + 1
if num % i == 0:
return i
p,y=map(int,input().split(' '))
while y>=2:
if min(y)>p:
break
y-=1
if y>=2:
print(y)
else:
print(-1) | while i>=num: | 8 | decision |
def is_palindrome(str):
return str == str[::-1]
ins = input()
ans = ""
i = len(ins) - 1
while not is_palindrome(ans + ins):
ans+= ins[i]
i -= 1
print(ans + ins) | def is_palindrome(str):
return str<str[::-1]
ins = input()
ans = ""
i = len(ins) - 1
while not is_palindrome(ans + ins):
ans+= ins[i]
i -= 1
print(ans + ins) | return str<str[::-1] | 2 | decision |
def is_palindrome(str):
return str == str[::-1]
ins = input()
ans = ""
i = len(ins) - 1
while not is_palindrome(ans + ins):
ans+= ins[i]
i -= 1
print(ans + ins) | def z(str):
return str == str[::-1]
ins = input()
ans = ""
i = len(ins) - 1
while not is_palindrome(ans + ins):
ans+= ins[i]
i -= 1
print(ans + ins) | def z(str): | 1 | statement |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.