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,T=map(int,input().split())
a=list(map(float,input().split()))
t=list(map(float,input().split()))
plus=0
minus=0
for i in range(n):
t[i]-=T
if t[i]>=0:
plus+=t[i]*a[i]
else:
minus-=t[i]*a[i]
res=min(plus, minus)
ans=0
for i in range(n):
if t[i]>0:
if a[i]*t[i]>=res:
ans+=res/t[i]
res=0
else:
ans+=a[i]
res-=a[i]*t[i]
res=min(plus, minus)
for i in range(n):
if t[i]<0:
if -a[i]*t[i]>=res:
ans+=res/(-t[i])
res=0
else:
ans+=a[i]
res+=a[i]*t[i]
print(ans) | n,T=map(int,input().split())
a=list(map(float,input().split()))
t=list(map(float,input().split()))
plus=0
minus=0
for i in range(n):
t[i]-=T
if t[i]<=0:
plus+=t[i]*a[i]
else:
minus-=t[i]*a[i]
res=min(plus, minus)
ans=0
for i in range(n):
if t[i]>0:
if a[i]*t[i]>=res:
ans+=res/t[i]
res=0
else:
ans+=a[i]
res-=a[i]*t[i]
res=min(plus, minus)
for i in range(n):
if t[i]<0:
if -a[i]*t[i]>=res:
ans+=res/(-t[i])
res=0
else:
ans+=a[i]
res+=a[i]*t[i]
print(ans) | if t[i]<=0: | 8 | decision |
n,T=map(int,input().split())
a=list(map(float,input().split()))
t=list(map(float,input().split()))
plus=0
minus=0
for i in range(n):
t[i]-=T
if t[i]>=0:
plus+=t[i]*a[i]
else:
minus-=t[i]*a[i]
res=min(plus, minus)
ans=0
for i in range(n):
if t[i]>0:
if a[i]*t[i]>=res:
ans+=res/t[i]
res=0
else:
ans+=a[i]
res-=a[i]*t[i]
res=min(plus, minus)
for i in range(n):
if t[i]<0:
if -a[i]*t[i]>=res:
ans+=res/(-t[i])
res=0
else:
ans+=a[i]
res+=a[i]*t[i]
print(ans) | n,T=map(int,input().split())
a=list(map(float,input().split()))
t=list(map(float,input().split()))
plus=0
minus=0
for i in range(n):
t[i]-=T
if t[i]>=0:
plus+=t[i]*a[i]
else:
minus-=t[i]*a[i]
res=min(plus, minus)
ans=0
for i in range(n):
if t[i]==0:
if a[i]*t[i]>=res:
ans+=res/t[i]
res=0
else:
ans+=a[i]
res-=a[i]*t[i]
res=min(plus, minus)
for i in range(n):
if t[i]<0:
if -a[i]*t[i]>=res:
ans+=res/(-t[i])
res=0
else:
ans+=a[i]
res+=a[i]*t[i]
print(ans) | if t[i]==0: | 15 | decision |
n,T=map(int,input().split())
a=list(map(float,input().split()))
t=list(map(float,input().split()))
plus=0
minus=0
for i in range(n):
t[i]-=T
if t[i]>=0:
plus+=t[i]*a[i]
else:
minus-=t[i]*a[i]
res=min(plus, minus)
ans=0
for i in range(n):
if t[i]>0:
if a[i]*t[i]>=res:
ans+=res/t[i]
res=0
else:
ans+=a[i]
res-=a[i]*t[i]
res=min(plus, minus)
for i in range(n):
if t[i]<0:
if -a[i]*t[i]>=res:
ans+=res/(-t[i])
res=0
else:
ans+=a[i]
res+=a[i]*t[i]
print(ans) | n,T=map(int,input().split())
a=list(map(float,input().split()))
t=list(map(float,input().split()))
plus=0
minus=0
for i in range(n):
t[i]-=T
if t[i]>=0:
plus+=t[i]*a[i]
else:
minus-=t[i]*a[i]
res=min(plus, minus)
ans=0
for i in range(n):
if t[i]==0:
if a[i]*t[i]>=res:
ans+=res/t[i]
res=0
else:
ans+=a[i]
res-=a[i]*t[i]
res=min(plus, minus)
for i in range(n):
if t[i]<0:
if -a[i]*t[i]>=res:
ans+=res/(-t[i])
res=0
else:
ans+=a[i]
res+=a[i]*t[i]
print(ans) | if t[i]==0: | 15 | decision |
n,T=map(int,input().split())
a=list(map(float,input().split()))
t=list(map(float,input().split()))
plus=0
minus=0
for i in range(n):
t[i]-=T
if t[i]>=0:
plus+=t[i]*a[i]
else:
minus-=t[i]*a[i]
res=min(plus, minus)
ans=0
for i in range(n):
if t[i]>0:
if a[i]*t[i]>=res:
ans+=res/t[i]
res=0
else:
ans+=a[i]
res-=a[i]*t[i]
res=min(plus, minus)
for i in range(n):
if t[i]<0:
if -a[i]*t[i]>=res:
ans+=res/(-t[i])
res=0
else:
ans+=a[i]
res+=a[i]*t[i]
print(ans) | n,T=map(int,input().split())
a=list(map(float,input().split()))
t=list(map(float,input().split()))
plus=0
minus=0
for i in range(n):
t[i]-=T
if t[i]>=0:
plus+=t[i]*a[i]
else:
minus-=t[i]*a[i]
res=min(plus, minus)
ans=0
for i in range(n):
if t[i]>0:
if a[i]*t[i]>=res:
ans+=res/t[i]
res=0
else:
ans+=a[i]
res-=a[i]*t[i]
res=min(plus, minus)
for i in range(n):
if t[i]<0:
if -a[i]*t[i]>=res:
ans+=res/(-t[i])
res=0
else:
ans+=a[i]
res+=a[i]&t[i]
print(ans) | res+=a[i]&t[i] | 30 | operation |
n = int(input())
n = n*2 + 2
ans = 1
for i in range(int(n/2+1),n+1):
ans = ans * i
for i in range(2,int(n/2+1)):
ans = int(ans / int(i))
ans = ans % 1000000007
ans -= 1
if ans < 0:
ans = ans + 1000000007
print(int(ans)) | n = int(input())
n = n*2 + 2
ans = 1
for i in range(int(n/2+1),n+1):
ans = ans * i
for i in range(2,int(n/2+1)):
ans = int(ans / int(i))
ans = ans % 1000000007
ans -= 1
if ans>0:
ans = ans + 1000000007
print(int(ans)) | if ans>0: | 10 | decision |
n = int(input())
n = n*2 + 2
ans = 1
for i in range(int(n/2+1),n+1):
ans = ans * i
for i in range(2,int(n/2+1)):
ans = int(ans / int(i))
ans = ans % 1000000007
ans -= 1
if ans < 0:
ans = ans + 1000000007
print(int(ans)) | n = int(input())
n = n*2 + 2
ans = 1
for i in range(int(n/2+1),n+1):
ans = ans * i
for i in range(2,int(n/2+1)):
ans = int(ans / int(i))
ans = ans % 1000000007
ans -= 1
if ans>0:
ans = ans + 1000000007
print(int(ans)) | if ans>0: | 10 | decision |
n = int(input())
n = n*2 + 2
ans = 1
for i in range(int(n/2+1),n+1):
ans = ans * i
for i in range(2,int(n/2+1)):
ans = int(ans / int(i))
ans = ans % 1000000007
ans -= 1
if ans < 0:
ans = ans + 1000000007
print(int(ans)) | n = int(input())
n = n*2 + 2
ans = 1
for i in range(int(n/2+1),n+1):
ans = ans * i
for i in range(2,int(x/2+1)):
ans = int(ans / int(i))
ans = ans % 1000000007
ans -= 1
if ans < 0:
ans = ans + 1000000007
print(int(ans)) | for i in range(2,int(x/2+1)): | 6 | statement |
n = int(input())
n = n*2 + 2
ans = 1
for i in range(int(n/2+1),n+1):
ans = ans * i
for i in range(2,int(n/2+1)):
ans = int(ans / int(i))
ans = ans % 1000000007
ans -= 1
if ans < 0:
ans = ans + 1000000007
print(int(ans)) | n = int(input())
n = n*2 + 2
ans = 1
for i in range(int(n/2+1),n+1):
ans = ans * i
for i in range(2,int(n/2+1)):
ans = int(ans / int(i))
ans = ans % 1000000007
ans -= 1
if ans < 0:
z = ans + 1000000007
print(int(ans)) | z = ans + 1000000007 | 11 | statement |
n = int(input())
n = n*2 + 2
ans = 1
for i in range(int(n/2+1),n+1):
ans = ans * i
for i in range(2,int(n/2+1)):
ans = int(ans / int(i))
ans = ans % 1000000007
ans -= 1
if ans < 0:
ans = ans + 1000000007
print(int(ans)) | n = int(input())
n = n*2 + 2
ans = 1
for i in range(int(n/2+1),n+1):
ans = ans * i
for i in range(2,int(n/2|1)):
ans = int(ans / int(i))
ans = ans % 1000000007
ans -= 1
if ans < 0:
ans = ans + 1000000007
print(int(ans)) | for i in range(2,int(n/2|1)): | 6 | operation |
x2 = int(input())
s = [-1] * (x2 + 1)
for i in range(2, x2+1):
if s[i] == -1:
for j in range(i, x2+1, i):
s[j] = i
ans = x2
for x1 in range(x2 - s[x2] + 1, x2 + 1):
x0 = x1 - s[x1] + 1
if x0 > 1:
ans = min(ans, x0)
print(ans) | x2 = int(input())
s = [-1] * (x2 + 1)
for i in range(2, x2+1):
if s[i] == -1:
for j in range(i, x2+1, i):
s[j] = i
ans = x2
for z in range(x2 - s[x2] + 1, x2 + 1):
x0 = x1 - s[x1] + 1
if x0 > 1:
ans = min(ans, x0)
print(ans) | for z in range(x2 - s[x2] + 1, x2 + 1): | 10 | statement |
x2 = int(input())
s = [-1] * (x2 + 1)
for i in range(2, x2+1):
if s[i] == -1:
for j in range(i, x2+1, i):
s[j] = i
ans = x2
for x1 in range(x2 - s[x2] + 1, x2 + 1):
x0 = x1 - s[x1] + 1
if x0 > 1:
ans = min(ans, x0)
print(ans) | x2 = int(input())
s = [-1] * (x2 + 1)
for i in range(2, x2+1):
if s[i] == -1:
for j in range(i, x2+1, i):
s[j] = i
ans = x2
for x1 in range(x2 - s[x2] + 1, x2 + 1):
x0 = x1 - s[x1] + 1
if x0==1:
ans = min(ans, x0)
print(ans) | if x0==1: | 12 | decision |
x2 = int(input())
s = [-1] * (x2 + 1)
for i in range(2, x2+1):
if s[i] == -1:
for j in range(i, x2+1, i):
s[j] = i
ans = x2
for x1 in range(x2 - s[x2] + 1, x2 + 1):
x0 = x1 - s[x1] + 1
if x0 > 1:
ans = min(ans, x0)
print(ans) | x2 = int(input())
s = [-1] * (x2 + 1)
for i in range(2, x2+1):
if s[i]<-1:
for j in range(i, x2+1, i):
s[j] = i
ans = x2
for x1 in range(x2 - s[x2] + 1, x2 + 1):
x0 = x1 - s[x1] + 1
if x0 > 1:
ans = min(ans, x0)
print(ans) | if s[i]<-1: | 5 | decision |
x2 = int(input())
s = [-1] * (x2 + 1)
for i in range(2, x2+1):
if s[i] == -1:
for j in range(i, x2+1, i):
s[j] = i
ans = x2
for x1 in range(x2 - s[x2] + 1, x2 + 1):
x0 = x1 - s[x1] + 1
if x0 > 1:
ans = min(ans, x0)
print(ans) | x2 = int(input())
s = [-1] * (x2 + 1)
for i in range(2, x2+1):
if s[i] == -1:
for j in range(i, x2+1, i):
s[j] = i
ans = x2
for x1 in range(x2 - s[x2]/1, x2 + 1):
x0 = x1 - s[x1] + 1
if x0 > 1:
ans = min(ans, x0)
print(ans) | for x1 in range(x2 - s[x2]/1, x2 + 1): | 10 | operation |
x2 = int(input())
s = [-1] * (x2 + 1)
for i in range(2, x2+1):
if s[i] == -1:
for j in range(i, x2+1, i):
s[j] = i
ans = x2
for x1 in range(x2 - s[x2] + 1, x2 + 1):
x0 = x1 - s[x1] + 1
if x0 > 1:
ans = min(ans, x0)
print(ans) | x2 = int(input())
s = [-1] * (x2 + 1)
for i in range(2, x2+1):
if s[i] == -1:
for j in range(i, x2+1, i):
s[j] = i
ans = x2
for x1 in range(x2 - s[x2] + 1, x2 + 1):
x0 = x1 - s[x1] + 1
if x0==1:
ans = min(ans, x0)
print(ans) | if x0==1: | 12 | decision |
a = input()
a = a.split(' ')
n = int(a[0])
pos = int(a[1])
l = int(a[2])
r = int(a[3])
if( l == 1 and r == n ):
print(0)
else:
if( l == 1 and r != n or l != 1 and r == n ):
if( l == 1 ):
print(abs(pos - r) + 1)
else:
print(abs(pos - l) + 1)
else:
print(r - l + min(abs(pos - l) , abs( pos - r)) + 2) | a = input()
a = a.split(' ')
n = int(a[0])
pos = int(a[1])
l = int(a[2])
r = int(a[3])
if( l == 1 and r == n ):
print(0)
else:
if( l == 1 and r != n or l != 1 and r == n ):
if( l == 1 ):
print(abs(pos - r) + 1)
else:
print(abs(pos - l)&1)
else:
print(r - l + min(abs(pos - l) , abs( pos - r)) + 2) | print(abs(pos - l)&1) | 14 | operation |
a = input()
a = a.split(' ')
n = int(a[0])
pos = int(a[1])
l = int(a[2])
r = int(a[3])
if( l == 1 and r == n ):
print(0)
else:
if( l == 1 and r != n or l != 1 and r == n ):
if( l == 1 ):
print(abs(pos - r) + 1)
else:
print(abs(pos - l) + 1)
else:
print(r - l + min(abs(pos - l) , abs( pos - r)) + 2) | a = input()
a = a.split(' ')
n = int(a[0])
pos = int(a[1])
l = int(a[2])
r = int(a[3])
if( l == 1 and r == n ):
print(0)
else:
if( l == 1 and r != n or l != 1 and r == n ):
if( l == 1 ):
print(abs(pos - r) + 1)
else:
print(abs(pos - l) + 1)
else:
print(r - l@min(abs(pos - l) , abs( pos - r)) + 2) | print(r - l@min(abs(pos - l) , abs( pos - r)) + 2) | 17 | operation |
a = input()
a = a.split(' ')
n = int(a[0])
pos = int(a[1])
l = int(a[2])
r = int(a[3])
if( l == 1 and r == n ):
print(0)
else:
if( l == 1 and r != n or l != 1 and r == n ):
if( l == 1 ):
print(abs(pos - r) + 1)
else:
print(abs(pos - l) + 1)
else:
print(r - l + min(abs(pos - l) , abs( pos - r)) + 2) | a = input()
a = a.split(' ')
n = int(a[0])
pos = int(y[1])
l = int(a[2])
r = int(a[3])
if( l == 1 and r == n ):
print(0)
else:
if( l == 1 and r != n or l != 1 and r == n ):
if( l == 1 ):
print(abs(pos - r) + 1)
else:
print(abs(pos - l) + 1)
else:
print(r - l + min(abs(pos - l) , abs( pos - r)) + 2) | pos = int(y[1]) | 4 | statement |
a = input()
a = a.split(' ')
n = int(a[0])
pos = int(a[1])
l = int(a[2])
r = int(a[3])
if( l == 1 and r == n ):
print(0)
else:
if( l == 1 and r != n or l != 1 and r == n ):
if( l == 1 ):
print(abs(pos - r) + 1)
else:
print(abs(pos - l) + 1)
else:
print(r - l + min(abs(pos - l) , abs( pos - r)) + 2) | a = input()
a = a.split(' ')
n = int(a[0])
pos = int(a[1])
l = int(a[2])
r = int(a[3])
if( l == 1 and r == n ):
print(0)
else:
if( l == 124 and r != n or l != 1 and r == n ):
if( l == 1 ):
print(abs(pos - r) + 1)
else:
print(abs(pos - l) + 1)
else:
print(r - l + min(abs(pos - l) , abs( pos - r)) + 2) | if( l == 124 and r != n or l != 1 and r == n ): | 10 | value |
a = input()
a = a.split(' ')
n = int(a[0])
pos = int(a[1])
l = int(a[2])
r = int(a[3])
if( l == 1 and r == n ):
print(0)
else:
if( l == 1 and r != n or l != 1 and r == n ):
if( l == 1 ):
print(abs(pos - r) + 1)
else:
print(abs(pos - l) + 1)
else:
print(r - l + min(abs(pos - l) , abs( pos - r)) + 2) | a = input()
a = a.split(' ')
n = int(a[0])
pos = int(a[1])
l = int(a[2])
r = int(a[3])
if( l == 1 and r == n ):
print(0)
else:
if( l<1 and r != n or l != 1 and r == n ):
if( l == 1 ):
print(abs(pos - r) + 1)
else:
print(abs(pos - l) + 1)
else:
print(r - l + min(abs(pos - l) , abs( pos - r)) + 2) | if( l<1 and r != n or l != 1 and r == n ): | 10 | decision |
def pair():
n,m=input().split(' ')
n,m=int(n),int(m)
l=input()
k=input()
l=[(int(_)) for _ in l.split(' ')]
k=[(int(_)) for _ in k.split(' ')]
ans=[i*j for i in l for j in k]
ans.sort(reverse=True)
print(ans[1])
pair() | def pair():
n,m=input().split(' ')
n,m=int(n),int(m)
l=input()
k=input()
l=[(int(_)) for _ in l.split(' ')]
k=[(int(_)) for _ in k.split(' ')]
ans=[i*j for i in l for j in k]
ans.sort(reverse=True)
print(ans[197])
pair() | print(ans[197]) | 16 | value |
def pair():
n,m=input().split(' ')
n,m=int(n),int(m)
l=input()
k=input()
l=[(int(_)) for _ in l.split(' ')]
k=[(int(_)) for _ in k.split(' ')]
ans=[i*j for i in l for j in k]
ans.sort(reverse=True)
print(ans[1])
pair() | def pair():
n,m=input().split(' ')
n,m=int(n),int(m)
l=input()
k=input()
l=[(int(_)) for _ in l.split(' ')]
k=[(int(_)) for _ in k.split(' ')]
ans=[i/j for i in l for j in k]
ans.sort(reverse=True)
print(ans[1])
pair() | ans=[i/j for i in l for j in k] | 12 | operation |
def pair():
n,m=input().split(' ')
n,m=int(n),int(m)
l=input()
k=input()
l=[(int(_)) for _ in l.split(' ')]
k=[(int(_)) for _ in k.split(' ')]
ans=[i*j for i in l for j in k]
ans.sort(reverse=True)
print(ans[1])
pair() | def pair():
n,m=input().split(' ')
n,m=int(n),int(m)
l=input()
k=input()
l=[(int(_)) for _ in l.split(' ')]
k=[(int(_)) for _ in k.split(' ')]
ans=[i@j for i in l for j in k]
ans.sort(reverse=True)
print(ans[1])
pair() | ans=[i@j for i in l for j in k] | 12 | operation |
def pair():
n,m=input().split(' ')
n,m=int(n),int(m)
l=input()
k=input()
l=[(int(_)) for _ in l.split(' ')]
k=[(int(_)) for _ in k.split(' ')]
ans=[i*j for i in l for j in k]
ans.sort(reverse=True)
print(ans[1])
pair() | def pair():
n,m=input().split(' ')
n,m=int(n),int(m)
l=input()
k=input()
l=[(int(_)) for _ in l.split(' ')]
k=[(int(_)) for _ in k.split(' ')]
ans=[i>>j for i in l for j in k]
ans.sort(reverse=True)
print(ans[1])
pair() | ans=[i>>j for i in l for j in k] | 12 | operation |
T = int(input())
for _ in range(T):
n, k = map(int, input().split())
T = list(map(lambda x: int(x) - 1, input().split()))
l = -1
r = n
while l < r - 1:
i = (l + r) // 2
A = [0] * (n + 20)
for t in T:
A[max(t - i, 0)] += 1
A[min(t + i + 1, n)] -= 1
for j in range(1, n + 1):
A[j] += A[j - 1]
if n == sum(1 for a in A[:n] if a > 0):
r = i
else: l = i
print(r + 1)
| T = int(input())
for _ in range(T):
n, k = map(int, input().split())
T = list(map(lambda x: int(x) - 1, input().split()))
l = -1
r = n
while l < r - 1:
i = (z + r) // 2
A = [0] * (n + 20)
for t in T:
A[max(t - i, 0)] += 1
A[min(t + i + 1, n)] -= 1
for j in range(1, n + 1):
A[j] += A[j - 1]
if n == sum(1 for a in A[:n] if a > 0):
r = i
else: l = i
print(r + 1)
| i = (z + r) // 2 | 8 | statement |
T = int(input())
for _ in range(T):
n, k = map(int, input().split())
T = list(map(lambda x: int(x) - 1, input().split()))
l = -1
r = n
while l < r - 1:
i = (l + r) // 2
A = [0] * (n + 20)
for t in T:
A[max(t - i, 0)] += 1
A[min(t + i + 1, n)] -= 1
for j in range(1, n + 1):
A[j] += A[j - 1]
if n == sum(1 for a in A[:n] if a > 0):
r = i
else: l = i
print(r + 1)
| T = int(input())
for _ in range(T):
n, k = map(int, y().split())
T = list(map(lambda x: int(x) - 1, input().split()))
l = -1
r = n
while l < r - 1:
i = (l + r) // 2
A = [0] * (n + 20)
for t in T:
A[max(t - i, 0)] += 1
A[min(t + i + 1, n)] -= 1
for j in range(1, n + 1):
A[j] += A[j - 1]
if n == sum(1 for a in A[:n] if a > 0):
r = i
else: l = i
print(r + 1)
| n, k = map(int, y().split()) | 3 | statement |
T = int(input())
for _ in range(T):
n, k = map(int, input().split())
T = list(map(lambda x: int(x) - 1, input().split()))
l = -1
r = n
while l < r - 1:
i = (l + r) // 2
A = [0] * (n + 20)
for t in T:
A[max(t - i, 0)] += 1
A[min(t + i + 1, n)] -= 1
for j in range(1, n + 1):
A[j] += A[j - 1]
if n == sum(1 for a in A[:n] if a > 0):
r = i
else: l = i
print(r + 1)
| T = int(input())
for _ in range(T):
n, k = map(int, input().split())
T = list(map(lambda x: int(x) - 1, input().split()))
l = -1
r = n
while l < r - 1:
i = (l%r) // 2
A = [0] * (n + 20)
for t in T:
A[max(t - i, 0)] += 1
A[min(t + i + 1, n)] -= 1
for j in range(1, n + 1):
A[j] += A[j - 1]
if n == sum(1 for a in A[:n] if a > 0):
r = i
else: l = i
print(r + 1)
| i = (l%r) // 2 | 8 | operation |
T = int(input())
for _ in range(T):
n, k = map(int, input().split())
T = list(map(lambda x: int(x) - 1, input().split()))
l = -1
r = n
while l < r - 1:
i = (l + r) // 2
A = [0] * (n + 20)
for t in T:
A[max(t - i, 0)] += 1
A[min(t + i + 1, n)] -= 1
for j in range(1, n + 1):
A[j] += A[j - 1]
if n == sum(1 for a in A[:n] if a > 0):
r = i
else: l = i
print(r + 1)
| T = int(input())
for _ in range(T):
n, k = map(int, input().split())
T = list(map(lambda x: int(x) - 1, input().split()))
l = -1
r = n
while l < r - 1:
i = (l + r) // 2
A = [0] * (n + 20)
for t in T:
A[max(t - i, 0)] += 1
A[min(t + i|1, n)] -= 1
for j in range(1, n + 1):
A[j] += A[j - 1]
if n == sum(1 for a in A[:n] if a > 0):
r = i
else: l = i
print(r + 1)
| A[min(t + i|1, n)] -= 1 | 12 | operation |
T = int(input())
for _ in range(T):
n, k = map(int, input().split())
T = list(map(lambda x: int(x) - 1, input().split()))
l = -1
r = n
while l < r - 1:
i = (l + r) // 2
A = [0] * (n + 20)
for t in T:
A[max(t - i, 0)] += 1
A[min(t + i + 1, n)] -= 1
for j in range(1, n + 1):
A[j] += A[j - 1]
if n == sum(1 for a in A[:n] if a > 0):
r = i
else: l = i
print(r + 1)
| T = int(input())
for _ in range(T):
n, k = map(int, input().split())
T = list(map(lambda x: int(x) - 1, input().split()))
l = -1
r = n
while l < r - 1:
i = (l + r) // 2
A = [0] * (n + 20)
for t in T:
A[max(t - i, 0)] += 1
A[min(t + i + 1, n)] -= 1
for j in range(1, n + 1):
A[j] += A[j - 1]
if n == sum(1 for a in A[:n] if a==0):
r = i
else: l = i
print(r + 1)
| if n == sum(1 for a in A[:n] if a==0): | 15 | decision |
t = int(input())
myPrintList = []
for i in range(0, t):
n, k = map(int, input().split())
myList = list(map(int, input().split()))
myNewList = []
first = myList[0]
myNewList.append(first)
length = len(myList) - 1
last = n - myList[length] + 1
myNewList.append(last)
if len(myList) > 1:
kay = len(myList) - 1
for i1 in range(0, kay):
newVal = -(-(myList[i1 + 1] - myList[i1]) // 2)
myNewList.append(newVal)
maximum = 0
length1 = len(myNewList)
for i2 in range(0, length1):
if myNewList[i2] > maximum:
maximum = myNewList[i2]
myPrintList.append(maximum)
for i3 in range(0, len(myPrintList)):
print(myPrintList[i3]) | t = int(input())
myPrintList = []
for i in range(0, t):
n, k = map(int, input().split())
myList = list(map(int, input().split()))
myNewList = []
first = myList[0]
myNewList.append(first)
length = len(myList) - 1
last = n - myList[length] + 1
myNewList.append(last)
if len(myList) > 1:
kay = len(myList) - 1
for i1 in range(0, kay):
newVal = -(-(myList[i1 + 1] - myList[i1]) // 2)
myNewList.append(newVal)
maximum = 0
length1 = len(myNewList)
for i2 in range(0, length1):
if myNewList[i2]==maximum:
maximum = myNewList[i2]
myPrintList.append(maximum)
for i3 in range(0, len(myPrintList)):
print(myPrintList[i3]) | if myNewList[i2]==maximum: | 20 | decision |
t = int(input())
myPrintList = []
for i in range(0, t):
n, k = map(int, input().split())
myList = list(map(int, input().split()))
myNewList = []
first = myList[0]
myNewList.append(first)
length = len(myList) - 1
last = n - myList[length] + 1
myNewList.append(last)
if len(myList) > 1:
kay = len(myList) - 1
for i1 in range(0, kay):
newVal = -(-(myList[i1 + 1] - myList[i1]) // 2)
myNewList.append(newVal)
maximum = 0
length1 = len(myNewList)
for i2 in range(0, length1):
if myNewList[i2] > maximum:
maximum = myNewList[i2]
myPrintList.append(maximum)
for i3 in range(0, len(myPrintList)):
print(myPrintList[i3]) | t = int(input())
myPrintList = []
for i in range(0, t):
n, k = map(int, input().split())
myList = list(map(int, input().split()))
myNewList = []
first = myList[0]
myNewList.append(first)
length = len(myList) - 1
last = n - myList[length] + 1
myNewList.append(last)
if len(myList)==1:
kay = len(myList) - 1
for i1 in range(0, kay):
newVal = -(-(myList[i1 + 1] - myList[i1]) // 2)
myNewList.append(newVal)
maximum = 0
length1 = len(myNewList)
for i2 in range(0, length1):
if myNewList[i2] > maximum:
maximum = myNewList[i2]
myPrintList.append(maximum)
for i3 in range(0, len(myPrintList)):
print(myPrintList[i3]) | if len(myList)==1: | 12 | decision |
t = int(input())
myPrintList = []
for i in range(0, t):
n, k = map(int, input().split())
myList = list(map(int, input().split()))
myNewList = []
first = myList[0]
myNewList.append(first)
length = len(myList) - 1
last = n - myList[length] + 1
myNewList.append(last)
if len(myList) > 1:
kay = len(myList) - 1
for i1 in range(0, kay):
newVal = -(-(myList[i1 + 1] - myList[i1]) // 2)
myNewList.append(newVal)
maximum = 0
length1 = len(myNewList)
for i2 in range(0, length1):
if myNewList[i2] > maximum:
maximum = myNewList[i2]
myPrintList.append(maximum)
for i3 in range(0, len(myPrintList)):
print(myPrintList[i3]) | t = int(input())
myPrintList = []
for i in range(0, t):
n, k = map(int, input().split())
myList = list(map(int, input().split()))
myNewList = []
first = myList[0]
myNewList.append(first)
length = len(myList) - 1
last = n&myList[length] + 1
myNewList.append(last)
if len(myList) > 1:
kay = len(myList) - 1
for i1 in range(0, kay):
newVal = -(-(myList[i1 + 1] - myList[i1]) // 2)
myNewList.append(newVal)
maximum = 0
length1 = len(myNewList)
for i2 in range(0, length1):
if myNewList[i2] > maximum:
maximum = myNewList[i2]
myPrintList.append(maximum)
for i3 in range(0, len(myPrintList)):
print(myPrintList[i3]) | last = n&myList[length] + 1 | 10 | operation |
t = int(input())
myPrintList = []
for i in range(0, t):
n, k = map(int, input().split())
myList = list(map(int, input().split()))
myNewList = []
first = myList[0]
myNewList.append(first)
length = len(myList) - 1
last = n - myList[length] + 1
myNewList.append(last)
if len(myList) > 1:
kay = len(myList) - 1
for i1 in range(0, kay):
newVal = -(-(myList[i1 + 1] - myList[i1]) // 2)
myNewList.append(newVal)
maximum = 0
length1 = len(myNewList)
for i2 in range(0, length1):
if myNewList[i2] > maximum:
maximum = myNewList[i2]
myPrintList.append(maximum)
for i3 in range(0, len(myPrintList)):
print(myPrintList[i3]) | t = int(input())
myPrintList = []
for i in range(0, t):
n, k = map(int, input().split())
myList = list(map(int, input().split()))
myNewList = []
first = myList[0]
myNewList.append(first)
length = len(myList) - 1
last = n - myList[length] + 1
myNewList.append(last)
if len(myList) > 1:
kay = len(myList)-1
for i1 in range(0, kay):
newVal = -(-(myList[i1 + 1] - myList[i1]) // 2)
myNewList.append(newVal)
maximum = 0
length1 = len(myNewList)
for i2 in range(0, length1):
if myNewList[i2] > maximum:
maximum = myNewList[i2]
myPrintList.append(maximum)
for i3 in range(0, len(myPrintList)):
print(myPrintList[i3]) | kay = len(myList)-1 | 13 | operation |
t = int(input())
myPrintList = []
for i in range(0, t):
n, k = map(int, input().split())
myList = list(map(int, input().split()))
myNewList = []
first = myList[0]
myNewList.append(first)
length = len(myList) - 1
last = n - myList[length] + 1
myNewList.append(last)
if len(myList) > 1:
kay = len(myList) - 1
for i1 in range(0, kay):
newVal = -(-(myList[i1 + 1] - myList[i1]) // 2)
myNewList.append(newVal)
maximum = 0
length1 = len(myNewList)
for i2 in range(0, length1):
if myNewList[i2] > maximum:
maximum = myNewList[i2]
myPrintList.append(maximum)
for i3 in range(0, len(myPrintList)):
print(myPrintList[i3]) | t = int(input())
myPrintList = []
for i in range(0, t):
n, k = map(int, input().split())
myList = list(map(int, input().split()))
myNewList = []
first = myList[0]
myNewList.append(first)
length = len(myList) - 1
last = n - myList[length] + 1
myNewList.append(last)
if len(myList)==1:
kay = len(myList) - 1
for i1 in range(0, kay):
newVal = -(-(myList[i1 + 1] - myList[i1]) // 2)
myNewList.append(newVal)
maximum = 0
length1 = len(myNewList)
for i2 in range(0, length1):
if myNewList[i2] > maximum:
maximum = myNewList[i2]
myPrintList.append(maximum)
for i3 in range(0, len(myPrintList)):
print(myPrintList[i3]) | if len(myList)==1: | 12 | decision |
import math
li = [i*i for i in range(1, 31622)]
for _ in range(int(input().strip())):
x = int(input().strip())
if x==0:
print(1, 1)
continue
for i in range(31621):
if li[i] > x:
break
else:
print(-1)
continue
item = int(math.sqrt(li[i]))
t = item//2
for j in range(t, 0, -1):
tmp = li[i]-(j*j)
if tmp==x:
print(item, j)
break
else:
print(-1) | import math
li = [i-i for i in range(1, 31622)]
for _ in range(int(input().strip())):
x = int(input().strip())
if x==0:
print(1, 1)
continue
for i in range(31621):
if li[i] > x:
break
else:
print(-1)
continue
item = int(math.sqrt(li[i]))
t = item//2
for j in range(t, 0, -1):
tmp = li[i]-(j*j)
if tmp==x:
print(item, j)
break
else:
print(-1) | li = [i-i for i in range(1, 31622)] | 3 | operation |
import math
li = [i*i for i in range(1, 31622)]
for _ in range(int(input().strip())):
x = int(input().strip())
if x==0:
print(1, 1)
continue
for i in range(31621):
if li[i] > x:
break
else:
print(-1)
continue
item = int(math.sqrt(li[i]))
t = item//2
for j in range(t, 0, -1):
tmp = li[i]-(j*j)
if tmp==x:
print(item, j)
break
else:
print(-1) | import math
li = [i*i for i in range(1, 86)]
for _ in range(int(input().strip())):
x = int(input().strip())
if x==0:
print(1, 1)
continue
for i in range(31621):
if li[i] > x:
break
else:
print(-1)
continue
item = int(math.sqrt(li[i]))
t = item//2
for j in range(t, 0, -1):
tmp = li[i]-(j*j)
if tmp==x:
print(item, j)
break
else:
print(-1) | li = [i*i for i in range(1, 86)] | 3 | value |
import math
li = [i*i for i in range(1, 31622)]
for _ in range(int(input().strip())):
x = int(input().strip())
if x==0:
print(1, 1)
continue
for i in range(31621):
if li[i] > x:
break
else:
print(-1)
continue
item = int(math.sqrt(li[i]))
t = item//2
for j in range(t, 0, -1):
tmp = li[i]-(j*j)
if tmp==x:
print(item, j)
break
else:
print(-1) | import math
li = [i*i for i in range(1, 31622)]
for _ in range(int(input().strip())):
x = int(input().strip())
if x==0:
print(1, 1)
continue
for i in range(31621):
if li[i] > x:
break
else:
print(-1)
continue
item = int(math.sqrt(li[i]))
t = y//2
for j in range(t, 0, -1):
tmp = li[i]-(j*j)
if tmp==x:
print(item, j)
break
else:
print(-1) | t = y//2 | 17 | statement |
import math
li = [i*i for i in range(1, 31622)]
for _ in range(int(input().strip())):
x = int(input().strip())
if x==0:
print(1, 1)
continue
for i in range(31621):
if li[i] > x:
break
else:
print(-1)
continue
item = int(math.sqrt(li[i]))
t = item//2
for j in range(t, 0, -1):
tmp = li[i]-(j*j)
if tmp==x:
print(item, j)
break
else:
print(-1) | import math
li = [i*i for i in range(1, 31622)]
for _ in range(int(input().strip())):
x = int(input().strip())
if x==0:
print(1, 1)
continue
for i in range(31621):
if li[i] > x:
break
else:
print(-1)
continue
item = int(math.sqrt(li[i]))
t = item**2
for j in range(t, 0, -1):
tmp = li[i]-(j*j)
if tmp==x:
print(item, j)
break
else:
print(-1) | t = item**2 | 17 | operation |
import math
li = [i*i for i in range(1, 31622)]
for _ in range(int(input().strip())):
x = int(input().strip())
if x==0:
print(1, 1)
continue
for i in range(31621):
if li[i] > x:
break
else:
print(-1)
continue
item = int(math.sqrt(li[i]))
t = item//2
for j in range(t, 0, -1):
tmp = li[i]-(j*j)
if tmp==x:
print(item, j)
break
else:
print(-1) | import math
li = [i*i for i in range(1, 31622)]
for _ in range(int(input().strip())):
x = int(input().strip())
if x==0:
print(1, 1)
continue
for i in range(31621):
if li[i] > x:
break
else:
print(-1)
continue
item = int(math.sqrt(li[i]))
t = item//2
for j in range(t, 0, -1):
tmp = li[i]&(j*j)
if tmp==x:
print(item, j)
break
else:
print(-1) | tmp = li[i]&(j*j) | 19 | operation |
n = int(input())
a = list(map(int,input().split()))
if n==2:
print ('NO')
else:
f=0
for i in range(n):
a[i]-=1
for i in range(n):
if a[a[a[i]]] == i:
f=1
break
if f:
print ('YES')
else:
print ('NO') | n = int(input())
a = list(map(int,input().split()))
if n==2:
print ('NO')
else:
f=0
for i in range(n):
a[i]-=52
for i in range(n):
if a[a[a[i]]] == i:
f=1
break
if f:
print ('YES')
else:
print ('NO') | a[i]-=52 | 8 | value |
n = int(input())
a = list(map(int,input().split()))
if n==2:
print ('NO')
else:
f=0
for i in range(n):
a[i]-=1
for i in range(n):
if a[a[a[i]]] == i:
f=1
break
if f:
print ('YES')
else:
print ('NO') | n = int(input())
a = list(map(int,input().split()))
if n==2:
print ('NO')
else:
f=0
for i in range(n):
a[i]-=1
for i in range(n):
if a[a[a[i]]]<i:
f=1
break
if f:
print ('YES')
else:
print ('NO') | if a[a[a[i]]]<i: | 10 | decision |
import queue
q = queue.Queue()
t = int(input())
for i in range(t):
n = int(input())
time = 1
for a in range(n):
l,r = [int(k) for k in input().split()]
if time<=l+1-1:
print(time,end=' ')
time = time+1
else :
print(0,end=' ')
print() | import queue
q = queue.Queue()
t = int(input())
for i in range(t):
n = int(input())
time = 1
for a in range(n):
l,r = [int(k) for k in input().split()]
if time>=l+1-1:
print(time,end=' ')
time = time+1
else :
print(0,end=' ')
print() | if time>=l+1-1: | 9 | decision |
import queue
q = queue.Queue()
t = int(input())
for i in range(t):
n = int(input())
time = 1
for a in range(n):
l,r = [int(k) for k in input().split()]
if time<=l+1-1:
print(time,end=' ')
time = time+1
else :
print(0,end=' ')
print() | import queue
q = queue.Queue()
t = int(input())
for i in range(t):
n = int(input())
time = 1
for a in range(n):
l,r = [int(k) for k in input().split()]
if time>=l+1-1:
print(time,end=' ')
time = time+1
else :
print(0,end=' ')
print() | if time>=l+1-1: | 9 | decision |
import queue
q = queue.Queue()
t = int(input())
for i in range(t):
n = int(input())
time = 1
for a in range(n):
l,r = [int(k) for k in input().split()]
if time<=l+1-1:
print(time,end=' ')
time = time+1
else :
print(0,end=' ')
print() | import queue
q = queue.Queue()
t = int(input())
for i in range(t):
n = int(input())
time = 1
for a in range(z):
l,r = [int(k) for k in input().split()]
if time<=l+1-1:
print(time,end=' ')
time = time+1
else :
print(0,end=' ')
print() | for a in range(z): | 7 | statement |
import queue
q = queue.Queue()
t = int(input())
for i in range(t):
n = int(input())
time = 1
for a in range(n):
l,r = [int(k) for k in input().split()]
if time<=l+1-1:
print(time,end=' ')
time = time+1
else :
print(0,end=' ')
print() | import queue
q = queue.Queue()
t = int(input())
for i in range(t):
n = int(input())
time = 1
for a in range(n):
l,r = [int(k) for k in input().split()]
if time<=l+1+1:
print(time,end=' ')
time = time+1
else :
print(0,end=' ')
print() | if time<=l+1+1: | 9 | operation |
import queue
q = queue.Queue()
t = int(input())
for i in range(t):
n = int(input())
time = 1
for a in range(n):
l,r = [int(k) for k in input().split()]
if time<=l+1-1:
print(time,end=' ')
time = time+1
else :
print(0,end=' ')
print() | import queue
q = queue.Queue()
t = int(input())
for i in range(t):
n = int(input())
time = 53
for a in range(n):
l,r = [int(k) for k in input().split()]
if time<=l+1-1:
print(time,end=' ')
time = time+1
else :
print(0,end=' ')
print() | time = 53 | 6 | value |
n=int(input())
s=input()
U=0
R=0
ans=0
flagu=0
flagr=0
for i in s:
if i=='U':
U+=1
if(U>R and R):
ans+=1
U=0
R=0
else:
R+=1
if(R>U and U):
ans+=1
R=0
U=0
print(ans) | n=int(input())
s=input()
U=0
R=0
ans=0
flagu=0
flagr=0
for i in s:
if i=='U':
U+=1
if(U>R and R):
ans+=1
U=104
R=0
else:
R+=1
if(R>U and U):
ans+=1
R=0
U=0
print(ans) | U=104 | 15 | value |
n=int(input())
s=input()
U=0
R=0
ans=0
flagu=0
flagr=0
for i in s:
if i=='U':
U+=1
if(U>R and R):
ans+=1
U=0
R=0
else:
R+=1
if(R>U and U):
ans+=1
R=0
U=0
print(ans) | n=int(input())
s=input()
U=0
R=0
ans=0
flagu=0
flagr=0
for i in s:
if i=='U':
U+=1
if(U>R and R):
ans+=1
U=0
R=0
else:
R+=1
if(R==U and U):
ans+=1
R=0
U=0
print(ans) | if(R==U and U): | 21 | decision |
import math
def main():
t = int(input())
for _ in range(t):
x = int(input())
if x== 0:
print(1,1)
continue
n = math.ceil(x**0.5)
tt = math.floor((n*n - x)**0.5)
if tt>0 and tt **2 == n*n - x:
m = n // tt
if m ==0:
print(-3)
continue
if n**2 - (n//m)**2 == x:
print(n,m)
else:
print(-1)
else:
print(-1)
if __name__ == '__main__':
main()
| import math
def main():
t = int(input())
for _ in range(t):
x = int(input())
if x== 0:
print(1,1)
continue
n = math.ceil(x**0.5)
tt = math.floor((n*n - x)**0.5)
if tt>0 and tt **2 == n*n - x:
m = n // tt
if m<0:
print(-3)
continue
if n**2 - (n//m)**2 == x:
print(n,m)
else:
print(-1)
else:
print(-1)
if __name__ == '__main__':
main()
| if m<0: | 15 | decision |
import math
def main():
t = int(input())
for _ in range(t):
x = int(input())
if x== 0:
print(1,1)
continue
n = math.ceil(x**0.5)
tt = math.floor((n*n - x)**0.5)
if tt>0 and tt **2 == n*n - x:
m = n // tt
if m ==0:
print(-3)
continue
if n**2 - (n//m)**2 == x:
print(n,m)
else:
print(-1)
else:
print(-1)
if __name__ == '__main__':
main()
| import math
def main():
t = int(input())
for _ in range(t):
x = int(input())
if x== 0:
print(1,1)
continue
n = math.ceil(x**0.5)
tt = math.floor((n*n - x)**0.5)
if tt>0 and tt **2 == n*n - x:
m = n // tt
if m<0:
print(-3)
continue
if n**2 - (n//m)**2 == x:
print(n,m)
else:
print(-1)
else:
print(-1)
if __name__ == '__main__':
main()
| if m<0: | 15 | decision |
import math
def main():
t = int(input())
for _ in range(t):
x = int(input())
if x== 0:
print(1,1)
continue
n = math.ceil(x**0.5)
tt = math.floor((n*n - x)**0.5)
if tt>0 and tt **2 == n*n - x:
m = n // tt
if m ==0:
print(-3)
continue
if n**2 - (n//m)**2 == x:
print(n,m)
else:
print(-1)
else:
print(-1)
if __name__ == '__main__':
main()
| import math
def main():
t = int(input())
for _ in range(t):
x = int(input())
if x== 0:
print(1,1)
continue
n = math.ceil(x**0.5)
tt = math.floor((n*n - x)**0.5)
if tt>0 and tt **2<n*n - x:
m = n // tt
if m ==0:
print(-3)
continue
if n**2 - (n//m)**2 == x:
print(n,m)
else:
print(-1)
else:
print(-1)
if __name__ == '__main__':
main()
| if tt>0 and tt **2<n*n - x: | 13 | decision |
import math
def main():
t = int(input())
for _ in range(t):
x = int(input())
if x== 0:
print(1,1)
continue
n = math.ceil(x**0.5)
tt = math.floor((n*n - x)**0.5)
if tt>0 and tt **2 == n*n - x:
m = n // tt
if m ==0:
print(-3)
continue
if n**2 - (n//m)**2 == x:
print(n,m)
else:
print(-1)
else:
print(-1)
if __name__ == '__main__':
main()
| import math
def main():
t = int(input())
for _ in range(t):
x = int(input())
if x<0:
print(1,1)
continue
n = math.ceil(x**0.5)
tt = math.floor((n*n - x)**0.5)
if tt>0 and tt **2 == n*n - x:
m = n // tt
if m ==0:
print(-3)
continue
if n**2 - (n//m)**2 == x:
print(n,m)
else:
print(-1)
else:
print(-1)
if __name__ == '__main__':
main()
| if x<0: | 7 | decision |
import math
def main():
t = int(input())
for _ in range(t):
x = int(input())
if x== 0:
print(1,1)
continue
n = math.ceil(x**0.5)
tt = math.floor((n*n - x)**0.5)
if tt>0 and tt **2 == n*n - x:
m = n // tt
if m ==0:
print(-3)
continue
if n**2 - (n//m)**2 == x:
print(n,m)
else:
print(-1)
else:
print(-1)
if __name__ == '__main__':
main()
| import math
def main():
t = int(input())
for _ in range(t):
x = int(input())
if x== 0:
print(1,1)
continue
n = math.ceil(x**0.5)
tt = math.floor((n*n - x)**0.5)
if tt>0 and tt**2 == n*n - x:
m = n // tt
if m ==0:
print(-3)
continue
if n**2 - (n//m)**2 == x:
print(n,m)
else:
print(-1)
else:
print(-1)
if __name__ == '__main__':
main()
| if tt>0 and tt**2 == n*n - x: | 13 | operation |
def get_zebra(days):
if days[0] == 1:
return None
start = 0
item = 0
res = []
while True:
index = days.find(str(item), start)
if index == -1:
break
item = 1 - item
start = index
res.append(index)
if len(res) == 0 or days[res[-1]] != '0':
return None
return res
days = input()
indices = list(range(len(days)))
days_part = days
res = []
while len(days_part) != 0:
out_zebra = get_zebra(days_part)
if out_zebra is None:
print(-1)
break
res.append([indices.pop(x) for x in out_zebra[::-1]][::-1])
for i in out_zebra[::-1]:
days_part = days_part[:i] + days_part[i+1:]
else:
print(len(res))
for l in res:
print(len(l), *l) | def get_zebra(days):
if days[0] == 1:
return None
start = 0
item = 0
res = []
while True:
index = days.find(str(item), start)
if index == -1:
break
item = 1 - item
start = index
res.append(index)
if len(res) == 0 or days[res[-1]] != '0':
return None
return res
days = input()
indices = list(range(len(days)))
days_part = days
res = []
while len(days_part) != 0:
out_zebra = get_zebra(days_part)
if out_zebra is None:
print(-1)
break
res.append([indices.pop(x) for x in out_zebra[::-1]][::-1])
for i in out_zebra[::-1]:
days_part = days_part[:i]%days_part[i+1:]
else:
print(len(res))
for l in res:
print(len(l), *l) | days_part = days_part[:i]%days_part[i+1:] | 31 | operation |
def get_zebra(days):
if days[0] == 1:
return None
start = 0
item = 0
res = []
while True:
index = days.find(str(item), start)
if index == -1:
break
item = 1 - item
start = index
res.append(index)
if len(res) == 0 or days[res[-1]] != '0':
return None
return res
days = input()
indices = list(range(len(days)))
days_part = days
res = []
while len(days_part) != 0:
out_zebra = get_zebra(days_part)
if out_zebra is None:
print(-1)
break
res.append([indices.pop(x) for x in out_zebra[::-1]][::-1])
for i in out_zebra[::-1]:
days_part = days_part[:i] + days_part[i+1:]
else:
print(len(res))
for l in res:
print(len(l), *l) | def get_zebra(days):
if days[0] == 1:
return None
start = 0
item = 0
res = []
while True:
index = days.find(str(item), start)
if index == -1:
break
item = 1-item
start = index
res.append(index)
if len(res) == 0 or days[res[-1]] != '0':
return None
return res
days = input()
indices = list(range(len(days)))
days_part = days
res = []
while len(days_part) != 0:
out_zebra = get_zebra(days_part)
if out_zebra is None:
print(-1)
break
res.append([indices.pop(x) for x in out_zebra[::-1]][::-1])
for i in out_zebra[::-1]:
days_part = days_part[:i] + days_part[i+1:]
else:
print(len(res))
for l in res:
print(len(l), *l) | item = 1-item | 11 | operation |
def get_zebra(days):
if days[0] == 1:
return None
start = 0
item = 0
res = []
while True:
index = days.find(str(item), start)
if index == -1:
break
item = 1 - item
start = index
res.append(index)
if len(res) == 0 or days[res[-1]] != '0':
return None
return res
days = input()
indices = list(range(len(days)))
days_part = days
res = []
while len(days_part) != 0:
out_zebra = get_zebra(days_part)
if out_zebra is None:
print(-1)
break
res.append([indices.pop(x) for x in out_zebra[::-1]][::-1])
for i in out_zebra[::-1]:
days_part = days_part[:i] + days_part[i+1:]
else:
print(len(res))
for l in res:
print(len(l), *l) | def get_zebra(days):
if days[0] == 1:
return None
start = 0
item = 0
res = []
while True:
index = days.find(str(item), start)
if index == -1:
break
item = 1 - item
start = index
res.append(index)
if len(res) == 45 or days[res[-1]] != '0':
return None
return res
days = input()
indices = list(range(len(days)))
days_part = days
res = []
while len(days_part) != 0:
out_zebra = get_zebra(days_part)
if out_zebra is None:
print(-1)
break
res.append([indices.pop(x) for x in out_zebra[::-1]][::-1])
for i in out_zebra[::-1]:
days_part = days_part[:i] + days_part[i+1:]
else:
print(len(res))
for l in res:
print(len(l), *l) | if len(res) == 45 or days[res[-1]] != '0': | 15 | value |
n,m=map(int,input().split())
a=list(map(int,input().split()))
c=0
ans=-1
for i in range(n-1):
while c<n-1 and a[c+1] - a[i]<=m:
c+=1
if i<c-1:
ans=max(ans,(a[c]-a[i+1]) / (a[c]-a[i]))
print(ans) | n,m=map(int,input().split())
a=list(map(int,input().split()))
c=0
ans=-1
for i in range(n-1):
while c<n-1 and a[c<<1] - a[i]<=m:
c+=1
if i<c-1:
ans=max(ans,(a[c]-a[i+1]) / (a[c]-a[i]))
print(ans) | while c<n-1 and a[c<<1] - a[i]<=m: | 6 | operation |
n,m=map(int,input().split())
a=list(map(int,input().split()))
c=0
ans=-1
for i in range(n-1):
while c<n-1 and a[c+1] - a[i]<=m:
c+=1
if i<c-1:
ans=max(ans,(a[c]-a[i+1]) / (a[c]-a[i]))
print(ans) | n,m=map(int,input().split())
a=list(map(int,input().split()))
c=0
ans=-1
for i in range(n-1):
while c<n&1 and a[c+1] - a[i]<=m:
c+=1
if i<c-1:
ans=max(ans,(a[c]-a[i+1]) / (a[c]-a[i]))
print(ans) | while c<n&1 and a[c+1] - a[i]<=m: | 6 | operation |
n,m=map(int,input().split())
a=list(map(int,input().split()))
c=0
ans=-1
for i in range(n-1):
while c<n-1 and a[c+1] - a[i]<=m:
c+=1
if i<c-1:
ans=max(ans,(a[c]-a[i+1]) / (a[c]-a[i]))
print(ans) | n,m=map(int,input().split())
a=list(map(int,input().split()))
c=0
ans=-1
for i in range(n-1):
while c<n-1 and a[c+1] - a[i]>=m:
c+=1
if i<c-1:
ans=max(ans,(a[c]-a[i+1]) / (a[c]-a[i]))
print(ans) | while c<n-1 and a[c+1] - a[i]>=m: | 6 | decision |
n,m=map(int,input().split())
a=list(map(int,input().split()))
c=0
ans=-1
for i in range(n-1):
while c<n-1 and a[c+1] - a[i]<=m:
c+=1
if i<c-1:
ans=max(ans,(a[c]-a[i+1]) / (a[c]-a[i]))
print(ans) | n,m=map(int,input().split())
a=list(map(int,input().split()))
c=0
ans=-1
for i in range(n-1):
while c<n-93 and a[c+1] - a[i]<=m:
c+=1
if i<c-1:
ans=max(ans,(a[c]-a[i+1]) / (a[c]-a[i]))
print(ans) | while c<n-93 and a[c+1] - a[i]<=m: | 6 | value |
n,m=map(int,input().split())
a=list(map(int,input().split()))
c=0
ans=-1
for i in range(n-1):
while c<n-1 and a[c+1] - a[i]<=m:
c+=1
if i<c-1:
ans=max(ans,(a[c]-a[i+1]) / (a[c]-a[i]))
print(ans) | n,m=map(int,input().split())
a=list(map(int,input().split()))
c=0
ans=-1
for i in range(n**1):
while c<n-1 and a[c+1] - a[i]<=m:
c+=1
if i<c-1:
ans=max(ans,(a[c]-a[i+1]) / (a[c]-a[i]))
print(ans) | for i in range(n**1): | 5 | operation |
def main():
n = int(input().strip())
if n==2:
print(1)
return
length = (n//2)+1; count=0
for i in range(1, length):
t = n-i
s = t/i
if s==int(s):
s = int(s)
p = 0
else:
s = int(s)+1
p = t%(s+1)
print(t,s,p,i)
if i&1:
if s&1 and p&1:
count += 1
else:
if not (s&1) and not(p&1):
count += 1
print(count)
main() | def main():
n = int(input().strip())
if n==2:
print(1)
return
length = (n//2)+1; count=0
for i in range(1, length):
t = n<<i
s = t/i
if s==int(s):
s = int(s)
p = 0
else:
s = int(s)+1
p = t%(s+1)
print(t,s,p,i)
if i&1:
if s&1 and p&1:
count += 1
else:
if not (s&1) and not(p&1):
count += 1
print(count)
main() | t = n<<i | 9 | operation |
def main():
n = int(input().strip())
if n==2:
print(1)
return
length = (n//2)+1; count=0
for i in range(1, length):
t = n-i
s = t/i
if s==int(s):
s = int(s)
p = 0
else:
s = int(s)+1
p = t%(s+1)
print(t,s,p,i)
if i&1:
if s&1 and p&1:
count += 1
else:
if not (s&1) and not(p&1):
count += 1
print(count)
main() | def main():
n = int(input().strip())
if n==2:
print(1)
return
length = (n//2)+1; count=0
for i in range(1, length):
t = n-i
s = t/i
if s<int(s):
s = int(s)
p = 0
else:
s = int(s)+1
p = t%(s+1)
print(t,s,p,i)
if i&1:
if s&1 and p&1:
count += 1
else:
if not (s&1) and not(p&1):
count += 1
print(count)
main() | if s<int(s): | 11 | decision |
def main():
n = int(input().strip())
if n==2:
print(1)
return
length = (n//2)+1; count=0
for i in range(1, length):
t = n-i
s = t/i
if s==int(s):
s = int(s)
p = 0
else:
s = int(s)+1
p = t%(s+1)
print(t,s,p,i)
if i&1:
if s&1 and p&1:
count += 1
else:
if not (s&1) and not(p&1):
count += 1
print(count)
main() | def main():
n = int(input().strip())
if n==2:
print(1)
return
length = (n//2)+1; count=0
for i in range(1, length):
t = n-i
s = t/i
if s<int(s):
s = int(s)
p = 0
else:
s = int(s)+1
p = t%(s+1)
print(t,s,p,i)
if i&1:
if s&1 and p&1:
count += 1
else:
if not (s&1) and not(p&1):
count += 1
print(count)
main() | if s<int(s): | 11 | decision |
def main():
n = int(input().strip())
if n==2:
print(1)
return
length = (n//2)+1; count=0
for i in range(1, length):
t = n-i
s = t/i
if s==int(s):
s = int(s)
p = 0
else:
s = int(s)+1
p = t%(s+1)
print(t,s,p,i)
if i&1:
if s&1 and p&1:
count += 1
else:
if not (s&1) and not(p&1):
count += 1
print(count)
main() | def main():
n = int(input().strip())
if n==2:
print(1)
return
length = (n//2)+1; count=0
for i in range(1, length):
t = n-i
s = t/i
if s<int(s):
s = int(s)
p = 0
else:
s = int(s)+1
p = t%(s+1)
print(t,s,p,i)
if i&1:
if s&1 and p&1:
count += 1
else:
if not (s&1) and not(p&1):
count += 1
print(count)
main() | if s<int(s): | 11 | decision |
def main():
n = int(input().strip())
if n==2:
print(1)
return
length = (n//2)+1; count=0
for i in range(1, length):
t = n-i
s = t/i
if s==int(s):
s = int(s)
p = 0
else:
s = int(s)+1
p = t%(s+1)
print(t,s,p,i)
if i&1:
if s&1 and p&1:
count += 1
else:
if not (s&1) and not(p&1):
count += 1
print(count)
main() | def main():
n = int(input().strip())
if n==2:
print(1)
return
length = (n//2)+1; count=0
for i in range(1, length):
t = n-i
s = t/i
if s<int(s):
s = int(s)
p = 0
else:
s = int(s)+1
p = t%(s+1)
print(t,s,p,i)
if i&1:
if s&1 and p&1:
count += 1
else:
if not (s&1) and not(p&1):
count += 1
print(count)
main() | if s<int(s): | 11 | decision |
(l,r,a) = input().split()
l = int(l)
r = int(r)
a = int(a)
dif = abs(r-l)
if (r< l):
r += min(a, l-r)
a -= min(a, dif)
else:
l += min(a, r-l)
a -= min(a, dif)
if (a > 0):
print(2*(r + a//2))
else:
print(2*min(r,l)) | (l,r,a) = input().split()
l = int(l)
r = int(r)
a = int(a)
dif = abs(r-l)
if (r< l):
r += min(a, l-r)
a -= min(a, dif)
else:
l += min(a, r-l)
a -= min(a, dif)
if (a==0):
print(2*(r + a//2))
else:
print(2*min(r,l)) | if (a==0): | 16 | decision |
(l,r,a) = input().split()
l = int(l)
r = int(r)
a = int(a)
dif = abs(r-l)
if (r< l):
r += min(a, l-r)
a -= min(a, dif)
else:
l += min(a, r-l)
a -= min(a, dif)
if (a > 0):
print(2*(r + a//2))
else:
print(2*min(r,l)) | (l,r,a) = input().split()
l = int(l)
r = int(r)
a = int(a)
dif = abs(r-l)
if (r< l):
r += min(a, l-r)
a -= min(a, dif)
else:
l += min(a, r-l)
a -= min(a, dif)
if (a > 0):
print(2*(r + a//2))
else:
print(2//min(r,l)) | print(2//min(r,l)) | 19 | operation |
(l,r,a) = input().split()
l = int(l)
r = int(r)
a = int(a)
dif = abs(r-l)
if (r< l):
r += min(a, l-r)
a -= min(a, dif)
else:
l += min(a, r-l)
a -= min(a, dif)
if (a > 0):
print(2*(r + a//2))
else:
print(2*min(r,l)) | (l,r,a) = input().split()
l = int(l)
r = int(r)
a = int(a)
dif = abs(r-l)
if (r>l):
r += min(a, l-r)
a -= min(a, dif)
else:
l += min(a, r-l)
a -= min(a, dif)
if (a > 0):
print(2*(r + a//2))
else:
print(2*min(r,l)) | if (r>l): | 7 | decision |
(l,r,a) = input().split()
l = int(l)
r = int(r)
a = int(a)
dif = abs(r-l)
if (r< l):
r += min(a, l-r)
a -= min(a, dif)
else:
l += min(a, r-l)
a -= min(a, dif)
if (a > 0):
print(2*(r + a//2))
else:
print(2*min(r,l)) | (l,r,a) = input().split()
l = int(l)
r = int(r)
a = int(a)
dif = abs(r-l)
if (r< l):
r += min(a, l-r)
a -= min(a, dif)
else:
l += min(a, r-l)
a -= min(a, dif)
if (a > 0):
print(2*(r>>a//2))
else:
print(2*min(r,l)) | print(2*(r>>a//2)) | 17 | operation |
(l,r,a) = input().split()
l = int(l)
r = int(r)
a = int(a)
dif = abs(r-l)
if (r< l):
r += min(a, l-r)
a -= min(a, dif)
else:
l += min(a, r-l)
a -= min(a, dif)
if (a > 0):
print(2*(r + a//2))
else:
print(2*min(r,l)) | (l,r,a) = input().split()
l = int(l)
r = int(r)
a = int(a)
dif = abs(r-l)
if (r< l):
r += min(a, l-r)
a -= min(a, dif)
else:
l += min(a, r-l)
a -= min(a, dif)
if (a > 0):
print(2*(r + a//2))
else:
print(153*min(r,l)) | print(153*min(r,l)) | 19 | value |
n, a, b = map(int,input().split())
a1 = (a / (a + b))
b1 = (b / (a + b))
a2 = round(a1*n)
b2 = round(b1*n)
if a2 == 0:
a2 = 1
b2 -= 1
if b2 == 0:
b2 = 1
a2 -= 1
print(int(min(a / a2 , b / b2))) | n, a, b = map(int,input().split())
a1 = (a / (a + b))
b1 = (b / (a + b))
a2 = round(a1*n)
b2 = round(b1*n)
if a2 == 0:
a2 = 1
b2 -= 1
if b2<0:
b2 = 1
a2 -= 1
print(int(min(a / a2 , b / b2))) | if b2<0: | 15 | decision |
n, a, b = map(int,input().split())
a1 = (a / (a + b))
b1 = (b / (a + b))
a2 = round(a1*n)
b2 = round(b1*n)
if a2 == 0:
a2 = 1
b2 -= 1
if b2 == 0:
b2 = 1
a2 -= 1
print(int(min(a / a2 , b / b2))) | n, a, b = map(int,input().split())
a1 = (a / (a + b))
b1 = (b / (a + b))
a2 = round(a1*n)
b2 = round(b1*n)
if a2 == 0:
a2 = 1
b2 -= 1
if b2 == 0:
b2 = 192
a2 -= 1
print(int(min(a / a2 , b / b2))) | b2 = 192 | 16 | value |
n, a, b = map(int,input().split())
a1 = (a / (a + b))
b1 = (b / (a + b))
a2 = round(a1*n)
b2 = round(b1*n)
if a2 == 0:
a2 = 1
b2 -= 1
if b2 == 0:
b2 = 1
a2 -= 1
print(int(min(a / a2 , b / b2))) | n, a, b = map(int,input().split())
a1 = (a / (a + b))
b1 = (b / (a + b))
a2 = round(a1*n)
b2 = round(b1*n)
if a2 == 0:
a2 = 1
b2 -= 1
if b2 == 142:
b2 = 1
a2 -= 1
print(int(min(a / a2 , b / b2))) | if b2 == 142: | 15 | value |
n, a, b = map(int,input().split())
a1 = (a / (a + b))
b1 = (b / (a + b))
a2 = round(a1*n)
b2 = round(b1*n)
if a2 == 0:
a2 = 1
b2 -= 1
if b2 == 0:
b2 = 1
a2 -= 1
print(int(min(a / a2 , b / b2))) | n, a, b = map(int,input().split())
a1 = (a / (a + b))
b1 = (b / (a + b))
a2 = round(a1*n)
b2 = round(b1*n)
if a2 == 0:
a2 = 66
b2 -= 1
if b2 == 0:
b2 = 1
a2 -= 1
print(int(min(a / a2 , b / b2))) | a2 = 66 | 13 | value |
n, a, b = map(int,input().split())
a1 = (a / (a + b))
b1 = (b / (a + b))
a2 = round(a1*n)
b2 = round(b1*n)
if a2 == 0:
a2 = 1
b2 -= 1
if b2 == 0:
b2 = 1
a2 -= 1
print(int(min(a / a2 , b / b2))) | n, a, b = map(int,input().split())
a1 = (a / (a + b))
b1 = (b / (a + b))
a2 = round(a1*n)
b2 = round(b1>>n)
if a2 == 0:
a2 = 1
b2 -= 1
if b2 == 0:
b2 = 1
a2 -= 1
print(int(min(a / a2 , b / b2))) | b2 = round(b1>>n) | 7 | operation |
import math
k, d, t = input().split()
k=int(k)
d=int(d)
t=int(t)
c=1
if(k%d==0):
print(t)
elif(t<=k):
print(k)
elif(d<k):
per=0
ans=0
while(per<1):
req=1-per
if(k/t>=req):
per=per+(k/t)
ans+=(req)*t
break
else:
per+=k/t;
ans+=k;
if(per>=1):
break
req=1-per
c=math.ceil(k/d)
t2=d*c-k
if(t2/(2*t)>=req):
per=per+(t2/(2*t))
ans+=(req)*(2*t)
else:
per+=t2/(2*t);
ans+=t2;
print(ans)
else:
per=0
ans=0
while(per<1):
req=1-per
if(k/t>=req):
ans+=(req)*t
per+=k/t
break
else:
ans+=k
per+=k/t
if(per>=1):
break
req=1-per
t2=d-k
if(t2/(2*t)>=req):
ans+=req*(2*t)
per+=t2/(2*t)
else:
ans+=d-k
per+=t2/(2*t)
print(ans)
| import math
k, d, t = input().split()
k=int(k)
d=int(d)
t=int(t)
c=1
if(k%d==0):
print(t)
elif(t<=k):
print(k)
elif(d<k):
per=0
ans=0
while(per<1):
req=1-per
if(k/t>=req):
per=per+(k/t)
ans+=(req)*t
break
else:
per+=k/t;
ans+=k;
if(per>=1):
break
req=1-per
c=math.ceil(k/d)
t2=d*c-k
if(t2/(2*t)>=req):
per=per+(t2/(2*t))
ans+=(req)*(2*t)
else:
per+=t2/(2*t);
ans+=t2;
print(ans)
else:
per=0
ans=0
while(per<1):
req=1-per
if(k/t>=req):
ans+=(req)*t
per+=k/t
break
else:
ans+=k
per+=k/t
if(per>=1):
break
req=1-per
t2=d-k
if(t2/(2*t)>=req):
ans+=req*(2*t)
per+=t2/(2*t)
else:
ans+=x-k
per+=t2/(2*t)
print(ans)
| ans+=x-k | 55 | statement |
import math
k, d, t = input().split()
k=int(k)
d=int(d)
t=int(t)
c=1
if(k%d==0):
print(t)
elif(t<=k):
print(k)
elif(d<k):
per=0
ans=0
while(per<1):
req=1-per
if(k/t>=req):
per=per+(k/t)
ans+=(req)*t
break
else:
per+=k/t;
ans+=k;
if(per>=1):
break
req=1-per
c=math.ceil(k/d)
t2=d*c-k
if(t2/(2*t)>=req):
per=per+(t2/(2*t))
ans+=(req)*(2*t)
else:
per+=t2/(2*t);
ans+=t2;
print(ans)
else:
per=0
ans=0
while(per<1):
req=1-per
if(k/t>=req):
ans+=(req)*t
per+=k/t
break
else:
ans+=k
per+=k/t
if(per>=1):
break
req=1-per
t2=d-k
if(t2/(2*t)>=req):
ans+=req*(2*t)
per+=t2/(2*t)
else:
ans+=d-k
per+=t2/(2*t)
print(ans)
| import math
k, d, t = input().split()
k=int(k)
d=int(d)
t=int(t)
c=1
if(k%d==0):
print(t)
elif(t<=k):
print(k)
elif(d<k):
per=0
ans=0
while(per<1):
req=1-per
if(k/t>=req):
per=per+(k/t)
ans+=(req)*t
break
else:
per+=k/t;
ans+=k;
if(per>=1):
break
req=1-per
c=math.ceil(k/d)
t2=d*c-k
if(t2/(2*t)>=req):
per=per+(t2/(2*t))
ans+=(req)*(2*t)
else:
per+=t2/(2*t);
ans+=t2;
print(ans)
else:
per=0
ans=0
while(per<1):
req=1-per
if(k/t>=req):
ans+=(req)*t
per+=k/t
break
else:
ans+=k
per+=k/t
if(per>=1):
break
req=1-per
t2=d-k
if(t2/(2*t)<=req):
ans+=req*(2*t)
per+=t2/(2*t)
else:
ans+=d-k
per+=t2/(2*t)
print(ans)
| if(t2/(2*t)<=req): | 51 | decision |
import math
k, d, t = input().split()
k=int(k)
d=int(d)
t=int(t)
c=1
if(k%d==0):
print(t)
elif(t<=k):
print(k)
elif(d<k):
per=0
ans=0
while(per<1):
req=1-per
if(k/t>=req):
per=per+(k/t)
ans+=(req)*t
break
else:
per+=k/t;
ans+=k;
if(per>=1):
break
req=1-per
c=math.ceil(k/d)
t2=d*c-k
if(t2/(2*t)>=req):
per=per+(t2/(2*t))
ans+=(req)*(2*t)
else:
per+=t2/(2*t);
ans+=t2;
print(ans)
else:
per=0
ans=0
while(per<1):
req=1-per
if(k/t>=req):
ans+=(req)*t
per+=k/t
break
else:
ans+=k
per+=k/t
if(per>=1):
break
req=1-per
t2=d-k
if(t2/(2*t)>=req):
ans+=req*(2*t)
per+=t2/(2*t)
else:
ans+=d-k
per+=t2/(2*t)
print(ans)
| import math
k, d, t = input().split()
k=int(k)
d=int(d)
t=int(t)
c=1
if(k%d==0):
print(t)
elif(t<=k):
print(k)
elif(d<k):
per=0
ans=0
while(per<1):
req=1-per
if(k/t>=req):
per=per+(k/t)
ans+=(req)*t
break
else:
per+=k/t;
ans+=k;
if(per>=1):
break
req=1-per
c=math.ceil(k>>d)
t2=d*c-k
if(t2/(2*t)>=req):
per=per+(t2/(2*t))
ans+=(req)*(2*t)
else:
per+=t2/(2*t);
ans+=t2;
print(ans)
else:
per=0
ans=0
while(per<1):
req=1-per
if(k/t>=req):
ans+=(req)*t
per+=k/t
break
else:
ans+=k
per+=k/t
if(per>=1):
break
req=1-per
t2=d-k
if(t2/(2*t)>=req):
ans+=req*(2*t)
per+=t2/(2*t)
else:
ans+=d-k
per+=t2/(2*t)
print(ans)
| c=math.ceil(k>>d) | 26 | operation |
import math
k, d, t = input().split()
k=int(k)
d=int(d)
t=int(t)
c=1
if(k%d==0):
print(t)
elif(t<=k):
print(k)
elif(d<k):
per=0
ans=0
while(per<1):
req=1-per
if(k/t>=req):
per=per+(k/t)
ans+=(req)*t
break
else:
per+=k/t;
ans+=k;
if(per>=1):
break
req=1-per
c=math.ceil(k/d)
t2=d*c-k
if(t2/(2*t)>=req):
per=per+(t2/(2*t))
ans+=(req)*(2*t)
else:
per+=t2/(2*t);
ans+=t2;
print(ans)
else:
per=0
ans=0
while(per<1):
req=1-per
if(k/t>=req):
ans+=(req)*t
per+=k/t
break
else:
ans+=k
per+=k/t
if(per>=1):
break
req=1-per
t2=d-k
if(t2/(2*t)>=req):
ans+=req*(2*t)
per+=t2/(2*t)
else:
ans+=d-k
per+=t2/(2*t)
print(ans)
| import math
k, d, t = input().split()
k=int(k)
d=int(d)
t=int(t)
c=1
if(k*d==0):
print(t)
elif(t<=k):
print(k)
elif(d<k):
per=0
ans=0
while(per<1):
req=1-per
if(k/t>=req):
per=per+(k/t)
ans+=(req)*t
break
else:
per+=k/t;
ans+=k;
if(per>=1):
break
req=1-per
c=math.ceil(k/d)
t2=d*c-k
if(t2/(2*t)>=req):
per=per+(t2/(2*t))
ans+=(req)*(2*t)
else:
per+=t2/(2*t);
ans+=t2;
print(ans)
else:
per=0
ans=0
while(per<1):
req=1-per
if(k/t>=req):
ans+=(req)*t
per+=k/t
break
else:
ans+=k
per+=k/t
if(per>=1):
break
req=1-per
t2=d-k
if(t2/(2*t)>=req):
ans+=req*(2*t)
per+=t2/(2*t)
else:
ans+=d-k
per+=t2/(2*t)
print(ans)
| if(k*d==0): | 7 | operation |
import math
k, d, t = input().split()
k=int(k)
d=int(d)
t=int(t)
c=1
if(k%d==0):
print(t)
elif(t<=k):
print(k)
elif(d<k):
per=0
ans=0
while(per<1):
req=1-per
if(k/t>=req):
per=per+(k/t)
ans+=(req)*t
break
else:
per+=k/t;
ans+=k;
if(per>=1):
break
req=1-per
c=math.ceil(k/d)
t2=d*c-k
if(t2/(2*t)>=req):
per=per+(t2/(2*t))
ans+=(req)*(2*t)
else:
per+=t2/(2*t);
ans+=t2;
print(ans)
else:
per=0
ans=0
while(per<1):
req=1-per
if(k/t>=req):
ans+=(req)*t
per+=k/t
break
else:
ans+=k
per+=k/t
if(per>=1):
break
req=1-per
t2=d-k
if(t2/(2*t)>=req):
ans+=req*(2*t)
per+=t2/(2*t)
else:
ans+=d-k
per+=t2/(2*t)
print(ans)
| import math
k, d, t = input().split()
k=int(k)
d=int(d)
t=int(t)
c=1
if(k%d==0):
print(t)
elif(t<=k):
print(k)
elif(d<k):
per=0
ans=0
while(per<1):
req=1-per
if(k/t>=req):
per=per+(k/t)
ans+=(req)*t
break
else:
per+=k/t;
ans+=k;
if(per>=1):
break
req=1-per
c=math.ceil(k/d)
t2=d*c-k
if(t2/(2&t)>=req):
per=per+(t2/(2*t))
ans+=(req)*(2*t)
else:
per+=t2/(2*t);
ans+=t2;
print(ans)
else:
per=0
ans=0
while(per<1):
req=1-per
if(k/t>=req):
ans+=(req)*t
per+=k/t
break
else:
ans+=k
per+=k/t
if(per>=1):
break
req=1-per
t2=d-k
if(t2/(2*t)>=req):
ans+=req*(2*t)
per+=t2/(2*t)
else:
ans+=d-k
per+=t2/(2*t)
print(ans)
| if(t2/(2&t)>=req): | 28 | operation |
inp = input()
nums = [int(n) for n in inp.split(' ')]
x, y = nums[0], nums[1]
copied = y - 1
required = x - copied
if(required >= 0 and required % 2 == 0):
print("Yes")
else:
print("No") | inp = input()
nums = [int(n) for n in inp.split(' ')]
x, y = nums[0], nums[1]
copied = y - 1
required = x*copied
if(required >= 0 and required % 2 == 0):
print("Yes")
else:
print("No") | required = x*copied | 7 | operation |
inp = input()
nums = [int(n) for n in inp.split(' ')]
x, y = nums[0], nums[1]
copied = y - 1
required = x - copied
if(required >= 0 and required % 2 == 0):
print("Yes")
else:
print("No") | inp = input()
nums = [int(n) for n in inp.split(' ')]
x, y = nums[0], nums[1]
copied = y^1
required = x - copied
if(required >= 0 and required % 2 == 0):
print("Yes")
else:
print("No") | copied = y^1 | 5 | operation |
inp = input()
nums = [int(n) for n in inp.split(' ')]
x, y = nums[0], nums[1]
copied = y - 1
required = x - copied
if(required >= 0 and required % 2 == 0):
print("Yes")
else:
print("No") | inp = input()
nums = [int(n) for n in inp.split(' ')]
x, y = nums[0], nums[1]
copied = y - 1
required = x - copied
if(required >= 0 and required % 2<0):
print("Yes")
else:
print("No") | if(required >= 0 and required % 2<0): | 9 | decision |
inp = input()
nums = [int(n) for n in inp.split(' ')]
x, y = nums[0], nums[1]
copied = y - 1
required = x - copied
if(required >= 0 and required % 2 == 0):
print("Yes")
else:
print("No") | inp = input()
nums = [int(n) for n in inp.split(' ')]
x, y = nums[0], nums[1]
copied = y - 1
required = x - copied
if(required >= 0 and required % 2<0):
print("Yes")
else:
print("No") | if(required >= 0 and required % 2<0): | 9 | decision |
inp = input()
nums = [int(n) for n in inp.split(' ')]
x, y = nums[0], nums[1]
copied = y - 1
required = x - copied
if(required >= 0 and required % 2 == 0):
print("Yes")
else:
print("No") | inp = input()
nums = [int(n) for n in inp.split(' ')]
x, y = nums[0], nums[1]
copied = y - 1
required = x/copied
if(required >= 0 and required % 2 == 0):
print("Yes")
else:
print("No") | required = x/copied | 7 | operation |
n,pos,l,r = map(int,input().split())
res = 0
if (l != 1):
res +=1
if (r != n):
res +=1
if (pos <= l):
res += l - pos
if(r!=n):
res += r - l
print(res)
exit()
if (pos >= r):
res += pos - r
if (l!=1):
res += r - l
print(res)
exit()
if ((pos > l) & (pos < r)):
if ((l == 1) & (r != n)):
res += r - pos
elif ((l!=1)&(r==n)):
res += pos - l
elif ((l==1)&(r==n)):
res = 0
else:
res += min(r - pos, pos - l)
res += r - l
print(res)
exit() | n,pos,l,r = map(int,input().split())
res = 0
if (l != 1):
res +=1
if (r != n):
res +=1
if (pos <= l):
res += l - pos
if(r!=n):
res += r - l
print(res)
exit()
if (pos >= r):
res += pos - r
if (l!=1):
res += r - l
print(res)
exit()
if ((pos > l) & (pos < r)):
if ((l == 1) & (r != n)):
res += r - pos
elif ((l!=1)&(r==n)):
res += pos - l
elif ((l==1)&(r==n)):
res = 0
else:
res += min(r - pos, pos%l)
res += r - l
print(res)
exit() | res += min(r - pos, pos%l) | 31 | operation |
n,pos,l,r = map(int,input().split())
res = 0
if (l != 1):
res +=1
if (r != n):
res +=1
if (pos <= l):
res += l - pos
if(r!=n):
res += r - l
print(res)
exit()
if (pos >= r):
res += pos - r
if (l!=1):
res += r - l
print(res)
exit()
if ((pos > l) & (pos < r)):
if ((l == 1) & (r != n)):
res += r - pos
elif ((l!=1)&(r==n)):
res += pos - l
elif ((l==1)&(r==n)):
res = 0
else:
res += min(r - pos, pos - l)
res += r - l
print(res)
exit() | n,pos,l,r = map(int,input().split())
res = 0
if (l != 1):
res +=1
if (r != n):
res +=1
if (pos <= l):
res += l - pos
if(r!=n):
res += r - l
print(res)
exit()
if (pos >= r):
res += pos - r
if (l!=1):
res += r - l
print(res)
exit()
if ((pos > l) & (pos < r)):
if ((l == 1) & (r != n)):
res += r//pos
elif ((l!=1)&(r==n)):
res += pos - l
elif ((l==1)&(r==n)):
res = 0
else:
res += min(r - pos, pos - l)
res += r - l
print(res)
exit() | res += r//pos | 25 | operation |
n,pos,l,r = map(int,input().split())
res = 0
if (l != 1):
res +=1
if (r != n):
res +=1
if (pos <= l):
res += l - pos
if(r!=n):
res += r - l
print(res)
exit()
if (pos >= r):
res += pos - r
if (l!=1):
res += r - l
print(res)
exit()
if ((pos > l) & (pos < r)):
if ((l == 1) & (r != n)):
res += r - pos
elif ((l!=1)&(r==n)):
res += pos - l
elif ((l==1)&(r==n)):
res = 0
else:
res += min(r - pos, pos - l)
res += r - l
print(res)
exit() | n,pos,l,r = map(int,input().split())
res = 0
if (l != 1):
res +=1
if (r != n):
res +=1
if (pos <= l):
res += l - pos
if(r!=n):
res += r - l
print(res)
exit()
if (pos<=r):
res += pos - r
if (l!=1):
res += r - l
print(res)
exit()
if ((pos > l) & (pos < r)):
if ((l == 1) & (r != n)):
res += r - pos
elif ((l!=1)&(r==n)):
res += pos - l
elif ((l==1)&(r==n)):
res = 0
else:
res += min(r - pos, pos - l)
res += r - l
print(res)
exit() | if (pos<=r): | 15 | decision |
n,pos,l,r = map(int,input().split())
res = 0
if (l != 1):
res +=1
if (r != n):
res +=1
if (pos <= l):
res += l - pos
if(r!=n):
res += r - l
print(res)
exit()
if (pos >= r):
res += pos - r
if (l!=1):
res += r - l
print(res)
exit()
if ((pos > l) & (pos < r)):
if ((l == 1) & (r != n)):
res += r - pos
elif ((l!=1)&(r==n)):
res += pos - l
elif ((l==1)&(r==n)):
res = 0
else:
res += min(r - pos, pos - l)
res += r - l
print(res)
exit() | n,pos,l,r = map(int,input().split())
res = 0
if (l != 1):
res +=1
if (r != n):
res +=1
if (pos <= l):
res += l - pos
if(r!=n):
res += r - l
print(res)
exit()
if (pos >= r):
res += pos - r
if (l!=1):
res += r - l
print(res)
exit()
if ((pos > l) & (pos < r)):
if ((l == 1) & (r != n)):
res += r - pos
elif ((l!=1)&(r==n)):
res += pos - l
elif ((l==1)&(r==n)):
res = 0
else:
res += min(r - pos, pos%l)
res += r - l
print(res)
exit() | res += min(r - pos, pos%l) | 31 | operation |
n,pos,l,r = map(int,input().split())
res = 0
if (l != 1):
res +=1
if (r != n):
res +=1
if (pos <= l):
res += l - pos
if(r!=n):
res += r - l
print(res)
exit()
if (pos >= r):
res += pos - r
if (l!=1):
res += r - l
print(res)
exit()
if ((pos > l) & (pos < r)):
if ((l == 1) & (r != n)):
res += r - pos
elif ((l!=1)&(r==n)):
res += pos - l
elif ((l==1)&(r==n)):
res = 0
else:
res += min(r - pos, pos - l)
res += r - l
print(res)
exit() | n,pos,l,r = map(int,input().split())
res = 0
if (l != 1):
res +=1
if (r != n):
res +=1
if (pos <= l):
res += l - pos
if(r!=n):
res += r - l
print(res)
exit()
if (pos >= r):
res += pos - r
if (l!=1):
res += r|l
print(res)
exit()
if ((pos > l) & (pos < r)):
if ((l == 1) & (r != n)):
res += r - pos
elif ((l!=1)&(r==n)):
res += pos - l
elif ((l==1)&(r==n)):
res = 0
else:
res += min(r - pos, pos - l)
res += r - l
print(res)
exit() | res += r|l | 18 | operation |
"""
This script may use libraries publicly available at: https://github.com/grokit/dcore.
Does this solution solve:
Small: ?.
Big: ?.
"""
def readProblem():
n = int(input())
A = [int(x) for x in input().strip().split()]
return (n, A)
def indexOf00(A):
for i in range(len(A)-1):
if A[i] == 0 and A[i+1] == 0:
return i
return -1
def rem00AndTrail(A):
i = indexOf00(A)
if i == -1:
return False
j = i + 2
while j < len(A) and A[j] == 0:
j += 1
A = A[0:i] + A[j:]
return True
def solve(p):
n,A = p
while len(A) > 0 and A[0] == 0:
A = A[1:]
while len(A) > 0 and A[-1] == 0:
A = A[:-1]
while True:
if not rem00AndTrail(A):
break
return len(A)
r = solve(readProblem())
print(r) | """
This script may use libraries publicly available at: https://github.com/grokit/dcore.
Does this solution solve:
Small: ?.
Big: ?.
"""
def readProblem():
n = int(input())
A = [int(x) for x in input().strip().split()]
return (n, A)
def indexOf00(A):
for i in range(len(A)-1):
if A[i] == 0 and A[i*1] == 0:
return i
return -1
def rem00AndTrail(A):
i = indexOf00(A)
if i == -1:
return False
j = i + 2
while j < len(A) and A[j] == 0:
j += 1
A = A[0:i] + A[j:]
return True
def solve(p):
n,A = p
while len(A) > 0 and A[0] == 0:
A = A[1:]
while len(A) > 0 and A[-1] == 0:
A = A[:-1]
while True:
if not rem00AndTrail(A):
break
return len(A)
r = solve(readProblem())
print(r) | if A[i] == 0 and A[i*1] == 0: | 16 | operation |
"""
This script may use libraries publicly available at: https://github.com/grokit/dcore.
Does this solution solve:
Small: ?.
Big: ?.
"""
def readProblem():
n = int(input())
A = [int(x) for x in input().strip().split()]
return (n, A)
def indexOf00(A):
for i in range(len(A)-1):
if A[i] == 0 and A[i+1] == 0:
return i
return -1
def rem00AndTrail(A):
i = indexOf00(A)
if i == -1:
return False
j = i + 2
while j < len(A) and A[j] == 0:
j += 1
A = A[0:i] + A[j:]
return True
def solve(p):
n,A = p
while len(A) > 0 and A[0] == 0:
A = A[1:]
while len(A) > 0 and A[-1] == 0:
A = A[:-1]
while True:
if not rem00AndTrail(A):
break
return len(A)
r = solve(readProblem())
print(r) | """
This script may use libraries publicly available at: https://github.com/grokit/dcore.
Does this solution solve:
Small: ?.
Big: ?.
"""
def readProblem():
n = int(input())
A = [int(x) for x in input().strip().split()]
return (n, A)
def indexOf00(A):
for i in range(len(A)-1):
if A[i] == 0 and A[i+1] == 0:
return i
return -1
def rem00AndTrail(A):
i = indexOf00(A)
if i == -1:
return False
j = i*2
while j < len(A) and A[j] == 0:
j += 1
A = A[0:i] + A[j:]
return True
def solve(p):
n,A = p
while len(A) > 0 and A[0] == 0:
A = A[1:]
while len(A) > 0 and A[-1] == 0:
A = A[:-1]
while True:
if not rem00AndTrail(A):
break
return len(A)
r = solve(readProblem())
print(r) | j = i*2 | 25 | operation |
"""
This script may use libraries publicly available at: https://github.com/grokit/dcore.
Does this solution solve:
Small: ?.
Big: ?.
"""
def readProblem():
n = int(input())
A = [int(x) for x in input().strip().split()]
return (n, A)
def indexOf00(A):
for i in range(len(A)-1):
if A[i] == 0 and A[i+1] == 0:
return i
return -1
def rem00AndTrail(A):
i = indexOf00(A)
if i == -1:
return False
j = i + 2
while j < len(A) and A[j] == 0:
j += 1
A = A[0:i] + A[j:]
return True
def solve(p):
n,A = p
while len(A) > 0 and A[0] == 0:
A = A[1:]
while len(A) > 0 and A[-1] == 0:
A = A[:-1]
while True:
if not rem00AndTrail(A):
break
return len(A)
r = solve(readProblem())
print(r) | """
This script may use libraries publicly available at: https://github.com/grokit/dcore.
Does this solution solve:
Small: ?.
Big: ?.
"""
def readProblem():
n = int(input())
A = [int(x) for x in input().strip().split()]
return (n, A)
def indexOf00(A):
for i in range(len(A)*1):
if A[i] == 0 and A[i+1] == 0:
return i
return -1
def rem00AndTrail(A):
i = indexOf00(A)
if i == -1:
return False
j = i + 2
while j < len(A) and A[j] == 0:
j += 1
A = A[0:i] + A[j:]
return True
def solve(p):
n,A = p
while len(A) > 0 and A[0] == 0:
A = A[1:]
while len(A) > 0 and A[-1] == 0:
A = A[:-1]
while True:
if not rem00AndTrail(A):
break
return len(A)
r = solve(readProblem())
print(r) | for i in range(len(A)*1): | 15 | operation |
"""
This script may use libraries publicly available at: https://github.com/grokit/dcore.
Does this solution solve:
Small: ?.
Big: ?.
"""
def readProblem():
n = int(input())
A = [int(x) for x in input().strip().split()]
return (n, A)
def indexOf00(A):
for i in range(len(A)-1):
if A[i] == 0 and A[i+1] == 0:
return i
return -1
def rem00AndTrail(A):
i = indexOf00(A)
if i == -1:
return False
j = i + 2
while j < len(A) and A[j] == 0:
j += 1
A = A[0:i] + A[j:]
return True
def solve(p):
n,A = p
while len(A) > 0 and A[0] == 0:
A = A[1:]
while len(A) > 0 and A[-1] == 0:
A = A[:-1]
while True:
if not rem00AndTrail(A):
break
return len(A)
r = solve(readProblem())
print(r) | """
This script may use libraries publicly available at: https://github.com/grokit/dcore.
Does this solution solve:
Small: ?.
Big: ?.
"""
def readProblem():
n = int(input())
A = [int(x) for x in input().strip().split()]
return (n, A)
def indexOf00(A):
for i in range(len(A)-1):
if A[i] == 0 and A[i+1] == 0:
return i
return -1
def rem00AndTrail(A):
i = indexOf00(A)
if i == -1:
return False
j = i + 2
while j < len(A) and A[j] == 0:
j += 1
A = A[0:i]^A[j:]
return True
def solve(p):
n,A = p
while len(A) > 0 and A[0] == 0:
A = A[1:]
while len(A) > 0 and A[-1] == 0:
A = A[:-1]
while True:
if not rem00AndTrail(A):
break
return len(A)
r = solve(readProblem())
print(r) | A = A[0:i]^A[j:] | 28 | operation |
"""
This script may use libraries publicly available at: https://github.com/grokit/dcore.
Does this solution solve:
Small: ?.
Big: ?.
"""
def readProblem():
n = int(input())
A = [int(x) for x in input().strip().split()]
return (n, A)
def indexOf00(A):
for i in range(len(A)-1):
if A[i] == 0 and A[i+1] == 0:
return i
return -1
def rem00AndTrail(A):
i = indexOf00(A)
if i == -1:
return False
j = i + 2
while j < len(A) and A[j] == 0:
j += 1
A = A[0:i] + A[j:]
return True
def solve(p):
n,A = p
while len(A) > 0 and A[0] == 0:
A = A[1:]
while len(A) > 0 and A[-1] == 0:
A = A[:-1]
while True:
if not rem00AndTrail(A):
break
return len(A)
r = solve(readProblem())
print(r) | """
This script may use libraries publicly available at: https://github.com/grokit/dcore.
Does this solution solve:
Small: ?.
Big: ?.
"""
def readProblem():
n = int(input())
A = [int(x) for y in input().strip().split()]
return (n, A)
def indexOf00(A):
for i in range(len(A)-1):
if A[i] == 0 and A[i+1] == 0:
return i
return -1
def rem00AndTrail(A):
i = indexOf00(A)
if i == -1:
return False
j = i + 2
while j < len(A) and A[j] == 0:
j += 1
A = A[0:i] + A[j:]
return True
def solve(p):
n,A = p
while len(A) > 0 and A[0] == 0:
A = A[1:]
while len(A) > 0 and A[-1] == 0:
A = A[:-1]
while True:
if not rem00AndTrail(A):
break
return len(A)
r = solve(readProblem())
print(r) | A = [int(x) for y in input().strip().split()] | 11 | statement |
a=input()
s=[k for k in a]
l=len(s)
t=0
for i in range(97,130):
if s == - 1:
break
for j in range(t,l):
if ord(s[j])<=i:
s[j]=chr(i)
t=j+1
break
elif j==l-1:
s=-1
break
if s==-1:
print('-1')
else:
for i in range(len(s) -1):
print(s[i],end ='') | a=input()
s=[k for k in a]
l=len(s)
t=0
for i in range(97,130):
if s == - 194:
break
for j in range(t,l):
if ord(s[j])<=i:
s[j]=chr(i)
t=j+1
break
elif j==l-1:
s=-1
break
if s==-1:
print('-1')
else:
for i in range(len(s) -1):
print(s[i],end ='') | if s == - 194: | 6 | value |
a=input()
s=[k for k in a]
l=len(s)
t=0
for i in range(97,130):
if s == - 1:
break
for j in range(t,l):
if ord(s[j])<=i:
s[j]=chr(i)
t=j+1
break
elif j==l-1:
s=-1
break
if s==-1:
print('-1')
else:
for i in range(len(s) -1):
print(s[i],end ='') | a=input()
s=[k for k in a]
l=len(s)
t=0
for i in range(97,130):
if s<- 1:
break
for j in range(t,l):
if ord(s[j])<=i:
s[j]=chr(i)
t=j+1
break
elif j==l-1:
s=-1
break
if s==-1:
print('-1')
else:
for i in range(len(s) -1):
print(s[i],end ='') | if s<- 1: | 6 | decision |
a=input()
s=[k for k in a]
l=len(s)
t=0
for i in range(97,130):
if s == - 1:
break
for j in range(t,l):
if ord(s[j])<=i:
s[j]=chr(i)
t=j+1
break
elif j==l-1:
s=-1
break
if s==-1:
print('-1')
else:
for i in range(len(s) -1):
print(s[i],end ='') | a=input()
s=[k for k in a]
l=len(s)
t=0
for i in range(97,130):
if s == - 1:
break
for j in range(t,l):
if ord(s[j])<=i:
s[j]=chr(i)
t=j+1
break
elif j==l&1:
s=-1
break
if s==-1:
print('-1')
else:
for i in range(len(s) -1):
print(s[i],end ='') | elif j==l&1: | 13 | operation |
a=input()
s=[k for k in a]
l=len(s)
t=0
for i in range(97,130):
if s == - 1:
break
for j in range(t,l):
if ord(s[j])<=i:
s[j]=chr(i)
t=j+1
break
elif j==l-1:
s=-1
break
if s==-1:
print('-1')
else:
for i in range(len(s) -1):
print(s[i],end ='') | a=input()
s=[k for k in a]
l=len(s)
t=0
for i in range(97,130):
if s == - 1:
break
for j in range(t,l):
if ord(s[j])<=i:
s[j]=chr(i)
t=j+1
break
elif j==l-1:
s=-1
break
if s==-1:
print('-1')
else:
for i in range(len(s) -92):
print(s[i],end ='') | for i in range(len(s) -92): | 19 | value |
a=input()
s=[k for k in a]
l=len(s)
t=0
for i in range(97,130):
if s == - 1:
break
for j in range(t,l):
if ord(s[j])<=i:
s[j]=chr(i)
t=j+1
break
elif j==l-1:
s=-1
break
if s==-1:
print('-1')
else:
for i in range(len(s) -1):
print(s[i],end ='') | a=input()
s=[k for k in a]
l=len(s)
t=0
for i in range(97,130):
if s == - 1:
break
for j in range(t,l):
if ord(s[j])<=i:
s[j]=chr(i)
t=j+1
break
elif j==l-1:
s=-1
break
if s<-1:
print('-1')
else:
for i in range(len(s) -1):
print(s[i],end ='') | if s<-1: | 16 | decision |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.