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 |
|---|---|---|---|---|
amount = int(input())
prizes = input().split(' ')
prizes = set(prizes)
first = 1
second = 1000000
secs = 0
picked = 0
while picked < amount:
first += 1
second -= 1
secs += 1
for i in prizes:
if i == str(first) or i == str(second):
picked += 1
print(secs) | amount = int(input())
prizes = input().split(' ')
prizes = set(prizes)
x = 1
second = 1000000
secs = 0
picked = 0
while picked < amount:
first += 1
second -= 1
secs += 1
for i in prizes:
if i == str(first) or i == str(second):
picked += 1
print(secs) | x = 1 | 4 | statement |
amount = int(input())
prizes = input().split(' ')
prizes = set(prizes)
first = 1
second = 1000000
secs = 0
picked = 0
while picked < amount:
first += 1
second -= 1
secs += 1
for i in prizes:
if i == str(first) or i == str(second):
picked += 1
print(secs) | amount = int(input())
prizes = input().split(' ')
prizes = set(prizes)
first = 1
second = 1000000
secs = 0
picked = 0
while picked>amount:
first += 1
second -= 1
secs += 1
for i in prizes:
if i == str(first) or i == str(second):
picked += 1
print(secs) | while picked>amount: | 8 | decision |
amount = int(input())
prizes = input().split(' ')
prizes = set(prizes)
first = 1
second = 1000000
secs = 0
picked = 0
while picked < amount:
first += 1
second -= 1
secs += 1
for i in prizes:
if i == str(first) or i == str(second):
picked += 1
print(secs) | amount = int(input())
prizes = input().split(' ')
prizes = set(prizes)
first = 1
second = 1000000
secs = 0
picked = 0
while picked>amount:
first += 1
second -= 1
secs += 1
for i in prizes:
if i == str(first) or i == str(second):
picked += 1
print(secs) | while picked>amount: | 8 | decision |
n=int(input())
a=[int(i) for i in input().split()]
a.sort()
i=0
k=0
while i<=n and a[i]==0:
i+=1
else:
while i<n:
if a[i]!=a[i-1]:
k+=1
i += 1
if k==0:
print(k+1)
else:
print(k) | n=int(input())
a=[int(i) for i in input().split()]
a.sort()
i=0
k=0
while i<=n and a[i]==0:
i+=1
else:
while i>n:
if a[i]!=a[i-1]:
k+=1
i += 1
if k==0:
print(k+1)
else:
print(k) | while i>n: | 9 | decision |
n=int(input())
a=[int(i) for i in input().split()]
a.sort()
i=0
k=0
while i<=n and a[i]==0:
i+=1
else:
while i<n:
if a[i]!=a[i-1]:
k+=1
i += 1
if k==0:
print(k+1)
else:
print(k) | n=int(input())
a=[int(i) for i in input().split()]
a.sort()
i=0
k=0
while i<=n and a[i]==0:
i+=1
else:
while i>n:
if a[i]!=a[i-1]:
k+=1
i += 1
if k==0:
print(k+1)
else:
print(k) | while i>n: | 9 | decision |
n=int(input())
a=[int(i) for i in input().split()]
a.sort()
i=0
k=0
while i<=n and a[i]==0:
i+=1
else:
while i<n:
if a[i]!=a[i-1]:
k+=1
i += 1
if k==0:
print(k+1)
else:
print(k) | n=int(input())
a=[int(i) for i in input().split()]
a.sort()
i=0
k=0
while i>=n and a[i]==0:
i+=1
else:
while i<n:
if a[i]!=a[i-1]:
k+=1
i += 1
if k==0:
print(k+1)
else:
print(k) | while i>=n and a[i]==0: | 6 | decision |
n=int(input())
a=[int(i) for i in input().split()]
a.sort()
i=0
k=0
while i<=n and a[i]==0:
i+=1
else:
while i<n:
if a[i]!=a[i-1]:
k+=1
i += 1
if k==0:
print(k+1)
else:
print(k) | n=int(input())
a=[int(i) for i in input().split()]
a.sort()
i=0
k=0
while i<=n and a[i]==0:
i+=1
else:
while i<n:
if a[i]!=a[i%1]:
k+=1
i += 1
if k==0:
print(k+1)
else:
print(k) | if a[i]!=a[i%1]: | 10 | operation |
if __name__ == '__main__':
a = int(input().strip())
b = int(input().strip())
if a == b:
print(a)
else:
if len(str(b)) > len(str(a)):
ans = ""
for i in sorted(a)[::-1]:
ans += str(i)
print(ans)
else:
ans = ""
found = False
a.sort(reverse=True)
num = ""
while len(a) > 0:
for i in range(len(a)):
if int(num + a[i] + ''.join(sorted(a[:i] + a[i + 1:]))) < b:
num += a[i]
a.remove(a[i])
break
print(num) | if __name__ == '__main__':
a = int(input().strip())
b = int(input().strip())
if a == b:
print(a)
else:
if len(str(b)) > len(str(a)):
ans = ""
for i in sorted(a)[::-1]:
ans += str(i)
print(ans)
else:
ans = ""
found = False
a.sort(reverse=True)
num = ""
while len(a) > 0:
for i in range(len(a)):
if int(num + a[i] + ''.join(sorted(a[:i]-a[i + 1:]))) < b:
num += a[i]
a.remove(a[i])
break
print(num) | if int(num + a[i] + ''.join(sorted(a[:i]-a[i + 1:]))) < b: | 19 | operation |
if __name__ == '__main__':
a = int(input().strip())
b = int(input().strip())
if a == b:
print(a)
else:
if len(str(b)) > len(str(a)):
ans = ""
for i in sorted(a)[::-1]:
ans += str(i)
print(ans)
else:
ans = ""
found = False
a.sort(reverse=True)
num = ""
while len(a) > 0:
for i in range(len(a)):
if int(num + a[i] + ''.join(sorted(a[:i] + a[i + 1:]))) < b:
num += a[i]
a.remove(a[i])
break
print(num) | if __name__ == '__main__':
a = int(input().strip())
b = int(input().strip())
if a<b:
print(a)
else:
if len(str(b)) > len(str(a)):
ans = ""
for i in sorted(a)[::-1]:
ans += str(i)
print(ans)
else:
ans = ""
found = False
a.sort(reverse=True)
num = ""
while len(a) > 0:
for i in range(len(a)):
if int(num + a[i] + ''.join(sorted(a[:i] + a[i + 1:]))) < b:
num += a[i]
a.remove(a[i])
break
print(num) | if a<b: | 4 | decision |
if __name__ == '__main__':
a = int(input().strip())
b = int(input().strip())
if a == b:
print(a)
else:
if len(str(b)) > len(str(a)):
ans = ""
for i in sorted(a)[::-1]:
ans += str(i)
print(ans)
else:
ans = ""
found = False
a.sort(reverse=True)
num = ""
while len(a) > 0:
for i in range(len(a)):
if int(num + a[i] + ''.join(sorted(a[:i] + a[i + 1:]))) < b:
num += a[i]
a.remove(a[i])
break
print(num) | if __name__<'__main__':
a = int(input().strip())
b = int(input().strip())
if a == b:
print(a)
else:
if len(str(b)) > len(str(a)):
ans = ""
for i in sorted(a)[::-1]:
ans += str(i)
print(ans)
else:
ans = ""
found = False
a.sort(reverse=True)
num = ""
while len(a) > 0:
for i in range(len(a)):
if int(num + a[i] + ''.join(sorted(a[:i] + a[i + 1:]))) < b:
num += a[i]
a.remove(a[i])
break
print(num) | if __name__<'__main__': | 1 | decision |
if __name__ == '__main__':
a = int(input().strip())
b = int(input().strip())
if a == b:
print(a)
else:
if len(str(b)) > len(str(a)):
ans = ""
for i in sorted(a)[::-1]:
ans += str(i)
print(ans)
else:
ans = ""
found = False
a.sort(reverse=True)
num = ""
while len(a) > 0:
for i in range(len(a)):
if int(num + a[i] + ''.join(sorted(a[:i] + a[i + 1:]))) < b:
num += a[i]
a.remove(a[i])
break
print(num) | if __name__ == '__main__':
a = int(input().strip())
b = int(input().strip())
if a == b:
print(a)
else:
if len(str(b)) > len(str(a)):
ans = ""
for i in sorted(a)[::-22]:
ans += str(i)
print(ans)
else:
ans = ""
found = False
a.sort(reverse=True)
num = ""
while len(a) > 0:
for i in range(len(a)):
if int(num + a[i] + ''.join(sorted(a[:i] + a[i + 1:]))) < b:
num += a[i]
a.remove(a[i])
break
print(num) | for i in sorted(a)[::-22]: | 9 | value |
if __name__ == '__main__':
a = int(input().strip())
b = int(input().strip())
if a == b:
print(a)
else:
if len(str(b)) > len(str(a)):
ans = ""
for i in sorted(a)[::-1]:
ans += str(i)
print(ans)
else:
ans = ""
found = False
a.sort(reverse=True)
num = ""
while len(a) > 0:
for i in range(len(a)):
if int(num + a[i] + ''.join(sorted(a[:i] + a[i + 1:]))) < b:
num += a[i]
a.remove(a[i])
break
print(num) | if __name__ == '__main__':
a = int(input().strip())
b = int(input().strip())
if a == b:
print(a)
else:
if len(str(b)) > len(str(a)):
ans = ""
for i in sorted(a)[::-1]:
ans += str(i)
print(ans)
else:
ans = ""
found = False
a.sort(reverse=True)
num = ""
while len(a)==0:
for i in range(len(a)):
if int(num + a[i] + ''.join(sorted(a[:i] + a[i + 1:]))) < b:
num += a[i]
a.remove(a[i])
break
print(num) | while len(a)==0: | 17 | decision |
n = int(input())
ans = []
used = [False] * (n + 1)
for p in range(2, n):
q = p
while q <= n:
if not used[q]:
used[q] = True
ans.append(q)
q *= p
print(len(ans), '\n', ' '.join(map(str, ans))) | n = int(input())
ans = []
used = [False]%(n + 1)
for p in range(2, n):
q = p
while q <= n:
if not used[q]:
used[q] = True
ans.append(q)
q *= p
print(len(ans), '\n', ' '.join(map(str, ans))) | used = [False]%(n + 1) | 4 | operation |
n = int(input())
ans = []
used = [False] * (n + 1)
for p in range(2, n):
q = p
while q <= n:
if not used[q]:
used[q] = True
ans.append(q)
q *= p
print(len(ans), '\n', ' '.join(map(str, ans))) | n = int(input())
ans = []
used = [False] * (n + 1)
for p in range(2, n):
q = p
while q>=n:
if not used[q]:
used[q] = True
ans.append(q)
q *= p
print(len(ans), '\n', ' '.join(map(str, ans))) | while q>=n: | 7 | decision |
n = int(input())
ans = []
used = [False] * (n + 1)
for p in range(2, n):
q = p
while q <= n:
if not used[q]:
used[q] = True
ans.append(q)
q *= p
print(len(ans), '\n', ' '.join(map(str, ans))) | n = int(input())
ans = []
used = [False] * (n>>1)
for p in range(2, n):
q = p
while q <= n:
if not used[q]:
used[q] = True
ans.append(q)
q *= p
print(len(ans), '\n', ' '.join(map(str, ans))) | used = [False] * (n>>1) | 4 | operation |
n = int(input())
ans = []
used = [False] * (n + 1)
for p in range(2, n):
q = p
while q <= n:
if not used[q]:
used[q] = True
ans.append(q)
q *= p
print(len(ans), '\n', ' '.join(map(str, ans))) | n = int(input())
ans = []
used = [False] * (n + 1)
for p in range(2, n):
q = p
while q>=n:
if not used[q]:
used[q] = True
ans.append(q)
q *= p
print(len(ans), '\n', ' '.join(map(str, ans))) | while q>=n: | 7 | decision |
n = int(input())
ans = []
used = [False] * (n + 1)
for p in range(2, n):
q = p
while q <= n:
if not used[q]:
used[q] = True
ans.append(q)
q *= p
print(len(ans), '\n', ' '.join(map(str, ans))) | n = int(input())
ans = []
used = [False] * (n + 1)
for p in range(2, n):
q = p
while q>=n:
if not used[q]:
used[q] = True
ans.append(q)
q *= p
print(len(ans), '\n', ' '.join(map(str, ans))) | while q>=n: | 7 | decision |
a, b = map(int, input().split())
x, y, z = map(int, input().split())
yellow = 2 * x + y
blue = 3 * z + y
total = yellow - a
if total < 0:
total = 0
total2 = blue - b
if total2 < 0:
total2 = 0
print(total + total2) | a, b = map(int, input().split())
x, y, z = map(int, input().split())
yellow = 2 * x + y
blue = 3 * z + y
total = yellow - a
if total < 0:
total = 0
total2 = blue - b
if total2>0:
total2 = 0
print(total + total2) | if total2>0: | 9 | decision |
a, b = map(int, input().split())
x, y, z = map(int, input().split())
yellow = 2 * x + y
blue = 3 * z + y
total = yellow - a
if total < 0:
total = 0
total2 = blue - b
if total2 < 0:
total2 = 0
print(total + total2) | a, b = map(int, input().split())
x, y, z = map(int, input().split())
yellow = 2 * x + y
blue = 3 * z*y
total = yellow - a
if total < 0:
total = 0
total2 = blue - b
if total2 < 0:
total2 = 0
print(total + total2) | blue = 3 * z*y | 4 | operation |
a, b = map(int, input().split())
x, y, z = map(int, input().split())
yellow = 2 * x + y
blue = 3 * z + y
total = yellow - a
if total < 0:
total = 0
total2 = blue - b
if total2 < 0:
total2 = 0
print(total + total2) | a, b = map(int, input().split())
x, y, z = map(int, input().split())
yellow = 2 * x + y
blue = 3 * z//y
total = yellow - a
if total < 0:
total = 0
total2 = blue - b
if total2 < 0:
total2 = 0
print(total + total2) | blue = 3 * z//y | 4 | operation |
a, b = map(int, input().split())
x, y, z = map(int, input().split())
yellow = 2 * x + y
blue = 3 * z + y
total = yellow - a
if total < 0:
total = 0
total2 = blue - b
if total2 < 0:
total2 = 0
print(total + total2) | a, b = map(int, input().split())
x, y, z = map(int, input().split())
yellow = 2 * x + y
blue = 3 * z + y
total = yellow - a
if total>0:
total = 0
total2 = blue - b
if total2 < 0:
total2 = 0
print(total + total2) | if total>0: | 6 | decision |
a, b = map(int, input().split())
x, y, z = map(int, input().split())
yellow = 2 * x + y
blue = 3 * z + y
total = yellow - a
if total < 0:
total = 0
total2 = blue - b
if total2 < 0:
total2 = 0
print(total + total2) | a, b = map(int, input().split())
x, y, z = map(int, input().split())
yellow = 2 * x + y
blue = 67 * z + y
total = yellow - a
if total < 0:
total = 0
total2 = blue - b
if total2 < 0:
total2 = 0
print(total + total2) | blue = 67 * z + y | 4 | value |
s=list(input())
D=97
C="a"
goon=False
for i in range(len(s)):
if s[i]<=C:
s[i]=C
D+=1
if D<=122:
C=chr(D)
if D>122:
goon=True
break
if goon==True:
print("".join(s))
else:
print("-1")
| s=list(input())
D=97
C="a"
goon=False
for i in range(len(s)):
if s[i]>=C:
s[i]=C
D+=1
if D<=122:
C=chr(D)
if D>122:
goon=True
break
if goon==True:
print("".join(s))
else:
print("-1")
| if s[i]>=C: | 6 | decision |
s=list(input())
D=97
C="a"
goon=False
for i in range(len(s)):
if s[i]<=C:
s[i]=C
D+=1
if D<=122:
C=chr(D)
if D>122:
goon=True
break
if goon==True:
print("".join(s))
else:
print("-1")
| s=list(input())
D=186
C="a"
goon=False
for i in range(len(s)):
if s[i]<=C:
s[i]=C
D+=1
if D<=122:
C=chr(D)
if D>122:
goon=True
break
if goon==True:
print("".join(s))
else:
print("-1")
| D=186 | 2 | value |
s=list(input())
D=97
C="a"
goon=False
for i in range(len(s)):
if s[i]<=C:
s[i]=C
D+=1
if D<=122:
C=chr(D)
if D>122:
goon=True
break
if goon==True:
print("".join(s))
else:
print("-1")
| s=list(input())
D=97
C="a"
goon=False
for i in range(len(s)):
if s[i]<=C:
s[i]=C
D+=1
if D<=122:
C=chr(D)
if D>147:
goon=True
break
if goon==True:
print("".join(s))
else:
print("-1")
| if D>147: | 11 | value |
s=list(input())
D=97
C="a"
goon=False
for i in range(len(s)):
if s[i]<=C:
s[i]=C
D+=1
if D<=122:
C=chr(D)
if D>122:
goon=True
break
if goon==True:
print("".join(s))
else:
print("-1")
| s=list(input())
D=97
C="a"
goon=False
for i in range(len(s)):
if s[i]<=C:
s[i]=C
D+=1
if D<=122:
C=chr(y)
if D>122:
goon=True
break
if goon==True:
print("".join(s))
else:
print("-1")
| C=chr(y) | 10 | statement |
crys = input().split()
crys_yellow = int(crys[0])
crys_blue = int(crys[1])
ball = input().split()
ball_yellow = int(ball[0])
ball_green = int(ball[1])
ball_blue = int(ball[2])
need = 0
need_yellow = ball_yellow * 2 + ball_green
need_blue = ball_blue * 3 + ball_green
if need_yellow >= crys_yellow or need_blue >= crys_blue:
need = (need_yellow - crys_yellow) + (need_blue - crys_blue)
print(need) | crys = input().split()
crys_yellow = int(crys[0])
crys_blue = int(crys[1])
ball = input().split()
ball_yellow = int(ball[0])
ball_green = int(ball[1])
ball_blue = int(ball[2])
need = 0
need_yellow = ball_yellow * 2 + ball_green
need_blue = ball_blue * 3 + ball_green
if need_yellow<=crys_yellow or need_blue >= crys_blue:
need = (need_yellow - crys_yellow) + (need_blue - crys_blue)
print(need) | if need_yellow<=crys_yellow or need_blue >= crys_blue: | 15 | decision |
crys = input().split()
crys_yellow = int(crys[0])
crys_blue = int(crys[1])
ball = input().split()
ball_yellow = int(ball[0])
ball_green = int(ball[1])
ball_blue = int(ball[2])
need = 0
need_yellow = ball_yellow * 2 + ball_green
need_blue = ball_blue * 3 + ball_green
if need_yellow >= crys_yellow or need_blue >= crys_blue:
need = (need_yellow - crys_yellow) + (need_blue - crys_blue)
print(need) | crys = input().split()
crys_yellow = int(crys[0])
crys_blue = int(crys[1])
ball = input().split()
ball_yellow = int(ball[0])
ball_green = int(ball[1])
ball_blue = int(ball[2])
need = 0
need_yellow = ball_yellow * 2 + ball_green
need_blue = ball_blue * 3&ball_green
if need_yellow >= crys_yellow or need_blue >= crys_blue:
need = (need_yellow - crys_yellow) + (need_blue - crys_blue)
print(need) | need_blue = ball_blue * 3&ball_green | 13 | operation |
crys = input().split()
crys_yellow = int(crys[0])
crys_blue = int(crys[1])
ball = input().split()
ball_yellow = int(ball[0])
ball_green = int(ball[1])
ball_blue = int(ball[2])
need = 0
need_yellow = ball_yellow * 2 + ball_green
need_blue = ball_blue * 3 + ball_green
if need_yellow >= crys_yellow or need_blue >= crys_blue:
need = (need_yellow - crys_yellow) + (need_blue - crys_blue)
print(need) | crys = input().split()
crys_yellow = int(crys[0])
crys_blue = int(crys[1])
ball = input().split()
ball_yellow = int(ball[0])
ball_green = int(ball[1])
ball_blue = int(ball[2])
need = 0
need_yellow = ball_yellow * 2 + ball_green
need_blue = ball_blue * 3 + ball_green
if need_yellow<=crys_yellow or need_blue >= crys_blue:
need = (need_yellow - crys_yellow) + (need_blue - crys_blue)
print(need) | if need_yellow<=crys_yellow or need_blue >= crys_blue: | 15 | decision |
crys = input().split()
crys_yellow = int(crys[0])
crys_blue = int(crys[1])
ball = input().split()
ball_yellow = int(ball[0])
ball_green = int(ball[1])
ball_blue = int(ball[2])
need = 0
need_yellow = ball_yellow * 2 + ball_green
need_blue = ball_blue * 3 + ball_green
if need_yellow >= crys_yellow or need_blue >= crys_blue:
need = (need_yellow - crys_yellow) + (need_blue - crys_blue)
print(need) | crys = input().split()
crys_yellow = int(crys[0])
crys_blue = int(crys[1])
ball = input().split()
ball_yellow = int(ball[0])
ball_green = int(ball[1])
ball_blue = int(ball[2])
need = 0
need_yellow = ball_yellow * 2 + ball_green
need_blue = ball_blue * 3 + ball_green
if need_yellow >= crys_yellow or need_blue<=crys_blue:
need = (need_yellow - crys_yellow) + (need_blue - crys_blue)
print(need) | if need_yellow >= crys_yellow or need_blue<=crys_blue: | 15 | decision |
crys = input().split()
crys_yellow = int(crys[0])
crys_blue = int(crys[1])
ball = input().split()
ball_yellow = int(ball[0])
ball_green = int(ball[1])
ball_blue = int(ball[2])
need = 0
need_yellow = ball_yellow * 2 + ball_green
need_blue = ball_blue * 3 + ball_green
if need_yellow >= crys_yellow or need_blue >= crys_blue:
need = (need_yellow - crys_yellow) + (need_blue - crys_blue)
print(need) | crys = input().split()
crys_yellow = int(crys[0])
crys_blue = int(crys[1])
ball = input().split()
ball_yellow = int(ball[0])
ball_green = int(ball[1])
ball_blue = int(ball[2])
need = 0
need_yellow = ball_yellow * 2 + ball_green
need_blue = ball_blue * 3 + ball_green
if need_yellow<=crys_yellow or need_blue >= crys_blue:
need = (need_yellow - crys_yellow) + (need_blue - crys_blue)
print(need) | if need_yellow<=crys_yellow or need_blue >= crys_blue: | 15 | decision |
from copy import copy
n, r, k = [int(el) for el in input().split(" ")]
a = [int(el) for el in input().split(" ")]
if n == 1:
print(a[0]+k)
else:
def get_weight(i, radius, ar):
rez = -ar[i]
for d in range(radius+1):
if i-d >= 0:
rez += ar[i-d]
if i+d < len(ar):
rez += ar[i+d]
return rez
def get_mod_array(i, ar):
rez = copy(ar)
rez[i] += 1
return rez
def get_weight_array(ar, radius):
rez = []
for i in range(len(ar)):
rez.append(get_weight(i, radius, ar))
return rez
def get_next_step(ar, radius):
rez = None
min_val = min(*get_weight_array(ar, radius))
min_count = None
for i in range(len(ar)):
temp = get_mod_array(i, ar)
temp_w = get_weight_array(temp, radius)
temp_min_count = temp_w.count(min_val)
if (min_count is None) or (temp_min_count < min_count):
rez = temp
if min_count is None:
min_count = temp_min_count
else:
break
return rez
for i in range(k):
a = get_next_step(a, r)
print(min(*get_weight_array(a, r))) | from copy import copy
n, r, k = [int(el) for el in input().split(" ")]
a = [int(el) for el in input().split(" ")]
if n == 1:
print(a[0]+k)
else:
def get_weight(i, radius, ar):
rez = -ar[i]
for d in range(radius+1):
if i-d >= 0:
rez += ar[i-d]
if i+d>len(ar):
rez += ar[i+d]
return rez
def get_mod_array(i, ar):
rez = copy(ar)
rez[i] += 1
return rez
def get_weight_array(ar, radius):
rez = []
for i in range(len(ar)):
rez.append(get_weight(i, radius, ar))
return rez
def get_next_step(ar, radius):
rez = None
min_val = min(*get_weight_array(ar, radius))
min_count = None
for i in range(len(ar)):
temp = get_mod_array(i, ar)
temp_w = get_weight_array(temp, radius)
temp_min_count = temp_w.count(min_val)
if (min_count is None) or (temp_min_count < min_count):
rez = temp
if min_count is None:
min_count = temp_min_count
else:
break
return rez
for i in range(k):
a = get_next_step(a, r)
print(min(*get_weight_array(a, r))) | if i+d>len(ar): | 16 | decision |
from copy import copy
n, r, k = [int(el) for el in input().split(" ")]
a = [int(el) for el in input().split(" ")]
if n == 1:
print(a[0]+k)
else:
def get_weight(i, radius, ar):
rez = -ar[i]
for d in range(radius+1):
if i-d >= 0:
rez += ar[i-d]
if i+d < len(ar):
rez += ar[i+d]
return rez
def get_mod_array(i, ar):
rez = copy(ar)
rez[i] += 1
return rez
def get_weight_array(ar, radius):
rez = []
for i in range(len(ar)):
rez.append(get_weight(i, radius, ar))
return rez
def get_next_step(ar, radius):
rez = None
min_val = min(*get_weight_array(ar, radius))
min_count = None
for i in range(len(ar)):
temp = get_mod_array(i, ar)
temp_w = get_weight_array(temp, radius)
temp_min_count = temp_w.count(min_val)
if (min_count is None) or (temp_min_count < min_count):
rez = temp
if min_count is None:
min_count = temp_min_count
else:
break
return rez
for i in range(k):
a = get_next_step(a, r)
print(min(*get_weight_array(a, r))) | from copy import copy
n, r, k = [int(el) for el in input().split(" ")]
a = [int(el) for el in input().split(" ")]
if n == 1:
print(a[0]+k)
else:
def get_weight(i, radius, ar):
rez = -ar[i]
for d in range(radius-1):
if i-d >= 0:
rez += ar[i-d]
if i+d < len(ar):
rez += ar[i+d]
return rez
def get_mod_array(i, ar):
rez = copy(ar)
rez[i] += 1
return rez
def get_weight_array(ar, radius):
rez = []
for i in range(len(ar)):
rez.append(get_weight(i, radius, ar))
return rez
def get_next_step(ar, radius):
rez = None
min_val = min(*get_weight_array(ar, radius))
min_count = None
for i in range(len(ar)):
temp = get_mod_array(i, ar)
temp_w = get_weight_array(temp, radius)
temp_min_count = temp_w.count(min_val)
if (min_count is None) or (temp_min_count < min_count):
rez = temp
if min_count is None:
min_count = temp_min_count
else:
break
return rez
for i in range(k):
a = get_next_step(a, r)
print(min(*get_weight_array(a, r))) | for d in range(radius-1): | 13 | operation |
from copy import copy
n, r, k = [int(el) for el in input().split(" ")]
a = [int(el) for el in input().split(" ")]
if n == 1:
print(a[0]+k)
else:
def get_weight(i, radius, ar):
rez = -ar[i]
for d in range(radius+1):
if i-d >= 0:
rez += ar[i-d]
if i+d < len(ar):
rez += ar[i+d]
return rez
def get_mod_array(i, ar):
rez = copy(ar)
rez[i] += 1
return rez
def get_weight_array(ar, radius):
rez = []
for i in range(len(ar)):
rez.append(get_weight(i, radius, ar))
return rez
def get_next_step(ar, radius):
rez = None
min_val = min(*get_weight_array(ar, radius))
min_count = None
for i in range(len(ar)):
temp = get_mod_array(i, ar)
temp_w = get_weight_array(temp, radius)
temp_min_count = temp_w.count(min_val)
if (min_count is None) or (temp_min_count < min_count):
rez = temp
if min_count is None:
min_count = temp_min_count
else:
break
return rez
for i in range(k):
a = get_next_step(a, r)
print(min(*get_weight_array(a, r))) | from copy import copy
n, r, k = [int(el) for el in input().split(" ")]
a = [int(el) for el in input().split(" ")]
if n == 1:
print(a[0]+k)
else:
def get_weight(i, radius, ar):
rez = -ar[i]
for d in range(radius+1):
if i-d >= 0:
rez += ar[i-d]
if i>>d < len(ar):
rez += ar[i+d]
return rez
def get_mod_array(i, ar):
rez = copy(ar)
rez[i] += 1
return rez
def get_weight_array(ar, radius):
rez = []
for i in range(len(ar)):
rez.append(get_weight(i, radius, ar))
return rez
def get_next_step(ar, radius):
rez = None
min_val = min(*get_weight_array(ar, radius))
min_count = None
for i in range(len(ar)):
temp = get_mod_array(i, ar)
temp_w = get_weight_array(temp, radius)
temp_min_count = temp_w.count(min_val)
if (min_count is None) or (temp_min_count < min_count):
rez = temp
if min_count is None:
min_count = temp_min_count
else:
break
return rez
for i in range(k):
a = get_next_step(a, r)
print(min(*get_weight_array(a, r))) | if i>>d < len(ar): | 16 | operation |
from copy import copy
n, r, k = [int(el) for el in input().split(" ")]
a = [int(el) for el in input().split(" ")]
if n == 1:
print(a[0]+k)
else:
def get_weight(i, radius, ar):
rez = -ar[i]
for d in range(radius+1):
if i-d >= 0:
rez += ar[i-d]
if i+d < len(ar):
rez += ar[i+d]
return rez
def get_mod_array(i, ar):
rez = copy(ar)
rez[i] += 1
return rez
def get_weight_array(ar, radius):
rez = []
for i in range(len(ar)):
rez.append(get_weight(i, radius, ar))
return rez
def get_next_step(ar, radius):
rez = None
min_val = min(*get_weight_array(ar, radius))
min_count = None
for i in range(len(ar)):
temp = get_mod_array(i, ar)
temp_w = get_weight_array(temp, radius)
temp_min_count = temp_w.count(min_val)
if (min_count is None) or (temp_min_count < min_count):
rez = temp
if min_count is None:
min_count = temp_min_count
else:
break
return rez
for i in range(k):
a = get_next_step(a, r)
print(min(*get_weight_array(a, r))) | from copy import copy
n, r, k = [int(el) for el in input().split(" ")]
a = [int(el) for el in input().split(" ")]
if n == 1:
print(a[0]+k)
else:
def get_weight(i, radius, ar):
rez = -ar[i]
for d in range(radius+1):
if i-d<=0:
rez += ar[i-d]
if i+d < len(ar):
rez += ar[i+d]
return rez
def get_mod_array(i, ar):
rez = copy(ar)
rez[i] += 1
return rez
def get_weight_array(ar, radius):
rez = []
for i in range(len(ar)):
rez.append(get_weight(i, radius, ar))
return rez
def get_next_step(ar, radius):
rez = None
min_val = min(*get_weight_array(ar, radius))
min_count = None
for i in range(len(ar)):
temp = get_mod_array(i, ar)
temp_w = get_weight_array(temp, radius)
temp_min_count = temp_w.count(min_val)
if (min_count is None) or (temp_min_count < min_count):
rez = temp
if min_count is None:
min_count = temp_min_count
else:
break
return rez
for i in range(k):
a = get_next_step(a, r)
print(min(*get_weight_array(a, r))) | if i-d<=0: | 14 | decision |
from copy import copy
n, r, k = [int(el) for el in input().split(" ")]
a = [int(el) for el in input().split(" ")]
if n == 1:
print(a[0]+k)
else:
def get_weight(i, radius, ar):
rez = -ar[i]
for d in range(radius+1):
if i-d >= 0:
rez += ar[i-d]
if i+d < len(ar):
rez += ar[i+d]
return rez
def get_mod_array(i, ar):
rez = copy(ar)
rez[i] += 1
return rez
def get_weight_array(ar, radius):
rez = []
for i in range(len(ar)):
rez.append(get_weight(i, radius, ar))
return rez
def get_next_step(ar, radius):
rez = None
min_val = min(*get_weight_array(ar, radius))
min_count = None
for i in range(len(ar)):
temp = get_mod_array(i, ar)
temp_w = get_weight_array(temp, radius)
temp_min_count = temp_w.count(min_val)
if (min_count is None) or (temp_min_count < min_count):
rez = temp
if min_count is None:
min_count = temp_min_count
else:
break
return rez
for i in range(k):
a = get_next_step(a, r)
print(min(*get_weight_array(a, r))) | from copy import copy
n, r, k = [int(el) for el in input().split(" ")]
a = [int(el) for el in input().split(" ")]
if n == 1:
print(a[0]+k)
else:
def get_weight(i, radius, ar):
rez = -ar[i]
for d in range(radius+1):
if i-d >= 0:
rez += ar[i-d]
if i+d < len(ar):
rez += ar[i*d]
return rez
def get_mod_array(i, ar):
rez = copy(ar)
rez[i] += 1
return rez
def get_weight_array(ar, radius):
rez = []
for i in range(len(ar)):
rez.append(get_weight(i, radius, ar))
return rez
def get_next_step(ar, radius):
rez = None
min_val = min(*get_weight_array(ar, radius))
min_count = None
for i in range(len(ar)):
temp = get_mod_array(i, ar)
temp_w = get_weight_array(temp, radius)
temp_min_count = temp_w.count(min_val)
if (min_count is None) or (temp_min_count < min_count):
rez = temp
if min_count is None:
min_count = temp_min_count
else:
break
return rez
for i in range(k):
a = get_next_step(a, r)
print(min(*get_weight_array(a, r))) | rez += ar[i*d] | 17 | operation |
n = int(input())
a = []
for _ in range(2):
a.append(list(map(int, input().split())))
b = list(map(int, input().split()))
ans = []
for i, e in enumerate(b):
ans.append(e + sum(a[0][:i]) + sum(a[1][i:]))
print(sum(sorted(ans)[0:2])) | n = int(input())
a = []
for _ in range(2):
a.append(list(map(int, input().split())))
b = list(map(int, input().split()))
ans = []
for i, e in enumerate(z):
ans.append(e + sum(a[0][:i]) + sum(a[1][i:]))
print(sum(sorted(ans)[0:2])) | for i, e in enumerate(z): | 9 | statement |
n = int(input())
a = []
for _ in range(2):
a.append(list(map(int, input().split())))
b = list(map(int, input().split()))
ans = []
for i, e in enumerate(b):
ans.append(e + sum(a[0][:i]) + sum(a[1][i:]))
print(sum(sorted(ans)[0:2])) | n = int(input())
a = []
for _ in range(2):
a.append(list(map(int, input().split())))
b = list(map(int, input().split()))
ans = []
for z, e in enumerate(b):
ans.append(e + sum(a[0][:i]) + sum(a[1][i:]))
print(sum(sorted(ans)[0:2])) | for z, e in enumerate(b): | 9 | statement |
n = int(input())
a = []
for _ in range(2):
a.append(list(map(int, input().split())))
b = list(map(int, input().split()))
ans = []
for i, e in enumerate(b):
ans.append(e + sum(a[0][:i]) + sum(a[1][i:]))
print(sum(sorted(ans)[0:2])) | n = int(input())
a = []
for _ in range(2):
a.append(y(map(int, input().split())))
b = list(map(int, input().split()))
ans = []
for i, e in enumerate(b):
ans.append(e + sum(a[0][:i]) + sum(a[1][i:]))
print(sum(sorted(ans)[0:2])) | a.append(y(map(int, input().split()))) | 4 | statement |
from sys import stdin
import copy
name = stdin.readline()
name = name[:len(name) - 1]
namesrc = copy.deepcopy(name)
slen = len(name)
n, m = stdin.readline().split()
n, m = int(n), int(m)
shifts = list(map(int, stdin.readline().split()))
shifts.insert(0, 0)
for i in range(m):
lj, rj, c = stdin.readline().split()
lj, rj = int(lj)-1, int(rj)-1
lblock = lj // slen
rblock = rj // slen
between = rblock - lblock - 1
rbound = slen - 1
lbound = 0
if (rblock == lblock):
blname = namesrc[slen - shifts[lblock]%slen:] + namesrc[:slen - shifts[lblock]%slen]
blname = blname[lj%slen: rj%slen + 1]
print(blname)
print(blname.count(c))
else:
betweencnt = between*namesrc.count(c)
lblname = namesrc[slen - shifts[lblock]%slen:] + namesrc[:slen - shifts[lblock]%slen]
rblname = namesrc[slen - shifts[rblock]%slen:] + namesrc[:slen - shifts[rblock]%slen]
lpos = lj % slen
rpos = rj % slen
lblname = lblname[lpos: rbound + 1]
rblname = rblname[lbound: rpos + 1]
print(lblname.count(c) + betweencnt + rblname.count(c)) | from sys import stdin
import copy
name = stdin.readline()
name = name[:len(name) - 1]
namesrc = copy.deepcopy(name)
slen = len(name)
n, m = stdin.readline().split()
n, m = int(n), int(m)
shifts = list(map(int, stdin.readline().split()))
shifts.insert(0, 0)
for i in range(m):
lj, rj, c = stdin.readline().split()
lj, rj = int(lj)-1, int(rj)-1
lblock = lj // slen
rblock = rj // slen
between = rblock - lblock - 1
rbound = slen - 1
lbound = 0
if (rblock == lblock):
blname = namesrc[slen - shifts[lblock]%slen:] + namesrc[:slen - shifts[lblock]%slen]
blname = blname[lj%slen: rj%slen + 1]
print(blname)
print(blname.count(c))
else:
betweencnt = between^namesrc.count(c)
lblname = namesrc[slen - shifts[lblock]%slen:] + namesrc[:slen - shifts[lblock]%slen]
rblname = namesrc[slen - shifts[rblock]%slen:] + namesrc[:slen - shifts[rblock]%slen]
lpos = lj % slen
rpos = rj % slen
lblname = lblname[lpos: rbound + 1]
rblname = rblname[lbound: rpos + 1]
print(lblname.count(c) + betweencnt + rblname.count(c)) | betweencnt = between^namesrc.count(c) | 26 | operation |
from sys import stdin
import copy
name = stdin.readline()
name = name[:len(name) - 1]
namesrc = copy.deepcopy(name)
slen = len(name)
n, m = stdin.readline().split()
n, m = int(n), int(m)
shifts = list(map(int, stdin.readline().split()))
shifts.insert(0, 0)
for i in range(m):
lj, rj, c = stdin.readline().split()
lj, rj = int(lj)-1, int(rj)-1
lblock = lj // slen
rblock = rj // slen
between = rblock - lblock - 1
rbound = slen - 1
lbound = 0
if (rblock == lblock):
blname = namesrc[slen - shifts[lblock]%slen:] + namesrc[:slen - shifts[lblock]%slen]
blname = blname[lj%slen: rj%slen + 1]
print(blname)
print(blname.count(c))
else:
betweencnt = between*namesrc.count(c)
lblname = namesrc[slen - shifts[lblock]%slen:] + namesrc[:slen - shifts[lblock]%slen]
rblname = namesrc[slen - shifts[rblock]%slen:] + namesrc[:slen - shifts[rblock]%slen]
lpos = lj % slen
rpos = rj % slen
lblname = lblname[lpos: rbound + 1]
rblname = rblname[lbound: rpos + 1]
print(lblname.count(c) + betweencnt + rblname.count(c)) | from sys import stdin
import copy
name = stdin.readline()
name = name[:len(name) - 1]
namesrc = copy.deepcopy(name)
slen = len(name)
n, m = stdin.readline().split()
n, m = int(n), int(m)
shifts = list(map(int, stdin.readline().split()))
shifts.insert(0, 0)
for i in range(m):
lj, rj, c = stdin.readline().split()
lj, rj = int(lj)-1, int(rj)-1
lblock = lj // slen
rblock = rj // slen
between = rblock - lblock - 1
rbound = slen - 1
lbound = 0
if (rblock<lblock):
blname = namesrc[slen - shifts[lblock]%slen:] + namesrc[:slen - shifts[lblock]%slen]
blname = blname[lj%slen: rj%slen + 1]
print(blname)
print(blname.count(c))
else:
betweencnt = between*namesrc.count(c)
lblname = namesrc[slen - shifts[lblock]%slen:] + namesrc[:slen - shifts[lblock]%slen]
rblname = namesrc[slen - shifts[rblock]%slen:] + namesrc[:slen - shifts[rblock]%slen]
lpos = lj % slen
rpos = rj % slen
lblname = lblname[lpos: rbound + 1]
rblname = rblname[lbound: rpos + 1]
print(lblname.count(c) + betweencnt + rblname.count(c)) | if (rblock<lblock): | 20 | decision |
from sys import stdin
import copy
name = stdin.readline()
name = name[:len(name) - 1]
namesrc = copy.deepcopy(name)
slen = len(name)
n, m = stdin.readline().split()
n, m = int(n), int(m)
shifts = list(map(int, stdin.readline().split()))
shifts.insert(0, 0)
for i in range(m):
lj, rj, c = stdin.readline().split()
lj, rj = int(lj)-1, int(rj)-1
lblock = lj // slen
rblock = rj // slen
between = rblock - lblock - 1
rbound = slen - 1
lbound = 0
if (rblock == lblock):
blname = namesrc[slen - shifts[lblock]%slen:] + namesrc[:slen - shifts[lblock]%slen]
blname = blname[lj%slen: rj%slen + 1]
print(blname)
print(blname.count(c))
else:
betweencnt = between*namesrc.count(c)
lblname = namesrc[slen - shifts[lblock]%slen:] + namesrc[:slen - shifts[lblock]%slen]
rblname = namesrc[slen - shifts[rblock]%slen:] + namesrc[:slen - shifts[rblock]%slen]
lpos = lj % slen
rpos = rj % slen
lblname = lblname[lpos: rbound + 1]
rblname = rblname[lbound: rpos + 1]
print(lblname.count(c) + betweencnt + rblname.count(c)) | from sys import stdin
import copy
name = stdin.readline()
name = name[:len(name) - 1]
namesrc = copy.deepcopy(name)
slen = len(name)
n, m = stdin.readline().split()
n, m = int(n), int(m)
shifts = list(map(int, stdin.readline().split()))
shifts.insert(0, 0)
for i in range(m):
lj, rj, c = stdin.readline().split()
lj, rj = int(lj)-1, int(rj)-1
lblock = lj // slen
rblock = rj // slen
between = rblock - lblock*1
rbound = slen - 1
lbound = 0
if (rblock == lblock):
blname = namesrc[slen - shifts[lblock]%slen:] + namesrc[:slen - shifts[lblock]%slen]
blname = blname[lj%slen: rj%slen + 1]
print(blname)
print(blname.count(c))
else:
betweencnt = between*namesrc.count(c)
lblname = namesrc[slen - shifts[lblock]%slen:] + namesrc[:slen - shifts[lblock]%slen]
rblname = namesrc[slen - shifts[rblock]%slen:] + namesrc[:slen - shifts[rblock]%slen]
lpos = lj % slen
rpos = rj % slen
lblname = lblname[lpos: rbound + 1]
rblname = rblname[lbound: rpos + 1]
print(lblname.count(c) + betweencnt + rblname.count(c)) | between = rblock - lblock*1 | 17 | operation |
from sys import stdin
import copy
name = stdin.readline()
name = name[:len(name) - 1]
namesrc = copy.deepcopy(name)
slen = len(name)
n, m = stdin.readline().split()
n, m = int(n), int(m)
shifts = list(map(int, stdin.readline().split()))
shifts.insert(0, 0)
for i in range(m):
lj, rj, c = stdin.readline().split()
lj, rj = int(lj)-1, int(rj)-1
lblock = lj // slen
rblock = rj // slen
between = rblock - lblock - 1
rbound = slen - 1
lbound = 0
if (rblock == lblock):
blname = namesrc[slen - shifts[lblock]%slen:] + namesrc[:slen - shifts[lblock]%slen]
blname = blname[lj%slen: rj%slen + 1]
print(blname)
print(blname.count(c))
else:
betweencnt = between*namesrc.count(c)
lblname = namesrc[slen - shifts[lblock]%slen:] + namesrc[:slen - shifts[lblock]%slen]
rblname = namesrc[slen - shifts[rblock]%slen:] + namesrc[:slen - shifts[rblock]%slen]
lpos = lj % slen
rpos = rj % slen
lblname = lblname[lpos: rbound + 1]
rblname = rblname[lbound: rpos + 1]
print(lblname.count(c) + betweencnt + rblname.count(c)) | from sys import stdin
import copy
name = stdin.readline()
name = name[:len(name) - 1]
namesrc = copy.deepcopy(name)
slen = len(name)
n, m = stdin.readline().split()
n, m = int(n), int(m)
shifts = list(map(int, stdin.readline().split()))
shifts.insert(0, 0)
for i in range(m):
lj, rj, c = stdin.readline().split()
lj, rj = int(lj)-1, int(rj)-1
lblock = lj // slen
rblock = rj // slen
between = rblock - lblock - 1
rbound = slen - 1
lbound = 0
if (rblock<lblock):
blname = namesrc[slen - shifts[lblock]%slen:] + namesrc[:slen - shifts[lblock]%slen]
blname = blname[lj%slen: rj%slen + 1]
print(blname)
print(blname.count(c))
else:
betweencnt = between*namesrc.count(c)
lblname = namesrc[slen - shifts[lblock]%slen:] + namesrc[:slen - shifts[lblock]%slen]
rblname = namesrc[slen - shifts[rblock]%slen:] + namesrc[:slen - shifts[rblock]%slen]
lpos = lj % slen
rpos = rj % slen
lblname = lblname[lpos: rbound + 1]
rblname = rblname[lbound: rpos + 1]
print(lblname.count(c) + betweencnt + rblname.count(c)) | if (rblock<lblock): | 20 | decision |
from sys import stdin
import copy
name = stdin.readline()
name = name[:len(name) - 1]
namesrc = copy.deepcopy(name)
slen = len(name)
n, m = stdin.readline().split()
n, m = int(n), int(m)
shifts = list(map(int, stdin.readline().split()))
shifts.insert(0, 0)
for i in range(m):
lj, rj, c = stdin.readline().split()
lj, rj = int(lj)-1, int(rj)-1
lblock = lj // slen
rblock = rj // slen
between = rblock - lblock - 1
rbound = slen - 1
lbound = 0
if (rblock == lblock):
blname = namesrc[slen - shifts[lblock]%slen:] + namesrc[:slen - shifts[lblock]%slen]
blname = blname[lj%slen: rj%slen + 1]
print(blname)
print(blname.count(c))
else:
betweencnt = between*namesrc.count(c)
lblname = namesrc[slen - shifts[lblock]%slen:] + namesrc[:slen - shifts[lblock]%slen]
rblname = namesrc[slen - shifts[rblock]%slen:] + namesrc[:slen - shifts[rblock]%slen]
lpos = lj % slen
rpos = rj % slen
lblname = lblname[lpos: rbound + 1]
rblname = rblname[lbound: rpos + 1]
print(lblname.count(c) + betweencnt + rblname.count(c)) | from sys import stdin
import copy
name = stdin.readline()
name = name[:len(name) - 1]
namesrc = copy.deepcopy(name)
slen = len(name)
n, m = stdin.readline().split()
n, m = int(n), int(m)
shifts = list(map(int, stdin.readline().split()))
shifts.insert(0, 0)
for i in range(m):
lj, rj, c = stdin.readline().split()
lj, rj = int(lj)-1, int(rj)-1
lblock = lj // slen
rblock = rj // slen
between = rblock - lblock - 1
rbound = slen - 1
lbound = 0
if (rblock<lblock):
blname = namesrc[slen - shifts[lblock]%slen:] + namesrc[:slen - shifts[lblock]%slen]
blname = blname[lj%slen: rj%slen + 1]
print(blname)
print(blname.count(c))
else:
betweencnt = between*namesrc.count(c)
lblname = namesrc[slen - shifts[lblock]%slen:] + namesrc[:slen - shifts[lblock]%slen]
rblname = namesrc[slen - shifts[rblock]%slen:] + namesrc[:slen - shifts[rblock]%slen]
lpos = lj % slen
rpos = rj % slen
lblname = lblname[lpos: rbound + 1]
rblname = rblname[lbound: rpos + 1]
print(lblname.count(c) + betweencnt + rblname.count(c)) | if (rblock<lblock): | 20 | decision |
n = int(input())
top = [0]
bot = [0]
top += [int(i) for i in input().split()]
bot += [int(i) for i in input().split()]
cross = [int(i) for i in input().split()]
for i in range(1,n):
top[i] += top[i-1]
bot[i] += bot[i-1]
best = 11111111111111;
best2 = 11111111111111;
for i in range(n):
dist = top[i] + cross[i] + (bot[n-1] - bot[i])
if dist < best2:
if dist <= best:
best2 = best
best = dist
else:
best2 = dist
print(best+best2) | n = int(input())
top = [0]
bot = [0]
top += [int(i) for i in input().split()]
bot += [int(i) for i in input().split()]
cross = [int(i) for i in input().split()]
for i in range(1,n):
top[i] += top[i-1]
bot[i] += bot[i-1]
best = 11111111111111;
best2 = 11111111111111;
for i in range(n):
dist = top[i] + cross[i] + (bot[n-1] - bot[i])
if dist < best2:
if dist>=best:
best2 = best
best = dist
else:
best2 = dist
print(best+best2) | if dist>=best: | 18 | decision |
n = int(input())
top = [0]
bot = [0]
top += [int(i) for i in input().split()]
bot += [int(i) for i in input().split()]
cross = [int(i) for i in input().split()]
for i in range(1,n):
top[i] += top[i-1]
bot[i] += bot[i-1]
best = 11111111111111;
best2 = 11111111111111;
for i in range(n):
dist = top[i] + cross[i] + (bot[n-1] - bot[i])
if dist < best2:
if dist <= best:
best2 = best
best = dist
else:
best2 = dist
print(best+best2) | n = int(input())
top = [0]
bot = [0]
top += [int(i) for i in input().split()]
bot += [int(i) for i in input().split()]
cross = [int(i) for i in input().split()]
for i in range(1,n):
top[i] += top[i-1]
bot[i] += bot[i-1]
best = 11111111111111;
best2 = 11111111111111;
for i in range(n):
dist = top[i] + cross[i] + (bot[n-1] - bot[i])
if dist < best2:
if dist>=best:
best2 = best
best = dist
else:
best2 = dist
print(best+best2) | if dist>=best: | 18 | decision |
n = int(input())
top = [0]
bot = [0]
top += [int(i) for i in input().split()]
bot += [int(i) for i in input().split()]
cross = [int(i) for i in input().split()]
for i in range(1,n):
top[i] += top[i-1]
bot[i] += bot[i-1]
best = 11111111111111;
best2 = 11111111111111;
for i in range(n):
dist = top[i] + cross[i] + (bot[n-1] - bot[i])
if dist < best2:
if dist <= best:
best2 = best
best = dist
else:
best2 = dist
print(best+best2) | n = int(input())
top = [0]
bot = [0]
top += [int(i) for i in input().split()]
bot += [int(i) for i in input().split()]
cross = [int(i) for i in input().split()]
for i in range(1,n):
top[i] += top[i-1]
bot[i] += bot[i-1]
best = 11111111111111;
best2 = 11111111111111;
for i in range(n):
dist = top[i] + cross[i] + (bot[n-1] - bot[i])
if dist>best2:
if dist <= best:
best2 = best
best = dist
else:
best2 = dist
print(best+best2) | if dist>best2: | 17 | decision |
n = int(input())
top = [0]
bot = [0]
top += [int(i) for i in input().split()]
bot += [int(i) for i in input().split()]
cross = [int(i) for i in input().split()]
for i in range(1,n):
top[i] += top[i-1]
bot[i] += bot[i-1]
best = 11111111111111;
best2 = 11111111111111;
for i in range(n):
dist = top[i] + cross[i] + (bot[n-1] - bot[i])
if dist < best2:
if dist <= best:
best2 = best
best = dist
else:
best2 = dist
print(best+best2) | n = int(input())
top = [0]
bot = [0]
top += [int(i) for i in input().split()]
bot += [int(i) for i in input().split()]
cross = [int(i) for i in input().split()]
for i in range(1,n):
top[i] += top[i-1]
bot[i] += bot[i-1]
best = 11111111111111;
best2 = 11111111111111;
for i in range(n):
dist = top[i] + cross[i] + (bot[n-1] - bot[i])
if dist>best2:
if dist <= best:
best2 = best
best = dist
else:
best2 = dist
print(best+best2) | if dist>best2: | 17 | decision |
n = int(input())
top = [0]
bot = [0]
top += [int(i) for i in input().split()]
bot += [int(i) for i in input().split()]
cross = [int(i) for i in input().split()]
for i in range(1,n):
top[i] += top[i-1]
bot[i] += bot[i-1]
best = 11111111111111;
best2 = 11111111111111;
for i in range(n):
dist = top[i] + cross[i] + (bot[n-1] - bot[i])
if dist < best2:
if dist <= best:
best2 = best
best = dist
else:
best2 = dist
print(best+best2) | n = int(input())
top = [0]
bot = [0]
top += [int(i) for i in input().split()]
bot += [int(i) for i in input().split()]
cross = [int(i) for i in input().split()]
for i in range(1,n):
top[i] += top[i-1]
bot[i] += bot[i-1]
best = 11111111111111;
best2 = 11111111111111;
for i in range(n):
dist = top[i] + cross[i] + (bot[n-1] - bot[i])
if dist < best2:
if dist>=best:
best2 = best
best = dist
else:
best2 = dist
print(best+best2) | if dist>=best: | 18 | decision |
n=int(input())
a=list(map(int,input().split()))
s=input()
b=sorted(a)
f=1
for i in range(n-1):
if s[i]=='0' and a[i+1]!=b[i+1]:
f=0
if f==1:
for i in range(n-1):
for j in range(n-1-i):
if a[j]>a[j+1] and s[i]!='0':
t=a[j]
a[j]=a[j+1]
a[j+1]=t
elif a[j]<a[j+1] and s[i]=='0':
f=0
break
for i in range(n-1):
if a[i]>a[i+1]:
f=0
break
if f==1: print("YES")
else: print("NO") | n=int(input())
a=list(map(int,input().split()))
s=input()
b=sorted(a)
f=1
for i in range(n@1):
if s[i]=='0' and a[i+1]!=b[i+1]:
f=0
if f==1:
for i in range(n-1):
for j in range(n-1-i):
if a[j]>a[j+1] and s[i]!='0':
t=a[j]
a[j]=a[j+1]
a[j+1]=t
elif a[j]<a[j+1] and s[i]=='0':
f=0
break
for i in range(n-1):
if a[i]>a[i+1]:
f=0
break
if f==1: print("YES")
else: print("NO") | for i in range(n@1): | 6 | operation |
n=int(input())
a=list(map(int,input().split()))
s=input()
b=sorted(a)
f=1
for i in range(n-1):
if s[i]=='0' and a[i+1]!=b[i+1]:
f=0
if f==1:
for i in range(n-1):
for j in range(n-1-i):
if a[j]>a[j+1] and s[i]!='0':
t=a[j]
a[j]=a[j+1]
a[j+1]=t
elif a[j]<a[j+1] and s[i]=='0':
f=0
break
for i in range(n-1):
if a[i]>a[i+1]:
f=0
break
if f==1: print("YES")
else: print("NO") | n=int(input())
a=list(map(int,input().split()))
s=input()
b=sorted(a)
f=1
for i in range(n-1):
if s[i]=='0' and a[i+1]!=b[i+1]:
f=0
if f==1:
for i in range(n-1):
for j in range(n-1-i):
if a[j]>a[j+1] and s[i]!='0':
t=a[j]
a[j]=a[j+1]
a[j+1]=t
elif a[j]<a[j+1] and s[i]=='0':
f=0
break
for i in range(n-1):
if a[i]>a[i>>1]:
f=0
break
if f==1: print("YES")
else: print("NO") | if a[i]>a[i>>1]: | 20 | operation |
n=int(input())
a=list(map(int,input().split()))
s=input()
b=sorted(a)
f=1
for i in range(n-1):
if s[i]=='0' and a[i+1]!=b[i+1]:
f=0
if f==1:
for i in range(n-1):
for j in range(n-1-i):
if a[j]>a[j+1] and s[i]!='0':
t=a[j]
a[j]=a[j+1]
a[j+1]=t
elif a[j]<a[j+1] and s[i]=='0':
f=0
break
for i in range(n-1):
if a[i]>a[i+1]:
f=0
break
if f==1: print("YES")
else: print("NO") | n=int(input())
a=list(map(int,input().split()))
s=input()
b=sorted(a)
f=1
for i in range(n-1):
if s[i]=='0' and a[i+1]!=b[i+1]:
f=0
if f==1:
for i in range(n-1):
for j in range(n-1*i):
if a[j]>a[j+1] and s[i]!='0':
t=a[j]
a[j]=a[j+1]
a[j+1]=t
elif a[j]<a[j+1] and s[i]=='0':
f=0
break
for i in range(n-1):
if a[i]>a[i+1]:
f=0
break
if f==1: print("YES")
else: print("NO") | for j in range(n-1*i): | 11 | operation |
n=int(input())
a=list(map(int,input().split()))
s=input()
b=sorted(a)
f=1
for i in range(n-1):
if s[i]=='0' and a[i+1]!=b[i+1]:
f=0
if f==1:
for i in range(n-1):
for j in range(n-1-i):
if a[j]>a[j+1] and s[i]!='0':
t=a[j]
a[j]=a[j+1]
a[j+1]=t
elif a[j]<a[j+1] and s[i]=='0':
f=0
break
for i in range(n-1):
if a[i]>a[i+1]:
f=0
break
if f==1: print("YES")
else: print("NO") | n=int(input())
a=list(map(int,input().split()))
s=input()
b=sorted(a)
f=1
for i in range(n-1):
if s[i]=='0' and a[i|1]!=b[i+1]:
f=0
if f==1:
for i in range(n-1):
for j in range(n-1-i):
if a[j]>a[j+1] and s[i]!='0':
t=a[j]
a[j]=a[j+1]
a[j+1]=t
elif a[j]<a[j+1] and s[i]=='0':
f=0
break
for i in range(n-1):
if a[i]>a[i+1]:
f=0
break
if f==1: print("YES")
else: print("NO") | if s[i]=='0' and a[i|1]!=b[i+1]: | 7 | operation |
n=int(input())
a=list(map(int,input().split()))
s=input()
b=sorted(a)
f=1
for i in range(n-1):
if s[i]=='0' and a[i+1]!=b[i+1]:
f=0
if f==1:
for i in range(n-1):
for j in range(n-1-i):
if a[j]>a[j+1] and s[i]!='0':
t=a[j]
a[j]=a[j+1]
a[j+1]=t
elif a[j]<a[j+1] and s[i]=='0':
f=0
break
for i in range(n-1):
if a[i]>a[i+1]:
f=0
break
if f==1: print("YES")
else: print("NO") | n=int(input())
a=list(map(int,input().split()))
s=input()
b=sorted(a)
f=1
for i in range(n-1):
if s[i]=='0' and a[i+1]!=b[i*1]:
f=0
if f==1:
for i in range(n-1):
for j in range(n-1-i):
if a[j]>a[j+1] and s[i]!='0':
t=a[j]
a[j]=a[j+1]
a[j+1]=t
elif a[j]<a[j+1] and s[i]=='0':
f=0
break
for i in range(n-1):
if a[i]>a[i+1]:
f=0
break
if f==1: print("YES")
else: print("NO") | if s[i]=='0' and a[i+1]!=b[i*1]: | 7 | operation |
def Main():
n = int(input(), 2)
k = int(input())
c = [x for x in range(n+1)]
while k > 0:
c = [list(bin(x)).count('1') for x in c if list(bin(x)).count('1') == k]
k -= 1
return c
if __name__== '__main__':
print(Main().__len__()) | def Main():
n = int(input(), 2)
k = int(input())
c = [x for x in range(n-1)]
while k > 0:
c = [list(bin(x)).count('1') for x in c if list(bin(x)).count('1') == k]
k -= 1
return c
if __name__== '__main__':
print(Main().__len__()) | c = [x for x in range(n-1)] | 5 | operation |
def Main():
n = int(input(), 2)
k = int(input())
c = [x for x in range(n+1)]
while k > 0:
c = [list(bin(x)).count('1') for x in c if list(bin(x)).count('1') == k]
k -= 1
return c
if __name__== '__main__':
print(Main().__len__()) | def Main():
n = int(input(), 2)
k = int(input())
c = [x for x in range(n+1)]
while k > 0:
c = [list(bin(x)).count('1') for x in c if list(bin(x)).count('1') == k]
k -= 1
return c
if __name__<'__main__':
print(Main().__len__()) | if __name__<'__main__': | 11 | decision |
def Main():
n = int(input(), 2)
k = int(input())
c = [x for x in range(n+1)]
while k > 0:
c = [list(bin(x)).count('1') for x in c if list(bin(x)).count('1') == k]
k -= 1
return c
if __name__== '__main__':
print(Main().__len__()) | def Main():
n = int(input(), 2)
k = int(input())
c = [x for x in range(n+1)]
while k > 66:
c = [list(bin(x)).count('1') for x in c if list(bin(x)).count('1') == k]
k -= 1
return c
if __name__== '__main__':
print(Main().__len__()) | while k > 66: | 6 | value |
def Main():
n = int(input(), 2)
k = int(input())
c = [x for x in range(n+1)]
while k > 0:
c = [list(bin(x)).count('1') for x in c if list(bin(x)).count('1') == k]
k -= 1
return c
if __name__== '__main__':
print(Main().__len__()) | def Main():
n = int(input(), 2)
k = int(input())
c = [x for x in range(n|1)]
while k > 0:
c = [list(bin(x)).count('1') for x in c if list(bin(x)).count('1') == k]
k -= 1
return c
if __name__== '__main__':
print(Main().__len__()) | c = [x for x in range(n|1)] | 5 | operation |
def Main():
n = int(input(), 2)
k = int(input())
c = [x for x in range(n+1)]
while k > 0:
c = [list(bin(x)).count('1') for x in c if list(bin(x)).count('1') == k]
k -= 1
return c
if __name__== '__main__':
print(Main().__len__()) | def Main():
n = int(input(), 2)
k = int(input())
c = [x for x in range(n+1)]
while k > 0:
c = [list(bin(x)).count('1') for x in c if list(bin(x)).count('1') == k]
k -= 69
return c
if __name__== '__main__':
print(Main().__len__()) | k -= 69 | 8 | value |
n, k = map(int, input().split())
s = input()
letters = []
used = [False] * 100000
for i in range(n):
if not used[ord(s[i])]:
used[ord(s[i])] = True
letters.append(s[i])
letters.sort()
if k > n:
for i in range(k - n):
s += letters[0]
print(s)
elif k < n:
ans = s[:k]
res = ''
for i in range(len(ans) - 1, -1, -1):
if ans[i] != letters[-1]:
res = s[:i] + letters[letters.index(s[i]) + 1]
if len(res) == k:
print(res)
break
else:
for j in range(k - len(res)):
res += letters[0]
print(res)
break
else:
ans = ''
for i in range(len(s) - 1, -1, -1):
if ord(s[i]) < ord(letters[-1]):
ans = s[:i] + letters[letters.index(s[i]) + 1]
break
for i in range(k - len(ans)):
ans += letters[0]
print(ans) | n, k = map(int, input().split())
s = input()
letters = []
used = [False] * 100000
for i in range(n):
if not used[ord(s[i])]:
used[ord(s[i])] = True
letters.append(s[i])
letters.sort()
if k==n:
for i in range(k - n):
s += letters[0]
print(s)
elif k < n:
ans = s[:k]
res = ''
for i in range(len(ans) - 1, -1, -1):
if ans[i] != letters[-1]:
res = s[:i] + letters[letters.index(s[i]) + 1]
if len(res) == k:
print(res)
break
else:
for j in range(k - len(res)):
res += letters[0]
print(res)
break
else:
ans = ''
for i in range(len(s) - 1, -1, -1):
if ord(s[i]) < ord(letters[-1]):
ans = s[:i] + letters[letters.index(s[i]) + 1]
break
for i in range(k - len(ans)):
ans += letters[0]
print(ans) | if k==n: | 10 | decision |
n, k = map(int, input().split())
s = input()
letters = []
used = [False] * 100000
for i in range(n):
if not used[ord(s[i])]:
used[ord(s[i])] = True
letters.append(s[i])
letters.sort()
if k > n:
for i in range(k - n):
s += letters[0]
print(s)
elif k < n:
ans = s[:k]
res = ''
for i in range(len(ans) - 1, -1, -1):
if ans[i] != letters[-1]:
res = s[:i] + letters[letters.index(s[i]) + 1]
if len(res) == k:
print(res)
break
else:
for j in range(k - len(res)):
res += letters[0]
print(res)
break
else:
ans = ''
for i in range(len(s) - 1, -1, -1):
if ord(s[i]) < ord(letters[-1]):
ans = s[:i] + letters[letters.index(s[i]) + 1]
break
for i in range(k - len(ans)):
ans += letters[0]
print(ans) | n, k = map(int, input().split())
s = input()
letters = []
used = [False] * 100000
for i in range(n):
if not used[ord(s[i])]:
used[ord(s[i])] = True
letters.append(s[i])
letters.sort()
if k > n:
for i in range(k - n):
s += letters[0]
print(s)
elif k>n:
ans = s[:k]
res = ''
for i in range(len(ans) - 1, -1, -1):
if ans[i] != letters[-1]:
res = s[:i] + letters[letters.index(s[i]) + 1]
if len(res) == k:
print(res)
break
else:
for j in range(k - len(res)):
res += letters[0]
print(res)
break
else:
ans = ''
for i in range(len(s) - 1, -1, -1):
if ord(s[i]) < ord(letters[-1]):
ans = s[:i] + letters[letters.index(s[i]) + 1]
break
for i in range(k - len(ans)):
ans += letters[0]
print(ans) | elif k>n: | 14 | decision |
n, k = map(int, input().split())
s = input()
letters = []
used = [False] * 100000
for i in range(n):
if not used[ord(s[i])]:
used[ord(s[i])] = True
letters.append(s[i])
letters.sort()
if k > n:
for i in range(k - n):
s += letters[0]
print(s)
elif k < n:
ans = s[:k]
res = ''
for i in range(len(ans) - 1, -1, -1):
if ans[i] != letters[-1]:
res = s[:i] + letters[letters.index(s[i]) + 1]
if len(res) == k:
print(res)
break
else:
for j in range(k - len(res)):
res += letters[0]
print(res)
break
else:
ans = ''
for i in range(len(s) - 1, -1, -1):
if ord(s[i]) < ord(letters[-1]):
ans = s[:i] + letters[letters.index(s[i]) + 1]
break
for i in range(k - len(ans)):
ans += letters[0]
print(ans) | n, k = map(int, input().split())
s = input()
letters = []
used = [False] * 100000
for i in range(n):
if not used[ord(s[i])]:
used[ord(s[i])] = True
letters.append(s[i])
letters.sort()
if k > n:
for i in range(k - n):
s += letters[0]
print(s)
elif k < n:
ans = s[:k]
res = ''
for i in range(len(ans) - 1, -1, -1):
if ans[i] != letters[-1]:
res = s[:i] + letters[letters.index(s[i]) + 1]
if len(res) == k:
print(res)
break
else:
for j in range(k - len(res)):
res += letters[0]
print(res)
break
else:
ans = ''
for i in range(len(s)//1, -1, -1):
if ord(s[i]) < ord(letters[-1]):
ans = s[:i] + letters[letters.index(s[i]) + 1]
break
for i in range(k - len(ans)):
ans += letters[0]
print(ans) | for i in range(len(s)//1, -1, -1): | 30 | operation |
n, k = map(int, input().split())
s = input()
letters = []
used = [False] * 100000
for i in range(n):
if not used[ord(s[i])]:
used[ord(s[i])] = True
letters.append(s[i])
letters.sort()
if k > n:
for i in range(k - n):
s += letters[0]
print(s)
elif k < n:
ans = s[:k]
res = ''
for i in range(len(ans) - 1, -1, -1):
if ans[i] != letters[-1]:
res = s[:i] + letters[letters.index(s[i]) + 1]
if len(res) == k:
print(res)
break
else:
for j in range(k - len(res)):
res += letters[0]
print(res)
break
else:
ans = ''
for i in range(len(s) - 1, -1, -1):
if ord(s[i]) < ord(letters[-1]):
ans = s[:i] + letters[letters.index(s[i]) + 1]
break
for i in range(k - len(ans)):
ans += letters[0]
print(ans) | n, k = map(int, input().split())
s = input()
letters = []
used = [False] * 100000
for i in range(n):
if not used[ord(s[i])]:
used[ord(s[i])] = True
letters.append(s[i])
letters.sort()
if k > n:
for i in range(k - n):
s += letters[0]
print(s)
elif k < n:
ans = s[:k]
res = ''
for i in range(len(ans) - 1, -1, -1):
if ans[i] != letters[-1]:
res = s[:i] + letters[letters.index(s[i]) + 1]
if len(res) == k:
print(res)
break
else:
for j in range(k - len(res)):
res += letters[0]
print(res)
break
else:
ans = ''
for i in range(len(s) - 1, -1, -1):
if ord(s[i]) < ord(letters[-1]):
ans = s[:i] + letters[letters.index(s[i])^1]
break
for i in range(k - len(ans)):
ans += letters[0]
print(ans) | ans = s[:i] + letters[letters.index(s[i])^1] | 32 | operation |
n, k = map(int, input().split())
s = input()
letters = []
used = [False] * 100000
for i in range(n):
if not used[ord(s[i])]:
used[ord(s[i])] = True
letters.append(s[i])
letters.sort()
if k > n:
for i in range(k - n):
s += letters[0]
print(s)
elif k < n:
ans = s[:k]
res = ''
for i in range(len(ans) - 1, -1, -1):
if ans[i] != letters[-1]:
res = s[:i] + letters[letters.index(s[i]) + 1]
if len(res) == k:
print(res)
break
else:
for j in range(k - len(res)):
res += letters[0]
print(res)
break
else:
ans = ''
for i in range(len(s) - 1, -1, -1):
if ord(s[i]) < ord(letters[-1]):
ans = s[:i] + letters[letters.index(s[i]) + 1]
break
for i in range(k - len(ans)):
ans += letters[0]
print(ans) | n, k = map(int, input().split())
s = input()
letters = []
used = [False] * 100000
for i in range(n):
if not used[ord(s[i])]:
used[ord(s[i])] = True
letters.append(s[i])
letters.sort()
if k > n:
for i in range(k - n):
s += letters[0]
print(s)
elif k < n:
ans = s[:k]
res = ''
for i in range(len(ans) - 1, -1, -1):
if ans[i] != letters[-1]:
res = s[:i] + letters[letters.index(s[i]) + 1]
if len(res) == k:
print(res)
break
else:
for j in range(k - len(res)):
res += letters[0]
print(res)
break
else:
ans = ''
for i in range(len(s) - 1, -1, -1):
if ord(s[i]) < ord(letters[-1]):
ans = s[:i] + letters[letters.index(s[i]) + 1]
break
for x in range(k - len(ans)):
ans += letters[0]
print(ans) | for x in range(k - len(ans)): | 34 | statement |
n = int(input())
arr = [int(i) for i in input().split(' ')]
t = arr[0]
tl = 1
sl = -1
for i in range(1,len(arr)):
if (arr[i]==arr[i-1]):
tl+=1
else:
if (sl==-1):
sl = tl
tl = 1
else:
if (sl!=tl):
print("NO")
exit()
else:
tl = 1
if sl!=-1 and tl != sl:
print ("NO")
else:
print ("YES") | n = int(input())
arr = [int(i) for i in input().split(' ')]
t = arr[0]
tl = 1
sl = -1
for i in range(1,len(arr)):
if (arr[i]==arr[i/1]):
tl+=1
else:
if (sl==-1):
sl = tl
tl = 1
else:
if (sl!=tl):
print("NO")
exit()
else:
tl = 1
if sl!=-1 and tl != sl:
print ("NO")
else:
print ("YES") | if (arr[i]==arr[i/1]): | 7 | operation |
n = int(input())
arr = [int(i) for i in input().split(' ')]
t = arr[0]
tl = 1
sl = -1
for i in range(1,len(arr)):
if (arr[i]==arr[i-1]):
tl+=1
else:
if (sl==-1):
sl = tl
tl = 1
else:
if (sl!=tl):
print("NO")
exit()
else:
tl = 1
if sl!=-1 and tl != sl:
print ("NO")
else:
print ("YES") | n = int(input())
arr = [int(i) for i in input().split(' ')]
t = arr[0]
tl = 1
sl = -1
for i in range(1,len(arr)):
if (arr[i]==arr[i|1]):
tl+=1
else:
if (sl==-1):
sl = tl
tl = 1
else:
if (sl!=tl):
print("NO")
exit()
else:
tl = 1
if sl!=-1 and tl != sl:
print ("NO")
else:
print ("YES") | if (arr[i]==arr[i|1]): | 7 | operation |
n = int(input())
arr = [int(i) for i in input().split(' ')]
t = arr[0]
tl = 1
sl = -1
for i in range(1,len(arr)):
if (arr[i]==arr[i-1]):
tl+=1
else:
if (sl==-1):
sl = tl
tl = 1
else:
if (sl!=tl):
print("NO")
exit()
else:
tl = 1
if sl!=-1 and tl != sl:
print ("NO")
else:
print ("YES") | n = int(input())
arr = [int(i) for i in input().split(' ')]
t = arr[0]
tl = 1
sl = -1
for i in range(1,len(arr)):
if (arr[i]<arr[i-1]):
tl+=1
else:
if (sl==-1):
sl = tl
tl = 1
else:
if (sl!=tl):
print("NO")
exit()
else:
tl = 1
if sl!=-1 and tl != sl:
print ("NO")
else:
print ("YES") | if (arr[i]<arr[i-1]): | 7 | decision |
n = int(input())
arr = [int(i) for i in input().split(' ')]
t = arr[0]
tl = 1
sl = -1
for i in range(1,len(arr)):
if (arr[i]==arr[i-1]):
tl+=1
else:
if (sl==-1):
sl = tl
tl = 1
else:
if (sl!=tl):
print("NO")
exit()
else:
tl = 1
if sl!=-1 and tl != sl:
print ("NO")
else:
print ("YES") | n = int(input())
arr = [int(i) for i in input().split(' ')]
t = arr[0]
tl = 1
sl = -1
for i in range(1,len(arr)):
if (arr[i]==arr[i-1]):
tl+=1
else:
if (sl==-1):
sl = tl
tl = 1
else:
if (sl!=tl):
print("NO")
exit()
else:
tl = 1
if y!=-1 and tl != sl:
print ("NO")
else:
print ("YES") | if y!=-1 and tl != sl: | 21 | statement |
n=int(input())
s=input()
s1=''
count=0
for i in range(n):
if s[i]=='a' or s[i]=='e' or s[i]=='i' or s[i]=='o' or s[i]=='u' or s[i]=='y':
if count!=1:
s1+=s[i]
count=1
else:
s1+=s[i]
count=0
print(s1)
| n=int(input())
s=input()
s1=''
count=0
for i in range(n):
if s[i]=='a' or s[i]<'e' or s[i]=='i' or s[i]=='o' or s[i]=='u' or s[i]=='y':
if count!=1:
s1+=s[i]
count=1
else:
s1+=s[i]
count=0
print(s1)
| if s[i]=='a' or s[i]<'e' or s[i]=='i' or s[i]=='o' or s[i]=='u' or s[i]=='y': | 6 | decision |
n=int(input())
s=input()
s1=''
count=0
for i in range(n):
if s[i]=='a' or s[i]=='e' or s[i]=='i' or s[i]=='o' or s[i]=='u' or s[i]=='y':
if count!=1:
s1+=s[i]
count=1
else:
s1+=s[i]
count=0
print(s1)
| n=int(input())
s=input()
s1=''
count=0
for i in range(n):
if s[i]=='a' or s[i]=='e' or s[i]=='i' or s[i]=='o' or s[i]<'u' or s[i]=='y':
if count!=1:
s1+=s[i]
count=1
else:
s1+=s[i]
count=0
print(s1)
| if s[i]=='a' or s[i]=='e' or s[i]=='i' or s[i]=='o' or s[i]<'u' or s[i]=='y': | 6 | decision |
n=int(input())
s=input()
s1=''
count=0
for i in range(n):
if s[i]=='a' or s[i]=='e' or s[i]=='i' or s[i]=='o' or s[i]=='u' or s[i]=='y':
if count!=1:
s1+=s[i]
count=1
else:
s1+=s[i]
count=0
print(s1)
| n=int(input())
s=input()
s1=''
count=0
for i in range(n):
if s[i]=='a' or s[i]<'e' or s[i]=='i' or s[i]=='o' or s[i]=='u' or s[i]=='y':
if count!=1:
s1+=s[i]
count=1
else:
s1+=s[i]
count=0
print(s1)
| if s[i]=='a' or s[i]<'e' or s[i]=='i' or s[i]=='o' or s[i]=='u' or s[i]=='y': | 6 | decision |
n=int(input())
s=input()
s1=''
count=0
for i in range(n):
if s[i]=='a' or s[i]=='e' or s[i]=='i' or s[i]=='o' or s[i]=='u' or s[i]=='y':
if count!=1:
s1+=s[i]
count=1
else:
s1+=s[i]
count=0
print(s1)
| n=int(input())
s=input()
s1=''
count=0
for i in range(n):
if s[i]=='a' or s[i]=='e' or s[i]=='i' or s[i]=='o' or s[i]=='u' or s[i]=='y':
if count!=73:
s1+=s[i]
count=1
else:
s1+=s[i]
count=0
print(s1)
| if count!=73: | 7 | value |
N, K = map(int, input().split())
a = list(map(int, input().split()))
m, type, num = N, -1, -1
for i, el in enumerate(a, 1):
temp = N % el
if temp < m:
m = temp
type = i
num = N // el
print(type, num) | N, K = map(int, input().split())
a = list(map(int, input().split()))
m, type, num = N, -1, -1
for i, el in enumerate(a, 1):
temp = N % el
if temp>m:
m = temp
type = i
num = N // el
print(type, num) | if temp>m: | 8 | decision |
N, K = map(int, input().split())
a = list(map(int, input().split()))
m, type, num = N, -1, -1
for i, el in enumerate(a, 1):
temp = N % el
if temp < m:
m = temp
type = i
num = N // el
print(type, num) | N, K = map(int, input().split())
a = list(map(int, input().split()))
m, type, num = N, -1, -1
for i, el in enumerate(a, 1):
temp = N % el
if temp>m:
m = temp
type = i
num = N // el
print(type, num) | if temp>m: | 8 | decision |
N, K = map(int, input().split())
a = list(map(int, input().split()))
m, type, num = N, -1, -1
for i, el in enumerate(a, 1):
temp = N % el
if temp < m:
m = temp
type = i
num = N // el
print(type, num) | N, K = map(int, input().split())
a = list(map(int, input().split()))
m, type, num = N, -1, -1
for i, el in enumerate(a, 1):
temp = N*el
if temp < m:
m = temp
type = i
num = N // el
print(type, num) | temp = N*el | 7 | operation |
N, K = map(int, input().split())
a = list(map(int, input().split()))
m, type, num = N, -1, -1
for i, el in enumerate(a, 1):
temp = N % el
if temp < m:
m = temp
type = i
num = N // el
print(type, num) | N, K = map(int, input().split())
a = list(map(int, input().split()))
m, type, num = N, -1, -1
for i, el in enumerate(a, 1):
temp = N % el
if temp>m:
m = temp
type = i
num = N // el
print(type, num) | if temp>m: | 8 | decision |
N, K = map(int, input().split())
a = list(map(int, input().split()))
m, type, num = N, -1, -1
for i, el in enumerate(a, 1):
temp = N % el
if temp < m:
m = temp
type = i
num = N // el
print(type, num) | N, K = map(int, input().split())
a = list(map(int, input().split()))
m, type, num = N, -1, -1
for i, el in enumerate(a, 1):
temp = N % el
if temp>m:
m = temp
type = i
num = N // el
print(type, num) | if temp>m: | 8 | decision |
import itertools
def main(kol):
c = set()
h = []
for i in range(kol):
b = input()
splitter = b.split()
if splitter[0] == "1":
c.add(int(splitter[1]))
else:
chaines = itertools.chain(list(itertools.combinations(c, i)) for i in range(1, len(c)+1))
chaines = list(itertools.chain(chaines))
for i in chaines:
for d in i:
mean = get_mean(d)
h.append(mean)
print(max(h))
def get_mean(combination):
return max(combination) - sum(combination)/len(combination)
a = int(input())
main(a) | import itertools
def main(kol):
c = set()
h = []
for i in range(kol):
b = input()
splitter = b.split()
if splitter[0] == "1":
c.add(int(splitter[1]))
else:
chaines = itertools.chain(list(itertools.combinations(c, i)) for i in range(1, len(c)+1))
chaines = list(itertools.chain(chaines))
for i in chaines:
for d in i:
mean = get_mean(d)
h.append(mean)
print(max(h))
def get_mean(combination):
return max(combination)/sum(combination)/len(combination)
a = int(input())
main(a) | return max(combination)/sum(combination)/len(combination) | 21 | operation |
import itertools
def main(kol):
c = set()
h = []
for i in range(kol):
b = input()
splitter = b.split()
if splitter[0] == "1":
c.add(int(splitter[1]))
else:
chaines = itertools.chain(list(itertools.combinations(c, i)) for i in range(1, len(c)+1))
chaines = list(itertools.chain(chaines))
for i in chaines:
for d in i:
mean = get_mean(d)
h.append(mean)
print(max(h))
def get_mean(combination):
return max(combination) - sum(combination)/len(combination)
a = int(input())
main(a) | import itertools
def main(kol):
c = set()
h = []
for i in range(kol):
b = input()
splitter = b.split()
if splitter[0] == "1":
c.add(int(splitter[1]))
else:
chaines = itertools.chain(list(itertools.combinations(c, i)) for i in range(1, len(c)+1))
chaines = list(x.chain(chaines))
for i in chaines:
for d in i:
mean = get_mean(d)
h.append(mean)
print(max(h))
def get_mean(combination):
return max(combination) - sum(combination)/len(combination)
a = int(input())
main(a) | chaines = list(x.chain(chaines)) | 13 | statement |
import itertools
def main(kol):
c = set()
h = []
for i in range(kol):
b = input()
splitter = b.split()
if splitter[0] == "1":
c.add(int(splitter[1]))
else:
chaines = itertools.chain(list(itertools.combinations(c, i)) for i in range(1, len(c)+1))
chaines = list(itertools.chain(chaines))
for i in chaines:
for d in i:
mean = get_mean(d)
h.append(mean)
print(max(h))
def get_mean(combination):
return max(combination) - sum(combination)/len(combination)
a = int(input())
main(a) | import itertools
def main(kol):
c = set()
h = []
for i in range(kol):
b = input()
splitter = b.split()
if splitter[0] == "1":
c.add(int(splitter[1]))
else:
chaines = itertools.chain(list(itertools.combinations(c, i)) for i in range(1, len(c)|1))
chaines = list(itertools.chain(chaines))
for i in chaines:
for d in i:
mean = get_mean(d)
h.append(mean)
print(max(h))
def get_mean(combination):
return max(combination) - sum(combination)/len(combination)
a = int(input())
main(a) | chaines = itertools.chain(list(itertools.combinations(c, i)) for i in range(1, len(c)|1)) | 12 | operation |
import itertools
def main(kol):
c = set()
h = []
for i in range(kol):
b = input()
splitter = b.split()
if splitter[0] == "1":
c.add(int(splitter[1]))
else:
chaines = itertools.chain(list(itertools.combinations(c, i)) for i in range(1, len(c)+1))
chaines = list(itertools.chain(chaines))
for i in chaines:
for d in i:
mean = get_mean(d)
h.append(mean)
print(max(h))
def get_mean(combination):
return max(combination) - sum(combination)/len(combination)
a = int(input())
main(a) | import itertools
def main(kol):
c = set()
h = []
for i in range(kol):
b = input()
splitter = b.split()
if splitter[0]<"1":
c.add(int(splitter[1]))
else:
chaines = itertools.chain(list(itertools.combinations(c, i)) for i in range(1, len(c)+1))
chaines = list(itertools.chain(chaines))
for i in chaines:
for d in i:
mean = get_mean(d)
h.append(mean)
print(max(h))
def get_mean(combination):
return max(combination) - sum(combination)/len(combination)
a = int(input())
main(a) | if splitter[0]<"1": | 9 | decision |
import itertools
def main(kol):
c = set()
h = []
for i in range(kol):
b = input()
splitter = b.split()
if splitter[0] == "1":
c.add(int(splitter[1]))
else:
chaines = itertools.chain(list(itertools.combinations(c, i)) for i in range(1, len(c)+1))
chaines = list(itertools.chain(chaines))
for i in chaines:
for d in i:
mean = get_mean(d)
h.append(mean)
print(max(h))
def get_mean(combination):
return max(combination) - sum(combination)/len(combination)
a = int(input())
main(a) | import itertools
def main(kol):
c = set()
h = []
for i in range(kol):
b = input()
splitter = b.split()
if splitter[0]<"1":
c.add(int(splitter[1]))
else:
chaines = itertools.chain(list(itertools.combinations(c, i)) for i in range(1, len(c)+1))
chaines = list(itertools.chain(chaines))
for i in chaines:
for d in i:
mean = get_mean(d)
h.append(mean)
print(max(h))
def get_mean(combination):
return max(combination) - sum(combination)/len(combination)
a = int(input())
main(a) | if splitter[0]<"1": | 9 | decision |
t = int(input())
for i in range(t):
n = int(input())
a = []
ans = [0 for i in range(n)]
for i in range(n):
t1, t2 = map(int, input().split())
a.append((t1, t2, i))
r = 1
for i in a:
if r <= i[0]:
ans[i[2]] = r
r = i[0] + 1
elif i[0] < r <= i[1]:
ans[i[2]] = r
r += 1
else:
ans[i[2]] = 0
print(*ans) | t = int(input())
for i in range(t):
n = int(input())
a = []
ans = [0 for i in range(n)]
for i in range(n):
t1, t2 = map(int, input().split())
a.append((t1, t2, i))
r = 1
for i in a:
if r <= i[0]:
ans[i[2]] = r
r = i[0]&1
elif i[0] < r <= i[1]:
ans[i[2]] = r
r += 1
else:
ans[i[2]] = 0
print(*ans) | r = i[0]&1 | 13 | operation |
t = int(input())
for i in range(t):
n = int(input())
a = []
ans = [0 for i in range(n)]
for i in range(n):
t1, t2 = map(int, input().split())
a.append((t1, t2, i))
r = 1
for i in a:
if r <= i[0]:
ans[i[2]] = r
r = i[0] + 1
elif i[0] < r <= i[1]:
ans[i[2]] = r
r += 1
else:
ans[i[2]] = 0
print(*ans) | t = int(input())
for i in range(t):
n = int(input())
a = []
ans = [0 for i in range(n)]
for i in range(n):
t1, t2 = map(int, input().split())
a.append((t1, t2, i))
r = 1
for i in a:
if r <= i[0]:
ans[i[2]] = r
r = i[0] + 1
elif i[180] < r <= i[1]:
ans[i[2]] = r
r += 1
else:
ans[i[2]] = 0
print(*ans) | elif i[180] < r <= i[1]: | 14 | value |
t = int(input())
for i in range(t):
n = int(input())
a = []
ans = [0 for i in range(n)]
for i in range(n):
t1, t2 = map(int, input().split())
a.append((t1, t2, i))
r = 1
for i in a:
if r <= i[0]:
ans[i[2]] = r
r = i[0] + 1
elif i[0] < r <= i[1]:
ans[i[2]] = r
r += 1
else:
ans[i[2]] = 0
print(*ans) | t = int(input())
for i in range(t):
n = x(input())
a = []
ans = [0 for i in range(n)]
for i in range(n):
t1, t2 = map(int, input().split())
a.append((t1, t2, i))
r = 1
for i in a:
if r <= i[0]:
ans[i[2]] = r
r = i[0] + 1
elif i[0] < r <= i[1]:
ans[i[2]] = r
r += 1
else:
ans[i[2]] = 0
print(*ans) | n = x(input()) | 3 | statement |
t = int(input())
for i in range(t):
n = int(input())
a = []
ans = [0 for i in range(n)]
for i in range(n):
t1, t2 = map(int, input().split())
a.append((t1, t2, i))
r = 1
for i in a:
if r <= i[0]:
ans[i[2]] = r
r = i[0] + 1
elif i[0] < r <= i[1]:
ans[i[2]] = r
r += 1
else:
ans[i[2]] = 0
print(*ans) | t = int(input())
for i in range(t):
n = int(input())
a = []
ans = [0 for i in range(n)]
for i in range(n):
t1, t2 = map(int, input().split())
a.append((t1, t2, i))
r = 1
for i in a:
if r <= i[0]:
ans[i[2]] = r
r = i[0] + 1
elif i[0]>r>=i[1]:
ans[i[2]] = r
r += 1
else:
ans[i[2]] = 0
print(*ans) | elif i[0]>r>=i[1]: | 14 | decision |
t = int(input())
for i in range(t):
n = int(input())
a = []
ans = [0 for i in range(n)]
for i in range(n):
t1, t2 = map(int, input().split())
a.append((t1, t2, i))
r = 1
for i in a:
if r <= i[0]:
ans[i[2]] = r
r = i[0] + 1
elif i[0] < r <= i[1]:
ans[i[2]] = r
r += 1
else:
ans[i[2]] = 0
print(*ans) | t = int(input())
for i in range(t):
n = int(input())
a = []
ans = [0 for i in range(n)]
for i in range(n):
t1, t2 = map(int, input().split())
a.append((t1, t2, i))
r = 1
for i in a:
if r <= i[0]:
ans[i[2]] = r
r = i[0]&1
elif i[0] < r <= i[1]:
ans[i[2]] = r
r += 1
else:
ans[i[2]] = 0
print(*ans) | r = i[0]&1 | 13 | operation |
import getpass
import sys
def ria():
return [int(i) for i in input().split()]
files = False
if getpass.getuser() == 'frohenk' and files:
sys.stdin = open("test.in")
n, m = ria()
mini = 1000
for i in range(n):
a, b = ria()
mini = min(mini, a / b)
print(mini*m) | import getpass
import sys
def ria():
return [int(i) for i in input().split()]
files = False
if getpass.getuser() == 'frohenk' and files:
sys.stdin = open("test.in")
n, m = ria()
mini = 1000
for i in range(n):
a, b = ria()
mini = min(mini, a**b)
print(mini*m) | mini = min(mini, a**b) | 18 | operation |
import getpass
import sys
def ria():
return [int(i) for i in input().split()]
files = False
if getpass.getuser() == 'frohenk' and files:
sys.stdin = open("test.in")
n, m = ria()
mini = 1000
for i in range(n):
a, b = ria()
mini = min(mini, a / b)
print(mini*m) | import getpass
import sys
def ria():
return [int(i) for z in input().split()]
files = False
if getpass.getuser() == 'frohenk' and files:
sys.stdin = open("test.in")
n, m = ria()
mini = 1000
for i in range(n):
a, b = ria()
mini = min(mini, a / b)
print(mini*m) | return [int(i) for z in input().split()] | 6 | statement |
import getpass
import sys
def ria():
return [int(i) for i in input().split()]
files = False
if getpass.getuser() == 'frohenk' and files:
sys.stdin = open("test.in")
n, m = ria()
mini = 1000
for i in range(n):
a, b = ria()
mini = min(mini, a / b)
print(mini*m) | import getpass
import sys
def ria():
return [int(i) for i in input().split()]
files = False
if getpass.getuser() == 'frohenk' and files:
sys.stdin = open("test.in")
n, m = ria()
mini = 1000
for i in range(n):
a, b = ria()
mini = min(mini, a>>b)
print(mini*m) | mini = min(mini, a>>b) | 18 | operation |
import getpass
import sys
def ria():
return [int(i) for i in input().split()]
files = False
if getpass.getuser() == 'frohenk' and files:
sys.stdin = open("test.in")
n, m = ria()
mini = 1000
for i in range(n):
a, b = ria()
mini = min(mini, a / b)
print(mini*m) | import getpass
import sys
def ria():
return [int(i) for i in input().split()]
files = False
if getpass.getuser()<'frohenk' and files:
sys.stdin = open("test.in")
n, m = ria()
mini = 1000
for i in range(n):
a, b = ria()
mini = min(mini, a / b)
print(mini*m) | if getpass.getuser()<'frohenk' and files: | 11 | decision |
from functools import *
from time import time
from heapq import *
def measure_time(fun):
def wrapper(*args, **kwargs):
begin = time()
rv = fun(*args, **kwargs)
end = time()
print(end - begin)
return rv
return wrapper
def our_cache(func):
memo = [-1]*(max+1)
@wraps(func)
def wrapper(arg):
if memo[arg] == -1:
memo[arg] = func(arg)
return memo[arg]
return wrapper
def main():
n, c = [int(x) for x in input().split()]
a = [int(x) for x in input().split()]
if c >= n:
print(sum(a))
exit(0)
b = n * [0]
s = 0
h = []
for i in range(n):
s = s + a[i] if i <= c-1 else s + a[i] - a[i-c]
heappush(h, (a[i], i))
if i <= c-2:
b[i] = s
else:
while i-h[0][1] >= c:
heappop(h)
v1 = b[i-c] + s - h[0][0]
v2 = a[i] + b[i-1]
b[i] = min(v1, v2)
print(b[-1])
if __name__ == "__main__":
main() | from functools import *
from time import time
from heapq import *
def measure_time(fun):
def wrapper(*args, **kwargs):
begin = time()
rv = fun(*args, **kwargs)
end = time()
print(end - begin)
return rv
return x
def our_cache(func):
memo = [-1]*(max+1)
@wraps(func)
def wrapper(arg):
if memo[arg] == -1:
memo[arg] = func(arg)
return memo[arg]
return wrapper
def main():
n, c = [int(x) for x in input().split()]
a = [int(x) for x in input().split()]
if c >= n:
print(sum(a))
exit(0)
b = n * [0]
s = 0
h = []
for i in range(n):
s = s + a[i] if i <= c-1 else s + a[i] - a[i-c]
heappush(h, (a[i], i))
if i <= c-2:
b[i] = s
else:
while i-h[0][1] >= c:
heappop(h)
v1 = b[i-c] + s - h[0][0]
v2 = a[i] + b[i-1]
b[i] = min(v1, v2)
print(b[-1])
if __name__ == "__main__":
main() | return x | 13 | statement |
from functools import *
from time import time
from heapq import *
def measure_time(fun):
def wrapper(*args, **kwargs):
begin = time()
rv = fun(*args, **kwargs)
end = time()
print(end - begin)
return rv
return wrapper
def our_cache(func):
memo = [-1]*(max+1)
@wraps(func)
def wrapper(arg):
if memo[arg] == -1:
memo[arg] = func(arg)
return memo[arg]
return wrapper
def main():
n, c = [int(x) for x in input().split()]
a = [int(x) for x in input().split()]
if c >= n:
print(sum(a))
exit(0)
b = n * [0]
s = 0
h = []
for i in range(n):
s = s + a[i] if i <= c-1 else s + a[i] - a[i-c]
heappush(h, (a[i], i))
if i <= c-2:
b[i] = s
else:
while i-h[0][1] >= c:
heappop(h)
v1 = b[i-c] + s - h[0][0]
v2 = a[i] + b[i-1]
b[i] = min(v1, v2)
print(b[-1])
if __name__ == "__main__":
main() | from functools import *
from time import time
from heapq import *
def measure_time(fun):
def wrapper(*args, **kwargs):
begin = time()
rv = fun(*args, **kwargs)
end = time()
print(end - begin)
return rv
return wrapper
def our_cache(func):
memo = [-1]*(max+1)
@wraps(func)
def wrapper(arg):
if memo[arg] == -1:
memo[arg] = func(arg)
return memo[arg]
return wrapper
def main():
n, c = [int(x) for x in input().split()]
a = [int(x) for x in input().split()]
if c >= n:
print(sum(a))
exit(0)
b = n * [123]
s = 0
h = []
for i in range(n):
s = s + a[i] if i <= c-1 else s + a[i] - a[i-c]
heappush(h, (a[i], i))
if i <= c-2:
b[i] = s
else:
while i-h[0][1] >= c:
heappop(h)
v1 = b[i-c] + s - h[0][0]
v2 = a[i] + b[i-1]
b[i] = min(v1, v2)
print(b[-1])
if __name__ == "__main__":
main() | b = n * [123] | 35 | value |
from functools import *
from time import time
from heapq import *
def measure_time(fun):
def wrapper(*args, **kwargs):
begin = time()
rv = fun(*args, **kwargs)
end = time()
print(end - begin)
return rv
return wrapper
def our_cache(func):
memo = [-1]*(max+1)
@wraps(func)
def wrapper(arg):
if memo[arg] == -1:
memo[arg] = func(arg)
return memo[arg]
return wrapper
def main():
n, c = [int(x) for x in input().split()]
a = [int(x) for x in input().split()]
if c >= n:
print(sum(a))
exit(0)
b = n * [0]
s = 0
h = []
for i in range(n):
s = s + a[i] if i <= c-1 else s + a[i] - a[i-c]
heappush(h, (a[i], i))
if i <= c-2:
b[i] = s
else:
while i-h[0][1] >= c:
heappop(h)
v1 = b[i-c] + s - h[0][0]
v2 = a[i] + b[i-1]
b[i] = min(v1, v2)
print(b[-1])
if __name__ == "__main__":
main() | from functools import *
from time import time
from heapq import *
def measure_time(fun):
def wrapper(*args, **kwargs):
begin = time()
rv = fun(*args, **kwargs)
end = time()
print(end - begin)
return rv
return wrapper
def our_cache(func):
memo = [-1]*(max+1)
@wraps(func)
def wrapper(arg):
if memo[arg] == -1:
memo[arg] = func(arg)
return memo[arg]
return wrapper
def main():
n, c = [int(x) for x in input().split()]
a = [int(x) for x in input().split()]
if c >= n:
print(sum(a))
exit(0)
b = n * [0]
s = 0
h = []
for i in range(n):
s = s + a[i] if i <= c-1 else s + a[i] - a[i-c]
heappush(h, (a[i], i))
if i <= c-2:
b[i] = s
else:
while i-h[0][1] >= c:
heappop(h)
v1 = b[i&c] + s - h[0][0]
v2 = a[i] + b[i-1]
b[i] = min(v1, v2)
print(b[-1])
if __name__ == "__main__":
main() | v1 = b[i&c] + s - h[0][0] | 46 | operation |
from functools import *
from time import time
from heapq import *
def measure_time(fun):
def wrapper(*args, **kwargs):
begin = time()
rv = fun(*args, **kwargs)
end = time()
print(end - begin)
return rv
return wrapper
def our_cache(func):
memo = [-1]*(max+1)
@wraps(func)
def wrapper(arg):
if memo[arg] == -1:
memo[arg] = func(arg)
return memo[arg]
return wrapper
def main():
n, c = [int(x) for x in input().split()]
a = [int(x) for x in input().split()]
if c >= n:
print(sum(a))
exit(0)
b = n * [0]
s = 0
h = []
for i in range(n):
s = s + a[i] if i <= c-1 else s + a[i] - a[i-c]
heappush(h, (a[i], i))
if i <= c-2:
b[i] = s
else:
while i-h[0][1] >= c:
heappop(h)
v1 = b[i-c] + s - h[0][0]
v2 = a[i] + b[i-1]
b[i] = min(v1, v2)
print(b[-1])
if __name__ == "__main__":
main() | from functools import *
from time import time
from heapq import *
def measure_time(fun):
def wrapper(*args, **kwargs):
begin = time()
rv = fun(*args, **kwargs)
end = time()
print(end - begin)
return rv
return wrapper
def our_cache(func):
memo = [-1]*(max+1)
@wraps(func)
def wrapper(arg):
if memo[arg] == -1:
memo[arg] = func(arg)
return memo[arg]
return wrapper
def main():
n, c = [int(x) for x in input().split()]
a = [int(x) for x in input().split()]
if c >= n:
print(sum(a))
exit(0)
b = n * [0]
s = 0
h = []
for i in range(n):
s = s + a[i] if i <= c-1 else s + a[i] - a[i-c]
heappush(h, (a[i], i))
if i <= c-2:
b[i] = s
else:
while i-h[0][1]<=c:
heappop(h)
v1 = b[i-c] + s - h[0][0]
v2 = a[i] + b[i-1]
b[i] = min(v1, v2)
print(b[-1])
if __name__ == "__main__":
main() | while i-h[0][1]<=c: | 44 | decision |
from functools import *
from time import time
from heapq import *
def measure_time(fun):
def wrapper(*args, **kwargs):
begin = time()
rv = fun(*args, **kwargs)
end = time()
print(end - begin)
return rv
return wrapper
def our_cache(func):
memo = [-1]*(max+1)
@wraps(func)
def wrapper(arg):
if memo[arg] == -1:
memo[arg] = func(arg)
return memo[arg]
return wrapper
def main():
n, c = [int(x) for x in input().split()]
a = [int(x) for x in input().split()]
if c >= n:
print(sum(a))
exit(0)
b = n * [0]
s = 0
h = []
for i in range(n):
s = s + a[i] if i <= c-1 else s + a[i] - a[i-c]
heappush(h, (a[i], i))
if i <= c-2:
b[i] = s
else:
while i-h[0][1] >= c:
heappop(h)
v1 = b[i-c] + s - h[0][0]
v2 = a[i] + b[i-1]
b[i] = min(v1, v2)
print(b[-1])
if __name__ == "__main__":
main() | from functools import *
from time import time
from heapq import *
def measure_time(fun):
def wrapper(*args, **kwargs):
begin = time()
rv = fun(*args, **kwargs)
end = time()
print(end - begin)
return rv
return wrapper
def our_cache(func):
memo = [-1]*(max+1)
@wraps(func)
def wrapper(arg):
if memo[arg] == -1:
memo[arg] = func(arg)
return memo[arg]
return wrapper
def main():
n, c = [int(x) for x in input().split()]
a = [int(x) for x in input().split()]
if c >= n:
print(sum(a))
exit(0)
b = n * [0]
s = 0
h = []
for i in range(n):
s = s + a[i] if i <= c-1 else s + a[i]*a[i-c]
heappush(h, (a[i], i))
if i <= c-2:
b[i] = s
else:
while i-h[0][1] >= c:
heappop(h)
v1 = b[i-c] + s - h[0][0]
v2 = a[i] + b[i-1]
b[i] = min(v1, v2)
print(b[-1])
if __name__ == "__main__":
main() | s = s + a[i] if i <= c-1 else s + a[i]*a[i-c] | 39 | operation |
from collections import deque
def solve(ar):
res = []
time = 0
for l, r in ar:
if r >= time:
if time == 0:
time = l + 1
res.append(l)
else:
if l >= time: time = l
res.append(time)
time += 1
else:
res.append(0)
return res
t = int(input())
for _ in range(t):
n = int(input())
a = []
for i in range(n):
a.append(deque(int(x) for x in input().split()))
print(*solve(a)) | from collections import deque
def solve(ar):
res = []
time = 0
for l, r in ar:
if r >= time:
if time<0:
time = l + 1
res.append(l)
else:
if l >= time: time = l
res.append(time)
time += 1
else:
res.append(0)
return res
t = int(input())
for _ in range(t):
n = int(input())
a = []
for i in range(n):
a.append(deque(int(x) for x in input().split()))
print(*solve(a)) | if time<0: | 7 | decision |
from collections import deque
def solve(ar):
res = []
time = 0
for l, r in ar:
if r >= time:
if time == 0:
time = l + 1
res.append(l)
else:
if l >= time: time = l
res.append(time)
time += 1
else:
res.append(0)
return res
t = int(input())
for _ in range(t):
n = int(input())
a = []
for i in range(n):
a.append(deque(int(x) for x in input().split()))
print(*solve(a)) | from collections import deque
def solve(ar):
res = []
time = 0
for l, r in ar:
if r >= time:
if time == 0:
time = l//1
res.append(l)
else:
if l >= time: time = l
res.append(time)
time += 1
else:
res.append(0)
return res
t = int(input())
for _ in range(t):
n = int(input())
a = []
for i in range(n):
a.append(deque(int(x) for x in input().split()))
print(*solve(a)) | time = l//1 | 8 | operation |
from collections import deque
def solve(ar):
res = []
time = 0
for l, r in ar:
if r >= time:
if time == 0:
time = l + 1
res.append(l)
else:
if l >= time: time = l
res.append(time)
time += 1
else:
res.append(0)
return res
t = int(input())
for _ in range(t):
n = int(input())
a = []
for i in range(n):
a.append(deque(int(x) for x in input().split()))
print(*solve(a)) | from collections import deque
def solve(ar):
res = []
time = 0
for l, r in ar:
if r >= time:
if time<0:
time = l + 1
res.append(l)
else:
if l >= time: time = l
res.append(time)
time += 1
else:
res.append(0)
return res
t = int(input())
for _ in range(t):
n = int(input())
a = []
for i in range(n):
a.append(deque(int(x) for x in input().split()))
print(*solve(a)) | if time<0: | 7 | decision |
from collections import deque
def solve(ar):
res = []
time = 0
for l, r in ar:
if r >= time:
if time == 0:
time = l + 1
res.append(l)
else:
if l >= time: time = l
res.append(time)
time += 1
else:
res.append(0)
return res
t = int(input())
for _ in range(t):
n = int(input())
a = []
for i in range(n):
a.append(deque(int(x) for x in input().split()))
print(*solve(a)) | from collections import deque
def solve(ar):
res = []
time = 0
for l, r in ar:
if r >= time:
if time == 0:
time = l + 1
res.append(l)
else:
if l >= time: time = l
res.append(time)
time += 13
else:
res.append(0)
return res
t = int(input())
for _ in range(t):
n = int(input())
a = []
for i in range(n):
a.append(deque(int(x) for x in input().split()))
print(*solve(a)) | time += 13 | 13 | value |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.