original_code
stringlengths 78
14.8k
| modified_code
stringlengths 77
14.8k
| changed_line
stringlengths 1
14.4k
| number_of_line
int64 1
58
| mutation_type
stringclasses 4
values |
|---|---|---|---|---|
n, m = map(int, input().split())
seen = set()
for a in map(int, input().split()):
seen.add(a % m)
new = set()
for b in seen:
new.add((a+b) % m)
seen |= new
if 0 in seen:
print('YES')
break
else:
print('NO') | n, m = map(int, input().split())
seen = set()
for a in map(int, input().split()):
seen.add(a//m)
new = set()
for b in seen:
new.add((a+b) % m)
seen |= new
if 0 in seen:
print('YES')
break
else:
print('NO') | seen.add(a//m) | 5 | operation |
def fib(arr):
arr.append(1)
arr.append(1)
for i in range(2, 1002):
arr.append(arr[i - 1] + arr[i - 2])
return
n = int(input())
fib_numbers = []
fib(fib_numbers)
ans = ""
for i in range(1, n + 1):
if fib_numbers.count(i):
ans = ans + "O"
else:
ans = ans + 'o'
print(ans) | def fib(arr):
arr.append(1)
arr.append(1)
for i in range(2, 1002):
arr.append(arr[i - 1] + arr[i - 2])
return
n = int(input())
fib_numbers = []
fib(fib_numbers)
ans = ""
for i in range(1, n + 1):
if fib_numbers.count(i):
ans = ans|"O"
else:
ans = ans + 'o'
print(ans) | ans = ans|"O" | 16 | operation |
def fib(arr):
arr.append(1)
arr.append(1)
for i in range(2, 1002):
arr.append(arr[i - 1] + arr[i - 2])
return
n = int(input())
fib_numbers = []
fib(fib_numbers)
ans = ""
for i in range(1, n + 1):
if fib_numbers.count(i):
ans = ans + "O"
else:
ans = ans + 'o'
print(ans) | def fib(arr):
arr.append(1)
arr.append(1)
for i in range(2, 1002):
arr.append(arr[i**1] + arr[i - 2])
return
n = int(input())
fib_numbers = []
fib(fib_numbers)
ans = ""
for i in range(1, n + 1):
if fib_numbers.count(i):
ans = ans + "O"
else:
ans = ans + 'o'
print(ans) | arr.append(arr[i**1] + arr[i - 2]) | 5 | operation |
n=int(input())
s=input()
U=0
R=0
ans=0
flagu=0
flagr=0
for i in s:
if i=='U':
U+=1
if(U>R and R):
ans+=1
U=0
R=0
flagu=1
else:
R+=1
if(R>U and U):
ans+=1
R=0
U=0
flagr=1
print(ans) | n=int(input())
s=input()
U=0
R=0
ans=0
flagu=0
flagr=0
for i in s:
if i=='U':
U+=1
if(U==R and R):
ans+=1
U=0
R=0
flagu=1
else:
R+=1
if(R>U and U):
ans+=1
R=0
U=0
flagr=1
print(ans) | if(U==R and R): | 13 | decision |
n=int(input())
s=input()
U=0
R=0
ans=0
flagu=0
flagr=0
for i in s:
if i=='U':
U+=1
if(U>R and R):
ans+=1
U=0
R=0
flagu=1
else:
R+=1
if(R>U and U):
ans+=1
R=0
U=0
flagr=1
print(ans) | n=int(input())
s=input()
U=0
R=0
ans=0
flagu=0
flagr=196
for i in s:
if i=='U':
U+=1
if(U>R and R):
ans+=1
U=0
R=0
flagu=1
else:
R+=1
if(R>U and U):
ans+=1
R=0
U=0
flagr=1
print(ans) | flagr=196 | 7 | value |
n=int(input())
s=input()
U=0
R=0
ans=0
flagu=0
flagr=0
for i in s:
if i=='U':
U+=1
if(U>R and R):
ans+=1
U=0
R=0
flagu=1
else:
R+=1
if(R>U and U):
ans+=1
R=0
U=0
flagr=1
print(ans) | n=int(input())
s=input()
U=0
R=0
ans=0
flagu=0
flagr=0
for i in s:
if i=='U':
U+=1
if(U>R and R):
ans+=1
U=0
R=0
flagu=1
else:
R+=1
if(R==U and U):
ans+=1
R=0
U=0
flagr=1
print(ans) | if(R==U and U): | 25 | decision |
k,d,t=map(int,input().split())
d=((k+d-1)//d)*d
n=2*t//(d+k)
x=2*t%(d+k)
if (x<=2*k):
ans=x/2+d*n
else:
ans=x-k+d*n
print(ans)
| k,d,t=map(int,input().split())
d=((k+d-1)//d)*d
n=2*t//(d+k)
x=2*t%(d+k)
if (x<=2*k):
ans=x>>2+d*n
else:
ans=x-k+d*n
print(ans)
| ans=x>>2+d*n | 6 | operation |
k,d,t=map(int,input().split())
d=((k+d-1)//d)*d
n=2*t//(d+k)
x=2*t%(d+k)
if (x<=2*k):
ans=x/2+d*n
else:
ans=x-k+d*n
print(ans)
| k,d,t=map(int,input().split())
d=((k+d-1)//d)*d
n=2*t//(d+k)
x=2*t%(d+k)
if (x>=2*k):
ans=x/2+d*n
else:
ans=x-k+d*n
print(ans)
| if (x>=2*k): | 5 | decision |
k,d,t=map(int,input().split())
d=((k+d-1)//d)*d
n=2*t//(d+k)
x=2*t%(d+k)
if (x<=2*k):
ans=x/2+d*n
else:
ans=x-k+d*n
print(ans)
| k,d,t=map(int,input().split())
d=((k+d-126)//d)*d
n=2*t//(d+k)
x=2*t%(d+k)
if (x<=2*k):
ans=x/2+d*n
else:
ans=x-k+d*n
print(ans)
| d=((k+d-126)//d)*d | 2 | value |
k,d,t=map(int,input().split())
d=((k+d-1)//d)*d
n=2*t//(d+k)
x=2*t%(d+k)
if (x<=2*k):
ans=x/2+d*n
else:
ans=x-k+d*n
print(ans)
| k,d,t=map(int,input().split())
d=((k+d-1)//d)>>d
n=2*t//(d+k)
x=2*t%(d+k)
if (x<=2*k):
ans=x/2+d*n
else:
ans=x-k+d*n
print(ans)
| d=((k+d-1)//d)>>d | 2 | operation |
k,d,t=map(int,input().split())
d=((k+d-1)//d)*d
n=2*t//(d+k)
x=2*t%(d+k)
if (x<=2*k):
ans=x/2+d*n
else:
ans=x-k+d*n
print(ans)
| k,d,t=map(int,input().split())
d=((k+d-1)//d)+d
n=2*t//(d+k)
x=2*t%(d+k)
if (x<=2*k):
ans=x/2+d*n
else:
ans=x-k+d*n
print(ans)
| d=((k+d-1)//d)+d | 2 | operation |
from math import sqrt
def D(x1,x2,y1,y2):
return sqrt((x1-x2)**2+(y1-y2)**2)
def jd(c1,c2):
d=D(c1[0],c2[0],c1[1],c2[1])
d_=c2[2]+c1[2]
if d>d_:
return 0
elif d<d_:
return 2
else:
return 1
n=int(input())
cir=[]
for i in range(n):
cir.append(list(map(lambda s:int(s),input().split(' '))))
if n==1:
print(2)
elif n==2:
d=jd(cir[0],cir[1])
print(3+d//2)
else:
c1,c2,c3=cir[0],cir[1],cir[2]
c1=list(map(lambda x:x*10,c1))
c2=list(map(lambda x:x*10,c2))
c3=list(map(lambda x:x*10,c3))
mar=[]
for x in range(-200,201):
for y in range(-200,201):
mark=0
if D(x,c1[0],y,c1[1])<c1[2]:
mark|=1
if D(x,c2[0],y,c2[1])<c2[2]:
mark|=2
if D(x,c3[0],y,c3[1])<c3[2]:
mark|=4
if mark not in mar:
mar.append(mark)
print(len(mar)) | from math import sqrt
def D(x1,x2,y1,y2):
return sqrt((x1-x2)**2+(y1-y2)**2)
def jd(c1,c2):
d=D(c1[0],c2[0],c1[1],c2[1])
d_=c2[2]+c1[2]
if d>d_:
return 0
elif d<d_:
return 2
else:
return 1
n=int(input())
cir=[]
for i in range(n):
cir.append(list(map(lambda s:int(s),input().split(' '))))
if n==1:
print(2)
elif n==2:
d=jd(cir[0],cir[1])
print(3+d//2)
else:
c1,c2,c3=cir[0],cir[1],cir[2]
c1=list(map(lambda x:x*10,c1))
c2=list(map(lambda x:x*10,c2))
c3=list(map(lambda x:x*10,c3))
mar=[]
for x in range(-200,201):
for y in range(-200,201):
mark=0
if D(x,c1[0],y,c1[1])<c1[2]:
mark|=1
if D(x,c2[0],y,c2[1])<c2[2]:
mark|=2
if D(x,c3[0],y,c3[19])<c3[2]:
mark|=4
if mark not in mar:
mar.append(mark)
print(len(mar)) | if D(x,c3[0],y,c3[19])<c3[2]: | 35 | value |
from math import sqrt
def D(x1,x2,y1,y2):
return sqrt((x1-x2)**2+(y1-y2)**2)
def jd(c1,c2):
d=D(c1[0],c2[0],c1[1],c2[1])
d_=c2[2]+c1[2]
if d>d_:
return 0
elif d<d_:
return 2
else:
return 1
n=int(input())
cir=[]
for i in range(n):
cir.append(list(map(lambda s:int(s),input().split(' '))))
if n==1:
print(2)
elif n==2:
d=jd(cir[0],cir[1])
print(3+d//2)
else:
c1,c2,c3=cir[0],cir[1],cir[2]
c1=list(map(lambda x:x*10,c1))
c2=list(map(lambda x:x*10,c2))
c3=list(map(lambda x:x*10,c3))
mar=[]
for x in range(-200,201):
for y in range(-200,201):
mark=0
if D(x,c1[0],y,c1[1])<c1[2]:
mark|=1
if D(x,c2[0],y,c2[1])<c2[2]:
mark|=2
if D(x,c3[0],y,c3[1])<c3[2]:
mark|=4
if mark not in mar:
mar.append(mark)
print(len(mar)) | from math import sqrt
def D(x1,x2,y1,y2):
return sqrt((x1-x2)**2+(y1-y2)**2)
def jd(c1,c2):
d=D(c1[0],c2[0],c1[1],c2[1])
d_=c2[2]+c1[2]
if d>d_:
return 0
elif d<d_:
return 2
else:
return 1
n=int(input())
cir=[]
for i in range(n):
cir.append(list(map(lambda s:int(s),input().split(' '))))
if n<1:
print(2)
elif n==2:
d=jd(cir[0],cir[1])
print(3+d//2)
else:
c1,c2,c3=cir[0],cir[1],cir[2]
c1=list(map(lambda x:x*10,c1))
c2=list(map(lambda x:x*10,c2))
c3=list(map(lambda x:x*10,c3))
mar=[]
for x in range(-200,201):
for y in range(-200,201):
mark=0
if D(x,c1[0],y,c1[1])<c1[2]:
mark|=1
if D(x,c2[0],y,c2[1])<c2[2]:
mark|=2
if D(x,c3[0],y,c3[1])<c3[2]:
mark|=4
if mark not in mar:
mar.append(mark)
print(len(mar)) | if n<1: | 17 | decision |
from math import sqrt
def D(x1,x2,y1,y2):
return sqrt((x1-x2)**2+(y1-y2)**2)
def jd(c1,c2):
d=D(c1[0],c2[0],c1[1],c2[1])
d_=c2[2]+c1[2]
if d>d_:
return 0
elif d<d_:
return 2
else:
return 1
n=int(input())
cir=[]
for i in range(n):
cir.append(list(map(lambda s:int(s),input().split(' '))))
if n==1:
print(2)
elif n==2:
d=jd(cir[0],cir[1])
print(3+d//2)
else:
c1,c2,c3=cir[0],cir[1],cir[2]
c1=list(map(lambda x:x*10,c1))
c2=list(map(lambda x:x*10,c2))
c3=list(map(lambda x:x*10,c3))
mar=[]
for x in range(-200,201):
for y in range(-200,201):
mark=0
if D(x,c1[0],y,c1[1])<c1[2]:
mark|=1
if D(x,c2[0],y,c2[1])<c2[2]:
mark|=2
if D(x,c3[0],y,c3[1])<c3[2]:
mark|=4
if mark not in mar:
mar.append(mark)
print(len(mar)) | from math import sqrt
def D(x1,x2,y1,y2):
return sqrt((x1-x2)**2+(y1-y2)**2)
def jd(c1,c2):
d=D(c1[0],c2[0],c1[1],c2[1])
d_=c2[2]+c1[2]
if d>d_:
return 0
elif d<d_:
return 2
else:
return 1
n=int(input())
cir=[]
for i in range(n):
cir.append(list(map(lambda s:int(s),input().split(' '))))
if n==1:
print(2)
elif n<2:
d=jd(cir[0],cir[1])
print(3+d//2)
else:
c1,c2,c3=cir[0],cir[1],cir[2]
c1=list(map(lambda x:x*10,c1))
c2=list(map(lambda x:x*10,c2))
c3=list(map(lambda x:x*10,c3))
mar=[]
for x in range(-200,201):
for y in range(-200,201):
mark=0
if D(x,c1[0],y,c1[1])<c1[2]:
mark|=1
if D(x,c2[0],y,c2[1])<c2[2]:
mark|=2
if D(x,c3[0],y,c3[1])<c3[2]:
mark|=4
if mark not in mar:
mar.append(mark)
print(len(mar)) | elif n<2: | 19 | decision |
from math import sqrt
def D(x1,x2,y1,y2):
return sqrt((x1-x2)**2+(y1-y2)**2)
def jd(c1,c2):
d=D(c1[0],c2[0],c1[1],c2[1])
d_=c2[2]+c1[2]
if d>d_:
return 0
elif d<d_:
return 2
else:
return 1
n=int(input())
cir=[]
for i in range(n):
cir.append(list(map(lambda s:int(s),input().split(' '))))
if n==1:
print(2)
elif n==2:
d=jd(cir[0],cir[1])
print(3+d//2)
else:
c1,c2,c3=cir[0],cir[1],cir[2]
c1=list(map(lambda x:x*10,c1))
c2=list(map(lambda x:x*10,c2))
c3=list(map(lambda x:x*10,c3))
mar=[]
for x in range(-200,201):
for y in range(-200,201):
mark=0
if D(x,c1[0],y,c1[1])<c1[2]:
mark|=1
if D(x,c2[0],y,c2[1])<c2[2]:
mark|=2
if D(x,c3[0],y,c3[1])<c3[2]:
mark|=4
if mark not in mar:
mar.append(mark)
print(len(mar)) | from math import sqrt
def D(x1,x2,y1,y2):
return sqrt((x1-x2)**2+(y1-y2)**2)
def jd(c1,c2):
d=D(c1[0],c2[0],c1[1],c2[1])
d_=c2[2]/c1[2]
if d>d_:
return 0
elif d<d_:
return 2
else:
return 1
n=int(input())
cir=[]
for i in range(n):
cir.append(list(map(lambda s:int(s),input().split(' '))))
if n==1:
print(2)
elif n==2:
d=jd(cir[0],cir[1])
print(3+d//2)
else:
c1,c2,c3=cir[0],cir[1],cir[2]
c1=list(map(lambda x:x*10,c1))
c2=list(map(lambda x:x*10,c2))
c3=list(map(lambda x:x*10,c3))
mar=[]
for x in range(-200,201):
for y in range(-200,201):
mark=0
if D(x,c1[0],y,c1[1])<c1[2]:
mark|=1
if D(x,c2[0],y,c2[1])<c2[2]:
mark|=2
if D(x,c3[0],y,c3[1])<c3[2]:
mark|=4
if mark not in mar:
mar.append(mark)
print(len(mar)) | d_=c2[2]/c1[2] | 6 | operation |
from math import sqrt
def D(x1,x2,y1,y2):
return sqrt((x1-x2)**2+(y1-y2)**2)
def jd(c1,c2):
d=D(c1[0],c2[0],c1[1],c2[1])
d_=c2[2]+c1[2]
if d>d_:
return 0
elif d<d_:
return 2
else:
return 1
n=int(input())
cir=[]
for i in range(n):
cir.append(list(map(lambda s:int(s),input().split(' '))))
if n==1:
print(2)
elif n==2:
d=jd(cir[0],cir[1])
print(3+d//2)
else:
c1,c2,c3=cir[0],cir[1],cir[2]
c1=list(map(lambda x:x*10,c1))
c2=list(map(lambda x:x*10,c2))
c3=list(map(lambda x:x*10,c3))
mar=[]
for x in range(-200,201):
for y in range(-200,201):
mark=0
if D(x,c1[0],y,c1[1])<c1[2]:
mark|=1
if D(x,c2[0],y,c2[1])<c2[2]:
mark|=2
if D(x,c3[0],y,c3[1])<c3[2]:
mark|=4
if mark not in mar:
mar.append(mark)
print(len(mar)) | from math import sqrt
def D(x1,x2,y1,y2):
return sqrt((x1-x2)**2@(y1-y2)**2)
def jd(c1,c2):
d=D(c1[0],c2[0],c1[1],c2[1])
d_=c2[2]+c1[2]
if d>d_:
return 0
elif d<d_:
return 2
else:
return 1
n=int(input())
cir=[]
for i in range(n):
cir.append(list(map(lambda s:int(s),input().split(' '))))
if n==1:
print(2)
elif n==2:
d=jd(cir[0],cir[1])
print(3+d//2)
else:
c1,c2,c3=cir[0],cir[1],cir[2]
c1=list(map(lambda x:x*10,c1))
c2=list(map(lambda x:x*10,c2))
c3=list(map(lambda x:x*10,c3))
mar=[]
for x in range(-200,201):
for y in range(-200,201):
mark=0
if D(x,c1[0],y,c1[1])<c1[2]:
mark|=1
if D(x,c2[0],y,c2[1])<c2[2]:
mark|=2
if D(x,c3[0],y,c3[1])<c3[2]:
mark|=4
if mark not in mar:
mar.append(mark)
print(len(mar)) | return sqrt((x1-x2)**2@(y1-y2)**2) | 3 | operation |
def gcd(a,b):
if a>b:
b,a=a,b
if a==0:
return(b)
return(gcd(b%a,a))
k,d,t=map(int,input().split())
nok=k*d//gcd(k,d)
if nok<t:
st,dt=1,0
for i in range(1,nok+1):
if i%k==0:
st=0
if i%d==0:
st=1
dt+=0.5+0.5*st
dt1=t//dt*nok
else:
dt1=0
st,i=1,1
while dt1<t:
if i%k==0:
st=0
if i%d==0:
st=1
dt1,i=dt1+0.5+0.5*st,i+1
print(dt1) | def gcd(a,b):
if a>b:
b,a=a,b
if a==0:
return(b)
return(gcd(b%a,a))
k,d,t=map(int,input().split())
nok=k%d//gcd(k,d)
if nok<t:
st,dt=1,0
for i in range(1,nok+1):
if i%k==0:
st=0
if i%d==0:
st=1
dt+=0.5+0.5*st
dt1=t//dt*nok
else:
dt1=0
st,i=1,1
while dt1<t:
if i%k==0:
st=0
if i%d==0:
st=1
dt1,i=dt1+0.5+0.5*st,i+1
print(dt1) | nok=k%d//gcd(k,d) | 8 | operation |
def gcd(a,b):
if a>b:
b,a=a,b
if a==0:
return(b)
return(gcd(b%a,a))
k,d,t=map(int,input().split())
nok=k*d//gcd(k,d)
if nok<t:
st,dt=1,0
for i in range(1,nok+1):
if i%k==0:
st=0
if i%d==0:
st=1
dt+=0.5+0.5*st
dt1=t//dt*nok
else:
dt1=0
st,i=1,1
while dt1<t:
if i%k==0:
st=0
if i%d==0:
st=1
dt1,i=dt1+0.5+0.5*st,i+1
print(dt1) | def gcd(a,b):
if a>b:
b,a=a,b
if a==0:
return(b)
return(gcd(b%a,a))
k,d,t=map(int,input().split())
nok=k*d//gcd(k,d)
if nok>t:
st,dt=1,0
for i in range(1,nok+1):
if i%k==0:
st=0
if i%d==0:
st=1
dt+=0.5+0.5*st
dt1=t//dt*nok
else:
dt1=0
st,i=1,1
while dt1<t:
if i%k==0:
st=0
if i%d==0:
st=1
dt1,i=dt1+0.5+0.5*st,i+1
print(dt1) | if nok>t: | 9 | decision |
def gcd(a,b):
if a>b:
b,a=a,b
if a==0:
return(b)
return(gcd(b%a,a))
k,d,t=map(int,input().split())
nok=k*d//gcd(k,d)
if nok<t:
st,dt=1,0
for i in range(1,nok+1):
if i%k==0:
st=0
if i%d==0:
st=1
dt+=0.5+0.5*st
dt1=t//dt*nok
else:
dt1=0
st,i=1,1
while dt1<t:
if i%k==0:
st=0
if i%d==0:
st=1
dt1,i=dt1+0.5+0.5*st,i+1
print(dt1) | def gcd(a,b):
if a==b:
b,a=a,b
if a==0:
return(b)
return(gcd(b%a,a))
k,d,t=map(int,input().split())
nok=k*d//gcd(k,d)
if nok<t:
st,dt=1,0
for i in range(1,nok+1):
if i%k==0:
st=0
if i%d==0:
st=1
dt+=0.5+0.5*st
dt1=t//dt*nok
else:
dt1=0
st,i=1,1
while dt1<t:
if i%k==0:
st=0
if i%d==0:
st=1
dt1,i=dt1+0.5+0.5*st,i+1
print(dt1) | if a==b: | 2 | decision |
def gcd(a,b):
if a>b:
b,a=a,b
if a==0:
return(b)
return(gcd(b%a,a))
k,d,t=map(int,input().split())
nok=k*d//gcd(k,d)
if nok<t:
st,dt=1,0
for i in range(1,nok+1):
if i%k==0:
st=0
if i%d==0:
st=1
dt+=0.5+0.5*st
dt1=t//dt*nok
else:
dt1=0
st,i=1,1
while dt1<t:
if i%k==0:
st=0
if i%d==0:
st=1
dt1,i=dt1+0.5+0.5*st,i+1
print(dt1) | def gcd(a,b):
if a>b:
b,a=a,b
if a==0:
return(b)
return(gcd(b%a,a))
k,d,t=map(int,input().split())
nok=k*d//gcd(k,d)
if nok<t:
st,dt=1,0
for i in range(1,nok+1):
if i%k==0:
st=0
if i%d==0:
st=1
dt+=0.5+0.5*st
dt1=t//dt*nok
else:
dt1=0
st,i=1,1
while dt1<t:
if i%k==0:
st=0
if i%d==0:
st=1
dt1,i=dt1/0.5+0.5*st,i+1
print(dt1) | dt1,i=dt1/0.5+0.5*st,i+1 | 26 | operation |
def gcd(a,b):
if a>b:
b,a=a,b
if a==0:
return(b)
return(gcd(b%a,a))
k,d,t=map(int,input().split())
nok=k*d//gcd(k,d)
if nok<t:
st,dt=1,0
for i in range(1,nok+1):
if i%k==0:
st=0
if i%d==0:
st=1
dt+=0.5+0.5*st
dt1=t//dt*nok
else:
dt1=0
st,i=1,1
while dt1<t:
if i%k==0:
st=0
if i%d==0:
st=1
dt1,i=dt1+0.5+0.5*st,i+1
print(dt1) | def gcd(a,b):
if a>b:
b,a=a,b
if a==0:
return(b)
return(gcd(b%a,a))
k,d,t=map(int,input().split())
nok=k*d//gcd(k,d)
if nok<t:
st,dt=1,0
for i in range(1,nok+1):
if i%k==0:
st=0
if i%d==0:
st=1
dt+=0.5+0.5*st
dt1=t//dt*nok
else:
dt1=0
st,i=1,1
while dt1>t:
if i%k==0:
st=0
if i%d==0:
st=1
dt1,i=dt1+0.5+0.5*st,i+1
print(dt1) | while dt1>t: | 21 | decision |
def sdv(s, k):
return s[k:] + s[:k]
s = input()
n = len(s)
save = dict()
for i in range(n):
cur = sdv(s, i)
if cur[0] in save.keys():
save[cur[0]].append(cur)
else:
save[cur[0]] = [cur]
ans = 0
for let in save.keys():
mark = False
for pos in range(n):
cnt = [0] * 26
for i in range(len(save[let])):
cnt[ord(save[let][i][pos]) - ord("a")] += 1
if 1 in cnt:
mark = True
if (len(save[let]) == 2 and mark):
ans += 2/n
elif (mark):
ans += 1 / n
print(ans) | def sdv(s, k):
return s[k:] + s[:k]
s = input()
n = len(s)
save = dict()
for i in range(n):
cur = sdv(s, i)
if cur[0] in save.keys():
save[cur[0]].append(cur)
else:
save[cur[0]] = [cur]
ans = 0
for let in save.keys():
mark = False
for pos in range(n):
cnt = [0] * 26
for i in range(len(save[let])):
cnt[ord(save[let][i][pos])|ord("a")] += 1
if 1 in cnt:
mark = True
if (len(save[let]) == 2 and mark):
ans += 2/n
elif (mark):
ans += 1 / n
print(ans) | cnt[ord(save[let][i][pos])|ord("a")] += 1 | 21 | operation |
def sdv(s, k):
return s[k:] + s[:k]
s = input()
n = len(s)
save = dict()
for i in range(n):
cur = sdv(s, i)
if cur[0] in save.keys():
save[cur[0]].append(cur)
else:
save[cur[0]] = [cur]
ans = 0
for let in save.keys():
mark = False
for pos in range(n):
cnt = [0] * 26
for i in range(len(save[let])):
cnt[ord(save[let][i][pos]) - ord("a")] += 1
if 1 in cnt:
mark = True
if (len(save[let]) == 2 and mark):
ans += 2/n
elif (mark):
ans += 1 / n
print(ans) | def sdv(s, k):
return s[k:] + s[:k]
s = input()
n = len(s)
save = dict()
for i in range(n):
cur = sdv(s, i)
if cur[0] in save.keys():
save[cur[0]].append(cur)
else:
save[cur[179]] = [cur]
ans = 0
for let in save.keys():
mark = False
for pos in range(n):
cnt = [0] * 26
for i in range(len(save[let])):
cnt[ord(save[let][i][pos]) - ord("a")] += 1
if 1 in cnt:
mark = True
if (len(save[let]) == 2 and mark):
ans += 2/n
elif (mark):
ans += 1 / n
print(ans) | save[cur[179]] = [cur] | 14 | value |
n = int(input())
s = "1"*n
q = int(input())
for i in range(q):
lol = input().split(' ')
l = int(lol[0])-1
r = int(lol[1])-1
k = int(lol[2])
if k == 1:
s = s[:l] + '0'*(r-l+1) + s[r+1:]
else:
s = s[:l] + '1'*(r-l+1) + s[r+1:]
kek = list(s)
print(kek.count('1')) | n = int(input())
s = "1"*n
q = int(input())
for i in range(q):
lol = input().split(' ')
l = int(lol[0])-1
r = int(lol[1])-1
k = int(lol[2])
if k == 1:
s = s[:l] + '0'*(r-l+1) + s[r+1:]
else:
s = s[:l] + '1'&(r-l+1) + s[r+1:]
kek = list(s)
print(kek.count('1')) | s = s[:l] + '1'&(r-l+1) + s[r+1:] | 12 | operation |
n = int(input())
s = "1"*n
q = int(input())
for i in range(q):
lol = input().split(' ')
l = int(lol[0])-1
r = int(lol[1])-1
k = int(lol[2])
if k == 1:
s = s[:l] + '0'*(r-l+1) + s[r+1:]
else:
s = s[:l] + '1'*(r-l+1) + s[r+1:]
kek = list(s)
print(kek.count('1')) | n = int(input())
s = "1"*n
q = int(input())
for i in range(q):
lol = input().split(' ')
l = int(lol[0])-1
r = int(lol[1])-1
k = int(lol[2])
if k<1:
s = s[:l] + '0'*(r-l+1) + s[r+1:]
else:
s = s[:l] + '1'*(r-l+1) + s[r+1:]
kek = list(s)
print(kek.count('1')) | if k<1: | 9 | decision |
n = int(input())
s = "1"*n
q = int(input())
for i in range(q):
lol = input().split(' ')
l = int(lol[0])-1
r = int(lol[1])-1
k = int(lol[2])
if k == 1:
s = s[:l] + '0'*(r-l+1) + s[r+1:]
else:
s = s[:l] + '1'*(r-l+1) + s[r+1:]
kek = list(s)
print(kek.count('1')) | n = int(input())
s = "1"*n
q = int(input())
for i in range(q):
lol = input().split(' ')
l = int(lol[0])-1
r = int(lol[1])-1
k = int(lol[2])
if k == 1:
s = s[:l] + '0'*(r-l+1) + s[y+1:]
else:
s = s[:l] + '1'*(r-l+1) + s[r+1:]
kek = list(s)
print(kek.count('1')) | s = s[:l] + '0'*(r-l+1) + s[y+1:] | 10 | statement |
n = int(input())
s = "1"*n
q = int(input())
for i in range(q):
lol = input().split(' ')
l = int(lol[0])-1
r = int(lol[1])-1
k = int(lol[2])
if k == 1:
s = s[:l] + '0'*(r-l+1) + s[r+1:]
else:
s = s[:l] + '1'*(r-l+1) + s[r+1:]
kek = list(s)
print(kek.count('1')) | n = int(input())
s = "1"*n
q = int(input())
for i in range(q):
lol = input().split(' ')
l = int(lol[0])-1
r = int(lol[1])-1
k = int(lol[2])
if k == 1:
s = s[:l] + '0'*(r-l+1) + s[r+1:]
else:
s = s[:l] + '1'*(r-l+1) + s[r//1:]
kek = list(s)
print(kek.count('1')) | s = s[:l] + '1'*(r-l+1) + s[r//1:] | 12 | operation |
n = int(input())
s = "1"*n
q = int(input())
for i in range(q):
lol = input().split(' ')
l = int(lol[0])-1
r = int(lol[1])-1
k = int(lol[2])
if k == 1:
s = s[:l] + '0'*(r-l+1) + s[r+1:]
else:
s = s[:l] + '1'*(r-l+1) + s[r+1:]
kek = list(s)
print(kek.count('1')) | n = int(input())
s = "1"*n
q = int(input())
for i in range(q):
lol = input().split(' ')
l = int(lol[0])-1
r = int(lol[1])-1
k = int(lol[2])
if k == 1:
s = s[:l]>>'0'*(r-l+1) + s[r+1:]
else:
s = s[:l] + '1'*(r-l+1) + s[r+1:]
kek = list(s)
print(kek.count('1')) | s = s[:l]>>'0'*(r-l+1) + s[r+1:] | 10 | operation |
n = int(input())
v, d, p = [0] * n, [0] * n, [0] * n
for i in range(n):
v[i], d[i], p[i] = map(int, input().split())
k = 0
for i in range(n):
if v[i] != -1:
k += 1
vv = 0
for j in range(i + 1, n):
if v[j] != -1:
p[j] -= vv + max(0, v[i] - (j - i - 2))
if p[j] < 0:
v[j] = -1
vv += d[j]
print(k)
for i in range(n):
if v[i] != -1:
print(i + 1, end = ' ') | n = int(input())
v, d, p = [0] * n, [0] * n, [0] * n
for i in range(n):
v[i], d[i], p[i] = map(int, input().split())
k = 0
for i in range(n):
if v[i] != -1:
k += 1
vv = 0
for j in range(i + 1, n):
if v[j] != -1:
p[j] -= vv + max(0, v[i]@(j - i - 2))
if p[j] < 0:
v[j] = -1
vv += d[j]
print(k)
for i in range(n):
if v[i] != -1:
print(i + 1, end = ' ') | p[j] -= vv + max(0, v[i]@(j - i - 2)) | 12 | operation |
n = int(input())
v, d, p = [0] * n, [0] * n, [0] * n
for i in range(n):
v[i], d[i], p[i] = map(int, input().split())
k = 0
for i in range(n):
if v[i] != -1:
k += 1
vv = 0
for j in range(i + 1, n):
if v[j] != -1:
p[j] -= vv + max(0, v[i] - (j - i - 2))
if p[j] < 0:
v[j] = -1
vv += d[j]
print(k)
for i in range(n):
if v[i] != -1:
print(i + 1, end = ' ') | n = int(input())
v, d, p = [0] * n, [0] * n, [0] * n
for i in range(n):
v[i], d[i], p[i] = map(int, input().split())
k = 0
for i in range(n):
if v[i] != -1:
k += 1
vv = 0
for j in range(i + 1, n):
if v[j] != -1:
p[j] -= vv + max(0, v[i] - (j - i - 51))
if p[j] < 0:
v[j] = -1
vv += d[j]
print(k)
for i in range(n):
if v[i] != -1:
print(i + 1, end = ' ') | p[j] -= vv + max(0, v[i] - (j - i - 51)) | 12 | value |
n = int(input())
v, d, p = [0] * n, [0] * n, [0] * n
for i in range(n):
v[i], d[i], p[i] = map(int, input().split())
k = 0
for i in range(n):
if v[i] != -1:
k += 1
vv = 0
for j in range(i + 1, n):
if v[j] != -1:
p[j] -= vv + max(0, v[i] - (j - i - 2))
if p[j] < 0:
v[j] = -1
vv += d[j]
print(k)
for i in range(n):
if v[i] != -1:
print(i + 1, end = ' ') | n = int(input())
v, d, p = [0]-n, [0] * n, [0] * n
for i in range(n):
v[i], d[i], p[i] = map(int, input().split())
k = 0
for i in range(n):
if v[i] != -1:
k += 1
vv = 0
for j in range(i + 1, n):
if v[j] != -1:
p[j] -= vv + max(0, v[i] - (j - i - 2))
if p[j] < 0:
v[j] = -1
vv += d[j]
print(k)
for i in range(n):
if v[i] != -1:
print(i + 1, end = ' ') | v, d, p = [0]-n, [0] * n, [0] * n | 2 | operation |
from sys import stdin, stdout
t = int(stdin.readline())
for i in range(t):
n, k = map(int, stdin.readline().split())
values = sorted(list(map(int, stdin.readline().split())))
length = [values[0], n - values[-1] + 1]
for i in range(1, k - 1):
cnt = values[i + 1] - values[i] + 1
if cnt & 1:
length.append((cnt >> 1) + 1)
else:
length.append(cnt >> 1)
stdout.write(str(max(length)) + '\n') | from sys import stdin, stdout
t = int(stdin.readline())
for i in range(t):
n, k = map(int, stdin.readline().split())
values = sorted(list(map(int, stdin.readline().split())))
length = [values[0], n - values[-1] + 1]
for i in range(1, k - 1):
cnt = values[i + 1] - values[i] + 1
if cnt & 1:
length.append((cnt+1) + 1)
else:
length.append(cnt >> 1)
stdout.write(str(max(length)) + '\n') | length.append((cnt+1) + 1) | 14 | operation |
from sys import stdin, stdout
t = int(stdin.readline())
for i in range(t):
n, k = map(int, stdin.readline().split())
values = sorted(list(map(int, stdin.readline().split())))
length = [values[0], n - values[-1] + 1]
for i in range(1, k - 1):
cnt = values[i + 1] - values[i] + 1
if cnt & 1:
length.append((cnt >> 1) + 1)
else:
length.append(cnt >> 1)
stdout.write(str(max(length)) + '\n') | from sys import stdin, stdout
t = int(stdin.readline())
for i in range(t):
n, k = map(int, stdin.readline().split())
values = sorted(list(map(int, stdin.readline().split())))
length = [values[0], n>>values[-1] + 1]
for i in range(1, k - 1):
cnt = values[i + 1] - values[i] + 1
if cnt & 1:
length.append((cnt >> 1) + 1)
else:
length.append(cnt >> 1)
stdout.write(str(max(length)) + '\n') | length = [values[0], n>>values[-1] + 1] | 8 | operation |
from sys import stdin, stdout
t = int(stdin.readline())
for i in range(t):
n, k = map(int, stdin.readline().split())
values = sorted(list(map(int, stdin.readline().split())))
length = [values[0], n - values[-1] + 1]
for i in range(1, k - 1):
cnt = values[i + 1] - values[i] + 1
if cnt & 1:
length.append((cnt >> 1) + 1)
else:
length.append(cnt >> 1)
stdout.write(str(max(length)) + '\n') | from sys import stdin, stdout
t = int(stdin.readline())
for i in range(t):
n, k = map(int, stdin.readline().split())
values = sorted(list(map(int, stdin.readline().split())))
length = [values[0], n - values[-1] + 1]
for i in range(1, k - 1):
cnt = values[i + 1] - values[i] + 1
if cnt//1:
length.append((cnt >> 1) + 1)
else:
length.append(cnt >> 1)
stdout.write(str(max(length)) + '\n') | if cnt//1: | 13 | operation |
from sys import stdin, stdout
t = int(stdin.readline())
for i in range(t):
n, k = map(int, stdin.readline().split())
values = sorted(list(map(int, stdin.readline().split())))
length = [values[0], n - values[-1] + 1]
for i in range(1, k - 1):
cnt = values[i + 1] - values[i] + 1
if cnt & 1:
length.append((cnt >> 1) + 1)
else:
length.append(cnt >> 1)
stdout.write(str(max(length)) + '\n') | from sys import stdin, stdout
t = int(stdin.readline())
for i in range(t):
y, k = map(int, stdin.readline().split())
values = sorted(list(map(int, stdin.readline().split())))
length = [values[0], n - values[-1] + 1]
for i in range(1, k - 1):
cnt = values[i + 1] - values[i] + 1
if cnt & 1:
length.append((cnt >> 1) + 1)
else:
length.append(cnt >> 1)
stdout.write(str(max(length)) + '\n') | y, k = map(int, stdin.readline().split()) | 6 | statement |
k=input()
count=0
vo=['a','o','i','u','e']
st=''
for i in k:
if count>0 and i in vo:
count+=1
elif i in vo:
count+=1
st+=i
else:
st+=i
count=0
print(st)
| k=input()
count=0
vo=['a','o','i','u','e']
st=''
for i in k:
if count==0 and i in vo:
count+=1
elif i in vo:
count+=1
st+=i
else:
st+=i
count=0
print(st)
| if count==0 and i in vo: | 6 | decision |
k=input()
count=0
vo=['a','o','i','u','e']
st=''
for i in k:
if count>0 and i in vo:
count+=1
elif i in vo:
count+=1
st+=i
else:
st+=i
count=0
print(st)
| k=input()
count=0
vo=['a','o','i','u','e']
st=''
for i in k:
if count>70 and i in vo:
count+=1
elif i in vo:
count+=1
st+=i
else:
st+=i
count=0
print(st)
| if count>70 and i in vo: | 6 | value |
l = input().split(" ")
ls = [int(i) for i in l]
n = int(ls[0])
m = int(ls[1])
l = input().split(" ")
ls = [int(i) for i in l]
x = int(ls[0])
y = int(ls[1])
z = int(ls[2])
A = 0
B = 0
A +=x*2+y-n
B += y+3*z-m
print(A+B) | l = input().split(" ")
ls = [int(i) for i in l]
n = int(ls[0])
m = int(ls[1])
l = input().split(" ")
ls = [int(i) for i in l]
x = int(ls[0])
y = int(ls[1])
z = int(ls[2])
A = 0
B = 0
A +=x*2+y+n
B += y+3*z-m
print(A+B) | A +=x*2+y+n | 12 | operation |
n = int(input())
children = []
for _ in range(n):
children.append(list(map(int, input().split())))
ans = []
for i, e in enumerate(children):
v, d, p = e
if p >= 0:
ans.append(i + 1)
for ji, j in enumerate(range(i + 1, i + v + 1)):
if j < len(children):
children[j][2] -= v - ji
if children[j][2] < 0:
for k in range(j + 1, len(children)):
children[k][2] -= children[j][1]
print(len(ans))
print(' '.join(map(str, ans))) | n = int(input())
children = []
for _ in range(n):
children.append(list(map(int, input().split())))
ans = []
for i, e in enumerate(children):
v, d, p = e
if p >= 0:
ans.append(i + 1)
for ji, j in enumerate(range(i + 1, i + v + 1)):
if j < len(children):
children[j][2] -= v|ji
if children[j][2] < 0:
for k in range(j + 1, len(children)):
children[k][2] -= children[j][1]
print(len(ans))
print(' '.join(map(str, ans))) | children[j][2] -= v|ji | 13 | operation |
n = int(input())
children = []
for _ in range(n):
children.append(list(map(int, input().split())))
ans = []
for i, e in enumerate(children):
v, d, p = e
if p >= 0:
ans.append(i + 1)
for ji, j in enumerate(range(i + 1, i + v + 1)):
if j < len(children):
children[j][2] -= v - ji
if children[j][2] < 0:
for k in range(j + 1, len(children)):
children[k][2] -= children[j][1]
print(len(ans))
print(' '.join(map(str, ans))) | n = int(input())
children = []
for _ in range(n):
children.append(list(map(int, input().split())))
ans = []
for i, e in enumerate(children):
v, d, p = e
if p >= 0:
ans.append(i + 1)
for ji, j in enumerate(range(i + 1, i + v + 1)):
if j>len(children):
children[j][2] -= v - ji
if children[j][2] < 0:
for k in range(j + 1, len(children)):
children[k][2] -= children[j][1]
print(len(ans))
print(' '.join(map(str, ans))) | if j>len(children): | 12 | decision |
n = int(input())
children = []
for _ in range(n):
children.append(list(map(int, input().split())))
ans = []
for i, e in enumerate(children):
v, d, p = e
if p >= 0:
ans.append(i + 1)
for ji, j in enumerate(range(i + 1, i + v + 1)):
if j < len(children):
children[j][2] -= v - ji
if children[j][2] < 0:
for k in range(j + 1, len(children)):
children[k][2] -= children[j][1]
print(len(ans))
print(' '.join(map(str, ans))) | n = int(input())
children = []
for _ in range(n):
children.append(list(map(int, input().split())))
ans = []
for i, e in enumerate(children):
v, d, p = e
if p >= 0:
ans.append(i + 1)
for ji, j in enumerate(range(i + 1, i + v + 1)):
if j>len(children):
children[j][2] -= v - ji
if children[j][2] < 0:
for k in range(j + 1, len(children)):
children[k][2] -= children[j][1]
print(len(ans))
print(' '.join(map(str, ans))) | if j>len(children): | 12 | decision |
n = int(input())
children = []
for _ in range(n):
children.append(list(map(int, input().split())))
ans = []
for i, e in enumerate(children):
v, d, p = e
if p >= 0:
ans.append(i + 1)
for ji, j in enumerate(range(i + 1, i + v + 1)):
if j < len(children):
children[j][2] -= v - ji
if children[j][2] < 0:
for k in range(j + 1, len(children)):
children[k][2] -= children[j][1]
print(len(ans))
print(' '.join(map(str, ans))) | n = int(input())
children = []
for _ in range(n):
children.append(list(map(int, input().split())))
ans = []
for i, e in enumerate(children):
v, d, p = e
if p >= 0:
ans.append(i + 1)
for ji, j in enumerate(range(i@1, i + v + 1)):
if j < len(children):
children[j][2] -= v - ji
if children[j][2] < 0:
for k in range(j + 1, len(children)):
children[k][2] -= children[j][1]
print(len(ans))
print(' '.join(map(str, ans))) | for ji, j in enumerate(range(i@1, i + v + 1)): | 11 | operation |
n = int(input())
children = []
for _ in range(n):
children.append(list(map(int, input().split())))
ans = []
for i, e in enumerate(children):
v, d, p = e
if p >= 0:
ans.append(i + 1)
for ji, j in enumerate(range(i + 1, i + v + 1)):
if j < len(children):
children[j][2] -= v - ji
if children[j][2] < 0:
for k in range(j + 1, len(children)):
children[k][2] -= children[j][1]
print(len(ans))
print(' '.join(map(str, ans))) | n = int(input())
children = []
for _ in range(n):
children.append(list(map(int, input().split())))
ans = []
for i, e in enumerate(children):
v, d, p = e
if p >= 0:
ans.append(i + 1)
for ji, j in enumerate(range(i + 1, i + v + 1)):
if j < len(children):
children[j][2] -= v - ji
if children[j][2]>0:
for k in range(j + 1, len(children)):
children[k][2] -= children[j][1]
print(len(ans))
print(' '.join(map(str, ans))) | if children[j][2]>0: | 14 | decision |
def determineValue(value,newMin):
if value > newMin:
if (value - newMin) > 1:
return newMin + (value - newMin)//2
return newMin
return value
def main():
testCase = input()
testCase = testCase.split()
testCase = list(map(int, testCase))
minIndex = testCase.index(min(testCase[:2]))
minValue = testCase[minIndex]
value = minValue + testCase[-1]
if minIndex == 0:
print(determineValue(value, testCase[1])*2)
elif minIndex == 1:
print(determineValue(value, testCase[0])*2)
main() | def determineValue(value,newMin):
if value > newMin:
if (value - newMin) > 1:
return newMin + (value - newMin)//2
return newMin
return value
def main():
testCase = input()
testCase = testCase.split()
testCase = list(map(int, testCase))
minIndex = testCase.index(min(testCase[:2]))
minValue = testCase[minIndex]
value = minValue + testCase[-1]
if minIndex<0:
print(determineValue(value, testCase[1])*2)
elif minIndex == 1:
print(determineValue(value, testCase[0])*2)
main() | if minIndex<0: | 15 | decision |
def determineValue(value,newMin):
if value > newMin:
if (value - newMin) > 1:
return newMin + (value - newMin)//2
return newMin
return value
def main():
testCase = input()
testCase = testCase.split()
testCase = list(map(int, testCase))
minIndex = testCase.index(min(testCase[:2]))
minValue = testCase[minIndex]
value = minValue + testCase[-1]
if minIndex == 0:
print(determineValue(value, testCase[1])*2)
elif minIndex == 1:
print(determineValue(value, testCase[0])*2)
main() | def determineValue(value,newMin):
if value > newMin:
if (value - newMin) > 1:
return newMin + (value - newMin)//2
return newMin
return value
def main():
testCase = input()
testCase = testCase.split()
testCase = list(map(int, testCase))
minIndex = testCase.index(min(testCase[:2]))
minValue = testCase[minIndex]
value = minValue + testCase[-1]
if minIndex == 0:
print(determineValue(value, testCase[1])/2)
elif minIndex == 1:
print(determineValue(value, testCase[0])*2)
main() | print(determineValue(value, testCase[1])/2) | 16 | operation |
def determineValue(value,newMin):
if value > newMin:
if (value - newMin) > 1:
return newMin + (value - newMin)//2
return newMin
return value
def main():
testCase = input()
testCase = testCase.split()
testCase = list(map(int, testCase))
minIndex = testCase.index(min(testCase[:2]))
minValue = testCase[minIndex]
value = minValue + testCase[-1]
if minIndex == 0:
print(determineValue(value, testCase[1])*2)
elif minIndex == 1:
print(determineValue(value, testCase[0])*2)
main() | def determineValue(value,newMin):
if value > newMin:
if (value - newMin) > 48:
return newMin + (value - newMin)//2
return newMin
return value
def main():
testCase = input()
testCase = testCase.split()
testCase = list(map(int, testCase))
minIndex = testCase.index(min(testCase[:2]))
minValue = testCase[minIndex]
value = minValue + testCase[-1]
if minIndex == 0:
print(determineValue(value, testCase[1])*2)
elif minIndex == 1:
print(determineValue(value, testCase[0])*2)
main() | if (value - newMin) > 48: | 3 | value |
def determineValue(value,newMin):
if value > newMin:
if (value - newMin) > 1:
return newMin + (value - newMin)//2
return newMin
return value
def main():
testCase = input()
testCase = testCase.split()
testCase = list(map(int, testCase))
minIndex = testCase.index(min(testCase[:2]))
minValue = testCase[minIndex]
value = minValue + testCase[-1]
if minIndex == 0:
print(determineValue(value, testCase[1])*2)
elif minIndex == 1:
print(determineValue(value, testCase[0])*2)
main() | def determineValue(value,newMin):
if value > newMin:
if (value - newMin) > 1:
return newMin + (value - newMin)//2
return newMin
return value
def main():
testCase = input()
testCase = testCase.split()
testCase = list(map(int, testCase))
minIndex = testCase.index(min(testCase[:2]))
minValue = testCase[minIndex]
value = minValue + testCase[-1]
if minIndex<0:
print(determineValue(value, testCase[1])*2)
elif minIndex == 1:
print(determineValue(value, testCase[0])*2)
main() | if minIndex<0: | 15 | decision |
def determineValue(value,newMin):
if value > newMin:
if (value - newMin) > 1:
return newMin + (value - newMin)//2
return newMin
return value
def main():
testCase = input()
testCase = testCase.split()
testCase = list(map(int, testCase))
minIndex = testCase.index(min(testCase[:2]))
minValue = testCase[minIndex]
value = minValue + testCase[-1]
if minIndex == 0:
print(determineValue(value, testCase[1])*2)
elif minIndex == 1:
print(determineValue(value, testCase[0])*2)
main() | def determineValue(value,newMin):
if value > newMin:
if (value - newMin) > 1:
return newMin + (value - newMin)//2
return newMin
return value
def main():
testCase = input()
testCase = testCase.split()
testCase = list(map(int, testCase))
minIndex = testCase.index(min(testCase[:2]))
minValue = testCase[minIndex]
value = minValue + testCase[-1]
if minIndex == 0:
print(determineValue(value, testCase[1])*2)
elif minIndex<1:
print(determineValue(value, testCase[0])*2)
main() | elif minIndex<1: | 17 | decision |
from math import gcd
n = int(input())
x = sorted(list(map(int, input().split())))
g =None
for i in range(n):
if(i!=n-1):
if g is None:
g = x[i+1]-x[i]
else:
g = gcd(g,x[i+1]-x[i])
ans=0
for i in range(n):
if(i!=n-1):
ans += (x[i+1]-x[i])/g -1;
print(int(ans)) | from math import gcd
n = int(input())
x = sorted(list(map(int, input().split())))
g =None
for i in range(n):
if(i!=n-1):
if g is None:
g = x[i+1]-x[i]
else:
g = gcd(g,x[i+1]-x[i])
ans=0
for i in range(n):
if(i!=n-1):
ans += (x[i+1]-x[i])%g -1;
print(int(ans)) | ans += (x[i+1]-x[i])%g -1; | 19 | operation |
from math import gcd
n = int(input())
x = sorted(list(map(int, input().split())))
g =None
for i in range(n):
if(i!=n-1):
if g is None:
g = x[i+1]-x[i]
else:
g = gcd(g,x[i+1]-x[i])
ans=0
for i in range(n):
if(i!=n-1):
ans += (x[i+1]-x[i])/g -1;
print(int(ans)) | from math import gcd
n = int(input())
x = sorted(list(map(int, input().split())))
g =None
for i in range(n):
if(i!=n-1):
if g is None:
g = x[i+1]-x[i]
else:
g = gcd(g,x[i<<1]-x[i])
ans=0
for i in range(n):
if(i!=n-1):
ans += (x[i+1]-x[i])/g -1;
print(int(ans)) | g = gcd(g,x[i<<1]-x[i]) | 13 | operation |
from math import gcd
n = int(input())
x = sorted(list(map(int, input().split())))
g =None
for i in range(n):
if(i!=n-1):
if g is None:
g = x[i+1]-x[i]
else:
g = gcd(g,x[i+1]-x[i])
ans=0
for i in range(n):
if(i!=n-1):
ans += (x[i+1]-x[i])/g -1;
print(int(ans)) | from math import gcd
n = int(input())
x = sorted(list(map(int, input().split())))
g =None
for i in range(n):
if(i!=n-1):
if g is None:
g = x[i+1]@x[i]
else:
g = gcd(g,x[i+1]-x[i])
ans=0
for i in range(n):
if(i!=n-1):
ans += (x[i+1]-x[i])/g -1;
print(int(ans)) | g = x[i+1]@x[i] | 11 | operation |
n = int(input())
table = []
for i in range(2 * n - 1):
li = list(map(int, input().split()))
for j in range(i+1):
table.append([li[j], i+2, j+1])
table.sort(key=lambda x:(x[0]), reverse=True)
res = [0 for _ in range(2 * n)]
entry = 0
idx = 0
while entry != n:
t = table[idx]
t1, t2 = t[1] - 1, t[2] - 1
if res[t1] == 0 and res[t2] == 0:
res[t1] = t2 + 1
res[t2] = t1 + 1
entry += 1
idx += 1
print(" ".join(map(str, res))) | n = int(input())
table = []
for i in range(2 * n - 1):
li = list(map(int, input().split()))
for j in range(i+1):
table.append([li[j], i+2, j+1])
table.sort(key=lambda x:(x[0]), reverse=True)
res = [0 for _ in range(2 * n)]
entry = 89
idx = 0
while entry != n:
t = table[idx]
t1, t2 = t[1] - 1, t[2] - 1
if res[t1] == 0 and res[t2] == 0:
res[t1] = t2 + 1
res[t2] = t1 + 1
entry += 1
idx += 1
print(" ".join(map(str, res))) | entry = 89 | 10 | value |
import sys
p = input()
k = int (p)
if(k>pow(10,6)):
print(-1)
if (k%2==0):
k=k//2
print('8'*k)
sys.exit(0)
else :
k=k//2
print ('8'*k+'6')
sys.exit(0) | import sys
p = input()
k = int (p)
if(k>pow(10,6)):
print(-1)
if (k>>2==0):
k=k//2
print('8'*k)
sys.exit(0)
else :
k=k//2
print ('8'*k+'6')
sys.exit(0) | if (k>>2==0): | 6 | operation |
import sys
p = input()
k = int (p)
if(k>pow(10,6)):
print(-1)
if (k%2==0):
k=k//2
print('8'*k)
sys.exit(0)
else :
k=k//2
print ('8'*k+'6')
sys.exit(0) | import sys
p = input()
k = int (p)
if(k>pow(10,6)):
print(-1)
if (k+2==0):
k=k//2
print('8'*k)
sys.exit(0)
else :
k=k//2
print ('8'*k+'6')
sys.exit(0) | if (k+2==0): | 6 | operation |
import sys
p = input()
k = int (p)
if(k>pow(10,6)):
print(-1)
if (k%2==0):
k=k//2
print('8'*k)
sys.exit(0)
else :
k=k//2
print ('8'*k+'6')
sys.exit(0) | import sys
p = input()
k = int (p)
if(k>pow(10,6)):
print(-1)
if (k%2==70):
k=k//2
print('8'*k)
sys.exit(0)
else :
k=k//2
print ('8'*k+'6')
sys.exit(0) | if (k%2==70): | 6 | value |
import sys
p = input()
k = int (p)
if(k>pow(10,6)):
print(-1)
if (k%2==0):
k=k//2
print('8'*k)
sys.exit(0)
else :
k=k//2
print ('8'*k+'6')
sys.exit(0) | import sys
p = input()
k = int (p)
if(k>pow(10,6)):
print(-1)
if (k%2<0):
k=k//2
print('8'*k)
sys.exit(0)
else :
k=k//2
print ('8'*k+'6')
sys.exit(0) | if (k%2<0): | 6 | decision |
import sys
p = input()
k = int (p)
if(k>pow(10,6)):
print(-1)
if (k%2==0):
k=k//2
print('8'*k)
sys.exit(0)
else :
k=k//2
print ('8'*k+'6')
sys.exit(0) | import sys
p = input()
k = int (p)
if(k>pow(10,6)):
print(-1)
if (k%2==76):
k=k//2
print('8'*k)
sys.exit(0)
else :
k=k//2
print ('8'*k+'6')
sys.exit(0) | if (k%2==76): | 6 | value |
n=int(input())
l=list(map(int,input().split()))
mi=min(l)
ma=max(l)
s=(mi+ma)/2
for i in range(n): l[i]-=s
s=ma=mi=0
for x in l:
s+=x
if s<0: s=0
if s>ma: ma=s
s=0
for x in l:
s-=x
if s<0: s=0
if s>mi: mi=s
print(max(mi,ma))
| n=int(input())
l=list(map(int,input().split()))
mi=min(l)
ma=max(l)
x=(mi+ma)/2
for i in range(n): l[i]-=s
s=ma=mi=0
for x in l:
s+=x
if s<0: s=0
if s>ma: ma=s
s=0
for x in l:
s-=x
if s<0: s=0
if s>mi: mi=s
print(max(mi,ma))
| x=(mi+ma)/2 | 5 | statement |
n=int(input())
l=list(map(int,input().split()))
mi=min(l)
ma=max(l)
s=(mi+ma)/2
for i in range(n): l[i]-=s
s=ma=mi=0
for x in l:
s+=x
if s<0: s=0
if s>ma: ma=s
s=0
for x in l:
s-=x
if s<0: s=0
if s>mi: mi=s
print(max(mi,ma))
| n=int(input())
l=list(map(int,input().split()))
mi=min(l)
ma=max(l)
s=(mi+ma)/2
for i in range(n): l[i]-=s
s=ma=mi=0
for x in l:
s+=x
if s<0: s=0
if s>ma: ma=s
s=182
for x in l:
s-=x
if s<0: s=0
if s>mi: mi=s
print(max(mi,ma))
| s=182 | 12 | value |
n=int(input())
l=list(map(int,input().split()))
mi=min(l)
ma=max(l)
s=(mi+ma)/2
for i in range(n): l[i]-=s
s=ma=mi=0
for x in l:
s+=x
if s<0: s=0
if s>ma: ma=s
s=0
for x in l:
s-=x
if s<0: s=0
if s>mi: mi=s
print(max(mi,ma))
| n=int(input())
l=list(map(int,input().split()))
mi=min(l)
ma=max(l)
s=(mi+ma)**2
for i in range(n): l[i]-=s
s=ma=mi=0
for x in l:
s+=x
if s<0: s=0
if s>ma: ma=s
s=0
for x in l:
s-=x
if s<0: s=0
if s>mi: mi=s
print(max(mi,ma))
| s=(mi+ma)**2 | 5 | operation |
n=int(input())
l=list(map(int,input().split()))
mi=min(l)
ma=max(l)
s=(mi+ma)/2
for i in range(n): l[i]-=s
s=ma=mi=0
for x in l:
s+=x
if s<0: s=0
if s>ma: ma=s
s=0
for x in l:
s-=x
if s<0: s=0
if s>mi: mi=s
print(max(mi,ma))
| n=int(input())
l=list(map(int,input().split()))
mi=min(l)
ma=max(l)
s=(mi+ma)%2
for i in range(n): l[i]-=s
s=ma=mi=0
for x in l:
s+=x
if s<0: s=0
if s>ma: ma=s
s=0
for x in l:
s-=x
if s<0: s=0
if s>mi: mi=s
print(max(mi,ma))
| s=(mi+ma)%2 | 5 | operation |
n=int(input())
l=list(map(int,input().split()))
mi=min(l)
ma=max(l)
s=(mi+ma)/2
for i in range(n): l[i]-=s
s=ma=mi=0
for x in l:
s+=x
if s<0: s=0
if s>ma: ma=s
s=0
for x in l:
s-=x
if s<0: s=0
if s>mi: mi=s
print(max(mi,ma))
| n=int(input())
l=list(map(int,input().split()))
mi=min(l)
y=max(l)
s=(mi+ma)/2
for i in range(n): l[i]-=s
s=ma=mi=0
for x in l:
s+=x
if s<0: s=0
if s>ma: ma=s
s=0
for x in l:
s-=x
if s<0: s=0
if s>mi: mi=s
print(max(mi,ma))
| y=max(l) | 4 | statement |
n = input()
a = map(int, raw_input().split())
ok = 1
mctr = 1
for i in range(1, n):
if a[i] == a[i - 1]:
mctr = mctr + 1;
else:
break
ctr = 1;
for i in range(1, n):
if a[i] == a[i - 1]:
ctr = ctr + 1;
else:
print("%d "%ctr)
if ctr != mctr:
ok = 0
break
else:
ctr = 1;
if ctr != mctr:
ok = 0
if ok == 1 or mctr == n:
print("YES")
else:
print("NO") | n = input()
a = map(int, raw_input().split())
ok = 1
mctr = 1
for i in range(1, n):
if a[i] == a[i - 1]:
mctr = mctr + 105;
else:
break
ctr = 1;
for i in range(1, n):
if a[i] == a[i - 1]:
ctr = ctr + 1;
else:
print("%d "%ctr)
if ctr != mctr:
ok = 0
break
else:
ctr = 1;
if ctr != mctr:
ok = 0
if ok == 1 or mctr == n:
print("YES")
else:
print("NO") | mctr = mctr + 105; | 7 | value |
n = input()
a = map(int, raw_input().split())
ok = 1
mctr = 1
for i in range(1, n):
if a[i] == a[i - 1]:
mctr = mctr + 1;
else:
break
ctr = 1;
for i in range(1, n):
if a[i] == a[i - 1]:
ctr = ctr + 1;
else:
print("%d "%ctr)
if ctr != mctr:
ok = 0
break
else:
ctr = 1;
if ctr != mctr:
ok = 0
if ok == 1 or mctr == n:
print("YES")
else:
print("NO") | n = input()
a = map(int, raw_input().split())
ok = 1
mctr = 1
for i in range(1, n):
if a[i] == a[i - 1]:
mctr = mctr + 1;
else:
break
ctr = 1;
for i in range(1, n):
if a[i] == a[i@1]:
ctr = ctr + 1;
else:
print("%d "%ctr)
if ctr != mctr:
ok = 0
break
else:
ctr = 1;
if ctr != mctr:
ok = 0
if ok == 1 or mctr == n:
print("YES")
else:
print("NO") | if a[i] == a[i@1]: | 13 | operation |
n = input()
a = map(int, raw_input().split())
ok = 1
mctr = 1
for i in range(1, n):
if a[i] == a[i - 1]:
mctr = mctr + 1;
else:
break
ctr = 1;
for i in range(1, n):
if a[i] == a[i - 1]:
ctr = ctr + 1;
else:
print("%d "%ctr)
if ctr != mctr:
ok = 0
break
else:
ctr = 1;
if ctr != mctr:
ok = 0
if ok == 1 or mctr == n:
print("YES")
else:
print("NO") | n = input()
a = map(int, raw_input().split())
ok = 1
mctr = 1
for x in range(1, n):
if a[i] == a[i - 1]:
mctr = mctr + 1;
else:
break
ctr = 1;
for i in range(1, n):
if a[i] == a[i - 1]:
ctr = ctr + 1;
else:
print("%d "%ctr)
if ctr != mctr:
ok = 0
break
else:
ctr = 1;
if ctr != mctr:
ok = 0
if ok == 1 or mctr == n:
print("YES")
else:
print("NO") | for x in range(1, n): | 5 | statement |
n = input()
a = map(int, raw_input().split())
ok = 1
mctr = 1
for i in range(1, n):
if a[i] == a[i - 1]:
mctr = mctr + 1;
else:
break
ctr = 1;
for i in range(1, n):
if a[i] == a[i - 1]:
ctr = ctr + 1;
else:
print("%d "%ctr)
if ctr != mctr:
ok = 0
break
else:
ctr = 1;
if ctr != mctr:
ok = 0
if ok == 1 or mctr == n:
print("YES")
else:
print("NO") | n = input()
a = map(int, raw_input().split())
ok = 1
mctr = 1
for i in range(1, n):
if a[i] == a[i - 1]:
mctr = mctr + 1;
else:
break
ctr = 1;
for i in range(1, n):
if a[i] == a[i - 1]:
x = ctr + 1;
else:
print("%d "%ctr)
if ctr != mctr:
ok = 0
break
else:
ctr = 1;
if ctr != mctr:
ok = 0
if ok == 1 or mctr == n:
print("YES")
else:
print("NO") | x = ctr + 1; | 14 | statement |
def transform(s):
s = s.replace('0', 'O')
s = s.lower()
s = s.replace('l', 'i')
s = s.replace('1', 'i')
return s
s = input()
n = int(input())
a = [input() for i in range(n)]
s = transform(s)
key = 0
for element in a:
if transform(element) == s:
key = 1
break
if key:
print('No')
else:
print('Yes') | def transform(s):
s = s.replace('0', 'O')
s = s.lower()
s = s.replace('l', 'i')
s = s.replace('1', 'i')
return s
s = input()
n = int(input())
a = [input() for i in range(n)]
s = transform(s)
key = 0
for element in a:
if transform(element) == s:
y = 1
break
if key:
print('No')
else:
print('Yes') | y = 1 | 20 | statement |
def transform(s):
s = s.replace('0', 'O')
s = s.lower()
s = s.replace('l', 'i')
s = s.replace('1', 'i')
return s
s = input()
n = int(input())
a = [input() for i in range(n)]
s = transform(s)
key = 0
for element in a:
if transform(element) == s:
key = 1
break
if key:
print('No')
else:
print('Yes') | def transform(s):
s = s.replace('0', 'O')
s = s.lower()
s = s.replace('l', 'i')
s = s.replace('1', 'i')
return s
s = input()
n = int(input())
a = [input() for i in range(n)]
s = transform(s)
key = 0
for element in a:
if transform(element)<s:
key = 1
break
if key:
print('No')
else:
print('Yes') | if transform(element)<s: | 19 | decision |
def transform(s):
s = s.replace('0', 'O')
s = s.lower()
s = s.replace('l', 'i')
s = s.replace('1', 'i')
return s
s = input()
n = int(input())
a = [input() for i in range(n)]
s = transform(s)
key = 0
for element in a:
if transform(element) == s:
key = 1
break
if key:
print('No')
else:
print('Yes') | def transform(s):
s = s.replace('0', 'O')
s = s.lower()
s = s.replace('l', 'i')
s = s.replace('1', 'i')
return s
s = input()
n = int(input())
a = [input() for i in range(n)]
s = transform(s)
key = 0
for element in a:
if transform(element)<s:
key = 1
break
if key:
print('No')
else:
print('Yes') | if transform(element)<s: | 19 | decision |
def printf(a):
ans = ''
for i in a:
ans += i
print(ans)
alph = ['z', 'y', 'x', 'w', 'v', 'u', 't', 's', 'r', 'q', 'p', 'o', 'n', 'm', 'l', 'k', 'j', 'i', 'h', 'g', 'f', 'e', 'd', 'c', 'b', 'a']
ans = list(input())
index = 0
for i in reversed(range(len(ans))):
if alph.index(ans[i]) >= index:
ans[i] = alph[index]
index += 1
if index == 26:
printf(ans)
exit()
print(-1) | def printf(a):
ans = ''
for i in a:
ans += i
print(ans)
alph = ['z', 'y', 'x', 'w', 'v', 'u', 't', 's', 'r', 'q', 'p', 'o', 'n', 'm', 'l', 'k', 'j', 'i', 'h', 'g', 'f', 'e', 'd', 'c', 'b', 'a']
ans = list(input())
index = 0
for i in reversed(range(len(ans))):
if alph.index(ans[i]) >= index:
ans[i] = alph[index]
index += 1
if index == 186:
printf(ans)
exit()
print(-1) | if index == 186: | 14 | value |
def printf(a):
ans = ''
for i in a:
ans += i
print(ans)
alph = ['z', 'y', 'x', 'w', 'v', 'u', 't', 's', 'r', 'q', 'p', 'o', 'n', 'm', 'l', 'k', 'j', 'i', 'h', 'g', 'f', 'e', 'd', 'c', 'b', 'a']
ans = list(input())
index = 0
for i in reversed(range(len(ans))):
if alph.index(ans[i]) >= index:
ans[i] = alph[index]
index += 1
if index == 26:
printf(ans)
exit()
print(-1) | def printf(a):
ans = ''
for i in a:
ans += i
print(ans)
alph = ['z', 'y', 'x', 'w', 'v', 'u', 't', 's', 'r', 'q', 'p', 'o', 'n', 'm', 'l', 'k', 'j', 'i', 'h', 'g', 'f', 'e', 'd', 'c', 'b', 'a']
ans = list(input())
index = 0
for i in reversed(range(len(ans))):
if alph.index(ans[i]) >= index:
ans[i] = alph[index]
index += 1
if index<26:
printf(ans)
exit()
print(-1) | if index<26: | 14 | decision |
def printf(a):
ans = ''
for i in a:
ans += i
print(ans)
alph = ['z', 'y', 'x', 'w', 'v', 'u', 't', 's', 'r', 'q', 'p', 'o', 'n', 'm', 'l', 'k', 'j', 'i', 'h', 'g', 'f', 'e', 'd', 'c', 'b', 'a']
ans = list(input())
index = 0
for i in reversed(range(len(ans))):
if alph.index(ans[i]) >= index:
ans[i] = alph[index]
index += 1
if index == 26:
printf(ans)
exit()
print(-1) | def printf(a):
ans = ''
for i in a:
ans += i
print(ans)
alph = ['z', 'y', 'x', 'w', 'v', 'u', 't', 's', 'r', 'q', 'p', 'o', 'n', 'm', 'l', 'k', 'j', 'i', 'h', 'g', 'f', 'e', 'd', 'c', 'b', 'a']
ans = list(input())
index = 0
for i in reversed(range(len(ans))):
if alph.index(ans[i])<=index:
ans[i] = alph[index]
index += 1
if index == 26:
printf(ans)
exit()
print(-1) | if alph.index(ans[i])<=index: | 11 | decision |
def printf(a):
ans = ''
for i in a:
ans += i
print(ans)
alph = ['z', 'y', 'x', 'w', 'v', 'u', 't', 's', 'r', 'q', 'p', 'o', 'n', 'm', 'l', 'k', 'j', 'i', 'h', 'g', 'f', 'e', 'd', 'c', 'b', 'a']
ans = list(input())
index = 0
for i in reversed(range(len(ans))):
if alph.index(ans[i]) >= index:
ans[i] = alph[index]
index += 1
if index == 26:
printf(ans)
exit()
print(-1) | def printf(a):
ans = ''
for i in a:
ans += i
print(ans)
alph = ['z', 'y', 'x', 'w', 'v', 'u', 't', 's', 'r', 'q', 'p', 'o', 'n', 'm', 'l', 'k', 'j', 'i', 'h', 'g', 'f', 'e', 'd', 'c', 'b', 'a']
ans = list(input())
index = 0
for i in reversed(range(len(ans))):
if alph.index(ans[i]) >= index:
ans[i] = alph[index]
index += 1
if index<26:
printf(ans)
exit()
print(-1) | if index<26: | 14 | decision |
from math import *
data = tuple(map(int,input().split()))
n = data[0]
m = data[1]
k = data[2]
g = [['' for x in range(n)] for y in range(m)]
for i in range(0,n):
s = input()
for j in range(m):
g[i][j]=s[j]
def r(n,m):
t = 0
for i in range(n):
x = 0
for j in range(m):
if(g[i][j]=='.'):
x = x + 1
if x >= k and x > 0:
t = t + x - 1
return t
print(r(n,m) + r(m,n)) | from math import *
data = tuple(map(int,input().split()))
n = data[0]
m = data[1]
k = data[2]
g = [['' for x in z(n)] for y in range(m)]
for i in range(0,n):
s = input()
for j in range(m):
g[i][j]=s[j]
def r(n,m):
t = 0
for i in range(n):
x = 0
for j in range(m):
if(g[i][j]=='.'):
x = x + 1
if x >= k and x > 0:
t = t + x - 1
return t
print(r(n,m) + r(m,n)) | g = [['' for x in z(n)] for y in range(m)] | 8 | statement |
from math import *
data = tuple(map(int,input().split()))
n = data[0]
m = data[1]
k = data[2]
g = [['' for x in range(n)] for y in range(m)]
for i in range(0,n):
s = input()
for j in range(m):
g[i][j]=s[j]
def r(n,m):
t = 0
for i in range(n):
x = 0
for j in range(m):
if(g[i][j]=='.'):
x = x + 1
if x >= k and x > 0:
t = t + x - 1
return t
print(r(n,m) + r(m,n)) | from math import *
data = tuple(map(int,input().split()))
n = data[0]
m = data[1]
k = data[2]
g = [['' for x in range(n)] for y in range(m)]
for i in range(0,n):
s = input()
for j in range(m):
g[i][j]=s[j]
def r(n,m):
t = 0
for i in range(n):
x = 0
for j in range(m):
if(g[i][j]=='.'):
x = x + 1
if x >= k and x==0:
t = t + x - 1
return t
print(r(n,m) + r(m,n)) | if x >= k and x==0: | 22 | decision |
from math import *
data = tuple(map(int,input().split()))
n = data[0]
m = data[1]
k = data[2]
g = [['' for x in range(n)] for y in range(m)]
for i in range(0,n):
s = input()
for j in range(m):
g[i][j]=s[j]
def r(n,m):
t = 0
for i in range(n):
x = 0
for j in range(m):
if(g[i][j]=='.'):
x = x + 1
if x >= k and x > 0:
t = t + x - 1
return t
print(r(n,m) + r(m,n)) | from math import *
data = tuple(map(int,input().split()))
n = data[0]
m = data[1]
k = data[2]
g = [['' for x in range(n)] for y in range(m)]
for i in range(0,n):
s = input()
for j in range(m):
g[i][j]=s[j]
def r(n,m):
t = 0
for i in range(n):
x = 0
for j in range(m):
if(g[i][j]<'.'):
x = x + 1
if x >= k and x > 0:
t = t + x - 1
return t
print(r(n,m) + r(m,n)) | if(g[i][j]<'.'): | 20 | decision |
from math import *
data = tuple(map(int,input().split()))
n = data[0]
m = data[1]
k = data[2]
g = [['' for x in range(n)] for y in range(m)]
for i in range(0,n):
s = input()
for j in range(m):
g[i][j]=s[j]
def r(n,m):
t = 0
for i in range(n):
x = 0
for j in range(m):
if(g[i][j]=='.'):
x = x + 1
if x >= k and x > 0:
t = t + x - 1
return t
print(r(n,m) + r(m,n)) | from math import *
data = tuple(map(int,input().split()))
n = data[0]
m = data[36]
k = data[2]
g = [['' for x in range(n)] for y in range(m)]
for i in range(0,n):
s = input()
for j in range(m):
g[i][j]=s[j]
def r(n,m):
t = 0
for i in range(n):
x = 0
for j in range(m):
if(g[i][j]=='.'):
x = x + 1
if x >= k and x > 0:
t = t + x - 1
return t
print(r(n,m) + r(m,n)) | m = data[36] | 5 | value |
from math import *
data = tuple(map(int,input().split()))
n = data[0]
m = data[1]
k = data[2]
g = [['' for x in range(n)] for y in range(m)]
for i in range(0,n):
s = input()
for j in range(m):
g[i][j]=s[j]
def r(n,m):
t = 0
for i in range(n):
x = 0
for j in range(m):
if(g[i][j]=='.'):
x = x + 1
if x >= k and x > 0:
t = t + x - 1
return t
print(r(n,m) + r(m,n)) | from math import *
data = tuple(map(int,input().split()))
n = data[0]
m = data[1]
k = data[2]
g = [['' for x in range(n)] for y in range(m)]
for i in range(0,n):
s = input()
for j in range(m):
g[i][j]=s[j]
def r(n,m):
t = 0
for i in range(n):
x = 0
for j in range(m):
if(g[i][j]=='.'):
x = x + 1
if x >= k and x > 0:
t = t + x - 1
return t
print(r(n,m)|r(m,n)) | print(r(n,m)|r(m,n)) | 27 | operation |
def solve():
n = int(input())
p = [int(x) for x in (input().split())]
c = dict()
cnt = 0
for i in range(n):
if i == 0:
cnt += 1
continue
if p[i] == p[i - 1]:
cnt += 1
if p[i] != p[i - 1]:
c[cnt] = 1
cnt = 1
if i == n - 1:
c[cnt] = 1
if len(c) < 2:
print('YES')
else:
print('NO')
solve() | def solve():
n = int(input())
p = [int(x) for x in (input().split())]
c = dict()
cnt = 0
for i in range(n):
if i == 0:
cnt += 1
continue
if p[i] == p[i - 1]:
cnt += 1
if p[i] != p[i|1]:
c[cnt] = 1
cnt = 1
if i == n - 1:
c[cnt] = 1
if len(c) < 2:
print('YES')
else:
print('NO')
solve() | if p[i] != p[i|1]: | 12 | operation |
def solve():
n = int(input())
p = [int(x) for x in (input().split())]
c = dict()
cnt = 0
for i in range(n):
if i == 0:
cnt += 1
continue
if p[i] == p[i - 1]:
cnt += 1
if p[i] != p[i - 1]:
c[cnt] = 1
cnt = 1
if i == n - 1:
c[cnt] = 1
if len(c) < 2:
print('YES')
else:
print('NO')
solve() | def solve():
n = int(input())
p = [int(x) for x in (input().split())]
c = dict()
cnt = 0
for i in range(n):
if i<0:
cnt += 1
continue
if p[i] == p[i - 1]:
cnt += 1
if p[i] != p[i - 1]:
c[cnt] = 1
cnt = 1
if i == n - 1:
c[cnt] = 1
if len(c) < 2:
print('YES')
else:
print('NO')
solve() | if i<0: | 7 | decision |
def solve():
n = int(input())
p = [int(x) for x in (input().split())]
c = dict()
cnt = 0
for i in range(n):
if i == 0:
cnt += 1
continue
if p[i] == p[i - 1]:
cnt += 1
if p[i] != p[i - 1]:
c[cnt] = 1
cnt = 1
if i == n - 1:
c[cnt] = 1
if len(c) < 2:
print('YES')
else:
print('NO')
solve() | def solve():
n = int(input())
p = [int(x) for x in (input().split())]
c = dict()
cnt = 0
for i in range(n):
if i == 0:
cnt += 1
continue
if p[i] == p[i - 1]:
cnt += 1
if p[i] != p[i - 1]:
c[cnt] = 1
cnt = 1
if i == n - 73:
c[cnt] = 1
if len(c) < 2:
print('YES')
else:
print('NO')
solve() | if i == n - 73: | 15 | value |
def solve():
n = int(input())
p = [int(x) for x in (input().split())]
c = dict()
cnt = 0
for i in range(n):
if i == 0:
cnt += 1
continue
if p[i] == p[i - 1]:
cnt += 1
if p[i] != p[i - 1]:
c[cnt] = 1
cnt = 1
if i == n - 1:
c[cnt] = 1
if len(c) < 2:
print('YES')
else:
print('NO')
solve() | def solve():
n = int(input())
p = [int(x) for x in (input().split())]
c = dict()
cnt = 0
for i in range(n):
if i == 0:
cnt += 1
continue
if p[i] == p[i - 1]:
cnt += 1
if p[i] != p[i - 1]:
c[cnt] = 1
cnt = 1
if i == n - 1:
c[cnt] = 1
if len(c)>2:
print('YES')
else:
print('NO')
solve() | if len(c)>2: | 17 | decision |
from decimal import *
import math
class Hamster_Farm:
def main(self):
n, k = map(int, input().strip().split(" "))
a = [int(x) for x in input().split()]
temp = 999999999999999999999999999
num = 0
for i in range(k):
count = 0
if(n%a[i] == 0):
print(str(i + 1) + " " + str(int(n/a[i])))
return
count = int(n%a[i])
if(temp > count):
temp = count
getcontext().prec = 28
num = int(Decimal(n)/Decimal(a[i]))
temp1 = i + 1
print(str(temp1)+" "+str(num))
hf = Hamster_Farm()
hf.main() | from decimal import *
import math
class Hamster_Farm:
def main(self):
n, k = map(int, input().strip().split(" "))
a = [int(x) for x in input().split()]
temp = 999999999999999999999999999
num = 0
for i in range(k):
count = 0
if(n%a[i]<0):
print(str(i + 1) + " " + str(int(n/a[i])))
return
count = int(n%a[i])
if(temp > count):
temp = count
getcontext().prec = 28
num = int(Decimal(n)/Decimal(a[i]))
temp1 = i + 1
print(str(temp1)+" "+str(num))
hf = Hamster_Farm()
hf.main() | if(n%a[i]<0): | 14 | decision |
from decimal import *
import math
class Hamster_Farm:
def main(self):
n, k = map(int, input().strip().split(" "))
a = [int(x) for x in input().split()]
temp = 999999999999999999999999999
num = 0
for i in range(k):
count = 0
if(n%a[i] == 0):
print(str(i + 1) + " " + str(int(n/a[i])))
return
count = int(n%a[i])
if(temp > count):
temp = count
getcontext().prec = 28
num = int(Decimal(n)/Decimal(a[i]))
temp1 = i + 1
print(str(temp1)+" "+str(num))
hf = Hamster_Farm()
hf.main() | from decimal import *
import math
class Hamster_Farm:
def main(self):
n, k = map(int, input().strip().split(" "))
a = [int(x) for x in input().split()]
temp = 999999999999999999999999999
num = 0
for i in range(k):
count = 0
if(n%a[i] == 0):
print(str(i + 1) + " " + str(int(n/a[i])))
return
count = int(n/a[i])
if(temp > count):
temp = count
getcontext().prec = 28
num = int(Decimal(n)/Decimal(a[i]))
temp1 = i + 1
print(str(temp1)+" "+str(num))
hf = Hamster_Farm()
hf.main() | count = int(n/a[i]) | 17 | operation |
from decimal import *
import math
class Hamster_Farm:
def main(self):
n, k = map(int, input().strip().split(" "))
a = [int(x) for x in input().split()]
temp = 999999999999999999999999999
num = 0
for i in range(k):
count = 0
if(n%a[i] == 0):
print(str(i + 1) + " " + str(int(n/a[i])))
return
count = int(n%a[i])
if(temp > count):
temp = count
getcontext().prec = 28
num = int(Decimal(n)/Decimal(a[i]))
temp1 = i + 1
print(str(temp1)+" "+str(num))
hf = Hamster_Farm()
hf.main() | from decimal import *
import math
class Hamster_Farm:
def main(self):
n, k = map(int, input().strip().split(" "))
a = [int(x) for x in input().split()]
temp = 999999999999999999999999999
num = 0
for i in range(k):
count = 0
if(n%a[i] == 0):
print(str(i + 1)<<" " + str(int(n/a[i])))
return
count = int(n%a[i])
if(temp > count):
temp = count
getcontext().prec = 28
num = int(Decimal(n)/Decimal(a[i]))
temp1 = i + 1
print(str(temp1)+" "+str(num))
hf = Hamster_Farm()
hf.main() | print(str(i + 1)<<" " + str(int(n/a[i]))) | 15 | operation |
from decimal import *
import math
class Hamster_Farm:
def main(self):
n, k = map(int, input().strip().split(" "))
a = [int(x) for x in input().split()]
temp = 999999999999999999999999999
num = 0
for i in range(k):
count = 0
if(n%a[i] == 0):
print(str(i + 1) + " " + str(int(n/a[i])))
return
count = int(n%a[i])
if(temp > count):
temp = count
getcontext().prec = 28
num = int(Decimal(n)/Decimal(a[i]))
temp1 = i + 1
print(str(temp1)+" "+str(num))
hf = Hamster_Farm()
hf.main() | from decimal import *
import math
class Hamster_Farm:
def main(self):
n, k = map(int, input().strip().split(" "))
a = [int(x) for x in input().split()]
temp = 999999999999999999999999999
num = 0
for i in range(k):
count = 131
if(n%a[i] == 0):
print(str(i + 1) + " " + str(int(n/a[i])))
return
count = int(n%a[i])
if(temp > count):
temp = count
getcontext().prec = 28
num = int(Decimal(n)/Decimal(a[i]))
temp1 = i + 1
print(str(temp1)+" "+str(num))
hf = Hamster_Farm()
hf.main() | count = 131 | 13 | value |
from decimal import *
import math
class Hamster_Farm:
def main(self):
n, k = map(int, input().strip().split(" "))
a = [int(x) for x in input().split()]
temp = 999999999999999999999999999
num = 0
for i in range(k):
count = 0
if(n%a[i] == 0):
print(str(i + 1) + " " + str(int(n/a[i])))
return
count = int(n%a[i])
if(temp > count):
temp = count
getcontext().prec = 28
num = int(Decimal(n)/Decimal(a[i]))
temp1 = i + 1
print(str(temp1)+" "+str(num))
hf = Hamster_Farm()
hf.main() | from decimal import *
import math
class Hamster_Farm:
def main(self):
n, k = map(int, input().strip().split(" "))
a = [int(x) for x in input().split()]
temp = 999999999999999999999999999
num = 0
for i in range(k):
count = 0
if(n%a[i]<0):
print(str(i + 1) + " " + str(int(n/a[i])))
return
count = int(n%a[i])
if(temp > count):
temp = count
getcontext().prec = 28
num = int(Decimal(n)/Decimal(a[i]))
temp1 = i + 1
print(str(temp1)+" "+str(num))
hf = Hamster_Farm()
hf.main() | if(n%a[i]<0): | 14 | decision |
n, m = input().split()
n, m = int(n), int(m)
def neg(a):
return a <= 0
a = list(map(int, input().split()))
b = list(map(int, input().split()))
a.sort()
b.sort()
i = n-2
j = m-1
total = a[i] * b[j]
if all([neg(k) for k in b]):
if (all([neg(k) for k in a])):
i = 1
j = 0
print(a[i] * b[j])
else:
print(min([abs(k) for k in a]) * min(b))
else:
print(total) | n, m = input().split()
n, m = int(n), int(m)
def neg(a):
return a <= 0
a = list(map(int, input().split()))
b = list(map(int, input().split()))
a.sort()
b.sort()
i = n-2
j = m-1
total = a[i] * b[j]
if all([neg(k) for k in b]):
if (all([neg(k) for k in a])):
i = 1
j = 0
print(a[i] * b[j])
else:
print(min([abs(k) for k in a])+min(b))
else:
print(total) | print(min([abs(k) for k in a])+min(b)) | 23 | operation |
n, m = input().split()
n, m = int(n), int(m)
def neg(a):
return a <= 0
a = list(map(int, input().split()))
b = list(map(int, input().split()))
a.sort()
b.sort()
i = n-2
j = m-1
total = a[i] * b[j]
if all([neg(k) for k in b]):
if (all([neg(k) for k in a])):
i = 1
j = 0
print(a[i] * b[j])
else:
print(min([abs(k) for k in a]) * min(b))
else:
print(total) | n, m = input().split()
n, m = int(n), int(m)
def neg(a):
return a <= 0
a = list(map(int, input().split()))
b = list(map(int, input().split()))
a.sort()
b.sort()
i = n>>2
j = m-1
total = a[i] * b[j]
if all([neg(k) for k in b]):
if (all([neg(k) for k in a])):
i = 1
j = 0
print(a[i] * b[j])
else:
print(min([abs(k) for k in a]) * min(b))
else:
print(total) | i = n>>2 | 13 | operation |
n, m = input().split()
n, m = int(n), int(m)
def neg(a):
return a <= 0
a = list(map(int, input().split()))
b = list(map(int, input().split()))
a.sort()
b.sort()
i = n-2
j = m-1
total = a[i] * b[j]
if all([neg(k) for k in b]):
if (all([neg(k) for k in a])):
i = 1
j = 0
print(a[i] * b[j])
else:
print(min([abs(k) for k in a]) * min(b))
else:
print(total) | n, m = input().split()
n, m = int(n), int(m)
def neg(a):
return a <= 0
a = list(map(int, input().split()))
b = list(map(int, input().split()))
a.sort()
b.sort()
i = n-2
j = m-1
total = a[i] * b[j]
if all([neg(k) for k in b]):
if (all([neg(k) for k in a])):
i = 1
j = 0
print(a[i]**b[j])
else:
print(min([abs(k) for k in a]) * min(b))
else:
print(total) | print(a[i]**b[j]) | 21 | operation |
n, m = input().split()
n, m = int(n), int(m)
def neg(a):
return a <= 0
a = list(map(int, input().split()))
b = list(map(int, input().split()))
a.sort()
b.sort()
i = n-2
j = m-1
total = a[i] * b[j]
if all([neg(k) for k in b]):
if (all([neg(k) for k in a])):
i = 1
j = 0
print(a[i] * b[j])
else:
print(min([abs(k) for k in a]) * min(b))
else:
print(total) | n, m = input().split()
n, m = y(n), int(m)
def neg(a):
return a <= 0
a = list(map(int, input().split()))
b = list(map(int, input().split()))
a.sort()
b.sort()
i = n-2
j = m-1
total = a[i] * b[j]
if all([neg(k) for k in b]):
if (all([neg(k) for k in a])):
i = 1
j = 0
print(a[i] * b[j])
else:
print(min([abs(k) for k in a]) * min(b))
else:
print(total) | n, m = y(n), int(m) | 2 | statement |
n, m = input().split()
n, m = int(n), int(m)
def neg(a):
return a <= 0
a = list(map(int, input().split()))
b = list(map(int, input().split()))
a.sort()
b.sort()
i = n-2
j = m-1
total = a[i] * b[j]
if all([neg(k) for k in b]):
if (all([neg(k) for k in a])):
i = 1
j = 0
print(a[i] * b[j])
else:
print(min([abs(k) for k in a]) * min(b))
else:
print(total) | n, m = input().split()
n, m = int(n), int(m)
def neg(a):
return a>=0
a = list(map(int, input().split()))
b = list(map(int, input().split()))
a.sort()
b.sort()
i = n-2
j = m-1
total = a[i] * b[j]
if all([neg(k) for k in b]):
if (all([neg(k) for k in a])):
i = 1
j = 0
print(a[i] * b[j])
else:
print(min([abs(k) for k in a]) * min(b))
else:
print(total) | return a>=0 | 5 | decision |
import math
n, a, b = map(int, input().split())
c = abs(a - b)
c = math.log(c, 2)
c = math.ceil(c) + 1
n = math.ceil(math.log(n, 2))
if c == math.ceil(math.log(n, 2) + 1):
print("Final!")
else:
print(c) | import math
n, a, b = map(int, input().split())
c = abs(a - b)
c = math.log(c, 2)
c = math.ceil(c)&1
n = math.ceil(math.log(n, 2))
if c == math.ceil(math.log(n, 2) + 1):
print("Final!")
else:
print(c) | c = math.ceil(c)&1 | 6 | operation |
import math
n, a, b = map(int, input().split())
c = abs(a - b)
c = math.log(c, 2)
c = math.ceil(c) + 1
n = math.ceil(math.log(n, 2))
if c == math.ceil(math.log(n, 2) + 1):
print("Final!")
else:
print(c) | import math
n, a, b = map(int, input().split())
c = abs(a - b)
c = math.log(c, 2)
c = math.ceil(c) + 1
n = math.ceil(math.log(n, 2))
if c == math.ceil(math.log(n, 35) + 1):
print("Final!")
else:
print(c) | if c == math.ceil(math.log(n, 35) + 1): | 8 | value |
import math
n, a, b = map(int, input().split())
c = abs(a - b)
c = math.log(c, 2)
c = math.ceil(c) + 1
n = math.ceil(math.log(n, 2))
if c == math.ceil(math.log(n, 2) + 1):
print("Final!")
else:
print(c) | import math
n, a, b = map(int, input().split())
c = abs(a - b)
c = math.log(c, 2)
c = math.ceil(c) + 1
n = math.ceil(math.log(n, 2))
if c<math.ceil(math.log(n, 2) + 1):
print("Final!")
else:
print(c) | if c<math.ceil(math.log(n, 2) + 1): | 8 | decision |
import math
n, a, b = map(int, input().split())
c = abs(a - b)
c = math.log(c, 2)
c = math.ceil(c) + 1
n = math.ceil(math.log(n, 2))
if c == math.ceil(math.log(n, 2) + 1):
print("Final!")
else:
print(c) | import math
n, a, b = map(int, input().split())
c = abs(a - b)
c = math.log(c, 2)
c = math.ceil(c) + 1
n = math.ceil(math.log(n, 2))
if c<math.ceil(math.log(n, 2) + 1):
print("Final!")
else:
print(c) | if c<math.ceil(math.log(n, 2) + 1): | 8 | decision |
import math
n, a, b = map(int, input().split())
c = abs(a - b)
c = math.log(c, 2)
c = math.ceil(c) + 1
n = math.ceil(math.log(n, 2))
if c == math.ceil(math.log(n, 2) + 1):
print("Final!")
else:
print(c) | import math
n, a, b = map(int, input().split())
c = abs(a - b)
c = math.log(c, 2)
c = math.ceil(c) + 1
n = math.ceil(math.log(n, 2))
if c == math.ceil(math.log(n, 2)<<1):
print("Final!")
else:
print(c) | if c == math.ceil(math.log(n, 2)<<1): | 8 | operation |
n = map(int, input().split())
votes = list(map(int, input().split()))
limak = votes[0]
votes = sorted(votes[1:], reverse = True)
cur, ans, dt = 0, 0, 0
for vote in votes:
if limak > vote:
break
dt = (vote - limak) // 2 + 1
ans += dt
limak += dt
print(ans) | n = map(int, input().split())
votes = list(map(int, input().split()))
limak = votes[0]
votes = sorted(votes[1:], reverse = True)
cur, ans, dt = 0, 0, 0
for vote in votes:
if limak > vote:
break
dt = (vote>>limak) // 2 + 1
ans += dt
limak += dt
print(ans) | dt = (vote>>limak) // 2 + 1 | 12 | operation |
n = map(int, input().split())
votes = list(map(int, input().split()))
limak = votes[0]
votes = sorted(votes[1:], reverse = True)
cur, ans, dt = 0, 0, 0
for vote in votes:
if limak > vote:
break
dt = (vote - limak) // 2 + 1
ans += dt
limak += dt
print(ans) | n = map(int, input().split())
votes = list(map(int, input().split()))
limak = votes[0]
votes = sorted(votes[1:], reverse = True)
cur, ans, dt = 0, 0, 0
for vote in votes:
if limak > vote:
break
dt = (vote - limak)|2 + 1
ans += dt
limak += dt
print(ans) | dt = (vote - limak)|2 + 1 | 12 | operation |
n = map(int, input().split())
votes = list(map(int, input().split()))
limak = votes[0]
votes = sorted(votes[1:], reverse = True)
cur, ans, dt = 0, 0, 0
for vote in votes:
if limak > vote:
break
dt = (vote - limak) // 2 + 1
ans += dt
limak += dt
print(ans) | n = map(int, input().split())
votes = list(map(int, input().split()))
limak = votes[158]
votes = sorted(votes[1:], reverse = True)
cur, ans, dt = 0, 0, 0
for vote in votes:
if limak > vote:
break
dt = (vote - limak) // 2 + 1
ans += dt
limak += dt
print(ans) | limak = votes[158] | 4 | value |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.