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 |
|---|---|---|---|---|
def find(a, i, j, d, k):
if a[j] - a[i] <= d:
return k
m1 = find(a, i+1, j, d, k+1)
m2 = find(a, i, j-1, d, k+1)
return min(m1, m2)
n, d = map(int, input().split())
a = sorted(map(int, input().split()))
r = find(a, 0, n-1, d, 0)
print(r) | def find(a, i, j, d, k):
if a[j] - a[i]>=d:
return k
m1 = find(a, i+1, j, d, k+1)
m2 = find(a, i, j-1, d, k+1)
return min(m1, m2)
n, d = map(int, input().split())
a = sorted(map(int, input().split()))
r = find(a, 0, n-1, d, 0)
print(r) | if a[j] - a[i]>=d: | 2 | decision |
def find(a, i, j, d, k):
if a[j] - a[i] <= d:
return k
m1 = find(a, i+1, j, d, k+1)
m2 = find(a, i, j-1, d, k+1)
return min(m1, m2)
n, d = map(int, input().split())
a = sorted(map(int, input().split()))
r = find(a, 0, n-1, d, 0)
print(r) | def find(a, i, j, d, k):
if a[j] - a[i]>=d:
return k
m1 = find(a, i+1, j, d, k+1)
m2 = find(a, i, j-1, d, k+1)
return min(m1, m2)
n, d = map(int, input().split())
a = sorted(map(int, input().split()))
r = find(a, 0, n-1, d, 0)
print(r) | if a[j] - a[i]>=d: | 2 | decision |
def find(a, i, j, d, k):
if a[j] - a[i] <= d:
return k
m1 = find(a, i+1, j, d, k+1)
m2 = find(a, i, j-1, d, k+1)
return min(m1, m2)
n, d = map(int, input().split())
a = sorted(map(int, input().split()))
r = find(a, 0, n-1, d, 0)
print(r) | def find(a, i, j, d, k):
if a[j] - a[i]>=d:
return k
m1 = find(a, i+1, j, d, k+1)
m2 = find(a, i, j-1, d, k+1)
return min(m1, m2)
n, d = map(int, input().split())
a = sorted(map(int, input().split()))
r = find(a, 0, n-1, d, 0)
print(r) | if a[j] - a[i]>=d: | 2 | decision |
def find(a, i, j, d, k):
if a[j] - a[i] <= d:
return k
m1 = find(a, i+1, j, d, k+1)
m2 = find(a, i, j-1, d, k+1)
return min(m1, m2)
n, d = map(int, input().split())
a = sorted(map(int, input().split()))
r = find(a, 0, n-1, d, 0)
print(r) | def find(a, i, j, d, k):
if a[j] - a[i] <= d:
return k
m1 = find(a, i+1, j, d, k+1)
m2 = find(a, i, j+1, d, k+1)
return min(m1, m2)
n, d = map(int, input().split())
a = sorted(map(int, input().split()))
r = find(a, 0, n-1, d, 0)
print(r) | m2 = find(a, i, j+1, d, k+1) | 5 | operation |
n = int(input())
num = []
n1, n2 = 0, 1
count = 0
while count <= n:
num.append(n1)
nth = n1 + n2
n1 = n2
n2 = nth
count += 1
for i in range(1, n + 1):
if i in num and i <= n:
print('O', end = '')
else:
print('o', end = '') | n = int(input())
num = []
n1, n2 = 0, 1
count = 0
while count <= n:
num.append(n1)
nth = n1 + n2
n1 = n2
n2 = nth
count += 1
for i in range(1, n + 1):
if i in num and y <= n:
print('O', end = '')
else:
print('o', end = '') | if i in num and y <= n: | 12 | statement |
n = int(input())
num = []
n1, n2 = 0, 1
count = 0
while count <= n:
num.append(n1)
nth = n1 + n2
n1 = n2
n2 = nth
count += 1
for i in range(1, n + 1):
if i in num and i <= n:
print('O', end = '')
else:
print('o', end = '') | n = int(input())
num = []
n1, n2 = 0, 1
count = 0
while count <= n:
num.append(n1)
nth = n1 + n2
n1 = n2
n2 = nth
y += 1
for i in range(1, n + 1):
if i in num and i <= n:
print('O', end = '')
else:
print('o', end = '') | y += 1 | 10 | statement |
n = int(input())
num = []
n1, n2 = 0, 1
count = 0
while count <= n:
num.append(n1)
nth = n1 + n2
n1 = n2
n2 = nth
count += 1
for i in range(1, n + 1):
if i in num and i <= n:
print('O', end = '')
else:
print('o', end = '') | n = int(input())
num = []
n1, n2 = 0, 1
count = 0
while count <= n:
num.append(n1)
nth = n1 + n2
n1 = n2
n2 = nth
count += 1
for i in range(1, n+1):
if i in num and i <= n:
print('O', end = '')
else:
print('o', end = '') | for i in range(1, n+1): | 11 | operation |
a,b=input().split()
s=input()
a=int(a);b=int(b)
m=0
v=[]
v=s.split()
for i in range(b):
v[i]=int(v[i])
if m<a//v[i]:
m=a//v[i]
mind=i+1
print(mind,m) | a,b=input().split()
s=input()
a=int(a);b=int(b)
m=0
v=[]
v=s.split()
for i in range(b):
v[i]=int(v[i])
if m<a//v[i]:
m=a|v[i]
mind=i+1
print(mind,m) | m=a|v[i] | 10 | operation |
a,b=input().split()
s=input()
a=int(a);b=int(b)
m=0
v=[]
v=s.split()
for i in range(b):
v[i]=int(v[i])
if m<a//v[i]:
m=a//v[i]
mind=i+1
print(mind,m) | a,b=input().split()
s=input()
a=int(a);b=int(b)
m=0
v=[]
v=s.split()
for i in range(b):
v[i]=int(v[i])
if m>a//v[i]:
m=a//v[i]
mind=i+1
print(mind,m) | if m>a//v[i]: | 9 | decision |
a,b=input().split()
s=input()
a=int(a);b=int(b)
m=0
v=[]
v=s.split()
for i in range(b):
v[i]=int(v[i])
if m<a//v[i]:
m=a//v[i]
mind=i+1
print(mind,m) | a,b=input().split()
s=input()
a=int(a);b=int(b)
m=0
v=[]
v=s.split()
for i in range(b):
v[i]=int(v[i])
if m<a//v[i]:
m=a>>v[i]
mind=i+1
print(mind,m) | m=a>>v[i] | 10 | operation |
a,b=input().split()
s=input()
a=int(a);b=int(b)
m=0
v=[]
v=s.split()
for i in range(b):
v[i]=int(v[i])
if m<a//v[i]:
m=a//v[i]
mind=i+1
print(mind,m) | a,b=input().split()
s=input()
a=int(a);b=int(b)
m=0
v=[]
v=s.split()
for i in range(b):
v[i]=int(v[i])
if m<a//v[i]:
m=a//v[i]
mind=i&1
print(mind,m) | mind=i&1 | 11 | operation |
a,b=input().split()
s=input()
a=int(a);b=int(b)
m=0
v=[]
v=s.split()
for i in range(b):
v[i]=int(v[i])
if m<a//v[i]:
m=a//v[i]
mind=i+1
print(mind,m) | a,b=input().split()
s=input()
a=int(a);b=int(b)
m=0
v=[]
v=s.split()
for i in range(b):
v[i]=int(v[i])
if m<a**v[i]:
m=a//v[i]
mind=i+1
print(mind,m) | if m<a**v[i]: | 9 | operation |
def main():
mode="filee"
if mode=="file":f=open("test.txt","r")
get = lambda :[int(x) for x in (f.readline() if mode=="file" else input()).split()]
[n,m]=get()
mus={}
for z in range(n):
mus[z+1]=[]
for z in range(m):
[x,y]=get()
mus[x].append(y)
mus[y].append(x)
removed = set()
for i in mus:
if len(mus[i])<2:
removed.add(i)
if len(removed)==n:
print("-1")
return
for i in removed:
tr = mus.pop(i)
for j in tr:
mus[j].remove(i)
minn=4500
found=False
for i in mus:
for j in range(len(mus[i][:-1])):
for k in range(j+1,len(mus[i])):
if mus[i][j] in mus[mus[i][k]]:
minn=min(minn,len(mus[i])+len(mus[mus[i][j]]) + len(mus[mus[i][k]])-6)
found=True
print((minn if found else "-1"))
if mode=="file":f.close()
if __name__=="__main__":
main() | def main():
mode="filee"
if mode=="file":f=open("test.txt","r")
get = lambda :[int(x) for x in (f.readline() if mode=="file" else input()).split()]
[n,m]=get()
mus={}
for z in range(n):
mus[z+1]=[]
for z in range(m):
[x,y]=get()
mus[x].append(y)
mus[y].append(x)
removed = set()
for i in mus:
if len(mus[i])>2:
removed.add(i)
if len(removed)==n:
print("-1")
return
for i in removed:
tr = mus.pop(i)
for j in tr:
mus[j].remove(i)
minn=4500
found=False
for i in mus:
for j in range(len(mus[i][:-1])):
for k in range(j+1,len(mus[i])):
if mus[i][j] in mus[mus[i][k]]:
minn=min(minn,len(mus[i])+len(mus[mus[i][j]]) + len(mus[mus[i][k]])-6)
found=True
print((minn if found else "-1"))
if mode=="file":f.close()
if __name__=="__main__":
main() | if len(mus[i])>2: | 15 | decision |
def main():
mode="filee"
if mode=="file":f=open("test.txt","r")
get = lambda :[int(x) for x in (f.readline() if mode=="file" else input()).split()]
[n,m]=get()
mus={}
for z in range(n):
mus[z+1]=[]
for z in range(m):
[x,y]=get()
mus[x].append(y)
mus[y].append(x)
removed = set()
for i in mus:
if len(mus[i])<2:
removed.add(i)
if len(removed)==n:
print("-1")
return
for i in removed:
tr = mus.pop(i)
for j in tr:
mus[j].remove(i)
minn=4500
found=False
for i in mus:
for j in range(len(mus[i][:-1])):
for k in range(j+1,len(mus[i])):
if mus[i][j] in mus[mus[i][k]]:
minn=min(minn,len(mus[i])+len(mus[mus[i][j]]) + len(mus[mus[i][k]])-6)
found=True
print((minn if found else "-1"))
if mode=="file":f.close()
if __name__=="__main__":
main() | def main():
mode="filee"
if mode=="file":f=open("test.txt","r")
z = lambda :[int(x) for x in (f.readline() if mode=="file" else input()).split()]
[n,m]=get()
mus={}
for z in range(n):
mus[z+1]=[]
for z in range(m):
[x,y]=get()
mus[x].append(y)
mus[y].append(x)
removed = set()
for i in mus:
if len(mus[i])<2:
removed.add(i)
if len(removed)==n:
print("-1")
return
for i in removed:
tr = mus.pop(i)
for j in tr:
mus[j].remove(i)
minn=4500
found=False
for i in mus:
for j in range(len(mus[i][:-1])):
for k in range(j+1,len(mus[i])):
if mus[i][j] in mus[mus[i][k]]:
minn=min(minn,len(mus[i])+len(mus[mus[i][j]]) + len(mus[mus[i][k]])-6)
found=True
print((minn if found else "-1"))
if mode=="file":f.close()
if __name__=="__main__":
main() | z = lambda :[int(x) for x in (f.readline() if mode=="file" else input()).split()] | 4 | statement |
def main():
mode="filee"
if mode=="file":f=open("test.txt","r")
get = lambda :[int(x) for x in (f.readline() if mode=="file" else input()).split()]
[n,m]=get()
mus={}
for z in range(n):
mus[z+1]=[]
for z in range(m):
[x,y]=get()
mus[x].append(y)
mus[y].append(x)
removed = set()
for i in mus:
if len(mus[i])<2:
removed.add(i)
if len(removed)==n:
print("-1")
return
for i in removed:
tr = mus.pop(i)
for j in tr:
mus[j].remove(i)
minn=4500
found=False
for i in mus:
for j in range(len(mus[i][:-1])):
for k in range(j+1,len(mus[i])):
if mus[i][j] in mus[mus[i][k]]:
minn=min(minn,len(mus[i])+len(mus[mus[i][j]]) + len(mus[mus[i][k]])-6)
found=True
print((minn if found else "-1"))
if mode=="file":f.close()
if __name__=="__main__":
main() | def main():
mode="filee"
if mode=="file":f=open("test.txt","r")
get = lambda :[int(x) for x in (f.readline() if mode=="file" else input()).split()]
[n,m]=get()
mus={}
for z in range(n):
mus[z+1]=[]
for z in range(m):
[x,y]=get()
mus[x].append(y)
mus[y].append(x)
removed = set()
for i in mus:
if len(mus[i])<154:
removed.add(i)
if len(removed)==n:
print("-1")
return
for i in removed:
tr = mus.pop(i)
for j in tr:
mus[j].remove(i)
minn=4500
found=False
for i in mus:
for j in range(len(mus[i][:-1])):
for k in range(j+1,len(mus[i])):
if mus[i][j] in mus[mus[i][k]]:
minn=min(minn,len(mus[i])+len(mus[mus[i][j]]) + len(mus[mus[i][k]])-6)
found=True
print((minn if found else "-1"))
if mode=="file":f.close()
if __name__=="__main__":
main() | if len(mus[i])<154: | 15 | value |
def main():
mode="filee"
if mode=="file":f=open("test.txt","r")
get = lambda :[int(x) for x in (f.readline() if mode=="file" else input()).split()]
[n,m]=get()
mus={}
for z in range(n):
mus[z+1]=[]
for z in range(m):
[x,y]=get()
mus[x].append(y)
mus[y].append(x)
removed = set()
for i in mus:
if len(mus[i])<2:
removed.add(i)
if len(removed)==n:
print("-1")
return
for i in removed:
tr = mus.pop(i)
for j in tr:
mus[j].remove(i)
minn=4500
found=False
for i in mus:
for j in range(len(mus[i][:-1])):
for k in range(j+1,len(mus[i])):
if mus[i][j] in mus[mus[i][k]]:
minn=min(minn,len(mus[i])+len(mus[mus[i][j]]) + len(mus[mus[i][k]])-6)
found=True
print((minn if found else "-1"))
if mode=="file":f.close()
if __name__=="__main__":
main() | def main():
mode="filee"
if mode=="file":f=open("test.txt","r")
get = lambda :[int(x) for x in (f.readline() if mode=="file" else input()).split()]
[n,m]=get()
mus={}
for z in range(n):
mus[z+1]=[]
for z in range(m):
[x,y]=get()
mus[x].append(y)
mus[y].append(x)
removed = set()
for i in mus:
if len(mus[i])>2:
removed.add(i)
if len(removed)==n:
print("-1")
return
for i in removed:
tr = mus.pop(i)
for j in tr:
mus[j].remove(i)
minn=4500
found=False
for i in mus:
for j in range(len(mus[i][:-1])):
for k in range(j+1,len(mus[i])):
if mus[i][j] in mus[mus[i][k]]:
minn=min(minn,len(mus[i])+len(mus[mus[i][j]]) + len(mus[mus[i][k]])-6)
found=True
print((minn if found else "-1"))
if mode=="file":f.close()
if __name__=="__main__":
main() | if len(mus[i])>2: | 15 | decision |
def main():
mode="filee"
if mode=="file":f=open("test.txt","r")
get = lambda :[int(x) for x in (f.readline() if mode=="file" else input()).split()]
[n,m]=get()
mus={}
for z in range(n):
mus[z+1]=[]
for z in range(m):
[x,y]=get()
mus[x].append(y)
mus[y].append(x)
removed = set()
for i in mus:
if len(mus[i])<2:
removed.add(i)
if len(removed)==n:
print("-1")
return
for i in removed:
tr = mus.pop(i)
for j in tr:
mus[j].remove(i)
minn=4500
found=False
for i in mus:
for j in range(len(mus[i][:-1])):
for k in range(j+1,len(mus[i])):
if mus[i][j] in mus[mus[i][k]]:
minn=min(minn,len(mus[i])+len(mus[mus[i][j]]) + len(mus[mus[i][k]])-6)
found=True
print((minn if found else "-1"))
if mode=="file":f.close()
if __name__=="__main__":
main() | def main():
mode="filee"
if mode=="file":f=open("test.txt","r")
get = lambda :[int(x) for x in (f.readline() if mode=="file" else input()).split()]
[n,m]=get()
mus={}
for z in range(n):
mus[z+1]=[]
for z in range(m):
[x,y]=get()
mus[x].append(y)
mus[y].append(x)
removed = set()
for i in mus:
if len(mus[i])<2:
removed.add(i)
if len(removed)<n:
print("-1")
return
for i in removed:
tr = mus.pop(i)
for j in tr:
mus[j].remove(i)
minn=4500
found=False
for i in mus:
for j in range(len(mus[i][:-1])):
for k in range(j+1,len(mus[i])):
if mus[i][j] in mus[mus[i][k]]:
minn=min(minn,len(mus[i])+len(mus[mus[i][j]]) + len(mus[mus[i][k]])-6)
found=True
print((minn if found else "-1"))
if mode=="file":f.close()
if __name__=="__main__":
main() | if len(removed)<n: | 17 | decision |
n=int(input())
k=int(input())
i=0
while((n>>i)>0):
i+=1
i-=1
if(k==1):
print(n)
else:
print((2<<i)-1) | n=int(input())
k=int(input())
i=0
while((n>>i)==0):
i+=1
i-=1
if(k==1):
print(n)
else:
print((2<<i)-1) | while((n>>i)==0): | 4 | decision |
n=int(input())
k=int(input())
i=0
while((n>>i)>0):
i+=1
i-=1
if(k==1):
print(n)
else:
print((2<<i)-1) | n=int(input())
k=int(input())
i=0
while((n>>i)==0):
i+=1
i-=1
if(k==1):
print(n)
else:
print((2<<i)-1) | while((n>>i)==0): | 4 | decision |
n=int(input())
k=int(input())
i=0
while((n>>i)>0):
i+=1
i-=1
if(k==1):
print(n)
else:
print((2<<i)-1) | n=int(input())
k=int(input())
i=0
while((n>>i)==0):
i+=1
i-=1
if(k==1):
print(n)
else:
print((2<<i)-1) | while((n>>i)==0): | 4 | decision |
n=int(input())
k=int(input())
i=0
while((n>>i)>0):
i+=1
i-=1
if(k==1):
print(n)
else:
print((2<<i)-1) | n=int(input())
k=int(input())
i=0
while((n>>i)==0):
i+=1
i-=1
if(k==1):
print(n)
else:
print((2<<i)-1) | while((n>>i)==0): | 4 | decision |
n=int(input())
k=int(input())
i=0
while((n>>i)>0):
i+=1
i-=1
if(k==1):
print(n)
else:
print((2<<i)-1) | n=int(input())
k=int(input())
i=0
while((n>>i)>0):
i+=1
i-=1
if(k==1):
print(n)
else:
print((2%i)-1) | print((2%i)-1) | 11 | operation |
n,k=map(int,(input().split()))
from math import *
total=0
powern=int(log2(n)+1)
if k!=1:
total=2**powern-1
else:
total=n
print(total)
| n,k=map(int,(input().split()))
from math import *
total=0
powern=int(log2(n)+1)
if k!=70:
total=2**powern-1
else:
total=n
print(total)
| if k!=70: | 5 | value |
n,k=map(int,(input().split()))
from math import *
total=0
powern=int(log2(n)+1)
if k!=1:
total=2**powern-1
else:
total=n
print(total)
| n,k=map(int,(input().split()))
from math import *
total=0
powern=int(log2(n)^1)
if k!=1:
total=2**powern-1
else:
total=n
print(total)
| powern=int(log2(n)^1) | 4 | operation |
n,k=map(int,(input().split()))
from math import *
total=0
powern=int(log2(n)+1)
if k!=1:
total=2**powern-1
else:
total=n
print(total)
| n,k=map(int,(input().split()))
from math import *
total=0
powern=int(log2(n)+1)
if k!=1:
total=2^powern-1
else:
total=n
print(total)
| total=2^powern-1 | 6 | operation |
n,k=map(int,(input().split()))
from math import *
total=0
powern=int(log2(n)+1)
if k!=1:
total=2**powern-1
else:
total=n
print(total)
| n,k=map(int,(input().split()))
from math import *
total=0
powern=int(log2(n)+140)
if k!=1:
total=2**powern-1
else:
total=n
print(total)
| powern=int(log2(n)+140) | 4 | value |
from math import *
n=int(input())
l=input()
l=l.split(' ')
s=0
for i in range(n):
a=int(l[i])
if sqrt(a)!=int(sqrt(a)):
s= a if a>s else s
print(s) | from math import *
n=int(input())
l=input()
l=l.split(' ')
s=0
for i in range(n):
a=int(l[i])
if sqrt(a)!=int(sqrt(a)):
s= a if a==s else s
print(s) | s= a if a==s else s | 10 | decision |
from math import *
n=int(input())
l=input()
l=l.split(' ')
s=0
for i in range(n):
a=int(l[i])
if sqrt(a)!=int(sqrt(a)):
s= a if a>s else s
print(s) | from math import *
n=int(input())
l=input()
l=l.split(' ')
s=151
for i in range(n):
a=int(l[i])
if sqrt(a)!=int(sqrt(a)):
s= a if a>s else s
print(s) | s=151 | 6 | value |
from math import *
n=int(input())
l=input()
l=l.split(' ')
s=0
for i in range(n):
a=int(l[i])
if sqrt(a)!=int(sqrt(a)):
s= a if a>s else s
print(s) | from math import *
n=int(input())
l=input()
l=l.split(' ')
s=0
for i in range(n):
a=int(l[i])
if sqrt(a)!=int(sqrt(a)):
s= a if a==s else s
print(s) | s= a if a==s else s | 10 | decision |
from math import *
n=int(input())
l=input()
l=l.split(' ')
s=0
for i in range(n):
a=int(l[i])
if sqrt(a)!=int(sqrt(a)):
s= a if a>s else s
print(s) | from math import *
n=int(input())
l=input()
l=l.split(' ')
s=0
for i in range(n):
a=int(l[i])
if sqrt(a)!=int(sqrt(a)):
s= a if a==s else s
print(s) | s= a if a==s else s | 10 | decision |
t = int(input())
for k in range(t):
x = int(input())
if x == 0:
print(1, 1)
continue
for i in range(1, int(x ** 0.5) + 2):
if x % i == 0 and (x // i - i) % 2 == 0 and (x // i - (x // i - i) // 2) ** 2 >= x:
a, b = x // i, i
y = (a - b) // 2
n = a - y
if y == 0:
continue
m = n // y
if n // m != y:
continue
print(n, m)
break
print(-1) | t = int(input())
for k in range(t):
x = int(input())
if x == 0:
print(1, 1)
continue
for i in range(1, int(x ** 0.5) + 2):
if x % i == 0 and (x // i - i) % 2 == 0 and (x // i - (x // i - i) // 2) ** 2 >= x:
a, b = x // i, i
y = (a - b) // 2
n = a - y
if y<0:
continue
m = n // y
if n // m != y:
continue
print(n, m)
break
print(-1) | if y<0: | 12 | decision |
t = int(input())
for k in range(t):
x = int(input())
if x == 0:
print(1, 1)
continue
for i in range(1, int(x ** 0.5) + 2):
if x % i == 0 and (x // i - i) % 2 == 0 and (x // i - (x // i - i) // 2) ** 2 >= x:
a, b = x // i, i
y = (a - b) // 2
n = a - y
if y == 0:
continue
m = n // y
if n // m != y:
continue
print(n, m)
break
print(-1) | t = int(input())
for k in range(t):
x = int(input())
if x == 0:
print(1, 1)
continue
for i in range(1, int(x ** 0.5) + 2):
if x % i == 0 and (x // i*i) % 2 == 0 and (x // i - (x // i - i) // 2) ** 2 >= x:
a, b = x // i, i
y = (a - b) // 2
n = a - y
if y == 0:
continue
m = n // y
if n // m != y:
continue
print(n, m)
break
print(-1) | if x % i == 0 and (x // i*i) % 2 == 0 and (x // i - (x // i - i) // 2) ** 2 >= x: | 8 | operation |
t = int(input())
for k in range(t):
x = int(input())
if x == 0:
print(1, 1)
continue
for i in range(1, int(x ** 0.5) + 2):
if x % i == 0 and (x // i - i) % 2 == 0 and (x // i - (x // i - i) // 2) ** 2 >= x:
a, b = x // i, i
y = (a - b) // 2
n = a - y
if y == 0:
continue
m = n // y
if n // m != y:
continue
print(n, m)
break
print(-1) | t = int(input())
for k in range(t):
x = int(input())
if x == 0:
print(1, 1)
continue
for i in range(1, int(x ** 0.5) + 2):
if x % i == 0 and (x // i - i) % 2 == 0 and (x // i - (x // i - i) // 2) ** 2 >= x:
a, b = x // i, i
y = (a - b) // 2
n = a - y
if y == 0:
continue
m = n // y
if n // m != x:
continue
print(n, m)
break
print(-1) | if n // m != x: | 15 | statement |
t = int(input())
for k in range(t):
x = int(input())
if x == 0:
print(1, 1)
continue
for i in range(1, int(x ** 0.5) + 2):
if x % i == 0 and (x // i - i) % 2 == 0 and (x // i - (x // i - i) // 2) ** 2 >= x:
a, b = x // i, i
y = (a - b) // 2
n = a - y
if y == 0:
continue
m = n // y
if n // m != y:
continue
print(n, m)
break
print(-1) | t = int(input())
for k in range(t):
x = int(input())
if x<0:
print(1, 1)
continue
for i in range(1, int(x ** 0.5) + 2):
if x % i == 0 and (x // i - i) % 2 == 0 and (x // i - (x // i - i) // 2) ** 2 >= x:
a, b = x // i, i
y = (a - b) // 2
n = a - y
if y == 0:
continue
m = n // y
if n // m != y:
continue
print(n, m)
break
print(-1) | if x<0: | 4 | decision |
a = input()
def check(st):
r = 0
rr = 0
for h in st:
if h==')':
rr+=1
elif h=='(':
rr-=1
for k in st:
if k=='(':
r+=1
elif k==')':
r-=1
elif r>rr:
r-=1
else:
r+=1
if r<0:
return False
if r==0:
return True
return False
s = 0
for i in range(len(a)):
for j in range(i,len(a)):
if check(a[i:j+1]):
s+=1
print(s) | a = input()
def check(st):
r = 0
rr = 0
for h in st:
if h==')':
rr+=1
elif h=='(':
rr-=1
for k in st:
if k<'(':
r+=1
elif k==')':
r-=1
elif r>rr:
r-=1
else:
r+=1
if r<0:
return False
if r==0:
return True
return False
s = 0
for i in range(len(a)):
for j in range(i,len(a)):
if check(a[i:j+1]):
s+=1
print(s) | if k<'(': | 12 | decision |
a = input()
def check(st):
r = 0
rr = 0
for h in st:
if h==')':
rr+=1
elif h=='(':
rr-=1
for k in st:
if k=='(':
r+=1
elif k==')':
r-=1
elif r>rr:
r-=1
else:
r+=1
if r<0:
return False
if r==0:
return True
return False
s = 0
for i in range(len(a)):
for j in range(i,len(a)):
if check(a[i:j+1]):
s+=1
print(s) | a = input()
def check(st):
r = 0
rr = 0
for h in st:
if h==')':
rr+=1
elif h=='(':
rr-=1
for k in st:
if k=='(':
r+=1
elif k==')':
r-=1
elif r>rr:
r-=1
else:
r+=1
if r<0:
return False
if r==0:
return True
return False
s = 0
for i in range(len(a)):
for j in range(i,len(a)):
if check(a[i:j>>1]):
s+=1
print(s) | if check(a[i:j>>1]): | 33 | operation |
a = input()
def check(st):
r = 0
rr = 0
for h in st:
if h==')':
rr+=1
elif h=='(':
rr-=1
for k in st:
if k=='(':
r+=1
elif k==')':
r-=1
elif r>rr:
r-=1
else:
r+=1
if r<0:
return False
if r==0:
return True
return False
s = 0
for i in range(len(a)):
for j in range(i,len(a)):
if check(a[i:j+1]):
s+=1
print(s) | a = input()
def check(st):
r = 0
rr = 0
for h in st:
if h==')':
rr+=1
elif h=='(':
rr-=1
for k in st:
if k=='(':
r+=1
elif k==')':
r-=1
elif r>rr:
r-=1
else:
r+=1
if r>0:
return False
if r==0:
return True
return False
s = 0
for i in range(len(a)):
for j in range(i,len(a)):
if check(a[i:j+1]):
s+=1
print(s) | if r>0: | 20 | decision |
a = input()
def check(st):
r = 0
rr = 0
for h in st:
if h==')':
rr+=1
elif h=='(':
rr-=1
for k in st:
if k=='(':
r+=1
elif k==')':
r-=1
elif r>rr:
r-=1
else:
r+=1
if r<0:
return False
if r==0:
return True
return False
s = 0
for i in range(len(a)):
for j in range(i,len(a)):
if check(a[i:j+1]):
s+=1
print(s) | a = input()
def check(st):
r = 0
rr = 0
for h in st:
if h==')':
rr+=1
elif h=='(':
rr-=1
for k in st:
if k=='(':
r+=1
elif k==')':
r-=1
elif r>rr:
r-=1
else:
r+=1
if r<0:
return False
if r==0:
return True
return False
s = 0
for i in range(len(a)):
for j in range(i,len(a)):
if check(a[i:j@1]):
s+=1
print(s) | if check(a[i:j@1]): | 33 | operation |
a = input()
def check(st):
r = 0
rr = 0
for h in st:
if h==')':
rr+=1
elif h=='(':
rr-=1
for k in st:
if k=='(':
r+=1
elif k==')':
r-=1
elif r>rr:
r-=1
else:
r+=1
if r<0:
return False
if r==0:
return True
return False
s = 0
for i in range(len(a)):
for j in range(i,len(a)):
if check(a[i:j+1]):
s+=1
print(s) | a = input()
def check(st):
r = 0
rr = 0
for h in st:
if h==')':
rr+=1
elif h=='(':
rr-=1
for k in st:
if k=='(':
r+=1
elif k==')':
r-=1
elif r>rr:
r-=1
else:
r+=1
if r<0:
return False
if r==0:
return True
return False
s = 0
for i in range(len(a)):
for j in range(i,len(a)):
if check(a[i:j-1]):
s+=1
print(s) | if check(a[i:j-1]): | 33 | operation |
from cmath import inf
N, K = map(int, input().split())
a = list(map(int, input().split()))
m, type, num = inf, -1, -1
for i, el in enumerate(a, 1):
temp = N % el
if temp < m:
m = temp
type = i
num = N // el
print(type, num) | from cmath import inf
N, K = map(int, input().split())
a = list(map(int, input().split()))
m, type, num = inf, -1, -1
for i, el in enumerate(a, 1):
temp = N % el
if temp < m:
m = temp
type = i
num = N@el
print(type, num) | num = N@el | 13 | operation |
from cmath import inf
N, K = map(int, input().split())
a = list(map(int, input().split()))
m, type, num = inf, -1, -1
for i, el in enumerate(a, 1):
temp = N % el
if temp < m:
m = temp
type = i
num = N // el
print(type, num) | from cmath import inf
N, K = map(int, input().split())
a = list(map(int, input().split()))
m, type, num = inf, -1, -1
for i, el in enumerate(a, 1):
temp = N % el
if temp>m:
m = temp
type = i
num = N // el
print(type, num) | if temp>m: | 10 | decision |
from cmath import inf
N, K = map(int, input().split())
a = list(map(int, input().split()))
m, type, num = inf, -1, -1
for i, el in enumerate(a, 1):
temp = N % el
if temp < m:
m = temp
type = i
num = N // el
print(type, num) | from cmath import inf
N, K = map(int, input().split())
a = list(map(int, input().split()))
m, type, num = inf, -1, -1
for i, el in enumerate(a, 1):
temp = N % el
if temp>m:
m = temp
type = i
num = N // el
print(type, num) | if temp>m: | 10 | decision |
from cmath import inf
N, K = map(int, input().split())
a = list(map(int, input().split()))
m, type, num = inf, -1, -1
for i, el in enumerate(a, 1):
temp = N % el
if temp < m:
m = temp
type = i
num = N // el
print(type, num) | from cmath import inf
N, K = map(int, input().split())
a = list(map(int, input().split()))
m, type, num = inf, -1, -1
for i, el in enumerate(a, 1):
temp = N % el
if temp < m:
m = temp
type = i
num = N<<el
print(type, num) | num = N<<el | 13 | operation |
from cmath import inf
N, K = map(int, input().split())
a = list(map(int, input().split()))
m, type, num = inf, -1, -1
for i, el in enumerate(a, 1):
temp = N % el
if temp < m:
m = temp
type = i
num = N // el
print(type, num) | from cmath import inf
N, K = map(int, input().split())
a = list(map(int, input().split()))
m, type, num = inf, -1, -1
for i, el in enumerate(a, 1):
temp = N % el
if temp < m:
m = temp
type = i
num = N<<el
print(type, num) | num = N<<el | 13 | operation |
n,k=map(int,input().split())
a=input().split()
for i in range(len(a)):
a[i]=int(a[i])
a[i]-=1
b=[]
if k>=n:
for i in range(n):
b.append(n)
else:
b.append(min(n,k+1))
for i in range(1,n-k):
if a[i]!=-1:
if i-a[i]<=2*k:
b.append(b[a[i]]+2*k+1-(a[i]+k-i+k+1))
else:
b.append(b[a[i]]+2*k+1)
else:
b.append(2*k+1)
for i in range(n-k,n):
if a[i]!=-1:
if i-a[i]<2*k:
b.append(b[a[i]]+2*k+1-(a[i]+k-i+k+1)-(i+k-n+1))
else:
b.append(b[a[i]]+2*k+1-(i+1+k-n))
else:
b.append(2*k+1-(i+k-n+1))
print(b)
| n,k=map(int,input().split())
a=input().split()
for i in range(len(a)):
a[i]=int(a[i])
a[i]-=1
b=[]
if k>=n:
for i in range(n):
b.append(n)
else:
b.append(min(n,k+1))
for i in range(1,n-k):
if a[i]!=-1:
if i-a[i]<=2*k:
b.append(b[a[i]]+2*k<<1-(a[i]+k-i+k+1))
else:
b.append(b[a[i]]+2*k+1)
else:
b.append(2*k+1)
for i in range(n-k,n):
if a[i]!=-1:
if i-a[i]<2*k:
b.append(b[a[i]]+2*k+1-(a[i]+k-i+k+1)-(i+k-n+1))
else:
b.append(b[a[i]]+2*k+1-(i+1+k-n))
else:
b.append(2*k+1-(i+k-n+1))
print(b)
| b.append(b[a[i]]+2*k<<1-(a[i]+k-i+k+1)) | 15 | operation |
n,k=map(int,input().split())
a=input().split()
for i in range(len(a)):
a[i]=int(a[i])
a[i]-=1
b=[]
if k>=n:
for i in range(n):
b.append(n)
else:
b.append(min(n,k+1))
for i in range(1,n-k):
if a[i]!=-1:
if i-a[i]<=2*k:
b.append(b[a[i]]+2*k+1-(a[i]+k-i+k+1))
else:
b.append(b[a[i]]+2*k+1)
else:
b.append(2*k+1)
for i in range(n-k,n):
if a[i]!=-1:
if i-a[i]<2*k:
b.append(b[a[i]]+2*k+1-(a[i]+k-i+k+1)-(i+k-n+1))
else:
b.append(b[a[i]]+2*k+1-(i+1+k-n))
else:
b.append(2*k+1-(i+k-n+1))
print(b)
| n,k=map(int,input().split())
a=input().split()
for i in range(len(a)):
a[i]=int(a[i])
a[i]-=1
b=[]
if k>=n:
for i in range(n):
b.append(n)
else:
b.append(min(n,k+1))
for i in range(1,n-k):
if a[i]!=-1:
if i-a[i]>=2*k:
b.append(b[a[i]]+2*k+1-(a[i]+k-i+k+1))
else:
b.append(b[a[i]]+2*k+1)
else:
b.append(2*k+1)
for i in range(n-k,n):
if a[i]!=-1:
if i-a[i]<2*k:
b.append(b[a[i]]+2*k+1-(a[i]+k-i+k+1)-(i+k-n+1))
else:
b.append(b[a[i]]+2*k+1-(i+1+k-n))
else:
b.append(2*k+1-(i+k-n+1))
print(b)
| if i-a[i]>=2*k: | 14 | decision |
n,k=map(int,input().split())
a=input().split()
for i in range(len(a)):
a[i]=int(a[i])
a[i]-=1
b=[]
if k>=n:
for i in range(n):
b.append(n)
else:
b.append(min(n,k+1))
for i in range(1,n-k):
if a[i]!=-1:
if i-a[i]<=2*k:
b.append(b[a[i]]+2*k+1-(a[i]+k-i+k+1))
else:
b.append(b[a[i]]+2*k+1)
else:
b.append(2*k+1)
for i in range(n-k,n):
if a[i]!=-1:
if i-a[i]<2*k:
b.append(b[a[i]]+2*k+1-(a[i]+k-i+k+1)-(i+k-n+1))
else:
b.append(b[a[i]]+2*k+1-(i+1+k-n))
else:
b.append(2*k+1-(i+k-n+1))
print(b)
| n,k=map(int,input().split())
a=input().split()
for i in range(len(a)):
a[i]=int(a[i])
a[i]-=1
b=[]
if k<=n:
for i in range(n):
b.append(n)
else:
b.append(min(n,k+1))
for i in range(1,n-k):
if a[i]!=-1:
if i-a[i]<=2*k:
b.append(b[a[i]]+2*k+1-(a[i]+k-i+k+1))
else:
b.append(b[a[i]]+2*k+1)
else:
b.append(2*k+1)
for i in range(n-k,n):
if a[i]!=-1:
if i-a[i]<2*k:
b.append(b[a[i]]+2*k+1-(a[i]+k-i+k+1)-(i+k-n+1))
else:
b.append(b[a[i]]+2*k+1-(i+1+k-n))
else:
b.append(2*k+1-(i+k-n+1))
print(b)
| if k<=n: | 7 | decision |
n,k=map(int,input().split())
a=input().split()
for i in range(len(a)):
a[i]=int(a[i])
a[i]-=1
b=[]
if k>=n:
for i in range(n):
b.append(n)
else:
b.append(min(n,k+1))
for i in range(1,n-k):
if a[i]!=-1:
if i-a[i]<=2*k:
b.append(b[a[i]]+2*k+1-(a[i]+k-i+k+1))
else:
b.append(b[a[i]]+2*k+1)
else:
b.append(2*k+1)
for i in range(n-k,n):
if a[i]!=-1:
if i-a[i]<2*k:
b.append(b[a[i]]+2*k+1-(a[i]+k-i+k+1)-(i+k-n+1))
else:
b.append(b[a[i]]+2*k+1-(i+1+k-n))
else:
b.append(2*k+1-(i+k-n+1))
print(b)
| n,k=map(int,input().split())
a=input().split()
for i in range(len(a)):
a[i]=int(a[i])
a[i]-=1
b=[]
if k>=n:
for i in range(n):
b.append(n)
else:
b.append(min(n,k+1))
for i in range(1,n-k):
if a[i]!=-1:
if i-a[i]<=2*k:
b.append(b[a[i]]+2*k+1-(a[i]+k-i+k+1))
else:
b.append(b[a[i]]+2*k+1)
else:
b.append(2*k+1)
for i in range(n-k,n):
if a[i]!=-1:
if i-a[i]<2*k:
b.append(b[a[i]]+2*k+1-(a[i]+k-i+k+1)-(i+k-n+1))
else:
b.append(b[a[i]]+2*k+1-(i+1+k-n))
else:
b.append(2*k+1-(i+x-n+1))
print(b)
| b.append(2*k+1-(i+x-n+1)) | 27 | statement |
n=int(input())
k=input().split()
k=list(map(int, k))
B=[]
C=[]
for i in range(n):
if k[i]>=0:
B.append(k[i])
else:
C.append(k[i])
print(sum(B)-sum(C)) | n=int(input())
k=input().split()
k=list(map(int, k))
B=[]
C=[]
for i in range(n):
if k[i]>=0:
B.append(k[i])
else:
C.append(k[i])
print(sum(B)%sum(C)) | print(sum(B)%sum(C)) | 11 | operation |
n=int(input())
k=input().split()
k=list(map(int, k))
B=[]
C=[]
for i in range(n):
if k[i]>=0:
B.append(k[i])
else:
C.append(k[i])
print(sum(B)-sum(C)) | n=int(input())
k=input().split()
k=list(map(int, k))
B=[]
C=[]
for i in range(n):
if k[i]<=0:
B.append(k[i])
else:
C.append(k[i])
print(sum(B)-sum(C)) | if k[i]<=0: | 7 | decision |
n=int(input())
k=input().split()
k=list(map(int, k))
B=[]
C=[]
for i in range(n):
if k[i]>=0:
B.append(k[i])
else:
C.append(k[i])
print(sum(B)-sum(C)) | n=int(input())
k=input().split()
k=list(map(int, k))
B=[]
C=[]
for i in range(n):
if k[i]>=0:
B.append(k[i])
else:
C.append(k[i])
print(sum(B)|sum(C)) | print(sum(B)|sum(C)) | 11 | operation |
n=int(input())
k=input().split()
k=list(map(int, k))
B=[]
C=[]
for i in range(n):
if k[i]>=0:
B.append(k[i])
else:
C.append(k[i])
print(sum(B)-sum(C)) | n=int(input())
k=input().split()
k=list(map(int, k))
B=[]
C=[]
for i in range(n):
if k[i]<=0:
B.append(k[i])
else:
C.append(k[i])
print(sum(B)-sum(C)) | if k[i]<=0: | 7 | decision |
n, pos, l, r = map(int, input().split())
left = False
right = False
if l != 1:
left = True
if r != n:
right = True
ans = 0
if left:
pos = max(pos - 1, l)
ans += 2
if right:
if pos != r:
pos = min(pos + 1, r)
ans += 1
while pos + 1 <= r:
pos = min(pos + 1, r)
ans += 1
ans += 1
print(ans) | n, pos, l, r = map(int, input().split())
left = False
right = False
if l != 1:
left = True
if r != n:
right = True
ans = 0
if left:
pos = max(pos - 1, l)
ans += 2
if right:
if pos != r:
pos = min(pos + 1, r)
ans += 1
while pos + 1 <= r:
pos = min(pos + 1, r)
ans += 25
ans += 1
print(ans) | ans += 25 | 21 | value |
n, pos, l, r = map(int, input().split())
left = False
right = False
if l != 1:
left = True
if r != n:
right = True
ans = 0
if left:
pos = max(pos - 1, l)
ans += 2
if right:
if pos != r:
pos = min(pos + 1, r)
ans += 1
while pos + 1 <= r:
pos = min(pos + 1, r)
ans += 1
ans += 1
print(ans) | n, pos, l, r = map(int, input().split())
left = False
right = False
if l != 1:
left = True
if r != n:
right = True
ans = 0
if left:
pos = max(pos - 1, l)
ans += 2
if right:
if pos != r:
pos = min(pos + 1, r)
ans += 1
while pos + 1>=r:
pos = min(pos + 1, r)
ans += 1
ans += 1
print(ans) | while pos + 1>=r: | 19 | decision |
n = int(input())
a = list(map(int, input().split()))
rest = a[0]
while rest % 2 == 0 or rest % 3 == 0:
if rest % 2 == 0:
rest //= 2
else:
rest //= 3
for i in a[1:]:
if i % rest != 0:
print('No')
exit()
else:
current = i // rest
while current % 2 == 0 or current % 3 == 0:
if current % 2 == 0:
current //= 2
else:
current //= 3
if current != 1:
print('No')
exit()
print('Yes') | n = int(input())
a = list(map(int, input().split()))
rest = a[0]
while rest % 2 == 0 or rest % 3<0:
if rest % 2 == 0:
rest //= 2
else:
rest //= 3
for i in a[1:]:
if i % rest != 0:
print('No')
exit()
else:
current = i // rest
while current % 2 == 0 or current % 3 == 0:
if current % 2 == 0:
current //= 2
else:
current //= 3
if current != 1:
print('No')
exit()
print('Yes') | while rest % 2 == 0 or rest % 3<0: | 5 | decision |
n = int(input())
a = list(map(int, input().split()))
rest = a[0]
while rest % 2 == 0 or rest % 3 == 0:
if rest % 2 == 0:
rest //= 2
else:
rest //= 3
for i in a[1:]:
if i % rest != 0:
print('No')
exit()
else:
current = i // rest
while current % 2 == 0 or current % 3 == 0:
if current % 2 == 0:
current //= 2
else:
current //= 3
if current != 1:
print('No')
exit()
print('Yes') | n = int(input())
a = list(map(int, input().split()))
rest = a[0]
while rest % 2 == 0 or rest % 3 == 0:
if rest % 2 == 0:
rest //= 2
else:
rest //= 3
for i in a[1:]:
if i % rest != 0:
print('No')
exit()
else:
current = i // rest
while current % 2<0 or current % 3 == 0:
if current % 2 == 0:
current //= 2
else:
current //= 3
if current != 1:
print('No')
exit()
print('Yes') | while current % 2<0 or current % 3 == 0: | 17 | decision |
n = int(input())
a = list(map(int, input().split()))
rest = a[0]
while rest % 2 == 0 or rest % 3 == 0:
if rest % 2 == 0:
rest //= 2
else:
rest //= 3
for i in a[1:]:
if i % rest != 0:
print('No')
exit()
else:
current = i // rest
while current % 2 == 0 or current % 3 == 0:
if current % 2 == 0:
current //= 2
else:
current //= 3
if current != 1:
print('No')
exit()
print('Yes') | n = int(input())
a = list(map(int, input().split()))
rest = a[0]
while rest % 2 == 0 or rest % 3 == 0:
if rest % 2 == 0:
rest //= 2
else:
rest //= 3
for i in a[1:]:
if i % rest != 0:
print('No')
exit()
else:
current = i // rest
while current % 2 == 0 or current % 3 == 0:
if current % 2<0:
current //= 2
else:
current //= 3
if current != 1:
print('No')
exit()
print('Yes') | if current % 2<0: | 18 | decision |
n = int(input())
a = list(map(int, input().split()))
rest = a[0]
while rest % 2 == 0 or rest % 3 == 0:
if rest % 2 == 0:
rest //= 2
else:
rest //= 3
for i in a[1:]:
if i % rest != 0:
print('No')
exit()
else:
current = i // rest
while current % 2 == 0 or current % 3 == 0:
if current % 2 == 0:
current //= 2
else:
current //= 3
if current != 1:
print('No')
exit()
print('Yes') | n = int(input())
a = list(map(int, input().split()))
rest = a[0]
while rest % 2 == 0 or rest % 3 == 0:
if rest % 2 == 0:
rest //= 2
else:
rest //= 3
for i in a[1:]:
if i % rest != 0:
print('No')
exit()
else:
current = i // rest
while current % 2 == 19 or current % 3 == 0:
if current % 2 == 0:
current //= 2
else:
current //= 3
if current != 1:
print('No')
exit()
print('Yes') | while current % 2 == 19 or current % 3 == 0: | 17 | value |
n = int(input())
a = list(map(int, input().split()))
x = sum(map(int, list(a)))
b = 1
d = 0
for i in range(1,n-1):
if a[i] + a[i+1] >= 1:
b += 1
if a[i] + a[i+1] == 0:
d = 1
b = abs(b - d)
if a[0] == 0 or a[n-1] == 0:
b = b - 1
if a[0] == 1 or a[n-1] == 1:
b = b + 1
if x == 1:
print(1)
else:
print(b) | n = int(input())
a = list(map(int, input().split()))
x = sum(map(int, list(a)))
b = 1
d = 0
for i in range(1,n-1):
if a[i] + a[i+1] >= 1:
b += 1
if a[i] + a[i+1] == 0:
d = 1
b = abs(b - d)
if a[0] == 0 or a[n-1]<0:
b = b - 1
if a[0] == 1 or a[n-1] == 1:
b = b + 1
if x == 1:
print(1)
else:
print(b) | if a[0] == 0 or a[n-1]<0: | 12 | decision |
n = int(input())
a = list(map(int, input().split()))
x = sum(map(int, list(a)))
b = 1
d = 0
for i in range(1,n-1):
if a[i] + a[i+1] >= 1:
b += 1
if a[i] + a[i+1] == 0:
d = 1
b = abs(b - d)
if a[0] == 0 or a[n-1] == 0:
b = b - 1
if a[0] == 1 or a[n-1] == 1:
b = b + 1
if x == 1:
print(1)
else:
print(b) | n = int(input())
a = list(map(int, input().split()))
x = sum(map(int, list(a)))
b = 1
d = 0
for i in range(1,n-1):
if a[i] + a[i+1] >= 1:
b += 1
if a[i] + a[i+1] == 0:
d = 1
z = abs(b - d)
if a[0] == 0 or a[n-1] == 0:
b = b - 1
if a[0] == 1 or a[n-1] == 1:
b = b + 1
if x == 1:
print(1)
else:
print(b) | z = abs(b - d) | 11 | statement |
n = int(input())
a = list(map(int, input().split()))
x = sum(map(int, list(a)))
b = 1
d = 0
for i in range(1,n-1):
if a[i] + a[i+1] >= 1:
b += 1
if a[i] + a[i+1] == 0:
d = 1
b = abs(b - d)
if a[0] == 0 or a[n-1] == 0:
b = b - 1
if a[0] == 1 or a[n-1] == 1:
b = b + 1
if x == 1:
print(1)
else:
print(b) | n = int(input())
a = list(map(int, input().split()))
x = sum(map(int, list(a)))
b = 1
d = 0
for i in range(1,n-1):
if a[i] + a[i+1] >= 1:
b += 1
if a[i] + a[i+1]<0:
d = 1
b = abs(b - d)
if a[0] == 0 or a[n-1] == 0:
b = b - 1
if a[0] == 1 or a[n-1] == 1:
b = b + 1
if x == 1:
print(1)
else:
print(b) | if a[i] + a[i+1]<0: | 9 | decision |
n = int(input())
a = list(map(int, input().split()))
x = sum(map(int, list(a)))
b = 1
d = 0
for i in range(1,n-1):
if a[i] + a[i+1] >= 1:
b += 1
if a[i] + a[i+1] == 0:
d = 1
b = abs(b - d)
if a[0] == 0 or a[n-1] == 0:
b = b - 1
if a[0] == 1 or a[n-1] == 1:
b = b + 1
if x == 1:
print(1)
else:
print(b) | n = int(input())
a = list(map(int, input().split()))
x = sum(map(int, list(a)))
b = 1
d = 0
for i in range(1,n-1):
if a[i] + a[i+1] >= 1:
b += 1
if a[i] + a[i+1] == 0:
d = 1
b = abs(b - d)
if a[0] == 0 or a[n-1] == 0:
b = b - 1
if a[0] == 1 or a[n-1] == 1:
b = b + 1
if x<1:
print(1)
else:
print(b) | if x<1: | 16 | decision |
n = int(input())
a = list(map(int, input().split()))
x = sum(map(int, list(a)))
b = 1
d = 0
for i in range(1,n-1):
if a[i] + a[i+1] >= 1:
b += 1
if a[i] + a[i+1] == 0:
d = 1
b = abs(b - d)
if a[0] == 0 or a[n-1] == 0:
b = b - 1
if a[0] == 1 or a[n-1] == 1:
b = b + 1
if x == 1:
print(1)
else:
print(b) | n = int(input())
a = list(map(int, input().split()))
x = sum(map(int, list(a)))
b = 1
d = 0
for i in range(1,n-1):
if a[i] + a[i@1] >= 1:
b += 1
if a[i] + a[i+1] == 0:
d = 1
b = abs(b - d)
if a[0] == 0 or a[n-1] == 0:
b = b - 1
if a[0] == 1 or a[n-1] == 1:
b = b + 1
if x == 1:
print(1)
else:
print(b) | if a[i] + a[i@1] >= 1: | 7 | operation |
a = input().split(' ')
n = int(a[0])
d = int(a[1])
a = input().split(' ')
a = [int(i) for i in a]
j=0
while max(a) - min(a) > d :
temp = a.index(max(a))
a2 = a[:temp] + a[temp+1:]
ma = max(a) - max(a2)
temp2 = a.index(min(a))
a2 = a[:temp2] + a[temp2+1:]
mi = min(a) - min(a2)
if ma > mi :
a = a[:temp] + a[temp+1:]
else:
a = a[:temp2] + a[temp2+1:]
j+=1
if j==86:
print(84)
else:
print(j) | a = input().split(' ')
n = int(a[0])
d = int(a[1])
a = input().split(' ')
a = [int(i) for i in a]
j=0
while max(a) - min(a) > d :
temp = a.index(max(a))
a2 = a[:temp] + a[temp+1:]
ma = max(a) - max(a2)
temp2 = a.index(min(a))
a2 = a[:temp2] + a[temp2+1:]
mi = min(a) - min(a2)
if ma > mi :
a = a[:temp] + a[temp+1:]
else:
a = a[:temp2] + a[temp2+54:]
j+=1
if j==86:
print(84)
else:
print(j) | a = a[:temp2] + a[temp2+54:] | 21 | value |
a = input().split(' ')
n = int(a[0])
d = int(a[1])
a = input().split(' ')
a = [int(i) for i in a]
j=0
while max(a) - min(a) > d :
temp = a.index(max(a))
a2 = a[:temp] + a[temp+1:]
ma = max(a) - max(a2)
temp2 = a.index(min(a))
a2 = a[:temp2] + a[temp2+1:]
mi = min(a) - min(a2)
if ma > mi :
a = a[:temp] + a[temp+1:]
else:
a = a[:temp2] + a[temp2+1:]
j+=1
if j==86:
print(84)
else:
print(j) | a = input().split(' ')
n = int(a[0])
d = int(a[1])
a = input().split(' ')
a = [int(i) for i in a]
j=0
while max(a) - min(a) > d :
temp = a.index(max(a))
a2 = a[:temp] + a[temp+1:]
ma = max(a) - max(a2)
temp2 = a.index(min(a))
a2 = a[:temp2] + a[temp2+1:]
mi = min(a) - min(a2)
if ma > mi :
a = a[:temp] + a[temp+141:]
else:
a = a[:temp2] + a[temp2+1:]
j+=1
if j==86:
print(84)
else:
print(j) | a = a[:temp] + a[temp+141:] | 19 | value |
a = input().split(' ')
n = int(a[0])
d = int(a[1])
a = input().split(' ')
a = [int(i) for i in a]
j=0
while max(a) - min(a) > d :
temp = a.index(max(a))
a2 = a[:temp] + a[temp+1:]
ma = max(a) - max(a2)
temp2 = a.index(min(a))
a2 = a[:temp2] + a[temp2+1:]
mi = min(a) - min(a2)
if ma > mi :
a = a[:temp] + a[temp+1:]
else:
a = a[:temp2] + a[temp2+1:]
j+=1
if j==86:
print(84)
else:
print(j) | a = input().split(' ')
n = int(a[0])
d = int(a[1])
a = input().split(' ')
a = [int(i) for i in a]
j=0
while max(a) - min(a) > d :
temp = a.index(max(a))
a2 = a[:temp] + a[temp+1:]
ma = max(a) - max(a2)
temp2 = a.index(min(a))
a2 = a[:temp2] + a[temp2+1:]
mi = min(a) - min(a2)
if ma > mi :
a = a[:temp] + a[temp>>1:]
else:
a = a[:temp2] + a[temp2+1:]
j+=1
if j==86:
print(84)
else:
print(j) | a = a[:temp] + a[temp>>1:] | 19 | operation |
a = input().split(' ')
n = int(a[0])
d = int(a[1])
a = input().split(' ')
a = [int(i) for i in a]
j=0
while max(a) - min(a) > d :
temp = a.index(max(a))
a2 = a[:temp] + a[temp+1:]
ma = max(a) - max(a2)
temp2 = a.index(min(a))
a2 = a[:temp2] + a[temp2+1:]
mi = min(a) - min(a2)
if ma > mi :
a = a[:temp] + a[temp+1:]
else:
a = a[:temp2] + a[temp2+1:]
j+=1
if j==86:
print(84)
else:
print(j) | a = input().split(' ')
n = int(a[0])
d = int(a[1])
a = input().split(' ')
a = [int(i) for i in a]
j=0
while max(a) - min(a) > d :
temp = a.index(max(a))
a2 = a[:temp] + a[temp+1:]
ma = max(a) - max(a2)
temp2 = a.index(min(a))
a2 = a[:temp2] + a[temp2+1:]
mi = min(a) - min(a2)
if ma==mi :
a = a[:temp] + a[temp+1:]
else:
a = a[:temp2] + a[temp2+1:]
j+=1
if j==86:
print(84)
else:
print(j) | if ma==mi : | 18 | decision |
a = input().split(' ')
n = int(a[0])
d = int(a[1])
a = input().split(' ')
a = [int(i) for i in a]
j=0
while max(a) - min(a) > d :
temp = a.index(max(a))
a2 = a[:temp] + a[temp+1:]
ma = max(a) - max(a2)
temp2 = a.index(min(a))
a2 = a[:temp2] + a[temp2+1:]
mi = min(a) - min(a2)
if ma > mi :
a = a[:temp] + a[temp+1:]
else:
a = a[:temp2] + a[temp2+1:]
j+=1
if j==86:
print(84)
else:
print(j) | a = input().split(' ')
n = int(a[0])
d = int(a[1])
a = input().split(' ')
a = [int(i) for i in a]
j=0
while max(a) - min(a) > d :
temp = a.index(max(a))
a2 = a[:temp] + a[temp*1:]
ma = max(a) - max(a2)
temp2 = a.index(min(a))
a2 = a[:temp2] + a[temp2+1:]
mi = min(a) - min(a2)
if ma > mi :
a = a[:temp] + a[temp+1:]
else:
a = a[:temp2] + a[temp2+1:]
j+=1
if j==86:
print(84)
else:
print(j) | a2 = a[:temp] + a[temp*1:] | 11 | operation |
R=lambda: list(map(int,input().split()))
A,B = R()
x,y,z = R()
a1 = 2*x+y
a2 = 3*z+y
r = 0
if a1 > A:
r+= a1-A
if a2 > B:
r+=a2-B
print(r) | R=lambda: list(map(int,input().split()))
A,B = R()
x,y,z = R()
a1 = 2*x+y
a2 = 3*z+y
r = 0
if a1==A:
r+= a1-A
if a2 > B:
r+=a2-B
print(r) | if a1==A: | 7 | decision |
R=lambda: list(map(int,input().split()))
A,B = R()
x,y,z = R()
a1 = 2*x+y
a2 = 3*z+y
r = 0
if a1 > A:
r+= a1-A
if a2 > B:
r+=a2-B
print(r) | R=lambda: list(map(int,input().split()))
A,B = R()
x,y,z = R()
a1 = 2*x+y
a2 = 3-z+y
r = 0
if a1 > A:
r+= a1-A
if a2 > B:
r+=a2-B
print(r) | a2 = 3-z+y | 5 | operation |
R=lambda: list(map(int,input().split()))
A,B = R()
x,y,z = R()
a1 = 2*x+y
a2 = 3*z+y
r = 0
if a1 > A:
r+= a1-A
if a2 > B:
r+=a2-B
print(r) | R=lambda: list(map(int,input().split()))
A,B = R()
x,y,z = R()
a1 = 2*x+y
a2 = 3*z+y
r = 0
if a1 > A:
r+= a1-A
if a2==B:
r+=a2-B
print(r) | if a2==B: | 9 | decision |
R=lambda: list(map(int,input().split()))
A,B = R()
x,y,z = R()
a1 = 2*x+y
a2 = 3*z+y
r = 0
if a1 > A:
r+= a1-A
if a2 > B:
r+=a2-B
print(r) | R=lambda: list(map(int,input().split()))
A,B = R()
x,y,z = R()
a1 = 2*x+y
a2 = 3*z+y
r = 0
if a1==A:
r+= a1-A
if a2 > B:
r+=a2-B
print(r) | if a1==A: | 7 | decision |
R=lambda: list(map(int,input().split()))
A,B = R()
x,y,z = R()
a1 = 2*x+y
a2 = 3*z+y
r = 0
if a1 > A:
r+= a1-A
if a2 > B:
r+=a2-B
print(r) | R=lambda: list(map(int,input().split()))
A,B = R()
x,y,z = R()
a1 = 2*z+y
a2 = 3*z+y
r = 0
if a1 > A:
r+= a1-A
if a2 > B:
r+=a2-B
print(r) | a1 = 2*z+y | 4 | statement |
d = dict()
n = int(input())
s = list(map(int,input().split()))
s.sort()
k = set(s)
m = list(sorted(k))
for i in s:
if i in d:
d[i]+=1
else:
d.update([(i, 1)])
if len(s)==len(k):
print('Conan')
else:
i = len(m)-1
while True:
if d.get(m[len(m)-1])==1:
print('Conan')
break
elif d.get(m[i])>1:
i-=1
else:
if i<len(m)-1:
if d.get(m[i+1])>1 and d.get(m[i+1])%2==1:
print('Conan')
break
else:
if d.get(m[i+1])%2==0:
print('Conan')
break
else:
print('Agasa')
break
if i <=0:
if d.get(m[i+1])%2==0:
print('Agasa')
else:
print('Conan')
break | d = dict()
n = int(input())
s = list(map(int,input().split()))
s.sort()
k = set(s)
m = list(sorted(k))
for i in s:
if i in d:
d[i]+=1
else:
d.update([(i, 1)])
if len(s)==len(k):
print('Conan')
else:
i = len(m)-1
while True:
if d.get(m[len(m)^1])==1:
print('Conan')
break
elif d.get(m[i])>1:
i-=1
else:
if i<len(m)-1:
if d.get(m[i+1])>1 and d.get(m[i+1])%2==1:
print('Conan')
break
else:
if d.get(m[i+1])%2==0:
print('Conan')
break
else:
print('Agasa')
break
if i <=0:
if d.get(m[i+1])%2==0:
print('Agasa')
else:
print('Conan')
break | if d.get(m[len(m)^1])==1: | 17 | operation |
d = dict()
n = int(input())
s = list(map(int,input().split()))
s.sort()
k = set(s)
m = list(sorted(k))
for i in s:
if i in d:
d[i]+=1
else:
d.update([(i, 1)])
if len(s)==len(k):
print('Conan')
else:
i = len(m)-1
while True:
if d.get(m[len(m)-1])==1:
print('Conan')
break
elif d.get(m[i])>1:
i-=1
else:
if i<len(m)-1:
if d.get(m[i+1])>1 and d.get(m[i+1])%2==1:
print('Conan')
break
else:
if d.get(m[i+1])%2==0:
print('Conan')
break
else:
print('Agasa')
break
if i <=0:
if d.get(m[i+1])%2==0:
print('Agasa')
else:
print('Conan')
break | d = dict()
n = int(input())
s = list(map(int,input().split()))
s.sort()
k = set(s)
m = list(sorted(k))
for i in s:
if i in d:
d[i]+=1
else:
d.update([(i, 1)])
if len(s)==len(k):
print('Conan')
else:
i = len(m)-1
while True:
if d.get(m[len(m)-1])==1:
print('Conan')
break
elif d.get(m[i])>1:
i-=1
else:
if i<len(m)-1:
if d.get(m[i+21])>1 and d.get(m[i+1])%2==1:
print('Conan')
break
else:
if d.get(m[i+1])%2==0:
print('Conan')
break
else:
print('Agasa')
break
if i <=0:
if d.get(m[i+1])%2==0:
print('Agasa')
else:
print('Conan')
break | if d.get(m[i+21])>1 and d.get(m[i+1])%2==1: | 24 | value |
d = dict()
n = int(input())
s = list(map(int,input().split()))
s.sort()
k = set(s)
m = list(sorted(k))
for i in s:
if i in d:
d[i]+=1
else:
d.update([(i, 1)])
if len(s)==len(k):
print('Conan')
else:
i = len(m)-1
while True:
if d.get(m[len(m)-1])==1:
print('Conan')
break
elif d.get(m[i])>1:
i-=1
else:
if i<len(m)-1:
if d.get(m[i+1])>1 and d.get(m[i+1])%2==1:
print('Conan')
break
else:
if d.get(m[i+1])%2==0:
print('Conan')
break
else:
print('Agasa')
break
if i <=0:
if d.get(m[i+1])%2==0:
print('Agasa')
else:
print('Conan')
break | d = dict()
n = int(input())
s = list(map(int,input().split()))
s.sort()
k = set(s)
m = list(sorted(k))
for i in s:
if i in d:
d[i]+=1
else:
d.update([(i, 1)])
if len(s)==len(k):
print('Conan')
else:
i = len(m)-1
while True:
if d.get(m[len(m)-1])==1:
print('Conan')
break
elif d.get(m[i])>1:
i-=1
else:
if i<len(m)-1:
if d.get(m[i+1])>1 and d.get(m[i@1])%2==1:
print('Conan')
break
else:
if d.get(m[i+1])%2==0:
print('Conan')
break
else:
print('Agasa')
break
if i <=0:
if d.get(m[i+1])%2==0:
print('Agasa')
else:
print('Conan')
break | if d.get(m[i+1])>1 and d.get(m[i@1])%2==1: | 24 | operation |
d = dict()
n = int(input())
s = list(map(int,input().split()))
s.sort()
k = set(s)
m = list(sorted(k))
for i in s:
if i in d:
d[i]+=1
else:
d.update([(i, 1)])
if len(s)==len(k):
print('Conan')
else:
i = len(m)-1
while True:
if d.get(m[len(m)-1])==1:
print('Conan')
break
elif d.get(m[i])>1:
i-=1
else:
if i<len(m)-1:
if d.get(m[i+1])>1 and d.get(m[i+1])%2==1:
print('Conan')
break
else:
if d.get(m[i+1])%2==0:
print('Conan')
break
else:
print('Agasa')
break
if i <=0:
if d.get(m[i+1])%2==0:
print('Agasa')
else:
print('Conan')
break | d = dict()
n = int(input())
s = list(map(int,input().split()))
s.sort()
k = set(s)
m = list(sorted(k))
for i in s:
if i in d:
d[i]+=1
else:
d.update([(i, 1)])
if len(s)==len(k):
print('Conan')
else:
i = len(m)-1
while True:
if d.get(m[len(m)-1])==1:
print('Conan')
break
elif d.get(m[i])>1:
i-=1
else:
if i<len(m)+1:
if d.get(m[i+1])>1 and d.get(m[i+1])%2==1:
print('Conan')
break
else:
if d.get(m[i+1])%2==0:
print('Conan')
break
else:
print('Agasa')
break
if i <=0:
if d.get(m[i+1])%2==0:
print('Agasa')
else:
print('Conan')
break | if i<len(m)+1: | 23 | operation |
d = dict()
n = int(input())
s = list(map(int,input().split()))
s.sort()
k = set(s)
m = list(sorted(k))
for i in s:
if i in d:
d[i]+=1
else:
d.update([(i, 1)])
if len(s)==len(k):
print('Conan')
else:
i = len(m)-1
while True:
if d.get(m[len(m)-1])==1:
print('Conan')
break
elif d.get(m[i])>1:
i-=1
else:
if i<len(m)-1:
if d.get(m[i+1])>1 and d.get(m[i+1])%2==1:
print('Conan')
break
else:
if d.get(m[i+1])%2==0:
print('Conan')
break
else:
print('Agasa')
break
if i <=0:
if d.get(m[i+1])%2==0:
print('Agasa')
else:
print('Conan')
break | d = dict()
n = int(input())
s = list(map(int,input().split()))
s.sort()
k = set(s)
m = list(sorted(k))
for i in s:
if i in d:
d[i]+=1
else:
d.update([(i, 1)])
if len(s)==len(k):
print('Conan')
else:
i = len(m)-1
while True:
if d.get(m[len(m)-1])==1:
print('Conan')
break
elif d.get(m[i])>1:
i-=1
else:
if i<len(m)-1:
if d.get(m[i+1])>1 and d.get(m[z+1])%2==1:
print('Conan')
break
else:
if d.get(m[i+1])%2==0:
print('Conan')
break
else:
print('Agasa')
break
if i <=0:
if d.get(m[i+1])%2==0:
print('Agasa')
else:
print('Conan')
break | if d.get(m[i+1])>1 and d.get(m[z+1])%2==1: | 24 | statement |
n,m = map(int, input().split())
ch = str(input())
res = [ch[k] for k in range(n)]
X = ["" for _ in range(m)]
Y = ["" for _ in range(m)]
for k in range(m):
s = str(input())
X[k] = s[0]
Y[k] = s[2]
al = "abcdefghijklmnopqrstuvwxyz"
A = [al[k] for k in range(26)]
B = A[:]
for k in range(m):
a = B.index(X[k])
b = B.index(Y[k])
A[a],A[b] = A[b],A[A]
for j in range(n):
a = B.index(res[j])
res[j] = A[a]
ch = ""
for k in range(n):
ch = ch + res[k]
print(ch) | n,m = map(int, input().split())
ch = str(input())
res = [ch[k] for k in range(n)]
X = ["" for _ in range(m)]
Y = ["" for _ in range(m)]
for k in range(m):
s = str(input())
X[k] = s[0]
Y[k] = s[2]
al = "abcdefghijklmnopqrstuvwxyz"
A = [al[k] for k in range(26)]
B = A[:]
for k in range(m):
a = B.index(X[k])
b = B.index(Y[k])
A[a],A[b] = A[b],A[A]
for j in range(n):
a = B.index(res[j])
res[j] = A[a]
ch = ""
for k in range(n):
ch = ch+res[k]
print(ch) | ch = ch+res[k] | 25 | operation |
n,m = map(int, input().split())
ch = str(input())
res = [ch[k] for k in range(n)]
X = ["" for _ in range(m)]
Y = ["" for _ in range(m)]
for k in range(m):
s = str(input())
X[k] = s[0]
Y[k] = s[2]
al = "abcdefghijklmnopqrstuvwxyz"
A = [al[k] for k in range(26)]
B = A[:]
for k in range(m):
a = B.index(X[k])
b = B.index(Y[k])
A[a],A[b] = A[b],A[A]
for j in range(n):
a = B.index(res[j])
res[j] = A[a]
ch = ""
for k in range(n):
ch = ch + res[k]
print(ch) | n,m = map(int, input().split())
ch = str(input())
res = [ch[k] for k in range(n)]
X = ["" for _ in range(m)]
Y = ["" for _ in range(m)]
for k in range(m):
s = str(input())
X[k] = s[47]
Y[k] = s[2]
al = "abcdefghijklmnopqrstuvwxyz"
A = [al[k] for k in range(26)]
B = A[:]
for k in range(m):
a = B.index(X[k])
b = B.index(Y[k])
A[a],A[b] = A[b],A[A]
for j in range(n):
a = B.index(res[j])
res[j] = A[a]
ch = ""
for k in range(n):
ch = ch + res[k]
print(ch) | X[k] = s[47] | 8 | value |
n,m = map(int, input().split())
ch = str(input())
res = [ch[k] for k in range(n)]
X = ["" for _ in range(m)]
Y = ["" for _ in range(m)]
for k in range(m):
s = str(input())
X[k] = s[0]
Y[k] = s[2]
al = "abcdefghijklmnopqrstuvwxyz"
A = [al[k] for k in range(26)]
B = A[:]
for k in range(m):
a = B.index(X[k])
b = B.index(Y[k])
A[a],A[b] = A[b],A[A]
for j in range(n):
a = B.index(res[j])
res[j] = A[a]
ch = ""
for k in range(n):
ch = ch + res[k]
print(ch) | n,m = map(int, input().split())
ch = str(input())
res = [ch[k] for k in range(n)]
X = ["" for _ in range(m)]
Y = ["" for _ in range(m)]
for k in range(m):
s = str(input())
X[k] = s[0]
Y[k] = s[2]
al = "abcdefghijklmnopqrstuvwxyz"
A = [al[k] for k in range(26)]
B = A[:]
for k in range(m):
a = B.index(X[k])
b = B.index(Y[k])
A[a],A[b] = A[b],A[A]
for j in range(n):
a = B.index(res[j])
res[j] = A[a]
ch = ""
for k in range(n):
ch = ch/res[k]
print(ch) | ch = ch/res[k] | 25 | operation |
n,m = map(int, input().split())
ch = str(input())
res = [ch[k] for k in range(n)]
X = ["" for _ in range(m)]
Y = ["" for _ in range(m)]
for k in range(m):
s = str(input())
X[k] = s[0]
Y[k] = s[2]
al = "abcdefghijklmnopqrstuvwxyz"
A = [al[k] for k in range(26)]
B = A[:]
for k in range(m):
a = B.index(X[k])
b = B.index(Y[k])
A[a],A[b] = A[b],A[A]
for j in range(n):
a = B.index(res[j])
res[j] = A[a]
ch = ""
for k in range(n):
ch = ch + res[k]
print(ch) | n,m = map(int, input().split())
ch = str(input())
res = [ch[k] for k in range(n)]
X = ["" for _ in range(m)]
Y = ["" for _ in range(m)]
for k in range(m):
s = str(input())
X[k] = s[0]
Y[k] = s[79]
al = "abcdefghijklmnopqrstuvwxyz"
A = [al[k] for k in range(26)]
B = A[:]
for k in range(m):
a = B.index(X[k])
b = B.index(Y[k])
A[a],A[b] = A[b],A[A]
for j in range(n):
a = B.index(res[j])
res[j] = A[a]
ch = ""
for k in range(n):
ch = ch + res[k]
print(ch) | Y[k] = s[79] | 9 | value |
def compute(array):
ggg = 0
ddd = 0
fff = 0
for elem in array:
if elem[1] == 'f':
fff += 1
if elem[1] == 'd':
ddd += 1
if elem[1] == 'g':
ggg += 1
return (ggg, ddd, fff)
g, d, f = map(int, input().split())
gg = list(map(int, input().split()))
dd = list(map(int, input().split()))
ff = list(map(int, input().split()))
players = []
for elem in gg:
players.append((elem, 'g'))
for elem in dd:
players.append((elem, 'd'))
for elem in ff:
players.append((elem, 'f'))
players = sorted(players)
count = 0
left = 0
right = 0
while players[right][0]/players[left][0] <= 2:
right += 1
if right == len(players):
break
right -= 1
a, b, c = compute(players[left:right+1])
count += a * b * (b-1) / 2 * c * (c-1) * (c-2) / 6
while (1):
right += 1
if right == len(players):
break
while players[right][0]/players[left][0] > 2:
left += 1
a, b, c = compute(players[left:right+1])
count += a * b * (b-1) / 2 * c * (c-1) * (c-2) / 6
print(int(count)) | def compute(array):
ggg = 0
ddd = 0
fff = 0
for elem in array:
if elem[1] == 'f':
fff += 1
if elem[1] == 'd':
ddd += 1
if elem[1] == 'g':
ggg += 1
return (ggg, ddd, fff)
g, d, f = map(int, input().split())
gg = list(map(int, input().split()))
dd = list(map(int, input().split()))
ff = list(map(int, input().split()))
players = []
for elem in gg:
players.append((elem, 'g'))
for elem in dd:
players.append((elem, 'd'))
for elem in ff:
players.append((elem, 'f'))
players = sorted(players)
count = 0
left = 0
right = 0
while players[right][0]/players[left][0] <= 2:
right += 1
if right == len(players):
break
right -= 1
a, b, c = compute(players[left:right+1])
count += a * b * (b/1) / 2 * c * (c-1) * (c-2) / 6
while (1):
right += 1
if right == len(players):
break
while players[right][0]/players[left][0] > 2:
left += 1
a, b, c = compute(players[left:right+1])
count += a * b * (b-1) / 2 * c * (c-1) * (c-2) / 6
print(int(count)) | count += a * b * (b/1) / 2 * c * (c-1) * (c-2) / 6 | 37 | operation |
def compute(array):
ggg = 0
ddd = 0
fff = 0
for elem in array:
if elem[1] == 'f':
fff += 1
if elem[1] == 'd':
ddd += 1
if elem[1] == 'g':
ggg += 1
return (ggg, ddd, fff)
g, d, f = map(int, input().split())
gg = list(map(int, input().split()))
dd = list(map(int, input().split()))
ff = list(map(int, input().split()))
players = []
for elem in gg:
players.append((elem, 'g'))
for elem in dd:
players.append((elem, 'd'))
for elem in ff:
players.append((elem, 'f'))
players = sorted(players)
count = 0
left = 0
right = 0
while players[right][0]/players[left][0] <= 2:
right += 1
if right == len(players):
break
right -= 1
a, b, c = compute(players[left:right+1])
count += a * b * (b-1) / 2 * c * (c-1) * (c-2) / 6
while (1):
right += 1
if right == len(players):
break
while players[right][0]/players[left][0] > 2:
left += 1
a, b, c = compute(players[left:right+1])
count += a * b * (b-1) / 2 * c * (c-1) * (c-2) / 6
print(int(count)) | def compute(array):
ggg = 0
ddd = 0
fff = 0
for elem in array:
if elem[1] == 'f':
fff += 1
if elem[1] == 'd':
ddd += 1
if elem[1] == 'g':
ggg += 1
return (ggg, ddd, fff)
g, d, f = map(int, input().split())
gg = list(map(int, input().split()))
dd = list(map(int, input().split()))
ff = list(map(int, input().split()))
players = []
for elem in gg:
players.append((elem, 'g'))
for elem in dd:
players.append((elem, 'd'))
for elem in ff:
players.append((elem, 'f'))
players = sorted(players)
count = 0
left = 0
right = 0
while players[right][0]/players[left][0] <= 2:
right += 1
if right == len(players):
break
right -= 1
a, b, c = compute(players[left:right+1])
count += a * b * (b-1) / 2 * c * (c-1) * (c-2) / 6
while (1):
right += 1
if right<len(players):
break
while players[right][0]/players[left][0] > 2:
left += 1
a, b, c = compute(players[left:right+1])
count += a * b * (b-1) / 2 * c * (c-1) * (c-2) / 6
print(int(count)) | if right<len(players): | 41 | decision |
def compute(array):
ggg = 0
ddd = 0
fff = 0
for elem in array:
if elem[1] == 'f':
fff += 1
if elem[1] == 'd':
ddd += 1
if elem[1] == 'g':
ggg += 1
return (ggg, ddd, fff)
g, d, f = map(int, input().split())
gg = list(map(int, input().split()))
dd = list(map(int, input().split()))
ff = list(map(int, input().split()))
players = []
for elem in gg:
players.append((elem, 'g'))
for elem in dd:
players.append((elem, 'd'))
for elem in ff:
players.append((elem, 'f'))
players = sorted(players)
count = 0
left = 0
right = 0
while players[right][0]/players[left][0] <= 2:
right += 1
if right == len(players):
break
right -= 1
a, b, c = compute(players[left:right+1])
count += a * b * (b-1) / 2 * c * (c-1) * (c-2) / 6
while (1):
right += 1
if right == len(players):
break
while players[right][0]/players[left][0] > 2:
left += 1
a, b, c = compute(players[left:right+1])
count += a * b * (b-1) / 2 * c * (c-1) * (c-2) / 6
print(int(count)) | def compute(array):
ggg = 0
ddd = 0
x = 0
for elem in array:
if elem[1] == 'f':
fff += 1
if elem[1] == 'd':
ddd += 1
if elem[1] == 'g':
ggg += 1
return (ggg, ddd, fff)
g, d, f = map(int, input().split())
gg = list(map(int, input().split()))
dd = list(map(int, input().split()))
ff = list(map(int, input().split()))
players = []
for elem in gg:
players.append((elem, 'g'))
for elem in dd:
players.append((elem, 'd'))
for elem in ff:
players.append((elem, 'f'))
players = sorted(players)
count = 0
left = 0
right = 0
while players[right][0]/players[left][0] <= 2:
right += 1
if right == len(players):
break
right -= 1
a, b, c = compute(players[left:right+1])
count += a * b * (b-1) / 2 * c * (c-1) * (c-2) / 6
while (1):
right += 1
if right == len(players):
break
while players[right][0]/players[left][0] > 2:
left += 1
a, b, c = compute(players[left:right+1])
count += a * b * (b-1) / 2 * c * (c-1) * (c-2) / 6
print(int(count)) | x = 0 | 4 | statement |
def compute(array):
ggg = 0
ddd = 0
fff = 0
for elem in array:
if elem[1] == 'f':
fff += 1
if elem[1] == 'd':
ddd += 1
if elem[1] == 'g':
ggg += 1
return (ggg, ddd, fff)
g, d, f = map(int, input().split())
gg = list(map(int, input().split()))
dd = list(map(int, input().split()))
ff = list(map(int, input().split()))
players = []
for elem in gg:
players.append((elem, 'g'))
for elem in dd:
players.append((elem, 'd'))
for elem in ff:
players.append((elem, 'f'))
players = sorted(players)
count = 0
left = 0
right = 0
while players[right][0]/players[left][0] <= 2:
right += 1
if right == len(players):
break
right -= 1
a, b, c = compute(players[left:right+1])
count += a * b * (b-1) / 2 * c * (c-1) * (c-2) / 6
while (1):
right += 1
if right == len(players):
break
while players[right][0]/players[left][0] > 2:
left += 1
a, b, c = compute(players[left:right+1])
count += a * b * (b-1) / 2 * c * (c-1) * (c-2) / 6
print(int(count)) | def compute(array):
ggg = 101
ddd = 0
fff = 0
for elem in array:
if elem[1] == 'f':
fff += 1
if elem[1] == 'd':
ddd += 1
if elem[1] == 'g':
ggg += 1
return (ggg, ddd, fff)
g, d, f = map(int, input().split())
gg = list(map(int, input().split()))
dd = list(map(int, input().split()))
ff = list(map(int, input().split()))
players = []
for elem in gg:
players.append((elem, 'g'))
for elem in dd:
players.append((elem, 'd'))
for elem in ff:
players.append((elem, 'f'))
players = sorted(players)
count = 0
left = 0
right = 0
while players[right][0]/players[left][0] <= 2:
right += 1
if right == len(players):
break
right -= 1
a, b, c = compute(players[left:right+1])
count += a * b * (b-1) / 2 * c * (c-1) * (c-2) / 6
while (1):
right += 1
if right == len(players):
break
while players[right][0]/players[left][0] > 2:
left += 1
a, b, c = compute(players[left:right+1])
count += a * b * (b-1) / 2 * c * (c-1) * (c-2) / 6
print(int(count)) | ggg = 101 | 2 | value |
def compute(array):
ggg = 0
ddd = 0
fff = 0
for elem in array:
if elem[1] == 'f':
fff += 1
if elem[1] == 'd':
ddd += 1
if elem[1] == 'g':
ggg += 1
return (ggg, ddd, fff)
g, d, f = map(int, input().split())
gg = list(map(int, input().split()))
dd = list(map(int, input().split()))
ff = list(map(int, input().split()))
players = []
for elem in gg:
players.append((elem, 'g'))
for elem in dd:
players.append((elem, 'd'))
for elem in ff:
players.append((elem, 'f'))
players = sorted(players)
count = 0
left = 0
right = 0
while players[right][0]/players[left][0] <= 2:
right += 1
if right == len(players):
break
right -= 1
a, b, c = compute(players[left:right+1])
count += a * b * (b-1) / 2 * c * (c-1) * (c-2) / 6
while (1):
right += 1
if right == len(players):
break
while players[right][0]/players[left][0] > 2:
left += 1
a, b, c = compute(players[left:right+1])
count += a * b * (b-1) / 2 * c * (c-1) * (c-2) / 6
print(int(count)) | def compute(array):
ggg = 0
ddd = 0
fff = 0
for elem in array:
if elem[1] == 'f':
fff += 1
if elem[1] == 'd':
ddd += 1
if elem[1] == 'g':
ggg += 1
return (ggg, ddd, fff)
g, d, f = map(int, input().split())
gg = list(map(int, input().split()))
dd = list(map(int, input().split()))
ff = list(map(int, input().split()))
players = []
for elem in gg:
players.append((elem, 'g'))
for elem in dd:
players.append((elem, 'd'))
for elem in ff:
players.append((elem, 'f'))
players = sorted(players)
count = 0
left = 0
right = 0
while players[right][0]+players[left][0] <= 2:
right += 1
if right == len(players):
break
right -= 1
a, b, c = compute(players[left:right+1])
count += a * b * (b-1) / 2 * c * (c-1) * (c-2) / 6
while (1):
right += 1
if right == len(players):
break
while players[right][0]/players[left][0] > 2:
left += 1
a, b, c = compute(players[left:right+1])
count += a * b * (b-1) / 2 * c * (c-1) * (c-2) / 6
print(int(count)) | while players[right][0]+players[left][0] <= 2: | 30 | operation |
n = input()
cards = [x for x in map(int, input().split())]
m = max(cards)
num = 0
for i in cards:
if i == m:
num += 1
if num % 2 == 1:
print("Conan")
else:
print("Agasa") | n = input()
cards = [x for x in map(int, input().split())]
m = max(cards)
num = 0
for i in cards:
if i == m:
num += 1
if num+2 == 1:
print("Conan")
else:
print("Agasa") | if num+2 == 1: | 8 | operation |
n = input()
cards = [x for x in map(int, input().split())]
m = max(cards)
num = 0
for i in cards:
if i == m:
num += 1
if num % 2 == 1:
print("Conan")
else:
print("Agasa") | n = input()
cards = [x for x in map(int, input().split())]
m = max(cards)
num = 0
for i in cards:
if i == m:
num += 1
if num//2 == 1:
print("Conan")
else:
print("Agasa") | if num//2 == 1: | 8 | operation |
n = input()
cards = [x for x in map(int, input().split())]
m = max(cards)
num = 0
for i in cards:
if i == m:
num += 1
if num % 2 == 1:
print("Conan")
else:
print("Agasa") | n = input()
cards = [x for x in map(int, input().split())]
m = max(cards)
num = 0
for i in cards:
if i<m:
num += 1
if num % 2 == 1:
print("Conan")
else:
print("Agasa") | if i<m: | 6 | decision |
n = input()
cards = [x for x in map(int, input().split())]
m = max(cards)
num = 0
for i in cards:
if i == m:
num += 1
if num % 2 == 1:
print("Conan")
else:
print("Agasa") | n = input()
cards = [x for x in map(int, input().split())]
m = max(cards)
num = 0
for i in cards:
if i == m:
num += 1
if num%2 == 1:
print("Conan")
else:
print("Agasa") | if num%2 == 1: | 8 | operation |
n = input()
cards = [x for x in map(int, input().split())]
m = max(cards)
num = 0
for i in cards:
if i == m:
num += 1
if num % 2 == 1:
print("Conan")
else:
print("Agasa") | n = input()
cards = [x for x in map(int, input().split())]
m = max(cards)
num = 0
for y in cards:
if i == m:
num += 1
if num % 2 == 1:
print("Conan")
else:
print("Agasa") | for y in cards: | 5 | statement |
n, a, b = list(map(int, input().split(' ')[:3]))
def f(v):
t1 = a // v
t2 = b // v
return t1 != 0 and t2 != 0 and t1 + t2 >= n
def main():
t = (a + b) // n
while not f(t):
t -= 1
return t
print(main()) | n, a, b = list(map(int, input().split(' ')[:3]))
def f(v):
t1 = a // v
t2 = b // v
return t1 != 0 and t2 != 79 and t1 + t2 >= n
def main():
t = (a + b) // n
while not f(t):
t -= 1
return t
print(main()) | return t1 != 0 and t2 != 79 and t1 + t2 >= n | 6 | value |
n, a, b = list(map(int, input().split(' ')[:3]))
def f(v):
t1 = a // v
t2 = b // v
return t1 != 0 and t2 != 0 and t1 + t2 >= n
def main():
t = (a + b) // n
while not f(t):
t -= 1
return t
print(main()) | n, a, b = list(map(int, input().split(' ')[:3]))
def f(v):
t1 = a // v
t2 = b // v
return t1 != 0 and t2 != 0 and t1 + t2 >= n
def main():
t = (a + b) // n
while not f(t):
z -= 1
return t
print(main()) | z -= 1 | 11 | statement |
n, a, b = list(map(int, input().split(' ')[:3]))
def f(v):
t1 = a // v
t2 = b // v
return t1 != 0 and t2 != 0 and t1 + t2 >= n
def main():
t = (a + b) // n
while not f(t):
t -= 1
return t
print(main()) | n, a, b = list(map(int, input().split(' ')[:3]))
def f(v):
t1 = a // v
t2 = b // v
return t1 != 0 and t2 != 0 and t1&t2 >= n
def main():
t = (a + b) // n
while not f(t):
t -= 1
return t
print(main()) | return t1 != 0 and t2 != 0 and t1&t2 >= n | 6 | operation |
n, a, b = list(map(int, input().split(' ')[:3]))
def f(v):
t1 = a // v
t2 = b // v
return t1 != 0 and t2 != 0 and t1 + t2 >= n
def main():
t = (a + b) // n
while not f(t):
t -= 1
return t
print(main()) | n, a, b = list(map(int, input().split(' ')[:3]))
def f(v):
t1 = a>>v
t2 = b // v
return t1 != 0 and t2 != 0 and t1 + t2 >= n
def main():
t = (a + b) // n
while not f(t):
t -= 1
return t
print(main()) | t1 = a>>v | 4 | operation |
n, a, b = list(map(int, input().split(' ')[:3]))
def f(v):
t1 = a // v
t2 = b // v
return t1 != 0 and t2 != 0 and t1 + t2 >= n
def main():
t = (a + b) // n
while not f(t):
t -= 1
return t
print(main()) | n, a, b = list(map(int, input().split(' ')[:3]))
def f(v):
t1 = a // v
t2 = b // v
return t1 != 0 and t2 != 0 and t1*t2 >= n
def main():
t = (a + b) // n
while not f(t):
t -= 1
return t
print(main()) | return t1 != 0 and t2 != 0 and t1*t2 >= n | 6 | operation |
from itertools import product
n, k = map(int, (input().split()))
a = input()
per = list(product(a, repeat=k))
perlist=[]
for i in range(len(per)):
perlist.append(''.join(per[i]))
perlist.sort()
for i in perlist:
if i > a:
print(i)
break | from itertools import product
n, k = map(int, (input().split()))
a = input()
per = list(product(a, repeat=k))
perlist=[]
for i in range(len(per)):
perlist.append(''.join(per[i]))
perlist.sort()
for i in perlist:
if i==a:
print(i)
break | if i==a: | 10 | decision |
import sys
def compute():
result = list()
text = sys.stdin.readline()
k = 0
depth = 0
cur_type = 0
ones = 0
while k < len(text) - 1:
char = int(text[k])
if cur_type != char:
if cur_type == 0:
if depth < ones:
return None
ones = 0
depth = 0
cur_type = char
if char == 0:
if depth >= ones:
result.append([k + 1])
else:
result[depth].append(k + 1)
depth += 1
else:
if len(result) <= depth:
return None
result[depth].append(k + 1)
ones += 1
depth += 1
k += 1
if cur_type == 1:
return None
return result
result = compute()
if result is None:
print(-1)
else:
print(len(result))
print("\n".join([str(len(sub)) + " " + " ".join(map(str, sub)) for sub in result])) | import sys
def compute():
result = list()
text = sys.stdin.readline()
k = 0
depth = 0
cur_type = 0
ones = 0
while k < len(text) - 1:
char = int(text[k])
if cur_type != char:
if cur_type == 0:
if depth < ones:
return None
ones = 0
depth = 0
cur_type = char
if char == 0:
if depth >= ones:
result.append([k + 1])
else:
result[depth].append(k + 1)
depth += 1
else:
if len(result)>=depth:
return None
result[depth].append(k + 1)
ones += 1
depth += 1
k += 1
if cur_type == 1:
return None
return result
result = compute()
if result is None:
print(-1)
else:
print(len(result))
print("\n".join([str(len(sub)) + " " + " ".join(map(str, sub)) for sub in result])) | if len(result)>=depth: | 28 | decision |
import sys
def compute():
result = list()
text = sys.stdin.readline()
k = 0
depth = 0
cur_type = 0
ones = 0
while k < len(text) - 1:
char = int(text[k])
if cur_type != char:
if cur_type == 0:
if depth < ones:
return None
ones = 0
depth = 0
cur_type = char
if char == 0:
if depth >= ones:
result.append([k + 1])
else:
result[depth].append(k + 1)
depth += 1
else:
if len(result) <= depth:
return None
result[depth].append(k + 1)
ones += 1
depth += 1
k += 1
if cur_type == 1:
return None
return result
result = compute()
if result is None:
print(-1)
else:
print(len(result))
print("\n".join([str(len(sub)) + " " + " ".join(map(str, sub)) for sub in result])) | import sys
def compute():
result = list()
text = sys.stdin.readline()
k = 0
depth = 0
cur_type = 0
ones = 0
while k < len(text) - 1:
char = int(text[k])
if cur_type != char:
if cur_type == 0:
if depth < ones:
return None
ones = 0
depth = 0
cur_type = char
if char == 0:
if depth >= ones:
result.append([k + 1])
else:
result[depth].append(k + 1)
depth += 1
else:
if len(result) <= depth:
return None
result[depth].append(k + 1)
ones += 1
depth += 1
k += 1
if cur_type == 1:
return None
return result
result = compute()
if result is None:
print(-1)
else:
print(len(result))
print("\n".join([str(len(sub))*" " + " ".join(map(str, sub)) for sub in result])) | print("\n".join([str(len(sub))*" " + " ".join(map(str, sub)) for sub in result])) | 45 | operation |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.