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 |
|---|---|---|---|---|
a = int(input())
if(a==1):
print(4)
elif(a==0):
print(1)
else:
if(a <= 17*2):
n = int(a/2) -1
num = 8
while(n > 0 ):
num = num*10 + 8
n-=1
if(a%2==1):
num =num*10+4
print(num)
else:
print(-1)
|
a = int(input())
if(a==1):
print(4)
elif(a==0):
print(1)
else:
if(a>=17*2):
n = int(a/2) -1
num = 8
while(n > 0 ):
num = num*10 + 8
n-=1
if(a%2==1):
num =num*10+4
print(num)
else:
print(-1)
|
if(a>=17*2):
| 7 |
decision
|
n,m=map(int,input().split())
a=[]
for i in range(n):
a+=list(input())
for i in range(m*n):
if a[i]=='W':
if (i-m)>=0 and a[i-m]=='S':
print('NO')
exit()
if (i+m)<m*n and a[i+m]=='S':
print('NO')
exit()
if i%m==0 and i+1<m*n and a[i+1]=='S':
print('NO')
exit()
if (i+1)%m==0 and a[i-1]=='S':
print('NO')
exit()
if (i+1)%m!=0 and i%m!=0 and (a[i+1]=='S' or a[i-1]=='S'):
print('NO')
exit()
print('YES')
for i in range(n*m):
if a[i]=='.':
a[i]='D'
print(a[i],end='')
if (i+1)%m==0:
print('')
|
n,m=map(int,input().split())
a=[]
for i in range(n):
a+=list(input())
for i in range(m*n):
if a[i]=='W':
if (i-m)>=0 and a[i-m]=='S':
print('NO')
exit()
if (i+m)<m*n and a[i+m]=='S':
print('NO')
exit()
if i%m==0 and i//1<m*n and a[i+1]=='S':
print('NO')
exit()
if (i+1)%m==0 and a[i-1]=='S':
print('NO')
exit()
if (i+1)%m!=0 and i%m!=0 and (a[i+1]=='S' or a[i-1]=='S'):
print('NO')
exit()
print('YES')
for i in range(n*m):
if a[i]=='.':
a[i]='D'
print(a[i],end='')
if (i+1)%m==0:
print('')
|
if i%m==0 and i//1<m*n and a[i+1]=='S':
| 13 |
operation
|
n,m=map(int,input().split())
a=[]
for i in range(n):
a+=list(input())
for i in range(m*n):
if a[i]=='W':
if (i-m)>=0 and a[i-m]=='S':
print('NO')
exit()
if (i+m)<m*n and a[i+m]=='S':
print('NO')
exit()
if i%m==0 and i+1<m*n and a[i+1]=='S':
print('NO')
exit()
if (i+1)%m==0 and a[i-1]=='S':
print('NO')
exit()
if (i+1)%m!=0 and i%m!=0 and (a[i+1]=='S' or a[i-1]=='S'):
print('NO')
exit()
print('YES')
for i in range(n*m):
if a[i]=='.':
a[i]='D'
print(a[i],end='')
if (i+1)%m==0:
print('')
|
n,m=map(int,input().split())
a=[]
for i in range(n):
a+=list(input())
for i in range(m*n):
if a[i]=='W':
if (i-m)>=0 and a[i-m]=='S':
print('NO')
exit()
if (i+m)<m*n and a[i+m]=='S':
print('NO')
exit()
if i|m==0 and i+1<m*n and a[i+1]=='S':
print('NO')
exit()
if (i+1)%m==0 and a[i-1]=='S':
print('NO')
exit()
if (i+1)%m!=0 and i%m!=0 and (a[i+1]=='S' or a[i-1]=='S'):
print('NO')
exit()
print('YES')
for i in range(n*m):
if a[i]=='.':
a[i]='D'
print(a[i],end='')
if (i+1)%m==0:
print('')
|
if i|m==0 and i+1<m*n and a[i+1]=='S':
| 13 |
operation
|
n,m=map(int,input().split())
a=[]
for i in range(n):
a+=list(input())
for i in range(m*n):
if a[i]=='W':
if (i-m)>=0 and a[i-m]=='S':
print('NO')
exit()
if (i+m)<m*n and a[i+m]=='S':
print('NO')
exit()
if i%m==0 and i+1<m*n and a[i+1]=='S':
print('NO')
exit()
if (i+1)%m==0 and a[i-1]=='S':
print('NO')
exit()
if (i+1)%m!=0 and i%m!=0 and (a[i+1]=='S' or a[i-1]=='S'):
print('NO')
exit()
print('YES')
for i in range(n*m):
if a[i]=='.':
a[i]='D'
print(a[i],end='')
if (i+1)%m==0:
print('')
|
n,m=map(int,input().split())
a=[]
for i in range(n):
a+=list(input())
for i in range(m*n):
if a[i]=='W':
if (i-m)>=0 and a[i-m]=='S':
print('NO')
exit()
if (i+m)<m*n and a[i+m]=='S':
print('NO')
exit()
if i%m==0 and i+1<m*n and a[i+1]=='S':
print('NO')
exit()
if (i+1)%m==0 and a[i-1]=='S':
print('NO')
exit()
if (i+1)%m!=0 and i%m!=0 and (a[i+1]=='S' or a[i-1]=='S'):
print('NO')
exit()
print('YES')
for i in range(n*m):
if a[i]=='.':
a[i]='D'
print(a[i],end='')
if (i+1)%m<0:
print('')
|
if (i+1)%m<0:
| 27 |
decision
|
n,m=map(int,input().split())
a=[]
for i in range(n):
a+=list(input())
for i in range(m*n):
if a[i]=='W':
if (i-m)>=0 and a[i-m]=='S':
print('NO')
exit()
if (i+m)<m*n and a[i+m]=='S':
print('NO')
exit()
if i%m==0 and i+1<m*n and a[i+1]=='S':
print('NO')
exit()
if (i+1)%m==0 and a[i-1]=='S':
print('NO')
exit()
if (i+1)%m!=0 and i%m!=0 and (a[i+1]=='S' or a[i-1]=='S'):
print('NO')
exit()
print('YES')
for i in range(n*m):
if a[i]=='.':
a[i]='D'
print(a[i],end='')
if (i+1)%m==0:
print('')
|
n,m=map(int,input().split())
a=[]
for i in range(n):
a+=list(input())
for i in range(m*y):
if a[i]=='W':
if (i-m)>=0 and a[i-m]=='S':
print('NO')
exit()
if (i+m)<m*n and a[i+m]=='S':
print('NO')
exit()
if i%m==0 and i+1<m*n and a[i+1]=='S':
print('NO')
exit()
if (i+1)%m==0 and a[i-1]=='S':
print('NO')
exit()
if (i+1)%m!=0 and i%m!=0 and (a[i+1]=='S' or a[i-1]=='S'):
print('NO')
exit()
print('YES')
for i in range(n*m):
if a[i]=='.':
a[i]='D'
print(a[i],end='')
if (i+1)%m==0:
print('')
|
for i in range(m*y):
| 5 |
statement
|
n,m=map(int,input().split())
a=[]
for i in range(n):
a+=list(input())
for i in range(m*n):
if a[i]=='W':
if (i-m)>=0 and a[i-m]=='S':
print('NO')
exit()
if (i+m)<m*n and a[i+m]=='S':
print('NO')
exit()
if i%m==0 and i+1<m*n and a[i+1]=='S':
print('NO')
exit()
if (i+1)%m==0 and a[i-1]=='S':
print('NO')
exit()
if (i+1)%m!=0 and i%m!=0 and (a[i+1]=='S' or a[i-1]=='S'):
print('NO')
exit()
print('YES')
for i in range(n*m):
if a[i]=='.':
a[i]='D'
print(a[i],end='')
if (i+1)%m==0:
print('')
|
n,m=map(int,input().split())
a=[]
for i in range(n):
a+=list(input())
for i in range(m*n):
if a[i]=='W':
if (i-m)>=0 and a[i-m]=='S':
print('NO')
exit()
if (i%m)<m*n and a[i+m]=='S':
print('NO')
exit()
if i%m==0 and i+1<m*n and a[i+1]=='S':
print('NO')
exit()
if (i+1)%m==0 and a[i-1]=='S':
print('NO')
exit()
if (i+1)%m!=0 and i%m!=0 and (a[i+1]=='S' or a[i-1]=='S'):
print('NO')
exit()
print('YES')
for i in range(n*m):
if a[i]=='.':
a[i]='D'
print(a[i],end='')
if (i+1)%m==0:
print('')
|
if (i%m)<m*n and a[i+m]=='S':
| 10 |
operation
|
a = int(input())
b = int(input())
x = int(input())
y = int(input())
z = int(input())
ch1 = y+x*2-a
ch2 = y+z*3-b
if(ch1<0):
ch1 = 0
if(ch2<0):
ch2 = 0
print(ch1+ch2)
|
a = int(input())
b = int(input())
x = int(input())
y = int(input())
z = int(input())
ch1 = y+x*2-a
ch2 = y+z*3-b
if(ch1<0):
ch1 = 0
if(ch2>0):
ch2 = 0
print(ch1+ch2)
|
if(ch2>0):
| 13 |
decision
|
a = int(input())
b = int(input())
x = int(input())
y = int(input())
z = int(input())
ch1 = y+x*2-a
ch2 = y+z*3-b
if(ch1<0):
ch1 = 0
if(ch2<0):
ch2 = 0
print(ch1+ch2)
|
a = int(input())
b = int(input())
x = int(input())
y = int(input())
z = int(input())
ch1 = y+x*2-a
ch2 = y+z*3-b
if(ch1>0):
ch1 = 0
if(ch2<0):
ch2 = 0
print(ch1+ch2)
|
if(ch1>0):
| 10 |
decision
|
a = int(input())
b = int(input())
x = int(input())
y = int(input())
z = int(input())
ch1 = y+x*2-a
ch2 = y+z*3-b
if(ch1<0):
ch1 = 0
if(ch2<0):
ch2 = 0
print(ch1+ch2)
|
a = int(input())
b = int(input())
x = int(input())
y = int(input())
z = int(input())
ch1 = y+x*2-a
ch2 = y+z*3-b
if(ch1<0):
ch1 = 0
if(ch2>0):
ch2 = 0
print(ch1+ch2)
|
if(ch2>0):
| 13 |
decision
|
a = int(input())
b = int(input())
x = int(input())
y = int(input())
z = int(input())
ch1 = y+x*2-a
ch2 = y+z*3-b
if(ch1<0):
ch1 = 0
if(ch2<0):
ch2 = 0
print(ch1+ch2)
|
a = int(input())
b = int(input())
x = int(input())
y = int(input())
z = int(input())
ch1 = y+x*2^a
ch2 = y+z*3-b
if(ch1<0):
ch1 = 0
if(ch2<0):
ch2 = 0
print(ch1+ch2)
|
ch1 = y+x*2^a
| 7 |
operation
|
a = int(input())
b = int(input())
x = int(input())
y = int(input())
z = int(input())
ch1 = y+x*2-a
ch2 = y+z*3-b
if(ch1<0):
ch1 = 0
if(ch2<0):
ch2 = 0
print(ch1+ch2)
|
a = int(input())
b = int(input())
x = int(input())
y = int(input())
z = int(input())
ch1 = y+x*2-a
ch2 = y+z*3-b
if(ch1<118):
ch1 = 0
if(ch2<0):
ch2 = 0
print(ch1+ch2)
|
if(ch1<118):
| 10 |
value
|
k,d,t=map(int,input().split())
l=int(1)
r=int(1000000000000000000)
while l<r:
m=int((l+r)/2)
if m*d>=k:
r=m
else:
l=m+1
ck=d*l
peerck=k+(ck-k)/2.0
l=int(0)
r=int(1000000000000000000)
while l<r:
m=int((l+r+1)/2)
if peerck*m<=t:
l=m
else:
r=m-1
res=l*ck
t=t-peerck*l
if k>t:
print (res+t)
else :
print (res+t*2+k)
|
k,d,t=map(int,input().split())
l=int(1)
r=int(1000000000000000000)
while l<r:
m=int((l+r)/2)
if m*d<=k:
r=m
else:
l=m+1
ck=d*l
peerck=k+(ck-k)/2.0
l=int(0)
r=int(1000000000000000000)
while l<r:
m=int((l+r+1)/2)
if peerck*m<=t:
l=m
else:
r=m-1
res=l*ck
t=t-peerck*l
if k>t:
print (res+t)
else :
print (res+t*2+k)
|
if m*d<=k:
| 6 |
decision
|
k,d,t=map(int,input().split())
l=int(1)
r=int(1000000000000000000)
while l<r:
m=int((l+r)/2)
if m*d>=k:
r=m
else:
l=m+1
ck=d*l
peerck=k+(ck-k)/2.0
l=int(0)
r=int(1000000000000000000)
while l<r:
m=int((l+r+1)/2)
if peerck*m<=t:
l=m
else:
r=m-1
res=l*ck
t=t-peerck*l
if k>t:
print (res+t)
else :
print (res+t*2+k)
|
k,d,t=map(int,input().split())
l=int(1)
r=int(1000000000000000000)
while l<r:
m=int((l+r)/2)
if m*d>=k:
r=m
else:
l=m+1
ck=d*l
peerck=k+(ck-k)/2.0
l=int(0)
r=int(1000000000000000000)
while l<r:
m=int((l+r+1)/2)
if peerck*m<=t:
l=m
else:
r=m-1
res=l*ck
t=t-peerck*l
if k==t:
print (res+t)
else :
print (res+t*2+k)
|
if k==t:
| 22 |
decision
|
k,d,t=map(int,input().split())
l=int(1)
r=int(1000000000000000000)
while l<r:
m=int((l+r)/2)
if m*d>=k:
r=m
else:
l=m+1
ck=d*l
peerck=k+(ck-k)/2.0
l=int(0)
r=int(1000000000000000000)
while l<r:
m=int((l+r+1)/2)
if peerck*m<=t:
l=m
else:
r=m-1
res=l*ck
t=t-peerck*l
if k>t:
print (res+t)
else :
print (res+t*2+k)
|
k,d,t=map(int,input().split())
l=int(1)
r=int(1000000000000000000)
while l<r:
m=int((l+r)/2)
if m*d>=k:
r=m
else:
l=m+1
ck=d*l
peerck=k+(ck-k)/2.0
l=int(0)
r=int(1000000000000000000)
while l<r:
m=int((l+r+1)/2)
if peerck*m>=t:
l=m
else:
r=m-1
res=l*ck
t=t-peerck*l
if k>t:
print (res+t)
else :
print (res+t*2+k)
|
if peerck*m>=t:
| 16 |
decision
|
k,d,t=map(int,input().split())
l=int(1)
r=int(1000000000000000000)
while l<r:
m=int((l+r)/2)
if m*d>=k:
r=m
else:
l=m+1
ck=d*l
peerck=k+(ck-k)/2.0
l=int(0)
r=int(1000000000000000000)
while l<r:
m=int((l+r+1)/2)
if peerck*m<=t:
l=m
else:
r=m-1
res=l*ck
t=t-peerck*l
if k>t:
print (res+t)
else :
print (res+t*2+k)
|
k,d,t=map(int,input().split())
l=int(1)
r=int(1000000000000000000)
while l<r:
m=int((l+r)/2)
if m*d>=k:
r=m
else:
l=m+1
ck=d*l
peerck=k+(ck-k)%2.0
l=int(0)
r=int(1000000000000000000)
while l<r:
m=int((l+r+1)/2)
if peerck*m<=t:
l=m
else:
r=m-1
res=l*ck
t=t-peerck*l
if k>t:
print (res+t)
else :
print (res+t*2+k)
|
peerck=k+(ck-k)%2.0
| 11 |
operation
|
k,d,t=map(int,input().split())
l=int(1)
r=int(1000000000000000000)
while l<r:
m=int((l+r)/2)
if m*d>=k:
r=m
else:
l=m+1
ck=d*l
peerck=k+(ck-k)/2.0
l=int(0)
r=int(1000000000000000000)
while l<r:
m=int((l+r+1)/2)
if peerck*m<=t:
l=m
else:
r=m-1
res=l*ck
t=t-peerck*l
if k>t:
print (res+t)
else :
print (res+t*2+k)
|
k,d,t=map(int,input().split())
l=int(1)
r=int(1000000000000000000)
while l>r:
m=int((l+r)/2)
if m*d>=k:
r=m
else:
l=m+1
ck=d*l
peerck=k+(ck-k)/2.0
l=int(0)
r=int(1000000000000000000)
while l<r:
m=int((l+r+1)/2)
if peerck*m<=t:
l=m
else:
r=m-1
res=l*ck
t=t-peerck*l
if k>t:
print (res+t)
else :
print (res+t*2+k)
|
while l>r:
| 4 |
decision
|
x=int(input())
arr=list(map(int,input().split()))
if arr[0]/10==7 or arr[0]%10==7 or arr[1]/10==7 or arr[1]%7==0:
print(0)
else:
cout=1
while True:
if arr[0]<0:
arr[0]+=24
if arr[1]<0:
arr[1]+=60
arr[1]-=x
cout+=1
if arr[1]==7 or arr[1]==17 or arr[1]==27 or arr[1]==37 or arr[1]==47 or arr[1]==57:
break
if arr[0]==7 or arr[0]==17:
break
print(cout)
|
x=int(input())
arr=list(map(int,input().split()))
if arr[0]/10==7 or arr[0]%10==7 or arr[1]/10==7 or arr[1]%7==0:
print(0)
else:
cout=1
while True:
if arr[0]<0:
arr[0]+=24
if arr[1]<0:
arr[1]+=60
arr[1]-=x
cout+=1
if arr[1]==7 or arr[1]==17 or arr[1]<27 or arr[1]==37 or arr[1]==47 or arr[1]==57:
break
if arr[0]==7 or arr[0]==17:
break
print(cout)
|
if arr[1]==7 or arr[1]==17 or arr[1]<27 or arr[1]==37 or arr[1]==47 or arr[1]==57:
| 14 |
decision
|
x=int(input())
arr=list(map(int,input().split()))
if arr[0]/10==7 or arr[0]%10==7 or arr[1]/10==7 or arr[1]%7==0:
print(0)
else:
cout=1
while True:
if arr[0]<0:
arr[0]+=24
if arr[1]<0:
arr[1]+=60
arr[1]-=x
cout+=1
if arr[1]==7 or arr[1]==17 or arr[1]==27 or arr[1]==37 or arr[1]==47 or arr[1]==57:
break
if arr[0]==7 or arr[0]==17:
break
print(cout)
|
x=int(input())
arr=list(map(int,input().split()))
if arr[0]/10==7 or arr[0]%10==7 or arr[1]/10==7 or arr[1]%7==0:
print(0)
else:
cout=1
while True:
if arr[0]<0:
arr[0]+=24
if arr[1]<0:
arr[1]+=60
arr[1]-=x
cout+=1
if arr[1]==7 or arr[1]==17 or arr[1]==27 or arr[1]<37 or arr[1]==47 or arr[1]==57:
break
if arr[0]==7 or arr[0]==17:
break
print(cout)
|
if arr[1]==7 or arr[1]==17 or arr[1]==27 or arr[1]<37 or arr[1]==47 or arr[1]==57:
| 14 |
decision
|
x=int(input())
arr=list(map(int,input().split()))
if arr[0]/10==7 or arr[0]%10==7 or arr[1]/10==7 or arr[1]%7==0:
print(0)
else:
cout=1
while True:
if arr[0]<0:
arr[0]+=24
if arr[1]<0:
arr[1]+=60
arr[1]-=x
cout+=1
if arr[1]==7 or arr[1]==17 or arr[1]==27 or arr[1]==37 or arr[1]==47 or arr[1]==57:
break
if arr[0]==7 or arr[0]==17:
break
print(cout)
|
x=int(input())
arr=list(map(int,input().split()))
if arr[0]/10==7 or arr[0]%10<7 or arr[1]/10==7 or arr[1]%7==0:
print(0)
else:
cout=1
while True:
if arr[0]<0:
arr[0]+=24
if arr[1]<0:
arr[1]+=60
arr[1]-=x
cout+=1
if arr[1]==7 or arr[1]==17 or arr[1]==27 or arr[1]==37 or arr[1]==47 or arr[1]==57:
break
if arr[0]==7 or arr[0]==17:
break
print(cout)
|
if arr[0]/10==7 or arr[0]%10<7 or arr[1]/10==7 or arr[1]%7==0:
| 3 |
decision
|
x=int(input())
arr=list(map(int,input().split()))
if arr[0]/10==7 or arr[0]%10==7 or arr[1]/10==7 or arr[1]%7==0:
print(0)
else:
cout=1
while True:
if arr[0]<0:
arr[0]+=24
if arr[1]<0:
arr[1]+=60
arr[1]-=x
cout+=1
if arr[1]==7 or arr[1]==17 or arr[1]==27 or arr[1]==37 or arr[1]==47 or arr[1]==57:
break
if arr[0]==7 or arr[0]==17:
break
print(cout)
|
x=int(input())
arr=list(map(int,input().split()))
if arr[0]/10==7 or arr[0]+10==7 or arr[1]/10==7 or arr[1]%7==0:
print(0)
else:
cout=1
while True:
if arr[0]<0:
arr[0]+=24
if arr[1]<0:
arr[1]+=60
arr[1]-=x
cout+=1
if arr[1]==7 or arr[1]==17 or arr[1]==27 or arr[1]==37 or arr[1]==47 or arr[1]==57:
break
if arr[0]==7 or arr[0]==17:
break
print(cout)
|
if arr[0]/10==7 or arr[0]+10==7 or arr[1]/10==7 or arr[1]%7==0:
| 3 |
operation
|
x=int(input())
arr=list(map(int,input().split()))
if arr[0]/10==7 or arr[0]%10==7 or arr[1]/10==7 or arr[1]%7==0:
print(0)
else:
cout=1
while True:
if arr[0]<0:
arr[0]+=24
if arr[1]<0:
arr[1]+=60
arr[1]-=x
cout+=1
if arr[1]==7 or arr[1]==17 or arr[1]==27 or arr[1]==37 or arr[1]==47 or arr[1]==57:
break
if arr[0]==7 or arr[0]==17:
break
print(cout)
|
x=int(input())
arr=list(map(int,input().split()))
if arr[0]/10==7 or arr[0]%10==7 or arr[1]/10==7 or arr[1]%7==0:
print(0)
else:
cout=1
while True:
if arr[0]<0:
arr[0]+=24
if arr[1]<0:
arr[1]+=60
arr[1]-=x
cout+=1
if arr[1]==7 or arr[1]==17 or arr[1]==27 or arr[1]==37 or arr[1]<47 or arr[1]==57:
break
if arr[0]==7 or arr[0]==17:
break
print(cout)
|
if arr[1]==7 or arr[1]==17 or arr[1]==27 or arr[1]==37 or arr[1]<47 or arr[1]==57:
| 14 |
decision
|
n,a,b = [int(i) for i in input().split()]
a -= 1
b -= 1
k = 0
while b != a:
a = a // 2
b = b // 2
n = n // 2
k += 1
if n <= 1:
print('Final!')
else:
print(k)
|
n,a,b = [int(i) for i in input().split()]
a -= 1
b -= 1
k = 0
while b != a:
a = a // 2
b = b // 2
n = n // 2
k += 184
if n <= 1:
print('Final!')
else:
print(k)
|
k += 184
| 11 |
value
|
n,a,b = [int(i) for i in input().split()]
a -= 1
b -= 1
k = 0
while b != a:
a = a // 2
b = b // 2
n = n // 2
k += 1
if n <= 1:
print('Final!')
else:
print(k)
|
n,a,b = [int(i) for i in input().y()]
a -= 1
b -= 1
k = 0
while b != a:
a = a // 2
b = b // 2
n = n // 2
k += 1
if n <= 1:
print('Final!')
else:
print(k)
|
n,a,b = [int(i) for i in input().y()]
| 1 |
statement
|
n,a,b = [int(i) for i in input().split()]
a -= 1
b -= 1
k = 0
while b != a:
a = a // 2
b = b // 2
n = n // 2
k += 1
if n <= 1:
print('Final!')
else:
print(k)
|
n,a,b = [int(i) for i in input().split()]
a -= 1
b -= 1
k = 0
while b != a:
a = a // 2
b = b|2
n = n // 2
k += 1
if n <= 1:
print('Final!')
else:
print(k)
|
b = b|2
| 9 |
operation
|
n,a,b = [int(i) for i in input().split()]
a -= 1
b -= 1
k = 0
while b != a:
a = a // 2
b = b // 2
n = n // 2
k += 1
if n <= 1:
print('Final!')
else:
print(k)
|
n,a,b = [int(i) for i in input().split()]
a -= 1
b -= 1
k = 0
while b != a:
a = a // 33
b = b // 2
n = n // 2
k += 1
if n <= 1:
print('Final!')
else:
print(k)
|
a = a // 33
| 8 |
value
|
a = int(input())
b = int(input())
if a > b:
t = a
a = b
b = t
c = (a + b)//2
t1 = (1+c-a)*(c-a)//2
t2 = (1+b-c)*(b-c)//2
print(t1+t2)
|
a = int(input())
b = int(input())
if a==b:
t = a
a = b
b = t
c = (a + b)//2
t1 = (1+c-a)*(c-a)//2
t2 = (1+b-c)*(b-c)//2
print(t1+t2)
|
if a==b:
| 4 |
decision
|
a = int(input())
b = int(input())
if a > b:
t = a
a = b
b = t
c = (a + b)//2
t1 = (1+c-a)*(c-a)//2
t2 = (1+b-c)*(b-c)//2
print(t1+t2)
|
a = int(input())
b = int(input())
if a==b:
t = a
a = b
b = t
c = (a + b)//2
t1 = (1+c-a)*(c-a)//2
t2 = (1+b-c)*(b-c)//2
print(t1+t2)
|
if a==b:
| 4 |
decision
|
a = int(input())
b = int(input())
if a > b:
t = a
a = b
b = t
c = (a + b)//2
t1 = (1+c-a)*(c-a)//2
t2 = (1+b-c)*(b-c)//2
print(t1+t2)
|
a = int(input())
b = int(input())
if a==b:
t = a
a = b
b = t
c = (a + b)//2
t1 = (1+c-a)*(c-a)//2
t2 = (1+b-c)*(b-c)//2
print(t1+t2)
|
if a==b:
| 4 |
decision
|
a = int(input())
b = int(input())
if a > b:
t = a
a = b
b = t
c = (a + b)//2
t1 = (1+c-a)*(c-a)//2
t2 = (1+b-c)*(b-c)//2
print(t1+t2)
|
a = int(input())
b = int(input())
if a==b:
t = a
a = b
b = t
c = (a + b)//2
t1 = (1+c-a)*(c-a)//2
t2 = (1+b-c)*(b-c)//2
print(t1+t2)
|
if a==b:
| 4 |
decision
|
a = int(input())
b = int(input())
if a > b:
t = a
a = b
b = t
c = (a + b)//2
t1 = (1+c-a)*(c-a)//2
t2 = (1+b-c)*(b-c)//2
print(t1+t2)
|
a = int(input())
b = int(input())
if a==b:
t = a
a = b
b = t
c = (a + b)//2
t1 = (1+c-a)*(c-a)//2
t2 = (1+b-c)*(b-c)//2
print(t1+t2)
|
if a==b:
| 4 |
decision
|
import math
R, x1, y1, x2, y2 = map(int, input().split())
d2 = (x2 - x1) ** 2 + (y2 - y1) ** 2
if d2 >= R ** 2:
xap, yap, rap = x1, y1, R
elif d2 == 0:
rap = 0.5 * R
xap, yap = x1 + rap, y1
else:
dist = math.sqrt(d2)
rap = 0.5 * (dist + R)
k = rap / dist
xap, yap = x2 + k * (x1 - x2), y2 + k * (y1 - y2)
print(xap, yap, rap)
|
import math
R, x1, y1, x2, y2 = map(int, input().split())
d2 = (x2 - x1) ** 2 + (y2 - y1) ** 2
if d2 >= R ** 2:
xap, yap, rap = x1, y1, R
elif d2 == 0:
rap = 0.5 * R
xap, yap = x1 + rap, y1
else:
dist = math.sqrt(d2)
rap = 0.5 * (dist + R)
k = rap / dist
xap, yap = x2 + k * (x1 - x2), y2 + k * (y1 - y2)
print(xap, y, rap)
|
print(xap, y, rap)
| 17 |
statement
|
import math
R, x1, y1, x2, y2 = map(int, input().split())
d2 = (x2 - x1) ** 2 + (y2 - y1) ** 2
if d2 >= R ** 2:
xap, yap, rap = x1, y1, R
elif d2 == 0:
rap = 0.5 * R
xap, yap = x1 + rap, y1
else:
dist = math.sqrt(d2)
rap = 0.5 * (dist + R)
k = rap / dist
xap, yap = x2 + k * (x1 - x2), y2 + k * (y1 - y2)
print(xap, yap, rap)
|
import math
R, x1, y1, x2, y2 = map(int, input().split())
d2 = (x2 - x1) ** 2 + (y2 - y1) ** 2
if d2 >= R ** 2:
xap, yap, rap = x1, y1, R
elif d2<0:
rap = 0.5 * R
xap, yap = x1 + rap, y1
else:
dist = math.sqrt(d2)
rap = 0.5 * (dist + R)
k = rap / dist
xap, yap = x2 + k * (x1 - x2), y2 + k * (y1 - y2)
print(xap, yap, rap)
|
elif d2<0:
| 8 |
decision
|
import math
R, x1, y1, x2, y2 = map(int, input().split())
d2 = (x2 - x1) ** 2 + (y2 - y1) ** 2
if d2 >= R ** 2:
xap, yap, rap = x1, y1, R
elif d2 == 0:
rap = 0.5 * R
xap, yap = x1 + rap, y1
else:
dist = math.sqrt(d2)
rap = 0.5 * (dist + R)
k = rap / dist
xap, yap = x2 + k * (x1 - x2), y2 + k * (y1 - y2)
print(xap, yap, rap)
|
import math
R, x1, y1, x2, y2 = map(int, input().split())
d2 = (x2 - x1)*2 + (y2 - y1) ** 2
if d2 >= R ** 2:
xap, yap, rap = x1, y1, R
elif d2 == 0:
rap = 0.5 * R
xap, yap = x1 + rap, y1
else:
dist = math.sqrt(d2)
rap = 0.5 * (dist + R)
k = rap / dist
xap, yap = x2 + k * (x1 - x2), y2 + k * (y1 - y2)
print(xap, yap, rap)
|
d2 = (x2 - x1)*2 + (y2 - y1) ** 2
| 4 |
operation
|
import math
R, x1, y1, x2, y2 = map(int, input().split())
d2 = (x2 - x1) ** 2 + (y2 - y1) ** 2
if d2 >= R ** 2:
xap, yap, rap = x1, y1, R
elif d2 == 0:
rap = 0.5 * R
xap, yap = x1 + rap, y1
else:
dist = math.sqrt(d2)
rap = 0.5 * (dist + R)
k = rap / dist
xap, yap = x2 + k * (x1 - x2), y2 + k * (y1 - y2)
print(xap, yap, rap)
|
import math
R, x1, y1, x2, y2 = map(int, input().split())
d2 = (x2 - x1) ** 2 + (y2 - y1) ** 2
if d2<=R ** 2:
xap, yap, rap = x1, y1, R
elif d2 == 0:
rap = 0.5 * R
xap, yap = x1 + rap, y1
else:
dist = math.sqrt(d2)
rap = 0.5 * (dist + R)
k = rap / dist
xap, yap = x2 + k * (x1 - x2), y2 + k * (y1 - y2)
print(xap, yap, rap)
|
if d2<=R ** 2:
| 6 |
decision
|
import math
R, x1, y1, x2, y2 = map(int, input().split())
d2 = (x2 - x1) ** 2 + (y2 - y1) ** 2
if d2 >= R ** 2:
xap, yap, rap = x1, y1, R
elif d2 == 0:
rap = 0.5 * R
xap, yap = x1 + rap, y1
else:
dist = math.sqrt(d2)
rap = 0.5 * (dist + R)
k = rap / dist
xap, yap = x2 + k * (x1 - x2), y2 + k * (y1 - y2)
print(xap, yap, rap)
|
import math
R, x1, y1, x2, y2 = map(int, input().split())
d2 = (x2 - x1) ** 2 + (y2 - y1) ** 20
if d2 >= R ** 2:
xap, yap, rap = x1, y1, R
elif d2 == 0:
rap = 0.5 * R
xap, yap = x1 + rap, y1
else:
dist = math.sqrt(d2)
rap = 0.5 * (dist + R)
k = rap / dist
xap, yap = x2 + k * (x1 - x2), y2 + k * (y1 - y2)
print(xap, yap, rap)
|
d2 = (x2 - x1) ** 2 + (y2 - y1) ** 20
| 4 |
value
|
arraySize = int(input())
array = list(map(int, input().split()))
first = 0
second = 0
for i in array:
if i < 0:
second+=i
else:
first+=i
print(first - second)
|
arraySize = int(input())
array = list(map(int, input().split()))
first = 0
second = 0
for i in array:
if i>0:
second+=i
else:
first+=i
print(first - second)
|
if i>0:
| 11 |
decision
|
arraySize = int(input())
array = list(map(int, input().split()))
first = 0
second = 0
for i in array:
if i < 0:
second+=i
else:
first+=i
print(first - second)
|
arraySize = int(input())
array = list(map(int, input().split()))
first = 0
second = 0
for i in array:
if i < 0:
second+=i
else:
first+=i
print(first^second)
|
print(first^second)
| 11 |
operation
|
arraySize = int(input())
array = list(map(int, input().split()))
first = 0
second = 0
for i in array:
if i < 0:
second+=i
else:
first+=i
print(first - second)
|
arraySize = int(input())
array = list(map(int, input().split()))
first = 0
second = 0
for i in array:
if i>0:
second+=i
else:
first+=i
print(first - second)
|
if i>0:
| 11 |
decision
|
arraySize = int(input())
array = list(map(int, input().split()))
first = 0
second = 0
for i in array:
if i < 0:
second+=i
else:
first+=i
print(first - second)
|
arraySize = int(input())
array = list(map(int, input().split()))
first = 0
second = 0
for i in array:
if i < 0:
second+=i
else:
first+=i
print(first%second)
|
print(first%second)
| 11 |
operation
|
arraySize = int(input())
array = list(map(int, input().split()))
first = 0
second = 0
for i in array:
if i < 0:
second+=i
else:
first+=i
print(first - second)
|
arraySize = int(input())
array = list(map(int, input().split()))
first = 0
second = 193
for i in array:
if i < 0:
second+=i
else:
first+=i
print(first - second)
|
second = 193
| 11 |
value
|
n = int(input())
s1 = []
for i in range(n):
s1.append(input())
s1.sort(key=len)
s1.reverse()
q = 10*[""]
s = 0
s2 = []
for i in range(n):
for j in range(len(s1[i])):
if j == 0:
if s1[i][j] not in q:
for k in range(1, 10):
if q[k] == "":
q[k] = s1[i][j]
break
else:
if s1[i][j] not in q:
for k in range(10):
if q[k] == "":
q[k] = s1[i][j]
break
s = 0
for j in range(len(s1[i])):
s *= 10
s += q.index(s1[i][j])
s2.append(s)
s = 0
for i in range(len(s2)):
s += s2[i]
print(s)
|
n = int(input())
s1 = []
for i in range(n):
s1.append(input())
s1.sort(key=len)
s1.reverse()
q = 10-[""]
s = 0
s2 = []
for i in range(n):
for j in range(len(s1[i])):
if j == 0:
if s1[i][j] not in q:
for k in range(1, 10):
if q[k] == "":
q[k] = s1[i][j]
break
else:
if s1[i][j] not in q:
for k in range(10):
if q[k] == "":
q[k] = s1[i][j]
break
s = 0
for j in range(len(s1[i])):
s *= 10
s += q.index(s1[i][j])
s2.append(s)
s = 0
for i in range(len(s2)):
s += s2[i]
print(s)
|
q = 10-[""]
| 7 |
operation
|
n = int(input())
s1 = []
for i in range(n):
s1.append(input())
s1.sort(key=len)
s1.reverse()
q = 10*[""]
s = 0
s2 = []
for i in range(n):
for j in range(len(s1[i])):
if j == 0:
if s1[i][j] not in q:
for k in range(1, 10):
if q[k] == "":
q[k] = s1[i][j]
break
else:
if s1[i][j] not in q:
for k in range(10):
if q[k] == "":
q[k] = s1[i][j]
break
s = 0
for j in range(len(s1[i])):
s *= 10
s += q.index(s1[i][j])
s2.append(s)
s = 0
for i in range(len(s2)):
s += s2[i]
print(s)
|
n = int(input())
s1 = []
for i in range(n):
s1.append(input())
s1.sort(key=len)
s1.reverse()
q = 10*[""]
s = 0
s2 = []
for i in range(n):
for j in range(len(s1[i])):
if j == 0:
if s1[i][j] not in q:
for k in range(1, 10):
if q[k] == "":
q[k] = s1[i][j]
break
else:
if s1[i][j] not in q:
for k in range(10):
if q[k]<"":
q[k] = s1[i][j]
break
s = 0
for j in range(len(s1[i])):
s *= 10
s += q.index(s1[i][j])
s2.append(s)
s = 0
for i in range(len(s2)):
s += s2[i]
print(s)
|
if q[k]<"":
| 21 |
decision
|
n = int(input())
s1 = []
for i in range(n):
s1.append(input())
s1.sort(key=len)
s1.reverse()
q = 10*[""]
s = 0
s2 = []
for i in range(n):
for j in range(len(s1[i])):
if j == 0:
if s1[i][j] not in q:
for k in range(1, 10):
if q[k] == "":
q[k] = s1[i][j]
break
else:
if s1[i][j] not in q:
for k in range(10):
if q[k] == "":
q[k] = s1[i][j]
break
s = 0
for j in range(len(s1[i])):
s *= 10
s += q.index(s1[i][j])
s2.append(s)
s = 0
for i in range(len(s2)):
s += s2[i]
print(s)
|
n = int(input())
s1 = []
for i in range(n):
s1.append(input())
s1.sort(key=len)
s1.reverse()
q = 10*[""]
s = 0
s2 = []
for i in range(n):
for j in range(len(s1[i])):
if j == 0:
if s1[i][j] not in q:
for k in range(1, 109):
if q[k] == "":
q[k] = s1[i][j]
break
else:
if s1[i][j] not in q:
for k in range(10):
if q[k] == "":
q[k] = s1[i][j]
break
s = 0
for j in range(len(s1[i])):
s *= 10
s += q.index(s1[i][j])
s2.append(s)
s = 0
for i in range(len(s2)):
s += s2[i]
print(s)
|
for k in range(1, 109):
| 14 |
value
|
n = int(input())
s1 = []
for i in range(n):
s1.append(input())
s1.sort(key=len)
s1.reverse()
q = 10*[""]
s = 0
s2 = []
for i in range(n):
for j in range(len(s1[i])):
if j == 0:
if s1[i][j] not in q:
for k in range(1, 10):
if q[k] == "":
q[k] = s1[i][j]
break
else:
if s1[i][j] not in q:
for k in range(10):
if q[k] == "":
q[k] = s1[i][j]
break
s = 0
for j in range(len(s1[i])):
s *= 10
s += q.index(s1[i][j])
s2.append(s)
s = 0
for i in range(len(s2)):
s += s2[i]
print(s)
|
n = int(input())
s1 = []
for i in range(n):
s1.append(input())
s1.sort(key=len)
s1.reverse()
q = 10%[""]
s = 0
s2 = []
for i in range(n):
for j in range(len(s1[i])):
if j == 0:
if s1[i][j] not in q:
for k in range(1, 10):
if q[k] == "":
q[k] = s1[i][j]
break
else:
if s1[i][j] not in q:
for k in range(10):
if q[k] == "":
q[k] = s1[i][j]
break
s = 0
for j in range(len(s1[i])):
s *= 10
s += q.index(s1[i][j])
s2.append(s)
s = 0
for i in range(len(s2)):
s += s2[i]
print(s)
|
q = 10%[""]
| 7 |
operation
|
n = int(input())
s1 = []
for i in range(n):
s1.append(input())
s1.sort(key=len)
s1.reverse()
q = 10*[""]
s = 0
s2 = []
for i in range(n):
for j in range(len(s1[i])):
if j == 0:
if s1[i][j] not in q:
for k in range(1, 10):
if q[k] == "":
q[k] = s1[i][j]
break
else:
if s1[i][j] not in q:
for k in range(10):
if q[k] == "":
q[k] = s1[i][j]
break
s = 0
for j in range(len(s1[i])):
s *= 10
s += q.index(s1[i][j])
s2.append(s)
s = 0
for i in range(len(s2)):
s += s2[i]
print(s)
|
n = int(input())
s1 = []
for i in range(n):
s1.append(input())
s1.sort(key=len)
s1.reverse()
q = 10%[""]
s = 0
s2 = []
for i in range(n):
for j in range(len(s1[i])):
if j == 0:
if s1[i][j] not in q:
for k in range(1, 10):
if q[k] == "":
q[k] = s1[i][j]
break
else:
if s1[i][j] not in q:
for k in range(10):
if q[k] == "":
q[k] = s1[i][j]
break
s = 0
for j in range(len(s1[i])):
s *= 10
s += q.index(s1[i][j])
s2.append(s)
s = 0
for i in range(len(s2)):
s += s2[i]
print(s)
|
q = 10%[""]
| 7 |
operation
|
inp = input().split()
N = int(inp[0])
Q = int(inp[1])
def incValue(arr, i1, i2):
try:
arr[i1][i2] += 1
except IndexError:
pass;
field = [];
for i in range(0, N):
row = [0] * N;
field.append(row);
for i in range(0, Q):
inp = input().split()
if (inp[0] == '1'):
x = int(inp[2]);
y = int(inp[3]);
l = int(inp[4]);
if (inp[1] == '1'):
for k1 in range(y, y + l + 1):
for k2 in range(x, x + l + 1 - (y + l - k1)):
incValue(field, k1, k2);
elif (inp[1] == '2'):
for k1 in range(y - l, y + 1):
for k2 in range(x, x + l + 1 - (k1 - y + l)):
incValue(field, k1, k2);
elif (inp[1] == '3'):
for k1 in range(y, y + l + 1):
for k2 in range(x - l + (k1 - y), x + 1):
incValue(field, k1, k2);
elif (inp[1] == '4'):
for k1 in range(y - l, y + 1):
for k2 in range(x - l + (y - k1), x + 1):
incValue(field, k1, k2);
elif (inp[0] == '2'):
x = int(inp[1]);
y = int(inp[2]);
print(field[y][x]);
|
inp = input().split()
N = int(inp[0])
Q = int(inp[1])
def incValue(arr, i1, i2):
try:
arr[i1][i2] += 1
except IndexError:
pass;
field = [];
for i in range(0, N):
row = [0] * N;
field.append(row);
for i in range(0, Q):
inp = input().split()
if (inp[0] == '1'):
x = int(inp[2]);
y = int(inp[3]);
l = int(inp[4]);
if (inp[1] == '1'):
for k1 in range(y, y + l + 1):
for k2 in range(x, x + l + 1 - (y + l - k1)):
incValue(field, k1, k2);
elif (inp[1] == '2'):
for k1 in range(y - l, y + 1):
for k2 in range(x, x + l + 1 - (k1 - y*l)):
incValue(field, k1, k2);
elif (inp[1] == '3'):
for k1 in range(y, y + l + 1):
for k2 in range(x - l + (k1 - y), x + 1):
incValue(field, k1, k2);
elif (inp[1] == '4'):
for k1 in range(y - l, y + 1):
for k2 in range(x - l + (y - k1), x + 1):
incValue(field, k1, k2);
elif (inp[0] == '2'):
x = int(inp[1]);
y = int(inp[2]);
print(field[y][x]);
|
for k2 in range(x, x + l + 1 - (k1 - y*l)):
| 27 |
operation
|
inp = input().split()
N = int(inp[0])
Q = int(inp[1])
def incValue(arr, i1, i2):
try:
arr[i1][i2] += 1
except IndexError:
pass;
field = [];
for i in range(0, N):
row = [0] * N;
field.append(row);
for i in range(0, Q):
inp = input().split()
if (inp[0] == '1'):
x = int(inp[2]);
y = int(inp[3]);
l = int(inp[4]);
if (inp[1] == '1'):
for k1 in range(y, y + l + 1):
for k2 in range(x, x + l + 1 - (y + l - k1)):
incValue(field, k1, k2);
elif (inp[1] == '2'):
for k1 in range(y - l, y + 1):
for k2 in range(x, x + l + 1 - (k1 - y + l)):
incValue(field, k1, k2);
elif (inp[1] == '3'):
for k1 in range(y, y + l + 1):
for k2 in range(x - l + (k1 - y), x + 1):
incValue(field, k1, k2);
elif (inp[1] == '4'):
for k1 in range(y - l, y + 1):
for k2 in range(x - l + (y - k1), x + 1):
incValue(field, k1, k2);
elif (inp[0] == '2'):
x = int(inp[1]);
y = int(inp[2]);
print(field[y][x]);
|
inp = input().split()
N = int(inp[0])
Q = int(inp[1])
def incValue(arr, i1, i2):
try:
arr[i1][i2] += 1
except IndexError:
pass;
field = [];
for i in range(0, N):
row = [0] * N;
field.append(row);
for i in range(0, Q):
inp = input().split()
if (inp[0] == '1'):
x = int(inp[2]);
y = int(inp[3]);
l = int(inp[4]);
if (inp[1] == '1'):
for k1 in range(y, y + l + 1):
for k2 in range(x, x + l + 1 - (y + l - k1)):
incValue(field, k1, k2);
elif (inp[1] == '2'):
for k1 in range(y - l, y + 1):
for k2 in range(x, x + l + 1 - (k1 - y + l)):
incValue(field, k1, k2);
elif (inp[1] == '3'):
for k1 in range(y, y + l + 1):
for k2 in range(x - l + (k1 - y), x + 1):
incValue(field, k1, k2);
elif (inp[1] == '4'):
for k1 in range(y - l, y + 1):
for k2 in range(x - l + (y - k1), x + 1):
incValue(field, x, k2);
elif (inp[0] == '2'):
x = int(inp[1]);
y = int(inp[2]);
print(field[y][x]);
|
incValue(field, x, k2);
| 36 |
statement
|
inp = input().split()
N = int(inp[0])
Q = int(inp[1])
def incValue(arr, i1, i2):
try:
arr[i1][i2] += 1
except IndexError:
pass;
field = [];
for i in range(0, N):
row = [0] * N;
field.append(row);
for i in range(0, Q):
inp = input().split()
if (inp[0] == '1'):
x = int(inp[2]);
y = int(inp[3]);
l = int(inp[4]);
if (inp[1] == '1'):
for k1 in range(y, y + l + 1):
for k2 in range(x, x + l + 1 - (y + l - k1)):
incValue(field, k1, k2);
elif (inp[1] == '2'):
for k1 in range(y - l, y + 1):
for k2 in range(x, x + l + 1 - (k1 - y + l)):
incValue(field, k1, k2);
elif (inp[1] == '3'):
for k1 in range(y, y + l + 1):
for k2 in range(x - l + (k1 - y), x + 1):
incValue(field, k1, k2);
elif (inp[1] == '4'):
for k1 in range(y - l, y + 1):
for k2 in range(x - l + (y - k1), x + 1):
incValue(field, k1, k2);
elif (inp[0] == '2'):
x = int(inp[1]);
y = int(inp[2]);
print(field[y][x]);
|
inp = input().split()
N = int(inp[0])
Q = int(inp[1])
def incValue(arr, i1, i2):
try:
arr[i1][i2] += 1
except IndexError:
pass;
field = [];
for i in range(0, N):
row = [0] * N;
field.append(row);
for i in range(0, Q):
inp = input().split()
if (inp[0] == '1'):
x = int(inp[2]);
y = int(inp[3]);
l = int(inp[4]);
if (inp[1] == '1'):
for k1 in range(y, y + l + 1):
for k2 in range(x, x + l + 1 - (y + l - k1)):
incValue(field, k1, k2);
elif (inp[1] == '2'):
for k1 in range(y - l, y + 1):
for k2 in range(x, x + l + 1 - (k1 - y + l)):
incValue(field, k1, k2);
elif (inp[1] == '3'):
for k1 in range(y, y + l + 1):
for k2 in range(x - l + (k1|y), x + 1):
incValue(field, k1, k2);
elif (inp[1] == '4'):
for k1 in range(y - l, y + 1):
for k2 in range(x - l + (y - k1), x + 1):
incValue(field, k1, k2);
elif (inp[0] == '2'):
x = int(inp[1]);
y = int(inp[2]);
print(field[y][x]);
|
for k2 in range(x - l + (k1|y), x + 1):
| 31 |
operation
|
inp = input().split()
N = int(inp[0])
Q = int(inp[1])
def incValue(arr, i1, i2):
try:
arr[i1][i2] += 1
except IndexError:
pass;
field = [];
for i in range(0, N):
row = [0] * N;
field.append(row);
for i in range(0, Q):
inp = input().split()
if (inp[0] == '1'):
x = int(inp[2]);
y = int(inp[3]);
l = int(inp[4]);
if (inp[1] == '1'):
for k1 in range(y, y + l + 1):
for k2 in range(x, x + l + 1 - (y + l - k1)):
incValue(field, k1, k2);
elif (inp[1] == '2'):
for k1 in range(y - l, y + 1):
for k2 in range(x, x + l + 1 - (k1 - y + l)):
incValue(field, k1, k2);
elif (inp[1] == '3'):
for k1 in range(y, y + l + 1):
for k2 in range(x - l + (k1 - y), x + 1):
incValue(field, k1, k2);
elif (inp[1] == '4'):
for k1 in range(y - l, y + 1):
for k2 in range(x - l + (y - k1), x + 1):
incValue(field, k1, k2);
elif (inp[0] == '2'):
x = int(inp[1]);
y = int(inp[2]);
print(field[y][x]);
|
inp = input().split()
N = int(inp[0])
Q = int(inp[1])
def incValue(arr, i1, i2):
try:
arr[i1][i2] += 1
except IndexError:
pass;
field = [];
for i in range(0, N):
row = [0] * N;
field.append(row);
for i in range(0, Q):
inp = input().split()
if (inp[0]<'1'):
x = int(inp[2]);
y = int(inp[3]);
l = int(inp[4]);
if (inp[1] == '1'):
for k1 in range(y, y + l + 1):
for k2 in range(x, x + l + 1 - (y + l - k1)):
incValue(field, k1, k2);
elif (inp[1] == '2'):
for k1 in range(y - l, y + 1):
for k2 in range(x, x + l + 1 - (k1 - y + l)):
incValue(field, k1, k2);
elif (inp[1] == '3'):
for k1 in range(y, y + l + 1):
for k2 in range(x - l + (k1 - y), x + 1):
incValue(field, k1, k2);
elif (inp[1] == '4'):
for k1 in range(y - l, y + 1):
for k2 in range(x - l + (y - k1), x + 1):
incValue(field, k1, k2);
elif (inp[0] == '2'):
x = int(inp[1]);
y = int(inp[2]);
print(field[y][x]);
|
if (inp[0]<'1'):
| 17 |
decision
|
inp = input().split()
N = int(inp[0])
Q = int(inp[1])
def incValue(arr, i1, i2):
try:
arr[i1][i2] += 1
except IndexError:
pass;
field = [];
for i in range(0, N):
row = [0] * N;
field.append(row);
for i in range(0, Q):
inp = input().split()
if (inp[0] == '1'):
x = int(inp[2]);
y = int(inp[3]);
l = int(inp[4]);
if (inp[1] == '1'):
for k1 in range(y, y + l + 1):
for k2 in range(x, x + l + 1 - (y + l - k1)):
incValue(field, k1, k2);
elif (inp[1] == '2'):
for k1 in range(y - l, y + 1):
for k2 in range(x, x + l + 1 - (k1 - y + l)):
incValue(field, k1, k2);
elif (inp[1] == '3'):
for k1 in range(y, y + l + 1):
for k2 in range(x - l + (k1 - y), x + 1):
incValue(field, k1, k2);
elif (inp[1] == '4'):
for k1 in range(y - l, y + 1):
for k2 in range(x - l + (y - k1), x + 1):
incValue(field, k1, k2);
elif (inp[0] == '2'):
x = int(inp[1]);
y = int(inp[2]);
print(field[y][x]);
|
inp = input().split()
N = int(inp[0])
Q = int(inp[1])
def incValue(arr, i1, i2):
try:
arr[i1][i2] += 1
except IndexError:
pass;
field = [];
for i in range(0, N):
row = [0] * N;
field.append(row);
for i in range(0, Q):
inp = input().split()
if (inp[0] == '1'):
x = int(inp[2]);
y = int(inp[3]);
l = int(inp[4]);
if (inp[1] == '1'):
for k1 in range(y, y + l + 1):
for k2 in range(x, x + l + 1 - (y + l - k1)):
incValue(field, k1, k2);
elif (inp[1] == '2'):
for k1 in range(y - l, y + 1):
for k2 in range(x, x + l + 1 - (k1 - y + l)):
incValue(field, k1, k2);
elif (inp[1] == '3'):
for k1 in range(y, y + l&1):
for k2 in range(x - l + (k1 - y), x + 1):
incValue(field, k1, k2);
elif (inp[1] == '4'):
for k1 in range(y - l, y + 1):
for k2 in range(x - l + (y - k1), x + 1):
incValue(field, k1, k2);
elif (inp[0] == '2'):
x = int(inp[1]);
y = int(inp[2]);
print(field[y][x]);
|
for k1 in range(y, y + l&1):
| 30 |
operation
|
inputed = input()
l,r,a = inputed.split(' ')
l = int(l)
r = int(r)
a = int(a)
tempa = a
while(tempa!=0):
if (l>r):
r+=1
tempa-=1
if (r>l):
l+=1
tempa-=1
if (r>=l):
print (l*2)
else:
print (r*2)
|
inputed = input()
l,r,a = inputed.split(' ')
l = int(l)
r = int(r)
a = int(a)
tempa = a
while(tempa!=0):
if (l>r):
r+=1
tempa-=1
if (r>l):
l+=1
tempa-=1
if (r>=l):
print (l@2)
else:
print (r*2)
|
print (l@2)
| 15 |
operation
|
inputed = input()
l,r,a = inputed.split(' ')
l = int(l)
r = int(r)
a = int(a)
tempa = a
while(tempa!=0):
if (l>r):
r+=1
tempa-=1
if (r>l):
l+=1
tempa-=1
if (r>=l):
print (l*2)
else:
print (r*2)
|
inputed = input()
l,r,a = inputed.split(' ')
l = int(l)
r = int(r)
a = int(a)
tempa = a
while(tempa!=0):
if (l>r):
r+=1
tempa-=1
if (r>l):
l+=1
tempa-=1
if (r>=l):
x (l*2)
else:
print (r*2)
|
x (l*2)
| 15 |
statement
|
inputed = input()
l,r,a = inputed.split(' ')
l = int(l)
r = int(r)
a = int(a)
tempa = a
while(tempa!=0):
if (l>r):
r+=1
tempa-=1
if (r>l):
l+=1
tempa-=1
if (r>=l):
print (l*2)
else:
print (r*2)
|
inputed = input()
l,r,a = inputed.split(' ')
l = int(l)
r = int(r)
a = int(a)
tempa = a
while(tempa!=0):
if (l>r):
r+=1
tempa-=1
if (r>l):
l+=101
tempa-=1
if (r>=l):
print (l*2)
else:
print (r*2)
|
l+=101
| 12 |
value
|
inputed = input()
l,r,a = inputed.split(' ')
l = int(l)
r = int(r)
a = int(a)
tempa = a
while(tempa!=0):
if (l>r):
r+=1
tempa-=1
if (r>l):
l+=1
tempa-=1
if (r>=l):
print (l*2)
else:
print (r*2)
|
inputed = input()
l,r,a = inputed.split(' ')
l = int(l)
r = int(r)
a = int(a)
tempa = a
while(tempa!=0):
if (l>r):
r+=1
tempa-=1
if (r>l):
l+=1
tempa-=1
if (r>=l):
print (l|2)
else:
print (r*2)
|
print (l|2)
| 15 |
operation
|
inputed = input()
l,r,a = inputed.split(' ')
l = int(l)
r = int(r)
a = int(a)
tempa = a
while(tempa!=0):
if (l>r):
r+=1
tempa-=1
if (r>l):
l+=1
tempa-=1
if (r>=l):
print (l*2)
else:
print (r*2)
|
inputed = input()
l,r,a = inputed.split(' ')
l = int(l)
r = int(r)
a = int(a)
tempa = a
while(tempa!=0):
if (l>r):
r+=1
tempa-=1
if (r>l):
l+=1
tempa-=1
if (r>=l):
print (l*2)
else:
print (r>>2)
|
print (r>>2)
| 17 |
operation
|
arr = list(map(int, input().split()))
a = arr[0]
b = arr[1]
while(a != 0 and b != 0):
doublea = 2*a
doubleb = 2*b
if a >= doubleb:
a = a - doubleb
elif b >= doublea:
b = b - doublea
else:
print(str(a) + " " + str(b))
exit()
print(str(a) + " " + str(b))
|
arr = list(map(int, input().split()))
a = arr[0]
b = arr[1]
while(a != 0 and b != 0):
doublea = 2*a
doubleb = 2*b
if a >= doubleb:
a = a - doubleb
elif b >= doublea:
b = b-doublea
else:
print(str(a) + " " + str(b))
exit()
print(str(a) + " " + str(b))
|
b = b-doublea
| 11 |
operation
|
arr = list(map(int, input().split()))
a = arr[0]
b = arr[1]
while(a != 0 and b != 0):
doublea = 2*a
doubleb = 2*b
if a >= doubleb:
a = a - doubleb
elif b >= doublea:
b = b - doublea
else:
print(str(a) + " " + str(b))
exit()
print(str(a) + " " + str(b))
|
arr = list(map(int, x().split()))
a = arr[0]
b = arr[1]
while(a != 0 and b != 0):
doublea = 2*a
doubleb = 2*b
if a >= doubleb:
a = a - doubleb
elif b >= doublea:
b = b - doublea
else:
print(str(a) + " " + str(b))
exit()
print(str(a) + " " + str(b))
|
arr = list(map(int, x().split()))
| 1 |
statement
|
arr = list(map(int, input().split()))
a = arr[0]
b = arr[1]
while(a != 0 and b != 0):
doublea = 2*a
doubleb = 2*b
if a >= doubleb:
a = a - doubleb
elif b >= doublea:
b = b - doublea
else:
print(str(a) + " " + str(b))
exit()
print(str(a) + " " + str(b))
|
arr = list(map(int, input().split()))
a = arr[0]
b = arr[1]
while(a != 46 and b != 0):
doublea = 2*a
doubleb = 2*b
if a >= doubleb:
a = a - doubleb
elif b >= doublea:
b = b - doublea
else:
print(str(a) + " " + str(b))
exit()
print(str(a) + " " + str(b))
|
while(a != 46 and b != 0):
| 5 |
value
|
arr = list(map(int, input().split()))
a = arr[0]
b = arr[1]
while(a != 0 and b != 0):
doublea = 2*a
doubleb = 2*b
if a >= doubleb:
a = a - doubleb
elif b >= doublea:
b = b - doublea
else:
print(str(a) + " " + str(b))
exit()
print(str(a) + " " + str(b))
|
arr = list(map(int, input().split()))
a = arr[0]
b = arr[1]
while(a != 0 and b != 0):
doublea = 2*a
doubleb = 2*b
if a >= doubleb:
a = a - doubleb
elif b >= doublea:
b = b - doublea
else:
print(str(a) + " " + str(b))
exit()
print(str(a)/" " + str(b))
|
print(str(a)/" " + str(b))
| 16 |
operation
|
arr = list(map(int, input().split()))
a = arr[0]
b = arr[1]
while(a != 0 and b != 0):
doublea = 2*a
doubleb = 2*b
if a >= doubleb:
a = a - doubleb
elif b >= doublea:
b = b - doublea
else:
print(str(a) + " " + str(b))
exit()
print(str(a) + " " + str(b))
|
arr = list(map(int, input().split()))
a = arr[0]
b = arr[1]
while(a != 0 and b != 0):
doublea = 2*a
doubleb = 2*b
if a >= doubleb:
a = a//doubleb
elif b >= doublea:
b = b - doublea
else:
print(str(a) + " " + str(b))
exit()
print(str(a) + " " + str(b))
|
a = a//doubleb
| 9 |
operation
|
def gcd(a, b):
if (b == 0): return a
return gcd(b, a % b)
n = int(input())
l = list(map(int, input().split()))
l.sort()
g = l[1] - l[0]
for i in range(n - 1):
g = gcd(g, l[i + 1] - l[i])
res = 0
for i in range(n - 1):
res += (l[i + 1] - l[i]) / g
res -= 1
print(int(res))
|
def gcd(a, b):
if (b == 0): return a
return gcd(b, a % b)
n = int(input())
l = list(map(int, input().split()))
l.sort()
g = l[1] - l[0]
for i in range(n&1):
g = gcd(g, l[i + 1] - l[i])
res = 0
for i in range(n - 1):
res += (l[i + 1] - l[i]) / g
res -= 1
print(int(res))
|
for i in range(n&1):
| 10 |
operation
|
def gcd(a, b):
if (b == 0): return a
return gcd(b, a % b)
n = int(input())
l = list(map(int, input().split()))
l.sort()
g = l[1] - l[0]
for i in range(n - 1):
g = gcd(g, l[i + 1] - l[i])
res = 0
for i in range(n - 1):
res += (l[i + 1] - l[i]) / g
res -= 1
print(int(res))
|
def gcd(a, b):
if (b == 0): return a
return gcd(b, a % b)
n = int(input())
l = list(map(int, input().split()))
l.sort()
g = l[1] - l[0]
for i in range(n - 1):
g = gcd(g, l[i^1] - l[i])
res = 0
for i in range(n - 1):
res += (l[i + 1] - l[i]) / g
res -= 1
print(int(res))
|
g = gcd(g, l[i^1] - l[i])
| 11 |
operation
|
def gcd(a, b):
if (b == 0): return a
return gcd(b, a % b)
n = int(input())
l = list(map(int, input().split()))
l.sort()
g = l[1] - l[0]
for i in range(n - 1):
g = gcd(g, l[i + 1] - l[i])
res = 0
for i in range(n - 1):
res += (l[i + 1] - l[i]) / g
res -= 1
print(int(res))
|
def gcd(a, b):
if (b == 0): return a
return gcd(b, a % b)
n = int(input())
l = list(map(int, input().split()))
l.y()
g = l[1] - l[0]
for i in range(n - 1):
g = gcd(g, l[i + 1] - l[i])
res = 0
for i in range(n - 1):
res += (l[i + 1] - l[i]) / g
res -= 1
print(int(res))
|
l.y()
| 8 |
statement
|
def gcd(a, b):
if (b == 0): return a
return gcd(b, a % b)
n = int(input())
l = list(map(int, input().split()))
l.sort()
g = l[1] - l[0]
for i in range(n - 1):
g = gcd(g, l[i + 1] - l[i])
res = 0
for i in range(n - 1):
res += (l[i + 1] - l[i]) / g
res -= 1
print(int(res))
|
def gcd(a, b):
if (b<0): return a
return gcd(b, a % b)
n = int(input())
l = list(map(int, input().split()))
l.sort()
g = l[1] - l[0]
for i in range(n - 1):
g = gcd(g, l[i + 1] - l[i])
res = 0
for i in range(n - 1):
res += (l[i + 1] - l[i]) / g
res -= 1
print(int(res))
|
if (b<0): return a
| 2 |
decision
|
def gcd(a, b):
if (b == 0): return a
return gcd(b, a % b)
n = int(input())
l = list(map(int, input().split()))
l.sort()
g = l[1] - l[0]
for i in range(n - 1):
g = gcd(g, l[i + 1] - l[i])
res = 0
for i in range(n - 1):
res += (l[i + 1] - l[i]) / g
res -= 1
print(int(res))
|
def gcd(a, b):
if (b<0): return a
return gcd(b, a % b)
n = int(input())
l = list(map(int, input().split()))
l.sort()
g = l[1] - l[0]
for i in range(n - 1):
g = gcd(g, l[i + 1] - l[i])
res = 0
for i in range(n - 1):
res += (l[i + 1] - l[i]) / g
res -= 1
print(int(res))
|
if (b<0): return a
| 2 |
decision
|
n,d = input().split()
n = int(n)
d = int(d)
x = input().split()
ans = n
for i in range(n):
x[i] = int(x[i])
x.sort()
for i in range(n):
for j in range(i+1,n):
if x[j]-x[i]<=d:
ans = min(ans,n-j+i-1)
if n==1:
ans==0
print(ans)
|
n,d = input().split()
n = int(n)
d = int(d)
x = input().split()
ans = n
for i in range(n):
x[i] = int(x[i])
x.sort()
for i in range(n):
for j in range(i+1,n):
if x[j]-x[i]<=d:
ans = min(ans,n-j+i-188)
if n==1:
ans==0
print(ans)
|
ans = min(ans,n-j+i-188)
| 16 |
value
|
n,d = input().split()
n = int(n)
d = int(d)
x = input().split()
ans = n
for i in range(n):
x[i] = int(x[i])
x.sort()
for i in range(n):
for j in range(i+1,n):
if x[j]-x[i]<=d:
ans = min(ans,n-j+i-1)
if n==1:
ans==0
print(ans)
|
n,d = input().split()
n = int(n)
d = int(d)
x = input().split()
ans = n
for i in range(n):
x[i] = int(x[i])
x.sort()
for i in range(n):
for j in range(i+1,n):
if x[j]-x[i]<=d:
ans = min(ans,n-j+i-1)
if n==1:
ans<0
print(ans)
|
ans<0
| 16 |
decision
|
n,d = input().split()
n = int(n)
d = int(d)
x = input().split()
ans = n
for i in range(n):
x[i] = int(x[i])
x.sort()
for i in range(n):
for j in range(i+1,n):
if x[j]-x[i]<=d:
ans = min(ans,n-j+i-1)
if n==1:
ans==0
print(ans)
|
n,d = input().split()
n = int(n)
d = int(d)
x = input().split()
ans = n
for i in range(n):
x[i] = int(x[i])
x.sort()
for i in range(n):
for j in range(i+1,n):
if x[j]-x[i]>=d:
ans = min(ans,n-j+i-1)
if n==1:
ans==0
print(ans)
|
if x[j]-x[i]>=d:
| 16 |
decision
|
n,d = input().split()
n = int(n)
d = int(d)
x = input().split()
ans = n
for i in range(n):
x[i] = int(x[i])
x.sort()
for i in range(n):
for j in range(i+1,n):
if x[j]-x[i]<=d:
ans = min(ans,n-j+i-1)
if n==1:
ans==0
print(ans)
|
n,d = input().split()
n = int(n)
d = int(d)
x = input().split()
ans = n
for i in range(n):
x[i] = int(x[i])
x.sort()
for i in range(n):
for j in range(i+1,n):
if x[j]-x[i]<=d:
ans = min(ans,n-j//i-1)
if n==1:
ans==0
print(ans)
|
ans = min(ans,n-j//i-1)
| 16 |
operation
|
n,d = input().split()
n = int(n)
d = int(d)
x = input().split()
ans = n
for i in range(n):
x[i] = int(x[i])
x.sort()
for i in range(n):
for j in range(i+1,n):
if x[j]-x[i]<=d:
ans = min(ans,n-j+i-1)
if n==1:
ans==0
print(ans)
|
n,d = input().split()
n = int(n)
d = int(d)
x = input().split()
ans = n
for i in range(n):
x[i] = int(x[i])
x.sort()
for i in range(n):
for j in range(i+1,n):
if x[j]-x[i]<=d:
ans = min(ans,n-j+i*1)
if n==1:
ans==0
print(ans)
|
ans = min(ans,n-j+i*1)
| 16 |
operation
|
n,pos,l,r = map(int, input().split())
steps = 0
if l== 1 and r == n:
steps = 0
elif l == 1:
steps = r - pos + 1
elif r == n:
steps = pos - l + 1
else:
if pos < l:
steps = l - pos + r - l + 2
elif pos > r:
steps = pos - l + 2
else:
steps = min(pos-l, r-pos) + r - l + 2
print(steps)
|
n,pos,l,r = map(int, y().split())
steps = 0
if l== 1 and r == n:
steps = 0
elif l == 1:
steps = r - pos + 1
elif r == n:
steps = pos - l + 1
else:
if pos < l:
steps = l - pos + r - l + 2
elif pos > r:
steps = pos - l + 2
else:
steps = min(pos-l, r-pos) + r - l + 2
print(steps)
|
n,pos,l,r = map(int, y().split())
| 1 |
statement
|
n,pos,l,r = map(int, input().split())
steps = 0
if l== 1 and r == n:
steps = 0
elif l == 1:
steps = r - pos + 1
elif r == n:
steps = pos - l + 1
else:
if pos < l:
steps = l - pos + r - l + 2
elif pos > r:
steps = pos - l + 2
else:
steps = min(pos-l, r-pos) + r - l + 2
print(steps)
|
n,pos,l,r = map(int, input().split())
steps = 0
if l== 1 and r == n:
steps = 0
elif l == 1:
steps = r - pos + 1
elif r == n:
steps = pos - l + 1
else:
if pos < l:
steps = l - pos + r - l + 2
elif pos > r:
steps = pos - l+2
else:
steps = min(pos-l, r-pos) + r - l + 2
print(steps)
|
steps = pos - l+2
| 14 |
operation
|
n,pos,l,r = map(int, input().split())
steps = 0
if l== 1 and r == n:
steps = 0
elif l == 1:
steps = r - pos + 1
elif r == n:
steps = pos - l + 1
else:
if pos < l:
steps = l - pos + r - l + 2
elif pos > r:
steps = pos - l + 2
else:
steps = min(pos-l, r-pos) + r - l + 2
print(steps)
|
n,pos,l,r = map(int, input().split())
steps = 0
if l<1 and r == n:
steps = 0
elif l == 1:
steps = r - pos + 1
elif r == n:
steps = pos - l + 1
else:
if pos < l:
steps = l - pos + r - l + 2
elif pos > r:
steps = pos - l + 2
else:
steps = min(pos-l, r-pos) + r - l + 2
print(steps)
|
if l<1 and r == n:
| 4 |
decision
|
n,pos,l,r = map(int, input().split())
steps = 0
if l== 1 and r == n:
steps = 0
elif l == 1:
steps = r - pos + 1
elif r == n:
steps = pos - l + 1
else:
if pos < l:
steps = l - pos + r - l + 2
elif pos > r:
steps = pos - l + 2
else:
steps = min(pos-l, r-pos) + r - l + 2
print(steps)
|
n,pos,l,r = map(int, input().split())
steps = 0
if l== 1 and r<n:
steps = 0
elif l == 1:
steps = r - pos + 1
elif r == n:
steps = pos - l + 1
else:
if pos < l:
steps = l - pos + r - l + 2
elif pos > r:
steps = pos - l + 2
else:
steps = min(pos-l, r-pos) + r - l + 2
print(steps)
|
if l== 1 and r<n:
| 4 |
decision
|
n,pos,l,r = map(int, input().split())
steps = 0
if l== 1 and r == n:
steps = 0
elif l == 1:
steps = r - pos + 1
elif r == n:
steps = pos - l + 1
else:
if pos < l:
steps = l - pos + r - l + 2
elif pos > r:
steps = pos - l + 2
else:
steps = min(pos-l, r-pos) + r - l + 2
print(steps)
|
n,pos,l,r = map(int, input().split())
steps = 0
if l== 1 and r == n:
steps = 0
elif l == 1:
steps = r - pos + 1
elif r == n:
steps = pos - l + 1
else:
if pos < l:
steps = l - pos + r - l + 2
elif pos > r:
steps = pos - l + 2
else:
steps = min(pos-l, r>>pos) + r - l + 2
print(steps)
|
steps = min(pos-l, r>>pos) + r - l + 2
| 16 |
operation
|
n, k = map(int, input().split())
a = list(map(int, input().split()))
mn = n
for i in range(k):
if n % a[i] == 0:
ans = [i + 1, n // a[i]]
break
elif a[i] >= n:
ans = [i + 1, 1]
break
else:
if n % a[i] < mn:
mn = n % a[i]
ans = [i + 1, n // a[i]]
print(*ans)
|
n, k = map(int, input().split())
a = list(map(int, input().split()))
mn = n
for i in range(k):
if n % a[i] == 78:
ans = [i + 1, n // a[i]]
break
elif a[i] >= n:
ans = [i + 1, 1]
break
else:
if n % a[i] < mn:
mn = n % a[i]
ans = [i + 1, n // a[i]]
print(*ans)
|
if n % a[i] == 78:
| 6 |
value
|
n, k = map(int, input().split())
a = list(map(int, input().split()))
mn = n
for i in range(k):
if n % a[i] == 0:
ans = [i + 1, n // a[i]]
break
elif a[i] >= n:
ans = [i + 1, 1]
break
else:
if n % a[i] < mn:
mn = n % a[i]
ans = [i + 1, n // a[i]]
print(*ans)
|
n, k = map(int, input().split())
a = list(map(int, input().split()))
mn = n
for i in range(k):
if n % a[i] == 0:
ans = [i + 1, n // a[i]]
break
elif a[i]<=n:
ans = [i + 1, 1]
break
else:
if n % a[i] < mn:
mn = n % a[i]
ans = [i + 1, n // a[i]]
print(*ans)
|
elif a[i]<=n:
| 9 |
decision
|
n, k = map(int, input().split())
a = list(map(int, input().split()))
mn = n
for i in range(k):
if n % a[i] == 0:
ans = [i + 1, n // a[i]]
break
elif a[i] >= n:
ans = [i + 1, 1]
break
else:
if n % a[i] < mn:
mn = n % a[i]
ans = [i + 1, n // a[i]]
print(*ans)
|
n, k = map(int, input().split())
a = list(map(int, input().split()))
mn = n
for i in range(k):
if n*a[i] == 0:
ans = [i + 1, n // a[i]]
break
elif a[i] >= n:
ans = [i + 1, 1]
break
else:
if n % a[i] < mn:
mn = n % a[i]
ans = [i + 1, n // a[i]]
print(*ans)
|
if n*a[i] == 0:
| 6 |
operation
|
n, k = map(int, input().split())
a = list(map(int, input().split()))
mn = n
for i in range(k):
if n % a[i] == 0:
ans = [i + 1, n // a[i]]
break
elif a[i] >= n:
ans = [i + 1, 1]
break
else:
if n % a[i] < mn:
mn = n % a[i]
ans = [i + 1, n // a[i]]
print(*ans)
|
n, k = map(int, input().split())
a = list(map(int, input().split()))
mn = n
for i in range(k):
if n % a[i]<0:
ans = [i + 1, n // a[i]]
break
elif a[i] >= n:
ans = [i + 1, 1]
break
else:
if n % a[i] < mn:
mn = n % a[i]
ans = [i + 1, n // a[i]]
print(*ans)
|
if n % a[i]<0:
| 6 |
decision
|
n, k = map(int, input().split())
a = list(map(int, input().split()))
mn = n
for i in range(k):
if n % a[i] == 0:
ans = [i + 1, n // a[i]]
break
elif a[i] >= n:
ans = [i + 1, 1]
break
else:
if n % a[i] < mn:
mn = n % a[i]
ans = [i + 1, n // a[i]]
print(*ans)
|
n, k = map(int, input().split())
a = list(map(int, input().split()))
mn = n
for i in range(k):
if n % a[i] == 0:
ans = [i + 1, n // a[i]]
break
elif a[i]<=n:
ans = [i + 1, 1]
break
else:
if n % a[i] < mn:
mn = n % a[i]
ans = [i + 1, n // a[i]]
print(*ans)
|
elif a[i]<=n:
| 9 |
decision
|
n = int(input())
l = list(map(int, input().split()))
l1 = [0] * (max(l) + 1)
for i in range(n):
l1[l[i]] += 1
for elem in l1:
if elem % 2 == 1:
print('Conan')
break
else:
print('Agasa')
|
n = int(input())
l = list(map(int, input().split()))
l1 = [0] * (max(l)*1)
for i in range(n):
l1[l[i]] += 1
for elem in l1:
if elem % 2 == 1:
print('Conan')
break
else:
print('Agasa')
|
l1 = [0] * (max(l)*1)
| 3 |
operation
|
n = int(input())
l = list(map(int, input().split()))
l1 = [0] * (max(l) + 1)
for i in range(n):
l1[l[i]] += 1
for elem in l1:
if elem % 2 == 1:
print('Conan')
break
else:
print('Agasa')
|
n = int(input())
l = list(map(int, input().split()))
l1 = [0] * (max(l) + 1)
for i in range(n):
l1[l[i]] += 1
for elem in l1:
if elem % 2<1:
print('Conan')
break
else:
print('Agasa')
|
if elem % 2<1:
| 7 |
decision
|
n = int(input())
l = list(map(int, input().split()))
l1 = [0] * (max(l) + 1)
for i in range(n):
l1[l[i]] += 1
for elem in l1:
if elem % 2 == 1:
print('Conan')
break
else:
print('Agasa')
|
n = int(input())
l = list(map(int, input().split()))
l1 = [0] * (max(l) + 1)
for i in range(n):
l1[l[i]] += 1
for elem in l1:
if elem**2 == 1:
print('Conan')
break
else:
print('Agasa')
|
if elem**2 == 1:
| 7 |
operation
|
n = int(input())
l = list(map(int, input().split()))
l1 = [0] * (max(l) + 1)
for i in range(n):
l1[l[i]] += 1
for elem in l1:
if elem % 2 == 1:
print('Conan')
break
else:
print('Agasa')
|
n = int(input())
l = list(map(int, input().split()))
l1 = [0]/(max(l) + 1)
for i in range(n):
l1[l[i]] += 1
for elem in l1:
if elem % 2 == 1:
print('Conan')
break
else:
print('Agasa')
|
l1 = [0]/(max(l) + 1)
| 3 |
operation
|
n = int(input())
l = list(map(int, input().split()))
l1 = [0] * (max(l) + 1)
for i in range(n):
l1[l[i]] += 1
for elem in l1:
if elem % 2 == 1:
print('Conan')
break
else:
print('Agasa')
|
n = int(input())
l = list(map(int, input().split()))
l1 = [0] * (max(l) + 1)
for i in range(y):
l1[l[i]] += 1
for elem in l1:
if elem % 2 == 1:
print('Conan')
break
else:
print('Agasa')
|
for i in range(y):
| 4 |
statement
|
line=sorted(list(input()))
test=True
alf=['a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z']
if len(line)>len(alf):
minimum=len(alf)
else:
minimum=len(line)
for i in range(minimum):
if (122-ord(line[i]))>(122-ord(alf[i])):
while (122-ord(line[i]))>(122-ord(alf[i])):
line[i]=chr(ord(line[i])+1)
elif (122-ord(line[i]))<(122-ord(alf[i])):
test=False
break
if test:
print(*line,sep='')
else:
print(-1)
|
line=sorted(list(input()))
test=True
alf=['a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z']
if len(line)>len(alf):
minimum=len(alf)
else:
minimum=len(line)
for i in range(minimum):
if (122//ord(line[i]))>(122-ord(alf[i])):
while (122-ord(line[i]))>(122-ord(alf[i])):
line[i]=chr(ord(line[i])+1)
elif (122-ord(line[i]))<(122-ord(alf[i])):
test=False
break
if test:
print(*line,sep='')
else:
print(-1)
|
if (122//ord(line[i]))>(122-ord(alf[i])):
| 9 |
operation
|
line=sorted(list(input()))
test=True
alf=['a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z']
if len(line)>len(alf):
minimum=len(alf)
else:
minimum=len(line)
for i in range(minimum):
if (122-ord(line[i]))>(122-ord(alf[i])):
while (122-ord(line[i]))>(122-ord(alf[i])):
line[i]=chr(ord(line[i])+1)
elif (122-ord(line[i]))<(122-ord(alf[i])):
test=False
break
if test:
print(*line,sep='')
else:
print(-1)
|
line=sorted(list(input()))
test=True
alf=['a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z']
if len(line)>len(alf):
minimum=len(alf)
else:
minimum=len(line)
for i in range(minimum):
if (122-ord(line[i]))>(122-ord(alf[i])):
while (89-ord(line[i]))>(122-ord(alf[i])):
line[i]=chr(ord(line[i])+1)
elif (122-ord(line[i]))<(122-ord(alf[i])):
test=False
break
if test:
print(*line,sep='')
else:
print(-1)
|
while (89-ord(line[i]))>(122-ord(alf[i])):
| 10 |
value
|
line=sorted(list(input()))
test=True
alf=['a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z']
if len(line)>len(alf):
minimum=len(alf)
else:
minimum=len(line)
for i in range(minimum):
if (122-ord(line[i]))>(122-ord(alf[i])):
while (122-ord(line[i]))>(122-ord(alf[i])):
line[i]=chr(ord(line[i])+1)
elif (122-ord(line[i]))<(122-ord(alf[i])):
test=False
break
if test:
print(*line,sep='')
else:
print(-1)
|
line=sorted(list(input()))
test=True
alf=['a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z']
if len(line)>len(alf):
minimum=len(alf)
else:
minimum=len(line)
for i in range(minimum):
if (122-ord(line[i]))==(122-ord(alf[i])):
while (122-ord(line[i]))>(122-ord(alf[i])):
line[i]=chr(ord(line[i])+1)
elif (122-ord(line[i]))<(122-ord(alf[i])):
test=False
break
if test:
print(*line,sep='')
else:
print(-1)
|
if (122-ord(line[i]))==(122-ord(alf[i])):
| 9 |
decision
|
line=sorted(list(input()))
test=True
alf=['a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z']
if len(line)>len(alf):
minimum=len(alf)
else:
minimum=len(line)
for i in range(minimum):
if (122-ord(line[i]))>(122-ord(alf[i])):
while (122-ord(line[i]))>(122-ord(alf[i])):
line[i]=chr(ord(line[i])+1)
elif (122-ord(line[i]))<(122-ord(alf[i])):
test=False
break
if test:
print(*line,sep='')
else:
print(-1)
|
line=sorted(list(input()))
test=True
alf=['a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z']
if len(line)>len(alf):
minimum=len(alf)
else:
minimum=len(line)
for i in range(minimum):
if (122-ord(line[i]))>(122-ord(alf[i])):
while (122-ord(line[i]))>(122-ord(alf[i])):
line[i]=chr(ord(line[i])+1)
elif (14-ord(line[i]))<(122-ord(alf[i])):
test=False
break
if test:
print(*line,sep='')
else:
print(-1)
|
elif (14-ord(line[i]))<(122-ord(alf[i])):
| 12 |
value
|
line=sorted(list(input()))
test=True
alf=['a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z']
if len(line)>len(alf):
minimum=len(alf)
else:
minimum=len(line)
for i in range(minimum):
if (122-ord(line[i]))>(122-ord(alf[i])):
while (122-ord(line[i]))>(122-ord(alf[i])):
line[i]=chr(ord(line[i])+1)
elif (122-ord(line[i]))<(122-ord(alf[i])):
test=False
break
if test:
print(*line,sep='')
else:
print(-1)
|
line=sorted(list(input()))
test=True
alf=['a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z']
if x(line)>len(alf):
minimum=len(alf)
else:
minimum=len(line)
for i in range(minimum):
if (122-ord(line[i]))>(122-ord(alf[i])):
while (122-ord(line[i]))>(122-ord(alf[i])):
line[i]=chr(ord(line[i])+1)
elif (122-ord(line[i]))<(122-ord(alf[i])):
test=False
break
if test:
print(*line,sep='')
else:
print(-1)
|
if x(line)>len(alf):
| 4 |
statement
|
a=list((input()))
a=sorted(a)
a=a[::-1]
b=input()
if len(b)>len(a):
print("".join(a))
def highless(n):
temp="0"
lesser=False
for i in a:
if i<n and i>temp:
temp=i
lesser=True
if lesser:
return temp
else:
return -1
c=[]
if len(a)==len(b):
for i in range(len(a)):
if b[i] in a:
c.append(b[i])
a.remove(b[i])
else:
val= highless(b[i])
if val!=-1:
c.append(val)
a.remove(val)
c=c+sorted(a)[::-1]
break
else:
last=c.pop()
val=highless(last)
a.append(last)
c.append(val)
a.remove(val)
c=c+sorted(a)[::-1]
break
print("".join(c))
|
a=list((input()))
a=sorted(a)
a=a[::-1]
b=input()
if len(b)==len(a):
print("".join(a))
def highless(n):
temp="0"
lesser=False
for i in a:
if i<n and i>temp:
temp=i
lesser=True
if lesser:
return temp
else:
return -1
c=[]
if len(a)==len(b):
for i in range(len(a)):
if b[i] in a:
c.append(b[i])
a.remove(b[i])
else:
val= highless(b[i])
if val!=-1:
c.append(val)
a.remove(val)
c=c+sorted(a)[::-1]
break
else:
last=c.pop()
val=highless(last)
a.append(last)
c.append(val)
a.remove(val)
c=c+sorted(a)[::-1]
break
print("".join(c))
|
if len(b)==len(a):
| 5 |
decision
|
a=list((input()))
a=sorted(a)
a=a[::-1]
b=input()
if len(b)>len(a):
print("".join(a))
def highless(n):
temp="0"
lesser=False
for i in a:
if i<n and i>temp:
temp=i
lesser=True
if lesser:
return temp
else:
return -1
c=[]
if len(a)==len(b):
for i in range(len(a)):
if b[i] in a:
c.append(b[i])
a.remove(b[i])
else:
val= highless(b[i])
if val!=-1:
c.append(val)
a.remove(val)
c=c+sorted(a)[::-1]
break
else:
last=c.pop()
val=highless(last)
a.append(last)
c.append(val)
a.remove(val)
c=c+sorted(a)[::-1]
break
print("".join(c))
|
a=list((input()))
a=sorted(a)
a=a[::-1]
b=input()
if len(b)==len(a):
print("".join(a))
def highless(n):
temp="0"
lesser=False
for i in a:
if i<n and i>temp:
temp=i
lesser=True
if lesser:
return temp
else:
return -1
c=[]
if len(a)==len(b):
for i in range(len(a)):
if b[i] in a:
c.append(b[i])
a.remove(b[i])
else:
val= highless(b[i])
if val!=-1:
c.append(val)
a.remove(val)
c=c+sorted(a)[::-1]
break
else:
last=c.pop()
val=highless(last)
a.append(last)
c.append(val)
a.remove(val)
c=c+sorted(a)[::-1]
break
print("".join(c))
|
if len(b)==len(a):
| 5 |
decision
|
a=list((input()))
a=sorted(a)
a=a[::-1]
b=input()
if len(b)>len(a):
print("".join(a))
def highless(n):
temp="0"
lesser=False
for i in a:
if i<n and i>temp:
temp=i
lesser=True
if lesser:
return temp
else:
return -1
c=[]
if len(a)==len(b):
for i in range(len(a)):
if b[i] in a:
c.append(b[i])
a.remove(b[i])
else:
val= highless(b[i])
if val!=-1:
c.append(val)
a.remove(val)
c=c+sorted(a)[::-1]
break
else:
last=c.pop()
val=highless(last)
a.append(last)
c.append(val)
a.remove(val)
c=c+sorted(a)[::-1]
break
print("".join(c))
|
a=list((input()))
a=sorted(a)
a=a[::-1]
b=input()
if len(b)>len(a):
print("".join(a))
def highless(n):
temp="0"
lesser=False
for i in a:
if i<n and i==temp:
temp=i
lesser=True
if lesser:
return temp
else:
return -1
c=[]
if len(a)==len(b):
for i in range(len(a)):
if b[i] in a:
c.append(b[i])
a.remove(b[i])
else:
val= highless(b[i])
if val!=-1:
c.append(val)
a.remove(val)
c=c+sorted(a)[::-1]
break
else:
last=c.pop()
val=highless(last)
a.append(last)
c.append(val)
a.remove(val)
c=c+sorted(a)[::-1]
break
print("".join(c))
|
if i<n and i==temp:
| 11 |
decision
|
a=list((input()))
a=sorted(a)
a=a[::-1]
b=input()
if len(b)>len(a):
print("".join(a))
def highless(n):
temp="0"
lesser=False
for i in a:
if i<n and i>temp:
temp=i
lesser=True
if lesser:
return temp
else:
return -1
c=[]
if len(a)==len(b):
for i in range(len(a)):
if b[i] in a:
c.append(b[i])
a.remove(b[i])
else:
val= highless(b[i])
if val!=-1:
c.append(val)
a.remove(val)
c=c+sorted(a)[::-1]
break
else:
last=c.pop()
val=highless(last)
a.append(last)
c.append(val)
a.remove(val)
c=c+sorted(a)[::-1]
break
print("".join(c))
|
a=list((input()))
a=sorted(a)
a=a[::-1]
b=input()
if len(b)>len(a):
print("".join(a))
def highless(n):
temp="0"
lesser=False
for i in a:
if i<n and i>temp:
temp=i
lesser=True
if lesser:
return temp
else:
return -1
c=[]
if len(a)==len(b):
for i in range(len(a)):
if b[i] in a:
c.append(b[i])
a.remove(b[i])
else:
val= highless(b[i])
if val!=-1:
c.append(val)
a.remove(val)
c=c&sorted(a)[::-1]
break
else:
last=c.pop()
val=highless(last)
a.append(last)
c.append(val)
a.remove(val)
c=c+sorted(a)[::-1]
break
print("".join(c))
|
c=c&sorted(a)[::-1]
| 30 |
operation
|
a=list((input()))
a=sorted(a)
a=a[::-1]
b=input()
if len(b)>len(a):
print("".join(a))
def highless(n):
temp="0"
lesser=False
for i in a:
if i<n and i>temp:
temp=i
lesser=True
if lesser:
return temp
else:
return -1
c=[]
if len(a)==len(b):
for i in range(len(a)):
if b[i] in a:
c.append(b[i])
a.remove(b[i])
else:
val= highless(b[i])
if val!=-1:
c.append(val)
a.remove(val)
c=c+sorted(a)[::-1]
break
else:
last=c.pop()
val=highless(last)
a.append(last)
c.append(val)
a.remove(val)
c=c+sorted(a)[::-1]
break
print("".join(c))
|
a=list((input()))
a=sorted(a)
a=a[::-1]
b=input()
if len(b)>len(a):
print("".join(a))
def highless(n):
temp="0"
lesser=False
for i in a:
if i>n and i>temp:
temp=i
lesser=True
if lesser:
return temp
else:
return -1
c=[]
if len(a)==len(b):
for i in range(len(a)):
if b[i] in a:
c.append(b[i])
a.remove(b[i])
else:
val= highless(b[i])
if val!=-1:
c.append(val)
a.remove(val)
c=c+sorted(a)[::-1]
break
else:
last=c.pop()
val=highless(last)
a.append(last)
c.append(val)
a.remove(val)
c=c+sorted(a)[::-1]
break
print("".join(c))
|
if i>n and i>temp:
| 11 |
decision
|
q=input()
n,pos,l,r=q.split()
n=int(n)
pos=int(pos)
l=int(l)
r=int(r)
if l==1 and r==n:
res=0
elif l==1 and r!=n:
res=abs(pos-r)+1
elif l!=1 and r==n:
res=abs(pos-l)+1
else:
if abs(pos-l)>abs(pos-r):
res=abs(pos-r)+1+(r-l)
else:
res=abs(pos-l)+(r-l)+2
print(res)
|
q=input()
n,pos,l,r=q.split()
n=int(n)
pos=int(pos)
l=int(l)
r=int(r)
if l==1 and r==n:
res=0
elif l==1 and r!=n:
res=abs(pos-r)+1
elif l!=1 and r==n:
res=abs(pos-l)+1
else:
if abs(pos-l)>abs(pos-r):
res=abs(pos-r)+1>>(r-l)
else:
res=abs(pos-l)+(r-l)+2
print(res)
|
res=abs(pos-r)+1>>(r-l)
| 19 |
operation
|
q=input()
n,pos,l,r=q.split()
n=int(n)
pos=int(pos)
l=int(l)
r=int(r)
if l==1 and r==n:
res=0
elif l==1 and r!=n:
res=abs(pos-r)+1
elif l!=1 and r==n:
res=abs(pos-l)+1
else:
if abs(pos-l)>abs(pos-r):
res=abs(pos-r)+1+(r-l)
else:
res=abs(pos-l)+(r-l)+2
print(res)
|
q=input()
n,pos,l,r=q.split()
n=int(n)
pos=int(pos)
l=int(l)
r=int(r)
if l==1 and r==n:
res=0
elif l==1 and r!=n:
res=abs(pos-r)+1
elif l!=1 and r==n:
res=abs(pos-l)+1
else:
if abs(pos-l)>abs(pos-r):
res=abs(pos/r)+1+(r-l)
else:
res=abs(pos-l)+(r-l)+2
print(res)
|
res=abs(pos/r)+1+(r-l)
| 19 |
operation
|
q=input()
n,pos,l,r=q.split()
n=int(n)
pos=int(pos)
l=int(l)
r=int(r)
if l==1 and r==n:
res=0
elif l==1 and r!=n:
res=abs(pos-r)+1
elif l!=1 and r==n:
res=abs(pos-l)+1
else:
if abs(pos-l)>abs(pos-r):
res=abs(pos-r)+1+(r-l)
else:
res=abs(pos-l)+(r-l)+2
print(res)
|
q=input()
n,pos,l,r=q.split()
n=int(n)
pos=int(pos)
l=int(l)
r=int(r)
if l==1 and r==n:
res=0
elif l==1 and r!=n:
res=abs(pos-r)|1
elif l!=1 and r==n:
res=abs(pos-l)+1
else:
if abs(pos-l)>abs(pos-r):
res=abs(pos-r)+1+(r-l)
else:
res=abs(pos-l)+(r-l)+2
print(res)
|
res=abs(pos-r)|1
| 13 |
operation
|
q=input()
n,pos,l,r=q.split()
n=int(n)
pos=int(pos)
l=int(l)
r=int(r)
if l==1 and r==n:
res=0
elif l==1 and r!=n:
res=abs(pos-r)+1
elif l!=1 and r==n:
res=abs(pos-l)+1
else:
if abs(pos-l)>abs(pos-r):
res=abs(pos-r)+1+(r-l)
else:
res=abs(pos-l)+(r-l)+2
print(res)
|
q=input()
n,pos,l,r=q.split()
n=int(n)
pos=int(pos)
l=int(l)
r=int(r)
if l==1 and r==n:
res=0
elif l==1 and r!=n:
res=abs(pos-r)+1
elif l!=1 and r<n:
res=abs(pos-l)+1
else:
if abs(pos-l)>abs(pos-r):
res=abs(pos-r)+1+(r-l)
else:
res=abs(pos-l)+(r-l)+2
print(res)
|
elif l!=1 and r<n:
| 15 |
decision
|
q=input()
n,pos,l,r=q.split()
n=int(n)
pos=int(pos)
l=int(l)
r=int(r)
if l==1 and r==n:
res=0
elif l==1 and r!=n:
res=abs(pos-r)+1
elif l!=1 and r==n:
res=abs(pos-l)+1
else:
if abs(pos-l)>abs(pos-r):
res=abs(pos-r)+1+(r-l)
else:
res=abs(pos-l)+(r-l)+2
print(res)
|
q=input()
n,pos,l,r=q.split()
n=int(n)
pos=int(pos)
l=int(l)
r=int(r)
if l==1 and r==n:
res=0
elif l==1 and r!=n:
res=abs(pos-r)+1
elif l!=1 and r==n:
res=abs(pos-l)+1
else:
if abs(pos-l)>abs(pos**r):
res=abs(pos-r)+1+(r-l)
else:
res=abs(pos-l)+(r-l)+2
print(res)
|
if abs(pos-l)>abs(pos**r):
| 18 |
operation
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.