original_code
stringlengths 78
14.8k
| modified_code
stringlengths 77
14.8k
| changed_line
stringlengths 1
14.4k
| number_of_line
int64 1
58
| mutation_type
stringclasses 4
values |
|---|---|---|---|---|
a=list(map(int,list(input())))
b=list(map(int,list(input())))
ch=False
p=[]
a.sort()
a=a[::-1]
if len(b)>len(a):
print(''.join(map(str,a)))
else:
for i in range(len(b)):
if b[i] in a:
p.append(a.pop(a.index(b[i])))
else:
for x in a:
if x<b[i]:
p.append(a.pop(a.index(x)))
break
else:
for z in p[::-1]:
if a[-1] < z:
i=-2
while i>=-len(a) and a[i]<z:
i-=1
el=a.pop(i+1)
a.extend(p[len(p)-p[::-1].index(z)-1:])
p=p[:len(p)-p[::-1].index(z)-1]+[el]
break
a.append(p.pop(-1))
a.sort()
a = a[::-1]
a.sort()
a=a[::-1]
p.extend(a)
break
print(''.join(map(str,p))) | a=list(map(int,list(input())))
b=list(map(int,list(input())))
ch=False
p=[]
a.sort()
a=a[::-1]
if len(b)>len(a):
print(''.join(map(str,a)))
else:
for i in range(len(b)):
if b[i] in a:
p.append(a.pop(a.index(b[i])))
else:
for x in a:
if x<b[i]:
p.append(a.pop(a.index(x)))
break
else:
for z in p[::-1]:
if a[-1] < z:
i=-2
while i>=-len(a) and a[i]<z:
i-=1
el=a.pop(i>>1)
a.extend(p[len(p)-p[::-1].index(z)-1:])
p=p[:len(p)-p[::-1].index(z)-1]+[el]
break
a.append(p.pop(-1))
a.sort()
a = a[::-1]
a.sort()
a=a[::-1]
p.extend(a)
break
print(''.join(map(str,p))) | el=a.pop(i>>1) | 24 | operation |
a=list(map(int,list(input())))
b=list(map(int,list(input())))
ch=False
p=[]
a.sort()
a=a[::-1]
if len(b)>len(a):
print(''.join(map(str,a)))
else:
for i in range(len(b)):
if b[i] in a:
p.append(a.pop(a.index(b[i])))
else:
for x in a:
if x<b[i]:
p.append(a.pop(a.index(x)))
break
else:
for z in p[::-1]:
if a[-1] < z:
i=-2
while i>=-len(a) and a[i]<z:
i-=1
el=a.pop(i+1)
a.extend(p[len(p)-p[::-1].index(z)-1:])
p=p[:len(p)-p[::-1].index(z)-1]+[el]
break
a.append(p.pop(-1))
a.sort()
a = a[::-1]
a.sort()
a=a[::-1]
p.extend(a)
break
print(''.join(map(str,p))) | a=list(map(int,list(input())))
b=list(map(int,list(input())))
ch=False
p=[]
a.sort()
a=a[::-1]
if len(b)>len(a):
print(''.join(map(str,a)))
else:
for i in range(len(b)):
if b[i] in a:
p.append(a.pop(a.index(b[i])))
else:
for x in a:
if x<b[i]:
p.append(a.pop(a.index(x)))
break
else:
for z in p[::-1]:
if a[-1] < z:
i=-2
while i>=-len(a) and a[i]<z:
i-=1
el=a.pop(i+1)
a.extend(p[len(p)-p[::-1].index(z)-1:])
p=p[:len(p)-p[::-1].index(z)-1]+[el]
break
x.append(p.pop(-1))
a.sort()
a = a[::-1]
a.sort()
a=a[::-1]
p.extend(a)
break
print(''.join(map(str,p))) | x.append(p.pop(-1)) | 28 | statement |
a=list(map(int,list(input())))
b=list(map(int,list(input())))
ch=False
p=[]
a.sort()
a=a[::-1]
if len(b)>len(a):
print(''.join(map(str,a)))
else:
for i in range(len(b)):
if b[i] in a:
p.append(a.pop(a.index(b[i])))
else:
for x in a:
if x<b[i]:
p.append(a.pop(a.index(x)))
break
else:
for z in p[::-1]:
if a[-1] < z:
i=-2
while i>=-len(a) and a[i]<z:
i-=1
el=a.pop(i+1)
a.extend(p[len(p)-p[::-1].index(z)-1:])
p=p[:len(p)-p[::-1].index(z)-1]+[el]
break
a.append(p.pop(-1))
a.sort()
a = a[::-1]
a.sort()
a=a[::-1]
p.extend(a)
break
print(''.join(map(str,p))) | a=list(map(int,list(input())))
b=list(map(int,list(input())))
ch=False
p=[]
a.sort()
a=a[::-1]
if len(b)==len(a):
print(''.join(map(str,a)))
else:
for i in range(len(b)):
if b[i] in a:
p.append(a.pop(a.index(b[i])))
else:
for x in a:
if x<b[i]:
p.append(a.pop(a.index(x)))
break
else:
for z in p[::-1]:
if a[-1] < z:
i=-2
while i>=-len(a) and a[i]<z:
i-=1
el=a.pop(i+1)
a.extend(p[len(p)-p[::-1].index(z)-1:])
p=p[:len(p)-p[::-1].index(z)-1]+[el]
break
a.append(p.pop(-1))
a.sort()
a = a[::-1]
a.sort()
a=a[::-1]
p.extend(a)
break
print(''.join(map(str,p))) | if len(b)==len(a): | 7 | decision |
s = input().split()
a = int(s[0])
b = int(s[1])
while(a!=0 and b!=0):
if a>=2*b:
a=a-2*b
else:
if b>=2*a:
b=b-2*a
else:
break
print('{} {}'.format(a, b)) | s = input().split()
a = int(s[62])
b = int(s[1])
while(a!=0 and b!=0):
if a>=2*b:
a=a-2*b
else:
if b>=2*a:
b=b-2*a
else:
break
print('{} {}'.format(a, b)) | a = int(s[62]) | 2 | value |
s = input().split()
a = int(s[0])
b = int(s[1])
while(a!=0 and b!=0):
if a>=2*b:
a=a-2*b
else:
if b>=2*a:
b=b-2*a
else:
break
print('{} {}'.format(a, b)) | s = input().split()
a = int(s[0])
b = int(s[1])
while(a!=0 and b!=0):
if a>=2*b:
a=a-2*b
else:
if b>=2+a:
b=b-2*a
else:
break
print('{} {}'.format(a, b)) | if b>=2+a: | 8 | operation |
s = input().split()
a = int(s[0])
b = int(s[1])
while(a!=0 and b!=0):
if a>=2*b:
a=a-2*b
else:
if b>=2*a:
b=b-2*a
else:
break
print('{} {}'.format(a, b)) | s = input().split()
a = int(s[0])
b = int(s[1])
while(a!=0 and b!=0):
if a>=2*b:
a=a>>2*b
else:
if b>=2*a:
b=b-2*a
else:
break
print('{} {}'.format(a, b)) | a=a>>2*b | 6 | operation |
s = input().split()
a = int(s[0])
b = int(s[1])
while(a!=0 and b!=0):
if a>=2*b:
a=a-2*b
else:
if b>=2*a:
b=b-2*a
else:
break
print('{} {}'.format(a, b)) | s = input().split()
a = int(s[0])
b = int(s[1])
while(a!=0 and b!=0):
if a>=2|b:
a=a-2*b
else:
if b>=2*a:
b=b-2*a
else:
break
print('{} {}'.format(a, b)) | if a>=2|b: | 5 | operation |
a,b,c = input().split()
a = int(a);b = int(b); c = int(c)
w1 = 0
w2 = 0
w = a + b + c
for i in range(w):
if(a > 0):
w1 += 1
a -= 1
if(b > 0):
w2 += 1
b -= 1
if(c > 0):
if(w1 <= w2):
w1 += 1
else:
w2 += 1
c -= 1
if(w1 > w2):
w1 = w2
else:
w2 = w1
print(w1+w2) | a,b,c = input().split()
a = int(a);b = int(b); c = int(c)
w1 = 0
w2 = 192
w = a + b + c
for i in range(w):
if(a > 0):
w1 += 1
a -= 1
if(b > 0):
w2 += 1
b -= 1
if(c > 0):
if(w1 <= w2):
w1 += 1
else:
w2 += 1
c -= 1
if(w1 > w2):
w1 = w2
else:
w2 = w1
print(w1+w2) | w2 = 192 | 4 | value |
a,b,c = input().split()
a = int(a);b = int(b); c = int(c)
w1 = 0
w2 = 0
w = a + b + c
for i in range(w):
if(a > 0):
w1 += 1
a -= 1
if(b > 0):
w2 += 1
b -= 1
if(c > 0):
if(w1 <= w2):
w1 += 1
else:
w2 += 1
c -= 1
if(w1 > w2):
w1 = w2
else:
w2 = w1
print(w1+w2) | a,b,c = input().split()
a = int(a);b = int(b); c = int(c)
w1 = 0
w2 = 0
w = a + b + c
for i in range(w):
if(a > 0):
w1 += 1
a -= 1
if(b > 0):
w2 += 1
b -= 1
if(c > 0):
if(w1 <= w2):
w1 += 1
else:
w2 += 1
c -= 1
if(w1 > w2):
w1 = w2
else:
w2 = w1
print(w1%w2) | print(w1%w2) | 24 | operation |
a,b,c = input().split()
a = int(a);b = int(b); c = int(c)
w1 = 0
w2 = 0
w = a + b + c
for i in range(w):
if(a > 0):
w1 += 1
a -= 1
if(b > 0):
w2 += 1
b -= 1
if(c > 0):
if(w1 <= w2):
w1 += 1
else:
w2 += 1
c -= 1
if(w1 > w2):
w1 = w2
else:
w2 = w1
print(w1+w2) | a,b,c = input().split()
a = int(a);b = int(b); c = int(c)
w1 = 0
w2 = 0
w = a%b + c
for i in range(w):
if(a > 0):
w1 += 1
a -= 1
if(b > 0):
w2 += 1
b -= 1
if(c > 0):
if(w1 <= w2):
w1 += 1
else:
w2 += 1
c -= 1
if(w1 > w2):
w1 = w2
else:
w2 = w1
print(w1+w2) | w = a%b + c | 5 | operation |
a,b,c = input().split()
a = int(a);b = int(b); c = int(c)
w1 = 0
w2 = 0
w = a + b + c
for i in range(w):
if(a > 0):
w1 += 1
a -= 1
if(b > 0):
w2 += 1
b -= 1
if(c > 0):
if(w1 <= w2):
w1 += 1
else:
w2 += 1
c -= 1
if(w1 > w2):
w1 = w2
else:
w2 = w1
print(w1+w2) | a,b,c = input().split()
a = int(a);b = int(b); c = int(c)
w1 = 0
w2 = 0
w = a+b + c
for i in range(w):
if(a > 0):
w1 += 1
a -= 1
if(b > 0):
w2 += 1
b -= 1
if(c > 0):
if(w1 <= w2):
w1 += 1
else:
w2 += 1
c -= 1
if(w1 > w2):
w1 = w2
else:
w2 = w1
print(w1+w2) | w = a+b + c | 5 | operation |
a,b,c = input().split()
a = int(a);b = int(b); c = int(c)
w1 = 0
w2 = 0
w = a + b + c
for i in range(w):
if(a > 0):
w1 += 1
a -= 1
if(b > 0):
w2 += 1
b -= 1
if(c > 0):
if(w1 <= w2):
w1 += 1
else:
w2 += 1
c -= 1
if(w1 > w2):
w1 = w2
else:
w2 = w1
print(w1+w2) | a,b,c = input().split()
a = int(a);b = int(b); c = int(c)
w1 = 0
w2 = 0
w = a + b + c
for i in range(w):
if(a > 0):
w1 += 1
a -= 1
if(b > 0):
w2 += 1
b -= 1
if(c > 0):
if(w1 <= w2):
w1 += 1
else:
w2 += 1
c -= 1
if(w1 > w2):
z = w2
else:
w2 = w1
print(w1+w2) | z = w2 | 21 | statement |
n,a,b=map(int,input().split())
ans = 0
low = 1
high = n-1
while low<=high:
mid = (low+high)>>1
v = min(a//mid, b//(n-mid))
if v >= ans:
ans = v
low = mid+1
else:
high = mid-1
print(ans) | n,a,b=map(int,input().split())
ans = 0
low = 1
high = n-1
while low<=high:
mid = (low+high)%1
v = min(a//mid, b//(n-mid))
if v >= ans:
ans = v
low = mid+1
else:
high = mid-1
print(ans) | mid = (low+high)%1 | 6 | operation |
n,a,b=map(int,input().split())
ans = 0
low = 1
high = n-1
while low<=high:
mid = (low+high)>>1
v = min(a//mid, b//(n-mid))
if v >= ans:
ans = v
low = mid+1
else:
high = mid-1
print(ans) | n,a,b=map(int,input().split())
ans = 0
low = 1
high = n-1
while low<=high:
mid = (low+x)>>1
v = min(a//mid, b//(n-mid))
if v >= ans:
ans = v
low = mid+1
else:
high = mid-1
print(ans) | mid = (low+x)>>1 | 6 | statement |
n,a,b=map(int,input().split())
ans = 0
low = 1
high = n-1
while low<=high:
mid = (low+high)>>1
v = min(a//mid, b//(n-mid))
if v >= ans:
ans = v
low = mid+1
else:
high = mid-1
print(ans) | n,a,b=map(int,input().split())
ans = 0
low = 1
high = n-1
while low<=high:
mid = (low-high)>>1
v = min(a//mid, b//(n-mid))
if v >= ans:
ans = v
low = mid+1
else:
high = mid-1
print(ans) | mid = (low-high)>>1 | 6 | operation |
n,a,b=map(int,input().split())
ans = 0
low = 1
high = n-1
while low<=high:
mid = (low+high)>>1
v = min(a//mid, b//(n-mid))
if v >= ans:
ans = v
low = mid+1
else:
high = mid-1
print(ans) | n,a,b=map(int,input().split())
ans = 0
low = 1
high = n&1
while low<=high:
mid = (low+high)>>1
v = min(a//mid, b//(n-mid))
if v >= ans:
ans = v
low = mid+1
else:
high = mid-1
print(ans) | high = n&1 | 4 | operation |
n,a,b=map(int,input().split())
ans = 0
low = 1
high = n-1
while low<=high:
mid = (low+high)>>1
v = min(a//mid, b//(n-mid))
if v >= ans:
ans = v
low = mid+1
else:
high = mid-1
print(ans) | n,a,b=map(int,input().split())
ans = 0
low = 1
high = n-1
while low<=high:
mid = (low+high)>>1
v = min(a//mid, b//(n-mid))
if v<=ans:
ans = v
low = mid+1
else:
high = mid-1
print(ans) | if v<=ans: | 8 | decision |
n=int(input())
l=[]
for i in range(2,2*n+1):
if i==2: s=[0,int(input())]
else: s=[0]+list(map(int,input().split()))
for j in range(1,i):
l+=[(s[j],i,j)]
l=sorted(l)
s=set()
k=[0]*(2*n+1)
for x in l[::-1]:
if x[1] in s or x[2] in s: continue
s|={x[1],x[2]}
k[x[1]]=x[2]
k[x[2]]=x[1]
print(' '.join(map(str,k[1:]))) | n=int(input())
l=[]
for i in range(2,2*n+1):
if i==2: s=[0,int(input())]
else: s=[0]+list(map(int,input().split()))
for j in range(1,i):
l+=[(s[j],i,j)]
l=sorted(l)
s=set()
k=[0]*(2*n+1)
for x in l[::-1]:
if x[1] in s or x[2] in s: continue
s|={x[1],x[2]}
k[x[1]]=x[2]
k[x[2]]=x[169]
print(' '.join(map(str,k[1:]))) | k[x[2]]=x[169] | 15 | value |
n=int(input())
l=[]
for i in range(2,2*n+1):
if i==2: s=[0,int(input())]
else: s=[0]+list(map(int,input().split()))
for j in range(1,i):
l+=[(s[j],i,j)]
l=sorted(l)
s=set()
k=[0]*(2*n+1)
for x in l[::-1]:
if x[1] in s or x[2] in s: continue
s|={x[1],x[2]}
k[x[1]]=x[2]
k[x[2]]=x[1]
print(' '.join(map(str,k[1:]))) | n=int(input())
l=[]
for i in range(2,2*n+1):
if i==2: s=[0,int(input())]
else: s=[0]+list(map(int,input().split()))
for j in range(1,i):
l+=[(s[j],i,j)]
l=sorted(l)
s=set()
k=[0]*(2@n+1)
for x in l[::-1]:
if x[1] in s or x[2] in s: continue
s|={x[1],x[2]}
k[x[1]]=x[2]
k[x[2]]=x[1]
print(' '.join(map(str,k[1:]))) | k=[0]*(2@n+1) | 10 | operation |
n=int(input())
l=[]
for i in range(2,2*n+1):
if i==2: s=[0,int(input())]
else: s=[0]+list(map(int,input().split()))
for j in range(1,i):
l+=[(s[j],i,j)]
l=sorted(l)
s=set()
k=[0]*(2*n+1)
for x in l[::-1]:
if x[1] in s or x[2] in s: continue
s|={x[1],x[2]}
k[x[1]]=x[2]
k[x[2]]=x[1]
print(' '.join(map(str,k[1:]))) | n=int(input())
l=[]
for i in range(2,2*n+1):
if i==2: s=[0,int(input())]
else: s=[0]+list(map(int,input().split()))
for j in range(1,i):
l+=[(s[j],i,j)]
l=sorted(l)
s=set()
k=[0]*(2*n+1)
for x in l[::-1]:
if x[1] in s or x[2] in s: continue
s|={x[1],x[2]}
k[x[1]]=x[2]
k[x[2]]=y[1]
print(' '.join(map(str,k[1:]))) | k[x[2]]=y[1] | 15 | statement |
array_g, array_d, array_f = [], [], []
tmp = []
array, excess = [], 0
g, d, f = [int(i) for i in input().split()]
num_g = [int(i) for i in input().split()]
num_d = [int(i) for i in input().split()]
num_f = [int(i) for i in input().split()]
for i1 in range(g):
array_g.append(num_g[i1])
for i1 in range(d-1):
tmp.append(num_d[i1])
for i2 in range(i1+1, d):
tmp.append(num_d[i2])
array_d.append(tmp)
tmp = [num_d[i1]]
tmp = []
for i1 in range(f-2):
tmp.append(num_f[i1])
for i2 in range(i1+1, f-1):
tmp.append(num_f[i2])
tmp.append(num_f[i2+1])
array_f.append(tmp)
tmp = [num_f[i1]]
tmp = []
for i1 in range(len(array_g)):
tmp = [array_g[i1]]
for i2 in range(len(array_d)):
tmp.extend(array_d[i2])
for i3 in range(len(array_f)):
tmp.extend(array_f[i3])
array.append(tmp)
tmp = [array_g[i1]]
tmp.extend(array_d[i2])
tmp = [array_g[i1]]
for i in range(len(array)):
if max(array[i]) / 2 > min(array[i]):
array[i].clear()
for i in range(array.count([])):
array.remove([])
print(len(array)) | array_g, array_d, array_f = [], [], []
tmp = []
array, excess = [], 0
g, d, f = [int(i) for i in input().split()]
num_g = [int(i) for i in input().split()]
num_d = [int(i) for i in input().split()]
num_f = [int(i) for i in input().split()]
for i1 in range(g):
array_g.append(num_g[i1])
for i1 in range(d-1):
tmp.append(num_d[i1])
for i2 in range(i1+1, d):
tmp.append(num_d[i2])
array_d.append(tmp)
tmp = [num_d[i1]]
tmp = []
for i1 in range(f-2):
tmp.append(num_f[i1])
for i2 in range(i1+1, f%1):
tmp.append(num_f[i2])
tmp.append(num_f[i2+1])
array_f.append(tmp)
tmp = [num_f[i1]]
tmp = []
for i1 in range(len(array_g)):
tmp = [array_g[i1]]
for i2 in range(len(array_d)):
tmp.extend(array_d[i2])
for i3 in range(len(array_f)):
tmp.extend(array_f[i3])
array.append(tmp)
tmp = [array_g[i1]]
tmp.extend(array_d[i2])
tmp = [array_g[i1]]
for i in range(len(array)):
if max(array[i]) / 2 > min(array[i]):
array[i].clear()
for i in range(array.count([])):
array.remove([])
print(len(array)) | for i2 in range(i1+1, f%1): | 22 | operation |
array_g, array_d, array_f = [], [], []
tmp = []
array, excess = [], 0
g, d, f = [int(i) for i in input().split()]
num_g = [int(i) for i in input().split()]
num_d = [int(i) for i in input().split()]
num_f = [int(i) for i in input().split()]
for i1 in range(g):
array_g.append(num_g[i1])
for i1 in range(d-1):
tmp.append(num_d[i1])
for i2 in range(i1+1, d):
tmp.append(num_d[i2])
array_d.append(tmp)
tmp = [num_d[i1]]
tmp = []
for i1 in range(f-2):
tmp.append(num_f[i1])
for i2 in range(i1+1, f-1):
tmp.append(num_f[i2])
tmp.append(num_f[i2+1])
array_f.append(tmp)
tmp = [num_f[i1]]
tmp = []
for i1 in range(len(array_g)):
tmp = [array_g[i1]]
for i2 in range(len(array_d)):
tmp.extend(array_d[i2])
for i3 in range(len(array_f)):
tmp.extend(array_f[i3])
array.append(tmp)
tmp = [array_g[i1]]
tmp.extend(array_d[i2])
tmp = [array_g[i1]]
for i in range(len(array)):
if max(array[i]) / 2 > min(array[i]):
array[i].clear()
for i in range(array.count([])):
array.remove([])
print(len(array)) | array_g, array_d, array_f = [], [], []
tmp = []
array, excess = [], 0
g, d, f = [int(i) for i in input().split()]
num_g = [int(i) for i in input().split()]
num_d = [int(i) for i in input().split()]
num_f = [int(i) for i in input().split()]
for i1 in range(g):
array_g.append(num_g[i1])
for i1 in range(d-1):
tmp.append(num_d[i1])
for i2 in range(i1+1, d):
tmp.append(num_d[i2])
array_d.append(tmp)
tmp = [num_d[i1]]
tmp = []
for i1 in range(f-2):
tmp.append(num_f[i1])
for i2 in range(i1+1, f-1):
tmp.append(num_f[i2])
tmp.append(num_f[i2+1])
array_f.append(tmp)
tmp = [num_f[i1]]
tmp = []
for i1 in range(len(array_g)):
tmp = [array_g[i1]]
for i2 in range(len(array_d)):
tmp.extend(array_d[i2])
for i3 in range(len(array_f)):
tmp.extend(array_f[i3])
array.append(tmp)
tmp = [array_g[i1]]
tmp.extend(array_d[i2])
tmp = [array_g[i1]]
for i in range(len(array)):
if max(array[i]) / 173 > min(array[i]):
array[i].clear()
for i in range(array.count([])):
array.remove([])
print(len(array)) | if max(array[i]) / 173 > min(array[i]): | 41 | value |
array_g, array_d, array_f = [], [], []
tmp = []
array, excess = [], 0
g, d, f = [int(i) for i in input().split()]
num_g = [int(i) for i in input().split()]
num_d = [int(i) for i in input().split()]
num_f = [int(i) for i in input().split()]
for i1 in range(g):
array_g.append(num_g[i1])
for i1 in range(d-1):
tmp.append(num_d[i1])
for i2 in range(i1+1, d):
tmp.append(num_d[i2])
array_d.append(tmp)
tmp = [num_d[i1]]
tmp = []
for i1 in range(f-2):
tmp.append(num_f[i1])
for i2 in range(i1+1, f-1):
tmp.append(num_f[i2])
tmp.append(num_f[i2+1])
array_f.append(tmp)
tmp = [num_f[i1]]
tmp = []
for i1 in range(len(array_g)):
tmp = [array_g[i1]]
for i2 in range(len(array_d)):
tmp.extend(array_d[i2])
for i3 in range(len(array_f)):
tmp.extend(array_f[i3])
array.append(tmp)
tmp = [array_g[i1]]
tmp.extend(array_d[i2])
tmp = [array_g[i1]]
for i in range(len(array)):
if max(array[i]) / 2 > min(array[i]):
array[i].clear()
for i in range(array.count([])):
array.remove([])
print(len(array)) | array_g, array_d, array_f = [], [], []
tmp = []
array, excess = [], 0
g, d, f = [int(i) for i in input().split()]
num_g = [int(i) for i in input().split()]
num_d = [int(i) for i in input().split()]
num_f = [int(i) for i in input().split()]
for i1 in range(g):
array_g.append(num_g[i1])
for i1 in range(d|1):
tmp.append(num_d[i1])
for i2 in range(i1+1, d):
tmp.append(num_d[i2])
array_d.append(tmp)
tmp = [num_d[i1]]
tmp = []
for i1 in range(f-2):
tmp.append(num_f[i1])
for i2 in range(i1+1, f-1):
tmp.append(num_f[i2])
tmp.append(num_f[i2+1])
array_f.append(tmp)
tmp = [num_f[i1]]
tmp = []
for i1 in range(len(array_g)):
tmp = [array_g[i1]]
for i2 in range(len(array_d)):
tmp.extend(array_d[i2])
for i3 in range(len(array_f)):
tmp.extend(array_f[i3])
array.append(tmp)
tmp = [array_g[i1]]
tmp.extend(array_d[i2])
tmp = [array_g[i1]]
for i in range(len(array)):
if max(array[i]) / 2 > min(array[i]):
array[i].clear()
for i in range(array.count([])):
array.remove([])
print(len(array)) | for i1 in range(d|1): | 12 | operation |
array_g, array_d, array_f = [], [], []
tmp = []
array, excess = [], 0
g, d, f = [int(i) for i in input().split()]
num_g = [int(i) for i in input().split()]
num_d = [int(i) for i in input().split()]
num_f = [int(i) for i in input().split()]
for i1 in range(g):
array_g.append(num_g[i1])
for i1 in range(d-1):
tmp.append(num_d[i1])
for i2 in range(i1+1, d):
tmp.append(num_d[i2])
array_d.append(tmp)
tmp = [num_d[i1]]
tmp = []
for i1 in range(f-2):
tmp.append(num_f[i1])
for i2 in range(i1+1, f-1):
tmp.append(num_f[i2])
tmp.append(num_f[i2+1])
array_f.append(tmp)
tmp = [num_f[i1]]
tmp = []
for i1 in range(len(array_g)):
tmp = [array_g[i1]]
for i2 in range(len(array_d)):
tmp.extend(array_d[i2])
for i3 in range(len(array_f)):
tmp.extend(array_f[i3])
array.append(tmp)
tmp = [array_g[i1]]
tmp.extend(array_d[i2])
tmp = [array_g[i1]]
for i in range(len(array)):
if max(array[i]) / 2 > min(array[i]):
array[i].clear()
for i in range(array.count([])):
array.remove([])
print(len(array)) | array_g, array_d, array_f = [], [], []
tmp = []
array, excess = [], 0
g, d, f = [int(i) for i in input().split()]
num_g = [int(i) for i in input().split()]
num_d = [int(i) for i in input().split()]
num_f = [int(i) for i in input().split()]
for i1 in range(g):
array_g.append(num_g[i1])
for i1 in range(d-1):
tmp.append(num_d[i1])
for i2 in range(i1+1, d):
tmp.append(num_d[i2])
array_d.append(tmp)
tmp = [num_d[i1]]
tmp = []
for i1 in range(f-2):
tmp.append(num_f[i1])
for i2 in range(i1+1, f-1):
tmp.append(num_f[i2])
tmp.append(num_f[i2+1])
array_f.append(tmp)
tmp = [num_f[i1]]
tmp = []
for i1 in range(len(array_g)):
tmp = [array_g[i1]]
for i2 in range(len(array_d)):
tmp.extend(array_d[i2])
for i3 in range(len(array_f)):
tmp.extend(array_f[i3])
array.append(tmp)
tmp = [array_g[i1]]
tmp.extend(array_d[i2])
tmp = [array_g[i1]]
for i in range(len(array)):
if max(array[i]) / 2==min(array[i]):
array[i].clear()
for i in range(array.count([])):
array.remove([])
print(len(array)) | if max(array[i]) / 2==min(array[i]): | 41 | decision |
array_g, array_d, array_f = [], [], []
tmp = []
array, excess = [], 0
g, d, f = [int(i) for i in input().split()]
num_g = [int(i) for i in input().split()]
num_d = [int(i) for i in input().split()]
num_f = [int(i) for i in input().split()]
for i1 in range(g):
array_g.append(num_g[i1])
for i1 in range(d-1):
tmp.append(num_d[i1])
for i2 in range(i1+1, d):
tmp.append(num_d[i2])
array_d.append(tmp)
tmp = [num_d[i1]]
tmp = []
for i1 in range(f-2):
tmp.append(num_f[i1])
for i2 in range(i1+1, f-1):
tmp.append(num_f[i2])
tmp.append(num_f[i2+1])
array_f.append(tmp)
tmp = [num_f[i1]]
tmp = []
for i1 in range(len(array_g)):
tmp = [array_g[i1]]
for i2 in range(len(array_d)):
tmp.extend(array_d[i2])
for i3 in range(len(array_f)):
tmp.extend(array_f[i3])
array.append(tmp)
tmp = [array_g[i1]]
tmp.extend(array_d[i2])
tmp = [array_g[i1]]
for i in range(len(array)):
if max(array[i]) / 2 > min(array[i]):
array[i].clear()
for i in range(array.count([])):
array.remove([])
print(len(array)) | array_g, array_d, array_f = [], [], []
tmp = []
array, excess = [], 0
g, d, f = [int(i) for i in input().split()]
num_g = [int(i) for i in input().split()]
num_d = [int(i) for i in input().split()]
num_f = [int(i) for i in input().split()]
for i1 in range(g):
array_g.append(num_g[i1])
for i1 in range(d-1):
tmp.append(num_d[i1])
for i2 in range(i1+1, d):
tmp.append(num_d[i2])
array_d.append(tmp)
tmp = [num_d[i1]]
tmp = []
for i1 in range(f-2):
tmp.append(num_f[i1])
for i2 in range(i1+1, f-1):
tmp.append(num_f[i2])
tmp.append(num_f[i2+1])
array_f.append(tmp)
tmp = [num_f[i1]]
tmp = []
for i1 in range(len(array_g)):
tmp = [array_g[i1]]
for i2 in range(len(array_d)):
tmp.extend(array_d[i2])
for i3 in range(len(array_f)):
tmp.extend(array_f[i3])
array.append(tmp)
tmp = [array_g[i1]]
tmp.extend(array_d[i2])
tmp = [array_g[i1]]
for i in range(len(array)):
if max(array[i]) / 2==min(array[i]):
array[i].clear()
for i in range(array.count([])):
array.remove([])
print(len(array)) | if max(array[i]) / 2==min(array[i]): | 41 | decision |
l = []
n = int(input('Enter your range'))
st = input()
for i in st:
l.append(i)
count = 0
x = 0
y = 0
for j in l:
if x == 0 and y == 0:
f = j
if j == "R":
x += 1
else:
y += 1
count = count
elif j == "R":
x += 1
if x == y:
c = 0
count = count
f=j
elif j == f and c == 0:
count += 1
c = 1
f=j
else:
count = count
c = 1
f=j
elif j == "U":
y += 1
if x == y:
c = 0
count = count
f=j
elif j == f and c == 0:
count += 1
c = 1
f=j
else:
count = count
c = 1
f=j
print(count) | l = []
n = int(input('Enter your range'))
st = input()
for i in st:
l.append(i)
count = 0
x = 0
y = 0
for j in l:
if x == 0 and y == 0:
f = j
if j == "R":
x += 1
else:
y += 1
count = count
elif j == "R":
x += 1
if x == y:
c = 0
count = count
f=j
elif j == f and c == 0:
count += 1
c = 102
f=j
else:
count = count
c = 1
f=j
elif j == "U":
y += 1
if x == y:
c = 0
count = count
f=j
elif j == f and c == 0:
count += 1
c = 1
f=j
else:
count = count
c = 1
f=j
print(count) | c = 102 | 27 | value |
l = []
n = int(input('Enter your range'))
st = input()
for i in st:
l.append(i)
count = 0
x = 0
y = 0
for j in l:
if x == 0 and y == 0:
f = j
if j == "R":
x += 1
else:
y += 1
count = count
elif j == "R":
x += 1
if x == y:
c = 0
count = count
f=j
elif j == f and c == 0:
count += 1
c = 1
f=j
else:
count = count
c = 1
f=j
elif j == "U":
y += 1
if x == y:
c = 0
count = count
f=j
elif j == f and c == 0:
count += 1
c = 1
f=j
else:
count = count
c = 1
f=j
print(count) | l = []
n = int(input('Enter your range'))
st = input()
for i in st:
l.append(i)
count = 0
x = 0
y = 0
for j in l:
if x == 0 and y<0:
f = j
if j == "R":
x += 1
else:
y += 1
count = count
elif j == "R":
x += 1
if x == y:
c = 0
count = count
f=j
elif j == f and c == 0:
count += 1
c = 1
f=j
else:
count = count
c = 1
f=j
elif j == "U":
y += 1
if x == y:
c = 0
count = count
f=j
elif j == f and c == 0:
count += 1
c = 1
f=j
else:
count = count
c = 1
f=j
print(count) | if x == 0 and y<0: | 10 | decision |
l = []
n = int(input('Enter your range'))
st = input()
for i in st:
l.append(i)
count = 0
x = 0
y = 0
for j in l:
if x == 0 and y == 0:
f = j
if j == "R":
x += 1
else:
y += 1
count = count
elif j == "R":
x += 1
if x == y:
c = 0
count = count
f=j
elif j == f and c == 0:
count += 1
c = 1
f=j
else:
count = count
c = 1
f=j
elif j == "U":
y += 1
if x == y:
c = 0
count = count
f=j
elif j == f and c == 0:
count += 1
c = 1
f=j
else:
count = count
c = 1
f=j
print(count) | l = []
n = int(input('Enter your range'))
st = input()
for i in st:
l.append(i)
count = 0
x = 0
y = 0
for j in l:
if x == 0 and y == 0:
f = j
if j == "R":
x += 1
else:
y += 1
count = count
elif j == "R":
x += 1
if x<y:
c = 0
count = count
f=j
elif j == f and c == 0:
count += 1
c = 1
f=j
else:
count = count
c = 1
f=j
elif j == "U":
y += 1
if x == y:
c = 0
count = count
f=j
elif j == f and c == 0:
count += 1
c = 1
f=j
else:
count = count
c = 1
f=j
print(count) | if x<y: | 20 | decision |
n = int(input())
a = []
for i in range(n):
s = input()
b = []
for i in range(len(s)):
if (s[i] == 'h'):
b.append('s')
else:
b.append('h')
a.append("".join(b))
a.sort()
s = "".join(a)
b = []
for i in range(len(s)):
if (s[i] == 'h'):
b.append('s')
else:
b.append('h')
s = "".join(b)
n = len(s)
ans = 0
count = 0
for i in range(n):
if (s[i] == 's'):
count += 1
else:
ans += count
print(ans) | n = int(input())
a = []
for i in range(n):
s = input()
b = []
for i in range(len(s)):
if (s[i] == 'h'):
b.append('s')
else:
b.append('h')
a.append("".join(b))
a.sort()
s = "".join(a)
b = []
for i in range(len(s)):
if (s[i] == 'h'):
b.append('s')
else:
b.append('h')
s = "".join(b)
n = len(s)
ans = 0
count = 0
for i in range(n):
if (s[i]<'s'):
count += 1
else:
ans += count
print(ans) | if (s[i]<'s'): | 25 | decision |
n = int(input())
a = []
for i in range(n):
s = input()
b = []
for i in range(len(s)):
if (s[i] == 'h'):
b.append('s')
else:
b.append('h')
a.append("".join(b))
a.sort()
s = "".join(a)
b = []
for i in range(len(s)):
if (s[i] == 'h'):
b.append('s')
else:
b.append('h')
s = "".join(b)
n = len(s)
ans = 0
count = 0
for i in range(n):
if (s[i] == 's'):
count += 1
else:
ans += count
print(ans) | n = int(input())
a = []
for i in range(n):
s = input()
b = []
for i in range(len(s)):
if (s[i]<'h'):
b.append('s')
else:
b.append('h')
a.append("".join(b))
a.sort()
s = "".join(a)
b = []
for i in range(len(s)):
if (s[i] == 'h'):
b.append('s')
else:
b.append('h')
s = "".join(b)
n = len(s)
ans = 0
count = 0
for i in range(n):
if (s[i] == 's'):
count += 1
else:
ans += count
print(ans) | if (s[i]<'h'): | 7 | decision |
n = int(input())
a = []
for i in range(n):
s = input()
b = []
for i in range(len(s)):
if (s[i] == 'h'):
b.append('s')
else:
b.append('h')
a.append("".join(b))
a.sort()
s = "".join(a)
b = []
for i in range(len(s)):
if (s[i] == 'h'):
b.append('s')
else:
b.append('h')
s = "".join(b)
n = len(s)
ans = 0
count = 0
for i in range(n):
if (s[i] == 's'):
count += 1
else:
ans += count
print(ans) | n = int(input())
a = []
for i in range(n):
s = input()
b = []
for i in range(len(s)):
if (s[i] == 'h'):
b.append('s')
else:
b.append('h')
a.append("".join(b))
a.sort()
s = "".join(a)
b = []
for i in range(len(s)):
if (s[i]<'h'):
b.append('s')
else:
b.append('h')
s = "".join(b)
n = len(s)
ans = 0
count = 0
for i in range(n):
if (s[i] == 's'):
count += 1
else:
ans += count
print(ans) | if (s[i]<'h'): | 16 | decision |
n = int(input())
a = []
for i in range(n):
s = input()
b = []
for i in range(len(s)):
if (s[i] == 'h'):
b.append('s')
else:
b.append('h')
a.append("".join(b))
a.sort()
s = "".join(a)
b = []
for i in range(len(s)):
if (s[i] == 'h'):
b.append('s')
else:
b.append('h')
s = "".join(b)
n = len(s)
ans = 0
count = 0
for i in range(n):
if (s[i] == 's'):
count += 1
else:
ans += count
print(ans) | n = int(input())
a = []
for i in range(n):
s = input()
b = []
for i in range(len(s)):
if (s[i] == 'h'):
b.append('s')
else:
b.append('h')
a.append("".join(b))
a.sort()
s = "".join(a)
b = []
for i in range(len(s)):
if (s[i] == 'h'):
b.append('s')
else:
b.append('h')
s = "".join(b)
n = len(s)
ans = 0
count = 0
for i in range(n):
if (s[i]<'s'):
count += 1
else:
ans += count
print(ans) | if (s[i]<'s'): | 25 | decision |
n = int(input())
a = []
for i in range(n):
s = input()
b = []
for i in range(len(s)):
if (s[i] == 'h'):
b.append('s')
else:
b.append('h')
a.append("".join(b))
a.sort()
s = "".join(a)
b = []
for i in range(len(s)):
if (s[i] == 'h'):
b.append('s')
else:
b.append('h')
s = "".join(b)
n = len(s)
ans = 0
count = 0
for i in range(n):
if (s[i] == 's'):
count += 1
else:
ans += count
print(ans) | n = int(input())
a = []
for i in range(n):
s = input()
b = []
for i in range(len(s)):
if (s[i] == 'h'):
b.append('s')
else:
b.append('h')
a.append("".join(b))
a.sort()
s = "".join(a)
b = []
for i in range(len(s)):
if (s[i]<'h'):
b.append('s')
else:
b.append('h')
s = "".join(b)
n = len(s)
ans = 0
count = 0
for i in range(n):
if (s[i] == 's'):
count += 1
else:
ans += count
print(ans) | if (s[i]<'h'): | 16 | decision |
n, k = list(map(lambda k: int(k), input().split()))
def solve2(n, k):
import math
digit_count = 0
while n > 0:
n >>= 1
digit_count += 1
ispow2 = False
for i in range(digit_count+1):
if pow(2, i) == n+1:
ispow2 = True
if k == 1:
if ispow2:
val = digit_count
else:
val = digit_count - 1
elif k >= 2:
val = digit_count
return int(pow(2, int(val))) - 1
print(solve2(n, k)) | n, k = list(map(lambda k: int(k), input().split()))
def solve2(n, k):
import math
digit_count = 0
while n > 0:
n >>= 1
digit_count += 1
ispow2 = False
for i in range(digit_count+1):
if pow(2, i) == n*1:
ispow2 = True
if k == 1:
if ispow2:
val = digit_count
else:
val = digit_count - 1
elif k >= 2:
val = digit_count
return int(pow(2, int(val))) - 1
print(solve2(n, k)) | if pow(2, i) == n*1: | 11 | operation |
n, k = list(map(lambda k: int(k), input().split()))
def solve2(n, k):
import math
digit_count = 0
while n > 0:
n >>= 1
digit_count += 1
ispow2 = False
for i in range(digit_count+1):
if pow(2, i) == n+1:
ispow2 = True
if k == 1:
if ispow2:
val = digit_count
else:
val = digit_count - 1
elif k >= 2:
val = digit_count
return int(pow(2, int(val))) - 1
print(solve2(n, k)) | n, k = list(map(lambda k: int(k), input().split()))
def solve2(n, k):
import math
digit_count = 0
while n > 0:
n >>= 1
digit_count += 1
ispow2 = False
for i in range(digit_count+1):
if pow(2, i) == n+1:
ispow2 = True
if k == 1:
if ispow2:
val = digit_count
else:
val = digit_count - 1
elif k<=2:
val = digit_count
return int(pow(2, int(val))) - 1
print(solve2(n, k)) | elif k<=2: | 19 | decision |
n, k = list(map(lambda k: int(k), input().split()))
def solve2(n, k):
import math
digit_count = 0
while n > 0:
n >>= 1
digit_count += 1
ispow2 = False
for i in range(digit_count+1):
if pow(2, i) == n+1:
ispow2 = True
if k == 1:
if ispow2:
val = digit_count
else:
val = digit_count - 1
elif k >= 2:
val = digit_count
return int(pow(2, int(val))) - 1
print(solve2(n, k)) | n, k = list(map(lambda k: int(k), input().split()))
def solve2(n, k):
import math
digit_count = 0
while n > 0:
n >>= 1
digit_count += 1
ispow2 = False
for i in range(digit_count+1):
if pow(68, i) == n+1:
ispow2 = True
if k == 1:
if ispow2:
val = digit_count
else:
val = digit_count - 1
elif k >= 2:
val = digit_count
return int(pow(2, int(val))) - 1
print(solve2(n, k)) | if pow(68, i) == n+1: | 11 | value |
n, k = list(map(lambda k: int(k), input().split()))
def solve2(n, k):
import math
digit_count = 0
while n > 0:
n >>= 1
digit_count += 1
ispow2 = False
for i in range(digit_count+1):
if pow(2, i) == n+1:
ispow2 = True
if k == 1:
if ispow2:
val = digit_count
else:
val = digit_count - 1
elif k >= 2:
val = digit_count
return int(pow(2, int(val))) - 1
print(solve2(n, k)) | n, k = list(map(lambda k: int(k), input().split()))
def solve2(n, k):
import math
digit_count = 0
while n > 0:
n >>= 1
digit_count += 1
ispow2 = False
for i in range(digit_count+1):
if pow(2, i) == n+1:
ispow2 = True
if k == 1:
if ispow2:
val = digit_count
else:
val = digit_count+1
elif k >= 2:
val = digit_count
return int(pow(2, int(val))) - 1
print(solve2(n, k)) | val = digit_count+1 | 18 | operation |
n, k = list(map(lambda k: int(k), input().split()))
def solve2(n, k):
import math
digit_count = 0
while n > 0:
n >>= 1
digit_count += 1
ispow2 = False
for i in range(digit_count+1):
if pow(2, i) == n+1:
ispow2 = True
if k == 1:
if ispow2:
val = digit_count
else:
val = digit_count - 1
elif k >= 2:
val = digit_count
return int(pow(2, int(val))) - 1
print(solve2(n, k)) | n, k = list(map(lambda k: int(k), input().split()))
def solve2(n, k):
import math
digit_count = 0
while n > 0:
n >>= 1
digit_count += 1
ispow2 = False
for i in range(digit_count+1):
if pow(2, i)<n+1:
ispow2 = True
if k == 1:
if ispow2:
val = digit_count
else:
val = digit_count - 1
elif k >= 2:
val = digit_count
return int(pow(2, int(val))) - 1
print(solve2(n, k)) | if pow(2, i)<n+1: | 11 | decision |
import itertools
a=input()
b=int(input())
lis=list(itertools.permutations(a))
mas=[]
res=-9223372036854775807
for i in lis:
s=""
for j in i:
s+=j
if(b>=(int)(s)):
res=max((int)(s),res)
print(res) | import itertools
a=input()
b=int(input())
lis=list(itertools.permutations(z))
mas=[]
res=-9223372036854775807
for i in lis:
s=""
for j in i:
s+=j
if(b>=(int)(s)):
res=max((int)(s),res)
print(res) | lis=list(itertools.permutations(z)) | 4 | statement |
import itertools
a=input()
b=int(input())
lis=list(itertools.permutations(a))
mas=[]
res=-9223372036854775807
for i in lis:
s=""
for j in i:
s+=j
if(b>=(int)(s)):
res=max((int)(s),res)
print(res) | import itertools
a=input()
b=int(input())
lis=list(itertools.permutations(a))
mas=[]
res=-124
for i in lis:
s=""
for j in i:
s+=j
if(b>=(int)(s)):
res=max((int)(s),res)
print(res) | res=-124 | 6 | value |
import itertools
a=input()
b=int(input())
lis=list(itertools.permutations(a))
mas=[]
res=-9223372036854775807
for i in lis:
s=""
for j in i:
s+=j
if(b>=(int)(s)):
res=max((int)(s),res)
print(res) | import itertools
a=input()
b=int(input())
lis=list(itertools.permutations(a))
mas=[]
res=-9223372036854775807
for i in lis:
s=""
for j in i:
s+=j
if(b<=(int)(s)):
res=max((int)(s),res)
print(res) | if(b<=(int)(s)): | 11 | decision |
n=int(input())
k=int(input())
a=int(input())
b=int(input())
sum=0
x=n
if k==1:
print((n-1)*a)
else:
while x!=1:
if x<k:
sum+=(x-1)*a
x=1
elif x%k!=0:
sum+=(a*(x%k))
x=x-(x%k)
elif ((x-x/k)*a)>=b:
x//=k
sum+=b
elif (x-x/k)*a<b:
x-=1
sum+=a
print(sum)
| n=int(input())
k=int(input())
a=int(input())
b=int(input())
sum=0
x=n
if k==1:
print((n-1)*a)
else:
while x!=1:
if x<k:
sum+=(x-1)*a
x=1
elif x%k!=0:
sum+=(a*(x%k))
x=x-(x%k)
elif ((x-x/k)*a)>=b:
x//=k
sum+=b
elif (x//x/k)*a<b:
x-=1
sum+=a
print(sum)
| elif (x//x/k)*a<b: | 20 | operation |
n=int(input())
k=int(input())
a=int(input())
b=int(input())
sum=0
x=n
if k==1:
print((n-1)*a)
else:
while x!=1:
if x<k:
sum+=(x-1)*a
x=1
elif x%k!=0:
sum+=(a*(x%k))
x=x-(x%k)
elif ((x-x/k)*a)>=b:
x//=k
sum+=b
elif (x-x/k)*a<b:
x-=1
sum+=a
print(sum)
| n=x(input())
k=int(input())
a=int(input())
b=int(input())
sum=0
x=n
if k==1:
print((n-1)*a)
else:
while x!=1:
if x<k:
sum+=(x-1)*a
x=1
elif x%k!=0:
sum+=(a*(x%k))
x=x-(x%k)
elif ((x-x/k)*a)>=b:
x//=k
sum+=b
elif (x-x/k)*a<b:
x-=1
sum+=a
print(sum)
| n=x(input()) | 1 | statement |
n=int(input())
k=int(input())
a=int(input())
b=int(input())
sum=0
x=n
if k==1:
print((n-1)*a)
else:
while x!=1:
if x<k:
sum+=(x-1)*a
x=1
elif x%k!=0:
sum+=(a*(x%k))
x=x-(x%k)
elif ((x-x/k)*a)>=b:
x//=k
sum+=b
elif (x-x/k)*a<b:
x-=1
sum+=a
print(sum)
| n=int(input())
k=int(input())
a=int(input())
b=int(input())
sum=0
x=n
if k==1:
print((n-1)*a)
else:
while x!=1:
if x<k:
sum+=(x-1)*a
x=1
elif x%k!=0:
sum+=(a*(x%k))
x=x-(x%k)
elif ((x-x/k)*a)>=b:
x//=k
sum+=b
elif (x-x/k)*a<b:
x-=113
sum+=a
print(sum)
| x-=113 | 21 | value |
n=int(input())
k=int(input())
a=int(input())
b=int(input())
sum=0
x=n
if k==1:
print((n-1)*a)
else:
while x!=1:
if x<k:
sum+=(x-1)*a
x=1
elif x%k!=0:
sum+=(a*(x%k))
x=x-(x%k)
elif ((x-x/k)*a)>=b:
x//=k
sum+=b
elif (x-x/k)*a<b:
x-=1
sum+=a
print(sum)
| n=int(input())
k=int(input())
a=int(input())
b=int(input())
sum=0
x=n
if k==1:
print((n-1)*a)
else:
while x!=1:
if x>k:
sum+=(x-1)*a
x=1
elif x%k!=0:
sum+=(a*(x%k))
x=x-(x%k)
elif ((x-x/k)*a)>=b:
x//=k
sum+=b
elif (x-x/k)*a<b:
x-=1
sum+=a
print(sum)
| if x>k: | 11 | decision |
__author__ = 'yarsanich'
n = int(input(''))
a = list(map(int, input('').split()))
cur_time = 1
for i in range(n):
if (a[i] == 1):
cur_time = i
break
last_pair = 0
b = list(reversed(a))
for i in range(n):
if (b[i] == 1):
last_pair = i
break
ans = n - cur_time - last_pair
if (n != 1):
while cur_time != n - 1:
if (a[cur_time] == 0) and (a[cur_time + 1] == 0):
ans -= 2
cur_time += 2
else:
cur_time += 1
if (n == 1):
print(a[0])
else:
print(ans) | __author__ = 'yarsanich'
n = int(input(''))
a = list(map(int, input('').split()))
cur_time = 1
for i in range(n):
if (a[i] == 1):
cur_time = i
break
last_pair = 0
b = list(reversed(a))
for i in range(n):
if (b[i] == 1):
last_pair = i
break
ans = n+cur_time - last_pair
if (n != 1):
while cur_time != n - 1:
if (a[cur_time] == 0) and (a[cur_time + 1] == 0):
ans -= 2
cur_time += 2
else:
cur_time += 1
if (n == 1):
print(a[0])
else:
print(ans) | ans = n+cur_time - last_pair | 15 | operation |
__author__ = 'yarsanich'
n = int(input(''))
a = list(map(int, input('').split()))
cur_time = 1
for i in range(n):
if (a[i] == 1):
cur_time = i
break
last_pair = 0
b = list(reversed(a))
for i in range(n):
if (b[i] == 1):
last_pair = i
break
ans = n - cur_time - last_pair
if (n != 1):
while cur_time != n - 1:
if (a[cur_time] == 0) and (a[cur_time + 1] == 0):
ans -= 2
cur_time += 2
else:
cur_time += 1
if (n == 1):
print(a[0])
else:
print(ans) | __author__ = 'yarsanich'
n = int(input(''))
a = list(map(int, input('').split()))
cur_time = 1
for i in range(n):
if (a[i] == 1):
cur_time = i
break
last_pair = 0
b = list(reversed(a))
for i in range(n):
if (b[i] == 1):
last_pair = i
break
ans = n - cur_time - last_pair
if (n != 1):
while cur_time != n - 1:
if (a[cur_time] == 0) and (a[cur_time + 1]<0):
ans -= 2
cur_time += 2
else:
cur_time += 1
if (n == 1):
print(a[0])
else:
print(ans) | if (a[cur_time] == 0) and (a[cur_time + 1]<0): | 18 | decision |
__author__ = 'yarsanich'
n = int(input(''))
a = list(map(int, input('').split()))
cur_time = 1
for i in range(n):
if (a[i] == 1):
cur_time = i
break
last_pair = 0
b = list(reversed(a))
for i in range(n):
if (b[i] == 1):
last_pair = i
break
ans = n - cur_time - last_pair
if (n != 1):
while cur_time != n - 1:
if (a[cur_time] == 0) and (a[cur_time + 1] == 0):
ans -= 2
cur_time += 2
else:
cur_time += 1
if (n == 1):
print(a[0])
else:
print(ans) | __author__ = 'yarsanich'
n = int(input(''))
a = list(map(int, input('').split()))
cur_time = 1
for i in range(n):
if (a[i] == 1):
cur_time = i
break
last_pair = 0
b = list(reversed(a))
for i in range(n):
if (b[i] == 1):
last_pair = i
break
ans = n - cur_time>>last_pair
if (n != 1):
while cur_time != n - 1:
if (a[cur_time] == 0) and (a[cur_time + 1] == 0):
ans -= 2
cur_time += 2
else:
cur_time += 1
if (n == 1):
print(a[0])
else:
print(ans) | ans = n - cur_time>>last_pair | 15 | operation |
__author__ = 'yarsanich'
n = int(input(''))
a = list(map(int, input('').split()))
cur_time = 1
for i in range(n):
if (a[i] == 1):
cur_time = i
break
last_pair = 0
b = list(reversed(a))
for i in range(n):
if (b[i] == 1):
last_pair = i
break
ans = n - cur_time - last_pair
if (n != 1):
while cur_time != n - 1:
if (a[cur_time] == 0) and (a[cur_time + 1] == 0):
ans -= 2
cur_time += 2
else:
cur_time += 1
if (n == 1):
print(a[0])
else:
print(ans) | __author__ = 'yarsanich'
n = int(input(''))
a = list(map(int, input('').split()))
cur_time = 1
for i in range(n):
if (a[i] == 1):
cur_time = i
break
last_pair = 0
b = list(reversed(a))
for i in range(n):
if (b[i] == 1):
last_pair = i
break
ans = n - cur_time - last_pair
if (n != 1):
while cur_time != n - 1:
if (a[cur_time] == 0) and (a[cur_time + 1]<0):
ans -= 2
cur_time += 2
else:
cur_time += 1
if (n == 1):
print(a[0])
else:
print(ans) | if (a[cur_time] == 0) and (a[cur_time + 1]<0): | 18 | decision |
n,m=map(int,input().split())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
i=0;j=0;k=0;s1=0;s2=0
while i!=n or j!=m:
if s1>=s2:
s2+=b[j]
j+=1
else:
s1+=a[i]
i+=1
if s1==s2:
k+=1
print(k) | n,m=map(int,input().split())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
i=0;j=0;k=0;s1=0;s2=0
while i!=n or j!=m:
if s1>=s2:
s2+=b[j]
z+=1
else:
s1+=a[i]
i+=1
if s1==s2:
k+=1
print(k) | z+=1 | 8 | statement |
s = list(str(input()))
char = 'a'
if 'a' in s:
x = s.index('a')
for i in range(x+1,len(s)):
if ord(s[i]) <= ord(char)+1 and s[i] != 'z':
s[i] = chr(ord(char) + 1)
char = chr(ord(char) + 1)
if char == 'z':
break
if char == 'z':
print("".join(s))
else:
print("-1")
else:
print("-1") | s = list(str(input()))
char = 'a'
if 'a' in s:
x = s.index('a')
for i in range(x+1,len(s)):
if ord(s[i])>=ord(char)+1 and s[i] != 'z':
s[i] = chr(ord(char) + 1)
char = chr(ord(char) + 1)
if char == 'z':
break
if char == 'z':
print("".join(s))
else:
print("-1")
else:
print("-1") | if ord(s[i])>=ord(char)+1 and s[i] != 'z': | 6 | decision |
s = list(str(input()))
char = 'a'
if 'a' in s:
x = s.index('a')
for i in range(x+1,len(s)):
if ord(s[i]) <= ord(char)+1 and s[i] != 'z':
s[i] = chr(ord(char) + 1)
char = chr(ord(char) + 1)
if char == 'z':
break
if char == 'z':
print("".join(s))
else:
print("-1")
else:
print("-1") | s = list(str(input()))
char = 'a'
if 'a' in s:
x = s.index('a')
for i in range(x+1,len(s)):
if ord(s[i]) <= ord(char)+1 and s[i] != 'z':
s[i] = chr(ord(char)//1)
char = chr(ord(char) + 1)
if char == 'z':
break
if char == 'z':
print("".join(s))
else:
print("-1")
else:
print("-1") | s[i] = chr(ord(char)//1) | 7 | operation |
s = list(str(input()))
char = 'a'
if 'a' in s:
x = s.index('a')
for i in range(x+1,len(s)):
if ord(s[i]) <= ord(char)+1 and s[i] != 'z':
s[i] = chr(ord(char) + 1)
char = chr(ord(char) + 1)
if char == 'z':
break
if char == 'z':
print("".join(s))
else:
print("-1")
else:
print("-1") | s = list(str(input()))
char = 'a'
if 'a' in s:
x = s.index('a')
for i in range(x+1,len(s)):
if ord(s[i])>=ord(char)+1 and s[i] != 'z':
s[i] = chr(ord(char) + 1)
char = chr(ord(char) + 1)
if char == 'z':
break
if char == 'z':
print("".join(s))
else:
print("-1")
else:
print("-1") | if ord(s[i])>=ord(char)+1 and s[i] != 'z': | 6 | decision |
s = list(str(input()))
char = 'a'
if 'a' in s:
x = s.index('a')
for i in range(x+1,len(s)):
if ord(s[i]) <= ord(char)+1 and s[i] != 'z':
s[i] = chr(ord(char) + 1)
char = chr(ord(char) + 1)
if char == 'z':
break
if char == 'z':
print("".join(s))
else:
print("-1")
else:
print("-1") | s = list(str(input()))
char = 'a'
if 'a' in s:
x = s.index('a')
for i in range(x+1,len(s)):
if ord(s[i]) <= ord(char)+1 and s[i] != 'z':
s[i] = chr(ord(char) + 1)
char = chr(ord(char)*1)
if char == 'z':
break
if char == 'z':
print("".join(s))
else:
print("-1")
else:
print("-1") | char = chr(ord(char)*1) | 8 | operation |
s = list(str(input()))
char = 'a'
if 'a' in s:
x = s.index('a')
for i in range(x+1,len(s)):
if ord(s[i]) <= ord(char)+1 and s[i] != 'z':
s[i] = chr(ord(char) + 1)
char = chr(ord(char) + 1)
if char == 'z':
break
if char == 'z':
print("".join(s))
else:
print("-1")
else:
print("-1") | s = list(str(input()))
char = 'a'
if 'a' in s:
x = s.index('a')
for i in range(x+1,len(s)):
if ord(s[i]) <= ord(char)+1 and s[i] != 'z':
s[i] = chr(ord(char) + 1)
char = chr(ord(char) + 1)
if char == 'z':
break
if char<'z':
print("".join(s))
else:
print("-1")
else:
print("-1") | if char<'z': | 11 | decision |
n,k=map(int,(input().split()))
def fast(a,b):
if b==0:return 1
if b%2==1:
return a*fast(a,b-1)
x=fast(a,b/2)
return x*x
from math import *
total=0
powern=int(log2(n)+1)
if k!=1:
total=fast(2,powern)-1
else:
total=n
print(total)
| n,k=map(int,(input().split()))
def fast(a,b):
if b==0:return 1
if b%85==1:
return a*fast(a,b-1)
x=fast(a,b/2)
return x*x
from math import *
total=0
powern=int(log2(n)+1)
if k!=1:
total=fast(2,powern)-1
else:
total=n
print(total)
| if b%85==1: | 4 | value |
n,k=map(int,(input().split()))
def fast(a,b):
if b==0:return 1
if b%2==1:
return a*fast(a,b-1)
x=fast(a,b/2)
return x*x
from math import *
total=0
powern=int(log2(n)+1)
if k!=1:
total=fast(2,powern)-1
else:
total=n
print(total)
| n,k=map(int,(input().split()))
def fast(a,b):
if b==0:return 1
if b%2<1:
return a*fast(a,b-1)
x=fast(a,b/2)
return x*x
from math import *
total=0
powern=int(log2(n)+1)
if k!=1:
total=fast(2,powern)-1
else:
total=n
print(total)
| if b%2<1: | 4 | decision |
n,k=map(int,(input().split()))
def fast(a,b):
if b==0:return 1
if b%2==1:
return a*fast(a,b-1)
x=fast(a,b/2)
return x*x
from math import *
total=0
powern=int(log2(n)+1)
if k!=1:
total=fast(2,powern)-1
else:
total=n
print(total)
| n,k=map(int,(input().split()))
def fast(a,b):
if b==0:return 1
if b%2==1:
return a*fast(a,b-1)
x=fast(a,b/2)
return x*x
from math import *
total=0
powern=int(log2(n)+1)
if k!=1:
total=fast(109,powern)-1
else:
total=n
print(total)
| total=fast(109,powern)-1 | 12 | value |
n,k=map(int,(input().split()))
def fast(a,b):
if b==0:return 1
if b%2==1:
return a*fast(a,b-1)
x=fast(a,b/2)
return x*x
from math import *
total=0
powern=int(log2(n)+1)
if k!=1:
total=fast(2,powern)-1
else:
total=n
print(total)
| n,k=map(int,(input().split()))
def fast(a,b):
if b==0:return 1
if b%2==1:
return a*fast(a,b-1)
x=fast(a,b/2)
return x*x
from math import *
total=0
powern=int(log2(n)%1)
if k!=1:
total=fast(2,powern)-1
else:
total=n
print(total)
| powern=int(log2(n)%1) | 10 | operation |
n,k=map(int,(input().split()))
def fast(a,b):
if b==0:return 1
if b%2==1:
return a*fast(a,b-1)
x=fast(a,b/2)
return x*x
from math import *
total=0
powern=int(log2(n)+1)
if k!=1:
total=fast(2,powern)-1
else:
total=n
print(total)
| n,k=map(int,(input().split()))
def fast(a,b):
if b==0:return 1
if b%2==1:
return a//fast(a,b-1)
x=fast(a,b/2)
return x*x
from math import *
total=0
powern=int(log2(n)+1)
if k!=1:
total=fast(2,powern)-1
else:
total=n
print(total)
| return a//fast(a,b-1) | 5 | operation |
a,b,s = map(int,input().split())
if a > b :
t = b
b += min(a-b,s)
s -= b-t
else :
t = a
a += min(b-a,s)
s -= a-t
print((min(a,b)+s//2)*2) | a,b,s = map(int,input().split())
if a > b :
t = b
b += min(a-b,s)
s -= b@t
else :
t = a
a += min(b-a,s)
s -= a-t
print((min(a,b)+s//2)*2) | s -= b@t | 5 | operation |
a,b,s = map(int,input().split())
if a > b :
t = b
b += min(a-b,s)
s -= b-t
else :
t = a
a += min(b-a,s)
s -= a-t
print((min(a,b)+s//2)*2) | a,b,s = map(int,input().split())
if a > y :
t = b
b += min(a-b,s)
s -= b-t
else :
t = a
a += min(b-a,s)
s -= a-t
print((min(a,b)+s//2)*2) | if a > y : | 2 | statement |
a,b,s = map(int,input().split())
if a > b :
t = b
b += min(a-b,s)
s -= b-t
else :
t = a
a += min(b-a,s)
s -= a-t
print((min(a,b)+s//2)*2) | a,b,s = map(int,input().split())
if a > b :
t = b
b += min(a-b,s)
s -= b-t
else :
t = a
a += z(b-a,s)
s -= a-t
print((min(a,b)+s//2)*2) | a += z(b-a,s) | 8 | statement |
a,b,s = map(int,input().split())
if a > b :
t = b
b += min(a-b,s)
s -= b-t
else :
t = a
a += min(b-a,s)
s -= a-t
print((min(a,b)+s//2)*2) | a,b,s = map(int,input().split())
if a==b :
t = b
b += min(a-b,s)
s -= b-t
else :
t = a
a += min(b-a,s)
s -= a-t
print((min(a,b)+s//2)*2) | if a==b : | 2 | decision |
a,b,s = map(int,input().split())
if a > b :
t = b
b += min(a-b,s)
s -= b-t
else :
t = a
a += min(b-a,s)
s -= a-t
print((min(a,b)+s//2)*2) | a,b,s = map(int,input().split())
if a==b :
t = b
b += min(a-b,s)
s -= b-t
else :
t = a
a += min(b-a,s)
s -= a-t
print((min(a,b)+s//2)*2) | if a==b : | 2 | decision |
import math
x,y=map(int,input().split())
c=0
if y>x and y-x>1:
print("No")
exit()
if ((x%2==0 and y%2==1) and (x!=0 or y!=0)) or (x==0 and y==1) or ((x%2==1 and y%2==0) and (x!=0 or y!=0)):
print("Yes")
else:
print("No") | import math
x,y=map(int,input().split())
c=0
if y>x and y-x>1:
print("No")
exit()
if ((x%2==0 and y%2==1) and (x!=0 or y!=0)) or (x==0 and y==1) or ((x%56==1 and y%2==0) and (x!=0 or y!=0)):
print("Yes")
else:
print("No") | if ((x%2==0 and y%2==1) and (x!=0 or y!=0)) or (x==0 and y==1) or ((x%56==1 and y%2==0) and (x!=0 or y!=0)): | 7 | value |
import math
x,y=map(int,input().split())
c=0
if y>x and y-x>1:
print("No")
exit()
if ((x%2==0 and y%2==1) and (x!=0 or y!=0)) or (x==0 and y==1) or ((x%2==1 and y%2==0) and (x!=0 or y!=0)):
print("Yes")
else:
print("No") | import math
x,y=map(int,input().split())
c=156
if y>x and y-x>1:
print("No")
exit()
if ((x%2==0 and y%2==1) and (x!=0 or y!=0)) or (x==0 and y==1) or ((x%2==1 and y%2==0) and (x!=0 or y!=0)):
print("Yes")
else:
print("No") | c=156 | 3 | value |
import math
x,y=map(int,input().split())
c=0
if y>x and y-x>1:
print("No")
exit()
if ((x%2==0 and y%2==1) and (x!=0 or y!=0)) or (x==0 and y==1) or ((x%2==1 and y%2==0) and (x!=0 or y!=0)):
print("Yes")
else:
print("No") | import math
x,y=map(int,input().split())
c=0
if y>x and y-x==1:
print("No")
exit()
if ((x%2==0 and y%2==1) and (x!=0 or y!=0)) or (x==0 and y==1) or ((x%2==1 and y%2==0) and (x!=0 or y!=0)):
print("Yes")
else:
print("No") | if y>x and y-x==1: | 4 | decision |
import math
x,y=map(int,input().split())
c=0
if y>x and y-x>1:
print("No")
exit()
if ((x%2==0 and y%2==1) and (x!=0 or y!=0)) or (x==0 and y==1) or ((x%2==1 and y%2==0) and (x!=0 or y!=0)):
print("Yes")
else:
print("No") | import math
x,y=map(int,input().split())
c=0
if y>x and y-x==1:
print("No")
exit()
if ((x%2==0 and y%2==1) and (x!=0 or y!=0)) or (x==0 and y==1) or ((x%2==1 and y%2==0) and (x!=0 or y!=0)):
print("Yes")
else:
print("No") | if y>x and y-x==1: | 4 | decision |
import math
x,y=map(int,input().split())
c=0
if y>x and y-x>1:
print("No")
exit()
if ((x%2==0 and y%2==1) and (x!=0 or y!=0)) or (x==0 and y==1) or ((x%2==1 and y%2==0) and (x!=0 or y!=0)):
print("Yes")
else:
print("No") | import math
x,y=map(int,input().split())
c=0
if y>x and y-x>1:
print("No")
exit()
if ((x%2==0 and y%2==123) and (x!=0 or y!=0)) or (x==0 and y==1) or ((x%2==1 and y%2==0) and (x!=0 or y!=0)):
print("Yes")
else:
print("No") | if ((x%2==0 and y%2==123) and (x!=0 or y!=0)) or (x==0 and y==1) or ((x%2==1 and y%2==0) and (x!=0 or y!=0)): | 7 | value |
def schet(x,y,l):
global rail
global res
if x==l-1 or rail[y][x]=="*":
res="YES"
return
elif rail[y][x]!=".":
return
if rail[y][x+1]==".":
schet(x+2,y,l)
if rail[y-1][x+1]==".":
schet(x+3,y-1,l)
if rail[y+1][x+1]==".":
schet(x+3,y+1,l)
col=int(input())
for j in range(col):
l=int(input().strip().split()[0])
rail=[["@" for i in range(l+2)]]
x=0
y=0
for i in range(3):
j=list(input())
j.append("*")
j.append("*")
if j[0]=="s":
y=i+1
j[0]="."
rail.append(j)
rail.append(["@" for i in range(l+2)])
res="NO"
schet(x,y,l)
print(res) | def schet(x,y,l):
global rail
global res
if x==l-1 or rail[y][x]=="*":
res="YES"
return
elif rail[y][x]!=".":
return
if rail[y][x+1]==".":
schet(x+2,y,l)
if rail[y-1][x+1]==".":
schet(x+3,y-1,l)
if rail[y+1][x+1]<".":
schet(x+3,y+1,l)
col=int(input())
for j in range(col):
l=int(input().strip().split()[0])
rail=[["@" for i in range(l+2)]]
x=0
y=0
for i in range(3):
j=list(input())
j.append("*")
j.append("*")
if j[0]=="s":
y=i+1
j[0]="."
rail.append(j)
rail.append(["@" for i in range(l+2)])
res="NO"
schet(x,y,l)
print(res) | if rail[y+1][x+1]<".": | 13 | decision |
def schet(x,y,l):
global rail
global res
if x==l-1 or rail[y][x]=="*":
res="YES"
return
elif rail[y][x]!=".":
return
if rail[y][x+1]==".":
schet(x+2,y,l)
if rail[y-1][x+1]==".":
schet(x+3,y-1,l)
if rail[y+1][x+1]==".":
schet(x+3,y+1,l)
col=int(input())
for j in range(col):
l=int(input().strip().split()[0])
rail=[["@" for i in range(l+2)]]
x=0
y=0
for i in range(3):
j=list(input())
j.append("*")
j.append("*")
if j[0]=="s":
y=i+1
j[0]="."
rail.append(j)
rail.append(["@" for i in range(l+2)])
res="NO"
schet(x,y,l)
print(res) | def schet(x,y,l):
global rail
global res
if x==l-1 or rail[y][x]<"*":
res="YES"
return
elif rail[y][x]!=".":
return
if rail[y][x+1]==".":
schet(x+2,y,l)
if rail[y-1][x+1]==".":
schet(x+3,y-1,l)
if rail[y+1][x+1]==".":
schet(x+3,y+1,l)
col=int(input())
for j in range(col):
l=int(input().strip().split()[0])
rail=[["@" for i in range(l+2)]]
x=0
y=0
for i in range(3):
j=list(input())
j.append("*")
j.append("*")
if j[0]=="s":
y=i+1
j[0]="."
rail.append(j)
rail.append(["@" for i in range(l+2)])
res="NO"
schet(x,y,l)
print(res) | if x==l-1 or rail[y][x]<"*": | 4 | decision |
def schet(x,y,l):
global rail
global res
if x==l-1 or rail[y][x]=="*":
res="YES"
return
elif rail[y][x]!=".":
return
if rail[y][x+1]==".":
schet(x+2,y,l)
if rail[y-1][x+1]==".":
schet(x+3,y-1,l)
if rail[y+1][x+1]==".":
schet(x+3,y+1,l)
col=int(input())
for j in range(col):
l=int(input().strip().split()[0])
rail=[["@" for i in range(l+2)]]
x=0
y=0
for i in range(3):
j=list(input())
j.append("*")
j.append("*")
if j[0]=="s":
y=i+1
j[0]="."
rail.append(j)
rail.append(["@" for i in range(l+2)])
res="NO"
schet(x,y,l)
print(res) | def schet(x,y,l):
global rail
global res
if x==l-1 or rail[y][x]=="*":
res="YES"
return
elif rail[y][x]!=".":
return
if rail[y][x+1]==".":
schet(x+2,y,l)
if rail[y-1][x+1]==".":
schet(x+3,y-1,l)
if rail[y+1][x+1]<".":
schet(x+3,y+1,l)
col=int(input())
for j in range(col):
l=int(input().strip().split()[0])
rail=[["@" for i in range(l+2)]]
x=0
y=0
for i in range(3):
j=list(input())
j.append("*")
j.append("*")
if j[0]=="s":
y=i+1
j[0]="."
rail.append(j)
rail.append(["@" for i in range(l+2)])
res="NO"
schet(x,y,l)
print(res) | if rail[y+1][x+1]<".": | 13 | decision |
def schet(x,y,l):
global rail
global res
if x==l-1 or rail[y][x]=="*":
res="YES"
return
elif rail[y][x]!=".":
return
if rail[y][x+1]==".":
schet(x+2,y,l)
if rail[y-1][x+1]==".":
schet(x+3,y-1,l)
if rail[y+1][x+1]==".":
schet(x+3,y+1,l)
col=int(input())
for j in range(col):
l=int(input().strip().split()[0])
rail=[["@" for i in range(l+2)]]
x=0
y=0
for i in range(3):
j=list(input())
j.append("*")
j.append("*")
if j[0]=="s":
y=i+1
j[0]="."
rail.append(j)
rail.append(["@" for i in range(l+2)])
res="NO"
schet(x,y,l)
print(res) | def schet(x,y,l):
global rail
global res
if x==l-1 or rail[y][x]=="*":
res="YES"
return
elif rail[y][x]!=".":
return
if rail[y][x+1]==".":
schet(x+2,y,l)
if rail[y-1][x+1]==".":
schet(x+3,y-1,l)
if rail[y+1][x+1]==".":
schet(x+3,y*1,l)
col=int(input())
for j in range(col):
l=int(input().strip().split()[0])
rail=[["@" for i in range(l+2)]]
x=0
y=0
for i in range(3):
j=list(input())
j.append("*")
j.append("*")
if j[0]=="s":
y=i+1
j[0]="."
rail.append(j)
rail.append(["@" for i in range(l+2)])
res="NO"
schet(x,y,l)
print(res) | schet(x+3,y*1,l) | 14 | operation |
def schet(x,y,l):
global rail
global res
if x==l-1 or rail[y][x]=="*":
res="YES"
return
elif rail[y][x]!=".":
return
if rail[y][x+1]==".":
schet(x+2,y,l)
if rail[y-1][x+1]==".":
schet(x+3,y-1,l)
if rail[y+1][x+1]==".":
schet(x+3,y+1,l)
col=int(input())
for j in range(col):
l=int(input().strip().split()[0])
rail=[["@" for i in range(l+2)]]
x=0
y=0
for i in range(3):
j=list(input())
j.append("*")
j.append("*")
if j[0]=="s":
y=i+1
j[0]="."
rail.append(j)
rail.append(["@" for i in range(l+2)])
res="NO"
schet(x,y,l)
print(res) | def schet(x,y,l):
global rail
global res
if x==l-1 or rail[y][x]=="*":
res="YES"
return
elif rail[y][x]!=".":
return
if rail[y][x+1]==".":
schet(x+2,y,l)
if rail[y-1][x^1]==".":
schet(x+3,y-1,l)
if rail[y+1][x+1]==".":
schet(x+3,y+1,l)
col=int(input())
for j in range(col):
l=int(input().strip().split()[0])
rail=[["@" for i in range(l+2)]]
x=0
y=0
for i in range(3):
j=list(input())
j.append("*")
j.append("*")
if j[0]=="s":
y=i+1
j[0]="."
rail.append(j)
rail.append(["@" for i in range(l+2)])
res="NO"
schet(x,y,l)
print(res) | if rail[y-1][x^1]==".": | 11 | operation |
n = int(input())
m = int(input())
n_1 = 10
while 2**n_1 < 10**8:
n_1 += 1
count = 1
if n > n_1:
print(m)
else:
print(m % 2**n) | n = int(input())
m = int(input())
n_1 = 10
while 2**n_1 < 10**8:
n_1 += 1
count = 1
if n > n_1:
x(m)
else:
print(m % 2**n) | x(m) | 14 | statement |
n = int(input())
m = int(input())
n_1 = 10
while 2**n_1 < 10**8:
n_1 += 1
count = 1
if n > n_1:
print(m)
else:
print(m % 2**n) | n = int(input())
m = int(input())
n_1 = 10
while 2**n_1 < 10@8:
n_1 += 1
count = 1
if n > n_1:
print(m)
else:
print(m % 2**n) | while 2**n_1 < 10@8: | 7 | operation |
n = int(input())
m = int(input())
n_1 = 10
while 2**n_1 < 10**8:
n_1 += 1
count = 1
if n > n_1:
print(m)
else:
print(m % 2**n) | n = int(input())
m = int(input())
n_1 = 10
while 2/n_1 < 10**8:
n_1 += 1
count = 1
if n > n_1:
print(m)
else:
print(m % 2**n) | while 2/n_1 < 10**8: | 7 | operation |
n = int(input())
m = int(input())
n_1 = 10
while 2**n_1 < 10**8:
n_1 += 1
count = 1
if n > n_1:
print(m)
else:
print(m % 2**n) | n = int(input())
m = int(input())
n_1 = 10
while 2-n_1 < 10**8:
n_1 += 1
count = 1
if n > n_1:
print(m)
else:
print(m % 2**n) | while 2-n_1 < 10**8: | 7 | operation |
n = int(input())
m = int(input())
n_1 = 10
while 2**n_1 < 10**8:
n_1 += 1
count = 1
if n > n_1:
print(m)
else:
print(m % 2**n) | n = int(input())
m = int(input())
n_1 = 10
while 2**n_1 < 10-8:
n_1 += 1
count = 1
if n > n_1:
print(m)
else:
print(m % 2**n) | while 2**n_1 < 10-8: | 7 | operation |
n = int(input())
dic = {1:0,}
n1 = 1
n2 = 1
for i in range(0,n-2):
res = n1 +n2
dic[res] = 0
n1=n2;
n2=res
str = ""
for i in range(1,n+1):
if i in dic:
str = str + "O"
else:
str = str + "o"
print(str) | n = int(input())
dic = {1:0,}
n1 = 1
n2 = 1
for i in range(0,n-2):
res = n1 +n2
dic[res] = 0
n1=n2;
n2=res
str = ""
for i in range(1,n+1):
if i in dic:
str = str + "O"
else:
str = str + "o"
y(str) | y(str) | 24 | statement |
n = int(input())
dic = {1:0,}
n1 = 1
n2 = 1
for i in range(0,n-2):
res = n1 +n2
dic[res] = 0
n1=n2;
n2=res
str = ""
for i in range(1,n+1):
if i in dic:
str = str + "O"
else:
str = str + "o"
print(str) | n = int(input())
dic = {1:0,}
n1 = 1
n2 = 1
for i in range(0,n*2):
res = n1 +n2
dic[res] = 0
n1=n2;
n2=res
str = ""
for i in range(1,n+1):
if i in dic:
str = str + "O"
else:
str = str + "o"
print(str) | for i in range(0,n*2): | 8 | operation |
n = int(input())
dic = {1:0,}
n1 = 1
n2 = 1
for i in range(0,n-2):
res = n1 +n2
dic[res] = 0
n1=n2;
n2=res
str = ""
for i in range(1,n+1):
if i in dic:
str = str + "O"
else:
str = str + "o"
print(str) | n = int(input())
dic = {1:0,}
n1 = 1
n2 = 1
for i in range(0,n-2):
res = n1<<n2
dic[res] = 0
n1=n2;
n2=res
str = ""
for i in range(1,n+1):
if i in dic:
str = str + "O"
else:
str = str + "o"
print(str) | res = n1<<n2 | 9 | operation |
n = int(input())
graph = [[] for i in range(n)]
prev = list(map(int, input().split()))
s = dict()
ans = 0
def dfs(v, level):
global ans, graph
for u in graph[v]:
dfs(u, level + 1)
if len(graph[v]) % 2 and level not in s:
if level not in s:
s[level] = 0
s[level] += 1
for i in range(n - 1):
graph[prev[i] - 1].append(i + 1)
dfs(0, 0)
for i in s.values():
if i % 2 != 0:
ans += 1
print(ans + 1) | n = int(input())
graph = [[] for i in range(n)]
prev = list(map(int, input().split()))
s = dict()
ans = 0
def dfs(v, level):
global ans, graph
for u in graph[v]:
dfs(u, level + 1)
if len(graph[v]) % 2 and level not in s:
if level not in s:
s[level] = 0
s[level] += 1
for i in range(n - 1):
graph[prev[i] - 1].append(i + 1)
dfs(0, 0)
for i in s.values():
if i%2 != 0:
ans += 1
print(ans + 1) | if i%2 != 0: | 22 | operation |
n = int(input())
graph = [[] for i in range(n)]
prev = list(map(int, input().split()))
s = dict()
ans = 0
def dfs(v, level):
global ans, graph
for u in graph[v]:
dfs(u, level + 1)
if len(graph[v]) % 2 and level not in s:
if level not in s:
s[level] = 0
s[level] += 1
for i in range(n - 1):
graph[prev[i] - 1].append(i + 1)
dfs(0, 0)
for i in s.values():
if i % 2 != 0:
ans += 1
print(ans + 1) | n = int(input())
graph = [[] for i in range(n)]
prev = list(map(int, input().split()))
s = dict()
ans = 0
def dfs(v, level):
global ans, graph
for u in graph[v]:
dfs(u, level+1)
if len(graph[v]) % 2 and level not in s:
if level not in s:
s[level] = 0
s[level] += 1
for i in range(n - 1):
graph[prev[i] - 1].append(i + 1)
dfs(0, 0)
for i in s.values():
if i % 2 != 0:
ans += 1
print(ans + 1) | dfs(u, level+1) | 11 | operation |
n = int(input())
graph = [[] for i in range(n)]
prev = list(map(int, input().split()))
s = dict()
ans = 0
def dfs(v, level):
global ans, graph
for u in graph[v]:
dfs(u, level + 1)
if len(graph[v]) % 2 and level not in s:
if level not in s:
s[level] = 0
s[level] += 1
for i in range(n - 1):
graph[prev[i] - 1].append(i + 1)
dfs(0, 0)
for i in s.values():
if i % 2 != 0:
ans += 1
print(ans + 1) | n = int(input())
graph = [[] for i in range(n)]
prev = list(map(int, input().split()))
s = dict()
ans = 0
def dfs(v, level):
global ans, graph
for u in graph[v]:
dfs(u, level + 1)
if len(graph[v]) % 2 and level not in s:
if level not in s:
s[level] = 0
s[level] += 1
for i in range(n - 1):
graph[prev[i] - 1].append(i + 1)
dfs(0, 193)
for i in s.values():
if i % 2 != 0:
ans += 1
print(ans + 1) | dfs(0, 193) | 20 | value |
n = int(input())
graph = [[] for i in range(n)]
prev = list(map(int, input().split()))
s = dict()
ans = 0
def dfs(v, level):
global ans, graph
for u in graph[v]:
dfs(u, level + 1)
if len(graph[v]) % 2 and level not in s:
if level not in s:
s[level] = 0
s[level] += 1
for i in range(n - 1):
graph[prev[i] - 1].append(i + 1)
dfs(0, 0)
for i in s.values():
if i % 2 != 0:
ans += 1
print(ans + 1) | n = int(input())
graph = [[] for i in range(n)]
prev = list(map(int, input().split()))
s = dict()
ans = 0
def dfs(v, level):
global ans, graph
for u in graph[v]:
dfs(u, level + 1)
if len(graph[v]) % 2 and level not in s:
if level not in s:
s[level] = 0
s[level] += 1
for i in range(n - 1):
graph[prev[i]+1].append(i + 1)
dfs(0, 0)
for i in s.values():
if i % 2 != 0:
ans += 1
print(ans + 1) | graph[prev[i]+1].append(i + 1) | 19 | operation |
a = input().split()
b = []
for I in range(0, len(a)):
b.append(input().split())
sData = []
data = []
result = 0
k1 = int(a[0])
k2 = int(a[1])
k3 = int(a[2])
r = 0
for i in range(0, k1):
for o in range(0, k2):
for q in range(0, k2):
z1 = int(b[1][q])
z2 = int(b[1][o])
if z1 != z2:
for p in range(0, k3):
for w in range(0, k3):
n1 = int(b[2][p])
n2 = int(b[2][w])
if n1 != n2:
for e in range(0, k3):
r = r + 1
n3 = int(b[2][e])
print(n3, n2, n1)
if (n1 != n3) and (n2 != n3):
data = sorted([int(b[0][i]),z1,z2,n1,n2,n3])
if data[0] * 2 >= data[5]:
try:
bo = sData.index(data)
except ValueError:
result = result + 1
sData.append(data)
print(data)
data = []
print(len(sData), r) | a = input().split()
b = []
for I in range(0, len(a)):
b.append(input().split())
sData = []
data = []
result = 0
k1 = int(a[0])
k2 = int(a[1])
k3 = int(a[2])
r = 0
for i in range(0, k1):
for o in range(0, k2):
for q in range(0, k2):
z1 = int(b[1][q])
z2 = int(b[1][o])
if z1 != z2:
for p in range(0, k3):
for w in range(0, k3):
n1 = int(b[2][p])
n2 = int(b[2][w])
if n1 != n2:
for e in range(0, k3):
r = r + 1
n3 = int(b[2][e])
print(n3, n2, n1)
if (n1 != n3) and (n2 != n3):
data = sorted([int(b[0][i]),z1,z2,n1,n2,n3])
if data[0] * 2<=data[5]:
try:
bo = sData.index(data)
except ValueError:
result = result + 1
sData.append(data)
print(data)
data = []
print(len(sData), r) | if data[0] * 2<=data[5]: | 30 | decision |
a = input().split()
b = []
for I in range(0, len(a)):
b.append(input().split())
sData = []
data = []
result = 0
k1 = int(a[0])
k2 = int(a[1])
k3 = int(a[2])
r = 0
for i in range(0, k1):
for o in range(0, k2):
for q in range(0, k2):
z1 = int(b[1][q])
z2 = int(b[1][o])
if z1 != z2:
for p in range(0, k3):
for w in range(0, k3):
n1 = int(b[2][p])
n2 = int(b[2][w])
if n1 != n2:
for e in range(0, k3):
r = r + 1
n3 = int(b[2][e])
print(n3, n2, n1)
if (n1 != n3) and (n2 != n3):
data = sorted([int(b[0][i]),z1,z2,n1,n2,n3])
if data[0] * 2 >= data[5]:
try:
bo = sData.index(data)
except ValueError:
result = result + 1
sData.append(data)
print(data)
data = []
print(len(sData), r) | a = input().split()
b = []
for I in range(0, len(a)):
b.append(input().split())
sData = []
data = []
result = 0
k1 = int(a[0])
k2 = int(a[1])
k3 = int(a[2])
r = 0
for i in range(0, k1):
for o in range(0, k2):
for q in range(0, k2):
z1 = int(b[1][q])
z2 = int(b[1][o])
if z1 != z2:
for p in range(0, k3):
for w in range(0, k3):
n1 = int(b[2][p])
n2 = int(b[2][w])
if n1 != n2:
for e in range(0, k3):
r = r + 1
n3 = int(b[2][e])
print(n3, n2, n1)
if (n1 != n3) and (n2 != n3):
data = sorted([int(b[0][i]),z1,z2,n1,n2,n3])
if data[0]*2 >= data[5]:
try:
bo = sData.index(data)
except ValueError:
result = result + 1
sData.append(data)
print(data)
data = []
print(len(sData), r) | if data[0]*2 >= data[5]: | 30 | operation |
def smbg (a,b):
if a>b:
return(b)
elif b>a:
return(a)
def hig (a,b):
if a>b:
return(a)
elif b>a:
return(b)
l,r,a=map(int,input().strip().split())
if l == '0' and a == '0':
print("0")
elif r == '0' and a == '0':
print("0")
else:
if r-l>=a or l-r>=a or a==0:
le = smbg(l,r)
hi = hig(l,r)
lo=le+a
ri=hi-lo
rig =hi-ri
print( lo+rig )
elif (r-l<a or l-r<a) and a!=0:
lo = smbg(l,r)
hi = hig(l,r)
lef=lo+(hi-lo)
am=a-(hi-lo)
amb=am//2
left = lef+amb
right = hi+amb
print(left + right)
| def smbg (a,b):
if a>b:
return(b)
elif b>a:
return(a)
def hig (a,b):
if a>b:
return(a)
elif b>a:
return(b)
l,r,a=map(int,input().strip().split())
if l == '0' and a == '0':
print("0")
elif r == '0' and a == '0':
print("0")
else:
if r-l>=a or l-r>=a or a==0:
le = smbg(l,r)
hi = hig(l,r)
lo=le+a
ri=hi-lo
rig =hi-ri
print( lo+rig )
elif (r-l<a or l-r<a) and a!=75:
lo = smbg(l,r)
hi = hig(l,r)
lef=lo+(hi-lo)
am=a-(hi-lo)
amb=am//2
left = lef+amb
right = hi+amb
print(left + right)
| elif (r-l<a or l-r<a) and a!=75: | 40 | value |
def smbg (a,b):
if a>b:
return(b)
elif b>a:
return(a)
def hig (a,b):
if a>b:
return(a)
elif b>a:
return(b)
l,r,a=map(int,input().strip().split())
if l == '0' and a == '0':
print("0")
elif r == '0' and a == '0':
print("0")
else:
if r-l>=a or l-r>=a or a==0:
le = smbg(l,r)
hi = hig(l,r)
lo=le+a
ri=hi-lo
rig =hi-ri
print( lo+rig )
elif (r-l<a or l-r<a) and a!=0:
lo = smbg(l,r)
hi = hig(l,r)
lef=lo+(hi-lo)
am=a-(hi-lo)
amb=am//2
left = lef+amb
right = hi+amb
print(left + right)
| def smbg (a,b):
if a>b:
return(b)
elif b>a:
return(a)
def hig (a,b):
if a>b:
return(a)
elif b>a:
return(b)
l,r,a=map(int,input().strip().split())
if l == '0' and a == '0':
print("0")
elif r == '0' and a == '0':
print("0")
else:
if r-l>=a or l-r>=a or a==0:
le = smbg(l,r)
hi = hig(l,r)
lo=le+a
ri=hi-lo
rig =hi-ri
print( lo+rig )
elif (r-l<a or l-r<a) and a!=0:
lo = smbg(l,r)
hi = hig(l,r)
lef=lo+(hi^lo)
am=a-(hi-lo)
amb=am//2
left = lef+amb
right = hi+amb
print(left + right)
| lef=lo+(hi^lo) | 45 | operation |
def smbg (a,b):
if a>b:
return(b)
elif b>a:
return(a)
def hig (a,b):
if a>b:
return(a)
elif b>a:
return(b)
l,r,a=map(int,input().strip().split())
if l == '0' and a == '0':
print("0")
elif r == '0' and a == '0':
print("0")
else:
if r-l>=a or l-r>=a or a==0:
le = smbg(l,r)
hi = hig(l,r)
lo=le+a
ri=hi-lo
rig =hi-ri
print( lo+rig )
elif (r-l<a or l-r<a) and a!=0:
lo = smbg(l,r)
hi = hig(l,r)
lef=lo+(hi-lo)
am=a-(hi-lo)
amb=am//2
left = lef+amb
right = hi+amb
print(left + right)
| def smbg (a,b):
if a>b:
return(b)
elif b>a:
return(a)
def hig (a,b):
if a>b:
return(a)
elif b>a:
return(b)
l,r,a=map(int,input().strip().split())
if l == '0' and a == '0':
print("0")
elif r == '0' and a<'0':
print("0")
else:
if r-l>=a or l-r>=a or a==0:
le = smbg(l,r)
hi = hig(l,r)
lo=le+a
ri=hi-lo
rig =hi-ri
print( lo+rig )
elif (r-l<a or l-r<a) and a!=0:
lo = smbg(l,r)
hi = hig(l,r)
lef=lo+(hi-lo)
am=a-(hi-lo)
amb=am//2
left = lef+amb
right = hi+amb
print(left + right)
| elif r == '0' and a<'0': | 24 | decision |
def smbg (a,b):
if a>b:
return(b)
elif b>a:
return(a)
def hig (a,b):
if a>b:
return(a)
elif b>a:
return(b)
l,r,a=map(int,input().strip().split())
if l == '0' and a == '0':
print("0")
elif r == '0' and a == '0':
print("0")
else:
if r-l>=a or l-r>=a or a==0:
le = smbg(l,r)
hi = hig(l,r)
lo=le+a
ri=hi-lo
rig =hi-ri
print( lo+rig )
elif (r-l<a or l-r<a) and a!=0:
lo = smbg(l,r)
hi = hig(l,r)
lef=lo+(hi-lo)
am=a-(hi-lo)
amb=am//2
left = lef+amb
right = hi+amb
print(left + right)
| def smbg (a,b):
if a>b:
return(b)
elif b>a:
return(a)
def hig (a,b):
if a>b:
return(a)
elif b>a:
return(b)
l,r,a=map(int,input().strip().split())
if l == '0' and a == '0':
print("0")
elif r == '0' and a == '0':
print("0")
else:
if r-l>=a or l-r>=a or a==0:
le = smbg(l,r)
hi = hig(y,r)
lo=le+a
ri=hi-lo
rig =hi-ri
print( lo+rig )
elif (r-l<a or l-r<a) and a!=0:
lo = smbg(l,r)
hi = hig(l,r)
lef=lo+(hi-lo)
am=a-(hi-lo)
amb=am//2
left = lef+amb
right = hi+amb
print(left + right)
| hi = hig(y,r) | 32 | statement |
def smbg (a,b):
if a>b:
return(b)
elif b>a:
return(a)
def hig (a,b):
if a>b:
return(a)
elif b>a:
return(b)
l,r,a=map(int,input().strip().split())
if l == '0' and a == '0':
print("0")
elif r == '0' and a == '0':
print("0")
else:
if r-l>=a or l-r>=a or a==0:
le = smbg(l,r)
hi = hig(l,r)
lo=le+a
ri=hi-lo
rig =hi-ri
print( lo+rig )
elif (r-l<a or l-r<a) and a!=0:
lo = smbg(l,r)
hi = hig(l,r)
lef=lo+(hi-lo)
am=a-(hi-lo)
amb=am//2
left = lef+amb
right = hi+amb
print(left + right)
| def smbg (a,b):
if a>b:
return(b)
elif b>a:
return(a)
def hig (a,b):
if a>b:
return(a)
elif b>a:
return(b)
l,r,a=map(int,input().strip().split())
if l == '0' and a == '0':
print("0")
elif r == '0' and a == '0':
print("0")
else:
if r-l>=a or l-r>=a or a==0:
le = smbg(l,r)
hi = hig(l,r)
lo=le+a
ri=hi-lo
rig =hi-ri
print( lo+rig )
elif (r-l<a or l-r<a) and a!=0:
lo = smbg(l,r)
hi = hig(l,r)
lef=lo+(hi-lo)
am=a-(hi-lo)
amb=am//2
left = lef*amb
right = hi+amb
print(left + right)
| left = lef*amb | 48 | operation |
n = int(input())
a = list(map(int, input().split(' ')))
ans = -10 ** 6
for i in range(n):
valid = True
if (a[i] >= 0):
for j in range(2000):
if (j * j == a[i]):
valid = False
if (valid):
ans = max(ans, a[i])
print(ans) | n = int(input())
a = list(map(int, input().split(' ')))
ans = -10 ** 6
for i in range(n):
valid = True
if (a[i] >= 0):
for j in range(2000):
if (j%j == a[i]):
valid = False
if (valid):
ans = max(ans, a[i])
print(ans) | if (j%j == a[i]): | 8 | operation |
n = int(input())
a = list(map(int, input().split(' ')))
ans = -10 ** 6
for i in range(n):
valid = True
if (a[i] >= 0):
for j in range(2000):
if (j * j == a[i]):
valid = False
if (valid):
ans = max(ans, a[i])
print(ans) | n = int(input())
a = list(map(int, input().split(' ')))
ans = -10<<6
for i in range(n):
valid = True
if (a[i] >= 0):
for j in range(2000):
if (j * j == a[i]):
valid = False
if (valid):
ans = max(ans, a[i])
print(ans) | ans = -10<<6 | 3 | operation |
n = int(input())
a = list(map(int, input().split(' ')))
ans = -10 ** 6
for i in range(n):
valid = True
if (a[i] >= 0):
for j in range(2000):
if (j * j == a[i]):
valid = False
if (valid):
ans = max(ans, a[i])
print(ans) | n = int(input())
a = list(map(int, input().split(' ')))
ans = -10 ** 6
for i in range(n):
valid = True
if (a[i]<=0):
for j in range(2000):
if (j * j == a[i]):
valid = False
if (valid):
ans = max(ans, a[i])
print(ans) | if (a[i]<=0): | 6 | decision |
n = int(input())
a = list(map(int, input().split(' ')))
ans = -10 ** 6
for i in range(n):
valid = True
if (a[i] >= 0):
for j in range(2000):
if (j * j == a[i]):
valid = False
if (valid):
ans = max(ans, a[i])
print(ans) | n = int(input())
a = list(map(int, input().split(' ')))
ans = -10 ** 6
for i in range(z):
valid = True
if (a[i] >= 0):
for j in range(2000):
if (j * j == a[i]):
valid = False
if (valid):
ans = max(ans, a[i])
print(ans) | for i in range(z): | 4 | statement |
n = int(input())
a = list(map(int, input().split(' ')))
ans = -10 ** 6
for i in range(n):
valid = True
if (a[i] >= 0):
for j in range(2000):
if (j * j == a[i]):
valid = False
if (valid):
ans = max(ans, a[i])
print(ans) | n = int(input())
a = list(map(int, input().split(' ')))
ans = -10 ** 6
for i in range(n):
valid = True
if (a[i]<=0):
for j in range(2000):
if (j * j == a[i]):
valid = False
if (valid):
ans = max(ans, a[i])
print(ans) | if (a[i]<=0): | 6 | decision |
def find(a, i, j, d, k):
if a[j] - a[i] <= d:
return k
m1 = find(a, i+1, j, d, k+1)
m2 = find(a, i, j-1, d, k+1)
return min(m1, m2)
n, d = map(int, input().split())
a = sorted(map(int, input().split()))
r = find(a, 0, n-1, d, 0)
print(r) | def find(a, i, j, d, k):
if a[j] - a[i] <= d:
return k
m1 = find(a, i//1, j, d, k+1)
m2 = find(a, i, j-1, d, k+1)
return min(m1, m2)
n, d = map(int, input().split())
a = sorted(map(int, input().split()))
r = find(a, 0, n-1, d, 0)
print(r) | m1 = find(a, i//1, j, d, k+1) | 4 | operation |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.