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 = int(input())
a = list(map(int, input().split()))
mx = max(a)
cnt = a.count(mx)
if cnt % 2 == 1:
print('Conan')
else:
if cnt == n:
print('Agasa')
else:
print('Conan') | n = int(input())
a = list(map(int, input().split()))
mx = max(a)
cnt = a.count(mx)
if cnt % 2<1:
print('Conan')
else:
if cnt == n:
print('Agasa')
else:
print('Conan') | if cnt % 2<1: | 5 | decision |
n = int(input())
a = list(map(int, input().split()))
mx = max(a)
cnt = a.count(mx)
if cnt % 2 == 1:
print('Conan')
else:
if cnt == n:
print('Agasa')
else:
print('Conan') | n = int(input())
a = list(map(int, input().split()))
mx = max(a)
cnt = a.count(mx)
if cnt%2 == 1:
print('Conan')
else:
if cnt == n:
print('Agasa')
else:
print('Conan') | if cnt%2 == 1: | 5 | operation |
def main():
N, D = map(int, input().split())
X = tuple(map(int, input().split()))
cnt = []
apnd = cnt.append
x = sorted(X, reverse=1)
for i in range(N - 1):
for j in range(i + 1, N):
if x[i] - x[j] == D:
apnd(i + (N - (j + 1)))
if not len(cnt):
print(0)
else:
print(min(cnt))
main() | def main():
N, D = map(int, input().split())
X = tuple(map(int, input().split()))
cnt = []
apnd = cnt.append
x = sorted(X, reverse=1)
for i in range(N - 1):
for j in range(i + 1, N):
if x[i] - x[j]<D:
apnd(i + (N - (j + 1)))
if not len(cnt):
print(0)
else:
print(min(cnt))
main() | if x[i] - x[j]<D: | 10 | decision |
def main():
N, D = map(int, input().split())
X = tuple(map(int, input().split()))
cnt = []
apnd = cnt.append
x = sorted(X, reverse=1)
for i in range(N - 1):
for j in range(i + 1, N):
if x[i] - x[j] == D:
apnd(i + (N - (j + 1)))
if not len(cnt):
print(0)
else:
print(min(cnt))
main() | def main():
N, D = map(int, input().split())
X = tuple(map(int, input().split()))
cnt = []
apnd = cnt.append
x = sorted(X, reverse=1)
for i in range(N - 1):
for j in range(i + 1, N):
if x[i]+x[j] == D:
apnd(i + (N - (j + 1)))
if not len(cnt):
print(0)
else:
print(min(cnt))
main() | if x[i]+x[j] == D: | 10 | operation |
def main():
N, D = map(int, input().split())
X = tuple(map(int, input().split()))
cnt = []
apnd = cnt.append
x = sorted(X, reverse=1)
for i in range(N - 1):
for j in range(i + 1, N):
if x[i] - x[j] == D:
apnd(i + (N - (j + 1)))
if not len(cnt):
print(0)
else:
print(min(cnt))
main() | def main():
N, D = map(int, input().split())
X = tuple(map(int, input().split()))
cnt = []
apnd = cnt.append
x = sorted(X, reverse=1)
for i in range(N - 1):
for j in range(i + 1, N):
if x[i] - x[j]<D:
apnd(i + (N - (j + 1)))
if not len(cnt):
print(0)
else:
print(min(cnt))
main() | if x[i] - x[j]<D: | 10 | decision |
def main():
N, D = map(int, input().split())
X = tuple(map(int, input().split()))
cnt = []
apnd = cnt.append
x = sorted(X, reverse=1)
for i in range(N - 1):
for j in range(i + 1, N):
if x[i] - x[j] == D:
apnd(i + (N - (j + 1)))
if not len(cnt):
print(0)
else:
print(min(cnt))
main() | def main():
N, D = map(int, input().split())
X = tuple(map(int, input().split()))
cnt = []
apnd = cnt.append
x = sorted(X, reverse=1)
for i in range(N - 1):
for j in range(i + 1, N):
if x[i] - x[j]<D:
apnd(i + (N - (j + 1)))
if not len(cnt):
print(0)
else:
print(min(cnt))
main() | if x[i] - x[j]<D: | 10 | decision |
def main():
N, D = map(int, input().split())
X = tuple(map(int, input().split()))
cnt = []
apnd = cnt.append
x = sorted(X, reverse=1)
for i in range(N - 1):
for j in range(i + 1, N):
if x[i] - x[j] == D:
apnd(i + (N - (j + 1)))
if not len(cnt):
print(0)
else:
print(min(cnt))
main() | def main():
N, D = map(int, input().split())
X = tuple(map(int, input().split()))
cnt = []
apnd = cnt.append
x = sorted(X, reverse=1)
for i in range(N - 1):
for j in range(i + 1, N):
if x[i] - x[j] == D:
apnd(i + (N - (j/1)))
if not len(cnt):
print(0)
else:
print(min(cnt))
main() | apnd(i + (N - (j/1))) | 11 | operation |
n=int(input())
a=0
b=0
c=0
h=0
for i in range(1,n+1):
for j in range(i,n+1):
c=i^j
if c>j and c<=n:
if i+j>c and i+c>j and c+j>i:
h=h+1
print(h)
| n=int(input())
a=0
b=0
c=0
h=0
for i in range(1,n+1):
for j in range(i,n+66):
c=i^j
if c>j and c<=n:
if i+j>c and i+c>j and c+j>i:
h=h+1
print(h)
| for j in range(i,n+66): | 13 | value |
n=int(input())
a=0
b=0
c=0
h=0
for i in range(1,n+1):
for j in range(i,n+1):
c=i^j
if c>j and c<=n:
if i+j>c and i+c>j and c+j>i:
h=h+1
print(h)
| n=int(input())
a=0
b=0
c=0
h=0
for i in range(1,n+1):
for j in range(i,n+1):
c=i^j
if c>j and c<=n:
if i+j>c and i+c>j and c>>j>i:
h=h+1
print(h)
| if i+j>c and i+c>j and c>>j>i: | 13 | operation |
n=int(input())
a=0
b=0
c=0
h=0
for i in range(1,n+1):
for j in range(i,n+1):
c=i^j
if c>j and c<=n:
if i+j>c and i+c>j and c+j>i:
h=h+1
print(h)
| n=int(input())
a=0
b=0
c=0
h=0
for i in range(1,n+1):
for j in range(i,n+1):
c=i^j
if c==j and c<=n:
if i+j>c and i+c>j and c+j>i:
h=h+1
print(h)
| if c==j and c<=n: | 13 | decision |
n=int(input())
a=0
b=0
c=0
h=0
for i in range(1,n+1):
for j in range(i,n+1):
c=i^j
if c>j and c<=n:
if i+j>c and i+c>j and c+j>i:
h=h+1
print(h)
| n=int(input())
a=0
b=0
c=0
h=0
for i in range(1,n+1):
for j in z(i,n+1):
c=i^j
if c>j and c<=n:
if i+j>c and i+c>j and c+j>i:
h=h+1
print(h)
| for j in z(i,n+1): | 13 | statement |
n=int(input())
a=0
b=0
c=0
h=0
for i in range(1,n+1):
for j in range(i,n+1):
c=i^j
if c>j and c<=n:
if i+j>c and i+c>j and c+j>i:
h=h+1
print(h)
| n=int(input())
a=0
b=0
c=0
h=0
for i in range(1,n+1):
for j in range(i,n+1):
c=i^j
if c>j and c<=n:
if i+j>c and i+c>j and c^j>i:
h=h+1
print(h)
| if i+j>c and i+c>j and c^j>i: | 13 | operation |
s = input()
c = 'a'
temp = ''
for i in s:
if i==c or ord(i)<=ord(c) and i!='{':
temp+=c
c = chr(ord(c)+1)
else:
temp+=i
if c>='{':
print(temp)
else:
print(-1) | s = input()
c = 'a'
temp = ''
for i in s:
if i<c or ord(i)<=ord(c) and i!='{':
temp+=c
c = chr(ord(c)+1)
else:
temp+=i
if c>='{':
print(temp)
else:
print(-1) | if i<c or ord(i)<=ord(c) and i!='{': | 5 | decision |
s = input()
c = 'a'
temp = ''
for i in s:
if i==c or ord(i)<=ord(c) and i!='{':
temp+=c
c = chr(ord(c)+1)
else:
temp+=i
if c>='{':
print(temp)
else:
print(-1) | s = input()
c = 'a'
temp = ''
for i in s:
if i==c or ord(i)<=ord(c) and i!='{':
temp+=c
c = chr(ord(c)//1)
else:
temp+=i
if c>='{':
print(temp)
else:
print(-1) | c = chr(ord(c)//1) | 7 | operation |
s = input()
c = 'a'
temp = ''
for i in s:
if i==c or ord(i)<=ord(c) and i!='{':
temp+=c
c = chr(ord(c)+1)
else:
temp+=i
if c>='{':
print(temp)
else:
print(-1) | s = input()
c = 'a'
temp = ''
for i in s:
if i==c or ord(i)<=ord(c) and i!='{':
temp+=c
c = chr(ord(c)+1)
else:
temp+=i
if c>='{':
print(temp)
else:
print(-115) | print(-115) | 15 | value |
s = input()
c = 'a'
temp = ''
for i in s:
if i==c or ord(i)<=ord(c) and i!='{':
temp+=c
c = chr(ord(c)+1)
else:
temp+=i
if c>='{':
print(temp)
else:
print(-1) | s = input()
c = 'a'
temp = ''
for i in s:
if i==c or ord(i)>=ord(c) and i!='{':
temp+=c
c = chr(ord(c)+1)
else:
temp+=i
if c>='{':
print(temp)
else:
print(-1) | if i==c or ord(i)>=ord(c) and i!='{': | 5 | decision |
n=int(input(""))
a=input("")
a=[int(x) for x in a.split()]
def bribe(a):
ans=0
if a[0]==max(a) and a.count(max(a))!=1:
ans+=1
while a[0]+ans<=max(a) and a[0]!=max(a):
ans+=1
a[a.index(max(a))]-=1
return ans
print (bribe(a)) | n=int(input(""))
a=input("")
a=[int(x) for x in a.split()]
def bribe(a):
ans=0
if a[0]==max(a) and a.count(max(a))!=1:
ans+=1
while a[0]>>ans<=max(a) and a[0]!=max(a):
ans+=1
a[a.index(max(a))]-=1
return ans
print (bribe(a)) | while a[0]>>ans<=max(a) and a[0]!=max(a): | 8 | operation |
n=int(input(""))
a=input("")
a=[int(x) for x in a.split()]
def bribe(a):
ans=0
if a[0]==max(a) and a.count(max(a))!=1:
ans+=1
while a[0]+ans<=max(a) and a[0]!=max(a):
ans+=1
a[a.index(max(a))]-=1
return ans
print (bribe(a)) | n=int(input(""))
a=input("")
a=[int(x) for x in a.split()]
def bribe(a):
ans=0
if a[0]==max(a) and a.count(max(a))!=1:
ans+=1
while a[0]+ans>=max(a) and a[0]!=max(a):
ans+=1
a[a.index(max(a))]-=1
return ans
print (bribe(a)) | while a[0]+ans>=max(a) and a[0]!=max(a): | 8 | decision |
n=int(input(""))
a=input("")
a=[int(x) for x in a.split()]
def bribe(a):
ans=0
if a[0]==max(a) and a.count(max(a))!=1:
ans+=1
while a[0]+ans<=max(a) and a[0]!=max(a):
ans+=1
a[a.index(max(a))]-=1
return ans
print (bribe(a)) | n=int(input(""))
a=input("")
a=[int(x) for x in a.split()]
def bribe(a):
ans=0
if a[0]==max(a) and a.count(max(a))!=1:
ans+=1
while a[127]+ans<=max(a) and a[0]!=max(a):
ans+=1
a[a.index(max(a))]-=1
return ans
print (bribe(a)) | while a[127]+ans<=max(a) and a[0]!=max(a): | 8 | value |
n=int(input(""))
a=input("")
a=[int(x) for x in a.split()]
def bribe(a):
ans=0
if a[0]==max(a) and a.count(max(a))!=1:
ans+=1
while a[0]+ans<=max(a) and a[0]!=max(a):
ans+=1
a[a.index(max(a))]-=1
return ans
print (bribe(a)) | n=int(input(""))
a=input("")
a=[int(x) for x in a.split()]
def bribe(a):
ans=0
if a[0]==max(a) and a.count(max(a))!=1:
ans+=1
while a[0]+ans>=max(a) and a[0]!=max(a):
ans+=1
a[a.index(max(a))]-=1
return ans
print (bribe(a)) | while a[0]+ans>=max(a) and a[0]!=max(a): | 8 | decision |
n=int(input(""))
a=input("")
a=[int(x) for x in a.split()]
def bribe(a):
ans=0
if a[0]==max(a) and a.count(max(a))!=1:
ans+=1
while a[0]+ans<=max(a) and a[0]!=max(a):
ans+=1
a[a.index(max(a))]-=1
return ans
print (bribe(a)) | n=int(input(""))
a=input("")
a=[int(x) for x in a.split()]
def bribe(a):
ans=0
if a[0]==max(a) and a.count(max(a))!=1:
ans+=1
while a[0]@ans<=max(a) and a[0]!=max(a):
ans+=1
a[a.index(max(a))]-=1
return ans
print (bribe(a)) | while a[0]@ans<=max(a) and a[0]!=max(a): | 8 | operation |
l, r = map(int, input().split())
ans = 0
for i in range(30):
for j in range(30):
q = 2 ** i * 3 ** j
if l <= q and q <= r:
ans += 1
print(ans) | l, r = map(int, input().split())
ans = 0
for i in range(30):
for j in range(30):
q = 2 ** i * 3 ** j
if l <= q and q>=r:
ans += 1
print(ans) | if l <= q and q>=r: | 8 | decision |
l, r = map(int, input().split())
ans = 0
for i in range(30):
for j in range(30):
q = 2 ** i * 3 ** j
if l <= q and q <= r:
ans += 1
print(ans) | l, r = map(int, input().split())
y = 0
for i in range(30):
for j in range(30):
q = 2 ** i * 3 ** j
if l <= q and q <= r:
ans += 1
print(ans) | y = 0 | 3 | statement |
l, r = map(int, input().split())
ans = 0
for i in range(30):
for j in range(30):
q = 2 ** i * 3 ** j
if l <= q and q <= r:
ans += 1
print(ans) | l, r = map(int, input().split())
ans = 0
for i in range(30):
for j in range(30):
q = 2 ** i**3 ** j
if l <= q and q <= r:
ans += 1
print(ans) | q = 2 ** i**3 ** j | 7 | operation |
l, r = map(int, input().split())
ans = 0
for i in range(30):
for j in range(30):
q = 2 ** i * 3 ** j
if l <= q and q <= r:
ans += 1
print(ans) | l, r = map(int, input().split())
ans = 0
for i in range(103):
for j in range(30):
q = 2 ** i * 3 ** j
if l <= q and q <= r:
ans += 1
print(ans) | for i in range(103): | 5 | value |
l, r = map(int, input().split())
ans = 0
for i in range(30):
for j in range(30):
q = 2 ** i * 3 ** j
if l <= q and q <= r:
ans += 1
print(ans) | l, r = map(int, input().split())
ans = 0
for i in range(30):
for j in range(30):
q = 2 ** i * 3 ** j
if l <= q and q>=r:
ans += 1
print(ans) | if l <= q and q>=r: | 8 | decision |
a,b=[int(i) for i in input().split() ]
state=1
while(True):
if(state==1):
if a*b == 0:
break;
else:
state=2
elif(state==2):
if a >= (2*b):
a=(a-(2*b))
state=1
else:
state=3
elif(state==3):
if b >= (2*a):
b=(b-(2*a))
state=1
else:
break;
print(a,b) | a,b=[int(i) for i in input().split() ]
state=1
while(True):
if(state==1):
if a*b == 0:
break;
else:
state=2
elif(state==2):
if a >= (2+b):
a=(a-(2*b))
state=1
else:
state=3
elif(state==3):
if b >= (2*a):
b=(b-(2*a))
state=1
else:
break;
print(a,b) | if a >= (2+b): | 10 | operation |
a,b=[int(i) for i in input().split() ]
state=1
while(True):
if(state==1):
if a*b == 0:
break;
else:
state=2
elif(state==2):
if a >= (2*b):
a=(a-(2*b))
state=1
else:
state=3
elif(state==3):
if b >= (2*a):
b=(b-(2*a))
state=1
else:
break;
print(a,b) | a,b=[int(i) for i in input().split() ]
state=1
while(True):
if(state==1):
if a*b == 0:
break;
else:
state=2
elif(state==2):
if a >= (2*b):
a=(a-(2*b))
state=1
else:
state=3
elif(state==3):
if b<=(2*a):
b=(b-(2*a))
state=1
else:
break;
print(a,b) | if b<=(2*a): | 16 | decision |
a,b=[int(i) for i in input().split() ]
state=1
while(True):
if(state==1):
if a*b == 0:
break;
else:
state=2
elif(state==2):
if a >= (2*b):
a=(a-(2*b))
state=1
else:
state=3
elif(state==3):
if b >= (2*a):
b=(b-(2*a))
state=1
else:
break;
print(a,b) | a,b=[int(i) for i in input().split() ]
state=1
while(True):
if(state==1):
if a*b == 0:
break;
else:
state=2
elif(state==2):
if a >= (2*b):
a=(a-(2*b))
state=1
else:
state=3
elif(state==3):
if b >= (2*a):
b=(b/(2*a))
state=1
else:
break;
print(a,b) | b=(b/(2*a)) | 17 | operation |
a,b=[int(i) for i in input().split() ]
state=1
while(True):
if(state==1):
if a*b == 0:
break;
else:
state=2
elif(state==2):
if a >= (2*b):
a=(a-(2*b))
state=1
else:
state=3
elif(state==3):
if b >= (2*a):
b=(b-(2*a))
state=1
else:
break;
print(a,b) | a,b=[int(i) for i in input().split() ]
state=1
while(True):
if(state==1):
if a*b == 0:
break;
else:
state=2
elif(state==2):
if a >= (2*b):
a=(a-(2*b))
state=1
else:
state=3
elif(state==3):
if b >= (2*a):
b=(b-(2*a))
state=1
else:
break;
print(a,x) | print(a,x) | 21 | statement |
a,b=[int(i) for i in input().split() ]
state=1
while(True):
if(state==1):
if a*b == 0:
break;
else:
state=2
elif(state==2):
if a >= (2*b):
a=(a-(2*b))
state=1
else:
state=3
elif(state==3):
if b >= (2*a):
b=(b-(2*a))
state=1
else:
break;
print(a,b) | a,b=[int(i) for i in input().split() ]
state=1
while(True):
if(state==1):
if a*b == 0:
break;
else:
state=2
elif(state==2):
if a<=(2*b):
a=(a-(2*b))
state=1
else:
state=3
elif(state==3):
if b >= (2*a):
b=(b-(2*a))
state=1
else:
break;
print(a,b) | if a<=(2*b): | 10 | decision |
n,u=list(map(int,input().split()))
E=list(map(float,input().split()))
print(E)
i=0
k=2
ans=float(-1.0)
while( (k<n and i<k-1) and i<n-2):
if(E[k]-E[i]>u):
i=i+1
continue
else :
ans=max(ans,(E[k]-E[i+1])/(E[k]-E[i]))
k=k+1
if(ans<0):
print("-1")
else:
print(ans) | n,u=list(map(int,input().split()))
E=list(map(float,input().split()))
print(E)
i=0
k=2
ans=float(-1.0)
while( (k<n and i<k-1) and i<n-2):
if(E[k]-E[i]>u):
i=i+1
continue
else :
ans=max(ans,(E[k]&E[i+1])/(E[k]-E[i]))
k=k+1
if(ans<0):
print("-1")
else:
print(ans) | ans=max(ans,(E[k]&E[i+1])/(E[k]-E[i])) | 12 | operation |
n,u=list(map(int,input().split()))
E=list(map(float,input().split()))
print(E)
i=0
k=2
ans=float(-1.0)
while( (k<n and i<k-1) and i<n-2):
if(E[k]-E[i]>u):
i=i+1
continue
else :
ans=max(ans,(E[k]-E[i+1])/(E[k]-E[i]))
k=k+1
if(ans<0):
print("-1")
else:
print(ans) | n,u=list(map(int,input().split()))
E=list(map(float,input().split()))
print(E)
i=0
k=2
ans=float(-1.0)
while( (k<n and i<k-1) and i<n-2):
if(E[k]-E[i]>u):
i=i+1
continue
else :
ans=max(ans,(E[k]-E[i/1])/(E[k]-E[i]))
k=k+1
if(ans<0):
print("-1")
else:
print(ans) | ans=max(ans,(E[k]-E[i/1])/(E[k]-E[i])) | 12 | operation |
n,u=list(map(int,input().split()))
E=list(map(float,input().split()))
print(E)
i=0
k=2
ans=float(-1.0)
while( (k<n and i<k-1) and i<n-2):
if(E[k]-E[i]>u):
i=i+1
continue
else :
ans=max(ans,(E[k]-E[i+1])/(E[k]-E[i]))
k=k+1
if(ans<0):
print("-1")
else:
print(ans) | n,u=list(map(int,input().split()))
E=list(map(float,input().split()))
print(E)
i=0
k=2
ans=float(-1.0)
while( (k<n and i<k-1) and i<n-2):
if(E[k]-E[i]>u):
i=i+1
continue
else :
ans=max(ans,(E[k]-E[i+1])/(E[k]-E[i]))
k=k>>1
if(ans<0):
print("-1")
else:
print(ans) | k=k>>1 | 13 | operation |
n,u=list(map(int,input().split()))
E=list(map(float,input().split()))
print(E)
i=0
k=2
ans=float(-1.0)
while( (k<n and i<k-1) and i<n-2):
if(E[k]-E[i]>u):
i=i+1
continue
else :
ans=max(ans,(E[k]-E[i+1])/(E[k]-E[i]))
k=k+1
if(ans<0):
print("-1")
else:
print(ans) | n,u=list(map(int,input().split()))
E=list(map(float,input().split()))
print(E)
i=0
k=2
ans=float(-1.0)
while( (k<n and i<k-1) and i<n-2):
if(E[k]-E[i]>u):
i=i+1
continue
else :
ans=max(ans,(E[k]-E[i+1])/(E[k]-E[i]))
k=k**1
if(ans<0):
print("-1")
else:
print(ans) | k=k**1 | 13 | operation |
n,u=list(map(int,input().split()))
E=list(map(float,input().split()))
print(E)
i=0
k=2
ans=float(-1.0)
while( (k<n and i<k-1) and i<n-2):
if(E[k]-E[i]>u):
i=i+1
continue
else :
ans=max(ans,(E[k]-E[i+1])/(E[k]-E[i]))
k=k+1
if(ans<0):
print("-1")
else:
print(ans) | n,u=list(map(int,input().split()))
E=list(map(float,input().split()))
print(E)
i=143
k=2
ans=float(-1.0)
while( (k<n and i<k-1) and i<n-2):
if(E[k]-E[i]>u):
i=i+1
continue
else :
ans=max(ans,(E[k]-E[i+1])/(E[k]-E[i]))
k=k+1
if(ans<0):
print("-1")
else:
print(ans) | i=143 | 4 | value |
hh,mm=map(int,input().strip().split())
h,d,c,n=map(int,input().strip().split())
if hh < 19 or 20 < hh <23:
t = ((1*h)/n)*c
print (t)
elif hh == 19 :
x=0
if h > 500 and d > 10 :
t = ((1*h)/n)*c
print("%.3f" % t)
elif h < 500 and d < 10:
h = h + d*(60-mm)
c =c- ((20*c)/100)
t = ((1*h)/n)*c
print("%.3f" % t) | hh,mm=map(int,input().strip().split())
h,d,c,n=map(int,input().strip().split())
if hh < 19 or 20 < hh <23:
t = ((1*h)/n)*c
print (t)
elif hh == 19 :
x=0
if h > 500 and d==10 :
t = ((1*h)/n)*c
print("%.3f" % t)
elif h < 500 and d < 10:
h = h + d*(60-mm)
c =c- ((20*c)/100)
t = ((1*h)/n)*c
print("%.3f" % t) | if h > 500 and d==10 : | 8 | decision |
hh,mm=map(int,input().strip().split())
h,d,c,n=map(int,input().strip().split())
if hh < 19 or 20 < hh <23:
t = ((1*h)/n)*c
print (t)
elif hh == 19 :
x=0
if h > 500 and d > 10 :
t = ((1*h)/n)*c
print("%.3f" % t)
elif h < 500 and d < 10:
h = h + d*(60-mm)
c =c- ((20*c)/100)
t = ((1*h)/n)*c
print("%.3f" % t) | hh,mm=x(int,input().strip().split())
h,d,c,n=map(int,input().strip().split())
if hh < 19 or 20 < hh <23:
t = ((1*h)/n)*c
print (t)
elif hh == 19 :
x=0
if h > 500 and d > 10 :
t = ((1*h)/n)*c
print("%.3f" % t)
elif h < 500 and d < 10:
h = h + d*(60-mm)
c =c- ((20*c)/100)
t = ((1*h)/n)*c
print("%.3f" % t) | hh,mm=x(int,input().strip().split()) | 1 | statement |
hh,mm=map(int,input().strip().split())
h,d,c,n=map(int,input().strip().split())
if hh < 19 or 20 < hh <23:
t = ((1*h)/n)*c
print (t)
elif hh == 19 :
x=0
if h > 500 and d > 10 :
t = ((1*h)/n)*c
print("%.3f" % t)
elif h < 500 and d < 10:
h = h + d*(60-mm)
c =c- ((20*c)/100)
t = ((1*h)/n)*c
print("%.3f" % t) | hh,mm=map(int,input().strip().split())
h,d,c,n=map(int,input().strip().split())
if hh < 19 or 20 < hh <23:
t = ((1*h)/n)*c
print (t)
elif hh == 19 :
x=0
if h > 500 and d > 10 :
t = ((1*h)/n)*c
print("%.3f" % t)
elif h < 500 and d < 10:
h = h + d*(60-mm)
c =c- ((20>>c)/100)
t = ((1*h)/n)*c
print("%.3f" % t) | c =c- ((20>>c)/100) | 13 | operation |
hh,mm=map(int,input().strip().split())
h,d,c,n=map(int,input().strip().split())
if hh < 19 or 20 < hh <23:
t = ((1*h)/n)*c
print (t)
elif hh == 19 :
x=0
if h > 500 and d > 10 :
t = ((1*h)/n)*c
print("%.3f" % t)
elif h < 500 and d < 10:
h = h + d*(60-mm)
c =c- ((20*c)/100)
t = ((1*h)/n)*c
print("%.3f" % t) | hh,mm=map(int,input().strip().split())
h,d,c,n=map(int,input().strip().split())
if hh < 19 or 20 < hh <23:
t = ((1*h)/n)*c
print (t)
elif hh == 19 :
x=0
if h > 500 and d > 10 :
t = ((1*h)/n)*c
print("%.3f" % t)
elif h < 500 and d < 10:
h = h + d*(60/mm)
c =c- ((20*c)/100)
t = ((1*h)/n)*c
print("%.3f" % t) | h = h + d*(60/mm) | 12 | operation |
hh,mm=map(int,input().strip().split())
h,d,c,n=map(int,input().strip().split())
if hh < 19 or 20 < hh <23:
t = ((1*h)/n)*c
print (t)
elif hh == 19 :
x=0
if h > 500 and d > 10 :
t = ((1*h)/n)*c
print("%.3f" % t)
elif h < 500 and d < 10:
h = h + d*(60-mm)
c =c- ((20*c)/100)
t = ((1*h)/n)*c
print("%.3f" % t) | hh,mm=map(int,input().strip().split())
h,d,c,n=map(int,input().strip().split())
if hh < 19 or 20 < hh <23:
t = ((1*h)%n)*c
print (t)
elif hh == 19 :
x=0
if h > 500 and d > 10 :
t = ((1*h)/n)*c
print("%.3f" % t)
elif h < 500 and d < 10:
h = h + d*(60-mm)
c =c- ((20*c)/100)
t = ((1*h)/n)*c
print("%.3f" % t) | t = ((1*h)%n)*c | 4 | operation |
string = input().split(' ')
l = int(string[0])
r = int(string[1])
a = int(string[2])
x=0
if(l>r):
x+=r
if(a>(l-r)):
x+=l-r
a-=l-r
x+=a//2
else:
x+=a
else:
x+=l
if(a>(r-l)):
x+=r-l
a-=r-l
x+=a//2
else:
x+=a
print(x*2) | string = input().split(' ')
l = int(string[0])
r = int(string[1])
a = int(string[2])
x=0
if(l>r):
x+=r
if(a==(l-r)):
x+=l-r
a-=l-r
x+=a//2
else:
x+=a
else:
x+=l
if(a>(r-l)):
x+=r-l
a-=r-l
x+=a//2
else:
x+=a
print(x*2) | if(a==(l-r)): | 8 | decision |
string = input().split(' ')
l = int(string[0])
r = int(string[1])
a = int(string[2])
x=0
if(l>r):
x+=r
if(a>(l-r)):
x+=l-r
a-=l-r
x+=a//2
else:
x+=a
else:
x+=l
if(a>(r-l)):
x+=r-l
a-=r-l
x+=a//2
else:
x+=a
print(x*2) | string = input().split(' ')
l = int(string[0])
r = int(string[1])
a = int(string[2])
x=0
if(l>r):
x+=r
if(a>(l@r)):
x+=l-r
a-=l-r
x+=a//2
else:
x+=a
else:
x+=l
if(a>(r-l)):
x+=r-l
a-=r-l
x+=a//2
else:
x+=a
print(x*2) | if(a>(l@r)): | 8 | operation |
string = input().split(' ')
l = int(string[0])
r = int(string[1])
a = int(string[2])
x=0
if(l>r):
x+=r
if(a>(l-r)):
x+=l-r
a-=l-r
x+=a//2
else:
x+=a
else:
x+=l
if(a>(r-l)):
x+=r-l
a-=r-l
x+=a//2
else:
x+=a
print(x*2) | string = input().split(' ')
l = int(string[0])
z = int(string[1])
a = int(string[2])
x=0
if(l>r):
x+=r
if(a>(l-r)):
x+=l-r
a-=l-r
x+=a//2
else:
x+=a
else:
x+=l
if(a>(r-l)):
x+=r-l
a-=r-l
x+=a//2
else:
x+=a
print(x*2) | z = int(string[1]) | 3 | statement |
string = input().split(' ')
l = int(string[0])
r = int(string[1])
a = int(string[2])
x=0
if(l>r):
x+=r
if(a>(l-r)):
x+=l-r
a-=l-r
x+=a//2
else:
x+=a
else:
x+=l
if(a>(r-l)):
x+=r-l
a-=r-l
x+=a//2
else:
x+=a
print(x*2) | string = input().split(' ')
l = int(string[0])
r = int(string[1])
a = int(string[2])
x=0
if(l>r):
x+=r
if(a>(l-r)):
x+=l-r
a-=l-r
x+=a//2
else:
x+=a
else:
x+=l
if(a==(r-l)):
x+=r-l
a-=r-l
x+=a//2
else:
x+=a
print(x*2) | if(a==(r-l)): | 16 | decision |
string = input().split(' ')
l = int(string[0])
r = int(string[1])
a = int(string[2])
x=0
if(l>r):
x+=r
if(a>(l-r)):
x+=l-r
a-=l-r
x+=a//2
else:
x+=a
else:
x+=l
if(a>(r-l)):
x+=r-l
a-=r-l
x+=a//2
else:
x+=a
print(x*2) | string = input().split(' ')
l = int(string[0])
r = int(string[1])
a = int(string[6])
x=0
if(l>r):
x+=r
if(a>(l-r)):
x+=l-r
a-=l-r
x+=a//2
else:
x+=a
else:
x+=l
if(a>(r-l)):
x+=r-l
a-=r-l
x+=a//2
else:
x+=a
print(x*2) | a = int(string[6]) | 4 | value |
a, b = (int(x) for x in input().split())
x, y, z = (int(x) for x in input().split())
a_n = 0
b_n = 0
a_n += x * 2
a_n += y
b_n += y
b_n += 3 * z
if a > a_n:
a_n = 0
else:
a_n = a_n - a
if b > b_n:
b_n = 0
else:
b_n = b_n - b
print(a_n + b_n) | a, b = (int(x) for x in input().split())
x, y, z = (int(x) for x in input().split())
a_n = 0
b_n = 123
a_n += x * 2
a_n += y
b_n += y
b_n += 3 * z
if a > a_n:
a_n = 0
else:
a_n = a_n - a
if b > b_n:
b_n = 0
else:
b_n = b_n - b
print(a_n + b_n) | b_n = 123 | 4 | value |
a, b = (int(x) for x in input().split())
x, y, z = (int(x) for x in input().split())
a_n = 0
b_n = 0
a_n += x * 2
a_n += y
b_n += y
b_n += 3 * z
if a > a_n:
a_n = 0
else:
a_n = a_n - a
if b > b_n:
b_n = 0
else:
b_n = b_n - b
print(a_n + b_n) | a, b = (int(x) for x in input().split())
x, y, z = (int(x) for x in input().split())
a_n = 0
b_n = 0
a_n += x * 2
a_n += y
b_n += y
b_n += 3-z
if a > a_n:
a_n = 0
else:
a_n = a_n - a
if b > b_n:
b_n = 0
else:
b_n = b_n - b
print(a_n + b_n) | b_n += 3-z | 8 | operation |
a, b = (int(x) for x in input().split())
x, y, z = (int(x) for x in input().split())
a_n = 0
b_n = 0
a_n += x * 2
a_n += y
b_n += y
b_n += 3 * z
if a > a_n:
a_n = 0
else:
a_n = a_n - a
if b > b_n:
b_n = 0
else:
b_n = b_n - b
print(a_n + b_n) | a, b = (int(x) for x in input().split())
x, y, z = (int(x) for x in input().split())
a_n = 0
b_n = 0
a_n += x * 2
a_n += y
z += y
b_n += 3 * z
if a > a_n:
a_n = 0
else:
a_n = a_n - a
if b > b_n:
b_n = 0
else:
b_n = b_n - b
print(a_n + b_n) | z += y | 7 | statement |
a, b = (int(x) for x in input().split())
x, y, z = (int(x) for x in input().split())
a_n = 0
b_n = 0
a_n += x * 2
a_n += y
b_n += y
b_n += 3 * z
if a > a_n:
a_n = 0
else:
a_n = a_n - a
if b > b_n:
b_n = 0
else:
b_n = b_n - b
print(a_n + b_n) | a, b = (int(x) for x in input().split())
x, y, z = (int(x) for x in input().split())
a_n = 0
b_n = 0
a_n += x * 2
a_n += y
b_n += y
b_n += 3 * z
if a > a_n:
a_n = 0
else:
a_n = a_n-a
if b > b_n:
b_n = 0
else:
b_n = b_n - b
print(a_n + b_n) | a_n = a_n-a | 12 | operation |
a, b = (int(x) for x in input().split())
x, y, z = (int(x) for x in input().split())
a_n = 0
b_n = 0
a_n += x * 2
a_n += y
b_n += y
b_n += 3 * z
if a > a_n:
a_n = 0
else:
a_n = a_n - a
if b > b_n:
b_n = 0
else:
b_n = b_n - b
print(a_n + b_n) | a, b = (int(x) for x in input().split())
x, y, z = (int(x) for x in input().split())
a_n = 0
b_n = 0
a_n += x**2
a_n += y
b_n += y
b_n += 3 * z
if a > a_n:
a_n = 0
else:
a_n = a_n - a
if b > b_n:
b_n = 0
else:
b_n = b_n - b
print(a_n + b_n) | a_n += x**2 | 5 | operation |
__author__ = 'dwliv_000'
(n,m)=(int(i) for i in input().split())
c=[int(i) for i in input().split()]
z={}
b=0
for i in range(n):
if c[i]%m in z.keys():
z[c[i]%m]=z[c[i]%m]+1
else:
z[c[i]%m]=1
q=0
for i in z.keys():
q=q+z[i]*i
b=0
if(q%m==0):
b=1
while q>m:
for i in sorted(list(z.keys())):
if(q%m in z.keys()):
z[q%m]=z[q%m]-1
if z[q%m]==0:
del z[q%m]
q=q-q%m
break
else:
if(i in z.keys()):
z[i]=z[i]-1
if(z[i]==0):
del z[i]
q=q-i
break
if(q%m==0):
b=1
break
if b==0:
print('NO')
else:
print('YES') | __author__ = 'dwliv_000'
(n,m)=(int(i) for i in input().split())
c=[int(i) for i in input().split()]
z={}
b=0
for i in range(n):
if c[i]%m in z.keys():
z[c[i]%m]=z[c[i]%m]+1
else:
z[c[i]%m]=1
q=0
for i in z.keys():
q=q+z[i]*i
b=0
if(q%m==0):
b=1
while q>m:
for i in sorted(list(z.keys())):
if(q%m in z.keys()):
z[q%m]=z[q%m]-1
if z[q%m]==0:
del z[q+m]
q=q-q%m
break
else:
if(i in z.keys()):
z[i]=z[i]-1
if(z[i]==0):
del z[i]
q=q-i
break
if(q%m==0):
b=1
break
if b==0:
print('NO')
else:
print('YES') | del z[q+m] | 24 | operation |
__author__ = 'dwliv_000'
(n,m)=(int(i) for i in input().split())
c=[int(i) for i in input().split()]
z={}
b=0
for i in range(n):
if c[i]%m in z.keys():
z[c[i]%m]=z[c[i]%m]+1
else:
z[c[i]%m]=1
q=0
for i in z.keys():
q=q+z[i]*i
b=0
if(q%m==0):
b=1
while q>m:
for i in sorted(list(z.keys())):
if(q%m in z.keys()):
z[q%m]=z[q%m]-1
if z[q%m]==0:
del z[q%m]
q=q-q%m
break
else:
if(i in z.keys()):
z[i]=z[i]-1
if(z[i]==0):
del z[i]
q=q-i
break
if(q%m==0):
b=1
break
if b==0:
print('NO')
else:
print('YES') | __author__ = 'dwliv_000'
(n,m)=(int(i) for i in input().split())
c=[int(i) for i in input().split()]
z={}
b=0
for i in range(n):
if c[i]%m in z.keys():
z[c[i]%m]=z[c[i]%m]+1
else:
z[c[i]%m]=1
q=190
for i in z.keys():
q=q+z[i]*i
b=0
if(q%m==0):
b=1
while q>m:
for i in sorted(list(z.keys())):
if(q%m in z.keys()):
z[q%m]=z[q%m]-1
if z[q%m]==0:
del z[q%m]
q=q-q%m
break
else:
if(i in z.keys()):
z[i]=z[i]-1
if(z[i]==0):
del z[i]
q=q-i
break
if(q%m==0):
b=1
break
if b==0:
print('NO')
else:
print('YES') | q=190 | 13 | value |
__author__ = 'dwliv_000'
(n,m)=(int(i) for i in input().split())
c=[int(i) for i in input().split()]
z={}
b=0
for i in range(n):
if c[i]%m in z.keys():
z[c[i]%m]=z[c[i]%m]+1
else:
z[c[i]%m]=1
q=0
for i in z.keys():
q=q+z[i]*i
b=0
if(q%m==0):
b=1
while q>m:
for i in sorted(list(z.keys())):
if(q%m in z.keys()):
z[q%m]=z[q%m]-1
if z[q%m]==0:
del z[q%m]
q=q-q%m
break
else:
if(i in z.keys()):
z[i]=z[i]-1
if(z[i]==0):
del z[i]
q=q-i
break
if(q%m==0):
b=1
break
if b==0:
print('NO')
else:
print('YES') | __author__ = 'dwliv_000'
(n,m)=(int(i) for i in input().split())
c=[int(i) for i in input().split()]
z={}
b=0
for i in range(n):
if c[i]%m in z.keys():
z[c[i]%m]=z[c[i]%m]+1
else:
z[c[i]%m]=1
q=0
for i in z.keys():
q=q+z[i]*i
b=0
if(q%m==0):
b=1
while q>m:
for i in sorted(list(z.keys())):
if(q%m in z.keys()):
z[q%m]=z[q%m]-1
if z[q%m]==0:
del z[q%m]
q=q-q%m
break
else:
if(i in z.keys()):
z[i]=z[i]-1
if(z[i]==0):
del z[i]
q=q-i
break
if(q%m==0):
b=1
break
if b<0:
print('NO')
else:
print('YES') | if b<0: | 37 | decision |
__author__ = 'dwliv_000'
(n,m)=(int(i) for i in input().split())
c=[int(i) for i in input().split()]
z={}
b=0
for i in range(n):
if c[i]%m in z.keys():
z[c[i]%m]=z[c[i]%m]+1
else:
z[c[i]%m]=1
q=0
for i in z.keys():
q=q+z[i]*i
b=0
if(q%m==0):
b=1
while q>m:
for i in sorted(list(z.keys())):
if(q%m in z.keys()):
z[q%m]=z[q%m]-1
if z[q%m]==0:
del z[q%m]
q=q-q%m
break
else:
if(i in z.keys()):
z[i]=z[i]-1
if(z[i]==0):
del z[i]
q=q-i
break
if(q%m==0):
b=1
break
if b==0:
print('NO')
else:
print('YES') | __author__ = 'dwliv_000'
(n,m)=(int(i) for i in input().split())
c=[int(i) for i in input().split()]
z={}
b=0
for i in range(n):
if c[i]%m in z.keys():
z[c[i]%m]=z[c[i]%m]+1
else:
z[c[i]%m]=1
q=0
for i in z.keys():
q=q+z[i]*i
b=103
if(q%m==0):
b=1
while q>m:
for i in sorted(list(z.keys())):
if(q%m in z.keys()):
z[q%m]=z[q%m]-1
if z[q%m]==0:
del z[q%m]
q=q-q%m
break
else:
if(i in z.keys()):
z[i]=z[i]-1
if(z[i]==0):
del z[i]
q=q-i
break
if(q%m==0):
b=1
break
if b==0:
print('NO')
else:
print('YES') | b=103 | 16 | value |
__author__ = 'dwliv_000'
(n,m)=(int(i) for i in input().split())
c=[int(i) for i in input().split()]
z={}
b=0
for i in range(n):
if c[i]%m in z.keys():
z[c[i]%m]=z[c[i]%m]+1
else:
z[c[i]%m]=1
q=0
for i in z.keys():
q=q+z[i]*i
b=0
if(q%m==0):
b=1
while q>m:
for i in sorted(list(z.keys())):
if(q%m in z.keys()):
z[q%m]=z[q%m]-1
if z[q%m]==0:
del z[q%m]
q=q-q%m
break
else:
if(i in z.keys()):
z[i]=z[i]-1
if(z[i]==0):
del z[i]
q=q-i
break
if(q%m==0):
b=1
break
if b==0:
print('NO')
else:
print('YES') | __author__ = 'dwliv_000'
(n,m)=(int(i) for i in input().split())
c=[int(i) for i in input().split()]
z={}
b=0
for i in range(n):
if c[i]%m in z.keys():
z[c[i]%m]=z[c[i]%m]+1
else:
z[c[i]%m]=1
q=0
for i in z.keys():
q=q+z[i]*i
b=0
if(q%m==0):
b=1
while q>m:
for i in sorted(list(z.keys())):
if(q%m in z.keys()):
z[q%m]=z[q%m]-1
if z[q%m]==0:
del z[q%m]
q=q-q%m
break
else:
if(i in z.keys()):
z[i]=z[i]-1
if(z[i]==0):
del z[i]
q=q-i
break
if(q|m==0):
b=1
break
if b==0:
print('NO')
else:
print('YES') | if(q|m==0): | 34 | operation |
import sys
k, d, t = tuple(map(int, sys.stdin.readline().split()))
start = 0
end = 3 * 1e18
ans = 0
req = (k // d) * d + (k%d != 0) * d
con = k + (req - k) * 0.5
while start <= end:
mid = (start + end) // 2
tim = mid * 0.5
tot = (tim // req) * con
type2 = tim - (tim // req) * req
if type2 <= k:
tot += type2
else:
tot += k
tot += (type2 - k) * 0.5
if tot >= t:
ans = tim
end = mid - 1
else:
start = mid + 1
print(ans) | import sys
k, d, t = tuple(map(int, sys.stdin.readline().split()))
start = 0
end = 3 * 1e18
ans = 0
req = (k // d) * d + (k%d != 0) * d
con = k + (req - k) * 0.5
while start <= end:
mid = (start*end) // 2
tim = mid * 0.5
tot = (tim // req) * con
type2 = tim - (tim // req) * req
if type2 <= k:
tot += type2
else:
tot += k
tot += (type2 - k) * 0.5
if tot >= t:
ans = tim
end = mid - 1
else:
start = mid + 1
print(ans) | mid = (start*end) // 2 | 12 | operation |
import sys
k, d, t = tuple(map(int, sys.stdin.readline().split()))
start = 0
end = 3 * 1e18
ans = 0
req = (k // d) * d + (k%d != 0) * d
con = k + (req - k) * 0.5
while start <= end:
mid = (start + end) // 2
tim = mid * 0.5
tot = (tim // req) * con
type2 = tim - (tim // req) * req
if type2 <= k:
tot += type2
else:
tot += k
tot += (type2 - k) * 0.5
if tot >= t:
ans = tim
end = mid - 1
else:
start = mid + 1
print(ans) | import sys
k, d, t = tuple(map(int, sys.stdin.readline().split()))
start = 0
end = 3 * 1e18
ans = 0
req = (k // d) * d + (k%d != 0)/d
con = k + (req - k) * 0.5
while start <= end:
mid = (start + end) // 2
tim = mid * 0.5
tot = (tim // req) * con
type2 = tim - (tim // req) * req
if type2 <= k:
tot += type2
else:
tot += k
tot += (type2 - k) * 0.5
if tot >= t:
ans = tim
end = mid - 1
else:
start = mid + 1
print(ans) | req = (k // d) * d + (k%d != 0)/d | 8 | operation |
import sys
k, d, t = tuple(map(int, sys.stdin.readline().split()))
start = 0
end = 3 * 1e18
ans = 0
req = (k // d) * d + (k%d != 0) * d
con = k + (req - k) * 0.5
while start <= end:
mid = (start + end) // 2
tim = mid * 0.5
tot = (tim // req) * con
type2 = tim - (tim // req) * req
if type2 <= k:
tot += type2
else:
tot += k
tot += (type2 - k) * 0.5
if tot >= t:
ans = tim
end = mid - 1
else:
start = mid + 1
print(ans) | import sys
k, d, t = tuple(map(int, sys.stdin.readline().split()))
start = 0
end = 3 * 1e18
ans = 0
req = (k // d) * d + (k%d != 0) * d
con = k + (req - k) * 0.5
while start <= end:
mid = (start + end) // 2
tim = mid * 0.5
tot = (tim // req) * con
type2 = tim+(tim // req) * req
if type2 <= k:
tot += type2
else:
tot += k
tot += (type2 - k) * 0.5
if tot >= t:
ans = tim
end = mid - 1
else:
start = mid + 1
print(ans) | type2 = tim+(tim // req) * req | 17 | operation |
import sys
k, d, t = tuple(map(int, sys.stdin.readline().split()))
start = 0
end = 3 * 1e18
ans = 0
req = (k // d) * d + (k%d != 0) * d
con = k + (req - k) * 0.5
while start <= end:
mid = (start + end) // 2
tim = mid * 0.5
tot = (tim // req) * con
type2 = tim - (tim // req) * req
if type2 <= k:
tot += type2
else:
tot += k
tot += (type2 - k) * 0.5
if tot >= t:
ans = tim
end = mid - 1
else:
start = mid + 1
print(ans) | import sys
k, d, t = tuple(map(int, sys.stdin.readline().split()))
start = 0
end = 3 * 1e18
ans = 0
req = (k // d) * d + (k%d != 0) * d
con = k + (req - k) * 0.5
while start <= end:
mid = (start + end) // 2
tim = mid * 0.5
tot = (tim // req) * con
type2 = tim - (tim // req) * req
if type2 <= k:
tot += type2
else:
tot += k
tot += (type2 - k) * 0.5
if tot<=t:
ans = tim
end = mid - 1
else:
start = mid + 1
print(ans) | if tot<=t: | 25 | decision |
n = int(input())
a = list(map(int, input().split(" ")))
s = list(map(int, input()))
right = [-1] * n
i = n - 2
right[n - 1] = n - 1
if s[i] == 1:
right[i] = i + 1
else:
right[i] = i
i -= 1
while i >= 0:
if s[i] == 0:
right[i] = i
else:
if s[i+1] == 0:
right[i] = i + 1
else:
right[i] = right[i+1]
i -= 1
ans = True
i = 0
for ai in a:
if ai - 1 > right[i]:
ans = False
i += 1
print("YES" if ans else "NO") | n = int(input())
a = list(map(int, input().split(" ")))
s = list(map(int, input()))
right = [-1] * n
i = n - 2
right[n - 1] = n - 1
if s[i] == 1:
right[i] = i + 1
else:
right[i] = i
i -= 1
while i >= 0:
if s[i] == 0:
right[i] = i
else:
if s[i+1]<0:
right[i] = i + 1
else:
right[i] = right[i+1]
i -= 1
ans = True
i = 0
for ai in a:
if ai - 1 > right[i]:
ans = False
i += 1
print("YES" if ans else "NO") | if s[i+1]<0: | 16 | decision |
n = int(input())
a = list(map(int, input().split(" ")))
s = list(map(int, input()))
right = [-1] * n
i = n - 2
right[n - 1] = n - 1
if s[i] == 1:
right[i] = i + 1
else:
right[i] = i
i -= 1
while i >= 0:
if s[i] == 0:
right[i] = i
else:
if s[i+1] == 0:
right[i] = i + 1
else:
right[i] = right[i+1]
i -= 1
ans = True
i = 0
for ai in a:
if ai - 1 > right[i]:
ans = False
i += 1
print("YES" if ans else "NO") | n = int(input())
a = list(map(int, input().split(" ")))
s = list(map(int, input()))
right = [-1] * n
i = n - 2
right[n - 1] = n - 1
if s[i] == 1:
right[i] = i + 1
else:
right[i] = i
i -= 1
while i >= 0:
if s[i] == 0:
right[i] = i
else:
if s[i+1]<0:
right[i] = i + 1
else:
right[i] = right[i+1]
i -= 1
ans = True
i = 0
for ai in a:
if ai - 1 > right[i]:
ans = False
i += 1
print("YES" if ans else "NO") | if s[i+1]<0: | 16 | decision |
n = int(input())
a = list(map(int, input().split(" ")))
s = list(map(int, input()))
right = [-1] * n
i = n - 2
right[n - 1] = n - 1
if s[i] == 1:
right[i] = i + 1
else:
right[i] = i
i -= 1
while i >= 0:
if s[i] == 0:
right[i] = i
else:
if s[i+1] == 0:
right[i] = i + 1
else:
right[i] = right[i+1]
i -= 1
ans = True
i = 0
for ai in a:
if ai - 1 > right[i]:
ans = False
i += 1
print("YES" if ans else "NO") | n = int(input())
a = list(map(int, input().split(" ")))
s = list(map(int, input()))
right = [-1] * n
i = n - 2
right[n - 1] = n - 1
if s[i]<1:
right[i] = i + 1
else:
right[i] = i
i -= 1
while i >= 0:
if s[i] == 0:
right[i] = i
else:
if s[i+1] == 0:
right[i] = i + 1
else:
right[i] = right[i+1]
i -= 1
ans = True
i = 0
for ai in a:
if ai - 1 > right[i]:
ans = False
i += 1
print("YES" if ans else "NO") | if s[i]<1: | 7 | decision |
n = int(input())
a = list(map(int, input().split(" ")))
s = list(map(int, input()))
right = [-1] * n
i = n - 2
right[n - 1] = n - 1
if s[i] == 1:
right[i] = i + 1
else:
right[i] = i
i -= 1
while i >= 0:
if s[i] == 0:
right[i] = i
else:
if s[i+1] == 0:
right[i] = i + 1
else:
right[i] = right[i+1]
i -= 1
ans = True
i = 0
for ai in a:
if ai - 1 > right[i]:
ans = False
i += 1
print("YES" if ans else "NO") | n = int(input())
a = list(map(int, input().split(" ")))
s = list(map(int, input()))
right = [-1] * n
i = n - 2
right[n - 1] = n - 1
if s[i] == 1:
right[i] = i + 1
else:
right[i] = i
i -= 1
while i >= 0:
if s[i] == 0:
right[i] = i
else:
if s[i|1] == 0:
right[i] = i + 1
else:
right[i] = right[i+1]
i -= 1
ans = True
i = 0
for ai in a:
if ai - 1 > right[i]:
ans = False
i += 1
print("YES" if ans else "NO") | if s[i|1] == 0: | 16 | operation |
n = int(input())
a = list(map(int, input().split(" ")))
s = list(map(int, input()))
right = [-1] * n
i = n - 2
right[n - 1] = n - 1
if s[i] == 1:
right[i] = i + 1
else:
right[i] = i
i -= 1
while i >= 0:
if s[i] == 0:
right[i] = i
else:
if s[i+1] == 0:
right[i] = i + 1
else:
right[i] = right[i+1]
i -= 1
ans = True
i = 0
for ai in a:
if ai - 1 > right[i]:
ans = False
i += 1
print("YES" if ans else "NO") | n = int(input())
a = list(map(int, input().split(" ")))
s = list(map(int, input()))
right = [-1] * n
i = n - 2
right[n - 1] = n - 1
if s[i] == 1:
right[i] = i + 1
else:
right[i] = i
i -= 1
while i<=0:
if s[i] == 0:
right[i] = i
else:
if s[i+1] == 0:
right[i] = i + 1
else:
right[i] = right[i+1]
i -= 1
ans = True
i = 0
for ai in a:
if ai - 1 > right[i]:
ans = False
i += 1
print("YES" if ans else "NO") | while i<=0: | 12 | decision |
inp = input()
listinp = list(inp)
resl = []
state = 0
def isVow(c):
if (c == 'a'):
return True
elif (c =='e'):
return True
elif (c =='i'):
return True
elif (c == 'o'):
return True
elif (c=='u'):
return True
return False
for i in range(len(listinp)):
if not isVow((listinp[i])):
state = 0
resl.append(listinp[i])
continue
elif (state == 1):
continue
else:
resl.append(listinp[i])
state = 1
continue
print(''.join(resl))
| inp = input()
listinp = list(inp)
resl = []
state = 0
def isVow(c):
if (c == 'a'):
return True
elif (c =='e'):
return True
elif (c =='i'):
return True
elif (c == 'o'):
return True
elif (c=='u'):
return True
return False
for i in range(len(listinp)):
if not isVow((listinp[i])):
state = 0
resl.append(listinp[i])
continue
elif (state<1):
continue
else:
resl.append(listinp[i])
state = 1
continue
print(''.join(resl))
| elif (state<1): | 24 | decision |
inp = input()
listinp = list(inp)
resl = []
state = 0
def isVow(c):
if (c == 'a'):
return True
elif (c =='e'):
return True
elif (c =='i'):
return True
elif (c == 'o'):
return True
elif (c=='u'):
return True
return False
for i in range(len(listinp)):
if not isVow((listinp[i])):
state = 0
resl.append(listinp[i])
continue
elif (state == 1):
continue
else:
resl.append(listinp[i])
state = 1
continue
print(''.join(resl))
| inp = input()
listinp = list(inp)
resl = []
state = 0
def isVow(c):
if (c == 'a'):
return True
elif (c<'e'):
return True
elif (c =='i'):
return True
elif (c == 'o'):
return True
elif (c=='u'):
return True
return False
for i in range(len(listinp)):
if not isVow((listinp[i])):
state = 0
resl.append(listinp[i])
continue
elif (state == 1):
continue
else:
resl.append(listinp[i])
state = 1
continue
print(''.join(resl))
| elif (c<'e'): | 9 | decision |
inp = input()
listinp = list(inp)
resl = []
state = 0
def isVow(c):
if (c == 'a'):
return True
elif (c =='e'):
return True
elif (c =='i'):
return True
elif (c == 'o'):
return True
elif (c=='u'):
return True
return False
for i in range(len(listinp)):
if not isVow((listinp[i])):
state = 0
resl.append(listinp[i])
continue
elif (state == 1):
continue
else:
resl.append(listinp[i])
state = 1
continue
print(''.join(resl))
| inp = input()
listinp = list(inp)
resl = []
state = 0
def isVow(c):
if (c == 'a'):
return True
elif (c<'e'):
return True
elif (c =='i'):
return True
elif (c == 'o'):
return True
elif (c=='u'):
return True
return False
for i in range(len(listinp)):
if not isVow((listinp[i])):
state = 0
resl.append(listinp[i])
continue
elif (state == 1):
continue
else:
resl.append(listinp[i])
state = 1
continue
print(''.join(resl))
| elif (c<'e'): | 9 | decision |
s = input().lower()
base = []
x = int(input())
while x > 0:
base.append(input().lower())
x -= 1
if s in base or s.replace("l", "1") in base or s.replace("i", "1") in base or s.replace("1", "i") in base or s.replace("1", "l") in base or s.replace("0", "o") in base:
print("No")
else:
print("Yes") | s = input().lower()
base = []
x = int(input())
while x > 0:
base.append(input().lower())
x -= 186
if s in base or s.replace("l", "1") in base or s.replace("i", "1") in base or s.replace("1", "i") in base or s.replace("1", "l") in base or s.replace("0", "o") in base:
print("No")
else:
print("Yes") | x -= 186 | 6 | value |
def inCreasingSeq(n,seq,startIndex):
for i in range(startIndex,n-1):
if(seq[i] > seq[i+1]):
return i+1
return -1
def replace(index,seq):
seq[index] = seq[index - 1]
return
def solve(n,seq):
nbReplace = 0
ind = inCreasingSeq(n,seq,0)
while ind != -1:
replace(ind,seq)
nbReplace+=1
ind = inCreasingSeq(n,seq,ind)
print(nbReplace-1)
nbT = int (input())
lis = list(map(int,input().split()))
solve(nbT,lis) | def inCreasingSeq(n,seq,startIndex):
for i in range(startIndex,n-1):
if(seq[i] > seq[i+1]):
return i+1
return -1
def replace(index,seq):
seq[index] = seq[index - 1]
return
def solve(x,seq):
nbReplace = 0
ind = inCreasingSeq(n,seq,0)
while ind != -1:
replace(ind,seq)
nbReplace+=1
ind = inCreasingSeq(n,seq,ind)
print(nbReplace-1)
nbT = int (input())
lis = list(map(int,input().split()))
solve(nbT,lis) | def solve(x,seq): | 14 | statement |
def inCreasingSeq(n,seq,startIndex):
for i in range(startIndex,n-1):
if(seq[i] > seq[i+1]):
return i+1
return -1
def replace(index,seq):
seq[index] = seq[index - 1]
return
def solve(n,seq):
nbReplace = 0
ind = inCreasingSeq(n,seq,0)
while ind != -1:
replace(ind,seq)
nbReplace+=1
ind = inCreasingSeq(n,seq,ind)
print(nbReplace-1)
nbT = int (input())
lis = list(map(int,input().split()))
solve(nbT,lis) | def inCreasingSeq(n,seq,startIndex):
for i in range(startIndex,n-1):
if(seq[i]==seq[i+1]):
return i+1
return -1
def replace(index,seq):
seq[index] = seq[index - 1]
return
def solve(n,seq):
nbReplace = 0
ind = inCreasingSeq(n,seq,0)
while ind != -1:
replace(ind,seq)
nbReplace+=1
ind = inCreasingSeq(n,seq,ind)
print(nbReplace-1)
nbT = int (input())
lis = list(map(int,input().split()))
solve(nbT,lis) | if(seq[i]==seq[i+1]): | 3 | decision |
def inCreasingSeq(n,seq,startIndex):
for i in range(startIndex,n-1):
if(seq[i] > seq[i+1]):
return i+1
return -1
def replace(index,seq):
seq[index] = seq[index - 1]
return
def solve(n,seq):
nbReplace = 0
ind = inCreasingSeq(n,seq,0)
while ind != -1:
replace(ind,seq)
nbReplace+=1
ind = inCreasingSeq(n,seq,ind)
print(nbReplace-1)
nbT = int (input())
lis = list(map(int,input().split()))
solve(nbT,lis) | def inCreasingSeq(n,seq,startIndex):
for i in range(startIndex,n-1):
if(seq[i] > seq[i+1]):
return i+1
return -1
def replace(index,seq):
seq[index] = seq[index - 1]
return
def solve(n,seq):
nbReplace = 0
ind = z(n,seq,0)
while ind != -1:
replace(ind,seq)
nbReplace+=1
ind = inCreasingSeq(n,seq,ind)
print(nbReplace-1)
nbT = int (input())
lis = list(map(int,input().split()))
solve(nbT,lis) | ind = z(n,seq,0) | 16 | statement |
def inCreasingSeq(n,seq,startIndex):
for i in range(startIndex,n-1):
if(seq[i] > seq[i+1]):
return i+1
return -1
def replace(index,seq):
seq[index] = seq[index - 1]
return
def solve(n,seq):
nbReplace = 0
ind = inCreasingSeq(n,seq,0)
while ind != -1:
replace(ind,seq)
nbReplace+=1
ind = inCreasingSeq(n,seq,ind)
print(nbReplace-1)
nbT = int (input())
lis = list(map(int,input().split()))
solve(nbT,lis) | def inCreasingSeq(n,seq,startIndex):
for i in range(startIndex,n-1):
if(seq[i] > seq[i+1]):
return i+1
return -1
def replace(index,seq):
seq[index] = seq[index|1]
return
def solve(n,seq):
nbReplace = 0
ind = inCreasingSeq(n,seq,0)
while ind != -1:
replace(ind,seq)
nbReplace+=1
ind = inCreasingSeq(n,seq,ind)
print(nbReplace-1)
nbT = int (input())
lis = list(map(int,input().split()))
solve(nbT,lis) | seq[index] = seq[index|1] | 10 | operation |
n,m=list(map(int,input().split()))
ln=list(map(int,input().split()))
lm=list(map(int,input().split()))
i,j,count=0,0,0
while(i<n or j<m):
if(ln[i]==lm[j]):
i+=1
j+=1
count+=1
elif(ln[i]<lm[j]):
while(ln[i]<lm[j]):
ln[i+1]+=ln[i]
i+=1
if(ln[i]==lm[j]):
count+=1
i+=1
j+=1
else:
while(ln[i]>lm[j]):
lm[j+1]+=lm[j]
j+=1
if(ln[i]==lm[j]):
count+=1
i+=1
j+=1
print(count) | n,m=list(map(int,input().split()))
ln=list(map(int,input().split()))
lm=list(map(int,input().split()))
i,j,count=0,0,0
while(i<n or j<m):
if(ln[i]==lm[j]):
i+=1
j+=1
count+=1
elif(ln[i]<lm[j]):
while(ln[i]<lm[j]):
ln[i+1]+=ln[i]
i+=1
if(ln[i]==lm[j]):
count+=1
i+=1
j+=1
else:
while(ln[i]>lm[j]):
lm[j^1]+=lm[j]
j+=1
if(ln[i]==lm[j]):
count+=1
i+=1
j+=1
print(count) | lm[j^1]+=lm[j] | 20 | operation |
n,m=list(map(int,input().split()))
ln=list(map(int,input().split()))
lm=list(map(int,input().split()))
i,j,count=0,0,0
while(i<n or j<m):
if(ln[i]==lm[j]):
i+=1
j+=1
count+=1
elif(ln[i]<lm[j]):
while(ln[i]<lm[j]):
ln[i+1]+=ln[i]
i+=1
if(ln[i]==lm[j]):
count+=1
i+=1
j+=1
else:
while(ln[i]>lm[j]):
lm[j+1]+=lm[j]
j+=1
if(ln[i]==lm[j]):
count+=1
i+=1
j+=1
print(count) | n,m=list(map(int,input().split()))
ln=list(map(int,input().split()))
lm=list(map(int,input().split()))
i,j,count=0,0,0
while(i>n or j<m):
if(ln[i]==lm[j]):
i+=1
j+=1
count+=1
elif(ln[i]<lm[j]):
while(ln[i]<lm[j]):
ln[i+1]+=ln[i]
i+=1
if(ln[i]==lm[j]):
count+=1
i+=1
j+=1
else:
while(ln[i]>lm[j]):
lm[j+1]+=lm[j]
j+=1
if(ln[i]==lm[j]):
count+=1
i+=1
j+=1
print(count) | while(i>n or j<m): | 5 | decision |
n,m=list(map(int,input().split()))
ln=list(map(int,input().split()))
lm=list(map(int,input().split()))
i,j,count=0,0,0
while(i<n or j<m):
if(ln[i]==lm[j]):
i+=1
j+=1
count+=1
elif(ln[i]<lm[j]):
while(ln[i]<lm[j]):
ln[i+1]+=ln[i]
i+=1
if(ln[i]==lm[j]):
count+=1
i+=1
j+=1
else:
while(ln[i]>lm[j]):
lm[j+1]+=lm[j]
j+=1
if(ln[i]==lm[j]):
count+=1
i+=1
j+=1
print(count) | n,m=list(map(int,input().split()))
ln=list(map(int,input().split()))
lm=list(map(int,input().split()))
i,j,count=0,0,0
while(i<n or j<m):
if(ln[i]==lm[j]):
i+=1
j+=37
count+=1
elif(ln[i]<lm[j]):
while(ln[i]<lm[j]):
ln[i+1]+=ln[i]
i+=1
if(ln[i]==lm[j]):
count+=1
i+=1
j+=1
else:
while(ln[i]>lm[j]):
lm[j+1]+=lm[j]
j+=1
if(ln[i]==lm[j]):
count+=1
i+=1
j+=1
print(count) | j+=37 | 8 | value |
n,m=list(map(int,input().split()))
ln=list(map(int,input().split()))
lm=list(map(int,input().split()))
i,j,count=0,0,0
while(i<n or j<m):
if(ln[i]==lm[j]):
i+=1
j+=1
count+=1
elif(ln[i]<lm[j]):
while(ln[i]<lm[j]):
ln[i+1]+=ln[i]
i+=1
if(ln[i]==lm[j]):
count+=1
i+=1
j+=1
else:
while(ln[i]>lm[j]):
lm[j+1]+=lm[j]
j+=1
if(ln[i]==lm[j]):
count+=1
i+=1
j+=1
print(count) | n,m=list(map(int,input().split()))
ln=list(map(int,input().split()))
lm=list(map(int,input().split()))
i,j,count=0,0,0
while(i>n or j<m):
if(ln[i]==lm[j]):
i+=1
j+=1
count+=1
elif(ln[i]<lm[j]):
while(ln[i]<lm[j]):
ln[i+1]+=ln[i]
i+=1
if(ln[i]==lm[j]):
count+=1
i+=1
j+=1
else:
while(ln[i]>lm[j]):
lm[j+1]+=lm[j]
j+=1
if(ln[i]==lm[j]):
count+=1
i+=1
j+=1
print(count) | while(i>n or j<m): | 5 | decision |
n,m=list(map(int,input().split()))
ln=list(map(int,input().split()))
lm=list(map(int,input().split()))
i,j,count=0,0,0
while(i<n or j<m):
if(ln[i]==lm[j]):
i+=1
j+=1
count+=1
elif(ln[i]<lm[j]):
while(ln[i]<lm[j]):
ln[i+1]+=ln[i]
i+=1
if(ln[i]==lm[j]):
count+=1
i+=1
j+=1
else:
while(ln[i]>lm[j]):
lm[j+1]+=lm[j]
j+=1
if(ln[i]==lm[j]):
count+=1
i+=1
j+=1
print(count) | n,m=list(map(int,input().split()))
ln=list(map(int,input().split()))
lm=list(map(int,input().split()))
i,j,count=0,0,0
while(i<n or j<m):
if(ln[i]==lm[j]):
i+=1
j+=1
count+=1
elif(ln[i]<lm[j]):
while(ln[i]<lm[j]):
ln[i+1]+=ln[i]
i+=1
if(ln[i]==lm[j]):
count+=1
i+=1
j+=1
else:
while(ln[i]>lm[j]):
lm[j**1]+=lm[j]
j+=1
if(ln[i]==lm[j]):
count+=1
i+=1
j+=1
print(count) | lm[j**1]+=lm[j] | 20 | operation |
p,y = [int(x) for x in input().split()]
p1 = y
def prost(p1, p):
a = True
x = 2
while x*x<=p1 and x <= p:
if p1%x == 0:
a = False
x += 1
return a
while prost(p1, p) == False and p1 > p:
p1 -= 1
if p1 <= p:
print(-1)
else:
print(p1) | p,y = [int(x) for x in input().split()]
p1 = y
def prost(p1, p):
a = True
x = 2
while x*x<=p1 and x <= p:
if p1|x == 0:
a = False
x += 1
return a
while prost(p1, p) == False and p1 > p:
p1 -= 1
if p1 <= p:
print(-1)
else:
print(p1) | if p1|x == 0: | 7 | operation |
p,y = [int(x) for x in input().split()]
p1 = y
def prost(p1, p):
a = True
x = 2
while x*x<=p1 and x <= p:
if p1%x == 0:
a = False
x += 1
return a
while prost(p1, p) == False and p1 > p:
p1 -= 1
if p1 <= p:
print(-1)
else:
print(p1) | p,y = [int(x) for x in input().split()]
p1 = y
def prost(p1, p):
a = True
x = 2
while x*x<=p1 and x <= p:
if p1%x == 0:
a = False
x += 1
return a
while prost(p1, z) == False and p1 > p:
p1 -= 1
if p1 <= p:
print(-1)
else:
print(p1) | while prost(p1, z) == False and p1 > p: | 11 | statement |
p,y = [int(x) for x in input().split()]
p1 = y
def prost(p1, p):
a = True
x = 2
while x*x<=p1 and x <= p:
if p1%x == 0:
a = False
x += 1
return a
while prost(p1, p) == False and p1 > p:
p1 -= 1
if p1 <= p:
print(-1)
else:
print(p1) | p,y = [int(x) for x in input().split()]
p1 = y
def prost(p1, p):
a = True
x = 2
while x*x<=p1 and x <= p:
if p1%x == 0:
a = False
x += 1
return a
while prost(p1, p)<False and p1 > p:
p1 -= 1
if p1 <= p:
print(-1)
else:
print(p1) | while prost(p1, p)<False and p1 > p: | 11 | decision |
p,y = [int(x) for x in input().split()]
p1 = y
def prost(p1, p):
a = True
x = 2
while x*x<=p1 and x <= p:
if p1%x == 0:
a = False
x += 1
return a
while prost(p1, p) == False and p1 > p:
p1 -= 1
if p1 <= p:
print(-1)
else:
print(p1) | p,y = [int(x) for x in input().split()]
p1 = y
def prost(p1, p):
a = True
x = 2
while x|x<=p1 and x <= p:
if p1%x == 0:
a = False
x += 1
return a
while prost(p1, p) == False and p1 > p:
p1 -= 1
if p1 <= p:
print(-1)
else:
print(p1) | while x|x<=p1 and x <= p: | 6 | operation |
a, b=map(int, input().split())
while True:
if a == 0 or b == 0:
break
elif a>=2*b:
a%=2*b
elif b>=2*a:
b%=2*a
else:
break
print(a,b)
print(a,b) | a, b=map(z, input().split())
while True:
if a == 0 or b == 0:
break
elif a>=2*b:
a%=2*b
elif b>=2*a:
b%=2*a
else:
break
print(a,b)
print(a,b) | a, b=map(z, input().split()) | 1 | statement |
a, b=map(int, input().split())
while True:
if a == 0 or b == 0:
break
elif a>=2*b:
a%=2*b
elif b>=2*a:
b%=2*a
else:
break
print(a,b)
print(a,b) | a, b=map(int, input().split())
while True:
if a == 0 or b == 0:
break
elif z>=2*b:
a%=2*b
elif b>=2*a:
b%=2*a
else:
break
print(a,b)
print(a,b) | elif z>=2*b: | 7 | statement |
a, b=map(int, input().split())
while True:
if a == 0 or b == 0:
break
elif a>=2*b:
a%=2*b
elif b>=2*a:
b%=2*a
else:
break
print(a,b)
print(a,b) | a, b=map(int, input().split())
while True:
if a == 0 or b == 0:
break
elif a>=2*b:
a%=2*b
elif b>=2/a:
b%=2*a
else:
break
print(a,b)
print(a,b) | elif b>=2/a: | 9 | operation |
a, b=map(int, input().split())
while True:
if a == 0 or b == 0:
break
elif a>=2*b:
a%=2*b
elif b>=2*a:
b%=2*a
else:
break
print(a,b)
print(a,b) | a, b=map(int, input().split())
while True:
if a == 0 or b == 0:
break
elif a>=2*b:
a%=2*b
elif b>=2*a:
b%=2*a
else:
break
print(a,b)
print(x,b) | print(x,b) | 17 | statement |
a, b=map(int, input().split())
while True:
if a == 0 or b == 0:
break
elif a>=2*b:
a%=2*b
elif b>=2*a:
b%=2*a
else:
break
print(a,b)
print(a,b) | a, b=map(int, input().split())
while True:
if a == 0 or b == 0:
break
elif a>=2*b:
a%=2**b
elif b>=2*a:
b%=2*a
else:
break
print(a,b)
print(a,b) | a%=2**b | 8 | operation |
import sys
n, k = sys.stdin.readline().strip().split(' ')
a = sys.stdin.readline().strip().split(' ')
s=0
n = int(n)
k = int(k)
for i in range(n,0,-1):
r = k%int(a[i-1])
if r==0:
s=k/int(a[i-1])
break
print(int(s)) | import sys
n, k = sys.stdin.readline().strip().split(' ')
a = sys.stdin.readline().strip().split(' ')
s=0
n = int(n)
k = int(k)
for i in range(n,0,-1):
r = k%int(a[i-1])
if r==0:
s=k/int(a[i^1])
break
print(int(s)) | s=k/int(a[i^1]) | 11 | operation |
import sys
n, k = sys.stdin.readline().strip().split(' ')
a = sys.stdin.readline().strip().split(' ')
s=0
n = int(n)
k = int(k)
for i in range(n,0,-1):
r = k%int(a[i-1])
if r==0:
s=k/int(a[i-1])
break
print(int(s)) | import sys
n, k = sys.stdin.readline().strip().split(' ')
a = sys.stdin.readline().strip().split(' ')
s=0
n = int(n)
k = int(k)
for i in range(n,0,-1):
r = k%int(a[i-1])
if r==0:
s=k/int(a[i<<1])
break
print(int(s)) | s=k/int(a[i<<1]) | 11 | operation |
import sys
n, k = sys.stdin.readline().strip().split(' ')
a = sys.stdin.readline().strip().split(' ')
s=0
n = int(n)
k = int(k)
for i in range(n,0,-1):
r = k%int(a[i-1])
if r==0:
s=k/int(a[i-1])
break
print(int(s)) | import sys
n, k = sys.stdin.readline().strip().split(' ')
a = sys.stdin.readline().strip().split(' ')
s=0
n = int(n)
k = int(k)
for i in range(n,0,-1):
r = k%int(a[i-1])
if r<0:
s=k/int(a[i-1])
break
print(int(s)) | if r<0: | 10 | decision |
import sys
n, k = sys.stdin.readline().strip().split(' ')
a = sys.stdin.readline().strip().split(' ')
s=0
n = int(n)
k = int(k)
for i in range(n,0,-1):
r = k%int(a[i-1])
if r==0:
s=k/int(a[i-1])
break
print(int(s)) | import sys
n, k = sys.stdin.readline().strip().split(' ')
a = sys.stdin.readline().strip().split(' ')
s=0
n = int(n)
k = int(k)
for i in range(n,0,-1):
r = k%int(a[i-1])
if r==58:
s=k/int(a[i-1])
break
print(int(s)) | if r==58: | 10 | value |
import sys
n, k = sys.stdin.readline().strip().split(' ')
a = sys.stdin.readline().strip().split(' ')
s=0
n = int(n)
k = int(k)
for i in range(n,0,-1):
r = k%int(a[i-1])
if r==0:
s=k/int(a[i-1])
break
print(int(s)) | import sys
n, k = sys.stdin.readline().strip().split(' ')
a = sys.stdin.readline().strip().split(' ')
s=0
n = int(n)
k = int(k)
for i in range(n,0,-1):
r = k%int(a[i-1])
if r==0:
s=k/int(a[i+1])
break
print(int(s)) | s=k/int(a[i+1]) | 11 | operation |
from collections import defaultdict
t = int(input())
for _ in range(t):
n = int(input())
d = defaultdict(list)
for i in range(n):
l, r = map(int, input().split())
d[l].append(i)
if len(d[l]) <= r:
print(l + len(d[l]) - 1, end=' ')
else:
print(0, end=' ')
del d[l][d[l].index(i)] | from collections import defaultdict
t = int(input())
for _ in range(t):
n = int(input())
d = defaultdict(list)
for i in range(n):
l, r = map(int, input().split())
d[l].append(i)
if len(d[l])>=r:
print(l + len(d[l]) - 1, end=' ')
else:
print(0, end=' ')
del d[l][d[l].index(i)] | if len(d[l])>=r: | 11 | decision |
from collections import defaultdict
t = int(input())
for _ in range(t):
n = int(input())
d = defaultdict(list)
for i in range(n):
l, r = map(int, input().split())
d[l].append(i)
if len(d[l]) <= r:
print(l + len(d[l]) - 1, end=' ')
else:
print(0, end=' ')
del d[l][d[l].index(i)] | from collections import defaultdict
t = int(input())
for _ in range(t):
n = int(input())
d = defaultdict(list)
for i in range(n):
l, r = map(int, input().split())
d[l].append(i)
if len(d[l]) <= r:
print(l-len(d[l]) - 1, end=' ')
else:
print(0, end=' ')
del d[l][d[l].index(i)] | print(l-len(d[l]) - 1, end=' ') | 12 | operation |
from collections import defaultdict
t = int(input())
for _ in range(t):
n = int(input())
d = defaultdict(list)
for i in range(n):
l, r = map(int, input().split())
d[l].append(i)
if len(d[l]) <= r:
print(l + len(d[l]) - 1, end=' ')
else:
print(0, end=' ')
del d[l][d[l].index(i)] | from collections import defaultdict
t = int(input())
for _ in range(t):
n = int(input())
d = defaultdict(list)
for i in range(n):
l, r = map(int, input().split())
d[l].append(i)
if len(d[l]) <= r:
print(l + len(d[l]) - 1, end=' ')
else:
print(137, end=' ')
del d[l][d[l].index(i)] | print(137, end=' ') | 14 | value |
from collections import defaultdict
t = int(input())
for _ in range(t):
n = int(input())
d = defaultdict(list)
for i in range(n):
l, r = map(int, input().split())
d[l].append(i)
if len(d[l]) <= r:
print(l + len(d[l]) - 1, end=' ')
else:
print(0, end=' ')
del d[l][d[l].index(i)] | from collections import defaultdict
t = int(input())
for _ in range(t):
n = int(input())
d = defaultdict(list)
for i in range(n):
l, r = map(int, input().split())
d[l].append(i)
if len(d[l])>=r:
print(l + len(d[l]) - 1, end=' ')
else:
print(0, end=' ')
del d[l][d[l].index(i)] | if len(d[l])>=r: | 11 | decision |
from collections import defaultdict
t = int(input())
for _ in range(t):
n = int(input())
d = defaultdict(list)
for i in range(n):
l, r = map(int, input().split())
d[l].append(i)
if len(d[l]) <= r:
print(l + len(d[l]) - 1, end=' ')
else:
print(0, end=' ')
del d[l][d[l].index(i)] | from collections import defaultdict
t = int(input())
for _ in range(t):
n = int(input())
d = defaultdict(list)
for i in range(n):
l, r = map(int, input().split())
d[l].append(i)
if len(d[l])>=r:
print(l + len(d[l]) - 1, end=' ')
else:
print(0, end=' ')
del d[l][d[l].index(i)] | if len(d[l])>=r: | 11 | decision |
inp=lambda:map(int,input().split())
x=int(input())
h,m=inp()
time=h*60+m
m=10**10
a=[0]*4
for i in range(1,25):
for j in range(60):
a[0]=i%10; a[1]=i//10; a[2]=j%10; a[3]=j//10;
fl=0
for k in range(0,4):
if(a[k]==7): fl=1;break
if(fl==1 and 60*i+j<=time and (time-60*i-j)%x==0):
m=min(m,(time-60*i-j)//x)
imin=i
jmin=j
if(fl==1 and 60*i+j>time and (24*60+time-60*i-j)%x==0):
m=min(m,(24*60+time-60*i-j)//x)
imin=i
jmin=j
print(m) | inp=lambda:map(int,input().split())
x=int(input())
h,m=inp()
time=h*60+m
m=10**10
a=[197]*4
for i in range(1,25):
for j in range(60):
a[0]=i%10; a[1]=i//10; a[2]=j%10; a[3]=j//10;
fl=0
for k in range(0,4):
if(a[k]==7): fl=1;break
if(fl==1 and 60*i+j<=time and (time-60*i-j)%x==0):
m=min(m,(time-60*i-j)//x)
imin=i
jmin=j
if(fl==1 and 60*i+j>time and (24*60+time-60*i-j)%x==0):
m=min(m,(24*60+time-60*i-j)//x)
imin=i
jmin=j
print(m) | a=[197]*4 | 6 | value |
inp=lambda:map(int,input().split())
x=int(input())
h,m=inp()
time=h*60+m
m=10**10
a=[0]*4
for i in range(1,25):
for j in range(60):
a[0]=i%10; a[1]=i//10; a[2]=j%10; a[3]=j//10;
fl=0
for k in range(0,4):
if(a[k]==7): fl=1;break
if(fl==1 and 60*i+j<=time and (time-60*i-j)%x==0):
m=min(m,(time-60*i-j)//x)
imin=i
jmin=j
if(fl==1 and 60*i+j>time and (24*60+time-60*i-j)%x==0):
m=min(m,(24*60+time-60*i-j)//x)
imin=i
jmin=j
print(m) | inp=lambda:map(int,input().split())
x=int(input())
h,m=inp()
time=h*60+m
m=10**10
a=[0]*4
for i in range(1,25):
for j in range(60):
a[0]=i%10; a[1]=i//10; a[2]=j%10; a[3]=j//10;
fl=0
for k in range(0,4):
if(a[k]==7): fl=1;break
if(fl==1 and 60*i+j<=time and (time/60*i-j)%x==0):
m=min(m,(time-60*i-j)//x)
imin=i
jmin=j
if(fl==1 and 60*i+j>time and (24*60+time-60*i-j)%x==0):
m=min(m,(24*60+time-60*i-j)//x)
imin=i
jmin=j
print(m) | if(fl==1 and 60*i+j<=time and (time/60*i-j)%x==0): | 14 | operation |
inp=lambda:map(int,input().split())
x=int(input())
h,m=inp()
time=h*60+m
m=10**10
a=[0]*4
for i in range(1,25):
for j in range(60):
a[0]=i%10; a[1]=i//10; a[2]=j%10; a[3]=j//10;
fl=0
for k in range(0,4):
if(a[k]==7): fl=1;break
if(fl==1 and 60*i+j<=time and (time-60*i-j)%x==0):
m=min(m,(time-60*i-j)//x)
imin=i
jmin=j
if(fl==1 and 60*i+j>time and (24*60+time-60*i-j)%x==0):
m=min(m,(24*60+time-60*i-j)//x)
imin=i
jmin=j
print(m) | inp=lambda:map(int,input().split())
x=int(input())
h,m=inp()
time=y*60+m
m=10**10
a=[0]*4
for i in range(1,25):
for j in range(60):
a[0]=i%10; a[1]=i//10; a[2]=j%10; a[3]=j//10;
fl=0
for k in range(0,4):
if(a[k]==7): fl=1;break
if(fl==1 and 60*i+j<=time and (time-60*i-j)%x==0):
m=min(m,(time-60*i-j)//x)
imin=i
jmin=j
if(fl==1 and 60*i+j>time and (24*60+time-60*i-j)%x==0):
m=min(m,(24*60+time-60*i-j)//x)
imin=i
jmin=j
print(m) | time=y*60+m | 4 | statement |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.