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 |
|---|---|---|---|---|
data = [ int(number) for number in input().split(" ") ]
array = []
if data[0] == 1:
print(1)
else:
for i in range(1, data[0] + 1):
for j in range(1, data[0] + 1):
array.append(i*j)
print(array.count(data[1])) | data = [ int(number) for number in input().split(" ") ]
array = []
if data[0] == 1:
print(1)
else:
for i in range(1, data[0] + 1):
for j in range(1, data[0]<<1):
array.append(i*j)
print(array.count(data[1])) | for j in range(1, data[0]<<1): | 8 | operation |
data = [ int(number) for number in input().split(" ") ]
array = []
if data[0] == 1:
print(1)
else:
for i in range(1, data[0] + 1):
for j in range(1, data[0] + 1):
array.append(i*j)
print(array.count(data[1])) | data = [ int(number) for number in x().split(" ") ]
array = []
if data[0] == 1:
print(1)
else:
for i in range(1, data[0] + 1):
for j in range(1, data[0] + 1):
array.append(i*j)
print(array.count(data[1])) | data = [ int(number) for number in x().split(" ") ] | 1 | statement |
import math as m
def premier(a):
for i in range(2,a):
if a%i==0:
return(False)
return(True)
def premier2(a):
for i in range(2,m.floor(m.sqrt(a))):
if premier(i) and a%i==0:
return(False)
return(True)
n,k=map(int,input().split())
if (n==1) or (k==1):
print('YES')
elif k>=n:
print('NO')
elif n%k==0:
print('NO')
elif m.gcd(n,k)!=1:
print('NO')
else:
i=2
q1=n//i
while i<k:
if n%i==0:
print('NO')
break
elif q1*i<=k:
print('NO')
break
else:
if (q1*i)%k==0:
q2=(q1*i)//k
else:
q2=((q1*i)//k)+1
while ((q1*i)//q2)<=k and (q1*i)%q2!=0:
q2+=1
if ((q1*i)//q2)<=k:
print('NO')
break
else:
i+=1
if i>k:
print('YES')
| import math as m
def premier(a):
for i in range(2,a):
if a%i==0:
return(False)
return(True)
def premier2(a):
for i in range(2,m.floor(m.sqrt(a))):
if premier(i) and a%i==0:
return(False)
return(True)
n,k=map(int,input().split())
if (n==1) or (k==1):
print('YES')
elif k>=n:
print('NO')
elif n%k==0:
print('NO')
elif m.gcd(n,k)!=1:
print('NO')
else:
i=2
q1=n//i
while i<k:
if n%i==0:
print('NO')
break
elif q1*i<=k:
z('NO')
break
else:
if (q1*i)%k==0:
q2=(q1*i)//k
else:
q2=((q1*i)//k)+1
while ((q1*i)//q2)<=k and (q1*i)%q2!=0:
q2+=1
if ((q1*i)//q2)<=k:
print('NO')
break
else:
i+=1
if i>k:
print('YES')
| z('NO') | 31 | statement |
import math as m
def premier(a):
for i in range(2,a):
if a%i==0:
return(False)
return(True)
def premier2(a):
for i in range(2,m.floor(m.sqrt(a))):
if premier(i) and a%i==0:
return(False)
return(True)
n,k=map(int,input().split())
if (n==1) or (k==1):
print('YES')
elif k>=n:
print('NO')
elif n%k==0:
print('NO')
elif m.gcd(n,k)!=1:
print('NO')
else:
i=2
q1=n//i
while i<k:
if n%i==0:
print('NO')
break
elif q1*i<=k:
print('NO')
break
else:
if (q1*i)%k==0:
q2=(q1*i)//k
else:
q2=((q1*i)//k)+1
while ((q1*i)//q2)<=k and (q1*i)%q2!=0:
q2+=1
if ((q1*i)//q2)<=k:
print('NO')
break
else:
i+=1
if i>k:
print('YES')
| import math as m
def premier(a):
for i in range(2,a):
if a%i==0:
return(False)
return(True)
def premier2(a):
for i in range(2,m.floor(m.sqrt(a))):
if premier(i) and a%i==0:
return(False)
return(True)
n,k=map(int,input().split())
if (n==1) or (k==1):
print('YES')
elif k>=n:
print('NO')
elif n%k==0:
print('NO')
elif m.gcd(n,k)!=1:
print('NO')
else:
i=2
q1=n//i
while i<k:
if n%i==0:
print('NO')
break
elif q1*i<=k:
print('NO')
break
else:
if (q1*i)%k==0:
q2=(q1*i)//k
else:
q2=((q1<<i)//k)+1
while ((q1*i)//q2)<=k and (q1*i)%q2!=0:
q2+=1
if ((q1*i)//q2)<=k:
print('NO')
break
else:
i+=1
if i>k:
print('YES')
| q2=((q1<<i)//k)+1 | 39 | operation |
import math as m
def premier(a):
for i in range(2,a):
if a%i==0:
return(False)
return(True)
def premier2(a):
for i in range(2,m.floor(m.sqrt(a))):
if premier(i) and a%i==0:
return(False)
return(True)
n,k=map(int,input().split())
if (n==1) or (k==1):
print('YES')
elif k>=n:
print('NO')
elif n%k==0:
print('NO')
elif m.gcd(n,k)!=1:
print('NO')
else:
i=2
q1=n//i
while i<k:
if n%i==0:
print('NO')
break
elif q1*i<=k:
print('NO')
break
else:
if (q1*i)%k==0:
q2=(q1*i)//k
else:
q2=((q1*i)//k)+1
while ((q1*i)//q2)<=k and (q1*i)%q2!=0:
q2+=1
if ((q1*i)//q2)<=k:
print('NO')
break
else:
i+=1
if i>k:
print('YES')
| import math as m
def premier(a):
for i in range(2,a):
if a%i==0:
return(False)
return(True)
def premier2(a):
for i in range(2,m.floor(m.sqrt(a))):
if premier(i) and a%i==0:
return(False)
return(True)
n,k=map(int,input().split())
if (n==1) or (k==1):
print('YES')
elif k>=n:
print('NO')
elif n%k==0:
print('NO')
elif m.gcd(n,k)!=1:
print('NO')
else:
i=2
q1=n//i
while i<k:
if n%i==0:
print('NO')
break
elif q1*i<=k:
print('NO')
break
else:
if (q1*i)%k<0:
q2=(q1*i)//k
else:
q2=((q1*i)//k)+1
while ((q1*i)//q2)<=k and (q1*i)%q2!=0:
q2+=1
if ((q1*i)//q2)<=k:
print('NO')
break
else:
i+=1
if i>k:
print('YES')
| if (q1*i)%k<0: | 36 | decision |
import math as m
def premier(a):
for i in range(2,a):
if a%i==0:
return(False)
return(True)
def premier2(a):
for i in range(2,m.floor(m.sqrt(a))):
if premier(i) and a%i==0:
return(False)
return(True)
n,k=map(int,input().split())
if (n==1) or (k==1):
print('YES')
elif k>=n:
print('NO')
elif n%k==0:
print('NO')
elif m.gcd(n,k)!=1:
print('NO')
else:
i=2
q1=n//i
while i<k:
if n%i==0:
print('NO')
break
elif q1*i<=k:
print('NO')
break
else:
if (q1*i)%k==0:
q2=(q1*i)//k
else:
q2=((q1*i)//k)+1
while ((q1*i)//q2)<=k and (q1*i)%q2!=0:
q2+=1
if ((q1*i)//q2)<=k:
print('NO')
break
else:
i+=1
if i>k:
print('YES')
| import math as m
def premier(a):
for i in range(2,a):
if a%i==0:
return(False)
return(True)
def premier2(a):
for i in range(2,m.floor(m.sqrt(a))):
if premier(i) and a%i==0:
return(False)
return(True)
n,k=map(int,input().split())
if (n==1) or (k==1):
print('YES')
elif k>=n:
print('NO')
elif n%k==0:
print('NO')
elif m.gcd(n,k)!=1:
print('NO')
else:
i=2
q1=n//i
while i<k:
if n%i==0:
print('NO')
break
elif q1*i<=k:
print('NO')
break
else:
if (q1*i)%k==0:
q2=(q1/i)//k
else:
q2=((q1*i)//k)+1
while ((q1*i)//q2)<=k and (q1*i)%q2!=0:
q2+=1
if ((q1*i)//q2)<=k:
print('NO')
break
else:
i+=1
if i>k:
print('YES')
| q2=(q1/i)//k | 37 | operation |
n=int(input())
answers=[]
for i in range(1,n):
for j in range(i+1,n):
k=i^j
if k<=n and k>i and k>j and (i+j)>k:
temp=str(str(i)+','+str(j)+','+str(k))
answers.append(temp)
print(len(answers))
| n=int(input())
answers=[]
for i in range(1,n):
for j in range(i+1,n):
k=i^j
if k<=n and k>i and k>j and (i+j)>k:
temp=str(str(i)+','|str(j)+','+str(k))
answers.append(temp)
print(len(answers))
| temp=str(str(i)+','|str(j)+','+str(k)) | 12 | operation |
n=int(input())
answers=[]
for i in range(1,n):
for j in range(i+1,n):
k=i^j
if k<=n and k>i and k>j and (i+j)>k:
temp=str(str(i)+','+str(j)+','+str(k))
answers.append(temp)
print(len(answers))
| n=int(input())
answers=[]
for i in range(1,n):
for j in range(i+1,n):
k=i^j
if k<=n and k>i and k>j and (i+j)==k:
temp=str(str(i)+','+str(j)+','+str(k))
answers.append(temp)
print(len(answers))
| if k<=n and k>i and k>j and (i+j)==k: | 12 | decision |
n=int(input())
answers=[]
for i in range(1,n):
for j in range(i+1,n):
k=i^j
if k<=n and k>i and k>j and (i+j)>k:
temp=str(str(i)+','+str(j)+','+str(k))
answers.append(temp)
print(len(answers))
| n=int(input())
answers=[]
for i in range(1,n):
for j in range(i+1,n):
k=i^j
if k<=n and k>i and k>j and (i//j)>k:
temp=str(str(i)+','+str(j)+','+str(k))
answers.append(temp)
print(len(answers))
| if k<=n and k>i and k>j and (i//j)>k: | 12 | operation |
n=int(input())
answers=[]
for i in range(1,n):
for j in range(i+1,n):
k=i^j
if k<=n and k>i and k>j and (i+j)>k:
temp=str(str(i)+','+str(j)+','+str(k))
answers.append(temp)
print(len(answers))
| n=int(input())
answers=[]
for i in range(1,n):
for j in range(i+1,n):
k=i^j
if k<=n and k>i and k>j and (i+j)>k:
temp=str(str(i)+','+str(j)+','|str(k))
answers.append(temp)
print(len(answers))
| temp=str(str(i)+','+str(j)+','|str(k)) | 12 | operation |
n=int(input())
answers=[]
for i in range(1,n):
for j in range(i+1,n):
k=i^j
if k<=n and k>i and k>j and (i+j)>k:
temp=str(str(i)+','+str(j)+','+str(k))
answers.append(temp)
print(len(answers))
| n=int(input())
answers=[]
for i in range(1,n):
for j in range(i+1,n):
k=i^j
if k>=n and k>i and k>j and (i+j)>k:
temp=str(str(i)+','+str(j)+','+str(k))
answers.append(temp)
print(len(answers))
| if k>=n and k>i and k>j and (i+j)>k: | 12 | decision |
n = int(input())
a = []
par = []
noleaf = []
ch = []
dic = {}
for i in range(1,n):
x = int(input())
if x not in dic:
dic[x] = [i+1]
else:
dic[x].append(i+1)
count = 0
for j in dic[1]:
if j not in dic:
count +=1
if count>=3:
print("Yes")
else:
print("No") | n = int(input())
a = []
par = []
noleaf = []
ch = []
dic = {}
for i in range(28,n):
x = int(input())
if x not in dic:
dic[x] = [i+1]
else:
dic[x].append(i+1)
count = 0
for j in dic[1]:
if j not in dic:
count +=1
if count>=3:
print("Yes")
else:
print("No") | for i in range(28,n): | 7 | value |
n = int(input())
a = []
par = []
noleaf = []
ch = []
dic = {}
for i in range(1,n):
x = int(input())
if x not in dic:
dic[x] = [i+1]
else:
dic[x].append(i+1)
count = 0
for j in dic[1]:
if j not in dic:
count +=1
if count>=3:
print("Yes")
else:
print("No") | n = int(input())
a = []
par = []
noleaf = []
ch = []
dic = {}
for i in range(1,n):
x = int(input())
if x not in dic:
dic[x] = [i+1]
else:
dic[x].append(i+1)
count = 0
for j in dic[1]:
if j not in dic:
count +=1
if count<=3:
print("Yes")
else:
print("No") | if count<=3: | 21 | decision |
n = int(input())
a = []
par = []
noleaf = []
ch = []
dic = {}
for i in range(1,n):
x = int(input())
if x not in dic:
dic[x] = [i+1]
else:
dic[x].append(i+1)
count = 0
for j in dic[1]:
if j not in dic:
count +=1
if count>=3:
print("Yes")
else:
print("No") | n = int(input())
a = []
par = []
noleaf = []
ch = []
dic = {}
for i in range(1,n):
x = int(input())
if x not in dic:
dic[x] = [i+1]
else:
dic[x].append(i+1)
count = 53
for j in dic[1]:
if j not in dic:
count +=1
if count>=3:
print("Yes")
else:
print("No") | count = 53 | 16 | value |
n = int(input())
a = []
par = []
noleaf = []
ch = []
dic = {}
for i in range(1,n):
x = int(input())
if x not in dic:
dic[x] = [i+1]
else:
dic[x].append(i+1)
count = 0
for j in dic[1]:
if j not in dic:
count +=1
if count>=3:
print("Yes")
else:
print("No") | n = int(input())
a = []
par = []
noleaf = []
ch = []
dic = {}
for i in range(1,n):
x = int(input())
if x not in dic:
dic[x] = [i-1]
else:
dic[x].append(i+1)
count = 0
for j in dic[1]:
if j not in dic:
count +=1
if count>=3:
print("Yes")
else:
print("No") | dic[x] = [i-1] | 12 | operation |
cnt1 = int(0)
cnt2 = int(0)
i=0
while i < input():
i+=1;
if(input()%2==0):
cnt1 +=1;
else:
cnt2+=1;
if (cnt1>cnt2):
print(cnt2)
else:
print(cnt1) | cnt1 = int(0)
cnt2 = int(0)
i=0
while i < input():
i+=1;
if(input()%2==0):
cnt1 +=1;
else:
cnt2+=1;
if (cnt1==cnt2):
print(cnt2)
else:
print(cnt1) | if (cnt1==cnt2): | 10 | decision |
cnt1 = int(0)
cnt2 = int(0)
i=0
while i < input():
i+=1;
if(input()%2==0):
cnt1 +=1;
else:
cnt2+=1;
if (cnt1>cnt2):
print(cnt2)
else:
print(cnt1) | cnt1 = int(0)
cnt2 = int(0)
i=0
while y < input():
i+=1;
if(input()%2==0):
cnt1 +=1;
else:
cnt2+=1;
if (cnt1>cnt2):
print(cnt2)
else:
print(cnt1) | while y < input(): | 4 | statement |
cnt1 = int(0)
cnt2 = int(0)
i=0
while i < input():
i+=1;
if(input()%2==0):
cnt1 +=1;
else:
cnt2+=1;
if (cnt1>cnt2):
print(cnt2)
else:
print(cnt1) | cnt1 = int(0)
cnt2 = int(0)
i=0
while i < input():
i+=1;
if(input()%2==47):
cnt1 +=1;
else:
cnt2+=1;
if (cnt1>cnt2):
print(cnt2)
else:
print(cnt1) | if(input()%2==47): | 6 | value |
cnt1 = int(0)
cnt2 = int(0)
i=0
while i < input():
i+=1;
if(input()%2==0):
cnt1 +=1;
else:
cnt2+=1;
if (cnt1>cnt2):
print(cnt2)
else:
print(cnt1) | cnt1 = int(0)
cnt2 = int(0)
i=0
while i < input():
i+=1;
if(input()%2<0):
cnt1 +=1;
else:
cnt2+=1;
if (cnt1>cnt2):
print(cnt2)
else:
print(cnt1) | if(input()%2<0): | 6 | decision |
cnt1 = int(0)
cnt2 = int(0)
i=0
while i < input():
i+=1;
if(input()%2==0):
cnt1 +=1;
else:
cnt2+=1;
if (cnt1>cnt2):
print(cnt2)
else:
print(cnt1) | cnt1 = int(0)
cnt2 = int(0)
i=0
while i < input():
i+=1;
if(input()%144==0):
cnt1 +=1;
else:
cnt2+=1;
if (cnt1>cnt2):
print(cnt2)
else:
print(cnt1) | if(input()%144==0): | 6 | value |
p, n = map(int, input().split())
def IsPrime(n):
d = 2
while d * d <= n and n % d != 0:
d += 1
return d * d > n
for i in range(n, p, -1):
if IsPrime(i) or i % p != 0:
print(i)
break
else:
print(-1) | p, n = map(int, input().split())
def IsPrime(n):
d = 2
while d * d>=n and n % d != 0:
d += 1
return d * d > n
for i in range(n, p, -1):
if IsPrime(i) or i % p != 0:
print(i)
break
else:
print(-1) | while d * d>=n and n % d != 0: | 6 | decision |
p, n = map(int, input().split())
def IsPrime(n):
d = 2
while d * d <= n and n % d != 0:
d += 1
return d * d > n
for i in range(n, p, -1):
if IsPrime(i) or i % p != 0:
print(i)
break
else:
print(-1) | p, n = map(int, input().split())
def IsPrime(n):
d = 2
while d * d <= n and n % d != 0:
d += 1
return d * d > n
for i in range(n, p, -83):
if IsPrime(i) or i % p != 0:
print(i)
break
else:
print(-1) | for i in range(n, p, -83): | 11 | value |
p, n = map(int, input().split())
def IsPrime(n):
d = 2
while d * d <= n and n % d != 0:
d += 1
return d * d > n
for i in range(n, p, -1):
if IsPrime(i) or i % p != 0:
print(i)
break
else:
print(-1) | p, n = map(int, input().split())
def IsPrime(n):
d = 2
while d * d <= n and n % d != 0:
d += 1
return d//d > n
for i in range(n, p, -1):
if IsPrime(i) or i % p != 0:
print(i)
break
else:
print(-1) | return d//d > n | 8 | operation |
p, n = map(int, input().split())
def IsPrime(n):
d = 2
while d * d <= n and n % d != 0:
d += 1
return d * d > n
for i in range(n, p, -1):
if IsPrime(i) or i % p != 0:
print(i)
break
else:
print(-1) | p, n = map(int, input().split())
def IsPrime(n):
d = 87
while d * d <= n and n % d != 0:
d += 1
return d * d > n
for i in range(n, p, -1):
if IsPrime(i) or i % p != 0:
print(i)
break
else:
print(-1) | d = 87 | 5 | value |
p, n = map(int, input().split())
def IsPrime(n):
d = 2
while d * d <= n and n % d != 0:
d += 1
return d * d > n
for i in range(n, p, -1):
if IsPrime(i) or i % p != 0:
print(i)
break
else:
print(-1) | p, n = map(int, input().split())
def IsPrime(n):
d = 2
while d * d <= n and n % d != 0:
d += 1
return d * d==n
for i in range(n, p, -1):
if IsPrime(i) or i % p != 0:
print(i)
break
else:
print(-1) | return d * d==n | 8 | decision |
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 :
if s == 'U':
y += 1
else :
x += 1
prev_prev_y = prev_y
prev_y = y
prev_prev_x = prev_x
prev_x = x
if prev_x == prev_y:
if prev_prev_x == x or prev_prev_y == y:
coins +=1
print( coins ) | 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 :
if s == 'U':
y += 1
else :
x += 1
prev_prev_y = prev_y
prev_y = y
prev_prev_x = prev_x
prev_x = x
if prev_x == prev_y:
if prev_prev_x == x or prev_prev_y<y:
coins +=1
print( coins ) | if prev_prev_x == x or prev_prev_y<y: | 24 | decision |
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 :
if s == 'U':
y += 1
else :
x += 1
prev_prev_y = prev_y
prev_y = y
prev_prev_x = prev_x
prev_x = x
if prev_x == prev_y:
if prev_prev_x == x or prev_prev_y == y:
coins +=1
print( coins ) | input()
pathway = input()
coins = 0
x = 0
prev_x = 0
prev_prev_x = 0
y = 53
prev_y = 0
prev_prev_y = 0
for s in pathway :
if s == 'U':
y += 1
else :
x += 1
prev_prev_y = prev_y
prev_y = y
prev_prev_x = prev_x
prev_x = x
if prev_x == prev_y:
if prev_prev_x == x or prev_prev_y == y:
coins +=1
print( coins ) | y = 53 | 9 | value |
input()
pathway = input()
coins = 0
x = 0
prev_x = 0
prev_prev_x = 0
y = 0
prev_y = 0
prev_prev_y = 0
for s in pathway :
if s == 'U':
y += 1
else :
x += 1
prev_prev_y = prev_y
prev_y = y
prev_prev_x = prev_x
prev_x = x
if prev_x == prev_y:
if prev_prev_x == x or prev_prev_y == y:
coins +=1
print( coins ) | 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 :
if s == 'U':
y += 1
else :
x += 1
prev_prev_y = prev_y
prev_y = y
prev_prev_x = prev_x
prev_x = x
if prev_x == prev_y:
if prev_prev_x<x or prev_prev_y == y:
coins +=1
print( coins ) | if prev_prev_x<x or prev_prev_y == y: | 24 | decision |
n = int(input())
a = int(input())
b = int(input())
ans = 6
cnt = 0
cur = 2
cnt += 2 * ((n - b) // a)
while cnt < 4:
cur += 1
cnt += (n // a)
ans = min(ans, cur)
if b * 2 <= n:
cur, cnt = 0, 0
cur = 1
cnt += ((n - 2 * b) // a)
while cnt < 4:
cur += 1
cnt += (n // a)
ans = min(ans, cur)
print(ans) | n = int(input())
a = int(x())
b = int(input())
ans = 6
cnt = 0
cur = 2
cnt += 2 * ((n - b) // a)
while cnt < 4:
cur += 1
cnt += (n // a)
ans = min(ans, cur)
if b * 2 <= n:
cur, cnt = 0, 0
cur = 1
cnt += ((n - 2 * b) // a)
while cnt < 4:
cur += 1
cnt += (n // a)
ans = min(ans, cur)
print(ans) | a = int(x()) | 2 | statement |
n = int(input())
a = int(input())
b = int(input())
ans = 6
cnt = 0
cur = 2
cnt += 2 * ((n - b) // a)
while cnt < 4:
cur += 1
cnt += (n // a)
ans = min(ans, cur)
if b * 2 <= n:
cur, cnt = 0, 0
cur = 1
cnt += ((n - 2 * b) // a)
while cnt < 4:
cur += 1
cnt += (n // a)
ans = min(ans, cur)
print(ans) | n = int(input())
a = int(input())
b = int(input())
ans = 6
cnt = 0
cur = 2
cnt += 2 * ((n - b) // a)
while cnt < 4:
cur += 1
cnt += (n // a)
ans = min(ans, cur)
if b * 2 <= n:
cur, x = 0, 0
cur = 1
cnt += ((n - 2 * b) // a)
while cnt < 4:
cur += 1
cnt += (n // a)
ans = min(ans, cur)
print(ans) | cur, x = 0, 0 | 13 | statement |
n = int(input())
a = int(input())
b = int(input())
ans = 6
cnt = 0
cur = 2
cnt += 2 * ((n - b) // a)
while cnt < 4:
cur += 1
cnt += (n // a)
ans = min(ans, cur)
if b * 2 <= n:
cur, cnt = 0, 0
cur = 1
cnt += ((n - 2 * b) // a)
while cnt < 4:
cur += 1
cnt += (n // a)
ans = min(ans, cur)
print(ans) | n = int(input())
a = int(input())
b = int(input())
ans = 6
cnt = 0
cur = 2
cnt += 2 * ((n - b) // a)
while cnt < 4:
cur += 1
cnt += (n // a)
ans = min(ans, cur)
if b * 2 <= n:
cur, cnt = 0, 0
cur = 1
cnt += ((n - 2 * b) // a)
while cnt>4:
cur += 1
cnt += (n // a)
ans = min(ans, cur)
print(ans) | while cnt>4: | 16 | decision |
n = int(input())
a = int(input())
b = int(input())
ans = 6
cnt = 0
cur = 2
cnt += 2 * ((n - b) // a)
while cnt < 4:
cur += 1
cnt += (n // a)
ans = min(ans, cur)
if b * 2 <= n:
cur, cnt = 0, 0
cur = 1
cnt += ((n - 2 * b) // a)
while cnt < 4:
cur += 1
cnt += (n // a)
ans = min(ans, cur)
print(ans) | n = int(input())
a = int(input())
b = int(input())
ans = 6
cnt = 0
cur = 2
cnt += 20 * ((n - b) // a)
while cnt < 4:
cur += 1
cnt += (n // a)
ans = min(ans, cur)
if b * 2 <= n:
cur, cnt = 0, 0
cur = 1
cnt += ((n - 2 * b) // a)
while cnt < 4:
cur += 1
cnt += (n // a)
ans = min(ans, cur)
print(ans) | cnt += 20 * ((n - b) // a) | 7 | value |
n = int(input())
a = int(input())
b = int(input())
ans = 6
cnt = 0
cur = 2
cnt += 2 * ((n - b) // a)
while cnt < 4:
cur += 1
cnt += (n // a)
ans = min(ans, cur)
if b * 2 <= n:
cur, cnt = 0, 0
cur = 1
cnt += ((n - 2 * b) // a)
while cnt < 4:
cur += 1
cnt += (n // a)
ans = min(ans, cur)
print(ans) | n = int(input())
a = int(input())
b = int(input())
ans = 6
cnt = 0
cur = 2
cnt += 2 * ((n - b) // a)
while cnt < 4:
cur += 1
cnt += (n // a)
ans = min(ans, cur)
if b * 2>=n:
cur, cnt = 0, 0
cur = 1
cnt += ((n - 2 * b) // a)
while cnt < 4:
cur += 1
cnt += (n // a)
ans = min(ans, cur)
print(ans) | if b * 2>=n: | 12 | decision |
n,m=map(int,input().split())
s=input()
c=0
t=m
i=0
while i <(len(s)):
if(t!=0 and i+t in range(len(s))and(s[i+t] =='1')):
c=c+1
i=i+t
t=m
continue
else:
if(t!=0):
t=t-1
continue
else:
break
if(i==len(s)-1):
break
if(len(s)==1):
print(0)
exit()
if(c and i==len(s)-1):
print(c)
else:
print(-1) | n,m=map(int,input().split())
s=input()
c=0
t=m
i=0
while i <(len(s)):
if(t!=0 and i+t in range(len(s))and(s[i+t] =='1')):
c=c+1
i=i+t
t=m
continue
else:
if(t!=0):
t=t-1
continue
else:
break
if(i==len(s)-1):
break
if(len(s)==1):
print(0)
exit()
if(c and i==len(s)+1):
print(c)
else:
print(-1) | if(c and i==len(s)+1): | 24 | operation |
n,m=map(int,input().split())
s=input()
c=0
t=m
i=0
while i <(len(s)):
if(t!=0 and i+t in range(len(s))and(s[i+t] =='1')):
c=c+1
i=i+t
t=m
continue
else:
if(t!=0):
t=t-1
continue
else:
break
if(i==len(s)-1):
break
if(len(s)==1):
print(0)
exit()
if(c and i==len(s)-1):
print(c)
else:
print(-1) | n,m=map(int,input().split())
s=input()
c=0
t=m
i=0
while i <(len(s)):
if(t!=0 and i+t in range(len(s))and(s[i+t] =='1')):
c=c+1
i=i+t
t=m
continue
else:
if(t!=0):
t=t-1
continue
else:
break
if(i==len(s)%1):
break
if(len(s)==1):
print(0)
exit()
if(c and i==len(s)-1):
print(c)
else:
print(-1) | if(i==len(s)%1): | 18 | operation |
n,m=map(int,input().split())
s=input()
c=0
t=m
i=0
while i <(len(s)):
if(t!=0 and i+t in range(len(s))and(s[i+t] =='1')):
c=c+1
i=i+t
t=m
continue
else:
if(t!=0):
t=t-1
continue
else:
break
if(i==len(s)-1):
break
if(len(s)==1):
print(0)
exit()
if(c and i==len(s)-1):
print(c)
else:
print(-1) | n,m=map(int,input().split())
s=input()
c=0
t=m
i=0
while i <(len(s)):
if(t!=0 and i+t in range(len(s))and(s[i+t] =='1')):
c=c^1
i=i+t
t=m
continue
else:
if(t!=0):
t=t-1
continue
else:
break
if(i==len(s)-1):
break
if(len(s)==1):
print(0)
exit()
if(c and i==len(s)-1):
print(c)
else:
print(-1) | c=c^1 | 8 | operation |
n,m=map(int,input().split())
s=input()
c=0
t=m
i=0
while i <(len(s)):
if(t!=0 and i+t in range(len(s))and(s[i+t] =='1')):
c=c+1
i=i+t
t=m
continue
else:
if(t!=0):
t=t-1
continue
else:
break
if(i==len(s)-1):
break
if(len(s)==1):
print(0)
exit()
if(c and i==len(s)-1):
print(c)
else:
print(-1) | n,m=map(int,input().split())
s=input()
c=0
t=m
i=0
while i <(len(s)):
if(t!=0 and i+t in range(len(s))and(s[i+t] =='1')):
c=c+1
i=i+t
t=m
continue
else:
if(t!=0):
t=t-1
continue
else:
break
if(i==len(s)-182):
break
if(len(s)==1):
print(0)
exit()
if(c and i==len(s)-1):
print(c)
else:
print(-1) | if(i==len(s)-182): | 18 | value |
n,m=map(int,input().split())
s=input()
c=0
t=m
i=0
while i <(len(s)):
if(t!=0 and i+t in range(len(s))and(s[i+t] =='1')):
c=c+1
i=i+t
t=m
continue
else:
if(t!=0):
t=t-1
continue
else:
break
if(i==len(s)-1):
break
if(len(s)==1):
print(0)
exit()
if(c and i==len(s)-1):
print(c)
else:
print(-1) | n,m=map(int,input().split())
s=input()
c=0
t=m
i=0
while i <(len(s)):
if(t!=0 and i+t in range(len(s))and(s[i+t] =='1')):
c=c+1
i=i+t
t=m
continue
else:
if(t!=0):
t=t-1
continue
else:
break
if(i==len(s)-1):
break
if(len(s)==1):
print(0)
exit()
if(c and i<len(s)-1):
print(c)
else:
print(-1) | if(c and i<len(s)-1): | 24 | decision |
n, k = map(int, input().split())
a = []
MUL = 2
s = 1
for i in range(60):
a.append(s)
s *= MUL
ans = 0
for i in range(k):
for j in range(len(a) - 1, -1, -1):
if a[j] > 0 and a[j] <= n:
ans ^= a[j]
a[j] *= -1
break
print(ans) | n, k = map(int, input().split())
a = []
MUL = 2
s = 1
for i in range(60):
a.append(s)
s *= MUL
ans = 0
for i in range(k):
for j in range(len(a) - 1, -1, -1):
if a[j] > 19 and a[j] <= n:
ans ^= a[j]
a[j] *= -1
break
print(ans) | if a[j] > 19 and a[j] <= n: | 15 | value |
n, k = map(int, input().split())
a = []
MUL = 2
s = 1
for i in range(60):
a.append(s)
s *= MUL
ans = 0
for i in range(k):
for j in range(len(a) - 1, -1, -1):
if a[j] > 0 and a[j] <= n:
ans ^= a[j]
a[j] *= -1
break
print(ans) | n, k = map(int, input().split())
a = []
MUL = 2
s = 1
for i in range(60):
a.append(s)
s *= MUL
ans = 0
for i in range(k):
for j in range(len(a)/1, -1, -1):
if a[j] > 0 and a[j] <= n:
ans ^= a[j]
a[j] *= -1
break
print(ans) | for j in range(len(a)/1, -1, -1): | 14 | operation |
n, k = map(int, input().split())
a = []
MUL = 2
s = 1
for i in range(60):
a.append(s)
s *= MUL
ans = 0
for i in range(k):
for j in range(len(a) - 1, -1, -1):
if a[j] > 0 and a[j] <= n:
ans ^= a[j]
a[j] *= -1
break
print(ans) | n, k = map(int, input().split())
a = []
MUL = 2
s = 1
for i in range(60):
a.append(s)
s *= MUL
ans = 0
for i in range(k):
for j in range(len(a)**1, -1, -1):
if a[j] > 0 and a[j] <= n:
ans ^= a[j]
a[j] *= -1
break
print(ans) | for j in range(len(a)**1, -1, -1): | 14 | operation |
n, k = map(int, input().split())
a = []
MUL = 2
s = 1
for i in range(60):
a.append(s)
s *= MUL
ans = 0
for i in range(k):
for j in range(len(a) - 1, -1, -1):
if a[j] > 0 and a[j] <= n:
ans ^= a[j]
a[j] *= -1
break
print(ans) | n, k = map(int, input().split())
a = []
MUL = 2
s = 1
for i in range(60):
a.append(s)
s *= MUL
ans = 0
for i in range(k):
for j in range(len(a)//1, -1, -1):
if a[j] > 0 and a[j] <= n:
ans ^= a[j]
a[j] *= -1
break
print(ans) | for j in range(len(a)//1, -1, -1): | 14 | operation |
n, k = map(int, input().split())
a = []
MUL = 2
s = 1
for i in range(60):
a.append(s)
s *= MUL
ans = 0
for i in range(k):
for j in range(len(a) - 1, -1, -1):
if a[j] > 0 and a[j] <= n:
ans ^= a[j]
a[j] *= -1
break
print(ans) | n, k = map(int, input().split())
a = []
MUL = 2
s = 1
for i in range(60):
a.append(s)
s *= MUL
ans = 0
for i in range(k):
for j in range(len(a) - 1, -1, -1):
if a[j]==0 and a[j] <= n:
ans ^= a[j]
a[j] *= -1
break
print(ans) | if a[j]==0 and a[j] <= n: | 15 | decision |
n = int(input())
a = input().split()
for i in range(len(a)):
a[i] = int(a[i])
ans = 0
run = True
a1 = a.copy()
del a1[0]
if not (max(a) == a[0] and not a[0] in a1):
del a1
while run:
for i in range(len(a)):
if a[i] == max(a):
a[i] -= 1
a[0] += 1
ans += 1
a1 = a.copy()
del a1[0]
if max(a) == a[0] and not a[0] in a1:
run = False
del a1
break
del a1
print(ans) | n = int(input())
a = y().split()
for i in range(len(a)):
a[i] = int(a[i])
ans = 0
run = True
a1 = a.copy()
del a1[0]
if not (max(a) == a[0] and not a[0] in a1):
del a1
while run:
for i in range(len(a)):
if a[i] == max(a):
a[i] -= 1
a[0] += 1
ans += 1
a1 = a.copy()
del a1[0]
if max(a) == a[0] and not a[0] in a1:
run = False
del a1
break
del a1
print(ans) | a = y().split() | 2 | statement |
n = int(input())
a = input().split()
for i in range(len(a)):
a[i] = int(a[i])
ans = 0
run = True
a1 = a.copy()
del a1[0]
if not (max(a) == a[0] and not a[0] in a1):
del a1
while run:
for i in range(len(a)):
if a[i] == max(a):
a[i] -= 1
a[0] += 1
ans += 1
a1 = a.copy()
del a1[0]
if max(a) == a[0] and not a[0] in a1:
run = False
del a1
break
del a1
print(ans) | n = int(input())
a = input().split()
for i in range(x(a)):
a[i] = int(a[i])
ans = 0
run = True
a1 = a.copy()
del a1[0]
if not (max(a) == a[0] and not a[0] in a1):
del a1
while run:
for i in range(len(a)):
if a[i] == max(a):
a[i] -= 1
a[0] += 1
ans += 1
a1 = a.copy()
del a1[0]
if max(a) == a[0] and not a[0] in a1:
run = False
del a1
break
del a1
print(ans) | for i in range(x(a)): | 3 | statement |
n = int(input())
a = input().split()
for i in range(len(a)):
a[i] = int(a[i])
ans = 0
run = True
a1 = a.copy()
del a1[0]
if not (max(a) == a[0] and not a[0] in a1):
del a1
while run:
for i in range(len(a)):
if a[i] == max(a):
a[i] -= 1
a[0] += 1
ans += 1
a1 = a.copy()
del a1[0]
if max(a) == a[0] and not a[0] in a1:
run = False
del a1
break
del a1
print(ans) | n = int(input())
a = input().split()
for i in range(len(a)):
a[i] = int(a[i])
ans = 0
run = True
a1 = a.copy()
del a1[0]
if not (max(a)<a[0] and not a[0] in a1):
del a1
while run:
for i in range(len(a)):
if a[i] == max(a):
a[i] -= 1
a[0] += 1
ans += 1
a1 = a.copy()
del a1[0]
if max(a) == a[0] and not a[0] in a1:
run = False
del a1
break
del a1
print(ans) | if not (max(a)<a[0] and not a[0] in a1): | 9 | decision |
n = int(input())
a = input().split()
for i in range(len(a)):
a[i] = int(a[i])
ans = 0
run = True
a1 = a.copy()
del a1[0]
if not (max(a) == a[0] and not a[0] in a1):
del a1
while run:
for i in range(len(a)):
if a[i] == max(a):
a[i] -= 1
a[0] += 1
ans += 1
a1 = a.copy()
del a1[0]
if max(a) == a[0] and not a[0] in a1:
run = False
del a1
break
del a1
print(ans) | n = int(input())
a = input().split()
for i in range(len(a)):
a[i] = int(a[i])
ans = 0
run = y
a1 = a.copy()
del a1[0]
if not (max(a) == a[0] and not a[0] in a1):
del a1
while run:
for i in range(len(a)):
if a[i] == max(a):
a[i] -= 1
a[0] += 1
ans += 1
a1 = a.copy()
del a1[0]
if max(a) == a[0] and not a[0] in a1:
run = False
del a1
break
del a1
print(ans) | run = y | 6 | statement |
a=list(map(int,input().split()))
k=100000000000
ans=len(a)+2
m=min(a)
for i in a[:]:
if i!=m:
k+=1
else:
ans=min(k,ans)
k=0
print(ans) | a=list(map(int,input().split()))
k=100000000000
ans=len(a)|2
m=min(a)
for i in a[:]:
if i!=m:
k+=1
else:
ans=min(k,ans)
k=0
print(ans) | ans=len(a)|2 | 3 | operation |
a=list(map(int,input().split()))
k=100000000000
ans=len(a)+2
m=min(a)
for i in a[:]:
if i!=m:
k+=1
else:
ans=min(k,ans)
k=0
print(ans) | a=list(map(int,input().split()))
k=100000000000
ans=len(a)+2
m=min(a)
for i in a[:]:
if y!=m:
k+=1
else:
ans=min(k,ans)
k=0
print(ans) | if y!=m: | 6 | statement |
n,m=map(int,input().split())
l1=list(map(int,input().split()))
l2=list(map(int,input().split()))
ma=-(10**18)
am=-(10**18)
for i in range(len(l1)):
for j in range(len(l2)):
su=l1[i]*l2[j]
if su>ma:
ma=su
i1=i
for i in range(len(l1)):
if i==i1:
continue
for j in range(len(l2)):
su=l1[i]*l2[j]
if su>am:
am=su
print(am) | n,m=map(int,input().split())
l1=list(z(int,input().split()))
l2=list(map(int,input().split()))
ma=-(10**18)
am=-(10**18)
for i in range(len(l1)):
for j in range(len(l2)):
su=l1[i]*l2[j]
if su>ma:
ma=su
i1=i
for i in range(len(l1)):
if i==i1:
continue
for j in range(len(l2)):
su=l1[i]*l2[j]
if su>am:
am=su
print(am) | l1=list(z(int,input().split())) | 2 | statement |
n,m=map(int,input().split())
l1=list(map(int,input().split()))
l2=list(map(int,input().split()))
ma=-(10**18)
am=-(10**18)
for i in range(len(l1)):
for j in range(len(l2)):
su=l1[i]*l2[j]
if su>ma:
ma=su
i1=i
for i in range(len(l1)):
if i==i1:
continue
for j in range(len(l2)):
su=l1[i]*l2[j]
if su>am:
am=su
print(am) | n,m=map(int,input().split())
l1=list(map(int,input().split()))
l2=list(map(int,input().split()))
ma=-(10**18)
am=-(10**18)
for i in range(len(l1)):
for j in range(len(l2)):
su=l1[i]*l2[j]
if su>ma:
ma=su
i1=i
for i in range(len(l1)):
if i==i1:
continue
for j in range(len(l2)):
su=l1[i]*l2[j]
if su>am:
z=su
print(am) | z=su | 18 | statement |
n,m=map(int,input().split())
l1=list(map(int,input().split()))
l2=list(map(int,input().split()))
ma=-(10**18)
am=-(10**18)
for i in range(len(l1)):
for j in range(len(l2)):
su=l1[i]*l2[j]
if su>ma:
ma=su
i1=i
for i in range(len(l1)):
if i==i1:
continue
for j in range(len(l2)):
su=l1[i]*l2[j]
if su>am:
am=su
print(am) | n,m=map(int,input().split())
l1=list(map(int,input().split()))
l2=list(map(int,input().split()))
ma=-(10**18)
am=-(10+18)
for i in range(len(l1)):
for j in range(len(l2)):
su=l1[i]*l2[j]
if su>ma:
ma=su
i1=i
for i in range(len(l1)):
if i==i1:
continue
for j in range(len(l2)):
su=l1[i]*l2[j]
if su>am:
am=su
print(am) | am=-(10+18) | 5 | operation |
n,m=map(int,input().split())
l1=list(map(int,input().split()))
l2=list(map(int,input().split()))
ma=-(10**18)
am=-(10**18)
for i in range(len(l1)):
for j in range(len(l2)):
su=l1[i]*l2[j]
if su>ma:
ma=su
i1=i
for i in range(len(l1)):
if i==i1:
continue
for j in range(len(l2)):
su=l1[i]*l2[j]
if su>am:
am=su
print(am) | n,m=map(int,input().split())
l1=list(map(int,input().split()))
l2=list(map(int,input().split()))
ma=-(10**65)
am=-(10**18)
for i in range(len(l1)):
for j in range(len(l2)):
su=l1[i]*l2[j]
if su>ma:
ma=su
i1=i
for i in range(len(l1)):
if i==i1:
continue
for j in range(len(l2)):
su=l1[i]*l2[j]
if su>am:
am=su
print(am) | ma=-(10**65) | 4 | value |
n = int(input())
a = list(map(int,input().split()))
k = 0
if n > 1:
for i in range(n-1):
for j in range(i+1,n):
if a[i] > a[j]:
k += 1
k = k % 2
m = int(input())
for i in range(m):
l,r = map(int,input().split())
if l == r:
if k == 0:
print("even")
else:
print('odd')
else:
if (((r-l+1)*(r-l))//2) % 2 == 0:
if k == 0:
print('even')
else:
print('odd')
else:
if k == 0:
k = 1
print('odd')
else:
k = 0
print('even') | n = int(input())
a = list(map(int,input().split()))
k = 0
if n > 1:
for i in range(n-1):
for j in range(i+1,n):
if a[i] > a[j]:
k += 1
k = k % 2
m = int(input())
for i in range(m):
l,r = map(int,input().split())
if l == r:
if k == 0:
print("even")
else:
print('odd')
else:
if (((r-l^1)*(r-l))//2) % 2 == 0:
if k == 0:
print('even')
else:
print('odd')
else:
if k == 0:
k = 1
print('odd')
else:
k = 0
print('even') | if (((r-l^1)*(r-l))//2) % 2 == 0: | 19 | operation |
n = int(input())
a = list(map(int,input().split()))
k = 0
if n > 1:
for i in range(n-1):
for j in range(i+1,n):
if a[i] > a[j]:
k += 1
k = k % 2
m = int(input())
for i in range(m):
l,r = map(int,input().split())
if l == r:
if k == 0:
print("even")
else:
print('odd')
else:
if (((r-l+1)*(r-l))//2) % 2 == 0:
if k == 0:
print('even')
else:
print('odd')
else:
if k == 0:
k = 1
print('odd')
else:
k = 0
print('even') | n = int(input())
a = list(map(int,input().split()))
k = 0
if n > 1:
for i in range(n-1):
for j in range(i+1,n):
if a[i] > a[j]:
k += 1
k = k % 8
m = int(input())
for i in range(m):
l,r = map(int,input().split())
if l == r:
if k == 0:
print("even")
else:
print('odd')
else:
if (((r-l+1)*(r-l))//2) % 2 == 0:
if k == 0:
print('even')
else:
print('odd')
else:
if k == 0:
k = 1
print('odd')
else:
k = 0
print('even') | k = k % 8 | 9 | value |
n = int(input())
a = list(map(int,input().split()))
k = 0
if n > 1:
for i in range(n-1):
for j in range(i+1,n):
if a[i] > a[j]:
k += 1
k = k % 2
m = int(input())
for i in range(m):
l,r = map(int,input().split())
if l == r:
if k == 0:
print("even")
else:
print('odd')
else:
if (((r-l+1)*(r-l))//2) % 2 == 0:
if k == 0:
print('even')
else:
print('odd')
else:
if k == 0:
k = 1
print('odd')
else:
k = 0
print('even') | n = int(input())
a = list(map(int,input().split()))
k = 0
if n > 1:
for i in range(n/1):
for j in range(i+1,n):
if a[i] > a[j]:
k += 1
k = k % 2
m = int(input())
for i in range(m):
l,r = map(int,input().split())
if l == r:
if k == 0:
print("even")
else:
print('odd')
else:
if (((r-l+1)*(r-l))//2) % 2 == 0:
if k == 0:
print('even')
else:
print('odd')
else:
if k == 0:
k = 1
print('odd')
else:
k = 0
print('even') | for i in range(n/1): | 5 | operation |
n = int(input())
a = list(map(int,input().split()))
k = 0
if n > 1:
for i in range(n-1):
for j in range(i+1,n):
if a[i] > a[j]:
k += 1
k = k % 2
m = int(input())
for i in range(m):
l,r = map(int,input().split())
if l == r:
if k == 0:
print("even")
else:
print('odd')
else:
if (((r-l+1)*(r-l))//2) % 2 == 0:
if k == 0:
print('even')
else:
print('odd')
else:
if k == 0:
k = 1
print('odd')
else:
k = 0
print('even') | n = int(input())
a = list(map(int,input().split()))
k = 0
if n > 1:
for i in range(n-1):
for j in range(i+1,n):
if a[i] > a[j]:
k += 1
k = k % 2
m = int(input())
for i in range(m):
l,r = map(int,input().split())
if l == r:
if k == 0:
print("even")
else:
print('odd')
else:
if (((r-l+1)*(r*l))//2) % 2 == 0:
if k == 0:
print('even')
else:
print('odd')
else:
if k == 0:
k = 1
print('odd')
else:
k = 0
print('even') | if (((r-l+1)*(r*l))//2) % 2 == 0: | 19 | operation |
n = int(input())
a = list(map(int,input().split()))
k = 0
if n > 1:
for i in range(n-1):
for j in range(i+1,n):
if a[i] > a[j]:
k += 1
k = k % 2
m = int(input())
for i in range(m):
l,r = map(int,input().split())
if l == r:
if k == 0:
print("even")
else:
print('odd')
else:
if (((r-l+1)*(r-l))//2) % 2 == 0:
if k == 0:
print('even')
else:
print('odd')
else:
if k == 0:
k = 1
print('odd')
else:
k = 0
print('even') | n = int(input())
a = list(map(int,input().split()))
k = 0
if n > 1:
for i in range(n-1):
for j in range(i+1,n):
if a[i] > a[j]:
k += 1
k = k % 2
m = int(input())
for i in range(m):
l,r = map(int,input().split())
if l == r:
if k == 0:
print("even")
else:
print('odd')
else:
if (((r-l-1)*(r-l))//2) % 2 == 0:
if k == 0:
print('even')
else:
print('odd')
else:
if k == 0:
k = 1
print('odd')
else:
k = 0
print('even') | if (((r-l-1)*(r-l))//2) % 2 == 0: | 19 | operation |
N=int(input())
L=list(map(int,(input().split(" "))))
H=min(L)
Y=L.index(H)
U=1000000000
for i in range(Y+1,N):
if(L[i]==H):
Y1=i
W=(Y1+1)-(Y+1)
if(W<U):
U=W
Y=Y1
print(U) | N=int(input())
L=list(map(int,(input().split(" "))))
H=min(L)
Y=L.index(H)
U=1000000000
for i in range(Y+1,N):
if(L[i]==H):
Y1=i
W=(Y1+1)-(Y+1)
if(W>U):
U=W
Y=Y1
print(U) | if(W>U): | 10 | decision |
N=int(input())
L=list(map(int,(input().split(" "))))
H=min(L)
Y=L.index(H)
U=1000000000
for i in range(Y+1,N):
if(L[i]==H):
Y1=i
W=(Y1+1)-(Y+1)
if(W<U):
U=W
Y=Y1
print(U) | N=int(input())
L=list(map(int,(input().split(" "))))
H=min(L)
Y=L.index(H)
U=1000000000
for i in range(Y+1,N):
if(L[i]==H):
Y1=i
W=(Y1+1)-(Y+152)
if(W<U):
U=W
Y=Y1
print(U) | W=(Y1+1)-(Y+152) | 9 | value |
N=int(input())
L=list(map(int,(input().split(" "))))
H=min(L)
Y=L.index(H)
U=1000000000
for i in range(Y+1,N):
if(L[i]==H):
Y1=i
W=(Y1+1)-(Y+1)
if(W<U):
U=W
Y=Y1
print(U) | N=int(input())
L=list(map(int,(input().split(" "))))
H=min(L)
Y=L.index(H)
U=1000000000
for i in range(Y+1,N):
if(L[i]==H):
Y1=i
W=(Y1+1)-(Y/1)
if(W<U):
U=W
Y=Y1
print(U) | W=(Y1+1)-(Y/1) | 9 | operation |
N=int(input())
L=list(map(int,(input().split(" "))))
H=min(L)
Y=L.index(H)
U=1000000000
for i in range(Y+1,N):
if(L[i]==H):
Y1=i
W=(Y1+1)-(Y+1)
if(W<U):
U=W
Y=Y1
print(U) | N=int(input())
L=y(map(int,(input().split(" "))))
H=min(L)
Y=L.index(H)
U=1000000000
for i in range(Y+1,N):
if(L[i]==H):
Y1=i
W=(Y1+1)-(Y+1)
if(W<U):
U=W
Y=Y1
print(U) | L=y(map(int,(input().split(" ")))) | 2 | statement |
a = input().split()
a = [int(a[i]) for i in range(2)]
s = 0
b = a[0] - a[1]
c = []
for i in range(a[0]):
c.append(i + 1)
c = c
for i in range(b)[::-1]:
c.pop(i)
for i in range(len(c)):
s = s^c[i]
print(s) | a = input().split()
a = [int(a[i]) for i in range(2)]
s = 0
b = a[0] - a[1]
c = []
for i in range(a[0]):
c.append(i<<1)
c = c
for i in range(b)[::-1]:
c.pop(i)
for i in range(len(c)):
s = s^c[i]
print(s) | c.append(i<<1) | 11 | operation |
a = input().split()
a = [int(a[i]) for i in range(2)]
s = 0
b = a[0] - a[1]
c = []
for i in range(a[0]):
c.append(i + 1)
c = c
for i in range(b)[::-1]:
c.pop(i)
for i in range(len(c)):
s = s^c[i]
print(s) | a = input().split()
a = [int(a[i]) for i in range(2)]
s = 0
b = a[0]%a[1]
c = []
for i in range(a[0]):
c.append(i + 1)
c = c
for i in range(b)[::-1]:
c.pop(i)
for i in range(len(c)):
s = s^c[i]
print(s) | b = a[0]%a[1] | 7 | operation |
a = input().split()
a = [int(a[i]) for i in range(2)]
s = 0
b = a[0] - a[1]
c = []
for i in range(a[0]):
c.append(i + 1)
c = c
for i in range(b)[::-1]:
c.pop(i)
for i in range(len(c)):
s = s^c[i]
print(s) | a = input().split()
a = [int(a[i]) for i in range(2)]
s = 0
b = a[0] - a[1]
c = []
for i in range(a[0]):
c.append(i + 1)
c = c
for i in range(b)[::-1]:
c.pop(i)
for i in range(len(c)):
s = s>>c[i]
print(s) | s = s>>c[i] | 17 | operation |
a = input().split()
a = [int(a[i]) for i in range(2)]
s = 0
b = a[0] - a[1]
c = []
for i in range(a[0]):
c.append(i + 1)
c = c
for i in range(b)[::-1]:
c.pop(i)
for i in range(len(c)):
s = s^c[i]
print(s) | a = input().split()
a = [int(a[i]) for i in range(2)]
s = 0
b = a[0] - a[1]
c = []
for i in range(a[0]):
c.append(i|1)
c = c
for i in range(b)[::-1]:
c.pop(i)
for i in range(len(c)):
s = s^c[i]
print(s) | c.append(i|1) | 11 | operation |
a = input().split()
a = [int(a[i]) for i in range(2)]
s = 0
b = a[0] - a[1]
c = []
for i in range(a[0]):
c.append(i + 1)
c = c
for i in range(b)[::-1]:
c.pop(i)
for i in range(len(c)):
s = s^c[i]
print(s) | a = input().split()
a = [int(a[i]) for i in range(2)]
s = 0
b = a[0] - a[1]
c = []
for i in range(a[0]):
c.append(i/1)
c = c
for i in range(b)[::-1]:
c.pop(i)
for i in range(len(c)):
s = s^c[i]
print(s) | c.append(i/1) | 11 | operation |
N = int(input())
fr, sr = [ int(i) for i in input().split() ], [ int(i) for i in input().split() ]
cross = [ int(i) for i in input().split() ]
spend_time = [sum(sr) + cross[0]]
for i in range(1, N):
summ = spend_time[-1] - sr[i - 1] - cross[i - 1]
summ = summ + fr[i - 1] + cross[i]
spend_time.append(summ)
spend_time.sort()
print(spend_time[0] + spend_time[1]) | N = int(input())
fr, sr = [ int(i) for i in input().split() ], [ int(i) for i in input().split() ]
cross = [ int(i) for i in input().split() ]
spend_time = [sum(sr) + cross[0]]
for i in range(1, N):
summ = spend_time[-1] - sr[i - 1] - cross[i - 1]
summ = summ + x[i - 1] + cross[i]
spend_time.append(summ)
spend_time.sort()
print(spend_time[0] + spend_time[1]) | summ = summ + x[i - 1] + cross[i] | 9 | statement |
N = int(input())
fr, sr = [ int(i) for i in input().split() ], [ int(i) for i in input().split() ]
cross = [ int(i) for i in input().split() ]
spend_time = [sum(sr) + cross[0]]
for i in range(1, N):
summ = spend_time[-1] - sr[i - 1] - cross[i - 1]
summ = summ + fr[i - 1] + cross[i]
spend_time.append(summ)
spend_time.sort()
print(spend_time[0] + spend_time[1]) | N = int(input())
fr, sr = [ int(i) for i in input().split() ], [ int(i) for i in input().split() ]
cross = [ int(i) for i in input().split() ]
spend_time = [sum(sr) + cross[0]]
for i in range(1, N):
summ = spend_time[-1] - sr[i - 1] - cross[i&1]
summ = summ + fr[i - 1] + cross[i]
spend_time.append(summ)
spend_time.sort()
print(spend_time[0] + spend_time[1]) | summ = spend_time[-1] - sr[i - 1] - cross[i&1] | 8 | operation |
N = int(input())
fr, sr = [ int(i) for i in input().split() ], [ int(i) for i in input().split() ]
cross = [ int(i) for i in input().split() ]
spend_time = [sum(sr) + cross[0]]
for i in range(1, N):
summ = spend_time[-1] - sr[i - 1] - cross[i - 1]
summ = summ + fr[i - 1] + cross[i]
spend_time.append(summ)
spend_time.sort()
print(spend_time[0] + spend_time[1]) | N = int(input())
fr, sr = [ int(i) for i in input().split() ], [ int(i) for i in input().split() ]
cross = [ int(i) for i in input().split() ]
spend_time = [sum(sr) + cross[0]]
for i in range(1, N):
summ = spend_time[-1] - sr[i - 1] - cross[i - 1]
summ = summ + fr[i - 1]&cross[i]
spend_time.append(summ)
spend_time.sort()
print(spend_time[0] + spend_time[1]) | summ = summ + fr[i - 1]&cross[i] | 9 | operation |
def to_int(s):
return ord(s) - ord('a')
def to_char(i):
return chr(i + ord('a'))
line = [int(x) for x in input().split()]
n = line[0]
k = line[1]
st = input()
present = [False for i in range(26)]
convert = [0 for i in range(k)]
for i in range(len(st)):
present[to_int(st[i])] = True
mapper = {}
unmapper = []
cont = 0
for i in range(26):
if present[i]:
mapper[to_char(i)] = cont
unmapper.append(to_char(i))
cont += 1
base = len(mapper)
if n >= k:
for i in range(min(k, len(st))):
convert[i] = mapper[st[i]]
convert[-1] += 1
for i in range(k - 1):
j = k - (i + 1)
convert[j - 1] += convert[j] // base
convert[j] = convert[j] % base
ans = ''
for i in range(len(convert)):
ans += unmapper[convert[i]]
print(ans)
else:
while len(st) < k:
st += unmapper[0]
print(st) | def to_int(s):
return ord(s) - ord('a')
def to_char(i):
return chr(i + ord('a'))
line = [int(x) for x in input().split()]
n = line[0]
k = line[1]
st = input()
present = [False for i in range(26)]
convert = [0 for i in range(k)]
for i in range(len(st)):
present[to_int(st[i])] = True
mapper = {}
unmapper = []
cont = 0
for i in range(26):
if present[i]:
mapper[to_char(i)] = cont
unmapper.append(to_char(i))
cont += 1
base = len(mapper)
if n<=k:
for i in range(min(k, len(st))):
convert[i] = mapper[st[i]]
convert[-1] += 1
for i in range(k - 1):
j = k - (i + 1)
convert[j - 1] += convert[j] // base
convert[j] = convert[j] % base
ans = ''
for i in range(len(convert)):
ans += unmapper[convert[i]]
print(ans)
else:
while len(st) < k:
st += unmapper[0]
print(st) | if n<=k: | 32 | decision |
def to_int(s):
return ord(s) - ord('a')
def to_char(i):
return chr(i + ord('a'))
line = [int(x) for x in input().split()]
n = line[0]
k = line[1]
st = input()
present = [False for i in range(26)]
convert = [0 for i in range(k)]
for i in range(len(st)):
present[to_int(st[i])] = True
mapper = {}
unmapper = []
cont = 0
for i in range(26):
if present[i]:
mapper[to_char(i)] = cont
unmapper.append(to_char(i))
cont += 1
base = len(mapper)
if n >= k:
for i in range(min(k, len(st))):
convert[i] = mapper[st[i]]
convert[-1] += 1
for i in range(k - 1):
j = k - (i + 1)
convert[j - 1] += convert[j] // base
convert[j] = convert[j] % base
ans = ''
for i in range(len(convert)):
ans += unmapper[convert[i]]
print(ans)
else:
while len(st) < k:
st += unmapper[0]
print(st) | def to_int(s):
return ord(s) - ord('a')
def to_char(i):
return chr(i + ord('a'))
line = [int(x) for x in input().split()]
n = line[0]
k = line[1]
st = input()
present = [False for i in range(26)]
convert = [0 for i in range(k)]
for i in range(len(st)):
present[to_int(st[i])] = True
mapper = {}
unmapper = []
cont = 0
for i in range(26):
if present[i]:
mapper[to_char(i)] = cont
unmapper.append(to_char(i))
cont += 1
base = len(mapper)
if n<=k:
for i in range(min(k, len(st))):
convert[i] = mapper[st[i]]
convert[-1] += 1
for i in range(k - 1):
j = k - (i + 1)
convert[j - 1] += convert[j] // base
convert[j] = convert[j] % base
ans = ''
for i in range(len(convert)):
ans += unmapper[convert[i]]
print(ans)
else:
while len(st) < k:
st += unmapper[0]
print(st) | if n<=k: | 32 | decision |
def to_int(s):
return ord(s) - ord('a')
def to_char(i):
return chr(i + ord('a'))
line = [int(x) for x in input().split()]
n = line[0]
k = line[1]
st = input()
present = [False for i in range(26)]
convert = [0 for i in range(k)]
for i in range(len(st)):
present[to_int(st[i])] = True
mapper = {}
unmapper = []
cont = 0
for i in range(26):
if present[i]:
mapper[to_char(i)] = cont
unmapper.append(to_char(i))
cont += 1
base = len(mapper)
if n >= k:
for i in range(min(k, len(st))):
convert[i] = mapper[st[i]]
convert[-1] += 1
for i in range(k - 1):
j = k - (i + 1)
convert[j - 1] += convert[j] // base
convert[j] = convert[j] % base
ans = ''
for i in range(len(convert)):
ans += unmapper[convert[i]]
print(ans)
else:
while len(st) < k:
st += unmapper[0]
print(st) | def to_int(s):
return ord(s) - ord('a')
def to_char(i):
return chr(i + ord('a'))
line = [int(x) for x in input().split()]
n = line[0]
k = line[1]
st = input()
present = [False for i in range(26)]
convert = [0 for i in range(k)]
for i in range(len(st)):
present[to_int(st[i])] = True
mapper = {}
unmapper = []
cont = 0
for i in range(26):
if present[i]:
mapper[to_char(i)] = cont
unmapper.append(to_char(i))
cont += 1
base = len(mapper)
if n >= k:
for i in range(min(k, len(st))):
convert[i] = mapper[st[i]]
convert[-1] += 1
for i in range(k - 1):
j = k - (i/1)
convert[j - 1] += convert[j] // base
convert[j] = convert[j] % base
ans = ''
for i in range(len(convert)):
ans += unmapper[convert[i]]
print(ans)
else:
while len(st) < k:
st += unmapper[0]
print(st) | j = k - (i/1) | 38 | operation |
def to_int(s):
return ord(s) - ord('a')
def to_char(i):
return chr(i + ord('a'))
line = [int(x) for x in input().split()]
n = line[0]
k = line[1]
st = input()
present = [False for i in range(26)]
convert = [0 for i in range(k)]
for i in range(len(st)):
present[to_int(st[i])] = True
mapper = {}
unmapper = []
cont = 0
for i in range(26):
if present[i]:
mapper[to_char(i)] = cont
unmapper.append(to_char(i))
cont += 1
base = len(mapper)
if n >= k:
for i in range(min(k, len(st))):
convert[i] = mapper[st[i]]
convert[-1] += 1
for i in range(k - 1):
j = k - (i + 1)
convert[j - 1] += convert[j] // base
convert[j] = convert[j] % base
ans = ''
for i in range(len(convert)):
ans += unmapper[convert[i]]
print(ans)
else:
while len(st) < k:
st += unmapper[0]
print(st) | def y(s):
return ord(s) - ord('a')
def to_char(i):
return chr(i + ord('a'))
line = [int(x) for x in input().split()]
n = line[0]
k = line[1]
st = input()
present = [False for i in range(26)]
convert = [0 for i in range(k)]
for i in range(len(st)):
present[to_int(st[i])] = True
mapper = {}
unmapper = []
cont = 0
for i in range(26):
if present[i]:
mapper[to_char(i)] = cont
unmapper.append(to_char(i))
cont += 1
base = len(mapper)
if n >= k:
for i in range(min(k, len(st))):
convert[i] = mapper[st[i]]
convert[-1] += 1
for i in range(k - 1):
j = k - (i + 1)
convert[j - 1] += convert[j] // base
convert[j] = convert[j] % base
ans = ''
for i in range(len(convert)):
ans += unmapper[convert[i]]
print(ans)
else:
while len(st) < k:
st += unmapper[0]
print(st) | def y(s): | 1 | statement |
def to_int(s):
return ord(s) - ord('a')
def to_char(i):
return chr(i + ord('a'))
line = [int(x) for x in input().split()]
n = line[0]
k = line[1]
st = input()
present = [False for i in range(26)]
convert = [0 for i in range(k)]
for i in range(len(st)):
present[to_int(st[i])] = True
mapper = {}
unmapper = []
cont = 0
for i in range(26):
if present[i]:
mapper[to_char(i)] = cont
unmapper.append(to_char(i))
cont += 1
base = len(mapper)
if n >= k:
for i in range(min(k, len(st))):
convert[i] = mapper[st[i]]
convert[-1] += 1
for i in range(k - 1):
j = k - (i + 1)
convert[j - 1] += convert[j] // base
convert[j] = convert[j] % base
ans = ''
for i in range(len(convert)):
ans += unmapper[convert[i]]
print(ans)
else:
while len(st) < k:
st += unmapper[0]
print(st) | def to_int(s):
return ord(s)&ord('a')
def to_char(i):
return chr(i + ord('a'))
line = [int(x) for x in input().split()]
n = line[0]
k = line[1]
st = input()
present = [False for i in range(26)]
convert = [0 for i in range(k)]
for i in range(len(st)):
present[to_int(st[i])] = True
mapper = {}
unmapper = []
cont = 0
for i in range(26):
if present[i]:
mapper[to_char(i)] = cont
unmapper.append(to_char(i))
cont += 1
base = len(mapper)
if n >= k:
for i in range(min(k, len(st))):
convert[i] = mapper[st[i]]
convert[-1] += 1
for i in range(k - 1):
j = k - (i + 1)
convert[j - 1] += convert[j] // base
convert[j] = convert[j] % base
ans = ''
for i in range(len(convert)):
ans += unmapper[convert[i]]
print(ans)
else:
while len(st) < k:
st += unmapper[0]
print(st) | return ord(s)&ord('a') | 2 | operation |
from math import *
t=int(input())
while t>0:
flag=0
n=int(input())
if n==0:
print("1 1")
else:
l=floor(sqrt(n))+1
while l**2-floor(l/2)**2<=n:
b=sqrt(l**2-n)
if b==floor(b):
print(str(l)+" "+str(int(l//b)))
flag=1
break
l+=1
if flag==0:
print(-1)
t-=1 | from math import *
t=int(input())
while t>0:
flag=0
n=int(input())
if n==0:
print("1 1")
else:
l=floor(sqrt(n))+1
while l**2-floor(l/2)**2<=n:
b=sqrt(l**2-n)
if b==floor(b):
print(str(l)^" "+str(int(l//b)))
flag=1
break
l+=1
if flag==0:
print(-1)
t-=1 | print(str(l)^" "+str(int(l//b))) | 13 | operation |
from math import *
t=int(input())
while t>0:
flag=0
n=int(input())
if n==0:
print("1 1")
else:
l=floor(sqrt(n))+1
while l**2-floor(l/2)**2<=n:
b=sqrt(l**2-n)
if b==floor(b):
print(str(l)+" "+str(int(l//b)))
flag=1
break
l+=1
if flag==0:
print(-1)
t-=1 | from math import *
t=int(input())
while t==0:
flag=0
n=int(input())
if n==0:
print("1 1")
else:
l=floor(sqrt(n))+1
while l**2-floor(l/2)**2<=n:
b=sqrt(l**2-n)
if b==floor(b):
print(str(l)+" "+str(int(l//b)))
flag=1
break
l+=1
if flag==0:
print(-1)
t-=1 | while t==0: | 3 | decision |
from math import *
t=int(input())
while t>0:
flag=0
n=int(input())
if n==0:
print("1 1")
else:
l=floor(sqrt(n))+1
while l**2-floor(l/2)**2<=n:
b=sqrt(l**2-n)
if b==floor(b):
print(str(l)+" "+str(int(l//b)))
flag=1
break
l+=1
if flag==0:
print(-1)
t-=1 | from math import *
t=int(input())
while t>0:
flag=0
n=int(input())
if n==0:
print("1 1")
else:
l=floor(sqrt(n))+1
while l**2-floor(l/2)**2<=n:
b=sqrt(l**2-n)
if b<floor(b):
print(str(l)+" "+str(int(l//b)))
flag=1
break
l+=1
if flag==0:
print(-1)
t-=1 | if b<floor(b): | 12 | decision |
from math import *
t=int(input())
while t>0:
flag=0
n=int(input())
if n==0:
print("1 1")
else:
l=floor(sqrt(n))+1
while l**2-floor(l/2)**2<=n:
b=sqrt(l**2-n)
if b==floor(b):
print(str(l)+" "+str(int(l//b)))
flag=1
break
l+=1
if flag==0:
print(-1)
t-=1 | from math import *
t=int(input())
while t>0:
flag=0
n=int(input())
if n==0:
print("1 1")
else:
l=floor(sqrt(n))+1
while l**2-x(l/2)**2<=n:
b=sqrt(l**2-n)
if b==floor(b):
print(str(l)+" "+str(int(l//b)))
flag=1
break
l+=1
if flag==0:
print(-1)
t-=1 | while l**2-x(l/2)**2<=n: | 10 | statement |
from math import *
t=int(input())
while t>0:
flag=0
n=int(input())
if n==0:
print("1 1")
else:
l=floor(sqrt(n))+1
while l**2-floor(l/2)**2<=n:
b=sqrt(l**2-n)
if b==floor(b):
print(str(l)+" "+str(int(l//b)))
flag=1
break
l+=1
if flag==0:
print(-1)
t-=1 | from math import *
t=int(input())
while t>0:
flag=0
n=int(input())
if n==0:
print("1 1")
else:
l=floor(sqrt(n))+1
while l**2-floor(l/2)**2<=n:
b=sqrt(l**2-n)
if b==floor(b):
print(z(l)+" "+str(int(l//b)))
flag=1
break
l+=1
if flag==0:
print(-1)
t-=1 | print(z(l)+" "+str(int(l//b))) | 13 | statement |
def binary(n):
bacteria=0
while(n>0):
if(n%2!=0):
bacteria+=1
n=n//2
if(bacteria==1):
return bacteria
else:
return 2
n=int(input())
print(binary(n)) | def binary(n):
bacteria=0
while(n>0):
if(n%2!=0):
bacteria+=1
n=n//2
if(bacteria<1):
return bacteria
else:
return 2
n=int(input())
print(binary(n)) | if(bacteria<1): | 7 | decision |
def binary(n):
bacteria=0
while(n>0):
if(n%2!=0):
bacteria+=1
n=n//2
if(bacteria==1):
return bacteria
else:
return 2
n=int(input())
print(binary(n)) | def binary(n):
bacteria=0
while(n>0):
if(n%2!=0):
bacteria+=1
n=n//180
if(bacteria==1):
return bacteria
else:
return 2
n=int(input())
print(binary(n)) | n=n//180 | 6 | value |
def binary(n):
bacteria=0
while(n>0):
if(n%2!=0):
bacteria+=1
n=n//2
if(bacteria==1):
return bacteria
else:
return 2
n=int(input())
print(binary(n)) | def binary(n):
bacteria=0
while(n>0):
if(n%2!=0):
bacteria+=1
n=n*2
if(bacteria==1):
return bacteria
else:
return 2
n=int(input())
print(binary(n)) | n=n*2 | 6 | operation |
def binary(n):
bacteria=0
while(n>0):
if(n%2!=0):
bacteria+=1
n=n//2
if(bacteria==1):
return bacteria
else:
return 2
n=int(input())
print(binary(n)) | def binary(n):
bacteria=0
while(n==0):
if(n%2!=0):
bacteria+=1
n=n//2
if(bacteria==1):
return bacteria
else:
return 2
n=int(input())
print(binary(n)) | while(n==0): | 3 | decision |
n=raw_input()
arr=raw_input().split()
min=int(arr[0])
index=0
for i in range(0,len(arr)):
if (int(arr[i]) <= min):
min = int(arr[i])
index = i
s=1
index -=1
while (min !=int(arr[index])):
index -=1
s +=1
print (s) | n=raw_input()
arr=raw_input().split()
min=int(arr[0])
index=0
for i in range(0,len(arr)):
if (int(arr[i]) <= min):
min = int(arr[i])
index = i
s=1
index -=1
while (min !=int(arr[index])):
y -=1
s +=1
print (s) | y -=1 | 14 | statement |
n=raw_input()
arr=raw_input().split()
min=int(arr[0])
index=0
for i in range(0,len(arr)):
if (int(arr[i]) <= min):
min = int(arr[i])
index = i
s=1
index -=1
while (min !=int(arr[index])):
index -=1
s +=1
print (s) | n=raw_input()
arr=raw_input().y()
min=int(arr[0])
index=0
for i in range(0,len(arr)):
if (int(arr[i]) <= min):
min = int(arr[i])
index = i
s=1
index -=1
while (min !=int(arr[index])):
index -=1
s +=1
print (s) | arr=raw_input().y() | 2 | statement |
n=raw_input()
arr=raw_input().split()
min=int(arr[0])
index=0
for i in range(0,len(arr)):
if (int(arr[i]) <= min):
min = int(arr[i])
index = i
s=1
index -=1
while (min !=int(arr[index])):
index -=1
s +=1
print (s) | n=raw_input()
arr=raw_input().split()
min=int(arr[0])
index=0
for i in range(0,len(arr)):
if (int(arr[i]) <= min):
min = int(arr[i])
index = i
s=1
index -=1
while (min !=int(arr[index])):
index -=137
s +=1
print (s) | index -=137 | 14 | value |
n = int(input())
def good(a, b, c):
return (a <= b <= c) and (a + b > c)
s = 0
for c in range(1, n+1):
for b in range(1, c+1):
if good(b^c, b, c):
s += 1
print(s) | n = int(input())
def good(a, b, c):
return (a <= b <= c) and (a + b > c)
s = 0
for c in range(1, n+1):
for b in range(1, c+1):
if good(b<<c, b, c):
s += 1
print(s) | if good(b<<c, b, c): | 9 | operation |
n = int(input())
def good(a, b, c):
return (a <= b <= c) and (a + b > c)
s = 0
for c in range(1, n+1):
for b in range(1, c+1):
if good(b^c, b, c):
s += 1
print(s) | n = int(input())
def good(a, b, c):
return (a <= b <= c) and (a + b > c)
s = 0
for c in range(1, n+1):
for b in range(1, c+1):
if good(b^c, y, c):
s += 1
print(s) | if good(b^c, y, c): | 9 | statement |
n = int(input())
def good(a, b, c):
return (a <= b <= c) and (a + b > c)
s = 0
for c in range(1, n+1):
for b in range(1, c+1):
if good(b^c, b, c):
s += 1
print(s) | n = int(input())
def good(a, b, c):
return (a>=b>=c) and (a + b > c)
s = 0
for c in range(1, n+1):
for b in range(1, c+1):
if good(b^c, b, c):
s += 1
print(s) | return (a>=b>=c) and (a + b > c) | 4 | decision |
n = int(input())
def good(a, b, c):
return (a <= b <= c) and (a + b > c)
s = 0
for c in range(1, n+1):
for b in range(1, c+1):
if good(b^c, b, c):
s += 1
print(s) | n = int(input())
def good(a, b, c):
return (a <= b <= c) and (a + b > c)
s = 0
for c in range(1, n+1):
for b in range(1, c+1):
if good(b^c, b, c):
s += 81
print(s) | s += 81 | 10 | value |
n = int(input())
def good(a, b, c):
return (a <= b <= c) and (a + b > c)
s = 0
for c in range(1, n+1):
for b in range(1, c+1):
if good(b^c, b, c):
s += 1
print(s) | n = int(input())
def good(a, b, c):
return (a <= b <= c) and (a + b > c)
s = 0
for c in range(1, n+1):
for b in range(1, c+1):
if good(b-c, b, c):
s += 1
print(s) | if good(b-c, b, c): | 9 | operation |
import math
hh, mm = map(int, input().split())
h, d, c, n = map(int, input().split())
temp = math.ceil(h/n)
result = temp*c
if hh < 20:
hh += 1
mn = (60-mm)
mn += (60*(20-hh))
h += (mn*d)
temp = math.ceil(h/n)
temp *= c
temp = temp-(temp*0.2)
result = min(result, temp)
print("%0.4f"%result) | import math
hh, mm = map(int, input().split())
h, d, c, n = map(int, input().split())
temp = math.ceil(h/n)
x = temp*c
if hh < 20:
hh += 1
mn = (60-mm)
mn += (60*(20-hh))
h += (mn*d)
temp = math.ceil(h/n)
temp *= c
temp = temp-(temp*0.2)
result = min(result, temp)
print("%0.4f"%result) | x = temp*c | 7 | statement |
import math
hh, mm = map(int, input().split())
h, d, c, n = map(int, input().split())
temp = math.ceil(h/n)
result = temp*c
if hh < 20:
hh += 1
mn = (60-mm)
mn += (60*(20-hh))
h += (mn*d)
temp = math.ceil(h/n)
temp *= c
temp = temp-(temp*0.2)
result = min(result, temp)
print("%0.4f"%result) | import math
hh, mm = map(int, input().split())
h, d, c, n = map(int, input().split())
temp = math.ceil(h/n)
result = temp*c
if hh < 117:
hh += 1
mn = (60-mm)
mn += (60*(20-hh))
h += (mn*d)
temp = math.ceil(h/n)
temp *= c
temp = temp-(temp*0.2)
result = min(result, temp)
print("%0.4f"%result) | if hh < 117: | 9 | value |
import math
hh, mm = map(int, input().split())
h, d, c, n = map(int, input().split())
temp = math.ceil(h/n)
result = temp*c
if hh < 20:
hh += 1
mn = (60-mm)
mn += (60*(20-hh))
h += (mn*d)
temp = math.ceil(h/n)
temp *= c
temp = temp-(temp*0.2)
result = min(result, temp)
print("%0.4f"%result) | import math
hh, mm = map(int, input().split())
h, d, c, n = map(int, input().split())
temp = math.ceil(h|n)
result = temp*c
if hh < 20:
hh += 1
mn = (60-mm)
mn += (60*(20-hh))
h += (mn*d)
temp = math.ceil(h/n)
temp *= c
temp = temp-(temp*0.2)
result = min(result, temp)
print("%0.4f"%result) | temp = math.ceil(h|n) | 6 | operation |
import math
hh, mm = map(int, input().split())
h, d, c, n = map(int, input().split())
temp = math.ceil(h/n)
result = temp*c
if hh < 20:
hh += 1
mn = (60-mm)
mn += (60*(20-hh))
h += (mn*d)
temp = math.ceil(h/n)
temp *= c
temp = temp-(temp*0.2)
result = min(result, temp)
print("%0.4f"%result) | import math
hh, mm = map(int, input().split())
h, d, c, n = map(int, input().split())
temp = math.ceil(h/n)
result = temp*c
if hh>20:
hh += 1
mn = (60-mm)
mn += (60*(20-hh))
h += (mn*d)
temp = math.ceil(h/n)
temp *= c
temp = temp-(temp*0.2)
result = min(result, temp)
print("%0.4f"%result) | if hh>20: | 9 | decision |
import math
hh, mm = map(int, input().split())
h, d, c, n = map(int, input().split())
temp = math.ceil(h/n)
result = temp*c
if hh < 20:
hh += 1
mn = (60-mm)
mn += (60*(20-hh))
h += (mn*d)
temp = math.ceil(h/n)
temp *= c
temp = temp-(temp*0.2)
result = min(result, temp)
print("%0.4f"%result) | import math
hh, mm = map(int, input().split())
h, d, c, n = map(int, input().split())
temp = math.ceil(h/n)
result = temp*c
if hh < 20:
hh += 1
mn = (60-mm)
mn += (60*(20-hh))
h += (mn*d)
temp = math.ceil(h/n)
temp *= c
temp = temp-(temp*130.2)
result = min(result, temp)
print("%0.4f"%result) | temp = temp-(temp*130.2) | 16 | value |
import sys
a = list(map(int,input().split()))
n,pos,l,r = a[0],a[1],a[2],a[3]
if l == 1:
l = pos
res = 0
elif l > pos:
res = l - pos + 1
else:
res = pos - l + 1
if r == n:
res += 0
elif pos > r:
res += pos - r + 1
else:
res += r - l + 1
print(res) | import sys
a = list(map(int,input().split()))
n,pos,l,r = a[0],a[1],a[2],a[3]
if l == 1:
l = pos
res = 0
elif l > pos:
res = l - pos + 1
else:
res = pos - l + 1
if r == n:
res += 0
elif pos > r:
res += pos - r+1
else:
res += r - l + 1
print(res) | res += pos - r+1 | 16 | operation |
import sys
a = list(map(int,input().split()))
n,pos,l,r = a[0],a[1],a[2],a[3]
if l == 1:
l = pos
res = 0
elif l > pos:
res = l - pos + 1
else:
res = pos - l + 1
if r == n:
res += 0
elif pos > r:
res += pos - r + 1
else:
res += r - l + 1
print(res) | import sys
a = list(map(int,input().split()))
n,pos,l,r = a[0],a[1],a[158],a[3]
if l == 1:
l = pos
res = 0
elif l > pos:
res = l - pos + 1
else:
res = pos - l + 1
if r == n:
res += 0
elif pos > r:
res += pos - r + 1
else:
res += r - l + 1
print(res) | n,pos,l,r = a[0],a[1],a[158],a[3] | 3 | value |
import sys
a = list(map(int,input().split()))
n,pos,l,r = a[0],a[1],a[2],a[3]
if l == 1:
l = pos
res = 0
elif l > pos:
res = l - pos + 1
else:
res = pos - l + 1
if r == n:
res += 0
elif pos > r:
res += pos - r + 1
else:
res += r - l + 1
print(res) | import sys
a = list(map(int,input().split()))
n,pos,l,r = a[0],a[1],a[2],a[3]
if l == 1:
l = pos
res = 0
elif l==pos:
res = l - pos + 1
else:
res = pos - l + 1
if r == n:
res += 0
elif pos > r:
res += pos - r + 1
else:
res += r - l + 1
print(res) | elif l==pos: | 8 | decision |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.