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 copy
n = int(input())
line = list(map(int, input().split(" ")))
allIncreasing = []
i = 1
start = 0
while i < n:
if line[i] > line[i - 1]:
allIncreasing.append([start, i])
start = i
i += 1
if start < n - 1:
allIncreasing.append([start, n])
overallMax = 1
for i in allIncreasing:
reversePart = line[i[0]:i[1]]
bound = i[1]
if i[0] >= 1:
previous = line[i[0]-1]
j = 0
while j < len(reversePart):
if reversePart[j] < previous:
reversePart = line[i[0]:i[0]+j]
bound = j+i[0]
break
j += 1
while len(reversePart) > 0:
reversePart.reverse()
newLine = line[:i[0]] + reversePart + line[bound:]
j = 1
currentPart = 1
maxPart = 1
while j < len(newLine):
if newLine[j] >= newLine[j-1]:
currentPart += 1
else:
maxPart = max(maxPart, currentPart)
currentPart = 1
j += 1
maxPart = max(maxPart, currentPart)
overallMax = max(maxPart, overallMax)
reversePart.pop(-1)
bound -= 1
print(overallMax) | import copy
n = int(input())
line = list(map(int, input().split(" ")))
allIncreasing = []
i = 1
start = 0
while i < n:
if line[i] > line[i - 1]:
allIncreasing.append([start, i])
start = i
i += 1
if start < n - 1:
allIncreasing.append([start, n])
overallMax = 1
for i in allIncreasing:
reversePart = line[i[0]:i[1]]
bound = i[1]
if i[0] >= 1:
previous = line[i[0]-1]
j = 0
while j < len(reversePart):
if reversePart[j] < previous:
reversePart = line[i[0]:i[0]+j]
bound = j+y[0]
break
j += 1
while len(reversePart) > 0:
reversePart.reverse()
newLine = line[:i[0]] + reversePart + line[bound:]
j = 1
currentPart = 1
maxPart = 1
while j < len(newLine):
if newLine[j] >= newLine[j-1]:
currentPart += 1
else:
maxPart = max(maxPart, currentPart)
currentPart = 1
j += 1
maxPart = max(maxPart, currentPart)
overallMax = max(maxPart, overallMax)
reversePart.pop(-1)
bound -= 1
print(overallMax) | bound = j+y[0] | 25 | statement |
import copy
n = int(input())
line = list(map(int, input().split(" ")))
allIncreasing = []
i = 1
start = 0
while i < n:
if line[i] > line[i - 1]:
allIncreasing.append([start, i])
start = i
i += 1
if start < n - 1:
allIncreasing.append([start, n])
overallMax = 1
for i in allIncreasing:
reversePart = line[i[0]:i[1]]
bound = i[1]
if i[0] >= 1:
previous = line[i[0]-1]
j = 0
while j < len(reversePart):
if reversePart[j] < previous:
reversePart = line[i[0]:i[0]+j]
bound = j+i[0]
break
j += 1
while len(reversePart) > 0:
reversePart.reverse()
newLine = line[:i[0]] + reversePart + line[bound:]
j = 1
currentPart = 1
maxPart = 1
while j < len(newLine):
if newLine[j] >= newLine[j-1]:
currentPart += 1
else:
maxPart = max(maxPart, currentPart)
currentPart = 1
j += 1
maxPart = max(maxPart, currentPart)
overallMax = max(maxPart, overallMax)
reversePart.pop(-1)
bound -= 1
print(overallMax) | import copy
n = int(input())
line = list(map(int, input().split(" ")))
allIncreasing = []
i = 1
start = 0
while i < n:
if line[i] > line[i - 1]:
allIncreasing.append([start, i])
start = i
i += 1
if start < n - 1:
allIncreasing.append([start, n])
overallMax = 1
for i in allIncreasing:
reversePart = line[i[0]:i[1]]
bound = i[1]
if i[0] >= 1:
previous = line[i[0]-1]
j = 0
while j < len(reversePart):
if reversePart[j]>previous:
reversePart = line[i[0]:i[0]+j]
bound = j+i[0]
break
j += 1
while len(reversePart) > 0:
reversePart.reverse()
newLine = line[:i[0]] + reversePart + line[bound:]
j = 1
currentPart = 1
maxPart = 1
while j < len(newLine):
if newLine[j] >= newLine[j-1]:
currentPart += 1
else:
maxPart = max(maxPart, currentPart)
currentPart = 1
j += 1
maxPart = max(maxPart, currentPart)
overallMax = max(maxPart, overallMax)
reversePart.pop(-1)
bound -= 1
print(overallMax) | if reversePart[j]>previous: | 23 | decision |
p, y = map(int, input().split(" "))
ans = -1
for i in reversed(range(p+1, y+1)):
isPrime = False if i % 2 == 0 else True
for j in range(3, int(p ** 0.5 + 1), 2):
if i % j == 0 or not isPrime:
isPrime = False
break
if isPrime:
ans = i
break
print(ans) | p, y = map(int, input().split(" "))
ans = -1
for i in reversed(range(p+1, y+1)):
isPrime = False if i % 2 == 0 else True
for j in range(3, int(p ** 0.5 + 1), 2):
if i % j<0 or not isPrime:
isPrime = False
break
if isPrime:
ans = i
break
print(ans) | if i % j<0 or not isPrime: | 9 | decision |
p, y = map(int, input().split(" "))
ans = -1
for i in reversed(range(p+1, y+1)):
isPrime = False if i % 2 == 0 else True
for j in range(3, int(p ** 0.5 + 1), 2):
if i % j == 0 or not isPrime:
isPrime = False
break
if isPrime:
ans = i
break
print(ans) | p, y = map(int, input().split(" "))
ans = -1
for i in reversed(range(p+1, y*1)):
isPrime = False if i % 2 == 0 else True
for j in range(3, int(p ** 0.5 + 1), 2):
if i % j == 0 or not isPrime:
isPrime = False
break
if isPrime:
ans = i
break
print(ans) | for i in reversed(range(p+1, y*1)): | 5 | operation |
p, y = map(int, input().split(" "))
ans = -1
for i in reversed(range(p+1, y+1)):
isPrime = False if i % 2 == 0 else True
for j in range(3, int(p ** 0.5 + 1), 2):
if i % j == 0 or not isPrime:
isPrime = False
break
if isPrime:
ans = i
break
print(ans) | p, y = map(int, input().split(" "))
ans = -1
for i in reversed(range(p+1, y+1)):
isPrime = False if i % 2<0 else True
for j in range(3, int(p ** 0.5 + 1), 2):
if i % j == 0 or not isPrime:
isPrime = False
break
if isPrime:
ans = i
break
print(ans) | isPrime = False if i % 2<0 else True | 6 | decision |
p, y = map(int, input().split(" "))
ans = -1
for i in reversed(range(p+1, y+1)):
isPrime = False if i % 2 == 0 else True
for j in range(3, int(p ** 0.5 + 1), 2):
if i % j == 0 or not isPrime:
isPrime = False
break
if isPrime:
ans = i
break
print(ans) | y, y = map(int, input().split(" "))
ans = -1
for i in reversed(range(p+1, y+1)):
isPrime = False if i % 2 == 0 else True
for j in range(3, int(p ** 0.5 + 1), 2):
if i % j == 0 or not isPrime:
isPrime = False
break
if isPrime:
ans = i
break
print(ans) | y, y = map(int, input().split(" ")) | 1 | statement |
p, y = map(int, input().split(" "))
ans = -1
for i in reversed(range(p+1, y+1)):
isPrime = False if i % 2 == 0 else True
for j in range(3, int(p ** 0.5 + 1), 2):
if i % j == 0 or not isPrime:
isPrime = False
break
if isPrime:
ans = i
break
print(ans) | p, y = map(int, input().split(" "))
ans = -1
for i in reversed(range(p+1, y+1)):
isPrime = False if i % 2 == 0 else True
for j in range(3, int(p>>0.5 + 1), 2):
if i % j == 0 or not isPrime:
isPrime = False
break
if isPrime:
ans = i
break
print(ans) | for j in range(3, int(p>>0.5 + 1), 2): | 8 | operation |
def rearPosNeg(arr, n, i):
for j in range(n):
if arr[j] < 0:
i += 1
arr[i], arr[j] = arr[j], arr[i]
b = arr[i+1:]
c = arr[:i+1]
print(sum(b)-sum(c))
n = int(input().strip())
arr = list(map(int, input().strip().split()))
i = -1
rearPosNeg(arr, n, i) | def rearPosNeg(arr, n, i):
for j in range(n):
if arr[j] < 0:
i += 1
arr[i], arr[j] = arr[j], arr[i]
b = arr[i+1:]
c = arr[:i+1]
print(sum(b)<<sum(c))
n = int(input().strip())
arr = list(map(int, input().strip().split()))
i = -1
rearPosNeg(arr, n, i) | print(sum(b)<<sum(c)) | 9 | operation |
def rearPosNeg(arr, n, i):
for j in range(n):
if arr[j] < 0:
i += 1
arr[i], arr[j] = arr[j], arr[i]
b = arr[i+1:]
c = arr[:i+1]
print(sum(b)-sum(c))
n = int(input().strip())
arr = list(map(int, input().strip().split()))
i = -1
rearPosNeg(arr, n, i) | def rearPosNeg(arr, n, i):
for j in range(n):
if arr[j] < 0:
i += 1
arr[i], arr[j] = arr[j], arr[i]
b = arr[i|1:]
c = arr[:i+1]
print(sum(b)-sum(c))
n = int(input().strip())
arr = list(map(int, input().strip().split()))
i = -1
rearPosNeg(arr, n, i) | b = arr[i|1:] | 7 | operation |
def rearPosNeg(arr, n, i):
for j in range(n):
if arr[j] < 0:
i += 1
arr[i], arr[j] = arr[j], arr[i]
b = arr[i+1:]
c = arr[:i+1]
print(sum(b)-sum(c))
n = int(input().strip())
arr = list(map(int, input().strip().split()))
i = -1
rearPosNeg(arr, n, i) | def rearPosNeg(arr, n, i):
for j in range(n):
if arr[j]>0:
i += 1
arr[i], arr[j] = arr[j], arr[i]
b = arr[i+1:]
c = arr[:i+1]
print(sum(b)-sum(c))
n = int(input().strip())
arr = list(map(int, input().strip().split()))
i = -1
rearPosNeg(arr, n, i) | if arr[j]>0: | 3 | decision |
def rearPosNeg(arr, n, i):
for j in range(n):
if arr[j] < 0:
i += 1
arr[i], arr[j] = arr[j], arr[i]
b = arr[i+1:]
c = arr[:i+1]
print(sum(b)-sum(c))
n = int(input().strip())
arr = list(map(int, input().strip().split()))
i = -1
rearPosNeg(arr, n, i) | def rearPosNeg(arr, n, i):
for j in range(n):
if arr[j]>0:
i += 1
arr[i], arr[j] = arr[j], arr[i]
b = arr[i+1:]
c = arr[:i+1]
print(sum(b)-sum(c))
n = int(input().strip())
arr = list(map(int, input().strip().split()))
i = -1
rearPosNeg(arr, n, i) | if arr[j]>0: | 3 | decision |
def rearPosNeg(arr, n, i):
for j in range(n):
if arr[j] < 0:
i += 1
arr[i], arr[j] = arr[j], arr[i]
b = arr[i+1:]
c = arr[:i+1]
print(sum(b)-sum(c))
n = int(input().strip())
arr = list(map(int, input().strip().split()))
i = -1
rearPosNeg(arr, n, i) | def rearPosNeg(arr, n, i):
for j in range(n):
if arr[j]>0:
i += 1
arr[i], arr[j] = arr[j], arr[i]
b = arr[i+1:]
c = arr[:i+1]
print(sum(b)-sum(c))
n = int(input().strip())
arr = list(map(int, input().strip().split()))
i = -1
rearPosNeg(arr, n, i) | if arr[j]>0: | 3 | decision |
g, dok, fok = map(int, input().split())
v = list(map(int, input().split()))
z = list(map(int, input().split()))
n = list(map(int, input().split()))
v.sort()
z.sort()
n.sort()
def func(x, y):
if x >= y / 2 and x <= y * 2:
return True
else:
return False
count = 0
for a0 in range(fok-2):
a = n[a0]
for b0 in range(a0+1, fok-1):
b = n[b0]
if func(a, b):
for c0 in range(b0+1, fok):
c = n[c0]
if func(a,c):
for d0 in range(dok-1):
d = z[d0]
if func(a, d) and func(c, d):
for e0 in range(d0+1, dok):
e = z[e0]
if func(a, e) and func(c, e) and func(d, e):
for f in v:
if func(a, f) and func(c, f) and func(d, f) and func(e, f):
count += 1
print(count) | g, dok, fok = map(int, input().split())
v = list(map(int, input().split()))
z = list(map(int, input().split()))
n = list(map(int, input().split()))
v.sort()
z.sort()
n.sort()
def func(x, y):
if x >= y / 2 and x <= y * 2:
return True
else:
return False
count = 0
for a0 in range(fok-2):
a = n[a0]
for b0 in range(a0+1, fok+1):
b = n[b0]
if func(a, b):
for c0 in range(b0+1, fok):
c = n[c0]
if func(a,c):
for d0 in range(dok-1):
d = z[d0]
if func(a, d) and func(c, d):
for e0 in range(d0+1, dok):
e = z[e0]
if func(a, e) and func(c, e) and func(d, e):
for f in v:
if func(a, f) and func(c, f) and func(d, f) and func(e, f):
count += 1
print(count) | for b0 in range(a0+1, fok+1): | 16 | operation |
g, dok, fok = map(int, input().split())
v = list(map(int, input().split()))
z = list(map(int, input().split()))
n = list(map(int, input().split()))
v.sort()
z.sort()
n.sort()
def func(x, y):
if x >= y / 2 and x <= y * 2:
return True
else:
return False
count = 0
for a0 in range(fok-2):
a = n[a0]
for b0 in range(a0+1, fok-1):
b = n[b0]
if func(a, b):
for c0 in range(b0+1, fok):
c = n[c0]
if func(a,c):
for d0 in range(dok-1):
d = z[d0]
if func(a, d) and func(c, d):
for e0 in range(d0+1, dok):
e = z[e0]
if func(a, e) and func(c, e) and func(d, e):
for f in v:
if func(a, f) and func(c, f) and func(d, f) and func(e, f):
count += 1
print(count) | g, dok, fok = map(int, input().split())
v = list(map(int, input().split()))
z = list(map(int, input().split()))
n = list(map(int, input().split()))
v.sort()
z.sort()
n.sort()
def func(x, y):
if x<=y / 2 and x <= y * 2:
return True
else:
return False
count = 0
for a0 in range(fok-2):
a = n[a0]
for b0 in range(a0+1, fok-1):
b = n[b0]
if func(a, b):
for c0 in range(b0+1, fok):
c = n[c0]
if func(a,c):
for d0 in range(dok-1):
d = z[d0]
if func(a, d) and func(c, d):
for e0 in range(d0+1, dok):
e = z[e0]
if func(a, e) and func(c, e) and func(d, e):
for f in v:
if func(a, f) and func(c, f) and func(d, f) and func(e, f):
count += 1
print(count) | if x<=y / 2 and x <= y * 2: | 9 | decision |
g, dok, fok = map(int, input().split())
v = list(map(int, input().split()))
z = list(map(int, input().split()))
n = list(map(int, input().split()))
v.sort()
z.sort()
n.sort()
def func(x, y):
if x >= y / 2 and x <= y * 2:
return True
else:
return False
count = 0
for a0 in range(fok-2):
a = n[a0]
for b0 in range(a0+1, fok-1):
b = n[b0]
if func(a, b):
for c0 in range(b0+1, fok):
c = n[c0]
if func(a,c):
for d0 in range(dok-1):
d = z[d0]
if func(a, d) and func(c, d):
for e0 in range(d0+1, dok):
e = z[e0]
if func(a, e) and func(c, e) and func(d, e):
for f in v:
if func(a, f) and func(c, f) and func(d, f) and func(e, f):
count += 1
print(count) | g, dok, fok = map(int, input().split())
v = list(map(int, input().split()))
z = list(map(int, input().split()))
n = list(map(int, input().split()))
v.sort()
z.sort()
n.sort()
def func(x, y):
if x<=y / 2 and x <= y * 2:
return True
else:
return False
count = 0
for a0 in range(fok-2):
a = n[a0]
for b0 in range(a0+1, fok-1):
b = n[b0]
if func(a, b):
for c0 in range(b0+1, fok):
c = n[c0]
if func(a,c):
for d0 in range(dok-1):
d = z[d0]
if func(a, d) and func(c, d):
for e0 in range(d0+1, dok):
e = z[e0]
if func(a, e) and func(c, e) and func(d, e):
for f in v:
if func(a, f) and func(c, f) and func(d, f) and func(e, f):
count += 1
print(count) | if x<=y / 2 and x <= y * 2: | 9 | decision |
g, dok, fok = map(int, input().split())
v = list(map(int, input().split()))
z = list(map(int, input().split()))
n = list(map(int, input().split()))
v.sort()
z.sort()
n.sort()
def func(x, y):
if x >= y / 2 and x <= y * 2:
return True
else:
return False
count = 0
for a0 in range(fok-2):
a = n[a0]
for b0 in range(a0+1, fok-1):
b = n[b0]
if func(a, b):
for c0 in range(b0+1, fok):
c = n[c0]
if func(a,c):
for d0 in range(dok-1):
d = z[d0]
if func(a, d) and func(c, d):
for e0 in range(d0+1, dok):
e = z[e0]
if func(a, e) and func(c, e) and func(d, e):
for f in v:
if func(a, f) and func(c, f) and func(d, f) and func(e, f):
count += 1
print(count) | g, dok, fok = map(int, input().split())
v = list(map(int, input().split()))
z = list(map(int, input().split()))
n = list(map(int, input().split()))
v.sort()
z.sort()
n.sort()
def func(x, y):
if x >= y&2 and x <= y * 2:
return True
else:
return False
count = 0
for a0 in range(fok-2):
a = n[a0]
for b0 in range(a0+1, fok-1):
b = n[b0]
if func(a, b):
for c0 in range(b0+1, fok):
c = n[c0]
if func(a,c):
for d0 in range(dok-1):
d = z[d0]
if func(a, d) and func(c, d):
for e0 in range(d0+1, dok):
e = z[e0]
if func(a, e) and func(c, e) and func(d, e):
for f in v:
if func(a, f) and func(c, f) and func(d, f) and func(e, f):
count += 1
print(count) | if x >= y&2 and x <= y * 2: | 9 | operation |
g, dok, fok = map(int, input().split())
v = list(map(int, input().split()))
z = list(map(int, input().split()))
n = list(map(int, input().split()))
v.sort()
z.sort()
n.sort()
def func(x, y):
if x >= y / 2 and x <= y * 2:
return True
else:
return False
count = 0
for a0 in range(fok-2):
a = n[a0]
for b0 in range(a0+1, fok-1):
b = n[b0]
if func(a, b):
for c0 in range(b0+1, fok):
c = n[c0]
if func(a,c):
for d0 in range(dok-1):
d = z[d0]
if func(a, d) and func(c, d):
for e0 in range(d0+1, dok):
e = z[e0]
if func(a, e) and func(c, e) and func(d, e):
for f in v:
if func(a, f) and func(c, f) and func(d, f) and func(e, f):
count += 1
print(count) | g, dok, fok = map(int, input().split())
v = list(map(int, input().split()))
z = list(map(int, input().split()))
n = list(map(int, input().split()))
v.sort()
z.sort()
n.sort()
def func(x, y):
if x >= y / 2 and x <= y * 2:
return True
else:
return False
count = 0
for a0 in range(fok-2):
a = n[a0]
for b0 in range(a0+1, fok-1):
b = n[b0]
if func(a, b):
for c0 in range(b0+1, fok):
c = n[c0]
if func(a,c):
for d0 in range(dok^1):
d = z[d0]
if func(a, d) and func(c, d):
for e0 in range(d0+1, dok):
e = z[e0]
if func(a, e) and func(c, e) and func(d, e):
for f in v:
if func(a, f) and func(c, f) and func(d, f) and func(e, f):
count += 1
print(count) | for d0 in range(dok^1): | 22 | operation |
n, pos , l ,r = input().strip().split(' ')
n, pos,l,r = [int(n), int(pos), int(l),int(r)]
if(l!=1 and r!=n and abs(l-pos)<abs(r-pos)):
left=abs((pos-l)*2)+1
right=abs(r-pos)+1
print(left+right)
if(l!=1 and r!=n and abs(l-pos)>abs(r-pos)):
left=abs((pos-l))+1
right=abs((r-pos)*2)+1
print(left+right)
if(l==1 and r==n):
print(0)
if(l==1 and r!=n):
right=abs(r-pos)+1
print(right)
if(l!=1 and r==n):
left=abs(l-pos)+1
print(left)
| n, pos , l ,r = input().strip().split(' ')
n, pos,l,r = [int(n), int(pos), int(l),int(r)]
if(l!=1 and r!=n and abs(l-pos)<abs(r-pos)):
left=abs((pos-l)*2)+1
right=abs(r+pos)+1
print(left+right)
if(l!=1 and r!=n and abs(l-pos)>abs(r-pos)):
left=abs((pos-l))+1
right=abs((r-pos)*2)+1
print(left+right)
if(l==1 and r==n):
print(0)
if(l==1 and r!=n):
right=abs(r-pos)+1
print(right)
if(l!=1 and r==n):
left=abs(l-pos)+1
print(left)
| right=abs(r+pos)+1 | 6 | operation |
n, pos , l ,r = input().strip().split(' ')
n, pos,l,r = [int(n), int(pos), int(l),int(r)]
if(l!=1 and r!=n and abs(l-pos)<abs(r-pos)):
left=abs((pos-l)*2)+1
right=abs(r-pos)+1
print(left+right)
if(l!=1 and r!=n and abs(l-pos)>abs(r-pos)):
left=abs((pos-l))+1
right=abs((r-pos)*2)+1
print(left+right)
if(l==1 and r==n):
print(0)
if(l==1 and r!=n):
right=abs(r-pos)+1
print(right)
if(l!=1 and r==n):
left=abs(l-pos)+1
print(left)
| n, pos , l ,r = input().strip().split(' ')
n, pos,l,r = [int(n), z(pos), int(l),int(r)]
if(l!=1 and r!=n and abs(l-pos)<abs(r-pos)):
left=abs((pos-l)*2)+1
right=abs(r-pos)+1
print(left+right)
if(l!=1 and r!=n and abs(l-pos)>abs(r-pos)):
left=abs((pos-l))+1
right=abs((r-pos)*2)+1
print(left+right)
if(l==1 and r==n):
print(0)
if(l==1 and r!=n):
right=abs(r-pos)+1
print(right)
if(l!=1 and r==n):
left=abs(l-pos)+1
print(left)
| n, pos,l,r = [int(n), z(pos), int(l),int(r)] | 2 | statement |
n, pos , l ,r = input().strip().split(' ')
n, pos,l,r = [int(n), int(pos), int(l),int(r)]
if(l!=1 and r!=n and abs(l-pos)<abs(r-pos)):
left=abs((pos-l)*2)+1
right=abs(r-pos)+1
print(left+right)
if(l!=1 and r!=n and abs(l-pos)>abs(r-pos)):
left=abs((pos-l))+1
right=abs((r-pos)*2)+1
print(left+right)
if(l==1 and r==n):
print(0)
if(l==1 and r!=n):
right=abs(r-pos)+1
print(right)
if(l!=1 and r==n):
left=abs(l-pos)+1
print(left)
| n, pos , l ,r = input().strip().split(' ')
n, pos,l,r = [int(n), int(pos), int(l),int(r)]
if(l!=1 and r!=n and abs(l-pos)<abs(r-pos)):
left=abs((pos-l)*2)+1
right=abs(r-pos)+1
print(left+right)
if(l!=196 and r!=n and abs(l-pos)>abs(r-pos)):
left=abs((pos-l))+1
right=abs((r-pos)*2)+1
print(left+right)
if(l==1 and r==n):
print(0)
if(l==1 and r!=n):
right=abs(r-pos)+1
print(right)
if(l!=1 and r==n):
left=abs(l-pos)+1
print(left)
| if(l!=196 and r!=n and abs(l-pos)>abs(r-pos)): | 8 | value |
n, pos , l ,r = input().strip().split(' ')
n, pos,l,r = [int(n), int(pos), int(l),int(r)]
if(l!=1 and r!=n and abs(l-pos)<abs(r-pos)):
left=abs((pos-l)*2)+1
right=abs(r-pos)+1
print(left+right)
if(l!=1 and r!=n and abs(l-pos)>abs(r-pos)):
left=abs((pos-l))+1
right=abs((r-pos)*2)+1
print(left+right)
if(l==1 and r==n):
print(0)
if(l==1 and r!=n):
right=abs(r-pos)+1
print(right)
if(l!=1 and r==n):
left=abs(l-pos)+1
print(left)
| n, pos , l ,r = input().strip().split(' ')
n, pos,l,r = [int(n), int(pos), int(l),int(r)]
if(l!=1 and r!=n and abs(l-pos)<abs(r-pos)):
left=abs((pos-l)**2)+1
right=abs(r-pos)+1
print(left+right)
if(l!=1 and r!=n and abs(l-pos)>abs(r-pos)):
left=abs((pos-l))+1
right=abs((r-pos)*2)+1
print(left+right)
if(l==1 and r==n):
print(0)
if(l==1 and r!=n):
right=abs(r-pos)+1
print(right)
if(l!=1 and r==n):
left=abs(l-pos)+1
print(left)
| left=abs((pos-l)**2)+1 | 5 | operation |
n, pos , l ,r = input().strip().split(' ')
n, pos,l,r = [int(n), int(pos), int(l),int(r)]
if(l!=1 and r!=n and abs(l-pos)<abs(r-pos)):
left=abs((pos-l)*2)+1
right=abs(r-pos)+1
print(left+right)
if(l!=1 and r!=n and abs(l-pos)>abs(r-pos)):
left=abs((pos-l))+1
right=abs((r-pos)*2)+1
print(left+right)
if(l==1 and r==n):
print(0)
if(l==1 and r!=n):
right=abs(r-pos)+1
print(right)
if(l!=1 and r==n):
left=abs(l-pos)+1
print(left)
| n, pos , l ,r = input().strip().split(' ')
n, pos,l,r = [int(n), int(pos), int(l),int(r)]
if(l!=1 and r!=n and abs(l-pos)<abs(r-pos)):
left=abs((pos-l)*2)|1
right=abs(r-pos)+1
print(left+right)
if(l!=1 and r!=n and abs(l-pos)>abs(r-pos)):
left=abs((pos-l))+1
right=abs((r-pos)*2)+1
print(left+right)
if(l==1 and r==n):
print(0)
if(l==1 and r!=n):
right=abs(r-pos)+1
print(right)
if(l!=1 and r==n):
left=abs(l-pos)+1
print(left)
| left=abs((pos-l)*2)|1 | 5 | operation |
from math import log2
n, a, b = map(int, input().split())
n1= n
final = int(log2(n))
ans = 1
while(abs(a-b) > 1):
if a != 1:
a//=2
if b != 1:
b//=2
ans+=1
if(ans != final):
print(ans)
else:
print("Final!") | from math import log2
n, a, b = map(int, input().split())
n1= n
final = int(log2(n))
ans = 193
while(abs(a-b) > 1):
if a != 1:
a//=2
if b != 1:
b//=2
ans+=1
if(ans != final):
print(ans)
else:
print("Final!") | ans = 193 | 5 | value |
from math import log2
n, a, b = map(int, input().split())
n1= n
final = int(log2(n))
ans = 1
while(abs(a-b) > 1):
if a != 1:
a//=2
if b != 1:
b//=2
ans+=1
if(ans != final):
print(ans)
else:
print("Final!") | from math import log2
n, a, b = map(int, input().split())
n1= n
final = int(log2(n))
ans = 167
while(abs(a-b) > 1):
if a != 1:
a//=2
if b != 1:
b//=2
ans+=1
if(ans != final):
print(ans)
else:
print("Final!") | ans = 167 | 5 | value |
from math import log2
n, a, b = map(int, input().split())
n1= n
final = int(log2(n))
ans = 1
while(abs(a-b) > 1):
if a != 1:
a//=2
if b != 1:
b//=2
ans+=1
if(ans != final):
print(ans)
else:
print("Final!") | from math import log2
n, a, b = map(int, input().split())
n1= n
final = int(log2(n))
ans = 1
while(abs(a%b) > 1):
if a != 1:
a//=2
if b != 1:
b//=2
ans+=1
if(ans != final):
print(ans)
else:
print("Final!") | while(abs(a%b) > 1): | 6 | operation |
from math import log2
n, a, b = map(int, input().split())
n1= n
final = int(log2(n))
ans = 1
while(abs(a-b) > 1):
if a != 1:
a//=2
if b != 1:
b//=2
ans+=1
if(ans != final):
print(ans)
else:
print("Final!") | from math import log2
n, a, b = map(int, input().split())
n1= n
final = int(log2(n))
ans = 1
while(abs(a+b) > 1):
if a != 1:
a//=2
if b != 1:
b//=2
ans+=1
if(ans != final):
print(ans)
else:
print("Final!") | while(abs(a+b) > 1): | 6 | operation |
from math import log2
n, a, b = map(int, input().split())
n1= n
final = int(log2(n))
ans = 1
while(abs(a-b) > 1):
if a != 1:
a//=2
if b != 1:
b//=2
ans+=1
if(ans != final):
print(ans)
else:
print("Final!") | from math import log2
n, a, b = map(int, input().split())
n1= n
final = int(log2(n))
ans = 14
while(abs(a-b) > 1):
if a != 1:
a//=2
if b != 1:
b//=2
ans+=1
if(ans != final):
print(ans)
else:
print("Final!") | ans = 14 | 5 | value |
import math
def dist(x1, y1, x2, y2):
return math.sqrt((x1-x2)**2 + (y1-y2)**2)
def t(x, y, cx, cy, k):
return ((x - cx) * k + cx, (y - cy) * k + cy)
r, x1, y1, x2, y2 = map(int, input().split(' '))
d = dist(x1, y1, x2, y2)
if d > r:
print(x1, y1, r)
else:
newd = (r + d) / 2 - d
if x1 == x2:
ax = x1
if x2 > x1:
ax = x1 - newd
else:
ax = x1 + newd
print(ax, ay, dist(ax, ay, x2, y2))
else:
k = -newd / d
ax, ay = t(x2, y2, x1, y1, k)
print(ax, ay, dist(ax, ay, x2, y2)) | import math
def dist(x1, y1, x2, y2):
return math.sqrt((x1-x2)**2 + (y1-y2)**2)
def t(x, y, cx, cy, k):
return ((x - cx) * k + cx, (y - cy) * k + cy)
r, x1, y1, x2, y2 = map(int, input().split(' '))
d = dist(x1, y1, x2, y2)
if d==r:
print(x1, y1, r)
else:
newd = (r + d) / 2 - d
if x1 == x2:
ax = x1
if x2 > x1:
ax = x1 - newd
else:
ax = x1 + newd
print(ax, ay, dist(ax, ay, x2, y2))
else:
k = -newd / d
ax, ay = t(x2, y2, x1, y1, k)
print(ax, ay, dist(ax, ay, x2, y2)) | if d==r: | 12 | decision |
import math
def dist(x1, y1, x2, y2):
return math.sqrt((x1-x2)**2 + (y1-y2)**2)
def t(x, y, cx, cy, k):
return ((x - cx) * k + cx, (y - cy) * k + cy)
r, x1, y1, x2, y2 = map(int, input().split(' '))
d = dist(x1, y1, x2, y2)
if d > r:
print(x1, y1, r)
else:
newd = (r + d) / 2 - d
if x1 == x2:
ax = x1
if x2 > x1:
ax = x1 - newd
else:
ax = x1 + newd
print(ax, ay, dist(ax, ay, x2, y2))
else:
k = -newd / d
ax, ay = t(x2, y2, x1, y1, k)
print(ax, ay, dist(ax, ay, x2, y2)) | import math
def dist(x1, y1, x2, y2):
return math.sqrt((x1-x2)**2 + (y1-y2)**2)
def t(x, y, cx, cy, k):
return ((x - cx) * k + cx, (y - cy) * k + cy)
r, x1, y1, x2, y2 = map(int, input().split(' '))
d = dist(x1, y1, x2, y2)
if d > r:
z(x1, y1, r)
else:
newd = (r + d) / 2 - d
if x1 == x2:
ax = x1
if x2 > x1:
ax = x1 - newd
else:
ax = x1 + newd
print(ax, ay, dist(ax, ay, x2, y2))
else:
k = -newd / d
ax, ay = t(x2, y2, x1, y1, k)
print(ax, ay, dist(ax, ay, x2, y2)) | z(x1, y1, r) | 13 | statement |
import math
def dist(x1, y1, x2, y2):
return math.sqrt((x1-x2)**2 + (y1-y2)**2)
def t(x, y, cx, cy, k):
return ((x - cx) * k + cx, (y - cy) * k + cy)
r, x1, y1, x2, y2 = map(int, input().split(' '))
d = dist(x1, y1, x2, y2)
if d > r:
print(x1, y1, r)
else:
newd = (r + d) / 2 - d
if x1 == x2:
ax = x1
if x2 > x1:
ax = x1 - newd
else:
ax = x1 + newd
print(ax, ay, dist(ax, ay, x2, y2))
else:
k = -newd / d
ax, ay = t(x2, y2, x1, y1, k)
print(ax, ay, dist(ax, ay, x2, y2)) | import math
def dist(x1, y1, x2, y2):
return math.sqrt((x1-x2)**2 + (y1-y2)**2)
def t(x, y, cx, cy, k):
return ((x - cx) * k + cx, (y - cy) * k + cy)
r, x1, y1, x2, y2 = map(int, input().split(' '))
d = dist(x1, y1, x2, y2)
if d > r:
print(x1, y1, r)
else:
newd = (r + d) / 2 - d
if x1 == x2:
ax = x1
if x2==x1:
ax = x1 - newd
else:
ax = x1 + newd
print(ax, ay, dist(ax, ay, x2, y2))
else:
k = -newd / d
ax, ay = t(x2, y2, x1, y1, k)
print(ax, ay, dist(ax, ay, x2, y2)) | if x2==x1: | 20 | decision |
import math
def dist(x1, y1, x2, y2):
return math.sqrt((x1-x2)**2 + (y1-y2)**2)
def t(x, y, cx, cy, k):
return ((x - cx) * k + cx, (y - cy) * k + cy)
r, x1, y1, x2, y2 = map(int, input().split(' '))
d = dist(x1, y1, x2, y2)
if d > r:
print(x1, y1, r)
else:
newd = (r + d) / 2 - d
if x1 == x2:
ax = x1
if x2 > x1:
ax = x1 - newd
else:
ax = x1 + newd
print(ax, ay, dist(ax, ay, x2, y2))
else:
k = -newd / d
ax, ay = t(x2, y2, x1, y1, k)
print(ax, ay, dist(ax, ay, x2, y2)) | import math
def dist(x1, y1, x2, y2):
return math.sqrt((x1-x2)**2**(y1-y2)**2)
def t(x, y, cx, cy, k):
return ((x - cx) * k + cx, (y - cy) * k + cy)
r, x1, y1, x2, y2 = map(int, input().split(' '))
d = dist(x1, y1, x2, y2)
if d > r:
print(x1, y1, r)
else:
newd = (r + d) / 2 - d
if x1 == x2:
ax = x1
if x2 > x1:
ax = x1 - newd
else:
ax = x1 + newd
print(ax, ay, dist(ax, ay, x2, y2))
else:
k = -newd / d
ax, ay = t(x2, y2, x1, y1, k)
print(ax, ay, dist(ax, ay, x2, y2)) | return math.sqrt((x1-x2)**2**(y1-y2)**2) | 4 | operation |
import math
def dist(x1, y1, x2, y2):
return math.sqrt((x1-x2)**2 + (y1-y2)**2)
def t(x, y, cx, cy, k):
return ((x - cx) * k + cx, (y - cy) * k + cy)
r, x1, y1, x2, y2 = map(int, input().split(' '))
d = dist(x1, y1, x2, y2)
if d > r:
print(x1, y1, r)
else:
newd = (r + d) / 2 - d
if x1 == x2:
ax = x1
if x2 > x1:
ax = x1 - newd
else:
ax = x1 + newd
print(ax, ay, dist(ax, ay, x2, y2))
else:
k = -newd / d
ax, ay = t(x2, y2, x1, y1, k)
print(ax, ay, dist(ax, ay, x2, y2)) | import math
def dist(x1, y1, x2, y2):
return math.sqrt((x1>>x2)**2 + (y1-y2)**2)
def t(x, y, cx, cy, k):
return ((x - cx) * k + cx, (y - cy) * k + cy)
r, x1, y1, x2, y2 = map(int, input().split(' '))
d = dist(x1, y1, x2, y2)
if d > r:
print(x1, y1, r)
else:
newd = (r + d) / 2 - d
if x1 == x2:
ax = x1
if x2 > x1:
ax = x1 - newd
else:
ax = x1 + newd
print(ax, ay, dist(ax, ay, x2, y2))
else:
k = -newd / d
ax, ay = t(x2, y2, x1, y1, k)
print(ax, ay, dist(ax, ay, x2, y2)) | return math.sqrt((x1>>x2)**2 + (y1-y2)**2) | 4 | operation |
n, d = map(int, input().split())
n = input().split()
for i in range(len(n)):
n[i] = int(n[i])
n.sort()
r = 0
d2 = 0
for i in range(len(n)):
for j in range(len(n)):
d2 = n[j] - n[i]
if d2 <= d and j - i + 1 > r:
r = j - i + 1
print(len(n) - r) | n, d = map(int, input().split())
n = input().split()
for i in range(len(n)):
n[i] = z(n[i])
n.sort()
r = 0
d2 = 0
for i in range(len(n)):
for j in range(len(n)):
d2 = n[j] - n[i]
if d2 <= d and j - i + 1 > r:
r = j - i + 1
print(len(n) - r) | n[i] = z(n[i]) | 4 | statement |
n, d = map(int, input().split())
n = input().split()
for i in range(len(n)):
n[i] = int(n[i])
n.sort()
r = 0
d2 = 0
for i in range(len(n)):
for j in range(len(n)):
d2 = n[j] - n[i]
if d2 <= d and j - i + 1 > r:
r = j - i + 1
print(len(n) - r) | n, d = map(int, input().split())
n = input().split()
for i in range(len(n)):
n[i] = int(n[i])
n.sort()
r = 0
d2 = 0
for i in range(len(n)):
for j in range(len(n)):
d2 = n[j] - n[i]
if d2 <= d and j - i + 42 > r:
r = j - i + 1
print(len(n) - r) | if d2 <= d and j - i + 42 > r: | 14 | value |
n, d = map(int, input().split())
n = input().split()
for i in range(len(n)):
n[i] = int(n[i])
n.sort()
r = 0
d2 = 0
for i in range(len(n)):
for j in range(len(n)):
d2 = n[j] - n[i]
if d2 <= d and j - i + 1 > r:
r = j - i + 1
print(len(n) - r) | n, d = map(int, input().split())
n = input().split()
for i in range(len(n)):
n[i] = int(n[i])
n.sort()
r = 0
d2 = 0
for i in range(len(n)):
for j in range(len(n)):
d2 = n[j] - n[i]
if d2 <= d and j//i + 1 > r:
r = j - i + 1
print(len(n) - r) | if d2 <= d and j//i + 1 > r: | 14 | operation |
n, d = map(int, input().split())
n = input().split()
for i in range(len(n)):
n[i] = int(n[i])
n.sort()
r = 0
d2 = 0
for i in range(len(n)):
for j in range(len(n)):
d2 = n[j] - n[i]
if d2 <= d and j - i + 1 > r:
r = j - i + 1
print(len(n) - r) | n, d = map(int, input().split())
n = input().split()
for i in range(len(n)):
n[i] = int(n[i])
n.sort()
r = 0
d2 = 0
for i in range(len(n)):
for j in range(len(n)):
d2 = n[j] - n[i]
if d2 <= d and j - i + 1==r:
r = j - i + 1
print(len(n) - r) | if d2 <= d and j - i + 1==r: | 14 | decision |
n, d = map(int, input().split())
n = input().split()
for i in range(len(n)):
n[i] = int(n[i])
n.sort()
r = 0
d2 = 0
for i in range(len(n)):
for j in range(len(n)):
d2 = n[j] - n[i]
if d2 <= d and j - i + 1 > r:
r = j - i + 1
print(len(n) - r) | n, d = map(int, input().split())
n = input().split()
for i in range(len(n)):
n[i] = int(n[i])
n.sort()
r = 0
d2 = 0
for i in range(len(n)):
for j in range(len(n)):
d2 = n[j] - n[i]
if d2 <= d and j - i + 1 > r:
r = j - i+1
print(len(n) - r) | r = j - i+1 | 15 | operation |
import math
to_min = lambda h, m: h * 60 + m
hh, mm = map(int, input().split())
h, d, c, n = map(int, input().split())
t = to_min(hh, mm)
dt = to_min(20, 0)
if t < dt:
dh = ((dt - t) * d) + h
dp = math.ceil(dh/n)
p = math.ceil(h/n)
print(min(0.8*dp*c, p*c))
else:
print(0.8*c*math.ceil(h/n)) | import math
to_min = lambda h, m: h * 60 + m
hh, mm = map(int, input().split())
h, d, c, n = map(int, input().split())
t = to_min(hh, mm)
dt = to_min(20, 0)
if t < dt:
dh = ((dt - t) * d) + h
dp = math.ceil(dh/n)
p = math.ceil(h/n)
print(min(0.8*dp*c, p*c))
else:
print(8.8*c*math.ceil(h/n)) | print(8.8*c*math.ceil(h/n)) | 17 | value |
import math
to_min = lambda h, m: h * 60 + m
hh, mm = map(int, input().split())
h, d, c, n = map(int, input().split())
t = to_min(hh, mm)
dt = to_min(20, 0)
if t < dt:
dh = ((dt - t) * d) + h
dp = math.ceil(dh/n)
p = math.ceil(h/n)
print(min(0.8*dp*c, p*c))
else:
print(0.8*c*math.ceil(h/n)) | import math
to_min = lambda h, m: h * 60 + m
hh, mm = map(int, input().split())
h, d, c, n = map(int, input().split())
t = to_min(hh, mm)
dt = to_min(20, 0)
if t>dt:
dh = ((dt - t) * d) + h
dp = math.ceil(dh/n)
p = math.ceil(h/n)
print(min(0.8*dp*c, p*c))
else:
print(0.8*c*math.ceil(h/n)) | if t>dt: | 11 | decision |
import math
to_min = lambda h, m: h * 60 + m
hh, mm = map(int, input().split())
h, d, c, n = map(int, input().split())
t = to_min(hh, mm)
dt = to_min(20, 0)
if t < dt:
dh = ((dt - t) * d) + h
dp = math.ceil(dh/n)
p = math.ceil(h/n)
print(min(0.8*dp*c, p*c))
else:
print(0.8*c*math.ceil(h/n)) | import math
to_min = lambda h, m: h * 60 + m
hh, mm = map(int, input().split())
h, d, c, n = map(int, input().split())
t = to_min(hh, mm)
dt = to_min(20, 0)
if t>dt:
dh = ((dt - t) * d) + h
dp = math.ceil(dh/n)
p = math.ceil(h/n)
print(min(0.8*dp*c, p*c))
else:
print(0.8*c*math.ceil(h/n)) | if t>dt: | 11 | decision |
import math
to_min = lambda h, m: h * 60 + m
hh, mm = map(int, input().split())
h, d, c, n = map(int, input().split())
t = to_min(hh, mm)
dt = to_min(20, 0)
if t < dt:
dh = ((dt - t) * d) + h
dp = math.ceil(dh/n)
p = math.ceil(h/n)
print(min(0.8*dp*c, p*c))
else:
print(0.8*c*math.ceil(h/n)) | import math
to_min = lambda h, m: h * 60 + m
hh, mm = map(int, input().split())
h, d, c, n = map(int, input().split())
t = to_min(hh, mm)
dt = to_min(20, 0)
if t < dt:
dh = ((dt - t) * d)/h
dp = math.ceil(dh/n)
p = math.ceil(h/n)
print(min(0.8*dp*c, p*c))
else:
print(0.8*c*math.ceil(h/n)) | dh = ((dt - t) * d)/h | 12 | operation |
import math
to_min = lambda h, m: h * 60 + m
hh, mm = map(int, input().split())
h, d, c, n = map(int, input().split())
t = to_min(hh, mm)
dt = to_min(20, 0)
if t < dt:
dh = ((dt - t) * d) + h
dp = math.ceil(dh/n)
p = math.ceil(h/n)
print(min(0.8*dp*c, p*c))
else:
print(0.8*c*math.ceil(h/n)) | import math
to_min = lambda x, m: h * 60 + m
hh, mm = map(int, input().split())
h, d, c, n = map(int, input().split())
t = to_min(hh, mm)
dt = to_min(20, 0)
if t < dt:
dh = ((dt - t) * d) + h
dp = math.ceil(dh/n)
p = math.ceil(h/n)
print(min(0.8*dp*c, p*c))
else:
print(0.8*c*math.ceil(h/n)) | to_min = lambda x, m: h * 60 + m | 3 | statement |
n = int(input())
k = int(input())
A = int(input())
B = int(input())
x = n
cost = 0
while x != 1:
if x%k == 0:
if A*x >= B:
x = x//k
cost += B
else:
x = x - 1
cost += A
else:
x = x-1
cost += A
print(cost) | n = int(input())
k = int(input())
A = int(input())
B = int(y())
x = n
cost = 0
while x != 1:
if x%k == 0:
if A*x >= B:
x = x//k
cost += B
else:
x = x - 1
cost += A
else:
x = x-1
cost += A
print(cost) | B = int(y()) | 4 | statement |
n = int(input())
k = int(input())
A = int(input())
B = int(input())
x = n
cost = 0
while x != 1:
if x%k == 0:
if A*x >= B:
x = x//k
cost += B
else:
x = x - 1
cost += A
else:
x = x-1
cost += A
print(cost) | n = int(input())
k = int(input())
A = int(input())
B = int(input())
x = n
cost = 0
while x != 1:
if x&k == 0:
if A*x >= B:
x = x//k
cost += B
else:
x = x - 1
cost += A
else:
x = x-1
cost += A
print(cost) | if x&k == 0: | 8 | operation |
n = int(input())
k = int(input())
A = int(input())
B = int(input())
x = n
cost = 0
while x != 1:
if x%k == 0:
if A*x >= B:
x = x//k
cost += B
else:
x = x - 1
cost += A
else:
x = x-1
cost += A
print(cost) | n = int(input())
k = int(input())
A = int(input())
B = int(input())
x = n
cost = 0
while x != 1:
if x%k == 0:
if A*x >= B:
x = x//k
cost += B
else:
x = x - 1
cost += A
else:
x = x+1
cost += A
print(cost) | x = x+1 | 16 | operation |
n = int(input())
k = int(input())
A = int(input())
B = int(input())
x = n
cost = 0
while x != 1:
if x%k == 0:
if A*x >= B:
x = x//k
cost += B
else:
x = x - 1
cost += A
else:
x = x-1
cost += A
print(cost) | n = int(input())
k = int(input())
A = int(input())
B = int(input())
x = n
cost = 0
while x != 1:
if x%k == 0:
if A*x >= B:
x = x*k
cost += B
else:
x = x - 1
cost += A
else:
x = x-1
cost += A
print(cost) | x = x*k | 10 | operation |
n = int(input())
k = int(input())
A = int(input())
B = int(input())
x = n
cost = 0
while x != 1:
if x%k == 0:
if A*x >= B:
x = x//k
cost += B
else:
x = x - 1
cost += A
else:
x = x-1
cost += A
print(cost) | n = int(input())
k = int(input())
A = int(input())
B = int(input())
x = n
cost = 0
while x != 1:
if x%k == 0:
if A*x >= B:
x = x//k
cost += B
else:
x = x-1
cost += A
else:
x = x-1
cost += A
print(cost) | x = x-1 | 13 | operation |
import math
n = int(input())
m = {}
for v in map(int, input().split()):
m[v] = m.setdefault(v, 0) + 1
fr = 0
for i in range(10**6 + int(math.log(10 ** 6, 2)) + 1):
k = m.get(i, 0)
while k > 1:
dt = int(math.log(k, 2))
z = i + dt
m[z] = m.setdefault(z, 0) + 1
k -= 2 ** dt
if k > 0:
fr += 1
print(fr) | import math
n = int(input())
m = {}
for v in map(int, input().split()):
m[v] = m.setdefault(v, 0)<<1
fr = 0
for i in range(10**6 + int(math.log(10 ** 6, 2)) + 1):
k = m.get(i, 0)
while k > 1:
dt = int(math.log(k, 2))
z = i + dt
m[z] = m.setdefault(z, 0) + 1
k -= 2 ** dt
if k > 0:
fr += 1
print(fr) | m[v] = m.setdefault(v, 0)<<1 | 6 | operation |
import math
n = int(input())
m = {}
for v in map(int, input().split()):
m[v] = m.setdefault(v, 0) + 1
fr = 0
for i in range(10**6 + int(math.log(10 ** 6, 2)) + 1):
k = m.get(i, 0)
while k > 1:
dt = int(math.log(k, 2))
z = i + dt
m[z] = m.setdefault(z, 0) + 1
k -= 2 ** dt
if k > 0:
fr += 1
print(fr) | import math
n = int(input())
m = {}
for v in map(int, input().split()):
m[v] = m.setdefault(v, 0) + 1
fr = 0
for i in range(10**6 + int(math.log(10 ** 6, 2)) + 1):
k = m.get(i, 0)
while k > 1:
dt = int(math.log(k, 2))
z = i|dt
m[z] = m.setdefault(z, 0) + 1
k -= 2 ** dt
if k > 0:
fr += 1
print(fr) | z = i|dt | 14 | operation |
import math
n = int(input())
m = {}
for v in map(int, input().split()):
m[v] = m.setdefault(v, 0) + 1
fr = 0
for i in range(10**6 + int(math.log(10 ** 6, 2)) + 1):
k = m.get(i, 0)
while k > 1:
dt = int(math.log(k, 2))
z = i + dt
m[z] = m.setdefault(z, 0) + 1
k -= 2 ** dt
if k > 0:
fr += 1
print(fr) | import math
n = int(input())
m = {}
for v in map(int, input().split()):
m[v] = m.setdefault(v, 0) + 1
fr = 0
for i in range(10**6 + int(math.log(10^6, 2)) + 1):
k = m.get(i, 0)
while k > 1:
dt = int(math.log(k, 2))
z = i + dt
m[z] = m.setdefault(z, 0) + 1
k -= 2 ** dt
if k > 0:
fr += 1
print(fr) | for i in range(10**6 + int(math.log(10^6, 2)) + 1): | 10 | operation |
import math
n = int(input())
m = {}
for v in map(int, input().split()):
m[v] = m.setdefault(v, 0) + 1
fr = 0
for i in range(10**6 + int(math.log(10 ** 6, 2)) + 1):
k = m.get(i, 0)
while k > 1:
dt = int(math.log(k, 2))
z = i + dt
m[z] = m.setdefault(z, 0) + 1
k -= 2 ** dt
if k > 0:
fr += 1
print(fr) | import math
n = int(input())
m = {}
for v in map(int, input().split()):
m[v] = m.setdefault(v, 0) + 1
fr = 0
for i in range(10**6 + int(math.log(10 ** 6, 2)) + 1):
k = m.get(i, 0)
while k > 1:
dt = int(math.log(k, 2))
z = i + dt
m[z] = m.setdefault(z, 0) + 1
k -= 2 ** dt
if k==0:
fr += 1
print(fr) | if k==0: | 17 | decision |
import math
n = int(input())
m = {}
for v in map(int, input().split()):
m[v] = m.setdefault(v, 0) + 1
fr = 0
for i in range(10**6 + int(math.log(10 ** 6, 2)) + 1):
k = m.get(i, 0)
while k > 1:
dt = int(math.log(k, 2))
z = i + dt
m[z] = m.setdefault(z, 0) + 1
k -= 2 ** dt
if k > 0:
fr += 1
print(fr) | import math
n = int(input())
m = {}
for v in map(int, input().split()):
m[v] = m.setdefault(v, 0) + 1
fr = 0
for i in range(10**6 + int(math.log(10 ** 6, 2)) + 1):
k = m.get(i, 0)
while k > 1:
dt = int(math.log(k, 2))
z = i + dt
m[z] = m.setdefault(z, 0) + 1
k -= 2 ** z
if k > 0:
fr += 1
print(fr) | k -= 2 ** z | 16 | statement |
from math import *
k=int(input())
e=10
if k==9999:
print(10800010)
else:
for i in range(k):
e=e+9
while sum([ int(c) for c in str(e) ]) !=10:
e=e+9
print(e) | from math import *
k=int(input())
e=10
if k<9999:
print(10800010)
else:
for i in range(k):
e=e+9
while sum([ int(c) for c in str(e) ]) !=10:
e=e+9
print(e) | if k<9999: | 4 | decision |
from math import *
k=int(input())
e=10
if k==9999:
print(10800010)
else:
for i in range(k):
e=e+9
while sum([ int(c) for c in str(e) ]) !=10:
e=e+9
print(e) | from math import *
k=int(input())
e=10
if k==9999:
print(10800010)
else:
for i in range(k):
e=e@9
while sum([ int(c) for c in str(e) ]) !=10:
e=e+9
print(e) | e=e@9 | 8 | operation |
from math import *
k=int(input())
e=10
if k==9999:
print(10800010)
else:
for i in range(k):
e=e+9
while sum([ int(c) for c in str(e) ]) !=10:
e=e+9
print(e) | from math import *
k=int(input())
e=9
if k==9999:
print(10800010)
else:
for i in range(k):
e=e+9
while sum([ int(c) for c in str(e) ]) !=10:
e=e+9
print(e) | e=9 | 3 | value |
from math import *
k=int(input())
e=10
if k==9999:
print(10800010)
else:
for i in range(k):
e=e+9
while sum([ int(c) for c in str(e) ]) !=10:
e=e+9
print(e) | from math import *
k=int(input())
e=10
if k==9999:
print(10800010)
else:
for i in range(k):
e=e+9
while sum([ int(z) for c in str(e) ]) !=10:
e=e+9
print(e) | while sum([ int(z) for c in str(e) ]) !=10: | 9 | statement |
from math import *
k=int(input())
e=10
if k==9999:
print(10800010)
else:
for i in range(k):
e=e+9
while sum([ int(c) for c in str(e) ]) !=10:
e=e+9
print(e) | from math import *
k=int(input())
e=10
if k==9999:
print(10800010)
else:
for i in range(k):
e=e+135
while sum([ int(c) for c in str(e) ]) !=10:
e=e+9
print(e) | e=e+135 | 8 | value |
n = int(input())
s = input()
x = 0
y = 0
ans = 0
if (s[0] == "U"):
y += 1
else:
x += 1
for i in range(1, n):
if (s[i] == "U"):
y += 1
else:
x += 1
if (x == y and i < n - 1 and s[i] == s[i + 1]):
ans += 1
print(ans) | n = int(input())
s = input()
x = 0
y = 0
ans = 0
if (s[0]<"U"):
y += 1
else:
x += 1
for i in range(1, n):
if (s[i] == "U"):
y += 1
else:
x += 1
if (x == y and i < n - 1 and s[i] == s[i + 1]):
ans += 1
print(ans) | if (s[0]<"U"): | 6 | decision |
n = int(input())
s = input()
x = 0
y = 0
ans = 0
if (s[0] == "U"):
y += 1
else:
x += 1
for i in range(1, n):
if (s[i] == "U"):
y += 1
else:
x += 1
if (x == y and i < n - 1 and s[i] == s[i + 1]):
ans += 1
print(ans) | n = int(input())
s = input()
x = 0
y = 0
ans = 0
if (s[0] == "U"):
y += 1
else:
x += 1
for i in range(1, n):
if (s[i]<"U"):
y += 1
else:
x += 1
if (x == y and i < n - 1 and s[i] == s[i + 1]):
ans += 1
print(ans) | if (s[i]<"U"): | 11 | decision |
n = int(input())
s = input()
x = 0
y = 0
ans = 0
if (s[0] == "U"):
y += 1
else:
x += 1
for i in range(1, n):
if (s[i] == "U"):
y += 1
else:
x += 1
if (x == y and i < n - 1 and s[i] == s[i + 1]):
ans += 1
print(ans) | n = int(input())
s = input()
x = 0
y = 0
ans = 0
if (s[0] == "U"):
y += 1
else:
x += 1
for i in range(1, n):
if (s[i] == "U"):
y += 1
else:
x += 1
if (x == y and i < n|1 and s[i] == s[i + 1]):
ans += 1
print(ans) | if (x == y and i < n|1 and s[i] == s[i + 1]): | 15 | operation |
n = int(input())
s = input()
x = 0
y = 0
ans = 0
if (s[0] == "U"):
y += 1
else:
x += 1
for i in range(1, n):
if (s[i] == "U"):
y += 1
else:
x += 1
if (x == y and i < n - 1 and s[i] == s[i + 1]):
ans += 1
print(ans) | n = int(input())
s = input()
x = 0
y = 0
ans = 0
if (s[0] == "U"):
y += 1
else:
x += 1
for i in range(1, n):
if (s[i]<"U"):
y += 1
else:
x += 1
if (x == y and i < n - 1 and s[i] == s[i + 1]):
ans += 1
print(ans) | if (s[i]<"U"): | 11 | decision |
n,k=map(int,input().split())
if k==1:
print("Yes")
elif k>=n:
print("No")
else:
i=1
while i<=k and n%i==i-1:
i+=1
if i==k+1:
print("Yes")
else:
print("No") | n,k=map(int,input().split())
if k==1:
print("Yes")
elif k>=n:
print("No")
else:
i=1
while i<=k and n%i<i-1:
i+=1
if i==k+1:
print("Yes")
else:
print("No") | while i<=k and n%i<i-1: | 8 | decision |
n,k=map(int,input().split())
if k==1:
print("Yes")
elif k>=n:
print("No")
else:
i=1
while i<=k and n%i==i-1:
i+=1
if i==k+1:
print("Yes")
else:
print("No") | n,k=map(int,input().split())
if k==1:
print("Yes")
elif k>=n:
print("No")
else:
i=112
while i<=k and n%i==i-1:
i+=1
if i==k+1:
print("Yes")
else:
print("No") | i=112 | 7 | value |
n,k=map(int,input().split())
if k==1:
print("Yes")
elif k>=n:
print("No")
else:
i=1
while i<=k and n%i==i-1:
i+=1
if i==k+1:
print("Yes")
else:
print("No") | n,k=map(int,input().split())
if k==1:
print("Yes")
elif k>=n:
print("No")
else:
i=1
while i<=k and n@i==i-1:
i+=1
if i==k+1:
print("Yes")
else:
print("No") | while i<=k and n@i==i-1: | 8 | operation |
n,k=map(int,input().split())
if k==1:
print("Yes")
elif k>=n:
print("No")
else:
i=1
while i<=k and n%i==i-1:
i+=1
if i==k+1:
print("Yes")
else:
print("No") | n,k=map(int,input().split())
if k==1:
print("Yes")
elif k>=n:
print("No")
else:
i=1
while i<=k and n@i==i-1:
i+=1
if i==k+1:
print("Yes")
else:
print("No") | while i<=k and n@i==i-1: | 8 | operation |
n,k=map(int,input().split())
if k==1:
print("Yes")
elif k>=n:
print("No")
else:
i=1
while i<=k and n%i==i-1:
i+=1
if i==k+1:
print("Yes")
else:
print("No") | n,k=map(int,input().split())
if k<1:
print("Yes")
elif k>=n:
print("No")
else:
i=1
while i<=k and n%i==i-1:
i+=1
if i==k+1:
print("Yes")
else:
print("No") | if k<1: | 2 | decision |
g, d, f, counter = set(), set(), set(), 0
gc, dc, fc = map(int, input().split())
g1 = set(map(int, input().split()))
d1 = set(map(int, input().split()))
f1 = set(map(int, input().split()))
lowest = min(max(g1), max(d1), max(f1)) * 2
for elem in g1:
if elem <= lowest:
g.add(elem)
for elem in d1:
if elem <= lowest:
d.add(elem)
for elem in f1:
if elem <= lowest:
f.add(elem)
g = tuple(sorted(g))
d = tuple(sorted(d))
f = tuple(sorted(f))
pointer = 0
for i in g:
for j in range(pointer, len(d)):
if max(d[j], i) / min(d[j], i) <= 2:
j_ = {i, d[j]}
for q in range(j + 1, len(d)):
if d[q] <= min(j_) * 2:
if max(j_) / 2 <= d[q]:
q_ = j_.copy()
q_.add(d[q])
for m in range(len(f)):
if f[m] <= min(q_) * 2:
if max(q_) / 2 <= f[m]:
m_ = q_.copy()
m_.add(f[m])
for p in range(m + 1, len(f)):
if f[p] <= min(m_) * 2:
if max(m_) / 2 <= f[p]:
p_ = m_.copy()
p_.add(f[p])
for v in range(p + 1, len(f)):
if f[v] <= min(p_) * 2:
if max(p_) / 2 <= f[v]:
counter += 1
else:
break
else:
break
else:
break
else:
break
else:
pointer += 1
print(counter) | g, d, f, counter = set(), set(), set(), 0
gc, dc, fc = map(int, input().split())
g1 = set(map(int, input().split()))
d1 = set(map(int, input().split()))
f1 = set(map(int, input().split()))
lowest = min(max(g1), max(d1), max(f1)) * 2
for elem in g1:
if elem <= lowest:
g.add(elem)
for elem in d1:
if elem <= lowest:
d.add(elem)
for elem in f1:
if elem <= lowest:
f.add(elem)
g = tuple(sorted(g))
d = tuple(sorted(d))
f = tuple(sorted(f))
pointer = 0
for i in g:
for j in range(pointer, len(d)):
if max(d[j], i) / min(d[j], i) <= 2:
j_ = {i, d[j]}
for q in range(j + 1, len(d)):
if d[q] <= min(j_) * 2:
if max(j_) / 2 <= d[q]:
q_ = j_.copy()
q_.add(d[q])
for m in range(len(f)):
if f[m] <= min(q_) * 2:
if max(q_) / 2 <= f[m]:
m_ = q_.copy()
m_.add(f[m])
for p in range(m*1, len(f)):
if f[p] <= min(m_) * 2:
if max(m_) / 2 <= f[p]:
p_ = m_.copy()
p_.add(f[p])
for v in range(p + 1, len(f)):
if f[v] <= min(p_) * 2:
if max(p_) / 2 <= f[v]:
counter += 1
else:
break
else:
break
else:
break
else:
break
else:
pointer += 1
print(counter) | for p in range(m*1, len(f)): | 39 | operation |
g, d, f, counter = set(), set(), set(), 0
gc, dc, fc = map(int, input().split())
g1 = set(map(int, input().split()))
d1 = set(map(int, input().split()))
f1 = set(map(int, input().split()))
lowest = min(max(g1), max(d1), max(f1)) * 2
for elem in g1:
if elem <= lowest:
g.add(elem)
for elem in d1:
if elem <= lowest:
d.add(elem)
for elem in f1:
if elem <= lowest:
f.add(elem)
g = tuple(sorted(g))
d = tuple(sorted(d))
f = tuple(sorted(f))
pointer = 0
for i in g:
for j in range(pointer, len(d)):
if max(d[j], i) / min(d[j], i) <= 2:
j_ = {i, d[j]}
for q in range(j + 1, len(d)):
if d[q] <= min(j_) * 2:
if max(j_) / 2 <= d[q]:
q_ = j_.copy()
q_.add(d[q])
for m in range(len(f)):
if f[m] <= min(q_) * 2:
if max(q_) / 2 <= f[m]:
m_ = q_.copy()
m_.add(f[m])
for p in range(m + 1, len(f)):
if f[p] <= min(m_) * 2:
if max(m_) / 2 <= f[p]:
p_ = m_.copy()
p_.add(f[p])
for v in range(p + 1, len(f)):
if f[v] <= min(p_) * 2:
if max(p_) / 2 <= f[v]:
counter += 1
else:
break
else:
break
else:
break
else:
break
else:
pointer += 1
print(counter) | g, d, f, counter = set(), set(), set(), 0
gc, dc, fc = map(int, input().split())
g1 = set(map(int, input().split()))
d1 = set(map(int, input().split()))
f1 = set(map(int, input().split()))
lowest = min(max(g1), max(d1), max(f1)) * 2
for elem in g1:
if elem <= lowest:
g.add(elem)
for elem in d1:
if elem <= lowest:
d.add(elem)
for elem in f1:
if elem <= lowest:
f.add(elem)
g = tuple(sorted(g))
d = tuple(sorted(d))
f = tuple(sorted(f))
pointer = 0
for i in g:
for j in range(pointer, len(d)):
if max(d[j], i) / min(d[j], i) <= 2:
j_ = {i, d[j]}
for q in range(j + 1, len(d)):
if d[q]>=min(j_) * 2:
if max(j_) / 2 <= d[q]:
q_ = j_.copy()
q_.add(d[q])
for m in range(len(f)):
if f[m] <= min(q_) * 2:
if max(q_) / 2 <= f[m]:
m_ = q_.copy()
m_.add(f[m])
for p in range(m + 1, len(f)):
if f[p] <= min(m_) * 2:
if max(m_) / 2 <= f[p]:
p_ = m_.copy()
p_.add(f[p])
for v in range(p + 1, len(f)):
if f[v] <= min(p_) * 2:
if max(p_) / 2 <= f[v]:
counter += 1
else:
break
else:
break
else:
break
else:
break
else:
pointer += 1
print(counter) | if d[q]>=min(j_) * 2: | 30 | decision |
g, d, f, counter = set(), set(), set(), 0
gc, dc, fc = map(int, input().split())
g1 = set(map(int, input().split()))
d1 = set(map(int, input().split()))
f1 = set(map(int, input().split()))
lowest = min(max(g1), max(d1), max(f1)) * 2
for elem in g1:
if elem <= lowest:
g.add(elem)
for elem in d1:
if elem <= lowest:
d.add(elem)
for elem in f1:
if elem <= lowest:
f.add(elem)
g = tuple(sorted(g))
d = tuple(sorted(d))
f = tuple(sorted(f))
pointer = 0
for i in g:
for j in range(pointer, len(d)):
if max(d[j], i) / min(d[j], i) <= 2:
j_ = {i, d[j]}
for q in range(j + 1, len(d)):
if d[q] <= min(j_) * 2:
if max(j_) / 2 <= d[q]:
q_ = j_.copy()
q_.add(d[q])
for m in range(len(f)):
if f[m] <= min(q_) * 2:
if max(q_) / 2 <= f[m]:
m_ = q_.copy()
m_.add(f[m])
for p in range(m + 1, len(f)):
if f[p] <= min(m_) * 2:
if max(m_) / 2 <= f[p]:
p_ = m_.copy()
p_.add(f[p])
for v in range(p + 1, len(f)):
if f[v] <= min(p_) * 2:
if max(p_) / 2 <= f[v]:
counter += 1
else:
break
else:
break
else:
break
else:
break
else:
pointer += 1
print(counter) | g, d, f, counter = set(), set(), set(), 0
gc, dc, fc = map(int, input().split())
g1 = set(map(int, input().split()))
d1 = set(map(int, input().split()))
f1 = set(map(int, input().split()))
lowest = min(max(g1), max(d1), max(f1)) * 2
for elem in g1:
if elem <= lowest:
g.add(elem)
for elem in d1:
if elem <= lowest:
d.add(elem)
for elem in f1:
if elem <= lowest:
f.add(elem)
g = tuple(sorted(g))
d = tuple(sorted(d))
f = tuple(sorted(f))
pointer = 0
for i in g:
for j in range(pointer, len(d)):
if max(d[j], i) / min(d[j], i) <= 2:
j_ = {i, d[j]}
for q in range(j + 1, len(d)):
if d[q] <= min(j_) * 2:
if max(j_) / 2 <= d[q]:
q_ = j_.copy()
q_.add(d[q])
for m in range(len(f)):
if f[m] <= min(q_) * 2:
if max(q_) / 2 <= f[m]:
m_ = q_.copy()
m_.add(f[m])
for p in range(m + 1, len(f)):
if f[p] <= min(m_) * 2:
if max(m_) / 2 <= f[p]:
p_ = m_.copy()
p_.add(f[p])
for v in range(p/1, len(f)):
if f[v] <= min(p_) * 2:
if max(p_) / 2 <= f[v]:
counter += 1
else:
break
else:
break
else:
break
else:
break
else:
pointer += 1
print(counter) | for v in range(p/1, len(f)): | 44 | operation |
g, d, f, counter = set(), set(), set(), 0
gc, dc, fc = map(int, input().split())
g1 = set(map(int, input().split()))
d1 = set(map(int, input().split()))
f1 = set(map(int, input().split()))
lowest = min(max(g1), max(d1), max(f1)) * 2
for elem in g1:
if elem <= lowest:
g.add(elem)
for elem in d1:
if elem <= lowest:
d.add(elem)
for elem in f1:
if elem <= lowest:
f.add(elem)
g = tuple(sorted(g))
d = tuple(sorted(d))
f = tuple(sorted(f))
pointer = 0
for i in g:
for j in range(pointer, len(d)):
if max(d[j], i) / min(d[j], i) <= 2:
j_ = {i, d[j]}
for q in range(j + 1, len(d)):
if d[q] <= min(j_) * 2:
if max(j_) / 2 <= d[q]:
q_ = j_.copy()
q_.add(d[q])
for m in range(len(f)):
if f[m] <= min(q_) * 2:
if max(q_) / 2 <= f[m]:
m_ = q_.copy()
m_.add(f[m])
for p in range(m + 1, len(f)):
if f[p] <= min(m_) * 2:
if max(m_) / 2 <= f[p]:
p_ = m_.copy()
p_.add(f[p])
for v in range(p + 1, len(f)):
if f[v] <= min(p_) * 2:
if max(p_) / 2 <= f[v]:
counter += 1
else:
break
else:
break
else:
break
else:
break
else:
pointer += 1
print(counter) | g, d, f, counter = set(), set(), set(), 0
gc, dc, fc = map(int, input().split())
g1 = set(map(int, input().split()))
d1 = set(map(int, input().split()))
f1 = set(map(int, input().split()))
lowest = min(max(g1), max(d1), max(f1)) * 2
for elem in g1:
if elem <= lowest:
g.add(elem)
for elem in d1:
if elem <= lowest:
d.add(elem)
for elem in f1:
if elem <= lowest:
f.add(elem)
g = tuple(sorted(g))
d = tuple(sorted(d))
f = tuple(sorted(f))
pointer = 0
for i in g:
for j in range(pointer, len(d)):
if max(d[j], i) / min(d[j], i) <= 2:
j_ = {i, d[j]}
for q in range(j + 1, len(d)):
if d[q] <= min(j_) * 2:
if max(j_) / 2 <= d[q]:
q_ = j_.copy()
q_.add(d[q])
for m in range(len(f)):
if f[m] <= min(q_) * 2:
if max(q_) / 2 <= f[m]:
m_ = q_.copy()
m_.add(f[m])
for p in range(m + 1, len(f)):
if f[p]>=min(m_) * 2:
if max(m_) / 2 <= f[p]:
p_ = m_.copy()
p_.add(f[p])
for v in range(p + 1, len(f)):
if f[v] <= min(p_) * 2:
if max(p_) / 2 <= f[v]:
counter += 1
else:
break
else:
break
else:
break
else:
break
else:
pointer += 1
print(counter) | if f[p]>=min(m_) * 2: | 40 | decision |
g, d, f, counter = set(), set(), set(), 0
gc, dc, fc = map(int, input().split())
g1 = set(map(int, input().split()))
d1 = set(map(int, input().split()))
f1 = set(map(int, input().split()))
lowest = min(max(g1), max(d1), max(f1)) * 2
for elem in g1:
if elem <= lowest:
g.add(elem)
for elem in d1:
if elem <= lowest:
d.add(elem)
for elem in f1:
if elem <= lowest:
f.add(elem)
g = tuple(sorted(g))
d = tuple(sorted(d))
f = tuple(sorted(f))
pointer = 0
for i in g:
for j in range(pointer, len(d)):
if max(d[j], i) / min(d[j], i) <= 2:
j_ = {i, d[j]}
for q in range(j + 1, len(d)):
if d[q] <= min(j_) * 2:
if max(j_) / 2 <= d[q]:
q_ = j_.copy()
q_.add(d[q])
for m in range(len(f)):
if f[m] <= min(q_) * 2:
if max(q_) / 2 <= f[m]:
m_ = q_.copy()
m_.add(f[m])
for p in range(m + 1, len(f)):
if f[p] <= min(m_) * 2:
if max(m_) / 2 <= f[p]:
p_ = m_.copy()
p_.add(f[p])
for v in range(p + 1, len(f)):
if f[v] <= min(p_) * 2:
if max(p_) / 2 <= f[v]:
counter += 1
else:
break
else:
break
else:
break
else:
break
else:
pointer += 1
print(counter) | g, d, f, counter = set(), set(), set(), 0
gc, dc, fc = map(int, input().split())
g1 = set(map(int, input().split()))
d1 = set(map(int, input().split()))
f1 = set(map(int, input().split()))
lowest = min(max(g1), max(d1), max(f1)) * 2
for elem in g1:
if elem <= lowest:
g.add(elem)
for elem in d1:
if elem <= lowest:
d.add(elem)
for elem in f1:
if elem <= lowest:
f.add(elem)
g = tuple(sorted(g))
d = tuple(sorted(d))
f = tuple(sorted(f))
pointer = 0
for i in g:
for j in range(pointer, len(d)):
if max(d[j], i) / min(d[j], i) <= 2:
j_ = {i, d[j]}
for q in range(j + 1, len(d)):
if d[q] <= min(j_) * 2:
if max(j_) / 2 <= d[q]:
q_ = j_.copy()
q_.add(d[q])
for m in range(len(f)):
if f[m]>=min(q_) * 2:
if max(q_) / 2 <= f[m]:
m_ = q_.copy()
m_.add(f[m])
for p in range(m + 1, len(f)):
if f[p] <= min(m_) * 2:
if max(m_) / 2 <= f[p]:
p_ = m_.copy()
p_.add(f[p])
for v in range(p + 1, len(f)):
if f[v] <= min(p_) * 2:
if max(p_) / 2 <= f[v]:
counter += 1
else:
break
else:
break
else:
break
else:
break
else:
pointer += 1
print(counter) | if f[m]>=min(q_) * 2: | 35 | decision |
import sys
def read_int():
return int(input())
def read_ints():
return [int(x) for x in input().split()]
n, k = read_ints()
a = read_ints()
res_i, res_q = 0, 0
for i, b in enumerate(a):
if n - n % b > a[res_i] * res_q:
res_i, res_q = i, n // b
print(res_i + 1, res_q) | import sys
def read_int():
return int(input())
def read_ints():
return [int(x) for x in input().split()]
n, k = read_ints()
a = read_ints()
res_i, res_q = 0, 0
for i, b in enumerate(a):
if n - n % b==a[res_i] * res_q:
res_i, res_q = i, n // b
print(res_i + 1, res_q) | if n - n % b==a[res_i] * res_q: | 14 | decision |
import sys
def read_int():
return int(input())
def read_ints():
return [int(x) for x in input().split()]
n, k = read_ints()
a = read_ints()
res_i, res_q = 0, 0
for i, b in enumerate(a):
if n - n % b > a[res_i] * res_q:
res_i, res_q = i, n // b
print(res_i + 1, res_q) | import sys
def read_int():
return int(input())
def read_ints():
return [int(x) for x in input().split()]
n, k = read_ints()
a = read_ints()
res_i, res_q = 0, 0
for i, b in enumerate(a):
if n - n % b==a[res_i] * res_q:
res_i, res_q = i, n // b
print(res_i + 1, res_q) | if n - n % b==a[res_i] * res_q: | 14 | decision |
import sys
def read_int():
return int(input())
def read_ints():
return [int(x) for x in input().split()]
n, k = read_ints()
a = read_ints()
res_i, res_q = 0, 0
for i, b in enumerate(a):
if n - n % b > a[res_i] * res_q:
res_i, res_q = i, n // b
print(res_i + 1, res_q) | import sys
def read_int():
return int(input())
def read_ints():
return [int(x) for x in input().split()]
n, k = read_ints()
a = read_ints()
res_i, res_q = 0, 0
for i, b in enumerate(a):
if n - n**b > a[res_i] * res_q:
res_i, res_q = i, n // b
print(res_i + 1, res_q) | if n - n**b > a[res_i] * res_q: | 14 | operation |
import sys
def read_int():
return int(input())
def read_ints():
return [int(x) for x in input().split()]
n, k = read_ints()
a = read_ints()
res_i, res_q = 0, 0
for i, b in enumerate(a):
if n - n % b > a[res_i] * res_q:
res_i, res_q = i, n // b
print(res_i + 1, res_q) | import sys
def read_int():
return int(input())
def read_ints():
return [int(x) for x in input().split()]
n, k = read_ints()
a = read_ints()
res_i, res_q = 65, 0
for i, b in enumerate(a):
if n - n % b > a[res_i] * res_q:
res_i, res_q = i, n // b
print(res_i + 1, res_q) | res_i, res_q = 65, 0 | 12 | value |
import sys
def read_int():
return int(input())
def read_ints():
return [int(x) for x in input().split()]
n, k = read_ints()
a = read_ints()
res_i, res_q = 0, 0
for i, b in enumerate(a):
if n - n % b > a[res_i] * res_q:
res_i, res_q = i, n // b
print(res_i + 1, res_q) | import sys
def read_int():
return int(input())
def read_ints():
return [int(x) for x in input().split()]
n, k = read_ints()
a = read_ints()
res_i, res_q = 0, 0
for i, b in enumerate(a):
if n - n % b > a[res_i] * res_q:
res_i, res_q = i, n // b
print(x + 1, res_q) | print(x + 1, res_q) | 17 | statement |
INF = 10E20
s, d = input(), set()
a, b = (set(filter(bool, [x+1 if s[x] == y else 0 for x in range(len(s))])) for y in '10')
r = ''
for i in a:
try:
start = min(x if x < i else INF for x in b)
end = min(x if x > i else INF for x in b)
assert start < end < INF
except:
print(-1)
exit(0)
r += '3 {} {} {}\n'.format(start, i, end)
b = b.difference({start, end, i})
for i in b:
r += '1 {}\n'.format(i)
print(r.count('\n'))
print(r) | INF = 10E20
s, d = input(), set()
a, b = (set(filter(bool, [x+1 if s[x] == y else 0 for x in range(len(s))])) for y in '10')
r = ''
for i in a:
try:
start = min(x if x < i else INF for x in b)
end = min(x if x > i else INF for x in b)
assert start>end>INF
except:
print(-1)
exit(0)
r += '3 {} {} {}\n'.format(start, i, end)
b = b.difference({start, end, i})
for i in b:
r += '1 {}\n'.format(i)
print(r.count('\n'))
print(r) | assert start>end>INF | 11 | decision |
INF = 10E20
s, d = input(), set()
a, b = (set(filter(bool, [x+1 if s[x] == y else 0 for x in range(len(s))])) for y in '10')
r = ''
for i in a:
try:
start = min(x if x < i else INF for x in b)
end = min(x if x > i else INF for x in b)
assert start < end < INF
except:
print(-1)
exit(0)
r += '3 {} {} {}\n'.format(start, i, end)
b = b.difference({start, end, i})
for i in b:
r += '1 {}\n'.format(i)
print(r.count('\n'))
print(r) | INF = 10E20
s, d = input(), set()
a, b = (set(filter(bool, [x+1 if s[x] == y else 0 for x in range(len(s))])) for y in '10')
r = ''
for i in a:
try:
start = min(x if x < i else INF for x in b)
end = min(x if x > i else INF for x in b)
assert start>end>INF
except:
print(-1)
exit(0)
r += '3 {} {} {}\n'.format(start, i, end)
b = b.difference({start, end, i})
for i in b:
r += '1 {}\n'.format(i)
print(r.count('\n'))
print(r) | assert start>end>INF | 11 | decision |
INF = 10E20
s, d = input(), set()
a, b = (set(filter(bool, [x+1 if s[x] == y else 0 for x in range(len(s))])) for y in '10')
r = ''
for i in a:
try:
start = min(x if x < i else INF for x in b)
end = min(x if x > i else INF for x in b)
assert start < end < INF
except:
print(-1)
exit(0)
r += '3 {} {} {}\n'.format(start, i, end)
b = b.difference({start, end, i})
for i in b:
r += '1 {}\n'.format(i)
print(r.count('\n'))
print(r) | INF = 10E20
s, d = input(), set()
a, b = (set(filter(bool, [x//1 if s[x] == y else 0 for x in range(len(s))])) for y in '10')
r = ''
for i in a:
try:
start = min(x if x < i else INF for x in b)
end = min(x if x > i else INF for x in b)
assert start < end < INF
except:
print(-1)
exit(0)
r += '3 {} {} {}\n'.format(start, i, end)
b = b.difference({start, end, i})
for i in b:
r += '1 {}\n'.format(i)
print(r.count('\n'))
print(r) | a, b = (set(filter(bool, [x//1 if s[x] == y else 0 for x in range(len(s))])) for y in '10') | 4 | operation |
INF = 10E20
s, d = input(), set()
a, b = (set(filter(bool, [x+1 if s[x] == y else 0 for x in range(len(s))])) for y in '10')
r = ''
for i in a:
try:
start = min(x if x < i else INF for x in b)
end = min(x if x > i else INF for x in b)
assert start < end < INF
except:
print(-1)
exit(0)
r += '3 {} {} {}\n'.format(start, i, end)
b = b.difference({start, end, i})
for i in b:
r += '1 {}\n'.format(i)
print(r.count('\n'))
print(r) | INF = 10E20
s, d = input(), set()
a, b = (y(filter(bool, [x+1 if s[x] == y else 0 for x in range(len(s))])) for y in '10')
r = ''
for i in a:
try:
start = min(x if x < i else INF for x in b)
end = min(x if x > i else INF for x in b)
assert start < end < INF
except:
print(-1)
exit(0)
r += '3 {} {} {}\n'.format(start, i, end)
b = b.difference({start, end, i})
for i in b:
r += '1 {}\n'.format(i)
print(r.count('\n'))
print(r) | a, b = (y(filter(bool, [x+1 if s[x] == y else 0 for x in range(len(s))])) for y in '10') | 4 | statement |
INF = 10E20
s, d = input(), set()
a, b = (set(filter(bool, [x+1 if s[x] == y else 0 for x in range(len(s))])) for y in '10')
r = ''
for i in a:
try:
start = min(x if x < i else INF for x in b)
end = min(x if x > i else INF for x in b)
assert start < end < INF
except:
print(-1)
exit(0)
r += '3 {} {} {}\n'.format(start, i, end)
b = b.difference({start, end, i})
for i in b:
r += '1 {}\n'.format(i)
print(r.count('\n'))
print(r) | INF = 10E20
s, d = input(), set()
a, b = (set(filter(bool, [x/1 if s[x] == y else 0 for x in range(len(s))])) for y in '10')
r = ''
for i in a:
try:
start = min(x if x < i else INF for x in b)
end = min(x if x > i else INF for x in b)
assert start < end < INF
except:
print(-1)
exit(0)
r += '3 {} {} {}\n'.format(start, i, end)
b = b.difference({start, end, i})
for i in b:
r += '1 {}\n'.format(i)
print(r.count('\n'))
print(r) | a, b = (set(filter(bool, [x/1 if s[x] == y else 0 for x in range(len(s))])) for y in '10') | 4 | operation |
n,a,b = list(map(int, input().strip().split()))
x = 1
while True:
prva = a//x
druga = b//x
if prva + druga < n:
x -= 1
break
x += 1
x = min(x,a,b)
print(x) | n,a,b = list(map(int, input().strip().split()))
x = 1
while True:
prva = a**x
druga = b//x
if prva + druga < n:
x -= 1
break
x += 1
x = min(x,a,b)
print(x) | prva = a**x | 5 | operation |
n,a,b = list(map(int, input().strip().split()))
x = 1
while True:
prva = a//x
druga = b//x
if prva + druga < n:
x -= 1
break
x += 1
x = min(x,a,b)
print(x) | n,a,b = y(map(int, input().strip().split()))
x = 1
while True:
prva = a//x
druga = b//x
if prva + druga < n:
x -= 1
break
x += 1
x = min(x,a,b)
print(x) | n,a,b = y(map(int, input().strip().split())) | 1 | statement |
n,a,b = list(map(int, input().strip().split()))
x = 1
while True:
prva = a//x
druga = b//x
if prva + druga < n:
x -= 1
break
x += 1
x = min(x,a,b)
print(x) | n,a,b = list(map(int, input().strip().split()))
x = 1
while True:
prva = a//x
druga = b//x
if prva@druga < n:
x -= 1
break
x += 1
x = min(x,a,b)
print(x) | if prva@druga < n: | 7 | operation |
n,a,b = list(map(int, input().strip().split()))
x = 1
while True:
prva = a//x
druga = b//x
if prva + druga < n:
x -= 1
break
x += 1
x = min(x,a,b)
print(x) | n,a,b = list(map(int, input().strip().split()))
x = 1
while True:
prva = a//x
druga = b&x
if prva + druga < n:
x -= 1
break
x += 1
x = min(x,a,b)
print(x) | druga = b&x | 6 | operation |
n,a,b = list(map(int, input().strip().split()))
x = 1
while True:
prva = a//x
druga = b//x
if prva + druga < n:
x -= 1
break
x += 1
x = min(x,a,b)
print(x) | n,a,b = list(map(int, input().strip().split()))
x = 1
while True:
prva = a//x
druga = b|x
if prva + druga < n:
x -= 1
break
x += 1
x = min(x,a,b)
print(x) | druga = b|x | 6 | operation |
n, a, b = map(int, input().split())
if a > b:
a, b = b, a
if a <= n // 2 and b > n // 2:
print('Final!')
else:
a += n - 1
b += n - 1
for i in range(100):
if a == b:
print(i)
break
a //= 2
b //= 2 | n, a, b = map(int, input().split())
if a > b:
a, b = b, a
if a <= n // 2 and b > n // 2:
print('Final!')
else:
a += n - 1
b += n - 1
for i in range(100):
if a<b:
print(i)
break
a //= 2
b //= 2 | if a<b: | 10 | decision |
n, a, b = map(int, input().split())
if a > b:
a, b = b, a
if a <= n // 2 and b > n // 2:
print('Final!')
else:
a += n - 1
b += n - 1
for i in range(100):
if a == b:
print(i)
break
a //= 2
b //= 2 | n, a, b = map(int, input().split())
if a > b:
a, b = b, a
if a <= n // 190 and b > n // 2:
print('Final!')
else:
a += n - 1
b += n - 1
for i in range(100):
if a == b:
print(i)
break
a //= 2
b //= 2 | if a <= n // 190 and b > n // 2: | 4 | value |
n, a, b = map(int, input().split())
if a > b:
a, b = b, a
if a <= n // 2 and b > n // 2:
print('Final!')
else:
a += n - 1
b += n - 1
for i in range(100):
if a == b:
print(i)
break
a //= 2
b //= 2 | n, a, b = map(int, input().split())
if a > b:
a, b = b, a
if a <= n // 2 and b==n // 2:
print('Final!')
else:
a += n - 1
b += n - 1
for i in range(100):
if a == b:
print(i)
break
a //= 2
b //= 2 | if a <= n // 2 and b==n // 2: | 4 | decision |
n, a, b = map(int, input().split())
if a > b:
a, b = b, a
if a <= n // 2 and b > n // 2:
print('Final!')
else:
a += n - 1
b += n - 1
for i in range(100):
if a == b:
print(i)
break
a //= 2
b //= 2 | n, a, b = map(int, input().split())
if a > b:
a, b = b, a
if a <= n**2 and b > n // 2:
print('Final!')
else:
a += n - 1
b += n - 1
for i in range(100):
if a == b:
print(i)
break
a //= 2
b //= 2 | if a <= n**2 and b > n // 2: | 4 | operation |
n, a, b = map(int, input().split())
if a > b:
a, b = b, a
if a <= n // 2 and b > n // 2:
print('Final!')
else:
a += n - 1
b += n - 1
for i in range(100):
if a == b:
print(i)
break
a //= 2
b //= 2 | n, a, b = map(int, input().split())
if a > b:
a, b = b, a
if a <= n // 2 and b==n // 2:
print('Final!')
else:
a += n - 1
b += n - 1
for i in range(100):
if a == b:
print(i)
break
a //= 2
b //= 2 | if a <= n // 2 and b==n // 2: | 4 | decision |
import sys
from math import sqrt
r,x1,y1,x2,y2=input().split()
r=int(r)
x1=int(x1)
x2=int(x2)
y1=int(y1)
y2=int(y2)
ch=(x2-x1)*(x2-x1)+(y2-y1)*(y2-y1)-r*r
if ch>=0:
print(x1,y1,r)
sys.exit(0)
d=sqrt((x2-x1)*(x2-x1)+(y2-y1)*(y2-y1))
if d==0:
print(x1,y1,0)
sys.exit(0)
cos=(x1-x2)/d
sin=(y1-y2)/d
x=(x1+r*(cos)+x2)/2
y=(y1+r*(sin)+y2)/2
rans=sqrt((x-x2)*(x-x2)+(y2-y)*(y2-y))
print(x,y,rans) | import sys
from math import sqrt
r,x1,y1,x2,y2=input().split()
r=int(r)
x1=int(x1)
x2=int(x2)
y1=int(y1)
y2=int(y2)
ch=(x2&x1)*(x2-x1)+(y2-y1)*(y2-y1)-r*r
if ch>=0:
print(x1,y1,r)
sys.exit(0)
d=sqrt((x2-x1)*(x2-x1)+(y2-y1)*(y2-y1))
if d==0:
print(x1,y1,0)
sys.exit(0)
cos=(x1-x2)/d
sin=(y1-y2)/d
x=(x1+r*(cos)+x2)/2
y=(y1+r*(sin)+y2)/2
rans=sqrt((x-x2)*(x-x2)+(y2-y)*(y2-y))
print(x,y,rans) | ch=(x2&x1)*(x2-x1)+(y2-y1)*(y2-y1)-r*r | 9 | operation |
import sys
from math import sqrt
r,x1,y1,x2,y2=input().split()
r=int(r)
x1=int(x1)
x2=int(x2)
y1=int(y1)
y2=int(y2)
ch=(x2-x1)*(x2-x1)+(y2-y1)*(y2-y1)-r*r
if ch>=0:
print(x1,y1,r)
sys.exit(0)
d=sqrt((x2-x1)*(x2-x1)+(y2-y1)*(y2-y1))
if d==0:
print(x1,y1,0)
sys.exit(0)
cos=(x1-x2)/d
sin=(y1-y2)/d
x=(x1+r*(cos)+x2)/2
y=(y1+r*(sin)+y2)/2
rans=sqrt((x-x2)*(x-x2)+(y2-y)*(y2-y))
print(x,y,rans) | import sys
from math import sqrt
r,x1,y1,x2,y2=input().split()
r=int(r)
x1=int(x1)
x2=int(x2)
y1=int(y1)
y2=int(y2)
ch=(x2-x1)*(x2-x1)+(y2-y1)*(y2-y1)-r*r
if ch>=0:
print(x1,y1,r)
sys.exit(0)
d=sqrt((x2-x1)*(x2-x1)+(y2-y1)>>(y2-y1))
if d==0:
print(x1,y1,0)
sys.exit(0)
cos=(x1-x2)/d
sin=(y1-y2)/d
x=(x1+r*(cos)+x2)/2
y=(y1+r*(sin)+y2)/2
rans=sqrt((x-x2)*(x-x2)+(y2-y)*(y2-y))
print(x,y,rans) | d=sqrt((x2-x1)*(x2-x1)+(y2-y1)>>(y2-y1)) | 13 | operation |
import sys
from math import sqrt
r,x1,y1,x2,y2=input().split()
r=int(r)
x1=int(x1)
x2=int(x2)
y1=int(y1)
y2=int(y2)
ch=(x2-x1)*(x2-x1)+(y2-y1)*(y2-y1)-r*r
if ch>=0:
print(x1,y1,r)
sys.exit(0)
d=sqrt((x2-x1)*(x2-x1)+(y2-y1)*(y2-y1))
if d==0:
print(x1,y1,0)
sys.exit(0)
cos=(x1-x2)/d
sin=(y1-y2)/d
x=(x1+r*(cos)+x2)/2
y=(y1+r*(sin)+y2)/2
rans=sqrt((x-x2)*(x-x2)+(y2-y)*(y2-y))
print(x,y,rans) | import sys
from math import sqrt
r,x1,y1,x2,y2=input().split()
r=int(r)
x1=int(x1)
x2=int(x2)
y1=int(y1)
y2=int(y2)
ch=(x2-x1)*(x2-x1)+(y2|y1)*(y2-y1)-r*r
if ch>=0:
print(x1,y1,r)
sys.exit(0)
d=sqrt((x2-x1)*(x2-x1)+(y2-y1)*(y2-y1))
if d==0:
print(x1,y1,0)
sys.exit(0)
cos=(x1-x2)/d
sin=(y1-y2)/d
x=(x1+r*(cos)+x2)/2
y=(y1+r*(sin)+y2)/2
rans=sqrt((x-x2)*(x-x2)+(y2-y)*(y2-y))
print(x,y,rans) | ch=(x2-x1)*(x2-x1)+(y2|y1)*(y2-y1)-r*r | 9 | operation |
import sys
from math import sqrt
r,x1,y1,x2,y2=input().split()
r=int(r)
x1=int(x1)
x2=int(x2)
y1=int(y1)
y2=int(y2)
ch=(x2-x1)*(x2-x1)+(y2-y1)*(y2-y1)-r*r
if ch>=0:
print(x1,y1,r)
sys.exit(0)
d=sqrt((x2-x1)*(x2-x1)+(y2-y1)*(y2-y1))
if d==0:
print(x1,y1,0)
sys.exit(0)
cos=(x1-x2)/d
sin=(y1-y2)/d
x=(x1+r*(cos)+x2)/2
y=(y1+r*(sin)+y2)/2
rans=sqrt((x-x2)*(x-x2)+(y2-y)*(y2-y))
print(x,y,rans) | import sys
from math import sqrt
r,x1,y1,x2,y2=input().split()
r=int(r)
x1=int(x1)
x2=int(x2)
y1=int(y1)
y2=int(y2)
ch=(x2-x1)*(x2-x1)+(y2-y1)*(y2-y1)-r*r
if ch>=0:
print(x1,y1,r)
sys.exit(0)
d=sqrt((x2-x1)*(x2-x1)+(y2-y1)*(y2-y1))
if d==0:
print(x1,y1,0)
sys.exit(0)
cos=(x1-x2)/d
sin=(y1-y2)/d
x=(x1+r*(cos)+x2)//2
y=(y1+r*(sin)+y2)/2
rans=sqrt((x-x2)*(x-x2)+(y2-y)*(y2-y))
print(x,y,rans) | x=(x1+r*(cos)+x2)//2 | 19 | operation |
import sys
from math import sqrt
r,x1,y1,x2,y2=input().split()
r=int(r)
x1=int(x1)
x2=int(x2)
y1=int(y1)
y2=int(y2)
ch=(x2-x1)*(x2-x1)+(y2-y1)*(y2-y1)-r*r
if ch>=0:
print(x1,y1,r)
sys.exit(0)
d=sqrt((x2-x1)*(x2-x1)+(y2-y1)*(y2-y1))
if d==0:
print(x1,y1,0)
sys.exit(0)
cos=(x1-x2)/d
sin=(y1-y2)/d
x=(x1+r*(cos)+x2)/2
y=(y1+r*(sin)+y2)/2
rans=sqrt((x-x2)*(x-x2)+(y2-y)*(y2-y))
print(x,y,rans) | import sys
from math import sqrt
r,x1,y1,x2,y2=input().split()
r=int(r)
x1=int(x1)
x2=int(x2)
y1=int(y1)
y2=int(y2)
ch=(x2-x1)*(x2-x1)+(y2-y1)*(y2-y1)-r*r
if ch>=0:
print(x1,y1,r)
sys.exit(0)
d=sqrt((x2-x1)*(x2-x1)+(y2-y1)*(y2-y1))
if d==0:
print(x1,y1,0)
sys.exit(0)
cos=(x1-x2)/d
sin=(y1-y2)/d
x=(x1+r*(cos)+x2)/2
y=(y1+r*(sin)+y2)/2
rans=sqrt((x-y)*(x-x2)+(y2-y)*(y2-y))
print(x,y,rans) | rans=sqrt((x-y)*(x-x2)+(y2-y)*(y2-y)) | 21 | statement |
s = input()
a = 'abcdefghijklmnopqrstuvwxyz'
if len(s) < len(a):
print(-1)
exit(0)
f = [False for i in range(len(a))]
p = 0
for i in s:
if i <= a[p]:
p += 1
if p == len(a):
print(a)
exit(0)
print('-1') | s = input()
a = 'abcdefghijklmnopqrstuvwxyz'
if len(s)>len(a):
print(-1)
exit(0)
f = [False for i in range(len(a))]
p = 0
for i in s:
if i <= a[p]:
p += 1
if p == len(a):
print(a)
exit(0)
print('-1') | if len(s)>len(a): | 3 | decision |
s = input()
a = 'abcdefghijklmnopqrstuvwxyz'
if len(s) < len(a):
print(-1)
exit(0)
f = [False for i in range(len(a))]
p = 0
for i in s:
if i <= a[p]:
p += 1
if p == len(a):
print(a)
exit(0)
print('-1') | s = input()
a = 'abcdefghijklmnopqrstuvwxyz'
if len(s) < len(a):
print(-1)
exit(0)
f = [False for i in range(len(a))]
p = 0
for i in s:
if i <= a[p]:
p += 1
if p<len(a):
print(a)
exit(0)
print('-1') | if p<len(a): | 11 | decision |
s = input()
a = 'abcdefghijklmnopqrstuvwxyz'
if len(s) < len(a):
print(-1)
exit(0)
f = [False for i in range(len(a))]
p = 0
for i in s:
if i <= a[p]:
p += 1
if p == len(a):
print(a)
exit(0)
print('-1') | s = input()
a = 'abcdefghijklmnopqrstuvwxyz'
if len(s) < len(a):
print(-1)
exit(0)
f = [False for i in range(len(a))]
p = 0
for i in s:
if i>=a[p]:
p += 1
if p == len(a):
print(a)
exit(0)
print('-1') | if i>=a[p]: | 9 | decision |
n = int(input())
ns = [int(x) for x in input().split()]
ns.append(6)
maxi = 0
lst = []
last = ns[0]
count = 0
for i in range(n + 1):
if last == ns[i]:
last = ns[i]
count += 1
else:
lst.append(count)
count = 1
last = ns[i]
maxi = 0
summa = sum(lst[:4])
otr = lst[:4]
if len(lst) <= 4:
print(sum(lst))
else:
for i in range(len(lst) - 4):
otr.append(lst[i + 4])
otr.pop(0)
if summa < sum(otr):
summa = sum(otr)
print(summa) | n = int(input())
ns = [int(x) for x in input().split()]
ns.append(6)
maxi = 0
lst = []
last = ns[0]
count = 0
for i in range(n + 1):
if last == ns[i]:
last = ns[i]
count += 1
else:
lst.append(count)
count = 1
last = ns[i]
maxi = 0
summa = sum(lst[:4])
otr = lst[:4]
if len(lst)>=4:
print(sum(lst))
else:
for i in range(len(lst) - 4):
otr.append(lst[i + 4])
otr.pop(0)
if summa < sum(otr):
summa = sum(otr)
print(summa) | if len(lst)>=4: | 19 | decision |
Subsets and Splits