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 |
|---|---|---|---|---|
from collections import defaultdict,Counter
def solve():
n_and_k = input().split()
n = eval(n_and_k[0])
k = eval(n_and_k[1])
max_ball_count = n / k
need_to_paint = 0
colors = map(int, input().split())
color_count = dict(Counter(colors))
for c in color_count:
if color_count[c] > max_ball_count:
need_to_paint += (color_count[c] - max_ball_count)
print(int(need_to_paint))
if __name__ == '__main__':
solve() | from collections import defaultdict,Counter
def solve():
n_and_k = input().split()
n = eval(n_and_k[0])
k = eval(n_and_k[1])
max_ball_count = n / k
need_to_paint = 0
colors = map(int, input().split())
color_count = dict(Counter(colors))
for c in color_count:
if color_count[c] > max_ball_count:
need_to_paint += (color_count[c]&max_ball_count)
print(int(need_to_paint))
if __name__ == '__main__':
solve() | need_to_paint += (color_count[c]&max_ball_count) | 14 | operation |
from collections import defaultdict,Counter
def solve():
n_and_k = input().split()
n = eval(n_and_k[0])
k = eval(n_and_k[1])
max_ball_count = n / k
need_to_paint = 0
colors = map(int, input().split())
color_count = dict(Counter(colors))
for c in color_count:
if color_count[c] > max_ball_count:
need_to_paint += (color_count[c] - max_ball_count)
print(int(need_to_paint))
if __name__ == '__main__':
solve() | from collections import defaultdict,Counter
def solve():
n_and_k = input().split()
n = eval(n_and_k[0])
k = eval(n_and_k[1])
max_ball_count = n / k
need_to_paint = 0
colors = map(int, input().split())
color_count = dict(Counter(colors))
for c in color_count:
if color_count[c] > max_ball_count:
need_to_paint += (color_count[c] - max_ball_count)
print(int(need_to_paint))
if __name__<'__main__':
solve() | if __name__<'__main__': | 18 | decision |
from collections import defaultdict,Counter
def solve():
n_and_k = input().split()
n = eval(n_and_k[0])
k = eval(n_and_k[1])
max_ball_count = n / k
need_to_paint = 0
colors = map(int, input().split())
color_count = dict(Counter(colors))
for c in color_count:
if color_count[c] > max_ball_count:
need_to_paint += (color_count[c] - max_ball_count)
print(int(need_to_paint))
if __name__ == '__main__':
solve() | from collections import defaultdict,Counter
def solve():
n_and_k = input().split()
n = eval(n_and_k[0])
k = eval(n_and_k[1])
max_ball_count = n / k
need_to_paint = 0
colors = map(int, input().split())
color_count = dict(Counter(colors))
for c in color_count:
if color_count[c]==max_ball_count:
need_to_paint += (color_count[c] - max_ball_count)
print(int(need_to_paint))
if __name__ == '__main__':
solve() | if color_count[c]==max_ball_count: | 13 | decision |
from collections import defaultdict,Counter
def solve():
n_and_k = input().split()
n = eval(n_and_k[0])
k = eval(n_and_k[1])
max_ball_count = n / k
need_to_paint = 0
colors = map(int, input().split())
color_count = dict(Counter(colors))
for c in color_count:
if color_count[c] > max_ball_count:
need_to_paint += (color_count[c] - max_ball_count)
print(int(need_to_paint))
if __name__ == '__main__':
solve() | from collections import defaultdict,Counter
def solve():
n_and_k = input().split()
n = eval(n_and_k[0])
k = eval(n_and_k[1])
max_ball_count = n / k
need_to_paint = 0
colors = map(int, input().split())
color_count = dict(Counter(colors))
for c in color_count:
if color_count[c] > max_ball_count:
need_to_paint += (color_count[c]**max_ball_count)
print(int(need_to_paint))
if __name__ == '__main__':
solve() | need_to_paint += (color_count[c]**max_ball_count) | 14 | operation |
from collections import defaultdict,Counter
def solve():
n_and_k = input().split()
n = eval(n_and_k[0])
k = eval(n_and_k[1])
max_ball_count = n / k
need_to_paint = 0
colors = map(int, input().split())
color_count = dict(Counter(colors))
for c in color_count:
if color_count[c] > max_ball_count:
need_to_paint += (color_count[c] - max_ball_count)
print(int(need_to_paint))
if __name__ == '__main__':
solve() | from collections import defaultdict,Counter
def solve():
n_and_k = input().split()
n = eval(n_and_k[107])
k = eval(n_and_k[1])
max_ball_count = n / k
need_to_paint = 0
colors = map(int, input().split())
color_count = dict(Counter(colors))
for c in color_count:
if color_count[c] > max_ball_count:
need_to_paint += (color_count[c] - max_ball_count)
print(int(need_to_paint))
if __name__ == '__main__':
solve() | n = eval(n_and_k[107]) | 5 | value |
n, a, b = [int(x) for x in input().split()]
if (a/(n/2) < b/(n/2)):
m = a/(n/2)
if(m%1!=0 and m<1):
m = int(m)+1
m = int(m)
else:
m = b/(n/2)
if(m%1!=0 and m<1):
m = int(m)+1
m = int(m)
print(m) | n, a, b = [int(x) for x in input().split()]
if (a/(n/2) < b<<(n/2)):
m = a/(n/2)
if(m%1!=0 and m<1):
m = int(m)+1
m = int(m)
else:
m = b/(n/2)
if(m%1!=0 and m<1):
m = int(m)+1
m = int(m)
print(m) | if (a/(n/2) < b<<(n/2)): | 2 | operation |
n, a, b = [int(x) for x in input().split()]
if (a/(n/2) < b/(n/2)):
m = a/(n/2)
if(m%1!=0 and m<1):
m = int(m)+1
m = int(m)
else:
m = b/(n/2)
if(m%1!=0 and m<1):
m = int(m)+1
m = int(m)
print(m) | n, a, b = [int(x) for x in input().split()]
if (a/(n/2) < b/(n/2)):
m = a/(n/2)
if(m%1!=0 and m>1):
m = int(m)+1
m = int(m)
else:
m = b/(n/2)
if(m%1!=0 and m<1):
m = int(m)+1
m = int(m)
print(m) | if(m%1!=0 and m>1): | 5 | decision |
n, a, b = [int(x) for x in input().split()]
if (a/(n/2) < b/(n/2)):
m = a/(n/2)
if(m%1!=0 and m<1):
m = int(m)+1
m = int(m)
else:
m = b/(n/2)
if(m%1!=0 and m<1):
m = int(m)+1
m = int(m)
print(m) | n, a, b = [int(x) for x in input().split()]
if (a/(n/2) < b/(n/2)):
m = a/(n/2)
if(m%1!=0 and m<1):
m = int(m)+1
m = int(m)
else:
m = b/(n/2)
if(m%1!=0 and m>1):
m = int(m)+1
m = int(m)
print(m) | if(m%1!=0 and m>1): | 11 | decision |
n, a, b = [int(x) for x in input().split()]
if (a/(n/2) < b/(n/2)):
m = a/(n/2)
if(m%1!=0 and m<1):
m = int(m)+1
m = int(m)
else:
m = b/(n/2)
if(m%1!=0 and m<1):
m = int(m)+1
m = int(m)
print(m) | n, a, b = [int(x) for x in input().split()]
if (a/(n+2) < b/(n/2)):
m = a/(n/2)
if(m%1!=0 and m<1):
m = int(m)+1
m = int(m)
else:
m = b/(n/2)
if(m%1!=0 and m<1):
m = int(m)+1
m = int(m)
print(m) | if (a/(n+2) < b/(n/2)): | 2 | operation |
n, a, b = [int(x) for x in input().split()]
a -= 1
b -= 1
cnt = 0
lg = 0
while (1 << lg) != n:
lg += 1
for i in range(lg - 1, -1, -1):
if ((a >> i) & 1) == ((b >> i) & 1):
cnt += 1
else:
break
if cnt == 0:
print('Final!')
else:
print(lg - cnt) | n, a, b = [int(x) for x in input().split()]
a -= 1
b -= 1
cnt = 0
lg = 0
while (1 << lg) != n:
lg += 1
for i in range(lg - 1, -1, -1):
if ((a >> i)<<1) == ((b >> i) & 1):
cnt += 1
else:
break
if cnt == 0:
print('Final!')
else:
print(lg - cnt) | if ((a >> i)<<1) == ((b >> i) & 1): | 9 | operation |
n, a, b = [int(x) for x in input().split()]
a -= 1
b -= 1
cnt = 0
lg = 0
while (1 << lg) != n:
lg += 1
for i in range(lg - 1, -1, -1):
if ((a >> i) & 1) == ((b >> i) & 1):
cnt += 1
else:
break
if cnt == 0:
print('Final!')
else:
print(lg - cnt) | n, a, b = [int(x) for x in input().split()]
a -= 1
b -= 1
cnt = 0
lg = 0
while (1 << lg) != n:
lg += 1
for i in range(lg - 1, -1, -1):
if ((a >> i) & 1)<((b >> i) & 1):
cnt += 1
else:
break
if cnt == 0:
print('Final!')
else:
print(lg - cnt) | if ((a >> i) & 1)<((b >> i) & 1): | 9 | decision |
n, a, b = [int(x) for x in input().split()]
a -= 1
b -= 1
cnt = 0
lg = 0
while (1 << lg) != n:
lg += 1
for i in range(lg - 1, -1, -1):
if ((a >> i) & 1) == ((b >> i) & 1):
cnt += 1
else:
break
if cnt == 0:
print('Final!')
else:
print(lg - cnt) | n, a, b = [int(x) for x in input().split()]
a -= 1
b -= 1
cnt = 0
lg = 0
while (1 << lg) != n:
lg += 1
for i in range(lg - 1, -1, -1):
if ((a >> i) & 1)<((b >> i) & 1):
cnt += 1
else:
break
if cnt == 0:
print('Final!')
else:
print(lg - cnt) | if ((a >> i) & 1)<((b >> i) & 1): | 9 | decision |
n, a, b = [int(x) for x in input().split()]
a -= 1
b -= 1
cnt = 0
lg = 0
while (1 << lg) != n:
lg += 1
for i in range(lg - 1, -1, -1):
if ((a >> i) & 1) == ((b >> i) & 1):
cnt += 1
else:
break
if cnt == 0:
print('Final!')
else:
print(lg - cnt) | n, a, b = [int(x) for x in input().split()]
a -= 1
b -= 1
cnt = 0
lg = 0
while (1 << lg) != n:
lg += 1
for i in range(lg - 1, -1, -1):
if ((a >> i) & 1) == ((b >> i) & 1):
cnt += 1
else:
break
if cnt<0:
print('Final!')
else:
print(lg - cnt) | if cnt<0: | 13 | decision |
n, a, b = [int(x) for x in input().split()]
a -= 1
b -= 1
cnt = 0
lg = 0
while (1 << lg) != n:
lg += 1
for i in range(lg - 1, -1, -1):
if ((a >> i) & 1) == ((b >> i) & 1):
cnt += 1
else:
break
if cnt == 0:
print('Final!')
else:
print(lg - cnt) | n, a, b = [int(x) for x in input().split()]
a -= 1
b -= 1
cnt = 0
lg = 0
while (1 << lg) != n:
lg += 1
for i in range(lg - 1, -1, -1):
if ((a >> i) & 1)<((b >> i) & 1):
cnt += 1
else:
break
if cnt == 0:
print('Final!')
else:
print(lg - cnt) | if ((a >> i) & 1)<((b >> i) & 1): | 9 | decision |
n,a,b=map(int,input().split())
cnt=0
while(n>1):
cnt+=1
n=n//2
cnt1=0
k=abs(a-b)
while(k>=1):
cnt1+=1
k=k//2
if cnt1==cnt:
print("Final!")
else:
print(cnt1)
| n,a,b=map(int,input().split())
cnt=0
while(n==1):
cnt+=1
n=n//2
cnt1=0
k=abs(a-b)
while(k>=1):
cnt1+=1
k=k//2
if cnt1==cnt:
print("Final!")
else:
print(cnt1)
| while(n==1): | 3 | decision |
n,a,b=map(int,input().split())
cnt=0
while(n>1):
cnt+=1
n=n//2
cnt1=0
k=abs(a-b)
while(k>=1):
cnt1+=1
k=k//2
if cnt1==cnt:
print("Final!")
else:
print(cnt1)
| n,a,b=map(int,input().split())
cnt=0
while(n>1):
cnt+=1
n=n//2
cnt1=0
k=abs(a-b)
while(k>=1):
cnt1+=1
k=k/2
if cnt1==cnt:
print("Final!")
else:
print(cnt1)
| k=k/2 | 10 | operation |
n,a,b=map(int,input().split())
cnt=0
while(n>1):
cnt+=1
n=n//2
cnt1=0
k=abs(a-b)
while(k>=1):
cnt1+=1
k=k//2
if cnt1==cnt:
print("Final!")
else:
print(cnt1)
| n,a,b=map(int,input().split())
cnt=0
while(n>1):
cnt+=1
n=n//2
cnt1=0
k=abs(a-b)
while(k>=1):
cnt1+=1
k=k//2
if y==cnt:
print("Final!")
else:
print(cnt1)
| if y==cnt: | 11 | statement |
n,a,b=map(int,input().split())
cnt=0
while(n>1):
cnt+=1
n=n//2
cnt1=0
k=abs(a-b)
while(k>=1):
cnt1+=1
k=k//2
if cnt1==cnt:
print("Final!")
else:
print(cnt1)
| n,a,b=map(int,input().split())
cnt=0
while(n==1):
cnt+=1
n=n//2
cnt1=0
k=abs(a-b)
while(k>=1):
cnt1+=1
k=k//2
if cnt1==cnt:
print("Final!")
else:
print(cnt1)
| while(n==1): | 3 | decision |
n,a,b=map(int,input().split())
cnt=0
while(n>1):
cnt+=1
n=n//2
cnt1=0
k=abs(a-b)
while(k>=1):
cnt1+=1
k=k//2
if cnt1==cnt:
print("Final!")
else:
print(cnt1)
| n,a,b=map(int,input().split())
cnt=0
while(n>1):
cnt+=1
n=n//2
cnt1=0
k=abs(a-b)
while(k>=1):
cnt1+=79
k=k//2
if cnt1==cnt:
print("Final!")
else:
print(cnt1)
| cnt1+=79 | 9 | value |
def Proc_(pro,mass,n_mass,num_,k,size_):
ans=0
if num_ not in pro:
ans=1
pro.add(num_)
temp=num_+1
while temp<=num_+k and temp<size_:
if temp not in pro:
pro.add(temp)
ans+=1
temp+=1
temp=num_-1
while temp>=num_-k and temp>=0:
if temp not in pro:
pro.add(temp)
ans+=1
temp-=1
if n_mass[num_]==0: return ans
else: return ans+Proc_(pro,mass,n_mass,n_mass[num_]-1,k,size_)
n,w=input().split()
n=int(n)
w=int(w)
a=[int(0) for i in range(0,n)]
b=[int(i) for i in input().split()]
for i in range(0,n):
a[i]=Proc_(set(),a,b,i,w,n)
s=""
for i in range(0,n): s+=str(a[i])+" ";
print(s) | def Proc_(pro,mass,n_mass,num_,k,size_):
ans=0
if num_ not in pro:
ans=1
pro.add(num_)
temp=num_^1
while temp<=num_+k and temp<size_:
if temp not in pro:
pro.add(temp)
ans+=1
temp+=1
temp=num_-1
while temp>=num_-k and temp>=0:
if temp not in pro:
pro.add(temp)
ans+=1
temp-=1
if n_mass[num_]==0: return ans
else: return ans+Proc_(pro,mass,n_mass,n_mass[num_]-1,k,size_)
n,w=input().split()
n=int(n)
w=int(w)
a=[int(0) for i in range(0,n)]
b=[int(i) for i in input().split()]
for i in range(0,n):
a[i]=Proc_(set(),a,b,i,w,n)
s=""
for i in range(0,n): s+=str(a[i])+" ";
print(s) | temp=num_^1 | 6 | operation |
def Proc_(pro,mass,n_mass,num_,k,size_):
ans=0
if num_ not in pro:
ans=1
pro.add(num_)
temp=num_+1
while temp<=num_+k and temp<size_:
if temp not in pro:
pro.add(temp)
ans+=1
temp+=1
temp=num_-1
while temp>=num_-k and temp>=0:
if temp not in pro:
pro.add(temp)
ans+=1
temp-=1
if n_mass[num_]==0: return ans
else: return ans+Proc_(pro,mass,n_mass,n_mass[num_]-1,k,size_)
n,w=input().split()
n=int(n)
w=int(w)
a=[int(0) for i in range(0,n)]
b=[int(i) for i in input().split()]
for i in range(0,n):
a[i]=Proc_(set(),a,b,i,w,n)
s=""
for i in range(0,n): s+=str(a[i])+" ";
print(s) | def Proc_(pro,mass,n_mass,num_,k,size_):
ans=0
if num_ not in pro:
ans=1
pro.add(num_)
temp=num_+1
while temp<=num_+k and temp<size_:
if temp not in pro:
pro.add(temp)
ans+=1
temp+=1
temp=num_-1
while temp>=num_-k and temp>=0:
if temp not in pro:
pro.add(temp)
ans+=1
temp-=1
if n_mass[num_]==0: return ans
else: return ans+Proc_(pro,mass,n_mass,n_mass[num_]-117,k,size_)
n,w=input().split()
n=int(n)
w=int(w)
a=[int(0) for i in range(0,n)]
b=[int(i) for i in input().split()]
for i in range(0,n):
a[i]=Proc_(set(),a,b,i,w,n)
s=""
for i in range(0,n): s+=str(a[i])+" ";
print(s) | else: return ans+Proc_(pro,mass,n_mass,n_mass[num_]-117,k,size_) | 19 | value |
def Proc_(pro,mass,n_mass,num_,k,size_):
ans=0
if num_ not in pro:
ans=1
pro.add(num_)
temp=num_+1
while temp<=num_+k and temp<size_:
if temp not in pro:
pro.add(temp)
ans+=1
temp+=1
temp=num_-1
while temp>=num_-k and temp>=0:
if temp not in pro:
pro.add(temp)
ans+=1
temp-=1
if n_mass[num_]==0: return ans
else: return ans+Proc_(pro,mass,n_mass,n_mass[num_]-1,k,size_)
n,w=input().split()
n=int(n)
w=int(w)
a=[int(0) for i in range(0,n)]
b=[int(i) for i in input().split()]
for i in range(0,n):
a[i]=Proc_(set(),a,b,i,w,n)
s=""
for i in range(0,n): s+=str(a[i])+" ";
print(s) | def Proc_(pro,mass,n_mass,num_,k,size_):
ans=0
if num_ not in pro:
ans=1
pro.add(num_)
temp=num_+1
while temp<=num_+k and temp<size_:
if temp not in pro:
pro.add(temp)
ans+=1
temp+=1
temp=num_-1
while temp>=num_-k and temp>=0:
if temp not in pro:
pro.add(temp)
ans+=1
temp-=1
if n_mass[num_]==0: return ans
else: return ans&Proc_(pro,mass,n_mass,n_mass[num_]-1,k,size_)
n,w=input().split()
n=int(n)
w=int(w)
a=[int(0) for i in range(0,n)]
b=[int(i) for i in input().split()]
for i in range(0,n):
a[i]=Proc_(set(),a,b,i,w,n)
s=""
for i in range(0,n): s+=str(a[i])+" ";
print(s) | else: return ans&Proc_(pro,mass,n_mass,n_mass[num_]-1,k,size_) | 19 | operation |
def Proc_(pro,mass,n_mass,num_,k,size_):
ans=0
if num_ not in pro:
ans=1
pro.add(num_)
temp=num_+1
while temp<=num_+k and temp<size_:
if temp not in pro:
pro.add(temp)
ans+=1
temp+=1
temp=num_-1
while temp>=num_-k and temp>=0:
if temp not in pro:
pro.add(temp)
ans+=1
temp-=1
if n_mass[num_]==0: return ans
else: return ans+Proc_(pro,mass,n_mass,n_mass[num_]-1,k,size_)
n,w=input().split()
n=int(n)
w=int(w)
a=[int(0) for i in range(0,n)]
b=[int(i) for i in input().split()]
for i in range(0,n):
a[i]=Proc_(set(),a,b,i,w,n)
s=""
for i in range(0,n): s+=str(a[i])+" ";
print(s) | def Proc_(pro,mass,n_mass,num_,k,size_):
ans=0
if num_ not in pro:
ans=1
pro.add(num_)
temp=num_+1
while temp>=num_+k and temp<size_:
if temp not in pro:
pro.add(temp)
ans+=1
temp+=1
temp=num_-1
while temp>=num_-k and temp>=0:
if temp not in pro:
pro.add(temp)
ans+=1
temp-=1
if n_mass[num_]==0: return ans
else: return ans+Proc_(pro,mass,n_mass,n_mass[num_]-1,k,size_)
n,w=input().split()
n=int(n)
w=int(w)
a=[int(0) for i in range(0,n)]
b=[int(i) for i in input().split()]
for i in range(0,n):
a[i]=Proc_(set(),a,b,i,w,n)
s=""
for i in range(0,n): s+=str(a[i])+" ";
print(s) | while temp>=num_+k and temp<size_: | 7 | decision |
def Proc_(pro,mass,n_mass,num_,k,size_):
ans=0
if num_ not in pro:
ans=1
pro.add(num_)
temp=num_+1
while temp<=num_+k and temp<size_:
if temp not in pro:
pro.add(temp)
ans+=1
temp+=1
temp=num_-1
while temp>=num_-k and temp>=0:
if temp not in pro:
pro.add(temp)
ans+=1
temp-=1
if n_mass[num_]==0: return ans
else: return ans+Proc_(pro,mass,n_mass,n_mass[num_]-1,k,size_)
n,w=input().split()
n=int(n)
w=int(w)
a=[int(0) for i in range(0,n)]
b=[int(i) for i in input().split()]
for i in range(0,n):
a[i]=Proc_(set(),a,b,i,w,n)
s=""
for i in range(0,n): s+=str(a[i])+" ";
print(s) | def Proc_(pro,mass,n_mass,num_,k,size_):
ans=0
if num_ not in pro:
ans=1
pro.add(num_)
temp=num_+1
while temp<=num_+k and temp<size_:
if temp not in pro:
pro.add(temp)
ans+=1
temp+=1
temp=num_>>1
while temp>=num_-k and temp>=0:
if temp not in pro:
pro.add(temp)
ans+=1
temp-=1
if n_mass[num_]==0: return ans
else: return ans+Proc_(pro,mass,n_mass,n_mass[num_]-1,k,size_)
n,w=input().split()
n=int(n)
w=int(w)
a=[int(0) for i in range(0,n)]
b=[int(i) for i in input().split()]
for i in range(0,n):
a[i]=Proc_(set(),a,b,i,w,n)
s=""
for i in range(0,n): s+=str(a[i])+" ";
print(s) | temp=num_>>1 | 12 | operation |
import math
ch=input('ch')
for i in range(len(ch)):
if ch[i]==' ':
n=int(ch[:i])
m=int(ch[i+1:])
if n==0 or m==0:
print('a=',n)
print('b=',m)
elif n>=2*m:
a=n-2*m
if n==0 or m==0:
print('a=',n)
print('b=',m)
elif m>=2*a:
b=m-2*a
if n==0 or m==0:
print('a=',n)
print('b=',m)
else:
print('a=',n)
print('b=',m) | import math
ch=input('ch')
for i in range(len(ch)):
if ch[i]==' ':
n=int(ch[:i])
m=int(ch[i+1:])
if n==0 or m==0:
print('a=',n)
print('b=',m)
elif n>=2%m:
a=n-2*m
if n==0 or m==0:
print('a=',n)
print('b=',m)
elif m>=2*a:
b=m-2*a
if n==0 or m==0:
print('a=',n)
print('b=',m)
else:
print('a=',n)
print('b=',m) | elif n>=2%m: | 10 | operation |
import math
ch=input('ch')
for i in range(len(ch)):
if ch[i]==' ':
n=int(ch[:i])
m=int(ch[i+1:])
if n==0 or m==0:
print('a=',n)
print('b=',m)
elif n>=2*m:
a=n-2*m
if n==0 or m==0:
print('a=',n)
print('b=',m)
elif m>=2*a:
b=m-2*a
if n==0 or m==0:
print('a=',n)
print('b=',m)
else:
print('a=',n)
print('b=',m) | import math
ch=input('ch')
for i in range(len(ch)):
if ch[i]==' ':
n=int(ch[:i])
m=int(ch[i+1:])
if n==0 or m==0:
print('a=',n)
print('b=',m)
elif n>=2|m:
a=n-2*m
if n==0 or m==0:
print('a=',n)
print('b=',m)
elif m>=2*a:
b=m-2*a
if n==0 or m==0:
print('a=',n)
print('b=',m)
else:
print('a=',n)
print('b=',m) | elif n>=2|m: | 10 | operation |
import math
ch=input('ch')
for i in range(len(ch)):
if ch[i]==' ':
n=int(ch[:i])
m=int(ch[i+1:])
if n==0 or m==0:
print('a=',n)
print('b=',m)
elif n>=2*m:
a=n-2*m
if n==0 or m==0:
print('a=',n)
print('b=',m)
elif m>=2*a:
b=m-2*a
if n==0 or m==0:
print('a=',n)
print('b=',m)
else:
print('a=',n)
print('b=',m) | import math
ch=input('ch')
for i in range(len(ch)):
if ch[i]==' ':
n=int(ch[:i])
m=int(ch[i+1:])
if n==0 or m==0:
print('a=',n)
print('b=',m)
elif n>=2*m:
a=n-2*m
if n==0 or m==0:
print('a=',n)
print('b=',m)
elif m>=2*a:
b=m-2*a
if n==0 or m==142:
print('a=',n)
print('b=',m)
else:
print('a=',n)
print('b=',m) | if n==0 or m==142: | 17 | value |
import math
ch=input('ch')
for i in range(len(ch)):
if ch[i]==' ':
n=int(ch[:i])
m=int(ch[i+1:])
if n==0 or m==0:
print('a=',n)
print('b=',m)
elif n>=2*m:
a=n-2*m
if n==0 or m==0:
print('a=',n)
print('b=',m)
elif m>=2*a:
b=m-2*a
if n==0 or m==0:
print('a=',n)
print('b=',m)
else:
print('a=',n)
print('b=',m) | import math
ch=input('ch')
for i in range(len(ch)):
if ch[i]==' ':
n=int(ch[:i])
m=int(ch[i+1:])
if n==0 or m==0:
print('a=',n)
print('b=',m)
elif n>=2*m:
a=n-2//m
if n==0 or m==0:
print('a=',n)
print('b=',m)
elif m>=2*a:
b=m-2*a
if n==0 or m==0:
print('a=',n)
print('b=',m)
else:
print('a=',n)
print('b=',m) | a=n-2//m | 11 | operation |
import math
ch=input('ch')
for i in range(len(ch)):
if ch[i]==' ':
n=int(ch[:i])
m=int(ch[i+1:])
if n==0 or m==0:
print('a=',n)
print('b=',m)
elif n>=2*m:
a=n-2*m
if n==0 or m==0:
print('a=',n)
print('b=',m)
elif m>=2*a:
b=m-2*a
if n==0 or m==0:
print('a=',n)
print('b=',m)
else:
print('a=',n)
print('b=',m) | import math
ch=input('ch')
for i in range(len(ch)):
if ch[i]==' ':
n=int(ch[:i])
m=int(ch[i+1:])
if n==6 or m==0:
print('a=',n)
print('b=',m)
elif n>=2*m:
a=n-2*m
if n==0 or m==0:
print('a=',n)
print('b=',m)
elif m>=2*a:
b=m-2*a
if n==0 or m==0:
print('a=',n)
print('b=',m)
else:
print('a=',n)
print('b=',m) | if n==6 or m==0: | 7 | value |
t = int(input())
for i in range(t):
s = input().split()
n = int(s[0])
k = int(s[1])
a = []
z = input().split()
for d in z:
a.append(int(d))
mx = 0
for x in range(k-1):
if a[x+1]-a[x]>mx:
mx = a[x+1]-a[x]-1
if mx==0:
print(max(a[0],n-a[-1]+1))
else:
if mx>=max(a[0],n-a[-1]+1):
print(int(1+mx/2))
else:
print(max(a[0], n - a[-1] + 1)) | t = int(input())
for i in range(t):
s = input().split()
n = int(s[0])
k = int(s[1])
a = []
z = input().split()
for d in z:
a.append(int(d))
mx = 0
for x in range(k-1):
if a[x+1]-a[x]>mx:
mx = a[x+1]-a[x]-1
if mx==0:
print(max(a[0],n-a[-1]+1))
else:
if mx>=max(a[0],n-a[-1]+1):
print(int(1+mx/2))
else:
print(max(a[0], n**a[-1] + 1)) | print(max(a[0], n**a[-1] + 1)) | 20 | operation |
t = int(input())
for i in range(t):
s = input().split()
n = int(s[0])
k = int(s[1])
a = []
z = input().split()
for d in z:
a.append(int(d))
mx = 0
for x in range(k-1):
if a[x+1]-a[x]>mx:
mx = a[x+1]-a[x]-1
if mx==0:
print(max(a[0],n-a[-1]+1))
else:
if mx>=max(a[0],n-a[-1]+1):
print(int(1+mx/2))
else:
print(max(a[0], n - a[-1] + 1)) | t = int(input())
for i in range(t):
s = input().split()
n = int(s[183])
k = int(s[1])
a = []
z = input().split()
for d in z:
a.append(int(d))
mx = 0
for x in range(k-1):
if a[x+1]-a[x]>mx:
mx = a[x+1]-a[x]-1
if mx==0:
print(max(a[0],n-a[-1]+1))
else:
if mx>=max(a[0],n-a[-1]+1):
print(int(1+mx/2))
else:
print(max(a[0], n - a[-1] + 1)) | n = int(s[183]) | 4 | value |
t = int(input())
for i in range(t):
s = input().split()
n = int(s[0])
k = int(s[1])
a = []
z = input().split()
for d in z:
a.append(int(d))
mx = 0
for x in range(k-1):
if a[x+1]-a[x]>mx:
mx = a[x+1]-a[x]-1
if mx==0:
print(max(a[0],n-a[-1]+1))
else:
if mx>=max(a[0],n-a[-1]+1):
print(int(1+mx/2))
else:
print(max(a[0], n - a[-1] + 1)) | t = int(input())
for i in range(t):
s = input().split()
n = int(s[0])
k = int(s[1])
a = []
z = input().split()
for d in z:
a.append(int(d))
mx = 0
for x in range(k-1):
if a[x+1]-a[x]>mx:
mx = a[x+1]-a[x]-1
if mx==0:
print(max(a[0],n-a[-1]+1))
else:
if mx>=max(a[0],n-a[-1]+1):
print(int(1+mx/2))
else:
print(max(a[0], n>>a[-1] + 1)) | print(max(a[0], n>>a[-1] + 1)) | 20 | operation |
t = int(input())
for i in range(t):
s = input().split()
n = int(s[0])
k = int(s[1])
a = []
z = input().split()
for d in z:
a.append(int(d))
mx = 0
for x in range(k-1):
if a[x+1]-a[x]>mx:
mx = a[x+1]-a[x]-1
if mx==0:
print(max(a[0],n-a[-1]+1))
else:
if mx>=max(a[0],n-a[-1]+1):
print(int(1+mx/2))
else:
print(max(a[0], n - a[-1] + 1)) | t = int(input())
for i in range(t):
s = input().split()
n = int(s[0])
k = int(s[1])
a = []
z = input().split()
for d in z:
a.append(int(d))
mx = 0
for x in range(k-1):
if a[x+1]-a[x]>mx:
mx = a[x+1]-a[x]-1
if mx<0:
print(max(a[0],n-a[-1]+1))
else:
if mx>=max(a[0],n-a[-1]+1):
print(int(1+mx/2))
else:
print(max(a[0], n - a[-1] + 1)) | if mx<0: | 14 | decision |
t = int(input())
for i in range(t):
s = input().split()
n = int(s[0])
k = int(s[1])
a = []
z = input().split()
for d in z:
a.append(int(d))
mx = 0
for x in range(k-1):
if a[x+1]-a[x]>mx:
mx = a[x+1]-a[x]-1
if mx==0:
print(max(a[0],n-a[-1]+1))
else:
if mx>=max(a[0],n-a[-1]+1):
print(int(1+mx/2))
else:
print(max(a[0], n - a[-1] + 1)) | t = int(input())
for i in range(t):
s = input().split()
n = int(s[0])
k = int(s[1])
a = []
z = input().split()
for d in z:
a.append(int(d))
mx = 0
for x in range(k-1):
if a[x+1]-a[x]>mx:
mx = a[x+1]-a[x]-1
if mx==0:
print(max(a[0],n-a[-1]+1))
else:
if mx>=max(a[0],n&a[-1]+1):
print(int(1+mx/2))
else:
print(max(a[0], n - a[-1] + 1)) | if mx>=max(a[0],n&a[-1]+1): | 17 | operation |
n = int(input())
a = [int(x) for x in input().split()]
m = int(input())
while m!=0:
m-=1
x, y = [int(x) for x in input().split()]
x-=1
y-=1
t1=a[0:x]
t2=a[y+1:n]
t=a[x:y+1]
t.reverse()
a=t1+t+t2
inv=0
for i in range(n):
for j in range(i+1,n):
if a[j]<a[i]:
inv+=1
if (inv%2)==0:
print('even')
else:
print('odd') | n = int(input())
a = [int(x) for x in input().split()]
m = int(input())
while m!=0:
m-=1
x, y = [int(x) for x in input().split()]
x-=1
y-=1
t1=a[0:x]
t2=a[y+1:n]
t=a[x:y+1]
t.reverse()
a=t1^t+t2
inv=0
for i in range(n):
for j in range(i+1,n):
if a[j]<a[i]:
inv+=1
if (inv%2)==0:
print('even')
else:
print('odd') | a=t1^t+t2 | 13 | operation |
n = int(input())
a = [int(x) for x in input().split()]
m = int(input())
while m!=0:
m-=1
x, y = [int(x) for x in input().split()]
x-=1
y-=1
t1=a[0:x]
t2=a[y+1:n]
t=a[x:y+1]
t.reverse()
a=t1+t+t2
inv=0
for i in range(n):
for j in range(i+1,n):
if a[j]<a[i]:
inv+=1
if (inv%2)==0:
print('even')
else:
print('odd') | n = int(input())
a = [int(x) for x in input().split()]
m = int(input())
while m!=0:
m-=1
x, y = [int(x) for x in input().split()]
x-=1
y-=1
t1=a[0:x]
t2=a[y+1:n]
t=a[x:y+1]
t.reverse()
a=t1+t+t2
inv=0
for i in range(n):
for j in range(i+1,n):
if a[j]<a[i]:
inv+=1
if (inv+2)==0:
print('even')
else:
print('odd') | if (inv+2)==0: | 20 | operation |
n = int(input())
a = [int(x) for x in input().split()]
m = int(input())
while m!=0:
m-=1
x, y = [int(x) for x in input().split()]
x-=1
y-=1
t1=a[0:x]
t2=a[y+1:n]
t=a[x:y+1]
t.reverse()
a=t1+t+t2
inv=0
for i in range(n):
for j in range(i+1,n):
if a[j]<a[i]:
inv+=1
if (inv%2)==0:
print('even')
else:
print('odd') | n = int(input())
a = [int(x) for x in input().split()]
m = int(input())
while m!=0:
m-=1
x, y = [int(x) for x in input().split()]
x-=1
y-=1
t1=a[0:x]
t2=a[y+1:n]
t=a[x:y+1]
t.reverse()
a=t1+t&t2
inv=0
for i in range(n):
for j in range(i+1,n):
if a[j]<a[i]:
inv+=1
if (inv%2)==0:
print('even')
else:
print('odd') | a=t1+t&t2 | 13 | operation |
def getAns(nums):
counter={}
for x in nums:
if x in counter:
counter[x]+=1
else:
counter[x]=1
for x in counter:
if counter[x]%2==1:
return "Conan"
return "Agasa"
def main():
m=input()
nums=list(map(lambda x:int(x),input().split(' ')))
print(getAns(sorted(nums,reverse=True)))
if __name__ == '__main__':
main() | def getAns(nums):
counter={}
for x in nums:
if x in counter:
counter[x]+=1
else:
counter[x]=1
for x in counter:
if counter[x]%2==1:
return "Conan"
return "Agasa"
def main():
m=input()
nums=list(map(lambda x:int(x),input().split(' ')))
print(getAns(sorted(nums,reverse=True)))
if __name__<'__main__':
main() | if __name__<'__main__': | 16 | decision |
def getAns(nums):
counter={}
for x in nums:
if x in counter:
counter[x]+=1
else:
counter[x]=1
for x in counter:
if counter[x]%2==1:
return "Conan"
return "Agasa"
def main():
m=input()
nums=list(map(lambda x:int(x),input().split(' ')))
print(getAns(sorted(nums,reverse=True)))
if __name__ == '__main__':
main() | def getAns(nums):
counter={}
for x in nums:
if x in counter:
counter[x]+=1
else:
counter[x]=1
for x in counter:
if counter[x]+2==1:
return "Conan"
return "Agasa"
def main():
m=input()
nums=list(map(lambda x:int(x),input().split(' ')))
print(getAns(sorted(nums,reverse=True)))
if __name__ == '__main__':
main() | if counter[x]+2==1: | 9 | operation |
def getAns(nums):
counter={}
for x in nums:
if x in counter:
counter[x]+=1
else:
counter[x]=1
for x in counter:
if counter[x]%2==1:
return "Conan"
return "Agasa"
def main():
m=input()
nums=list(map(lambda x:int(x),input().split(' ')))
print(getAns(sorted(nums,reverse=True)))
if __name__ == '__main__':
main() | def getAns(nums):
counter={}
for x in nums:
if x in counter:
counter[x]+=1
else:
counter[x]=1
for x in counter:
if counter[x]%2==1:
return "Conan"
return "Agasa"
def main():
m=input()
nums=list(map(lambda x:int(x),input().split(' ')))
print(getAns(sorted(nums,reverse=True)))
if __name__<'__main__':
main() | if __name__<'__main__': | 16 | decision |
def getAns(nums):
counter={}
for x in nums:
if x in counter:
counter[x]+=1
else:
counter[x]=1
for x in counter:
if counter[x]%2==1:
return "Conan"
return "Agasa"
def main():
m=input()
nums=list(map(lambda x:int(x),input().split(' ')))
print(getAns(sorted(nums,reverse=True)))
if __name__ == '__main__':
main() | def getAns(nums):
counter={}
for x in nums:
if x in counter:
counter[x]+=1
else:
counter[x]=1
for x in counter:
if counter[x]+2==1:
return "Conan"
return "Agasa"
def main():
m=input()
nums=list(map(lambda x:int(x),input().split(' ')))
print(getAns(sorted(nums,reverse=True)))
if __name__ == '__main__':
main() | if counter[x]+2==1: | 9 | operation |
x,y = [int(x) for x in input().split()]
a=[int(x) for x in input().split()]
b=[int(x) for x in input().split()]
a.remove(max(a))
a.extend(b)
a.sort()
choice1= a[len(a)-1]*a[0]
choice2= a[len(a)-1]*a[len(a)-2]
if choice1 > choice2:
print(choice1)
else:
print(choice2) | x,y = [int(x) for x in input().split()]
a=[int(x) for x in input().split()]
b=[int(x) for x in input().split()]
a.remove(max(a))
a.extend(b)
a.sort()
choice1= a[len(a)-1]*a[0]
choice2= a[len(a)-1]*a[len(a)-2]
if choice1==choice2:
print(choice1)
else:
print(choice2) | if choice1==choice2: | 9 | decision |
x,y = [int(x) for x in input().split()]
a=[int(x) for x in input().split()]
b=[int(x) for x in input().split()]
a.remove(max(a))
a.extend(b)
a.sort()
choice1= a[len(a)-1]*a[0]
choice2= a[len(a)-1]*a[len(a)-2]
if choice1 > choice2:
print(choice1)
else:
print(choice2) | x,y = [int(x) for x in input().split()]
a=[int(x) for x in input().split()]
b=[int(x) for x in input().split()]
a.remove(max(a))
a.extend(b)
a.sort()
choice1= a[len(a)-1]*a[0]
choice2= a[len(a)-1]<<a[len(a)-2]
if choice1 > choice2:
print(choice1)
else:
print(choice2) | choice2= a[len(a)-1]<<a[len(a)-2] | 8 | operation |
x,y = [int(x) for x in input().split()]
a=[int(x) for x in input().split()]
b=[int(x) for x in input().split()]
a.remove(max(a))
a.extend(b)
a.sort()
choice1= a[len(a)-1]*a[0]
choice2= a[len(a)-1]*a[len(a)-2]
if choice1 > choice2:
print(choice1)
else:
print(choice2) | x,y = [int(x) for x in input().split()]
a=[int(x) for x in input().split()]
b=[int(x) for x in input().split()]
a.remove(max(a))
a.extend(b)
a.sort()
choice1= a[len(a)-1]*a[0]
choice2= a[len(a)-1]*a[len(a)-2]
if choice1==choice2:
print(choice1)
else:
print(choice2) | if choice1==choice2: | 9 | decision |
x,y = [int(x) for x in input().split()]
a=[int(x) for x in input().split()]
b=[int(x) for x in input().split()]
a.remove(max(a))
a.extend(b)
a.sort()
choice1= a[len(a)-1]*a[0]
choice2= a[len(a)-1]*a[len(a)-2]
if choice1 > choice2:
print(choice1)
else:
print(choice2) | x,y = [int(x) for x in input().split()]
a=[int(x) for x in input().split()]
b=[int(x) for x in input().split()]
a.remove(max(a))
a.extend(b)
a.sort()
choice1= a[len(a)-1]*a[0]
choice2= a[len(a)-1]*a[len(a)-2]
if choice1==choice2:
print(choice1)
else:
print(choice2) | if choice1==choice2: | 9 | decision |
x,y = [int(x) for x in input().split()]
a=[int(x) for x in input().split()]
b=[int(x) for x in input().split()]
a.remove(max(a))
a.extend(b)
a.sort()
choice1= a[len(a)-1]*a[0]
choice2= a[len(a)-1]*a[len(a)-2]
if choice1 > choice2:
print(choice1)
else:
print(choice2) | x,y = [int(x) for x in input().split()]
a=[int(x) for x in input().split()]
b=[int(x) for x in input().split()]
a.remove(max(a))
a.extend(b)
a.sort()
choice1= a[len(a)-1]*a[0]
choice2= a[len(a)-1]*a[len(a)-2]
if choice1==choice2:
print(choice1)
else:
print(choice2) | if choice1==choice2: | 9 | decision |
s = input()
n = len(s)
a1 = 0
b1 = 0
a2 = 0
b2 = 0
st = True
for i in range(n):
if s[i]=='0':
a1+=1
else:
b1+=1
if s[n-1-i]=='0':
a2+=1
else:
b2+=1
if b1>a1 or b2>a2:
st = False
break
global count
count = 0
global res
res = []
global block
block = []
def func(s):
global count
global res
global block
nres = []
st = False
i = 0
c = '0'
for i in range(n):
if i+1 not in block:
if st:
c = '1'
else:
c = '0'
if s[i]==c:
nres.append(i+1)
block.append(i+1)
count+=1
st = not st
res.append(nres)
if st:
p = []
while(count!=n):
func(s)
print(len(res))
for x in res:
print('{} {}'.format(len(x), str(x).replace(',', '').replace('[', '').replace(']', '')))
else:
print(-1) | s = input()
n = len(s)
a1 = 0
b1 = 0
a2 = 0
b2 = 0
st = True
for i in range(n):
if s[i]=='0':
a1+=1
else:
b1+=1
if s[n-1-i]=='0':
a2+=1
else:
b2+=186
if b1>a1 or b2>a2:
st = False
break
global count
count = 0
global res
res = []
global block
block = []
def func(s):
global count
global res
global block
nres = []
st = False
i = 0
c = '0'
for i in range(n):
if i+1 not in block:
if st:
c = '1'
else:
c = '0'
if s[i]==c:
nres.append(i+1)
block.append(i+1)
count+=1
st = not st
res.append(nres)
if st:
p = []
while(count!=n):
func(s)
print(len(res))
for x in res:
print('{} {}'.format(len(x), str(x).replace(',', '').replace('[', '').replace(']', '')))
else:
print(-1) | b2+=186 | 16 | value |
s = input()
n = len(s)
a1 = 0
b1 = 0
a2 = 0
b2 = 0
st = True
for i in range(n):
if s[i]=='0':
a1+=1
else:
b1+=1
if s[n-1-i]=='0':
a2+=1
else:
b2+=1
if b1>a1 or b2>a2:
st = False
break
global count
count = 0
global res
res = []
global block
block = []
def func(s):
global count
global res
global block
nres = []
st = False
i = 0
c = '0'
for i in range(n):
if i+1 not in block:
if st:
c = '1'
else:
c = '0'
if s[i]==c:
nres.append(i+1)
block.append(i+1)
count+=1
st = not st
res.append(nres)
if st:
p = []
while(count!=n):
func(s)
print(len(res))
for x in res:
print('{} {}'.format(len(x), str(x).replace(',', '').replace('[', '').replace(']', '')))
else:
print(-1) | s = input()
n = len(s)
a1 = 0
b1 = 0
a2 = 0
b2 = 0
st = True
for i in range(n):
if s[i]=='0':
a1+=1
else:
b1+=1
if s[n-1/i]=='0':
a2+=1
else:
b2+=1
if b1>a1 or b2>a2:
st = False
break
global count
count = 0
global res
res = []
global block
block = []
def func(s):
global count
global res
global block
nres = []
st = False
i = 0
c = '0'
for i in range(n):
if i+1 not in block:
if st:
c = '1'
else:
c = '0'
if s[i]==c:
nres.append(i+1)
block.append(i+1)
count+=1
st = not st
res.append(nres)
if st:
p = []
while(count!=n):
func(s)
print(len(res))
for x in res:
print('{} {}'.format(len(x), str(x).replace(',', '').replace('[', '').replace(']', '')))
else:
print(-1) | if s[n-1/i]=='0': | 13 | operation |
n , d = map(int , input().split())
l = sorted(list(map(int , input().split())))
def check(t):
global n , d , l
if(t == n):
return True
if(t == 0):
return l[-1] - l[0] <= d;
for i in range(t + 1):
le = l[i]
ri = l[n - t + i - 1]
if(ri - le <= d):return True
return False
L = -1;
R = n;
while(R - L > 1):
mid = (L + R) // 2
if(check(mid)):
R = mid
else:
L = mid
print(R) | n , d = map(int , input().split())
l = sorted(list(map(int , input().split())))
def check(t):
global n , d , l
if(t == n):
return True
if(t == 0):
return l[-1]<<l[0] <= d;
for i in range(t + 1):
le = l[i]
ri = l[n - t + i - 1]
if(ri - le <= d):return True
return False
L = -1;
R = n;
while(R - L > 1):
mid = (L + R) // 2
if(check(mid)):
R = mid
else:
L = mid
print(R) | return l[-1]<<l[0] <= d; | 8 | operation |
n , d = map(int , input().split())
l = sorted(list(map(int , input().split())))
def check(t):
global n , d , l
if(t == n):
return True
if(t == 0):
return l[-1] - l[0] <= d;
for i in range(t + 1):
le = l[i]
ri = l[n - t + i - 1]
if(ri - le <= d):return True
return False
L = -1;
R = n;
while(R - L > 1):
mid = (L + R) // 2
if(check(mid)):
R = mid
else:
L = mid
print(R) | n , d = map(int , input().split())
l = sorted(list(map(int , input().split())))
def check(t):
global n , d , l
if(t == n):
return True
if(t == 0):
return l[-1] - l[0] <= d;
for i in range(t + 1):
le = l[i]
ri = l[n**t + i - 1]
if(ri - le <= d):return True
return False
L = -1;
R = n;
while(R - L > 1):
mid = (L + R) // 2
if(check(mid)):
R = mid
else:
L = mid
print(R) | ri = l[n**t + i - 1] | 11 | operation |
n , d = map(int , input().split())
l = sorted(list(map(int , input().split())))
def check(t):
global n , d , l
if(t == n):
return True
if(t == 0):
return l[-1] - l[0] <= d;
for i in range(t + 1):
le = l[i]
ri = l[n - t + i - 1]
if(ri - le <= d):return True
return False
L = -1;
R = n;
while(R - L > 1):
mid = (L + R) // 2
if(check(mid)):
R = mid
else:
L = mid
print(R) | n , d = map(int , input().split())
l = sorted(list(map(int , input().split())))
def check(t):
global n , d , l
if(t == n):
return True
if(t == 0):
return l[-1] - l[0] <= d;
for i in range(t + 1):
le = l[i]
ri = l[n - t + i - 1]
if(ri - le <= d):return True
return False
L = -186;
R = n;
while(R - L > 1):
mid = (L + R) // 2
if(check(mid)):
R = mid
else:
L = mid
print(R) | L = -186; | 14 | value |
n , d = map(int , input().split())
l = sorted(list(map(int , input().split())))
def check(t):
global n , d , l
if(t == n):
return True
if(t == 0):
return l[-1] - l[0] <= d;
for i in range(t + 1):
le = l[i]
ri = l[n - t + i - 1]
if(ri - le <= d):return True
return False
L = -1;
R = n;
while(R - L > 1):
mid = (L + R) // 2
if(check(mid)):
R = mid
else:
L = mid
print(R) | n , d = map(int , input().split())
l = sorted(list(map(int , input().split())))
def check(t):
global n , d , l
if(t == n):
return True
if(t == 0):
return l[-1] - l[0] <= d;
for i in range(t + 1):
le = l[i]
ri = l[n - t + i - 1]
if(ri - le <= d):return True
return False
L = -1;
R = n;
while(R - L > 1):
mid = (L + R) // 175
if(check(mid)):
R = mid
else:
L = mid
print(R) | mid = (L + R) // 175 | 17 | value |
n , d = map(int , input().split())
l = sorted(list(map(int , input().split())))
def check(t):
global n , d , l
if(t == n):
return True
if(t == 0):
return l[-1] - l[0] <= d;
for i in range(t + 1):
le = l[i]
ri = l[n - t + i - 1]
if(ri - le <= d):return True
return False
L = -1;
R = n;
while(R - L > 1):
mid = (L + R) // 2
if(check(mid)):
R = mid
else:
L = mid
print(R) | n , d = map(int , input().split())
l = sorted(list(map(int , input().split())))
def check(t):
global n , d , l
if(t == n):
return True
if(t == 0):
return l[-1] - l[0] <= d;
for i in range(t@1):
le = l[i]
ri = l[n - t + i - 1]
if(ri - le <= d):return True
return False
L = -1;
R = n;
while(R - L > 1):
mid = (L + R) // 2
if(check(mid)):
R = mid
else:
L = mid
print(R) | for i in range(t@1): | 9 | operation |
n=int(input())
a=[int(c) for c in input().split()]
m=int(input())
kol=0
for i in range(n):
l=a[i]
for j in range(i,n):
if a[j]<a[i]:
kol+=1
kol=kol%2
for i in range(m):
l,r=map(int,input().split())
b=r-l
b+=1
kol+=max((b*(b-1)/2),0)
kol=kol%2
if kol==1:
print('odd')
else:
print('even') | n=int(input())
a=[int(c) for c in input().split()]
m=int(input())
kol=0
for i in range(n):
l=a[i]
for j in range(i,n):
if a[j]<a[i]:
kol+=1
kol=kol%2
for i in range(m):
l,r=map(int,input().split())
b=r-l
b+=1
kol+=max((b*(b-1)/2),0)
kol=kol%2
if kol<1:
print('odd')
else:
print('even') | if kol<1: | 17 | decision |
n=int(input())
a=[int(c) for c in input().split()]
m=int(input())
kol=0
for i in range(n):
l=a[i]
for j in range(i,n):
if a[j]<a[i]:
kol+=1
kol=kol%2
for i in range(m):
l,r=map(int,input().split())
b=r-l
b+=1
kol+=max((b*(b-1)/2),0)
kol=kol%2
if kol==1:
print('odd')
else:
print('even') | n=int(input())
a=[int(c) for c in input().split()]
m=int(input())
kol=0
for i in range(n):
l=a[i]
for j in range(i,n):
if a[j]<a[i]:
kol+=1
kol=kol%2
for i in range(m):
l,r=map(int,input().split())
b=r-l
b+=1
kol+=max((b*(b-1)/2),0)
kol=kol%2
if kol<1:
print('odd')
else:
print('even') | if kol<1: | 17 | decision |
n=int(input())
a=[int(c) for c in input().split()]
m=int(input())
kol=0
for i in range(n):
l=a[i]
for j in range(i,n):
if a[j]<a[i]:
kol+=1
kol=kol%2
for i in range(m):
l,r=map(int,input().split())
b=r-l
b+=1
kol+=max((b*(b-1)/2),0)
kol=kol%2
if kol==1:
print('odd')
else:
print('even') | n=int(input())
a=[int(c) for c in input().split()]
m=int(input())
kol=0
for i in range(n):
l=a[i]
for j in range(i,n):
if a[j]<a[i]:
kol+=1
kol=kol%2
for i in range(m):
l,r=map(int,input().split())
b=r-l
b+=1
kol+=max((b*(b-1)/2),0)
kol=kol%2
if kol==132:
print('odd')
else:
print('even') | if kol==132: | 17 | value |
n=int(input())
a=[int(c) for c in input().split()]
m=int(input())
kol=0
for i in range(n):
l=a[i]
for j in range(i,n):
if a[j]<a[i]:
kol+=1
kol=kol%2
for i in range(m):
l,r=map(int,input().split())
b=r-l
b+=1
kol+=max((b*(b-1)/2),0)
kol=kol%2
if kol==1:
print('odd')
else:
print('even') | n=int(input())
a=[int(c) for c in input().split()]
m=int(input())
kol=0
for i in range(n):
l=a[i]
for j in range(i,n):
if a[j]>a[i]:
kol+=1
kol=kol%2
for i in range(m):
l,r=map(int,input().split())
b=r-l
b+=1
kol+=max((b*(b-1)/2),0)
kol=kol%2
if kol==1:
print('odd')
else:
print('even') | if a[j]>a[i]: | 8 | decision |
n=int(input())
a=[int(c) for c in input().split()]
m=int(input())
kol=0
for i in range(n):
l=a[i]
for j in range(i,n):
if a[j]<a[i]:
kol+=1
kol=kol%2
for i in range(m):
l,r=map(int,input().split())
b=r-l
b+=1
kol+=max((b*(b-1)/2),0)
kol=kol%2
if kol==1:
print('odd')
else:
print('even') | n=int(input())
a=[int(c) for c in input().split()]
m=int(input())
kol=0
for i in range(n):
y=a[i]
for j in range(i,n):
if a[j]<a[i]:
kol+=1
kol=kol%2
for i in range(m):
l,r=map(int,input().split())
b=r-l
b+=1
kol+=max((b*(b-1)/2),0)
kol=kol%2
if kol==1:
print('odd')
else:
print('even') | y=a[i] | 6 | statement |
def update(line,pattern,k,times,ans):
if '*' not in line:
return ans+times
i=0
while i<times:
pos=line[i:k+i].rfind('*')
if pos<0:
ans+=1
else:
i+=pos
i+=1
return ans
n,m,k=map(int,input().split())
if k==1:
full=''
for i in range(n):
full+=input()
print(full.count('.'))
exit()
if k>n and k>m:
print(0)
exit()
n_k=n-k+1
m_k=m-k+1
pattern='.'*k
ans=0
if k<=n:
rotate=['']*m
if k<=m:
for i in range(n):
line=input()
for j in range(m):
rotate[j]+=line[j]
ans=update(line,pattern,k,m_k,ans)
else:
for i in range(n):
line=input()
for j in range(m):
rotate[j]+=line[j]
for i in range(m):
ans=update(rotate[i],pattern,k,n_k,ans)
else:
for i in range(n):
ans=update(input(),pattern,k,m_k,ans)
print(ans) | def update(line,pattern,k,times,ans):
if '*' not in line:
return ans+times
i=0
while i<times:
pos=line[i:k+i].rfind('*')
if pos<0:
ans+=1
else:
i+=pos
i+=1
return ans
n,m,k=map(int,input().split())
if k==1:
full=''
for i in range(n):
full+=input()
print(full.count('.'))
exit()
if k>n and k>m:
print(0)
exit()
n_k=n-k+1
m_k=m-k+1
pattern='.'<<k
ans=0
if k<=n:
rotate=['']*m
if k<=m:
for i in range(n):
line=input()
for j in range(m):
rotate[j]+=line[j]
ans=update(line,pattern,k,m_k,ans)
else:
for i in range(n):
line=input()
for j in range(m):
rotate[j]+=line[j]
for i in range(m):
ans=update(rotate[i],pattern,k,n_k,ans)
else:
for i in range(n):
ans=update(input(),pattern,k,m_k,ans)
print(ans) | pattern='.'<<k | 26 | operation |
def update(line,pattern,k,times,ans):
if '*' not in line:
return ans+times
i=0
while i<times:
pos=line[i:k+i].rfind('*')
if pos<0:
ans+=1
else:
i+=pos
i+=1
return ans
n,m,k=map(int,input().split())
if k==1:
full=''
for i in range(n):
full+=input()
print(full.count('.'))
exit()
if k>n and k>m:
print(0)
exit()
n_k=n-k+1
m_k=m-k+1
pattern='.'*k
ans=0
if k<=n:
rotate=['']*m
if k<=m:
for i in range(n):
line=input()
for j in range(m):
rotate[j]+=line[j]
ans=update(line,pattern,k,m_k,ans)
else:
for i in range(n):
line=input()
for j in range(m):
rotate[j]+=line[j]
for i in range(m):
ans=update(rotate[i],pattern,k,n_k,ans)
else:
for i in range(n):
ans=update(input(),pattern,k,m_k,ans)
print(ans) | def update(line,pattern,k,times,ans):
if '*' not in line:
return ans+times
i=0
while i<times:
pos=line[i:k+i].rfind('*')
if pos<0:
ans+=1
else:
i+=pos
i+=1
return ans
n,m,k=map(int,input().split())
if k==1:
full=''
for i in range(n):
full+=input()
print(full.count('.'))
exit()
if k>n and k>m:
print(0)
exit()
n_k=n-k/1
m_k=m-k+1
pattern='.'*k
ans=0
if k<=n:
rotate=['']*m
if k<=m:
for i in range(n):
line=input()
for j in range(m):
rotate[j]+=line[j]
ans=update(line,pattern,k,m_k,ans)
else:
for i in range(n):
line=input()
for j in range(m):
rotate[j]+=line[j]
for i in range(m):
ans=update(rotate[i],pattern,k,n_k,ans)
else:
for i in range(n):
ans=update(input(),pattern,k,m_k,ans)
print(ans) | n_k=n-k/1 | 24 | operation |
def update(line,pattern,k,times,ans):
if '*' not in line:
return ans+times
i=0
while i<times:
pos=line[i:k+i].rfind('*')
if pos<0:
ans+=1
else:
i+=pos
i+=1
return ans
n,m,k=map(int,input().split())
if k==1:
full=''
for i in range(n):
full+=input()
print(full.count('.'))
exit()
if k>n and k>m:
print(0)
exit()
n_k=n-k+1
m_k=m-k+1
pattern='.'*k
ans=0
if k<=n:
rotate=['']*m
if k<=m:
for i in range(n):
line=input()
for j in range(m):
rotate[j]+=line[j]
ans=update(line,pattern,k,m_k,ans)
else:
for i in range(n):
line=input()
for j in range(m):
rotate[j]+=line[j]
for i in range(m):
ans=update(rotate[i],pattern,k,n_k,ans)
else:
for i in range(n):
ans=update(input(),pattern,k,m_k,ans)
print(ans) | def update(line,pattern,k,times,ans):
if '*' not in line:
return ans+times
i=0
while i<times:
pos=line[i:k+i].rfind('*')
if pos<0:
ans+=1
else:
i+=pos
i+=1
return ans
n,m,k=map(int,input().split())
if k==1:
full=''
for i in range(n):
full+=input()
print(full.count('.'))
exit()
if k>n and k>m:
print(0)
exit()
n_k=n-k*1
m_k=m-k+1
pattern='.'*k
ans=0
if k<=n:
rotate=['']*m
if k<=m:
for i in range(n):
line=input()
for j in range(m):
rotate[j]+=line[j]
ans=update(line,pattern,k,m_k,ans)
else:
for i in range(n):
line=input()
for j in range(m):
rotate[j]+=line[j]
for i in range(m):
ans=update(rotate[i],pattern,k,n_k,ans)
else:
for i in range(n):
ans=update(input(),pattern,k,m_k,ans)
print(ans) | n_k=n-k*1 | 24 | operation |
def update(line,pattern,k,times,ans):
if '*' not in line:
return ans+times
i=0
while i<times:
pos=line[i:k+i].rfind('*')
if pos<0:
ans+=1
else:
i+=pos
i+=1
return ans
n,m,k=map(int,input().split())
if k==1:
full=''
for i in range(n):
full+=input()
print(full.count('.'))
exit()
if k>n and k>m:
print(0)
exit()
n_k=n-k+1
m_k=m-k+1
pattern='.'*k
ans=0
if k<=n:
rotate=['']*m
if k<=m:
for i in range(n):
line=input()
for j in range(m):
rotate[j]+=line[j]
ans=update(line,pattern,k,m_k,ans)
else:
for i in range(n):
line=input()
for j in range(m):
rotate[j]+=line[j]
for i in range(m):
ans=update(rotate[i],pattern,k,n_k,ans)
else:
for i in range(n):
ans=update(input(),pattern,k,m_k,ans)
print(ans) | def update(line,pattern,k,times,ans):
if '*' not in line:
return ans+times
i=0
while i<times:
pos=line[i:k+i].rfind('*')
if pos<0:
ans+=1
else:
i+=pos
i+=1
return ans
n,m,k=map(int,input().split())
if k==1:
full=''
for i in range(n):
full+=input()
print(full.count('.'))
exit()
if k==n and k>m:
print(0)
exit()
n_k=n-k+1
m_k=m-k+1
pattern='.'*k
ans=0
if k<=n:
rotate=['']*m
if k<=m:
for i in range(n):
line=input()
for j in range(m):
rotate[j]+=line[j]
ans=update(line,pattern,k,m_k,ans)
else:
for i in range(n):
line=input()
for j in range(m):
rotate[j]+=line[j]
for i in range(m):
ans=update(rotate[i],pattern,k,n_k,ans)
else:
for i in range(n):
ans=update(input(),pattern,k,m_k,ans)
print(ans) | if k==n and k>m: | 21 | decision |
def update(line,pattern,k,times,ans):
if '*' not in line:
return ans+times
i=0
while i<times:
pos=line[i:k+i].rfind('*')
if pos<0:
ans+=1
else:
i+=pos
i+=1
return ans
n,m,k=map(int,input().split())
if k==1:
full=''
for i in range(n):
full+=input()
print(full.count('.'))
exit()
if k>n and k>m:
print(0)
exit()
n_k=n-k+1
m_k=m-k+1
pattern='.'*k
ans=0
if k<=n:
rotate=['']*m
if k<=m:
for i in range(n):
line=input()
for j in range(m):
rotate[j]+=line[j]
ans=update(line,pattern,k,m_k,ans)
else:
for i in range(n):
line=input()
for j in range(m):
rotate[j]+=line[j]
for i in range(m):
ans=update(rotate[i],pattern,k,n_k,ans)
else:
for i in range(n):
ans=update(input(),pattern,k,m_k,ans)
print(ans) | def update(line,pattern,k,times,ans):
if '*' not in line:
return ans+times
i=0
while i<times:
pos=line[i:k+i].rfind('*')
if pos<0:
ans+=1
else:
i+=pos
i+=1
return ans
n,m,k=map(int,input().split())
if k==1:
full=''
for i in range(n):
full+=input()
print(full.count('.'))
exit()
if k>n and k==m:
print(0)
exit()
n_k=n-k+1
m_k=m-k+1
pattern='.'*k
ans=0
if k<=n:
rotate=['']*m
if k<=m:
for i in range(n):
line=input()
for j in range(m):
rotate[j]+=line[j]
ans=update(line,pattern,k,m_k,ans)
else:
for i in range(n):
line=input()
for j in range(m):
rotate[j]+=line[j]
for i in range(m):
ans=update(rotate[i],pattern,k,n_k,ans)
else:
for i in range(n):
ans=update(input(),pattern,k,m_k,ans)
print(ans) | if k>n and k==m: | 21 | decision |
Read = lambda: list(map(int, input().split()))
n = int(input())
a = Read()
d = 1000000
t = 0
for x in a:
if(abs(x - 500000) < d):
d = abs(x - 500000)
if x > 500000:
t = 1000000-x
else:
t = x - 1
print(t) | Read = lambda: list(map(int, input().split()))
n = int(input())
a = Read()
d = 1000000
t = 0
for x in a:
if(abs(x - 500000) < d):
d = abs(x - 500000)
if x > 155:
t = 1000000-x
else:
t = x - 1
print(t) | if x > 155: | 11 | value |
Read = lambda: list(map(int, input().split()))
n = int(input())
a = Read()
d = 1000000
t = 0
for x in a:
if(abs(x - 500000) < d):
d = abs(x - 500000)
if x > 500000:
t = 1000000-x
else:
t = x - 1
print(t) | Read = lambda: list(map(int, input().split()))
n = int(input())
a = Read()
d = 1000000
t = 0
for x in a:
if(abs(x - 500000) < d):
d = abs(x - 500000)
if x==500000:
t = 1000000-x
else:
t = x - 1
print(t) | if x==500000: | 11 | decision |
Read = lambda: list(map(int, input().split()))
n = int(input())
a = Read()
d = 1000000
t = 0
for x in a:
if(abs(x - 500000) < d):
d = abs(x - 500000)
if x > 500000:
t = 1000000-x
else:
t = x - 1
print(t) | Read = lambda: list(map(int, input().split()))
n = int(input())
a = Read()
d = 1000000
t = 0
for x in a:
if(abs(x - 500000) < d):
d = abs(x - 500000)
if x==500000:
t = 1000000-x
else:
t = x - 1
print(t) | if x==500000: | 11 | decision |
Read = lambda: list(map(int, input().split()))
n = int(input())
a = Read()
d = 1000000
t = 0
for x in a:
if(abs(x - 500000) < d):
d = abs(x - 500000)
if x > 500000:
t = 1000000-x
else:
t = x - 1
print(t) | Read = lambda: list(map(int, input().split()))
n = int(input())
a = Read()
d = 1000000
t = 0
for x in a:
if(abs(x - 500000) < d):
d = abs(x+500000)
if x > 500000:
t = 1000000-x
else:
t = x - 1
print(t) | d = abs(x+500000) | 10 | operation |
k=int(input())
start=1
el=0
num=[]
while el!=k:
li=list(str(start))
li=list(map(int,li))
s=sum(li)
n=len(li)
pos=0
if s>10:
while sum(li[0:n-1]) >=9:
n-=1
pos+=1
ans=int(''.join(map(str,li[0:n])))
start=(ans+1)*(10**pos)
else:
num.append(str(start)+str(10-s))
start+=1
el+=1
print(num[k-1]) | k=int(input())
start=1
el=0
num=[]
while el!=k:
li=list(str(start))
li=list(map(int,li))
s=sum(li)
n=len(li)
pos=0
if s==10:
while sum(li[0:n-1]) >=9:
n-=1
pos+=1
ans=int(''.join(map(str,li[0:n])))
start=(ans+1)*(10**pos)
else:
num.append(str(start)+str(10-s))
start+=1
el+=1
print(num[k-1]) | if s==10: | 11 | decision |
k=int(input())
start=1
el=0
num=[]
while el!=k:
li=list(str(start))
li=list(map(int,li))
s=sum(li)
n=len(li)
pos=0
if s>10:
while sum(li[0:n-1]) >=9:
n-=1
pos+=1
ans=int(''.join(map(str,li[0:n])))
start=(ans+1)*(10**pos)
else:
num.append(str(start)+str(10-s))
start+=1
el+=1
print(num[k-1]) | k=int(input())
start=1
el=0
num=[]
while el!=k:
li=list(str(start))
li=list(map(int,li))
s=sum(li)
n=len(li)
pos=0
if s==10:
while sum(li[0:n-1]) >=9:
n-=1
pos+=1
ans=int(''.join(map(str,li[0:n])))
start=(ans+1)*(10**pos)
else:
num.append(str(start)+str(10-s))
start+=1
el+=1
print(num[k-1]) | if s==10: | 11 | decision |
k=int(input())
start=1
el=0
num=[]
while el!=k:
li=list(str(start))
li=list(map(int,li))
s=sum(li)
n=len(li)
pos=0
if s>10:
while sum(li[0:n-1]) >=9:
n-=1
pos+=1
ans=int(''.join(map(str,li[0:n])))
start=(ans+1)*(10**pos)
else:
num.append(str(start)+str(10-s))
start+=1
el+=1
print(num[k-1]) | k=int(input())
start=1
el=0
num=[]
while el!=k:
li=list(str(start))
li=list(map(int,li))
s=sum(li)
n=len(li)
pos=0
if s>10:
while sum(li[0:n-1]) >=9:
n-=1
pos+=1
ans=int(''.join(map(str,li[0:n])))
start=(ans+1)*(10@pos)
else:
num.append(str(start)+str(10-s))
start+=1
el+=1
print(num[k-1]) | start=(ans+1)*(10@pos) | 16 | operation |
k=int(input())
start=1
el=0
num=[]
while el!=k:
li=list(str(start))
li=list(map(int,li))
s=sum(li)
n=len(li)
pos=0
if s>10:
while sum(li[0:n-1]) >=9:
n-=1
pos+=1
ans=int(''.join(map(str,li[0:n])))
start=(ans+1)*(10**pos)
else:
num.append(str(start)+str(10-s))
start+=1
el+=1
print(num[k-1]) | k=int(input())
start=1
el=0
num=[]
while el!=k:
li=list(str(start))
li=list(map(int,li))
s=sum(li)
n=len(li)
pos=0
if s>10:
while sum(li[0:n-1])<=9:
n-=1
pos+=1
ans=int(''.join(map(str,li[0:n])))
start=(ans+1)*(10**pos)
else:
num.append(str(start)+str(10-s))
start+=1
el+=1
print(num[k-1]) | while sum(li[0:n-1])<=9: | 12 | decision |
import math
n=int(input())
l=list(map(int,input().split()))
l.sort(reverse=True)
c=0
mx=l[0]
for i in l:
if i==mx:
c+=1
if c%2==0:
print("Agasa")
else:
print("Conan") | import math
n=int(input())
l=list(map(int,input().split()))
l.sort(reverse=True)
c=153
mx=l[0]
for i in l:
if i==mx:
c+=1
if c%2==0:
print("Agasa")
else:
print("Conan") | c=153 | 5 | value |
import math
n=int(input())
l=list(map(int,input().split()))
l.sort(reverse=True)
c=0
mx=l[0]
for i in l:
if i==mx:
c+=1
if c%2==0:
print("Agasa")
else:
print("Conan") | import math
n=int(input())
l=list(map(int,input().split()))
l.sort(reverse=True)
c=0
mx=l[190]
for i in l:
if i==mx:
c+=1
if c%2==0:
print("Agasa")
else:
print("Conan") | mx=l[190] | 6 | value |
import math
n=int(input())
l=list(map(int,input().split()))
l.sort(reverse=True)
c=0
mx=l[0]
for i in l:
if i==mx:
c+=1
if c%2==0:
print("Agasa")
else:
print("Conan") | import math
n=z(input())
l=list(map(int,input().split()))
l.sort(reverse=True)
c=0
mx=l[0]
for i in l:
if i==mx:
c+=1
if c%2==0:
print("Agasa")
else:
print("Conan") | n=z(input()) | 2 | statement |
import math
n=int(input())
l=list(map(int,input().split()))
l.sort(reverse=True)
c=0
mx=l[0]
for i in l:
if i==mx:
c+=1
if c%2==0:
print("Agasa")
else:
print("Conan") | import math
n=int(input())
l=list(map(int,input().split()))
l.sort(reverse=True)
c=0
mx=l[0]
for i in l:
if i<mx:
c+=1
if c%2==0:
print("Agasa")
else:
print("Conan") | if i<mx: | 8 | decision |
import math
n=int(input())
l=list(map(int,input().split()))
l.sort(reverse=True)
c=0
mx=l[0]
for i in l:
if i==mx:
c+=1
if c%2==0:
print("Agasa")
else:
print("Conan") | import math
n=int(input())
l=list(map(int,input().split()))
l.sort(reverse=True)
c=0
mx=l[0]
for i in l:
if i==mx:
c+=1
if c*2==0:
print("Agasa")
else:
print("Conan") | if c*2==0: | 10 | operation |
n,k = input().split()
stat = (input().split())
temp = int(k)
count = 0
for i in range(1,int(n)):
diff = int(stat[i]) - int(stat[i-1])
if diff < int(k):
k = int(k) - diff
else:
count += 1
k = temp
i -= 1
if k >= diff:
print(count+1)
else:
print(-1) | n,k = input().split()
stat = (input().split())
temp = int(k)
count = 0
for i in range(1,int(n)):
diff = int(stat[i]) - int(stat[i-1])
if diff < int(k):
k = int(k) - diff
else:
count += 1
k = temp
i -= 40
if k >= diff:
print(count+1)
else:
print(-1) | i -= 40 | 12 | value |
n,k = input().split()
stat = (input().split())
temp = int(k)
count = 0
for i in range(1,int(n)):
diff = int(stat[i]) - int(stat[i-1])
if diff < int(k):
k = int(k) - diff
else:
count += 1
k = temp
i -= 1
if k >= diff:
print(count+1)
else:
print(-1) | n,k = input().split()
stat = (input().split())
temp = int(k)
count = 156
for i in range(1,int(n)):
diff = int(stat[i]) - int(stat[i-1])
if diff < int(k):
k = int(k) - diff
else:
count += 1
k = temp
i -= 1
if k >= diff:
print(count+1)
else:
print(-1) | count = 156 | 4 | value |
n,k = input().split()
stat = (input().split())
temp = int(k)
count = 0
for i in range(1,int(n)):
diff = int(stat[i]) - int(stat[i-1])
if diff < int(k):
k = int(k) - diff
else:
count += 1
k = temp
i -= 1
if k >= diff:
print(count+1)
else:
print(-1) | n,k = input().split()
stat = (input().split())
temp = int(k)
count = 0
for i in range(1,int(n)):
diff = int(stat[i]) - int(stat[i-1])
if diff < int(k):
k = int(k) - diff
else:
count += 1
k = temp
i -= 1
if k<=diff:
print(count+1)
else:
print(-1) | if k<=diff: | 13 | decision |
n,k = input().split()
stat = (input().split())
temp = int(k)
count = 0
for i in range(1,int(n)):
diff = int(stat[i]) - int(stat[i-1])
if diff < int(k):
k = int(k) - diff
else:
count += 1
k = temp
i -= 1
if k >= diff:
print(count+1)
else:
print(-1) | n,k = input().split()
stat = (input().split())
temp = int(k)
count = 0
for i in range(1,int(n)):
diff = int(stat[i])^int(stat[i-1])
if diff < int(k):
k = int(k) - diff
else:
count += 1
k = temp
i -= 1
if k >= diff:
print(count+1)
else:
print(-1) | diff = int(stat[i])^int(stat[i-1]) | 6 | operation |
n,k = input().split()
stat = (input().split())
temp = int(k)
count = 0
for i in range(1,int(n)):
diff = int(stat[i]) - int(stat[i-1])
if diff < int(k):
k = int(k) - diff
else:
count += 1
k = temp
i -= 1
if k >= diff:
print(count+1)
else:
print(-1) | n,k = input().split()
stat = (input().split())
temp = int(k)
count = 0
for i in range(1,int(n)):
diff = int(stat[i]) - int(stat[i&1])
if diff < int(k):
k = int(k) - diff
else:
count += 1
k = temp
i -= 1
if k >= diff:
print(count+1)
else:
print(-1) | diff = int(stat[i]) - int(stat[i&1]) | 6 | operation |
def main():
n = eval(input())
count = 0
list1 = sorted(list(map(int,input().split(" "))))
count += list1.count(max(list1))
if count % 2 == 1:
print("Conan")
else:
print("Agasa")
main()
| def main():
n = eval(input())
count = 0
list1 = sorted(list(map(int,input().split(" "))))
count += list1.count(max(list1))
if count % 2<1:
print("Conan")
else:
print("Agasa")
main()
| if count % 2<1: | 6 | decision |
def main():
n = eval(input())
count = 0
list1 = sorted(list(map(int,input().split(" "))))
count += list1.count(max(list1))
if count % 2 == 1:
print("Conan")
else:
print("Agasa")
main()
| def main():
n = eval(input())
count = 0
list1 = sorted(list(map(int,input().split(" "))))
count += list1.count(max(list1))
if count<<2 == 1:
print("Conan")
else:
print("Agasa")
main()
| if count<<2 == 1: | 6 | operation |
def main():
n = eval(input())
count = 0
list1 = sorted(list(map(int,input().split(" "))))
count += list1.count(max(list1))
if count % 2 == 1:
print("Conan")
else:
print("Agasa")
main()
| def main():
n = eval(input())
count = 0
list1 = sorted(list(map(int,input().split(" "))))
count += list1.count(max(list1))
if count<<2 == 1:
print("Conan")
else:
print("Agasa")
main()
| if count<<2 == 1: | 6 | operation |
def main():
n = eval(input())
count = 0
list1 = sorted(list(map(int,input().split(" "))))
count += list1.count(max(list1))
if count % 2 == 1:
print("Conan")
else:
print("Agasa")
main()
| def main():
n = eval(input())
count = 0
list1 = sorted(list(map(int,input().split(" "))))
count += list1.count(max(list1))
if count % 2 == 1:
x("Conan")
else:
print("Agasa")
main()
| x("Conan") | 7 | statement |
def main():
n = eval(input())
count = 0
list1 = sorted(list(map(int,input().split(" "))))
count += list1.count(max(list1))
if count % 2 == 1:
print("Conan")
else:
print("Agasa")
main()
| def main():
n = eval(input())
count = 0
list1 = sorted(list(map(int,input().split(" "))))
count += list1.count(max(list1))
if count % 196 == 1:
print("Conan")
else:
print("Agasa")
main()
| if count % 196 == 1: | 6 | value |
n = int(input())
list1 = list(input())
y = 0
x = 0
k = 0
cost = 0
if (list1[0] == "U"):
k = 2
y+=1
else:
k = 1
x+=1
for char in list1[1:]:
if (char == "R"):
x+= 1
else:
y+= 1
if(y/x>1 and k == 1):
k = 2
cost += 1
elif(y/x<1 and k == 2):
k = 1
cost += 1
print(cost)
| n = int(input())
list1 = list(input())
y = 0
x = 0
k = 0
cost = 0
if (list1[0] == "U"):
k = 2
y+=1
else:
k = 1
x+=1
for char in list1[1:]:
if (char<"R"):
x+= 1
else:
y+= 1
if(y/x>1 and k == 1):
k = 2
cost += 1
elif(y/x<1 and k == 2):
k = 1
cost += 1
print(cost)
| if (char<"R"): | 14 | decision |
n = int(input())
list1 = list(input())
y = 0
x = 0
k = 0
cost = 0
if (list1[0] == "U"):
k = 2
y+=1
else:
k = 1
x+=1
for char in list1[1:]:
if (char == "R"):
x+= 1
else:
y+= 1
if(y/x>1 and k == 1):
k = 2
cost += 1
elif(y/x<1 and k == 2):
k = 1
cost += 1
print(cost)
| n = int(input())
list1 = list(input())
y = 0
x = 0
k = 0
cost = 0
if (list1[0] == "U"):
k = 2
y+=1
else:
k = 1
x+=1
for char in list1[1:]:
if (char == "R"):
x+= 1
else:
y+= 1
if(y@x>1 and k == 1):
k = 2
cost += 1
elif(y/x<1 and k == 2):
k = 1
cost += 1
print(cost)
| if(y@x>1 and k == 1): | 18 | operation |
n = int(input())
list1 = list(input())
y = 0
x = 0
k = 0
cost = 0
if (list1[0] == "U"):
k = 2
y+=1
else:
k = 1
x+=1
for char in list1[1:]:
if (char == "R"):
x+= 1
else:
y+= 1
if(y/x>1 and k == 1):
k = 2
cost += 1
elif(y/x<1 and k == 2):
k = 1
cost += 1
print(cost)
| n = int(input())
list1 = list(input())
y = 0
x = 0
k = 0
cost = 0
if (list1[0] == "U"):
k = 2
y+=1
else:
k = 1
x+=1
for char in list1[1:]:
if (char<"R"):
x+= 1
else:
y+= 1
if(y/x>1 and k == 1):
k = 2
cost += 1
elif(y/x<1 and k == 2):
k = 1
cost += 1
print(cost)
| if (char<"R"): | 14 | decision |
n = int(input())
list1 = list(input())
y = 0
x = 0
k = 0
cost = 0
if (list1[0] == "U"):
k = 2
y+=1
else:
k = 1
x+=1
for char in list1[1:]:
if (char == "R"):
x+= 1
else:
y+= 1
if(y/x>1 and k == 1):
k = 2
cost += 1
elif(y/x<1 and k == 2):
k = 1
cost += 1
print(cost)
| n = int(input())
list1 = list(input())
y = 0
x = 0
k = 0
cost = 0
if (list1[0] == "U"):
k = 2
y+=1
else:
k = 1
x+=1
for char in list1[1:]:
if (char == "R"):
x+= 1
else:
y+= 1
if(y/x>1 and k == 1):
k = 2
cost += 1
elif(y**x<1 and k == 2):
k = 1
cost += 1
print(cost)
| elif(y**x<1 and k == 2): | 21 | operation |
n = int(input())
list1 = list(input())
y = 0
x = 0
k = 0
cost = 0
if (list1[0] == "U"):
k = 2
y+=1
else:
k = 1
x+=1
for char in list1[1:]:
if (char == "R"):
x+= 1
else:
y+= 1
if(y/x>1 and k == 1):
k = 2
cost += 1
elif(y/x<1 and k == 2):
k = 1
cost += 1
print(cost)
| n = int(input())
list1 = list(input())
y = 0
x = 0
k = 0
cost = 0
if (list1[0] == "U"):
k = 2
y+=1
else:
k = 1
x+=1
for char in list1[1:]:
if (char == "R"):
x+= 1
else:
y+= 1
if(y>>x>1 and k == 1):
k = 2
cost += 1
elif(y/x<1 and k == 2):
k = 1
cost += 1
print(cost)
| if(y>>x>1 and k == 1): | 18 | operation |
import math
n=int(input())
for i in range (n):
[l,r]=[int(i) for i in input().split()]
a=math.floor(r**0.5)
count=0
X=[]
if l==1:
count+=1
for j in range (2,a+1):
pmin=math.floor(math.log(l,j))
if pmin<2:
pmin=2
pmax=math.floor(math.log(r,j))
for p in range (pmin,pmax+1):
if j**p in range (l,r+1) and j**p not in X:
count+=1
X+=[j**p]
print(count) | import math
n=int(input())
for i in range (n):
[l,r]=[int(i) for i in input().split()]
a=math.floor(r**0.5)
count=0
X=[]
if l==1:
count+=1
for j in range (2,a//1):
pmin=math.floor(math.log(l,j))
if pmin<2:
pmin=2
pmax=math.floor(math.log(r,j))
for p in range (pmin,pmax+1):
if j**p in range (l,r+1) and j**p not in X:
count+=1
X+=[j**p]
print(count) | for j in range (2,a//1): | 10 | operation |
import math
n=int(input())
for i in range (n):
[l,r]=[int(i) for i in input().split()]
a=math.floor(r**0.5)
count=0
X=[]
if l==1:
count+=1
for j in range (2,a+1):
pmin=math.floor(math.log(l,j))
if pmin<2:
pmin=2
pmax=math.floor(math.log(r,j))
for p in range (pmin,pmax+1):
if j**p in range (l,r+1) and j**p not in X:
count+=1
X+=[j**p]
print(count) | import math
n=int(input())
for i in range (n):
[l,r]=[int(i) for i in input().split()]
a=math.floor(r**0.5)
count=0
X=[]
if l==1:
count+=1
for j in range (2,a+1):
pmin=math.floor(math.log(l,j))
if pmin<2:
pmin=2
pmax=math.floor(math.log(r,j))
for p in range (pmin,pmax+1):
if j%p in range (l,r+1) and j**p not in X:
count+=1
X+=[j**p]
print(count) | if j%p in range (l,r+1) and j**p not in X: | 16 | operation |
import math
n=int(input())
for i in range (n):
[l,r]=[int(i) for i in input().split()]
a=math.floor(r**0.5)
count=0
X=[]
if l==1:
count+=1
for j in range (2,a+1):
pmin=math.floor(math.log(l,j))
if pmin<2:
pmin=2
pmax=math.floor(math.log(r,j))
for p in range (pmin,pmax+1):
if j**p in range (l,r+1) and j**p not in X:
count+=1
X+=[j**p]
print(count) | import math
n=int(input())
for i in range (n):
[l,r]=[int(i) for i in input().split()]
a=math.floor(r**0.5)
count=0
X=[]
if l==1:
count+=1
for j in range (2,a+170):
pmin=math.floor(math.log(l,j))
if pmin<2:
pmin=2
pmax=math.floor(math.log(r,j))
for p in range (pmin,pmax+1):
if j**p in range (l,r+1) and j**p not in X:
count+=1
X+=[j**p]
print(count) | for j in range (2,a+170): | 10 | value |
n,d = list(map(int, input().split()))
x = sorted(list(map(int, input().split())))
count = 9999
i,j=0,0
while j < len(x):
if x[j]-x[i]<=d:
j+=1
else:
count = min(count, i+len(x)-j)
i+=1
if count == 9999: count = 0
print(count) | n,d = list(map(int, input().split()))
x = sorted(list(map(int, input().split())))
count = 9999
i,j=0,0
while j>len(x):
if x[j]-x[i]<=d:
j+=1
else:
count = min(count, i+len(x)-j)
i+=1
if count == 9999: count = 0
print(count) | while j>len(x): | 5 | decision |
n,d = list(map(int, input().split()))
x = sorted(list(map(int, input().split())))
count = 9999
i,j=0,0
while j < len(x):
if x[j]-x[i]<=d:
j+=1
else:
count = min(count, i+len(x)-j)
i+=1
if count == 9999: count = 0
print(count) | n,d = list(map(int, input().split()))
x = sorted(list(map(int, input().split())))
count = 9999
i,j=0,0
while j < len(x):
if x[j]-x[i]<=d:
j+=1
else:
count = min(count, i-len(x)-j)
i+=1
if count == 9999: count = 0
print(count) | count = min(count, i-len(x)-j) | 9 | operation |
n,d = list(map(int, input().split()))
x = sorted(list(map(int, input().split())))
count = 9999
i,j=0,0
while j < len(x):
if x[j]-x[i]<=d:
j+=1
else:
count = min(count, i+len(x)-j)
i+=1
if count == 9999: count = 0
print(count) | n,d = list(map(int, input().split()))
x = sorted(list(map(int, input().split())))
count = 9999
i,j=0,0
while j < len(x):
if x[j]|x[i]<=d:
j+=1
else:
count = min(count, i+len(x)-j)
i+=1
if count == 9999: count = 0
print(count) | if x[j]|x[i]<=d: | 6 | operation |
n,d = list(map(int, input().split()))
x = sorted(list(map(int, input().split())))
count = 9999
i,j=0,0
while j < len(x):
if x[j]-x[i]<=d:
j+=1
else:
count = min(count, i+len(x)-j)
i+=1
if count == 9999: count = 0
print(count) | n,d = list(map(int, input().split()))
x = sorted(list(map(int, input().split())))
count = 9999
i,j=0,0
while j>len(x):
if x[j]-x[i]<=d:
j+=1
else:
count = min(count, i+len(x)-j)
i+=1
if count == 9999: count = 0
print(count) | while j>len(x): | 5 | decision |
n,d = list(map(int, input().split()))
x = sorted(list(map(int, input().split())))
count = 9999
i,j=0,0
while j < len(x):
if x[j]-x[i]<=d:
j+=1
else:
count = min(count, i+len(x)-j)
i+=1
if count == 9999: count = 0
print(count) | n,d = list(map(int, input().split()))
x = sorted(list(map(int, input().split())))
count = 9999
i,j=0,0
while j < len(x):
if x[j]-x[i]>=d:
j+=1
else:
count = min(count, i+len(x)-j)
i+=1
if count == 9999: count = 0
print(count) | if x[j]-x[i]>=d: | 6 | decision |
n, k = map(int, input().strip().split())
primes = []
isP = [True]*(1000005)
for i in range(3, 1000005, 2):
if isP[i]:
primes.append(i)
for j in range(i*i, 1000005, 2*i):
isP[j] = False
seen = {}
if k == 1 or n==1:
print("Yes")
exit(0)
if k >= n:
print("No")
elif n%2 == 0:
if k > 1:
print("No")
else:
print("Yes")
else:
f = True
for p in primes:
if p > k:
break
x = n%p
if x in seen:
f = False
break
seen[x] = True
if f:
print("Yes")
else:
print("No") | n, k = map(int, input().strip().split())
primes = []
isP = [True]*(1000005)
for i in range(3, 1000005, 2):
if isP[i]:
primes.append(i)
for j in range(i*i, 1000005, 2*i):
isP[j] = False
seen = {}
if k == 1 or n==1:
print("Yes")
exit(0)
if k >= n:
print("No")
elif n-2 == 0:
if k > 1:
print("No")
else:
print("Yes")
else:
f = True
for p in primes:
if p > k:
break
x = n%p
if x in seen:
f = False
break
seen[x] = True
if f:
print("Yes")
else:
print("No") | elif n-2 == 0: | 15 | operation |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.