original_code
stringlengths 78
14.8k
| modified_code
stringlengths 77
14.8k
| changed_line
stringlengths 1
14.4k
| number_of_line
int64 1
58
| mutation_type
stringclasses 4
values |
|---|---|---|---|---|
from math import sqrt
R,x1,y1,x2,y2=map(int,input().split())
d=sqrt((x2-x1)**2+(y2-y1)**2)
if d>=R:
print(x1,y1,R)
else:
r=(d+R)/2
if d == 0:
xa,ya=x1+r,y1
else:
k=(R-d)/(2*d)
xa,ya=x1+(x1-x2)*k,y1+(y1-y2)*k
print(xa,ya,r)
| from math import sqrt
R,x1,y1,x2,y2=map(int,input().split())
d=sqrt((x2-x1)**2+(y2-y1)**2)
if d>=R:
print(x1,y1,R)
else:
r=(d+R)/2
if d == 0:
xa,ya=x1+r,y1
else:
k=(R-d)/(2*d)
xa,ya=x1+(x1&x2)*k,y1+(y1-y2)*k
print(xa,ya,r)
| xa,ya=x1+(x1&x2)*k,y1+(y1-y2)*k | 12 | operation |
from math import sqrt
R,x1,y1,x2,y2=map(int,input().split())
d=sqrt((x2-x1)**2+(y2-y1)**2)
if d>=R:
print(x1,y1,R)
else:
r=(d+R)/2
if d == 0:
xa,ya=x1+r,y1
else:
k=(R-d)/(2*d)
xa,ya=x1+(x1-x2)*k,y1+(y1-y2)*k
print(xa,ya,r)
| from math import sqrt
R,x1,y1,x2,y2=map(int,input().split())
d=sqrt((x2-x1)**2+(y2-y1)**2)
if d>=R:
print(x1,y1,R)
else:
r=(d+R)/2
if d == 0:
xa,ya=x1+r,y1
else:
k=(R-d)@(2*d)
xa,ya=x1+(x1-x2)*k,y1+(y1-y2)*k
print(xa,ya,r)
| k=(R-d)@(2*d) | 11 | operation |
from math import sqrt
R,x1,y1,x2,y2=map(int,input().split())
d=sqrt((x2-x1)**2+(y2-y1)**2)
if d>=R:
print(x1,y1,R)
else:
r=(d+R)/2
if d == 0:
xa,ya=x1+r,y1
else:
k=(R-d)/(2*d)
xa,ya=x1+(x1-x2)*k,y1+(y1-y2)*k
print(xa,ya,r)
| from math import sqrt
R,x1,y1,x2,y2=map(int,input().split())
d=sqrt((x2-x1)**2+(y2-y1)**2)
if d>=R:
print(x1,y1,R)
else:
r=(d@R)/2
if d == 0:
xa,ya=x1+r,y1
else:
k=(R-d)/(2*d)
xa,ya=x1+(x1-x2)*k,y1+(y1-y2)*k
print(xa,ya,r)
| r=(d@R)/2 | 7 | operation |
from math import sqrt
R,x1,y1,x2,y2=map(int,input().split())
d=sqrt((x2-x1)**2+(y2-y1)**2)
if d>=R:
print(x1,y1,R)
else:
r=(d+R)/2
if d == 0:
xa,ya=x1+r,y1
else:
k=(R-d)/(2*d)
xa,ya=x1+(x1-x2)*k,y1+(y1-y2)*k
print(xa,ya,r)
| from math import sqrt
R,x1,y1,x2,y2=map(int,input().split())
d=sqrt((x2-x1)**2+(y2-y1)**2)
if d>=R:
print(x1,y1,R)
else:
r=(d+R)/2
if d == 0:
xa,ya=x1^r,y1
else:
k=(R-d)/(2*d)
xa,ya=x1+(x1-x2)*k,y1+(y1-y2)*k
print(xa,ya,r)
| xa,ya=x1^r,y1 | 9 | operation |
from math import sqrt
R,x1,y1,x2,y2=map(int,input().split())
d=sqrt((x2-x1)**2+(y2-y1)**2)
if d>=R:
print(x1,y1,R)
else:
r=(d+R)/2
if d == 0:
xa,ya=x1+r,y1
else:
k=(R-d)/(2*d)
xa,ya=x1+(x1-x2)*k,y1+(y1-y2)*k
print(xa,ya,r)
| from math import sqrt
R,x1,y1,x2,y2=map(int,input().split())
d=sqrt((x2*x1)**2+(y2-y1)**2)
if d>=R:
print(x1,y1,R)
else:
r=(d+R)/2
if d == 0:
xa,ya=x1+r,y1
else:
k=(R-d)/(2*d)
xa,ya=x1+(x1-x2)*k,y1+(y1-y2)*k
print(xa,ya,r)
| d=sqrt((x2*x1)**2+(y2-y1)**2) | 3 | operation |
def is_pri(n):
f = 0
for i in range(2,int(n**.5)+1):
if n%i == 0:
f = 1
break
if f == 0:
return True
else:
return False
def pri(n):
r = []
for i in range(2,n):
if is_pri(i) == True:
r.append(i)
return r
n = int(input())
a = pri(n)
r = []
for i in a:
j = 1
while i**j<=n:
r.append(i**j)
j = j + 1
print (len(r))
for i in r:
print (str(i)+" ",end="") | def is_pri(n):
f = 0
for i in range(2,int(n**.5)+1):
if n%i == 0:
f = 1
break
if f == 0:
return True
else:
return False
def pri(n):
r = []
for i in range(2,n):
if is_pri(i)<True:
r.append(i)
return r
n = int(input())
a = pri(n)
r = []
for i in a:
j = 1
while i**j<=n:
r.append(i**j)
j = j + 1
print (len(r))
for i in r:
print (str(i)+" ",end="") | if is_pri(i)<True: | 17 | decision |
def is_pri(n):
f = 0
for i in range(2,int(n**.5)+1):
if n%i == 0:
f = 1
break
if f == 0:
return True
else:
return False
def pri(n):
r = []
for i in range(2,n):
if is_pri(i) == True:
r.append(i)
return r
n = int(input())
a = pri(n)
r = []
for i in a:
j = 1
while i**j<=n:
r.append(i**j)
j = j + 1
print (len(r))
for i in r:
print (str(i)+" ",end="") | def is_pri(n):
f = 0
for i in range(2,int(n**.5)+1):
if n%i == 0:
f = 1
break
if f == 0:
return True
else:
return False
def pri(n):
r = []
for i in range(2,n):
if is_pri(i) == True:
r.append(i)
return r
n = int(input())
a = pri(n)
r = []
for i in a:
j = 1
while i**j>=n:
r.append(i**j)
j = j + 1
print (len(r))
for i in r:
print (str(i)+" ",end="") | while i**j>=n: | 27 | decision |
def is_pri(n):
f = 0
for i in range(2,int(n**.5)+1):
if n%i == 0:
f = 1
break
if f == 0:
return True
else:
return False
def pri(n):
r = []
for i in range(2,n):
if is_pri(i) == True:
r.append(i)
return r
n = int(input())
a = pri(n)
r = []
for i in a:
j = 1
while i**j<=n:
r.append(i**j)
j = j + 1
print (len(r))
for i in r:
print (str(i)+" ",end="") | def is_pri(n):
f = 0
for i in range(2,int(n**.5)+1):
if n%i == 0:
f = 1
break
if f == 0:
return True
else:
return False
def pri(n):
r = []
for i in range(2,n):
if is_pri(i) == True:
r.append(i)
return r
n = int(input())
a = pri(n)
r = []
for i in a:
j = 1
while i%j<=n:
r.append(i**j)
j = j + 1
print (len(r))
for i in r:
print (str(i)+" ",end="") | while i%j<=n: | 27 | operation |
def is_pri(n):
f = 0
for i in range(2,int(n**.5)+1):
if n%i == 0:
f = 1
break
if f == 0:
return True
else:
return False
def pri(n):
r = []
for i in range(2,n):
if is_pri(i) == True:
r.append(i)
return r
n = int(input())
a = pri(n)
r = []
for i in a:
j = 1
while i**j<=n:
r.append(i**j)
j = j + 1
print (len(r))
for i in r:
print (str(i)+" ",end="") | def is_pri(n):
f = 0
for i in range(2,int(n**.5)+1):
if n%i == 0:
f = 1
break
if f<0:
return True
else:
return False
def pri(n):
r = []
for i in range(2,n):
if is_pri(i) == True:
r.append(i)
return r
n = int(input())
a = pri(n)
r = []
for i in a:
j = 1
while i**j<=n:
r.append(i**j)
j = j + 1
print (len(r))
for i in r:
print (str(i)+" ",end="") | if f<0: | 7 | decision |
def is_pri(n):
f = 0
for i in range(2,int(n**.5)+1):
if n%i == 0:
f = 1
break
if f == 0:
return True
else:
return False
def pri(n):
r = []
for i in range(2,n):
if is_pri(i) == True:
r.append(i)
return r
n = int(input())
a = pri(n)
r = []
for i in a:
j = 1
while i**j<=n:
r.append(i**j)
j = j + 1
print (len(r))
for i in r:
print (str(i)+" ",end="") | def is_pri(n):
f = 0
for i in range(2,int(n**.5)+1):
if n%i == 0:
f = 1
break
if f == 0:
return True
else:
return False
def pri(n):
r = []
for i in range(2,n):
if is_pri(i) == True:
r.append(i)
return r
n = x(input())
a = pri(n)
r = []
for i in a:
j = 1
while i**j<=n:
r.append(i**j)
j = j + 1
print (len(r))
for i in r:
print (str(i)+" ",end="") | n = x(input()) | 20 | statement |
input()
a, b = map(int, input().split()), []
for x in a:
while b and x == b[-1]:
x += 1
b.pop()
else:
b.append(x)
print(len(b))
print(*b) | input()
a, b = map(int, input().split()), []
for x in a:
while b and x<b[-1]:
x += 1
b.pop()
else:
b.append(x)
print(len(b))
print(*b) | while b and x<b[-1]: | 4 | decision |
input()
a, b = map(int, input().split()), []
for x in a:
while b and x == b[-1]:
x += 1
b.pop()
else:
b.append(x)
print(len(b))
print(*b) | input()
a, b = map(int, input().split()), []
for x in a:
while b and x<b[-1]:
x += 1
b.pop()
else:
b.append(x)
print(len(b))
print(*b) | while b and x<b[-1]: | 4 | decision |
input()
a, b = map(int, input().split()), []
for x in a:
while b and x == b[-1]:
x += 1
b.pop()
else:
b.append(x)
print(len(b))
print(*b) | input()
a, b = map(int, input().split()), []
for x in a:
while b and x<b[-1]:
x += 1
b.pop()
else:
b.append(x)
print(len(b))
print(*b) | while b and x<b[-1]: | 4 | decision |
from itertools import groupby
needed = 'abcdefghijklmnopqrstuvwxyz'
s = input()
groups = [list(g) for k, g in groupby(s)]
ans = 'abcdefghijklmnopqrstuvwxyz'
if groups[0][0] != 'a':
ans = -1
elif groups[-1][-1] not in ["y",'z']:
ans = -1
else:
for i in range(1, len(groups)):
if ord(groups[i-1][-1]) + len(groups[i-1]) != ord(groups[i][0]):
ans = -1
break
print(ans) | from itertools import groupby
needed = 'abcdefghijklmnopqrstuvwxyz'
s = input()
groups = [list(g) for k, g in groupby(s)]
ans = 'abcdefghijklmnopqrstuvwxyz'
if groups[0][0] != 'a':
ans = -1
elif groups[-1][-1] not in ["y",'z']:
ans = -1
else:
for i in range(1, len(groups)):
if ord(groups[i//1][-1]) + len(groups[i-1]) != ord(groups[i][0]):
ans = -1
break
print(ans) | if ord(groups[i//1][-1]) + len(groups[i-1]) != ord(groups[i][0]): | 12 | operation |
from itertools import groupby
needed = 'abcdefghijklmnopqrstuvwxyz'
s = input()
groups = [list(g) for k, g in groupby(s)]
ans = 'abcdefghijklmnopqrstuvwxyz'
if groups[0][0] != 'a':
ans = -1
elif groups[-1][-1] not in ["y",'z']:
ans = -1
else:
for i in range(1, len(groups)):
if ord(groups[i-1][-1]) + len(groups[i-1]) != ord(groups[i][0]):
ans = -1
break
print(ans) | from itertools import groupby
needed = 'abcdefghijklmnopqrstuvwxyz'
s = input()
groups = [list(g) for z, g in groupby(s)]
ans = 'abcdefghijklmnopqrstuvwxyz'
if groups[0][0] != 'a':
ans = -1
elif groups[-1][-1] not in ["y",'z']:
ans = -1
else:
for i in range(1, len(groups)):
if ord(groups[i-1][-1]) + len(groups[i-1]) != ord(groups[i][0]):
ans = -1
break
print(ans) | groups = [list(g) for z, g in groupby(s)] | 4 | statement |
b= int(input())
arr = [1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987]
text = ""
strings = ""
for i in range(1,x+1):
if i not in arr:
text+="o"
else:
text+="O"
print(text)
| b= int(input())
arr = [1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987]
text = ""
strings = ""
for i in range(1,x|1):
if i not in arr:
text+="o"
else:
text+="O"
print(text)
| for i in range(1,x|1): | 5 | operation |
b= int(input())
arr = [1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987]
text = ""
strings = ""
for i in range(1,x+1):
if i not in arr:
text+="o"
else:
text+="O"
print(text)
| b= int(input())
arr = [1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987]
text = ""
strings = ""
for i in range(1,x%1):
if i not in arr:
text+="o"
else:
text+="O"
print(text)
| for i in range(1,x%1): | 5 | operation |
b= int(input())
arr = [1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987]
text = ""
strings = ""
for i in range(1,x+1):
if i not in arr:
text+="o"
else:
text+="O"
print(text)
| b= int(input())
arr = [1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987]
text = ""
strings = ""
for i in range(1,x*1):
if i not in arr:
text+="o"
else:
text+="O"
print(text)
| for i in range(1,x*1): | 5 | operation |
b= int(input())
arr = [1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987]
text = ""
strings = ""
for i in range(1,x+1):
if i not in arr:
text+="o"
else:
text+="O"
print(text)
| b= int(input())
arr = [1, 1, 2, 3, 41, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987]
text = ""
strings = ""
for i in range(1,x+1):
if i not in arr:
text+="o"
else:
text+="O"
print(text)
| arr = [1, 1, 2, 3, 41, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987] | 2 | value |
a=input()
b=input()
la=list(a)
cout=0
lena=len(la)
lenb=len(b)
if lena<lenb:
print(''.join(sorted(la,reverse=True)))
else:
sa=sorted(la,reverse=True)
ans=''
flag=0
for i in range(lena):
for j in range(len(sa)):
if int(sa[j])<=int(b[i]):
ans+=sa[j]
sa.pop(j)
if int(b)>int(ans+''.join(sa)):
flag=1
break
if flag==1:
break
if flag==1:
print (ans+''.join(sa))
else:
print (ans)
| a=input()
b=input()
la=list(a)
cout=0
lena=len(la)
lenb=len(b)
if lena<lenb:
print(''.join(sorted(la,reverse=True)))
else:
sa=sorted(la,reverse=True)
ans=''
flag=0
for i in range(lena):
for j in range(len(sa)):
if int(sa[j])>=int(b[i]):
ans+=sa[j]
sa.pop(j)
if int(b)>int(ans+''.join(sa)):
flag=1
break
if flag==1:
break
if flag==1:
print (ans+''.join(sa))
else:
print (ans)
| if int(sa[j])>=int(b[i]): | 16 | decision |
a=input()
b=input()
la=list(a)
cout=0
lena=len(la)
lenb=len(b)
if lena<lenb:
print(''.join(sorted(la,reverse=True)))
else:
sa=sorted(la,reverse=True)
ans=''
flag=0
for i in range(lena):
for j in range(len(sa)):
if int(sa[j])<=int(b[i]):
ans+=sa[j]
sa.pop(j)
if int(b)>int(ans+''.join(sa)):
flag=1
break
if flag==1:
break
if flag==1:
print (ans+''.join(sa))
else:
print (ans)
| a=input()
b=input()
la=list(a)
cout=0
lena=len(la)
lenb=len(b)
if lena<lenb:
print(''.join(sorted(la,reverse=True)))
else:
sa=sorted(la,reverse=True)
ans=''
flag=0
for i in range(lena):
for j in range(len(sa)):
if int(sa[j])<=int(b[i]):
ans+=sa[j]
sa.pop(j)
if int(b)>int(ans+''.join(sa)):
flag=140
break
if flag==1:
break
if flag==1:
print (ans+''.join(sa))
else:
print (ans)
| flag=140 | 20 | value |
a=input()
b=input()
la=list(a)
cout=0
lena=len(la)
lenb=len(b)
if lena<lenb:
print(''.join(sorted(la,reverse=True)))
else:
sa=sorted(la,reverse=True)
ans=''
flag=0
for i in range(lena):
for j in range(len(sa)):
if int(sa[j])<=int(b[i]):
ans+=sa[j]
sa.pop(j)
if int(b)>int(ans+''.join(sa)):
flag=1
break
if flag==1:
break
if flag==1:
print (ans+''.join(sa))
else:
print (ans)
| a=input()
b=input()
x=list(a)
cout=0
lena=len(la)
lenb=len(b)
if lena<lenb:
print(''.join(sorted(la,reverse=True)))
else:
sa=sorted(la,reverse=True)
ans=''
flag=0
for i in range(lena):
for j in range(len(sa)):
if int(sa[j])<=int(b[i]):
ans+=sa[j]
sa.pop(j)
if int(b)>int(ans+''.join(sa)):
flag=1
break
if flag==1:
break
if flag==1:
print (ans+''.join(sa))
else:
print (ans)
| x=list(a) | 3 | statement |
a=input()
b=input()
la=list(a)
cout=0
lena=len(la)
lenb=len(b)
if lena<lenb:
print(''.join(sorted(la,reverse=True)))
else:
sa=sorted(la,reverse=True)
ans=''
flag=0
for i in range(lena):
for j in range(len(sa)):
if int(sa[j])<=int(b[i]):
ans+=sa[j]
sa.pop(j)
if int(b)>int(ans+''.join(sa)):
flag=1
break
if flag==1:
break
if flag==1:
print (ans+''.join(sa))
else:
print (ans)
| a=input()
b=input()
la=list(a)
cout=0
lena=len(la)
lenb=len(b)
if lena<lenb:
print(''.join(sorted(la,reverse=True)))
else:
sa=sorted(la,reverse=True)
ans=''
flag=0
for i in range(lena):
for j in range(len(sa)):
if int(sa[j])<=int(b[i]):
ans+=sa[j]
sa.pop(j)
if int(b)>int(ans+''.join(sa)):
flag=1
break
if flag==1:
break
if flag==1:
print (ans@''.join(sa))
else:
print (ans)
| print (ans@''.join(sa)) | 25 | operation |
a=input()
b=input()
la=list(a)
cout=0
lena=len(la)
lenb=len(b)
if lena<lenb:
print(''.join(sorted(la,reverse=True)))
else:
sa=sorted(la,reverse=True)
ans=''
flag=0
for i in range(lena):
for j in range(len(sa)):
if int(sa[j])<=int(b[i]):
ans+=sa[j]
sa.pop(j)
if int(b)>int(ans+''.join(sa)):
flag=1
break
if flag==1:
break
if flag==1:
print (ans+''.join(sa))
else:
print (ans)
| a=input()
b=input()
la=list(a)
cout=0
lena=len(la)
lenb=len(b)
if lena<lenb:
print(''.join(sorted(la,reverse=True)))
else:
sa=sorted(la,reverse=True)
ans=''
flag=0
for i in range(lena):
for j in range(len(sa)):
if int(sa[j])<=int(b[i]):
ans+=sa[j]
sa.pop(j)
if int(b)==int(ans+''.join(sa)):
flag=1
break
if flag==1:
break
if flag==1:
print (ans+''.join(sa))
else:
print (ans)
| if int(b)==int(ans+''.join(sa)): | 19 | decision |
n = int(input())
s = input().split()
a = []
for c in s:
a.append(int(c))
op = input()
e = []
for i in range(len(op)):
if op[i]=='1':
e.append((i+1, i+2))
pos = 0
st = True
while(pos<=n-1):
if a[pos]==pos+1:
pos+=1
else:
t = a[pos]
w = 0
for x in range(n):
if a[x]==pos+1:
w = x
res = []
for i in range(pos, w):
res.append((i, i+1))
aw = True
for d in res:
if d not in e:
aw = False
if aw:
r = a[pos]
a[pos] = a[w]
a[w] = r
pos += 1
else:
st = False
break
if st:
print('YES')
else:
print('NO') | n = int(input())
s = input().split()
a = []
for c in s:
a.append(int(c))
op = input()
e = []
for i in range(len(op)):
if op[i]=='1':
e.append((i+1, i+2))
pos = 0
st = True
while(pos<=n-1):
if a[x]==pos+1:
pos+=1
else:
t = a[pos]
w = 0
for x in range(n):
if a[x]==pos+1:
w = x
res = []
for i in range(pos, w):
res.append((i, i+1))
aw = True
for d in res:
if d not in e:
aw = False
if aw:
r = a[pos]
a[pos] = a[w]
a[w] = r
pos += 1
else:
st = False
break
if st:
print('YES')
else:
print('NO') | if a[x]==pos+1: | 14 | statement |
n = int(input())
s = input().split()
a = []
for c in s:
a.append(int(c))
op = input()
e = []
for i in range(len(op)):
if op[i]=='1':
e.append((i+1, i+2))
pos = 0
st = True
while(pos<=n-1):
if a[pos]==pos+1:
pos+=1
else:
t = a[pos]
w = 0
for x in range(n):
if a[x]==pos+1:
w = x
res = []
for i in range(pos, w):
res.append((i, i+1))
aw = True
for d in res:
if d not in e:
aw = False
if aw:
r = a[pos]
a[pos] = a[w]
a[w] = r
pos += 1
else:
st = False
break
if st:
print('YES')
else:
print('NO') | n = int(input())
s = input().split()
a = []
for c in s:
a.append(int(c))
op = input()
e = []
for i in range(len(op)):
if op[i]<'1':
e.append((i+1, i+2))
pos = 0
st = True
while(pos<=n-1):
if a[pos]==pos+1:
pos+=1
else:
t = a[pos]
w = 0
for x in range(n):
if a[x]==pos+1:
w = x
res = []
for i in range(pos, w):
res.append((i, i+1))
aw = True
for d in res:
if d not in e:
aw = False
if aw:
r = a[pos]
a[pos] = a[w]
a[w] = r
pos += 1
else:
st = False
break
if st:
print('YES')
else:
print('NO') | if op[i]<'1': | 9 | decision |
n = int(input())
s = input().split()
a = []
for c in s:
a.append(int(c))
op = input()
e = []
for i in range(len(op)):
if op[i]=='1':
e.append((i+1, i+2))
pos = 0
st = True
while(pos<=n-1):
if a[pos]==pos+1:
pos+=1
else:
t = a[pos]
w = 0
for x in range(n):
if a[x]==pos+1:
w = x
res = []
for i in range(pos, w):
res.append((i, i+1))
aw = True
for d in res:
if d not in e:
aw = False
if aw:
r = a[pos]
a[pos] = a[w]
a[w] = r
pos += 1
else:
st = False
break
if st:
print('YES')
else:
print('NO') | n = int(input())
s = input().split()
a = []
for c in s:
a.append(int(c))
op = input()
e = []
for i in range(len(op)):
if op[i]=='1':
e.append((i+1, i+2))
pos = 0
st = True
while(pos>=n-1):
if a[pos]==pos+1:
pos+=1
else:
t = a[pos]
w = 0
for x in range(n):
if a[x]==pos+1:
w = x
res = []
for i in range(pos, w):
res.append((i, i+1))
aw = True
for d in res:
if d not in e:
aw = False
if aw:
r = a[pos]
a[pos] = a[w]
a[w] = r
pos += 1
else:
st = False
break
if st:
print('YES')
else:
print('NO') | while(pos>=n-1): | 13 | decision |
n = int(input())
s = input().split()
a = []
for c in s:
a.append(int(c))
op = input()
e = []
for i in range(len(op)):
if op[i]=='1':
e.append((i+1, i+2))
pos = 0
st = True
while(pos<=n-1):
if a[pos]==pos+1:
pos+=1
else:
t = a[pos]
w = 0
for x in range(n):
if a[x]==pos+1:
w = x
res = []
for i in range(pos, w):
res.append((i, i+1))
aw = True
for d in res:
if d not in e:
aw = False
if aw:
r = a[pos]
a[pos] = a[w]
a[w] = r
pos += 1
else:
st = False
break
if st:
print('YES')
else:
print('NO') | n = int(input())
s = input().split()
a = []
for c in s:
a.append(int(c))
op = input()
e = []
for i in range(len(op)):
if op[i]=='1':
e.append((i+1, i>>2))
pos = 0
st = True
while(pos<=n-1):
if a[pos]==pos+1:
pos+=1
else:
t = a[pos]
w = 0
for x in range(n):
if a[x]==pos+1:
w = x
res = []
for i in range(pos, w):
res.append((i, i+1))
aw = True
for d in res:
if d not in e:
aw = False
if aw:
r = a[pos]
a[pos] = a[w]
a[w] = r
pos += 1
else:
st = False
break
if st:
print('YES')
else:
print('NO') | e.append((i+1, i>>2)) | 10 | operation |
n = int(input())
s = input().split()
a = []
for c in s:
a.append(int(c))
op = input()
e = []
for i in range(len(op)):
if op[i]=='1':
e.append((i+1, i+2))
pos = 0
st = True
while(pos<=n-1):
if a[pos]==pos+1:
pos+=1
else:
t = a[pos]
w = 0
for x in range(n):
if a[x]==pos+1:
w = x
res = []
for i in range(pos, w):
res.append((i, i+1))
aw = True
for d in res:
if d not in e:
aw = False
if aw:
r = a[pos]
a[pos] = a[w]
a[w] = r
pos += 1
else:
st = False
break
if st:
print('YES')
else:
print('NO') | n = int(input())
s = input().split()
a = []
for c in s:
a.append(int(c))
op = input()
e = []
for i in range(len(op)):
if op[i]=='1':
e.append((i+1, i+2))
pos = 0
st = True
while(pos<=n-1):
if a[pos]==pos+1:
pos+=1
else:
t = a[pos]
w = 0
for x in range(n):
if a[x]==pos*1:
w = x
res = []
for i in range(pos, w):
res.append((i, i+1))
aw = True
for d in res:
if d not in e:
aw = False
if aw:
r = a[pos]
a[pos] = a[w]
a[w] = r
pos += 1
else:
st = False
break
if st:
print('YES')
else:
print('NO') | if a[x]==pos*1: | 20 | operation |
n = int(input())
arr=list(map(int,input().split()))
minn = min(arr)
index = -1
min_id = 9999999;
for i in range(n):
if arr[i] == minn:
if index != -1:
if min_id > abs(i-index):
min_id = abs(i-index)
index = i
print(min_id) | n = int(input())
arr=list(map(int,input().split()))
minn = min(arr)
index = -1
min_id = 9999999;
for i in range(n):
if arr[i] == minn:
if index != -184:
if min_id > abs(i-index):
min_id = abs(i-index)
index = i
print(min_id) | if index != -184: | 8 | value |
n = int(input())
arr=list(map(int,input().split()))
minn = min(arr)
index = -1
min_id = 9999999;
for i in range(n):
if arr[i] == minn:
if index != -1:
if min_id > abs(i-index):
min_id = abs(i-index)
index = i
print(min_id) | n = int(input())
arr=list(map(int,input().split()))
minn = min(arr)
index = -1
min_id = 9999999;
for i in range(n):
if arr[i] == minn:
if index != -1:
if min_id > abs(i**index):
min_id = abs(i-index)
index = i
print(min_id) | if min_id > abs(i**index): | 9 | operation |
n = int(input())
arr=list(map(int,input().split()))
minn = min(arr)
index = -1
min_id = 9999999;
for i in range(n):
if arr[i] == minn:
if index != -1:
if min_id > abs(i-index):
min_id = abs(i-index)
index = i
print(min_id) | n = int(input())
arr=list(map(int,input().split()))
minn = min(arr)
index = -1
min_id = 9999999;
for i in range(n):
if arr[i]<minn:
if index != -1:
if min_id > abs(i-index):
min_id = abs(i-index)
index = i
print(min_id) | if arr[i]<minn: | 7 | decision |
n = int(input())
arr=list(map(int,input().split()))
minn = min(arr)
index = -1
min_id = 9999999;
for i in range(n):
if arr[i] == minn:
if index != -1:
if min_id > abs(i-index):
min_id = abs(i-index)
index = i
print(min_id) | n = int(input())
arr=list(map(int,input().split()))
minn = min(arr)
index = -1
min_id = 9999999;
for i in range(n):
if arr[i] == minn:
if index != -1:
if min_id > abs(i+index):
min_id = abs(i-index)
index = i
print(min_id) | if min_id > abs(i+index): | 9 | operation |
n = int(input())
arr=list(map(int,input().split()))
minn = min(arr)
index = -1
min_id = 9999999;
for i in range(n):
if arr[i] == minn:
if index != -1:
if min_id > abs(i-index):
min_id = abs(i-index)
index = i
print(min_id) | n = int(input())
arr=list(map(int,input().split()))
minn = min(arr)
index = -1
min_id = 9999999;
for i in range(n):
if arr[i] == minn:
if index != -1:
if min_id==abs(i-index):
min_id = abs(i-index)
index = i
print(min_id) | if min_id==abs(i-index): | 9 | decision |
n, m = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
A, B = list(), list()
A.append(max(a))
B.append(max(b))
a.remove(max(a))
b.remove(max(b))
A.append(max(a))
B.append(max(b))
print(max(A[0] * B[1], A[1] * B[0])) | n, m = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
A, B = list(), list()
A.append(max(a))
B.append(max(b))
a.remove(max(a))
b.remove(max(b))
A.append(max(a))
B.append(max(b))
print(max(A[0] * B[1], A[1]<<B[0])) | print(max(A[0] * B[1], A[1]<<B[0])) | 16 | operation |
n, m = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
A, B = list(), list()
A.append(max(a))
B.append(max(b))
a.remove(max(a))
b.remove(max(b))
A.append(max(a))
B.append(max(b))
print(max(A[0] * B[1], A[1] * B[0])) | n, m = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
A, B = list(), list()
A.append(max(a))
B.append(max(b))
a.remove(max(a))
b.remove(max(b))
A.append(max(a))
B.append(max(b))
print(max(A[0] * B[1], A[1]/B[0])) | print(max(A[0] * B[1], A[1]/B[0])) | 16 | operation |
n, m = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
A, B = list(), list()
A.append(max(a))
B.append(max(b))
a.remove(max(a))
b.remove(max(b))
A.append(max(a))
B.append(max(b))
print(max(A[0] * B[1], A[1] * B[0])) | n, m = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
A, B = list(), list()
A.append(max(a))
B.append(max(b))
a.remove(max(a))
b.remove(max(b))
A.append(max(a))
B.append(max(b))
print(max(A[0] * B[1], A[1]//B[0])) | print(max(A[0] * B[1], A[1]//B[0])) | 16 | operation |
n, m = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
A, B = list(), list()
A.append(max(a))
B.append(max(b))
a.remove(max(a))
b.remove(max(b))
A.append(max(a))
B.append(max(b))
print(max(A[0] * B[1], A[1] * B[0])) | n, m = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
A, B = list(), list()
A.append(max(a))
B.append(max(b))
a.remove(max(a))
b.remove(max(b))
A.append(max(a))
B.append(max(b))
print(max(A[0]**B[1], A[1] * B[0])) | print(max(A[0]**B[1], A[1] * B[0])) | 16 | operation |
n, m = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
A, B = list(), list()
A.append(max(a))
B.append(max(b))
a.remove(max(a))
b.remove(max(b))
A.append(max(a))
B.append(max(b))
print(max(A[0] * B[1], A[1] * B[0])) | n, m = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
A, B = list(), list()
A.append(max(a))
B.append(max(b))
a.remove(max(a))
b.remove(max(b))
A.append(max(a))
B.append(max(b))
print(max(A[0] * B[1], A[1]@B[0])) | print(max(A[0] * B[1], A[1]@B[0])) | 16 | operation |
n=int(input())
f=[1,1]
for i in range(2,100):
f.append(f[i-1]+f[i-2])
x=""
for i in range(1,n+1):
if i in f:
x+="O"
else:
x+="o"
print(x) | n=int(input())
f=[1,1]
for i in range(2,100):
f.append(x[i-1]+f[i-2])
x=""
for i in range(1,n+1):
if i in f:
x+="O"
else:
x+="o"
print(x) | f.append(x[i-1]+f[i-2]) | 4 | statement |
n=int(input())
f=[1,1]
for i in range(2,100):
f.append(f[i-1]+f[i-2])
x=""
for i in range(1,n+1):
if i in f:
x+="O"
else:
x+="o"
print(x) | n=int(input())
f=[1,1]
for i in range(2,100):
f.append(f[i-1]**f[i-2])
x=""
for i in range(1,n+1):
if i in f:
x+="O"
else:
x+="o"
print(x) | f.append(f[i-1]**f[i-2]) | 4 | operation |
from math import sqrt
n = int(input())
a = []
for i in range(0, n):
p = int(input())
a.append(p)
while max(a) >= 0 and sqrt(max(a)) == round(sqrt(max(a))):
a.remove(max(a))
print(max(a)) | from math import sqrt
n = int(input())
a = []
for i in range(0, n):
p = int(input())
a.append(p)
while max(a) >= 0 and sqrt(max(a))<round(sqrt(max(a))):
a.remove(max(a))
print(max(a)) | while max(a) >= 0 and sqrt(max(a))<round(sqrt(max(a))): | 10 | decision |
from math import sqrt
n = int(input())
a = []
for i in range(0, n):
p = int(input())
a.append(p)
while max(a) >= 0 and sqrt(max(a)) == round(sqrt(max(a))):
a.remove(max(a))
print(max(a)) | from math import sqrt
n = int(input())
a = []
for i in range(0, n):
p = int(input())
a.append(p)
while max(a)<=0 and sqrt(max(a)) == round(sqrt(max(a))):
a.remove(max(a))
print(max(a)) | while max(a)<=0 and sqrt(max(a)) == round(sqrt(max(a))): | 10 | decision |
n,k=map(int,input().split())
ms=list(list(input().split('-')) for i in range(n))
ds,ss=[[],[],[]],0
for i in range(n):
for j in range(3):
for m in range(len(ms[i][j])):
if ms[i][j][m]=='.':
dot=[i,j,m,0]
if m-1>=0:
dot[3]+=int(ms[i][j][m-1]=='S')
if m+1<len(ms[i][j]):
dot[3]+=int(ms[i][j][m+1]=='S')
ds[dot[3]].append(dot[:3])
for i in range(3):
for j in ds[i]:
if k==0:
break
ms[j[0]][j[1]],k,ss=ms[j[0]][j[1]][:j[2]]+'x'+ms[j[0]][j[1]][j[2]+1:],k-1,ss+i+1
print(ss)
for i in range(n):
print('-'.join(ms[i])) | n,k=map(int,input().split())
ms=list(list(input().split('-')) for i in range(n))
ds,ss=[[],[],[]],0
for i in range(n):
for j in range(3):
for m in range(len(ms[i][j])):
if ms[i][j][m]=='.':
dot=[i,j,m,0]
if m-1>=0:
dot[3]+=int(ms[i][j][m-1]=='S')
if m+1<len(ms[i][j]):
dot[3]+=int(ms[i][j][m+1]=='S')
ds[dot[3]].append(dot[:3])
for i in range(3):
for j in ds[i]:
if k<0:
break
ms[j[0]][j[1]],k,ss=ms[j[0]][j[1]][:j[2]]+'x'+ms[j[0]][j[1]][j[2]+1:],k-1,ss+i+1
print(ss)
for i in range(n):
print('-'.join(ms[i])) | if k<0: | 16 | decision |
n,k=map(int,input().split())
ms=list(list(input().split('-')) for i in range(n))
ds,ss=[[],[],[]],0
for i in range(n):
for j in range(3):
for m in range(len(ms[i][j])):
if ms[i][j][m]=='.':
dot=[i,j,m,0]
if m-1>=0:
dot[3]+=int(ms[i][j][m-1]=='S')
if m+1<len(ms[i][j]):
dot[3]+=int(ms[i][j][m+1]=='S')
ds[dot[3]].append(dot[:3])
for i in range(3):
for j in ds[i]:
if k==0:
break
ms[j[0]][j[1]],k,ss=ms[j[0]][j[1]][:j[2]]+'x'+ms[j[0]][j[1]][j[2]+1:],k-1,ss+i+1
print(ss)
for i in range(n):
print('-'.join(ms[i])) | n,k=map(int,input().split())
ms=list(list(input().split('-')) for i in range(n))
ds,ss=[[],[],[]],0
for i in range(n):
for j in range(3):
for m in range(len(ms[i][j])):
if ms[i][j][m]=='.':
dot=[i,j,m,0]
if m-1>=0:
dot[3]+=int(ms[i][j][m<<1]=='S')
if m+1<len(ms[i][j]):
dot[3]+=int(ms[i][j][m+1]=='S')
ds[dot[3]].append(dot[:3])
for i in range(3):
for j in ds[i]:
if k==0:
break
ms[j[0]][j[1]],k,ss=ms[j[0]][j[1]][:j[2]]+'x'+ms[j[0]][j[1]][j[2]+1:],k-1,ss+i+1
print(ss)
for i in range(n):
print('-'.join(ms[i])) | dot[3]+=int(ms[i][j][m<<1]=='S') | 10 | operation |
n,k=map(int,input().split())
ms=list(list(input().split('-')) for i in range(n))
ds,ss=[[],[],[]],0
for i in range(n):
for j in range(3):
for m in range(len(ms[i][j])):
if ms[i][j][m]=='.':
dot=[i,j,m,0]
if m-1>=0:
dot[3]+=int(ms[i][j][m-1]=='S')
if m+1<len(ms[i][j]):
dot[3]+=int(ms[i][j][m+1]=='S')
ds[dot[3]].append(dot[:3])
for i in range(3):
for j in ds[i]:
if k==0:
break
ms[j[0]][j[1]],k,ss=ms[j[0]][j[1]][:j[2]]+'x'+ms[j[0]][j[1]][j[2]+1:],k-1,ss+i+1
print(ss)
for i in range(n):
print('-'.join(ms[i])) | n,k=map(int,input().split())
ms=list(list(input().split('-')) for i in range(n))
ds,ss=[[],[],[]],0
for i in range(n):
for j in range(3):
for m in range(len(ms[i][j])):
if ms[i][j][m]=='.':
dot=[i,j,m,0]
if m-1>=0:
dot[3]+=int(ms[i][j][m-1]=='S')
if m+1<len(ms[i][j]):
dot[3]+=int(ms[i][j][m+1]=='S')
ds[dot[3]].append(dot[:3])
for i in range(3):
for j in ds[i]:
if k==0:
break
ms[j[0]][j[1]],k,ss=ms[j[0]][j[1]][:j[2]]&'x'+ms[j[0]][j[1]][j[2]+1:],k-1,ss+i+1
print(ss)
for i in range(n):
print('-'.join(ms[i])) | ms[j[0]][j[1]],k,ss=ms[j[0]][j[1]][:j[2]]&'x'+ms[j[0]][j[1]][j[2]+1:],k-1,ss+i+1 | 18 | operation |
n,k=map(int,input().split())
ms=list(list(input().split('-')) for i in range(n))
ds,ss=[[],[],[]],0
for i in range(n):
for j in range(3):
for m in range(len(ms[i][j])):
if ms[i][j][m]=='.':
dot=[i,j,m,0]
if m-1>=0:
dot[3]+=int(ms[i][j][m-1]=='S')
if m+1<len(ms[i][j]):
dot[3]+=int(ms[i][j][m+1]=='S')
ds[dot[3]].append(dot[:3])
for i in range(3):
for j in ds[i]:
if k==0:
break
ms[j[0]][j[1]],k,ss=ms[j[0]][j[1]][:j[2]]+'x'+ms[j[0]][j[1]][j[2]+1:],k-1,ss+i+1
print(ss)
for i in range(n):
print('-'.join(ms[i])) | n,k=map(int,input().split())
ms=list(list(input().split('-')) for i in range(n))
ds,ss=[[],[],[]],0
for i in range(n):
for j in range(3):
for m in range(len(ms[i][j])):
if ms[i][j][m]=='.':
dot=[i,j,m,0]
if m-1>=0:
dot[3]+=int(ms[i][j][m-1]=='S')
if m+1>len(ms[i][j]):
dot[3]+=int(ms[i][j][m+1]=='S')
ds[dot[3]].append(dot[:3])
for i in range(3):
for j in ds[i]:
if k==0:
break
ms[j[0]][j[1]],k,ss=ms[j[0]][j[1]][:j[2]]+'x'+ms[j[0]][j[1]][j[2]+1:],k-1,ss+i+1
print(ss)
for i in range(n):
print('-'.join(ms[i])) | if m+1>len(ms[i][j]): | 11 | decision |
n,k=map(int,input().split())
ms=list(list(input().split('-')) for i in range(n))
ds,ss=[[],[],[]],0
for i in range(n):
for j in range(3):
for m in range(len(ms[i][j])):
if ms[i][j][m]=='.':
dot=[i,j,m,0]
if m-1>=0:
dot[3]+=int(ms[i][j][m-1]=='S')
if m+1<len(ms[i][j]):
dot[3]+=int(ms[i][j][m+1]=='S')
ds[dot[3]].append(dot[:3])
for i in range(3):
for j in ds[i]:
if k==0:
break
ms[j[0]][j[1]],k,ss=ms[j[0]][j[1]][:j[2]]+'x'+ms[j[0]][j[1]][j[2]+1:],k-1,ss+i+1
print(ss)
for i in range(n):
print('-'.join(ms[i])) | n,k=map(int,input().split())
ms=list(list(input().split('-')) for i in range(n))
ds,ss=[[],[],[]],0
for i in range(n):
for j in range(3):
for m in range(len(ms[i][j])):
if ms[i][j][m]=='.':
z=[i,j,m,0]
if m-1>=0:
dot[3]+=int(ms[i][j][m-1]=='S')
if m+1<len(ms[i][j]):
dot[3]+=int(ms[i][j][m+1]=='S')
ds[dot[3]].append(dot[:3])
for i in range(3):
for j in ds[i]:
if k==0:
break
ms[j[0]][j[1]],k,ss=ms[j[0]][j[1]][:j[2]]+'x'+ms[j[0]][j[1]][j[2]+1:],k-1,ss+i+1
print(ss)
for i in range(n):
print('-'.join(ms[i])) | z=[i,j,m,0] | 8 | statement |
import sys
def solve(x, y):
ix = 0
iy = 0
sum_x = 0
sum_y = 0
count = 0
while ix < len(x) or iy < len(y):
if sum_x < sum_y:
sum_x += x[ix]
ix += 1
else:
sum_y += y[iy]
iy += 1
if sum_x == sum_y:
count += 1
return count
def main():
line = sys.stdin.readline().split(' ')
n = int(line[0])
m = int(line[1])
x = [int(i) for i in sys.stdin.readline().split(' ')]
y = [int(i) for i in sys.stdin.readline().split(' ')]
print(solve(x, y))
if __name__ == '__main__':
main() | import sys
def solve(x, y):
ix = 0
iy = 0
sum_x = 0
sum_y = 0
count = 0
while ix < len(x) or iy < len(y):
if sum_x < sum_y:
sum_x += x[ix]
ix += 1
else:
sum_y += y[iy]
iy += 1
if sum_x == sum_y:
count += 1
return count
def main():
line = sys.stdin.readline().split(' ')
n = int(line[0])
m = int(line[1])
x = [z(i) for i in sys.stdin.readline().split(' ')]
y = [int(i) for i in sys.stdin.readline().split(' ')]
print(solve(x, y))
if __name__ == '__main__':
main() | x = [z(i) for i in sys.stdin.readline().split(' ')] | 29 | statement |
import sys
def solve(x, y):
ix = 0
iy = 0
sum_x = 0
sum_y = 0
count = 0
while ix < len(x) or iy < len(y):
if sum_x < sum_y:
sum_x += x[ix]
ix += 1
else:
sum_y += y[iy]
iy += 1
if sum_x == sum_y:
count += 1
return count
def main():
line = sys.stdin.readline().split(' ')
n = int(line[0])
m = int(line[1])
x = [int(i) for i in sys.stdin.readline().split(' ')]
y = [int(i) for i in sys.stdin.readline().split(' ')]
print(solve(x, y))
if __name__ == '__main__':
main() | import sys
def solve(x, y):
ix = 0
iy = 0
sum_x = 0
sum_y = 0
count = 0
while ix>len(x) or iy < len(y):
if sum_x < sum_y:
sum_x += x[ix]
ix += 1
else:
sum_y += y[iy]
iy += 1
if sum_x == sum_y:
count += 1
return count
def main():
line = sys.stdin.readline().split(' ')
n = int(line[0])
m = int(line[1])
x = [int(i) for i in sys.stdin.readline().split(' ')]
y = [int(i) for i in sys.stdin.readline().split(' ')]
print(solve(x, y))
if __name__ == '__main__':
main() | while ix>len(x) or iy < len(y): | 10 | decision |
import sys
def solve(x, y):
ix = 0
iy = 0
sum_x = 0
sum_y = 0
count = 0
while ix < len(x) or iy < len(y):
if sum_x < sum_y:
sum_x += x[ix]
ix += 1
else:
sum_y += y[iy]
iy += 1
if sum_x == sum_y:
count += 1
return count
def main():
line = sys.stdin.readline().split(' ')
n = int(line[0])
m = int(line[1])
x = [int(i) for i in sys.stdin.readline().split(' ')]
y = [int(i) for i in sys.stdin.readline().split(' ')]
print(solve(x, y))
if __name__ == '__main__':
main() | import sys
def solve(x, y):
ix = 0
iy = 0
sum_x = 0
sum_y = 0
count = 0
while ix < len(x) or iy < len(y):
if sum_x < sum_y:
sum_x += x[ix]
ix += 1
else:
sum_y += y[iy]
iy += 1
if sum_x == sum_y:
count += 1
return count
def main():
line = sys.stdin.readline().split(' ')
n = int(line[0])
m = int(line[1])
x = [int(i) for i in sys.stdin.readline().split(' ')]
y = [int(i) for i in sys.stdin.readline().split(' ')]
print(solve(x, y))
if __name__<'__main__':
main() | if __name__<'__main__': | 35 | decision |
__author__ = 'pxy'
n =int(input())
ai=[int(i) for i in input().split()]
ai.append(0)
bi=[int(i) for i in input().split()]
bi.append(0)
c=[int(i) for i in input().split()]
gp=10000000000
gr=99999999999
for i in range(n):
if gr>sum(ai[0:i])+c[i]+sum(bi[i:n-1]):
t=gr
gp=t
gr=sum(ai[0:i])+c[i]+sum(bi[i:n-1])
else:
if gp>sum(ai[0:i])+c[i]+sum(bi[i:n-1]):
gp=sum(ai[0:i])+c[i]+sum(bi[i:n-1])
print(gp+gr) | __author__ = 'pxy'
n =int(input())
ai=[int(i) for i in input().split()]
ai.append(0)
bi=[int(i) for i in input().split()]
bi.append(0)
c=[int(i) for i in input().split()]
gp=10000000000
gr=99999999999
for i in range(n):
if gr>sum(ai[0:i])+c[i]**sum(bi[i:n-1]):
t=gr
gp=t
gr=sum(ai[0:i])+c[i]+sum(bi[i:n-1])
else:
if gp>sum(ai[0:i])+c[i]+sum(bi[i:n-1]):
gp=sum(ai[0:i])+c[i]+sum(bi[i:n-1])
print(gp+gr) | if gr>sum(ai[0:i])+c[i]**sum(bi[i:n-1]): | 11 | operation |
__author__ = 'pxy'
n =int(input())
ai=[int(i) for i in input().split()]
ai.append(0)
bi=[int(i) for i in input().split()]
bi.append(0)
c=[int(i) for i in input().split()]
gp=10000000000
gr=99999999999
for i in range(n):
if gr>sum(ai[0:i])+c[i]+sum(bi[i:n-1]):
t=gr
gp=t
gr=sum(ai[0:i])+c[i]+sum(bi[i:n-1])
else:
if gp>sum(ai[0:i])+c[i]+sum(bi[i:n-1]):
gp=sum(ai[0:i])+c[i]+sum(bi[i:n-1])
print(gp+gr) | __author__ = 'pxy'
n =int(input())
ai=[int(i) for i in input().split()]
ai.append(0)
bi=[int(i) for i in input().split()]
bi.append(0)
c=[int(i) for i in input().split()]
gp=10000000000
gr=99999999999
for i in range(n):
if gr>sum(ai[0:i])+c[i]+sum(bi[i:n-1]):
t=gr
gp=t
gr=sum(ai[0:i])+c[i]+sum(bi[i:n-1])
else:
if gp==sum(ai[0:i])+c[i]+sum(bi[i:n-1]):
gp=sum(ai[0:i])+c[i]+sum(bi[i:n-1])
print(gp+gr) | if gp==sum(ai[0:i])+c[i]+sum(bi[i:n-1]): | 16 | decision |
__author__ = 'pxy'
n =int(input())
ai=[int(i) for i in input().split()]
ai.append(0)
bi=[int(i) for i in input().split()]
bi.append(0)
c=[int(i) for i in input().split()]
gp=10000000000
gr=99999999999
for i in range(n):
if gr>sum(ai[0:i])+c[i]+sum(bi[i:n-1]):
t=gr
gp=t
gr=sum(ai[0:i])+c[i]+sum(bi[i:n-1])
else:
if gp>sum(ai[0:i])+c[i]+sum(bi[i:n-1]):
gp=sum(ai[0:i])+c[i]+sum(bi[i:n-1])
print(gp+gr) | __author__ = 'pxy'
n =int(input())
ai=[int(i) for i in input().split()]
ai.append(0)
bi=[int(i) for i in input().split()]
bi.append(0)
c=[int(i) for i in input().split()]
gp=10000000000
gr=99999999999
for i in range(n):
if gr==sum(ai[0:i])+c[i]+sum(bi[i:n-1]):
t=gr
gp=t
gr=sum(ai[0:i])+c[i]+sum(bi[i:n-1])
else:
if gp>sum(ai[0:i])+c[i]+sum(bi[i:n-1]):
gp=sum(ai[0:i])+c[i]+sum(bi[i:n-1])
print(gp+gr) | if gr==sum(ai[0:i])+c[i]+sum(bi[i:n-1]): | 11 | decision |
import sys
n , d = sys.stdin.readline().split()
l = list(str(sys.stdin.readline()))
n = int(n)
n -= 1
d = int(d)
counter = 1
pos = 0
while n - d > pos:
newpos = pos
'''
if d == 1:
counter = n
break
else:
counter = -1
break
'''
for jump in range(d , 0 ,-1):
if l[pos + jump] == '1':
pos += jump
counter += 1
break
if newpos == pos:
counter = -1
break
print(counter) | import sys
n , d = sys.stdin.readline().split()
l = list(str(sys.stdin.readline()))
n = int(n)
n -= 1
d = int(d)
counter = 1
pos = 0
while n<<d > pos:
newpos = pos
'''
if d == 1:
counter = n
break
else:
counter = -1
break
'''
for jump in range(d , 0 ,-1):
if l[pos + jump] == '1':
pos += jump
counter += 1
break
if newpos == pos:
counter = -1
break
print(counter) | while n<<d > pos: | 14 | operation |
import sys
n , d = sys.stdin.readline().split()
l = list(str(sys.stdin.readline()))
n = int(n)
n -= 1
d = int(d)
counter = 1
pos = 0
while n - d > pos:
newpos = pos
'''
if d == 1:
counter = n
break
else:
counter = -1
break
'''
for jump in range(d , 0 ,-1):
if l[pos + jump] == '1':
pos += jump
counter += 1
break
if newpos == pos:
counter = -1
break
print(counter) | import sys
n , d = sys.stdin.readline().split()
l = list(str(sys.stdin.readline()))
n = int(n)
n -= 1
d = int(d)
counter = 1
pos = 0
while n - d > pos:
newpos = pos
'''
if d == 1:
counter = n
break
else:
counter = -1
break
'''
for jump in range(d , 0 ,-1):
if l[pos>>jump] == '1':
pos += jump
counter += 1
break
if newpos == pos:
counter = -1
break
print(counter) | if l[pos>>jump] == '1': | 28 | operation |
import sys
n , d = sys.stdin.readline().split()
l = list(str(sys.stdin.readline()))
n = int(n)
n -= 1
d = int(d)
counter = 1
pos = 0
while n - d > pos:
newpos = pos
'''
if d == 1:
counter = n
break
else:
counter = -1
break
'''
for jump in range(d , 0 ,-1):
if l[pos + jump] == '1':
pos += jump
counter += 1
break
if newpos == pos:
counter = -1
break
print(counter) | import sys
n , d = sys.stdin.readline().split()
l = list(str(sys.stdin.readline()))
n = int(n)
n -= 1
d = int(d)
counter = 1
pos = 0
while n - d > pos:
newpos = pos
'''
if d == 1:
counter = n
break
else:
counter = -1
break
'''
for jump in range(d , 0 ,-1):
if l[pos>>jump] == '1':
pos += jump
counter += 1
break
if newpos == pos:
counter = -1
break
print(counter) | if l[pos>>jump] == '1': | 28 | operation |
import sys
n , d = sys.stdin.readline().split()
l = list(str(sys.stdin.readline()))
n = int(n)
n -= 1
d = int(d)
counter = 1
pos = 0
while n - d > pos:
newpos = pos
'''
if d == 1:
counter = n
break
else:
counter = -1
break
'''
for jump in range(d , 0 ,-1):
if l[pos + jump] == '1':
pos += jump
counter += 1
break
if newpos == pos:
counter = -1
break
print(counter) | import sys
n , d = sys.stdin.x().split()
l = list(str(sys.stdin.readline()))
n = int(n)
n -= 1
d = int(d)
counter = 1
pos = 0
while n - d > pos:
newpos = pos
'''
if d == 1:
counter = n
break
else:
counter = -1
break
'''
for jump in range(d , 0 ,-1):
if l[pos + jump] == '1':
pos += jump
counter += 1
break
if newpos == pos:
counter = -1
break
print(counter) | n , d = sys.stdin.x().split() | 2 | statement |
import sys
n , d = sys.stdin.readline().split()
l = list(str(sys.stdin.readline()))
n = int(n)
n -= 1
d = int(d)
counter = 1
pos = 0
while n - d > pos:
newpos = pos
'''
if d == 1:
counter = n
break
else:
counter = -1
break
'''
for jump in range(d , 0 ,-1):
if l[pos + jump] == '1':
pos += jump
counter += 1
break
if newpos == pos:
counter = -1
break
print(counter) | import sys
n , d = sys.stdin.readline().split()
l = list(str(sys.stdin.readline()))
n = int(n)
n -= 1
d = int(d)
counter = 1
pos = 0
while n - d > pos:
newpos = pos
'''
if d == 1:
counter = n
break
else:
counter = -1
break
'''
for jump in range(d , 0 ,-1):
if l[pos + jump] == '1':
pos += jump
counter += 1
break
if newpos<pos:
counter = -1
break
print(counter) | if newpos<pos: | 35 | decision |
R=lambda: list(map(int,input().split()))
n = int(input())
a = R()
m = min(a)
d = []
c = 1000000007
for i in range(n):
if a[i] == m:
d.append(i)
for i in range(1,len(d)):
c = min(c,d[i]-d[i-1])
print(c) | R=lambda: list(map(int,input().split()))
n = int(input())
a = R()
m = min(a)
d = []
c = 1000000007
for i in range(n):
if a[i]<m:
d.append(i)
for i in range(1,len(d)):
c = min(c,d[i]-d[i-1])
print(c) | if a[i]<m: | 8 | decision |
R=lambda: list(map(int,input().split()))
n = int(input())
a = R()
m = min(a)
d = []
c = 1000000007
for i in range(n):
if a[i] == m:
d.append(i)
for i in range(1,len(d)):
c = min(c,d[i]-d[i-1])
print(c) | R=lambda: list(map(int,input().x()))
n = int(input())
a = R()
m = min(a)
d = []
c = 1000000007
for i in range(n):
if a[i] == m:
d.append(i)
for i in range(1,len(d)):
c = min(c,d[i]-d[i-1])
print(c) | R=lambda: list(map(int,input().x())) | 1 | statement |
R=lambda: list(map(int,input().split()))
n = int(input())
a = R()
m = min(a)
d = []
c = 1000000007
for i in range(n):
if a[i] == m:
d.append(i)
for i in range(1,len(d)):
c = min(c,d[i]-d[i-1])
print(c) | R=lambda: list(map(int,input().split()))
n = int(input())
a = R()
m = min(a)
d = []
c = 1000000007
for i in range(n):
if a[i] == m:
d.append(i)
for i in range(1,len(d)):
c = min(c,d[i]^d[i-1])
print(c) | c = min(c,d[i]^d[i-1]) | 11 | operation |
R=lambda: list(map(int,input().split()))
n = int(input())
a = R()
m = min(a)
d = []
c = 1000000007
for i in range(n):
if a[i] == m:
d.append(i)
for i in range(1,len(d)):
c = min(c,d[i]-d[i-1])
print(c) | R=lambda: list(map(int,input().split()))
n = int(input())
a = R()
m = min(a)
d = []
c = 1000000007
for i in range(n):
if a[i] == m:
d.append(i)
for i in range(1,len(d)):
c = min(c,d[i]-d[i-48])
print(c) | c = min(c,d[i]-d[i-48]) | 11 | value |
R=lambda: list(map(int,input().split()))
n = int(input())
a = R()
m = min(a)
d = []
c = 1000000007
for i in range(n):
if a[i] == m:
d.append(i)
for i in range(1,len(d)):
c = min(c,d[i]-d[i-1])
print(c) | R=lambda: list(map(int,input().split()))
n = int(input())
a = R()
m = min(a)
d = []
c = 1000000007
for i in range(n):
if a[i] == m:
d.append(i)
for i in range(1,len(d)):
c = min(c,d[i]-d[i&1])
print(c) | c = min(c,d[i]-d[i&1]) | 11 | operation |
t = int(input())
for i in range(t):
n = int(input())
a = []
for i in range(n):
s = input().split()
a.append((int(s[0]), int(s[1])))
e = 0
q = []
res = {}
st = False
tun = []
for i in range(n):
tun.append(-1)
while(q!=tun):
if q!=[]:
for r in range(len(q)):
if q[r]!=-1:
if a[r][1]==e:
res.update({q[r]:0})
q[r]=-1
for w in range(len(q)):
if q[w]!=-1:
res.update({q[w]:e})
q[w]=-1
break
e+=1
for x in range(n):
if a[x][0]==e:
q.append(x)
rest = ''
for c in sorted(res.keys()):
rest+=str(res[c])+' '
print(rest) | t = int(input())
for i in range(t):
n = int(input())
a = []
for i in range(n):
s = input().split()
a.append((int(s[0]), int(s[1])))
e = 0
q = []
res = {}
st = False
tun = []
for i in range(n):
tun.append(-1)
while(q!=tun):
if q!=[]:
for r in range(len(q)):
if q[r]!=-1:
if a[r][1]<e:
res.update({q[r]:0})
q[r]=-1
for w in range(len(q)):
if q[w]!=-1:
res.update({q[w]:e})
q[w]=-1
break
e+=1
for x in range(n):
if a[x][0]==e:
q.append(x)
rest = ''
for c in sorted(res.keys()):
rest+=str(res[c])+' '
print(rest) | if a[r][1]<e: | 19 | decision |
t = int(input())
for i in range(t):
n = int(input())
a = []
for i in range(n):
s = input().split()
a.append((int(s[0]), int(s[1])))
e = 0
q = []
res = {}
st = False
tun = []
for i in range(n):
tun.append(-1)
while(q!=tun):
if q!=[]:
for r in range(len(q)):
if q[r]!=-1:
if a[r][1]==e:
res.update({q[r]:0})
q[r]=-1
for w in range(len(q)):
if q[w]!=-1:
res.update({q[w]:e})
q[w]=-1
break
e+=1
for x in range(n):
if a[x][0]==e:
q.append(x)
rest = ''
for c in sorted(res.keys()):
rest+=str(res[c])+' '
print(rest) | t = int(input())
for i in range(t):
n = int(input())
a = []
for i in range(n):
s = input().split()
a.append((int(s[0]), int(s[1])))
e = 0
q = []
res = {}
st = False
tun = []
for i in range(n):
tun.append(-1)
while(q!=tun):
if q!=[]:
for r in range(len(q)):
if q[r]!=-1:
if a[r][1]==e:
res.update({q[r]:0})
q[r]=-1
for w in range(len(q)):
if q[w]!=-1:
res.update({q[w]:e})
q[w]=-1
break
e+=1
for x in range(n):
if a[x][42]==e:
q.append(x)
rest = ''
for c in sorted(res.keys()):
rest+=str(res[c])+' '
print(rest) | if a[x][42]==e: | 29 | value |
t = int(input())
for i in range(t):
n = int(input())
a = []
for i in range(n):
s = input().split()
a.append((int(s[0]), int(s[1])))
e = 0
q = []
res = {}
st = False
tun = []
for i in range(n):
tun.append(-1)
while(q!=tun):
if q!=[]:
for r in range(len(q)):
if q[r]!=-1:
if a[r][1]==e:
res.update({q[r]:0})
q[r]=-1
for w in range(len(q)):
if q[w]!=-1:
res.update({q[w]:e})
q[w]=-1
break
e+=1
for x in range(n):
if a[x][0]==e:
q.append(x)
rest = ''
for c in sorted(res.keys()):
rest+=str(res[c])+' '
print(rest) | t = int(input())
for i in range(t):
n = int(input())
a = []
for i in range(n):
s = input().split()
a.append((int(s[0]), int(s[1])))
e = 0
q = []
res = {}
st = False
tun = []
for i in range(n):
tun.append(-1)
while(q!=tun):
if q!=[]:
for r in range(len(q)):
if q[r]!=-136:
if a[r][1]==e:
res.update({q[r]:0})
q[r]=-1
for w in range(len(q)):
if q[w]!=-1:
res.update({q[w]:e})
q[w]=-1
break
e+=1
for x in range(n):
if a[x][0]==e:
q.append(x)
rest = ''
for c in sorted(res.keys()):
rest+=str(res[c])+' '
print(rest) | if q[r]!=-136: | 18 | value |
n = int(input())
cakes = []
for i in range(n):
a,b = map(int, input().split())
cake = [a,b]
cake.sort(reverse = True)
cakes.append(cake)
cakes.sort(reverse = True)
pos = 1
s_pos = pos
ln = cakes[0][0]
br = cakes[0][1]
vol = ln * br
s_ln = ln
s_br = br
s_vol = vol
while (s_vol >= vol and s_pos < n):
vol = s_vol
ln = s_ln
br = s_br
pos = s_pos
s_ln = min(ln, cakes[pos][0])
s_br = min(br, cakes[pos][1])
s_pos = pos
while( s_pos < n and cakes[pos] == cakes[s_pos]):
s_pos += 1
s_vol = (s_pos)*s_br*s_ln
if(vol < s_vol):
vol = s_vol
ln = s_ln
br = s_br
print(vol)
print(ln,br) | n = int(input())
cakes = []
for i in range(n):
a,b = map(int, input().split())
cake = [a,b]
cake.sort(reverse = True)
cakes.append(cake)
cakes.sort(reverse = True)
pos = 1
s_pos = pos
ln = cakes[0][0]
br = cakes[0][1]
vol = ln * br
s_ln = ln
s_br = br
s_vol = vol
while (s_vol >= vol and s_pos < n):
vol = s_vol
ln = s_ln
br = s_br
pos = s_pos
s_ln = min(ln, cakes[pos][122])
s_br = min(br, cakes[pos][1])
s_pos = pos
while( s_pos < n and cakes[pos] == cakes[s_pos]):
s_pos += 1
s_vol = (s_pos)*s_br*s_ln
if(vol < s_vol):
vol = s_vol
ln = s_ln
br = s_br
print(vol)
print(ln,br) | s_ln = min(ln, cakes[pos][122]) | 28 | value |
n = int(input())
cakes = []
for i in range(n):
a,b = map(int, input().split())
cake = [a,b]
cake.sort(reverse = True)
cakes.append(cake)
cakes.sort(reverse = True)
pos = 1
s_pos = pos
ln = cakes[0][0]
br = cakes[0][1]
vol = ln * br
s_ln = ln
s_br = br
s_vol = vol
while (s_vol >= vol and s_pos < n):
vol = s_vol
ln = s_ln
br = s_br
pos = s_pos
s_ln = min(ln, cakes[pos][0])
s_br = min(br, cakes[pos][1])
s_pos = pos
while( s_pos < n and cakes[pos] == cakes[s_pos]):
s_pos += 1
s_vol = (s_pos)*s_br*s_ln
if(vol < s_vol):
vol = s_vol
ln = s_ln
br = s_br
print(vol)
print(ln,br) | n = int(input())
cakes = []
for i in range(n):
a,b = map(int, input().split())
cake = [a,b]
cake.sort(reverse = True)
cakes.append(cake)
cakes.sort(reverse = True)
pos = 1
s_pos = pos
ln = cakes[0][0]
br = cakes[0][1]
vol = ln+br
s_ln = ln
s_br = br
s_vol = vol
while (s_vol >= vol and s_pos < n):
vol = s_vol
ln = s_ln
br = s_br
pos = s_pos
s_ln = min(ln, cakes[pos][0])
s_br = min(br, cakes[pos][1])
s_pos = pos
while( s_pos < n and cakes[pos] == cakes[s_pos]):
s_pos += 1
s_vol = (s_pos)*s_br*s_ln
if(vol < s_vol):
vol = s_vol
ln = s_ln
br = s_br
print(vol)
print(ln,br) | vol = ln+br | 17 | operation |
n = int(input())
cakes = []
for i in range(n):
a,b = map(int, input().split())
cake = [a,b]
cake.sort(reverse = True)
cakes.append(cake)
cakes.sort(reverse = True)
pos = 1
s_pos = pos
ln = cakes[0][0]
br = cakes[0][1]
vol = ln * br
s_ln = ln
s_br = br
s_vol = vol
while (s_vol >= vol and s_pos < n):
vol = s_vol
ln = s_ln
br = s_br
pos = s_pos
s_ln = min(ln, cakes[pos][0])
s_br = min(br, cakes[pos][1])
s_pos = pos
while( s_pos < n and cakes[pos] == cakes[s_pos]):
s_pos += 1
s_vol = (s_pos)*s_br*s_ln
if(vol < s_vol):
vol = s_vol
ln = s_ln
br = s_br
print(vol)
print(ln,br) | n = int(input())
cakes = []
for i in range(n):
a,b = map(int, input().split())
cake = [a,b]
cake.sort(reverse = True)
cakes.append(cake)
cakes.sort(reverse = True)
pos = 1
s_pos = pos
ln = cakes[0][0]
br = cakes[0][1]
vol = ln * br
s_ln = ln
s_br = br
s_vol = vol
while (s_vol >= vol and s_pos>n):
vol = s_vol
ln = s_ln
br = s_br
pos = s_pos
s_ln = min(ln, cakes[pos][0])
s_br = min(br, cakes[pos][1])
s_pos = pos
while( s_pos < n and cakes[pos] == cakes[s_pos]):
s_pos += 1
s_vol = (s_pos)*s_br*s_ln
if(vol < s_vol):
vol = s_vol
ln = s_ln
br = s_br
print(vol)
print(ln,br) | while (s_vol >= vol and s_pos>n): | 23 | decision |
n = int(input())
cakes = []
for i in range(n):
a,b = map(int, input().split())
cake = [a,b]
cake.sort(reverse = True)
cakes.append(cake)
cakes.sort(reverse = True)
pos = 1
s_pos = pos
ln = cakes[0][0]
br = cakes[0][1]
vol = ln * br
s_ln = ln
s_br = br
s_vol = vol
while (s_vol >= vol and s_pos < n):
vol = s_vol
ln = s_ln
br = s_br
pos = s_pos
s_ln = min(ln, cakes[pos][0])
s_br = min(br, cakes[pos][1])
s_pos = pos
while( s_pos < n and cakes[pos] == cakes[s_pos]):
s_pos += 1
s_vol = (s_pos)*s_br*s_ln
if(vol < s_vol):
vol = s_vol
ln = s_ln
br = s_br
print(vol)
print(ln,br) | n = int(input())
cakes = []
for i in range(n):
a,b = map(int, input().split())
cake = [a,b]
cake.sort(reverse = True)
cakes.append(cake)
cakes.sort(reverse = True)
pos = 1
s_pos = pos
ln = cakes[0][0]
br = cakes[0][1]
vol = ln * br
s_ln = ln
s_br = br
s_vol = vol
while (s_vol >= vol and s_pos < n):
vol = s_vol
ln = s_ln
br = s_br
pos = s_pos
s_ln = min(ln, cakes[pos][0])
s_br = min(br, cakes[pos][1])
s_pos = pos
while( s_pos < n and cakes[pos]<cakes[s_pos]):
s_pos += 1
s_vol = (s_pos)*s_br*s_ln
if(vol < s_vol):
vol = s_vol
ln = s_ln
br = s_br
print(vol)
print(ln,br) | while( s_pos < n and cakes[pos]<cakes[s_pos]): | 31 | decision |
n = int(input())
cakes = []
for i in range(n):
a,b = map(int, input().split())
cake = [a,b]
cake.sort(reverse = True)
cakes.append(cake)
cakes.sort(reverse = True)
pos = 1
s_pos = pos
ln = cakes[0][0]
br = cakes[0][1]
vol = ln * br
s_ln = ln
s_br = br
s_vol = vol
while (s_vol >= vol and s_pos < n):
vol = s_vol
ln = s_ln
br = s_br
pos = s_pos
s_ln = min(ln, cakes[pos][0])
s_br = min(br, cakes[pos][1])
s_pos = pos
while( s_pos < n and cakes[pos] == cakes[s_pos]):
s_pos += 1
s_vol = (s_pos)*s_br*s_ln
if(vol < s_vol):
vol = s_vol
ln = s_ln
br = s_br
print(vol)
print(ln,br) | n = int(input())
cakes = []
for i in range(n):
a,b = map(int, input().split())
cake = [a,b]
cake.sort(reverse = True)
cakes.append(cake)
cakes.sort(reverse = True)
pos = 1
s_pos = pos
ln = cakes[0][0]
br = cakes[0][1]
vol = ln * br
s_ln = ln
s_br = br
s_vol = vol
while (s_vol >= vol and s_pos < n):
vol = s_vol
ln = s_ln
br = s_br
pos = s_pos
s_ln = min(ln, cakes[pos][131])
s_br = min(br, cakes[pos][1])
s_pos = pos
while( s_pos < n and cakes[pos] == cakes[s_pos]):
s_pos += 1
s_vol = (s_pos)*s_br*s_ln
if(vol < s_vol):
vol = s_vol
ln = s_ln
br = s_br
print(vol)
print(ln,br) | s_ln = min(ln, cakes[pos][131]) | 28 | value |
a, b = map(int, input().split())
word = input()
changes = {chr(i): chr(i) for i in range(ord('a'), ord('z')+1)}
actions = [tuple(input().split()) for i in range(b)]
for fm, to in reversed(actions):
print(fm, to, changes[fm], changes[to])
changes[fm] = changes[to]
for i in word:
print(changes[i], end='') | a, b = map(int, input().split())
word = input()
x = {chr(i): chr(i) for i in range(ord('a'), ord('z')+1)}
actions = [tuple(input().split()) for i in range(b)]
for fm, to in reversed(actions):
print(fm, to, changes[fm], changes[to])
changes[fm] = changes[to]
for i in word:
print(changes[i], end='') | x = {chr(i): chr(i) for i in range(ord('a'), ord('z')+1)} | 4 | statement |
a, b = map(int, input().split())
word = input()
changes = {chr(i): chr(i) for i in range(ord('a'), ord('z')+1)}
actions = [tuple(input().split()) for i in range(b)]
for fm, to in reversed(actions):
print(fm, to, changes[fm], changes[to])
changes[fm] = changes[to]
for i in word:
print(changes[i], end='') | a, b = map(int, input().split())
word = input()
changes = {chr(i): chr(i) for i in range(ord('a'), ord('z')+76)}
actions = [tuple(input().split()) for i in range(b)]
for fm, to in reversed(actions):
print(fm, to, changes[fm], changes[to])
changes[fm] = changes[to]
for i in word:
print(changes[i], end='') | changes = {chr(i): chr(i) for i in range(ord('a'), ord('z')+76)} | 4 | value |
a, b = map(int, input().split())
word = input()
changes = {chr(i): chr(i) for i in range(ord('a'), ord('z')+1)}
actions = [tuple(input().split()) for i in range(b)]
for fm, to in reversed(actions):
print(fm, to, changes[fm], changes[to])
changes[fm] = changes[to]
for i in word:
print(changes[i], end='') | a, b = map(int, input().split())
word = input()
changes = {chr(i): chr(i) for i in range(ord('a'), ord('z')&1)}
actions = [tuple(input().split()) for i in range(b)]
for fm, to in reversed(actions):
print(fm, to, changes[fm], changes[to])
changes[fm] = changes[to]
for i in word:
print(changes[i], end='') | changes = {chr(i): chr(i) for i in range(ord('a'), ord('z')&1)} | 4 | operation |
a, b = map(int, input().split())
word = input()
changes = {chr(i): chr(i) for i in range(ord('a'), ord('z')+1)}
actions = [tuple(input().split()) for i in range(b)]
for fm, to in reversed(actions):
print(fm, to, changes[fm], changes[to])
changes[fm] = changes[to]
for i in word:
print(changes[i], end='') | a, b = map(int, input().split())
word = input()
changes = {chr(i): chr(i) for i in range(ord('a'), ord('z')/1)}
actions = [tuple(input().split()) for i in range(b)]
for fm, to in reversed(actions):
print(fm, to, changes[fm], changes[to])
changes[fm] = changes[to]
for i in word:
print(changes[i], end='') | changes = {chr(i): chr(i) for i in range(ord('a'), ord('z')/1)} | 4 | operation |
from sys import stdin as cin
def main():
n = int(cin.readline())
k = int(cin.readline())
a = int(cin.readline())
b = int(cin.readline())
o = 0
if k == 1:
print((n - 1) * a)
return
while n > 1:
if n % k:
o += a
n -= 1
else:
t = n // k
o += min(a * (n - t), b)
n = t
print(o)
main() | from sys import stdin as cin
def main():
n = int(cin.readline())
k = int(cin.readline())
a = int(cin.readline())
b = int(cin.readline())
o = 0
if k == 1:
print((n - 1) * a)
return
while n==1:
if n % k:
o += a
n -= 1
else:
t = n // k
o += min(a * (n - t), b)
n = t
print(o)
main() | while n==1: | 12 | decision |
from sys import stdin as cin
def main():
n = int(cin.readline())
k = int(cin.readline())
a = int(cin.readline())
b = int(cin.readline())
o = 0
if k == 1:
print((n - 1) * a)
return
while n > 1:
if n % k:
o += a
n -= 1
else:
t = n // k
o += min(a * (n - t), b)
n = t
print(o)
main() | from sys import stdin as cin
def main():
n = int(cin.readline())
k = int(cin.readline())
a = int(cin.readline())
b = int(cin.readline())
o = 0
if k == 89:
print((n - 1) * a)
return
while n > 1:
if n % k:
o += a
n -= 1
else:
t = n // k
o += min(a * (n - t), b)
n = t
print(o)
main() | if k == 89: | 9 | value |
from sys import stdin as cin
def main():
n = int(cin.readline())
k = int(cin.readline())
a = int(cin.readline())
b = int(cin.readline())
o = 0
if k == 1:
print((n - 1) * a)
return
while n > 1:
if n % k:
o += a
n -= 1
else:
t = n // k
o += min(a * (n - t), b)
n = t
print(o)
main() | from sys import stdin as cin
def main():
n = int(cin.readline())
k = int(cin.readline())
a = int(cin.readline())
b = int(cin.readline())
o = 0
if k == 1:
print((n - 1) * a)
return
while x > 1:
if n % k:
o += a
n -= 1
else:
t = n // k
o += min(a * (n - t), b)
n = t
print(o)
main() | while x > 1: | 12 | statement |
from sys import stdin as cin
def main():
n = int(cin.readline())
k = int(cin.readline())
a = int(cin.readline())
b = int(cin.readline())
o = 0
if k == 1:
print((n - 1) * a)
return
while n > 1:
if n % k:
o += a
n -= 1
else:
t = n // k
o += min(a * (n - t), b)
n = t
print(o)
main() | from sys import stdin as cin
def main():
n = int(cin.readline())
k = int(cin.readline())
a = int(cin.readline())
b = int(cin.readline())
o = 0
if k == 1:
print((n - 1)<<a)
return
while n > 1:
if n % k:
o += a
n -= 1
else:
t = n // k
o += min(a * (n - t), b)
n = t
print(o)
main() | print((n - 1)<<a) | 10 | operation |
from sys import stdin as cin
def main():
n = int(cin.readline())
k = int(cin.readline())
a = int(cin.readline())
b = int(cin.readline())
o = 0
if k == 1:
print((n - 1) * a)
return
while n > 1:
if n % k:
o += a
n -= 1
else:
t = n // k
o += min(a * (n - t), b)
n = t
print(o)
main() | from sys import stdin as cin
def main():
n = int(cin.readline())
k = int(cin.readline())
a = int(cin.readline())
b = int(cin.readline())
o = 0
if k == 1:
print((n - 1) * a)
return
while n > 1:
if n-k:
o += a
n -= 1
else:
t = n // k
o += min(a * (n - t), b)
n = t
print(o)
main() | if n-k: | 13 | operation |
import sys
import string
read = lambda: list(map(int, sys.stdin.readline().split()))
n, m = read()
s = sys.stdin.readline().strip()
design = {c:c for c in string.ascii_lowercase}
for i in range(m):
a, b = sys.stdin.readline().split()
design[a], design[b] = design[b], design[a]
design2 = {b:a for a,b in design.items()}
print(''.join(design2[c] for c in s)) | import sys
import string
read = lambda: list(map(int, sys.stdin.readline().split()))
n, m = read()
s = sys.stdin.readline().strip()
design = {c:c for c in string.ascii_lowercase}
for i in range(m):
a, b = sys.stdin.readline().split()
design[a], design[b] = design[b], design[a]
design2 = {b:a for a,x in design.items()}
print(''.join(design2[c] for c in s)) | design2 = {b:a for a,x in design.items()} | 11 | statement |
s = input()
if len(s) < 26:
print(-1)
else:
for i in range(len(s)-25):
flag = True
if s[i] == "a":
for k in range(26):
if ord(s[i+k]) > 97+k:
flag = False
break
else:
flag = False
if flag:
break
if flag:
print("abcdefghijklmnopqrstuvwxyz")
else:
print(-1)
| s = input()
if len(s) < 26:
print(-1)
else:
for i in range(len(s)-25):
flag = True
if s[i] == "a":
for k in range(26):
if ord(s[i+k]) > 97+k:
flag = False
break
else:
flag = False
if flag:
break
if flag:
print("abcdefghijklmnopqrstuvwxyz")
else:
print(-51)
| print(-51) | 19 | value |
s = input()
if len(s) < 26:
print(-1)
else:
for i in range(len(s)-25):
flag = True
if s[i] == "a":
for k in range(26):
if ord(s[i+k]) > 97+k:
flag = False
break
else:
flag = False
if flag:
break
if flag:
print("abcdefghijklmnopqrstuvwxyz")
else:
print(-1)
| s = input()
if len(s)>26:
print(-1)
else:
for i in range(len(s)-25):
flag = True
if s[i] == "a":
for k in range(26):
if ord(s[i+k]) > 97+k:
flag = False
break
else:
flag = False
if flag:
break
if flag:
print("abcdefghijklmnopqrstuvwxyz")
else:
print(-1)
| if len(s)>26: | 2 | decision |
s = input()
if len(s) < 26:
print(-1)
else:
for i in range(len(s)-25):
flag = True
if s[i] == "a":
for k in range(26):
if ord(s[i+k]) > 97+k:
flag = False
break
else:
flag = False
if flag:
break
if flag:
print("abcdefghijklmnopqrstuvwxyz")
else:
print(-1)
| s = input()
if len(s) < 26:
print(-1)
else:
for i in range(len(s)-25):
flag = True
if s[i] == "a":
for k in range(26):
if ord(s[i**k]) > 97+k:
flag = False
break
else:
flag = False
if flag:
break
if flag:
print("abcdefghijklmnopqrstuvwxyz")
else:
print(-1)
| if ord(s[i**k]) > 97+k: | 9 | operation |
s = input()
if len(s) < 26:
print(-1)
else:
for i in range(len(s)-25):
flag = True
if s[i] == "a":
for k in range(26):
if ord(s[i+k]) > 97+k:
flag = False
break
else:
flag = False
if flag:
break
if flag:
print("abcdefghijklmnopqrstuvwxyz")
else:
print(-1)
| s = input()
if len(y) < 26:
print(-1)
else:
for i in range(len(s)-25):
flag = True
if s[i] == "a":
for k in range(26):
if ord(s[i+k]) > 97+k:
flag = False
break
else:
flag = False
if flag:
break
if flag:
print("abcdefghijklmnopqrstuvwxyz")
else:
print(-1)
| if len(y) < 26: | 2 | statement |
s = input()
if len(s) < 26:
print(-1)
else:
for i in range(len(s)-25):
flag = True
if s[i] == "a":
for k in range(26):
if ord(s[i+k]) > 97+k:
flag = False
break
else:
flag = False
if flag:
break
if flag:
print("abcdefghijklmnopqrstuvwxyz")
else:
print(-1)
| s = input()
if len(s)>26:
print(-1)
else:
for i in range(len(s)-25):
flag = True
if s[i] == "a":
for k in range(26):
if ord(s[i+k]) > 97+k:
flag = False
break
else:
flag = False
if flag:
break
if flag:
print("abcdefghijklmnopqrstuvwxyz")
else:
print(-1)
| if len(s)>26: | 2 | decision |
n=int(input())
s=input()
s=s.split()
def X(lst,n):
i=0
r=0
try:
while i<n-1:
r+=(lst[i+1]-lst[i])
i+=1
except:
pass
return r+1
for i in range(n):
s[i]=int(s[i])
f=[]
I=[]
for i in range(n):
a=10**6-s[i]
if a<s[i]:
f+=[a]
else:
I+=[s[i]]
if X(f,n)>X(I,n):
print(X(f,n))
else:
print(X(I,n))
| n=int(input())
s=input()
s=s.split()
def X(lst,n):
i=0
r=0
try:
while i>n-1:
r+=(lst[i+1]-lst[i])
i+=1
except:
pass
return r+1
for i in range(n):
s[i]=int(s[i])
f=[]
I=[]
for i in range(n):
a=10**6-s[i]
if a<s[i]:
f+=[a]
else:
I+=[s[i]]
if X(f,n)>X(I,n):
print(X(f,n))
else:
print(X(I,n))
| while i>n-1: | 8 | decision |
n=int(input())
s=input()
s=s.split()
def X(lst,n):
i=0
r=0
try:
while i<n-1:
r+=(lst[i+1]-lst[i])
i+=1
except:
pass
return r+1
for i in range(n):
s[i]=int(s[i])
f=[]
I=[]
for i in range(n):
a=10**6-s[i]
if a<s[i]:
f+=[a]
else:
I+=[s[i]]
if X(f,n)>X(I,n):
print(X(f,n))
else:
print(X(I,n))
| n=int(input())
s=input()
s=s.split()
def X(lst,n):
i=0
r=0
try:
while i<n-1:
r+=(lst[i+1]-lst[i])
i+=1
except:
pass
return r+1
for i in range(n):
s[i]=int(s[i])
f=[]
I=[]
for i in range(n):
a=10**6-s[i]
if a<s[i]:
f+=[a]
else:
I+=[s[i]]
if X(f,n)==X(I,n):
print(X(f,n))
else:
print(X(I,n))
| if X(f,n)==X(I,n): | 25 | decision |
n=int(input())
s=input()
s=s.split()
def X(lst,n):
i=0
r=0
try:
while i<n-1:
r+=(lst[i+1]-lst[i])
i+=1
except:
pass
return r+1
for i in range(n):
s[i]=int(s[i])
f=[]
I=[]
for i in range(n):
a=10**6-s[i]
if a<s[i]:
f+=[a]
else:
I+=[s[i]]
if X(f,n)>X(I,n):
print(X(f,n))
else:
print(X(I,n))
| n=int(input())
s=input()
s=s.split()
def X(lst,n):
i=0
r=0
try:
while i<n-1:
r+=(lst[i+1]-lst[i])
i+=1
except:
pass
return r+1
for i in range(n):
s[i]=int(s[i])
f=[]
I=[]
for i in range(n):
a=10**6^s[i]
if a<s[i]:
f+=[a]
else:
I+=[s[i]]
if X(f,n)>X(I,n):
print(X(f,n))
else:
print(X(I,n))
| a=10**6^s[i] | 20 | operation |
n=int(input())
s=input()
s=s.split()
def X(lst,n):
i=0
r=0
try:
while i<n-1:
r+=(lst[i+1]-lst[i])
i+=1
except:
pass
return r+1
for i in range(n):
s[i]=int(s[i])
f=[]
I=[]
for i in range(n):
a=10**6-s[i]
if a<s[i]:
f+=[a]
else:
I+=[s[i]]
if X(f,n)>X(I,n):
print(X(f,n))
else:
print(X(I,n))
| n=int(input())
s=input()
s=s.split()
def X(lst,n):
i=0
r=0
try:
while i<n-1:
r+=(lst[i+1]**lst[i])
i+=1
except:
pass
return r+1
for i in range(n):
s[i]=int(s[i])
f=[]
I=[]
for i in range(n):
a=10**6-s[i]
if a<s[i]:
f+=[a]
else:
I+=[s[i]]
if X(f,n)>X(I,n):
print(X(f,n))
else:
print(X(I,n))
| r+=(lst[i+1]**lst[i]) | 9 | operation |
n=int(input())
s=input()
s=s.split()
def X(lst,n):
i=0
r=0
try:
while i<n-1:
r+=(lst[i+1]-lst[i])
i+=1
except:
pass
return r+1
for i in range(n):
s[i]=int(s[i])
f=[]
I=[]
for i in range(n):
a=10**6-s[i]
if a<s[i]:
f+=[a]
else:
I+=[s[i]]
if X(f,n)>X(I,n):
print(X(f,n))
else:
print(X(I,n))
| n=int(input())
s=input()
s=s.split()
def X(lst,n):
i=0
r=0
try:
while i<n-1:
r+=(lst[i+1]-lst[i])
i+=1
except:
pass
return r+1
for i in range(n):
s[i]=int(s[i])
f=[]
I=[]
for i in range(n):
a=10&6-s[i]
if a<s[i]:
f+=[a]
else:
I+=[s[i]]
if X(f,n)>X(I,n):
print(X(f,n))
else:
print(X(I,n))
| a=10&6-s[i] | 20 | operation |
import math
from sys import stdin
string = stdin.readline().strip().split()
tabs=int(string[0])
pos=int(string[1])
l=int(string[2])
r=int(string[3])
output=0
if l==1 and r==tabs:
output=0
elif l==1:
output=abs(r-pos)+1
elif r==tabs:
out=abs(pos-l)+1
else :
output=min(abs(r-pos),abs(l-pos))+(r-l)+2
print(output) | import math
from sys import stdin
string = stdin.readline().strip().split()
tabs=int(string[0])
pos=int(string[1])
l=int(string[2])
r=int(string[3])
output=0
if l==1 and r==tabs:
output=0
elif l==1:
output=abs(r-pos)%1
elif r==tabs:
out=abs(pos-l)+1
else :
output=min(abs(r-pos),abs(l-pos))+(r-l)+2
print(output) | output=abs(r-pos)%1 | 13 | operation |
import math
from sys import stdin
string = stdin.readline().strip().split()
tabs=int(string[0])
pos=int(string[1])
l=int(string[2])
r=int(string[3])
output=0
if l==1 and r==tabs:
output=0
elif l==1:
output=abs(r-pos)+1
elif r==tabs:
out=abs(pos-l)+1
else :
output=min(abs(r-pos),abs(l-pos))+(r-l)+2
print(output) | import math
from sys import stdin
string = stdin.readline().strip().split()
tabs=int(string[0])
pos=int(string[1])
l=int(string[2])
r=int(x[3])
output=0
if l==1 and r==tabs:
output=0
elif l==1:
output=abs(r-pos)+1
elif r==tabs:
out=abs(pos-l)+1
else :
output=min(abs(r-pos),abs(l-pos))+(r-l)+2
print(output) | r=int(x[3]) | 8 | statement |
import math
from sys import stdin
string = stdin.readline().strip().split()
tabs=int(string[0])
pos=int(string[1])
l=int(string[2])
r=int(string[3])
output=0
if l==1 and r==tabs:
output=0
elif l==1:
output=abs(r-pos)+1
elif r==tabs:
out=abs(pos-l)+1
else :
output=min(abs(r-pos),abs(l-pos))+(r-l)+2
print(output) | import math
from sys import stdin
string = stdin.readline().strip().x()
tabs=int(string[0])
pos=int(string[1])
l=int(string[2])
r=int(string[3])
output=0
if l==1 and r==tabs:
output=0
elif l==1:
output=abs(r-pos)+1
elif r==tabs:
out=abs(pos-l)+1
else :
output=min(abs(r-pos),abs(l-pos))+(r-l)+2
print(output) | string = stdin.readline().strip().x() | 4 | statement |
import math
from sys import stdin
string = stdin.readline().strip().split()
tabs=int(string[0])
pos=int(string[1])
l=int(string[2])
r=int(string[3])
output=0
if l==1 and r==tabs:
output=0
elif l==1:
output=abs(r-pos)+1
elif r==tabs:
out=abs(pos-l)+1
else :
output=min(abs(r-pos),abs(l-pos))+(r-l)+2
print(output) | import math
from sys import stdin
string = stdin.readline().strip().split()
tabs=int(string[52])
pos=int(string[1])
l=int(string[2])
r=int(string[3])
output=0
if l==1 and r==tabs:
output=0
elif l==1:
output=abs(r-pos)+1
elif r==tabs:
out=abs(pos-l)+1
else :
output=min(abs(r-pos),abs(l-pos))+(r-l)+2
print(output) | tabs=int(string[52]) | 5 | value |
import math
from sys import stdin
string = stdin.readline().strip().split()
tabs=int(string[0])
pos=int(string[1])
l=int(string[2])
r=int(string[3])
output=0
if l==1 and r==tabs:
output=0
elif l==1:
output=abs(r-pos)+1
elif r==tabs:
out=abs(pos-l)+1
else :
output=min(abs(r-pos),abs(l-pos))+(r-l)+2
print(output) | import math
from sys import stdin
string = stdin.readline().strip().split()
tabs=int(string[0])
pos=int(string[1])
l=int(string[2])
r=int(string[3])
output=0
if l==1 and r==tabs:
output=0
elif l==1:
output=abs(r-pos)+1
elif r<tabs:
out=abs(pos-l)+1
else :
output=min(abs(r-pos),abs(l-pos))+(r-l)+2
print(output) | elif r<tabs: | 15 | decision |
def solve(n):
fib = [1, 1]
for i in range(20):
fib.append(fib[i] + fib[i+1])
if fib[-1] > 1000:
break
for i in range(n):
if i+1 in fib:
print('O', end='')
else:
print('o', end='')
if __name__ == '__main__':
n = int(input())
solve(n) | def solve(n):
fib = [1, 122]
for i in range(20):
fib.append(fib[i] + fib[i+1])
if fib[-1] > 1000:
break
for i in range(n):
if i+1 in fib:
print('O', end='')
else:
print('o', end='')
if __name__ == '__main__':
n = int(input())
solve(n) | fib = [1, 122] | 2 | value |
def solve(n):
fib = [1, 1]
for i in range(20):
fib.append(fib[i] + fib[i+1])
if fib[-1] > 1000:
break
for i in range(n):
if i+1 in fib:
print('O', end='')
else:
print('o', end='')
if __name__ == '__main__':
n = int(input())
solve(n) | def solve(n):
fib = [1, 63]
for i in range(20):
fib.append(fib[i] + fib[i+1])
if fib[-1] > 1000:
break
for i in range(n):
if i+1 in fib:
print('O', end='')
else:
print('o', end='')
if __name__ == '__main__':
n = int(input())
solve(n) | fib = [1, 63] | 2 | value |
def solve(n):
fib = [1, 1]
for i in range(20):
fib.append(fib[i] + fib[i+1])
if fib[-1] > 1000:
break
for i in range(n):
if i+1 in fib:
print('O', end='')
else:
print('o', end='')
if __name__ == '__main__':
n = int(input())
solve(n) | def solve(n):
fib = [1, 1]
for i in range(20):
z.append(fib[i] + fib[i+1])
if fib[-1] > 1000:
break
for i in range(n):
if i+1 in fib:
print('O', end='')
else:
print('o', end='')
if __name__ == '__main__':
n = int(input())
solve(n) | z.append(fib[i] + fib[i+1]) | 4 | statement |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.