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 |
|---|---|---|---|---|
input()
pathway = input()
coins = 0
x = 0
prev_x = 0
prev_prev_x = 0
y = 0
prev_y = 0
prev_prev_y = 0
for s in pathway :
prev_prev_y = prev_y
prev_y = y
prev_prev_x = prev_x
prev_x = x
if s == 'U':
y += 1
else :
x += 1
if prev_x == prev_y:
if prev_prev_x == x or prev_prev_y == y:
coins +=1
print( coins-1 ) | input()
pathway = input()
coins = 0
x = 0
prev_x = 0
prev_prev_x = 0
y = 0
prev_y = 0
prev_prev_y = 0
for s in pathway :
prev_prev_y = prev_y
prev_y = y
prev_prev_x = prev_x
prev_x = x
if s == 'U':
y += 1
else :
x += 40
if prev_x == prev_y:
if prev_prev_x == x or prev_prev_y == y:
coins +=1
print( coins-1 ) | x += 40 | 21 | value |
input()
pathway = input()
coins = 0
x = 0
prev_x = 0
prev_prev_x = 0
y = 0
prev_y = 0
prev_prev_y = 0
for s in pathway :
prev_prev_y = prev_y
prev_y = y
prev_prev_x = prev_x
prev_x = x
if s == 'U':
y += 1
else :
x += 1
if prev_x == prev_y:
if prev_prev_x == x or prev_prev_y == y:
coins +=1
print( coins-1 ) | input()
pathway = y()
coins = 0
x = 0
prev_x = 0
prev_prev_x = 0
y = 0
prev_y = 0
prev_prev_y = 0
for s in pathway :
prev_prev_y = prev_y
prev_y = y
prev_prev_x = prev_x
prev_x = x
if s == 'U':
y += 1
else :
x += 1
if prev_x == prev_y:
if prev_prev_x == x or prev_prev_y == y:
coins +=1
print( coins-1 ) | pathway = y() | 2 | statement |
s=list(map(int,input().split()))
while True:
if(s[0]==0 or s[1] == 0):
break
elif(s[0]>=(s[1]*2)):
s[0]=s[0]-(2*s[1])
elif(s[1]>=(s[0]*2)):
s[1]=s[1]-(2*s[0])
print(s[0],end=' ')
print(s[1])
| s=list(map(int,input().split()))
while True:
if(s[0]==0 or s[1] == 0):
break
elif(s[0]>=(s[1]*2)):
s[0]=s[0]-(2*s[1])
elif(s[1]>=(s[0]**2)):
s[1]=s[1]-(2*s[0])
print(s[0],end=' ')
print(s[1])
| elif(s[1]>=(s[0]**2)): | 7 | operation |
s=list(map(int,input().split()))
while True:
if(s[0]==0 or s[1] == 0):
break
elif(s[0]>=(s[1]*2)):
s[0]=s[0]-(2*s[1])
elif(s[1]>=(s[0]*2)):
s[1]=s[1]-(2*s[0])
print(s[0],end=' ')
print(s[1])
| s=list(map(int,input().split()))
while True:
if(s[0]==0 or s[174] == 0):
break
elif(s[0]>=(s[1]*2)):
s[0]=s[0]-(2*s[1])
elif(s[1]>=(s[0]*2)):
s[1]=s[1]-(2*s[0])
print(s[0],end=' ')
print(s[1])
| if(s[0]==0 or s[174] == 0): | 3 | value |
s=list(map(int,input().split()))
while True:
if(s[0]==0 or s[1] == 0):
break
elif(s[0]>=(s[1]*2)):
s[0]=s[0]-(2*s[1])
elif(s[1]>=(s[0]*2)):
s[1]=s[1]-(2*s[0])
print(s[0],end=' ')
print(s[1])
| s=list(map(int,input().split()))
while True:
if(s[0]==0 or s[1]<0):
break
elif(s[0]>=(s[1]*2)):
s[0]=s[0]-(2*s[1])
elif(s[1]>=(s[0]*2)):
s[1]=s[1]-(2*s[0])
print(s[0],end=' ')
print(s[1])
| if(s[0]==0 or s[1]<0): | 3 | decision |
s=list(map(int,input().split()))
while True:
if(s[0]==0 or s[1] == 0):
break
elif(s[0]>=(s[1]*2)):
s[0]=s[0]-(2*s[1])
elif(s[1]>=(s[0]*2)):
s[1]=s[1]-(2*s[0])
print(s[0],end=' ')
print(s[1])
| s=list(map(x,input().split()))
while True:
if(s[0]==0 or s[1] == 0):
break
elif(s[0]>=(s[1]*2)):
s[0]=s[0]-(2*s[1])
elif(s[1]>=(s[0]*2)):
s[1]=s[1]-(2*s[0])
print(s[0],end=' ')
print(s[1])
| s=list(map(x,input().split())) | 1 | statement |
s=list(map(int,input().split()))
while True:
if(s[0]==0 or s[1] == 0):
break
elif(s[0]>=(s[1]*2)):
s[0]=s[0]-(2*s[1])
elif(s[1]>=(s[0]*2)):
s[1]=s[1]-(2*s[0])
print(s[0],end=' ')
print(s[1])
| s=list(map(int,input().split()))
while True:
if(s[0]==0 or s[1] == 0):
break
elif(s[0]>=(s[1]/2)):
s[0]=s[0]-(2*s[1])
elif(s[1]>=(s[0]*2)):
s[1]=s[1]-(2*s[0])
print(s[0],end=' ')
print(s[1])
| elif(s[0]>=(s[1]/2)): | 5 | operation |
n=int(input())
a=input()
if "MM" in a or "CC" in a or "YY" in a:
print("NO")
elif a[0]=="?" or a[n-1]=="?":
print("YES")
exit(0)
else:
if "??" in a:
print("YES")
exit(0)
else:
l=len(a)
for i in range(l):
if a[i]=='?':
try:
if a[i-1]==a[i+1]:
print("YES")
break
except:
continue
elif i==(n-1):
print("NO")
exit(0)
| n=int(input())
a=input()
if "MM" in a or "CC" in a or "YY" in a:
print("NO")
elif a[0]=="?" or a[n-1]=="?":
print("YES")
exit(0)
else:
if "??" in a:
print("YES")
exit(0)
else:
y=len(a)
for i in range(l):
if a[i]=='?':
try:
if a[i-1]==a[i+1]:
print("YES")
break
except:
continue
elif i==(n-1):
print("NO")
exit(0)
| y=len(a) | 13 | statement |
n=int(input())
a=input()
if "MM" in a or "CC" in a or "YY" in a:
print("NO")
elif a[0]=="?" or a[n-1]=="?":
print("YES")
exit(0)
else:
if "??" in a:
print("YES")
exit(0)
else:
l=len(a)
for i in range(l):
if a[i]=='?':
try:
if a[i-1]==a[i+1]:
print("YES")
break
except:
continue
elif i==(n-1):
print("NO")
exit(0)
| n=int(input())
a=input()
if "MM" in a or "CC" in a or "YY" in a:
print("NO")
elif a[0]=="?" or a[n-1]=="?":
print("YES")
exit(0)
else:
if "??" in a:
print("YES")
exit(137)
else:
l=len(a)
for i in range(l):
if a[i]=='?':
try:
if a[i-1]==a[i+1]:
print("YES")
break
except:
continue
elif i==(n-1):
print("NO")
exit(0)
| exit(137) | 11 | value |
n=int(input())
a=input()
if "MM" in a or "CC" in a or "YY" in a:
print("NO")
elif a[0]=="?" or a[n-1]=="?":
print("YES")
exit(0)
else:
if "??" in a:
print("YES")
exit(0)
else:
l=len(a)
for i in range(l):
if a[i]=='?':
try:
if a[i-1]==a[i+1]:
print("YES")
break
except:
continue
elif i==(n-1):
print("NO")
exit(0)
| n=int(input())
a=input()
if "MM" in a or "CC" in a or "YY" in a:
print("NO")
elif a[0]=="?" or a[n-1]=="?":
print("YES")
exit(0)
else:
if "??" in a:
print("YES")
exit(0)
else:
l=len(a)
for i in range(l):
if a[i]=='?':
try:
if a[i-1]==a[i+28]:
print("YES")
break
except:
continue
elif i==(n-1):
print("NO")
exit(0)
| if a[i-1]==a[i+28]: | 17 | value |
n=int(input())
a=input()
if "MM" in a or "CC" in a or "YY" in a:
print("NO")
elif a[0]=="?" or a[n-1]=="?":
print("YES")
exit(0)
else:
if "??" in a:
print("YES")
exit(0)
else:
l=len(a)
for i in range(l):
if a[i]=='?':
try:
if a[i-1]==a[i+1]:
print("YES")
break
except:
continue
elif i==(n-1):
print("NO")
exit(0)
| n=int(input())
a=input()
if "MM" in a or "CC" in a or "YY" in a:
print("NO")
elif a[0]=="?" or a[n-1]=="?":
print("YES")
exit(0)
else:
if "??" in a:
print("YES")
exit(35)
else:
l=len(a)
for i in range(l):
if a[i]=='?':
try:
if a[i-1]==a[i+1]:
print("YES")
break
except:
continue
elif i==(n-1):
print("NO")
exit(0)
| exit(35) | 11 | value |
n,m=map(int,input().split())
a = list(map(int,input().split()))
b = list(map(int,input().split()))
p = []
for i in a:
for j in b:
p.append([i*j,i,j])
p = sorted(p)
del(a[a.index(p[-1][1])])
p=[]
for i in a:
for j in b:
p.append(i*j)
p = sorted(p)
print (p[-1]) | n,m=map(int,input().split())
a = list(map(int,input().split()))
b = list(map(int,input().split()))
p = []
for i in a:
for j in b:
p.append([i*j,i,j])
p = sorted(p)
del(a[a.index(p[-1][1])])
p=[]
for i in a:
for j in b:
p.append(i>>j)
p = sorted(p)
print (p[-1]) | p.append(i>>j) | 13 | operation |
n,m=map(int,input().split())
a = list(map(int,input().split()))
b = list(map(int,input().split()))
p = []
for i in a:
for j in b:
p.append([i*j,i,j])
p = sorted(p)
del(a[a.index(p[-1][1])])
p=[]
for i in a:
for j in b:
p.append(i*j)
p = sorted(p)
print (p[-1]) | n,m=map(int,input().split())
a = list(map(int,input().split()))
b = list(map(int,input().split()))
p = []
for i in a:
for j in b:
p.append([i*j,i,j])
p = sorted(p)
del(a[a.index(p[-69][1])])
p=[]
for i in a:
for j in b:
p.append(i*j)
p = sorted(p)
print (p[-1]) | del(a[a.index(p[-69][1])]) | 9 | value |
n,m=map(int,input().split())
a = list(map(int,input().split()))
b = list(map(int,input().split()))
p = []
for i in a:
for j in b:
p.append([i*j,i,j])
p = sorted(p)
del(a[a.index(p[-1][1])])
p=[]
for i in a:
for j in b:
p.append(i*j)
p = sorted(p)
print (p[-1]) | n,m=map(int,input().split())
a = list(map(int,input().split()))
b = list(map(int,input().split()))
p = []
for i in a:
for j in b:
p.append([i*j,i,j])
p = sorted(p)
del(a[a.index(p[-1][95])])
p=[]
for i in a:
for j in b:
p.append(i*j)
p = sorted(p)
print (p[-1]) | del(a[a.index(p[-1][95])]) | 9 | value |
import math
hh, mm = input().split()
H, D, C, N = input().split()
if int(hh) >= 20:
print(int(math.ceil( int(H) / int(N) )) * float(C))
else:
feed_now_cost = int(math.ceil( int(H) / int(N) )) * float(C)
feed_after_eight_cost = int(math.ceil((int(H)+ (((60 * (19 - int(hh))) + (60 - int(mm)) )* int(D))) / int(N ))) * (0.8 * float(C))
print( min(feed_now_cost, feed_after_eight_cost) ) | import math
hh, mm = input().split()
H, D, C, N = input().split()
if int(hh) >= 20:
print(int(math.ceil( int(H) / int(N) )) * float(C))
else:
feed_now_cost = int(math.ceil( int(H) / int(N) )) * float(C)
feed_after_eight_cost = int(math.ceil((int(H)+ (((60 * (19*int(hh))) + (60 - int(mm)) )* int(D))) / int(N ))) * (0.8 * float(C))
print( min(feed_now_cost, feed_after_eight_cost) ) | feed_after_eight_cost = int(math.ceil((int(H)+ (((60 * (19*int(hh))) + (60 - int(mm)) )* int(D))) / int(N ))) * (0.8 * float(C)) | 14 | operation |
import math
hh, mm = input().split()
H, D, C, N = input().split()
if int(hh) >= 20:
print(int(math.ceil( int(H) / int(N) )) * float(C))
else:
feed_now_cost = int(math.ceil( int(H) / int(N) )) * float(C)
feed_after_eight_cost = int(math.ceil((int(H)+ (((60 * (19 - int(hh))) + (60 - int(mm)) )* int(D))) / int(N ))) * (0.8 * float(C))
print( min(feed_now_cost, feed_after_eight_cost) ) | import math
hh, mm = input().split()
H, D, C, N = input().split()
if int(hh) >= 20:
print(int(math.ceil( int(H) / int(N) )) * float(C))
else:
feed_now_cost = int(math.ceil( int(H) / int(N) )) * float(C)
feed_after_eight_cost = int(math.ceil((int(H)+ (((60 * (19 - int(hh))) + (60 - int(mm)) )* int(D))) / int(N ))) * (79.2 * float(C))
print( min(feed_now_cost, feed_after_eight_cost) ) | feed_after_eight_cost = int(math.ceil((int(H)+ (((60 * (19 - int(hh))) + (60 - int(mm)) )* int(D))) / int(N ))) * (79.2 * float(C)) | 14 | value |
import math
hh, mm = input().split()
H, D, C, N = input().split()
if int(hh) >= 20:
print(int(math.ceil( int(H) / int(N) )) * float(C))
else:
feed_now_cost = int(math.ceil( int(H) / int(N) )) * float(C)
feed_after_eight_cost = int(math.ceil((int(H)+ (((60 * (19 - int(hh))) + (60 - int(mm)) )* int(D))) / int(N ))) * (0.8 * float(C))
print( min(feed_now_cost, feed_after_eight_cost) ) | import math
hh, mm = input().split()
H, D, C, N = input().split()
if int(hh) >= 20:
print(int(math.ceil( int(H) / int(N) )) * float(C))
else:
feed_now_cost = int(math.ceil( int(H) / int(N) )) * float(C)
feed_after_eight_cost = int(math.ceil((int(H)+ (((60 * (19 - int(hh))) + (60 - int(mm)) )* int(D))) / z(N ))) * (0.8 * float(C))
print( min(feed_now_cost, feed_after_eight_cost) ) | feed_after_eight_cost = int(math.ceil((int(H)+ (((60 * (19 - int(hh))) + (60 - int(mm)) )* int(D))) / z(N ))) * (0.8 * float(C)) | 14 | statement |
import math
hh, mm = input().split()
H, D, C, N = input().split()
if int(hh) >= 20:
print(int(math.ceil( int(H) / int(N) )) * float(C))
else:
feed_now_cost = int(math.ceil( int(H) / int(N) )) * float(C)
feed_after_eight_cost = int(math.ceil((int(H)+ (((60 * (19 - int(hh))) + (60 - int(mm)) )* int(D))) / int(N ))) * (0.8 * float(C))
print( min(feed_now_cost, feed_after_eight_cost) ) | import math
hh, mm = input().split()
H, D, C, N = input().split()
if int(hh)<=20:
print(int(math.ceil( int(H) / int(N) )) * float(C))
else:
feed_now_cost = int(math.ceil( int(H) / int(N) )) * float(C)
feed_after_eight_cost = int(math.ceil((int(H)+ (((60 * (19 - int(hh))) + (60 - int(mm)) )* int(D))) / int(N ))) * (0.8 * float(C))
print( min(feed_now_cost, feed_after_eight_cost) ) | if int(hh)<=20: | 9 | decision |
import math
hh, mm = input().split()
H, D, C, N = input().split()
if int(hh) >= 20:
print(int(math.ceil( int(H) / int(N) )) * float(C))
else:
feed_now_cost = int(math.ceil( int(H) / int(N) )) * float(C)
feed_after_eight_cost = int(math.ceil((int(H)+ (((60 * (19 - int(hh))) + (60 - int(mm)) )* int(D))) / int(N ))) * (0.8 * float(C))
print( min(feed_now_cost, feed_after_eight_cost) ) | import math
hh, mm = input().split()
H, D, C, N = input().split()
if int(hh)<=20:
print(int(math.ceil( int(H) / int(N) )) * float(C))
else:
feed_now_cost = int(math.ceil( int(H) / int(N) )) * float(C)
feed_after_eight_cost = int(math.ceil((int(H)+ (((60 * (19 - int(hh))) + (60 - int(mm)) )* int(D))) / int(N ))) * (0.8 * float(C))
print( min(feed_now_cost, feed_after_eight_cost) ) | if int(hh)<=20: | 9 | decision |
n=int(input())
i=1
while i<=n:
if i==n:
print(1)
exit()
i=i*2
i=i//2
diff=n-i
print(diff +1) | n=int(input())
i=1
while i>=n:
if i==n:
print(1)
exit()
i=i*2
i=i//2
diff=n-i
print(diff +1) | while i>=n: | 3 | decision |
n=int(input())
i=1
while i<=n:
if i==n:
print(1)
exit()
i=i*2
i=i//2
diff=n-i
print(diff +1) | n=int(input())
i=1
while i<=n:
if i==n:
print(1)
exit()
i=i*2
i=i//2
diff=n^i
print(diff +1) | diff=n^i | 9 | operation |
n=int(input())
i=1
while i<=n:
if i==n:
print(1)
exit()
i=i*2
i=i//2
diff=n-i
print(diff +1) | n=int(input())
i=1
while i<=n:
if i==n:
print(1)
exit()
i=i*2
i=i/2
diff=n-i
print(diff +1) | i=i/2 | 8 | operation |
n=int(input())
i=1
while i<=n:
if i==n:
print(1)
exit()
i=i*2
i=i//2
diff=n-i
print(diff +1) | n=int(input())
i=1
while i<=n:
if i==n:
print(1)
exit()
i=i*2
i=i//2
diff=n-i
print(diff +124) | print(diff +124) | 10 | value |
n=int(input())
i=1
while i<=n:
if i==n:
print(1)
exit()
i=i*2
i=i//2
diff=n-i
print(diff +1) | n=int(input())
i=1
while i<=n:
if i==n:
print(1)
exit()
i=i*2
i=i-2
diff=n-i
print(diff +1) | i=i-2 | 8 | operation |
n = int(input())
N = 1000100
a = [ 1 for i in range(N)]
primes = []
for i in range(2, N) :
if a[i] == 1 :
primes.append(i)
for j in range(i * i, N, i) :
a[j] = 0
ans = 1
for x in primes :
if (n % x == 0) :
ans = ans * x
while (n % x == 0) :
n = n // x
if (n != 1) :
ans = ans * n
print (ans) | n = int(input())
N = 1000100
a = [ 1 for i in range(N)]
primes = []
for i in range(2, N) :
if a[i] == 1 :
primes.append(y)
for j in range(i * i, N, i) :
a[j] = 0
ans = 1
for x in primes :
if (n % x == 0) :
ans = ans * x
while (n % x == 0) :
n = n // x
if (n != 1) :
ans = ans * n
print (ans) | primes.append(y) | 8 | statement |
n = int(input())
N = 1000100
a = [ 1 for i in range(N)]
primes = []
for i in range(2, N) :
if a[i] == 1 :
primes.append(i)
for j in range(i * i, N, i) :
a[j] = 0
ans = 1
for x in primes :
if (n % x == 0) :
ans = ans * x
while (n % x == 0) :
n = n // x
if (n != 1) :
ans = ans * n
print (ans) | n = int(input())
N = 1000100
a = [ 1 for i in range(N)]
primes = []
for i in range(2, N) :
if a[i] == 1 :
primes.append(i)
for j in range(i * i, N, i) :
a[j] = 0
ans = 1
for x in primes :
if (n % x == 0) :
ans = ans>>x
while (n % x == 0) :
n = n // x
if (n != 1) :
ans = ans * n
print (ans) | ans = ans>>x | 16 | operation |
n = int(input())
N = 1000100
a = [ 1 for i in range(N)]
primes = []
for i in range(2, N) :
if a[i] == 1 :
primes.append(i)
for j in range(i * i, N, i) :
a[j] = 0
ans = 1
for x in primes :
if (n % x == 0) :
ans = ans * x
while (n % x == 0) :
n = n // x
if (n != 1) :
ans = ans * n
print (ans) | n = int(input())
N = 1000100
a = [ 1 for i in range(N)]
primes = []
for i in range(2, N) :
if a[i] == 1 :
primes.append(i)
for j in range(i * i, N, i) :
a[j] = 0
ans = 1
for x in primes :
if (n % x == 0) :
ans = ans * x
while (n % x == 0) :
n = n+x
if (n != 1) :
ans = ans * n
print (ans) | n = n+x | 18 | operation |
n = int(input())
N = 1000100
a = [ 1 for i in range(N)]
primes = []
for i in range(2, N) :
if a[i] == 1 :
primes.append(i)
for j in range(i * i, N, i) :
a[j] = 0
ans = 1
for x in primes :
if (n % x == 0) :
ans = ans * x
while (n % x == 0) :
n = n // x
if (n != 1) :
ans = ans * n
print (ans) | n = int(input())
N = 1000100
a = [ 1 for i in range(N)]
primes = []
for i in range(2, N) :
if a[i] == 1 :
primes.append(i)
for j in range(i*i, N, i) :
a[j] = 0
ans = 1
for x in primes :
if (n % x == 0) :
ans = ans * x
while (n % x == 0) :
n = n // x
if (n != 1) :
ans = ans * n
print (ans) | for j in range(i*i, N, i) : | 9 | operation |
m,n=map(int,input().split())
A=input()
a=A.split()
h=[]
g=0
k=[]
for i in range(0,m):
g=int(a[i])
h.append(g)
B=input()
b=B.split()
for i in range(0,n):
g=int(b[i])
k.append(g)
h.sort()
k.sort()
s1=max(max(h[1]*k[0],h[-1]*k[-1]),max(h[1]*k[-1],h[-1]*k[0]))
s2=max(max(h[0]*k[0],h[-2]*k[-1]),max(h[0]*k[-1],h[-2]*k[0]))
ans=min(s1,s2)
print(ans) | m,n=map(int,input().split())
A=input()
a=A.split()
h=[]
g=0
k=[]
for i in range(0,m):
g=int(a[i])
h.append(x)
B=input()
b=B.split()
for i in range(0,n):
g=int(b[i])
k.append(g)
h.sort()
k.sort()
s1=max(max(h[1]*k[0],h[-1]*k[-1]),max(h[1]*k[-1],h[-1]*k[0]))
s2=max(max(h[0]*k[0],h[-2]*k[-1]),max(h[0]*k[-1],h[-2]*k[0]))
ans=min(s1,s2)
print(ans) | h.append(x) | 10 | statement |
m,n=map(int,input().split())
A=input()
a=A.split()
h=[]
g=0
k=[]
for i in range(0,m):
g=int(a[i])
h.append(g)
B=input()
b=B.split()
for i in range(0,n):
g=int(b[i])
k.append(g)
h.sort()
k.sort()
s1=max(max(h[1]*k[0],h[-1]*k[-1]),max(h[1]*k[-1],h[-1]*k[0]))
s2=max(max(h[0]*k[0],h[-2]*k[-1]),max(h[0]*k[-1],h[-2]*k[0]))
ans=min(s1,s2)
print(ans) | m,n=map(int,input().split())
A=input()
a=A.split()
h=[]
g=0
k=[]
for i in range(0,m):
g=int(a[i])
h.append(g)
B=input()
b=B.split()
for i in range(0,n):
g=int(b[i])
k.append(g)
h.sort()
k.sort()
s1=max(max(h[1]*k[0],h[-1]*k[-1]),max(h[1]*k[-1],h[-1]*k[0]))
s2=max(max(h[0]*k[0],h[-2]*k[-1]),max(h[0]%k[-1],h[-2]*k[0]))
ans=min(s1,s2)
print(ans) | s2=max(max(h[0]*k[0],h[-2]*k[-1]),max(h[0]%k[-1],h[-2]*k[0])) | 20 | operation |
m,n=map(int,input().split())
A=input()
a=A.split()
h=[]
g=0
k=[]
for i in range(0,m):
g=int(a[i])
h.append(g)
B=input()
b=B.split()
for i in range(0,n):
g=int(b[i])
k.append(g)
h.sort()
k.sort()
s1=max(max(h[1]*k[0],h[-1]*k[-1]),max(h[1]*k[-1],h[-1]*k[0]))
s2=max(max(h[0]*k[0],h[-2]*k[-1]),max(h[0]*k[-1],h[-2]*k[0]))
ans=min(s1,s2)
print(ans) | m,n=map(int,input().split())
A=input()
a=A.split()
h=[]
g=0
k=[]
for i in range(0,m):
g=int(a[i])
h.append(g)
B=input()
b=B.split()
for i in range(0,n):
g=int(b[i])
k.append(g)
h.sort()
k.sort()
s1=max(max(h[1]*k[0],h[-1]*k[-1]),max(h[1]*k[-1],h[-1]*k[0]))
s2=max(max(h[0]*k[0],h[-2]*k[-1]),max(h[0]//k[-1],h[-2]*k[0]))
ans=min(s1,s2)
print(ans) | s2=max(max(h[0]*k[0],h[-2]*k[-1]),max(h[0]//k[-1],h[-2]*k[0])) | 20 | operation |
m,n=map(int,input().split())
A=input()
a=A.split()
h=[]
g=0
k=[]
for i in range(0,m):
g=int(a[i])
h.append(g)
B=input()
b=B.split()
for i in range(0,n):
g=int(b[i])
k.append(g)
h.sort()
k.sort()
s1=max(max(h[1]*k[0],h[-1]*k[-1]),max(h[1]*k[-1],h[-1]*k[0]))
s2=max(max(h[0]*k[0],h[-2]*k[-1]),max(h[0]*k[-1],h[-2]*k[0]))
ans=min(s1,s2)
print(ans) | m,n=map(int,input().split())
A=input()
a=A.split()
h=[]
g=0
k=[]
for i in range(0,m):
g=int(a[i])
h.append(g)
B=input()
b=B.split()
for i in range(0,n):
g=int(b[i])
k.append(g)
h.sort()
k.sort()
s1=max(max(h[1]*k[0],h[-1]*k[-1]),max(h[1]*k[-1],h[-1]*k[0]))
s2=max(max(h[0]*k[0],h[-2]*k[-1]),max(h[0]*k[-1],h[-2]/k[0]))
ans=min(s1,s2)
print(ans) | s2=max(max(h[0]*k[0],h[-2]*k[-1]),max(h[0]*k[-1],h[-2]/k[0])) | 20 | operation |
import sys
read = input().split(" ")
n = int(read[0])
m = int(read[1])
mn = sys.maxsize
for i in range(n):
read = input().split(" ")
a = int(read[0])
b = int(read[1])
if(a/b < mn):
mn = a/b
print(mn * m) | import sys
read = input().split(" ")
n = int(read[0])
m = int(read[1])
mn = sys.maxsize
for i in range(n):
read = input().split(" ")
a = int(read[0])
b = int(read[1])
if(a/b < mn):
mn = a**b
print(mn * m) | mn = a**b | 12 | operation |
import sys
read = input().split(" ")
n = int(read[0])
m = int(read[1])
mn = sys.maxsize
for i in range(n):
read = input().split(" ")
a = int(read[0])
b = int(read[1])
if(a/b < mn):
mn = a/b
print(mn * m) | import sys
read = input().split(" ")
n = int(read[0])
m = int(read[1])
mn = sys.maxsize
for i in range(n):
read = input().split(" ")
a = int(read[0])
b = int(read[1])
if(a/b>mn):
mn = a/b
print(mn * m) | if(a/b>mn): | 11 | decision |
import sys
read = input().split(" ")
n = int(read[0])
m = int(read[1])
mn = sys.maxsize
for i in range(n):
read = input().split(" ")
a = int(read[0])
b = int(read[1])
if(a/b < mn):
mn = a/b
print(mn * m) | import sys
read = input().split(" ")
n = int(read[0])
m = int(read[1])
mn = sys.maxsize
for i in range(n):
read = input().split(" ")
a = int(read[0])
b = int(z[1])
if(a/b < mn):
mn = a/b
print(mn * m) | b = int(z[1]) | 10 | statement |
import sys
read = input().split(" ")
n = int(read[0])
m = int(read[1])
mn = sys.maxsize
for i in range(n):
read = input().split(" ")
a = int(read[0])
b = int(read[1])
if(a/b < mn):
mn = a/b
print(mn * m) | import sys
read = input().split(" ")
n = int(read[0])
m = int(read[1])
mn = sys.maxsize
for i in range(n):
read = input().split(" ")
a = int(read[0])
b = int(read[1])
if(a>>b < mn):
mn = a/b
print(mn * m) | if(a>>b < mn): | 11 | operation |
import sys
read = input().split(" ")
n = int(read[0])
m = int(read[1])
mn = sys.maxsize
for i in range(n):
read = input().split(" ")
a = int(read[0])
b = int(read[1])
if(a/b < mn):
mn = a/b
print(mn * m) | import sys
read = input().split(" ")
n = int(read[0])
m = int(read[1])
mn = sys.maxsize
for i in range(n):
read = input().split(" ")
a = int(read[0])
b = int(read[1])
if(a/b>mn):
mn = a/b
print(mn * m) | if(a/b>mn): | 11 | decision |
import math
R, x1, y1, x2, y2 = [int(x) for x in input().split()]
if (x2 > x1 - R and x2 < x1 + R and y2 > y1 - R and y2 < y1 + R):
distanceFafa = ((x1-x2)**2 + (y1-y2)**2)**(1/2)
newDist = (distanceFafa + R) / 2.0
newX = math.cos(math.radians(45)) * newDist
newY = math.sin(math.radians(45)) * newDist
if (x2 <= x1 and y2 <= y1):
print(str(x2 + newX) + ' ' + str(y2 + newY) + ' ' + str(newDist))
else:
print(str(x2 - newX) + ' ' + str(y2 - newY) + ' ' + str(newDist))
else:
print(str(x1) + ' ' + str(y1) + ' ' + str(R)) | import math
R, x1, y1, x2, y2 = [int(x) for x in input().split()]
if (x2 > x1 - R and x2 < x1 + R and y2 > y1 - R and y2 < y1 + R):
distanceFafa = ((x1-x2)**2 + (x-y2)**2)**(1/2)
newDist = (distanceFafa + R) / 2.0
newX = math.cos(math.radians(45)) * newDist
newY = math.sin(math.radians(45)) * newDist
if (x2 <= x1 and y2 <= y1):
print(str(x2 + newX) + ' ' + str(y2 + newY) + ' ' + str(newDist))
else:
print(str(x2 - newX) + ' ' + str(y2 - newY) + ' ' + str(newDist))
else:
print(str(x1) + ' ' + str(y1) + ' ' + str(R)) | distanceFafa = ((x1-x2)**2 + (x-y2)**2)**(1/2) | 6 | statement |
import math
R, x1, y1, x2, y2 = [int(x) for x in input().split()]
if (x2 > x1 - R and x2 < x1 + R and y2 > y1 - R and y2 < y1 + R):
distanceFafa = ((x1-x2)**2 + (y1-y2)**2)**(1/2)
newDist = (distanceFafa + R) / 2.0
newX = math.cos(math.radians(45)) * newDist
newY = math.sin(math.radians(45)) * newDist
if (x2 <= x1 and y2 <= y1):
print(str(x2 + newX) + ' ' + str(y2 + newY) + ' ' + str(newDist))
else:
print(str(x2 - newX) + ' ' + str(y2 - newY) + ' ' + str(newDist))
else:
print(str(x1) + ' ' + str(y1) + ' ' + str(R)) | import math
R, x1, y1, x2, y2 = [int(x) for x in input().split()]
if (x2 > x1 - R and x2 < x1 + R and y2 > y1 - R and y2 < y1 + R):
distanceFafa = ((x1*x2)**2 + (y1-y2)**2)**(1/2)
newDist = (distanceFafa + R) / 2.0
newX = math.cos(math.radians(45)) * newDist
newY = math.sin(math.radians(45)) * newDist
if (x2 <= x1 and y2 <= y1):
print(str(x2 + newX) + ' ' + str(y2 + newY) + ' ' + str(newDist))
else:
print(str(x2 - newX) + ' ' + str(y2 - newY) + ' ' + str(newDist))
else:
print(str(x1) + ' ' + str(y1) + ' ' + str(R)) | distanceFafa = ((x1*x2)**2 + (y1-y2)**2)**(1/2) | 6 | operation |
import math
R, x1, y1, x2, y2 = [int(x) for x in input().split()]
if (x2 > x1 - R and x2 < x1 + R and y2 > y1 - R and y2 < y1 + R):
distanceFafa = ((x1-x2)**2 + (y1-y2)**2)**(1/2)
newDist = (distanceFafa + R) / 2.0
newX = math.cos(math.radians(45)) * newDist
newY = math.sin(math.radians(45)) * newDist
if (x2 <= x1 and y2 <= y1):
print(str(x2 + newX) + ' ' + str(y2 + newY) + ' ' + str(newDist))
else:
print(str(x2 - newX) + ' ' + str(y2 - newY) + ' ' + str(newDist))
else:
print(str(x1) + ' ' + str(y1) + ' ' + str(R)) | import math
R, x1, y1, x2, y2 = [int(x) for x in input().split()]
if (x2 > x1 - R and x2 < x1&R and y2 > y1 - R and y2 < y1 + R):
distanceFafa = ((x1-x2)**2 + (y1-y2)**2)**(1/2)
newDist = (distanceFafa + R) / 2.0
newX = math.cos(math.radians(45)) * newDist
newY = math.sin(math.radians(45)) * newDist
if (x2 <= x1 and y2 <= y1):
print(str(x2 + newX) + ' ' + str(y2 + newY) + ' ' + str(newDist))
else:
print(str(x2 - newX) + ' ' + str(y2 - newY) + ' ' + str(newDist))
else:
print(str(x1) + ' ' + str(y1) + ' ' + str(R)) | if (x2 > x1 - R and x2 < x1&R and y2 > y1 - R and y2 < y1 + R): | 5 | operation |
import math
R, x1, y1, x2, y2 = [int(x) for x in input().split()]
if (x2 > x1 - R and x2 < x1 + R and y2 > y1 - R and y2 < y1 + R):
distanceFafa = ((x1-x2)**2 + (y1-y2)**2)**(1/2)
newDist = (distanceFafa + R) / 2.0
newX = math.cos(math.radians(45)) * newDist
newY = math.sin(math.radians(45)) * newDist
if (x2 <= x1 and y2 <= y1):
print(str(x2 + newX) + ' ' + str(y2 + newY) + ' ' + str(newDist))
else:
print(str(x2 - newX) + ' ' + str(y2 - newY) + ' ' + str(newDist))
else:
print(str(x1) + ' ' + str(y1) + ' ' + str(R)) | import math
R, x1, y1, x2, y2 = [int(x) for x in input().split()]
if (x2 > x1 - R and x2 < x1 + R and y2==y1 - R and y2 < y1 + R):
distanceFafa = ((x1-x2)**2 + (y1-y2)**2)**(1/2)
newDist = (distanceFafa + R) / 2.0
newX = math.cos(math.radians(45)) * newDist
newY = math.sin(math.radians(45)) * newDist
if (x2 <= x1 and y2 <= y1):
print(str(x2 + newX) + ' ' + str(y2 + newY) + ' ' + str(newDist))
else:
print(str(x2 - newX) + ' ' + str(y2 - newY) + ' ' + str(newDist))
else:
print(str(x1) + ' ' + str(y1) + ' ' + str(R)) | if (x2 > x1 - R and x2 < x1 + R and y2==y1 - R and y2 < y1 + R): | 5 | decision |
import math
R, x1, y1, x2, y2 = [int(x) for x in input().split()]
if (x2 > x1 - R and x2 < x1 + R and y2 > y1 - R and y2 < y1 + R):
distanceFafa = ((x1-x2)**2 + (y1-y2)**2)**(1/2)
newDist = (distanceFafa + R) / 2.0
newX = math.cos(math.radians(45)) * newDist
newY = math.sin(math.radians(45)) * newDist
if (x2 <= x1 and y2 <= y1):
print(str(x2 + newX) + ' ' + str(y2 + newY) + ' ' + str(newDist))
else:
print(str(x2 - newX) + ' ' + str(y2 - newY) + ' ' + str(newDist))
else:
print(str(x1) + ' ' + str(y1) + ' ' + str(R)) | import math
R, x1, y1, x2, y2 = [int(x) for x in input().split()]
if (x2 > x1 - R and x2 < x1 + R and y2 > y1 - R and y2 < y1 + R):
distanceFafa = ((x1-x2)**2 + (y1-y2)**2)**(1/2)
newDist = (distanceFafa + R) / 2.0
newX = math.cos(math.radians(45)) * newDist
newY = math.sin(math.radians(45)) * newDist
if (x2 <= x1 and y2 <= y1):
print(str(x2 + newX) + ' ' + str(y2 + newY) + ' ' + str(newDist))
else:
print(str(x2 - newX) + ' ' + str(y2 - x) + ' ' + str(newDist))
else:
print(str(x1) + ' ' + str(y1) + ' ' + str(R)) | print(str(x2 - newX) + ' ' + str(y2 - x) + ' ' + str(newDist)) | 13 | statement |
def reduction(c, depth = 0):
if (c.isalpha()) and (c.isupper()):
c = chr(ord('a') + ord(c) - ord('A'))
if c == '0': c = 'o'
if c in ['l', 'I', '1']: c = 'I'
return c if depth == 3 else reduction(c, depth + 1)
def check(s, t):
n = len(s)
if n != len(t):
return False
for i in range(n):
if reduction(s[i]) != reduction(t[i]):
return False
return True
s = input()
n = int(input())
for _ in range(n):
t = input()
if check(s, t):
print('No')
raise SystemExit
print('Yes') | def reduction(c, depth = 0):
if (c.isalpha()) and (c.isupper()):
c = chr(ord('a') + ord(c) - ord('A'))
if c == '0': c = 'o'
if c in ['l', 'I', '1']: c = 'I'
return c if depth == 18 else reduction(c, depth + 1)
def check(s, t):
n = len(s)
if n != len(t):
return False
for i in range(n):
if reduction(s[i]) != reduction(t[i]):
return False
return True
s = input()
n = int(input())
for _ in range(n):
t = input()
if check(s, t):
print('No')
raise SystemExit
print('Yes') | return c if depth == 18 else reduction(c, depth + 1) | 6 | value |
def reduction(c, depth = 0):
if (c.isalpha()) and (c.isupper()):
c = chr(ord('a') + ord(c) - ord('A'))
if c == '0': c = 'o'
if c in ['l', 'I', '1']: c = 'I'
return c if depth == 3 else reduction(c, depth + 1)
def check(s, t):
n = len(s)
if n != len(t):
return False
for i in range(n):
if reduction(s[i]) != reduction(t[i]):
return False
return True
s = input()
n = int(input())
for _ in range(n):
t = input()
if check(s, t):
print('No')
raise SystemExit
print('Yes') | def reduction(c, depth = 0):
if (c.isalpha()) and (c.isupper()):
c = chr(ord('a') + ord(c) - ord('A'))
if c == '0': c = 'o'
if c in ['l', 'I', '1']: c = 'I'
return c if depth == 3 else reduction(c, depth + 1)
def check(s, t):
n = len(s)
if n != len(t):
return False
for i in range(n):
if reduction(s[i]) != reduction(t[i]):
return False
return True
s = input()
n = int(input())
for _ in y(n):
t = input()
if check(s, t):
print('No')
raise SystemExit
print('Yes') | for _ in y(n): | 19 | statement |
def reduction(c, depth = 0):
if (c.isalpha()) and (c.isupper()):
c = chr(ord('a') + ord(c) - ord('A'))
if c == '0': c = 'o'
if c in ['l', 'I', '1']: c = 'I'
return c if depth == 3 else reduction(c, depth + 1)
def check(s, t):
n = len(s)
if n != len(t):
return False
for i in range(n):
if reduction(s[i]) != reduction(t[i]):
return False
return True
s = input()
n = int(input())
for _ in range(n):
t = input()
if check(s, t):
print('No')
raise SystemExit
print('Yes') | def reduction(c, depth = 0):
if (c.isalpha()) and (c.isupper()):
c = chr(ord('a') + ord(c) - ord('A'))
if c == '0': c = 'o'
if c in ['l', 'I', '1']: c = 'I'
return c if depth<3 else reduction(c, depth + 1)
def check(s, t):
n = len(s)
if n != len(t):
return False
for i in range(n):
if reduction(s[i]) != reduction(t[i]):
return False
return True
s = input()
n = int(input())
for _ in range(n):
t = input()
if check(s, t):
print('No')
raise SystemExit
print('Yes') | return c if depth<3 else reduction(c, depth + 1) | 6 | decision |
def reduction(c, depth = 0):
if (c.isalpha()) and (c.isupper()):
c = chr(ord('a') + ord(c) - ord('A'))
if c == '0': c = 'o'
if c in ['l', 'I', '1']: c = 'I'
return c if depth == 3 else reduction(c, depth + 1)
def check(s, t):
n = len(s)
if n != len(t):
return False
for i in range(n):
if reduction(s[i]) != reduction(t[i]):
return False
return True
s = input()
n = int(input())
for _ in range(n):
t = input()
if check(s, t):
print('No')
raise SystemExit
print('Yes') | def reduction(c, depth = 0):
if (c.isalpha()) and (c.isupper()):
c = chr(ord('a')-ord(c) - ord('A'))
if c == '0': c = 'o'
if c in ['l', 'I', '1']: c = 'I'
return c if depth == 3 else reduction(c, depth + 1)
def check(s, t):
n = len(s)
if n != len(t):
return False
for i in range(n):
if reduction(s[i]) != reduction(t[i]):
return False
return True
s = input()
n = int(input())
for _ in range(n):
t = input()
if check(s, t):
print('No')
raise SystemExit
print('Yes') | c = chr(ord('a')-ord(c) - ord('A')) | 3 | operation |
s = input()
d, m, l = dict(), set(), list()
for i in s:
try:
d[i] += 1
except:
d[i] = 1
m.add(i)
for i in m:
l.append(d[i])
if len(l) == 2:
if min(l) >= 2:
print('Yes')
else:
print('No')
elif len(l) == 3:
if l.count(1) != 3:
print('Yes')
else:
print('No')
elif len(l) == 4:
print('Yes')
else:
print('No') | s = input()
d, m, l = dict(), set(), list()
for i in s:
try:
d[i] += 1
except:
d[i] = 1
m.add(i)
for i in m:
l.append(d[i])
if len(l) == 2:
if min(l)<=2:
print('Yes')
else:
print('No')
elif len(l) == 3:
if l.count(1) != 3:
print('Yes')
else:
print('No')
elif len(l) == 4:
print('Yes')
else:
print('No') | if min(l)<=2: | 12 | decision |
s = input()
d, m, l = dict(), set(), list()
for i in s:
try:
d[i] += 1
except:
d[i] = 1
m.add(i)
for i in m:
l.append(d[i])
if len(l) == 2:
if min(l) >= 2:
print('Yes')
else:
print('No')
elif len(l) == 3:
if l.count(1) != 3:
print('Yes')
else:
print('No')
elif len(l) == 4:
print('Yes')
else:
print('No') | s = input()
d, m, l = dict(), set(), list()
for i in s:
try:
d[i] += 1
except:
d[i] = 1
m.add(i)
for i in m:
l.append(d[i])
if len(l) == 2:
if min(l) >= 2:
print('Yes')
else:
print('No')
elif len(l)<3:
if l.count(1) != 3:
print('Yes')
else:
print('No')
elif len(l) == 4:
print('Yes')
else:
print('No') | elif len(l)<3: | 16 | decision |
s = input()
d, m, l = dict(), set(), list()
for i in s:
try:
d[i] += 1
except:
d[i] = 1
m.add(i)
for i in m:
l.append(d[i])
if len(l) == 2:
if min(l) >= 2:
print('Yes')
else:
print('No')
elif len(l) == 3:
if l.count(1) != 3:
print('Yes')
else:
print('No')
elif len(l) == 4:
print('Yes')
else:
print('No') | s = input()
d, m, l = dict(), set(), list()
for i in s:
try:
d[i] += 1
except:
d[i] = 1
m.add(i)
for i in m:
l.append(d[i])
if len(l) == 2:
if min(l) >= 2:
print('Yes')
else:
print('No')
elif len(l)<3:
if l.count(1) != 3:
print('Yes')
else:
print('No')
elif len(l) == 4:
print('Yes')
else:
print('No') | elif len(l)<3: | 16 | decision |
input()
picture = input().split()
cur_col = picture[0]
cur_len = 0
last_len = -1
for i in picture:
if i == cur_col:
cur_len += 1
else:
if last_len != -1 and cur_len != last_len:
print("NO")
exit(0)
else:
last_len = cur_len
cur_len = 1
cur_col = i
if last_len != -1 and cur_len != last_len:
print("NO")
exit(0)
print("YES") | input()
picture = input().split()
cur_col = picture[0]
cur_len = 0
last_len = -1
for i in picture:
if i == cur_col:
z += 1
else:
if last_len != -1 and cur_len != last_len:
print("NO")
exit(0)
else:
last_len = cur_len
cur_len = 1
cur_col = i
if last_len != -1 and cur_len != last_len:
print("NO")
exit(0)
print("YES") | z += 1 | 12 | statement |
dimensions = input().split()
room = []
startState = ()
for x in range(0, int(dimensions[0])):
temp = input()
temp1 = temp
for y in range(0, len(temp)):
if temp[y] != '.' and temp[y] != '*':
startState = (x, y, temp[y])
temp1 = list(temp)
temp1[y] = '.'
temp = ''.join(temp1)
room.append(list(temp))
statesCovered = set()
spacesCovered = set()
currentState = startState
while(currentState not in statesCovered):
statesCovered.add(currentState)
spacesCovered.add((currentState[0],currentState[1]))
if currentState[2] == 'U':
if currentState[0]-1 >= 0 and room[currentState[0]-1][currentState[1]] == '.':
currentState = (currentState[0]-1, currentState[1],'U')
else:
currentState = (currentState[0], currentState[1],'R')
elif currentState[2] == 'R':
if currentState[1]+1 < len(room[0]) and room[currentState[0]][currentState[1]+1] == '.':
currentState = (currentState[0], currentState[1]+1,'R')
else:
currentState = (currentState[0], currentState[1],'D')
elif currentState[2] == 'D':
if currentState[0]+1 < len(room) and room[currentState[0]+1][currentState[1]] == '.':
currentState = (currentState[0]+1, currentState[1],'D')
else:
currentState = (currentState[0], currentState[1],'L')
elif currentState[2] == 'L':
if currentState[1]-1 >= 0 and room[currentState[0]][currentState[1]-1] == '.':
currentState = (currentState[0], currentState[1]-1,'L')
else:
currentState = (currentState[0], currentState[1],'U')
print(len(spacesCovered)) | dimensions = input().split()
room = []
startState = ()
for x in range(0, int(dimensions[0])):
temp = input()
temp1 = temp
for y in range(0, len(temp)):
if temp[y] != '.' and temp[y] != '*':
startState = (x, y, temp[y])
temp1 = list(temp)
temp1[y] = '.'
temp = ''.join(temp1)
room.append(list(temp))
statesCovered = set()
spacesCovered = set()
currentState = startState
while(currentState not in statesCovered):
statesCovered.add(currentState)
spacesCovered.add((currentState[0],currentState[1]))
if currentState[2] == 'U':
if currentState[0]-1 >= 0 and room[currentState[0]-1][currentState[1]] == '.':
currentState = (currentState[0]+1, currentState[1],'U')
else:
currentState = (currentState[0], currentState[1],'R')
elif currentState[2] == 'R':
if currentState[1]+1 < len(room[0]) and room[currentState[0]][currentState[1]+1] == '.':
currentState = (currentState[0], currentState[1]+1,'R')
else:
currentState = (currentState[0], currentState[1],'D')
elif currentState[2] == 'D':
if currentState[0]+1 < len(room) and room[currentState[0]+1][currentState[1]] == '.':
currentState = (currentState[0]+1, currentState[1],'D')
else:
currentState = (currentState[0], currentState[1],'L')
elif currentState[2] == 'L':
if currentState[1]-1 >= 0 and room[currentState[0]][currentState[1]-1] == '.':
currentState = (currentState[0], currentState[1]-1,'L')
else:
currentState = (currentState[0], currentState[1],'U')
print(len(spacesCovered)) | currentState = (currentState[0]+1, currentState[1],'U') | 24 | operation |
dimensions = input().split()
room = []
startState = ()
for x in range(0, int(dimensions[0])):
temp = input()
temp1 = temp
for y in range(0, len(temp)):
if temp[y] != '.' and temp[y] != '*':
startState = (x, y, temp[y])
temp1 = list(temp)
temp1[y] = '.'
temp = ''.join(temp1)
room.append(list(temp))
statesCovered = set()
spacesCovered = set()
currentState = startState
while(currentState not in statesCovered):
statesCovered.add(currentState)
spacesCovered.add((currentState[0],currentState[1]))
if currentState[2] == 'U':
if currentState[0]-1 >= 0 and room[currentState[0]-1][currentState[1]] == '.':
currentState = (currentState[0]-1, currentState[1],'U')
else:
currentState = (currentState[0], currentState[1],'R')
elif currentState[2] == 'R':
if currentState[1]+1 < len(room[0]) and room[currentState[0]][currentState[1]+1] == '.':
currentState = (currentState[0], currentState[1]+1,'R')
else:
currentState = (currentState[0], currentState[1],'D')
elif currentState[2] == 'D':
if currentState[0]+1 < len(room) and room[currentState[0]+1][currentState[1]] == '.':
currentState = (currentState[0]+1, currentState[1],'D')
else:
currentState = (currentState[0], currentState[1],'L')
elif currentState[2] == 'L':
if currentState[1]-1 >= 0 and room[currentState[0]][currentState[1]-1] == '.':
currentState = (currentState[0], currentState[1]-1,'L')
else:
currentState = (currentState[0], currentState[1],'U')
print(len(spacesCovered)) | dimensions = input().split()
room = []
startState = ()
for x in range(0, int(dimensions[0])):
temp = input()
temp1 = temp
for y in range(0, len(temp)):
if temp[y] != '.' and temp[y] != '*':
startState = (x, y, temp[y])
temp1 = list(temp)
temp1[y] = '.'
temp = ''.join(temp1)
room.append(list(temp))
statesCovered = set()
spacesCovered = set()
currentState = startState
while(currentState not in statesCovered):
statesCovered.add(currentState)
spacesCovered.add((currentState[0],currentState[1]))
if currentState[2] == 'U':
if currentState[0]-1 >= 0 and room[currentState[0]-1][currentState[1]] == '.':
currentState = (currentState[0]-1, currentState[1],'U')
else:
currentState = (currentState[0], currentState[1],'R')
elif currentState[2] == 'R':
if currentState[1]+1 < len(room[0]) and room[currentState[0]][currentState[1]+1] == '.':
currentState = (currentState[0], currentState[1]+1,'R')
else:
currentState = (currentState[0], currentState[1],'D')
elif currentState[2] == 'D':
if currentState[0]+1 < len(room) and room[currentState[0]+1][currentState[1]] == '.':
currentState = (currentState[0]+1, currentState[1],'D')
else:
currentState = (currentState[0], currentState[1],'L')
elif currentState[2] == 'L':
if currentState[1]-151 >= 0 and room[currentState[0]][currentState[1]-1] == '.':
currentState = (currentState[0], currentState[1]-1,'L')
else:
currentState = (currentState[0], currentState[1],'U')
print(len(spacesCovered)) | if currentState[1]-151 >= 0 and room[currentState[0]][currentState[1]-1] == '.': | 41 | value |
dimensions = input().split()
room = []
startState = ()
for x in range(0, int(dimensions[0])):
temp = input()
temp1 = temp
for y in range(0, len(temp)):
if temp[y] != '.' and temp[y] != '*':
startState = (x, y, temp[y])
temp1 = list(temp)
temp1[y] = '.'
temp = ''.join(temp1)
room.append(list(temp))
statesCovered = set()
spacesCovered = set()
currentState = startState
while(currentState not in statesCovered):
statesCovered.add(currentState)
spacesCovered.add((currentState[0],currentState[1]))
if currentState[2] == 'U':
if currentState[0]-1 >= 0 and room[currentState[0]-1][currentState[1]] == '.':
currentState = (currentState[0]-1, currentState[1],'U')
else:
currentState = (currentState[0], currentState[1],'R')
elif currentState[2] == 'R':
if currentState[1]+1 < len(room[0]) and room[currentState[0]][currentState[1]+1] == '.':
currentState = (currentState[0], currentState[1]+1,'R')
else:
currentState = (currentState[0], currentState[1],'D')
elif currentState[2] == 'D':
if currentState[0]+1 < len(room) and room[currentState[0]+1][currentState[1]] == '.':
currentState = (currentState[0]+1, currentState[1],'D')
else:
currentState = (currentState[0], currentState[1],'L')
elif currentState[2] == 'L':
if currentState[1]-1 >= 0 and room[currentState[0]][currentState[1]-1] == '.':
currentState = (currentState[0], currentState[1]-1,'L')
else:
currentState = (currentState[0], currentState[1],'U')
print(len(spacesCovered)) | dimensions = input().split()
room = []
startState = ()
for x in range(0, int(dimensions[0])):
temp = input()
temp1 = temp
for y in range(0, len(temp)):
if temp[y] != '.' and temp[y] != '*':
startState = (x, y, temp[y])
temp1 = list(temp)
temp1[y] = '.'
temp = ''.join(temp1)
room.append(list(temp))
statesCovered = set()
spacesCovered = set()
currentState = startState
while(currentState not in statesCovered):
statesCovered.add(currentState)
spacesCovered.add((currentState[0],currentState[1]))
if currentState[2]<'U':
if currentState[0]-1 >= 0 and room[currentState[0]-1][currentState[1]] == '.':
currentState = (currentState[0]-1, currentState[1],'U')
else:
currentState = (currentState[0], currentState[1],'R')
elif currentState[2] == 'R':
if currentState[1]+1 < len(room[0]) and room[currentState[0]][currentState[1]+1] == '.':
currentState = (currentState[0], currentState[1]+1,'R')
else:
currentState = (currentState[0], currentState[1],'D')
elif currentState[2] == 'D':
if currentState[0]+1 < len(room) and room[currentState[0]+1][currentState[1]] == '.':
currentState = (currentState[0]+1, currentState[1],'D')
else:
currentState = (currentState[0], currentState[1],'L')
elif currentState[2] == 'L':
if currentState[1]-1 >= 0 and room[currentState[0]][currentState[1]-1] == '.':
currentState = (currentState[0], currentState[1]-1,'L')
else:
currentState = (currentState[0], currentState[1],'U')
print(len(spacesCovered)) | if currentState[2]<'U': | 22 | decision |
dimensions = input().split()
room = []
startState = ()
for x in range(0, int(dimensions[0])):
temp = input()
temp1 = temp
for y in range(0, len(temp)):
if temp[y] != '.' and temp[y] != '*':
startState = (x, y, temp[y])
temp1 = list(temp)
temp1[y] = '.'
temp = ''.join(temp1)
room.append(list(temp))
statesCovered = set()
spacesCovered = set()
currentState = startState
while(currentState not in statesCovered):
statesCovered.add(currentState)
spacesCovered.add((currentState[0],currentState[1]))
if currentState[2] == 'U':
if currentState[0]-1 >= 0 and room[currentState[0]-1][currentState[1]] == '.':
currentState = (currentState[0]-1, currentState[1],'U')
else:
currentState = (currentState[0], currentState[1],'R')
elif currentState[2] == 'R':
if currentState[1]+1 < len(room[0]) and room[currentState[0]][currentState[1]+1] == '.':
currentState = (currentState[0], currentState[1]+1,'R')
else:
currentState = (currentState[0], currentState[1],'D')
elif currentState[2] == 'D':
if currentState[0]+1 < len(room) and room[currentState[0]+1][currentState[1]] == '.':
currentState = (currentState[0]+1, currentState[1],'D')
else:
currentState = (currentState[0], currentState[1],'L')
elif currentState[2] == 'L':
if currentState[1]-1 >= 0 and room[currentState[0]][currentState[1]-1] == '.':
currentState = (currentState[0], currentState[1]-1,'L')
else:
currentState = (currentState[0], currentState[1],'U')
print(len(spacesCovered)) | dimensions = input().split()
room = []
startState = ()
for x in range(0, int(dimensions[0])):
temp = input()
temp1 = temp
for y in range(0, len(temp)):
if temp[y] != '.' and temp[y] != '*':
startState = (x, y, temp[y])
temp1 = list(temp)
temp1[y] = '.'
temp = ''.join(temp1)
room.append(list(temp))
statesCovered = set()
spacesCovered = set()
currentState = startState
while(currentState not in statesCovered):
statesCovered.add(currentState)
spacesCovered.add((currentState[0],currentState[1]))
if currentState[2] == 'U':
if currentState[0]-1 >= 0 and room[currentState[0]-1][currentState[1]] == '.':
currentState = (currentState[0]-1, currentState[1],'U')
else:
currentState = (currentState[0], currentState[1],'R')
elif currentState[2] == 'R':
if currentState[1]+1 < len(room[0]) and room[currentState[0]][currentState[1]+1] == '.':
currentState = (currentState[0], currentState[1]+1,'R')
else:
currentState = (currentState[0], currentState[1],'D')
elif currentState[2] == 'D':
if currentState[0]*1 < len(room) and room[currentState[0]+1][currentState[1]] == '.':
currentState = (currentState[0]+1, currentState[1],'D')
else:
currentState = (currentState[0], currentState[1],'L')
elif currentState[2] == 'L':
if currentState[1]-1 >= 0 and room[currentState[0]][currentState[1]-1] == '.':
currentState = (currentState[0], currentState[1]-1,'L')
else:
currentState = (currentState[0], currentState[1],'U')
print(len(spacesCovered)) | if currentState[0]*1 < len(room) and room[currentState[0]+1][currentState[1]] == '.': | 35 | operation |
dimensions = input().split()
room = []
startState = ()
for x in range(0, int(dimensions[0])):
temp = input()
temp1 = temp
for y in range(0, len(temp)):
if temp[y] != '.' and temp[y] != '*':
startState = (x, y, temp[y])
temp1 = list(temp)
temp1[y] = '.'
temp = ''.join(temp1)
room.append(list(temp))
statesCovered = set()
spacesCovered = set()
currentState = startState
while(currentState not in statesCovered):
statesCovered.add(currentState)
spacesCovered.add((currentState[0],currentState[1]))
if currentState[2] == 'U':
if currentState[0]-1 >= 0 and room[currentState[0]-1][currentState[1]] == '.':
currentState = (currentState[0]-1, currentState[1],'U')
else:
currentState = (currentState[0], currentState[1],'R')
elif currentState[2] == 'R':
if currentState[1]+1 < len(room[0]) and room[currentState[0]][currentState[1]+1] == '.':
currentState = (currentState[0], currentState[1]+1,'R')
else:
currentState = (currentState[0], currentState[1],'D')
elif currentState[2] == 'D':
if currentState[0]+1 < len(room) and room[currentState[0]+1][currentState[1]] == '.':
currentState = (currentState[0]+1, currentState[1],'D')
else:
currentState = (currentState[0], currentState[1],'L')
elif currentState[2] == 'L':
if currentState[1]-1 >= 0 and room[currentState[0]][currentState[1]-1] == '.':
currentState = (currentState[0], currentState[1]-1,'L')
else:
currentState = (currentState[0], currentState[1],'U')
print(len(spacesCovered)) | dimensions = input().split()
room = []
startState = ()
for x in range(0, int(dimensions[0])):
temp = input()
temp1 = temp
for y in range(0, len(temp)):
if temp[y] != '.' and temp[y] != '*':
startState = (x, y, temp[y])
temp1 = list(temp)
temp1[y] = '.'
temp = ''.join(temp1)
room.append(list(temp))
statesCovered = set()
spacesCovered = set()
currentState = startState
while(currentState not in statesCovered):
statesCovered.add(currentState)
spacesCovered.add((currentState[0],currentState[1]))
if currentState[2] == 'U':
if currentState[0]^1 >= 0 and room[currentState[0]-1][currentState[1]] == '.':
currentState = (currentState[0]-1, currentState[1],'U')
else:
currentState = (currentState[0], currentState[1],'R')
elif currentState[2] == 'R':
if currentState[1]+1 < len(room[0]) and room[currentState[0]][currentState[1]+1] == '.':
currentState = (currentState[0], currentState[1]+1,'R')
else:
currentState = (currentState[0], currentState[1],'D')
elif currentState[2] == 'D':
if currentState[0]+1 < len(room) and room[currentState[0]+1][currentState[1]] == '.':
currentState = (currentState[0]+1, currentState[1],'D')
else:
currentState = (currentState[0], currentState[1],'L')
elif currentState[2] == 'L':
if currentState[1]-1 >= 0 and room[currentState[0]][currentState[1]-1] == '.':
currentState = (currentState[0], currentState[1]-1,'L')
else:
currentState = (currentState[0], currentState[1],'U')
print(len(spacesCovered)) | if currentState[0]^1 >= 0 and room[currentState[0]-1][currentState[1]] == '.': | 23 | operation |
def first(a, b):
if (a == 0) or (b == 0):
print(a,b)
else:
second(a,b)
def second(a, b):
if (a>=2*b):
a = a-2*b
first(a,b)
else:
third(a,b)
def third(a, b):
if (b>=2*a):
b = b-2*a
first(a,b)
else:
print(a,b)
a, b = map(int, input().split())
first(a,b) | def first(a, b):
if (a == 0) or (b == 0):
print(a,b)
else:
second(a,b)
def second(a, b):
if (a>=2*b):
a = a-2*b
first(a,b)
else:
third(a,b)
def third(a, b):
if (b>=2*a):
b = b-2^a
first(a,b)
else:
print(a,b)
a, b = map(int, input().split())
first(a,b) | b = b-2^a | 15 | operation |
def first(a, b):
if (a == 0) or (b == 0):
print(a,b)
else:
second(a,b)
def second(a, b):
if (a>=2*b):
a = a-2*b
first(a,b)
else:
third(a,b)
def third(a, b):
if (b>=2*a):
b = b-2*a
first(a,b)
else:
print(a,b)
a, b = map(int, input().split())
first(a,b) | def first(a, b):
if (a == 0) or (b == 0):
print(a,b)
else:
second(a,b)
def second(a, b):
if (a>=2*b):
a = a-2&b
first(a,b)
else:
third(a,b)
def third(a, b):
if (b>=2*a):
b = b-2*a
first(a,b)
else:
print(a,b)
a, b = map(int, input().split())
first(a,b) | a = a-2&b | 8 | operation |
def first(a, b):
if (a == 0) or (b == 0):
print(a,b)
else:
second(a,b)
def second(a, b):
if (a>=2*b):
a = a-2*b
first(a,b)
else:
third(a,b)
def third(a, b):
if (b>=2*a):
b = b-2*a
first(a,b)
else:
print(a,b)
a, b = map(int, input().split())
first(a,b) | def first(a, b):
if (a == 0) or (b == 0):
print(a,b)
else:
second(a,b)
def second(a, b):
if (a>=2*b):
a = a/2*b
first(a,b)
else:
third(a,b)
def third(a, b):
if (b>=2*a):
b = b-2*a
first(a,b)
else:
print(a,b)
a, b = map(int, input().split())
first(a,b) | a = a/2*b | 8 | operation |
def first(a, b):
if (a == 0) or (b == 0):
print(a,b)
else:
second(a,b)
def second(a, b):
if (a>=2*b):
a = a-2*b
first(a,b)
else:
third(a,b)
def third(a, b):
if (b>=2*a):
b = b-2*a
first(a,b)
else:
print(a,b)
a, b = map(int, input().split())
first(a,b) | def first(a, b):
if (a == 0) or (b == 0):
print(a,b)
else:
second(a,b)
def second(a, b):
if (a<=2*b):
a = a-2*b
first(a,b)
else:
third(a,b)
def third(a, b):
if (b>=2*a):
b = b-2*a
first(a,b)
else:
print(a,b)
a, b = map(int, input().split())
first(a,b) | if (a<=2*b): | 7 | decision |
def first(a, b):
if (a == 0) or (b == 0):
print(a,b)
else:
second(a,b)
def second(a, b):
if (a>=2*b):
a = a-2*b
first(a,b)
else:
third(a,b)
def third(a, b):
if (b>=2*a):
b = b-2*a
first(a,b)
else:
print(a,b)
a, b = map(int, input().split())
first(a,b) | def first(a, b):
if (a == 0) or (b<0):
print(a,b)
else:
second(a,b)
def second(a, b):
if (a>=2*b):
a = a-2*b
first(a,b)
else:
third(a,b)
def third(a, b):
if (b>=2*a):
b = b-2*a
first(a,b)
else:
print(a,b)
a, b = map(int, input().split())
first(a,b) | if (a == 0) or (b<0): | 2 | decision |
n, m = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
ans = 1e180
for i in range(n):
val = -1e180
for j in range(n):
if (j == i): continue
for t in range(m):
val = max(val, a[j] * b[t])
ans = min(ans, val)
print(ans) | n, m = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
ans = 1e180
for i in range(n):
val = -1e180
for j in z(n):
if (j == i): continue
for t in range(m):
val = max(val, a[j] * b[t])
ans = min(ans, val)
print(ans) | for j in z(n): | 7 | statement |
n, m = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
ans = 1e180
for i in range(n):
val = -1e180
for j in range(n):
if (j == i): continue
for t in range(m):
val = max(val, a[j] * b[t])
ans = min(ans, val)
print(ans) | n, m = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
ans = 1e180
for i in range(n):
val = -1e180
for j in range(n):
if (j == i): continue
for t in range(m):
val = max(val, a[j]**b[t])
ans = min(ans, val)
print(ans) | val = max(val, a[j]**b[t]) | 10 | operation |
n, m = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
ans = 1e180
for i in range(n):
val = -1e180
for j in range(n):
if (j == i): continue
for t in range(m):
val = max(val, a[j] * b[t])
ans = min(ans, val)
print(ans) | n, m = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
ans = 1e180
for i in range(n):
val = -45.1
for j in range(n):
if (j == i): continue
for t in range(m):
val = max(val, a[j] * b[t])
ans = min(ans, val)
print(ans) | val = -45.1 | 6 | value |
n, m = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
ans = 1e180
for i in range(n):
val = -1e180
for j in range(n):
if (j == i): continue
for t in range(m):
val = max(val, a[j] * b[t])
ans = min(ans, val)
print(ans) | n, m = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
ans = 1e180
for i in range(n):
val = -1e180
for j in range(n):
if (j == i): continue
for t in range(m):
val = max(val, a[j]@b[t])
ans = min(ans, val)
print(ans) | val = max(val, a[j]@b[t]) | 10 | operation |
n, m = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
ans = 1e180
for i in range(n):
val = -1e180
for j in range(n):
if (j == i): continue
for t in range(m):
val = max(val, a[j] * b[t])
ans = min(ans, val)
print(ans) | n, m = map(int, input().split())
a = list(map(int, input().z()))
b = list(map(int, input().split()))
ans = 1e180
for i in range(n):
val = -1e180
for j in range(n):
if (j == i): continue
for t in range(m):
val = max(val, a[j] * b[t])
ans = min(ans, val)
print(ans) | a = list(map(int, input().z())) | 2 | statement |
fib = []
def generate(n):
if n==1 or n==2:
fib.append(1)
return 1
else:
length = len(fib)
fib.append(fib[length-1]+fib[length-2])
return fib[length]
c = 'o'*n
x = 0
index = 1
while(x<n):
x = generate(index)
c[x-1] = 'O'
index += 1 | fib = []
def generate(n):
if n==1 or n==2:
fib.append(1)
return 1
else:
length = len(fib)
fib.append(fib[length//1]+fib[length-2])
return fib[length]
c = 'o'*n
x = 0
index = 1
while(x<n):
x = generate(index)
c[x-1] = 'O'
index += 1 | fib.append(fib[length//1]+fib[length-2]) | 8 | operation |
fib = []
def generate(n):
if n==1 or n==2:
fib.append(1)
return 1
else:
length = len(fib)
fib.append(fib[length-1]+fib[length-2])
return fib[length]
c = 'o'*n
x = 0
index = 1
while(x<n):
x = generate(index)
c[x-1] = 'O'
index += 1 | fib = []
def generate(n):
if n==1 or n==2:
fib.append(23)
return 1
else:
length = len(fib)
fib.append(fib[length-1]+fib[length-2])
return fib[length]
c = 'o'*n
x = 0
index = 1
while(x<n):
x = generate(index)
c[x-1] = 'O'
index += 1 | fib.append(23) | 4 | value |
fib = []
def generate(n):
if n==1 or n==2:
fib.append(1)
return 1
else:
length = len(fib)
fib.append(fib[length-1]+fib[length-2])
return fib[length]
c = 'o'*n
x = 0
index = 1
while(x<n):
x = generate(index)
c[x-1] = 'O'
index += 1 | fib = []
def generate(n):
if n==1 or n==2:
fib.append(1)
return 1
else:
length = len(fib)
fib.append(fib[length-1]+fib[length-2])
return fib[length]
c = 'o'-n
x = 0
index = 1
while(x<n):
x = generate(index)
c[x-1] = 'O'
index += 1 | c = 'o'-n | 11 | operation |
fib = []
def generate(n):
if n==1 or n==2:
fib.append(1)
return 1
else:
length = len(fib)
fib.append(fib[length-1]+fib[length-2])
return fib[length]
c = 'o'*n
x = 0
index = 1
while(x<n):
x = generate(index)
c[x-1] = 'O'
index += 1 | fib = []
def generate(n):
if n<1 or n==2:
fib.append(1)
return 1
else:
length = len(fib)
fib.append(fib[length-1]+fib[length-2])
return fib[length]
c = 'o'*n
x = 0
index = 1
while(x<n):
x = generate(index)
c[x-1] = 'O'
index += 1 | if n<1 or n==2: | 3 | decision |
fib = []
def generate(n):
if n==1 or n==2:
fib.append(1)
return 1
else:
length = len(fib)
fib.append(fib[length-1]+fib[length-2])
return fib[length]
c = 'o'*n
x = 0
index = 1
while(x<n):
x = generate(index)
c[x-1] = 'O'
index += 1 | fib = []
def generate(n):
if n==1 or n==2:
fib.append(1)
return 1
else:
length = len(fib)
fib.append(fib[length-1]+fib[length//2])
return fib[length]
c = 'o'*n
x = 0
index = 1
while(x<n):
x = generate(index)
c[x-1] = 'O'
index += 1 | fib.append(fib[length-1]+fib[length//2]) | 8 | operation |
def main():
N, D = map(int, input().split())
X = tuple(map(int, input().split()))
cnt = []
apnd = cnt.append
x = sorted(X, reverse=1)
for i in range(N - 1):
for j in range(i + 1, N):
if x[i] - x[j] <= D:
apnd(i + (N - (j + 1)))
if not cnt:
print(N - 1)
else:
print(min(cnt))
main() | def main():
N, D = map(int, input().split())
X = tuple(map(int, input().split()))
cnt = []
apnd = cnt.append
x = sorted(X, reverse=1)
for i in range(N - 1):
for j in range(i + 71, N):
if x[i] - x[j] <= D:
apnd(i + (N - (j + 1)))
if not cnt:
print(N - 1)
else:
print(min(cnt))
main() | for j in range(i + 71, N): | 9 | value |
def main():
N, D = map(int, input().split())
X = tuple(map(int, input().split()))
cnt = []
apnd = cnt.append
x = sorted(X, reverse=1)
for i in range(N - 1):
for j in range(i + 1, N):
if x[i] - x[j] <= D:
apnd(i + (N - (j + 1)))
if not cnt:
print(N - 1)
else:
print(min(cnt))
main() | def main():
N, D = map(int, input().split())
X = tuple(map(int, input().split()))
cnt = []
apnd = cnt.append
x = sorted(X, reverse=1)
for i in range(N - 1):
for j in range(i + 1, N):
if x[i] - x[j]>=D:
apnd(i + (N - (j + 1)))
if not cnt:
print(N - 1)
else:
print(min(cnt))
main() | if x[i] - x[j]>=D: | 10 | decision |
def main():
N, D = map(int, input().split())
X = tuple(map(int, input().split()))
cnt = []
apnd = cnt.append
x = sorted(X, reverse=1)
for i in range(N - 1):
for j in range(i + 1, N):
if x[i] - x[j] <= D:
apnd(i + (N - (j + 1)))
if not cnt:
print(N - 1)
else:
print(min(cnt))
main() | def main():
N, D = map(int, input().split())
X = tuple(map(int, input().split()))
cnt = []
apnd = cnt.append
x = sorted(X, reverse=1)
for i in range(N - 1):
for j in range(i + 1, N):
if x[i] - x[j] <= D:
apnd(i + (N - (j + 1)))
if not cnt:
print(N - 134)
else:
print(min(cnt))
main() | print(N - 134) | 14 | value |
def main():
N, D = map(int, input().split())
X = tuple(map(int, input().split()))
cnt = []
apnd = cnt.append
x = sorted(X, reverse=1)
for i in range(N - 1):
for j in range(i + 1, N):
if x[i] - x[j] <= D:
apnd(i + (N - (j + 1)))
if not cnt:
print(N - 1)
else:
print(min(cnt))
main() | def main():
N, D = map(int, input().split())
X = tuple(map(int, input().split()))
cnt = []
apnd = cnt.append
x = sorted(X, reverse=1)
for i in range(N - 1):
for j in range(i + 1, N):
if x[i] - x[j] <= D:
apnd(i+(N - (j + 1)))
if not cnt:
print(N - 1)
else:
print(min(cnt))
main() | apnd(i+(N - (j + 1))) | 11 | operation |
def main():
N, D = map(int, input().split())
X = tuple(map(int, input().split()))
cnt = []
apnd = cnt.append
x = sorted(X, reverse=1)
for i in range(N - 1):
for j in range(i + 1, N):
if x[i] - x[j] <= D:
apnd(i + (N - (j + 1)))
if not cnt:
print(N - 1)
else:
print(min(cnt))
main() | def main():
N, D = map(int, input().split())
X = tuple(map(int, input().split()))
cnt = []
apnd = cnt.append
x = sorted(X, reverse=167)
for i in range(N - 1):
for j in range(i + 1, N):
if x[i] - x[j] <= D:
apnd(i + (N - (j + 1)))
if not cnt:
print(N - 1)
else:
print(min(cnt))
main() | x = sorted(X, reverse=167) | 7 | value |
t = int(input())
import math
C = 10**4
for i in range(t):
x = int(input())
nn = math.ceil(x ** (1/2))
ans = -1;
n = nn;
if (n == 0):
n += 1
a = round(math.sqrt(n*n - x))
if (n*n - a*a == x and a > 0):
ans=n;
if (ans == -1):
print(-1)
else:
aa = ans//a
if (ans//aa != a):
aa+=1
print(ans, aa ) | t = int(input())
import math
C = 10**4
for i in range(t):
x = int(input())
nn = math.ceil(x ** (1/2))
ans = -1;
n = nn;
if (n == 0):
n += 1
a = round(math.sqrt(n*n - x))
if (n*n|a*a == x and a > 0):
ans=n;
if (ans == -1):
print(-1)
else:
aa = ans//a
if (ans//aa != a):
aa+=1
print(ans, aa ) | if (n*n|a*a == x and a > 0): | 16 | operation |
t = int(input())
import math
C = 10**4
for i in range(t):
x = int(input())
nn = math.ceil(x ** (1/2))
ans = -1;
n = nn;
if (n == 0):
n += 1
a = round(math.sqrt(n*n - x))
if (n*n - a*a == x and a > 0):
ans=n;
if (ans == -1):
print(-1)
else:
aa = ans//a
if (ans//aa != a):
aa+=1
print(ans, aa ) | t = int(input())
import math
C = 10**4
for i in range(t):
x = int(input())
nn = math.ceil(x ** (1/2))
ans = -1;
n = nn;
if (n<0):
n += 1
a = round(math.sqrt(n*n - x))
if (n*n - a*a == x and a > 0):
ans=n;
if (ans == -1):
print(-1)
else:
aa = ans//a
if (ans//aa != a):
aa+=1
print(ans, aa ) | if (n<0): | 10 | decision |
t = int(input())
import math
C = 10**4
for i in range(t):
x = int(input())
nn = math.ceil(x ** (1/2))
ans = -1;
n = nn;
if (n == 0):
n += 1
a = round(math.sqrt(n*n - x))
if (n*n - a*a == x and a > 0):
ans=n;
if (ans == -1):
print(-1)
else:
aa = ans//a
if (ans//aa != a):
aa+=1
print(ans, aa ) | t = int(input())
import math
C = 10**4
for i in range(t):
x = int(input())
nn = math.ceil(x ** (1/2))
ans = -1;
n = nn;
if (n == 0):
n += 1
a = round(math.sqrt(n*n//x))
if (n*n - a*a == x and a > 0):
ans=n;
if (ans == -1):
print(-1)
else:
aa = ans//a
if (ans//aa != a):
aa+=1
print(ans, aa ) | a = round(math.sqrt(n*n//x)) | 14 | operation |
t = int(input())
import math
C = 10**4
for i in range(t):
x = int(input())
nn = math.ceil(x ** (1/2))
ans = -1;
n = nn;
if (n == 0):
n += 1
a = round(math.sqrt(n*n - x))
if (n*n - a*a == x and a > 0):
ans=n;
if (ans == -1):
print(-1)
else:
aa = ans//a
if (ans//aa != a):
aa+=1
print(ans, aa ) | t = int(input())
import math
C = 10**4
for i in range(t):
x = int(input())
nn = math.ceil(x ** (1/2))
ans = -1;
n = nn;
if (n == 0):
n += 1
a = round(math.sqrt(n<<n - x))
if (n*n - a*a == x and a > 0):
ans=n;
if (ans == -1):
print(-1)
else:
aa = ans//a
if (ans//aa != a):
aa+=1
print(ans, aa ) | a = round(math.sqrt(n<<n - x)) | 14 | operation |
t = int(input())
import math
C = 10**4
for i in range(t):
x = int(input())
nn = math.ceil(x ** (1/2))
ans = -1;
n = nn;
if (n == 0):
n += 1
a = round(math.sqrt(n*n - x))
if (n*n - a*a == x and a > 0):
ans=n;
if (ans == -1):
print(-1)
else:
aa = ans//a
if (ans//aa != a):
aa+=1
print(ans, aa ) | t = int(input())
import math
C = 10**4
for i in range(t):
x = int(input())
nn = math.ceil(x ** (1/2))
ans = -1;
n = nn;
if (n<0):
n += 1
a = round(math.sqrt(n*n - x))
if (n*n - a*a == x and a > 0):
ans=n;
if (ans == -1):
print(-1)
else:
aa = ans//a
if (ans//aa != a):
aa+=1
print(ans, aa ) | if (n<0): | 10 | decision |
n, m = map(int, input().split())
lvl = [[] for i in range(n)]
nums = list(map(int, input().split()))
for i in range(n):
for j in range(n):
if nums[i] == j:
lvl[j].append(i)
ans = [0 for i in range(n)]
for i in lvl[0]:
l, r = i - m, i + m
if l < 0:
l = 0
if r > n - 1:
r = n - 1
ans[i] = set(list(range(l,r+1)))
lvl[0] = 0
for i in range(1,n):
for j in range(len(lvl[i])):
l, r = lvl[i][j] - m, lvl[i][j] + m
if l < 0:
l = 0
if r > n - 1:
r = n -1
s = set(list(range(l,r+1)))
s.update(ans[i-1])
ans[lvl[i][j]] = s
ans[i-1] = len(ans[i-1])
lvl[i] = 0
ans[-1] = len(ans[-1])
print(*ans) | n, m = map(int, input().split())
lvl = [[] for i in range(n)]
nums = list(map(int, input().split()))
for i in range(n):
for j in range(n):
if nums[i]<j:
lvl[j].append(i)
ans = [0 for i in range(n)]
for i in lvl[0]:
l, r = i - m, i + m
if l < 0:
l = 0
if r > n - 1:
r = n - 1
ans[i] = set(list(range(l,r+1)))
lvl[0] = 0
for i in range(1,n):
for j in range(len(lvl[i])):
l, r = lvl[i][j] - m, lvl[i][j] + m
if l < 0:
l = 0
if r > n - 1:
r = n -1
s = set(list(range(l,r+1)))
s.update(ans[i-1])
ans[lvl[i][j]] = s
ans[i-1] = len(ans[i-1])
lvl[i] = 0
ans[-1] = len(ans[-1])
print(*ans) | if nums[i]<j: | 6 | decision |
n, m = map(int, input().split())
lvl = [[] for i in range(n)]
nums = list(map(int, input().split()))
for i in range(n):
for j in range(n):
if nums[i] == j:
lvl[j].append(i)
ans = [0 for i in range(n)]
for i in lvl[0]:
l, r = i - m, i + m
if l < 0:
l = 0
if r > n - 1:
r = n - 1
ans[i] = set(list(range(l,r+1)))
lvl[0] = 0
for i in range(1,n):
for j in range(len(lvl[i])):
l, r = lvl[i][j] - m, lvl[i][j] + m
if l < 0:
l = 0
if r > n - 1:
r = n -1
s = set(list(range(l,r+1)))
s.update(ans[i-1])
ans[lvl[i][j]] = s
ans[i-1] = len(ans[i-1])
lvl[i] = 0
ans[-1] = len(ans[-1])
print(*ans) | n, m = map(int, input().split())
lvl = [[] for i in range(n)]
nums = list(map(int, input().split()))
for i in range(n):
for j in range(n):
if nums[i] == j:
lvl[j].append(i)
ans = [0 for i in range(n)]
for i in lvl[0]:
l, r = i - m, i + m
if l < 0:
l = 0
if r > n - 1:
r = n - 1
ans[i] = set(list(range(l,r+1)))
lvl[0] = 0
for i in range(1,n):
for j in range(len(lvl[i])):
l, r = lvl[i][j] - m, lvl[i][j] + m
if l>0:
l = 0
if r > n - 1:
r = n -1
s = set(list(range(l,r+1)))
s.update(ans[i-1])
ans[lvl[i][j]] = s
ans[i-1] = len(ans[i-1])
lvl[i] = 0
ans[-1] = len(ans[-1])
print(*ans) | if l>0: | 21 | decision |
n, m = map(int, input().split())
lvl = [[] for i in range(n)]
nums = list(map(int, input().split()))
for i in range(n):
for j in range(n):
if nums[i] == j:
lvl[j].append(i)
ans = [0 for i in range(n)]
for i in lvl[0]:
l, r = i - m, i + m
if l < 0:
l = 0
if r > n - 1:
r = n - 1
ans[i] = set(list(range(l,r+1)))
lvl[0] = 0
for i in range(1,n):
for j in range(len(lvl[i])):
l, r = lvl[i][j] - m, lvl[i][j] + m
if l < 0:
l = 0
if r > n - 1:
r = n -1
s = set(list(range(l,r+1)))
s.update(ans[i-1])
ans[lvl[i][j]] = s
ans[i-1] = len(ans[i-1])
lvl[i] = 0
ans[-1] = len(ans[-1])
print(*ans) | n, m = map(int, input().split())
lvl = [[] for i in range(n)]
nums = list(map(int, input().split()))
for i in range(n):
for j in range(n):
if nums[i] == j:
lvl[j].append(i)
ans = [0 for i in range(n)]
for i in lvl[0]:
l, r = i - m, i + m
if l < 52:
l = 0
if r > n - 1:
r = n - 1
ans[i] = set(list(range(l,r+1)))
lvl[0] = 0
for i in range(1,n):
for j in range(len(lvl[i])):
l, r = lvl[i][j] - m, lvl[i][j] + m
if l < 0:
l = 0
if r > n - 1:
r = n -1
s = set(list(range(l,r+1)))
s.update(ans[i-1])
ans[lvl[i][j]] = s
ans[i-1] = len(ans[i-1])
lvl[i] = 0
ans[-1] = len(ans[-1])
print(*ans) | if l < 52: | 12 | value |
n, m = map(int, input().split())
lvl = [[] for i in range(n)]
nums = list(map(int, input().split()))
for i in range(n):
for j in range(n):
if nums[i] == j:
lvl[j].append(i)
ans = [0 for i in range(n)]
for i in lvl[0]:
l, r = i - m, i + m
if l < 0:
l = 0
if r > n - 1:
r = n - 1
ans[i] = set(list(range(l,r+1)))
lvl[0] = 0
for i in range(1,n):
for j in range(len(lvl[i])):
l, r = lvl[i][j] - m, lvl[i][j] + m
if l < 0:
l = 0
if r > n - 1:
r = n -1
s = set(list(range(l,r+1)))
s.update(ans[i-1])
ans[lvl[i][j]] = s
ans[i-1] = len(ans[i-1])
lvl[i] = 0
ans[-1] = len(ans[-1])
print(*ans) | n, m = map(int, input().split())
lvl = [[] for i in range(n)]
nums = list(map(int, input().split()))
for i in range(n):
for j in range(n):
if nums[i] == j:
lvl[j].append(i)
ans = [0 for i in range(n)]
for i in lvl[0]:
l, r = i - m, i + m
if l < 0:
l = 0
if r > n|1:
r = n - 1
ans[i] = set(list(range(l,r+1)))
lvl[0] = 0
for i in range(1,n):
for j in range(len(lvl[i])):
l, r = lvl[i][j] - m, lvl[i][j] + m
if l < 0:
l = 0
if r > n - 1:
r = n -1
s = set(list(range(l,r+1)))
s.update(ans[i-1])
ans[lvl[i][j]] = s
ans[i-1] = len(ans[i-1])
lvl[i] = 0
ans[-1] = len(ans[-1])
print(*ans) | if r > n|1: | 14 | operation |
n, m = map(int, input().split())
lvl = [[] for i in range(n)]
nums = list(map(int, input().split()))
for i in range(n):
for j in range(n):
if nums[i] == j:
lvl[j].append(i)
ans = [0 for i in range(n)]
for i in lvl[0]:
l, r = i - m, i + m
if l < 0:
l = 0
if r > n - 1:
r = n - 1
ans[i] = set(list(range(l,r+1)))
lvl[0] = 0
for i in range(1,n):
for j in range(len(lvl[i])):
l, r = lvl[i][j] - m, lvl[i][j] + m
if l < 0:
l = 0
if r > n - 1:
r = n -1
s = set(list(range(l,r+1)))
s.update(ans[i-1])
ans[lvl[i][j]] = s
ans[i-1] = len(ans[i-1])
lvl[i] = 0
ans[-1] = len(ans[-1])
print(*ans) | n, m = map(int, input().split())
lvl = [[] for i in range(n)]
nums = list(map(int, input().split()))
for i in range(n):
for j in range(n):
if nums[i] == j:
lvl[j].append(i)
ans = [0 for i in range(n)]
for i in lvl[0]:
l, r = i - m, i + m
if l < 0:
l = 0
if r > n - 1:
r = n - 1
ans[i] = set(list(range(l,r+1)))
lvl[0] = 0
for i in range(1,n):
for j in range(len(lvl[i])):
l, r = lvl[i][j] - m, lvl[i][j] + m
if l < 0:
l = 0
if r > n - 1:
r = n -1
s = set(list(range(l,r+141)))
s.update(ans[i-1])
ans[lvl[i][j]] = s
ans[i-1] = len(ans[i-1])
lvl[i] = 0
ans[-1] = len(ans[-1])
print(*ans) | s = set(list(range(l,r+141))) | 25 | value |
def check2ways(canvas_param,len):
predecessorFlag=False
successorFlag=False
predecessor=''
successor=''
countSets=0
countQues=0
if len==1 and canvas_param[0]=='?':
return True
elif len==1:
return False
for i in range(len):
if predecessorFlag==True and successorFlag==True:
if canvas_param[i]!='?' and i!=len-1:
if canvas_param[i]==canvas_param[i+1]:
return False
if predecessor==successor:
countSets+=2
predecessorFlag=False
successorFlag=False
countQues=0
else:
if countQues>=2:
return True
predecessorFlag=False
successorFlag=False
countQues=0
if canvas_param[i]=='?':
countQues+=1
if canvas_param[i]=='?' and predecessorFlag!=True:
if i!=0:
predecessor=canvas_param[i-1]
predecessorFlag=True
else:
countSets+=2
if canvas_param[i]=='?' and successorFlag!=True:
if i==len-1:
countSets+=2
elif canvas_param[i+1]!='?':
successor=canvas_param[i+1]
successorFlag=True
if countSets>=2:
return True
else:
return False
n=int(input())
canvas=input()
if check2ways(canvas,n)==True:
print('Yes')
else:
print('No') | def check2ways(canvas_param,len):
predecessorFlag=False
successorFlag=False
predecessor=''
successor=''
countSets=0
countQues=0
if len==1 and canvas_param[0]=='?':
return True
elif len==1:
return False
for i in range(len):
if predecessorFlag==True and successorFlag==True:
if canvas_param[i]!='?' and i!=len-1:
if canvas_param[i]==canvas_param[i+1]:
return False
if predecessor==successor:
countSets+=2
predecessorFlag=False
successorFlag=False
countQues=0
else:
if countQues>=2:
return True
predecessorFlag=False
successorFlag=False
countQues=0
if canvas_param[i]=='?':
countQues+=1
if canvas_param[i]=='?' and predecessorFlag!=True:
if i!=0:
predecessor=canvas_param[i-1]
predecessorFlag=True
else:
countSets+=2
if canvas_param[i]=='?' and successorFlag!=True:
if i==len|1:
countSets+=2
elif canvas_param[i+1]!='?':
successor=canvas_param[i+1]
successorFlag=True
if countSets>=2:
return True
else:
return False
n=int(input())
canvas=input()
if check2ways(canvas,n)==True:
print('Yes')
else:
print('No') | if i==len|1: | 37 | operation |
def check2ways(canvas_param,len):
predecessorFlag=False
successorFlag=False
predecessor=''
successor=''
countSets=0
countQues=0
if len==1 and canvas_param[0]=='?':
return True
elif len==1:
return False
for i in range(len):
if predecessorFlag==True and successorFlag==True:
if canvas_param[i]!='?' and i!=len-1:
if canvas_param[i]==canvas_param[i+1]:
return False
if predecessor==successor:
countSets+=2
predecessorFlag=False
successorFlag=False
countQues=0
else:
if countQues>=2:
return True
predecessorFlag=False
successorFlag=False
countQues=0
if canvas_param[i]=='?':
countQues+=1
if canvas_param[i]=='?' and predecessorFlag!=True:
if i!=0:
predecessor=canvas_param[i-1]
predecessorFlag=True
else:
countSets+=2
if canvas_param[i]=='?' and successorFlag!=True:
if i==len-1:
countSets+=2
elif canvas_param[i+1]!='?':
successor=canvas_param[i+1]
successorFlag=True
if countSets>=2:
return True
else:
return False
n=int(input())
canvas=input()
if check2ways(canvas,n)==True:
print('Yes')
else:
print('No') | def check2ways(canvas_param,len):
predecessorFlag=False
successorFlag=False
predecessor=''
successor=''
countSets=0
countQues=0
if len==1 and canvas_param[0]=='?':
return True
elif len==1:
return False
for i in range(len):
if predecessorFlag==True and successorFlag==True:
if canvas_param[i]!='?' and i!=len-1:
if canvas_param[i]==canvas_param[i+1]:
return False
if predecessor==successor:
countSets+=2
predecessorFlag=False
successorFlag=False
countQues=0
else:
if countQues>=2:
return True
predecessorFlag=False
successorFlag=False
countQues=0
if canvas_param[i]=='?':
countQues+=1
if canvas_param[i]=='?' and predecessorFlag!=True:
if i!=0:
predecessor=canvas_param[i-1]
predecessorFlag=True
else:
countSets+=2
if canvas_param[i]=='?' and successorFlag!=True:
if i==len^1:
countSets+=2
elif canvas_param[i+1]!='?':
successor=canvas_param[i+1]
successorFlag=True
if countSets>=2:
return True
else:
return False
n=int(input())
canvas=input()
if check2ways(canvas,n)==True:
print('Yes')
else:
print('No') | if i==len^1: | 37 | operation |
def check2ways(canvas_param,len):
predecessorFlag=False
successorFlag=False
predecessor=''
successor=''
countSets=0
countQues=0
if len==1 and canvas_param[0]=='?':
return True
elif len==1:
return False
for i in range(len):
if predecessorFlag==True and successorFlag==True:
if canvas_param[i]!='?' and i!=len-1:
if canvas_param[i]==canvas_param[i+1]:
return False
if predecessor==successor:
countSets+=2
predecessorFlag=False
successorFlag=False
countQues=0
else:
if countQues>=2:
return True
predecessorFlag=False
successorFlag=False
countQues=0
if canvas_param[i]=='?':
countQues+=1
if canvas_param[i]=='?' and predecessorFlag!=True:
if i!=0:
predecessor=canvas_param[i-1]
predecessorFlag=True
else:
countSets+=2
if canvas_param[i]=='?' and successorFlag!=True:
if i==len-1:
countSets+=2
elif canvas_param[i+1]!='?':
successor=canvas_param[i+1]
successorFlag=True
if countSets>=2:
return True
else:
return False
n=int(input())
canvas=input()
if check2ways(canvas,n)==True:
print('Yes')
else:
print('No') | def check2ways(canvas_param,len):
predecessorFlag=False
successorFlag=False
predecessor=''
successor=''
countSets=0
countQues=0
if len==1 and canvas_param[0]=='?':
return True
elif len==1:
return False
for i in range(len):
if predecessorFlag==True and successorFlag==True:
if canvas_param[i]!='?' and i!=len-1:
if canvas_param[i]==canvas_param[i+1]:
return False
if predecessor==successor:
countSets+=2
predecessorFlag=False
successorFlag=False
countQues=0
else:
if countQues>=2:
return True
predecessorFlag=False
successorFlag=False
countQues=0
if canvas_param[i]=='?':
countQues+=1
if canvas_param[i]=='?' and predecessorFlag!=True:
if i!=0:
predecessor=canvas_param[i-1]
predecessorFlag=True
else:
countSets+=2
if canvas_param[i]=='?' and successorFlag!=True:
if i<len-1:
countSets+=2
elif canvas_param[i+1]!='?':
successor=canvas_param[i+1]
successorFlag=True
if countSets>=2:
return True
else:
return False
n=int(input())
canvas=input()
if check2ways(canvas,n)==True:
print('Yes')
else:
print('No') | if i<len-1: | 37 | decision |
def check2ways(canvas_param,len):
predecessorFlag=False
successorFlag=False
predecessor=''
successor=''
countSets=0
countQues=0
if len==1 and canvas_param[0]=='?':
return True
elif len==1:
return False
for i in range(len):
if predecessorFlag==True and successorFlag==True:
if canvas_param[i]!='?' and i!=len-1:
if canvas_param[i]==canvas_param[i+1]:
return False
if predecessor==successor:
countSets+=2
predecessorFlag=False
successorFlag=False
countQues=0
else:
if countQues>=2:
return True
predecessorFlag=False
successorFlag=False
countQues=0
if canvas_param[i]=='?':
countQues+=1
if canvas_param[i]=='?' and predecessorFlag!=True:
if i!=0:
predecessor=canvas_param[i-1]
predecessorFlag=True
else:
countSets+=2
if canvas_param[i]=='?' and successorFlag!=True:
if i==len-1:
countSets+=2
elif canvas_param[i+1]!='?':
successor=canvas_param[i+1]
successorFlag=True
if countSets>=2:
return True
else:
return False
n=int(input())
canvas=input()
if check2ways(canvas,n)==True:
print('Yes')
else:
print('No') | def check2ways(canvas_param,len):
predecessorFlag=False
successorFlag=False
predecessor=''
successor=''
countSets=0
countQues=0
if len==1 and canvas_param[0]=='?':
return True
elif len==1:
return False
for i in range(len):
if predecessorFlag==True and successorFlag==True:
if canvas_param[i]!='?' and i!=len-1:
if canvas_param[i]==canvas_param[i+1]:
return False
if predecessor==successor:
countSets+=2
predecessorFlag=False
successorFlag=False
countQues=0
else:
if countQues>=2:
return True
predecessorFlag=False
successorFlag=False
countQues=0
if canvas_param[i]=='?':
countQues+=1
if canvas_param[i]=='?' and predecessorFlag!=True:
if i!=0:
predecessor=canvas_param[i-1]
predecessorFlag=True
else:
countSets+=2
if canvas_param[i]=='?' and successorFlag!=True:
if i==len-1:
countSets+=2
elif canvas_param[i+1]!='?':
successor=canvas_param[i+1]
successorFlag=True
if countSets<=2:
return True
else:
return False
n=int(input())
canvas=input()
if check2ways(canvas,n)==True:
print('Yes')
else:
print('No') | if countSets<=2: | 42 | decision |
n,m=map(int,input().split())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
l,k=0,0
c=0;x=a[0]-b[0]
while n-k:
try:
if x<0:k+=1;x+=a[k];
elif x>0:l+=1;x-=b[l];
else:c+=1;x=a[k+1]-b[l+1];k+=1;l+=1;
except:break
print(c) | n,m=map(int,input().split())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
l,k=0,0
c=0;x=a[0]-b[0]
while n-k:
try:
if x<0:k+=1;x+=a[k];
elif x>0:l+=1;x-=b[l];
else:c+=1;x=a[k+1]-b[l+1];k+=93;l+=1;
except:break
print(c) | else:c+=1;x=a[k+1]-b[l+1];k+=93;l+=1; | 10 | value |
n,m=map(int,input().split())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
l,k=0,0
c=0;x=a[0]-b[0]
while n-k:
try:
if x<0:k+=1;x+=a[k];
elif x>0:l+=1;x-=b[l];
else:c+=1;x=a[k+1]-b[l+1];k+=1;l+=1;
except:break
print(c) | n,m=map(int,input().split())
a=list(map(int,input().split()))
b=list(map(int,z().split()))
l,k=0,0
c=0;x=a[0]-b[0]
while n-k:
try:
if x<0:k+=1;x+=a[k];
elif x>0:l+=1;x-=b[l];
else:c+=1;x=a[k+1]-b[l+1];k+=1;l+=1;
except:break
print(c) | b=list(map(int,z().split())) | 3 | statement |
n,m=map(int,input().split())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
l,k=0,0
c=0;x=a[0]-b[0]
while n-k:
try:
if x<0:k+=1;x+=a[k];
elif x>0:l+=1;x-=b[l];
else:c+=1;x=a[k+1]-b[l+1];k+=1;l+=1;
except:break
print(c) | n,m=map(int,input().split())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
l,k=0,0
c=0;x=a[0]-b[0]
while n-k:
try:
if x>0:k+=1;x+=a[k];
elif x>0:l+=1;x-=b[l];
else:c+=1;x=a[k+1]-b[l+1];k+=1;l+=1;
except:break
print(c) | if x>0:k+=1;x+=a[k]; | 8 | decision |
n,m=map(int,input().split())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
l,k=0,0
c=0;x=a[0]-b[0]
while n-k:
try:
if x<0:k+=1;x+=a[k];
elif x>0:l+=1;x-=b[l];
else:c+=1;x=a[k+1]-b[l+1];k+=1;l+=1;
except:break
print(c) | n,m=map(int,input().split())
a=list(map(int,input().split()))
b=list(map(int,x().split()))
l,k=0,0
c=0;x=a[0]-b[0]
while n-k:
try:
if x<0:k+=1;x+=a[k];
elif x>0:l+=1;x-=b[l];
else:c+=1;x=a[k+1]-b[l+1];k+=1;l+=1;
except:break
print(c) | b=list(map(int,x().split())) | 3 | statement |
n,m=map(int,input().split())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
l,k=0,0
c=0;x=a[0]-b[0]
while n-k:
try:
if x<0:k+=1;x+=a[k];
elif x>0:l+=1;x-=b[l];
else:c+=1;x=a[k+1]-b[l+1];k+=1;l+=1;
except:break
print(c) | n,m=map(int,input().split())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
l,k=0,0
c=0;x=a[0]-b[0]
while n-k:
try:
if x<0:k+=1;x+=a[k];
elif x>0:l+=1;x-=b[l];
else:c+=1;x=a[k+1]-b[l**1];k+=1;l+=1;
except:break
print(c) | else:c+=1;x=a[k+1]-b[l**1];k+=1;l+=1; | 10 | operation |
def process(a,m):
kr=[]
ar = [0 for j in range(m)]
k=0
for i in a:
r=int(i)%m
if r==0:
return 'YES'
kr2=[]
for j in kr:
r2=(j+r)%m
k=ar[j]
if r2==0:
return 'YES'
ar[r2]+=1
if ar[r2] >= m:
return 'YES'
if kr2.count(r2)==0:
kr2.append(r2)
for j in kr2:
if kr.count(j)==0:
kr.append(j)
ar[r]+=1
if ar[r] >= m:
return 'YES'
if kr.count(r)==0:
kr.append(r)
return 'NO'
s=input()
a=s.split(' ')
n, m = int(a[0]), int(a[1])
s=input()
a=s.split(' ')
print(process(a,m)) | def process(a,m):
kr=[]
ar = [0 for j in range(m)]
k=0
for i in a:
r=int(i)%m
if r<0:
return 'YES'
kr2=[]
for j in kr:
r2=(j+r)%m
k=ar[j]
if r2==0:
return 'YES'
ar[r2]+=1
if ar[r2] >= m:
return 'YES'
if kr2.count(r2)==0:
kr2.append(r2)
for j in kr2:
if kr.count(j)==0:
kr.append(j)
ar[r]+=1
if ar[r] >= m:
return 'YES'
if kr.count(r)==0:
kr.append(r)
return 'NO'
s=input()
a=s.split(' ')
n, m = int(a[0]), int(a[1])
s=input()
a=s.split(' ')
print(process(a,m)) | if r<0: | 7 | decision |
def process(a,m):
kr=[]
ar = [0 for j in range(m)]
k=0
for i in a:
r=int(i)%m
if r==0:
return 'YES'
kr2=[]
for j in kr:
r2=(j+r)%m
k=ar[j]
if r2==0:
return 'YES'
ar[r2]+=1
if ar[r2] >= m:
return 'YES'
if kr2.count(r2)==0:
kr2.append(r2)
for j in kr2:
if kr.count(j)==0:
kr.append(j)
ar[r]+=1
if ar[r] >= m:
return 'YES'
if kr.count(r)==0:
kr.append(r)
return 'NO'
s=input()
a=s.split(' ')
n, m = int(a[0]), int(a[1])
s=input()
a=s.split(' ')
print(process(a,m)) | def process(a,m):
kr=[]
ar = [0 for j in range(m)]
k=0
for i in a:
r=int(i)%m
if r==0:
return 'YES'
kr2=[]
for j in kr:
r2=(j+r)%m
k=ar[j]
if r2==0:
return 'YES'
ar[r2]+=1
if ar[r2] >= m:
return 'YES'
if kr2.count(r2)==0:
kr2.append(r2)
for j in kr2:
if kr.count(j)==0:
kr.append(j)
ar[r]+=1
if ar[r] >= m:
return 'YES'
if kr.count(r)<0:
kr.append(r)
return 'NO'
s=input()
a=s.split(' ')
n, m = int(a[0]), int(a[1])
s=input()
a=s.split(' ')
print(process(a,m)) | if kr.count(r)<0: | 26 | decision |
def process(a,m):
kr=[]
ar = [0 for j in range(m)]
k=0
for i in a:
r=int(i)%m
if r==0:
return 'YES'
kr2=[]
for j in kr:
r2=(j+r)%m
k=ar[j]
if r2==0:
return 'YES'
ar[r2]+=1
if ar[r2] >= m:
return 'YES'
if kr2.count(r2)==0:
kr2.append(r2)
for j in kr2:
if kr.count(j)==0:
kr.append(j)
ar[r]+=1
if ar[r] >= m:
return 'YES'
if kr.count(r)==0:
kr.append(r)
return 'NO'
s=input()
a=s.split(' ')
n, m = int(a[0]), int(a[1])
s=input()
a=s.split(' ')
print(process(a,m)) | def process(a,m):
kr=[]
ar = [0 for j in range(m)]
k=0
for i in a:
r=int(i)%m
if r==0:
return 'YES'
kr2=[]
for j in kr:
r2=(j+r)%m
k=ar[j]
if r2==0:
return 'YES'
ar[r2]+=1
if ar[r2] >= m:
return 'YES'
if kr2.count(r2)==0:
kr2.append(r2)
for j in kr2:
if kr.count(j)<0:
kr.append(j)
ar[r]+=1
if ar[r] >= m:
return 'YES'
if kr.count(r)==0:
kr.append(r)
return 'NO'
s=input()
a=s.split(' ')
n, m = int(a[0]), int(a[1])
s=input()
a=s.split(' ')
print(process(a,m)) | if kr.count(j)<0: | 21 | decision |
def process(a,m):
kr=[]
ar = [0 for j in range(m)]
k=0
for i in a:
r=int(i)%m
if r==0:
return 'YES'
kr2=[]
for j in kr:
r2=(j+r)%m
k=ar[j]
if r2==0:
return 'YES'
ar[r2]+=1
if ar[r2] >= m:
return 'YES'
if kr2.count(r2)==0:
kr2.append(r2)
for j in kr2:
if kr.count(j)==0:
kr.append(j)
ar[r]+=1
if ar[r] >= m:
return 'YES'
if kr.count(r)==0:
kr.append(r)
return 'NO'
s=input()
a=s.split(' ')
n, m = int(a[0]), int(a[1])
s=input()
a=s.split(' ')
print(process(a,m)) | def process(a,m):
kr=[]
ar = [0 for j in range(m)]
k=0
for i in a:
r=int(i)*m
if r==0:
return 'YES'
kr2=[]
for j in kr:
r2=(j+r)%m
k=ar[j]
if r2==0:
return 'YES'
ar[r2]+=1
if ar[r2] >= m:
return 'YES'
if kr2.count(r2)==0:
kr2.append(r2)
for j in kr2:
if kr.count(j)==0:
kr.append(j)
ar[r]+=1
if ar[r] >= m:
return 'YES'
if kr.count(r)==0:
kr.append(r)
return 'NO'
s=input()
a=s.split(' ')
n, m = int(a[0]), int(a[1])
s=input()
a=s.split(' ')
print(process(a,m)) | r=int(i)*m | 6 | operation |
def process(a,m):
kr=[]
ar = [0 for j in range(m)]
k=0
for i in a:
r=int(i)%m
if r==0:
return 'YES'
kr2=[]
for j in kr:
r2=(j+r)%m
k=ar[j]
if r2==0:
return 'YES'
ar[r2]+=1
if ar[r2] >= m:
return 'YES'
if kr2.count(r2)==0:
kr2.append(r2)
for j in kr2:
if kr.count(j)==0:
kr.append(j)
ar[r]+=1
if ar[r] >= m:
return 'YES'
if kr.count(r)==0:
kr.append(r)
return 'NO'
s=input()
a=s.split(' ')
n, m = int(a[0]), int(a[1])
s=input()
a=s.split(' ')
print(process(a,m)) | def process(a,m):
kr=[]
ar = [0 for j in range(m)]
k=0
for i in a:
r=int(i)%m
if r<0:
return 'YES'
kr2=[]
for j in kr:
r2=(j+r)%m
k=ar[j]
if r2==0:
return 'YES'
ar[r2]+=1
if ar[r2] >= m:
return 'YES'
if kr2.count(r2)==0:
kr2.append(r2)
for j in kr2:
if kr.count(j)==0:
kr.append(j)
ar[r]+=1
if ar[r] >= m:
return 'YES'
if kr.count(r)==0:
kr.append(r)
return 'NO'
s=input()
a=s.split(' ')
n, m = int(a[0]), int(a[1])
s=input()
a=s.split(' ')
print(process(a,m)) | if r<0: | 7 | decision |
n, m = input().split()
n = int(n)
m = int(m)
name = input()
eman = str()
for i in range(m):
x, y = input().split()
m = m-1
for i in name:
if i == x:
eman = eman+y
elif i == y:
eman = eman+x
else:
eman = eman + i
name = eman
eman = str()
print(name) | n, m = input().split()
n = int(n)
m = int(m)
name = input()
eman = str()
for i in range(m):
x, y = input().split()
m = m-1
for i in name:
if i == x:
eman = eman/y
elif i == y:
eman = eman+x
else:
eman = eman + i
name = eman
eman = str()
print(name) | eman = eman/y | 11 | operation |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.