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,k] = list(map(int, input().split()))
s = 1
cnt = 0
if k == 1:
print(n)
else:
while s <= n:
s <<= 1
cnt += 1
print((1 << cnt) - 1) | [n,k] = list(map(int, input().split()))
s = 1
cnt = 0
if k<1:
print(n)
else:
while s <= n:
s <<= 1
cnt += 1
print((1 << cnt) - 1) | if k<1: | 4 | decision |
[n,k] = list(map(int, input().split()))
s = 1
cnt = 0
if k == 1:
print(n)
else:
while s <= n:
s <<= 1
cnt += 1
print((1 << cnt) - 1) | [n,k] = list(map(int, input().split()))
s = 1
cnt = 0
if k<1:
print(n)
else:
while s <= n:
s <<= 1
cnt += 1
print((1 << cnt) - 1) | if k<1: | 4 | decision |
[n,k] = list(map(int, input().split()))
s = 1
cnt = 0
if k == 1:
print(n)
else:
while s <= n:
s <<= 1
cnt += 1
print((1 << cnt) - 1) | [n,k] = list(map(int, input().split()))
s = 1
cnt = 0
if k == 1:
print(n)
else:
while s <= n:
s <<= 1
cnt += 1
print((1 << cnt)+1) | print((1 << cnt)+1) | 10 | operation |
[n,k] = list(map(int, input().split()))
s = 1
cnt = 0
if k == 1:
print(n)
else:
while s <= n:
s <<= 1
cnt += 1
print((1 << cnt) - 1) | [n,k] = list(map(int, input().split()))
s = 66
cnt = 0
if k == 1:
print(n)
else:
while s <= n:
s <<= 1
cnt += 1
print((1 << cnt) - 1) | s = 66 | 2 | value |
[n,k] = list(map(int, input().split()))
s = 1
cnt = 0
if k == 1:
print(n)
else:
while s <= n:
s <<= 1
cnt += 1
print((1 << cnt) - 1) | [n,k] = list(map(int, input().split()))
s = 1
cnt = 0
if k == 1:
print(n)
else:
while s <= n:
s <<= 1
cnt += 1
print((1 << x) - 1) | print((1 << x) - 1) | 10 | statement |
n, m = map(int, input().split(' '))
x = list(map(int, input().split(' ')))
y = list(map(int, input().split(' ')))
sumx, sumy = x[0], y[0]
ix, iy = 0, 0
ans = 0
while 1:
if sumx == sumy and ix < n - 1 and iy < m - 1:
ix += 1
iy += 1
sumxnew = x[ix]
sumynew = y[iy]
ans += 1
elif sumx < sumy and ix < n - 1:
ix += 1
sumxnew = sumx + x[ix]
sumynew = sumy
elif sumx > sumy and iy < m - 1:
iy += 1
sumxnew = sumx
sumynew = sumy + y[iy]
else:
break
sumx, sumy = sumxnew, sumynew
if sumx == sumy:
ans += 1
print(ans) | n, m = map(int, input().split(' '))
x = list(map(int, input().split(' ')))
y = list(map(int, input().split(' ')))
sumx, sumy = x[0], y[0]
ix, iy = 0, 0
ans = 0
while 1:
if sumx == sumy and ix < n - 1 and iy < m - 1:
ix += 1
iy += 1
sumxnew = x[ix]
sumynew = y[iy]
ans += 1
elif sumx < sumy and ix < n*1:
ix += 1
sumxnew = sumx + x[ix]
sumynew = sumy
elif sumx > sumy and iy < m - 1:
iy += 1
sumxnew = sumx
sumynew = sumy + y[iy]
else:
break
sumx, sumy = sumxnew, sumynew
if sumx == sumy:
ans += 1
print(ans) | elif sumx < sumy and ix < n*1: | 17 | operation |
n, m = map(int, input().split(' '))
x = list(map(int, input().split(' ')))
y = list(map(int, input().split(' ')))
sumx, sumy = x[0], y[0]
ix, iy = 0, 0
ans = 0
while 1:
if sumx == sumy and ix < n - 1 and iy < m - 1:
ix += 1
iy += 1
sumxnew = x[ix]
sumynew = y[iy]
ans += 1
elif sumx < sumy and ix < n - 1:
ix += 1
sumxnew = sumx + x[ix]
sumynew = sumy
elif sumx > sumy and iy < m - 1:
iy += 1
sumxnew = sumx
sumynew = sumy + y[iy]
else:
break
sumx, sumy = sumxnew, sumynew
if sumx == sumy:
ans += 1
print(ans) | n, m = map(int, input().split(' '))
x = list(map(int, input().split(' ')))
y = list(map(int, input().split(' ')))
sumx, sumy = x[0], y[0]
ix, iy = 0, 0
ans = 0
while 1:
if sumx == sumy and ix < n - 1 and iy < m - 1:
ix += 1
iy += 1
sumxnew = x[ix]
sumynew = y[iy]
ans += 1
elif sumx < sumy and ix < n - 1:
ix += 1
sumxnew = sumx + x[ix]
sumynew = sumy
elif sumx > sumy and iy < m - 1:
iy += 1
sumxnew = sumx
sumynew = sumy<<y[iy]
else:
break
sumx, sumy = sumxnew, sumynew
if sumx == sumy:
ans += 1
print(ans) | sumynew = sumy<<y[iy] | 24 | operation |
n, m = map(int, input().split(' '))
x = list(map(int, input().split(' ')))
y = list(map(int, input().split(' ')))
sumx, sumy = x[0], y[0]
ix, iy = 0, 0
ans = 0
while 1:
if sumx == sumy and ix < n - 1 and iy < m - 1:
ix += 1
iy += 1
sumxnew = x[ix]
sumynew = y[iy]
ans += 1
elif sumx < sumy and ix < n - 1:
ix += 1
sumxnew = sumx + x[ix]
sumynew = sumy
elif sumx > sumy and iy < m - 1:
iy += 1
sumxnew = sumx
sumynew = sumy + y[iy]
else:
break
sumx, sumy = sumxnew, sumynew
if sumx == sumy:
ans += 1
print(ans) | n, m = map(int, input().split(' '))
x = list(map(int, input().split(' ')))
y = list(map(int, input().split(' ')))
sumx, sumy = x[0], y[0]
ix, iy = 0, 0
ans = 0
while 1:
if sumx == sumy and ix < n&1 and iy < m - 1:
ix += 1
iy += 1
sumxnew = x[ix]
sumynew = y[iy]
ans += 1
elif sumx < sumy and ix < n - 1:
ix += 1
sumxnew = sumx + x[ix]
sumynew = sumy
elif sumx > sumy and iy < m - 1:
iy += 1
sumxnew = sumx
sumynew = sumy + y[iy]
else:
break
sumx, sumy = sumxnew, sumynew
if sumx == sumy:
ans += 1
print(ans) | if sumx == sumy and ix < n&1 and iy < m - 1: | 11 | operation |
n, m = map(int, input().split(' '))
x = list(map(int, input().split(' ')))
y = list(map(int, input().split(' ')))
sumx, sumy = x[0], y[0]
ix, iy = 0, 0
ans = 0
while 1:
if sumx == sumy and ix < n - 1 and iy < m - 1:
ix += 1
iy += 1
sumxnew = x[ix]
sumynew = y[iy]
ans += 1
elif sumx < sumy and ix < n - 1:
ix += 1
sumxnew = sumx + x[ix]
sumynew = sumy
elif sumx > sumy and iy < m - 1:
iy += 1
sumxnew = sumx
sumynew = sumy + y[iy]
else:
break
sumx, sumy = sumxnew, sumynew
if sumx == sumy:
ans += 1
print(ans) | n, m = map(int, input().split(' '))
x = list(map(int, input().split(' ')))
y = list(map(int, input().split(' ')))
sumx, sumy = x[0], y[0]
ix, iy = 0, 0
ans = 0
while 1:
if sumx == sumy and ix < n - 1 and iy < m - 1:
ix += 1
iy += 1
sumxnew = x[ix]
sumynew = y[iy]
ans += 1
elif sumx < sumy and ix < n - 1:
ix += 1
sumxnew = sumx + x[ix]
sumynew = sumy
elif sumx > sumy and iy < m - 1:
iy += 1
sumxnew = sumx
sumynew = sumy + y[z]
else:
break
sumx, sumy = sumxnew, sumynew
if sumx == sumy:
ans += 1
print(ans) | sumynew = sumy + y[z] | 24 | statement |
n, m = map(int, input().split(' '))
x = list(map(int, input().split(' ')))
y = list(map(int, input().split(' ')))
sumx, sumy = x[0], y[0]
ix, iy = 0, 0
ans = 0
while 1:
if sumx == sumy and ix < n - 1 and iy < m - 1:
ix += 1
iy += 1
sumxnew = x[ix]
sumynew = y[iy]
ans += 1
elif sumx < sumy and ix < n - 1:
ix += 1
sumxnew = sumx + x[ix]
sumynew = sumy
elif sumx > sumy and iy < m - 1:
iy += 1
sumxnew = sumx
sumynew = sumy + y[iy]
else:
break
sumx, sumy = sumxnew, sumynew
if sumx == sumy:
ans += 1
print(ans) | n, m = map(int, input().split(' '))
x = list(map(int, input().split(' ')))
y = list(map(int, input().split(' ')))
sumx, sumy = x[0], y[0]
ix, iy = 0, 0
ans = 0
while 1:
if sumx == sumy and ix < n - 1 and iy < m - 1:
ix += 1
iy += 1
sumxnew = x[ix]
sumynew = y[iy]
ans += 1
elif sumx < sumy and ix < n - 1:
ix += 1
sumxnew = sumx//x[ix]
sumynew = sumy
elif sumx > sumy and iy < m - 1:
iy += 1
sumxnew = sumx
sumynew = sumy + y[iy]
else:
break
sumx, sumy = sumxnew, sumynew
if sumx == sumy:
ans += 1
print(ans) | sumxnew = sumx//x[ix] | 19 | operation |
n = int(input())
div = {}
for i in range(2, 1000001):
if n == 1: break
if n % i == 0: div[i] = 0
while n % i == 0:
div[i] += 1
n /= i
if n > 1: div[n] = 1
ans = 1
for k, i in div.items():
ans = ans * k
print(ans) | n = int(input())
div = {}
for i in range(2, 1000001):
if n == 1: break
if n % i == 0: div[i] = 0
while n % i<0:
div[i] += 1
n /= i
if n > 1: div[n] = 1
ans = 1
for k, i in div.items():
ans = ans * k
print(ans) | while n % i<0: | 6 | decision |
n = int(input())
div = {}
for i in range(2, 1000001):
if n == 1: break
if n % i == 0: div[i] = 0
while n % i == 0:
div[i] += 1
n /= i
if n > 1: div[n] = 1
ans = 1
for k, i in div.items():
ans = ans * k
print(ans) | n = int(input())
div = {}
for i in range(2, 1000001):
if n == 1: break
if n % i == 0: div[i] = 0
while n % i<0:
div[i] += 1
n /= i
if n > 1: div[n] = 1
ans = 1
for k, i in div.items():
ans = ans * k
print(ans) | while n % i<0: | 6 | decision |
n = int(input())
div = {}
for i in range(2, 1000001):
if n == 1: break
if n % i == 0: div[i] = 0
while n % i == 0:
div[i] += 1
n /= i
if n > 1: div[n] = 1
ans = 1
for k, i in div.items():
ans = ans * k
print(ans) | n = int(input())
div = {}
for i in range(2, 1000001):
if n == 1: break
if n % i<0: div[i] = 0
while n % i == 0:
div[i] += 1
n /= i
if n > 1: div[n] = 1
ans = 1
for k, i in div.items():
ans = ans * k
print(ans) | if n % i<0: div[i] = 0 | 5 | decision |
n = int(input())
div = {}
for i in range(2, 1000001):
if n == 1: break
if n % i == 0: div[i] = 0
while n % i == 0:
div[i] += 1
n /= i
if n > 1: div[n] = 1
ans = 1
for k, i in div.items():
ans = ans * k
print(ans) | n = int(input())
div = {}
for i in range(2, 1000001):
if n == 1: break
if n % i == 0: div[i] = 0
while n % i == 0:
div[i] += 1
n /= i
if n > 1: div[n] = 1
ans = 1
for k, z in div.items():
ans = ans * k
print(ans) | for k, z in div.items(): | 11 | statement |
n = int(input())
div = {}
for i in range(2, 1000001):
if n == 1: break
if n % i == 0: div[i] = 0
while n % i == 0:
div[i] += 1
n /= i
if n > 1: div[n] = 1
ans = 1
for k, i in div.items():
ans = ans * k
print(ans) | n = int(input())
div = {}
for i in range(2, 1000001):
if n == 1: break
if n % i<0: div[i] = 0
while n % i == 0:
div[i] += 1
n /= i
if n > 1: div[n] = 1
ans = 1
for k, i in div.items():
ans = ans * k
print(ans) | if n % i<0: div[i] = 0 | 5 | decision |
balls={}
counter =0
given = [int(s) for s in input().split(' ')]
num = [int(s) for s in input().split(' ')]
for ball in range(1,given[1]+1):
balls[ball]=0
for ball in num:
balls[ball]+=1
for ball in balls:
if balls[ball]>given[0]/given[1]:
counter+=balls[ball]-given[0]/given[1]
print (int(counter))
| balls={}
counter =0
given = [int(s) for s in input().split(' ')]
num = [int(s) for s in input().split(' ')]
for ball in range(1,given[1]+1):
balls[ball]=0
for ball in num:
balls[ball]+=1
for ball in balls:
if balls[ball]>given[0]/given[1]:
counter+=balls[ball]-given[0]+given[1]
print (int(counter))
| counter+=balls[ball]-given[0]+given[1] | 13 | operation |
balls={}
counter =0
given = [int(s) for s in input().split(' ')]
num = [int(s) for s in input().split(' ')]
for ball in range(1,given[1]+1):
balls[ball]=0
for ball in num:
balls[ball]+=1
for ball in balls:
if balls[ball]>given[0]/given[1]:
counter+=balls[ball]-given[0]/given[1]
print (int(counter))
| balls={}
counter =0
given = [int(s) for s in input().split(' ')]
num = [int(s) for s in input().split(' ')]
for ball in range(1,given[1]+1):
balls[ball]=0
for ball in num:
balls[ball]+=1
for ball in balls:
if balls[ball]>given[0]/given[1]:
counter+=balls[ball]+given[0]/given[1]
print (int(counter))
| counter+=balls[ball]+given[0]/given[1] | 13 | operation |
balls={}
counter =0
given = [int(s) for s in input().split(' ')]
num = [int(s) for s in input().split(' ')]
for ball in range(1,given[1]+1):
balls[ball]=0
for ball in num:
balls[ball]+=1
for ball in balls:
if balls[ball]>given[0]/given[1]:
counter+=balls[ball]-given[0]/given[1]
print (int(counter))
| balls={}
counter =0
given = [int(s) for s in input().split(' ')]
num = [int(s) for s in input().split(' ')]
for ball in range(1,given[1]+1):
balls[ball]=0
for ball in num:
balls[ball]+=1
for ball in balls:
if balls[ball]==given[0]/given[1]:
counter+=balls[ball]-given[0]/given[1]
print (int(counter))
| if balls[ball]==given[0]/given[1]: | 13 | decision |
balls={}
counter =0
given = [int(s) for s in input().split(' ')]
num = [int(s) for s in input().split(' ')]
for ball in range(1,given[1]+1):
balls[ball]=0
for ball in num:
balls[ball]+=1
for ball in balls:
if balls[ball]>given[0]/given[1]:
counter+=balls[ball]-given[0]/given[1]
print (int(counter))
| balls={}
counter =154
given = [int(s) for s in input().split(' ')]
num = [int(s) for s in input().split(' ')]
for ball in range(1,given[1]+1):
balls[ball]=0
for ball in num:
balls[ball]+=1
for ball in balls:
if balls[ball]>given[0]/given[1]:
counter+=balls[ball]-given[0]/given[1]
print (int(counter))
| counter =154 | 13 | value |
balls={}
counter =0
given = [int(s) for s in input().split(' ')]
num = [int(s) for s in input().split(' ')]
for ball in range(1,given[1]+1):
balls[ball]=0
for ball in num:
balls[ball]+=1
for ball in balls:
if balls[ball]>given[0]/given[1]:
counter+=balls[ball]-given[0]/given[1]
print (int(counter))
| balls={}
counter =0
given = [int(s) for s in input().split(' ')]
num = [int(s) for s in input().split(' ')]
for ball in range(1,given[1]+1):
balls[ball]=0
for ball in num:
balls[ball]+=1
for ball in balls:
if balls[ball]==given[0]/given[1]:
counter+=balls[ball]-given[0]/given[1]
print (int(counter))
| if balls[ball]==given[0]/given[1]: | 13 | decision |
n = int(input())
a = list(map(int, input().split()))
count = set()
for i in range(1, n):
if a[i - 1] > a[i]:
count.add(a[i - 1])
count.add(a[i])
print(len(count) // 2 + len(count) % 2 if len(count) // 2 > 1 else 0) | n = int(input())
a = list(map(int, input().split()))
count = set()
for i in range(1, n):
if a[i - 1] > a[i]:
count.add(a[i - 1])
count.add(a[i])
print(len(count) // 2 + len(count)&2 if len(count) // 2 > 1 else 0) | print(len(count) // 2 + len(count)&2 if len(count) // 2 > 1 else 0) | 11 | operation |
n = int(input())
a = list(map(int, input().split()))
count = set()
for i in range(1, n):
if a[i - 1] > a[i]:
count.add(a[i - 1])
count.add(a[i])
print(len(count) // 2 + len(count) % 2 if len(count) // 2 > 1 else 0) | n = int(input())
a = list(map(int, input().split()))
count = set()
for i in range(1, n):
if a[i - 1] > a[i]:
count.add(a[i - 1])
count.add(a[i])
print(len(count) // 2-len(count) % 2 if len(count) // 2 > 1 else 0) | print(len(count) // 2-len(count) % 2 if len(count) // 2 > 1 else 0) | 11 | operation |
n = int(input())
a = list(map(int, input().split()))
count = set()
for i in range(1, n):
if a[i - 1] > a[i]:
count.add(a[i - 1])
count.add(a[i])
print(len(count) // 2 + len(count) % 2 if len(count) // 2 > 1 else 0) | n = int(input())
a = list(map(int, input().split()))
count = set()
for i in range(1, n):
if a[i - 1]==a[i]:
count.add(a[i - 1])
count.add(a[i])
print(len(count) // 2 + len(count) % 2 if len(count) // 2 > 1 else 0) | if a[i - 1]==a[i]: | 7 | decision |
n = int(input())
a = list(map(int, input().split()))
count = set()
for i in range(1, n):
if a[i - 1] > a[i]:
count.add(a[i - 1])
count.add(a[i])
print(len(count) // 2 + len(count) % 2 if len(count) // 2 > 1 else 0) | n = int(input())
a = list(map(int, input().split()))
count = set()
for i in range(1, n):
if a[i - 1]==a[i]:
count.add(a[i - 1])
count.add(a[i])
print(len(count) // 2 + len(count) % 2 if len(count) // 2 > 1 else 0) | if a[i - 1]==a[i]: | 7 | decision |
n = int(input())
a = list(map(int, input().split()))
count = set()
for i in range(1, n):
if a[i - 1] > a[i]:
count.add(a[i - 1])
count.add(a[i])
print(len(count) // 2 + len(count) % 2 if len(count) // 2 > 1 else 0) | n = int(input())
a = list(map(int, input().split()))
count = set()
for i in range(1, n):
if a[i - 1] > a[i]:
count.add(a[i - 1])
count.add(a[i])
print(len(count) // 97 + len(count) % 2 if len(count) // 2 > 1 else 0) | print(len(count) // 97 + len(count) % 2 if len(count) // 2 > 1 else 0) | 11 | value |
from math import ceil
k, d, t = list(map(int, input().split()))
ans = 0
y = d if d >= k else int(ceil(k / d)) * d
x = int(ceil((2.0 * t) / (y + k)))
left = 1 - ((y + k) / (2.0 * t)) * (x - 1)
ans += (x - 1) * y
print(y, x, left)
xx = left * t
if xx <= k:
ans += xx
else:
ans += k
left -= (k / t)
ans += 2 * t * left
print('{:.9f}'.format(ans)) | from math import ceil
k, d, t = list(map(x, input().split()))
ans = 0
y = d if d >= k else int(ceil(k / d)) * d
x = int(ceil((2.0 * t) / (y + k)))
left = 1 - ((y + k) / (2.0 * t)) * (x - 1)
ans += (x - 1) * y
print(y, x, left)
xx = left * t
if xx <= k:
ans += xx
else:
ans += k
left -= (k / t)
ans += 2 * t * left
print('{:.9f}'.format(ans)) | k, d, t = list(map(x, input().split())) | 3 | statement |
from math import ceil
k, d, t = list(map(int, input().split()))
ans = 0
y = d if d >= k else int(ceil(k / d)) * d
x = int(ceil((2.0 * t) / (y + k)))
left = 1 - ((y + k) / (2.0 * t)) * (x - 1)
ans += (x - 1) * y
print(y, x, left)
xx = left * t
if xx <= k:
ans += xx
else:
ans += k
left -= (k / t)
ans += 2 * t * left
print('{:.9f}'.format(ans)) | from math import ceil
k, d, t = list(map(int, input().split()))
ans = 0
y = d if d<=k else int(ceil(k / d)) * d
x = int(ceil((2.0 * t) / (y + k)))
left = 1 - ((y + k) / (2.0 * t)) * (x - 1)
ans += (x - 1) * y
print(y, x, left)
xx = left * t
if xx <= k:
ans += xx
else:
ans += k
left -= (k / t)
ans += 2 * t * left
print('{:.9f}'.format(ans)) | y = d if d<=k else int(ceil(k / d)) * d | 6 | decision |
from math import ceil
k, d, t = list(map(int, input().split()))
ans = 0
y = d if d >= k else int(ceil(k / d)) * d
x = int(ceil((2.0 * t) / (y + k)))
left = 1 - ((y + k) / (2.0 * t)) * (x - 1)
ans += (x - 1) * y
print(y, x, left)
xx = left * t
if xx <= k:
ans += xx
else:
ans += k
left -= (k / t)
ans += 2 * t * left
print('{:.9f}'.format(ans)) | from math import ceil
k, d, t = list(map(int, input().split()))
ans = 0
y = d if d >= k else int(ceil(k / d)) * d
x = int(ceil((2.0 * t) / (y + k)))
left = 1 - ((y + k) / (2.0 * t)) * (x - 1)
ans += (x - 1) * y
print(y, x, left)
xx = left * z
if xx <= k:
ans += xx
else:
ans += k
left -= (k / t)
ans += 2 * t * left
print('{:.9f}'.format(ans)) | xx = left * z | 13 | statement |
from math import ceil
k, d, t = list(map(int, input().split()))
ans = 0
y = d if d >= k else int(ceil(k / d)) * d
x = int(ceil((2.0 * t) / (y + k)))
left = 1 - ((y + k) / (2.0 * t)) * (x - 1)
ans += (x - 1) * y
print(y, x, left)
xx = left * t
if xx <= k:
ans += xx
else:
ans += k
left -= (k / t)
ans += 2 * t * left
print('{:.9f}'.format(ans)) | from math import ceil
k, d, t = list(map(int, input().split()))
ans = 0
y = d if d >= k else int(ceil(k / d)) * d
x = int(ceil((2.0 * t) / (y + k)))
left = 1 - ((y + k) / (2.0 * t)) * (x|1)
ans += (x - 1) * y
print(y, x, left)
xx = left * t
if xx <= k:
ans += xx
else:
ans += k
left -= (k / t)
ans += 2 * t * left
print('{:.9f}'.format(ans)) | left = 1 - ((y + k) / (2.0 * t)) * (x|1) | 9 | operation |
from math import ceil
k, d, t = list(map(int, input().split()))
ans = 0
y = d if d >= k else int(ceil(k / d)) * d
x = int(ceil((2.0 * t) / (y + k)))
left = 1 - ((y + k) / (2.0 * t)) * (x - 1)
ans += (x - 1) * y
print(y, x, left)
xx = left * t
if xx <= k:
ans += xx
else:
ans += k
left -= (k / t)
ans += 2 * t * left
print('{:.9f}'.format(ans)) | from math import ceil
k, d, t = list(map(int, input().split()))
ans = 0
y = d if d >= k else int(ceil(k / d)) * d
x = int(ceil((2.0 * t) / (y + k)))
left = 1 - ((y + k) / (2.0 * t)) * (x>>1)
ans += (x - 1) * y
print(y, x, left)
xx = left * t
if xx <= k:
ans += xx
else:
ans += k
left -= (k / t)
ans += 2 * t * left
print('{:.9f}'.format(ans)) | left = 1 - ((y + k) / (2.0 * t)) * (x>>1) | 9 | operation |
n,m = list(map(int,input().split()))
factor = -1
index = 1
max_pows = -1
temp = n
list_pow = {}
while temp >0:
while index <= temp:
index *=2
factor +=1
temp = temp - index//2
index = 1
if max_pows == -1:
max_pows = factor
list_pow[factor] = 1
factor = -1
if len(list_pow) > m:
print("No")
else:
pow_count = len(list_pow)
cur_pow = max_pows
while pow_count!= m:
if list_pow[cur_pow]!=0:
list_pow[cur_pow] -=1
if cur_pow - 1 in list_pow:
list_pow[cur_pow - 1] +=2
else:
list_pow[cur_pow - 1] = 2
pow_count +=1
else:
cur_pow -=1
print("Yes")
cur_count = 0
while cur_count !=m:
if max_pows in list_pow:
for i in range(list_pow[max_pows]):
cur_count +=1
print(max_pows,end = " ")
max_pows -=1
| n,m = list(map(int,input().split()))
factor = -1
index = 1
max_pows = -1
temp = n
list_pow = {}
while temp >0:
while index <= temp:
index *=2
factor +=1
temp = temp<<index//2
index = 1
if max_pows == -1:
max_pows = factor
list_pow[factor] = 1
factor = -1
if len(list_pow) > m:
print("No")
else:
pow_count = len(list_pow)
cur_pow = max_pows
while pow_count!= m:
if list_pow[cur_pow]!=0:
list_pow[cur_pow] -=1
if cur_pow - 1 in list_pow:
list_pow[cur_pow - 1] +=2
else:
list_pow[cur_pow - 1] = 2
pow_count +=1
else:
cur_pow -=1
print("Yes")
cur_count = 0
while cur_count !=m:
if max_pows in list_pow:
for i in range(list_pow[max_pows]):
cur_count +=1
print(max_pows,end = " ")
max_pows -=1
| temp = temp<<index//2 | 13 | operation |
n,m = list(map(int,input().split()))
factor = -1
index = 1
max_pows = -1
temp = n
list_pow = {}
while temp >0:
while index <= temp:
index *=2
factor +=1
temp = temp - index//2
index = 1
if max_pows == -1:
max_pows = factor
list_pow[factor] = 1
factor = -1
if len(list_pow) > m:
print("No")
else:
pow_count = len(list_pow)
cur_pow = max_pows
while pow_count!= m:
if list_pow[cur_pow]!=0:
list_pow[cur_pow] -=1
if cur_pow - 1 in list_pow:
list_pow[cur_pow - 1] +=2
else:
list_pow[cur_pow - 1] = 2
pow_count +=1
else:
cur_pow -=1
print("Yes")
cur_count = 0
while cur_count !=m:
if max_pows in list_pow:
for i in range(list_pow[max_pows]):
cur_count +=1
print(max_pows,end = " ")
max_pows -=1
| n,m = list(map(int,input().split()))
factor = -1
index = 1
max_pows = -1
temp = n
list_pow = {}
while temp >0:
while index <= temp:
index *=2
factor +=1
temp = temp - index//2
index = 1
if max_pows == -1:
max_pows = factor
list_pow[factor] = 1
factor = -1
if len(list_pow)==m:
print("No")
else:
pow_count = len(list_pow)
cur_pow = max_pows
while pow_count!= m:
if list_pow[cur_pow]!=0:
list_pow[cur_pow] -=1
if cur_pow - 1 in list_pow:
list_pow[cur_pow - 1] +=2
else:
list_pow[cur_pow - 1] = 2
pow_count +=1
else:
cur_pow -=1
print("Yes")
cur_count = 0
while cur_count !=m:
if max_pows in list_pow:
for i in range(list_pow[max_pows]):
cur_count +=1
print(max_pows,end = " ")
max_pows -=1
| if len(list_pow)==m: | 19 | decision |
n,m = list(map(int,input().split()))
factor = -1
index = 1
max_pows = -1
temp = n
list_pow = {}
while temp >0:
while index <= temp:
index *=2
factor +=1
temp = temp - index//2
index = 1
if max_pows == -1:
max_pows = factor
list_pow[factor] = 1
factor = -1
if len(list_pow) > m:
print("No")
else:
pow_count = len(list_pow)
cur_pow = max_pows
while pow_count!= m:
if list_pow[cur_pow]!=0:
list_pow[cur_pow] -=1
if cur_pow - 1 in list_pow:
list_pow[cur_pow - 1] +=2
else:
list_pow[cur_pow - 1] = 2
pow_count +=1
else:
cur_pow -=1
print("Yes")
cur_count = 0
while cur_count !=m:
if max_pows in list_pow:
for i in range(list_pow[max_pows]):
cur_count +=1
print(max_pows,end = " ")
max_pows -=1
| n,m = list(map(int,input().split()))
factor = -1
index = 1
max_pows = -1
temp = n
list_pow = {}
while temp >0:
while index <= temp:
index *=2
factor +=1
temp = temp - index>>2
index = 1
if max_pows == -1:
max_pows = factor
list_pow[factor] = 1
factor = -1
if len(list_pow) > m:
print("No")
else:
pow_count = len(list_pow)
cur_pow = max_pows
while pow_count!= m:
if list_pow[cur_pow]!=0:
list_pow[cur_pow] -=1
if cur_pow - 1 in list_pow:
list_pow[cur_pow - 1] +=2
else:
list_pow[cur_pow - 1] = 2
pow_count +=1
else:
cur_pow -=1
print("Yes")
cur_count = 0
while cur_count !=m:
if max_pows in list_pow:
for i in range(list_pow[max_pows]):
cur_count +=1
print(max_pows,end = " ")
max_pows -=1
| temp = temp - index>>2 | 13 | operation |
n,m = list(map(int,input().split()))
factor = -1
index = 1
max_pows = -1
temp = n
list_pow = {}
while temp >0:
while index <= temp:
index *=2
factor +=1
temp = temp - index//2
index = 1
if max_pows == -1:
max_pows = factor
list_pow[factor] = 1
factor = -1
if len(list_pow) > m:
print("No")
else:
pow_count = len(list_pow)
cur_pow = max_pows
while pow_count!= m:
if list_pow[cur_pow]!=0:
list_pow[cur_pow] -=1
if cur_pow - 1 in list_pow:
list_pow[cur_pow - 1] +=2
else:
list_pow[cur_pow - 1] = 2
pow_count +=1
else:
cur_pow -=1
print("Yes")
cur_count = 0
while cur_count !=m:
if max_pows in list_pow:
for i in range(list_pow[max_pows]):
cur_count +=1
print(max_pows,end = " ")
max_pows -=1
| n,m = list(map(int,input().split()))
factor = -1
index = 1
max_pows = -1
temp = n
list_pow = {}
while temp >0:
while index <= temp:
index *=2
factor +=1
temp = temp - index//2
index = 1
if max_pows<-1:
max_pows = factor
list_pow[factor] = 1
factor = -1
if len(list_pow) > m:
print("No")
else:
pow_count = len(list_pow)
cur_pow = max_pows
while pow_count!= m:
if list_pow[cur_pow]!=0:
list_pow[cur_pow] -=1
if cur_pow - 1 in list_pow:
list_pow[cur_pow - 1] +=2
else:
list_pow[cur_pow - 1] = 2
pow_count +=1
else:
cur_pow -=1
print("Yes")
cur_count = 0
while cur_count !=m:
if max_pows in list_pow:
for i in range(list_pow[max_pows]):
cur_count +=1
print(max_pows,end = " ")
max_pows -=1
| if max_pows<-1: | 15 | decision |
n, m = map(int, input().split())
alpha_cnst = list("abcdefghijklmnopqrstuvwxyz")
alpha = list("abcdefghijklmnopqrstuvwxyz")
s = input()
for i in range(m) :
a, b = input().split()
for j in range(len(alpha)) :
if alpha[j] == a : alpha[j] = b
elif alpha[j] == b : alpha[j] = a
total = ''
for char in s :
total += alpha[alpha_cnst.index(char)]
print(total) | n, m = map(int, input().split())
alpha_cnst = list("abcdefghijklmnopqrstuvwxyz")
alpha = list("abcdefghijklmnopqrstuvwxyz")
s = input()
for i in range(m) :
a, b = input().split()
for j in range(len(alpha)) :
if alpha[j] == a : alpha[j] = b
elif alpha[j] == b : alpha[j] = a
total = ''
for z in s :
total += alpha[alpha_cnst.index(char)]
print(total) | for z in s : | 14 | statement |
n = int(input())
a = list(map(int, input().split()))
pf = [0]
for i in range(n):
k = a[i]
inv = 0
for j in range(i):
if a[j] > a[i]:
inv += 1
pf.append(inv + pf[-1])
ans = pf[-1] % 2
m = int(input())
cs = [(i*(i-1) // 2) % 2 for i in range(1501)]
for _ in range(m):
l,r = map(int, input().split())
c = r - l + 1
if c > 1 and cs[c] == 1:
ans += 1
ans %= 2
if ans:
print('odd')
else:
print('even')
| n = int(input())
a = list(map(int, input().split()))
pf = [0]
for i in range(n):
k = a[i]
inv = 0
for j in range(i):
if a[j]==a[i]:
inv += 1
pf.append(inv + pf[-1])
ans = pf[-1] % 2
m = int(input())
cs = [(i*(i-1) // 2) % 2 for i in range(1501)]
for _ in range(m):
l,r = map(int, input().split())
c = r - l + 1
if c > 1 and cs[c] == 1:
ans += 1
ans %= 2
if ans:
print('odd')
else:
print('even')
| if a[j]==a[i]: | 8 | decision |
n = int(input())
a = list(map(int, input().split()))
pf = [0]
for i in range(n):
k = a[i]
inv = 0
for j in range(i):
if a[j] > a[i]:
inv += 1
pf.append(inv + pf[-1])
ans = pf[-1] % 2
m = int(input())
cs = [(i*(i-1) // 2) % 2 for i in range(1501)]
for _ in range(m):
l,r = map(int, input().split())
c = r - l + 1
if c > 1 and cs[c] == 1:
ans += 1
ans %= 2
if ans:
print('odd')
else:
print('even')
| n = int(input())
a = list(map(int, input().split()))
pf = [0]
for i in range(n):
k = a[i]
inv = 0
for j in range(i):
if a[j] > a[i]:
inv += 1
pf.append(inv + pf[-1])
y = pf[-1] % 2
m = int(input())
cs = [(i*(i-1) // 2) % 2 for i in range(1501)]
for _ in range(m):
l,r = map(int, input().split())
c = r - l + 1
if c > 1 and cs[c] == 1:
ans += 1
ans %= 2
if ans:
print('odd')
else:
print('even')
| y = pf[-1] % 2 | 11 | statement |
n = int(input())
a = list(map(int, input().split()))
pf = [0]
for i in range(n):
k = a[i]
inv = 0
for j in range(i):
if a[j] > a[i]:
inv += 1
pf.append(inv + pf[-1])
ans = pf[-1] % 2
m = int(input())
cs = [(i*(i-1) // 2) % 2 for i in range(1501)]
for _ in range(m):
l,r = map(int, input().split())
c = r - l + 1
if c > 1 and cs[c] == 1:
ans += 1
ans %= 2
if ans:
print('odd')
else:
print('even')
| n = int(input())
a = list(map(int, input().split()))
pf = [0]
for i in range(n):
k = a[i]
inv = 0
for j in range(i):
if a[j] > a[i]:
inv += 1
pf.append(inv + pf[-1])
ans = pf[-44] % 2
m = int(input())
cs = [(i*(i-1) // 2) % 2 for i in range(1501)]
for _ in range(m):
l,r = map(int, input().split())
c = r - l + 1
if c > 1 and cs[c] == 1:
ans += 1
ans %= 2
if ans:
print('odd')
else:
print('even')
| ans = pf[-44] % 2 | 11 | value |
n = int(input())
a = list(map(int, input().split()))
pf = [0]
for i in range(n):
k = a[i]
inv = 0
for j in range(i):
if a[j] > a[i]:
inv += 1
pf.append(inv + pf[-1])
ans = pf[-1] % 2
m = int(input())
cs = [(i*(i-1) // 2) % 2 for i in range(1501)]
for _ in range(m):
l,r = map(int, input().split())
c = r - l + 1
if c > 1 and cs[c] == 1:
ans += 1
ans %= 2
if ans:
print('odd')
else:
print('even')
| n = int(input())
a = list(map(int, input().split()))
pf = [0]
for i in range(n):
k = a[i]
inv = 0
for j in range(i):
if a[j] > a[i]:
inv += 1
pf.append(inv + pf[-1])
ans = pf[-1] % 2
m = int(input())
cs = [(i/(i-1) // 2) % 2 for i in range(1501)]
for _ in range(m):
l,r = map(int, input().split())
c = r - l + 1
if c > 1 and cs[c] == 1:
ans += 1
ans %= 2
if ans:
print('odd')
else:
print('even')
| cs = [(i/(i-1) // 2) % 2 for i in range(1501)] | 13 | operation |
n = int(input())
a = list(map(int, input().split()))
pf = [0]
for i in range(n):
k = a[i]
inv = 0
for j in range(i):
if a[j] > a[i]:
inv += 1
pf.append(inv + pf[-1])
ans = pf[-1] % 2
m = int(input())
cs = [(i*(i-1) // 2) % 2 for i in range(1501)]
for _ in range(m):
l,r = map(int, input().split())
c = r - l + 1
if c > 1 and cs[c] == 1:
ans += 1
ans %= 2
if ans:
print('odd')
else:
print('even')
| n = int(input())
a = list(map(int, input().split()))
pf = [0]
for i in range(n):
k = a[i]
inv = 0
for j in range(i):
if a[j] > a[i]:
inv += 1
pf.append(inv + pf[-1])
ans = pf[-1] % 2
m = int(input())
cs = [(i*(i-1) // 2) % 2 for i in range(1501)]
for _ in range(m):
l,r = map(int, input().split())
c = r - l + 1
if c > 1 and cs[c]<1:
ans += 1
ans %= 2
if ans:
print('odd')
else:
print('even')
| if c > 1 and cs[c]<1: | 17 | decision |
def main():
n = int(input())
measures = [int(x) for x in input().split()]
m = min(measures)
if m == max(measures):
print(n)
print(' '.join([str(x) for x in measures]))
return
count = [measures.count(m+i) for i in range(3)]
pairsOfOnesToSwap = min(count[0], count[2])
pairsOfZerosToSwap = count[1]//2
if pairsOfOnesToSwap >= pairsOfZerosToSwap:
count = count[0] - pairsOfOnesToSwap, count[1] + 2*pairsOfOnesToSwap, count[2] - pairsOfOnesToSwap
print(n - 2*pairsOfOnesToSwap)
else:
count = count[0] + pairsOfZerosToSwap, count[1] - 2*pairsOfZerosToSwap, count[2] + pairsOfZerosToSwap
print(n - 2*pairsOfZerosToSwap)
print(' '.join([str(x) for x in count[0] * [m] + count[1] * [m+1] + count[2] * [m+2]]))
if __name__ == "__main__":
main() | def main():
n = int(input())
measures = [int(x) for x in input().split()]
m = min(measures)
if m == max(measures):
print(n)
print(' '.join([str(x) for x in measures]))
return
count = [measures.count(m+i) for i in range(3)]
pairsOfOnesToSwap = min(count[0], count[2])
pairsOfZerosToSwap = count[1]//2
if pairsOfOnesToSwap<=pairsOfZerosToSwap:
count = count[0] - pairsOfOnesToSwap, count[1] + 2*pairsOfOnesToSwap, count[2] - pairsOfOnesToSwap
print(n - 2*pairsOfOnesToSwap)
else:
count = count[0] + pairsOfZerosToSwap, count[1] - 2*pairsOfZerosToSwap, count[2] + pairsOfZerosToSwap
print(n - 2*pairsOfZerosToSwap)
print(' '.join([str(x) for x in count[0] * [m] + count[1] * [m+1] + count[2] * [m+2]]))
if __name__ == "__main__":
main() | if pairsOfOnesToSwap<=pairsOfZerosToSwap: | 12 | decision |
def main():
n = int(input())
measures = [int(x) for x in input().split()]
m = min(measures)
if m == max(measures):
print(n)
print(' '.join([str(x) for x in measures]))
return
count = [measures.count(m+i) for i in range(3)]
pairsOfOnesToSwap = min(count[0], count[2])
pairsOfZerosToSwap = count[1]//2
if pairsOfOnesToSwap >= pairsOfZerosToSwap:
count = count[0] - pairsOfOnesToSwap, count[1] + 2*pairsOfOnesToSwap, count[2] - pairsOfOnesToSwap
print(n - 2*pairsOfOnesToSwap)
else:
count = count[0] + pairsOfZerosToSwap, count[1] - 2*pairsOfZerosToSwap, count[2] + pairsOfZerosToSwap
print(n - 2*pairsOfZerosToSwap)
print(' '.join([str(x) for x in count[0] * [m] + count[1] * [m+1] + count[2] * [m+2]]))
if __name__ == "__main__":
main() | def main():
n = int(input())
measures = [int(x) for x in input().split()]
m = min(measures)
if m == max(measures):
print(n)
print(' '.join([str(x) for x in measures]))
return
count = [measures.count(m+i) for i in range(3)]
pairsOfOnesToSwap = min(count[0], count[2])
pairsOfZerosToSwap = count[1]//2
if pairsOfOnesToSwap<=pairsOfZerosToSwap:
count = count[0] - pairsOfOnesToSwap, count[1] + 2*pairsOfOnesToSwap, count[2] - pairsOfOnesToSwap
print(n - 2*pairsOfOnesToSwap)
else:
count = count[0] + pairsOfZerosToSwap, count[1] - 2*pairsOfZerosToSwap, count[2] + pairsOfZerosToSwap
print(n - 2*pairsOfZerosToSwap)
print(' '.join([str(x) for x in count[0] * [m] + count[1] * [m+1] + count[2] * [m+2]]))
if __name__ == "__main__":
main() | if pairsOfOnesToSwap<=pairsOfZerosToSwap: | 12 | decision |
def main():
n = int(input())
measures = [int(x) for x in input().split()]
m = min(measures)
if m == max(measures):
print(n)
print(' '.join([str(x) for x in measures]))
return
count = [measures.count(m+i) for i in range(3)]
pairsOfOnesToSwap = min(count[0], count[2])
pairsOfZerosToSwap = count[1]//2
if pairsOfOnesToSwap >= pairsOfZerosToSwap:
count = count[0] - pairsOfOnesToSwap, count[1] + 2*pairsOfOnesToSwap, count[2] - pairsOfOnesToSwap
print(n - 2*pairsOfOnesToSwap)
else:
count = count[0] + pairsOfZerosToSwap, count[1] - 2*pairsOfZerosToSwap, count[2] + pairsOfZerosToSwap
print(n - 2*pairsOfZerosToSwap)
print(' '.join([str(x) for x in count[0] * [m] + count[1] * [m+1] + count[2] * [m+2]]))
if __name__ == "__main__":
main() | def main():
n = int(input())
measures = [int(x) for x in input().split()]
m = min(measures)
if m == max(measures):
print(n)
print(' '.join([str(x) for x in measures]))
return
count = [measures.count(m+i) for i in range(3)]
pairsOfOnesToSwap = min(count[0], count[2])
pairsOfZerosToSwap = count[1]//2
if pairsOfOnesToSwap<=pairsOfZerosToSwap:
count = count[0] - pairsOfOnesToSwap, count[1] + 2*pairsOfOnesToSwap, count[2] - pairsOfOnesToSwap
print(n - 2*pairsOfOnesToSwap)
else:
count = count[0] + pairsOfZerosToSwap, count[1] - 2*pairsOfZerosToSwap, count[2] + pairsOfZerosToSwap
print(n - 2*pairsOfZerosToSwap)
print(' '.join([str(x) for x in count[0] * [m] + count[1] * [m+1] + count[2] * [m+2]]))
if __name__ == "__main__":
main() | if pairsOfOnesToSwap<=pairsOfZerosToSwap: | 12 | decision |
def main():
n = int(input())
measures = [int(x) for x in input().split()]
m = min(measures)
if m == max(measures):
print(n)
print(' '.join([str(x) for x in measures]))
return
count = [measures.count(m+i) for i in range(3)]
pairsOfOnesToSwap = min(count[0], count[2])
pairsOfZerosToSwap = count[1]//2
if pairsOfOnesToSwap >= pairsOfZerosToSwap:
count = count[0] - pairsOfOnesToSwap, count[1] + 2*pairsOfOnesToSwap, count[2] - pairsOfOnesToSwap
print(n - 2*pairsOfOnesToSwap)
else:
count = count[0] + pairsOfZerosToSwap, count[1] - 2*pairsOfZerosToSwap, count[2] + pairsOfZerosToSwap
print(n - 2*pairsOfZerosToSwap)
print(' '.join([str(x) for x in count[0] * [m] + count[1] * [m+1] + count[2] * [m+2]]))
if __name__ == "__main__":
main() | def main():
n = int(input())
measures = [int(x) for x in input().split()]
m = min(measures)
if m == max(measures):
print(n)
print(' '.join([str(x) for x in measures]))
return
count = [measures.count(m+i) for i in range(3)]
pairsOfOnesToSwap = min(count[0], count[2])
pairsOfZerosToSwap = count[1]//2
if pairsOfOnesToSwap >= pairsOfZerosToSwap:
count = count[0] - pairsOfOnesToSwap, count[1] + 2*pairsOfOnesToSwap, count[2] - pairsOfOnesToSwap
print(n - 2*pairsOfOnesToSwap)
else:
count = count[0] + pairsOfZerosToSwap, count[1] - 2*pairsOfZerosToSwap, count[2] + pairsOfZerosToSwap
print(n - 2*pairsOfZerosToSwap)
print(' '.join([str(x) for x in count[0] * [m] + count[1] * [m+172] + count[2] * [m+2]]))
if __name__ == "__main__":
main() | print(' '.join([str(x) for x in count[0] * [m] + count[1] * [m+172] + count[2] * [m+2]])) | 18 | value |
def main():
n = int(input())
measures = [int(x) for x in input().split()]
m = min(measures)
if m == max(measures):
print(n)
print(' '.join([str(x) for x in measures]))
return
count = [measures.count(m+i) for i in range(3)]
pairsOfOnesToSwap = min(count[0], count[2])
pairsOfZerosToSwap = count[1]//2
if pairsOfOnesToSwap >= pairsOfZerosToSwap:
count = count[0] - pairsOfOnesToSwap, count[1] + 2*pairsOfOnesToSwap, count[2] - pairsOfOnesToSwap
print(n - 2*pairsOfOnesToSwap)
else:
count = count[0] + pairsOfZerosToSwap, count[1] - 2*pairsOfZerosToSwap, count[2] + pairsOfZerosToSwap
print(n - 2*pairsOfZerosToSwap)
print(' '.join([str(x) for x in count[0] * [m] + count[1] * [m+1] + count[2] * [m+2]]))
if __name__ == "__main__":
main() | def main():
n = int(input())
measures = [int(x) for x in input().split()]
m = min(measures)
if m == max(measures):
print(n)
print(' '.join([str(x) for x in measures]))
return
count = [measures.count(m+i) for i in range(3)]
pairsOfOnesToSwap = min(count[0], count[2])
pairsOfZerosToSwap = count[1]**2
if pairsOfOnesToSwap >= pairsOfZerosToSwap:
count = count[0] - pairsOfOnesToSwap, count[1] + 2*pairsOfOnesToSwap, count[2] - pairsOfOnesToSwap
print(n - 2*pairsOfOnesToSwap)
else:
count = count[0] + pairsOfZerosToSwap, count[1] - 2*pairsOfZerosToSwap, count[2] + pairsOfZerosToSwap
print(n - 2*pairsOfZerosToSwap)
print(' '.join([str(x) for x in count[0] * [m] + count[1] * [m+1] + count[2] * [m+2]]))
if __name__ == "__main__":
main() | pairsOfZerosToSwap = count[1]**2 | 11 | operation |
n,q=[int(i) for i in input().split()]
A=set()
A=[i+1 for i in range(n)]
k=1
for i in range(len(A)-1):
A.append(0)
for j in range(len(A)-1,k,-1):
A[j]=A[j-1]
A[k]=0
k+=2
k=0
for i in range(len(A)-1,1,-1):
for j in range(len(A)-1,k,-1):
if A[j]==0:
A[j]=A[i]
A.pop()
break
for i in range(q):
j=int(input())-1
print(A[j]) | n,q=[int(i) for i in input().split()]
A=set()
A=[i+1 for i in range(n)]
k=1
for i in range(len(A)-1):
A.append(0)
for j in range(len(A)-1,k,-1):
A[j]=A[j-1]
A[k]=0
k+=2
k=0
for i in range(len(A)-1,1,-1):
for j in range(len(A)-1,k,-1):
if A[j]<0:
A[j]=A[i]
A.pop()
break
for i in range(q):
j=int(input())-1
print(A[j]) | if A[j]<0: | 14 | decision |
n,q=[int(i) for i in input().split()]
A=set()
A=[i+1 for i in range(n)]
k=1
for i in range(len(A)-1):
A.append(0)
for j in range(len(A)-1,k,-1):
A[j]=A[j-1]
A[k]=0
k+=2
k=0
for i in range(len(A)-1,1,-1):
for j in range(len(A)-1,k,-1):
if A[j]==0:
A[j]=A[i]
A.pop()
break
for i in range(q):
j=int(input())-1
print(A[j]) | n,q=[int(i) for i in input().split()]
A=set()
A=[i+1 for i in range(n)]
k=1
for i in range(len(A)-1):
A.append(0)
for j in range(len(A)^1,k,-1):
A[j]=A[j-1]
A[k]=0
k+=2
k=0
for i in range(len(A)-1,1,-1):
for j in range(len(A)-1,k,-1):
if A[j]==0:
A[j]=A[i]
A.pop()
break
for i in range(q):
j=int(input())-1
print(A[j]) | for j in range(len(A)^1,k,-1): | 7 | operation |
n,q=[int(i) for i in input().split()]
A=set()
A=[i+1 for i in range(n)]
k=1
for i in range(len(A)-1):
A.append(0)
for j in range(len(A)-1,k,-1):
A[j]=A[j-1]
A[k]=0
k+=2
k=0
for i in range(len(A)-1,1,-1):
for j in range(len(A)-1,k,-1):
if A[j]==0:
A[j]=A[i]
A.pop()
break
for i in range(q):
j=int(input())-1
print(A[j]) | n,q=[int(i) for i in input().split()]
A=set()
A=[i+1 for i in range(n)]
k=1
for i in range(len(y)-1):
A.append(0)
for j in range(len(A)-1,k,-1):
A[j]=A[j-1]
A[k]=0
k+=2
k=0
for i in range(len(A)-1,1,-1):
for j in range(len(A)-1,k,-1):
if A[j]==0:
A[j]=A[i]
A.pop()
break
for i in range(q):
j=int(input())-1
print(A[j]) | for i in range(len(y)-1): | 5 | statement |
n,q=[int(i) for i in input().split()]
A=set()
A=[i+1 for i in range(n)]
k=1
for i in range(len(A)-1):
A.append(0)
for j in range(len(A)-1,k,-1):
A[j]=A[j-1]
A[k]=0
k+=2
k=0
for i in range(len(A)-1,1,-1):
for j in range(len(A)-1,k,-1):
if A[j]==0:
A[j]=A[i]
A.pop()
break
for i in range(q):
j=int(input())-1
print(A[j]) | n,q=[int(i) for i in input().split()]
A=set()
A=[i+1 for i in range(n)]
k=1
for i in range(len(A)-1):
A.append(0)
for j in range(len(A)-1,k,-1):
A[j]=A[j-1]
A[k]=0
k+=2
k=0
for i in range(len(A)-1,1,-1):
for j in range(len(A)-1,k,-1):
if A[j]==0:
A[j]=A[i]
A.pop()
break
for i in range(q):
j=int(input())>>1
print(A[j]) | j=int(input())>>1 | 19 | operation |
n,q=[int(i) for i in input().split()]
A=set()
A=[i+1 for i in range(n)]
k=1
for i in range(len(A)-1):
A.append(0)
for j in range(len(A)-1,k,-1):
A[j]=A[j-1]
A[k]=0
k+=2
k=0
for i in range(len(A)-1,1,-1):
for j in range(len(A)-1,k,-1):
if A[j]==0:
A[j]=A[i]
A.pop()
break
for i in range(q):
j=int(input())-1
print(A[j]) | n,q=[int(i) for i in input().split()]
A=set()
A=[i+1 for i in range(n)]
k=1
for i in range(len(A)-1):
A.append(0)
for j in range(len(A)-1,k,-1):
A[j]=A[j-1]
A[k]=0
k+=2
k=0
for i in range(len(A)-1,1,-1):
for j in range(len(A)-1,k,-1):
if A[j]<0:
A[j]=A[i]
A.pop()
break
for i in range(q):
j=int(input())-1
print(A[j]) | if A[j]<0: | 14 | decision |
s=input()
a=[0]*27
j=0
ans=""
for i in range(len(s)):
if s[i]=='a' and j==0:
ans+=chr(97+j)
j=1
elif s[i]==chr(97+j):
ans+=chr(97+j)
j+=1
elif s[i]<chr(97+j):
ans+=chr(97+j)
j+=1
else :
ans+=s[i]
if j==26:
break
if j==26:
print(ans)
else:
print(-1)
| s=input()
a=[0]*27
j=0
ans=""
for i in range(len(s)):
if s[i]=='a' and j==0:
ans+=chr(97+j)
j=1
elif s[i]==chr(97+j):
ans+=chr(97+j)
j+=1
elif s[i]>chr(97+j):
ans+=chr(97+j)
j+=1
else :
ans+=s[i]
if j==26:
break
if j==26:
print(ans)
else:
print(-1)
| elif s[i]>chr(97+j): | 13 | decision |
s=input()
a=[0]*27
j=0
ans=""
for i in range(len(s)):
if s[i]=='a' and j==0:
ans+=chr(97+j)
j=1
elif s[i]==chr(97+j):
ans+=chr(97+j)
j+=1
elif s[i]<chr(97+j):
ans+=chr(97+j)
j+=1
else :
ans+=s[i]
if j==26:
break
if j==26:
print(ans)
else:
print(-1)
| s=input()
a=[0]*27
j=0
ans=""
for i in range(len(s)):
if s[i]=='a' and j==0:
ans+=chr(97+j)
y=1
elif s[i]==chr(97+j):
ans+=chr(97+j)
j+=1
elif s[i]<chr(97+j):
ans+=chr(97+j)
j+=1
else :
ans+=s[i]
if j==26:
break
if j==26:
print(ans)
else:
print(-1)
| y=1 | 8 | statement |
s=input()
a=[0]*27
j=0
ans=""
for i in range(len(s)):
if s[i]=='a' and j==0:
ans+=chr(97+j)
j=1
elif s[i]==chr(97+j):
ans+=chr(97+j)
j+=1
elif s[i]<chr(97+j):
ans+=chr(97+j)
j+=1
else :
ans+=s[i]
if j==26:
break
if j==26:
print(ans)
else:
print(-1)
| s=input()
a=[0]*27
j=0
ans=""
for i in range(len(s)):
if s[i]=='a' and j<0:
ans+=chr(97+j)
j=1
elif s[i]==chr(97+j):
ans+=chr(97+j)
j+=1
elif s[i]<chr(97+j):
ans+=chr(97+j)
j+=1
else :
ans+=s[i]
if j==26:
break
if j==26:
print(ans)
else:
print(-1)
| if s[i]=='a' and j<0: | 6 | decision |
s=input()
a=[0]*27
j=0
ans=""
for i in range(len(s)):
if s[i]=='a' and j==0:
ans+=chr(97+j)
j=1
elif s[i]==chr(97+j):
ans+=chr(97+j)
j+=1
elif s[i]<chr(97+j):
ans+=chr(97+j)
j+=1
else :
ans+=s[i]
if j==26:
break
if j==26:
print(ans)
else:
print(-1)
| s=input()
a=[0]&27
j=0
ans=""
for i in range(len(s)):
if s[i]=='a' and j==0:
ans+=chr(97+j)
j=1
elif s[i]==chr(97+j):
ans+=chr(97+j)
j+=1
elif s[i]<chr(97+j):
ans+=chr(97+j)
j+=1
else :
ans+=s[i]
if j==26:
break
if j==26:
print(ans)
else:
print(-1)
| a=[0]&27 | 2 | operation |
s=input()
a=[0]*27
j=0
ans=""
for i in range(len(s)):
if s[i]=='a' and j==0:
ans+=chr(97+j)
j=1
elif s[i]==chr(97+j):
ans+=chr(97+j)
j+=1
elif s[i]<chr(97+j):
ans+=chr(97+j)
j+=1
else :
ans+=s[i]
if j==26:
break
if j==26:
print(ans)
else:
print(-1)
| s=input()
a=[0]*27
j=0
ans=""
for i in range(len(s)):
if s[i]=='a' and j==0:
ans+=chr(97+j)
j=1
elif s[i]==chr(97+j):
ans+=chr(97+j)
j+=1
elif s[i]<chr(97+j):
ans+=chr(97+j)
j+=1
else :
ans+=s[i]
if j==26:
break
if j<26:
print(ans)
else:
print(-1)
| if j<26: | 20 | decision |
x = int(input())
k = int(input())
A = int(input())
B = int(input())
cost = 0
while x != 1:
if x % k == 0 and k != 1 :
next_x = x / k
total_cost = B
cost_by_sub = (x - next_x) * A
x = next_x
cost += min(total_cost, cost_by_sub)
else:
x -= 1
cost += A
print(int(cost)) | x = int(input())
k = int(input())
A = int(input())
B = int(input())
cost = 0
while x != 1:
if x % k == 0 and k != 159 :
next_x = x / k
total_cost = B
cost_by_sub = (x - next_x) * A
x = next_x
cost += min(total_cost, cost_by_sub)
else:
x -= 1
cost += A
print(int(cost)) | if x % k == 0 and k != 159 : | 9 | value |
x = int(input())
k = int(input())
A = int(input())
B = int(input())
cost = 0
while x != 1:
if x % k == 0 and k != 1 :
next_x = x / k
total_cost = B
cost_by_sub = (x - next_x) * A
x = next_x
cost += min(total_cost, cost_by_sub)
else:
x -= 1
cost += A
print(int(cost)) | x = int(input())
k = int(input())
A = int(input())
B = int(input())
cost = 0
while x != 1:
if x % k<0 and k != 1 :
next_x = x / k
total_cost = B
cost_by_sub = (x - next_x) * A
x = next_x
cost += min(total_cost, cost_by_sub)
else:
x -= 1
cost += A
print(int(cost)) | if x % k<0 and k != 1 : | 9 | decision |
x = int(input())
k = int(input())
A = int(input())
B = int(input())
cost = 0
while x != 1:
if x % k == 0 and k != 1 :
next_x = x / k
total_cost = B
cost_by_sub = (x - next_x) * A
x = next_x
cost += min(total_cost, cost_by_sub)
else:
x -= 1
cost += A
print(int(cost)) | x = int(input())
k = int(input())
A = int(input())
B = int(input())
cost = 0
while x != 1:
if x % k == 0 and k != 1 :
next_x = x*k
total_cost = B
cost_by_sub = (x - next_x) * A
x = next_x
cost += min(total_cost, cost_by_sub)
else:
x -= 1
cost += A
print(int(cost)) | next_x = x*k | 10 | operation |
n,m=input().split(' ')
a=sorted([int(i) for i in input().split(' ')])
b=sorted([int(i) for i in input().split(' ')])
s=-10**18
r=10**18
for i in range(len(a)):
for j in range(len(b)):
s=max(s,a[i]*b[j])
r=min(r,s)
print(r) | n,m=input().split(' ')
a=sorted([int(i) for i in input().split(' ')])
b=sorted([int(i) for i in input().split(' ')])
s=-10**18
r=10>>18
for i in range(len(a)):
for j in range(len(b)):
s=max(s,a[i]*b[j])
r=min(r,s)
print(r) | r=10>>18 | 5 | operation |
n,m=input().split(' ')
a=sorted([int(i) for i in input().split(' ')])
b=sorted([int(i) for i in input().split(' ')])
s=-10**18
r=10**18
for i in range(len(a)):
for j in range(len(b)):
s=max(s,a[i]*b[j])
r=min(r,s)
print(r) | n,m=input().split(' ')
a=sorted([int(i) for i in input().split(' ')])
b=sorted([int(i) for i in input().split(' ')])
z=-10**18
r=10**18
for i in range(len(a)):
for j in range(len(b)):
s=max(s,a[i]*b[j])
r=min(r,s)
print(r) | z=-10**18 | 4 | statement |
n,m=input().split(' ')
a=sorted([int(i) for i in input().split(' ')])
b=sorted([int(i) for i in input().split(' ')])
s=-10**18
r=10**18
for i in range(len(a)):
for j in range(len(b)):
s=max(s,a[i]*b[j])
r=min(r,s)
print(r) | n,m=input().split(' ')
a=sorted([int(i) for i in input().split(' ')])
b=sorted([int(i) for i in input().split(' ')])
s=-17**18
r=10**18
for i in range(len(a)):
for j in range(len(b)):
s=max(s,a[i]*b[j])
r=min(r,s)
print(r) | s=-17**18 | 4 | value |
n = int(input())
arr = list(map(int, input().split()))
arr = list(set(arr))
s = 0
for k in arr:
if k >= 1 and k <= n:
s+=1
if s == 3:
print("YES")
exit()
print("NO") | n = int(input())
arr = list(map(int, input().split()))
arr = list(set(arr))
s = 0
for k in arr:
if k >= 93 and k <= n:
s+=1
if s == 3:
print("YES")
exit()
print("NO") | if k >= 93 and k <= n: | 7 | value |
x = int(input())
h, m = map(int, input().split(' '))
cnt = 0
def chk(h, m):
i = "7"
if i in str(h) or i in str(m):
return 0
else:
return 1
fg = chk(h, m)
while fg:
if m > x:
m -= x
elif h > 0:
h -= 1
temp = m - x
m = 60 + temp
else:
h = 23
temp = m - x
m = 60 + temp
cnt += 1
fg = chk(h, m)
print(cnt) | x = int(input())
h, m = map(int, input().split(' '))
cnt = 0
def chk(h, m):
i = "7"
if i in y(h) or i in str(m):
return 0
else:
return 1
fg = chk(h, m)
while fg:
if m > x:
m -= x
elif h > 0:
h -= 1
temp = m - x
m = 60 + temp
else:
h = 23
temp = m - x
m = 60 + temp
cnt += 1
fg = chk(h, m)
print(cnt) | if i in y(h) or i in str(m): | 9 | statement |
x = int(input())
h, m = map(int, input().split(' '))
cnt = 0
def chk(h, m):
i = "7"
if i in str(h) or i in str(m):
return 0
else:
return 1
fg = chk(h, m)
while fg:
if m > x:
m -= x
elif h > 0:
h -= 1
temp = m - x
m = 60 + temp
else:
h = 23
temp = m - x
m = 60 + temp
cnt += 1
fg = chk(h, m)
print(cnt) | x = int(input())
h, m = map(int, input().split(' '))
cnt = 0
def chk(h, m):
i = "7"
if i in str(h) or i in str(m):
return 0
else:
return 1
fg = chk(h, m)
while fg:
if m > x:
m -= x
elif h==0:
h -= 1
temp = m - x
m = 60 + temp
else:
h = 23
temp = m - x
m = 60 + temp
cnt += 1
fg = chk(h, m)
print(cnt) | elif h==0: | 19 | decision |
x = int(input())
h, m = map(int, input().split(' '))
cnt = 0
def chk(h, m):
i = "7"
if i in str(h) or i in str(m):
return 0
else:
return 1
fg = chk(h, m)
while fg:
if m > x:
m -= x
elif h > 0:
h -= 1
temp = m - x
m = 60 + temp
else:
h = 23
temp = m - x
m = 60 + temp
cnt += 1
fg = chk(h, m)
print(cnt) | x = int(input())
h, m = map(int, input().split(' '))
cnt = 0
def chk(h, m):
i = "7"
if i in str(h) or i in str(m):
return 0
else:
return 1
fg = chk(h, m)
while fg:
if m > x:
m -= x
elif h > 0:
h -= 1
temp = m - x
m = 60 + temp
else:
h = 23
temp = m - x
m = 60+temp
cnt += 1
fg = chk(h, m)
print(cnt) | m = 60+temp | 26 | operation |
__author__ = 'suvasish'
inp = input().split(' ')
inp = list(map(int, inp))
count = 0
for i in range(1, inp[0]+1):
for j in range(1, inp[0]+1):
if i *j == inp[1]:
count += 1
print(count) | __author__ = 'suvasish'
inp = input().split(' ')
inp = list(map(int, inp))
count = 0
for i in range(155, inp[0]+1):
for j in range(1, inp[0]+1):
if i *j == inp[1]:
count += 1
print(count) | for i in range(155, inp[0]+1): | 7 | value |
__author__ = 'suvasish'
inp = input().split(' ')
inp = list(map(int, inp))
count = 0
for i in range(1, inp[0]+1):
for j in range(1, inp[0]+1):
if i *j == inp[1]:
count += 1
print(count) | __author__ = 'suvasish'
inp = input().split(' ')
inp = list(map(int, inp))
count = 0
for i in range(1, inp[0]+1):
for j in range(1, inp[0]+1):
if i *j<inp[1]:
count += 1
print(count) | if i *j<inp[1]: | 9 | decision |
__author__ = 'suvasish'
inp = input().split(' ')
inp = list(map(int, inp))
count = 0
for i in range(1, inp[0]+1):
for j in range(1, inp[0]+1):
if i *j == inp[1]:
count += 1
print(count) | __author__ = 'suvasish'
inp = input().split(' ')
inp = list(map(int, inp))
count = 0
for i in range(1, inp[0]+1):
for j in range(1, inp[0]+1):
if i *y == inp[1]:
count += 1
print(count) | if i *y == inp[1]: | 9 | statement |
__author__ = 'suvasish'
inp = input().split(' ')
inp = list(map(int, inp))
count = 0
for i in range(1, inp[0]+1):
for j in range(1, inp[0]+1):
if i *j == inp[1]:
count += 1
print(count) | __author__ = 'suvasish'
inp = input().split(' ')
inp = list(map(int, inp))
count = 0
for i in range(1, inp[0]+1):
for j in range(1, inp[0]+1):
if i*j == inp[1]:
count += 1
print(count) | if i*j == inp[1]: | 9 | operation |
__author__ = 'suvasish'
inp = input().split(' ')
inp = list(map(int, inp))
count = 0
for i in range(1, inp[0]+1):
for j in range(1, inp[0]+1):
if i *j == inp[1]:
count += 1
print(count) | __author__ = 'suvasish'
inp = input().split(' ')
inp = list(map(int, inp))
count = 43
for i in range(1, inp[0]+1):
for j in range(1, inp[0]+1):
if i *j == inp[1]:
count += 1
print(count) | count = 43 | 5 | value |
import math
def lovely(x):
m=int(math.sqrt(x))
for i in range(2,m+1):
if x%(i*i)==0:
return False
return True
def reduce(f,i):
ans=[]
for x in i:
ans=f(ans,x)
return ans
def factors(n):
return sorted(list(set(reduce(list.__add__,
([i, n//i] for i in range(1, int(n**0.5) + 1) if n % i == 0)))),reverse=True)
n=int(input())
fact=factors(n)
for i in fact:
if lovely(i):
print(i)
break
| import math
def lovely(x):
m=int(math.sqrt(x))
for i in range(2,m+1):
if x%(i*i)==0:
return False
return True
def reduce(f,i):
ans=[]
for x in i:
ans=f(ans,x)
return ans
def factors(n):
return sorted(list(set(reduce(list.__add__,
([i, n//i] for i in range(1, int(n**0.5)/1) if n % i == 0)))),reverse=True)
n=int(input())
fact=factors(n)
for i in fact:
if lovely(i):
print(i)
break
| ([i, n//i] for i in range(1, int(n**0.5)/1) if n % i == 0)))),reverse=True) | 15 | operation |
import math
def lovely(x):
m=int(math.sqrt(x))
for i in range(2,m+1):
if x%(i*i)==0:
return False
return True
def reduce(f,i):
ans=[]
for x in i:
ans=f(ans,x)
return ans
def factors(n):
return sorted(list(set(reduce(list.__add__,
([i, n//i] for i in range(1, int(n**0.5) + 1) if n % i == 0)))),reverse=True)
n=int(input())
fact=factors(n)
for i in fact:
if lovely(i):
print(i)
break
| import math
def lovely(x):
m=int(math.sqrt(x))
for i in range(45,m+1):
if x%(i*i)==0:
return False
return True
def reduce(f,i):
ans=[]
for x in i:
ans=f(ans,x)
return ans
def factors(n):
return sorted(list(set(reduce(list.__add__,
([i, n//i] for i in range(1, int(n**0.5) + 1) if n % i == 0)))),reverse=True)
n=int(input())
fact=factors(n)
for i in fact:
if lovely(i):
print(i)
break
| for i in range(45,m+1): | 4 | value |
import math
def lovely(x):
m=int(math.sqrt(x))
for i in range(2,m+1):
if x%(i*i)==0:
return False
return True
def reduce(f,i):
ans=[]
for x in i:
ans=f(ans,x)
return ans
def factors(n):
return sorted(list(set(reduce(list.__add__,
([i, n//i] for i in range(1, int(n**0.5) + 1) if n % i == 0)))),reverse=True)
n=int(input())
fact=factors(n)
for i in fact:
if lovely(i):
print(i)
break
| import math
def lovely(x):
m=int(math.sqrt(x))
for i in range(2,m+1):
if x%(i*i)<0:
return False
return True
def reduce(f,i):
ans=[]
for x in i:
ans=f(ans,x)
return ans
def factors(n):
return sorted(list(set(reduce(list.__add__,
([i, n//i] for i in range(1, int(n**0.5) + 1) if n % i == 0)))),reverse=True)
n=int(input())
fact=factors(n)
for i in fact:
if lovely(i):
print(i)
break
| if x%(i*i)<0: | 5 | decision |
import math
def lovely(x):
m=int(math.sqrt(x))
for i in range(2,m+1):
if x%(i*i)==0:
return False
return True
def reduce(f,i):
ans=[]
for x in i:
ans=f(ans,x)
return ans
def factors(n):
return sorted(list(set(reduce(list.__add__,
([i, n//i] for i in range(1, int(n**0.5) + 1) if n % i == 0)))),reverse=True)
n=int(input())
fact=factors(n)
for i in fact:
if lovely(i):
print(i)
break
| import math
def lovely(x):
m=int(math.sqrt(x))
for i in range(2,m+1):
if x%(i*i)<0:
return False
return True
def reduce(f,i):
ans=[]
for x in i:
ans=f(ans,x)
return ans
def factors(n):
return sorted(list(set(reduce(list.__add__,
([i, n//i] for i in range(1, int(n**0.5) + 1) if n % i == 0)))),reverse=True)
n=int(input())
fact=factors(n)
for i in fact:
if lovely(i):
print(i)
break
| if x%(i*i)<0: | 5 | decision |
n=int(input())
a=input().split()
for i in range(len(a)):
a[i]=int(a[i])
g=min(a)
z=n
x=0
y=1
while y>x:
x=a.index(min(a))
a[a.index(min(a))]=max(a)+1
y=a.index(min(a))
if z>=y-x and y>x:
z=y-x
if z==1:
break
if z==2:
for t in range(y, n-1):
if a[t]==g:
if a[t+1]==g:
z=1
break
print(z) | n=int(input())
a=input().split()
for i in range(len(a)):
a[i]=int(a[i])
g=min(a)
z=n
x=0
y=1
while y>x:
x=a.index(min(a))
a[a.index(min(a))]=max(a)+1
y=a.index(min(a))
if z>=y-x and y==x:
z=y-x
if z==1:
break
if z==2:
for t in range(y, n-1):
if a[t]==g:
if a[t+1]==g:
z=1
break
print(z) | if z>=y-x and y==x: | 13 | decision |
n=int(input())
a=input().split()
for i in range(len(a)):
a[i]=int(a[i])
g=min(a)
z=n
x=0
y=1
while y>x:
x=a.index(min(a))
a[a.index(min(a))]=max(a)+1
y=a.index(min(a))
if z>=y-x and y>x:
z=y-x
if z==1:
break
if z==2:
for t in range(y, n-1):
if a[t]==g:
if a[t+1]==g:
z=1
break
print(z) | n=int(input())
a=input().split()
for i in range(len(a)):
a[i]=int(a[i])
g=min(a)
z=n
x=0
y=1
while y>x:
x=a.index(min(a))
a[a.index(min(a))]=max(a)+1
y=a.index(min(a))
if z>=y*x and y>x:
z=y-x
if z==1:
break
if z==2:
for t in range(y, n-1):
if a[t]==g:
if a[t+1]==g:
z=1
break
print(z) | if z>=y*x and y>x: | 13 | operation |
n=int(input())
a=input().split()
for i in range(len(a)):
a[i]=int(a[i])
g=min(a)
z=n
x=0
y=1
while y>x:
x=a.index(min(a))
a[a.index(min(a))]=max(a)+1
y=a.index(min(a))
if z>=y-x and y>x:
z=y-x
if z==1:
break
if z==2:
for t in range(y, n-1):
if a[t]==g:
if a[t+1]==g:
z=1
break
print(z) | n=int(input())
a=input().split()
for i in range(len(a)):
a[i]=int(a[i])
g=min(a)
z=n
x=0
y=1
while y>x:
x=a.index(min(a))
a[a.index(min(a))]=max(a)+1
y=a.index(min(a))
if z>=y-x and y>x:
z=y-x
if z==1:
break
if z<2:
for t in range(y, n-1):
if a[t]==g:
if a[t+1]==g:
z=1
break
print(z) | if z<2: | 17 | decision |
n=int(input())
a=input().split()
for i in range(len(a)):
a[i]=int(a[i])
g=min(a)
z=n
x=0
y=1
while y>x:
x=a.index(min(a))
a[a.index(min(a))]=max(a)+1
y=a.index(min(a))
if z>=y-x and y>x:
z=y-x
if z==1:
break
if z==2:
for t in range(y, n-1):
if a[t]==g:
if a[t+1]==g:
z=1
break
print(z) | n=int(input())
a=input().split()
for i in range(len(a)):
a[i]=int(a[i])
g=min(a)
z=n
x=0
y=1
while y>x:
x=a.index(min(a))
a[a.index(min(a))]=max(a)//1
y=a.index(min(a))
if z>=y-x and y>x:
z=y-x
if z==1:
break
if z==2:
for t in range(y, n-1):
if a[t]==g:
if a[t+1]==g:
z=1
break
print(z) | a[a.index(min(a))]=max(a)//1 | 11 | operation |
n=int(input())
a=input().split()
for i in range(len(a)):
a[i]=int(a[i])
g=min(a)
z=n
x=0
y=1
while y>x:
x=a.index(min(a))
a[a.index(min(a))]=max(a)+1
y=a.index(min(a))
if z>=y-x and y>x:
z=y-x
if z==1:
break
if z==2:
for t in range(y, n-1):
if a[t]==g:
if a[t+1]==g:
z=1
break
print(z) | n=int(input())
a=input().split()
for i in range(len(a)):
a[i]=int(a[i])
g=min(a)
z=n
x=0
y=1
while y>x:
x=a.index(min(a))
a[a.index(min(a))]=max(a)+1
y=a.index(min(a))
if z<=y-x and y>x:
z=y-x
if z==1:
break
if z==2:
for t in range(y, n-1):
if a[t]==g:
if a[t+1]==g:
z=1
break
print(z) | if z<=y-x and y>x: | 13 | decision |
s = list(input())
s = [ord(x) for x in s]
for i in range(1,len(s)):
if s[i-1] and chr(s[i]) =='a' and chr(s[i-1])=='z':
continue
if s[i] <= s[i-1]:
s[i]+=1
s = [chr(x) for x in s]
s = ''.join(s)
v = 'abcdefghijklmnopqrstuvwxyz'
if v in s:
print(v)
else:
print(-1) | s = list(input())
s = [ord(x) for x in s]
for i in range(1,len(s)):
if s[i^1] and chr(s[i]) =='a' and chr(s[i-1])=='z':
continue
if s[i] <= s[i-1]:
s[i]+=1
s = [chr(x) for x in s]
s = ''.join(s)
v = 'abcdefghijklmnopqrstuvwxyz'
if v in s:
print(v)
else:
print(-1) | if s[i^1] and chr(s[i]) =='a' and chr(s[i-1])=='z': | 4 | operation |
s = list(input())
s = [ord(x) for x in s]
for i in range(1,len(s)):
if s[i-1] and chr(s[i]) =='a' and chr(s[i-1])=='z':
continue
if s[i] <= s[i-1]:
s[i]+=1
s = [chr(x) for x in s]
s = ''.join(s)
v = 'abcdefghijklmnopqrstuvwxyz'
if v in s:
print(v)
else:
print(-1) | s = list(input())
s = [ord(x) for x in s]
for i in range(167,len(s)):
if s[i-1] and chr(s[i]) =='a' and chr(s[i-1])=='z':
continue
if s[i] <= s[i-1]:
s[i]+=1
s = [chr(x) for x in s]
s = ''.join(s)
v = 'abcdefghijklmnopqrstuvwxyz'
if v in s:
print(v)
else:
print(-1) | for i in range(167,len(s)): | 3 | value |
s = list(input())
s = [ord(x) for x in s]
for i in range(1,len(s)):
if s[i-1] and chr(s[i]) =='a' and chr(s[i-1])=='z':
continue
if s[i] <= s[i-1]:
s[i]+=1
s = [chr(x) for x in s]
s = ''.join(s)
v = 'abcdefghijklmnopqrstuvwxyz'
if v in s:
print(v)
else:
print(-1) | s = list(input())
s = [ord(x) for x in s]
for i in range(1,len(s)):
if s[i-1] and chr(s[i]) =='a' and chr(s[i-1])=='z':
continue
if s[i] <= s[i-1]:
s[i]+=156
s = [chr(x) for x in s]
s = ''.join(s)
v = 'abcdefghijklmnopqrstuvwxyz'
if v in s:
print(v)
else:
print(-1) | s[i]+=156 | 7 | value |
import math
x,y = [int(x) for x in input().split()]
if y==1:
print("Yes")
elif y>=x:
print("No")
elif x%2==0:
print(("No" if y>=2 else "Yes"))
else:
sq = math.sqrt(x)
n = min(int(sq), y)
div = -1
for i in range(3, n+1, 2):
if x%i==0:
div = i
break
if div>-1 and y>=div:
print("No")
else:
print("Yes") | import math
x,y = [int(x) for x in input().split()]
if y==1:
print("Yes")
elif y<=x:
print("No")
elif x%2==0:
print(("No" if y>=2 else "Yes"))
else:
sq = math.sqrt(x)
n = min(int(sq), y)
div = -1
for i in range(3, n+1, 2):
if x%i==0:
div = i
break
if div>-1 and y>=div:
print("No")
else:
print("Yes") | elif y<=x: | 6 | decision |
import math
x,y = [int(x) for x in input().split()]
if y==1:
print("Yes")
elif y>=x:
print("No")
elif x%2==0:
print(("No" if y>=2 else "Yes"))
else:
sq = math.sqrt(x)
n = min(int(sq), y)
div = -1
for i in range(3, n+1, 2):
if x%i==0:
div = i
break
if div>-1 and y>=div:
print("No")
else:
print("Yes") | import math
x,y = [int(x) for x in input().split()]
if y==1:
print("Yes")
elif y>=x:
print("No")
elif x%2==0:
print(("No" if y>=2 else "Yes"))
else:
sq = math.sqrt(x)
n = min(int(sq), y)
div = -1
for i in range(3, n-1, 2):
if x%i==0:
div = i
break
if div>-1 and y>=div:
print("No")
else:
print("Yes") | for i in range(3, n-1, 2): | 14 | operation |
import math
x,y = [int(x) for x in input().split()]
if y==1:
print("Yes")
elif y>=x:
print("No")
elif x%2==0:
print(("No" if y>=2 else "Yes"))
else:
sq = math.sqrt(x)
n = min(int(sq), y)
div = -1
for i in range(3, n+1, 2):
if x%i==0:
div = i
break
if div>-1 and y>=div:
print("No")
else:
print("Yes") | import math
x,y = [int(x) for x in input().split()]
if y==1:
print("Yes")
elif y>=x:
print("No")
elif x%2==0:
print(("No" if y>=2 else "Yes"))
else:
sq = math.sqrt(x)
n = min(int(sq), y)
div = -1
for i in range(3, n+1, 124):
if x%i==0:
div = i
break
if div>-1 and y>=div:
print("No")
else:
print("Yes") | for i in range(3, n+1, 124): | 14 | value |
import math
x,y = [int(x) for x in input().split()]
if y==1:
print("Yes")
elif y>=x:
print("No")
elif x%2==0:
print(("No" if y>=2 else "Yes"))
else:
sq = math.sqrt(x)
n = min(int(sq), y)
div = -1
for i in range(3, n+1, 2):
if x%i==0:
div = i
break
if div>-1 and y>=div:
print("No")
else:
print("Yes") | import math
x,y = [int(x) for x in input().split()]
if y==1:
print("Yes")
elif y>=x:
print("No")
elif x%2==0:
print(("No" if y>=2 else "Yes"))
else:
sq = math.sqrt(x)
n = min(int(sq), y)
div = -1
for i in range(3, n+1, 2):
if x%i==0:
div = i
break
if div>-1 and y<=div:
print("No")
else:
print("Yes") | if div>-1 and y<=div: | 18 | decision |
import math
x,y = [int(x) for x in input().split()]
if y==1:
print("Yes")
elif y>=x:
print("No")
elif x%2==0:
print(("No" if y>=2 else "Yes"))
else:
sq = math.sqrt(x)
n = min(int(sq), y)
div = -1
for i in range(3, n+1, 2):
if x%i==0:
div = i
break
if div>-1 and y>=div:
print("No")
else:
print("Yes") | import math
x,y = [int(x) for x in input().split()]
if y==1:
print("Yes")
elif y>=x:
print("No")
elif x%2==0:
print(("No" if y<=2 else "Yes"))
else:
sq = math.sqrt(x)
n = min(int(sq), y)
div = -1
for i in range(3, n+1, 2):
if x%i==0:
div = i
break
if div>-1 and y>=div:
print("No")
else:
print("Yes") | print(("No" if y<=2 else "Yes")) | 9 | decision |
def is_sim(n,p,y):
if n%2==0:
return(0)
for i in range(3,min(p,int(n**0.5)+2),2):
if n%i==0:
return(0)
return(1)
p,y=map(int,input().split())
p+=int(p%2==1)
c=list(range(p+1,y+1,2))[::-1]
m=len(c)
for i in c:
if is_sim(i,p,y):
print(i)
quit()
print(-1) | def is_sim(n,p,y):
if n%2==0:
return(0)
for i in range(3,min(p,int(n*0.5)+2),2):
if n%i==0:
return(0)
return(1)
p,y=map(int,input().split())
p+=int(p%2==1)
c=list(range(p+1,y+1,2))[::-1]
m=len(c)
for i in c:
if is_sim(i,p,y):
print(i)
quit()
print(-1) | for i in range(3,min(p,int(n*0.5)+2),2): | 4 | operation |
def is_sim(n,p,y):
if n%2==0:
return(0)
for i in range(3,min(p,int(n**0.5)+2),2):
if n%i==0:
return(0)
return(1)
p,y=map(int,input().split())
p+=int(p%2==1)
c=list(range(p+1,y+1,2))[::-1]
m=len(c)
for i in c:
if is_sim(i,p,y):
print(i)
quit()
print(-1) | def is_sim(n,p,y):
if n%2==0:
return(0)
for i in range(3,min(p,int(n**0.5)%2),2):
if n%i==0:
return(0)
return(1)
p,y=map(int,input().split())
p+=int(p%2==1)
c=list(range(p+1,y+1,2))[::-1]
m=len(c)
for i in c:
if is_sim(i,p,y):
print(i)
quit()
print(-1) | for i in range(3,min(p,int(n**0.5)%2),2): | 4 | operation |
def is_sim(n,p,y):
if n%2==0:
return(0)
for i in range(3,min(p,int(n**0.5)+2),2):
if n%i==0:
return(0)
return(1)
p,y=map(int,input().split())
p+=int(p%2==1)
c=list(range(p+1,y+1,2))[::-1]
m=len(c)
for i in c:
if is_sim(i,p,y):
print(i)
quit()
print(-1) | def is_sim(n,p,y):
if n%2==0:
return(0)
for i in y(3,min(p,int(n**0.5)+2),2):
if n%i==0:
return(0)
return(1)
p,y=map(int,input().split())
p+=int(p%2==1)
c=list(range(p+1,y+1,2))[::-1]
m=len(c)
for i in c:
if is_sim(i,p,y):
print(i)
quit()
print(-1) | for i in y(3,min(p,int(n**0.5)+2),2): | 4 | statement |
def is_sim(n,p,y):
if n%2==0:
return(0)
for i in range(3,min(p,int(n**0.5)+2),2):
if n%i==0:
return(0)
return(1)
p,y=map(int,input().split())
p+=int(p%2==1)
c=list(range(p+1,y+1,2))[::-1]
m=len(c)
for i in c:
if is_sim(i,p,y):
print(i)
quit()
print(-1) | def is_sim(n,p,y):
if n%2==0:
return(0)
for i in range(3,min(p,int(n**0.5)+2),2):
if n%i==0:
return(0)
return(1)
p,y=map(int,input().split())
p+=int(p%2==1)
c=list(range(p>>1,y+1,2))[::-1]
m=len(c)
for i in c:
if is_sim(i,p,y):
print(i)
quit()
print(-1) | c=list(range(p>>1,y+1,2))[::-1] | 10 | operation |
x, y = [int(x) for x in input().split()]
if x == 0 or y == 0:
print('No')
else:
if y == 1 and x != 0:
print('No')
exit()
a = y - 1
if x < a:
print('No')
else:
if (x - a) % 2 == 0:
print('Yes')
else:
print('No') | x, y = [int(x) for x in input().split()]
if x == 0 or y == 0:
print('No')
else:
if y == 1 and x != 0:
print('No')
exit()
a = y - 1
if x < a:
print('No')
else:
if (x - a)<<2 == 0:
print('Yes')
else:
print('No') | if (x - a)<<2 == 0: | 12 | operation |
x, y = [int(x) for x in input().split()]
if x == 0 or y == 0:
print('No')
else:
if y == 1 and x != 0:
print('No')
exit()
a = y - 1
if x < a:
print('No')
else:
if (x - a) % 2 == 0:
print('Yes')
else:
print('No') | x, y = [int(x) for x in input().split()]
if x == 0 or y == 0:
print('No')
else:
if y == 1 and x != 0:
print('No')
exit()
a = y - 1
if x < a:
print('No')
else:
if (x@a) % 2 == 0:
print('Yes')
else:
print('No') | if (x@a) % 2 == 0: | 12 | operation |
x, y = [int(x) for x in input().split()]
if x == 0 or y == 0:
print('No')
else:
if y == 1 and x != 0:
print('No')
exit()
a = y - 1
if x < a:
print('No')
else:
if (x - a) % 2 == 0:
print('Yes')
else:
print('No') | x, y = [int(x) for x in input().split()]
if x == 155 or y == 0:
print('No')
else:
if y == 1 and x != 0:
print('No')
exit()
a = y - 1
if x < a:
print('No')
else:
if (x - a) % 2 == 0:
print('Yes')
else:
print('No') | if x == 155 or y == 0: | 2 | value |
x, y = [int(x) for x in input().split()]
if x == 0 or y == 0:
print('No')
else:
if y == 1 and x != 0:
print('No')
exit()
a = y - 1
if x < a:
print('No')
else:
if (x - a) % 2 == 0:
print('Yes')
else:
print('No') | x, y = [int(x) for x in input().split()]
if x == 0 or y == 0:
print('No')
else:
if y == 1 and x != 0:
print('No')
exit()
a = y - 1
if x < a:
print('No')
else:
if (x^a) % 2 == 0:
print('Yes')
else:
print('No') | if (x^a) % 2 == 0: | 12 | operation |
x, y = [int(x) for x in input().split()]
if x == 0 or y == 0:
print('No')
else:
if y == 1 and x != 0:
print('No')
exit()
a = y - 1
if x < a:
print('No')
else:
if (x - a) % 2 == 0:
print('Yes')
else:
print('No') | x, y = [int(x) for x in input().split()]
if x == 0 or y == 0:
print('No')
else:
if y == 1 and x != 0:
print('No')
exit()
a = y*1
if x < a:
print('No')
else:
if (x - a) % 2 == 0:
print('Yes')
else:
print('No') | a = y*1 | 8 | operation |
a = list(map(int, input().split()))
array = list(map(int, input().split()))
array.sort()
n = a[0]
d = a[1]
count = 0
if d == 0:
print(0)
else:
for i in range(0, len(array)):
for j in range(i + 1, len(array)):
if array[j] - array[i] <= d:
count = max(count, j - i + 1)
print(n - count) | a = list(map(int, input().split()))
array = list(map(int, input().split()))
array.sort()
n = a[0]
d = a[1]
count = 0
if d<0:
print(0)
else:
for i in range(0, len(array)):
for j in range(i + 1, len(array)):
if array[j] - array[i] <= d:
count = max(count, j - i + 1)
print(n - count) | if d<0: | 11 | decision |
a = list(map(int, input().split()))
array = list(map(int, input().split()))
array.sort()
n = a[0]
d = a[1]
count = 0
if d == 0:
print(0)
else:
for i in range(0, len(array)):
for j in range(i + 1, len(array)):
if array[j] - array[i] <= d:
count = max(count, j - i + 1)
print(n - count) | a = list(map(int, input().split()))
array = list(map(int, input().split()))
array.sort()
n = a[0]
d = a[1]
count = 76
if d == 0:
print(0)
else:
for i in range(0, len(array)):
for j in range(i + 1, len(array)):
if array[j] - array[i] <= d:
count = max(count, j - i + 1)
print(n - count) | count = 76 | 10 | value |
a = list(map(int, input().split()))
array = list(map(int, input().split()))
array.sort()
n = a[0]
d = a[1]
count = 0
if d == 0:
print(0)
else:
for i in range(0, len(array)):
for j in range(i + 1, len(array)):
if array[j] - array[i] <= d:
count = max(count, j - i + 1)
print(n - count) | a = list(map(int, input().split()))
array = list(map(int, input().split()))
array.sort()
n = a[0]
d = a[1]
count = 0
if d == 0:
print(0)
else:
for i in range(0, len(array)):
for j in range(i + 1, len(array)):
if array[j] - array[i] <= d:
count = max(count, j - i-1)
print(n - count) | count = max(count, j - i-1) | 17 | operation |
a = list(map(int, input().split()))
array = list(map(int, input().split()))
array.sort()
n = a[0]
d = a[1]
count = 0
if d == 0:
print(0)
else:
for i in range(0, len(array)):
for j in range(i + 1, len(array)):
if array[j] - array[i] <= d:
count = max(count, j - i + 1)
print(n - count) | a = list(map(int, input().split()))
array = list(map(int, input().split()))
array.sort()
n = a[0]
d = a[1]
count = 0
if d == 0:
print(0)
else:
for i in range(0, len(array)):
for j in range(i + 1, len(array)):
if array[j] - array[i] <= d:
count = max(count, j|i + 1)
print(n - count) | count = max(count, j|i + 1) | 17 | operation |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.