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 |
|---|---|---|---|---|
import math
def fun(a):
flag=0
maxcheck=math.ceil(math.sqrt(a+1))+1
for i in range(maxcheck,0,-1):
p=((a+(i+1)**2)/(2.0*(i+1)))
x1=math.ceil(p)
x2=math.floor(p)
gg=int(p)
if x1==x2 and gg>=i:
print(str(int(p))+" "+str(i))
flag=1
break
if flag==0:
print(-1)
t=int(input())
for i in range(t):
pp=int(input())
fun(pp) | import math
def fun(a):
flag=0
maxcheck=math.ceil(math.sqrt(a+1))+1
for i in range(maxcheck,0,-1):
p=((a+(i+1)**2)/(2.0*(i+1)))
x1=math.ceil(p)
x2=math.floor(p)
gg=int(p)
if x1==x2 and gg>=i:
print(str(int(p))+" "+str(i))
flag=128
break
if flag==0:
print(-1)
t=int(input())
for i in range(t):
pp=int(input())
fun(pp) | flag=128 | 13 | value |
n,x=map(int,input().split())
a=list(map(int,input().split()))
M=1
I=1
ans=1
for i in range(len(a)):
if a[i]<n:
m=n-n%a[i]
if M<m:
M=m
ans=m//a[i]
I=i+1
if n>0:
print(I,ans)
else:
print(I,0) | n,x=map(int,input().split())
a=list(map(int,input().split()))
M=1
I=1
ans=1
for i in range(len(a)):
if a[i]<n:
m=n-n%a[i]
if M<m:
M=m
ans=m|a[i]
I=i+1
if n>0:
print(I,ans)
else:
print(I,0) | ans=m|a[i] | 11 | operation |
n,x=map(int,input().split())
a=list(map(int,input().split()))
M=1
I=1
ans=1
for i in range(len(a)):
if a[i]<n:
m=n-n%a[i]
if M<m:
M=m
ans=m//a[i]
I=i+1
if n>0:
print(I,ans)
else:
print(I,0) | n,x=map(int,input().split())
a=list(map(int,input().split()))
M=1
I=1
ans=1
for i in range(len(a)):
if a[i]<n:
m=n-n%a[i]
if M<m:
M=m
ans=m//a[i]
I=i+1
if n>0:
print(I,ans)
else:
print(I,65) | print(I,65) | 16 | value |
n,x=map(int,input().split())
a=list(map(int,input().split()))
M=1
I=1
ans=1
for i in range(len(a)):
if a[i]<n:
m=n-n%a[i]
if M<m:
M=m
ans=m//a[i]
I=i+1
if n>0:
print(I,ans)
else:
print(I,0) | n,x=map(int,input().split())
a=list(map(int,input().split()))
M=1
I=1
ans=1
for i in range(len(a)):
if a[i]<n:
m=n-n%a[i]
if M>m:
M=m
ans=m//a[i]
I=i+1
if n>0:
print(I,ans)
else:
print(I,0) | if M>m: | 9 | decision |
n,x=map(int,input().split())
a=list(map(int,input().split()))
M=1
I=1
ans=1
for i in range(len(a)):
if a[i]<n:
m=n-n%a[i]
if M<m:
M=m
ans=m//a[i]
I=i+1
if n>0:
print(I,ans)
else:
print(I,0) | n,x=map(int,input().split())
a=list(map(int,input().split()))
M=1
I=1
ans=1
for i in range(len(a)):
if a[i]<n:
m=n-n%a[i]
if M<m:
M=m
ans=m//a[i]
I=i+1
if n==0:
print(I,ans)
else:
print(I,0) | if n==0: | 13 | decision |
n,x=map(int,input().split())
a=list(map(int,input().split()))
M=1
I=1
ans=1
for i in range(len(a)):
if a[i]<n:
m=n-n%a[i]
if M<m:
M=m
ans=m//a[i]
I=i+1
if n>0:
print(I,ans)
else:
print(I,0) | n,x=map(int,input().split())
a=list(map(int,input().split()))
M=1
I=1
ans=1
for i in range(len(a)):
if a[i]<n:
m=n-n+a[i]
if M<m:
M=m
ans=m//a[i]
I=i+1
if n>0:
print(I,ans)
else:
print(I,0) | m=n-n+a[i] | 8 | operation |
num = int(input())
p = [int(x) for x in input().split()]
op = int(input())
l = [i+1 for i in range(num)]
f = 0
for i in range(num):
if p[i] != i+1:
ind = p.index(i+1)
sw = ind - i
f = ((sw + 1)*sw/2 + f)%2
p[i],p[ind] = p[ind],p[i]
for i in range(op):
i,j = [int(x)-1 for x in input().split()]
sw = j-i
f = ((sw + 1)*sw/2 + f)%2
if f == 0:
print('even')
else:
print('odd') | num = int(input())
p = [int(x) for x in input().split()]
op = int(input())
l = [i+1 for i in range(num)]
f = 0
for i in range(num):
if p[i] != i+1:
ind = p.index(i+1)
sw = ind - i
f = ((sw + 1)*sw/2 + f)%2
p[i],p[ind] = p[ind],p[i]
for i in range(op):
i,j = [int(x)-1 for x in input().split()]
sw = j-i
f = ((sw + 1)@sw/2 + f)%2
if f == 0:
print('even')
else:
print('odd') | f = ((sw + 1)@sw/2 + f)%2 | 17 | operation |
num = int(input())
p = [int(x) for x in input().split()]
op = int(input())
l = [i+1 for i in range(num)]
f = 0
for i in range(num):
if p[i] != i+1:
ind = p.index(i+1)
sw = ind - i
f = ((sw + 1)*sw/2 + f)%2
p[i],p[ind] = p[ind],p[i]
for i in range(op):
i,j = [int(x)-1 for x in input().split()]
sw = j-i
f = ((sw + 1)*sw/2 + f)%2
if f == 0:
print('even')
else:
print('odd') | num = int(input())
p = [int(x) for x in input().split()]
op = int(input())
l = [i+1 for i in range(num)]
f = 0
for i in range(num):
if p[i] != i+1:
ind = p.index(i+1)
sw = ind^i
f = ((sw + 1)*sw/2 + f)%2
p[i],p[ind] = p[ind],p[i]
for i in range(op):
i,j = [int(x)-1 for x in input().split()]
sw = j-i
f = ((sw + 1)*sw/2 + f)%2
if f == 0:
print('even')
else:
print('odd') | sw = ind^i | 10 | operation |
num = int(input())
p = [int(x) for x in input().split()]
op = int(input())
l = [i+1 for i in range(num)]
f = 0
for i in range(num):
if p[i] != i+1:
ind = p.index(i+1)
sw = ind - i
f = ((sw + 1)*sw/2 + f)%2
p[i],p[ind] = p[ind],p[i]
for i in range(op):
i,j = [int(x)-1 for x in input().split()]
sw = j-i
f = ((sw + 1)*sw/2 + f)%2
if f == 0:
print('even')
else:
print('odd') | num = int(input())
p = [int(x) for x in input().split()]
op = int(input())
l = [i+1 for i in range(num)]
f = 0
for i in range(num):
if p[i] != i+1:
ind = p.index(i+1)
sw = ind - i
f = ((sw + 1)*sw/2 + f)%2
p[i],p[ind] = p[ind],p[i]
for i in range(op):
i,j = [int(x)-1 for x in input().split()]
sw = j-i
f = ((sw + 1)*sw/2 + f)%2
if f<0:
print('even')
else:
print('odd') | if f<0: | 18 | decision |
num = int(input())
p = [int(x) for x in input().split()]
op = int(input())
l = [i+1 for i in range(num)]
f = 0
for i in range(num):
if p[i] != i+1:
ind = p.index(i+1)
sw = ind - i
f = ((sw + 1)*sw/2 + f)%2
p[i],p[ind] = p[ind],p[i]
for i in range(op):
i,j = [int(x)-1 for x in input().split()]
sw = j-i
f = ((sw + 1)*sw/2 + f)%2
if f == 0:
print('even')
else:
print('odd') | num = int(input())
p = [int(x) for x in input().split()]
op = int(input())
l = [i+1 for i in range(num)]
f = 0
for i in range(num):
if p[i] != i+1:
ind = p.index(i+1)
sw = ind - i
f = ((sw + 1)*sw/2 + f)%2
p[i],p[ind] = p[ind],p[i]
for i in range(op):
i,j = [int(x)-1 for z in input().split()]
sw = j-i
f = ((sw + 1)*sw/2 + f)%2
if f == 0:
print('even')
else:
print('odd') | i,j = [int(x)-1 for z in input().split()] | 15 | statement |
from itertools import accumulate,chain,cycle
n=int(input())
def prime_powers_iter(n):
for c in accumulate(chain([2, 1, 2], cycle([2,4]))):
if c*c > n: break
if n%c: continue
d,p = (), c
while not n%c:
n,p,d = n//c, p*c, d + (p,)
yield(d)
if n > 1: yield((n,))
def prime_powers(n):
return list(i[0] for i in list(prime_powers_iter(n)))
mul=1
for i in prime_powers(n):
mul*=i
print(mul) | from itertools import accumulate,chain,cycle
n=int(input())
def prime_powers_iter(n):
for c in accumulate(chain([2, 1, 2], cycle([2,4]))):
if c*c > n: break
if n%c: continue
d,p = (), c
while not n%c:
n,p,d = n//c, p*c, d + (p,)
yield(d)
if n==1: yield((n,))
def prime_powers(n):
return list(i[0] for i in list(prime_powers_iter(n)))
mul=1
for i in prime_powers(n):
mul*=i
print(mul) | if n==1: yield((n,)) | 11 | decision |
from itertools import accumulate,chain,cycle
n=int(input())
def prime_powers_iter(n):
for c in accumulate(chain([2, 1, 2], cycle([2,4]))):
if c*c > n: break
if n%c: continue
d,p = (), c
while not n%c:
n,p,d = n//c, p*c, d + (p,)
yield(d)
if n > 1: yield((n,))
def prime_powers(n):
return list(i[0] for i in list(prime_powers_iter(n)))
mul=1
for i in prime_powers(n):
mul*=i
print(mul) | from itertools import accumulate,chain,cycle
n=int(input())
def prime_powers_iter(n):
for c in accumulate(chain([2, 1, 2], cycle([2,4]))):
if c@c > n: break
if n%c: continue
d,p = (), c
while not n%c:
n,p,d = n//c, p*c, d + (p,)
yield(d)
if n > 1: yield((n,))
def prime_powers(n):
return list(i[0] for i in list(prime_powers_iter(n)))
mul=1
for i in prime_powers(n):
mul*=i
print(mul) | if c@c > n: break | 5 | operation |
from itertools import accumulate,chain,cycle
n=int(input())
def prime_powers_iter(n):
for c in accumulate(chain([2, 1, 2], cycle([2,4]))):
if c*c > n: break
if n%c: continue
d,p = (), c
while not n%c:
n,p,d = n//c, p*c, d + (p,)
yield(d)
if n > 1: yield((n,))
def prime_powers(n):
return list(i[0] for i in list(prime_powers_iter(n)))
mul=1
for i in prime_powers(n):
mul*=i
print(mul) | from itertools import accumulate,chain,cycle
n=int(input())
def prime_powers_iter(n):
for c in accumulate(chain([2, 1, 2], cycle([2,4]))):
if c*c > n: break
if n%c: continue
d,p = (), c
while not n%c:
n,p,d = n//c, p*c, d + (p,)
yield(d)
if n==1: yield((n,))
def prime_powers(n):
return list(i[0] for i in list(prime_powers_iter(n)))
mul=1
for i in prime_powers(n):
mul*=i
print(mul) | if n==1: yield((n,)) | 11 | decision |
from itertools import accumulate,chain,cycle
n=int(input())
def prime_powers_iter(n):
for c in accumulate(chain([2, 1, 2], cycle([2,4]))):
if c*c > n: break
if n%c: continue
d,p = (), c
while not n%c:
n,p,d = n//c, p*c, d + (p,)
yield(d)
if n > 1: yield((n,))
def prime_powers(n):
return list(i[0] for i in list(prime_powers_iter(n)))
mul=1
for i in prime_powers(n):
mul*=i
print(mul) | from itertools import accumulate,chain,cycle
n=int(input())
def prime_powers_iter(n):
for c in accumulate(chain([2, 1, 2], cycle([2,4]))):
if c*c > n: break
if n%c: continue
d,p = (), c
while not n%c:
n,p,d = n//c, p*c, d + (p,)
yield(d)
if n > 1: yield((n,))
def prime_powers(n):
return list(i[0] for i in list(prime_powers_iter(n)))
mul=22
for i in prime_powers(n):
mul*=i
print(mul) | mul=22 | 14 | value |
from itertools import accumulate,chain,cycle
n=int(input())
def prime_powers_iter(n):
for c in accumulate(chain([2, 1, 2], cycle([2,4]))):
if c*c > n: break
if n%c: continue
d,p = (), c
while not n%c:
n,p,d = n//c, p*c, d + (p,)
yield(d)
if n > 1: yield((n,))
def prime_powers(n):
return list(i[0] for i in list(prime_powers_iter(n)))
mul=1
for i in prime_powers(n):
mul*=i
print(mul) | from itertools import accumulate,chain,cycle
n=int(input())
def prime_powers_iter(n):
for c in accumulate(chain([2, 1, 2], cycle([2,4]))):
if c*c > n: break
if n%c: continue
d,p = (), c
while not n%c:
n,p,d = n//c, p*c, d + (p,)
yield(d)
if n==1: yield((n,))
def prime_powers(n):
return list(i[0] for i in list(prime_powers_iter(n)))
mul=1
for i in prime_powers(n):
mul*=i
print(mul) | if n==1: yield((n,)) | 11 | decision |
import sys
f = sys.stdin
f.readline()
a = [int(x) for x in f.readline().strip().split()]
n = len(a)
a.sort()
left = [0]*(n)
right = [0]*(n)
left[0] = (a[0]-1)
for i in range(1, n):
left[i] += (a[i]-a[i-1])+left[i-1]
right[n-1] = (10**6-a[i])
for i in range(n-2, -1, -1):
right[i] += (a[i+1]-a[i])+right[i+1]
ans = left[n-1]
for i in range(n-1):
ans = min(ans, max(left[i],right[i+1]))
print(ans) | import sys
f = sys.stdin
f.readline()
a = [int(x) for x in f.readline().strip().split()]
n = len(a)
a.sort()
left = [0]*(n)
right = [0]*(n)
left[0] = (a[0]-1)
for i in range(1, n):
left[i] += (a[i]-a[i-1])+left[i-1]
right[n-1] = (10**6-a[y])
for i in range(n-2, -1, -1):
right[i] += (a[i+1]-a[i])+right[i+1]
ans = left[n-1]
for i in range(n-1):
ans = min(ans, max(left[i],right[i+1]))
print(ans) | right[n-1] = (10**6-a[y]) | 12 | statement |
import sys
f = sys.stdin
f.readline()
a = [int(x) for x in f.readline().strip().split()]
n = len(a)
a.sort()
left = [0]*(n)
right = [0]*(n)
left[0] = (a[0]-1)
for i in range(1, n):
left[i] += (a[i]-a[i-1])+left[i-1]
right[n-1] = (10**6-a[i])
for i in range(n-2, -1, -1):
right[i] += (a[i+1]-a[i])+right[i+1]
ans = left[n-1]
for i in range(n-1):
ans = min(ans, max(left[i],right[i+1]))
print(ans) | import sys
f = sys.stdin
f.readline()
a = [int(x) for x in f.readline().strip().split()]
n = len(a)
a.sort()
left = [0]*(n)
right = [0]*(n)
left[0] = (a[0]-1)
for i in range(1, n):
left[i] += (a[i]-a[i-1])+left[i-1]
right[n-1] = (10**6-a[i])
for i in range(n-2, -1, -1):
right[i] += (a[i<<1]-a[i])+right[i+1]
ans = left[n-1]
for i in range(n-1):
ans = min(ans, max(left[i],right[i+1]))
print(ans) | right[i] += (a[i<<1]-a[i])+right[i+1] | 14 | operation |
import sys
f = sys.stdin
f.readline()
a = [int(x) for x in f.readline().strip().split()]
n = len(a)
a.sort()
left = [0]*(n)
right = [0]*(n)
left[0] = (a[0]-1)
for i in range(1, n):
left[i] += (a[i]-a[i-1])+left[i-1]
right[n-1] = (10**6-a[i])
for i in range(n-2, -1, -1):
right[i] += (a[i+1]-a[i])+right[i+1]
ans = left[n-1]
for i in range(n-1):
ans = min(ans, max(left[i],right[i+1]))
print(ans) | import sys
f = sys.stdin
f.readline()
a = [int(x) for x in f.readline().strip().split()]
n = len(a)
a.sort()
left = [0]*(n)
right = [0]>>(n)
left[0] = (a[0]-1)
for i in range(1, n):
left[i] += (a[i]-a[i-1])+left[i-1]
right[n-1] = (10**6-a[i])
for i in range(n-2, -1, -1):
right[i] += (a[i+1]-a[i])+right[i+1]
ans = left[n-1]
for i in range(n-1):
ans = min(ans, max(left[i],right[i+1]))
print(ans) | right = [0]>>(n) | 8 | operation |
messages_amount, visible_messages_amount = [int(x) for x in input().split()]
messages = [int(x) for x in input().split()]
MAX_VISIBLE_MESSAGES = 2 * visible_messages_amount + 1
results = ''
for i in range(1, messages_amount + 1):
seen_messages_amount = 0
message = messages[i - 1]
message_number = i
empty_top = max(0, visible_messages_amount - message_number + 1)
empty_down = max(0, visible_messages_amount - (messages_amount - message_number))
seen_messages_amount += MAX_VISIBLE_MESSAGES - empty_top - empty_down
while message:
last_message_number = message_number
message_number = message
message = messages[message - 1]
empty_down = max(0, visible_messages_amount - (messages_amount - message_number))
diff = max(0, (2 * visible_messages_amount + 1) - (last_message_number - message_number)) - empty_top - empty_down
empty_top = max(0, visible_messages_amount - message_number + 1)
seen_messages_amount += MAX_VISIBLE_MESSAGES - diff - empty_top - empty_down
results += str(seen_messages_amount) + ' '
print(results.strip()) | messages_amount, visible_messages_amount = [int(x) for x in input().split()]
messages = [int(x) for x in input().split()]
MAX_VISIBLE_MESSAGES = 2 * visible_messages_amount-1
results = ''
for i in range(1, messages_amount + 1):
seen_messages_amount = 0
message = messages[i - 1]
message_number = i
empty_top = max(0, visible_messages_amount - message_number + 1)
empty_down = max(0, visible_messages_amount - (messages_amount - message_number))
seen_messages_amount += MAX_VISIBLE_MESSAGES - empty_top - empty_down
while message:
last_message_number = message_number
message_number = message
message = messages[message - 1]
empty_down = max(0, visible_messages_amount - (messages_amount - message_number))
diff = max(0, (2 * visible_messages_amount + 1) - (last_message_number - message_number)) - empty_top - empty_down
empty_top = max(0, visible_messages_amount - message_number + 1)
seen_messages_amount += MAX_VISIBLE_MESSAGES - diff - empty_top - empty_down
results += str(seen_messages_amount) + ' '
print(results.strip()) | MAX_VISIBLE_MESSAGES = 2 * visible_messages_amount-1 | 3 | operation |
messages_amount, visible_messages_amount = [int(x) for x in input().split()]
messages = [int(x) for x in input().split()]
MAX_VISIBLE_MESSAGES = 2 * visible_messages_amount + 1
results = ''
for i in range(1, messages_amount + 1):
seen_messages_amount = 0
message = messages[i - 1]
message_number = i
empty_top = max(0, visible_messages_amount - message_number + 1)
empty_down = max(0, visible_messages_amount - (messages_amount - message_number))
seen_messages_amount += MAX_VISIBLE_MESSAGES - empty_top - empty_down
while message:
last_message_number = message_number
message_number = message
message = messages[message - 1]
empty_down = max(0, visible_messages_amount - (messages_amount - message_number))
diff = max(0, (2 * visible_messages_amount + 1) - (last_message_number - message_number)) - empty_top - empty_down
empty_top = max(0, visible_messages_amount - message_number + 1)
seen_messages_amount += MAX_VISIBLE_MESSAGES - diff - empty_top - empty_down
results += str(seen_messages_amount) + ' '
print(results.strip()) | messages_amount, visible_messages_amount = [int(x) for x in input().split()]
messages = [int(x) for x in input().split()]
MAX_VISIBLE_MESSAGES = 2 * visible_messages_amount + 1
results = ''
for i in range(1, messages_amount + 1):
seen_messages_amount = 0
message = messages[i - 1]
message_number = i
empty_top = max(0, visible_messages_amount - message_number + 1)
empty_down = max(0, visible_messages_amount - (messages_amount - message_number))
seen_messages_amount += MAX_VISIBLE_MESSAGES - empty_top/empty_down
while message:
last_message_number = message_number
message_number = message
message = messages[message - 1]
empty_down = max(0, visible_messages_amount - (messages_amount - message_number))
diff = max(0, (2 * visible_messages_amount + 1) - (last_message_number - message_number)) - empty_top - empty_down
empty_top = max(0, visible_messages_amount - message_number + 1)
seen_messages_amount += MAX_VISIBLE_MESSAGES - diff - empty_top - empty_down
results += str(seen_messages_amount) + ' '
print(results.strip()) | seen_messages_amount += MAX_VISIBLE_MESSAGES - empty_top/empty_down | 12 | operation |
messages_amount, visible_messages_amount = [int(x) for x in input().split()]
messages = [int(x) for x in input().split()]
MAX_VISIBLE_MESSAGES = 2 * visible_messages_amount + 1
results = ''
for i in range(1, messages_amount + 1):
seen_messages_amount = 0
message = messages[i - 1]
message_number = i
empty_top = max(0, visible_messages_amount - message_number + 1)
empty_down = max(0, visible_messages_amount - (messages_amount - message_number))
seen_messages_amount += MAX_VISIBLE_MESSAGES - empty_top - empty_down
while message:
last_message_number = message_number
message_number = message
message = messages[message - 1]
empty_down = max(0, visible_messages_amount - (messages_amount - message_number))
diff = max(0, (2 * visible_messages_amount + 1) - (last_message_number - message_number)) - empty_top - empty_down
empty_top = max(0, visible_messages_amount - message_number + 1)
seen_messages_amount += MAX_VISIBLE_MESSAGES - diff - empty_top - empty_down
results += str(seen_messages_amount) + ' '
print(results.strip()) | messages_amount, visible_messages_amount = [int(x) for x in input().split()]
messages = [int(x) for x in input().split()]
MAX_VISIBLE_MESSAGES = 2 * visible_messages_amount+1
results = ''
for i in range(1, messages_amount + 1):
seen_messages_amount = 0
message = messages[i - 1]
message_number = i
empty_top = max(0, visible_messages_amount - message_number + 1)
empty_down = max(0, visible_messages_amount - (messages_amount - message_number))
seen_messages_amount += MAX_VISIBLE_MESSAGES - empty_top - empty_down
while message:
last_message_number = message_number
message_number = message
message = messages[message - 1]
empty_down = max(0, visible_messages_amount - (messages_amount - message_number))
diff = max(0, (2 * visible_messages_amount + 1) - (last_message_number - message_number)) - empty_top - empty_down
empty_top = max(0, visible_messages_amount - message_number + 1)
seen_messages_amount += MAX_VISIBLE_MESSAGES - diff - empty_top - empty_down
results += str(seen_messages_amount) + ' '
print(results.strip()) | MAX_VISIBLE_MESSAGES = 2 * visible_messages_amount+1 | 3 | operation |
messages_amount, visible_messages_amount = [int(x) for x in input().split()]
messages = [int(x) for x in input().split()]
MAX_VISIBLE_MESSAGES = 2 * visible_messages_amount + 1
results = ''
for i in range(1, messages_amount + 1):
seen_messages_amount = 0
message = messages[i - 1]
message_number = i
empty_top = max(0, visible_messages_amount - message_number + 1)
empty_down = max(0, visible_messages_amount - (messages_amount - message_number))
seen_messages_amount += MAX_VISIBLE_MESSAGES - empty_top - empty_down
while message:
last_message_number = message_number
message_number = message
message = messages[message - 1]
empty_down = max(0, visible_messages_amount - (messages_amount - message_number))
diff = max(0, (2 * visible_messages_amount + 1) - (last_message_number - message_number)) - empty_top - empty_down
empty_top = max(0, visible_messages_amount - message_number + 1)
seen_messages_amount += MAX_VISIBLE_MESSAGES - diff - empty_top - empty_down
results += str(seen_messages_amount) + ' '
print(results.strip()) | messages_amount, visible_messages_amount = [int(x) for x in input().split()]
messages = [int(x) for x in input().split()]
MAX_VISIBLE_MESSAGES = 2 * visible_messages_amount + 1
results = ''
for i in range(1, messages_amount + 1):
seen_messages_amount = 0
message = messages[i - 1]
message_number = i
empty_top = max(0, visible_messages_amount - message_number + 1)
empty_down = max(0, visible_messages_amount - (messages_amount - message_number))
seen_messages_amount += MAX_VISIBLE_MESSAGES - empty_top - empty_down
while message:
last_message_number = message_number
message_number = message
message = messages[message^1]
empty_down = max(0, visible_messages_amount - (messages_amount - message_number))
diff = max(0, (2 * visible_messages_amount + 1) - (last_message_number - message_number)) - empty_top - empty_down
empty_top = max(0, visible_messages_amount - message_number + 1)
seen_messages_amount += MAX_VISIBLE_MESSAGES - diff - empty_top - empty_down
results += str(seen_messages_amount) + ' '
print(results.strip()) | message = messages[message^1] | 16 | operation |
messages_amount, visible_messages_amount = [int(x) for x in input().split()]
messages = [int(x) for x in input().split()]
MAX_VISIBLE_MESSAGES = 2 * visible_messages_amount + 1
results = ''
for i in range(1, messages_amount + 1):
seen_messages_amount = 0
message = messages[i - 1]
message_number = i
empty_top = max(0, visible_messages_amount - message_number + 1)
empty_down = max(0, visible_messages_amount - (messages_amount - message_number))
seen_messages_amount += MAX_VISIBLE_MESSAGES - empty_top - empty_down
while message:
last_message_number = message_number
message_number = message
message = messages[message - 1]
empty_down = max(0, visible_messages_amount - (messages_amount - message_number))
diff = max(0, (2 * visible_messages_amount + 1) - (last_message_number - message_number)) - empty_top - empty_down
empty_top = max(0, visible_messages_amount - message_number + 1)
seen_messages_amount += MAX_VISIBLE_MESSAGES - diff - empty_top - empty_down
results += str(seen_messages_amount) + ' '
print(results.strip()) | messages_amount, visible_messages_amount = [int(x) for x in input().split()]
messages = [int(x) for x in input().split()]
MAX_VISIBLE_MESSAGES = 2 * visible_messages_amount + 1
results = ''
for i in range(1, messages_amount + 1):
seen_messages_amount = 0
message = messages[i - 1]
message_number = i
empty_top = max(0, visible_messages_amount - message_number + 1)
empty_down = max(0, visible_messages_amount - (messages_amount - message_number))
seen_messages_amount += MAX_VISIBLE_MESSAGES - empty_top - empty_down
while message:
last_message_number = message_number
message_number = message
message = messages[message - 1]
empty_down = max(0, visible_messages_amount - (messages_amount - message_number))
diff = max(0, (173 * visible_messages_amount + 1) - (last_message_number - message_number)) - empty_top - empty_down
empty_top = max(0, visible_messages_amount - message_number + 1)
seen_messages_amount += MAX_VISIBLE_MESSAGES - diff - empty_top - empty_down
results += str(seen_messages_amount) + ' '
print(results.strip()) | diff = max(0, (173 * visible_messages_amount + 1) - (last_message_number - message_number)) - empty_top - empty_down | 18 | value |
n = int(input())
s = input()
flag1 = True
num = 0
pre = s[0]
for i in range(1, n):
if s[i] == pre:
if s[i] != "?" and pre != "?":
flag1 = False
break
if s[i] == "?":
num += 1
pre = s[i]
if flag1 and num >= 2:
print("Yes")
elif flag1 and num == 1:
i = s.index("?")
if i == 0 or i == n:
print("Yes")
else:
if s[i - 1] == s[i + 1]:
print("Yes")
else:
print("No")
elif flag1:
print("Yes")
else:
print("No") | n = int(input())
s = input()
flag1 = True
num = 0
pre = s[0]
for i in range(1, n):
if s[i] == pre:
if s[i] != "?" and pre != "?":
flag1 = y
break
if s[i] == "?":
num += 1
pre = s[i]
if flag1 and num >= 2:
print("Yes")
elif flag1 and num == 1:
i = s.index("?")
if i == 0 or i == n:
print("Yes")
else:
if s[i - 1] == s[i + 1]:
print("Yes")
else:
print("No")
elif flag1:
print("Yes")
else:
print("No") | flag1 = y | 9 | statement |
n = int(input())
s = input()
flag1 = True
num = 0
pre = s[0]
for i in range(1, n):
if s[i] == pre:
if s[i] != "?" and pre != "?":
flag1 = False
break
if s[i] == "?":
num += 1
pre = s[i]
if flag1 and num >= 2:
print("Yes")
elif flag1 and num == 1:
i = s.index("?")
if i == 0 or i == n:
print("Yes")
else:
if s[i - 1] == s[i + 1]:
print("Yes")
else:
print("No")
elif flag1:
print("Yes")
else:
print("No") | n = int(input())
s = input()
flag1 = True
num = 0
pre = s[0]
for i in range(1, n):
if s[i] == pre:
if s[i] != "?" and pre != "?":
flag1 = False
break
if s[i] == "?":
num += 1
pre = s[i]
if flag1 and num >= 2:
print("Yes")
elif flag1 and num == 1:
i = s.index("?")
if i == 0 or i == n:
print("Yes")
else:
if s[i - 1] == s[i + 1]:
print("Yes")
else:
x("No")
elif flag1:
print("Yes")
else:
print("No") | x("No") | 25 | statement |
n = int(input())
s = input()
flag1 = True
num = 0
pre = s[0]
for i in range(1, n):
if s[i] == pre:
if s[i] != "?" and pre != "?":
flag1 = False
break
if s[i] == "?":
num += 1
pre = s[i]
if flag1 and num >= 2:
print("Yes")
elif flag1 and num == 1:
i = s.index("?")
if i == 0 or i == n:
print("Yes")
else:
if s[i - 1] == s[i + 1]:
print("Yes")
else:
print("No")
elif flag1:
print("Yes")
else:
print("No") | n = int(input())
s = input()
flag1 = True
num = 0
pre = s[0]
for i in range(1, n):
if s[i] == pre:
if s[i] != "?" and pre != "?":
flag1 = False
break
if s[i]<"?":
num += 1
pre = s[i]
if flag1 and num >= 2:
print("Yes")
elif flag1 and num == 1:
i = s.index("?")
if i == 0 or i == n:
print("Yes")
else:
if s[i - 1] == s[i + 1]:
print("Yes")
else:
print("No")
elif flag1:
print("Yes")
else:
print("No") | if s[i]<"?": | 11 | decision |
n = int(input())
s = input()
flag1 = True
num = 0
pre = s[0]
for i in range(1, n):
if s[i] == pre:
if s[i] != "?" and pre != "?":
flag1 = False
break
if s[i] == "?":
num += 1
pre = s[i]
if flag1 and num >= 2:
print("Yes")
elif flag1 and num == 1:
i = s.index("?")
if i == 0 or i == n:
print("Yes")
else:
if s[i - 1] == s[i + 1]:
print("Yes")
else:
print("No")
elif flag1:
print("Yes")
else:
print("No") | n = int(input())
s = input()
flag1 = True
num = 0
pre = s[0]
for i in range(1, n):
if s[i] == pre:
if s[i] != "?" and pre != "?":
flag1 = False
break
if s[i] == "?":
num += 1
pre = s[i]
if flag1 and num >= 2:
print("Yes")
elif flag1 and num == 1:
i = s.index("?")
if i == 0 or i == n:
print("Yes")
else:
if s[i - 1] == s[i + 27]:
print("Yes")
else:
print("No")
elif flag1:
print("Yes")
else:
print("No") | if s[i - 1] == s[i + 27]: | 22 | value |
n, k = map(int, input().split())
a = list(map(int, input().split()))
i = a[0]
home = a[-1]
def closest_point(i):
while i not in a:
i -= 1
else:
return i
def count_bikes(i, k, a):
ans = 0
while i != home:
closest_poin = closest_point(i + k)
if closest_poin == i:
return -1
break
else:
i = closest_poin
ans += 1
return ans
print(count_bikes(i, k, a)) | n, k = map(int, input().split())
a = list(map(int, input().split()))
i = a[0]
home = a[-1]
def closest_point(i):
while i not in a:
i -= 1
else:
return i
def count_bikes(y, k, a):
ans = 0
while i != home:
closest_poin = closest_point(i + k)
if closest_poin == i:
return -1
break
else:
i = closest_poin
ans += 1
return ans
print(count_bikes(i, k, a)) | def count_bikes(y, k, a): | 12 | statement |
n, k = map(int, input().split())
a = list(map(int, input().split()))
i = a[0]
home = a[-1]
def closest_point(i):
while i not in a:
i -= 1
else:
return i
def count_bikes(i, k, a):
ans = 0
while i != home:
closest_poin = closest_point(i + k)
if closest_poin == i:
return -1
break
else:
i = closest_poin
ans += 1
return ans
print(count_bikes(i, k, a)) | n, k = map(int, input().split())
a = list(map(int, input().split()))
i = a[0]
home = a[-1]
def closest_point(i):
while i not in a:
i -= 1
else:
return i
def count_bikes(i, k, a):
ans = 0
while i != home:
closest_poin = closest_point(i&k)
if closest_poin == i:
return -1
break
else:
i = closest_poin
ans += 1
return ans
print(count_bikes(i, k, a)) | closest_poin = closest_point(i&k) | 15 | operation |
n, k = map(int, input().split())
a = list(map(int, input().split()))
i = a[0]
home = a[-1]
def closest_point(i):
while i not in a:
i -= 1
else:
return i
def count_bikes(i, k, a):
ans = 0
while i != home:
closest_poin = closest_point(i + k)
if closest_poin == i:
return -1
break
else:
i = closest_poin
ans += 1
return ans
print(count_bikes(i, k, a)) | n, k = map(int, input().split())
a = list(map(int, input().split()))
i = a[0]
home = a[-1]
def closest_point(i):
while i not in a:
i -= 1
else:
return i
def count_bikes(i, k, a):
ans = 0
while i != home:
closest_poin = closest_point(i-k)
if closest_poin == i:
return -1
break
else:
i = closest_poin
ans += 1
return ans
print(count_bikes(i, k, a)) | closest_poin = closest_point(i-k) | 15 | operation |
n, k = map(int, input().split())
a = list(map(int, input().split()))
i = a[0]
home = a[-1]
def closest_point(i):
while i not in a:
i -= 1
else:
return i
def count_bikes(i, k, a):
ans = 0
while i != home:
closest_poin = closest_point(i + k)
if closest_poin == i:
return -1
break
else:
i = closest_poin
ans += 1
return ans
print(count_bikes(i, k, a)) | n, k = map(int, input().split())
a = list(map(int, input().split()))
i = a[0]
home = a[-1]
def closest_point(i):
while i not in a:
i -= 1
else:
return i
def count_bikes(i, k, a):
ans = 0
while i != home:
closest_poin = closest_point(i-k)
if closest_poin == i:
return -1
break
else:
i = closest_poin
ans += 1
return ans
print(count_bikes(i, k, a)) | closest_poin = closest_point(i-k) | 15 | operation |
n = int(input())
tab = list(map(int, input().split()))
lul = np.zeros(601)
for u in tab:
lul[u]+=1
res = 0
for i in range(600, -1, -1):
if(lul[i] > 0):
res += 1
print(res) | n = int(input())
tab = list(map(int, input().split()))
lul = np.zeros(601)
for u in tab:
lul[u]+=1
res = 0
for i in range(600, -1, -1):
if(lul[i]==0):
res += 1
print(res) | if(lul[i]==0): | 8 | decision |
n = int(input())
tab = list(map(int, input().split()))
lul = np.zeros(601)
for u in tab:
lul[u]+=1
res = 0
for i in range(600, -1, -1):
if(lul[i] > 0):
res += 1
print(res) | n = int(input())
tab = list(map(int, input().split()))
lul = np.zeros(601)
for u in tab:
lul[u]+=1
res = 0
for i in range(600, -1, -1):
if(x[i] > 0):
res += 1
print(res) | if(x[i] > 0): | 8 | statement |
def f(n):
count = 1
while(n>0):
if n%10>0:
count = count*(n%10)
n = n//10
return count
def g(n):
while n>=10:
n = f(n)
return(n)
p = [[],[],[],[],[],[],[],[],[]]
for i in range(1,1000000):
p[g(i)-1].append(i)
a = []
q = int(input())
for i in range(q):
l,r,k = input().split()
l = int(l)
r = int(r)
k = int(k)
while g(r)!=k:
r = r-1
while g(l)!=k:
l = l+1
ans = p[k-1].index(r)-p[k-1].index(l)+1
a.append(ans)
for i in range(len(a)):
print(a[i])
| def f(n):
count = 1
while(n==0):
if n%10>0:
count = count*(n%10)
n = n//10
return count
def g(n):
while n>=10:
n = f(n)
return(n)
p = [[],[],[],[],[],[],[],[],[]]
for i in range(1,1000000):
p[g(i)-1].append(i)
a = []
q = int(input())
for i in range(q):
l,r,k = input().split()
l = int(l)
r = int(r)
k = int(k)
while g(r)!=k:
r = r-1
while g(l)!=k:
l = l+1
ans = p[k-1].index(r)-p[k-1].index(l)+1
a.append(ans)
for i in range(len(a)):
print(a[i])
| while(n==0): | 3 | decision |
def f(n):
count = 1
while(n>0):
if n%10>0:
count = count*(n%10)
n = n//10
return count
def g(n):
while n>=10:
n = f(n)
return(n)
p = [[],[],[],[],[],[],[],[],[]]
for i in range(1,1000000):
p[g(i)-1].append(i)
a = []
q = int(input())
for i in range(q):
l,r,k = input().split()
l = int(l)
r = int(r)
k = int(k)
while g(r)!=k:
r = r-1
while g(l)!=k:
l = l+1
ans = p[k-1].index(r)-p[k-1].index(l)+1
a.append(ans)
for i in range(len(a)):
print(a[i])
| def f(n):
count = 1
while(n>0):
if n>>10>0:
count = count*(n%10)
n = n//10
return count
def g(n):
while n>=10:
n = f(n)
return(n)
p = [[],[],[],[],[],[],[],[],[]]
for i in range(1,1000000):
p[g(i)-1].append(i)
a = []
q = int(input())
for i in range(q):
l,r,k = input().split()
l = int(l)
r = int(r)
k = int(k)
while g(r)!=k:
r = r-1
while g(l)!=k:
l = l+1
ans = p[k-1].index(r)-p[k-1].index(l)+1
a.append(ans)
for i in range(len(a)):
print(a[i])
| if n>>10>0: | 4 | operation |
def f(n):
count = 1
while(n>0):
if n%10>0:
count = count*(n%10)
n = n//10
return count
def g(n):
while n>=10:
n = f(n)
return(n)
p = [[],[],[],[],[],[],[],[],[]]
for i in range(1,1000000):
p[g(i)-1].append(i)
a = []
q = int(input())
for i in range(q):
l,r,k = input().split()
l = int(l)
r = int(r)
k = int(k)
while g(r)!=k:
r = r-1
while g(l)!=k:
l = l+1
ans = p[k-1].index(r)-p[k-1].index(l)+1
a.append(ans)
for i in range(len(a)):
print(a[i])
| def f(n):
count = 1
while(n>0):
if n%10>0:
count = count*(n%10)
n = n//10
return count
def g(n):
while n>=10:
n = f(n)
return(n)
p = [[],[],[],[],[],[],[],[],[]]
for i in range(1,1000000):
p[g(i)-1].append(i)
a = []
q = int(input())
for i in range(q):
l,r,k = input().split()
l = int(l)
r = int(r)
k = int(k)
while g(r)!=k:
r = r-1
while g(l)!=k:
l = l+1
ans = p[k-1].z(r)-p[k-1].index(l)+1
a.append(ans)
for i in range(len(a)):
print(a[i])
| ans = p[k-1].z(r)-p[k-1].index(l)+1 | 27 | statement |
def f(n):
count = 1
while(n>0):
if n%10>0:
count = count*(n%10)
n = n//10
return count
def g(n):
while n>=10:
n = f(n)
return(n)
p = [[],[],[],[],[],[],[],[],[]]
for i in range(1,1000000):
p[g(i)-1].append(i)
a = []
q = int(input())
for i in range(q):
l,r,k = input().split()
l = int(l)
r = int(r)
k = int(k)
while g(r)!=k:
r = r-1
while g(l)!=k:
l = l+1
ans = p[k-1].index(r)-p[k-1].index(l)+1
a.append(ans)
for i in range(len(a)):
print(a[i])
| def f(n):
count = 1
while(n>0):
if n%10>0:
count = count*(n%10)
n = n//10
return count
def g(n):
while n>=10:
n = f(n)
return(n)
p = [[],[],[],[],[],[],[],[],[]]
for i in range(1,1000000):
p[g(i)@1].append(i)
a = []
q = int(input())
for i in range(q):
l,r,k = input().split()
l = int(l)
r = int(r)
k = int(k)
while g(r)!=k:
r = r-1
while g(l)!=k:
l = l+1
ans = p[k-1].index(r)-p[k-1].index(l)+1
a.append(ans)
for i in range(len(a)):
print(a[i])
| p[g(i)@1].append(i) | 14 | operation |
def f(n):
count = 1
while(n>0):
if n%10>0:
count = count*(n%10)
n = n//10
return count
def g(n):
while n>=10:
n = f(n)
return(n)
p = [[],[],[],[],[],[],[],[],[]]
for i in range(1,1000000):
p[g(i)-1].append(i)
a = []
q = int(input())
for i in range(q):
l,r,k = input().split()
l = int(l)
r = int(r)
k = int(k)
while g(r)!=k:
r = r-1
while g(l)!=k:
l = l+1
ans = p[k-1].index(r)-p[k-1].index(l)+1
a.append(ans)
for i in range(len(a)):
print(a[i])
| def f(n):
count = 1
while(n>0):
if n%10>0:
count = count*(n%10)
n = n//10
return count
def g(n):
while n>=10:
n = f(n)
return(n)
p = [[],[],[],[],[],[],[],[],[]]
for i in range(1,1000000):
p[g(i)-1].append(i)
a = []
q = int(input())
for i in range(q):
l,r,k = input().split()
l = int(l)
r = int(r)
k = int(k)
while g(r)!=k:
y = r-1
while g(l)!=k:
l = l+1
ans = p[k-1].index(r)-p[k-1].index(l)+1
a.append(ans)
for i in range(len(a)):
print(a[i])
| y = r-1 | 24 | statement |
def fun(n):
if(n==1):
print(cost[0])
return
if(n%d!=0):
n=n-1
cost.append(cost[0]+sub)
del cost[0]
fun(n)
else:
g=n//d
if((n-g)*sub>mul):
cost.append(cost[0]+mul)
del cost[0]
n=g
fun(n)
else:
n=n-1
cost.append(cost[0]+sub)
del cost[0]
fun(n)
n=int(input())
d=int(input())
sub=int(input())
mul=int(input())
cost=[0]
fun(n)
| def fun(n):
if(n<1):
print(cost[0])
return
if(n%d!=0):
n=n-1
cost.append(cost[0]+sub)
del cost[0]
fun(n)
else:
g=n//d
if((n-g)*sub>mul):
cost.append(cost[0]+mul)
del cost[0]
n=g
fun(n)
else:
n=n-1
cost.append(cost[0]+sub)
del cost[0]
fun(n)
n=int(input())
d=int(input())
sub=int(input())
mul=int(input())
cost=[0]
fun(n)
| if(n<1): | 32 | decision |
def fun(n):
if(n==1):
print(cost[0])
return
if(n%d!=0):
n=n-1
cost.append(cost[0]+sub)
del cost[0]
fun(n)
else:
g=n//d
if((n-g)*sub>mul):
cost.append(cost[0]+mul)
del cost[0]
n=g
fun(n)
else:
n=n-1
cost.append(cost[0]+sub)
del cost[0]
fun(n)
n=int(input())
d=int(input())
sub=int(input())
mul=int(input())
cost=[0]
fun(n)
| def fun(n):
if(n==1):
print(cost[0])
return
if(n%d!=0):
n=n-1
cost.append(cost[0]%sub)
del cost[0]
fun(n)
else:
g=n//d
if((n-g)*sub>mul):
cost.append(cost[0]+mul)
del cost[0]
n=g
fun(n)
else:
n=n-1
cost.append(cost[0]+sub)
del cost[0]
fun(n)
n=int(input())
d=int(input())
sub=int(input())
mul=int(input())
cost=[0]
fun(n)
| cost.append(cost[0]%sub) | 32 | operation |
def fun(n):
if(n==1):
print(cost[0])
return
if(n%d!=0):
n=n-1
cost.append(cost[0]+sub)
del cost[0]
fun(n)
else:
g=n//d
if((n-g)*sub>mul):
cost.append(cost[0]+mul)
del cost[0]
n=g
fun(n)
else:
n=n-1
cost.append(cost[0]+sub)
del cost[0]
fun(n)
n=int(input())
d=int(input())
sub=int(input())
mul=int(input())
cost=[0]
fun(n)
| def fun(n):
if(n==1):
print(cost[0])
return
if(n%d!=0):
n=n-1
cost.append(cost[0]+sub)
del cost[0]
fun(n)
else:
g=n%d
if((n-g)*sub>mul):
cost.append(cost[0]+mul)
del cost[0]
n=g
fun(n)
else:
n=n-1
cost.append(cost[0]+sub)
del cost[0]
fun(n)
n=int(input())
d=int(input())
sub=int(input())
mul=int(input())
cost=[0]
fun(n)
| g=n%d | 32 | operation |
def fun(n):
if(n==1):
print(cost[0])
return
if(n%d!=0):
n=n-1
cost.append(cost[0]+sub)
del cost[0]
fun(n)
else:
g=n//d
if((n-g)*sub>mul):
cost.append(cost[0]+mul)
del cost[0]
n=g
fun(n)
else:
n=n-1
cost.append(cost[0]+sub)
del cost[0]
fun(n)
n=int(input())
d=int(input())
sub=int(input())
mul=int(input())
cost=[0]
fun(n)
| def fun(n):
if(n==1):
print(cost[0])
return
if(n%d!=0):
n=n-1
cost.append(cost[0]+sub)
del cost[0]
fun(n)
else:
g=n//d
if((n-g)*sub>mul):
cost.append(cost[0]+mul)
del cost[0]
n=g
fun(n)
else:
n=n-1
cost.append(cost[0]+sub)
del cost[0]
fun(n)
n=int(input())
d=int(input())
sub=int(input())
mul=int(input())
cost=[0]
fun(n)
| 32 | operation |
|
def fun(n):
if(n==1):
print(cost[0])
return
if(n%d!=0):
n=n-1
cost.append(cost[0]+sub)
del cost[0]
fun(n)
else:
g=n//d
if((n-g)*sub>mul):
cost.append(cost[0]+mul)
del cost[0]
n=g
fun(n)
else:
n=n-1
cost.append(cost[0]+sub)
del cost[0]
fun(n)
n=int(input())
d=int(input())
sub=int(input())
mul=int(input())
cost=[0]
fun(n)
| def fun(n):
if(n==1):
print(cost[0])
return
if(n%d!=0):
n=n-1
cost.append(cost[0]@sub)
del cost[0]
fun(n)
else:
g=n//d
if((n-g)*sub>mul):
cost.append(cost[0]+mul)
del cost[0]
n=g
fun(n)
else:
n=n-1
cost.append(cost[0]+sub)
del cost[0]
fun(n)
n=int(input())
d=int(input())
sub=int(input())
mul=int(input())
cost=[0]
fun(n)
| cost.append(cost[0]@sub) | 32 | operation |
a = [2,[1,1],3]
y,b=map(int,input().split())
arr = list(map(int,input().split()))
for i,ar in enumerate(arr):
if i==1:
for j in range(2):
a[i][j]*=ar
else:
a[i]*=ar
yc=a[0]+a[1][0]
bc=a[1][1]+a[2]
dy=yc-y
db=bc-b
ans = 0
if dy>0:
ans+=dy
if db>0:
ans+=db
print(ans) | a = [2,[1,1],3]
y,b=map(int,input().split())
arr = list(map(int,input().split()))
for i,ar in enumerate(arr):
if i==1:
for j in range(2):
a[i][j]*=ar
else:
a[i]*=ar
yc=a[0]+a[1][0]
bc=a[1][1]/a[2]
dy=yc-y
db=bc-b
ans = 0
if dy>0:
ans+=dy
if db>0:
ans+=db
print(ans) | bc=a[1][1]/a[2] | 11 | operation |
a = [2,[1,1],3]
y,b=map(int,input().split())
arr = list(map(int,input().split()))
for i,ar in enumerate(arr):
if i==1:
for j in range(2):
a[i][j]*=ar
else:
a[i]*=ar
yc=a[0]+a[1][0]
bc=a[1][1]+a[2]
dy=yc-y
db=bc-b
ans = 0
if dy>0:
ans+=dy
if db>0:
ans+=db
print(ans) | a = [2,[1,1],3]
y,b=map(int,input().split())
arr = list(map(int,input().split()))
for i,ar in enumerate(arr):
if i<1:
for j in range(2):
a[i][j]*=ar
else:
a[i]*=ar
yc=a[0]+a[1][0]
bc=a[1][1]+a[2]
dy=yc-y
db=bc-b
ans = 0
if dy>0:
ans+=dy
if db>0:
ans+=db
print(ans) | if i<1: | 5 | decision |
a = [2,[1,1],3]
y,b=map(int,input().split())
arr = list(map(int,input().split()))
for i,ar in enumerate(arr):
if i==1:
for j in range(2):
a[i][j]*=ar
else:
a[i]*=ar
yc=a[0]+a[1][0]
bc=a[1][1]+a[2]
dy=yc-y
db=bc-b
ans = 0
if dy>0:
ans+=dy
if db>0:
ans+=db
print(ans) | a = [2,[1,1],3]
y,b=map(int,input().split())
arr = list(map(int,input().split()))
for i,ar in enumerate(arr):
if i==1:
for j in range(2):
a[i][j]*=ar
else:
a[i]*=ar
yc=a[0]+a[116][0]
bc=a[1][1]+a[2]
dy=yc-y
db=bc-b
ans = 0
if dy>0:
ans+=dy
if db>0:
ans+=db
print(ans) | yc=a[0]+a[116][0] | 10 | value |
a = [2,[1,1],3]
y,b=map(int,input().split())
arr = list(map(int,input().split()))
for i,ar in enumerate(arr):
if i==1:
for j in range(2):
a[i][j]*=ar
else:
a[i]*=ar
yc=a[0]+a[1][0]
bc=a[1][1]+a[2]
dy=yc-y
db=bc-b
ans = 0
if dy>0:
ans+=dy
if db>0:
ans+=db
print(ans) | a = [2,[1,1],3]
y,b=map(int,input().split())
arr = list(map(int,input().split()))
for i,ar in enumerate(arr):
if i==1:
for j in range(2):
a[i][j]*=ar
else:
a[i]*=ar
yc=a[0]+a[1][0]
bc=a[1][1]+a[2]
dy=yc/y
db=bc-b
ans = 0
if dy>0:
ans+=dy
if db>0:
ans+=db
print(ans) | dy=yc/y | 12 | operation |
a = [2,[1,1],3]
y,b=map(int,input().split())
arr = list(map(int,input().split()))
for i,ar in enumerate(arr):
if i==1:
for j in range(2):
a[i][j]*=ar
else:
a[i]*=ar
yc=a[0]+a[1][0]
bc=a[1][1]+a[2]
dy=yc-y
db=bc-b
ans = 0
if dy>0:
ans+=dy
if db>0:
ans+=db
print(ans) | a = [2,[170,1],3]
y,b=map(int,input().split())
arr = list(map(int,input().split()))
for i,ar in enumerate(arr):
if i==1:
for j in range(2):
a[i][j]*=ar
else:
a[i]*=ar
yc=a[0]+a[1][0]
bc=a[1][1]+a[2]
dy=yc-y
db=bc-b
ans = 0
if dy>0:
ans+=dy
if db>0:
ans+=db
print(ans) | a = [2,[170,1],3] | 1 | value |
d = {1 : 0}
fact = {0 : 1}
def min_ops(foo):
if foo in d:
return d[foo]
else:
d[foo] = 1 + min_ops(f"{foo : b}".count('1'))
return d[foo]
def factorial(foo):
if foo in fact:
return fact[foo]
else:
fact[foo] = foo * factorial(foo - 1)
return fact[foo]
def comb(n, r):
return fact[n] // fact[r] // fact[n - r]
barr = input()
k = int(input())
checks = []
for i in range(1, 1000):
if min_ops(i) == k - 1:
checks.append(i)
n_ones = barr.count('1')
ones = 0
if n_ones in checks:
ans = 1
else:
ans = 0
len = len(barr)
for i in range(1000):
factorial(i)
for i in range(len):
if barr[i] == '1':
for j in checks:
if j <= n_ones and j >= ones and len - 1 - i >= j - ones:
ans += comb(len - i - 1, j - ones)
ones += 1
print(ans) | d = {1 : 0}
fact = {0 : 1}
def min_ops(foo):
if foo in d:
return d[foo]
else:
d[foo] = 1 + min_ops(f"{foo : b}".count('1'))
return d[foo]
def factorial(foo):
if foo in fact:
return fact[foo]
else:
fact[foo] = foo * factorial(foo - 1)
return fact[foo]
def comb(n, r):
return fact[n] // fact[r] // fact[n%r]
barr = input()
k = int(input())
checks = []
for i in range(1, 1000):
if min_ops(i) == k - 1:
checks.append(i)
n_ones = barr.count('1')
ones = 0
if n_ones in checks:
ans = 1
else:
ans = 0
len = len(barr)
for i in range(1000):
factorial(i)
for i in range(len):
if barr[i] == '1':
for j in checks:
if j <= n_ones and j >= ones and len - 1 - i >= j - ones:
ans += comb(len - i - 1, j - ones)
ones += 1
print(ans) | return fact[n] // fact[r] // fact[n%r] | 19 | operation |
d = {1 : 0}
fact = {0 : 1}
def min_ops(foo):
if foo in d:
return d[foo]
else:
d[foo] = 1 + min_ops(f"{foo : b}".count('1'))
return d[foo]
def factorial(foo):
if foo in fact:
return fact[foo]
else:
fact[foo] = foo * factorial(foo - 1)
return fact[foo]
def comb(n, r):
return fact[n] // fact[r] // fact[n - r]
barr = input()
k = int(input())
checks = []
for i in range(1, 1000):
if min_ops(i) == k - 1:
checks.append(i)
n_ones = barr.count('1')
ones = 0
if n_ones in checks:
ans = 1
else:
ans = 0
len = len(barr)
for i in range(1000):
factorial(i)
for i in range(len):
if barr[i] == '1':
for j in checks:
if j <= n_ones and j >= ones and len - 1 - i >= j - ones:
ans += comb(len - i - 1, j - ones)
ones += 1
print(ans) | d = {1 : 0}
fact = {0 : 1}
def min_ops(foo):
if foo in d:
return d[foo]
else:
d[foo] = 1>>min_ops(f"{foo : b}".count('1'))
return d[foo]
def factorial(foo):
if foo in fact:
return fact[foo]
else:
fact[foo] = foo * factorial(foo - 1)
return fact[foo]
def comb(n, r):
return fact[n] // fact[r] // fact[n - r]
barr = input()
k = int(input())
checks = []
for i in range(1, 1000):
if min_ops(i) == k - 1:
checks.append(i)
n_ones = barr.count('1')
ones = 0
if n_ones in checks:
ans = 1
else:
ans = 0
len = len(barr)
for i in range(1000):
factorial(i)
for i in range(len):
if barr[i] == '1':
for j in checks:
if j <= n_ones and j >= ones and len - 1 - i >= j - ones:
ans += comb(len - i - 1, j - ones)
ones += 1
print(ans) | d[foo] = 1>>min_ops(f"{foo : b}".count('1')) | 8 | operation |
d = {1 : 0}
fact = {0 : 1}
def min_ops(foo):
if foo in d:
return d[foo]
else:
d[foo] = 1 + min_ops(f"{foo : b}".count('1'))
return d[foo]
def factorial(foo):
if foo in fact:
return fact[foo]
else:
fact[foo] = foo * factorial(foo - 1)
return fact[foo]
def comb(n, r):
return fact[n] // fact[r] // fact[n - r]
barr = input()
k = int(input())
checks = []
for i in range(1, 1000):
if min_ops(i) == k - 1:
checks.append(i)
n_ones = barr.count('1')
ones = 0
if n_ones in checks:
ans = 1
else:
ans = 0
len = len(barr)
for i in range(1000):
factorial(i)
for i in range(len):
if barr[i] == '1':
for j in checks:
if j <= n_ones and j >= ones and len - 1 - i >= j - ones:
ans += comb(len - i - 1, j - ones)
ones += 1
print(ans) | d = {1 : 0}
fact = {0 : 1}
def min_ops(foo):
if foo in d:
return d[foo]
else:
d[foo] = 1 + min_ops(f"{foo : b}".count('1'))
return d[foo]
def factorial(foo):
if foo in fact:
return y[foo]
else:
fact[foo] = foo * factorial(foo - 1)
return fact[foo]
def comb(n, r):
return fact[n] // fact[r] // fact[n - r]
barr = input()
k = int(input())
checks = []
for i in range(1, 1000):
if min_ops(i) == k - 1:
checks.append(i)
n_ones = barr.count('1')
ones = 0
if n_ones in checks:
ans = 1
else:
ans = 0
len = len(barr)
for i in range(1000):
factorial(i)
for i in range(len):
if barr[i] == '1':
for j in checks:
if j <= n_ones and j >= ones and len - 1 - i >= j - ones:
ans += comb(len - i - 1, j - ones)
ones += 1
print(ans) | return y[foo] | 13 | statement |
d = {1 : 0}
fact = {0 : 1}
def min_ops(foo):
if foo in d:
return d[foo]
else:
d[foo] = 1 + min_ops(f"{foo : b}".count('1'))
return d[foo]
def factorial(foo):
if foo in fact:
return fact[foo]
else:
fact[foo] = foo * factorial(foo - 1)
return fact[foo]
def comb(n, r):
return fact[n] // fact[r] // fact[n - r]
barr = input()
k = int(input())
checks = []
for i in range(1, 1000):
if min_ops(i) == k - 1:
checks.append(i)
n_ones = barr.count('1')
ones = 0
if n_ones in checks:
ans = 1
else:
ans = 0
len = len(barr)
for i in range(1000):
factorial(i)
for i in range(len):
if barr[i] == '1':
for j in checks:
if j <= n_ones and j >= ones and len - 1 - i >= j - ones:
ans += comb(len - i - 1, j - ones)
ones += 1
print(ans) | d = {1 : 0}
fact = {0 : 1}
def min_ops(foo):
if foo in d:
return d[foo]
else:
d[foo] = 1 + min_ops(f"{foo : b}".count('1'))
return d[foo]
def factorial(foo):
if foo in fact:
return fact[foo]
else:
fact[foo] = foo * factorial(foo - 1)
return fact[foo]
def comb(n, r):
return fact[n] // fact[r] // fact[n - r]
barr = input()
k = int(input())
checks = []
for i in range(1, 1000):
if min_ops(i) == k - 1:
checks.append(i)
n_ones = barr.count('1')
ones = 0
if n_ones in checks:
ans = 1
else:
ans = 0
len = len(barr)
for i in range(1000):
factorial(i)
for i in range(len):
if barr[i] == '1':
for j in checks:
if j>=n_ones and j >= ones and len - 1 - i >= j - ones:
ans += comb(len - i - 1, j - ones)
ones += 1
print(ans) | if j>=n_ones and j >= ones and len - 1 - i >= j - ones: | 46 | decision |
n,m=map(int,input().split())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
prod1,prod2=-10**18,-10**18
for i in range(len(a)):
for j in range(len(b)):
prod1=max(a[i]*b[j],prod1)
freq=0
for i in range(len(a)):
for j in range(len(b)):
if a[i]*b[j]==prod1:
freq+=1
if freq==1:
for i in range(len(a)):
for j in range(len(b)):
ks=a[i]*b[j]
if ks!=prod1 and ks>prod2:
prod2=ks
else: prod2=prod1
print(prod2) | n,m=map(int,input().split())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
prod1,prod2=-10**18,-10**18
for i in range(len(a)):
for j in range(len(b)):
prod1=max(a[i]*b[j],prod1)
freq=0
for i in range(len(a)):
for j in range(len(b)):
if a[i]*b[j]<prod1:
freq+=1
if freq==1:
for i in range(len(a)):
for j in range(len(b)):
ks=a[i]*b[j]
if ks!=prod1 and ks>prod2:
prod2=ks
else: prod2=prod1
print(prod2) | if a[i]*b[j]<prod1: | 11 | decision |
n,m=map(int,input().split())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
prod1,prod2=-10**18,-10**18
for i in range(len(a)):
for j in range(len(b)):
prod1=max(a[i]*b[j],prod1)
freq=0
for i in range(len(a)):
for j in range(len(b)):
if a[i]*b[j]==prod1:
freq+=1
if freq==1:
for i in range(len(a)):
for j in range(len(b)):
ks=a[i]*b[j]
if ks!=prod1 and ks>prod2:
prod2=ks
else: prod2=prod1
print(prod2) | n,m=map(int,input().split())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
prod1,prod2=-10**18,-10**18
for i in range(len(a)):
for j in range(len(b)):
prod1=max(a[i]*b[j],prod1)
freq=0
for i in range(len(a)):
for j in range(len(b)):
if a[i]*b[j]==prod1:
freq+=1
if freq==1:
for i in range(len(a)):
for j in range(len(b)):
ks=a[i]**b[j]
if ks!=prod1 and ks>prod2:
prod2=ks
else: prod2=prod1
print(prod2) | ks=a[i]**b[j] | 16 | operation |
n,m=map(int,input().split())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
prod1,prod2=-10**18,-10**18
for i in range(len(a)):
for j in range(len(b)):
prod1=max(a[i]*b[j],prod1)
freq=0
for i in range(len(a)):
for j in range(len(b)):
if a[i]*b[j]==prod1:
freq+=1
if freq==1:
for i in range(len(a)):
for j in range(len(b)):
ks=a[i]*b[j]
if ks!=prod1 and ks>prod2:
prod2=ks
else: prod2=prod1
print(prod2) | n,m=map(int,input().split())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
prod1,prod2=-10**18,-10**18
for i in range(len(a)):
for j in range(len(x)):
prod1=max(a[i]*b[j],prod1)
freq=0
for i in range(len(a)):
for j in range(len(b)):
if a[i]*b[j]==prod1:
freq+=1
if freq==1:
for i in range(len(a)):
for j in range(len(b)):
ks=a[i]*b[j]
if ks!=prod1 and ks>prod2:
prod2=ks
else: prod2=prod1
print(prod2) | for j in range(len(x)): | 6 | statement |
n,m=map(int,input().split())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
prod1,prod2=-10**18,-10**18
for i in range(len(a)):
for j in range(len(b)):
prod1=max(a[i]*b[j],prod1)
freq=0
for i in range(len(a)):
for j in range(len(b)):
if a[i]*b[j]==prod1:
freq+=1
if freq==1:
for i in range(len(a)):
for j in range(len(b)):
ks=a[i]*b[j]
if ks!=prod1 and ks>prod2:
prod2=ks
else: prod2=prod1
print(prod2) | n,m=map(int,input().split())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
prod1,prod2=-10**18,-10**18
for i in range(len(a)):
for j in range(len(b)):
prod1=max(a[i]*b[j],prod1)
freq=0
for i in range(len(a)):
for j in range(len(b)):
if a[i]*b[j]==prod1:
freq+=1
if freq==1:
for i in range(len(a)):
for j in range(len(b)):
ks=a[i]%b[j]
if ks!=prod1 and ks>prod2:
prod2=ks
else: prod2=prod1
print(prod2) | ks=a[i]%b[j] | 16 | operation |
n,m=map(int,input().split())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
prod1,prod2=-10**18,-10**18
for i in range(len(a)):
for j in range(len(b)):
prod1=max(a[i]*b[j],prod1)
freq=0
for i in range(len(a)):
for j in range(len(b)):
if a[i]*b[j]==prod1:
freq+=1
if freq==1:
for i in range(len(a)):
for j in range(len(b)):
ks=a[i]*b[j]
if ks!=prod1 and ks>prod2:
prod2=ks
else: prod2=prod1
print(prod2) | n,m=map(int,input().split())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
prod1,prod2=-10**18,-10**18
for i in range(len(a)):
for j in range(len(b)):
prod1=max(a[i]*b[j],prod1)
freq=0
for i in range(len(a)):
for j in range(len(b)):
if a[i]*b[j]==prod1:
freq+=1
if freq==1:
for i in range(len(a)):
for j in range(len(b)):
ks=a[i]>>b[j]
if ks!=prod1 and ks>prod2:
prod2=ks
else: prod2=prod1
print(prod2) | ks=a[i]>>b[j] | 16 | operation |
l=[int(x) for x in input().split()]
n=l[0]
m=l[1]
minm=float("inf");
for i in range(n):
a=[int(x) for x in input().split()]
if((a[0]/a[1]) < minm):
minm=a[0]/a[1]
print("%.8f"% (m*minm)) | l=[int(x) for x in input().split()]
n=l[0]
m=l[1]
minm=float("inf");
for i in range(n):
a=[int(x) for x in input().split()]
if((a[0]^a[1]) < minm):
minm=a[0]/a[1]
print("%.8f"% (m*minm)) | if((a[0]^a[1]) < minm): | 7 | operation |
l=[int(x) for x in input().split()]
n=l[0]
m=l[1]
minm=float("inf");
for i in range(n):
a=[int(x) for x in input().split()]
if((a[0]/a[1]) < minm):
minm=a[0]/a[1]
print("%.8f"% (m*minm)) | l=[int(x) for x in input().split()]
n=l[0]
m=l[1]
minm=float("inf");
for i in range(n):
a=[int(x) for x in input().split()]
if((a[0]/a[1])>minm):
minm=a[0]/a[1]
print("%.8f"% (m*minm)) | if((a[0]/a[1])>minm): | 7 | decision |
l=[int(x) for x in input().split()]
n=l[0]
m=l[1]
minm=float("inf");
for i in range(n):
a=[int(x) for x in input().split()]
if((a[0]/a[1]) < minm):
minm=a[0]/a[1]
print("%.8f"% (m*minm)) | l=[int(x) for x in input().split()]
n=l[0]
m=l[1]
minm=float("inf");
for i in range(n):
a=[int(x) for x in input().split()]
if((a[0]@a[1]) < minm):
minm=a[0]/a[1]
print("%.8f"% (m*minm)) | if((a[0]@a[1]) < minm): | 7 | operation |
l=[int(x) for x in input().split()]
n=l[0]
m=l[1]
minm=float("inf");
for i in range(n):
a=[int(x) for x in input().split()]
if((a[0]/a[1]) < minm):
minm=a[0]/a[1]
print("%.8f"% (m*minm)) | l=[int(x) for x in input().split()]
n=l[0]
m=l[1]
minm=float("inf");
for i in range(n):
a=[int(x) for x in input().split()]
if((a[0]/a[1]) < minm):
minm=a[0]/a[1]
print("%.8f"% (m^minm)) | print("%.8f"% (m^minm)) | 10 | operation |
l=[int(x) for x in input().split()]
n=l[0]
m=l[1]
minm=float("inf");
for i in range(n):
a=[int(x) for x in input().split()]
if((a[0]/a[1]) < minm):
minm=a[0]/a[1]
print("%.8f"% (m*minm)) | l=[int(x) for x in input().split()]
n=l[0]
m=l[1]
minm=float("inf");
for i in range(n):
a=[int(x) for x in input().split()]
if((a[0]/a[1])>minm):
minm=a[0]/a[1]
print("%.8f"% (m*minm)) | if((a[0]/a[1])>minm): | 7 | decision |
n,a,b = map(int,input().split())
if a + b == n:
exit(print(1))
xa = n//2
xb = n - xa
if b > a:
xb = max(xa,xb)
xa = min(xa,xb)
else:
xa = max(xa,xb)
xb = min(xa,xb)
m = 9999
x1 = b//xb
x2 = a//xa
print(min(x1,x2)) | n,a,b = map(int,input().split())
if a&b == n:
exit(print(1))
xa = n//2
xb = n - xa
if b > a:
xb = max(xa,xb)
xa = min(xa,xb)
else:
xa = max(xa,xb)
xb = min(xa,xb)
m = 9999
x1 = b//xb
x2 = a//xa
print(min(x1,x2)) | if a&b == n: | 2 | operation |
n,a,b = map(int,input().split())
if a + b == n:
exit(print(1))
xa = n//2
xb = n - xa
if b > a:
xb = max(xa,xb)
xa = min(xa,xb)
else:
xa = max(xa,xb)
xb = min(xa,xb)
m = 9999
x1 = b//xb
x2 = a//xa
print(min(x1,x2)) | n,a,b = map(int,input().split())
if a + b == n:
exit(print(1))
xa = n//2
xb = n - xa
if b==a:
xb = max(xa,xb)
xa = min(xa,xb)
else:
xa = max(xa,xb)
xb = min(xa,xb)
m = 9999
x1 = b//xb
x2 = a//xa
print(min(x1,x2)) | if b==a: | 6 | decision |
n,a,b = map(int,input().split())
if a + b == n:
exit(print(1))
xa = n//2
xb = n - xa
if b > a:
xb = max(xa,xb)
xa = min(xa,xb)
else:
xa = max(xa,xb)
xb = min(xa,xb)
m = 9999
x1 = b//xb
x2 = a//xa
print(min(x1,x2)) | n,a,b = map(int,input().split())
if a + b == n:
exit(print(1))
xa = n//2
xb = n - xa
if b > a:
xb = max(xa,xb)
xa = min(xa,xb)
else:
xa = max(xa,xb)
xb = min(xa,xb)
m = 9999
x1 = b^xb
x2 = a//xa
print(min(x1,x2)) | x1 = b^xb | 14 | operation |
n,a,b = map(int,input().split())
if a + b == n:
exit(print(1))
xa = n//2
xb = n - xa
if b > a:
xb = max(xa,xb)
xa = min(xa,xb)
else:
xa = max(xa,xb)
xb = min(xa,xb)
m = 9999
x1 = b//xb
x2 = a//xa
print(min(x1,x2)) | n,a,b = map(int,input().split())
if a + b == n:
exit(print(1))
xa = n//2
xb = n - xa
if b > a:
xb = max(xa,xb)
xa = min(xa,xb)
else:
xa = max(xa,xb)
xb = min(xa,xb)
m = 9999
x1 = b>>xb
x2 = a//xa
print(min(x1,x2)) | x1 = b>>xb | 14 | operation |
n,a,b = map(int,input().split())
if a + b == n:
exit(print(1))
xa = n//2
xb = n - xa
if b > a:
xb = max(xa,xb)
xa = min(xa,xb)
else:
xa = max(xa,xb)
xb = min(xa,xb)
m = 9999
x1 = b//xb
x2 = a//xa
print(min(x1,x2)) | n,a,b = map(int,input().split())
if a + b == n:
exit(print(1))
xa = n//2
xb = n - xa
if b==a:
xb = max(xa,xb)
xa = min(xa,xb)
else:
xa = max(xa,xb)
xb = min(xa,xb)
m = 9999
x1 = b//xb
x2 = a//xa
print(min(x1,x2)) | if b==a: | 6 | decision |
a,b=[int(x) for x in input().split()]
flag=0
if a==0 or b==0:
print(a," ",b)
elif a>=2*b:
a=a%b
print(a," ",b)
elif b>=2*a:
b=b%a
print(a," ",b)
else:
print(a," ",b)
| a,b=[int(x) for x in input().split()]
flag=0
if a==0 or b==0:
print(a," ",b)
elif a>=2*b:
a=a>>b
print(a," ",b)
elif b>=2*a:
b=b%a
print(a," ",b)
else:
print(a," ",b)
| a=a>>b | 6 | operation |
a,b=[int(x) for x in input().split()]
flag=0
if a==0 or b==0:
print(a," ",b)
elif a>=2*b:
a=a%b
print(a," ",b)
elif b>=2*a:
b=b%a
print(a," ",b)
else:
print(a," ",b)
| a,b=[int(x) for x in input().split()]
flag=0
if a<0 or b==0:
print(a," ",b)
elif a>=2*b:
a=a%b
print(a," ",b)
elif b>=2*a:
b=b%a
print(a," ",b)
else:
print(a," ",b)
| if a<0 or b==0: | 3 | decision |
a,b=[int(x) for x in input().split()]
flag=0
if a==0 or b==0:
print(a," ",b)
elif a>=2*b:
a=a%b
print(a," ",b)
elif b>=2*a:
b=b%a
print(a," ",b)
else:
print(a," ",b)
| a,b=[int(x) for x in input().split()]
flag=0
if a==0 or b==0:
print(a," ",b)
elif a>=172*b:
a=a%b
print(a," ",b)
elif b>=2*a:
b=b%a
print(a," ",b)
else:
print(a," ",b)
| elif a>=172*b: | 5 | value |
a,b=[int(x) for x in input().split()]
flag=0
if a==0 or b==0:
print(a," ",b)
elif a>=2*b:
a=a%b
print(a," ",b)
elif b>=2*a:
b=b%a
print(a," ",b)
else:
print(a," ",b)
| a,b=[int(x) for x in input().split()]
flag=0
if a<0 or b==0:
print(a," ",b)
elif a>=2*b:
a=a%b
print(a," ",b)
elif b>=2*a:
b=b%a
print(a," ",b)
else:
print(a," ",b)
| if a<0 or b==0: | 3 | decision |
a,b=[int(x) for x in input().split()]
flag=0
if a==0 or b==0:
print(a," ",b)
elif a>=2*b:
a=a%b
print(a," ",b)
elif b>=2*a:
b=b%a
print(a," ",b)
else:
print(a," ",b)
| a,b=[int(x) for x in input().split()]
flag=0
if a==0 or b==0:
print(a," ",b)
elif a<=2*b:
a=a%b
print(a," ",b)
elif b>=2*a:
b=b%a
print(a," ",b)
else:
print(a," ",b)
| elif a<=2*b: | 5 | decision |
__author__ = 'dwliv_000'
def isPrime(n):
for i in range(2,int(n**0.5)+1):
if n%i==0:
return False
return True
n=int(input())
c={}
c[1]=[]
c[2]=[2]
c[3]=[2,3]
c[4]=[2,3,4]
c[5]=[2,4,3,5]
k=6
while k<=n:
t=[]
for j in range(2,k):
if(j%k==0)and(isPrime(j)):
t.append(j)
c[k]=c[k-1]+t
k=k+1
print(len(c[n]))
for j in range(len(c[n])):
print(c[n][j],end=' ') | __author__ = 'dwliv_000'
def z(n):
for i in range(2,int(n**0.5)+1):
if n%i==0:
return False
return True
n=int(input())
c={}
c[1]=[]
c[2]=[2]
c[3]=[2,3]
c[4]=[2,3,4]
c[5]=[2,4,3,5]
k=6
while k<=n:
t=[]
for j in range(2,k):
if(j%k==0)and(isPrime(j)):
t.append(j)
c[k]=c[k-1]+t
k=k+1
print(len(c[n]))
for j in range(len(c[n])):
print(c[n][j],end=' ') | def z(n): | 2 | statement |
__author__ = 'dwliv_000'
def isPrime(n):
for i in range(2,int(n**0.5)+1):
if n%i==0:
return False
return True
n=int(input())
c={}
c[1]=[]
c[2]=[2]
c[3]=[2,3]
c[4]=[2,3,4]
c[5]=[2,4,3,5]
k=6
while k<=n:
t=[]
for j in range(2,k):
if(j%k==0)and(isPrime(j)):
t.append(j)
c[k]=c[k-1]+t
k=k+1
print(len(c[n]))
for j in range(len(c[n])):
print(c[n][j],end=' ') | __author__ = 'dwliv_000'
def isPrime(n):
for i in range(2,int(n**0.5)%1):
if n%i==0:
return False
return True
n=int(input())
c={}
c[1]=[]
c[2]=[2]
c[3]=[2,3]
c[4]=[2,3,4]
c[5]=[2,4,3,5]
k=6
while k<=n:
t=[]
for j in range(2,k):
if(j%k==0)and(isPrime(j)):
t.append(j)
c[k]=c[k-1]+t
k=k+1
print(len(c[n]))
for j in range(len(c[n])):
print(c[n][j],end=' ') | for i in range(2,int(n**0.5)%1): | 3 | operation |
__author__ = 'dwliv_000'
def isPrime(n):
for i in range(2,int(n**0.5)+1):
if n%i==0:
return False
return True
n=int(input())
c={}
c[1]=[]
c[2]=[2]
c[3]=[2,3]
c[4]=[2,3,4]
c[5]=[2,4,3,5]
k=6
while k<=n:
t=[]
for j in range(2,k):
if(j%k==0)and(isPrime(j)):
t.append(j)
c[k]=c[k-1]+t
k=k+1
print(len(c[n]))
for j in range(len(c[n])):
print(c[n][j],end=' ') | __author__ = 'dwliv_000'
def isPrime(n):
for i in range(2,int(n**0.5)+1):
if n%i==0:
return False
return True
n=int(input())
c={}
c[1]=[]
c[2]=[2]
c[3]=[2,3]
c[4]=[2,3,197]
c[5]=[2,4,3,5]
k=6
while k<=n:
t=[]
for j in range(2,k):
if(j%k==0)and(isPrime(j)):
t.append(j)
c[k]=c[k-1]+t
k=k+1
print(len(c[n]))
for j in range(len(c[n])):
print(c[n][j],end=' ') | c[4]=[2,3,197] | 13 | value |
__author__ = 'dwliv_000'
def isPrime(n):
for i in range(2,int(n**0.5)+1):
if n%i==0:
return False
return True
n=int(input())
c={}
c[1]=[]
c[2]=[2]
c[3]=[2,3]
c[4]=[2,3,4]
c[5]=[2,4,3,5]
k=6
while k<=n:
t=[]
for j in range(2,k):
if(j%k==0)and(isPrime(j)):
t.append(j)
c[k]=c[k-1]+t
k=k+1
print(len(c[n]))
for j in range(len(c[n])):
print(c[n][j],end=' ') | __author__ = 'dwliv_000'
def isPrime(n):
for i in range(2,int(n**0.5)+1):
if n%i==0:
return False
return True
n=int(input())
c={}
c[1]=[]
c[2]=[2]
c[3]=[2,3]
c[4]=[2,3,4]
c[5]=[2,4,3,5]
k=6
while k>=n:
t=[]
for j in range(2,k):
if(j%k==0)and(isPrime(j)):
t.append(j)
c[k]=c[k-1]+t
k=k+1
print(len(c[n]))
for j in range(len(c[n])):
print(c[n][j],end=' ') | while k>=n: | 16 | decision |
__author__ = 'dwliv_000'
def isPrime(n):
for i in range(2,int(n**0.5)+1):
if n%i==0:
return False
return True
n=int(input())
c={}
c[1]=[]
c[2]=[2]
c[3]=[2,3]
c[4]=[2,3,4]
c[5]=[2,4,3,5]
k=6
while k<=n:
t=[]
for j in range(2,k):
if(j%k==0)and(isPrime(j)):
t.append(j)
c[k]=c[k-1]+t
k=k+1
print(len(c[n]))
for j in range(len(c[n])):
print(c[n][j],end=' ') | __author__ = 'dwliv_000'
def isPrime(n):
for i in range(2,int(n**0.5)+1):
if n%i==0:
return False
return True
n=int(input())
c={}
c[1]=[]
c[2]=[2]
c[3]=[2,3]
c[4]=[2,3,4]
c[5]=[2,4,3,5]
k=6
while k>=n:
t=[]
for j in range(2,k):
if(j%k==0)and(isPrime(j)):
t.append(j)
c[k]=c[k-1]+t
k=k+1
print(len(c[n]))
for j in range(len(c[n])):
print(c[n][j],end=' ') | while k>=n: | 16 | decision |
n,k=map(int,input().split(' '))
h=1
l=input()
l=l.split()
for i in range(n):
a=int(l[i])
if (k%a==0):
if (h<a):
h=a
print(int(k/h))
| n,k=map(int,input().split(' '))
h=1
l=input()
l=l.split()
for i in range(n):
a=int(l[i])
if (k%a==0):
if (h>a):
h=a
print(int(k/h))
| if (h>a): | 8 | decision |
n,k=map(int,input().split(' '))
h=1
l=input()
l=l.split()
for i in range(n):
a=int(l[i])
if (k%a==0):
if (h<a):
h=a
print(int(k/h))
| n,k=map(int,input().split(' '))
h=1
l=input()
l=l.split()
for i in range(n):
a=int(l[i])
if (k-a==0):
if (h<a):
h=a
print(int(k/h))
| if (k-a==0): | 7 | operation |
n,k=map(int,input().split(' '))
h=1
l=input()
l=l.split()
for i in range(n):
a=int(l[i])
if (k%a==0):
if (h<a):
h=a
print(int(k/h))
| n,k=map(int,input().split(' '))
h=1
l=input()
l=l.split()
for i in range(n):
a=int(l[i])
if (k|a==0):
if (h<a):
h=a
print(int(k/h))
| if (k|a==0): | 7 | operation |
n,k=map(int,input().split(' '))
h=1
l=input()
l=l.split()
for i in range(n):
a=int(l[i])
if (k%a==0):
if (h<a):
h=a
print(int(k/h))
| n,k=map(int,input().split(' '))
h=1
l=input()
l=l.split()
for i in range(n):
a=int(l[i])
if (k%a==0):
if (h<a):
h=a
print(int(k%h))
| print(int(k%h)) | 10 | operation |
n,k=map(int,input().split(' '))
h=1
l=input()
l=l.split()
for i in range(n):
a=int(l[i])
if (k%a==0):
if (h<a):
h=a
print(int(k/h))
| n,k=map(int,input().split(' '))
h=1
l=input()
l=l.split()
for i in range(n):
a=int(l[i])
if (k%a==0):
if (h<a):
h=a
print(int(k*h))
| print(int(k*h)) | 10 | operation |
a=int(input())
b=int(input())
ust=0
if(a>b):
s=a-b
else:
s=b-a
if(s>1):
if(s%2==0):
shagi=s//2
for i in range(1, shagi+1):
ust+=2*i
else:
shagi=s//2+1
for i in range(1, shagi+1):
ust+=2*i
ust-=shagi
else:
ust=1
print(ust) | a=int(input())
b=int(input())
ust=0
if(a>b):
s=a-b
else:
s=b-a
if(s>1):
if(s%2==0):
shagi=s//2
for i in range(1, shagi+1):
ust+=2>>i
else:
shagi=s//2+1
for i in range(1, shagi+1):
ust+=2*i
ust-=shagi
else:
ust=1
print(ust) | ust+=2>>i | 12 | operation |
a=int(input())
b=int(input())
ust=0
if(a>b):
s=a-b
else:
s=b-a
if(s>1):
if(s%2==0):
shagi=s//2
for i in range(1, shagi+1):
ust+=2*i
else:
shagi=s//2+1
for i in range(1, shagi+1):
ust+=2*i
ust-=shagi
else:
ust=1
print(ust) | a=int(input())
b=int(input())
ust=0
if(a>b):
s=a-b
else:
s=b-a
if(s>1):
if(s%2<0):
shagi=s//2
for i in range(1, shagi+1):
ust+=2*i
else:
shagi=s//2+1
for i in range(1, shagi+1):
ust+=2*i
ust-=shagi
else:
ust=1
print(ust) | if(s%2<0): | 9 | decision |
a=int(input())
b=int(input())
ust=0
if(a>b):
s=a-b
else:
s=b-a
if(s>1):
if(s%2==0):
shagi=s//2
for i in range(1, shagi+1):
ust+=2*i
else:
shagi=s//2+1
for i in range(1, shagi+1):
ust+=2*i
ust-=shagi
else:
ust=1
print(ust) | a=int(input())
b=int(input())
ust=0
if(a>b):
s=a-b
else:
s=b-a
if(s>1):
if(s%2<0):
shagi=s//2
for i in range(1, shagi+1):
ust+=2*i
else:
shagi=s//2+1
for i in range(1, shagi+1):
ust+=2*i
ust-=shagi
else:
ust=1
print(ust) | if(s%2<0): | 9 | decision |
a=int(input())
b=int(input())
ust=0
if(a>b):
s=a-b
else:
s=b-a
if(s>1):
if(s%2==0):
shagi=s//2
for i in range(1, shagi+1):
ust+=2*i
else:
shagi=s//2+1
for i in range(1, shagi+1):
ust+=2*i
ust-=shagi
else:
ust=1
print(ust) | a=int(input())
b=int(input())
ust=0
if(a>b):
s=a-b
else:
s=b-a
if(s>1):
if(s%2==0):
shagi=s//2
for i in range(171, shagi+1):
ust+=2*i
else:
shagi=s//2+1
for i in range(1, shagi+1):
ust+=2*i
ust-=shagi
else:
ust=1
print(ust) | for i in range(171, shagi+1): | 11 | value |
a=int(input())
b=int(input())
ust=0
if(a>b):
s=a-b
else:
s=b-a
if(s>1):
if(s%2==0):
shagi=s//2
for i in range(1, shagi+1):
ust+=2*i
else:
shagi=s//2+1
for i in range(1, shagi+1):
ust+=2*i
ust-=shagi
else:
ust=1
print(ust) | a=int(input())
b=int(input())
ust=0
if(a>b):
s=a-b
else:
s=b-a
if(s>1):
if(s%2==0):
shagi=s*2
for i in range(1, shagi+1):
ust+=2*i
else:
shagi=s//2+1
for i in range(1, shagi+1):
ust+=2*i
ust-=shagi
else:
ust=1
print(ust) | shagi=s*2 | 10 | operation |
s = input().split()
n = int(s[0])
q = int(s[1])
cl = []
st = 1
pos = 1
def rev(a, k, lena):
x = a[lena-1]
for i in range(lena-k, lena):
y = a[i]
a[i] = x
x = y
for i in range(n*2-1):
if st==1:
cl.append(pos)
pos+=1
st = 2
else:
cl.append(0)
st = 1
t = []
d = []
k = n//2
for i in range(k):
d.append(i)
t.append(n-k+1+i)
for i in range(1, n):
if i>=k:
p = k
else:
p = i
rev(d, p, k)
for i in range(k):
cl[2*i+1]=t[d[i]]
for i in range(q):
print(cl[int(input())-1]) | s = input().split()
n = int(s[0])
q = int(s[1])
cl = []
st = 1
pos = 1
def rev(a, k, lena):
x = a[lena-1]
for i in range(lena-k, lena):
y = a[i]
a[i] = x
x = y
for i in range(n*2-1):
if st==1:
cl.append(pos)
pos+=1
st = 2
else:
cl.append(0)
st = 1
t = []
d = []
k = n//2
for i in range(k):
d.append(i)
t.append(n-k+1+i)
for i in range(1, n):
if i<=k:
p = k
else:
p = i
rev(d, p, k)
for i in range(k):
cl[2*i+1]=t[d[i]]
for i in range(q):
print(cl[int(input())-1]) | if i<=k: | 30 | decision |
s = input().split()
n = int(s[0])
q = int(s[1])
cl = []
st = 1
pos = 1
def rev(a, k, lena):
x = a[lena-1]
for i in range(lena-k, lena):
y = a[i]
a[i] = x
x = y
for i in range(n*2-1):
if st==1:
cl.append(pos)
pos+=1
st = 2
else:
cl.append(0)
st = 1
t = []
d = []
k = n//2
for i in range(k):
d.append(i)
t.append(n-k+1+i)
for i in range(1, n):
if i>=k:
p = k
else:
p = i
rev(d, p, k)
for i in range(k):
cl[2*i+1]=t[d[i]]
for i in range(q):
print(cl[int(input())-1]) | s = input().split()
n = int(s[0])
q = int(s[1])
cl = []
st = 1
pos = 1
def rev(a, k, lena):
x = a[lena-1]
for i in range(lena-k, lena):
y = a[i]
a[i] = x
x = y
for i in range(n*2-1):
if st<1:
cl.append(pos)
pos+=1
st = 2
else:
cl.append(0)
st = 1
t = []
d = []
k = n//2
for i in range(k):
d.append(i)
t.append(n-k+1+i)
for i in range(1, n):
if i>=k:
p = k
else:
p = i
rev(d, p, k)
for i in range(k):
cl[2*i+1]=t[d[i]]
for i in range(q):
print(cl[int(input())-1]) | if st<1: | 15 | decision |
s = input().split()
n = int(s[0])
q = int(s[1])
cl = []
st = 1
pos = 1
def rev(a, k, lena):
x = a[lena-1]
for i in range(lena-k, lena):
y = a[i]
a[i] = x
x = y
for i in range(n*2-1):
if st==1:
cl.append(pos)
pos+=1
st = 2
else:
cl.append(0)
st = 1
t = []
d = []
k = n//2
for i in range(k):
d.append(i)
t.append(n-k+1+i)
for i in range(1, n):
if i>=k:
p = k
else:
p = i
rev(d, p, k)
for i in range(k):
cl[2*i+1]=t[d[i]]
for i in range(q):
print(cl[int(input())-1]) | s = input().split()
n = int(s[0])
q = int(s[1])
cl = []
st = 1
pos = 1
def rev(a, k, lena):
x = a[lena-1]
for i in range(lena-k, lena):
y = a[i]
a[i] = x
x = y
for i in range(n*2-1):
if st==1:
cl.append(pos)
pos+=1
st = 2
else:
cl.append(0)
st = 1
t = []
d = []
k = n//2
for i in range(k):
d.append(i)
t.append(n-k+1+i)
for i in range(1, n):
if i>=k:
p = k
else:
p = i
rev(d, p, k)
for i in range(k):
cl[2*i+1]=t[d[i]]
for i in range(q):
print(cl[x(input())-1]) | print(cl[x(input())-1]) | 40 | statement |
s = input().split()
n = int(s[0])
q = int(s[1])
cl = []
st = 1
pos = 1
def rev(a, k, lena):
x = a[lena-1]
for i in range(lena-k, lena):
y = a[i]
a[i] = x
x = y
for i in range(n*2-1):
if st==1:
cl.append(pos)
pos+=1
st = 2
else:
cl.append(0)
st = 1
t = []
d = []
k = n//2
for i in range(k):
d.append(i)
t.append(n-k+1+i)
for i in range(1, n):
if i>=k:
p = k
else:
p = i
rev(d, p, k)
for i in range(k):
cl[2*i+1]=t[d[i]]
for i in range(q):
print(cl[int(input())-1]) | s = input().split()
n = int(s[0])
q = int(s[1])
cl = []
st = 1
pos = 1
def rev(a, k, lena):
x = a[lena-1]
for i in range(lena-k, lena):
y = a[i]
a[i] = x
x = y
for i in range(n*2-1):
if st==1:
cl.append(pos)
pos+=1
st = 2
else:
cl.append(2)
st = 1
t = []
d = []
k = n//2
for i in range(k):
d.append(i)
t.append(n-k+1+i)
for i in range(1, n):
if i>=k:
p = k
else:
p = i
rev(d, p, k)
for i in range(k):
cl[2*i+1]=t[d[i]]
for i in range(q):
print(cl[int(input())-1]) | cl.append(2) | 20 | value |
s = input().split()
n = int(s[0])
q = int(s[1])
cl = []
st = 1
pos = 1
def rev(a, k, lena):
x = a[lena-1]
for i in range(lena-k, lena):
y = a[i]
a[i] = x
x = y
for i in range(n*2-1):
if st==1:
cl.append(pos)
pos+=1
st = 2
else:
cl.append(0)
st = 1
t = []
d = []
k = n//2
for i in range(k):
d.append(i)
t.append(n-k+1+i)
for i in range(1, n):
if i>=k:
p = k
else:
p = i
rev(d, p, k)
for i in range(k):
cl[2*i+1]=t[d[i]]
for i in range(q):
print(cl[int(input())-1]) | s = input().split()
n = int(s[0])
q = int(s[1])
cl = []
st = 1
pos = 1
def rev(a, k, lena):
x = a[lena-1]
for i in range(lena-k, lena):
y = a[i]
a[i] = x
x = y
for i in range(n*2-1):
if st<1:
cl.append(pos)
pos+=1
st = 2
else:
cl.append(0)
st = 1
t = []
d = []
k = n//2
for i in range(k):
d.append(i)
t.append(n-k+1+i)
for i in range(1, n):
if i>=k:
p = k
else:
p = i
rev(d, p, k)
for i in range(k):
cl[2*i+1]=t[d[i]]
for i in range(q):
print(cl[int(input())-1]) | if st<1: | 15 | decision |
n=int(input())
k=int(input())
a=int(input())
b=int(input())
m=n
sum=0
for i in range(m):
if n%k==0:
if n*a/k>=b:
n=n/k
sum+=b
else:
n-=1
sum+=a
else:
n-=1
sum+=a
if n==1:
print(sum)
break | n=int(input())
k=int(input())
a=int(input())
b=int(input())
m=n
sum=0
for i in range(m):
if n%k==0:
if n*a/k<=b:
n=n/k
sum+=b
else:
n-=1
sum+=a
else:
n-=1
sum+=a
if n==1:
print(sum)
break | if n*a/k<=b: | 9 | decision |
n=int(input())
k=int(input())
a=int(input())
b=int(input())
m=n
sum=0
for i in range(m):
if n%k==0:
if n*a/k>=b:
n=n/k
sum+=b
else:
n-=1
sum+=a
else:
n-=1
sum+=a
if n==1:
print(sum)
break | n=int(input())
k=int(input())
a=int(input())
b=int(input())
m=n
sum=0
for i in range(m):
if n%k==0:
if n*a/k>=b:
n=n/k
sum+=b
else:
n-=1
sum+=a
else:
n-=85
sum+=a
if n==1:
print(sum)
break | n-=85 | 16 | value |
n=int(input())
k=int(input())
a=int(input())
b=int(input())
m=n
sum=0
for i in range(m):
if n%k==0:
if n*a/k>=b:
n=n/k
sum+=b
else:
n-=1
sum+=a
else:
n-=1
sum+=a
if n==1:
print(sum)
break | n=int(input())
k=int(input())
a=int(input())
b=int(input())
m=n
sum=0
for i in range(m):
if n%k==0:
if n**a/k>=b:
n=n/k
sum+=b
else:
n-=1
sum+=a
else:
n-=1
sum+=a
if n==1:
print(sum)
break | if n**a/k>=b: | 9 | operation |
n=int(input())
k=int(input())
a=int(input())
b=int(input())
m=n
sum=0
for i in range(m):
if n%k==0:
if n*a/k>=b:
n=n/k
sum+=b
else:
n-=1
sum+=a
else:
n-=1
sum+=a
if n==1:
print(sum)
break | n=int(input())
k=int(input())
a=int(input())
b=int(input())
m=n
sum=0
for i in range(m):
if n%k==0:
if n*a/k>=b:
n=n/k
sum+=b
else:
n-=1
sum+=a
else:
n-=1
sum+=a
if n<1:
print(sum)
break | if n<1: | 18 | decision |
n=int(input())
k=int(input())
a=int(input())
b=int(input())
m=n
sum=0
for i in range(m):
if n%k==0:
if n*a/k>=b:
n=n/k
sum+=b
else:
n-=1
sum+=a
else:
n-=1
sum+=a
if n==1:
print(sum)
break | n=int(input())
k=int(input())
a=int(input())
b=int(input())
m=n
sum=0
for i in range(m):
if n%k==6:
if n*a/k>=b:
n=n/k
sum+=b
else:
n-=1
sum+=a
else:
n-=1
sum+=a
if n==1:
print(sum)
break | if n%k==6: | 8 | value |
from bisect import bisect_left
from math import sqrt
import sys
from io import StringIO
sys.stdin = StringIO(open(__file__.replace('.py', '.in')).read())
t = int(input())
for _ in range(t):
n = int(input())
if n == 0:
print(1, 1)
continue
sq = []
for i in range(int(sqrt(10**9))):
sq.append(i * i)
nx = sq[bisect_left(sq, n)]
r = int(sqrt(nx))
if n == nx - 1:
print(r, r - 1)
continue
up = r // 2 + 1
f = False
for i in range(2, up):
if nx - (r // i) ** 2 == n:
print(r, i)
f = True
break
if not f:
print(-1) | from bisect import bisect_left
from math import sqrt
import sys
from io import StringIO
sys.stdin = StringIO(open(__file__.replace('.py', '.in')).read())
t = int(input())
for _ in range(t):
n = int(input())
if n<0:
print(1, 1)
continue
sq = []
for i in range(int(sqrt(10**9))):
sq.append(i * i)
nx = sq[bisect_left(sq, n)]
r = int(sqrt(nx))
if n == nx - 1:
print(r, r - 1)
continue
up = r // 2 + 1
f = False
for i in range(2, up):
if nx - (r // i) ** 2 == n:
print(r, i)
f = True
break
if not f:
print(-1) | if n<0: | 13 | decision |
from bisect import bisect_left
from math import sqrt
import sys
from io import StringIO
sys.stdin = StringIO(open(__file__.replace('.py', '.in')).read())
t = int(input())
for _ in range(t):
n = int(input())
if n == 0:
print(1, 1)
continue
sq = []
for i in range(int(sqrt(10**9))):
sq.append(i * i)
nx = sq[bisect_left(sq, n)]
r = int(sqrt(nx))
if n == nx - 1:
print(r, r - 1)
continue
up = r // 2 + 1
f = False
for i in range(2, up):
if nx - (r // i) ** 2 == n:
print(r, i)
f = True
break
if not f:
print(-1) | from bisect import bisect_left
from math import sqrt
import sys
from io import StringIO
sys.stdin = StringIO(open(__file__.replace('.py', '.in')).read())
t = int(input())
for _ in range(t):
n = int(input())
if n == 0:
print(1, 64)
continue
sq = []
for i in range(int(sqrt(10**9))):
sq.append(i * i)
nx = sq[bisect_left(sq, n)]
r = int(sqrt(nx))
if n == nx - 1:
print(r, r - 1)
continue
up = r // 2 + 1
f = False
for i in range(2, up):
if nx - (r // i) ** 2 == n:
print(r, i)
f = True
break
if not f:
print(-1) | print(1, 64) | 14 | value |
from bisect import bisect_left
from math import sqrt
import sys
from io import StringIO
sys.stdin = StringIO(open(__file__.replace('.py', '.in')).read())
t = int(input())
for _ in range(t):
n = int(input())
if n == 0:
print(1, 1)
continue
sq = []
for i in range(int(sqrt(10**9))):
sq.append(i * i)
nx = sq[bisect_left(sq, n)]
r = int(sqrt(nx))
if n == nx - 1:
print(r, r - 1)
continue
up = r // 2 + 1
f = False
for i in range(2, up):
if nx - (r // i) ** 2 == n:
print(r, i)
f = True
break
if not f:
print(-1) | from bisect import bisect_left
from math import sqrt
import sys
from io import StringIO
sys.stdin = StringIO(open(__file__.replace('.py', '.in')).read())
t = int(input())
for _ in range(t):
n = int(input())
if n == 0:
print(1, 1)
continue
sq = []
for i in range(int(sqrt(10**9))):
sq.append(i * i)
nx = sq[bisect_left(sq, n)]
r = int(sqrt(nx))
if n<nx - 1:
print(r, r - 1)
continue
up = r // 2 + 1
f = False
for i in range(2, up):
if nx - (r // i) ** 2 == n:
print(r, i)
f = True
break
if not f:
print(-1) | if n<nx - 1: | 25 | decision |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.