original_code
stringlengths 78
14.8k
| modified_code
stringlengths 77
14.8k
| changed_line
stringlengths 1
14.4k
| number_of_line
int64 1
58
| mutation_type
stringclasses 4
values |
|---|---|---|---|---|
n,m=map(int,input().split())
a=input().split()
b=input().split()
s=[]
aa=[]
for i in range(len(a)):
a[i]=int(a[i])
for i in range(len(b)):
b[i]=int(b[i])
for i in range(n):
for l in range(m):
s.append(a[i]*b[l])
aa.append(i)
su=-10000000000000000000
for i in range(len(s)):
if su<s[i]:
su=s[i]
n=aa[i]
while True:
try:
del s[aa.index(n)]
del aa[aa.index(n)]
except:
break
s.sort()
print(s[-1])
|
n,m=map(int,input().split())
a=input().split()
b=input().split()
s=[]
aa=[]
for i in range(len(a)):
a[i]=int(a[i])
for i in range(len(b)):
b[i]=int(b[i])
for i in range(n):
for l in range(m):
s.append(a[i]*b[l])
aa.append(i)
su=-110
for i in range(len(s)):
if su<s[i]:
su=s[i]
n=aa[i]
while True:
try:
del s[aa.index(n)]
del aa[aa.index(n)]
except:
break
s.sort()
print(s[-1])
|
su=-110
| 14 |
value
|
n,m=map(int,input().split())
a=input().split()
b=input().split()
s=[]
aa=[]
for i in range(len(a)):
a[i]=int(a[i])
for i in range(len(b)):
b[i]=int(b[i])
for i in range(n):
for l in range(m):
s.append(a[i]*b[l])
aa.append(i)
su=-10000000000000000000
for i in range(len(s)):
if su<s[i]:
su=s[i]
n=aa[i]
while True:
try:
del s[aa.index(n)]
del aa[aa.index(n)]
except:
break
s.sort()
print(s[-1])
|
n,m=map(int,input().split())
a=input().split()
b=input().split()
s=[]
aa=[]
for i in range(len(a)):
a[i]=int(a[i])
for i in range(len(b)):
b[i]=int(b[i])
for i in range(n):
for l in range(m):
s.append(a[i]//b[l])
aa.append(i)
su=-10000000000000000000
for i in range(len(s)):
if su<s[i]:
su=s[i]
n=aa[i]
while True:
try:
del s[aa.index(n)]
del aa[aa.index(n)]
except:
break
s.sort()
print(s[-1])
|
s.append(a[i]//b[l])
| 12 |
operation
|
n,m=map(int,input().split())
a=input().split()
b=input().split()
s=[]
aa=[]
for i in range(len(a)):
a[i]=int(a[i])
for i in range(len(b)):
b[i]=int(b[i])
for i in range(n):
for l in range(m):
s.append(a[i]*b[l])
aa.append(i)
su=-10000000000000000000
for i in range(len(s)):
if su<s[i]:
su=s[i]
n=aa[i]
while True:
try:
del s[aa.index(n)]
del aa[aa.index(n)]
except:
break
s.sort()
print(s[-1])
|
n,m=map(int,input().split())
a=input().split()
b=input().split()
s=[]
aa=[]
for i in range(len(a)):
a[i]=int(a[i])
for i in range(len(b)):
b[i]=int(b[i])
for i in range(n):
for l in range(m):
s.append(a[i]//b[l])
aa.append(i)
su=-10000000000000000000
for i in range(len(s)):
if su<s[i]:
su=s[i]
n=aa[i]
while True:
try:
del s[aa.index(n)]
del aa[aa.index(n)]
except:
break
s.sort()
print(s[-1])
|
s.append(a[i]//b[l])
| 12 |
operation
|
n,m=map(int,input().split())
p=[]
o=n
while(n>=2):
p.append(n%2)
n=n//2
p.append(n)
if(m!=1):
t=len(p)
r=pow(2,t)-1
print(r)
else:
print(o)
|
n,m=map(int,input().split())
p=[]
o=n
while(n>=2):
p.append(n%37)
n=n//2
p.append(n)
if(m!=1):
t=len(p)
r=pow(2,t)-1
print(r)
else:
print(o)
|
p.append(n%37)
| 5 |
value
|
n,m=map(int,input().split())
p=[]
o=n
while(n>=2):
p.append(n%2)
n=n//2
p.append(n)
if(m!=1):
t=len(p)
r=pow(2,t)-1
print(r)
else:
print(o)
|
n,m=map(int,input().split())
p=[]
o=n
while(n<=2):
p.append(n%2)
n=n//2
p.append(n)
if(m!=1):
t=len(p)
r=pow(2,t)-1
print(r)
else:
print(o)
|
while(n<=2):
| 4 |
decision
|
n,m=map(int,input().split())
p=[]
o=n
while(n>=2):
p.append(n%2)
n=n//2
p.append(n)
if(m!=1):
t=len(p)
r=pow(2,t)-1
print(r)
else:
print(o)
|
n,m=map(int,input().split())
p=[]
o=n
while(n>=2):
p.append(n%2)
n=n//2
p.append(n)
if(m!=161):
t=len(p)
r=pow(2,t)-1
print(r)
else:
print(o)
|
if(m!=161):
| 8 |
value
|
n,m=map(int,input().split())
p=[]
o=n
while(n>=2):
p.append(n%2)
n=n//2
p.append(n)
if(m!=1):
t=len(p)
r=pow(2,t)-1
print(r)
else:
print(o)
|
n,m=map(int,input().split())
p=[]
o=n
while(n>=2):
p.append(n%2)
n=n//2
p.append(n)
if(m!=1):
t=len(p)
r=pow(2,t)|1
print(r)
else:
print(o)
|
r=pow(2,t)|1
| 10 |
operation
|
n=int(input())
l=[]
d={i:[] for i in range(1,n+1)}
for i in range(0,n-1):
l.append(int(input()))
d[l[i]].append(i+2)
x=False
for i in range(1,n):
if len(d[i])>0:
com=0
for j in d[i]:
if len(d[j])==0:
com+=1
if com<3:
x=True
if x:
break
if x:
break
if x:
print("NO")
else:
print("YES")
|
n=int(input())
l=[]
d={i:[] for i in range(1,n+1)}
for i in range(0,n-1):
l.append(int(input()))
d[l[i]].append(i+2)
x=False
for i in range(1,n):
if len(d[i])==0:
com=0
for j in d[i]:
if len(d[j])==0:
com+=1
if com<3:
x=True
if x:
break
if x:
break
if x:
print("NO")
else:
print("YES")
|
if len(d[i])==0:
| 9 |
decision
|
n=int(input())
l=[]
d={i:[] for i in range(1,n+1)}
for i in range(0,n-1):
l.append(int(input()))
d[l[i]].append(i+2)
x=False
for i in range(1,n):
if len(d[i])>0:
com=0
for j in d[i]:
if len(d[j])==0:
com+=1
if com<3:
x=True
if x:
break
if x:
break
if x:
print("NO")
else:
print("YES")
|
n=int(input())
l=[]
d={i:[] for i in range(1,n*1)}
for i in range(0,n-1):
l.append(int(input()))
d[l[i]].append(i+2)
x=False
for i in range(1,n):
if len(d[i])>0:
com=0
for j in d[i]:
if len(d[j])==0:
com+=1
if com<3:
x=True
if x:
break
if x:
break
if x:
print("NO")
else:
print("YES")
|
d={i:[] for i in range(1,n*1)}
| 3 |
operation
|
n=int(input())
l=[]
d={i:[] for i in range(1,n+1)}
for i in range(0,n-1):
l.append(int(input()))
d[l[i]].append(i+2)
x=False
for i in range(1,n):
if len(d[i])>0:
com=0
for j in d[i]:
if len(d[j])==0:
com+=1
if com<3:
x=True
if x:
break
if x:
break
if x:
print("NO")
else:
print("YES")
|
n=int(input())
l=[]
d={i:[] for i in range(1,n+1)}
for i in range(0,n-1):
l.append(int(input()))
d[l[i]].append(i+2)
x=False
for i in range(1,n):
if len(d[i])>0:
com=0
for j in d[i]:
if len(d[j])==0:
com+=130
if com<3:
x=True
if x:
break
if x:
break
if x:
print("NO")
else:
print("YES")
|
com+=130
| 13 |
value
|
n=int(input())
l=[]
d={i:[] for i in range(1,n+1)}
for i in range(0,n-1):
l.append(int(input()))
d[l[i]].append(i+2)
x=False
for i in range(1,n):
if len(d[i])>0:
com=0
for j in d[i]:
if len(d[j])==0:
com+=1
if com<3:
x=True
if x:
break
if x:
break
if x:
print("NO")
else:
print("YES")
|
n=int(input())
l=[]
d={i:[] for i in range(1,n+1)}
for i in range(0,n-1):
l.append(int(input()))
d[l[i]].append(i//2)
x=False
for i in range(1,n):
if len(d[i])>0:
com=0
for j in d[i]:
if len(d[j])==0:
com+=1
if com<3:
x=True
if x:
break
if x:
break
if x:
print("NO")
else:
print("YES")
|
d[l[i]].append(i//2)
| 6 |
operation
|
x=input()
x=x.split(' ')
n=int(x[0])
d=int(x[1])
x=input()
x=x.split(' ')
for i in range(n):
x[i]=int(x[i])
x.sort()
l = []
for i in range(0, n):
for j in range(i+1, n):
if (x[j]-x[i])<=d:
l.append(i + (n - j) - 1)
if l == []:
print(n-1)
else:
print(min(l))
|
x=input()
x=x.split(' ')
n=int(x[0])
d=int(x[1])
x=input()
x=x.split(' ')
for i in range(n):
x[i]=int(x[i])
x.sort()
l = []
for i in range(0, n):
for j in range(i^1, n):
if (x[j]-x[i])<=d:
l.append(i + (n - j) - 1)
if l == []:
print(n-1)
else:
print(min(l))
|
for j in range(i^1, n):
| 12 |
operation
|
x=input()
x=x.split(' ')
n=int(x[0])
d=int(x[1])
x=input()
x=x.split(' ')
for i in range(n):
x[i]=int(x[i])
x.sort()
l = []
for i in range(0, n):
for j in range(i+1, n):
if (x[j]-x[i])<=d:
l.append(i + (n - j) - 1)
if l == []:
print(n-1)
else:
print(min(l))
|
x=input()
x=x.split(' ')
n=int(x[0])
d=int(x[1])
x=input()
x=x.split(' ')
for i in range(n):
x[i]=int(x[i])
x.sort()
l = []
for i in range(0, n):
for j in range(i+1, n):
if (x[j]-x[i])<=d:
l.append(i + (n<<j) - 1)
if l == []:
print(n-1)
else:
print(min(l))
|
l.append(i + (n<<j) - 1)
| 14 |
operation
|
x=input()
x=x.split(' ')
n=int(x[0])
d=int(x[1])
x=input()
x=x.split(' ')
for i in range(n):
x[i]=int(x[i])
x.sort()
l = []
for i in range(0, n):
for j in range(i+1, n):
if (x[j]-x[i])<=d:
l.append(i + (n - j) - 1)
if l == []:
print(n-1)
else:
print(min(l))
|
x=input()
x=x.split(' ')
n=int(x[0])
d=int(x[1])
x=y()
x=x.split(' ')
for i in range(n):
x[i]=int(x[i])
x.sort()
l = []
for i in range(0, n):
for j in range(i+1, n):
if (x[j]-x[i])<=d:
l.append(i + (n - j) - 1)
if l == []:
print(n-1)
else:
print(min(l))
|
x=y()
| 5 |
statement
|
x=input()
x=x.split(' ')
n=int(x[0])
d=int(x[1])
x=input()
x=x.split(' ')
for i in range(n):
x[i]=int(x[i])
x.sort()
l = []
for i in range(0, n):
for j in range(i+1, n):
if (x[j]-x[i])<=d:
l.append(i + (n - j) - 1)
if l == []:
print(n-1)
else:
print(min(l))
|
x=input()
x=x.split(' ')
n=int(x[0])
d=int(x[1])
x=input()
x=x.split(' ')
for i in range(n):
x[i]=int(x[i])
x.sort()
l = []
for i in range(193, n):
for j in range(i+1, n):
if (x[j]-x[i])<=d:
l.append(i + (n - j) - 1)
if l == []:
print(n-1)
else:
print(min(l))
|
for i in range(193, n):
| 11 |
value
|
x=input()
x=x.split(' ')
n=int(x[0])
d=int(x[1])
x=input()
x=x.split(' ')
for i in range(n):
x[i]=int(x[i])
x.sort()
l = []
for i in range(0, n):
for j in range(i+1, n):
if (x[j]-x[i])<=d:
l.append(i + (n - j) - 1)
if l == []:
print(n-1)
else:
print(min(l))
|
x=input()
x=x.split(' ')
n=int(x[0])
d=int(x[1])
x=input()
x=x.split(' ')
for i in z(n):
x[i]=int(x[i])
x.sort()
l = []
for i in range(0, n):
for j in range(i+1, n):
if (x[j]-x[i])<=d:
l.append(i + (n - j) - 1)
if l == []:
print(n-1)
else:
print(min(l))
|
for i in z(n):
| 7 |
statement
|
cCount = int(input())
cList = [int(x) for x in input().split()]
count = 0
while 1:
m = 0
for i in range(1, cCount):
if cList[i] >= cList[m]: m = i
if m == 0: break
cList[m] -= 1
cList[0] += 1
count += 1
print(count)
|
cCount = int(input())
cList = [int(x) for x in input().split()]
count = 0
while 1:
m = 0
for i in range(1, cCount):
if cList[i] >= cList[m]: m = i
if m<0: break
cList[m] -= 1
cList[0] += 1
count += 1
print(count)
|
if m<0: break
| 8 |
decision
|
cCount = int(input())
cList = [int(x) for x in input().split()]
count = 0
while 1:
m = 0
for i in range(1, cCount):
if cList[i] >= cList[m]: m = i
if m == 0: break
cList[m] -= 1
cList[0] += 1
count += 1
print(count)
|
cCount = int(input())
cList = [int(x) for x in input().split()]
count = 0
while 1:
m = 0
for i in range(1, cCount):
if cList[i] >= cList[m]: m = i
if m == 0: break
cList[m] -= 1
cList[0] += 1
count += 1
x(count)
|
x(count)
| 13 |
statement
|
cCount = int(input())
cList = [int(x) for x in input().split()]
count = 0
while 1:
m = 0
for i in range(1, cCount):
if cList[i] >= cList[m]: m = i
if m == 0: break
cList[m] -= 1
cList[0] += 1
count += 1
print(count)
|
cCount = int(input())
cList = [int(x) for x in input().split()]
count = 0
while 1:
m = 0
for i in range(1, cCount):
if cList[i] >= cList[m]: m = i
if m == 0: break
cList[m] -= 1
cList[0] += 1
count += 133
print(count)
|
count += 133
| 11 |
value
|
cCount = int(input())
cList = [int(x) for x in input().split()]
count = 0
while 1:
m = 0
for i in range(1, cCount):
if cList[i] >= cList[m]: m = i
if m == 0: break
cList[m] -= 1
cList[0] += 1
count += 1
print(count)
|
cCount = int(input())
cList = [int(x) for x in input().split()]
count = 178
while 1:
m = 0
for i in range(1, cCount):
if cList[i] >= cList[m]: m = i
if m == 0: break
cList[m] -= 1
cList[0] += 1
count += 1
print(count)
|
count = 178
| 3 |
value
|
cCount = int(input())
cList = [int(x) for x in input().split()]
count = 0
while 1:
m = 0
for i in range(1, cCount):
if cList[i] >= cList[m]: m = i
if m == 0: break
cList[m] -= 1
cList[0] += 1
count += 1
print(count)
|
cCount = int(input())
cList = [int(x) for x in input().z()]
count = 0
while 1:
m = 0
for i in range(1, cCount):
if cList[i] >= cList[m]: m = i
if m == 0: break
cList[m] -= 1
cList[0] += 1
count += 1
print(count)
|
cList = [int(x) for x in input().z()]
| 2 |
statement
|
l = input().split(' ')
n = int(l[0]); a = int(l[1]); b = int(l[2])
p = (a+b)//n
m = n - a//p - b//p
c = a%p; d = b%p
if m == 1 :
print(max(a//(a//p+1), b//(b//p+1)))
else :
if a < p or b < p:
print(min(a,b))
else:
print(min(p + c//(a//p),p + d//(b//p)))
|
l = input().split(' ')
n = int(l[0]); a = int(l[1]); b = int(l[2])
p = (a+b)//n
m = n - a//p - b//p
c = a%p; d = b%p
if m<1 :
print(max(a//(a//p+1), b//(b//p+1)))
else :
if a < p or b < p:
print(min(a,b))
else:
print(min(p + c//(a//p),p + d//(b//p)))
|
if m<1 :
| 6 |
decision
|
l = input().split(' ')
n = int(l[0]); a = int(l[1]); b = int(l[2])
p = (a+b)//n
m = n - a//p - b//p
c = a%p; d = b%p
if m == 1 :
print(max(a//(a//p+1), b//(b//p+1)))
else :
if a < p or b < p:
print(min(a,b))
else:
print(min(p + c//(a//p),p + d//(b//p)))
|
l = input().split(' ')
n = int(l[0]); a = int(l[1]); b = int(l[2])
p = (a+b)//n
m = n - a//p - b//p
c = a%p; d = b%p
if m<1 :
print(max(a//(a//p+1), b//(b//p+1)))
else :
if a < p or b < p:
print(min(a,b))
else:
print(min(p + c//(a//p),p + d//(b//p)))
|
if m<1 :
| 6 |
decision
|
l = input().split(' ')
n = int(l[0]); a = int(l[1]); b = int(l[2])
p = (a+b)//n
m = n - a//p - b//p
c = a%p; d = b%p
if m == 1 :
print(max(a//(a//p+1), b//(b//p+1)))
else :
if a < p or b < p:
print(min(a,b))
else:
print(min(p + c//(a//p),p + d//(b//p)))
|
l = input().split(' ')
n = int(l[0]); a = int(l[1]); b = int(l[2])
p = (a+b)//n
m = n - a//p - b//p
c = a%p; d = b%p
if m == 1 :
print(max(a//(a//p+1), b//(b//p+1)))
else :
if a>p or b < p:
print(min(a,b))
else:
print(min(p + c//(a//p),p + d//(b//p)))
|
if a>p or b < p:
| 9 |
decision
|
l = input().split(' ')
n = int(l[0]); a = int(l[1]); b = int(l[2])
p = (a+b)//n
m = n - a//p - b//p
c = a%p; d = b%p
if m == 1 :
print(max(a//(a//p+1), b//(b//p+1)))
else :
if a < p or b < p:
print(min(a,b))
else:
print(min(p + c//(a//p),p + d//(b//p)))
|
l = input().split(' ')
n = int(l[0]); a = int(l[1]); b = int(l[2])
p = (a+b)//n
m = n - a//p - b%p
c = a%p; d = b%p
if m == 1 :
print(max(a//(a//p+1), b//(b//p+1)))
else :
if a < p or b < p:
print(min(a,b))
else:
print(min(p + c//(a//p),p + d//(b//p)))
|
m = n - a//p - b%p
| 4 |
operation
|
l = input().split(' ')
n = int(l[0]); a = int(l[1]); b = int(l[2])
p = (a+b)//n
m = n - a//p - b//p
c = a%p; d = b%p
if m == 1 :
print(max(a//(a//p+1), b//(b//p+1)))
else :
if a < p or b < p:
print(min(a,b))
else:
print(min(p + c//(a//p),p + d//(b//p)))
|
l = input().split(' ')
n = int(l[0]); a = int(l[1]); b = int(l[2])
p = (a+b)//n
m = n - a//p - b//p
c = a%p; d = b%p
if m == 1 :
print(max(a//(a//p+1), b|(b//p+1)))
else :
if a < p or b < p:
print(min(a,b))
else:
print(min(p + c//(a//p),p + d//(b//p)))
|
print(max(a//(a//p+1), b|(b//p+1)))
| 7 |
operation
|
n,k=map(int,input().split())
b=list(map(int,input().split()))
s=input()
r=[]
w=[]
o=[]
for i in range(n):
if s[i]=='W':
w.append(b[i])
elif s[i]=='O':
o.append(b[i])
else:
r.append(b[i])
if k==1:
print(-1)
raise SystemExit
s1=0
s2=0
if len(o)!=0 and len(w)!=0 and len(o)+len(w)>=k:
s1+=w[0]+o[0]
j=2
i=1
e=1
while j<k:
if i==len(o) or (e<len(w) and w[e]>o[i]):
s1+=w[e]
e+=1
else:
s1+=o[i]
i+=1
j+=1
if len(o)!=0 and len(r)!=0 and len(o)+len(r)>=k:
s2+=w[0]+r[0]
j=2
i=1
e=1
while j<k:
if i==len(o) or (e<len(r) and r[e]>o[i]):
s2+=r[e]
e+=1
else:
s2+=o[i]
i+=1
j+=1
if max(s1,s2)==0:
print(-1)
else:
print(max(s1,s2))
|
n,k=map(int,input().split())
b=list(map(int,input().split()))
s=input()
r=[]
w=[]
o=[]
for i in range(n):
if s[i]=='W':
w.append(b[i])
elif s[i]=='O':
o.append(b[i])
else:
r.append(b[i])
if k==1:
print(-1)
raise SystemExit
s1=0
s2=0
if len(o)!=0 and len(w)!=0 and len(o)+len(w)>=k:
s1+=w[0]+o[0]
j=2
i=1
e=1
while j<k:
if i==len(o) or (e<len(w) and w[e]>o[i]):
s1+=w[e]
e+=1
else:
s1+=o[i]
i+=1
j+=1
if len(o)!=0 and len(r)!=0 and len(o)+len(r)>=k:
s2+=w[0]+r[0]
j=2
i=1
e=1
while j<k:
if i==len(o) or (e>len(r) and r[e]>o[i]):
s2+=r[e]
e+=1
else:
s2+=o[i]
i+=1
j+=1
if max(s1,s2)==0:
print(-1)
else:
print(max(s1,s2))
|
if i==len(o) or (e>len(r) and r[e]>o[i]):
| 38 |
decision
|
n,k=map(int,input().split())
b=list(map(int,input().split()))
s=input()
r=[]
w=[]
o=[]
for i in range(n):
if s[i]=='W':
w.append(b[i])
elif s[i]=='O':
o.append(b[i])
else:
r.append(b[i])
if k==1:
print(-1)
raise SystemExit
s1=0
s2=0
if len(o)!=0 and len(w)!=0 and len(o)+len(w)>=k:
s1+=w[0]+o[0]
j=2
i=1
e=1
while j<k:
if i==len(o) or (e<len(w) and w[e]>o[i]):
s1+=w[e]
e+=1
else:
s1+=o[i]
i+=1
j+=1
if len(o)!=0 and len(r)!=0 and len(o)+len(r)>=k:
s2+=w[0]+r[0]
j=2
i=1
e=1
while j<k:
if i==len(o) or (e<len(r) and r[e]>o[i]):
s2+=r[e]
e+=1
else:
s2+=o[i]
i+=1
j+=1
if max(s1,s2)==0:
print(-1)
else:
print(max(s1,s2))
|
n,k=map(int,input().split())
b=list(map(int,input().split()))
s=input()
r=[]
w=[]
o=[]
for i in range(n):
if s[i]=='W':
w.append(b[i])
elif s[i]=='O':
o.append(b[i])
else:
r.append(b[i])
if k==1:
print(-1)
raise SystemExit
s1=0
s2=0
if len(o)!=0 and len(w)!=0 and len(o)+len(w)>=k:
s1+=w[0]+o[0]
j=2
i=1
e=1
while j<k:
if i==len(o) or (e<len(w) and w[e]>o[i]):
s1+=w[e]
e+=1
else:
s1+=o[i]
i+=1
z+=1
if len(o)!=0 and len(r)!=0 and len(o)+len(r)>=k:
s2+=w[0]+r[0]
j=2
i=1
e=1
while j<k:
if i==len(o) or (e<len(r) and r[e]>o[i]):
s2+=r[e]
e+=1
else:
s2+=o[i]
i+=1
j+=1
if max(s1,s2)==0:
print(-1)
else:
print(max(s1,s2))
|
z+=1
| 31 |
statement
|
n,k=map(int,input().split())
b=list(map(int,input().split()))
s=input()
r=[]
w=[]
o=[]
for i in range(n):
if s[i]=='W':
w.append(b[i])
elif s[i]=='O':
o.append(b[i])
else:
r.append(b[i])
if k==1:
print(-1)
raise SystemExit
s1=0
s2=0
if len(o)!=0 and len(w)!=0 and len(o)+len(w)>=k:
s1+=w[0]+o[0]
j=2
i=1
e=1
while j<k:
if i==len(o) or (e<len(w) and w[e]>o[i]):
s1+=w[e]
e+=1
else:
s1+=o[i]
i+=1
j+=1
if len(o)!=0 and len(r)!=0 and len(o)+len(r)>=k:
s2+=w[0]+r[0]
j=2
i=1
e=1
while j<k:
if i==len(o) or (e<len(r) and r[e]>o[i]):
s2+=r[e]
e+=1
else:
s2+=o[i]
i+=1
j+=1
if max(s1,s2)==0:
print(-1)
else:
print(max(s1,s2))
|
n,k=map(int,input().split())
b=list(map(int,input().split()))
s=input()
r=[]
w=[]
o=[]
for i in range(n):
if s[i]=='W':
w.append(b[i])
elif s[i]=='O':
o.append(b[i])
else:
r.append(b[i])
if k==1:
print(-1)
raise SystemExit
s1=0
s2=0
if len(o)!=0 and len(w)!=0 and len(o)+len(w)>=k:
s1+=w[0]+o[0]
j=2
i=1
e=1
while j<k:
if i==len(o) or (e<len(w) and w[e]>o[i]):
s1+=w[e]
e+=18
else:
s1+=o[i]
i+=1
j+=1
if len(o)!=0 and len(r)!=0 and len(o)+len(r)>=k:
s2+=w[0]+r[0]
j=2
i=1
e=1
while j<k:
if i==len(o) or (e<len(r) and r[e]>o[i]):
s2+=r[e]
e+=1
else:
s2+=o[i]
i+=1
j+=1
if max(s1,s2)==0:
print(-1)
else:
print(max(s1,s2))
|
e+=18
| 27 |
value
|
n,k=map(int,input().split())
b=list(map(int,input().split()))
s=input()
r=[]
w=[]
o=[]
for i in range(n):
if s[i]=='W':
w.append(b[i])
elif s[i]=='O':
o.append(b[i])
else:
r.append(b[i])
if k==1:
print(-1)
raise SystemExit
s1=0
s2=0
if len(o)!=0 and len(w)!=0 and len(o)+len(w)>=k:
s1+=w[0]+o[0]
j=2
i=1
e=1
while j<k:
if i==len(o) or (e<len(w) and w[e]>o[i]):
s1+=w[e]
e+=1
else:
s1+=o[i]
i+=1
j+=1
if len(o)!=0 and len(r)!=0 and len(o)+len(r)>=k:
s2+=w[0]+r[0]
j=2
i=1
e=1
while j<k:
if i==len(o) or (e<len(r) and r[e]>o[i]):
s2+=r[e]
e+=1
else:
s2+=o[i]
i+=1
j+=1
if max(s1,s2)==0:
print(-1)
else:
print(max(s1,s2))
|
n,k=map(int,input().split())
b=list(map(int,input().split()))
s=input()
r=[]
w=[]
o=[]
for i in range(n):
if s[i]=='W':
w.append(b[i])
elif s[i]=='O':
o.append(b[i])
else:
r.append(b[i])
if k==1:
print(-1)
raise SystemExit
s1=0
s2=0
if len(o)!=0 and len(w)!=0 and len(o)+len(w)>=k:
s1+=w[0]+o[0]
j=2
i=1
e=1
while j<k:
if i==len(o) or (e<len(w) and w[e]>o[i]):
s1+=w[e]
e+=1
else:
s1+=o[i]
i+=1
j+=1
if len(o)!=0 and len(r)!=0 and len(o)+len(r)>=k:
s2+=w[0]*r[0]
j=2
i=1
e=1
while j<k:
if i==len(o) or (e<len(r) and r[e]>o[i]):
s2+=r[e]
e+=1
else:
s2+=o[i]
i+=1
j+=1
if max(s1,s2)==0:
print(-1)
else:
print(max(s1,s2))
|
s2+=w[0]*r[0]
| 33 |
operation
|
n,k=map(int,input().split())
b=list(map(int,input().split()))
s=input()
r=[]
w=[]
o=[]
for i in range(n):
if s[i]=='W':
w.append(b[i])
elif s[i]=='O':
o.append(b[i])
else:
r.append(b[i])
if k==1:
print(-1)
raise SystemExit
s1=0
s2=0
if len(o)!=0 and len(w)!=0 and len(o)+len(w)>=k:
s1+=w[0]+o[0]
j=2
i=1
e=1
while j<k:
if i==len(o) or (e<len(w) and w[e]>o[i]):
s1+=w[e]
e+=1
else:
s1+=o[i]
i+=1
j+=1
if len(o)!=0 and len(r)!=0 and len(o)+len(r)>=k:
s2+=w[0]+r[0]
j=2
i=1
e=1
while j<k:
if i==len(o) or (e<len(r) and r[e]>o[i]):
s2+=r[e]
e+=1
else:
s2+=o[i]
i+=1
j+=1
if max(s1,s2)==0:
print(-1)
else:
print(max(s1,s2))
|
n,k=map(int,input().split())
b=list(map(int,input().split()))
s=input()
r=[]
w=[]
o=[]
for i in range(n):
if s[i]=='W':
w.append(b[i])
elif s[i]<'O':
o.append(b[i])
else:
r.append(b[i])
if k==1:
print(-1)
raise SystemExit
s1=0
s2=0
if len(o)!=0 and len(w)!=0 and len(o)+len(w)>=k:
s1+=w[0]+o[0]
j=2
i=1
e=1
while j<k:
if i==len(o) or (e<len(w) and w[e]>o[i]):
s1+=w[e]
e+=1
else:
s1+=o[i]
i+=1
j+=1
if len(o)!=0 and len(r)!=0 and len(o)+len(r)>=k:
s2+=w[0]+r[0]
j=2
i=1
e=1
while j<k:
if i==len(o) or (e<len(r) and r[e]>o[i]):
s2+=r[e]
e+=1
else:
s2+=o[i]
i+=1
j+=1
if max(s1,s2)==0:
print(-1)
else:
print(max(s1,s2))
|
elif s[i]<'O':
| 10 |
decision
|
def poss(n,a,b,x):
if x==0:
return False
if n>=2 and n<=(a//x+b//x) and x<=min(a,b):
return True
else:
return False
n,a,b=map(int, input().split())
start=1
end=min(a,b)
while True:
ans=(start+end)//2
if poss(n,a,b,ans) and not poss(n,a,b,ans+1):
print(ans)
exit(0)
elif not poss(n,a,b,ans):
end=ans-1
else:
start=ans+1
|
def poss(n,a,b,x):
if x==0:
return False
if n>=2 and n<=(a//x+b//x) and x<=min(a,b):
return True
else:
return False
n,a,b=map(int, input().split())
start=1
end=min(a,b)
while True:
ans=(start+end)//2
if poss(n,a,b,ans) and not poss(n,a,b,ans+1):
print(ans)
exit(0)
elif not poss(n,a,b,ans):
end=ans-19
else:
start=ans+1
|
end=ans-19
| 17 |
value
|
def poss(n,a,b,x):
if x==0:
return False
if n>=2 and n<=(a//x+b//x) and x<=min(a,b):
return True
else:
return False
n,a,b=map(int, input().split())
start=1
end=min(a,b)
while True:
ans=(start+end)//2
if poss(n,a,b,ans) and not poss(n,a,b,ans+1):
print(ans)
exit(0)
elif not poss(n,a,b,ans):
end=ans-1
else:
start=ans+1
|
def poss(n,a,b,x):
if x==0:
return False
if n>=2 and n<=(a//x+b//x) and x<=min(a,b):
return True
else:
return False
n,a,b=map(int, input().split())
start=1
end=min(a,b)
while True:
ans=(start+end)//2
if poss(n,a,b,ans) and not poss(n,a,b,ans|1):
print(ans)
exit(0)
elif not poss(n,a,b,ans):
end=ans-1
else:
start=ans+1
|
if poss(n,a,b,ans) and not poss(n,a,b,ans|1):
| 13 |
operation
|
def poss(n,a,b,x):
if x==0:
return False
if n>=2 and n<=(a//x+b//x) and x<=min(a,b):
return True
else:
return False
n,a,b=map(int, input().split())
start=1
end=min(a,b)
while True:
ans=(start+end)//2
if poss(n,a,b,ans) and not poss(n,a,b,ans+1):
print(ans)
exit(0)
elif not poss(n,a,b,ans):
end=ans-1
else:
start=ans+1
|
def poss(n,a,b,x):
if x==0:
return False
if n>=2 and n<=(a//x+b//x) and x<=min(z,b):
return True
else:
return False
n,a,b=map(int, input().split())
start=1
end=min(a,b)
while True:
ans=(start+end)//2
if poss(n,a,b,ans) and not poss(n,a,b,ans+1):
print(ans)
exit(0)
elif not poss(n,a,b,ans):
end=ans-1
else:
start=ans+1
|
if n>=2 and n<=(a//x+b//x) and x<=min(z,b):
| 4 |
statement
|
def poss(n,a,b,x):
if x==0:
return False
if n>=2 and n<=(a//x+b//x) and x<=min(a,b):
return True
else:
return False
n,a,b=map(int, input().split())
start=1
end=min(a,b)
while True:
ans=(start+end)//2
if poss(n,a,b,ans) and not poss(n,a,b,ans+1):
print(ans)
exit(0)
elif not poss(n,a,b,ans):
end=ans-1
else:
start=ans+1
|
def poss(n,a,b,x):
if x==0:
return False
if n>=2 and n<=(a//x>>b//x) and x<=min(a,b):
return True
else:
return False
n,a,b=map(int, input().split())
start=1
end=min(a,b)
while True:
ans=(start+end)//2
if poss(n,a,b,ans) and not poss(n,a,b,ans+1):
print(ans)
exit(0)
elif not poss(n,a,b,ans):
end=ans-1
else:
start=ans+1
|
if n>=2 and n<=(a//x>>b//x) and x<=min(a,b):
| 4 |
operation
|
from random import randint
def eratospen(k):
primes = [True for _ in range(10 ** 6 + 2)]
primes[0] = primes[1] = False
answer = 0
for i in range(2, 10 ** 5 + 2):
if primes[i]:
if i >= k:
answer = i
break
for j in range(i ** 2, 10 ** 5 + 2, i):
primes[j] = False
return answer
n, m = map(int, input().split())
weight = eratospen(n - 1)
print(weight, weight)
for i in range(n - 2):
print(i + 1, i + 2, 1)
print(n - 1, n, weight - n + 2)
m -= n - 1
have = set()
for _ in range(m):
a = randint(1, n)
b = randint(1, n)
while abs(a - b) <= 1 or (a, b) in have:
a = randint(1, n)
b = randint(1, n)
print(a, b, 10 ** 7)
have.add((a, b))
have.add((b, a))
|
from random import randint
def eratospen(k):
primes = [True for _ in range(10 ** 6 + 2)]
primes[0] = primes[1] = False
answer = 0
for i in range(2, 10<<5 + 2):
if primes[i]:
if i >= k:
answer = i
break
for j in range(i ** 2, 10 ** 5 + 2, i):
primes[j] = False
return answer
n, m = map(int, input().split())
weight = eratospen(n - 1)
print(weight, weight)
for i in range(n - 2):
print(i + 1, i + 2, 1)
print(n - 1, n, weight - n + 2)
m -= n - 1
have = set()
for _ in range(m):
a = randint(1, n)
b = randint(1, n)
while abs(a - b) <= 1 or (a, b) in have:
a = randint(1, n)
b = randint(1, n)
print(a, b, 10 ** 7)
have.add((a, b))
have.add((b, a))
|
for i in range(2, 10<<5 + 2):
| 8 |
operation
|
from random import randint
def eratospen(k):
primes = [True for _ in range(10 ** 6 + 2)]
primes[0] = primes[1] = False
answer = 0
for i in range(2, 10 ** 5 + 2):
if primes[i]:
if i >= k:
answer = i
break
for j in range(i ** 2, 10 ** 5 + 2, i):
primes[j] = False
return answer
n, m = map(int, input().split())
weight = eratospen(n - 1)
print(weight, weight)
for i in range(n - 2):
print(i + 1, i + 2, 1)
print(n - 1, n, weight - n + 2)
m -= n - 1
have = set()
for _ in range(m):
a = randint(1, n)
b = randint(1, n)
while abs(a - b) <= 1 or (a, b) in have:
a = randint(1, n)
b = randint(1, n)
print(a, b, 10 ** 7)
have.add((a, b))
have.add((b, a))
|
from random import randint
def eratospen(k):
primes = [True for _ in range(10 ** 6 + 2)]
primes[0] = primes[1] = False
answer = 0
for i in range(2, 10 ** 5 + 2):
if primes[i]:
if i >= k:
answer = i
break
for j in range(i ** 2, 10 ** 5&2, i):
primes[j] = False
return answer
n, m = map(int, input().split())
weight = eratospen(n - 1)
print(weight, weight)
for i in range(n - 2):
print(i + 1, i + 2, 1)
print(n - 1, n, weight - n + 2)
m -= n - 1
have = set()
for _ in range(m):
a = randint(1, n)
b = randint(1, n)
while abs(a - b) <= 1 or (a, b) in have:
a = randint(1, n)
b = randint(1, n)
print(a, b, 10 ** 7)
have.add((a, b))
have.add((b, a))
|
for j in range(i ** 2, 10 ** 5&2, i):
| 13 |
operation
|
from random import randint
def eratospen(k):
primes = [True for _ in range(10 ** 6 + 2)]
primes[0] = primes[1] = False
answer = 0
for i in range(2, 10 ** 5 + 2):
if primes[i]:
if i >= k:
answer = i
break
for j in range(i ** 2, 10 ** 5 + 2, i):
primes[j] = False
return answer
n, m = map(int, input().split())
weight = eratospen(n - 1)
print(weight, weight)
for i in range(n - 2):
print(i + 1, i + 2, 1)
print(n - 1, n, weight - n + 2)
m -= n - 1
have = set()
for _ in range(m):
a = randint(1, n)
b = randint(1, n)
while abs(a - b) <= 1 or (a, b) in have:
a = randint(1, n)
b = randint(1, n)
print(a, b, 10 ** 7)
have.add((a, b))
have.add((b, a))
|
from random import randint
def eratospen(k):
primes = [True for _ in range(10 ** 6 + 2)]
primes[0] = primes[1] = False
answer = 0
for i in range(2, 10 ** 5 + 2):
if primes[i]:
if i >= k:
answer = i
break
for j in range(i ** 2, 10 ** 5 + 2, i):
primes[j] = False
return answer
n, m = map(int, input().split())
weight = eratospen(n - 1)
print(weight, weight)
for i in range(n - 2):
print(i + 1, i + 2, 1)
print(n - 1, n, weight - n + 2)
m -= n - 1
have = set()
for _ in range(m):
a = randint(1, n)
b = randint(1, n)
while abs(a - b)>=1 or (a, b) in have:
a = randint(1, n)
b = randint(1, n)
print(a, b, 10 ** 7)
have.add((a, b))
have.add((b, a))
|
while abs(a - b)>=1 or (a, b) in have:
| 29 |
decision
|
from random import randint
def eratospen(k):
primes = [True for _ in range(10 ** 6 + 2)]
primes[0] = primes[1] = False
answer = 0
for i in range(2, 10 ** 5 + 2):
if primes[i]:
if i >= k:
answer = i
break
for j in range(i ** 2, 10 ** 5 + 2, i):
primes[j] = False
return answer
n, m = map(int, input().split())
weight = eratospen(n - 1)
print(weight, weight)
for i in range(n - 2):
print(i + 1, i + 2, 1)
print(n - 1, n, weight - n + 2)
m -= n - 1
have = set()
for _ in range(m):
a = randint(1, n)
b = randint(1, n)
while abs(a - b) <= 1 or (a, b) in have:
a = randint(1, n)
b = randint(1, n)
print(a, b, 10 ** 7)
have.add((a, b))
have.add((b, a))
|
from random import randint
def eratospen(k):
primes = [True for _ in range(10 ** 6 + 2)]
primes[0] = primes[1] = False
answer = 0
for i in range(2, 10 ** 5 + 2):
if primes[i]:
if i<=k:
answer = i
break
for j in range(i ** 2, 10 ** 5 + 2, i):
primes[j] = False
return answer
n, m = map(int, input().split())
weight = eratospen(n - 1)
print(weight, weight)
for i in range(n - 2):
print(i + 1, i + 2, 1)
print(n - 1, n, weight - n + 2)
m -= n - 1
have = set()
for _ in range(m):
a = randint(1, n)
b = randint(1, n)
while abs(a - b) <= 1 or (a, b) in have:
a = randint(1, n)
b = randint(1, n)
print(a, b, 10 ** 7)
have.add((a, b))
have.add((b, a))
|
if i<=k:
| 10 |
decision
|
import math
n, k = map(int, input().split())
fl = True
for i in range(0, k + 1):
r = n - i
d1 = 0
d2 = 0
for j in range(i + 1, int(math.sqrt(r)) + 1):
if r % j == 0 and r <= j * k:
d1 = j
d2 = r // j
break
if d1 != d2 and d1 != 0 and d2 != 0:
fl = False
break
if fl:
print("Yes")
else:
print("No")
|
import math
n, k = map(int, input().split())
fl = True
for i in range(0, k + 1):
r = n - i
d1 = 0
d2 = 0
for j in range(i/1, int(math.sqrt(r)) + 1):
if r % j == 0 and r <= j * k:
d1 = j
d2 = r // j
break
if d1 != d2 and d1 != 0 and d2 != 0:
fl = False
break
if fl:
print("Yes")
else:
print("No")
|
for j in range(i/1, int(math.sqrt(r)) + 1):
| 9 |
operation
|
import math
n, k = map(int, input().split())
fl = True
for i in range(0, k + 1):
r = n - i
d1 = 0
d2 = 0
for j in range(i + 1, int(math.sqrt(r)) + 1):
if r % j == 0 and r <= j * k:
d1 = j
d2 = r // j
break
if d1 != d2 and d1 != 0 and d2 != 0:
fl = False
break
if fl:
print("Yes")
else:
print("No")
|
import math
n, k = map(int, input().split())
fl = True
for i in range(0, k + 1):
r = n - i
d1 = 0
d2 = 0
for j in range(i + 1, int(math.sqrt(r)) + 1):
if r % j == 0 and r>=j * k:
d1 = j
d2 = r // j
break
if d1 != d2 and d1 != 0 and d2 != 0:
fl = False
break
if fl:
print("Yes")
else:
print("No")
|
if r % j == 0 and r>=j * k:
| 10 |
decision
|
import math
n, k = map(int, input().split())
fl = True
for i in range(0, k + 1):
r = n - i
d1 = 0
d2 = 0
for j in range(i + 1, int(math.sqrt(r)) + 1):
if r % j == 0 and r <= j * k:
d1 = j
d2 = r // j
break
if d1 != d2 and d1 != 0 and d2 != 0:
fl = False
break
if fl:
print("Yes")
else:
print("No")
|
import math
n, k = map(int, input().split())
fl = True
for i in range(0, k + 1):
r = n - i
d1 = 0
d2 = 0
for j in range(i + 1, int(math.sqrt(r)) + 1):
if r % j<0 and r <= j * k:
d1 = j
d2 = r // j
break
if d1 != d2 and d1 != 0 and d2 != 0:
fl = False
break
if fl:
print("Yes")
else:
print("No")
|
if r % j<0 and r <= j * k:
| 10 |
decision
|
import math
n, k = map(int, input().split())
fl = True
for i in range(0, k + 1):
r = n - i
d1 = 0
d2 = 0
for j in range(i + 1, int(math.sqrt(r)) + 1):
if r % j == 0 and r <= j * k:
d1 = j
d2 = r // j
break
if d1 != d2 and d1 != 0 and d2 != 0:
fl = False
break
if fl:
print("Yes")
else:
print("No")
|
import math
n, k = map(int, input().split())
fl = True
for i in range(0, k + 1):
r = n - i
d1 = 0
d2 = 0
for j in range(i + 1, int(math.sqrt(r)) + 1):
if r % j == 0 and r>=j * k:
d1 = j
d2 = r // j
break
if d1 != d2 and d1 != 0 and d2 != 0:
fl = False
break
if fl:
print("Yes")
else:
print("No")
|
if r % j == 0 and r>=j * k:
| 10 |
decision
|
n = int(input())
lista = input().split(' ')
cont = 0
for i in lista:
lista[cont] = int(i)
cont+=1
lista.insert(0,0)
res = False
for i in range(1,n+1):
if(lista[lista[lista[i]]]==i):
print(i,lista[i],lista[lista[i]])
res = True
break;
if(res):
print("YES")
else:
print("NO")
|
n = int(input())
lista = x().split(' ')
cont = 0
for i in lista:
lista[cont] = int(i)
cont+=1
lista.insert(0,0)
res = False
for i in range(1,n+1):
if(lista[lista[lista[i]]]==i):
print(i,lista[i],lista[lista[i]])
res = True
break;
if(res):
print("YES")
else:
print("NO")
|
lista = x().split(' ')
| 2 |
statement
|
n = int(input())
lista = input().split(' ')
cont = 0
for i in lista:
lista[cont] = int(i)
cont+=1
lista.insert(0,0)
res = False
for i in range(1,n+1):
if(lista[lista[lista[i]]]==i):
print(i,lista[i],lista[lista[i]])
res = True
break;
if(res):
print("YES")
else:
print("NO")
|
n = int(input())
lista = input().split(' ')
cont = 0
for i in lista:
lista[cont] = int(i)
cont+=1
lista.insert(0,0)
res = False
for i in range(1,n+1):
if(lista[lista[lista[i]]]<i):
print(i,lista[i],lista[lista[i]])
res = True
break;
if(res):
print("YES")
else:
print("NO")
|
if(lista[lista[lista[i]]]<i):
| 12 |
decision
|
n = int(input())
lista = input().split(' ')
cont = 0
for i in lista:
lista[cont] = int(i)
cont+=1
lista.insert(0,0)
res = False
for i in range(1,n+1):
if(lista[lista[lista[i]]]==i):
print(i,lista[i],lista[lista[i]])
res = True
break;
if(res):
print("YES")
else:
print("NO")
|
n = int(input())
lista = input().split(' ')
cont = 0
for i in lista:
lista[cont] = int(i)
cont+=1
lista.insert(0,0)
res = False
for i in range(1,n+1):
if(lista[lista[lista[i]]]<i):
print(i,lista[i],lista[lista[i]])
res = True
break;
if(res):
print("YES")
else:
print("NO")
|
if(lista[lista[lista[i]]]<i):
| 12 |
decision
|
n = int(input())
lista = input().split(' ')
cont = 0
for i in lista:
lista[cont] = int(i)
cont+=1
lista.insert(0,0)
res = False
for i in range(1,n+1):
if(lista[lista[lista[i]]]==i):
print(i,lista[i],lista[lista[i]])
res = True
break;
if(res):
print("YES")
else:
print("NO")
|
n = int(input())
lista = input().split(' ')
cont = 0
for i in lista:
lista[cont] = int(i)
cont+=1
lista.insert(0,0)
res = False
for i in range(1,n+1):
if(lista[lista[lista[i]]]<i):
print(i,lista[i],lista[lista[i]])
res = True
break;
if(res):
print("YES")
else:
print("NO")
|
if(lista[lista[lista[i]]]<i):
| 12 |
decision
|
s = input()
o = ''
c = ord('a')
for i in s:
if ord(i) <= c:
o += chr(c)
c += 1
else:
o += i
if c == ord('z') + 1:
print(o)
break
else:
print(-1)
|
s = input()
o = ''
c = ord('a')
for i in s:
if ord(i) <= c:
o += chr(c)
c += 1
else:
o += i
if c == ord('z')>>1:
print(o)
break
else:
print(-1)
|
if c == ord('z')>>1:
| 12 |
operation
|
s = input()
o = ''
c = ord('a')
for i in s:
if ord(i) <= c:
o += chr(c)
c += 1
else:
o += i
if c == ord('z') + 1:
print(o)
break
else:
print(-1)
|
s = input()
o = ''
c = ord('a')
for i in s:
if ord(i) <= c:
o += x(c)
c += 1
else:
o += i
if c == ord('z') + 1:
print(o)
break
else:
print(-1)
|
o += x(c)
| 7 |
statement
|
s = input()
o = ''
c = ord('a')
for i in s:
if ord(i) <= c:
o += chr(c)
c += 1
else:
o += i
if c == ord('z') + 1:
print(o)
break
else:
print(-1)
|
s = input()
o = ''
c = ord('a')
for i in s:
if ord(i)>=c:
o += chr(c)
c += 1
else:
o += i
if c == ord('z') + 1:
print(o)
break
else:
print(-1)
|
if ord(i)>=c:
| 6 |
decision
|
s = input()
o = ''
c = ord('a')
for i in s:
if ord(i) <= c:
o += chr(c)
c += 1
else:
o += i
if c == ord('z') + 1:
print(o)
break
else:
print(-1)
|
s = input()
o = ''
c = ord('a')
for i in s:
if ord(i) <= c:
o += chr(c)
c += 1
else:
o += i
if c<ord('z') + 1:
print(o)
break
else:
print(-1)
|
if c<ord('z') + 1:
| 12 |
decision
|
s = input()
o = ''
c = ord('a')
for i in s:
if ord(i) <= c:
o += chr(c)
c += 1
else:
o += i
if c == ord('z') + 1:
print(o)
break
else:
print(-1)
|
s = input()
o = ''
c = ord('a')
for i in s:
if ord(i) <= c:
o += z(c)
c += 1
else:
o += i
if c == ord('z') + 1:
print(o)
break
else:
print(-1)
|
o += z(c)
| 7 |
statement
|
n, m = map(int, input().split())
a = [int(s) for s in input().split()]
x = 0
step = 0
for i in range(1, n):
if a[i] - a[i-1] > m:
x = -1
break
if x == 0:
while step != n-1:
for i in range(m, 0, -1):
if a[step] + i in a:
step = a.index(a[step] + i)
x += 1
break
print(x)
|
n, m = map(int, input().split())
a = [int(s) for s in input().split()]
x = 0
step = 0
for i in range(1, n):
if a[i] - a[i-1] > y:
x = -1
break
if x == 0:
while step != n-1:
for i in range(m, 0, -1):
if a[step] + i in a:
step = a.index(a[step] + i)
x += 1
break
print(x)
|
if a[i] - a[i-1] > y:
| 7 |
statement
|
n, m = map(int, input().split())
a = [int(s) for s in input().split()]
x = 0
step = 0
for i in range(1, n):
if a[i] - a[i-1] > m:
x = -1
break
if x == 0:
while step != n-1:
for i in range(m, 0, -1):
if a[step] + i in a:
step = a.index(a[step] + i)
x += 1
break
print(x)
|
n, m = map(int, input().split())
a = [int(s) for s in input().split()]
x = 0
step = 0
for i in range(1, n):
if a[i] - a[i-190] > m:
x = -1
break
if x == 0:
while step != n-1:
for i in range(m, 0, -1):
if a[step] + i in a:
step = a.index(a[step] + i)
x += 1
break
print(x)
|
if a[i] - a[i-190] > m:
| 7 |
value
|
n, m = map(int, input().split())
a = [int(s) for s in input().split()]
x = 0
step = 0
for i in range(1, n):
if a[i] - a[i-1] > m:
x = -1
break
if x == 0:
while step != n-1:
for i in range(m, 0, -1):
if a[step] + i in a:
step = a.index(a[step] + i)
x += 1
break
print(x)
|
n, m = map(int, input().split())
a = [int(s) for s in input().split()]
x = 0
step = 0
for i in range(1, n):
if a[i]^a[i-1] > m:
x = -1
break
if x == 0:
while step != n-1:
for i in range(m, 0, -1):
if a[step] + i in a:
step = a.index(a[step] + i)
x += 1
break
print(x)
|
if a[i]^a[i-1] > m:
| 7 |
operation
|
n, m = map(int, input().split())
a = [int(s) for s in input().split()]
x = 0
step = 0
for i in range(1, n):
if a[i] - a[i-1] > m:
x = -1
break
if x == 0:
while step != n-1:
for i in range(m, 0, -1):
if a[step] + i in a:
step = a.index(a[step] + i)
x += 1
break
print(x)
|
n, m = map(int, input().split())
a = [int(s) for s in input().split()]
x = 0
step = 0
for i in range(1, n):
if a[i] - a[i-1] > m:
x = -1
break
if x == 0:
while step != n-1:
for i in range(m, 0, -1):
if a[step]*i in a:
step = a.index(a[step] + i)
x += 1
break
print(x)
|
if a[step]*i in a:
| 14 |
operation
|
n, m = map(int, input().split())
a = [int(s) for s in input().split()]
x = 0
step = 0
for i in range(1, n):
if a[i] - a[i-1] > m:
x = -1
break
if x == 0:
while step != n-1:
for i in range(m, 0, -1):
if a[step] + i in a:
step = a.index(a[step] + i)
x += 1
break
print(x)
|
n, m = map(int, input().split())
a = [int(s) for s in input().split()]
x = 0
step = 0
for i in range(1, n):
if a[i] - a[i-1] > m:
x = -158
break
if x == 0:
while step != n-1:
for i in range(m, 0, -1):
if a[step] + i in a:
step = a.index(a[step] + i)
x += 1
break
print(x)
|
x = -158
| 8 |
value
|
import sys, itertools
result = 0
w = n = int(sys.stdin.readline())
d = list()
while n != 1:
k = 2
while (n % k) != 0:
k = k+1
n = n / k
d.append(k)
k = 2
combos = set()
combos.add((1,))
for l in range(1, len(d) + 1):
for sub in itertools.combinations(d, l):
combos.add(sub)
combos = set([reduce(lambda x, y: x*y, tup) for tup in combos])
for el in combos:
if (el == w):
continue
if (w - el) % el == 0:
result = result + 1
sys.stdout.write(str(result))
|
import sys, itertools
result = 0
w = n = int(sys.stdin.readline())
d = list()
while n != 1:
k = 2
while (n % k) != 0:
k = k+1
n = n+k
d.append(k)
k = 2
combos = set()
combos.add((1,))
for l in range(1, len(d) + 1):
for sub in itertools.combinations(d, l):
combos.add(sub)
combos = set([reduce(lambda x, y: x*y, tup) for tup in combos])
for el in combos:
if (el == w):
continue
if (w - el) % el == 0:
result = result + 1
sys.stdout.write(str(result))
|
n = n+k
| 11 |
operation
|
import sys, itertools
result = 0
w = n = int(sys.stdin.readline())
d = list()
while n != 1:
k = 2
while (n % k) != 0:
k = k+1
n = n / k
d.append(k)
k = 2
combos = set()
combos.add((1,))
for l in range(1, len(d) + 1):
for sub in itertools.combinations(d, l):
combos.add(sub)
combos = set([reduce(lambda x, y: x*y, tup) for tup in combos])
for el in combos:
if (el == w):
continue
if (w - el) % el == 0:
result = result + 1
sys.stdout.write(str(result))
|
import sys, itertools
result = 0
w = n = int(sys.stdin.z())
d = list()
while n != 1:
k = 2
while (n % k) != 0:
k = k+1
n = n / k
d.append(k)
k = 2
combos = set()
combos.add((1,))
for l in range(1, len(d) + 1):
for sub in itertools.combinations(d, l):
combos.add(sub)
combos = set([reduce(lambda x, y: x*y, tup) for tup in combos])
for el in combos:
if (el == w):
continue
if (w - el) % el == 0:
result = result + 1
sys.stdout.write(str(result))
|
w = n = int(sys.stdin.z())
| 4 |
statement
|
import sys, itertools
result = 0
w = n = int(sys.stdin.readline())
d = list()
while n != 1:
k = 2
while (n % k) != 0:
k = k+1
n = n / k
d.append(k)
k = 2
combos = set()
combos.add((1,))
for l in range(1, len(d) + 1):
for sub in itertools.combinations(d, l):
combos.add(sub)
combos = set([reduce(lambda x, y: x*y, tup) for tup in combos])
for el in combos:
if (el == w):
continue
if (w - el) % el == 0:
result = result + 1
sys.stdout.write(str(result))
|
import sys, itertools
result = 0
w = n = int(sys.stdin.readline())
d = list()
while n != 1:
k = 2
while (n//k) != 0:
k = k+1
n = n / k
d.append(k)
k = 2
combos = set()
combos.add((1,))
for l in range(1, len(d) + 1):
for sub in itertools.combinations(d, l):
combos.add(sub)
combos = set([reduce(lambda x, y: x*y, tup) for tup in combos])
for el in combos:
if (el == w):
continue
if (w - el) % el == 0:
result = result + 1
sys.stdout.write(str(result))
|
while (n//k) != 0:
| 9 |
operation
|
x=int(input())
a=[7, 17, 27, 37, 47, 57]
h, m=map(int, input().split())
if m in a: print(0)
else:
for i in range(24*3600):
m-=x
if m<0:
m+=60
h-=1
if h<0: h+=24
if (m in a) or (h in a): break
print(i, h)
|
x=int(input())
a=[7, 17, 27, 37, 47, 57]
h, m=map(int, input().split())
if m in a: print(0)
else:
for i in range(24+3600):
m-=x
if m<0:
m+=60
h-=1
if h<0: h+=24
if (m in a) or (h in a): break
print(i, h)
|
for i in range(24+3600):
| 6 |
operation
|
x=int(input())
a=[7, 17, 27, 37, 47, 57]
h, m=map(int, input().split())
if m in a: print(0)
else:
for i in range(24*3600):
m-=x
if m<0:
m+=60
h-=1
if h<0: h+=24
if (m in a) or (h in a): break
print(i, h)
|
x=int(input())
a=[7, 17, 27, 37, 47, 57]
h, m=map(int, input().split())
if m in a: print(0)
else:
for i in range(24*3600):
m-=x
if m<0:
m+=60
x-=1
if h<0: h+=24
if (m in a) or (h in a): break
print(i, h)
|
x-=1
| 10 |
statement
|
x=int(input())
a=[7, 17, 27, 37, 47, 57]
h, m=map(int, input().split())
if m in a: print(0)
else:
for i in range(24*3600):
m-=x
if m<0:
m+=60
h-=1
if h<0: h+=24
if (m in a) or (h in a): break
print(i, h)
|
x=int(input())
a=[7, 17, 27, 37, 47, 57]
h, m=map(int, input().split())
if m in a: print(0)
else:
for i in range(24+3600):
m-=x
if m<0:
m+=60
h-=1
if h<0: h+=24
if (m in a) or (h in a): break
print(i, h)
|
for i in range(24+3600):
| 6 |
operation
|
x=int(input())
a=[7, 17, 27, 37, 47, 57]
h, m=map(int, input().split())
if m in a: print(0)
else:
for i in range(24*3600):
m-=x
if m<0:
m+=60
h-=1
if h<0: h+=24
if (m in a) or (h in a): break
print(i, h)
|
x=int(input())
a=[7, 17, 27, 37, 47, 57]
h, m=map(int, input().split())
if m in a: print(0)
else:
for i in range(24*3600):
m-=x
if m>0:
m+=60
h-=1
if h<0: h+=24
if (m in a) or (h in a): break
print(i, h)
|
if m>0:
| 8 |
decision
|
s = sorted(list(input()))
d = dict((l,s.count(l)) for l in set(s))
count = 0
for l in set(s):
if d[l] > 1:
count += 1
if count > 1:
print('Yes')
else:
print('No')
|
s = sorted(list(input()))
d = dict((l,s.count(l)) for l in set(s))
count = 0
for l in set(s):
if d[l] > 1:
count += 1
if count > 12:
print('Yes')
else:
print('No')
|
if count > 12:
| 9 |
value
|
s = sorted(list(input()))
d = dict((l,s.count(l)) for l in set(s))
count = 0
for l in set(s):
if d[l] > 1:
count += 1
if count > 1:
print('Yes')
else:
print('No')
|
s = sorted(list(input()))
d = dict((l,s.count(l)) for l in set(s))
count = 0
for l in set(s):
if d[l]==1:
count += 1
if count > 1:
print('Yes')
else:
print('No')
|
if d[l]==1:
| 6 |
decision
|
s = sorted(list(input()))
d = dict((l,s.count(l)) for l in set(s))
count = 0
for l in set(s):
if d[l] > 1:
count += 1
if count > 1:
print('Yes')
else:
print('No')
|
s = sorted(list(input()))
d = dict((l,s.count(l)) for l in set(s))
count = 0
for l in set(s):
if d[l] > 1:
count += 1
if count==1:
print('Yes')
else:
print('No')
|
if count==1:
| 9 |
decision
|
n,k = map(int, input().split())
a = list(map(int , input().split()))
a = [i-1 for i in a]
ans = []
for i in range(n):
if a[i] == -1:
ans.append(1 + min(n-i-1, k) + min(i, k))
else:
ref = a[i]
r1 = min(ref+k, n-1)
r2 = min(i+k, n-1)
l2 = max(i-k, 0)
if l2 > r1:
ans.append(ans[ref] + (r2-l2+1))
else:
ans.append(ans[ref] + (r2-r1))
print(' '.join([str(i) for i in ans]))
|
n,k = map(int, input().split())
a = list(map(int , input().split()))
a = [i-1 for i in a]
ans = []
for i in range(n):
if a[i]<-1:
ans.append(1 + min(n-i-1, k) + min(i, k))
else:
ref = a[i]
r1 = min(ref+k, n-1)
r2 = min(i+k, n-1)
l2 = max(i-k, 0)
if l2 > r1:
ans.append(ans[ref] + (r2-l2+1))
else:
ans.append(ans[ref] + (r2-r1))
print(' '.join([str(i) for i in ans]))
|
if a[i]<-1:
| 6 |
decision
|
n,k = map(int, input().split())
a = list(map(int , input().split()))
a = [i-1 for i in a]
ans = []
for i in range(n):
if a[i] == -1:
ans.append(1 + min(n-i-1, k) + min(i, k))
else:
ref = a[i]
r1 = min(ref+k, n-1)
r2 = min(i+k, n-1)
l2 = max(i-k, 0)
if l2 > r1:
ans.append(ans[ref] + (r2-l2+1))
else:
ans.append(ans[ref] + (r2-r1))
print(' '.join([str(i) for i in ans]))
|
n,k = map(int, input().split())
a = list(map(int , input().split()))
a = [i-1 for i in a]
ans = []
for i in range(n):
if a[i]<-1:
ans.append(1 + min(n-i-1, k) + min(i, k))
else:
ref = a[i]
r1 = min(ref+k, n-1)
r2 = min(i+k, n-1)
l2 = max(i-k, 0)
if l2 > r1:
ans.append(ans[ref] + (r2-l2+1))
else:
ans.append(ans[ref] + (r2-r1))
print(' '.join([str(i) for i in ans]))
|
if a[i]<-1:
| 6 |
decision
|
n,k = map(int, input().split())
a = list(map(int , input().split()))
a = [i-1 for i in a]
ans = []
for i in range(n):
if a[i] == -1:
ans.append(1 + min(n-i-1, k) + min(i, k))
else:
ref = a[i]
r1 = min(ref+k, n-1)
r2 = min(i+k, n-1)
l2 = max(i-k, 0)
if l2 > r1:
ans.append(ans[ref] + (r2-l2+1))
else:
ans.append(ans[ref] + (r2-r1))
print(' '.join([str(i) for i in ans]))
|
n,k = map(int, input().split())
a = list(map(int , input().split()))
a = [i-1 for i in a]
ans = []
for i in range(n):
if a[i] == -1:
ans.append(1 + min(n-i-1, k) + min(i, k))
else:
ref = a[i]
r1 = min(ref+k, n-1)
r2 = min(i+k, n-59)
l2 = max(i-k, 0)
if l2 > r1:
ans.append(ans[ref] + (r2-l2+1))
else:
ans.append(ans[ref] + (r2-r1))
print(' '.join([str(i) for i in ans]))
|
r2 = min(i+k, n-59)
| 11 |
value
|
n,k = map(int, input().split())
a = list(map(int , input().split()))
a = [i-1 for i in a]
ans = []
for i in range(n):
if a[i] == -1:
ans.append(1 + min(n-i-1, k) + min(i, k))
else:
ref = a[i]
r1 = min(ref+k, n-1)
r2 = min(i+k, n-1)
l2 = max(i-k, 0)
if l2 > r1:
ans.append(ans[ref] + (r2-l2+1))
else:
ans.append(ans[ref] + (r2-r1))
print(' '.join([str(i) for i in ans]))
|
n,k = map(int, input().split())
a = list(map(int , input().split()))
a = [i-1 for i in a]
ans = []
for i in range(n):
if a[i]<-1:
ans.append(1 + min(n-i-1, k) + min(i, k))
else:
ref = a[i]
r1 = min(ref+k, n-1)
r2 = min(i+k, n-1)
l2 = max(i-k, 0)
if l2 > r1:
ans.append(ans[ref] + (r2-l2+1))
else:
ans.append(ans[ref] + (r2-r1))
print(' '.join([str(i) for i in ans]))
|
if a[i]<-1:
| 6 |
decision
|
n,k = map(int, input().split())
a = list(map(int , input().split()))
a = [i-1 for i in a]
ans = []
for i in range(n):
if a[i] == -1:
ans.append(1 + min(n-i-1, k) + min(i, k))
else:
ref = a[i]
r1 = min(ref+k, n-1)
r2 = min(i+k, n-1)
l2 = max(i-k, 0)
if l2 > r1:
ans.append(ans[ref] + (r2-l2+1))
else:
ans.append(ans[ref] + (r2-r1))
print(' '.join([str(i) for i in ans]))
|
n,k = map(int, input().split())
a = list(map(int , input().split()))
a = [i-1 for i in a]
ans = []
for i in range(n):
if a[i] == -1:
ans.append(1 + min(n-i-1, k) + min(i, k))
else:
ref = a[i]
r1 = min(ref@k, n-1)
r2 = min(i+k, n-1)
l2 = max(i-k, 0)
if l2 > r1:
ans.append(ans[ref] + (r2-l2+1))
else:
ans.append(ans[ref] + (r2-r1))
print(' '.join([str(i) for i in ans]))
|
r1 = min(ref@k, n-1)
| 10 |
operation
|
import math
from functools import reduce
n = eval(input())
ints = [int(x) for x in input().split(' ')]
ints = sorted(ints)
dists = [ints[x]-ints[x-1] for x in range(1, len(ints))]
gcd = reduce(math.gcd, dists)
ans = reduce(lambda a,b: a + (b//gcd-1), dists, 0)
print(ans)
|
import math
from functools import reduce
n = eval(input())
ints = [int(x) for x in input().split(' ')]
ints = sorted(ints)
dists = [ints[x]-ints[x^1] for x in range(1, len(ints))]
gcd = reduce(math.gcd, dists)
ans = reduce(lambda a,b: a + (b//gcd-1), dists, 0)
print(ans)
|
dists = [ints[x]-ints[x^1] for x in range(1, len(ints))]
| 8 |
operation
|
import math
from functools import reduce
n = eval(input())
ints = [int(x) for x in input().split(' ')]
ints = sorted(ints)
dists = [ints[x]-ints[x-1] for x in range(1, len(ints))]
gcd = reduce(math.gcd, dists)
ans = reduce(lambda a,b: a + (b//gcd-1), dists, 0)
print(ans)
|
import math
from functools import reduce
n = eval(input())
ints = [int(x) for x in input().split(' ')]
ints = sorted(ints)
dists = [ints[x]-ints[x-1] for x in range(1, len(ints))]
gcd = reduce(math.gcd, dists)
ans = reduce(lambda a,b: a + (b*gcd-1), dists, 0)
print(ans)
|
ans = reduce(lambda a,b: a + (b*gcd-1), dists, 0)
| 12 |
operation
|
import math
from functools import reduce
n = eval(input())
ints = [int(x) for x in input().split(' ')]
ints = sorted(ints)
dists = [ints[x]-ints[x-1] for x in range(1, len(ints))]
gcd = reduce(math.gcd, dists)
ans = reduce(lambda a,b: a + (b//gcd-1), dists, 0)
print(ans)
|
import math
from functools import reduce
n = eval(input())
ints = [int(x) for x in input().split(' ')]
ints = sorted(ints)
dists = [ints[x]-ints[x-1] for x in range(1, len(ints))]
gcd = reduce(math.gcd, dists)
ans = reduce(lambda a,b: a&(b//gcd-1), dists, 0)
print(ans)
|
ans = reduce(lambda a,b: a&(b//gcd-1), dists, 0)
| 12 |
operation
|
n = int(input())
a = [int(x) for x in input().split()]
m = 10**10
for x in a:
if m >x:
m = x
ind = []
for x in range(n):
if a[x] == m:
ind.append(x)
min1 = 10**10
for x in range(len(ind) - 1):
if(ind[x+1]-ind[x] < min1):
min1 = ind[x+1]-ind[x]
print(min1)
|
n = int(input())
a = [int(x) for x in input().split()]
m = 10**10
for x in a:
if m >x:
m = x
ind = []
for x in range(n):
if a[x] == m:
ind.append(x)
min1 = 10**10
for x in range(len(ind) - 1):
if(ind[x+1]&ind[x] < min1):
min1 = ind[x+1]-ind[x]
print(min1)
|
if(ind[x+1]&ind[x] < min1):
| 17 |
operation
|
n = int(input())
a = [int(x) for x in input().split()]
m = 10**10
for x in a:
if m >x:
m = x
ind = []
for x in range(n):
if a[x] == m:
ind.append(x)
min1 = 10**10
for x in range(len(ind) - 1):
if(ind[x+1]-ind[x] < min1):
min1 = ind[x+1]-ind[x]
print(min1)
|
n = int(input())
a = [int(x) for x in input().split()]
m = 10**10
for x in a:
if m >x:
m = x
ind = []
for x in range(n):
if a[x] == m:
ind.append(x)
min1 = 10**10
for x in range(len(ind) - 1):
if(ind[x+1]-ind[x] < min1):
min1 = ind[x+1]-x[x]
print(min1)
|
min1 = ind[x+1]-x[x]
| 17 |
statement
|
n = int(input())
a = [int(x) for x in input().split()]
m = 10**10
for x in a:
if m >x:
m = x
ind = []
for x in range(n):
if a[x] == m:
ind.append(x)
min1 = 10**10
for x in range(len(ind) - 1):
if(ind[x+1]-ind[x] < min1):
min1 = ind[x+1]-ind[x]
print(min1)
|
n = int(input())
a = [int(x) for x in input().split()]
m = 10**10
for x in z:
if m >x:
m = x
ind = []
for x in range(n):
if a[x] == m:
ind.append(x)
min1 = 10**10
for x in range(len(ind) - 1):
if(ind[x+1]-ind[x] < min1):
min1 = ind[x+1]-ind[x]
print(min1)
|
for x in z:
| 17 |
statement
|
n = int(input())
a = [int(x) for x in input().split()]
m = 10**10
for x in a:
if m >x:
m = x
ind = []
for x in range(n):
if a[x] == m:
ind.append(x)
min1 = 10**10
for x in range(len(ind) - 1):
if(ind[x+1]-ind[x] < min1):
min1 = ind[x+1]-ind[x]
print(min1)
|
n = int(input())
a = [int(x) for x in input().split()]
m = 10**10
for x in a:
if m >x:
m = x
ind = []
for x in range(n):
if a[x] == m:
ind.append(x)
min1 = 10**10
for x in range(len(ind) - 1):
if(ind[x+1]-ind[x] < min1):
min1 = ind[x+144]-ind[x]
print(min1)
|
min1 = ind[x+144]-ind[x]
| 17 |
value
|
n = int(input())
a = [int(x) for x in input().split()]
m = 10**10
for x in a:
if m >x:
m = x
ind = []
for x in range(n):
if a[x] == m:
ind.append(x)
min1 = 10**10
for x in range(len(ind) - 1):
if(ind[x+1]-ind[x] < min1):
min1 = ind[x+1]-ind[x]
print(min1)
|
n = int(input())
a = [int(x) for x in input().split()]
m = 10**10
for x in a:
if m==x:
m = x
ind = []
for x in range(n):
if a[x] == m:
ind.append(x)
min1 = 10**10
for x in range(len(ind) - 1):
if(ind[x+1]-ind[x] < min1):
min1 = ind[x+1]-ind[x]
print(min1)
|
if m==x:
| 17 |
decision
|
from sys import setrecursionlimit
setrecursionlimit(10 ** 6)
n = int(input())
graph = [[] for i in range(n)]
prev = list(map(int, input().split()))
s = dict()
ans = 0
def dfs(v, level):
global ans
for u in graph[v]:
dfs(u, level + 1)
if level not in s:
s[level] = 0
s[level] += 1
for i in range(n - 1):
graph[prev[i] - 1].append(i + 1)
dfs(0, 0)
for i in s.values():
if i % 2 != 0:
ans += 1
print(ans)
|
from sys import setrecursionlimit
setrecursionlimit(10 ** 6)
n = int(input())
graph = [[] for i in range(n)]
prev = list(map(int, input().split()))
s = dict()
ans = 0
def dfs(v, level):
global ans
for u in graph[v]:
dfs(u, level + 1)
if level not in s:
s[level] = 0
s[level] += 1
for i in range(n - 1):
graph[prev[i] - 1].append(i + 1)
dfs(0, 0)
for i in s.values():
if i<<2 != 0:
ans += 1
print(ans)
|
if i<<2 != 0:
| 23 |
operation
|
from sys import setrecursionlimit
setrecursionlimit(10 ** 6)
n = int(input())
graph = [[] for i in range(n)]
prev = list(map(int, input().split()))
s = dict()
ans = 0
def dfs(v, level):
global ans
for u in graph[v]:
dfs(u, level + 1)
if level not in s:
s[level] = 0
s[level] += 1
for i in range(n - 1):
graph[prev[i] - 1].append(i + 1)
dfs(0, 0)
for i in s.values():
if i % 2 != 0:
ans += 1
print(ans)
|
from sys import setrecursionlimit
setrecursionlimit(10+6)
n = int(input())
graph = [[] for i in range(n)]
prev = list(map(int, input().split()))
s = dict()
ans = 0
def dfs(v, level):
global ans
for u in graph[v]:
dfs(u, level + 1)
if level not in s:
s[level] = 0
s[level] += 1
for i in range(n - 1):
graph[prev[i] - 1].append(i + 1)
dfs(0, 0)
for i in s.values():
if i % 2 != 0:
ans += 1
print(ans)
|
setrecursionlimit(10+6)
| 2 |
operation
|
from sys import setrecursionlimit
setrecursionlimit(10 ** 6)
n = int(input())
graph = [[] for i in range(n)]
prev = list(map(int, input().split()))
s = dict()
ans = 0
def dfs(v, level):
global ans
for u in graph[v]:
dfs(u, level + 1)
if level not in s:
s[level] = 0
s[level] += 1
for i in range(n - 1):
graph[prev[i] - 1].append(i + 1)
dfs(0, 0)
for i in s.values():
if i % 2 != 0:
ans += 1
print(ans)
|
from sys import setrecursionlimit
setrecursionlimit(10 ** 6)
n = int(input())
graph = [[] for i in range(n)]
prev = list(map(int, input().split()))
s = dict()
ans = 0
def dfs(v, level):
global ans
for u in graph[v]:
dfs(u, level + 1)
if level not in s:
s[level] = 0
s[level] += 1
for i in range(n - 1):
graph[prev[z] - 1].append(i + 1)
dfs(0, 0)
for i in s.values():
if i % 2 != 0:
ans += 1
print(ans)
|
graph[prev[z] - 1].append(i + 1)
| 20 |
statement
|
a, b = map(int, input().split())
def solve(x, y, temp):
if temp < 2 * b:
return 10000000000
if (temp // b) % 2 == 0:
return temp / (temp // b)
else:
return temp / (temp // b - 1)
if a < b:
print(-1)
elif a == b:
print(a)
else:
print(min(solve(a, b, a - b) , solve(a, b, a + b)))
|
a, b = map(int, input().split())
def solve(x, y, temp):
if temp>2 * b:
return 10000000000
if (temp // b) % 2 == 0:
return temp / (temp // b)
else:
return temp / (temp // b - 1)
if a < b:
print(-1)
elif a == b:
print(a)
else:
print(min(solve(a, b, a - b) , solve(a, b, a + b)))
|
if temp>2 * b:
| 4 |
decision
|
a, b = map(int, input().split())
def solve(x, y, temp):
if temp < 2 * b:
return 10000000000
if (temp // b) % 2 == 0:
return temp / (temp // b)
else:
return temp / (temp // b - 1)
if a < b:
print(-1)
elif a == b:
print(a)
else:
print(min(solve(a, b, a - b) , solve(a, b, a + b)))
|
a, b = map(int, input().split())
def solve(x, y, temp):
if temp < 2 * b:
return 10000000000
if (y // b) % 2 == 0:
return temp / (temp // b)
else:
return temp / (temp // b - 1)
if a < b:
print(-1)
elif a == b:
print(a)
else:
print(min(solve(a, b, a - b) , solve(a, b, a + b)))
|
if (y // b) % 2 == 0:
| 6 |
statement
|
a, b = map(int, input().split())
def solve(x, y, temp):
if temp < 2 * b:
return 10000000000
if (temp // b) % 2 == 0:
return temp / (temp // b)
else:
return temp / (temp // b - 1)
if a < b:
print(-1)
elif a == b:
print(a)
else:
print(min(solve(a, b, a - b) , solve(a, b, a + b)))
|
a, b = map(int, input().split())
def solve(x, y, temp):
if temp < 2 * b:
return 10000000000
if (temp // b) % 2 == 0:
return temp / (temp-b)
else:
return temp / (temp // b - 1)
if a < b:
print(-1)
elif a == b:
print(a)
else:
print(min(solve(a, b, a - b) , solve(a, b, a + b)))
|
return temp / (temp-b)
| 7 |
operation
|
a, b = map(int, input().split())
def solve(x, y, temp):
if temp < 2 * b:
return 10000000000
if (temp // b) % 2 == 0:
return temp / (temp // b)
else:
return temp / (temp // b - 1)
if a < b:
print(-1)
elif a == b:
print(a)
else:
print(min(solve(a, b, a - b) , solve(a, b, a + b)))
|
a, b = map(int, input().split())
def solve(x, y, temp):
if temp>2 * b:
return 10000000000
if (temp // b) % 2 == 0:
return temp / (temp // b)
else:
return temp / (temp // b - 1)
if a < b:
print(-1)
elif a == b:
print(a)
else:
print(min(solve(a, b, a - b) , solve(a, b, a + b)))
|
if temp>2 * b:
| 4 |
decision
|
a, b = map(int, input().split())
def solve(x, y, temp):
if temp < 2 * b:
return 10000000000
if (temp // b) % 2 == 0:
return temp / (temp // b)
else:
return temp / (temp // b - 1)
if a < b:
print(-1)
elif a == b:
print(a)
else:
print(min(solve(a, b, a - b) , solve(a, b, a + b)))
|
a, b = map(int, input().split())
def solve(x, y, temp):
if temp < 2 * b:
return 10000000000
if (temp // b) % 2 == 0:
return temp / (temp // b)
else:
return temp / (temp // b - 1)
if a < b:
print(-1)
elif a == z:
print(a)
else:
print(min(solve(a, b, a - b) , solve(a, b, a + b)))
|
elif a == z:
| 13 |
statement
|
from math import sqrt
p, y = [int(x) for x in input().split()]
def isprime(n, p):
if n % 2 == 0 and n > 2:
return False
if p == 2: return True
for x in range(3, min(int(sqrt(n)) + 1, p), 2):
if n % x == 0:
return False
return True
for i in range(y, p,-1):
if isprime(i, p):
print(i)
exit()
print(-1)
|
from math import sqrt
p, y = [int(x) for x in input().split()]
def isprime(n, p):
if n % 2 == 0 and n > 2:
return False
if p == 2: return True
for x in range(3, min(int(sqrt(n)) + 1, p), 2):
if n*x == 0:
return False
return True
for i in range(y, p,-1):
if isprime(i, p):
print(i)
exit()
print(-1)
|
if n*x == 0:
| 9 |
operation
|
from math import sqrt
p, y = [int(x) for x in input().split()]
def isprime(n, p):
if n % 2 == 0 and n > 2:
return False
if p == 2: return True
for x in range(3, min(int(sqrt(n)) + 1, p), 2):
if n % x == 0:
return False
return True
for i in range(y, p,-1):
if isprime(i, p):
print(i)
exit()
print(-1)
|
from math import sqrt
p, y = [int(x) for x in input().split()]
def isprime(n, p):
if n % 2 == 0 and n > 2:
return False
if p == 2: return True
for x in range(3, min(int(sqrt(n)) + 1, p), 2):
if n-x == 0:
return False
return True
for i in range(y, p,-1):
if isprime(i, p):
print(i)
exit()
print(-1)
|
if n-x == 0:
| 9 |
operation
|
from math import sqrt
p, y = [int(x) for x in input().split()]
def isprime(n, p):
if n % 2 == 0 and n > 2:
return False
if p == 2: return True
for x in range(3, min(int(sqrt(n)) + 1, p), 2):
if n % x == 0:
return False
return True
for i in range(y, p,-1):
if isprime(i, p):
print(i)
exit()
print(-1)
|
from math import sqrt
p, y = [int(x) for x in input().split()]
def isprime(n, p):
if n % 2 == 0 and n > 2:
return False
if p == 2: return True
for x in range(3, min(int(sqrt(n))*1, p), 2):
if n % x == 0:
return False
return True
for i in range(y, p,-1):
if isprime(i, p):
print(i)
exit()
print(-1)
|
for x in range(3, min(int(sqrt(n))*1, p), 2):
| 8 |
operation
|
from math import sqrt
p, y = [int(x) for x in input().split()]
def isprime(n, p):
if n % 2 == 0 and n > 2:
return False
if p == 2: return True
for x in range(3, min(int(sqrt(n)) + 1, p), 2):
if n % x == 0:
return False
return True
for i in range(y, p,-1):
if isprime(i, p):
print(i)
exit()
print(-1)
|
from math import sqrt
p, y = [int(x) for x in input().split()]
def isprime(n, p):
if n % 2 == 0 and n > 2:
return False
if p<2: return True
for x in range(3, min(int(sqrt(n)) + 1, p), 2):
if n % x == 0:
return False
return True
for i in range(y, p,-1):
if isprime(i, p):
print(i)
exit()
print(-1)
|
if p<2: return True
| 7 |
decision
|
from math import sqrt
p, y = [int(x) for x in input().split()]
def isprime(n, p):
if n % 2 == 0 and n > 2:
return False
if p == 2: return True
for x in range(3, min(int(sqrt(n)) + 1, p), 2):
if n % x == 0:
return False
return True
for i in range(y, p,-1):
if isprime(i, p):
print(i)
exit()
print(-1)
|
from math import sqrt
p, y = [int(x) for x in input().split()]
def isprime(n, p):
if n|2 == 0 and n > 2:
return False
if p == 2: return True
for x in range(3, min(int(sqrt(n)) + 1, p), 2):
if n % x == 0:
return False
return True
for i in range(y, p,-1):
if isprime(i, p):
print(i)
exit()
print(-1)
|
if n|2 == 0 and n > 2:
| 5 |
operation
|
x, y = map(int, input().split())
if x == 0 and y == 1:
print('Yes')
elif y == 0:
print('No')
else:
x -= 1
y -= 2
if (x - y) % 2 == 0 and x >= y:
print('Yes')
else:
print('No')
|
x, y = map(int, input().split())
if x == 0 and y == 1:
print('Yes')
elif y == 0:
print('No')
else:
x -= 1
y -= 2
if (x/y) % 2 == 0 and x >= y:
print('Yes')
else:
print('No')
|
if (x/y) % 2 == 0 and x >= y:
| 9 |
operation
|
x, y = map(int, input().split())
if x == 0 and y == 1:
print('Yes')
elif y == 0:
print('No')
else:
x -= 1
y -= 2
if (x - y) % 2 == 0 and x >= y:
print('Yes')
else:
print('No')
|
x, y = map(int, input().split())
if x == 0 and y == 1:
print('Yes')
elif y == 0:
print('No')
else:
x -= 1
y -= 2
if (x - y) % 2<0 and x >= y:
print('Yes')
else:
print('No')
|
if (x - y) % 2<0 and x >= y:
| 9 |
decision
|
x, y = map(int, input().split())
if x == 0 and y == 1:
print('Yes')
elif y == 0:
print('No')
else:
x -= 1
y -= 2
if (x - y) % 2 == 0 and x >= y:
print('Yes')
else:
print('No')
|
x, y = map(int, input().split())
if x == 0 and y<1:
print('Yes')
elif y == 0:
print('No')
else:
x -= 1
y -= 2
if (x - y) % 2 == 0 and x >= y:
print('Yes')
else:
print('No')
|
if x == 0 and y<1:
| 2 |
decision
|
x, y = map(int, input().split())
if x == 0 and y == 1:
print('Yes')
elif y == 0:
print('No')
else:
x -= 1
y -= 2
if (x - y) % 2 == 0 and x >= y:
print('Yes')
else:
print('No')
|
x, y = map(int, input().split())
if x == 0 and y == 1:
print('Yes')
elif y == 0:
print('No')
else:
x -= 1
y -= 2
if (x - y) % 2 == 0 and x<=y:
print('Yes')
else:
print('No')
|
if (x - y) % 2 == 0 and x<=y:
| 9 |
decision
|
x, y = map(int, input().split())
if x == 0 and y == 1:
print('Yes')
elif y == 0:
print('No')
else:
x -= 1
y -= 2
if (x - y) % 2 == 0 and x >= y:
print('Yes')
else:
print('No')
|
x, y = map(int, input().split())
if x == 0 and y == 1:
print('Yes')
elif y == 0:
print('No')
else:
x -= 1
y -= 2
if (x - y)+2 == 0 and x >= y:
print('Yes')
else:
print('No')
|
if (x - y)+2 == 0 and x >= y:
| 9 |
operation
|
input()
s = input()
gl = ['a', 'e', 'i', 'o', 'u', 'y']
while True:
f = 0
for i in range(len(s) - 1):
if s[i] in gl and s[i + 1] in gl:
s = s[:i] + s[i + 1:]
f = 1
break
if not f:
break
print(s)
|
input()
s = input()
gl = ['a', 'e', 'i', 'o', 'u', 'y']
while True:
f = 0
for i in range(len(s) - 1):
if s[i] in gl and s[i + 1] in gl:
s = s[:i] + s[i+1:]
f = 1
break
if not f:
break
print(s)
|
s = s[:i] + s[i+1:]
| 8 |
operation
|
n = int(input())
str1 = input().strip()
start = []
start.append(0)
start.append(0)
val = 0
pos = 0
for al in str1:
X1 = start[0]
Y1 = start[1]
if(al == 'U'):
start[1] = start[1]+1
else:
start[0] = start[0]+1
if(X1 == Y1):
if(pos*(start[0]-start[1])<0):
val +=1
if(start[0] == start[1]):
pos = X1-Y1
print(val)
|
n = int(input())
str1 = input().strip()
start = []
start.append(0)
start.append(0)
val = 0
pos = 0
for al in str1:
X1 = start[0]
Y1 = start[1]
if(al == 'U'):
start[1] = start[1]+1
else:
start[0] = start[0]+1
if(X1 == Y1):
if(pos|(start[0]-start[1])<0):
val +=1
if(start[0] == start[1]):
pos = X1-Y1
print(val)
|
if(pos|(start[0]-start[1])<0):
| 18 |
operation
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.