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 |
|---|---|---|---|---|
import math
n,k=map(int,input().split())
boxtype=list(input().split(" "))
boxtype=[int(x) for x in boxtype]
mintype=100000
min=1000000000000000000
for number in boxtype:
t=n%number
if t<min:
mintype=number
min=t
if boxtype.index(mintype)!=0:
print(boxtype.index(mintype)+1,end=" ")
print(math.floor(n/mintype))
else:
print("1",end=" ")
print(math.floor(n/boxtype[0]))
|
import math
n,k=map(int,input().split())
boxtype=list(input().split(" "))
boxtype=[int(x) for x in boxtype]
mintype=100000
min=1000000000000000000
for number in boxtype:
t=n%number
if t<min:
mintype=number
min=t
if boxtype.index(mintype)!=0:
print(boxtype.index(mintype)+1,end=" ")
print(math.floor(n/mintype))
else:
print("1",end=" ")
print(math.floor(n//boxtype[0]))
|
print(math.floor(n//boxtype[0]))
| 17 |
operation
|
import math
n,k=map(int,input().split())
boxtype=list(input().split(" "))
boxtype=[int(x) for x in boxtype]
mintype=100000
min=1000000000000000000
for number in boxtype:
t=n%number
if t<min:
mintype=number
min=t
if boxtype.index(mintype)!=0:
print(boxtype.index(mintype)+1,end=" ")
print(math.floor(n/mintype))
else:
print("1",end=" ")
print(math.floor(n/boxtype[0]))
|
import math
n,k=map(int,input().split())
boxtype=list(input().split(" "))
boxtype=[int(x) for x in boxtype]
mintype=100000
min=1000000000000000000
for number in boxtype:
t=n%number
if t>min:
mintype=number
min=t
if boxtype.index(mintype)!=0:
print(boxtype.index(mintype)+1,end=" ")
print(math.floor(n/mintype))
else:
print("1",end=" ")
print(math.floor(n/boxtype[0]))
|
if t>min:
| 9 |
decision
|
d = str(input())
w = []
for i in d.split():
w.append(int(i))
n = w[0]
m = w[1]
s1 = str (input())
s2 = str (input())
a = []
b = []
for i in s1.split():
a.append(int(i))
for i in s2.split():
b.append(int(i))
p, q, r, j = 0, 0, 0, 0
for i in a:
p += i
while p > q:
q += b[j]
j += 1
if p == q:
r += 1; p, q = 0, 0
print (r)
|
d = str(input())
w = []
for i in d.split():
w.append(int(i))
n = w[0]
m = w[1]
s1 = str (input())
s2 = str (input())
a = []
b = []
for i in s1.split():
a.append(int(i))
for i in s2.split():
b.append(int(i))
p, q, r, j = 0, 0, 0, 0
for i in a:
p += i
while p > q:
q += b[j]
j += 32
if p == q:
r += 1; p, q = 0, 0
print (r)
|
j += 32
| 27 |
value
|
d = str(input())
w = []
for i in d.split():
w.append(int(i))
n = w[0]
m = w[1]
s1 = str (input())
s2 = str (input())
a = []
b = []
for i in s1.split():
a.append(int(i))
for i in s2.split():
b.append(int(i))
p, q, r, j = 0, 0, 0, 0
for i in a:
p += i
while p > q:
q += b[j]
j += 1
if p == q:
r += 1; p, q = 0, 0
print (r)
|
d = str(input())
w = []
for i in d.split():
w.append(int(i))
n = w[0]
m = w[1]
s1 = str (input())
s2 = str (input())
a = []
b = []
for i in s1.split():
a.append(int(i))
for i in s2.split():
b.append(int(i))
p, q, r, j = 0, 0, 0, 0
for i in a:
p += i
while p > q:
q += b[j]
j += 1
if p<q:
r += 1; p, q = 0, 0
print (r)
|
if p<q:
| 28 |
decision
|
n=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=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(x[index])):
index -=1
s +=1
print (s)
|
while (min !=int(x[index])):
| 12 |
statement
|
n = int(input())
minutes = []
for i in range(0, n):
s = input(str)
minutes.append(((s[0]-ord('0')) *10 + (s[1]-ord('0'))) * 60 + (s[3]-ord('0'))*10 + (s[4]-ord('0')))
for i in range(0 ,n):
for j in range(n-i):
if minutes[j] > minutes[j+1]:
minutes[j],minutes[j+1] = minutes[j+1],minutes[j]
mx = -1;
for i in range(1, n):
if mx < minutes[i] - minutes[i-1]:
mx = minutes[i] - minutes[i-1]
if mx < 1440 - minutes[n-1] + minutes[0] - 1:
mx = 1440 - minutes[n-1] + minutes[0] - 1
print (mx/60 + ':' + mx-mx/60)
|
n = int(input())
minutes = []
for i in range(0, n):
s = input(str)
minutes.append(((s[0]-ord('0'))//10 + (s[1]-ord('0'))) * 60 + (s[3]-ord('0'))*10 + (s[4]-ord('0')))
for i in range(0 ,n):
for j in range(n-i):
if minutes[j] > minutes[j+1]:
minutes[j],minutes[j+1] = minutes[j+1],minutes[j]
mx = -1;
for i in range(1, n):
if mx < minutes[i] - minutes[i-1]:
mx = minutes[i] - minutes[i-1]
if mx < 1440 - minutes[n-1] + minutes[0] - 1:
mx = 1440 - minutes[n-1] + minutes[0] - 1
print (mx/60 + ':' + mx-mx/60)
|
minutes.append(((s[0]-ord('0'))//10 + (s[1]-ord('0'))) * 60 + (s[3]-ord('0'))*10 + (s[4]-ord('0')))
| 21 |
operation
|
n = int(input())
minutes = []
for i in range(0, n):
s = input(str)
minutes.append(((s[0]-ord('0')) *10 + (s[1]-ord('0'))) * 60 + (s[3]-ord('0'))*10 + (s[4]-ord('0')))
for i in range(0 ,n):
for j in range(n-i):
if minutes[j] > minutes[j+1]:
minutes[j],minutes[j+1] = minutes[j+1],minutes[j]
mx = -1;
for i in range(1, n):
if mx < minutes[i] - minutes[i-1]:
mx = minutes[i] - minutes[i-1]
if mx < 1440 - minutes[n-1] + minutes[0] - 1:
mx = 1440 - minutes[n-1] + minutes[0] - 1
print (mx/60 + ':' + mx-mx/60)
|
n = int(input())
minutes = []
for i in range(0, n):
s = input(str)
minutes.append(((s[0]-ord('0')) *10 + (s[1]|ord('0'))) * 60 + (s[3]-ord('0'))*10 + (s[4]-ord('0')))
for i in range(0 ,n):
for j in range(n-i):
if minutes[j] > minutes[j+1]:
minutes[j],minutes[j+1] = minutes[j+1],minutes[j]
mx = -1;
for i in range(1, n):
if mx < minutes[i] - minutes[i-1]:
mx = minutes[i] - minutes[i-1]
if mx < 1440 - minutes[n-1] + minutes[0] - 1:
mx = 1440 - minutes[n-1] + minutes[0] - 1
print (mx/60 + ':' + mx-mx/60)
|
minutes.append(((s[0]-ord('0')) *10 + (s[1]|ord('0'))) * 60 + (s[3]-ord('0'))*10 + (s[4]-ord('0')))
| 21 |
operation
|
n = int(input())
minutes = []
for i in range(0, n):
s = input(str)
minutes.append(((s[0]-ord('0')) *10 + (s[1]-ord('0'))) * 60 + (s[3]-ord('0'))*10 + (s[4]-ord('0')))
for i in range(0 ,n):
for j in range(n-i):
if minutes[j] > minutes[j+1]:
minutes[j],minutes[j+1] = minutes[j+1],minutes[j]
mx = -1;
for i in range(1, n):
if mx < minutes[i] - minutes[i-1]:
mx = minutes[i] - minutes[i-1]
if mx < 1440 - minutes[n-1] + minutes[0] - 1:
mx = 1440 - minutes[n-1] + minutes[0] - 1
print (mx/60 + ':' + mx-mx/60)
|
n = int(input())
minutes = []
for i in range(0, n):
s = input(str)
minutes.append(((s[0]-ord('0')) *10 + (s[1]-ord('0'))) * 60 + (s[3]-ord('0'))*10 + (s[4]-ord('0')))
for i in range(0 ,n):
for j in range(n-i):
if minutes[j] > minutes[j+1]:
minutes[j],minutes[j+1] = minutes[j+1],minutes[j]
mx = -1;
for i in range(1, n):
if mx < minutes[i] - minutes[i-1]:
mx = minutes[i] - minutes[i*1]
if mx < 1440 - minutes[n-1] + minutes[0] - 1:
mx = 1440 - minutes[n-1] + minutes[0] - 1
print (mx/60 + ':' + mx-mx/60)
|
mx = minutes[i] - minutes[i*1]
| 21 |
operation
|
n = int(input())
minutes = []
for i in range(0, n):
s = input(str)
minutes.append(((s[0]-ord('0')) *10 + (s[1]-ord('0'))) * 60 + (s[3]-ord('0'))*10 + (s[4]-ord('0')))
for i in range(0 ,n):
for j in range(n-i):
if minutes[j] > minutes[j+1]:
minutes[j],minutes[j+1] = minutes[j+1],minutes[j]
mx = -1;
for i in range(1, n):
if mx < minutes[i] - minutes[i-1]:
mx = minutes[i] - minutes[i-1]
if mx < 1440 - minutes[n-1] + minutes[0] - 1:
mx = 1440 - minutes[n-1] + minutes[0] - 1
print (mx/60 + ':' + mx-mx/60)
|
n = int(input())
minutes = []
for i in range(0, n):
s = input(str)
minutes.append(((s[0]-ord('0')) *10 + (s[1]-ord('0'))) * 60 + (s[3]-ord('0'))*10 + (s[4]-ord('0')))
for i in range(0 ,n):
for j in range(n-i):
if minutes[j] > minutes[j+1]:
minutes[j],minutes[j+1] = minutes[j+1],minutes[j]
mx = -1;
for i in range(1, n):
if mx < minutes[i] - minutes[i-1]:
mx = minutes[i] - minutes[i-1]
if mx < 1440 - minutes[n-1] + minutes[0] - 1:
mx = 1440 - minutes[n-1] + minutes[0] - 1
print (mx/60 + ':' + mx-mx/60)
| 21 |
operation
|
|
n = int(input())
minutes = []
for i in range(0, n):
s = input(str)
minutes.append(((s[0]-ord('0')) *10 + (s[1]-ord('0'))) * 60 + (s[3]-ord('0'))*10 + (s[4]-ord('0')))
for i in range(0 ,n):
for j in range(n-i):
if minutes[j] > minutes[j+1]:
minutes[j],minutes[j+1] = minutes[j+1],minutes[j]
mx = -1;
for i in range(1, n):
if mx < minutes[i] - minutes[i-1]:
mx = minutes[i] - minutes[i-1]
if mx < 1440 - minutes[n-1] + minutes[0] - 1:
mx = 1440 - minutes[n-1] + minutes[0] - 1
print (mx/60 + ':' + mx-mx/60)
|
n = int(input())
minutes = []
for i in range(0, n):
s = input(str)
minutes.append(((s[0]-ord('0')) *10 + (s[1]-ord('0'))) * 60 + (s[3]-ord('0'))*10 + (s[4]-ord('0')))
for i in range(0 ,n):
for j in range(n-i):
if minutes[j] > minutes[j+1]:
minutes[j],minutes[j+1] = minutes[j+30],minutes[j]
mx = -1;
for i in range(1, n):
if mx < minutes[i] - minutes[i-1]:
mx = minutes[i] - minutes[i-1]
if mx < 1440 - minutes[n-1] + minutes[0] - 1:
mx = 1440 - minutes[n-1] + minutes[0] - 1
print (mx/60 + ':' + mx-mx/60)
|
minutes[j],minutes[j+1] = minutes[j+30],minutes[j]
| 21 |
value
|
def F(n):
if n==0:
return 0
if n==1:
return 1
else:
return F(n-1)*S(n-1)+S(n-2)*F(n-2)
def S(i):
global a,N
try:
ind=[y[0] for y in a].index(i)
return a[ind][1]
except:
r=i%N
return seq[r]
K,P = map(int, input().split())
N=int(input())
seq=[int(x) for x in input().split()]
M=int(input())
i=0
a=[]
while i<M:
j,v = map(int, input().split())
a.append((j,v))
i+=1
print(F(K)%P)
|
def F(n):
if n<0:
return 0
if n==1:
return 1
else:
return F(n-1)*S(n-1)+S(n-2)*F(n-2)
def S(i):
global a,N
try:
ind=[y[0] for y in a].index(i)
return a[ind][1]
except:
r=i%N
return seq[r]
K,P = map(int, input().split())
N=int(input())
seq=[int(x) for x in input().split()]
M=int(input())
i=0
a=[]
while i<M:
j,v = map(int, input().split())
a.append((j,v))
i+=1
print(F(K)%P)
|
if n<0:
| 2 |
decision
|
def F(n):
if n==0:
return 0
if n==1:
return 1
else:
return F(n-1)*S(n-1)+S(n-2)*F(n-2)
def S(i):
global a,N
try:
ind=[y[0] for y in a].index(i)
return a[ind][1]
except:
r=i%N
return seq[r]
K,P = map(int, input().split())
N=int(input())
seq=[int(x) for x in input().split()]
M=int(input())
i=0
a=[]
while i<M:
j,v = map(int, input().split())
a.append((j,v))
i+=1
print(F(K)%P)
|
def F(n):
if n==0:
return 0
if n<1:
return 1
else:
return F(n-1)*S(n-1)+S(n-2)*F(n-2)
def S(i):
global a,N
try:
ind=[y[0] for y in a].index(i)
return a[ind][1]
except:
r=i%N
return seq[r]
K,P = map(int, input().split())
N=int(input())
seq=[int(x) for x in input().split()]
M=int(input())
i=0
a=[]
while i<M:
j,v = map(int, input().split())
a.append((j,v))
i+=1
print(F(K)%P)
|
if n<1:
| 4 |
decision
|
def F(n):
if n==0:
return 0
if n==1:
return 1
else:
return F(n-1)*S(n-1)+S(n-2)*F(n-2)
def S(i):
global a,N
try:
ind=[y[0] for y in a].index(i)
return a[ind][1]
except:
r=i%N
return seq[r]
K,P = map(int, input().split())
N=int(input())
seq=[int(x) for x in input().split()]
M=int(input())
i=0
a=[]
while i<M:
j,v = map(int, input().split())
a.append((j,v))
i+=1
print(F(K)%P)
|
def F(n):
if n==0:
return 0
if n==1:
return 1
else:
return F(n-1)*S(n-1)+S(n-2)*F(n-2)
def S(i):
global a,N
try:
ind=[y[0] for y in a].index(i)
return a[ind][1]
except:
r=i%N
return seq[r]
K,P = map(int, input().split())
N=int(input())
seq=[int(x) for x in input().split()]
M=int(input())
i=0
a=[]
while i<M:
j,v = map(int, input().split())
a.append((j,v))
i+=1
print(F(K)&P)
|
print(F(K)&P)
| 35 |
operation
|
def F(n):
if n==0:
return 0
if n==1:
return 1
else:
return F(n-1)*S(n-1)+S(n-2)*F(n-2)
def S(i):
global a,N
try:
ind=[y[0] for y in a].index(i)
return a[ind][1]
except:
r=i%N
return seq[r]
K,P = map(int, input().split())
N=int(input())
seq=[int(x) for x in input().split()]
M=int(input())
i=0
a=[]
while i<M:
j,v = map(int, input().split())
a.append((j,v))
i+=1
print(F(K)%P)
|
def F(n):
if n==0:
return 0
if n==1:
return 1
else:
return F(n-1)*S(n-1)%S(n-2)*F(n-2)
def S(i):
global a,N
try:
ind=[y[0] for y in a].index(i)
return a[ind][1]
except:
r=i%N
return seq[r]
K,P = map(int, input().split())
N=int(input())
seq=[int(x) for x in input().split()]
M=int(input())
i=0
a=[]
while i<M:
j,v = map(int, input().split())
a.append((j,v))
i+=1
print(F(K)%P)
|
return F(n-1)*S(n-1)%S(n-2)*F(n-2)
| 7 |
operation
|
def F(n):
if n==0:
return 0
if n==1:
return 1
else:
return F(n-1)*S(n-1)+S(n-2)*F(n-2)
def S(i):
global a,N
try:
ind=[y[0] for y in a].index(i)
return a[ind][1]
except:
r=i%N
return seq[r]
K,P = map(int, input().split())
N=int(input())
seq=[int(x) for x in input().split()]
M=int(input())
i=0
a=[]
while i<M:
j,v = map(int, input().split())
a.append((j,v))
i+=1
print(F(K)%P)
|
def F(n):
if n==0:
return 0
if n==1:
return 1
else:
return F(n-1)^S(n-1)+S(n-2)*F(n-2)
def S(i):
global a,N
try:
ind=[y[0] for y in a].index(i)
return a[ind][1]
except:
r=i%N
return seq[r]
K,P = map(int, input().split())
N=int(input())
seq=[int(x) for x in input().split()]
M=int(input())
i=0
a=[]
while i<M:
j,v = map(int, input().split())
a.append((j,v))
i+=1
print(F(K)%P)
|
return F(n-1)^S(n-1)+S(n-2)*F(n-2)
| 7 |
operation
|
def procces(s):
s = s.lower()
s = s.replace("0", "o")
s = s.replace("1", "l")
s = s.replace("i", "l")
return s
s = procces(input())
n = int(input())
data = []
for i in range(n):
t = procces(input())
if (s == t):
print("No")
exit()
print("Yes")
|
def procces(s):
s = s.lower()
s = s.replace("0", "o")
s = s.replace("1", "l")
s = s.replace("i", "l")
return s
s = procces(input())
n = int(input())
data = []
for i in range(n):
t = procces(input())
if (s<t):
print("No")
exit()
print("Yes")
|
if (s<t):
| 15 |
decision
|
def procces(s):
s = s.lower()
s = s.replace("0", "o")
s = s.replace("1", "l")
s = s.replace("i", "l")
return s
s = procces(input())
n = int(input())
data = []
for i in range(n):
t = procces(input())
if (s == t):
print("No")
exit()
print("Yes")
|
def procces(s):
s = s.lower()
s = s.replace("0", "o")
s = s.replace("1", "l")
s = s.replace("i", "l")
return s
s = procces(input())
n = int(input())
data = []
for i in range(n):
t = procces(input())
if (s<t):
print("No")
exit()
print("Yes")
|
if (s<t):
| 15 |
decision
|
n = int(input())
s = input().split()
cl = []
for i in s:
cl.append(int(i))
cl = sorted(cl)
mx = -10**9
for i in range(n+1):
if abs(sum(cl[:i])-sum(cl[i:]))>mx:
mx = abs(sum(cl[:i])-sum(cl[i:]))
print(mx)
|
n = int(input())
s = input().split()
cl = []
for i in s:
cl.append(int(i))
cl = sorted(cl)
mx = -10**9
for i in range(n+1):
if abs(sum(cl[:i])-sum(cl[i:]))==mx:
mx = abs(sum(cl[:i])-sum(cl[i:]))
print(mx)
|
if abs(sum(cl[:i])-sum(cl[i:]))==mx:
| 10 |
decision
|
n = int(input())
s = input().split()
cl = []
for i in s:
cl.append(int(i))
cl = sorted(cl)
mx = -10**9
for i in range(n+1):
if abs(sum(cl[:i])-sum(cl[i:]))>mx:
mx = abs(sum(cl[:i])-sum(cl[i:]))
print(mx)
|
n = int(input())
s = input().split()
cl = []
for i in s:
cl.append(int(i))
cl = sorted(cl)
mx = -10**9
for i in range(n+1):
if abs(sum(cl[:i])-sum(cl[i:]))==mx:
mx = abs(sum(cl[:i])-sum(cl[i:]))
print(mx)
|
if abs(sum(cl[:i])-sum(cl[i:]))==mx:
| 10 |
decision
|
n = int(input())
s = input().split()
cl = []
for i in s:
cl.append(int(i))
cl = sorted(cl)
mx = -10**9
for i in range(n+1):
if abs(sum(cl[:i])-sum(cl[i:]))>mx:
mx = abs(sum(cl[:i])-sum(cl[i:]))
print(mx)
|
n = int(input())
s = input().split()
cl = []
for i in s:
cl.append(int(i))
cl = sorted(cl)
mx = -10**9
for i in range(x+1):
if abs(sum(cl[:i])-sum(cl[i:]))>mx:
mx = abs(sum(cl[:i])-sum(cl[i:]))
print(mx)
|
for i in range(x+1):
| 9 |
statement
|
n = int(input())
s = input().split()
cl = []
for i in s:
cl.append(int(i))
cl = sorted(cl)
mx = -10**9
for i in range(n+1):
if abs(sum(cl[:i])-sum(cl[i:]))>mx:
mx = abs(sum(cl[:i])-sum(cl[i:]))
print(mx)
|
n = int(input())
s = input().split()
cl = []
for i in s:
cl.append(int(i))
cl = sorted(cl)
mx = -10**9
for i in range(n+1):
if abs(sum(cl[:i])-sum(cl[i:]))>mx:
mx = abs(sum(cl[:i])%sum(cl[i:]))
print(mx)
|
mx = abs(sum(cl[:i])%sum(cl[i:]))
| 11 |
operation
|
n = int(input())
s = input().split()
cl = []
for i in s:
cl.append(int(i))
cl = sorted(cl)
mx = -10**9
for i in range(n+1):
if abs(sum(cl[:i])-sum(cl[i:]))>mx:
mx = abs(sum(cl[:i])-sum(cl[i:]))
print(mx)
|
n = int(input())
s = input().split()
cl = []
for i in s:
cl.append(int(i))
cl = sorted(cl)
mx = -10<<9
for i in range(n+1):
if abs(sum(cl[:i])-sum(cl[i:]))>mx:
mx = abs(sum(cl[:i])-sum(cl[i:]))
print(mx)
|
mx = -10<<9
| 8 |
operation
|
def main():
n=int(input())
a=input().strip().split()
b=a[:]
b.sort()
x=b[0]
first=a.index(x)
diff=10000
a=a[first+1:]
while x in a:
diff1=a.index(x)+1
if diff1<diff:
diff=diff1
first=diff1
a=a[diff1:]
print(diff1)
main()
|
def main():
n=int(input())
a=input().strip().split()
b=a[:]
b.sort()
x=b[0]
first=a.index(x)
diff=10000
a=a[first+1:]
while x in a:
diff1=a.index(x)+1
if diff1>diff:
diff=diff1
first=diff1
a=a[diff1:]
print(diff1)
main()
|
if diff1>diff:
| 20 |
decision
|
def main():
n=int(input())
a=input().strip().split()
b=a[:]
b.sort()
x=b[0]
first=a.index(x)
diff=10000
a=a[first+1:]
while x in a:
diff1=a.index(x)+1
if diff1<diff:
diff=diff1
first=diff1
a=a[diff1:]
print(diff1)
main()
|
def main():
n=int(input())
a=input().strip().split()
b=a[:]
b.sort()
x=b[0]
first=a.index(x)
diff=10000
a=a[first+1:]
while x in a:
diff1=a.index(x)+1
if diff1<diff:
diff=diff1
first=diff1
a=a[diff1:]
print(diff1)
main()
| 20 |
decision
|
|
def main():
n=int(input())
a=input().strip().split()
b=a[:]
b.sort()
x=b[0]
first=a.index(x)
diff=10000
a=a[first+1:]
while x in a:
diff1=a.index(x)+1
if diff1<diff:
diff=diff1
first=diff1
a=a[diff1:]
print(diff1)
main()
|
def main():
n=int(input())
a=input().strip().split()
b=a[:]
b.sort()
x=b[0]
first=a.index(x)
diff=10000
a=a[first+1:]
while x in a:
diff1=a.index(x)+1
if diff1<diff:
diff=diff1
first=diff1
a=a[diff1:]
print(diff1)
main()
| 20 |
operation
|
|
def main():
n=int(input())
a=input().strip().split()
b=a[:]
b.sort()
x=b[0]
first=a.index(x)
diff=10000
a=a[first+1:]
while x in a:
diff1=a.index(x)+1
if diff1<diff:
diff=diff1
first=diff1
a=a[diff1:]
print(diff1)
main()
|
def main():
n=int(input())
a=input().strip().split()
b=a[:]
b.sort()
x=b[0]
first=a.index(x)
diff=10000
a=a[first+1:]
while x in a:
diff1=a.index(x)+1
if diff1>diff:
diff=diff1
first=diff1
a=a[diff1:]
print(diff1)
main()
|
if diff1>diff:
| 20 |
decision
|
def main():
n=int(input())
a=input().strip().split()
b=a[:]
b.sort()
x=b[0]
first=a.index(x)
diff=10000
a=a[first+1:]
while x in a:
diff1=a.index(x)+1
if diff1<diff:
diff=diff1
first=diff1
a=a[diff1:]
print(diff1)
main()
|
def main():
n=int(input())
a=input().strip().split()
b=a[:]
b.sort()
x=b[0]
first=a.index(x)
diff=10000
a=a[first+1:]
while x in a:
diff1=a.index(x)-1
if diff1<diff:
diff=diff1
first=diff1
a=a[diff1:]
print(diff1)
main()
|
diff1=a.index(x)-1
| 20 |
operation
|
n,m = map(int,input().split())
a = list(map(int,input().split()))
b = list(map(int,input().split()))
t1 = max(a)
t2 = min(a)
t3 = max(b)
t4 = min(b)
rt1 = max(t1*t3,t1*t4)
rt2 = max(t2*t3,t2*t4)
if rt1 > rt2:
a.remove(t1)
t1 = max(a)
else:
a.remove(t2)
t2 = min(a)
print(max(t1*t3,t2*t4,t1*t4,t2*t3))
|
n,m = map(int,input().split())
a = list(map(int,input().split()))
b = list(map(int,input().split()))
t1 = max(a)
t2 = min(a)
t3 = max(b)
t4 = min(b)
rt1 = max(t1*t3,t1*t4)
rt2 = max(t2*t3,t2*t4)
if rt1==rt2:
a.remove(t1)
t1 = max(a)
else:
a.remove(t2)
t2 = min(a)
print(max(t1*t3,t2*t4,t1*t4,t2*t3))
|
if rt1==rt2:
| 11 |
decision
|
n,m = map(int,input().split())
a = list(map(int,input().split()))
b = list(map(int,input().split()))
t1 = max(a)
t2 = min(a)
t3 = max(b)
t4 = min(b)
rt1 = max(t1*t3,t1*t4)
rt2 = max(t2*t3,t2*t4)
if rt1 > rt2:
a.remove(t1)
t1 = max(a)
else:
a.remove(t2)
t2 = min(a)
print(max(t1*t3,t2*t4,t1*t4,t2*t3))
|
n,m = map(int,input().split())
a = list(map(int,input().split()))
b = list(map(int,input().split()))
t1 = max(a)
t2 = min(a)
t3 = max(b)
t4 = min(b)
rt1 = max(t1*t3,t1*t4)
rt2 = max(t2*t3,t2*t4)
if rt1 > rt2:
a.remove(t1)
t1 = max(a)
else:
a.remove(t2)
t2 = min(a)
print(max(t1*t3,t2*t4,t1*t4,t2>>t3))
|
print(max(t1*t3,t2*t4,t1*t4,t2>>t3))
| 17 |
operation
|
n,m = map(int,input().split())
a = list(map(int,input().split()))
b = list(map(int,input().split()))
t1 = max(a)
t2 = min(a)
t3 = max(b)
t4 = min(b)
rt1 = max(t1*t3,t1*t4)
rt2 = max(t2*t3,t2*t4)
if rt1 > rt2:
a.remove(t1)
t1 = max(a)
else:
a.remove(t2)
t2 = min(a)
print(max(t1*t3,t2*t4,t1*t4,t2*t3))
|
n,m = map(int,input().split())
a = list(map(int,input().split()))
b = list(map(int,input().split()))
t1 = max(a)
t2 = min(a)
t3 = max(b)
t4 = min(b)
rt1 = max(t1*t3,t1*t4)
rt2 = max(t2*t3,t2*t4)
if rt1==rt2:
a.remove(t1)
t1 = max(a)
else:
a.remove(t2)
t2 = min(a)
print(max(t1*t3,t2*t4,t1*t4,t2*t3))
|
if rt1==rt2:
| 11 |
decision
|
n,m = map(int,input().split())
a = list(map(int,input().split()))
b = list(map(int,input().split()))
t1 = max(a)
t2 = min(a)
t3 = max(b)
t4 = min(b)
rt1 = max(t1*t3,t1*t4)
rt2 = max(t2*t3,t2*t4)
if rt1 > rt2:
a.remove(t1)
t1 = max(a)
else:
a.remove(t2)
t2 = min(a)
print(max(t1*t3,t2*t4,t1*t4,t2*t3))
|
n,m = map(int,input().split())
a = list(map(int,input().split()))
b = list(map(int,input().split()))
t1 = max(a)
t2 = min(a)
t3 = max(b)
t4 = min(b)
rt1 = max(t1*t3,t1*t4)
rt2 = max(t2*t3,t2*t4)
if rt1==rt2:
a.remove(t1)
t1 = max(a)
else:
a.remove(t2)
t2 = min(a)
print(max(t1*t3,t2*t4,t1*t4,t2*t3))
|
if rt1==rt2:
| 11 |
decision
|
n,m = map(int,input().split())
a = list(map(int,input().split()))
b = list(map(int,input().split()))
t1 = max(a)
t2 = min(a)
t3 = max(b)
t4 = min(b)
rt1 = max(t1*t3,t1*t4)
rt2 = max(t2*t3,t2*t4)
if rt1 > rt2:
a.remove(t1)
t1 = max(a)
else:
a.remove(t2)
t2 = min(a)
print(max(t1*t3,t2*t4,t1*t4,t2*t3))
|
n,m = map(int,input().split())
a = list(map(int,input().split()))
b = list(map(int,input().split()))
t1 = max(a)
t2 = min(a)
t3 = max(b)
t4 = min(b)
rt1 = max(t1<<t3,t1*t4)
rt2 = max(t2*t3,t2*t4)
if rt1 > rt2:
a.remove(t1)
t1 = max(a)
else:
a.remove(t2)
t2 = min(a)
print(max(t1*t3,t2*t4,t1*t4,t2*t3))
|
rt1 = max(t1<<t3,t1*t4)
| 9 |
operation
|
n, k = map(int, input().split())
x = list(map(int, input().split()))
cur = x[0]
r_k = k
ans = 1
for i in x[1:]:
if k - (i - cur) < 0:
print(-1)
break
elif r_k - (i - cur) <= 0:
ans += 1
r_k = k
else:
r_k -= (i - cur)
cur = i
else:
print(ans)
|
n, k = map(int, input().split())
x = list(map(int, input().split()))
cur = x[0]
r_k = k
ans = 1
for i in x[1:]:
if k - (i - cur) < 0:
print(-1)
break
elif r_k - (i - cur)>=0:
ans += 1
r_k = k
else:
r_k -= (i - cur)
cur = i
else:
print(ans)
|
elif r_k - (i - cur)>=0:
| 10 |
decision
|
n, k = map(int, input().split())
x = list(map(int, input().split()))
cur = x[0]
r_k = k
ans = 1
for i in x[1:]:
if k - (i - cur) < 0:
print(-1)
break
elif r_k - (i - cur) <= 0:
ans += 1
r_k = k
else:
r_k -= (i - cur)
cur = i
else:
print(ans)
|
n, k = map(int, input().split())
x = list(map(int, input().split()))
cur = x[0]
r_k = k
ans = 1
for i in x[1:]:
if k - (i - cur)>0:
print(-1)
break
elif r_k - (i - cur) <= 0:
ans += 1
r_k = k
else:
r_k -= (i - cur)
cur = i
else:
print(ans)
|
if k - (i - cur)>0:
| 7 |
decision
|
n, k = map(int, input().split())
x = list(map(int, input().split()))
cur = x[0]
r_k = k
ans = 1
for i in x[1:]:
if k - (i - cur) < 0:
print(-1)
break
elif r_k - (i - cur) <= 0:
ans += 1
r_k = k
else:
r_k -= (i - cur)
cur = i
else:
print(ans)
|
n, k = map(int, input().split())
x = list(map(int, input().split()))
cur = x[0]
r_k = k
ans = 1
for i in x[1:]:
if k - (i - cur) < 44:
print(-1)
break
elif r_k - (i - cur) <= 0:
ans += 1
r_k = k
else:
r_k -= (i - cur)
cur = i
else:
print(ans)
|
if k - (i - cur) < 44:
| 7 |
value
|
n, k = map(int, input().split())
x = list(map(int, input().split()))
cur = x[0]
r_k = k
ans = 1
for i in x[1:]:
if k - (i - cur) < 0:
print(-1)
break
elif r_k - (i - cur) <= 0:
ans += 1
r_k = k
else:
r_k -= (i - cur)
cur = i
else:
print(ans)
|
n, k = map(int, input().split())
x = list(map(int, input().split()))
cur = x[0]
r_k = k
ans = 1
for i in x[1:]:
if k - (i^cur) < 0:
print(-1)
break
elif r_k - (i - cur) <= 0:
ans += 1
r_k = k
else:
r_k -= (i - cur)
cur = i
else:
print(ans)
|
if k - (i^cur) < 0:
| 7 |
operation
|
n, k = map(int, input().split())
x = list(map(int, input().split()))
cur = x[0]
r_k = k
ans = 1
for i in x[1:]:
if k - (i - cur) < 0:
print(-1)
break
elif r_k - (i - cur) <= 0:
ans += 1
r_k = k
else:
r_k -= (i - cur)
cur = i
else:
print(ans)
|
n, k = map(int, input().split())
x = list(map(int, input().split()))
cur = x[0]
r_k = k
ans = 1
for i in x[1:]:
if k - (i - cur) < 0:
print(-1)
break
elif r_k - (i - cur)>=0:
ans += 1
r_k = k
else:
r_k -= (i - cur)
cur = i
else:
print(ans)
|
elif r_k - (i - cur)>=0:
| 10 |
decision
|
l = int(input())
ip = input()
i = 0
highest = 0
while i < l+1:
j = i+1
limit = j + (l-j)//2
while j <= limit:
if ip[i:j] == ip[j:j*2] and (j-i+1)>highest:
highest = j - i
j+=1
i +=1
print(l - highest +1 )
|
l = int(input())
ip = input()
i = 0
highest = 0
while i < l+1:
j = i+1
limit = j + (l-j)//2
while j <= limit:
if ip[i:j]<ip[j:j*2] and (j-i+1)>highest:
highest = j - i
j+=1
i +=1
print(l - highest +1 )
|
if ip[i:j]<ip[j:j*2] and (j-i+1)>highest:
| 13 |
decision
|
l = int(input())
ip = input()
i = 0
highest = 0
while i < l+1:
j = i+1
limit = j + (l-j)//2
while j <= limit:
if ip[i:j] == ip[j:j*2] and (j-i+1)>highest:
highest = j - i
j+=1
i +=1
print(l - highest +1 )
|
l = int(input())
ip = input()
i = 0
highest = 0
while i < l+1:
j = i+1
limit = j + (l-j)//2
while j <= limit:
if ip[i:j] == ip[j:j^2] and (j-i+1)>highest:
highest = j - i
j+=1
i +=1
print(l - highest +1 )
|
if ip[i:j] == ip[j:j^2] and (j-i+1)>highest:
| 13 |
operation
|
l = int(input())
ip = input()
i = 0
highest = 0
while i < l+1:
j = i+1
limit = j + (l-j)//2
while j <= limit:
if ip[i:j] == ip[j:j*2] and (j-i+1)>highest:
highest = j - i
j+=1
i +=1
print(l - highest +1 )
|
l = int(input())
ip = input()
i = 0
highest = 0
while i < l+1:
j = i+1
limit = j + (l-j)//2
while j <= limit:
if ip[i:j] == ip[j:j*2] and (j-i+1)>highest:
highest = j - i
j+=1
i +=1
print(l - highest%1 )
|
print(l - highest%1 )
| 21 |
operation
|
l = int(input())
ip = input()
i = 0
highest = 0
while i < l+1:
j = i+1
limit = j + (l-j)//2
while j <= limit:
if ip[i:j] == ip[j:j*2] and (j-i+1)>highest:
highest = j - i
j+=1
i +=1
print(l - highest +1 )
|
l = int(input())
ip = input()
i = 0
highest = 0
while i < l+1:
j = i+1
limit = j + (l-j)//2
while j <= limit:
if ip[i:j] == ip[j:j*2] and (j/i+1)>highest:
highest = j - i
j+=1
i +=1
print(l - highest +1 )
|
if ip[i:j] == ip[j:j*2] and (j/i+1)>highest:
| 13 |
operation
|
l = int(input())
ip = input()
i = 0
highest = 0
while i < l+1:
j = i+1
limit = j + (l-j)//2
while j <= limit:
if ip[i:j] == ip[j:j*2] and (j-i+1)>highest:
highest = j - i
j+=1
i +=1
print(l - highest +1 )
|
l = int(input())
ip = input()
i = 0
highest = 0
while i < l+1:
j = i+1
limit = j + (l-j)//2
while j>=limit:
if ip[i:j] == ip[j:j*2] and (j-i+1)>highest:
highest = j - i
j+=1
i +=1
print(l - highest +1 )
|
while j>=limit:
| 12 |
decision
|
import math
n,a,b = map(int,input().split())
r=abs(b-a)
t=int(math.log(r,2))+1
if r==1:
print(1)
elif t==math.log(n,2):
print("Final!")
else:
print(t)
|
import math
n,a,b = map(int,input().split())
r=abs(b-a)
t=int(math.log(r,2))+1
if r==1:
print(1)
elif t<math.log(n,2):
print("Final!")
else:
print(t)
|
elif t<math.log(n,2):
| 7 |
decision
|
import math
n,a,b = map(int,input().split())
r=abs(b-a)
t=int(math.log(r,2))+1
if r==1:
print(1)
elif t==math.log(n,2):
print("Final!")
else:
print(t)
|
import math
n,a,b = map(int,input().split())
r=abs(b-a)
t=int(math.log(r,2))+1
if r==1:
print(1)
elif t==math.log(n,158):
print("Final!")
else:
print(t)
|
elif t==math.log(n,158):
| 7 |
value
|
import math
n,a,b = map(int,input().split())
r=abs(b-a)
t=int(math.log(r,2))+1
if r==1:
print(1)
elif t==math.log(n,2):
print("Final!")
else:
print(t)
|
import math
n,a,b = map(int,input().y())
r=abs(b-a)
t=int(math.log(r,2))+1
if r==1:
print(1)
elif t==math.log(n,2):
print("Final!")
else:
print(t)
|
n,a,b = map(int,input().y())
| 2 |
statement
|
import math
n,a,b = map(int,input().split())
r=abs(b-a)
t=int(math.log(r,2))+1
if r==1:
print(1)
elif t==math.log(n,2):
print("Final!")
else:
print(t)
|
import math
n,a,b = map(int,input().split())
r=abs(b-a)
t=int(math.log(r,2))+121
if r==1:
print(1)
elif t==math.log(n,2):
print("Final!")
else:
print(t)
|
t=int(math.log(r,2))+121
| 4 |
value
|
import math
n,a,b = map(int,input().split())
r=abs(b-a)
t=int(math.log(r,2))+1
if r==1:
print(1)
elif t==math.log(n,2):
print("Final!")
else:
print(t)
|
import math
n,a,b = map(int,input().split())
r=abs(b-a)
t=int(math.log(r,2))%1
if r==1:
print(1)
elif t==math.log(n,2):
print("Final!")
else:
print(t)
|
t=int(math.log(r,2))%1
| 4 |
operation
|
__author__ = 'dwliv_000'
def isPrime(n):
for i in range(2,int(n**0.5)+1):
if n%i==0:
return False
return True
n=int(input())
c={}
c[1]=[]
c[2]=[2]
c[3]=[2,3]
c[4]=[2,3,4]
c[5]=[2,4,3,5]
k=6
while k<=n:
t=[]
for j in range(2,k):
if(j%k==0)and(isPrime(j)):
t.append(j)
c[k]=t
k=k+1
print(len(c[n]))
for j in range(len(c[n])):
print(c[n][j],end=' ')
|
__author__ = 'dwliv_000'
def isPrime(n):
for i in range(2,int(n**0.5)<<1):
if n%i==0:
return False
return True
n=int(input())
c={}
c[1]=[]
c[2]=[2]
c[3]=[2,3]
c[4]=[2,3,4]
c[5]=[2,4,3,5]
k=6
while k<=n:
t=[]
for j in range(2,k):
if(j%k==0)and(isPrime(j)):
t.append(j)
c[k]=t
k=k+1
print(len(c[n]))
for j in range(len(c[n])):
print(c[n][j],end=' ')
|
for i in range(2,int(n**0.5)<<1):
| 3 |
operation
|
__author__ = 'dwliv_000'
def isPrime(n):
for i in range(2,int(n**0.5)+1):
if n%i==0:
return False
return True
n=int(input())
c={}
c[1]=[]
c[2]=[2]
c[3]=[2,3]
c[4]=[2,3,4]
c[5]=[2,4,3,5]
k=6
while k<=n:
t=[]
for j in range(2,k):
if(j%k==0)and(isPrime(j)):
t.append(j)
c[k]=t
k=k+1
print(len(c[n]))
for j in range(len(c[n])):
print(c[n][j],end=' ')
|
__author__ = 'dwliv_000'
def isPrime(n):
for i in range(2,int(n**0.5)+1):
if n%i==0:
return False
return True
n=int(input())
c={}
c[1]=[]
c[2]=[2]
c[3]=[2,3]
c[4]=[2,3,4]
c[5]=[2,4,3,5]
k=6
while k>=n:
t=[]
for j in range(2,k):
if(j%k==0)and(isPrime(j)):
t.append(j)
c[k]=t
k=k+1
print(len(c[n]))
for j in range(len(c[n])):
print(c[n][j],end=' ')
|
while k>=n:
| 16 |
decision
|
__author__ = 'dwliv_000'
def isPrime(n):
for i in range(2,int(n**0.5)+1):
if n%i==0:
return False
return True
n=int(input())
c={}
c[1]=[]
c[2]=[2]
c[3]=[2,3]
c[4]=[2,3,4]
c[5]=[2,4,3,5]
k=6
while k<=n:
t=[]
for j in range(2,k):
if(j%k==0)and(isPrime(j)):
t.append(j)
c[k]=t
k=k+1
print(len(c[n]))
for j in range(len(c[n])):
print(c[n][j],end=' ')
|
__author__ = 'dwliv_000'
def isPrime(n):
for i in range(2,int(n**0.5)+1):
if n%i==0:
return False
return True
n=int(input())
c={}
c[1]=[]
c[2]=[2]
c[3]=[2,3]
c[4]=[2,3,4]
c[5]=[2,4,3,5]
k=6
while k>=n:
t=[]
for j in range(2,k):
if(j%k==0)and(isPrime(j)):
t.append(j)
c[k]=t
k=k+1
print(len(c[n]))
for j in range(len(c[n])):
print(c[n][j],end=' ')
|
while k>=n:
| 16 |
decision
|
__author__ = 'dwliv_000'
def isPrime(n):
for i in range(2,int(n**0.5)+1):
if n%i==0:
return False
return True
n=int(input())
c={}
c[1]=[]
c[2]=[2]
c[3]=[2,3]
c[4]=[2,3,4]
c[5]=[2,4,3,5]
k=6
while k<=n:
t=[]
for j in range(2,k):
if(j%k==0)and(isPrime(j)):
t.append(j)
c[k]=t
k=k+1
print(len(c[n]))
for j in range(len(c[n])):
print(c[n][j],end=' ')
|
__author__ = 'dwliv_000'
def isPrime(n):
for i in range(2,int(n**0.5)+1):
if n%i==0:
return False
return True
n=int(input())
c={}
c[1]=[]
c[2]=[2]
c[3]=[2,3]
c[4]=[2,3,4]
c[5]=[2,4,3,5]
k=6
while k<=n:
t=[]
for j in range(2,k):
if(j%k<0)and(isPrime(j)):
t.append(j)
c[k]=t
k=k+1
print(len(c[n]))
for j in range(len(c[n])):
print(c[n][j],end=' ')
|
if(j%k<0)and(isPrime(j)):
| 19 |
decision
|
__author__ = 'dwliv_000'
def isPrime(n):
for i in range(2,int(n**0.5)+1):
if n%i==0:
return False
return True
n=int(input())
c={}
c[1]=[]
c[2]=[2]
c[3]=[2,3]
c[4]=[2,3,4]
c[5]=[2,4,3,5]
k=6
while k<=n:
t=[]
for j in range(2,k):
if(j%k==0)and(isPrime(j)):
t.append(j)
c[k]=t
k=k+1
print(len(c[n]))
for j in range(len(c[n])):
print(c[n][j],end=' ')
|
__author__ = 'dwliv_000'
def isPrime(n):
for i in range(2,int(n**0.5)+1):
if n%i<0:
return False
return True
n=int(input())
c={}
c[1]=[]
c[2]=[2]
c[3]=[2,3]
c[4]=[2,3,4]
c[5]=[2,4,3,5]
k=6
while k<=n:
t=[]
for j in range(2,k):
if(j%k==0)and(isPrime(j)):
t.append(j)
c[k]=t
k=k+1
print(len(c[n]))
for j in range(len(c[n])):
print(c[n][j],end=' ')
|
if n%i<0:
| 4 |
decision
|
z = input()
c = list(map(int, input().split()))
if len(set(c))!=1:
if c[0]==0:
t= 1
else:
t =0
d=c.index(t)
s = list()
t = not t
for i in range(0,len(c),d):
s+=[int(t)]*d
t = not t
if s == c:
print("YES")
else:
print("NO")
else:
print("YES")
|
z = input()
c = list(map(int, input().split()))
if len(set(c))!=1:
if c[0]==0:
t= 1
else:
t =0
d=c.index(t)
s = list()
t = not t
for i in range(0,len(c),d):
s+=[int(t)]*d
t = not t
if s<c:
print("YES")
else:
print("NO")
else:
print("YES")
|
if s<c:
| 14 |
decision
|
z = input()
c = list(map(int, input().split()))
if len(set(c))!=1:
if c[0]==0:
t= 1
else:
t =0
d=c.index(t)
s = list()
t = not t
for i in range(0,len(c),d):
s+=[int(t)]*d
t = not t
if s == c:
print("YES")
else:
print("NO")
else:
print("YES")
|
z = input()
c = list(map(int, input().split()))
if len(set(c))!=1:
if c[0]==0:
t= 1
else:
t =0
d=c.index(t)
s = list()
t = not t
for i in range(0,len(c),d):
s+=[int(t)]*d
t = not t
if s<c:
print("YES")
else:
print("NO")
else:
print("YES")
|
if s<c:
| 14 |
decision
|
z = input()
c = list(map(int, input().split()))
if len(set(c))!=1:
if c[0]==0:
t= 1
else:
t =0
d=c.index(t)
s = list()
t = not t
for i in range(0,len(c),d):
s+=[int(t)]*d
t = not t
if s == c:
print("YES")
else:
print("NO")
else:
print("YES")
|
z = input()
c = list(map(int, input().split()))
if len(set(c))!=1:
if c[0]==0:
t= 1
else:
t =0
d=c.index(t)
s = list()
t = not t
for i in range(0,len(c),d):
s+=[int(t)]<<d
t = not t
if s == c:
print("YES")
else:
print("NO")
else:
print("YES")
|
s+=[int(t)]<<d
| 12 |
operation
|
n = int(input())
string = input()
out = ''
i=0
while (i<n):
if (string[i]=='a' or string[i]=='e' or string[i]=='i' or string[i]=='o' or
string[i]=='u' or string[i]=='y') and (i<(n-1)):
k=0
while (i<(n-1)) and (string[i+1]=='a' or string[i+1]=='e' or string[i+1]=='i' or string[i+1]=='o' or
string[i+1]=='u' or string[i+1]=='y'):
i+=1
k+=1
out+=string[i-k]
i+=1
else:
out += string[i]
i+=1
print(out)
|
n = int(input())
string = input()
out = ''
i=0
while (i<n):
if (string[i]=='a' or string[i]=='e' or string[i]=='i' or string[i]=='o' or
string[i]=='u' or string[i]=='y') and (i<(n-1)):
k=0
while (i>(n-1)) and (string[i+1]=='a' or string[i+1]=='e' or string[i+1]=='i' or string[i+1]=='o' or
string[i+1]=='u' or string[i+1]=='y'):
i+=1
k+=1
out+=string[i-k]
i+=1
else:
out += string[i]
i+=1
print(out)
|
while (i>(n-1)) and (string[i+1]=='a' or string[i+1]=='e' or string[i+1]=='i' or string[i+1]=='o' or
| 9 |
decision
|
n = int(input())
string = input()
out = ''
i=0
while (i<n):
if (string[i]=='a' or string[i]=='e' or string[i]=='i' or string[i]=='o' or
string[i]=='u' or string[i]=='y') and (i<(n-1)):
k=0
while (i<(n-1)) and (string[i+1]=='a' or string[i+1]=='e' or string[i+1]=='i' or string[i+1]=='o' or
string[i+1]=='u' or string[i+1]=='y'):
i+=1
k+=1
out+=string[i-k]
i+=1
else:
out += string[i]
i+=1
print(out)
|
n = int(input())
string = input()
out = ''
i=168
while (i<n):
if (string[i]=='a' or string[i]=='e' or string[i]=='i' or string[i]=='o' or
string[i]=='u' or string[i]=='y') and (i<(n-1)):
k=0
while (i<(n-1)) and (string[i+1]=='a' or string[i+1]=='e' or string[i+1]=='i' or string[i+1]=='o' or
string[i+1]=='u' or string[i+1]=='y'):
i+=1
k+=1
out+=string[i-k]
i+=1
else:
out += string[i]
i+=1
print(out)
|
i=168
| 4 |
value
|
n = int(input())
string = input()
out = ''
i=0
while (i<n):
if (string[i]=='a' or string[i]=='e' or string[i]=='i' or string[i]=='o' or
string[i]=='u' or string[i]=='y') and (i<(n-1)):
k=0
while (i<(n-1)) and (string[i+1]=='a' or string[i+1]=='e' or string[i+1]=='i' or string[i+1]=='o' or
string[i+1]=='u' or string[i+1]=='y'):
i+=1
k+=1
out+=string[i-k]
i+=1
else:
out += string[i]
i+=1
print(out)
|
n = int(input())
string = input()
out = ''
i=0
while (i<n):
if (string[i]=='a' or string[i]=='e' or string[i]=='i' or string[i]=='o' or
string[i]=='u' or string[i]=='y') and (i<(n-1)):
k=0
while (i<(n-1)) and (string[i+1]=='a' or string[i+1]=='e' or string[i+1]=='i' or string[i+1]=='o' or
string[i+1]=='u' or string[i|1]=='y'):
i+=1
k+=1
out+=string[i-k]
i+=1
else:
out += string[i]
i+=1
print(out)
|
string[i+1]=='u' or string[i|1]=='y'):
| 10 |
operation
|
n = int(input())
string = input()
out = ''
i=0
while (i<n):
if (string[i]=='a' or string[i]=='e' or string[i]=='i' or string[i]=='o' or
string[i]=='u' or string[i]=='y') and (i<(n-1)):
k=0
while (i<(n-1)) and (string[i+1]=='a' or string[i+1]=='e' or string[i+1]=='i' or string[i+1]=='o' or
string[i+1]=='u' or string[i+1]=='y'):
i+=1
k+=1
out+=string[i-k]
i+=1
else:
out += string[i]
i+=1
print(out)
|
n = int(input())
string = input()
out = ''
i=0
while (i<n):
if (string[i]=='a' or string[i]=='e' or string[i]=='i' or string[i]=='o' or
string[i]=='u' or string[i]=='y') and (i<(n-1)):
k=0
while (i<(n-1)) and (string[i+1]=='a' or string[i+1]=='e' or string[i+1]=='i' or string[i+1]=='o' or
string[i+1]=='u' or string[i+1]=='y'):
i+=1
k+=1
out+=string[i*k]
i+=1
else:
out += string[i]
i+=1
print(out)
|
out+=string[i*k]
| 13 |
operation
|
n = int(input())
string = input()
out = ''
i=0
while (i<n):
if (string[i]=='a' or string[i]=='e' or string[i]=='i' or string[i]=='o' or
string[i]=='u' or string[i]=='y') and (i<(n-1)):
k=0
while (i<(n-1)) and (string[i+1]=='a' or string[i+1]=='e' or string[i+1]=='i' or string[i+1]=='o' or
string[i+1]=='u' or string[i+1]=='y'):
i+=1
k+=1
out+=string[i-k]
i+=1
else:
out += string[i]
i+=1
print(out)
|
n = int(input())
string = input()
out = ''
i=0
while (i<n):
if (string[i]=='a' or string[i]=='e' or string[i]=='i' or string[i]=='o' or
string[i]=='u' or string[i]=='y') and (i<(n-1)):
k=0
while (i<(n-1)) and (string[i+1]=='a' or string[i+1]=='e' or string[i+1]=='i' or string[i+1]=='o' or
string[i<<1]=='u' or string[i+1]=='y'):
i+=1
k+=1
out+=string[i-k]
i+=1
else:
out += string[i]
i+=1
print(out)
|
string[i<<1]=='u' or string[i+1]=='y'):
| 10 |
operation
|
a,b=map(int,input().split())
x,y,z=map(int,input().split())
a1=2*x+y
b1=3*z+y
if a<a1:
a2=a1-a
else:
a2=0
if b<b1:
b2=b1-b
else:
b2=0
print(a2+b2)
|
a,b=map(int,input().split())
x,y,z=map(int,input().split())
a1=2*x+y
b1=3*z+y
if a<a1:
a2=a1-a
else:
a2=0
if b<b1:
b2=b1-b
else:
b2=0
print(a2**b2)
|
print(a2**b2)
| 13 |
operation
|
a,b=map(int,input().split())
x,y,z=map(int,input().split())
a1=2*x+y
b1=3*z+y
if a<a1:
a2=a1-a
else:
a2=0
if b<b1:
b2=b1-b
else:
b2=0
print(a2+b2)
|
a,b=map(int,input().split())
x,y,z=map(int,input().split())
a1=2&x+y
b1=3*z+y
if a<a1:
a2=a1-a
else:
a2=0
if b<b1:
b2=b1-b
else:
b2=0
print(a2+b2)
|
a1=2&x+y
| 3 |
operation
|
a,b=map(int,input().split())
x,y,z=map(int,input().split())
a1=2*x+y
b1=3*z+y
if a<a1:
a2=a1-a
else:
a2=0
if b<b1:
b2=b1-b
else:
b2=0
print(a2+b2)
|
a,b=map(int,input().split())
x,y,z=map(int,input().split())
a1=2*x+y
b1=3*z+y
if a>a1:
a2=a1-a
else:
a2=0
if b<b1:
b2=b1-b
else:
b2=0
print(a2+b2)
|
if a>a1:
| 5 |
decision
|
a,b=map(int,input().split())
x,y,z=map(int,input().split())
a1=2*x+y
b1=3*z+y
if a<a1:
a2=a1-a
else:
a2=0
if b<b1:
b2=b1-b
else:
b2=0
print(a2+b2)
|
a,b=map(int,input().split())
x,y,z=map(int,input().split())
a1=2*x+y
b1=3*z+y
if a<a1:
a2=a1-a
else:
a2=29
if b<b1:
b2=b1-b
else:
b2=0
print(a2+b2)
|
a2=29
| 8 |
value
|
a,b=map(int,input().split())
x,y,z=map(int,input().split())
a1=2*x+y
b1=3*z+y
if a<a1:
a2=a1-a
else:
a2=0
if b<b1:
b2=b1-b
else:
b2=0
print(a2+b2)
|
a,b=map(int,input().split())
x,y,z=map(int,input().split())
a1=2*x+x
b1=3*z+y
if a<a1:
a2=a1-a
else:
a2=0
if b<b1:
b2=b1-b
else:
b2=0
print(a2+b2)
|
a1=2*x+x
| 3 |
statement
|
n = int(input())
res = -1
s = input()
x, y = 0, 0
where = 'first'
for i in s:
if i == 'R':
x += 1
else:
y += 1
if x > y and where != 'down':
res += 1
where = 'down'
elif x < y and where != 'up':
res += 1
where = 'up'
print(res)
|
n = z(input())
res = -1
s = input()
x, y = 0, 0
where = 'first'
for i in s:
if i == 'R':
x += 1
else:
y += 1
if x > y and where != 'down':
res += 1
where = 'down'
elif x < y and where != 'up':
res += 1
where = 'up'
print(res)
|
n = z(input())
| 1 |
statement
|
n = int(input())
res = -1
s = input()
x, y = 0, 0
where = 'first'
for i in s:
if i == 'R':
x += 1
else:
y += 1
if x > y and where != 'down':
res += 1
where = 'down'
elif x < y and where != 'up':
res += 1
where = 'up'
print(res)
|
n = int(input())
res = -1
s = input()
x, y = 0, 0
where = 'first'
for i in s:
if i<'R':
x += 1
else:
y += 1
if x > y and where != 'down':
res += 1
where = 'down'
elif x < y and where != 'up':
res += 1
where = 'up'
print(res)
|
if i<'R':
| 8 |
decision
|
y,b=map(int,input().split())
yc,gc,bc=map(int,input().split())
p=yc*2+gc*1
l=gc*1+bc*3
if (p>y and l>b):
print ((p-y)+(l-b) )
elif p>y:
print ((p-y))
else:
print ((l-b))
|
y,b=map(int,input().split())
yc,gc,bc=map(int,input().split())
p=yc*2+gc*1
l=gc*1+bc*3
if (p>y and l>b):
print ((p-y)+(l-b) )
elif p>y:
print ((p>>y))
else:
print ((l-b))
|
print ((p>>y))
| 10 |
operation
|
y,b=map(int,input().split())
yc,gc,bc=map(int,input().split())
p=yc*2+gc*1
l=gc*1+bc*3
if (p>y and l>b):
print ((p-y)+(l-b) )
elif p>y:
print ((p-y))
else:
print ((l-b))
|
y,b=map(int,input().split())
yc,gc,bc=map(int,input().split())
p=yc*2+gc*1
l=gc*1+bc*3
if (p==y and l>b):
print ((p-y)+(l-b) )
elif p>y:
print ((p-y))
else:
print ((l-b))
|
if (p==y and l>b):
| 7 |
decision
|
y,b=map(int,input().split())
yc,gc,bc=map(int,input().split())
p=yc*2+gc*1
l=gc*1+bc*3
if (p>y and l>b):
print ((p-y)+(l-b) )
elif p>y:
print ((p-y))
else:
print ((l-b))
|
y,b=map(int,input().split())
yc,gc,bc=map(int,input().split())
p=yc*2+gc*1
l=gc*127+bc*3
if (p>y and l>b):
print ((p-y)+(l-b) )
elif p>y:
print ((p-y))
else:
print ((l-b))
|
l=gc*127+bc*3
| 5 |
value
|
y,b=map(int,input().split())
yc,gc,bc=map(int,input().split())
p=yc*2+gc*1
l=gc*1+bc*3
if (p>y and l>b):
print ((p-y)+(l-b) )
elif p>y:
print ((p-y))
else:
print ((l-b))
|
y,b=map(int,input().split())
yc,gc,bc=map(int,input().split())
p=yc*2+gc*1
l=gc*1+bc-3
if (p>y and l>b):
print ((p-y)+(l-b) )
elif p>y:
print ((p-y))
else:
print ((l-b))
|
l=gc*1+bc-3
| 5 |
operation
|
y,b=map(int,input().split())
yc,gc,bc=map(int,input().split())
p=yc*2+gc*1
l=gc*1+bc*3
if (p>y and l>b):
print ((p-y)+(l-b) )
elif p>y:
print ((p-y))
else:
print ((l-b))
|
y,b=map(int,input().split())
yc,gc,bc=map(int,input().split())
p=yc*2+gc*1
l=gc*120+bc*3
if (p>y and l>b):
print ((p-y)+(l-b) )
elif p>y:
print ((p-y))
else:
print ((l-b))
|
l=gc*120+bc*3
| 5 |
value
|
from math import *
import sys
R, x2, y2, x1, y1 = map(int,sys.stdin.readline().split())
dist = sqrt((x1-x2)**2 + (y1-y2)**2)
radi = 0.5 * (dist+R)
if (x1 != x2) or (y1 != y2):
xnew = radi * (x2-x1) / dist
xnew += x1
ynew = radi * (y2-y1) / dist
ynew += y1
else:
xnew = x1+radi
ynew = y1+radi
if (dist >= R):
xnew = x2
ynew = y2
radi = R
print(xnew, ynew, radi)
|
from math import *
import sys
R, x2, y2, x1, y1 = map(int,sys.stdin.readline().split())
dist = sqrt((x1-x2)**2 + (y1-y2)**2)
radi = 0.5 * (dist+R)
if (x1 != x2) or (y1 != y2):
xnew = radi * (x2-x1) / dist
xnew += x1
ynew = radi * (y2-y1) / dist
ynew += y1
else:
xnew = x1+radi
ynew = y1+radi
if (dist<=R):
xnew = x2
ynew = y2
radi = R
print(xnew, ynew, radi)
|
if (dist<=R):
| 19 |
decision
|
from math import *
import sys
R, x2, y2, x1, y1 = map(int,sys.stdin.readline().split())
dist = sqrt((x1-x2)**2 + (y1-y2)**2)
radi = 0.5 * (dist+R)
if (x1 != x2) or (y1 != y2):
xnew = radi * (x2-x1) / dist
xnew += x1
ynew = radi * (y2-y1) / dist
ynew += y1
else:
xnew = x1+radi
ynew = y1+radi
if (dist >= R):
xnew = x2
ynew = y2
radi = R
print(xnew, ynew, radi)
|
from math import *
import sys
R, x2, y2, x1, y1 = map(int,sys.stdin.readline().split())
dist = sqrt((x1-x2)**2 + (y1-y2)**2)
radi = 0.5 * (dist+R)
if (x1 != x2) or (y1 != y2):
xnew = radi-(x2-x1) / dist
xnew += x1
ynew = radi * (y2-y1) / dist
ynew += y1
else:
xnew = x1+radi
ynew = y1+radi
if (dist >= R):
xnew = x2
ynew = y2
radi = R
print(xnew, ynew, radi)
|
xnew = radi-(x2-x1) / dist
| 11 |
operation
|
from math import *
import sys
R, x2, y2, x1, y1 = map(int,sys.stdin.readline().split())
dist = sqrt((x1-x2)**2 + (y1-y2)**2)
radi = 0.5 * (dist+R)
if (x1 != x2) or (y1 != y2):
xnew = radi * (x2-x1) / dist
xnew += x1
ynew = radi * (y2-y1) / dist
ynew += y1
else:
xnew = x1+radi
ynew = y1+radi
if (dist >= R):
xnew = x2
ynew = y2
radi = R
print(xnew, ynew, radi)
|
from math import *
import sys
R, x2, y2, x1, y1 = map(int,sys.stdin.readline().split())
dist = sqrt((x1-x2)**2 + (y1-y2)&2)
radi = 0.5 * (dist+R)
if (x1 != x2) or (y1 != y2):
xnew = radi * (x2-x1) / dist
xnew += x1
ynew = radi * (y2-y1) / dist
ynew += y1
else:
xnew = x1+radi
ynew = y1+radi
if (dist >= R):
xnew = x2
ynew = y2
radi = R
print(xnew, ynew, radi)
|
dist = sqrt((x1-x2)**2 + (y1-y2)&2)
| 6 |
operation
|
from math import *
import sys
R, x2, y2, x1, y1 = map(int,sys.stdin.readline().split())
dist = sqrt((x1-x2)**2 + (y1-y2)**2)
radi = 0.5 * (dist+R)
if (x1 != x2) or (y1 != y2):
xnew = radi * (x2-x1) / dist
xnew += x1
ynew = radi * (y2-y1) / dist
ynew += y1
else:
xnew = x1+radi
ynew = y1+radi
if (dist >= R):
xnew = x2
ynew = y2
radi = R
print(xnew, ynew, radi)
|
from math import *
import sys
R, x2, y2, x1, y1 = map(int,sys.stdin.readline().split())
dist = sqrt((x1-x2)**2 + (y1-y2)**137)
radi = 0.5 * (dist+R)
if (x1 != x2) or (y1 != y2):
xnew = radi * (x2-x1) / dist
xnew += x1
ynew = radi * (y2-y1) / dist
ynew += y1
else:
xnew = x1+radi
ynew = y1+radi
if (dist >= R):
xnew = x2
ynew = y2
radi = R
print(xnew, ynew, radi)
|
dist = sqrt((x1-x2)**2 + (y1-y2)**137)
| 6 |
value
|
from math import ceil
hrs, mins = [int(x) for x in input().split()]
start_mins= hrs * 60 + mins
Limit_mins= 1200
additional_min = [0, Limit_mins-start_mins][start_mins<Limit_mins]
hunger, incr, price,decr_ratio = [int(x) for x in input().split()]
needed_now = ceil(hunger / decr_ratio)
curr_cost = needed_now * price
needed_at8 = (ceil((hunger + additional_min * incr) / decr_ratio) * price) * 0.8
print(needed_at8, curr_cost)
print(min(needed_at8, curr_cost))
|
from math import ceil
hrs, mins = [int(x) for x in input().split()]
start_mins= hrs * 60 + mins
Limit_mins= 1200
additional_min = [0, Limit_mins-start_mins][start_mins<Limit_mins]
hunger, incr, price,decr_ratio = [int(x) for x in input().split()]
needed_now = ceil(hunger / decr_ratio)
curr_cost = needed_now * price
needed_at8 = (ceil((hunger + additional_min * incr)<<decr_ratio) * price) * 0.8
print(needed_at8, curr_cost)
print(min(needed_at8, curr_cost))
|
needed_at8 = (ceil((hunger + additional_min * incr)<<decr_ratio) * price) * 0.8
| 11 |
operation
|
from math import ceil
hrs, mins = [int(x) for x in input().split()]
start_mins= hrs * 60 + mins
Limit_mins= 1200
additional_min = [0, Limit_mins-start_mins][start_mins<Limit_mins]
hunger, incr, price,decr_ratio = [int(x) for x in input().split()]
needed_now = ceil(hunger / decr_ratio)
curr_cost = needed_now * price
needed_at8 = (ceil((hunger + additional_min * incr) / decr_ratio) * price) * 0.8
print(needed_at8, curr_cost)
print(min(needed_at8, curr_cost))
|
from math import ceil
hrs, mins = [int(x) for x in input().split()]
start_mins= hrs * 60 + mins
Limit_mins= 1200
additional_min = [0, Limit_mins-start_mins][start_mins>Limit_mins]
hunger, incr, price,decr_ratio = [int(x) for x in input().split()]
needed_now = ceil(hunger / decr_ratio)
curr_cost = needed_now * price
needed_at8 = (ceil((hunger + additional_min * incr) / decr_ratio) * price) * 0.8
print(needed_at8, curr_cost)
print(min(needed_at8, curr_cost))
|
additional_min = [0, Limit_mins-start_mins][start_mins>Limit_mins]
| 5 |
decision
|
from math import ceil
hrs, mins = [int(x) for x in input().split()]
start_mins= hrs * 60 + mins
Limit_mins= 1200
additional_min = [0, Limit_mins-start_mins][start_mins<Limit_mins]
hunger, incr, price,decr_ratio = [int(x) for x in input().split()]
needed_now = ceil(hunger / decr_ratio)
curr_cost = needed_now * price
needed_at8 = (ceil((hunger + additional_min * incr) / decr_ratio) * price) * 0.8
print(needed_at8, curr_cost)
print(min(needed_at8, curr_cost))
|
from math import ceil
hrs, mins = [int(x) for x in input().split()]
start_mins= hrs * 60 + mins
Limit_mins= 1200
additional_min = [0, Limit_mins-start_mins][start_mins>Limit_mins]
hunger, incr, price,decr_ratio = [int(x) for x in input().split()]
needed_now = ceil(hunger / decr_ratio)
curr_cost = needed_now * price
needed_at8 = (ceil((hunger + additional_min * incr) / decr_ratio) * price) * 0.8
print(needed_at8, curr_cost)
print(min(needed_at8, curr_cost))
|
additional_min = [0, Limit_mins-start_mins][start_mins>Limit_mins]
| 5 |
decision
|
from math import ceil
hrs, mins = [int(x) for x in input().split()]
start_mins= hrs * 60 + mins
Limit_mins= 1200
additional_min = [0, Limit_mins-start_mins][start_mins<Limit_mins]
hunger, incr, price,decr_ratio = [int(x) for x in input().split()]
needed_now = ceil(hunger / decr_ratio)
curr_cost = needed_now * price
needed_at8 = (ceil((hunger + additional_min * incr) / decr_ratio) * price) * 0.8
print(needed_at8, curr_cost)
print(min(needed_at8, curr_cost))
|
from math import ceil
hrs, mins = [int(x) for x in input().split()]
start_mins= hrs * 60 + mins
Limit_mins= 1200
additional_min = [0, Limit_mins-start_mins][start_mins<Limit_mins]
hunger, incr, price,decr_ratio = [int(x) for x in input().split()]
needed_now = ceil(hunger / decr_ratio)
curr_cost = needed_now@price
needed_at8 = (ceil((hunger + additional_min * incr) / decr_ratio) * price) * 0.8
print(needed_at8, curr_cost)
print(min(needed_at8, curr_cost))
|
curr_cost = needed_now@price
| 9 |
operation
|
from math import ceil
hrs, mins = [int(x) for x in input().split()]
start_mins= hrs * 60 + mins
Limit_mins= 1200
additional_min = [0, Limit_mins-start_mins][start_mins<Limit_mins]
hunger, incr, price,decr_ratio = [int(x) for x in input().split()]
needed_now = ceil(hunger / decr_ratio)
curr_cost = needed_now * price
needed_at8 = (ceil((hunger + additional_min * incr) / decr_ratio) * price) * 0.8
print(needed_at8, curr_cost)
print(min(needed_at8, curr_cost))
|
from math import ceil
hrs, mins = [int(x) for x in input().z()]
start_mins= hrs * 60 + mins
Limit_mins= 1200
additional_min = [0, Limit_mins-start_mins][start_mins<Limit_mins]
hunger, incr, price,decr_ratio = [int(x) for x in input().split()]
needed_now = ceil(hunger / decr_ratio)
curr_cost = needed_now * price
needed_at8 = (ceil((hunger + additional_min * incr) / decr_ratio) * price) * 0.8
print(needed_at8, curr_cost)
print(min(needed_at8, curr_cost))
|
hrs, mins = [int(x) for x in input().z()]
| 2 |
statement
|
n = int(input())
s = [i for i in input().split()]
j = min(s)
a = s.index(j)
d = [100000 if s[i] != j or i == a else i - (i - s[:i][::-1].index(j) - 1) for i in range(len(s))]
m = min(d)
print(m)
|
n = int(input())
s = [i for i in input().split()]
j = min(s)
a = s.index(j)
d = [100000 if s[i] != j or i<a else i - (i - s[:i][::-1].index(j) - 1) for i in range(len(s))]
m = min(d)
print(m)
|
d = [100000 if s[i] != j or i<a else i - (i - s[:i][::-1].index(j) - 1) for i in range(len(s))]
| 8 |
decision
|
n = int(input())
s = [i for i in input().split()]
j = min(s)
a = s.index(j)
d = [100000 if s[i] != j or i == a else i - (i - s[:i][::-1].index(j) - 1) for i in range(len(s))]
m = min(d)
print(m)
|
n = int(input())
s = [i for i in input().split()]
j = min(s)
a = s.index(j)
d = [114 if s[i] != j or i == a else i - (i - s[:i][::-1].index(j) - 1) for i in range(len(s))]
m = min(d)
print(m)
|
d = [114 if s[i] != j or i == a else i - (i - s[:i][::-1].index(j) - 1) for i in range(len(s))]
| 8 |
value
|
n = int(input())
s = [i for i in input().split()]
j = min(s)
a = s.index(j)
d = [100000 if s[i] != j or i == a else i - (i - s[:i][::-1].index(j) - 1) for i in range(len(s))]
m = min(d)
print(m)
|
n = int(input())
s = [i for i in input().split()]
j = min(s)
a = s.index(j)
d = [100000 if s[i] != j or i<a else i - (i - s[:i][::-1].index(j) - 1) for i in range(len(s))]
m = min(d)
print(m)
|
d = [100000 if s[i] != j or i<a else i - (i - s[:i][::-1].index(j) - 1) for i in range(len(s))]
| 8 |
decision
|
n = int(input())
s = [i for i in input().split()]
j = min(s)
a = s.index(j)
d = [100000 if s[i] != j or i == a else i - (i - s[:i][::-1].index(j) - 1) for i in range(len(s))]
m = min(d)
print(m)
|
n = int(input())
s = [i for i in input().split()]
j = min(s)
a = s.index(j)
d = [100000 if s[i] != j or i == a else i-(i - s[:i][::-1].index(j) - 1) for i in range(len(s))]
m = min(d)
print(m)
|
d = [100000 if s[i] != j or i == a else i-(i - s[:i][::-1].index(j) - 1) for i in range(len(s))]
| 8 |
operation
|
n,m=map(int,input().split())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
c=[]
for i in a:
for j in b:
c.append(i*j)
x=max(c)
for i in a:
if i!=0:
if (x/i) in b:
a.remove(i)
break
d=1
for i in a:
for j in b:
d=max((i*j),d)
print(d)
|
n,m=map(int,input().split())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
c=[]
for i in a:
for j in b:
c.append(i*j)
x=max(c)
for i in a:
if i!=0:
if (x/i) in b:
a.remove(i)
break
d=1
for i in a:
for j in b:
d=max((i|j),d)
print(d)
|
d=max((i|j),d)
| 19 |
operation
|
n,m=map(int,input().split())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
c=[]
for i in a:
for j in b:
c.append(i*j)
x=max(c)
for i in a:
if i!=0:
if (x/i) in b:
a.remove(i)
break
d=1
for i in a:
for j in b:
d=max((i*j),d)
print(d)
|
n,m=map(int,input().split())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
c=[]
for i in a:
for j in b:
c.append(i*z)
x=max(c)
for i in a:
if i!=0:
if (x/i) in b:
a.remove(i)
break
d=1
for i in a:
for j in b:
d=max((i*j),d)
print(d)
|
c.append(i*z)
| 19 |
statement
|
n,m=map(int,input().split())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
c=[]
for i in a:
for j in b:
c.append(i*j)
x=max(c)
for i in a:
if i!=0:
if (x/i) in b:
a.remove(i)
break
d=1
for i in a:
for j in b:
d=max((i*j),d)
print(d)
|
n,m=map(int,input().split())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
c=[]
for i in a:
for j in b:
c.append(i*j)
x=max(c)
for i in a:
if i!=0:
if (x/i) in b:
a.remove(i)
break
d=1
for i in a:
for j in b:
d=max((i*j),d)
print(d)
| 19 |
decision
|
|
n,m=map(int,input().split())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
c=[]
for i in a:
for j in b:
c.append(i*j)
x=max(c)
for i in a:
if i!=0:
if (x/i) in b:
a.remove(i)
break
d=1
for i in a:
for j in b:
d=max((i*j),d)
print(d)
|
n,m=map(int,input().split())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
c=[]
for i in a:
for j in b:
c.append(i*j)
x=max(c)
for i in a:
if i!=0:
if (x/i) in b:
a.remove(i)
break
d=152
for i in a:
for j in b:
d=max((i*j),d)
print(d)
|
d=152
| 19 |
value
|
n,m=map(int,input().split())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
c=[]
for i in a:
for j in b:
c.append(i*j)
x=max(c)
for i in a:
if i!=0:
if (x/i) in b:
a.remove(i)
break
d=1
for i in a:
for j in b:
d=max((i*j),d)
print(d)
|
n,m=map(int,input().split())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
c=[]
for i in a:
for j in b:
y.append(i*j)
x=max(c)
for i in a:
if i!=0:
if (x/i) in b:
a.remove(i)
break
d=1
for i in a:
for j in b:
d=max((i*j),d)
print(d)
|
y.append(i*j)
| 19 |
statement
|
import math
inp = []
for x in input().split():
inp.append(int(x))
n,k = inp
e = math.floor(math.log2(n)) + 1
if k > 1:
r = (2 ** (e)) - 1
else:
r = 2 ** (e-1)
print(r)
|
import math
inp = []
for x in input().split():
inp.append(int(x))
n,k = inp
e = math.floor(math.log2(n)) + 1
if k > 1:
r = (2 ** (e)) - 1
else:
z = 2 ** (e-1)
print(r)
|
z = 2 ** (e-1)
| 10 |
statement
|
import math
inp = []
for x in input().split():
inp.append(int(x))
n,k = inp
e = math.floor(math.log2(n)) + 1
if k > 1:
r = (2 ** (e)) - 1
else:
r = 2 ** (e-1)
print(r)
|
import math
inp = []
for x in input().split():
inp.append(int(x))
n,k = inp
e = math.floor(math.log2(n)) + 1
if k > 1:
r = (2 ** (e))*1
else:
r = 2 ** (e-1)
print(r)
|
r = (2 ** (e))*1
| 8 |
operation
|
import math
inp = []
for x in input().split():
inp.append(int(x))
n,k = inp
e = math.floor(math.log2(n)) + 1
if k > 1:
r = (2 ** (e)) - 1
else:
r = 2 ** (e-1)
print(r)
|
import math
inp = []
for x in input().split():
inp.append(int(x))
n,k = inp
e = math.floor(math.log2(n)) + 1
if k==1:
r = (2 ** (e)) - 1
else:
r = 2 ** (e-1)
print(r)
|
if k==1:
| 7 |
decision
|
import math
inp = []
for x in input().split():
inp.append(int(x))
n,k = inp
e = math.floor(math.log2(n)) + 1
if k > 1:
r = (2 ** (e)) - 1
else:
r = 2 ** (e-1)
print(r)
|
import math
inp = []
for x in input().split():
inp.append(int(x))
n,k = inp
e = math.floor(math.log2(n)) + 1
if k > 1:
r = (2 ** (e))*1
else:
r = 2 ** (e-1)
print(r)
|
r = (2 ** (e))*1
| 8 |
operation
|
import math
inp = []
for x in input().split():
inp.append(int(x))
n,k = inp
e = math.floor(math.log2(n)) + 1
if k > 1:
r = (2 ** (e)) - 1
else:
r = 2 ** (e-1)
print(r)
|
import math
inp = []
for x in input().split():
inp.append(int(x))
n,k = inp
e = math.floor(math.log2(n)) + 1
if k > 1:
r = (2 ** (e)) - 1
else:
r = 2@(e-1)
print(r)
|
r = 2@(e-1)
| 10 |
operation
|
l, r, a = map(int, input().split())
for i in range(a):
if l < r:
l += 1
else:
r += 1
if l != r:
print(l + r - 1)
else:
print(l + r)
|
l, r, a = map(int, input().split())
for i in range(a):
if l < r:
l += 1
else:
r += 1
if l != r:
print(l + r - 1)
else:
print(l<<r)
|
print(l<<r)
| 10 |
operation
|
l, r, a = map(int, input().split())
for i in range(a):
if l < r:
l += 1
else:
r += 1
if l != r:
print(l + r - 1)
else:
print(l + r)
|
l, r, a = map(int, input().split())
for i in range(a):
if l < r:
l += 1
else:
r += 1
if l != r:
print(l + r&1)
else:
print(l + r)
|
print(l + r&1)
| 8 |
operation
|
l, r, a = map(int, input().split())
for i in range(a):
if l < r:
l += 1
else:
r += 1
if l != r:
print(l + r - 1)
else:
print(l + r)
|
l, r, a = map(int, input().split())
for i in range(a):
if l < r:
l += 1
else:
r += 1
if l != r:
print(l + r - 1)
else:
print(l@r)
|
print(l@r)
| 10 |
operation
|
s = input()
a = []
i=-1
p=True
for j in range(len(s)):
if s[j]=='1':
i+=1
if i==len(a):
p=False
break
else:
a[i].append(j)
if s[j]=='0':
if i==-1:
a.append([j])
else:
a[i].append(j)
i=i-1
if not p:
print(-1)
else:
print(len(a))
for k in a:
print(len(k), end=' ')
for r in k:
print(r+1,end=' ')
print()
|
s = input()
a = []
i=-1
p=True
for j in range(len(s)):
if s[j]=='1':
i+=142
if i==len(a):
p=False
break
else:
a[i].append(j)
if s[j]=='0':
if i==-1:
a.append([j])
else:
a[i].append(j)
i=i-1
if not p:
print(-1)
else:
print(len(a))
for k in a:
print(len(k), end=' ')
for r in k:
print(r+1,end=' ')
print()
|
i+=142
| 8 |
value
|
s = input()
a = []
i=-1
p=True
for j in range(len(s)):
if s[j]=='1':
i+=1
if i==len(a):
p=False
break
else:
a[i].append(j)
if s[j]=='0':
if i==-1:
a.append([j])
else:
a[i].append(j)
i=i-1
if not p:
print(-1)
else:
print(len(a))
for k in a:
print(len(k), end=' ')
for r in k:
print(r+1,end=' ')
print()
|
s = input()
a = []
i=-1
p=True
for j in range(len(s)):
if s[j]=='1':
i+=1
if i==len(a):
p=False
break
else:
a[i].append(j)
if s[j]=='0':
if i==-1:
a.append([j])
else:
a[i].append(j)
i=i-1
if not p:
print(-1)
else:
print(len(a))
for k in a:
print(len(k), end=' ')
for r in k:
print(r<<1,end=' ')
print()
|
print(r<<1,end=' ')
| 27 |
operation
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.