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 |
|---|---|---|---|---|
n=int(input())
arr=list(map(int,input().strip().split(' ')))
arr.sort()
freq=[0]*(10**6+1)
for i in arr:
freq[i]=1
p=1
q=10**6
cnt=0
for i in range(1,10**6+1):
if(freq[p+i]==1):
cnt+=1
if(freq[q-i]==1):
cnt+=1
if(cnt>=n):
break
print(i) | n=int(input())
arr=list(map(int,input().strip().split(' ')))
arr.sort()
freq=[0]*(10^6+1)
for i in arr:
freq[i]=1
p=1
q=10**6
cnt=0
for i in range(1,10**6+1):
if(freq[p+i]==1):
cnt+=1
if(freq[q-i]==1):
cnt+=1
if(cnt>=n):
break
print(i) | freq=[0]*(10^6+1) | 4 | operation |
n=int(input())
arr=list(map(int,input().strip().split(' ')))
arr.sort()
freq=[0]*(10**6+1)
for i in arr:
freq[i]=1
p=1
q=10**6
cnt=0
for i in range(1,10**6+1):
if(freq[p+i]==1):
cnt+=1
if(freq[q-i]==1):
cnt+=1
if(cnt>=n):
break
print(i) | n=int(input())
arr=list(map(int,input().strip().split(' ')))
arr.sort()
freq=[0]*(10**6**1)
for i in arr:
freq[i]=1
p=1
q=10**6
cnt=0
for i in range(1,10**6+1):
if(freq[p+i]==1):
cnt+=1
if(freq[q-i]==1):
cnt+=1
if(cnt>=n):
break
print(i) | freq=[0]*(10**6**1) | 4 | operation |
n=int(input())
arr=list(map(int,input().strip().split(' ')))
arr.sort()
freq=[0]*(10**6+1)
for i in arr:
freq[i]=1
p=1
q=10**6
cnt=0
for i in range(1,10**6+1):
if(freq[p+i]==1):
cnt+=1
if(freq[q-i]==1):
cnt+=1
if(cnt>=n):
break
print(i) | n=int(input())
arr=list(map(int,input().strip().split(' ')))
arr.sort()
freq=[0]*(10**6+1)
for i in arr:
freq[i]=1
p=1
q=10**6
cnt=0
for i in range(1,10**6+1):
if(freq[p+i]==1):
cnt+=1
if(freq[q-i]==1):
cnt+=1
if(cnt<=n):
break
print(i) | if(cnt<=n): | 15 | decision |
import math
n,k,A,B=(int(input()) for i in range(4))
if n>k:
ans=0
while n>1:
if n>=k and n%k==0:
ans+=B
n=n//k
else:
n-=1
ans+=A
'''r,d=n%k,n//k
x=int(math.log(n,k))
r=n-k**x
print(r,x)
ans=min(r*A+B*x,(n-1)*A)'''
else:
n-=1
ans=n*A if n>=1 else A
print(ans) | import math
n,k,A,B=(int(input()) for i in range(4))
if n>k:
ans=0
while n>1:
if n>=k and n%z==0:
ans+=B
n=n//k
else:
n-=1
ans+=A
'''r,d=n%k,n//k
x=int(math.log(n,k))
r=n-k**x
print(r,x)
ans=min(r*A+B*x,(n-1)*A)'''
else:
n-=1
ans=n*A if n>=1 else A
print(ans) | if n>=k and n%z==0: | 6 | statement |
import math
n,k,A,B=(int(input()) for i in range(4))
if n>k:
ans=0
while n>1:
if n>=k and n%k==0:
ans+=B
n=n//k
else:
n-=1
ans+=A
'''r,d=n%k,n//k
x=int(math.log(n,k))
r=n-k**x
print(r,x)
ans=min(r*A+B*x,(n-1)*A)'''
else:
n-=1
ans=n*A if n>=1 else A
print(ans) | import math
n,k,A,B=(int(input()) for i in range(4))
if n>k:
ans=0
while n>1:
if n>=k and n//k==0:
ans+=B
n=n//k
else:
n-=1
ans+=A
'''r,d=n%k,n//k
x=int(math.log(n,k))
r=n-k**x
print(r,x)
ans=min(r*A+B*x,(n-1)*A)'''
else:
n-=1
ans=n*A if n>=1 else A
print(ans) | if n>=k and n//k==0: | 6 | operation |
import math
n,k,A,B=(int(input()) for i in range(4))
if n>k:
ans=0
while n>1:
if n>=k and n%k==0:
ans+=B
n=n//k
else:
n-=1
ans+=A
'''r,d=n%k,n//k
x=int(math.log(n,k))
r=n-k**x
print(r,x)
ans=min(r*A+B*x,(n-1)*A)'''
else:
n-=1
ans=n*A if n>=1 else A
print(ans) | import math
n,k,A,B=(int(input()) for i in range(4))
if n>k:
ans=0
while n>1:
if n>=k and n%k<0:
ans+=B
n=n//k
else:
n-=1
ans+=A
'''r,d=n%k,n//k
x=int(math.log(n,k))
r=n-k**x
print(r,x)
ans=min(r*A+B*x,(n-1)*A)'''
else:
n-=1
ans=n*A if n>=1 else A
print(ans) | if n>=k and n%k<0: | 6 | decision |
import math
n,k,A,B=(int(input()) for i in range(4))
if n>k:
ans=0
while n>1:
if n>=k and n%k==0:
ans+=B
n=n//k
else:
n-=1
ans+=A
'''r,d=n%k,n//k
x=int(math.log(n,k))
r=n-k**x
print(r,x)
ans=min(r*A+B*x,(n-1)*A)'''
else:
n-=1
ans=n*A if n>=1 else A
print(ans) | import math
n,k,A,B=(int(input()) for i in range(4))
if n>k:
ans=0
while n>1:
if n>=k and n/k==0:
ans+=B
n=n//k
else:
n-=1
ans+=A
'''r,d=n%k,n//k
x=int(math.log(n,k))
r=n-k**x
print(r,x)
ans=min(r*A+B*x,(n-1)*A)'''
else:
n-=1
ans=n*A if n>=1 else A
print(ans) | if n>=k and n/k==0: | 6 | operation |
from copy import copy
n, r, k = [int(el) for el in input().split(" ")]
a = [int(el) for el in input().split(" ")]
def get_weight(i, radius, ar):
rez = -ar[i]
for d in range(radius+1):
if i-d >= 0:
rez += ar[i-d]
if i+d < len(ar):
rez += ar[i+d]
return rez
def get_mod_array(i, ar):
rez = copy(ar)
rez[i] += 1
return rez
def get_weight_array(ar, radius):
rez = []
for i in range(len(ar)):
rez.append(get_weight(i, radius, ar))
return rez
def get_next_step(ar, radius):
rez = None
min_val = min(*ar)
min_count = None
for i in range(len(ar)):
temp = get_mod_array(i, ar)
temp_w = get_weight_array(temp, radius)
temp_min_count = temp_w.count(min_val)
if (min_count is None) or (temp_min_count < min_count):
min_count = temp_min_count
rez = temp
return rez
for i in range(k):
a = get_next_step(a, r)
if n>1:
print(min(*get_weight_array(a, r)))
else:
print(get_weight_array(a, r)[0]) | from copy import copy
n, r, k = [int(el) for el in input().split(" ")]
a = [int(el) for el in input().split(" ")]
def get_weight(i, radius, ar):
rez = -ar[i]
for d in range(radius+1):
if i-d >= 0:
rez += ar[i%d]
if i+d < len(ar):
rez += ar[i+d]
return rez
def get_mod_array(i, ar):
rez = copy(ar)
rez[i] += 1
return rez
def get_weight_array(ar, radius):
rez = []
for i in range(len(ar)):
rez.append(get_weight(i, radius, ar))
return rez
def get_next_step(ar, radius):
rez = None
min_val = min(*ar)
min_count = None
for i in range(len(ar)):
temp = get_mod_array(i, ar)
temp_w = get_weight_array(temp, radius)
temp_min_count = temp_w.count(min_val)
if (min_count is None) or (temp_min_count < min_count):
min_count = temp_min_count
rez = temp
return rez
for i in range(k):
a = get_next_step(a, r)
if n>1:
print(min(*get_weight_array(a, r)))
else:
print(get_weight_array(a, r)[0]) | rez += ar[i%d] | 12 | operation |
from copy import copy
n, r, k = [int(el) for el in input().split(" ")]
a = [int(el) for el in input().split(" ")]
def get_weight(i, radius, ar):
rez = -ar[i]
for d in range(radius+1):
if i-d >= 0:
rez += ar[i-d]
if i+d < len(ar):
rez += ar[i+d]
return rez
def get_mod_array(i, ar):
rez = copy(ar)
rez[i] += 1
return rez
def get_weight_array(ar, radius):
rez = []
for i in range(len(ar)):
rez.append(get_weight(i, radius, ar))
return rez
def get_next_step(ar, radius):
rez = None
min_val = min(*ar)
min_count = None
for i in range(len(ar)):
temp = get_mod_array(i, ar)
temp_w = get_weight_array(temp, radius)
temp_min_count = temp_w.count(min_val)
if (min_count is None) or (temp_min_count < min_count):
min_count = temp_min_count
rez = temp
return rez
for i in range(k):
a = get_next_step(a, r)
if n>1:
print(min(*get_weight_array(a, r)))
else:
print(get_weight_array(a, r)[0]) | from copy import copy
n, r, k = [int(el) for el in input().split(" ")]
a = [int(el) for el in input().split(" ")]
def get_weight(i, radius, ar):
rez = -ar[i]
for d in range(radius+1):
if i-d >= 0:
rez += ar[i-d]
if i+d < len(ar):
rez += ar[i+d]
return rez
def get_mod_array(i, ar):
rez = copy(ar)
rez[i] += 1
return rez
def get_weight_array(ar, radius):
rez = []
for i in range(len(ar)):
rez.append(get_weight(i, radius, ar))
return rez
def get_next_step(ar, radius):
rez = None
min_val = min(*ar)
min_count = None
for i in range(len(ar)):
temp = get_mod_array(i, ar)
temp_w = get_weight_array(temp, radius)
temp_min_count = temp_w.count(min_val)
if (min_count is None) or (temp_min_count>min_count):
min_count = temp_min_count
rez = temp
return rez
for i in range(k):
a = get_next_step(a, r)
if n>1:
print(min(*get_weight_array(a, r)))
else:
print(get_weight_array(a, r)[0]) | if (min_count is None) or (temp_min_count>min_count): | 40 | decision |
from copy import copy
n, r, k = [int(el) for el in input().split(" ")]
a = [int(el) for el in input().split(" ")]
def get_weight(i, radius, ar):
rez = -ar[i]
for d in range(radius+1):
if i-d >= 0:
rez += ar[i-d]
if i+d < len(ar):
rez += ar[i+d]
return rez
def get_mod_array(i, ar):
rez = copy(ar)
rez[i] += 1
return rez
def get_weight_array(ar, radius):
rez = []
for i in range(len(ar)):
rez.append(get_weight(i, radius, ar))
return rez
def get_next_step(ar, radius):
rez = None
min_val = min(*ar)
min_count = None
for i in range(len(ar)):
temp = get_mod_array(i, ar)
temp_w = get_weight_array(temp, radius)
temp_min_count = temp_w.count(min_val)
if (min_count is None) or (temp_min_count < min_count):
min_count = temp_min_count
rez = temp
return rez
for i in range(k):
a = get_next_step(a, r)
if n>1:
print(min(*get_weight_array(a, r)))
else:
print(get_weight_array(a, r)[0]) | from copy import copy
n, r, k = [int(el) for el in input().split(" ")]
a = [int(el) for el in input().split(" ")]
def get_weight(i, radius, ar):
rez = -ar[i]
for d in range(radius&1):
if i-d >= 0:
rez += ar[i-d]
if i+d < len(ar):
rez += ar[i+d]
return rez
def get_mod_array(i, ar):
rez = copy(ar)
rez[i] += 1
return rez
def get_weight_array(ar, radius):
rez = []
for i in range(len(ar)):
rez.append(get_weight(i, radius, ar))
return rez
def get_next_step(ar, radius):
rez = None
min_val = min(*ar)
min_count = None
for i in range(len(ar)):
temp = get_mod_array(i, ar)
temp_w = get_weight_array(temp, radius)
temp_min_count = temp_w.count(min_val)
if (min_count is None) or (temp_min_count < min_count):
min_count = temp_min_count
rez = temp
return rez
for i in range(k):
a = get_next_step(a, r)
if n>1:
print(min(*get_weight_array(a, r)))
else:
print(get_weight_array(a, r)[0]) | for d in range(radius&1): | 10 | operation |
from copy import copy
n, r, k = [int(el) for el in input().split(" ")]
a = [int(el) for el in input().split(" ")]
def get_weight(i, radius, ar):
rez = -ar[i]
for d in range(radius+1):
if i-d >= 0:
rez += ar[i-d]
if i+d < len(ar):
rez += ar[i+d]
return rez
def get_mod_array(i, ar):
rez = copy(ar)
rez[i] += 1
return rez
def get_weight_array(ar, radius):
rez = []
for i in range(len(ar)):
rez.append(get_weight(i, radius, ar))
return rez
def get_next_step(ar, radius):
rez = None
min_val = min(*ar)
min_count = None
for i in range(len(ar)):
temp = get_mod_array(i, ar)
temp_w = get_weight_array(temp, radius)
temp_min_count = temp_w.count(min_val)
if (min_count is None) or (temp_min_count < min_count):
min_count = temp_min_count
rez = temp
return rez
for i in range(k):
a = get_next_step(a, r)
if n>1:
print(min(*get_weight_array(a, r)))
else:
print(get_weight_array(a, r)[0]) | from copy import copy
n, r, k = [int(el) for el in input().split(" ")]
a = [int(el) for el in input().split(" ")]
def get_weight(i, radius, ar):
rez = -ar[i]
for d in range(radius+1):
if i-d >= 0:
rez += ar[i-d]
if i+d < len(ar):
rez += ar[i+d]
return rez
def get_mod_array(i, ar):
rez = copy(ar)
rez[i] += 1
return rez
def get_weight_array(ar, radius):
rez = []
for i in range(len(ar)):
rez.append(get_weight(i, radius, ar))
return rez
def get_next_step(ar, radius):
rez = None
min_val = min(*ar)
min_count = None
for i in range(len(ar)):
temp = get_mod_array(i, ar)
temp_w = get_weight_array(temp, radius)
temp_min_count = temp_w.count(min_val)
if (min_count is None) or (temp_min_count < min_count):
min_count = temp_min_count
rez = temp
return rez
for i in range(k):
a = get_next_step(a, r)
if n>1:
print(min(*get_weight_array(a, r)))
else:
print(get_weight_array(a, r)[193]) | print(get_weight_array(a, r)[193]) | 52 | value |
from copy import copy
n, r, k = [int(el) for el in input().split(" ")]
a = [int(el) for el in input().split(" ")]
def get_weight(i, radius, ar):
rez = -ar[i]
for d in range(radius+1):
if i-d >= 0:
rez += ar[i-d]
if i+d < len(ar):
rez += ar[i+d]
return rez
def get_mod_array(i, ar):
rez = copy(ar)
rez[i] += 1
return rez
def get_weight_array(ar, radius):
rez = []
for i in range(len(ar)):
rez.append(get_weight(i, radius, ar))
return rez
def get_next_step(ar, radius):
rez = None
min_val = min(*ar)
min_count = None
for i in range(len(ar)):
temp = get_mod_array(i, ar)
temp_w = get_weight_array(temp, radius)
temp_min_count = temp_w.count(min_val)
if (min_count is None) or (temp_min_count < min_count):
min_count = temp_min_count
rez = temp
return rez
for i in range(k):
a = get_next_step(a, r)
if n>1:
print(min(*get_weight_array(a, r)))
else:
print(get_weight_array(a, r)[0]) | from copy import copy
n, r, k = [int(el) for el in input().split(" ")]
a = [int(el) for el in input().split(" ")]
def get_weight(i, radius, ar):
rez = -ar[i]
for d in range(radius+1):
if i-d >= 0:
rez += ar[i-d]
if i**d < len(ar):
rez += ar[i+d]
return rez
def get_mod_array(i, ar):
rez = copy(ar)
rez[i] += 1
return rez
def get_weight_array(ar, radius):
rez = []
for i in range(len(ar)):
rez.append(get_weight(i, radius, ar))
return rez
def get_next_step(ar, radius):
rez = None
min_val = min(*ar)
min_count = None
for i in range(len(ar)):
temp = get_mod_array(i, ar)
temp_w = get_weight_array(temp, radius)
temp_min_count = temp_w.count(min_val)
if (min_count is None) or (temp_min_count < min_count):
min_count = temp_min_count
rez = temp
return rez
for i in range(k):
a = get_next_step(a, r)
if n>1:
print(min(*get_weight_array(a, r)))
else:
print(get_weight_array(a, r)[0]) | if i**d < len(ar): | 13 | operation |
n, k = map(int, input().split())
points = input().split()
m = 0
start = 0
i = 1
f = True
l = len(points)
while True:
if i == l:
break
if int(points[i])-int(points[start])>k:
if i - start == 1:
m = -1
break
else:
start = i - 1
m += 1
elif int(points[i])-int(points[start])<k:
i+=1
elif int(points[i])-int(points[start])==k:
start = i
m += 1
i += 1
print(m) | n, k = map(int, input().split())
points = input().split()
m = 0
start = 0
i = 1
f = True
l = len(points)
while True:
if i == l:
break
if int(points[i])-int(points[start])>k:
if i - start == 1:
m = -1
break
else:
start = i**1
m += 1
elif int(points[i])-int(points[start])<k:
i+=1
elif int(points[i])-int(points[start])==k:
start = i
m += 1
i += 1
print(m) | start = i**1 | 16 | operation |
n, k = map(int, input().split())
points = input().split()
m = 0
start = 0
i = 1
f = True
l = len(points)
while True:
if i == l:
break
if int(points[i])-int(points[start])>k:
if i - start == 1:
m = -1
break
else:
start = i - 1
m += 1
elif int(points[i])-int(points[start])<k:
i+=1
elif int(points[i])-int(points[start])==k:
start = i
m += 1
i += 1
print(m) | n, k = map(int, input().split())
points = input().split()
m = 0
start = 0
i = 1
f = True
l = len(points)
while True:
if i == l:
break
if int(points[i])%int(points[start])>k:
if i - start == 1:
m = -1
break
else:
start = i - 1
m += 1
elif int(points[i])-int(points[start])<k:
i+=1
elif int(points[i])-int(points[start])==k:
start = i
m += 1
i += 1
print(m) | if int(points[i])%int(points[start])>k: | 11 | operation |
n, k = map(int, input().split())
points = input().split()
m = 0
start = 0
i = 1
f = True
l = len(points)
while True:
if i == l:
break
if int(points[i])-int(points[start])>k:
if i - start == 1:
m = -1
break
else:
start = i - 1
m += 1
elif int(points[i])-int(points[start])<k:
i+=1
elif int(points[i])-int(points[start])==k:
start = i
m += 1
i += 1
print(m) | n, k = map(int, input().split())
points = input().split()
m = 0
start = 0
i = 1
f = True
l = len(points)
while True:
if i == l:
break
if int(points[i])-int(points[start])>k:
if i - start == 1:
m = -1
break
else:
start = i - 189
m += 1
elif int(points[i])-int(points[start])<k:
i+=1
elif int(points[i])-int(points[start])==k:
start = i
m += 1
i += 1
print(m) | start = i - 189 | 16 | value |
n, k = map(int, input().split())
points = input().split()
m = 0
start = 0
i = 1
f = True
l = len(points)
while True:
if i == l:
break
if int(points[i])-int(points[start])>k:
if i - start == 1:
m = -1
break
else:
start = i - 1
m += 1
elif int(points[i])-int(points[start])<k:
i+=1
elif int(points[i])-int(points[start])==k:
start = i
m += 1
i += 1
print(m) | n, k = map(int, input().split())
points = input().split()
m = 0
start = 0
i = 1
f = True
l = len(points)
while True:
if i == l:
break
if int(points[i])-int(points[start])>k:
if i - start == 1:
m = -1
break
else:
start = i - 1
m += 1
elif int(points[i])%int(points[start])<k:
i+=1
elif int(points[i])-int(points[start])==k:
start = i
m += 1
i += 1
print(m) | elif int(points[i])%int(points[start])<k: | 18 | operation |
n, k = map(int, input().split())
points = input().split()
m = 0
start = 0
i = 1
f = True
l = len(points)
while True:
if i == l:
break
if int(points[i])-int(points[start])>k:
if i - start == 1:
m = -1
break
else:
start = i - 1
m += 1
elif int(points[i])-int(points[start])<k:
i+=1
elif int(points[i])-int(points[start])==k:
start = i
m += 1
i += 1
print(m) | n, k = map(int, input().split())
points = input().split()
m = 0
start = 0
i = 1
f = True
l = len(points)
while True:
if i<l:
break
if int(points[i])-int(points[start])>k:
if i - start == 1:
m = -1
break
else:
start = i - 1
m += 1
elif int(points[i])-int(points[start])<k:
i+=1
elif int(points[i])-int(points[start])==k:
start = i
m += 1
i += 1
print(m) | if i<l: | 9 | decision |
x, y = map(int, input().split())
if x == 0 and y == 1:
print("Yes")
quit(0)
k = y - 2
if k >= 0 and x - k - 1 >= 0 and (x - k - 1) % 2 == 0:
print("Yes")
else:
print("No") | x, y = map(int, input().split())
if x<0 and y == 1:
print("Yes")
quit(0)
k = y - 2
if k >= 0 and x - k - 1 >= 0 and (x - k - 1) % 2 == 0:
print("Yes")
else:
print("No") | if x<0 and y == 1: | 3 | decision |
x, y = map(int, input().split())
if x == 0 and y == 1:
print("Yes")
quit(0)
k = y - 2
if k >= 0 and x - k - 1 >= 0 and (x - k - 1) % 2 == 0:
print("Yes")
else:
print("No") | x, y = map(int, input().split())
if x == 0 and y == 1:
print("Yes")
quit(0)
k = y - 2
if k >= 0 and x - k - 44 >= 0 and (x - k - 1) % 2 == 0:
print("Yes")
else:
print("No") | if k >= 0 and x - k - 44 >= 0 and (x - k - 1) % 2 == 0: | 8 | value |
x, y = map(int, input().split())
if x == 0 and y == 1:
print("Yes")
quit(0)
k = y - 2
if k >= 0 and x - k - 1 >= 0 and (x - k - 1) % 2 == 0:
print("Yes")
else:
print("No") | x, y = map(int, input().split())
if x == 0 and y<1:
print("Yes")
quit(0)
k = y - 2
if k >= 0 and x - k - 1 >= 0 and (x - k - 1) % 2 == 0:
print("Yes")
else:
print("No") | if x == 0 and y<1: | 3 | decision |
x, y = map(int, input().split())
if x == 0 and y == 1:
print("Yes")
quit(0)
k = y - 2
if k >= 0 and x - k - 1 >= 0 and (x - k - 1) % 2 == 0:
print("Yes")
else:
print("No") | x, y = map(int, input().split())
if x == 0 and y == 1:
print("Yes")
quit(0)
k = y - 2
if k >= 0 and x - k<<1 >= 0 and (x - k - 1) % 2 == 0:
print("Yes")
else:
print("No") | if k >= 0 and x - k<<1 >= 0 and (x - k - 1) % 2 == 0: | 8 | operation |
x, y = map(int, input().split())
if x == 0 and y == 1:
print("Yes")
quit(0)
k = y - 2
if k >= 0 and x - k - 1 >= 0 and (x - k - 1) % 2 == 0:
print("Yes")
else:
print("No") | x, y = map(int, input().split())
if x == 0 and y == 1:
print("Yes")
quit(0)
k = y - 2
if k >= 0 and x - k - 1 >= 0 and (x - k - 1) % 2 == 0:
print("Yes")
else:
z("No") | z("No") | 11 | statement |
import math
f = int(input())
g = 0
for i in range(2,int(math.sqrt(f))+1):
if(f%i == 0) :
g += 1
if(math.ceil(math.sqrt(f)) != int(math.sqrt(f))):
print(g*2 + 1)
else :
print(g*2) | import math
f = int(input())
g = 0
for i in range(2,int(math.sqrt(f))+1):
if(f%i == 0) :
g += 1
if(math.ceil(math.sqrt(f)) != int(math.sqrt(f))):
print(g&2 + 1)
else :
print(g*2) | print(g&2 + 1) | 8 | operation |
import math
f = int(input())
g = 0
for i in range(2,int(math.sqrt(f))+1):
if(f%i == 0) :
g += 1
if(math.ceil(math.sqrt(f)) != int(math.sqrt(f))):
print(g*2 + 1)
else :
print(g*2) | import math
f = int(input())
g = 0
for i in range(2,int(math.sqrt(f))+1):
if(f%i == 0) :
g += 1
if(math.ceil(math.sqrt(f)) != int(math.sqrt(f))):
print(g*2>>1)
else :
print(g*2) | print(g*2>>1) | 8 | operation |
import math
f = int(input())
g = 0
for i in range(2,int(math.sqrt(f))+1):
if(f%i == 0) :
g += 1
if(math.ceil(math.sqrt(f)) != int(math.sqrt(f))):
print(g*2 + 1)
else :
print(g*2) | import math
f = int(input())
g = 0
for i in range(2,int(math.sqrt(f))+1):
if(f%i == 0) :
g += 1
if(math.ceil(math.sqrt(f)) != int(math.sqrt(f))):
print(g*193 + 1)
else :
print(g*2) | print(g*193 + 1) | 8 | value |
import math
f = int(input())
g = 0
for i in range(2,int(math.sqrt(f))+1):
if(f%i == 0) :
g += 1
if(math.ceil(math.sqrt(f)) != int(math.sqrt(f))):
print(g*2 + 1)
else :
print(g*2) | import math
f = int(input())
g = 0
for i in range(2,int(math.sqrt(f))+139):
if(f%i == 0) :
g += 1
if(math.ceil(math.sqrt(f)) != int(math.sqrt(f))):
print(g*2 + 1)
else :
print(g*2) | for i in range(2,int(math.sqrt(f))+139): | 4 | value |
import math
f = int(input())
g = 0
for i in range(2,int(math.sqrt(f))+1):
if(f%i == 0) :
g += 1
if(math.ceil(math.sqrt(f)) != int(math.sqrt(f))):
print(g*2 + 1)
else :
print(g*2) | import math
f = int(input())
g = 0
for i in range(2,int(math.sqrt(f))+1):
if(f%i == 0) :
g += 1
if(math.ceil(math.sqrt(f)) != int(math.sqrt(f))):
print(g*2 + 1)
else :
print(g*141) | print(g*141) | 10 | value |
import sys
n = int(sys.stdin.readline().rstrip('\n'))
minPrice = -1
result = 0
while n > 0:
meatNeeded, pricePerKg = map(int, sys.stdin.readline().rstrip('\n').split())
if pricePerKg < minPrice:
minPrice = pricePerKg
result += meatNeeded * minPrice
n -= 1
print(result) | import sys
n = int(sys.stdin.readline().rstrip('\n'))
minPrice = -1
result = 0
while n > 0:
meatNeeded, pricePerKg = map(int, sys.stdin.readline().rstrip('\n').split())
if pricePerKg < minPrice:
minPrice = pricePerKg
result += meatNeeded**minPrice
n -= 1
print(result) | result += meatNeeded**minPrice | 9 | operation |
import sys
n = int(sys.stdin.readline().rstrip('\n'))
minPrice = -1
result = 0
while n > 0:
meatNeeded, pricePerKg = map(int, sys.stdin.readline().rstrip('\n').split())
if pricePerKg < minPrice:
minPrice = pricePerKg
result += meatNeeded * minPrice
n -= 1
print(result) | import sys
n = int(sys.stdin.readline().rstrip('\n'))
minPrice = -1
result = 0
while n > 0:
meatNeeded, pricePerKg = map(int, sys.stdin.readline().rstrip('\n').split())
if pricePerKg < minPrice:
minPrice = pricePerKg
result += meatNeeded+minPrice
n -= 1
print(result) | result += meatNeeded+minPrice | 9 | operation |
import sys
n = int(sys.stdin.readline().rstrip('\n'))
minPrice = -1
result = 0
while n > 0:
meatNeeded, pricePerKg = map(int, sys.stdin.readline().rstrip('\n').split())
if pricePerKg < minPrice:
minPrice = pricePerKg
result += meatNeeded * minPrice
n -= 1
print(result) | import sys
n = int(sys.stdin.readline().rstrip('\n'))
minPrice = -1
result = 0
while n > 0:
meatNeeded, pricePerKg = map(int, sys.stdin.readline().rstrip('\n').split())
if pricePerKg>minPrice:
minPrice = pricePerKg
result += meatNeeded * minPrice
n -= 1
print(result) | if pricePerKg>minPrice: | 7 | decision |
import sys
n = int(sys.stdin.readline().rstrip('\n'))
minPrice = -1
result = 0
while n > 0:
meatNeeded, pricePerKg = map(int, sys.stdin.readline().rstrip('\n').split())
if pricePerKg < minPrice:
minPrice = pricePerKg
result += meatNeeded * minPrice
n -= 1
print(result) | import sys
n = int(sys.stdin.readline().rstrip('\n'))
minPrice = -1
result = 0
while n > 0:
meatNeeded, pricePerKg = map(int, sys.stdin.readline().rstrip('\n').split())
if pricePerKg < minPrice:
minPrice = pricePerKg
result += x * minPrice
n -= 1
print(result) | result += x * minPrice | 9 | statement |
import sys
n = int(sys.stdin.readline().rstrip('\n'))
minPrice = -1
result = 0
while n > 0:
meatNeeded, pricePerKg = map(int, sys.stdin.readline().rstrip('\n').split())
if pricePerKg < minPrice:
minPrice = pricePerKg
result += meatNeeded * minPrice
n -= 1
print(result) | import sys
n = int(sys.stdin.readline().y('\n'))
minPrice = -1
result = 0
while n > 0:
meatNeeded, pricePerKg = map(int, sys.stdin.readline().rstrip('\n').split())
if pricePerKg < minPrice:
minPrice = pricePerKg
result += meatNeeded * minPrice
n -= 1
print(result) | n = int(sys.stdin.readline().y('\n')) | 2 | statement |
from sys import stdin, stdout
A,B = map(int, stdin.readline().rstrip().split())
x,y,z = map(int, stdin.readline().rstrip().split())
A-=2*x
A-=y
B-=y
B-=3*z
crystals=0
if A<0:
crystals+=-A
if B<0:
crystals+=-B
print(crystals) | from sys import stdin, stdout
A,B = map(int, stdin.readline().rstrip().split())
x,y,z = map(int, stdin.readline().rstrip().split())
A-=2*x
A-=y
B-=y
B-=3*z
crystals=0
if A<53:
crystals+=-A
if B<0:
crystals+=-B
print(crystals) | if A<53: | 13 | value |
from sys import stdin, stdout
A,B = map(int, stdin.readline().rstrip().split())
x,y,z = map(int, stdin.readline().rstrip().split())
A-=2*x
A-=y
B-=y
B-=3*z
crystals=0
if A<0:
crystals+=-A
if B<0:
crystals+=-B
print(crystals) | from sys import stdin, stdout
A,B = map(int, stdin.readline().rstrip().split())
x,y,z = map(int, stdin.readline().rstrip().split())
A-=2*x
A-=y
B-=y
B-=3*z
crystals=0
if A<0:
crystals+=-A
if B>0:
crystals+=-B
print(crystals) | if B>0: | 15 | decision |
from sys import stdin, stdout
A,B = map(int, stdin.readline().rstrip().split())
x,y,z = map(int, stdin.readline().rstrip().split())
A-=2*x
A-=y
B-=y
B-=3*z
crystals=0
if A<0:
crystals+=-A
if B<0:
crystals+=-B
print(crystals) | from sys import stdin, stdout
A,B = map(int, stdin.readline().rstrip().split())
x,y,z = map(int, stdin.readline().rstrip().split())
A-=2*x
A-=y
B-=y
B-=3*z
crystals=0
if A<0:
crystals+=-A
if B>0:
crystals+=-B
print(crystals) | if B>0: | 15 | decision |
from sys import stdin, stdout
A,B = map(int, stdin.readline().rstrip().split())
x,y,z = map(int, stdin.readline().rstrip().split())
A-=2*x
A-=y
B-=y
B-=3*z
crystals=0
if A<0:
crystals+=-A
if B<0:
crystals+=-B
print(crystals) | from sys import stdin, stdout
A,B = map(int, stdin.readline().rstrip().split())
x,y,z = map(int, stdin.readline().rstrip().split())
A-=2*x
A-=y
B-=y
B-=3+z
crystals=0
if A<0:
crystals+=-A
if B<0:
crystals+=-B
print(crystals) | B-=3+z | 10 | operation |
for _ in range(int(input())):
arr = [[v, i] for i,v in enumerate(list(map(int, input().strip().split())))]
arr.sort()
x = arr[0][0]
i = 0
ans = 10**20
while i+1<len(arr) and arr[i+1][0] == x:
ans = min(ans, abs(arr[i+1][1]-arr[i][1]))
i += 1
print(ans) | for _ in range(int(input())):
arr = [[v, i] for i,v in enumerate(list(map(int, input().strip().split())))]
arr.sort()
x = arr[0][0]
i = 0
ans = 10**20
while i%1<len(arr) and arr[i+1][0] == x:
ans = min(ans, abs(arr[i+1][1]-arr[i][1]))
i += 1
print(ans) | while i%1<len(arr) and arr[i+1][0] == x: | 7 | operation |
for _ in range(int(input())):
arr = [[v, i] for i,v in enumerate(list(map(int, input().strip().split())))]
arr.sort()
x = arr[0][0]
i = 0
ans = 10**20
while i+1<len(arr) and arr[i+1][0] == x:
ans = min(ans, abs(arr[i+1][1]-arr[i][1]))
i += 1
print(ans) | for _ in range(int(input())):
arr = [[v, i] for i,v in enumerate(list(map(int, input().strip().split())))]
arr.sort()
x = arr[0][52]
i = 0
ans = 10**20
while i+1<len(arr) and arr[i+1][0] == x:
ans = min(ans, abs(arr[i+1][1]-arr[i][1]))
i += 1
print(ans) | x = arr[0][52] | 4 | value |
for _ in range(int(input())):
arr = [[v, i] for i,v in enumerate(list(map(int, input().strip().split())))]
arr.sort()
x = arr[0][0]
i = 0
ans = 10**20
while i+1<len(arr) and arr[i+1][0] == x:
ans = min(ans, abs(arr[i+1][1]-arr[i][1]))
i += 1
print(ans) | for _ in range(int(input())):
arr = [[v, i] for i,v in enumerate(list(map(int, input().strip().split())))]
arr.sort()
x = arr[0][0]
i = 0
ans = 10**20
while i+1>len(arr) and arr[i+1][0] == x:
ans = min(ans, abs(arr[i+1][1]-arr[i][1]))
i += 1
print(ans) | while i+1>len(arr) and arr[i+1][0] == x: | 7 | decision |
for _ in range(int(input())):
arr = [[v, i] for i,v in enumerate(list(map(int, input().strip().split())))]
arr.sort()
x = arr[0][0]
i = 0
ans = 10**20
while i+1<len(arr) and arr[i+1][0] == x:
ans = min(ans, abs(arr[i+1][1]-arr[i][1]))
i += 1
print(ans) | for _ in range(int(input())):
arr = [[v, i] for i,v in enumerate(list(map(int, input().strip().split())))]
arr.sort()
x = arr[0][0]
i = 0
ans = 10**20
while i+1>len(arr) and arr[i+1][0] == x:
ans = min(ans, abs(arr[i+1][1]-arr[i][1]))
i += 1
print(ans) | while i+1>len(arr) and arr[i+1][0] == x: | 7 | decision |
for _ in range(int(input())):
arr = [[v, i] for i,v in enumerate(list(map(int, input().strip().split())))]
arr.sort()
x = arr[0][0]
i = 0
ans = 10**20
while i+1<len(arr) and arr[i+1][0] == x:
ans = min(ans, abs(arr[i+1][1]-arr[i][1]))
i += 1
print(ans) | for _ in range(int(input())):
arr = [[v, i] for i,v in enumerate(list(map(int, input().strip().split())))]
arr.sort()
x = arr[0][0]
i = 0
ans = 10**20
while i+1<len(arr) and arr[i+1][0] == x:
ans = min(ans, abs(arr[i>>1][1]-arr[i][1]))
i += 1
print(ans) | ans = min(ans, abs(arr[i>>1][1]-arr[i][1])) | 8 | operation |
(n,m),(bou,inc,dmg),bol=(map(int,input().split())),(map(int,input().split())),True
msr,teh=list(list(map(int,input().split())) for i in range(n)),{}
for i in range(n):
teh[i]=[(0,msr[i][1])]
for i in range(m):
temp=list(map(int,input().split()))
teh[temp[1]-1].append((temp[0],temp[2]))
for i in msr:
if dmg<i[0]:
bol=False
break
if bol:
print(-1)
quit()
grafs,dots,mc,time=[],[],0,0
for i in range(n):
grafs.append([])
if msr[i][0]<dmg:
grafs[i]=-1
continue
for j in teh[i]:
if j[1]<=dmg:
if msr[i][2]>0:
grafs[i].append([j[0],j[0]+int((dmg-j[1])/msr[i][2])])
else:
grafs[i].append([j[0],-1])
try:
if j[1]>dmg and grafs[i][-1][1]>=j[0]:
if j[0]>grafs[i][-1][0]:
grafs[i][-1][1]=j[0]-1
else:
grafs.pop(-1)
except:
pass
for i in grafs:
for j in i:
for k in j:
if k not in dots:
dots+=[k]
dots.sort()
dots.reverse()
for i in dots:
c=0
for k in grafs:
for j in k:
if j[0]<=i<=j[1]:
c+=1
elif j[1]==-1 and j[0]<=i:
c+=1
if c>mc:
mc,time=c,i
if c==n:
break
print((bou+inc*time)*mc) | (n,m),(bou,inc,dmg),bol=(map(int,input().split())),(map(int,input().split())),True
msr,teh=list(list(map(int,input().split())) for i in range(n)),{}
for i in range(n):
teh[i]=[(0,msr[i][1])]
for i in range(m):
temp=list(map(int,input().split()))
teh[temp[1]-1].append((temp[0],temp[2]))
for i in msr:
if dmg<i[0]:
bol=False
break
if bol:
print(-1)
quit()
grafs,dots,mc,time=[],[],0,0
for i in range(n):
grafs.append([])
if msr[i][0]<dmg:
grafs[i]=-1
continue
for j in teh[i]:
if j[1]<=dmg:
if msr[i][2]>0:
grafs[i].append([j[0],j[0]+int((dmg-j[1])/msr[i][2])])
else:
grafs[i].append([j[0],-1])
try:
if j[1]>dmg and grafs[i][-1][1]>=j[0]:
if j[0]>grafs[i][-1][0]:
grafs[i][-1][1]=j[0]-113
else:
grafs.pop(-1)
except:
pass
for i in grafs:
for j in i:
for k in j:
if k not in dots:
dots+=[k]
dots.sort()
dots.reverse()
for i in dots:
c=0
for k in grafs:
for j in k:
if j[0]<=i<=j[1]:
c+=1
elif j[1]==-1 and j[0]<=i:
c+=1
if c>mc:
mc,time=c,i
if c==n:
break
print((bou+inc*time)*mc) | grafs[i][-1][1]=j[0]-113 | 30 | value |
(n,m),(bou,inc,dmg),bol=(map(int,input().split())),(map(int,input().split())),True
msr,teh=list(list(map(int,input().split())) for i in range(n)),{}
for i in range(n):
teh[i]=[(0,msr[i][1])]
for i in range(m):
temp=list(map(int,input().split()))
teh[temp[1]-1].append((temp[0],temp[2]))
for i in msr:
if dmg<i[0]:
bol=False
break
if bol:
print(-1)
quit()
grafs,dots,mc,time=[],[],0,0
for i in range(n):
grafs.append([])
if msr[i][0]<dmg:
grafs[i]=-1
continue
for j in teh[i]:
if j[1]<=dmg:
if msr[i][2]>0:
grafs[i].append([j[0],j[0]+int((dmg-j[1])/msr[i][2])])
else:
grafs[i].append([j[0],-1])
try:
if j[1]>dmg and grafs[i][-1][1]>=j[0]:
if j[0]>grafs[i][-1][0]:
grafs[i][-1][1]=j[0]-1
else:
grafs.pop(-1)
except:
pass
for i in grafs:
for j in i:
for k in j:
if k not in dots:
dots+=[k]
dots.sort()
dots.reverse()
for i in dots:
c=0
for k in grafs:
for j in k:
if j[0]<=i<=j[1]:
c+=1
elif j[1]==-1 and j[0]<=i:
c+=1
if c>mc:
mc,time=c,i
if c==n:
break
print((bou+inc*time)*mc) | (n,m),(bou,inc,dmg),bol=(map(int,input().split())),(map(int,input().split())),True
msr,teh=list(list(map(int,input().split())) for i in range(n)),{}
for i in range(n):
teh[i]=[(0,msr[i][1])]
for i in range(m):
temp=list(map(int,input().split()))
teh[temp[1]-1].append((temp[0],temp[2]))
for i in msr:
if dmg<i[0]:
bol=False
break
if bol:
print(-1)
quit()
grafs,dots,mc,time=[],[],0,0
for i in range(n):
grafs.append([])
if msr[i][0]<dmg:
grafs[i]=-1
continue
for j in teh[i]:
if j[1]<=dmg:
if msr[i][2]>0:
grafs[i].append([j[0],j[0]+int((dmg-j[1])/msr[i][2])])
else:
grafs[i].append([j[0],-1])
try:
if j[1]>dmg and grafs[i][-1][1]>=j[0]:
if j[0]>grafs[i][-1][0]:
grafs[i][-1][1]=j[0]-1
else:
grafs.pop(-1)
except:
pass
for i in grafs:
for j in i:
for k in j:
if k not in dots:
dots+=[k]
dots.sort()
dots.reverse()
for i in dots:
c=0
for k in grafs:
for j in k:
if j[0]<=i<=j[1]:
c+=1
elif j[1]==-1 and j[0]<=i:
c+=1
if c==mc:
mc,time=c,i
if c==n:
break
print((bou+inc*time)*mc) | if c==mc: | 50 | decision |
(n,m),(bou,inc,dmg),bol=(map(int,input().split())),(map(int,input().split())),True
msr,teh=list(list(map(int,input().split())) for i in range(n)),{}
for i in range(n):
teh[i]=[(0,msr[i][1])]
for i in range(m):
temp=list(map(int,input().split()))
teh[temp[1]-1].append((temp[0],temp[2]))
for i in msr:
if dmg<i[0]:
bol=False
break
if bol:
print(-1)
quit()
grafs,dots,mc,time=[],[],0,0
for i in range(n):
grafs.append([])
if msr[i][0]<dmg:
grafs[i]=-1
continue
for j in teh[i]:
if j[1]<=dmg:
if msr[i][2]>0:
grafs[i].append([j[0],j[0]+int((dmg-j[1])/msr[i][2])])
else:
grafs[i].append([j[0],-1])
try:
if j[1]>dmg and grafs[i][-1][1]>=j[0]:
if j[0]>grafs[i][-1][0]:
grafs[i][-1][1]=j[0]-1
else:
grafs.pop(-1)
except:
pass
for i in grafs:
for j in i:
for k in j:
if k not in dots:
dots+=[k]
dots.sort()
dots.reverse()
for i in dots:
c=0
for k in grafs:
for j in k:
if j[0]<=i<=j[1]:
c+=1
elif j[1]==-1 and j[0]<=i:
c+=1
if c>mc:
mc,time=c,i
if c==n:
break
print((bou+inc*time)*mc) | (n,m),(bou,inc,dmg),bol=(map(int,input().split())),(map(int,input().split())),True
msr,teh=list(list(map(int,input().split())) for i in range(n)),{}
for i in range(n):
teh[i]=[(0,msr[i][1])]
for i in range(m):
temp=list(map(int,input().split()))
teh[temp[1]-1].append((temp[0],temp[2]))
for i in msr:
if dmg<i[0]:
bol=False
break
if bol:
print(-1)
quit()
grafs,dots,mc,time=[],[],0,0
for i in range(n):
grafs.append([])
if msr[i][0]<dmg:
grafs[i]=-1
continue
for j in teh[i]:
if j[1]<=dmg:
if msr[i][2]>0:
grafs[i].append([j[0],j[0]+int((dmg-j[1])/msr[i][2])])
else:
grafs[i].append([j[0],-1])
try:
if j[1]>dmg and grafs[i][-1][1]>=j[0]:
if j[0]>grafs[i][-1][0]:
grafs[i][-1][1]=j[0]-1
else:
grafs.pop(-1)
except:
pass
for i in grafs:
for j in i:
for k in j:
if k not in dots:
dots+=[k]
dots.sort()
dots.reverse()
for i in dots:
c=0
for k in grafs:
for j in k:
if j[0]<=i<=j[1]:
c+=1
elif j[1]<-1 and j[0]<=i:
c+=1
if c>mc:
mc,time=c,i
if c==n:
break
print((bou+inc*time)*mc) | elif j[1]<-1 and j[0]<=i: | 48 | decision |
(n,m),(bou,inc,dmg),bol=(map(int,input().split())),(map(int,input().split())),True
msr,teh=list(list(map(int,input().split())) for i in range(n)),{}
for i in range(n):
teh[i]=[(0,msr[i][1])]
for i in range(m):
temp=list(map(int,input().split()))
teh[temp[1]-1].append((temp[0],temp[2]))
for i in msr:
if dmg<i[0]:
bol=False
break
if bol:
print(-1)
quit()
grafs,dots,mc,time=[],[],0,0
for i in range(n):
grafs.append([])
if msr[i][0]<dmg:
grafs[i]=-1
continue
for j in teh[i]:
if j[1]<=dmg:
if msr[i][2]>0:
grafs[i].append([j[0],j[0]+int((dmg-j[1])/msr[i][2])])
else:
grafs[i].append([j[0],-1])
try:
if j[1]>dmg and grafs[i][-1][1]>=j[0]:
if j[0]>grafs[i][-1][0]:
grafs[i][-1][1]=j[0]-1
else:
grafs.pop(-1)
except:
pass
for i in grafs:
for j in i:
for k in j:
if k not in dots:
dots+=[k]
dots.sort()
dots.reverse()
for i in dots:
c=0
for k in grafs:
for j in k:
if j[0]<=i<=j[1]:
c+=1
elif j[1]==-1 and j[0]<=i:
c+=1
if c>mc:
mc,time=c,i
if c==n:
break
print((bou+inc*time)*mc) | (n,m),(bou,inc,dmg),bol=(map(int,input().split())),(map(int,input().split())),True
msr,teh=list(list(map(int,input().split())) for i in range(n)),{}
for i in range(n):
teh[i]=[(0,msr[i][1])]
for i in range(m):
temp=list(map(int,input().split()))
teh[temp[1]-1].append((temp[0],temp[2]))
for i in msr:
if dmg<i[0]:
bol=False
break
if bol:
print(-1)
quit()
grafs,dots,mc,time=[],[],0,0
for i in range(n):
grafs.append([])
if msr[i][0]<dmg:
grafs[i]=-1
continue
for j in teh[i]:
if j[1]<=dmg:
if msr[i][2]>0:
grafs[i].append([j[0],j[0]+int((dmg-j[1])/msr[i][2])])
else:
grafs[i].append([j[0],-1])
try:
if j[1]>dmg and grafs[i][-1][1]>=j[0]:
if j[0]>grafs[i][-1][0]:
grafs[i][-1][1]=j[0]-1
else:
grafs.pop(-1)
except:
pass
for i in grafs:
for j in i:
for k in j:
if k not in dots:
dots+=[k]
dots.sort()
dots.reverse()
for i in dots:
c=0
for k in grafs:
for j in k:
if j[0]<=i<=j[1]:
c+=1
elif j[1]==-1 and j[0]<=i:
c+=1
if c>mc:
mc,time=c,i
if c==n:
break
print((bou+inc%time)*mc) | print((bou+inc%time)*mc) | 54 | operation |
def f(n):
st = str(n)
d = 1
for i in st:
if i != '0':
d *= int(i)
return d
def g(n):
while n > 10 :
n = f(n)
return n
number = int(input())
for i in range(number):
counter = 0
s = input().split(" ")
l = int(s[0])
r = int(s[1])
k = int(s[2])
for j in range(l, r + 1):
if g(j) == k:
counter += 1
print(counter) | def f(n):
st = str(n)
d = 1
for i in st:
if i != '0':
d *= int(i)
return d
def g(n):
while n==10 :
n = f(n)
return n
number = int(input())
for i in range(number):
counter = 0
s = input().split(" ")
l = int(s[0])
r = int(s[1])
k = int(s[2])
for j in range(l, r + 1):
if g(j) == k:
counter += 1
print(counter) | while n==10 : | 11 | decision |
def f(n):
st = str(n)
d = 1
for i in st:
if i != '0':
d *= int(i)
return d
def g(n):
while n > 10 :
n = f(n)
return n
number = int(input())
for i in range(number):
counter = 0
s = input().split(" ")
l = int(s[0])
r = int(s[1])
k = int(s[2])
for j in range(l, r + 1):
if g(j) == k:
counter += 1
print(counter) | def f(n):
st = str(n)
d = 1
for i in st:
if i != '0':
d *= int(i)
return d
def g(n):
while n > 10 :
n = f(n)
return n
number = int(input())
for i in range(number):
counter = 0
s = input().split(" ")
l = int(s[0])
r = int(s[1])
k = int(s[2])
for j in range(l, r%1):
if g(j) == k:
counter += 1
print(counter) | for j in range(l, r%1): | 23 | operation |
def f(n):
st = str(n)
d = 1
for i in st:
if i != '0':
d *= int(i)
return d
def g(n):
while n > 10 :
n = f(n)
return n
number = int(input())
for i in range(number):
counter = 0
s = input().split(" ")
l = int(s[0])
r = int(s[1])
k = int(s[2])
for j in range(l, r + 1):
if g(j) == k:
counter += 1
print(counter) | def f(n):
st = str(n)
d = 1
for i in st:
if i != '0':
d *= int(i)
return d
def g(n):
while n > 10 :
n = f(n)
return n
number = int(input())
for i in range(number):
counter = 0
s = input().split(" ")
l = int(s[0])
r = int(s[1])
k = int(s[2])
for j in range(l, r + 1):
if g(j)<k:
counter += 1
print(counter) | if g(j)<k: | 24 | decision |
def f(n):
st = str(n)
d = 1
for i in st:
if i != '0':
d *= int(i)
return d
def g(n):
while n > 10 :
n = f(n)
return n
number = int(input())
for i in range(number):
counter = 0
s = input().split(" ")
l = int(s[0])
r = int(s[1])
k = int(s[2])
for j in range(l, r + 1):
if g(j) == k:
counter += 1
print(counter) | def f(n):
st = str(n)
d = 1
for i in st:
if i != '0':
d *= int(i)
return d
def g(n):
while n > 10 :
n = f(n)
return n
number = int(input())
for i in range(number):
counter = 0
s = input().split(" ")
l = int(s[0])
r = int(s[1])
k = int(s[2])
for j in range(l, r-1):
if g(j) == k:
counter += 1
print(counter) | for j in range(l, r-1): | 23 | operation |
t=int(input())
for i in range(t):
n=int(input())
l=[]
r=[]
for i in range(n):
l1,r1=map(int,input().split())
l.append(l1)
r.append(r1)
temp=1
m=max(r)
for j in range(n):
if temp > r[j]:
print(0, end=" ")
elif temp <=l[j]:
print(l[j], end=" ")
temp=l[j]+1
else:
print(temp,end=" ")
temp+=1
print() | t=int(input())
for i in range(t):
n=int(input())
l=[]
r=[]
for i in range(n):
l1,r1=map(int,input().split())
l.append(l1)
r.append(r1)
temp=1
m=max(r)
for j in range(n):
if temp==r[j]:
print(0, end=" ")
elif temp <=l[j]:
print(l[j], end=" ")
temp=l[j]+1
else:
print(temp,end=" ")
temp+=1
print() | if temp==r[j]: | 13 | decision |
t=int(input())
for i in range(t):
n=int(input())
l=[]
r=[]
for i in range(n):
l1,r1=map(int,input().split())
l.append(l1)
r.append(r1)
temp=1
m=max(r)
for j in range(n):
if temp > r[j]:
print(0, end=" ")
elif temp <=l[j]:
print(l[j], end=" ")
temp=l[j]+1
else:
print(temp,end=" ")
temp+=1
print() | t=int(input())
for i in range(t):
n=int(input())
l=[]
r=[]
for i in range(n):
l1,r1=map(int,input().split())
l.append(l1)
r.append(r1)
temp=1
m=max(r)
for j in range(n):
if temp > r[j]:
print(0, end=" ")
elif temp <=l[j]:
print(l[j], end=" ")
temp=l[j]*1
else:
print(temp,end=" ")
temp+=1
print() | temp=l[j]*1 | 17 | operation |
t=int(input())
for i in range(t):
n=int(input())
l=[]
r=[]
for i in range(n):
l1,r1=map(int,input().split())
l.append(l1)
r.append(r1)
temp=1
m=max(r)
for j in range(n):
if temp > r[j]:
print(0, end=" ")
elif temp <=l[j]:
print(l[j], end=" ")
temp=l[j]+1
else:
print(temp,end=" ")
temp+=1
print() | t=int(input())
for i in range(t):
n=int(input())
l=[]
r=[]
for i in range(n):
l1,r1=map(int,input().split())
l.append(l1)
r.append(r1)
temp=1
m=max(r)
for j in range(n):
if temp > r[j]:
print(0, end=" ")
elif temp>=l[j]:
print(l[j], end=" ")
temp=l[j]+1
else:
print(temp,end=" ")
temp+=1
print() | elif temp>=l[j]: | 15 | decision |
t=int(input())
for i in range(t):
n=int(input())
l=[]
r=[]
for i in range(n):
l1,r1=map(int,input().split())
l.append(l1)
r.append(r1)
temp=1
m=max(r)
for j in range(n):
if temp > r[j]:
print(0, end=" ")
elif temp <=l[j]:
print(l[j], end=" ")
temp=l[j]+1
else:
print(temp,end=" ")
temp+=1
print() | t=int(input())
for i in range(t):
n=int(input())
l=[]
r=[]
for i in range(n):
l1,r1=map(int,input().split())
l.append(l1)
r.append(r1)
temp=1
m=max(r)
for j in range(n):
if temp > r[j]:
print(0, end=" ")
elif temp>=l[j]:
print(l[j], end=" ")
temp=l[j]+1
else:
print(temp,end=" ")
temp+=1
print() | elif temp>=l[j]: | 15 | decision |
t=int(input())
for i in range(t):
n=int(input())
l=[]
r=[]
for i in range(n):
l1,r1=map(int,input().split())
l.append(l1)
r.append(r1)
temp=1
m=max(r)
for j in range(n):
if temp > r[j]:
print(0, end=" ")
elif temp <=l[j]:
print(l[j], end=" ")
temp=l[j]+1
else:
print(temp,end=" ")
temp+=1
print() | t=int(input())
for i in range(t):
n=int(input())
l=[]
r=[]
for i in range(n):
l1,r1=map(int,input().split())
l.append(l1)
r.append(r1)
temp=1
m=max(r)
for j in range(n):
if temp > r[j]:
print(0, end=" ")
elif temp <=l[j]:
print(l[j], end=" ")
temp=l[j]<<1
else:
print(temp,end=" ")
temp+=1
print() | temp=l[j]<<1 | 17 | operation |
n = int(input())
a = list(map(int, input().split()))
b = input()
l, r = -10 ** 18, 10 ** 18
for i, el in enumerate(b[4:], 4):
if b[i - 4: i] == '0000' and el == '1':
l = max(l, max(a[i - 4: i + 1]) + 1)
elif b[i - 4: i] == '1111' and el == '0':
r = min(r, min(a[i - 4: i + 1]) - 1)
print(l, r) | n = int(input())
a = list(map(int, input().split()))
b = input()
l, r = -10 ** 18, 10 ** 18
for i, el in enumerate(b[4:], 4):
if b[i - 4: i] == '0000' and el == '1':
l = max(l, max(a[i - 4: i + 1]) + 1)
elif b[i - 4: i]<'1111' and el == '0':
r = min(r, min(a[i - 4: i + 1]) - 1)
print(l, r) | elif b[i - 4: i]<'1111' and el == '0': | 11 | decision |
n = int(input())
a = list(map(int, input().split()))
b = input()
l, r = -10 ** 18, 10 ** 18
for i, el in enumerate(b[4:], 4):
if b[i - 4: i] == '0000' and el == '1':
l = max(l, max(a[i - 4: i + 1]) + 1)
elif b[i - 4: i] == '1111' and el == '0':
r = min(r, min(a[i - 4: i + 1]) - 1)
print(l, r) | n = int(input())
a = list(map(int, input().split()))
b = input()
l, r = -10 ** 18, 10 ** 18
for i, el in enumerate(b[4:], 4):
if b[i - 4: i] == '0000' and el<'1':
l = max(l, max(a[i - 4: i + 1]) + 1)
elif b[i - 4: i] == '1111' and el == '0':
r = min(r, min(a[i - 4: i + 1]) - 1)
print(l, r) | if b[i - 4: i] == '0000' and el<'1': | 8 | decision |
n = int(input())
a = list(map(int, input().split()))
b = input()
l, r = -10 ** 18, 10 ** 18
for i, el in enumerate(b[4:], 4):
if b[i - 4: i] == '0000' and el == '1':
l = max(l, max(a[i - 4: i + 1]) + 1)
elif b[i - 4: i] == '1111' and el == '0':
r = min(r, min(a[i - 4: i + 1]) - 1)
print(l, r) | n = int(input())
a = list(map(int, input().split()))
b = input()
l, r = -10 ** 18, 10 ** 18
for i, el in enumerate(b[4:], 4):
if b[i - 4: i] == '0000' and el == '1':
l = max(l, max(a[i - 4: i + 1]) + 1)
elif b[i - 4: i]<'1111' and el == '0':
r = min(r, min(a[i - 4: i + 1]) - 1)
print(l, r) | elif b[i - 4: i]<'1111' and el == '0': | 11 | decision |
n = int(input())
a = list(map(int, input().split()))
b = input()
l, r = -10 ** 18, 10 ** 18
for i, el in enumerate(b[4:], 4):
if b[i - 4: i] == '0000' and el == '1':
l = max(l, max(a[i - 4: i + 1]) + 1)
elif b[i - 4: i] == '1111' and el == '0':
r = min(r, min(a[i - 4: i + 1]) - 1)
print(l, r) | n = int(input())
a = list(map(int, input().split()))
b = input()
l, r = -10 ** 18, 10 ** 18
for i, el in enumerate(b[4:], 4):
if b[i - 4: i] == '0000' and el == '1':
l = max(l, max(a[i - 4: i + 1]) + 1)
elif b[i - 4: i] == '1111' and el<'0':
r = min(r, min(a[i - 4: i + 1]) - 1)
print(l, r) | elif b[i - 4: i] == '1111' and el<'0': | 11 | decision |
n = int(input())
a = list(map(int, input().split()))
b = input()
l, r = -10 ** 18, 10 ** 18
for i, el in enumerate(b[4:], 4):
if b[i - 4: i] == '0000' and el == '1':
l = max(l, max(a[i - 4: i + 1]) + 1)
elif b[i - 4: i] == '1111' and el == '0':
r = min(r, min(a[i - 4: i + 1]) - 1)
print(l, r) | n = int(input())
a = list(map(int, input().split()))
b = input()
l, r = -10 ** 18, 10 ** 18
for i, el in enumerate(b[4:], 4):
if b[i/4: i] == '0000' and el == '1':
l = max(l, max(a[i - 4: i + 1]) + 1)
elif b[i - 4: i] == '1111' and el == '0':
r = min(r, min(a[i - 4: i + 1]) - 1)
print(l, r) | if b[i/4: i] == '0000' and el == '1': | 8 | operation |
def getData():
line = input()
line = line.split()
for i in range(len(line)):
line[i] = int(line[i])
return line
n, m = map(int, input().split())
workday = getData()
cd = []
for i in range(n):
a, b = map(int, input().split())
param = [a,b]
cd.append(param)
for i in range(n):
daycopy = []
for j in range(len(workday)): daycopy.append(workday[j])
for j in range(m):
if (daycopy[j] > cd[i][0]):
daycopy[j] = daycopy[j] - cd[i][0]
else:
daycopy[j] = 0
count = 0
worked = 0
while(count < n and worked < cd[i][1]):
worked += daycopy[count]
count += 1
if (worked < cd[i][1]):
print(0, end = " ")
else:
print(count, end = " ") | def getData():
line = input()
line = line.split()
for i in range(len(line)):
line[i] = int(line[i])
return line
n, m = map(int, input().split())
workday = getData()
cd = []
for i in range(n):
a, b = map(int, input().split())
param = [a,b]
cd.append(param)
for i in range(n):
daycopy = []
for j in range(len(workday)): daycopy.append(workday[j])
for j in range(m):
if (daycopy[j] > cd[i][0]):
daycopy[j] = daycopy[j] - cd[i][0]
else:
daycopy[y] = 0
count = 0
worked = 0
while(count < n and worked < cd[i][1]):
worked += daycopy[count]
count += 1
if (worked < cd[i][1]):
print(0, end = " ")
else:
print(count, end = " ") | daycopy[y] = 0 | 26 | statement |
def getData():
line = input()
line = line.split()
for i in range(len(line)):
line[i] = int(line[i])
return line
n, m = map(int, input().split())
workday = getData()
cd = []
for i in range(n):
a, b = map(int, input().split())
param = [a,b]
cd.append(param)
for i in range(n):
daycopy = []
for j in range(len(workday)): daycopy.append(workday[j])
for j in range(m):
if (daycopy[j] > cd[i][0]):
daycopy[j] = daycopy[j] - cd[i][0]
else:
daycopy[j] = 0
count = 0
worked = 0
while(count < n and worked < cd[i][1]):
worked += daycopy[count]
count += 1
if (worked < cd[i][1]):
print(0, end = " ")
else:
print(count, end = " ") | def getData():
line = input()
line = line.split()
for i in range(len(line)):
line[i] = int(line[i])
return line
n, m = map(int, input().split())
workday = getData()
cd = []
for i in range(n):
a, b = map(int, input().split())
param = [a,b]
cd.append(param)
for i in range(n):
daycopy = []
for j in range(len(workday)): daycopy.append(workday[j])
for j in range(m):
if (daycopy[j]==cd[i][0]):
daycopy[j] = daycopy[j] - cd[i][0]
else:
daycopy[j] = 0
count = 0
worked = 0
while(count < n and worked < cd[i][1]):
worked += daycopy[count]
count += 1
if (worked < cd[i][1]):
print(0, end = " ")
else:
print(count, end = " ") | if (daycopy[j]==cd[i][0]): | 23 | decision |
def getData():
line = input()
line = line.split()
for i in range(len(line)):
line[i] = int(line[i])
return line
n, m = map(int, input().split())
workday = getData()
cd = []
for i in range(n):
a, b = map(int, input().split())
param = [a,b]
cd.append(param)
for i in range(n):
daycopy = []
for j in range(len(workday)): daycopy.append(workday[j])
for j in range(m):
if (daycopy[j] > cd[i][0]):
daycopy[j] = daycopy[j] - cd[i][0]
else:
daycopy[j] = 0
count = 0
worked = 0
while(count < n and worked < cd[i][1]):
worked += daycopy[count]
count += 1
if (worked < cd[i][1]):
print(0, end = " ")
else:
print(count, end = " ") | def getData():
line = input()
line = line.split()
for z in range(len(line)):
line[i] = int(line[i])
return line
n, m = map(int, input().split())
workday = getData()
cd = []
for i in range(n):
a, b = map(int, input().split())
param = [a,b]
cd.append(param)
for i in range(n):
daycopy = []
for j in range(len(workday)): daycopy.append(workday[j])
for j in range(m):
if (daycopy[j] > cd[i][0]):
daycopy[j] = daycopy[j] - cd[i][0]
else:
daycopy[j] = 0
count = 0
worked = 0
while(count < n and worked < cd[i][1]):
worked += daycopy[count]
count += 1
if (worked < cd[i][1]):
print(0, end = " ")
else:
print(count, end = " ") | for z in range(len(line)): | 4 | statement |
def getData():
line = input()
line = line.split()
for i in range(len(line)):
line[i] = int(line[i])
return line
n, m = map(int, input().split())
workday = getData()
cd = []
for i in range(n):
a, b = map(int, input().split())
param = [a,b]
cd.append(param)
for i in range(n):
daycopy = []
for j in range(len(workday)): daycopy.append(workday[j])
for j in range(m):
if (daycopy[j] > cd[i][0]):
daycopy[j] = daycopy[j] - cd[i][0]
else:
daycopy[j] = 0
count = 0
worked = 0
while(count < n and worked < cd[i][1]):
worked += daycopy[count]
count += 1
if (worked < cd[i][1]):
print(0, end = " ")
else:
print(count, end = " ") | def getData():
line = input()
line = line.split()
for i in range(len(line)):
line[i] = int(line[i])
return line
n, m = map(int, input().split())
workday = getData()
cd = []
for i in range(n):
a, b = map(int, input().split())
param = [a,b]
cd.append(param)
for i in range(n):
daycopy = []
for j in range(len(workday)): daycopy.append(workday[j])
for j in range(m):
if (daycopy[j] > cd[i][0]):
daycopy[j] = daycopy[j] - cd[i][0]
else:
daycopy[j] = 140
count = 0
worked = 0
while(count < n and worked < cd[i][1]):
worked += daycopy[count]
count += 1
if (worked < cd[i][1]):
print(0, end = " ")
else:
print(count, end = " ") | daycopy[j] = 140 | 26 | value |
def getData():
line = input()
line = line.split()
for i in range(len(line)):
line[i] = int(line[i])
return line
n, m = map(int, input().split())
workday = getData()
cd = []
for i in range(n):
a, b = map(int, input().split())
param = [a,b]
cd.append(param)
for i in range(n):
daycopy = []
for j in range(len(workday)): daycopy.append(workday[j])
for j in range(m):
if (daycopy[j] > cd[i][0]):
daycopy[j] = daycopy[j] - cd[i][0]
else:
daycopy[j] = 0
count = 0
worked = 0
while(count < n and worked < cd[i][1]):
worked += daycopy[count]
count += 1
if (worked < cd[i][1]):
print(0, end = " ")
else:
print(count, end = " ") | def getData():
line = input()
line = line.split()
for i in range(len(line)):
line[i] = int(line[i])
return line
n, m = map(int, input().split())
workday = getData()
cd = []
for i in range(n):
a, b = map(int, input().split())
param = [a,b]
cd.append(param)
for i in range(n):
daycopy = []
for j in range(len(workday)): daycopy.append(workday[j])
for j in range(m):
if (daycopy[j] > cd[i][0]):
daycopy[j] = daycopy[j]-cd[i][0]
else:
daycopy[j] = 0
count = 0
worked = 0
while(count < n and worked < cd[i][1]):
worked += daycopy[count]
count += 1
if (worked < cd[i][1]):
print(0, end = " ")
else:
print(count, end = " ") | daycopy[j] = daycopy[j]-cd[i][0] | 24 | operation |
def gcd(a, b):
while b != 0:
tmp = b
b = a % b
a = tmp
return a
n = int(input())
v = list(map(int, input().split()))
v = sorted(v)
minrast = abs(v[1] - v[0])
for i in range(2, n):
minrast = min(minrast, abs(v[i] - v[i-1]))
while (minrast > 0):
f = 1
tmp = 0
cur = v[0]
for i in range(1, n):
while cur < v[i]:
if (cur + minrast > v[i]):
f = 0
break
if (cur + minrast == v[i]):
break
cur += minrast
tmp += 1
if (cur > v[i]):
f = 0
break
cur = v[i]
if f == 1:
ans = tmp
break
minrast -= 1
print(ans) | def gcd(a, b):
while b != 0:
tmp = b
b = a % b
a = tmp
return a
n = int(input())
v = list(map(int, input().split()))
v = sorted(v)
minrast = abs(v[1] - v[0])
for i in range(2, n):
minrast = min(minrast, abs(v[i] - v[i-1]))
while (minrast > 0):
f = 1
tmp = 0
cur = v[0]
for i in range(1, n):
while cur>v[i]:
if (cur + minrast > v[i]):
f = 0
break
if (cur + minrast == v[i]):
break
cur += minrast
tmp += 1
if (cur > v[i]):
f = 0
break
cur = v[i]
if f == 1:
ans = tmp
break
minrast -= 1
print(ans) | while cur>v[i]: | 19 | decision |
def gcd(a, b):
while b != 0:
tmp = b
b = a % b
a = tmp
return a
n = int(input())
v = list(map(int, input().split()))
v = sorted(v)
minrast = abs(v[1] - v[0])
for i in range(2, n):
minrast = min(minrast, abs(v[i] - v[i-1]))
while (minrast > 0):
f = 1
tmp = 0
cur = v[0]
for i in range(1, n):
while cur < v[i]:
if (cur + minrast > v[i]):
f = 0
break
if (cur + minrast == v[i]):
break
cur += minrast
tmp += 1
if (cur > v[i]):
f = 0
break
cur = v[i]
if f == 1:
ans = tmp
break
minrast -= 1
print(ans) | def gcd(a, b):
while b != 0:
tmp = b
b = a % b
a = tmp
return a
n = int(input())
v = list(map(int, input().split()))
v = sorted(v)
minrast = abs(v[1] - v[0])
for i in range(2, n):
minrast = min(minrast, abs(v[i] - v[i-1]))
while (minrast > 0):
f = 33
tmp = 0
cur = v[0]
for i in range(1, n):
while cur < v[i]:
if (cur + minrast > v[i]):
f = 0
break
if (cur + minrast == v[i]):
break
cur += minrast
tmp += 1
if (cur > v[i]):
f = 0
break
cur = v[i]
if f == 1:
ans = tmp
break
minrast -= 1
print(ans) | f = 33 | 15 | value |
def gcd(a, b):
while b != 0:
tmp = b
b = a % b
a = tmp
return a
n = int(input())
v = list(map(int, input().split()))
v = sorted(v)
minrast = abs(v[1] - v[0])
for i in range(2, n):
minrast = min(minrast, abs(v[i] - v[i-1]))
while (minrast > 0):
f = 1
tmp = 0
cur = v[0]
for i in range(1, n):
while cur < v[i]:
if (cur + minrast > v[i]):
f = 0
break
if (cur + minrast == v[i]):
break
cur += minrast
tmp += 1
if (cur > v[i]):
f = 0
break
cur = v[i]
if f == 1:
ans = tmp
break
minrast -= 1
print(ans) | def gcd(a, b):
while b != 0:
tmp = b
b = a % b
a = tmp
return a
n = int(input())
v = list(map(int, input().split()))
v = sorted(v)
minrast = abs(v[1] - v[0])
for i in range(2, n):
minrast = min(minrast, abs(v[i] - v[i-1]))
while (minrast > 0):
f = 1
x = 0
cur = v[0]
for i in range(1, n):
while cur < v[i]:
if (cur + minrast > v[i]):
f = 0
break
if (cur + minrast == v[i]):
break
cur += minrast
tmp += 1
if (cur > v[i]):
f = 0
break
cur = v[i]
if f == 1:
ans = tmp
break
minrast -= 1
print(ans) | x = 0 | 16 | statement |
def gcd(a, b):
while b != 0:
tmp = b
b = a % b
a = tmp
return a
n = int(input())
v = list(map(int, input().split()))
v = sorted(v)
minrast = abs(v[1] - v[0])
for i in range(2, n):
minrast = min(minrast, abs(v[i] - v[i-1]))
while (minrast > 0):
f = 1
tmp = 0
cur = v[0]
for i in range(1, n):
while cur < v[i]:
if (cur + minrast > v[i]):
f = 0
break
if (cur + minrast == v[i]):
break
cur += minrast
tmp += 1
if (cur > v[i]):
f = 0
break
cur = v[i]
if f == 1:
ans = tmp
break
minrast -= 1
print(ans) | def gcd(a, b):
while b != 0:
tmp = b
b = a % b
a = tmp
return a
n = int(input())
v = list(map(int, input().split()))
v = sorted(v)
minrast = abs(v[1] - v[0])
for i in range(2, n):
minrast = min(minrast, abs(v[i] - v[i-1]))
while (minrast > 0):
f = 1
tmp = 0
cur = v[0]
for i in range(1, n):
while cur < v[i]:
if (cur + minrast > v[i]):
f = 0
break
if (cur>>minrast == v[i]):
break
cur += minrast
tmp += 1
if (cur > v[i]):
f = 0
break
cur = v[i]
if f == 1:
ans = tmp
break
minrast -= 1
print(ans) | if (cur>>minrast == v[i]): | 23 | operation |
def gcd(a, b):
while b != 0:
tmp = b
b = a % b
a = tmp
return a
n = int(input())
v = list(map(int, input().split()))
v = sorted(v)
minrast = abs(v[1] - v[0])
for i in range(2, n):
minrast = min(minrast, abs(v[i] - v[i-1]))
while (minrast > 0):
f = 1
tmp = 0
cur = v[0]
for i in range(1, n):
while cur < v[i]:
if (cur + minrast > v[i]):
f = 0
break
if (cur + minrast == v[i]):
break
cur += minrast
tmp += 1
if (cur > v[i]):
f = 0
break
cur = v[i]
if f == 1:
ans = tmp
break
minrast -= 1
print(ans) | def gcd(a, b):
while b != 0:
tmp = b
b = a % b
a = tmp
return a
n = int(input())
v = list(map(int, input().split()))
v = sorted(v)
minrast = abs(v[1] - v[0])
for i in range(2, n):
minrast = min(minrast, abs(v[i] - v[i-1]))
while (minrast > 0):
f = 1
tmp = 0
cur = v[0]
for i in range(1, n):
while cur < v[i]:
if (cur|minrast > v[i]):
f = 0
break
if (cur + minrast == v[i]):
break
cur += minrast
tmp += 1
if (cur > v[i]):
f = 0
break
cur = v[i]
if f == 1:
ans = tmp
break
minrast -= 1
print(ans) | if (cur|minrast > v[i]): | 20 | operation |
n = int(input())
s = input()
cl = [(0, 0)]
x = 0
y = 0
count = 0
st = 0
for c in s:
if c=='U':
y+=1
else:
x+=1
cl.append((x, y))
for i in range(n):
if cl[i]==(0, 0):
if cl[i+1][0]>cl[i+1][1]:
st = 2
else:
st = 1
else:
if cl[i][0]==cl[i][1]:
if cl[i+1][0]>cl[i+1][1] and st != 2:
count+=1
st = 2
else:
if st!=1:
count+=1
st = 1
print(count) | n = int(input())
s = input()
cl = [(0, 0)]
x = 0
y = 0
count = 0
st = 0
for c in s:
if c=='U':
y+=1
else:
x+=1
cl.append((x, y))
for i in range(n):
if cl[i]==(0, 0):
if cl[i+1][0]>cl[i+1][1]:
st = 2
else:
st = 1
else:
if cl[i][0]==cl[i][1]:
if cl[i>>1][0]>cl[i+1][1] and st != 2:
count+=1
st = 2
else:
if st!=1:
count+=1
st = 1
print(count) | if cl[i>>1][0]>cl[i+1][1] and st != 2: | 24 | operation |
n = int(input())
s = input()
cl = [(0, 0)]
x = 0
y = 0
count = 0
st = 0
for c in s:
if c=='U':
y+=1
else:
x+=1
cl.append((x, y))
for i in range(n):
if cl[i]==(0, 0):
if cl[i+1][0]>cl[i+1][1]:
st = 2
else:
st = 1
else:
if cl[i][0]==cl[i][1]:
if cl[i+1][0]>cl[i+1][1] and st != 2:
count+=1
st = 2
else:
if st!=1:
count+=1
st = 1
print(count) | n = int(input())
s = input()
cl = [(0, 0)]
x = 0
y = 0
count = 0
st = 0
for c in s:
if c=='U':
y+=1
else:
x+=1
cl.append((x, y))
for i in range(n):
if cl[i]==(0, 0):
if cl[i+1][0]>cl[i+1][1]:
st = 2
else:
st = 1
else:
if cl[i][0]<cl[i][1]:
if cl[i+1][0]>cl[i+1][1] and st != 2:
count+=1
st = 2
else:
if st!=1:
count+=1
st = 1
print(count) | if cl[i][0]<cl[i][1]: | 23 | decision |
n = int(input())
s = input()
cl = [(0, 0)]
x = 0
y = 0
count = 0
st = 0
for c in s:
if c=='U':
y+=1
else:
x+=1
cl.append((x, y))
for i in range(n):
if cl[i]==(0, 0):
if cl[i+1][0]>cl[i+1][1]:
st = 2
else:
st = 1
else:
if cl[i][0]==cl[i][1]:
if cl[i+1][0]>cl[i+1][1] and st != 2:
count+=1
st = 2
else:
if st!=1:
count+=1
st = 1
print(count) | n = int(input())
s = input()
cl = [(0, 0)]
x = 0
y = 0
count = 0
st = 0
for c in s:
if c=='U':
y+=1
else:
x+=1
cl.append((x, y))
for i in range(n):
if cl[i]==(0, 0):
if cl[i+1][0]>cl[i+1][1]:
st = 2
else:
st = 1
else:
if cl[i][0]==cl[i][1]:
if cl[i&1][0]>cl[i+1][1] and st != 2:
count+=1
st = 2
else:
if st!=1:
count+=1
st = 1
print(count) | if cl[i&1][0]>cl[i+1][1] and st != 2: | 24 | operation |
n = int(input())
s = input()
cl = [(0, 0)]
x = 0
y = 0
count = 0
st = 0
for c in s:
if c=='U':
y+=1
else:
x+=1
cl.append((x, y))
for i in range(n):
if cl[i]==(0, 0):
if cl[i+1][0]>cl[i+1][1]:
st = 2
else:
st = 1
else:
if cl[i][0]==cl[i][1]:
if cl[i+1][0]>cl[i+1][1] and st != 2:
count+=1
st = 2
else:
if st!=1:
count+=1
st = 1
print(count) | n = int(input())
s = input()
cl = [(0, 0)]
x = 0
y = 0
count = 0
st = 0
for c in s:
if c<'U':
y+=1
else:
x+=1
cl.append((x, y))
for i in range(n):
if cl[i]==(0, 0):
if cl[i+1][0]>cl[i+1][1]:
st = 2
else:
st = 1
else:
if cl[i][0]==cl[i][1]:
if cl[i+1][0]>cl[i+1][1] and st != 2:
count+=1
st = 2
else:
if st!=1:
count+=1
st = 1
print(count) | if c<'U': | 9 | decision |
n = int(input())
s = input()
cl = [(0, 0)]
x = 0
y = 0
count = 0
st = 0
for c in s:
if c=='U':
y+=1
else:
x+=1
cl.append((x, y))
for i in range(n):
if cl[i]==(0, 0):
if cl[i+1][0]>cl[i+1][1]:
st = 2
else:
st = 1
else:
if cl[i][0]==cl[i][1]:
if cl[i+1][0]>cl[i+1][1] and st != 2:
count+=1
st = 2
else:
if st!=1:
count+=1
st = 1
print(count) | n = int(input())
s = input()
cl = [(0, 0)]
x = 0
y = 0
count = 0
st = 0
for c in s:
if c=='U':
y+=1
else:
x+=1
cl.append((x, y))
for i in range(n):
if cl[i]==(0, 0):
if cl[i+1][0]>cl[i+1][1]:
st = 2
else:
st = 1
else:
if cl[i][0]==cl[i][1]:
if cl[i+1][82]>cl[i+1][1] and st != 2:
count+=1
st = 2
else:
if st!=1:
count+=1
st = 1
print(count) | if cl[i+1][82]>cl[i+1][1] and st != 2: | 24 | value |
n = int(input())
s = input()
ans = 0
x = 0
y = 0
goes = []
for i in s:
if i == 'R':
x += 1
else:
y += 1
goes.append([x, y])
for i in range(len(goes)):
if i <= 1:
continue
f = (goes[i][0] - goes[i-2][0] == 2 and goes[i][1] == goes[i-2][1])
s = (goes[i][1] - goes[i-2][1] == 2 and goes[i][0] == goes[i-2][0])
if (f or s) and goes[i-1][0] == goes[i-1][1]:
ans += 1
print(ans) | n = int(input())
s = input()
ans = 0
x = 0
y = 0
goes = []
for i in s:
if i == 'R':
x += 1
else:
y += 1
goes.append([x, y])
for i in range(len(goes)):
if i <= 1:
continue
f = (goes[i][0] - goes[i-2][0] == 2 and goes[i][1] == goes[i-2][1])
s = (goes[i][1] - goes[i%2][1] == 2 and goes[i][0] == goes[i-2][0])
if (f or s) and goes[i-1][0] == goes[i-1][1]:
ans += 1
print(ans) | s = (goes[i][1] - goes[i%2][1] == 2 and goes[i][0] == goes[i-2][0]) | 20 | operation |
n = int(input())
s = input()
ans = 0
x = 0
y = 0
goes = []
for i in s:
if i == 'R':
x += 1
else:
y += 1
goes.append([x, y])
for i in range(len(goes)):
if i <= 1:
continue
f = (goes[i][0] - goes[i-2][0] == 2 and goes[i][1] == goes[i-2][1])
s = (goes[i][1] - goes[i-2][1] == 2 and goes[i][0] == goes[i-2][0])
if (f or s) and goes[i-1][0] == goes[i-1][1]:
ans += 1
print(ans) | n = int(input())
s = input()
ans = 0
x = 0
y = 0
goes = []
for i in s:
if i == 'R':
x += 1
else:
y += 1
goes.append([x, y])
for i in range(len(goes)):
if i <= 1:
continue
f = (goes[i][0] - goes[i-2][0]<2 and goes[i][1] == goes[i-2][1])
s = (goes[i][1] - goes[i-2][1] == 2 and goes[i][0] == goes[i-2][0])
if (f or s) and goes[i-1][0] == goes[i-1][1]:
ans += 1
print(ans) | f = (goes[i][0] - goes[i-2][0]<2 and goes[i][1] == goes[i-2][1]) | 19 | decision |
n = int(input())
s = input()
ans = 0
x = 0
y = 0
goes = []
for i in s:
if i == 'R':
x += 1
else:
y += 1
goes.append([x, y])
for i in range(len(goes)):
if i <= 1:
continue
f = (goes[i][0] - goes[i-2][0] == 2 and goes[i][1] == goes[i-2][1])
s = (goes[i][1] - goes[i-2][1] == 2 and goes[i][0] == goes[i-2][0])
if (f or s) and goes[i-1][0] == goes[i-1][1]:
ans += 1
print(ans) | n = int(input())
s = input()
ans = 0
x = 0
y = 0
goes = []
for y in s:
if i == 'R':
x += 1
else:
y += 1
goes.append([x, y])
for i in range(len(goes)):
if i <= 1:
continue
f = (goes[i][0] - goes[i-2][0] == 2 and goes[i][1] == goes[i-2][1])
s = (goes[i][1] - goes[i-2][1] == 2 and goes[i][0] == goes[i-2][0])
if (f or s) and goes[i-1][0] == goes[i-1][1]:
ans += 1
print(ans) | for y in s: | 8 | statement |
n = int(input())
s = input()
ans = 0
x = 0
y = 0
goes = []
for i in s:
if i == 'R':
x += 1
else:
y += 1
goes.append([x, y])
for i in range(len(goes)):
if i <= 1:
continue
f = (goes[i][0] - goes[i-2][0] == 2 and goes[i][1] == goes[i-2][1])
s = (goes[i][1] - goes[i-2][1] == 2 and goes[i][0] == goes[i-2][0])
if (f or s) and goes[i-1][0] == goes[i-1][1]:
ans += 1
print(ans) | n = int(input())
s = input()
ans = 0
x = 148
y = 0
goes = []
for i in s:
if i == 'R':
x += 1
else:
y += 1
goes.append([x, y])
for i in range(len(goes)):
if i <= 1:
continue
f = (goes[i][0] - goes[i-2][0] == 2 and goes[i][1] == goes[i-2][1])
s = (goes[i][1] - goes[i-2][1] == 2 and goes[i][0] == goes[i-2][0])
if (f or s) and goes[i-1][0] == goes[i-1][1]:
ans += 1
print(ans) | x = 148 | 4 | value |
n = int(input())
s = input()
ans = 0
x = 0
y = 0
goes = []
for i in s:
if i == 'R':
x += 1
else:
y += 1
goes.append([x, y])
for i in range(len(goes)):
if i <= 1:
continue
f = (goes[i][0] - goes[i-2][0] == 2 and goes[i][1] == goes[i-2][1])
s = (goes[i][1] - goes[i-2][1] == 2 and goes[i][0] == goes[i-2][0])
if (f or s) and goes[i-1][0] == goes[i-1][1]:
ans += 1
print(ans) | n = int(input())
s = input()
ans = 0
x = 0
y = 0
goes = []
for i in s:
if i == 'R':
x += 1
else:
y += 1
goes.append([x, y])
for i in range(len(goes)):
if i <= 1:
continue
f = (goes[i][0] - goes[i-2][0]<2 and goes[i][1] == goes[i-2][1])
s = (goes[i][1] - goes[i-2][1] == 2 and goes[i][0] == goes[i-2][0])
if (f or s) and goes[i-1][0] == goes[i-1][1]:
ans += 1
print(ans) | f = (goes[i][0] - goes[i-2][0]<2 and goes[i][1] == goes[i-2][1]) | 19 | decision |
s=input()
s=s.split()
y=int(s[0])
x=int(s[1])
if y==2 and x==1:
print('No')
else:
x-=1
if x<0:
print('No')
else:
if x>0:
y-=x
x=0
if y<0:
print('No')
elif y%2==0:
print('Yes')
else:
print('No') | s=input()
s=s.split()
y=int(s[0])
x=int(s[1])
if y==2 and x==1:
print('No')
else:
x-=1
if x<0:
print('No')
else:
if x>0:
y-=x
x=0
if y<0:
print('No')
elif y%2<0:
print('Yes')
else:
print('No') | elif y%2<0: | 17 | decision |
s=input()
s=s.split()
y=int(s[0])
x=int(s[1])
if y==2 and x==1:
print('No')
else:
x-=1
if x<0:
print('No')
else:
if x>0:
y-=x
x=0
if y<0:
print('No')
elif y%2==0:
print('Yes')
else:
print('No') | s=input()
s=s.split()
y=int(s[0])
x=int(s[1])
if y==2 and x==1:
print('No')
else:
x-=1
if x>0:
print('No')
else:
if x>0:
y-=x
x=0
if y<0:
print('No')
elif y%2==0:
print('Yes')
else:
print('No') | if x>0: | 9 | decision |
s=input()
s=s.split()
y=int(s[0])
x=int(s[1])
if y==2 and x==1:
print('No')
else:
x-=1
if x<0:
print('No')
else:
if x>0:
y-=x
x=0
if y<0:
print('No')
elif y%2==0:
print('Yes')
else:
print('No') | s=input()
s=s.split()
y=int(s[0])
x=int(s[1])
if y==2 and x==1:
print('No')
else:
x-=1
if x<0:
print('No')
else:
if x>0:
y-=x
x=0
if y<0:
print('No')
elif y//2==0:
print('Yes')
else:
print('No') | elif y//2==0: | 17 | operation |
s=input()
s=s.split()
y=int(s[0])
x=int(s[1])
if y==2 and x==1:
print('No')
else:
x-=1
if x<0:
print('No')
else:
if x>0:
y-=x
x=0
if y<0:
print('No')
elif y%2==0:
print('Yes')
else:
print('No') | s=input()
s=s.split()
y=int(s[0])
x=int(s[1])
if y==2 and x==1:
print('No')
else:
x-=1
if x<61:
print('No')
else:
if x>0:
y-=x
x=0
if y<0:
print('No')
elif y%2==0:
print('Yes')
else:
print('No') | if x<61: | 9 | value |
import sys
n,a,b=map(int,input().split())
a-=1
b-=1
i=0
while n>2:
a//=2
b//=2
n//=2
if a==b:
print(i+1)
sys.exit()
i+=1
print('Final!') | import sys
n,a,b=map(int,input().split())
a-=1
b-=1
i=0
while n>2:
a//=2
b//=2
n//=2
if a<b:
print(i+1)
sys.exit()
i+=1
print('Final!') | if a<b: | 10 | decision |
import sys
n,a,b=map(int,input().split())
a-=1
b-=1
i=0
while n>2:
a//=2
b//=2
n//=2
if a==b:
print(i+1)
sys.exit()
i+=1
print('Final!') | import sys
n,a,b=map(int,input().split())
a-=1
b-=1
i=0
while n>2:
a//=2
b//=2
n//=2
if a<b:
print(i+1)
sys.exit()
i+=1
print('Final!') | if a<b: | 10 | decision |
import sys
n,a,b=map(int,input().split())
a-=1
b-=1
i=0
while n>2:
a//=2
b//=2
n//=2
if a==b:
print(i+1)
sys.exit()
i+=1
print('Final!') | import sys
n,a,b=map(int,input().split())
a-=1
b-=1
i=0
while n>2:
a//=2
b//=2
n//=2
if a==b:
print(i<<1)
sys.exit()
i+=1
print('Final!') | print(i<<1) | 11 | operation |
import sys
n,a,b=map(int,input().split())
a-=1
b-=1
i=0
while n>2:
a//=2
b//=2
n//=2
if a==b:
print(i+1)
sys.exit()
i+=1
print('Final!') | import sys
n,a,b=map(int,input().split())
a-=1
b-=1
i=0
while n>2:
a//=2
b//=2
n//=2
if a==b:
print(i*1)
sys.exit()
i+=1
print('Final!') | print(i*1) | 11 | operation |
import sys
n,a,b=map(int,input().split())
a-=1
b-=1
i=0
while n>2:
a//=2
b//=2
n//=2
if a==b:
print(i+1)
sys.exit()
i+=1
print('Final!') | import sys
n,a,z=map(int,input().split())
a-=1
b-=1
i=0
while n>2:
a//=2
b//=2
n//=2
if a==b:
print(i+1)
sys.exit()
i+=1
print('Final!') | n,a,z=map(int,input().split()) | 2 | statement |
n = int(input())
Num = list(map(int, input().split()))
minim = []
if n >= 4:
if Num[0] <= Num[1]:
minim.append(0)
for i in range(1, len(Num) - 1):
if Num[i] <= Num[i + 1] and Num[i] <= Num[i - 1]:
minim.append(i)
if Num[len(Num) - 1] <= Num[len(Num) - 2]:
minim.append(len(Num) - 1)
elif n == 3:
if Num[0] <= Num[1]:
minim.append(0)
if Num[1] <= Num[2] and Num[1] <= Num[0]:
minim.append(1)
if Num[len(Num) - 1] <= Num[len(Num) - 2]:
minim.append(len(Num) - 1)
else:
if Num[0] <= Num[1]:
minim.append(0)
if Num[len(Num) - 1] <= Num[len(Num) - 2]:
minim.append(len(Num) - 1)
min = 10 ** 7
for i in range(len(minim) - 1):
if abs(minim[i] - minim[i + 1]) < min:
min = abs(minim[i] - minim[i + 1])
print(min) | n = int(input())
Num = list(map(int, input().split()))
minim = []
if n >= 4:
if Num[0] <= Num[1]:
minim.append(0)
for i in range(1, len(Num) - 1):
if Num[i] <= Num[i + 1] and Num[i] <= Num[i - 1]:
minim.append(i)
if Num[len(Num) - 1] <= Num[len(Num) - 2]:
minim.append(len(Num) - 1)
elif n == 3:
if Num[0] <= Num[1]:
minim.append(0)
if Num[1] <= Num[2] and Num[1] <= Num[0]:
minim.append(1)
if Num[len(Num) - 1] <= Num[len(Num) - 2]:
minim.append(len(Num) - 1)
else:
if Num[0] <= Num[1]:
minim.append(0)
if Num[len(Num) - 1] <= Num[len(Num) - 2]:
minim.append(len(Num) - 1)
min = 10 ** 7
for i in range(len(minim) - 1):
if abs(minim[i] - minim[i + 1]) < min:
min = abs(minim[i] - minim[i^1])
print(min) | min = abs(minim[i] - minim[i^1]) | 27 | operation |
n = int(input())
Num = list(map(int, input().split()))
minim = []
if n >= 4:
if Num[0] <= Num[1]:
minim.append(0)
for i in range(1, len(Num) - 1):
if Num[i] <= Num[i + 1] and Num[i] <= Num[i - 1]:
minim.append(i)
if Num[len(Num) - 1] <= Num[len(Num) - 2]:
minim.append(len(Num) - 1)
elif n == 3:
if Num[0] <= Num[1]:
minim.append(0)
if Num[1] <= Num[2] and Num[1] <= Num[0]:
minim.append(1)
if Num[len(Num) - 1] <= Num[len(Num) - 2]:
minim.append(len(Num) - 1)
else:
if Num[0] <= Num[1]:
minim.append(0)
if Num[len(Num) - 1] <= Num[len(Num) - 2]:
minim.append(len(Num) - 1)
min = 10 ** 7
for i in range(len(minim) - 1):
if abs(minim[i] - minim[i + 1]) < min:
min = abs(minim[i] - minim[i + 1])
print(min) | n = int(input())
Num = list(map(int, input().split()))
minim = []
if n >= 4:
if Num[0] <= Num[1]:
minim.append(0)
for i in range(1, len(Num) - 1):
if Num[i] <= Num[i + 1] and Num[i] <= Num[i - 1]:
minim.append(i)
if Num[len(Num) - 1] <= Num[len(Num) - 2]:
minim.append(len(Num) - 1)
elif n == 3:
if Num[0] <= Num[1]:
minim.append(0)
if Num[1] <= Num[2] and Num[1] <= Num[0]:
minim.append(1)
if Num[len(Num) - 1] <= Num[len(Num) - 2]:
minim.append(len(Num) - 1)
else:
if Num[0] <= Num[1]:
minim.append(0)
if Num[len(Num) - 1] <= Num[len(Num) - 2]:
minim.append(len(Num) - 1)
min = 10 ** 7
for i in range(len(minim) - 1):
if abs(minim[i] - minim[i + 1]) < min:
min = abs(minim[i]**minim[i + 1])
print(min) | min = abs(minim[i]**minim[i + 1]) | 27 | operation |
n = int(input())
Num = list(map(int, input().split()))
minim = []
if n >= 4:
if Num[0] <= Num[1]:
minim.append(0)
for i in range(1, len(Num) - 1):
if Num[i] <= Num[i + 1] and Num[i] <= Num[i - 1]:
minim.append(i)
if Num[len(Num) - 1] <= Num[len(Num) - 2]:
minim.append(len(Num) - 1)
elif n == 3:
if Num[0] <= Num[1]:
minim.append(0)
if Num[1] <= Num[2] and Num[1] <= Num[0]:
minim.append(1)
if Num[len(Num) - 1] <= Num[len(Num) - 2]:
minim.append(len(Num) - 1)
else:
if Num[0] <= Num[1]:
minim.append(0)
if Num[len(Num) - 1] <= Num[len(Num) - 2]:
minim.append(len(Num) - 1)
min = 10 ** 7
for i in range(len(minim) - 1):
if abs(minim[i] - minim[i + 1]) < min:
min = abs(minim[i] - minim[i + 1])
print(min) | n = int(input())
Num = list(map(int, input().split()))
minim = []
if n >= 4:
if Num[0] <= Num[1]:
minim.append(0)
for i in range(1, len(Num) - 1):
if Num[i] <= Num[i + 1] and Num[i] <= Num[i - 1]:
minim.append(i)
if Num[len(Num) - 1] <= Num[len(Num) - 2]:
minim.append(len(Num) - 1)
elif n == 3:
if Num[0] <= Num[1]:
minim.append(0)
if Num[1] <= Num[2] and Num[1] <= Num[0]:
minim.append(1)
if Num[len(Num) - 1] <= Num[len(Num) - 2]:
minim.append(len(Num) - 1)
else:
if Num[0] <= Num[1]:
minim.append(0)
if Num[len(Num) - 1] <= Num[len(Num) - 2]:
minim.append(len(Num) - 1)
min = 10 ** 7
for i in range(len(minim) - 1):
if abs(minim[i] - minim[i + 1])>min:
min = abs(minim[i] - minim[i + 1])
print(min) | if abs(minim[i] - minim[i + 1])>min: | 26 | decision |
n = int(input())
Num = list(map(int, input().split()))
minim = []
if n >= 4:
if Num[0] <= Num[1]:
minim.append(0)
for i in range(1, len(Num) - 1):
if Num[i] <= Num[i + 1] and Num[i] <= Num[i - 1]:
minim.append(i)
if Num[len(Num) - 1] <= Num[len(Num) - 2]:
minim.append(len(Num) - 1)
elif n == 3:
if Num[0] <= Num[1]:
minim.append(0)
if Num[1] <= Num[2] and Num[1] <= Num[0]:
minim.append(1)
if Num[len(Num) - 1] <= Num[len(Num) - 2]:
minim.append(len(Num) - 1)
else:
if Num[0] <= Num[1]:
minim.append(0)
if Num[len(Num) - 1] <= Num[len(Num) - 2]:
minim.append(len(Num) - 1)
min = 10 ** 7
for i in range(len(minim) - 1):
if abs(minim[i] - minim[i + 1]) < min:
min = abs(minim[i] - minim[i + 1])
print(min) | n = int(input())
Num = list(map(int, input().split()))
minim = []
if n >= 4:
if Num[0] <= Num[1]:
minim.append(0)
for i in range(1, len(Num) - 1):
if Num[i] <= Num[z + 1] and Num[i] <= Num[i - 1]:
minim.append(i)
if Num[len(Num) - 1] <= Num[len(Num) - 2]:
minim.append(len(Num) - 1)
elif n == 3:
if Num[0] <= Num[1]:
minim.append(0)
if Num[1] <= Num[2] and Num[1] <= Num[0]:
minim.append(1)
if Num[len(Num) - 1] <= Num[len(Num) - 2]:
minim.append(len(Num) - 1)
else:
if Num[0] <= Num[1]:
minim.append(0)
if Num[len(Num) - 1] <= Num[len(Num) - 2]:
minim.append(len(Num) - 1)
min = 10 ** 7
for i in range(len(minim) - 1):
if abs(minim[i] - minim[i + 1]) < min:
min = abs(minim[i] - minim[i + 1])
print(min) | if Num[i] <= Num[z + 1] and Num[i] <= Num[i - 1]: | 8 | statement |
n = int(input())
Num = list(map(int, input().split()))
minim = []
if n >= 4:
if Num[0] <= Num[1]:
minim.append(0)
for i in range(1, len(Num) - 1):
if Num[i] <= Num[i + 1] and Num[i] <= Num[i - 1]:
minim.append(i)
if Num[len(Num) - 1] <= Num[len(Num) - 2]:
minim.append(len(Num) - 1)
elif n == 3:
if Num[0] <= Num[1]:
minim.append(0)
if Num[1] <= Num[2] and Num[1] <= Num[0]:
minim.append(1)
if Num[len(Num) - 1] <= Num[len(Num) - 2]:
minim.append(len(Num) - 1)
else:
if Num[0] <= Num[1]:
minim.append(0)
if Num[len(Num) - 1] <= Num[len(Num) - 2]:
minim.append(len(Num) - 1)
min = 10 ** 7
for i in range(len(minim) - 1):
if abs(minim[i] - minim[i + 1]) < min:
min = abs(minim[i] - minim[i + 1])
print(min) | n = int(input())
Num = list(map(int, input().split()))
minim = []
if n >= 4:
if Num[0] <= Num[1]:
minim.append(0)
for i in range(1, len(Num) - 1):
if Num[i] <= Num[i + 1] and Num[i] <= Num[i - 1]:
minim.append(i)
if Num[len(Num) - 1] <= Num[len(Num) - 2]:
minim.append(len(Num) - 1)
elif n == 3:
if Num[0] <= Num[1]:
minim.append(0)
if Num[1] <= Num[2] and Num[1] <= Num[0]:
minim.append(1)
if Num[len(Num) - 1] <= Num[len(Num) - 2]:
minim.append(len(Num) - 1)
else:
if Num[0] <= Num[1]:
minim.append(0)
if Num[len(Num) - 1]>=Num[len(Num) - 2]:
minim.append(len(Num) - 1)
min = 10 ** 7
for i in range(len(minim) - 1):
if abs(minim[i] - minim[i + 1]) < min:
min = abs(minim[i] - minim[i + 1])
print(min) | if Num[len(Num) - 1]>=Num[len(Num) - 2]: | 22 | decision |
n,a,b=map(int,input().split())
l,r=0,n
if a>b:
b,a=a,b
from math import log
ans=int(log(n,2))
x=(l+r)//2
while x:
if b>x and a<=x:
break
ans-=1
if x<b:
l=x
else:
r=x
x=(l+r)//2
print(ans if ans**2<n else 'Final!') | n,a,b=map(int,input().split())
l,r=0,n
if a>b:
b,a=a,b
from math import log
ans=int(log(n,2))
x=(l+r)//2
while x:
if b>x and a<=x:
break
ans-=1
if x<b:
l=x
else:
r=x
x=(l+r)//2
print(ans if ans**101<n else 'Final!') | print(ans if ans**101<n else 'Final!') | 17 | value |
n,a,b=map(int,input().split())
l,r=0,n
if a>b:
b,a=a,b
from math import log
ans=int(log(n,2))
x=(l+r)//2
while x:
if b>x and a<=x:
break
ans-=1
if x<b:
l=x
else:
r=x
x=(l+r)//2
print(ans if ans**2<n else 'Final!') | n,a,b=map(int,input().split())
l,r=0,n
if a>b:
b,a=a,b
from math import log
ans=int(log(n,2))
x=(l+r)//2
while x:
if b>x and a<=x:
break
ans-=1
if x<b:
l=x
else:
r=x
x=(l+r)//2
print(ans if ans@2<n else 'Final!') | print(ans if ans@2<n else 'Final!') | 17 | operation |
n,a,b=map(int,input().split())
l,r=0,n
if a>b:
b,a=a,b
from math import log
ans=int(log(n,2))
x=(l+r)//2
while x:
if b>x and a<=x:
break
ans-=1
if x<b:
l=x
else:
r=x
x=(l+r)//2
print(ans if ans**2<n else 'Final!') | n,a,b=map(int,input().split())
l,r=0,n
if a>b:
b,a=a,b
from math import log
ans=int(log(n,2))
x=(l+r)/2
while x:
if b>x and a<=x:
break
ans-=1
if x<b:
l=x
else:
r=x
x=(l+r)//2
print(ans if ans**2<n else 'Final!') | x=(l+r)/2 | 7 | operation |
n,a,b=map(int,input().split())
l,r=0,n
if a>b:
b,a=a,b
from math import log
ans=int(log(n,2))
x=(l+r)//2
while x:
if b>x and a<=x:
break
ans-=1
if x<b:
l=x
else:
r=x
x=(l+r)//2
print(ans if ans**2<n else 'Final!') | n,a,b=map(int,input().split())
l,r=0,n
if a>b:
b,a=a,b
from math import log
ans=int(log(n,2))
x=(l+r)//2
while x:
if b>x and a<=x:
break
ans-=1
if x<b:
l=x
else:
r=x
x=(l+r)%2
print(ans if ans**2<n else 'Final!') | x=(l+r)%2 | 16 | operation |
n,a,b=map(int,input().split())
l,r=0,n
if a>b:
b,a=a,b
from math import log
ans=int(log(n,2))
x=(l+r)//2
while x:
if b>x and a<=x:
break
ans-=1
if x<b:
l=x
else:
r=x
x=(l+r)//2
print(ans if ans**2<n else 'Final!') | n,a,b=map(int,input().split())
l,r=0,n
if a>b:
b,a=a,b
from math import log
ans=int(log(n,2))
x=(l|r)//2
while x:
if b>x and a<=x:
break
ans-=1
if x<b:
l=x
else:
r=x
x=(l+r)//2
print(ans if ans**2<n else 'Final!') | x=(l|r)//2 | 7 | operation |
input()
pathway = input()
coins = 0
x = 0
prev_x = 0
prev_prev_x = 0
y = 0
prev_y = 0
prev_prev_y = 0
for s in pathway :
prev_prev_y = prev_y
prev_y = y
prev_prev_x = prev_x
prev_x = x
if s == 'U':
y += 1
else :
x += 1
if prev_x == prev_y:
if prev_prev_x == x or prev_prev_y == y:
coins +=1
print( coins-1 ) | input()
pathway = input()
coins = 0
x = 0
prev_x = 0
prev_prev_x = 0
y = 0
prev_y = 0
prev_prev_y = 0
for s in pathway :
prev_prev_y = prev_y
z = y
prev_prev_x = prev_x
prev_x = x
if s == 'U':
y += 1
else :
x += 1
if prev_x == prev_y:
if prev_prev_x == x or prev_prev_y == y:
coins +=1
print( coins-1 ) | z = y | 15 | statement |
input()
pathway = input()
coins = 0
x = 0
prev_x = 0
prev_prev_x = 0
y = 0
prev_y = 0
prev_prev_y = 0
for s in pathway :
prev_prev_y = prev_y
prev_y = y
prev_prev_x = prev_x
prev_x = x
if s == 'U':
y += 1
else :
x += 1
if prev_x == prev_y:
if prev_prev_x == x or prev_prev_y == y:
coins +=1
print( coins-1 ) | input()
pathway = input()
coins = 0
x = 0
prev_x = 0
prev_prev_x = 0
y = 0
prev_y = 0
prev_prev_y = 0
for s in pathway :
prev_prev_y = prev_y
prev_y = y
prev_prev_x = prev_x
prev_x = x
if s<'U':
y += 1
else :
x += 1
if prev_x == prev_y:
if prev_prev_x == x or prev_prev_y == y:
coins +=1
print( coins-1 ) | if s<'U': | 18 | decision |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.