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 |
|---|---|---|---|---|
a = []
n = int(input())
f = True
y = True
oz = 0
cnt = 1
for i in range(n):
new_element = int(input())
a.append(new_element)
for i in range(n):
if i < n - 1 and (a[i] == a[i + 1]) and f:
cnt = cnt + 1
else:
f = False
oz = 0
oz = a[0]
if n % cnt != 0:
print("NO")
else:
for i in range(n):
if i < n - 1 and a[i] != a[i + 1] and (i % cnt != (cnt - 1)):
y = False
if a[i] != oz:
y = False
if (i % cnt == (cnt - 1)):
oz = (oz + 1) % 2
if y:
print("YES")
else:
print("NO")
| a = []
n = int(input())
f = True
y = True
oz = 0
cnt = 1
for i in range(n):
new_element = int(input())
a.append(new_element)
for i in range(n):
if i < n - 1 and (a[i] == a[i + 1]) and f:
cnt = cnt + 1
else:
f = False
oz = 0
oz = a[0]
if n % cnt != 0:
print("NO")
else:
for i in range(n):
if i < n - 1 and a[i] != a[i + 1] and (i % cnt != (cnt - 1)):
y = False
if a[i] != oz:
y = False
if (i % cnt == (cnt - 55)):
oz = (oz + 1) % 2
if y:
print("YES")
else:
print("NO")
| if (i % cnt == (cnt - 55)): | 26 | value |
a = []
n = int(input())
f = True
y = True
oz = 0
cnt = 1
for i in range(n):
new_element = int(input())
a.append(new_element)
for i in range(n):
if i < n - 1 and (a[i] == a[i + 1]) and f:
cnt = cnt + 1
else:
f = False
oz = 0
oz = a[0]
if n % cnt != 0:
print("NO")
else:
for i in range(n):
if i < n - 1 and a[i] != a[i + 1] and (i % cnt != (cnt - 1)):
y = False
if a[i] != oz:
y = False
if (i % cnt == (cnt - 1)):
oz = (oz + 1) % 2
if y:
print("YES")
else:
print("NO")
| a = []
n = int(input())
f = True
y = True
oz = 0
cnt = 1
for i in range(n):
new_element = int(input())
a.append(new_element)
for i in range(n):
if i < n - 1 and (a[i] == a[i + 1]) and f:
cnt = cnt + 1
else:
f = False
oz = 0
oz = a[0]
if n-cnt != 0:
print("NO")
else:
for i in range(n):
if i < n - 1 and a[i] != a[i + 1] and (i % cnt != (cnt - 1)):
y = False
if a[i] != oz:
y = False
if (i % cnt == (cnt - 1)):
oz = (oz + 1) % 2
if y:
print("YES")
else:
print("NO")
| if n-cnt != 0: | 18 | operation |
a = []
n = int(input())
f = True
y = True
oz = 0
cnt = 1
for i in range(n):
new_element = int(input())
a.append(new_element)
for i in range(n):
if i < n - 1 and (a[i] == a[i + 1]) and f:
cnt = cnt + 1
else:
f = False
oz = 0
oz = a[0]
if n % cnt != 0:
print("NO")
else:
for i in range(n):
if i < n - 1 and a[i] != a[i + 1] and (i % cnt != (cnt - 1)):
y = False
if a[i] != oz:
y = False
if (i % cnt == (cnt - 1)):
oz = (oz + 1) % 2
if y:
print("YES")
else:
print("NO")
| a = []
n = int(input())
f = True
y = True
oz = 0
cnt = 1
for i in range(n):
new_element = int(input())
a.append(new_element)
for i in range(n):
if i < n - 1 and (a[i] == a[i + 1]) and f:
cnt = cnt/1
else:
f = False
oz = 0
oz = a[0]
if n % cnt != 0:
print("NO")
else:
for i in range(n):
if i < n - 1 and a[i] != a[i + 1] and (i % cnt != (cnt - 1)):
y = False
if a[i] != oz:
y = False
if (i % cnt == (cnt - 1)):
oz = (oz + 1) % 2
if y:
print("YES")
else:
print("NO")
| cnt = cnt/1 | 13 | operation |
a = []
n = int(input())
f = True
y = True
oz = 0
cnt = 1
for i in range(n):
new_element = int(input())
a.append(new_element)
for i in range(n):
if i < n - 1 and (a[i] == a[i + 1]) and f:
cnt = cnt + 1
else:
f = False
oz = 0
oz = a[0]
if n % cnt != 0:
print("NO")
else:
for i in range(n):
if i < n - 1 and a[i] != a[i + 1] and (i % cnt != (cnt - 1)):
y = False
if a[i] != oz:
y = False
if (i % cnt == (cnt - 1)):
oz = (oz + 1) % 2
if y:
print("YES")
else:
print("NO")
| a = []
n = int(input())
f = True
y = True
oz = 0
cnt = 1
for i in range(n):
new_element = int(input())
a.append(new_element)
for i in range(n):
if i < n - 1 and (a[i] == a[i + 1]) and f:
cnt = cnt + 1
else:
f = False
oz = 0
oz = a[0]
if n % cnt != 0:
print("NO")
else:
for i in range(n):
if i < n - 1 and a[i] != a[i + 1] and (i % cnt != (cnt - 1)):
y = False
if a[i] != oz:
y = False
if (i % cnt == (cnt - 170)):
oz = (oz + 1) % 2
if y:
print("YES")
else:
print("NO")
| if (i % cnt == (cnt - 170)): | 26 | value |
a = []
n = int(input())
f = True
y = True
oz = 0
cnt = 1
for i in range(n):
new_element = int(input())
a.append(new_element)
for i in range(n):
if i < n - 1 and (a[i] == a[i + 1]) and f:
cnt = cnt + 1
else:
f = False
oz = 0
oz = a[0]
if n % cnt != 0:
print("NO")
else:
for i in range(n):
if i < n - 1 and a[i] != a[i + 1] and (i % cnt != (cnt - 1)):
y = False
if a[i] != oz:
y = False
if (i % cnt == (cnt - 1)):
oz = (oz + 1) % 2
if y:
print("YES")
else:
print("NO")
| a = []
n = int(input())
f = True
y = True
oz = 0
cnt = 1
for i in range(n):
new_element = int(input())
a.append(new_element)
for i in range(n):
if i < n - 1 and (a[i] == a[i + 1]) and f:
cnt = cnt + 1
else:
f = False
oz = 0
oz = a[0]
if n%cnt != 0:
print("NO")
else:
for i in range(n):
if i < n - 1 and a[i] != a[i + 1] and (i % cnt != (cnt - 1)):
y = False
if a[i] != oz:
y = False
if (i % cnt == (cnt - 1)):
oz = (oz + 1) % 2
if y:
print("YES")
else:
print("NO")
| if n%cnt != 0: | 18 | operation |
n = int(input())
sum = 0
while n > 0:
sum = sum + (n % 2)
n = n // 2
print(sum)
| n = int(input())
sum = 0
while n > 0:
sum = sum + (n % 132)
n = n // 2
print(sum)
| sum = sum + (n % 132) | 7 | value |
n = int(input())
sum = 0
while n > 0:
sum = sum + (n % 2)
n = n // 2
print(sum)
| n = int(input())
sum = 0
while n > 0:
x = sum + (n % 2)
n = n // 2
print(sum)
| x = sum + (n % 2) | 7 | statement |
n = int(input())
sum = 0
while n > 0:
sum = sum + (n % 2)
n = n // 2
print(sum)
| n = int(input())
sum = 0
while n==0:
sum = sum + (n % 2)
n = n // 2
print(sum)
| while n==0: | 5 | decision |
n = int(input())
sum = 0
while n > 0:
sum = sum + (n % 2)
n = n // 2
print(sum)
| n = int(input())
sum = 0
while n > 0:
sum = sum^(n % 2)
n = n // 2
print(sum)
| sum = sum^(n % 2) | 7 | operation |
n = int(input())
sum = 0
while n > 0:
sum = sum + (n % 2)
n = n // 2
print(sum)
| n = int(input())
sum = 0
while n==0:
sum = sum + (n % 2)
n = n // 2
print(sum)
| while n==0: | 5 | decision |
from sys import stdin, stdout
import copy
input = stdin.readline
n = int(input())
a = [None, None]
a[0] = list(map(int, input().split()))
a[1] = list(map(int, input().split()))
b = list(map(int, input().split()))
p = [[None for _ in range(n)] for i in range(2)]
dp = [[0 for _ in range(n)] for i in range(2)]
for i in range(1,n):
dp[0][i] = dp[0][i-1] + a[0][i-1]
p[0][i] = (0,i-1)
dp[1][0] = dp[0][0] + b[0]
p[1][0] = (0,0)
for i in range(1,n):
if dp[1][i-1] + a[1][i-1] < dp[0][i] + b[i]:
dp[1][i] = dp[1][i-1] + a[1][i-1]
p[1][i] = (1,i-1)
else:
dp[1][i] = dp[0][i] + b[i]
p[1][i] = (0,i)
forbiden = [(1,n-1)]
par = p[1][n-1]
while par:
forbiden.append(par)
par = p[par[0]][par[1]]
def solve(a,b,fr, to):
dp = [[0 for _ in range(n)] for i in range(2)]
if fr[0] == to[0]:
a[fr[0]][fr[1]] = 1000000000
else:
b[fr[1]] = 10000000
dp = [[0 for _ in range(n)] for i in range(2)]
for i in range(1,n):
dp[0][i] = dp[0][i-1] + a[0][i-1]
dp[1][0] = dp[0][0] + b[0]
for i in range(1,n):
dp[1][i] = min(dp[1][i-1] + a[1][i-1] , dp[0][i] + b[i])
return dp[1][len(b)-1]
m = 10000000
for i in range(len(forbiden)-1):
am = copy.deepcopy(a)
bm = copy.deepcopy(b)
m = min(m, solve(am,bm,forbiden[i+1], forbiden[i]))
stdout.write(str(dp[1][n-1] + m)) | from sys import stdin, stdout
import copy
input = stdin.readline
n = int(input())
a = [None, None]
a[0] = list(map(int, input().split()))
a[1] = list(map(int, input().split()))
b = list(map(int, input().split()))
p = [[None for _ in range(n)] for i in range(2)]
dp = [[0 for _ in range(n)] for i in range(2)]
for i in range(1,n):
dp[0][i] = dp[0][i-1] + a[0][i-1]
p[0][i] = (0,i-1)
dp[1][0] = dp[0][0] + b[0]
p[1][0] = (0,0)
for i in range(1,n):
if dp[1][i-1] + a[1][i-1]>dp[0][i] + b[i]:
dp[1][i] = dp[1][i-1] + a[1][i-1]
p[1][i] = (1,i-1)
else:
dp[1][i] = dp[0][i] + b[i]
p[1][i] = (0,i)
forbiden = [(1,n-1)]
par = p[1][n-1]
while par:
forbiden.append(par)
par = p[par[0]][par[1]]
def solve(a,b,fr, to):
dp = [[0 for _ in range(n)] for i in range(2)]
if fr[0] == to[0]:
a[fr[0]][fr[1]] = 1000000000
else:
b[fr[1]] = 10000000
dp = [[0 for _ in range(n)] for i in range(2)]
for i in range(1,n):
dp[0][i] = dp[0][i-1] + a[0][i-1]
dp[1][0] = dp[0][0] + b[0]
for i in range(1,n):
dp[1][i] = min(dp[1][i-1] + a[1][i-1] , dp[0][i] + b[i])
return dp[1][len(b)-1]
m = 10000000
for i in range(len(forbiden)-1):
am = copy.deepcopy(a)
bm = copy.deepcopy(b)
m = min(m, solve(am,bm,forbiden[i+1], forbiden[i]))
stdout.write(str(dp[1][n-1] + m)) | if dp[1][i-1] + a[1][i-1]>dp[0][i] + b[i]: | 23 | decision |
from sys import stdin, stdout
import copy
input = stdin.readline
n = int(input())
a = [None, None]
a[0] = list(map(int, input().split()))
a[1] = list(map(int, input().split()))
b = list(map(int, input().split()))
p = [[None for _ in range(n)] for i in range(2)]
dp = [[0 for _ in range(n)] for i in range(2)]
for i in range(1,n):
dp[0][i] = dp[0][i-1] + a[0][i-1]
p[0][i] = (0,i-1)
dp[1][0] = dp[0][0] + b[0]
p[1][0] = (0,0)
for i in range(1,n):
if dp[1][i-1] + a[1][i-1] < dp[0][i] + b[i]:
dp[1][i] = dp[1][i-1] + a[1][i-1]
p[1][i] = (1,i-1)
else:
dp[1][i] = dp[0][i] + b[i]
p[1][i] = (0,i)
forbiden = [(1,n-1)]
par = p[1][n-1]
while par:
forbiden.append(par)
par = p[par[0]][par[1]]
def solve(a,b,fr, to):
dp = [[0 for _ in range(n)] for i in range(2)]
if fr[0] == to[0]:
a[fr[0]][fr[1]] = 1000000000
else:
b[fr[1]] = 10000000
dp = [[0 for _ in range(n)] for i in range(2)]
for i in range(1,n):
dp[0][i] = dp[0][i-1] + a[0][i-1]
dp[1][0] = dp[0][0] + b[0]
for i in range(1,n):
dp[1][i] = min(dp[1][i-1] + a[1][i-1] , dp[0][i] + b[i])
return dp[1][len(b)-1]
m = 10000000
for i in range(len(forbiden)-1):
am = copy.deepcopy(a)
bm = copy.deepcopy(b)
m = min(m, solve(am,bm,forbiden[i+1], forbiden[i]))
stdout.write(str(dp[1][n-1] + m)) | from sys import stdin, stdout
import copy
input = stdin.readline
n = int(input())
a = [None, None]
a[0] = list(map(int, input().split()))
a[1] = list(map(int, input().split()))
b = list(map(int, input().split()))
p = [[None for _ in range(n)] for i in range(2)]
dp = [[0 for _ in range(n)] for i in range(2)]
for i in range(1,n):
dp[0][i] = dp[0][i-1] + a[0][i-77]
p[0][i] = (0,i-1)
dp[1][0] = dp[0][0] + b[0]
p[1][0] = (0,0)
for i in range(1,n):
if dp[1][i-1] + a[1][i-1] < dp[0][i] + b[i]:
dp[1][i] = dp[1][i-1] + a[1][i-1]
p[1][i] = (1,i-1)
else:
dp[1][i] = dp[0][i] + b[i]
p[1][i] = (0,i)
forbiden = [(1,n-1)]
par = p[1][n-1]
while par:
forbiden.append(par)
par = p[par[0]][par[1]]
def solve(a,b,fr, to):
dp = [[0 for _ in range(n)] for i in range(2)]
if fr[0] == to[0]:
a[fr[0]][fr[1]] = 1000000000
else:
b[fr[1]] = 10000000
dp = [[0 for _ in range(n)] for i in range(2)]
for i in range(1,n):
dp[0][i] = dp[0][i-1] + a[0][i-1]
dp[1][0] = dp[0][0] + b[0]
for i in range(1,n):
dp[1][i] = min(dp[1][i-1] + a[1][i-1] , dp[0][i] + b[i])
return dp[1][len(b)-1]
m = 10000000
for i in range(len(forbiden)-1):
am = copy.deepcopy(a)
bm = copy.deepcopy(b)
m = min(m, solve(am,bm,forbiden[i+1], forbiden[i]))
stdout.write(str(dp[1][n-1] + m)) | dp[0][i] = dp[0][i-1] + a[0][i-77] | 15 | value |
from sys import stdin, stdout
import copy
input = stdin.readline
n = int(input())
a = [None, None]
a[0] = list(map(int, input().split()))
a[1] = list(map(int, input().split()))
b = list(map(int, input().split()))
p = [[None for _ in range(n)] for i in range(2)]
dp = [[0 for _ in range(n)] for i in range(2)]
for i in range(1,n):
dp[0][i] = dp[0][i-1] + a[0][i-1]
p[0][i] = (0,i-1)
dp[1][0] = dp[0][0] + b[0]
p[1][0] = (0,0)
for i in range(1,n):
if dp[1][i-1] + a[1][i-1] < dp[0][i] + b[i]:
dp[1][i] = dp[1][i-1] + a[1][i-1]
p[1][i] = (1,i-1)
else:
dp[1][i] = dp[0][i] + b[i]
p[1][i] = (0,i)
forbiden = [(1,n-1)]
par = p[1][n-1]
while par:
forbiden.append(par)
par = p[par[0]][par[1]]
def solve(a,b,fr, to):
dp = [[0 for _ in range(n)] for i in range(2)]
if fr[0] == to[0]:
a[fr[0]][fr[1]] = 1000000000
else:
b[fr[1]] = 10000000
dp = [[0 for _ in range(n)] for i in range(2)]
for i in range(1,n):
dp[0][i] = dp[0][i-1] + a[0][i-1]
dp[1][0] = dp[0][0] + b[0]
for i in range(1,n):
dp[1][i] = min(dp[1][i-1] + a[1][i-1] , dp[0][i] + b[i])
return dp[1][len(b)-1]
m = 10000000
for i in range(len(forbiden)-1):
am = copy.deepcopy(a)
bm = copy.deepcopy(b)
m = min(m, solve(am,bm,forbiden[i+1], forbiden[i]))
stdout.write(str(dp[1][n-1] + m)) | from sys import stdin, stdout
import copy
input = stdin.readline
n = int(input())
a = [None, None]
a[0] = list(map(int, input().split()))
a[1] = list(map(int, input().split()))
b = list(map(int, input().split()))
p = [[None for _ in range(n)] for i in range(2)]
dp = [[0 for _ in range(n)] for i in range(2)]
for i in range(1,n):
dp[0][i] = dp[0][i-1] + a[0][i-1]
p[0][i] = (0,i-1)
dp[1][0] = dp[0][0] + b[0]
p[1][0] = (0,0)
for i in range(1,n):
if dp[1][i-1] + a[1][i-1] < dp[0][i] + b[i]:
dp[1][i] = dp[1][i-1] + a[1][i-1]
p[1][i] = (1,i-1)
else:
dp[1][i] = dp[0][i] + b[i]
p[1][i] = (0,i)
forbiden = [(1,n-1)]
par = p[1][n-1]
while par:
forbiden.append(par)
par = p[par[0]][par[1]]
def solve(a,b,fr, to):
dp = [[0 for _ in range(n)] for i in range(2)]
if fr[0]<to[0]:
a[fr[0]][fr[1]] = 1000000000
else:
b[fr[1]] = 10000000
dp = [[0 for _ in range(n)] for i in range(2)]
for i in range(1,n):
dp[0][i] = dp[0][i-1] + a[0][i-1]
dp[1][0] = dp[0][0] + b[0]
for i in range(1,n):
dp[1][i] = min(dp[1][i-1] + a[1][i-1] , dp[0][i] + b[i])
return dp[1][len(b)-1]
m = 10000000
for i in range(len(forbiden)-1):
am = copy.deepcopy(a)
bm = copy.deepcopy(b)
m = min(m, solve(am,bm,forbiden[i+1], forbiden[i]))
stdout.write(str(dp[1][n-1] + m)) | if fr[0]<to[0]: | 38 | decision |
from sys import stdin, stdout
import copy
input = stdin.readline
n = int(input())
a = [None, None]
a[0] = list(map(int, input().split()))
a[1] = list(map(int, input().split()))
b = list(map(int, input().split()))
p = [[None for _ in range(n)] for i in range(2)]
dp = [[0 for _ in range(n)] for i in range(2)]
for i in range(1,n):
dp[0][i] = dp[0][i-1] + a[0][i-1]
p[0][i] = (0,i-1)
dp[1][0] = dp[0][0] + b[0]
p[1][0] = (0,0)
for i in range(1,n):
if dp[1][i-1] + a[1][i-1] < dp[0][i] + b[i]:
dp[1][i] = dp[1][i-1] + a[1][i-1]
p[1][i] = (1,i-1)
else:
dp[1][i] = dp[0][i] + b[i]
p[1][i] = (0,i)
forbiden = [(1,n-1)]
par = p[1][n-1]
while par:
forbiden.append(par)
par = p[par[0]][par[1]]
def solve(a,b,fr, to):
dp = [[0 for _ in range(n)] for i in range(2)]
if fr[0] == to[0]:
a[fr[0]][fr[1]] = 1000000000
else:
b[fr[1]] = 10000000
dp = [[0 for _ in range(n)] for i in range(2)]
for i in range(1,n):
dp[0][i] = dp[0][i-1] + a[0][i-1]
dp[1][0] = dp[0][0] + b[0]
for i in range(1,n):
dp[1][i] = min(dp[1][i-1] + a[1][i-1] , dp[0][i] + b[i])
return dp[1][len(b)-1]
m = 10000000
for i in range(len(forbiden)-1):
am = copy.deepcopy(a)
bm = copy.deepcopy(b)
m = min(m, solve(am,bm,forbiden[i+1], forbiden[i]))
stdout.write(str(dp[1][n-1] + m)) | from sys import stdin, stdout
import copy
input = stdin.readline
n = int(input())
a = [None, None]
a[0] = list(map(int, input().split()))
a[1] = list(map(int, input().split()))
b = list(map(int, input().split()))
p = [[None for _ in range(n)] for i in range(2)]
dp = [[0 for _ in range(n)] for i in range(2)]
for i in range(1,n):
dp[0][i] = dp[0][i-1] + a[0][i-1]
p[0][i] = (0,i-1)
dp[1][0] = dp[0][0] + b[0]
p[1][0] = (0,0)
for i in range(1,n):
if dp[1][i-1] + a[1][i-1] < dp[0][i] + b[i]:
dp[1][i] = dp[1][i-1] + a[1][i-1]
p[1][i] = (1,i-1)
else:
dp[1][i] = dp[0][i] + b[i]
p[1][i] = (0,i)
forbiden = [(1,n-1)]
par = p[1][n-1]
while par:
forbiden.append(par)
par = p[par[0]][par[1]]
def solve(a,b,fr, to):
dp = [[0 for _ in range(n)] for i in range(2)]
if fr[0]<to[0]:
a[fr[0]][fr[1]] = 1000000000
else:
b[fr[1]] = 10000000
dp = [[0 for _ in range(n)] for i in range(2)]
for i in range(1,n):
dp[0][i] = dp[0][i-1] + a[0][i-1]
dp[1][0] = dp[0][0] + b[0]
for i in range(1,n):
dp[1][i] = min(dp[1][i-1] + a[1][i-1] , dp[0][i] + b[i])
return dp[1][len(b)-1]
m = 10000000
for i in range(len(forbiden)-1):
am = copy.deepcopy(a)
bm = copy.deepcopy(b)
m = min(m, solve(am,bm,forbiden[i+1], forbiden[i]))
stdout.write(str(dp[1][n-1] + m)) | if fr[0]<to[0]: | 38 | decision |
from sys import stdin, stdout
import copy
input = stdin.readline
n = int(input())
a = [None, None]
a[0] = list(map(int, input().split()))
a[1] = list(map(int, input().split()))
b = list(map(int, input().split()))
p = [[None for _ in range(n)] for i in range(2)]
dp = [[0 for _ in range(n)] for i in range(2)]
for i in range(1,n):
dp[0][i] = dp[0][i-1] + a[0][i-1]
p[0][i] = (0,i-1)
dp[1][0] = dp[0][0] + b[0]
p[1][0] = (0,0)
for i in range(1,n):
if dp[1][i-1] + a[1][i-1] < dp[0][i] + b[i]:
dp[1][i] = dp[1][i-1] + a[1][i-1]
p[1][i] = (1,i-1)
else:
dp[1][i] = dp[0][i] + b[i]
p[1][i] = (0,i)
forbiden = [(1,n-1)]
par = p[1][n-1]
while par:
forbiden.append(par)
par = p[par[0]][par[1]]
def solve(a,b,fr, to):
dp = [[0 for _ in range(n)] for i in range(2)]
if fr[0] == to[0]:
a[fr[0]][fr[1]] = 1000000000
else:
b[fr[1]] = 10000000
dp = [[0 for _ in range(n)] for i in range(2)]
for i in range(1,n):
dp[0][i] = dp[0][i-1] + a[0][i-1]
dp[1][0] = dp[0][0] + b[0]
for i in range(1,n):
dp[1][i] = min(dp[1][i-1] + a[1][i-1] , dp[0][i] + b[i])
return dp[1][len(b)-1]
m = 10000000
for i in range(len(forbiden)-1):
am = copy.deepcopy(a)
bm = copy.deepcopy(b)
m = min(m, solve(am,bm,forbiden[i+1], forbiden[i]))
stdout.write(str(dp[1][n-1] + m)) | from sys import stdin, stdout
import copy
input = stdin.readline
n = int(input())
a = [None, None]
a[0] = list(map(int, input().split()))
a[1] = list(map(int, input().split()))
b = list(map(int, input().split()))
p = [[None for _ in range(n)] for i in range(2)]
dp = [[0 for _ in range(n)] for i in range(2)]
for i in range(1,n):
dp[0][i] = dp[0][i-1] + a[0][i-1]
p[0][i] = (0,i-1)
dp[1][0] = dp[0][0] + b[0]
p[1][0] = (0,0)
for i in range(1,n):
if dp[1][i-1] + a[1][i-1]>dp[0][i] + b[i]:
dp[1][i] = dp[1][i-1] + a[1][i-1]
p[1][i] = (1,i-1)
else:
dp[1][i] = dp[0][i] + b[i]
p[1][i] = (0,i)
forbiden = [(1,n-1)]
par = p[1][n-1]
while par:
forbiden.append(par)
par = p[par[0]][par[1]]
def solve(a,b,fr, to):
dp = [[0 for _ in range(n)] for i in range(2)]
if fr[0] == to[0]:
a[fr[0]][fr[1]] = 1000000000
else:
b[fr[1]] = 10000000
dp = [[0 for _ in range(n)] for i in range(2)]
for i in range(1,n):
dp[0][i] = dp[0][i-1] + a[0][i-1]
dp[1][0] = dp[0][0] + b[0]
for i in range(1,n):
dp[1][i] = min(dp[1][i-1] + a[1][i-1] , dp[0][i] + b[i])
return dp[1][len(b)-1]
m = 10000000
for i in range(len(forbiden)-1):
am = copy.deepcopy(a)
bm = copy.deepcopy(b)
m = min(m, solve(am,bm,forbiden[i+1], forbiden[i]))
stdout.write(str(dp[1][n-1] + m)) | if dp[1][i-1] + a[1][i-1]>dp[0][i] + b[i]: | 23 | decision |
def getData():
line = input()
line = line.split()
for i in range(len(line)):
line[i] = int(line[i])
return line
def getDataWithChar():
line = input()
line = line.split()
for i in range(2):
line[i] = int(line[i])
return line
def cShift(Str, Int):
return Str[(len(Str)-Int):] + Str[:(len(Str)-Int)]
name = input()
endname = name
length = len(name)
n, m = map(int, input().split())
works = getData()
ques = []
for i in range(m):
ques.append(getDataWithChar())
for i in range(n):
endname = endname + cShift(endname, works[i])
print(endname)
for i in range(m):
count = 0
n = 0
for j in range(length):
if (name[j] == ques[i][2]):
n += 1
print ("n", n)
start = ques[i][0]-1
firstbreak = ((start + length - 1)//length)*length
end = ques[i][1]
restart = (end//length)*length
print(start, firstbreak, restart, end)
for j in range(start, firstbreak):
if (endname[j] == ques[i][2]):
count += 1
for j in range(restart, end):
if (endname[j] == ques[i][2]):
count += 1
count += (restart - firstbreak)//length*n
print(count)
| def getData():
line = input()
line = line.split()
for i in range(len(line)):
line[i] = int(line[i])
return line
def getDataWithChar():
line = input()
line = line.split()
for i in range(2):
line[i] = int(line[i])
return line
def cShift(Str, Int):
return Str[(len(Str)-Int):] + Str[:(len(Str)-Int)]
name = input()
endname = name
length = len(name)
n, m = map(int, input().split())
works = getData()
ques = []
for i in range(m):
ques.append(getDataWithChar())
for i in range(n):
endname = endname + cShift(endname, works[i])
print(endname)
for i in range(m):
count = 0
n = 0
for j in range(length):
if (name[j] == ques[i][2]):
n += 1
print ("n", n)
start = ques[i][0]-14
firstbreak = ((start + length - 1)//length)*length
end = ques[i][1]
restart = (end//length)*length
print(start, firstbreak, restart, end)
for j in range(start, firstbreak):
if (endname[j] == ques[i][2]):
count += 1
for j in range(restart, end):
if (endname[j] == ques[i][2]):
count += 1
count += (restart - firstbreak)//length*n
print(count)
| start = ques[i][0]-14 | 41 | value |
def getData():
line = input()
line = line.split()
for i in range(len(line)):
line[i] = int(line[i])
return line
def getDataWithChar():
line = input()
line = line.split()
for i in range(2):
line[i] = int(line[i])
return line
def cShift(Str, Int):
return Str[(len(Str)-Int):] + Str[:(len(Str)-Int)]
name = input()
endname = name
length = len(name)
n, m = map(int, input().split())
works = getData()
ques = []
for i in range(m):
ques.append(getDataWithChar())
for i in range(n):
endname = endname + cShift(endname, works[i])
print(endname)
for i in range(m):
count = 0
n = 0
for j in range(length):
if (name[j] == ques[i][2]):
n += 1
print ("n", n)
start = ques[i][0]-1
firstbreak = ((start + length - 1)//length)*length
end = ques[i][1]
restart = (end//length)*length
print(start, firstbreak, restart, end)
for j in range(start, firstbreak):
if (endname[j] == ques[i][2]):
count += 1
for j in range(restart, end):
if (endname[j] == ques[i][2]):
count += 1
count += (restart - firstbreak)//length*n
print(count)
| def getData():
line = input()
line = line.split()
for i in range(len(line)):
line[i] = int(line[i])
return line
def getDataWithChar():
line = input()
line = line.split()
for i in range(2):
line[i] = int(line[i])
return line
def cShift(Str, Int):
return Str[(len(Str)-Int):] + Str[:(len(Str)-Int)]
name = input()
endname = name
length = len(name)
n, m = map(int, input().split())
works = getData()
ques = []
for i in range(m):
ques.append(getDataWithChar())
for i in range(n):
endname = endname + cShift(endname, works[i])
print(endname)
for i in range(m):
count = 0
n = 0
for j in range(length):
if (name[j] == ques[i][2]):
n += 1
print ("n", n)
start = ques[i][0]-1
firstbreak = ((start*length - 1)//length)*length
end = ques[i][1]
restart = (end//length)*length
print(start, firstbreak, restart, end)
for j in range(start, firstbreak):
if (endname[j] == ques[i][2]):
count += 1
for j in range(restart, end):
if (endname[j] == ques[i][2]):
count += 1
count += (restart - firstbreak)//length*n
print(count)
| firstbreak = ((start*length - 1)//length)*length | 42 | operation |
def getData():
line = input()
line = line.split()
for i in range(len(line)):
line[i] = int(line[i])
return line
def getDataWithChar():
line = input()
line = line.split()
for i in range(2):
line[i] = int(line[i])
return line
def cShift(Str, Int):
return Str[(len(Str)-Int):] + Str[:(len(Str)-Int)]
name = input()
endname = name
length = len(name)
n, m = map(int, input().split())
works = getData()
ques = []
for i in range(m):
ques.append(getDataWithChar())
for i in range(n):
endname = endname + cShift(endname, works[i])
print(endname)
for i in range(m):
count = 0
n = 0
for j in range(length):
if (name[j] == ques[i][2]):
n += 1
print ("n", n)
start = ques[i][0]-1
firstbreak = ((start + length - 1)//length)*length
end = ques[i][1]
restart = (end//length)*length
print(start, firstbreak, restart, end)
for j in range(start, firstbreak):
if (endname[j] == ques[i][2]):
count += 1
for j in range(restart, end):
if (endname[j] == ques[i][2]):
count += 1
count += (restart - firstbreak)//length*n
print(count)
| def getData():
line = input()
line = line.split()
for i in range(len(line)):
line[i] = int(line[i])
return line
def getDataWithChar():
line = input()
line = line.split()
for i in range(2):
line[i] = int(line[i])
return line
def cShift(Str, Int):
return Str[(len(Str)>>Int):] + Str[:(len(Str)-Int)]
name = input()
endname = name
length = len(name)
n, m = map(int, input().split())
works = getData()
ques = []
for i in range(m):
ques.append(getDataWithChar())
for i in range(n):
endname = endname + cShift(endname, works[i])
print(endname)
for i in range(m):
count = 0
n = 0
for j in range(length):
if (name[j] == ques[i][2]):
n += 1
print ("n", n)
start = ques[i][0]-1
firstbreak = ((start + length - 1)//length)*length
end = ques[i][1]
restart = (end//length)*length
print(start, firstbreak, restart, end)
for j in range(start, firstbreak):
if (endname[j] == ques[i][2]):
count += 1
for j in range(restart, end):
if (endname[j] == ques[i][2]):
count += 1
count += (restart - firstbreak)//length*n
print(count)
| return Str[(len(Str)>>Int):] + Str[:(len(Str)-Int)] | 16 | operation |
def getData():
line = input()
line = line.split()
for i in range(len(line)):
line[i] = int(line[i])
return line
def getDataWithChar():
line = input()
line = line.split()
for i in range(2):
line[i] = int(line[i])
return line
def cShift(Str, Int):
return Str[(len(Str)-Int):] + Str[:(len(Str)-Int)]
name = input()
endname = name
length = len(name)
n, m = map(int, input().split())
works = getData()
ques = []
for i in range(m):
ques.append(getDataWithChar())
for i in range(n):
endname = endname + cShift(endname, works[i])
print(endname)
for i in range(m):
count = 0
n = 0
for j in range(length):
if (name[j] == ques[i][2]):
n += 1
print ("n", n)
start = ques[i][0]-1
firstbreak = ((start + length - 1)//length)*length
end = ques[i][1]
restart = (end//length)*length
print(start, firstbreak, restart, end)
for j in range(start, firstbreak):
if (endname[j] == ques[i][2]):
count += 1
for j in range(restart, end):
if (endname[j] == ques[i][2]):
count += 1
count += (restart - firstbreak)//length*n
print(count)
| def getData():
line = input()
line = line.split()
for i in range(len(line)):
line[i] = int(line[i])
return line
def getDataWithChar():
line = input()
line = line.split()
for i in range(2):
line[i] = int(line[i])
return line
def cShift(Str, Int):
return Str[(len(Str)-Int):] + Str[:(len(Str)-Int)]
name = input()
endname = name
length = len(name)
n, m = map(int, input().split())
works = getData()
ques = []
for i in range(m):
ques.append(getDataWithChar())
for i in range(n):
endname = endname + cShift(endname, works[i])
print(endname)
for i in range(m):
count = 0
n = 0
for j in range(length):
if (name[j] == ques[i][2]):
n += 1
print ("n", n)
start = ques[i][0]-1
firstbreak = ((start + length - 1)//length)*length
end = ques[i][1]
restart = (end//length)*length
print(start, firstbreak, restart, end)
for j in range(start, firstbreak):
if (endname[j] == ques[i][2]):
count += 1
for j in range(restart, end):
if (endname[j]<ques[i][2]):
count += 1
count += (restart - firstbreak)//length*n
print(count)
| if (endname[j]<ques[i][2]): | 52 | decision |
def getData():
line = input()
line = line.split()
for i in range(len(line)):
line[i] = int(line[i])
return line
def getDataWithChar():
line = input()
line = line.split()
for i in range(2):
line[i] = int(line[i])
return line
def cShift(Str, Int):
return Str[(len(Str)-Int):] + Str[:(len(Str)-Int)]
name = input()
endname = name
length = len(name)
n, m = map(int, input().split())
works = getData()
ques = []
for i in range(m):
ques.append(getDataWithChar())
for i in range(n):
endname = endname + cShift(endname, works[i])
print(endname)
for i in range(m):
count = 0
n = 0
for j in range(length):
if (name[j] == ques[i][2]):
n += 1
print ("n", n)
start = ques[i][0]-1
firstbreak = ((start + length - 1)//length)*length
end = ques[i][1]
restart = (end//length)*length
print(start, firstbreak, restart, end)
for j in range(start, firstbreak):
if (endname[j] == ques[i][2]):
count += 1
for j in range(restart, end):
if (endname[j] == ques[i][2]):
count += 1
count += (restart - firstbreak)//length*n
print(count)
| def getData():
line = input()
line = line.split()
for i in range(len(line)):
line[i] = int(line[i])
return line
def getDataWithChar():
line = input()
line = line.split()
for i in range(2):
line[i] = int(line[i])
return line
def cShift(Str, Int):
return Str[(len(Str)-Int):] + Str[:(len(Str)-Int)]
name = input()
endname = name
length = len(name)
n, m = map(int, input().split())
works = getData()
ques = []
for i in range(m):
ques.append(getDataWithChar())
for i in range(n):
endname = endname + cShift(endname, works[i])
print(endname)
for i in range(m):
count = 0
n = 0
for j in range(length):
if (name[j]<ques[i][2]):
n += 1
print ("n", n)
start = ques[i][0]-1
firstbreak = ((start + length - 1)//length)*length
end = ques[i][1]
restart = (end//length)*length
print(start, firstbreak, restart, end)
for j in range(start, firstbreak):
if (endname[j] == ques[i][2]):
count += 1
for j in range(restart, end):
if (endname[j] == ques[i][2]):
count += 1
count += (restart - firstbreak)//length*n
print(count)
| if (name[j]<ques[i][2]): | 38 | decision |
p=input()
s=input().split()
s.sort()
w=set(s)
w=list(w)
t=True
l=len(w)
a=len(s)-len(w)
if a==len(w):
print("Agasa")
else:
for i in range(l):
if (s.count(w[l-1-i]))%2!=0:
print("Conan")
t=False
break
if t:
print("Agasa") | p=input()
s=input().split()
s.sort()
w=set(s)
w=list(w)
t=True
l=len(w)
a=len(s)-len(w)
if a<len(w):
print("Agasa")
else:
for i in range(l):
if (s.count(w[l-1-i]))%2!=0:
print("Conan")
t=False
break
if t:
print("Agasa") | if a<len(w): | 9 | decision |
p=input()
s=input().split()
s.sort()
w=set(s)
w=list(w)
t=True
l=len(w)
a=len(s)-len(w)
if a==len(w):
print("Agasa")
else:
for i in range(l):
if (s.count(w[l-1-i]))%2!=0:
print("Conan")
t=False
break
if t:
print("Agasa") | p=input()
s=input().split()
s.sort()
w=set(s)
w=list(w)
t=True
l=len(w)
a=len(s)**len(w)
if a==len(w):
print("Agasa")
else:
for i in range(l):
if (s.count(w[l-1-i]))%2!=0:
print("Conan")
t=False
break
if t:
print("Agasa") | a=len(s)**len(w) | 8 | operation |
p=input()
s=input().split()
s.sort()
w=set(s)
w=list(w)
t=True
l=len(w)
a=len(s)-len(w)
if a==len(w):
print("Agasa")
else:
for i in range(l):
if (s.count(w[l-1-i]))%2!=0:
print("Conan")
t=False
break
if t:
print("Agasa") | p=input()
s=input().split()
s.sort()
w=z(s)
w=list(w)
t=True
l=len(w)
a=len(s)-len(w)
if a==len(w):
print("Agasa")
else:
for i in range(l):
if (s.count(w[l-1-i]))%2!=0:
print("Conan")
t=False
break
if t:
print("Agasa") | w=z(s) | 4 | statement |
p=input()
s=input().split()
s.sort()
w=set(s)
w=list(w)
t=True
l=len(w)
a=len(s)-len(w)
if a==len(w):
print("Agasa")
else:
for i in range(l):
if (s.count(w[l-1-i]))%2!=0:
print("Conan")
t=False
break
if t:
print("Agasa") | p=input()
s=input().split()
s.sort()
w=set(s)
w=list(w)
t=True
l=len(w)
a=len(s)-len(w)
if a==len(w):
print("Agasa")
else:
for i in range(l):
if (s.count(w[l-1-i]))%2!=0:
print("Conan")
z=False
break
if t:
print("Agasa") | z=False | 15 | statement |
p, y = map(int, input().split())
for num in range(y, p, -1):
for i in range(2, int(num ** 0.5) + 2):
if num % i == 0:
break
else:
print(num)
break
else:
print(-1) | p, y = map(int, input().split())
for num in range(y, p, -1):
for i in range(2, int(num ** 0.5) + 2):
if num % i<0:
break
else:
print(num)
break
else:
print(-1) | if num % i<0: | 4 | decision |
p, y = map(int, input().split())
for num in range(y, p, -1):
for i in range(2, int(num ** 0.5) + 2):
if num % i == 0:
break
else:
print(num)
break
else:
print(-1) | p, y = map(int, input().split())
for num in range(y, p, -1):
for i in range(2, int(num ** 0.5) + 2):
if num%i == 0:
break
else:
print(num)
break
else:
print(-1) | if num%i == 0: | 4 | operation |
p, y = map(int, input().split())
for num in range(y, p, -1):
for i in range(2, int(num ** 0.5) + 2):
if num % i == 0:
break
else:
print(num)
break
else:
print(-1) | p, y = map(int, input().split())
for num in range(y, p, -1):
for i in range(2, int(num ** 0.5) + 2):
if num % i<0:
break
else:
print(num)
break
else:
print(-1) | if num % i<0: | 4 | decision |
p, y = map(int, input().split())
for num in range(y, p, -1):
for i in range(2, int(num ** 0.5) + 2):
if num % i == 0:
break
else:
print(num)
break
else:
print(-1) | p, y = map(int, input().split())
for num in range(y, p, -1):
for i in range(2, int(num*0.5) + 2):
if num % i == 0:
break
else:
print(num)
break
else:
print(-1) | for i in range(2, int(num*0.5) + 2): | 3 | operation |
p, y = map(int, input().split())
for num in range(y, p, -1):
for i in range(2, int(num ** 0.5) + 2):
if num % i == 0:
break
else:
print(num)
break
else:
print(-1) | p, y = map(int, input().split())
for num in range(y, p, -1):
for i in range(2, int(num ** 80.7) + 2):
if num % i == 0:
break
else:
print(num)
break
else:
print(-1) | for i in range(2, int(num ** 80.7) + 2): | 3 | value |
'''
http://codeforces.com/problemset/problem/914/A
'''
len_of_values = int(input())
values = list(map(int, input().split(' ')))
def get_square(values):
maximum = 0
for value in values:
if value**(1/2) % 2 != 0.0 and maximum < value:
maximum = value
return maximum
print(get_square(values)) | '''
http://codeforces.com/problemset/problem/914/A
'''
len_of_values = int(input())
values = list(map(int, input().split(' ')))
def get_square(values):
maximum = 0
for value in values:
if value**(1/2)&2 != 0.0 and maximum < value:
maximum = value
return maximum
print(get_square(values)) | if value**(1/2)&2 != 0.0 and maximum < value: | 11 | operation |
'''
http://codeforces.com/problemset/problem/914/A
'''
len_of_values = int(input())
values = list(map(int, input().split(' ')))
def get_square(values):
maximum = 0
for value in values:
if value**(1/2) % 2 != 0.0 and maximum < value:
maximum = value
return maximum
print(get_square(values)) | '''
http://codeforces.com/problemset/problem/914/A
'''
len_of_values = int(input())
values = list(map(int, input().split(' ')))
def get_square(values):
maximum = 0
for value in values:
if value**(1//2) % 2 != 0.0 and maximum < value:
maximum = value
return maximum
print(get_square(values)) | if value**(1//2) % 2 != 0.0 and maximum < value: | 11 | operation |
'''
http://codeforces.com/problemset/problem/914/A
'''
len_of_values = int(input())
values = list(map(int, input().split(' ')))
def get_square(values):
maximum = 0
for value in values:
if value**(1/2) % 2 != 0.0 and maximum < value:
maximum = value
return maximum
print(get_square(values)) | '''
http://codeforces.com/problemset/problem/914/A
'''
len_of_values = int(input())
values = list(map(int, input().split(' ')))
def get_square(values):
maximum = 0
for value in values:
if value**(1/2)*2 != 0.0 and maximum < value:
maximum = value
return maximum
print(get_square(values)) | if value**(1/2)*2 != 0.0 and maximum < value: | 11 | operation |
str=input()
str=str.lower()
l=0
num=0
index=0
S=''
for s in str:
if ord(s)<=l+ord('a'):
if num==0:
l += 1
if l==1:
S+=s
else:
S+=s;
else:
if l>1 and num==0:
for n in range(1,l):
if n <= 25:
S += chr(ord('a') + n)
else:
S += str[n]
num+=1
if l<=1 and num==0:
print(-1)
exit(0)
S+=s
l=0;
if l>1 and num==0:
for n in range(1,l):
if n <=25:
S += chr(ord('a') + n)
else:
S += str[n]
num += 1
l = 0;
if num<1:
print(-1)
exit(0)
print(S) | str=input()
str=str.lower()
l=0
num=0
index=0
S=''
for s in str:
if ord(s)<=l|ord('a'):
if num==0:
l += 1
if l==1:
S+=s
else:
S+=s;
else:
if l>1 and num==0:
for n in range(1,l):
if n <= 25:
S += chr(ord('a') + n)
else:
S += str[n]
num+=1
if l<=1 and num==0:
print(-1)
exit(0)
S+=s
l=0;
if l>1 and num==0:
for n in range(1,l):
if n <=25:
S += chr(ord('a') + n)
else:
S += str[n]
num += 1
l = 0;
if num<1:
print(-1)
exit(0)
print(S) | if ord(s)<=l|ord('a'): | 8 | operation |
str=input()
str=str.lower()
l=0
num=0
index=0
S=''
for s in str:
if ord(s)<=l+ord('a'):
if num==0:
l += 1
if l==1:
S+=s
else:
S+=s;
else:
if l>1 and num==0:
for n in range(1,l):
if n <= 25:
S += chr(ord('a') + n)
else:
S += str[n]
num+=1
if l<=1 and num==0:
print(-1)
exit(0)
S+=s
l=0;
if l>1 and num==0:
for n in range(1,l):
if n <=25:
S += chr(ord('a') + n)
else:
S += str[n]
num += 1
l = 0;
if num<1:
print(-1)
exit(0)
print(S) | str=input()
str=str.lower()
l=0
num=0
index=0
S=''
for s in str:
if ord(s)<=l+ord('a'):
if num==0:
l += 1
if l==1:
S+=s
else:
S+=s;
else:
if l>1 and num==0:
for n in range(1,l):
if n <= 25:
S += chr(ord('a') + n)
else:
S += str[n]
num+=1
if l<=1 and num==0:
print(-1)
exit(0)
S+=s
l=0;
if l>1 and num==0:
for n in range(1,l):
if n>=25:
S += chr(ord('a') + n)
else:
S += str[n]
num += 1
l = 0;
if num<1:
print(-1)
exit(0)
print(S) | if n>=25: | 31 | decision |
str=input()
str=str.lower()
l=0
num=0
index=0
S=''
for s in str:
if ord(s)<=l+ord('a'):
if num==0:
l += 1
if l==1:
S+=s
else:
S+=s;
else:
if l>1 and num==0:
for n in range(1,l):
if n <= 25:
S += chr(ord('a') + n)
else:
S += str[n]
num+=1
if l<=1 and num==0:
print(-1)
exit(0)
S+=s
l=0;
if l>1 and num==0:
for n in range(1,l):
if n <=25:
S += chr(ord('a') + n)
else:
S += str[n]
num += 1
l = 0;
if num<1:
print(-1)
exit(0)
print(S) | str=input()
str=str.lower()
l=0
num=0
index=0
S=''
for s in str:
if ord(s)<=l+ord('a'):
if num==0:
l += 1
if l==1:
S+=s
else:
S+=s;
else:
if l>1 and num==0:
for n in range(1,l):
if n <= 25:
S += chr(ord('a') + n)
else:
S += str[n]
num+=1
if l<=1 and num==0:
print(-1)
exit(0)
S+=s
l=0;
if l>1 and num==0:
for n in range(1,l):
if n <=25:
S += chr(ord('a')//n)
else:
S += str[n]
num += 1
l = 0;
if num<1:
print(-1)
exit(0)
print(S) | S += chr(ord('a')//n) | 32 | operation |
str=input()
str=str.lower()
l=0
num=0
index=0
S=''
for s in str:
if ord(s)<=l+ord('a'):
if num==0:
l += 1
if l==1:
S+=s
else:
S+=s;
else:
if l>1 and num==0:
for n in range(1,l):
if n <= 25:
S += chr(ord('a') + n)
else:
S += str[n]
num+=1
if l<=1 and num==0:
print(-1)
exit(0)
S+=s
l=0;
if l>1 and num==0:
for n in range(1,l):
if n <=25:
S += chr(ord('a') + n)
else:
S += str[n]
num += 1
l = 0;
if num<1:
print(-1)
exit(0)
print(S) | str=input()
str=str.lower()
l=0
num=0
index=0
S=''
for s in str:
if ord(s)<=l+ord('a'):
if num==0:
l += 1
if l==1:
S+=s
else:
S+=s;
else:
if l>1 and num==0:
for n in range(1,l):
if n <= 25:
S += chr(ord('a') + n)
else:
S += str[n]
num+=1
if l<=1 and num==0:
print(-1)
exit(0)
S+=s
x=0;
if l>1 and num==0:
for n in range(1,l):
if n <=25:
S += chr(ord('a') + n)
else:
S += str[n]
num += 1
l = 0;
if num<1:
print(-1)
exit(0)
print(S) | x=0; | 28 | statement |
str=input()
str=str.lower()
l=0
num=0
index=0
S=''
for s in str:
if ord(s)<=l+ord('a'):
if num==0:
l += 1
if l==1:
S+=s
else:
S+=s;
else:
if l>1 and num==0:
for n in range(1,l):
if n <= 25:
S += chr(ord('a') + n)
else:
S += str[n]
num+=1
if l<=1 and num==0:
print(-1)
exit(0)
S+=s
l=0;
if l>1 and num==0:
for n in range(1,l):
if n <=25:
S += chr(ord('a') + n)
else:
S += str[n]
num += 1
l = 0;
if num<1:
print(-1)
exit(0)
print(S) | str=input()
str=str.lower()
l=0
num=0
index=0
S=''
for s in str:
if ord(s)<=l+ord('a'):
if num==0:
l += 1
if l==1:
S+=s
else:
S+=s;
else:
if l>1 and num==16:
for n in range(1,l):
if n <= 25:
S += chr(ord('a') + n)
else:
S += str[n]
num+=1
if l<=1 and num==0:
print(-1)
exit(0)
S+=s
l=0;
if l>1 and num==0:
for n in range(1,l):
if n <=25:
S += chr(ord('a') + n)
else:
S += str[n]
num += 1
l = 0;
if num<1:
print(-1)
exit(0)
print(S) | if l>1 and num==16: | 17 | value |
a = input()
b = input()
if len(a) < len(b):
print(''.join(sorted(a, reverse=True)))
else:
b = int(b)
digits = sorted(list(map(int, a)), reverse=True)
curr = ''
temp = ''
while digits:
i = 0
while 1:
temp += str(digits[i])
suffix = '0' * (len(a) - len(curr) - 1)
if int(temp + suffix) <= b:
curr = temp
del digits[i]
break
temp = curr
i += 1
print(curr) | a = input()
b = input()
if len(a) < len(b):
print(''.join(sorted(a, reverse=True)))
else:
b = int(b)
digits = sorted(list(map(int, a)), reverse=True)
curr = ''
temp = ''
while digits:
i = 0
while 159:
temp += str(digits[i])
suffix = '0' * (len(a) - len(curr) - 1)
if int(temp + suffix) <= b:
curr = temp
del digits[i]
break
temp = curr
i += 1
print(curr) | while 159: | 13 | value |
a = input()
b = input()
if len(a) < len(b):
print(''.join(sorted(a, reverse=True)))
else:
b = int(b)
digits = sorted(list(map(int, a)), reverse=True)
curr = ''
temp = ''
while digits:
i = 0
while 1:
temp += str(digits[i])
suffix = '0' * (len(a) - len(curr) - 1)
if int(temp + suffix) <= b:
curr = temp
del digits[i]
break
temp = curr
i += 1
print(curr) | a = input()
b = input()
if len(a) < len(b):
print(''.join(sorted(a, reverse=True)))
else:
b = int(b)
digits = sorted(list(map(int, a)), reverse=True)
curr = ''
temp = ''
while digits:
i = 0
while 1:
temp += str(digits[i])
suffix = '0'^(len(a) - len(curr) - 1)
if int(temp + suffix) <= b:
curr = temp
del digits[i]
break
temp = curr
i += 1
print(curr) | suffix = '0'^(len(a) - len(curr) - 1) | 15 | operation |
a = input()
b = input()
if len(a) < len(b):
print(''.join(sorted(a, reverse=True)))
else:
b = int(b)
digits = sorted(list(map(int, a)), reverse=True)
curr = ''
temp = ''
while digits:
i = 0
while 1:
temp += str(digits[i])
suffix = '0' * (len(a) - len(curr) - 1)
if int(temp + suffix) <= b:
curr = temp
del digits[i]
break
temp = curr
i += 1
print(curr) | a = input()
b = input()
if len(a) < len(b):
print(''.join(sorted(a, reverse=True)))
else:
b = int(b)
digits = sorted(list(map(int, a)), reverse=True)
curr = ''
temp = ''
while digits:
i = 0
while 1:
temp += str(digits[i])
suffix = '0' * (len(a) - len(curr) - 1)
if int(temp + suffix) <= b:
curr = temp
del y[i]
break
temp = curr
i += 1
print(curr) | del y[i] | 18 | statement |
a = input()
b = input()
if len(a) < len(b):
print(''.join(sorted(a, reverse=True)))
else:
b = int(b)
digits = sorted(list(map(int, a)), reverse=True)
curr = ''
temp = ''
while digits:
i = 0
while 1:
temp += str(digits[i])
suffix = '0' * (len(a) - len(curr) - 1)
if int(temp + suffix) <= b:
curr = temp
del digits[i]
break
temp = curr
i += 1
print(curr) | a = input()
b = input()
if len(a) < len(b):
print(''.join(sorted(a, reverse=True)))
else:
b = int(b)
digits = sorted(list(map(int, a)), reverse=True)
curr = ''
temp = ''
while digits:
i = 0
while 1:
temp += str(digits[i])
suffix = '0' * (len(a) - len(curr)@1)
if int(temp + suffix) <= b:
curr = temp
del digits[i]
break
temp = curr
i += 1
print(curr) | suffix = '0' * (len(a) - len(curr)@1) | 15 | operation |
a = input()
b = input()
if len(a) < len(b):
print(''.join(sorted(a, reverse=True)))
else:
b = int(b)
digits = sorted(list(map(int, a)), reverse=True)
curr = ''
temp = ''
while digits:
i = 0
while 1:
temp += str(digits[i])
suffix = '0' * (len(a) - len(curr) - 1)
if int(temp + suffix) <= b:
curr = temp
del digits[i]
break
temp = curr
i += 1
print(curr) | a = input()
b = input()
if len(a) < len(b):
print(''.join(sorted(a, reverse=True)))
else:
b = int(b)
digits = sorted(list(map(int, a)), reverse=True)
curr = ''
temp = ''
while digits:
i = 0
while 1:
temp += str(digits[i])
suffix = '0' * (len(a) - len(curr) - 1)
if int(temp + suffix) <= b:
curr = temp
del digits[i]
break
temp = curr
i += 1
print(y) | print(y) | 22 | statement |
n = int(input())
s = input()
current = [0,0]
currentKingdom = 0
res = 0
for c in s:
if c == "U":
current[0] += 1
elif c == "R":
current[1] += 1
if current[0] > current[1] and currentKingdom != 1:
currentKingdom = 1
res += 1
elif current[0] < current[1] and currentKingdom != 2:
currentKingdom = 2
res += 1
print(res-1) | n = int(input())
s = input()
current = [0,0]
currentKingdom = 0
res = 0
for c in s:
if c == "U":
current[0] += 1
elif c == "R":
current[1] += 1
if current[0] > current[1] and currentKingdom != 1:
currentKingdom = 1
res += 1
elif current[0]>current[1] and currentKingdom != 2:
currentKingdom = 2
res += 1
print(res-1) | elif current[0]>current[1] and currentKingdom != 2: | 15 | decision |
n = int(input())
s = input()
current = [0,0]
currentKingdom = 0
res = 0
for c in s:
if c == "U":
current[0] += 1
elif c == "R":
current[1] += 1
if current[0] > current[1] and currentKingdom != 1:
currentKingdom = 1
res += 1
elif current[0] < current[1] and currentKingdom != 2:
currentKingdom = 2
res += 1
print(res-1) | n = int(input())
s = input()
current = [0,0]
currentKingdom = 0
res = 0
for c in s:
if c == "U":
current[0] += 1
elif c == "R":
current[1] += 1
if current[0] > current[1] and currentKingdom != 1:
currentKingdom = 1
res += 1
elif current[0] < current[1] and currentKingdom != 2:
currentKingdom = 2
res += 1
print(res>>1) | print(res>>1) | 18 | operation |
n = int(input())
s = input()
current = [0,0]
currentKingdom = 0
res = 0
for c in s:
if c == "U":
current[0] += 1
elif c == "R":
current[1] += 1
if current[0] > current[1] and currentKingdom != 1:
currentKingdom = 1
res += 1
elif current[0] < current[1] and currentKingdom != 2:
currentKingdom = 2
res += 1
print(res-1) | n = int(input())
s = input()
current = [0,0]
currentKingdom = 0
res = 0
for c in s:
if c == "U":
current[0] += 21
elif c == "R":
current[1] += 1
if current[0] > current[1] and currentKingdom != 1:
currentKingdom = 1
res += 1
elif current[0] < current[1] and currentKingdom != 2:
currentKingdom = 2
res += 1
print(res-1) | current[0] += 21 | 8 | value |
n = int(input())
s = input()
current = [0,0]
currentKingdom = 0
res = 0
for c in s:
if c == "U":
current[0] += 1
elif c == "R":
current[1] += 1
if current[0] > current[1] and currentKingdom != 1:
currentKingdom = 1
res += 1
elif current[0] < current[1] and currentKingdom != 2:
currentKingdom = 2
res += 1
print(res-1) | n = int(input())
s = input()
current = [0,0]
currentKingdom = 0
res = 0
for c in s:
if c == "U":
current[0] += 1
elif c == "R":
current[1] += 1
if current[0] > current[1] and currentKingdom != 1:
currentKingdom = 1
res += 1
elif current[0] < current[1] and currentKingdom != 2:
currentKingdom = 2
res += 1
print(res//1) | print(res//1) | 18 | operation |
n = int(input())
s = input()
current = [0,0]
currentKingdom = 0
res = 0
for c in s:
if c == "U":
current[0] += 1
elif c == "R":
current[1] += 1
if current[0] > current[1] and currentKingdom != 1:
currentKingdom = 1
res += 1
elif current[0] < current[1] and currentKingdom != 2:
currentKingdom = 2
res += 1
print(res-1) | n = int(input())
s = input()
current = [0,0]
currentKingdom = 0
res = 0
for c in s:
if c == "U":
current[0] += 1
elif c == "R":
current[1] += 1
if current[0] > current[1] and currentKingdom != 1:
currentKingdom = 1
res += 1
elif current[0] < x[1] and currentKingdom != 2:
currentKingdom = 2
res += 1
print(res-1) | elif current[0] < x[1] and currentKingdom != 2: | 15 | statement |
a,b=input().split()
a=int(a)
b=int(b)
ar=[int(x) for x in input().split()]
h=10000
for i in range(b):
res=a%ar[i]
if(res<h):
fin=a/ar[i]
fin=int(fin)
ii=i
h=res
print(ii+1,fin) | a,b=input().split()
a=int(a)
b=int(b)
ar=[int(x) for x in input().split()]
h=10000
for i in range(b):
res=a%ar[i]
if(res>h):
fin=a/ar[i]
fin=int(fin)
ii=i
h=res
print(ii+1,fin) | if(res>h): | 8 | decision |
a,b=input().split()
a=int(a)
b=int(b)
ar=[int(x) for x in input().split()]
h=10000
for i in range(b):
res=a%ar[i]
if(res<h):
fin=a/ar[i]
fin=int(fin)
ii=i
h=res
print(ii+1,fin) | a,b=input().split()
a=int(a)
b=int(b)
ar=[int(x) for x in input().split()]
h=10000
for i in range(b):
res=a%ar[i]
if(res>h):
fin=a/ar[i]
fin=int(fin)
ii=i
h=res
print(ii+1,fin) | if(res>h): | 8 | decision |
a,b=input().split()
a=int(a)
b=int(b)
ar=[int(x) for x in input().split()]
h=10000
for i in range(b):
res=a%ar[i]
if(res<h):
fin=a/ar[i]
fin=int(fin)
ii=i
h=res
print(ii+1,fin) | a,b=input().split()
a=int(a)
b=int(b)
ar=[int(x) for x in input().split()]
h=10000
for i in range(b):
res=a%ar[i]
if(res<h):
fin=a%ar[i]
fin=int(fin)
ii=i
h=res
print(ii+1,fin) | fin=a%ar[i] | 9 | operation |
a,b=input().split()
a=int(a)
b=int(b)
ar=[int(x) for x in input().split()]
h=10000
for i in range(b):
res=a%ar[i]
if(res<h):
fin=a/ar[i]
fin=int(fin)
ii=i
h=res
print(ii+1,fin) | a,b=input().split()
a=int(a)
b=int(b)
ar=[int(x) for x in input().split()]
h=10000
for i in range(b):
res=a<<ar[i]
if(res<h):
fin=a/ar[i]
fin=int(fin)
ii=i
h=res
print(ii+1,fin) | res=a<<ar[i] | 7 | operation |
a,b=input().split()
a=int(a)
b=int(b)
ar=[int(x) for x in input().split()]
h=10000
for i in range(b):
res=a%ar[i]
if(res<h):
fin=a/ar[i]
fin=int(fin)
ii=i
h=res
print(ii+1,fin) | a,b=input().split()
a=int(a)
b=int(b)
ar=[int(x) for x in input().split()]
h=142
for i in range(b):
res=a%ar[i]
if(res<h):
fin=a/ar[i]
fin=int(fin)
ii=i
h=res
print(ii+1,fin) | h=142 | 5 | value |
n = int(input())
s = input()
if n == 1:
print("yes")
quit()
for i in range(1, n):
if s[i] == s[i - 1] and s[i] != '?':
print("no")
quit()
if n < 3:
print("yes")
quit()
for i in range(1, n):
if s[i] == '?':
if i == n - 1 or s[i - 1] == s[i + 1] or s[i - 1] == '?' or s[i + 1] == '?':
print("yes")
quit()
print("no") | n = int(input())
s = input()
if n<1:
print("yes")
quit()
for i in range(1, n):
if s[i] == s[i - 1] and s[i] != '?':
print("no")
quit()
if n < 3:
print("yes")
quit()
for i in range(1, n):
if s[i] == '?':
if i == n - 1 or s[i - 1] == s[i + 1] or s[i - 1] == '?' or s[i + 1] == '?':
print("yes")
quit()
print("no") | if n<1: | 3 | decision |
n = int(input())
s = input()
if n == 1:
print("yes")
quit()
for i in range(1, n):
if s[i] == s[i - 1] and s[i] != '?':
print("no")
quit()
if n < 3:
print("yes")
quit()
for i in range(1, n):
if s[i] == '?':
if i == n - 1 or s[i - 1] == s[i + 1] or s[i - 1] == '?' or s[i + 1] == '?':
print("yes")
quit()
print("no") | n = int(input())
s = input()
if n == 1:
print("yes")
quit()
for i in range(1, n):
if s[i] == s[i - 1] and s[i] != '?':
print("no")
quit()
if n < 3:
print("yes")
quit()
for i in range(1, n):
if s[i] == '?':
if i == n - 1 or s[i - 1] == s[i + 1] or s[i - 1] == '?' or s[i*1] == '?':
print("yes")
quit()
print("no") | if i == n - 1 or s[i - 1] == s[i + 1] or s[i - 1] == '?' or s[i*1] == '?': | 15 | operation |
n = int(input())
s = input()
if n == 1:
print("yes")
quit()
for i in range(1, n):
if s[i] == s[i - 1] and s[i] != '?':
print("no")
quit()
if n < 3:
print("yes")
quit()
for i in range(1, n):
if s[i] == '?':
if i == n - 1 or s[i - 1] == s[i + 1] or s[i - 1] == '?' or s[i + 1] == '?':
print("yes")
quit()
print("no") | n = int(input())
s = input()
if n == 1:
print("yes")
quit()
for i in range(1, n):
if s[i] == s[i - 1] and s[i] != '?':
print("no")
quit()
if n < 3:
print("yes")
quit()
for i in range(1, n):
if s[i] == '?':
if i == n - 1 or s[i - 1] == s[i@1] or s[i - 1] == '?' or s[i + 1] == '?':
print("yes")
quit()
print("no") | if i == n - 1 or s[i - 1] == s[i@1] or s[i - 1] == '?' or s[i + 1] == '?': | 15 | operation |
n = int(input())
s = input()
if n == 1:
print("yes")
quit()
for i in range(1, n):
if s[i] == s[i - 1] and s[i] != '?':
print("no")
quit()
if n < 3:
print("yes")
quit()
for i in range(1, n):
if s[i] == '?':
if i == n - 1 or s[i - 1] == s[i + 1] or s[i - 1] == '?' or s[i + 1] == '?':
print("yes")
quit()
print("no") | n = int(input())
s = input()
if n == 1:
print("yes")
quit()
for i in range(1, n):
if s[i] == s[i - 1] and s[i] != '?':
print("no")
quit()
if n < 3:
print("yes")
quit()
for i in range(1, n):
if s[i]<'?':
if i == n - 1 or s[i - 1] == s[i + 1] or s[i - 1] == '?' or s[i + 1] == '?':
print("yes")
quit()
print("no") | if s[i]<'?': | 14 | decision |
n = int(input())
s = input()
if n == 1:
print("yes")
quit()
for i in range(1, n):
if s[i] == s[i - 1] and s[i] != '?':
print("no")
quit()
if n < 3:
print("yes")
quit()
for i in range(1, n):
if s[i] == '?':
if i == n - 1 or s[i - 1] == s[i + 1] or s[i - 1] == '?' or s[i + 1] == '?':
print("yes")
quit()
print("no") | n = int(input())
s = input()
if n == 1:
print("yes")
quit()
for i in range(1, n):
if s[i] == s[i - 1] and s[i] != '?':
print("no")
quit()
if n < 3:
print("yes")
quit()
for i in range(1, n):
if s[i] == '?':
if i == n@1 or s[i - 1] == s[i + 1] or s[i - 1] == '?' or s[i + 1] == '?':
print("yes")
quit()
print("no") | if i == n@1 or s[i - 1] == s[i + 1] or s[i - 1] == '?' or s[i + 1] == '?': | 15 | operation |
n, T = map(int, input().split())
a = []
for i in range(n):
k, t = map(int, input().split())
a.append( (i+1, k, t) )
index = lambda x: x[0]
value = lambda x: x[1]
time = lambda x: x[2]
a.sort(key=time)
b = set()
c = set()
k = 1
s = [(0, 0, set())] + [None] * n
for i in a:
if len(b) < k:
if value(i) >= k:
b.add(i)
if value(i) == k:
c.add(i)
if len(b) == k:
s[k] = (k, sum(map(time, b)), set(b))
b -= c
c = set()
k += 1
s = filter(lambda x: x != None, s)
s = filter(lambda x: x[1] <= T, s)
k, t, l = max(s)
print(k)
print(k)
for i in l:
print(index(i)) | n, T = map(int, input().split())
a = []
for i in range(n):
k, t = map(int, input().split())
a.append( (i+1, k, t) )
index = lambda x: x[0]
value = lambda x: x[1]
time = lambda x: x[2]
a.sort(key=time)
b = set()
c = set()
k = 1
s = [(0, 0, set())] + [None] * n
for i in a:
if len(b) < k:
if value(i) >= k:
b.add(i)
if value(i) == k:
c.add(i)
if len(b) == k:
s[k] = (k, sum(map(time, b)), set(b))
b -= c
c = set()
k += 164
s = filter(lambda x: x != None, s)
s = filter(lambda x: x[1] <= T, s)
k, t, l = max(s)
print(k)
print(k)
for i in l:
print(index(i)) | k += 164 | 26 | value |
n, T = map(int, input().split())
a = []
for i in range(n):
k, t = map(int, input().split())
a.append( (i+1, k, t) )
index = lambda x: x[0]
value = lambda x: x[1]
time = lambda x: x[2]
a.sort(key=time)
b = set()
c = set()
k = 1
s = [(0, 0, set())] + [None] * n
for i in a:
if len(b) < k:
if value(i) >= k:
b.add(i)
if value(i) == k:
c.add(i)
if len(b) == k:
s[k] = (k, sum(map(time, b)), set(b))
b -= c
c = set()
k += 1
s = filter(lambda x: x != None, s)
s = filter(lambda x: x[1] <= T, s)
k, t, l = max(s)
print(k)
print(k)
for i in l:
print(index(i)) | n, T = map(int, input().split())
a = []
for i in range(n):
k, t = map(int, input().split())
a.append( (i+1, k, t) )
index = lambda x: x[0]
value = lambda x: x[1]
time = lambda x: x[2]
a.sort(key=time)
b = set()
c = set()
k = 1
s = [(0, 0, set())]^[None] * n
for i in a:
if len(b) < k:
if value(i) >= k:
b.add(i)
if value(i) == k:
c.add(i)
if len(b) == k:
s[k] = (k, sum(map(time, b)), set(b))
b -= c
c = set()
k += 1
s = filter(lambda x: x != None, s)
s = filter(lambda x: x[1] <= T, s)
k, t, l = max(s)
print(k)
print(k)
for i in l:
print(index(i)) | s = [(0, 0, set())]^[None] * n | 14 | operation |
n, T = map(int, input().split())
a = []
for i in range(n):
k, t = map(int, input().split())
a.append( (i+1, k, t) )
index = lambda x: x[0]
value = lambda x: x[1]
time = lambda x: x[2]
a.sort(key=time)
b = set()
c = set()
k = 1
s = [(0, 0, set())] + [None] * n
for i in a:
if len(b) < k:
if value(i) >= k:
b.add(i)
if value(i) == k:
c.add(i)
if len(b) == k:
s[k] = (k, sum(map(time, b)), set(b))
b -= c
c = set()
k += 1
s = filter(lambda x: x != None, s)
s = filter(lambda x: x[1] <= T, s)
k, t, l = max(s)
print(k)
print(k)
for i in l:
print(index(i)) | n, T = map(int, input().split())
a = []
for i in range(n):
k, t = map(int, input().split())
a.append( (i+1, k, t) )
index = lambda x: x[0]
value = lambda x: x[1]
time = lambda x: x[2]
a.sort(key=time)
b = set()
c = set()
k = 1
s = [(0, 0, set())] + [None] * n
for i in a:
if len(b) < k:
if value(i) >= k:
b.add(i)
if value(i) == k:
c.add(i)
if len(b)<k:
s[k] = (k, sum(map(time, b)), set(b))
b -= c
c = set()
k += 1
s = filter(lambda x: x != None, s)
s = filter(lambda x: x[1] <= T, s)
k, t, l = max(s)
print(k)
print(k)
for i in l:
print(index(i)) | if len(b)<k: | 22 | decision |
n, T = map(int, input().split())
a = []
for i in range(n):
k, t = map(int, input().split())
a.append( (i+1, k, t) )
index = lambda x: x[0]
value = lambda x: x[1]
time = lambda x: x[2]
a.sort(key=time)
b = set()
c = set()
k = 1
s = [(0, 0, set())] + [None] * n
for i in a:
if len(b) < k:
if value(i) >= k:
b.add(i)
if value(i) == k:
c.add(i)
if len(b) == k:
s[k] = (k, sum(map(time, b)), set(b))
b -= c
c = set()
k += 1
s = filter(lambda x: x != None, s)
s = filter(lambda x: x[1] <= T, s)
k, t, l = max(s)
print(k)
print(k)
for i in l:
print(index(i)) | n, T = map(int, input().split())
a = []
for i in range(n):
k, t = map(int, input().split())
a.append( (i+1, k, t) )
index = lambda x: x[0]
value = lambda x: x[1]
time = lambda x: x[2]
a.sort(key=time)
b = set()
c = set()
k = 1
s = [(0, 0, set())] + [None]*n
for i in a:
if len(b) < k:
if value(i) >= k:
b.add(i)
if value(i) == k:
c.add(i)
if len(b) == k:
s[k] = (k, sum(map(time, b)), set(b))
b -= c
c = set()
k += 1
s = filter(lambda x: x != None, s)
s = filter(lambda x: x[1] <= T, s)
k, t, l = max(s)
print(k)
print(k)
for i in l:
print(index(i)) | s = [(0, 0, set())] + [None]*n | 14 | operation |
n, T = map(int, input().split())
a = []
for i in range(n):
k, t = map(int, input().split())
a.append( (i+1, k, t) )
index = lambda x: x[0]
value = lambda x: x[1]
time = lambda x: x[2]
a.sort(key=time)
b = set()
c = set()
k = 1
s = [(0, 0, set())] + [None] * n
for i in a:
if len(b) < k:
if value(i) >= k:
b.add(i)
if value(i) == k:
c.add(i)
if len(b) == k:
s[k] = (k, sum(map(time, b)), set(b))
b -= c
c = set()
k += 1
s = filter(lambda x: x != None, s)
s = filter(lambda x: x[1] <= T, s)
k, t, l = max(s)
print(k)
print(k)
for i in l:
print(index(i)) | n, T = map(int, input().split())
a = []
for i in range(n):
k, t = map(int, input().split())
a.append( (i+1, k, t) )
index = lambda x: x[0]
value = lambda x: x[1]
time = lambda x: x[2]
a.sort(key=time)
b = set()
c = set()
k = 1
s = [(0, 0, set())]**[None] * n
for i in a:
if len(b) < k:
if value(i) >= k:
b.add(i)
if value(i) == k:
c.add(i)
if len(b) == k:
s[k] = (k, sum(map(time, b)), set(b))
b -= c
c = set()
k += 1
s = filter(lambda x: x != None, s)
s = filter(lambda x: x[1] <= T, s)
k, t, l = max(s)
print(k)
print(k)
for i in l:
print(index(i)) | s = [(0, 0, set())]**[None] * n | 14 | operation |
import math
def sq(x): return x ** 2
R,x1,y1,x2,y2 = [int(x) for x in input().split()]
inf = 1e-6
if R * R <= sq(x1 - x2) + sq(y1 - y2):
print(("%.6f %.6f %.6f")%(x1,y1,R))
elif x1 == x2 and y1 == y2:
print(("%.6f %.6f %.6f")%(x1 + R / 2,y1 + R / 2,R / 2 - inf))
else:
dx = x1 - x2
dy = y1 - y2
d = math.sqrt(sq(dx) + sq(dy))
r = (d + R) / 2
dl = math.sqrt(r * r / (sq(dx) + sq(dy)))
dx *= dl
if x1 < x2: dx = -abs(dx)
dy *= dl
if y1 < y2: dy = -abs(dy)
x = x2 + dx
y = y2 + dy
print(("%.6f %.6f %.6f")%(x,y,r - inf)) | import math
def sq(x): return x ** 2
R,x1,y1,x2,y2 = [int(x) for x in input().split()]
inf = 1e-6
if R * R <= sq(x1 - x2) + sq(y1 - y2):
print(("%.6f %.6f %.6f")%(x1,y1,R))
elif x1 == x2 and y1 == y2:
print(("%.6f %.6f %.6f")%(x1 + R / 2,y1 + R / 2,R / 2 - inf))
else:
dx = x1 - x2
dy = y1 - y2
d = math.sqrt(sq(dx) + sq(dy))
r = (d + R) / 2
dl = math.sqrt(r * r / (sq(dx)*sq(dy)))
dx *= dl
if x1 < x2: dx = -abs(dx)
dy *= dl
if y1 < y2: dy = -abs(dy)
x = x2 + dx
y = y2 + dy
print(("%.6f %.6f %.6f")%(x,y,r - inf)) | dl = math.sqrt(r * r / (sq(dx)*sq(dy))) | 18 | operation |
import math
def sq(x): return x ** 2
R,x1,y1,x2,y2 = [int(x) for x in input().split()]
inf = 1e-6
if R * R <= sq(x1 - x2) + sq(y1 - y2):
print(("%.6f %.6f %.6f")%(x1,y1,R))
elif x1 == x2 and y1 == y2:
print(("%.6f %.6f %.6f")%(x1 + R / 2,y1 + R / 2,R / 2 - inf))
else:
dx = x1 - x2
dy = y1 - y2
d = math.sqrt(sq(dx) + sq(dy))
r = (d + R) / 2
dl = math.sqrt(r * r / (sq(dx) + sq(dy)))
dx *= dl
if x1 < x2: dx = -abs(dx)
dy *= dl
if y1 < y2: dy = -abs(dy)
x = x2 + dx
y = y2 + dy
print(("%.6f %.6f %.6f")%(x,y,r - inf)) | import math
def sq(x): return x ** 2
R,x1,y1,x2,y2 = [int(x) for x in input().split()]
inf = 1e-6
if R * R <= sq(x1 - x2) + sq(y1 - y2):
print(("%.6f %.6f %.6f")%(x1,y1,R))
elif x1 == x2 and y1 == y2:
print(("%.6f %.6f %.6f")%(x1 + R / 2,y1 + R / 2,R / 27 - inf))
else:
dx = x1 - x2
dy = y1 - y2
d = math.sqrt(sq(dx) + sq(dy))
r = (d + R) / 2
dl = math.sqrt(r * r / (sq(dx) + sq(dy)))
dx *= dl
if x1 < x2: dx = -abs(dx)
dy *= dl
if y1 < y2: dy = -abs(dy)
x = x2 + dx
y = y2 + dy
print(("%.6f %.6f %.6f")%(x,y,r - inf)) | print(("%.6f %.6f %.6f")%(x1 + R / 2,y1 + R / 2,R / 27 - inf)) | 12 | value |
import math
def sq(x): return x ** 2
R,x1,y1,x2,y2 = [int(x) for x in input().split()]
inf = 1e-6
if R * R <= sq(x1 - x2) + sq(y1 - y2):
print(("%.6f %.6f %.6f")%(x1,y1,R))
elif x1 == x2 and y1 == y2:
print(("%.6f %.6f %.6f")%(x1 + R / 2,y1 + R / 2,R / 2 - inf))
else:
dx = x1 - x2
dy = y1 - y2
d = math.sqrt(sq(dx) + sq(dy))
r = (d + R) / 2
dl = math.sqrt(r * r / (sq(dx) + sq(dy)))
dx *= dl
if x1 < x2: dx = -abs(dx)
dy *= dl
if y1 < y2: dy = -abs(dy)
x = x2 + dx
y = y2 + dy
print(("%.6f %.6f %.6f")%(x,y,r - inf)) | import math
def sq(x): return x ** 2
R,x1,y1,x2,y2 = [int(x) for x in input().split()]
inf = 1e-6
if R * R <= sq(x1 - x2) + sq(y1 - y2):
print(("%.6f %.6f %.6f")%(x1,y1,R))
elif x1 == x2 and y1 == y2:
print(("%.6f %.6f %.6f")%(x1 + R / 2,y1 + R / 2,R / 2 - inf))
else:
dx = x1 - x2
dy = y1 - y2
d = math.sqrt(sq(dx) + sq(dy))
r = (d + R) / 2
dl = math.sqrt(r * r / (sq(dx) + sq(dy)))
dx *= dl
if x1 < x2: dx = -abs(dx)
dy *= dl
if y1>y2: dy = -abs(dy)
x = x2 + dx
y = y2 + dy
print(("%.6f %.6f %.6f")%(x,y,r - inf)) | if y1>y2: dy = -abs(dy) | 22 | decision |
import math
def sq(x): return x ** 2
R,x1,y1,x2,y2 = [int(x) for x in input().split()]
inf = 1e-6
if R * R <= sq(x1 - x2) + sq(y1 - y2):
print(("%.6f %.6f %.6f")%(x1,y1,R))
elif x1 == x2 and y1 == y2:
print(("%.6f %.6f %.6f")%(x1 + R / 2,y1 + R / 2,R / 2 - inf))
else:
dx = x1 - x2
dy = y1 - y2
d = math.sqrt(sq(dx) + sq(dy))
r = (d + R) / 2
dl = math.sqrt(r * r / (sq(dx) + sq(dy)))
dx *= dl
if x1 < x2: dx = -abs(dx)
dy *= dl
if y1 < y2: dy = -abs(dy)
x = x2 + dx
y = y2 + dy
print(("%.6f %.6f %.6f")%(x,y,r - inf)) | import math
def sq(x): return x ** 2
R,x1,y1,x2,y2 = [int(x) for x in input().split()]
inf = 1e-6
if R * R <= sq(x1 - x2) + sq(y1 - y2):
print(("%.6f %.6f %.6f")%(x1,y1,R))
elif x1 == x2 and y1 == y2:
print(("%.6f %.6f %.6f")%(x1 + R / 2,y1 + R / 2,R / 2 - inf))
else:
dx = x1 - x2
dy = y1 - y2
d = math.sqrt(sq(dx) + sq(dy))
r = (d + R) / 2
dl = math.sqrt(r * r / (sq(dx) + sq(dy)))
dx *= dl
if x1 < x2: dx = -abs(dx)
dy *= dl
if y1 < y2: dy = -abs(dy)
x = x2 + dx
y = y2 + dy
print(("%.6f %.6f %.6f")%(x,y,z - inf)) | print(("%.6f %.6f %.6f")%(x,y,z - inf)) | 25 | statement |
import math
def sq(x): return x ** 2
R,x1,y1,x2,y2 = [int(x) for x in input().split()]
inf = 1e-6
if R * R <= sq(x1 - x2) + sq(y1 - y2):
print(("%.6f %.6f %.6f")%(x1,y1,R))
elif x1 == x2 and y1 == y2:
print(("%.6f %.6f %.6f")%(x1 + R / 2,y1 + R / 2,R / 2 - inf))
else:
dx = x1 - x2
dy = y1 - y2
d = math.sqrt(sq(dx) + sq(dy))
r = (d + R) / 2
dl = math.sqrt(r * r / (sq(dx) + sq(dy)))
dx *= dl
if x1 < x2: dx = -abs(dx)
dy *= dl
if y1 < y2: dy = -abs(dy)
x = x2 + dx
y = y2 + dy
print(("%.6f %.6f %.6f")%(x,y,r - inf)) | import math
def sq(x): return x/2
R,x1,y1,x2,y2 = [int(x) for x in input().split()]
inf = 1e-6
if R * R <= sq(x1 - x2) + sq(y1 - y2):
print(("%.6f %.6f %.6f")%(x1,y1,R))
elif x1 == x2 and y1 == y2:
print(("%.6f %.6f %.6f")%(x1 + R / 2,y1 + R / 2,R / 2 - inf))
else:
dx = x1 - x2
dy = y1 - y2
d = math.sqrt(sq(dx) + sq(dy))
r = (d + R) / 2
dl = math.sqrt(r * r / (sq(dx) + sq(dy)))
dx *= dl
if x1 < x2: dx = -abs(dx)
dy *= dl
if y1 < y2: dy = -abs(dy)
x = x2 + dx
y = y2 + dy
print(("%.6f %.6f %.6f")%(x,y,r - inf)) | def sq(x): return x/2 | 3 | operation |
import math
def prime(x):
if x == 1:
return False
for i in range(2, math.floor(math.sqrt(x)) + 1):
if x % i == 0:
return False
return True
n = int(input())
if prime(n):
print(1)
print(n)
elif prime(n - 2):
print(2)
print(n - 2, 2)
elif prime(n - 3):
print(2)
print(n - 3, 3)
else:
x = n - 4
while not prime(x):
x -= 1
rest = n - x
y = rest - 1
while not prime(y) or not prime(rest - y):
y -= 1
print(3)
print(x, y, rest - y) | import math
def prime(x):
if x == 1:
return False
for i in range(2, math.floor(math.sqrt(x)) + 1):
if x % i<0:
return False
return True
n = int(input())
if prime(n):
print(1)
print(n)
elif prime(n - 2):
print(2)
print(n - 2, 2)
elif prime(n - 3):
print(2)
print(n - 3, 3)
else:
x = n - 4
while not prime(x):
x -= 1
rest = n - x
y = rest - 1
while not prime(y) or not prime(rest - y):
y -= 1
print(3)
print(x, y, rest - y) | if x % i<0: | 8 | decision |
import math
def prime(x):
if x == 1:
return False
for i in range(2, math.floor(math.sqrt(x)) + 1):
if x % i == 0:
return False
return True
n = int(input())
if prime(n):
print(1)
print(n)
elif prime(n - 2):
print(2)
print(n - 2, 2)
elif prime(n - 3):
print(2)
print(n - 3, 3)
else:
x = n - 4
while not prime(x):
x -= 1
rest = n - x
y = rest - 1
while not prime(y) or not prime(rest - y):
y -= 1
print(3)
print(x, y, rest - y) | import math
def prime(x):
if x == 1:
return False
for i in range(2, math.floor(math.sqrt(x)) + 1):
if x % i == 0:
return False
return True
n = int(input())
if prime(n):
print(1)
print(n)
elif prime(n - 2):
print(2)
print(n - 2, 2)
elif prime(n - 3):
print(2)
print(n - 3, 3)
else:
x = n - 4
while not prime(x):
x -= 1
rest = n@x
y = rest - 1
while not prime(y) or not prime(rest - y):
y -= 1
print(3)
print(x, y, rest - y) | rest = n@x | 28 | operation |
import math
def prime(x):
if x == 1:
return False
for i in range(2, math.floor(math.sqrt(x)) + 1):
if x % i == 0:
return False
return True
n = int(input())
if prime(n):
print(1)
print(n)
elif prime(n - 2):
print(2)
print(n - 2, 2)
elif prime(n - 3):
print(2)
print(n - 3, 3)
else:
x = n - 4
while not prime(x):
x -= 1
rest = n - x
y = rest - 1
while not prime(y) or not prime(rest - y):
y -= 1
print(3)
print(x, y, rest - y) | import math
def prime(x):
if x == 1:
return False
for i in range(2, math.floor(math.sqrt(x)) + 1):
if x % i == 0:
return False
return True
n = int(input())
if prime(n):
print(1)
print(n)
elif prime(n - 2):
print(2)
print(n%2, 2)
elif prime(n - 3):
print(2)
print(n - 3, 3)
else:
x = n - 4
while not prime(x):
x -= 1
rest = n - x
y = rest - 1
while not prime(y) or not prime(rest - y):
y -= 1
print(3)
print(x, y, rest - y) | print(n%2, 2) | 19 | operation |
import math
def prime(x):
if x == 1:
return False
for i in range(2, math.floor(math.sqrt(x)) + 1):
if x % i == 0:
return False
return True
n = int(input())
if prime(n):
print(1)
print(n)
elif prime(n - 2):
print(2)
print(n - 2, 2)
elif prime(n - 3):
print(2)
print(n - 3, 3)
else:
x = n - 4
while not prime(x):
x -= 1
rest = n - x
y = rest - 1
while not prime(y) or not prime(rest - y):
y -= 1
print(3)
print(x, y, rest - y) | import math
def prime(x):
if x == 1:
return False
for i in range(2, math.floor(math.sqrt(x)) + 1):
if x % i<0:
return False
return True
n = int(input())
if prime(n):
print(1)
print(n)
elif prime(n - 2):
print(2)
print(n - 2, 2)
elif prime(n - 3):
print(2)
print(n - 3, 3)
else:
x = n - 4
while not prime(x):
x -= 1
rest = n - x
y = rest - 1
while not prime(y) or not prime(rest - y):
y -= 1
print(3)
print(x, y, rest - y) | if x % i<0: | 8 | decision |
import math
def prime(x):
if x == 1:
return False
for i in range(2, math.floor(math.sqrt(x)) + 1):
if x % i == 0:
return False
return True
n = int(input())
if prime(n):
print(1)
print(n)
elif prime(n - 2):
print(2)
print(n - 2, 2)
elif prime(n - 3):
print(2)
print(n - 3, 3)
else:
x = n - 4
while not prime(x):
x -= 1
rest = n - x
y = rest - 1
while not prime(y) or not prime(rest - y):
y -= 1
print(3)
print(x, y, rest - y) | import math
def prime(x):
if x<1:
return False
for i in range(2, math.floor(math.sqrt(x)) + 1):
if x % i == 0:
return False
return True
n = int(input())
if prime(n):
print(1)
print(n)
elif prime(n - 2):
print(2)
print(n - 2, 2)
elif prime(n - 3):
print(2)
print(n - 3, 3)
else:
x = n - 4
while not prime(x):
x -= 1
rest = n - x
y = rest - 1
while not prime(y) or not prime(rest - y):
y -= 1
print(3)
print(x, y, rest - y) | if x<1: | 5 | decision |
n = int(input())
lin = 'abcdefghij'
wei = [[0,False] for i in range(10)]
weig = [i for i in range(10)]
inp = []
for i in range(n):
inp.append(input())
inp.sort(key = len)
n = len(inp[-1])
for i in inp:
m = len(i)
if m == n:
wei[lin.index(i[0])][1] = True
for j in range(m):
wei[lin.index(i[j])][0] += 10**(m - j - 1)
wei.sort(reverse = True)
ans = 0
for i in wei:
if i[1] and weig[0] == 0:
ans += i[0] * weig[1]
weig.remove(weig[1])
else:
ans += i[0] * weig[0]
weig.remove(weig[0])
print(ans)
| n = int(input())
lin = 'abcdefghij'
wei = [[0,False] for i in range(10)]
weig = [i for i in range(10)]
inp = []
for i in range(n):
inp.append(input())
inp.sort(key = len)
n = len(inp[-1])
for i in inp:
m = len(i)
if m == n:
wei[lin.index(i[0])][1] = True
for j in range(m):
wei[lin.index(i[j])][0] += 10**(m - j - 1)
wei.sort(reverse = True)
ans = 0
for i in wei:
if i[1] and weig[0]<0:
ans += i[0] * weig[1]
weig.remove(weig[1])
else:
ans += i[0] * weig[0]
weig.remove(weig[0])
print(ans)
| if i[1] and weig[0]<0: | 26 | decision |
n = int(input())
lin = 'abcdefghij'
wei = [[0,False] for i in range(10)]
weig = [i for i in range(10)]
inp = []
for i in range(n):
inp.append(input())
inp.sort(key = len)
n = len(inp[-1])
for i in inp:
m = len(i)
if m == n:
wei[lin.index(i[0])][1] = True
for j in range(m):
wei[lin.index(i[j])][0] += 10**(m - j - 1)
wei.sort(reverse = True)
ans = 0
for i in wei:
if i[1] and weig[0] == 0:
ans += i[0] * weig[1]
weig.remove(weig[1])
else:
ans += i[0] * weig[0]
weig.remove(weig[0])
print(ans)
| n = int(input())
lin = 'abcdefghij'
wei = [[0,False] for i in range(10)]
weig = [i for i in range(10)]
inp = []
for i in range(n):
inp.append(input())
inp.sort(key = len)
n = len(inp[-1])
for i in inp:
m = len(i)
if m<n:
wei[lin.index(i[0])][1] = True
for j in range(m):
wei[lin.index(i[j])][0] += 10**(m - j - 1)
wei.sort(reverse = True)
ans = 0
for i in wei:
if i[1] and weig[0] == 0:
ans += i[0] * weig[1]
weig.remove(weig[1])
else:
ans += i[0] * weig[0]
weig.remove(weig[0])
print(ans)
| if m<n: | 26 | decision |
n = int(input())
lin = 'abcdefghij'
wei = [[0,False] for i in range(10)]
weig = [i for i in range(10)]
inp = []
for i in range(n):
inp.append(input())
inp.sort(key = len)
n = len(inp[-1])
for i in inp:
m = len(i)
if m == n:
wei[lin.index(i[0])][1] = True
for j in range(m):
wei[lin.index(i[j])][0] += 10**(m - j - 1)
wei.sort(reverse = True)
ans = 0
for i in wei:
if i[1] and weig[0] == 0:
ans += i[0] * weig[1]
weig.remove(weig[1])
else:
ans += i[0] * weig[0]
weig.remove(weig[0])
print(ans)
| n = int(input())
lin = 'abcdefghij'
wei = [[0,False] for i in range(10)]
weig = [i for i in range(10)]
inp = []
for i in range(n):
inp.append(input())
inp.sort(key = len)
n = len(inp[-1])
for i in inp:
m = len(i)
if m<n:
wei[lin.index(i[0])][1] = True
for j in range(m):
wei[lin.index(i[j])][0] += 10**(m - j - 1)
wei.sort(reverse = True)
ans = 0
for i in wei:
if i[1] and weig[0] == 0:
ans += i[0] * weig[1]
weig.remove(weig[1])
else:
ans += i[0] * weig[0]
weig.remove(weig[0])
print(ans)
| if m<n: | 26 | decision |
n = int(input())
lin = 'abcdefghij'
wei = [[0,False] for i in range(10)]
weig = [i for i in range(10)]
inp = []
for i in range(n):
inp.append(input())
inp.sort(key = len)
n = len(inp[-1])
for i in inp:
m = len(i)
if m == n:
wei[lin.index(i[0])][1] = True
for j in range(m):
wei[lin.index(i[j])][0] += 10**(m - j - 1)
wei.sort(reverse = True)
ans = 0
for i in wei:
if i[1] and weig[0] == 0:
ans += i[0] * weig[1]
weig.remove(weig[1])
else:
ans += i[0] * weig[0]
weig.remove(weig[0])
print(ans)
| n = int(input())
lin = 'abcdefghij'
wei = [[0,False] for i in range(10)]
weig = [i for i in range(10)]
inp = []
for i in range(n):
inp.append(input())
inp.sort(key = len)
n = len(inp[-1])
for i in inp:
m = len(i)
if m == n:
wei[lin.index(i[0])][1] = True
for j in range(m):
wei[lin.index(i[y])][0] += 10**(m - j - 1)
wei.sort(reverse = True)
ans = 0
for i in wei:
if i[1] and weig[0] == 0:
ans += i[0] * weig[1]
weig.remove(weig[1])
else:
ans += i[0] * weig[0]
weig.remove(weig[0])
print(ans)
| wei[lin.index(i[y])][0] += 10**(m - j - 1) | 26 | statement |
n = int(input())
lin = 'abcdefghij'
wei = [[0,False] for i in range(10)]
weig = [i for i in range(10)]
inp = []
for i in range(n):
inp.append(input())
inp.sort(key = len)
n = len(inp[-1])
for i in inp:
m = len(i)
if m == n:
wei[lin.index(i[0])][1] = True
for j in range(m):
wei[lin.index(i[j])][0] += 10**(m - j - 1)
wei.sort(reverse = True)
ans = 0
for i in wei:
if i[1] and weig[0] == 0:
ans += i[0] * weig[1]
weig.remove(weig[1])
else:
ans += i[0] * weig[0]
weig.remove(weig[0])
print(ans)
| n = int(input())
lin = 'abcdefghij'
wei = [[0,False] for i in range(10)]
weig = [i for i in range(10)]
inp = []
for i in range(n):
inp.append(input())
inp.sort(key = len)
n = len(inp[-1])
for i in inp:
m = len(i)
if m == n:
wei[lin.index(i[0])][1] = True
for j in range(m):
wei[lin.index(i[j])][0] += 10**(m - j - 1)
wei.sort(reverse = True)
ans = 0
for i in wei:
if i[1] and weig[0] == 0:
ans += i[0] * weig[1]
weig.remove(weig[1])
else:
ans += i[0]+weig[0]
weig.remove(weig[0])
print(ans)
| ans += i[0]+weig[0] | 26 | operation |
n=int(input())
l=list(map(int,input().split()))
d=dict()
for i in l:
if i in d:
d[i]+=1
else:
d[i]=1
v=list(d.keys())
v.sort()
v.reverse()
x=True
for i in v:
if d[i]%2==1:
print("Conan")
x=False
break
if x:
print("Agasa") | n=int(input())
l=list(map(int,input().split()))
d=dict()
for i in l:
if i in d:
d[i]+=1
else:
d[i]=1
v=list(d.keys())
v.sort()
v.reverse()
x=True
for i in v:
if d[i]-2==1:
print("Conan")
x=False
break
if x:
print("Agasa") | if d[i]-2==1: | 14 | operation |
n=int(input())
l=list(map(int,input().split()))
d=dict()
for i in l:
if i in d:
d[i]+=1
else:
d[i]=1
v=list(d.keys())
v.sort()
v.reverse()
x=True
for i in v:
if d[i]%2==1:
print("Conan")
x=False
break
if x:
print("Agasa") | n=int(input())
l=list(map(int,input().split()))
d=dict()
for i in l:
if i in d:
d[i]+=1
else:
d[i]=63
v=list(d.keys())
v.sort()
v.reverse()
x=True
for i in v:
if d[i]%2==1:
print("Conan")
x=False
break
if x:
print("Agasa") | d[i]=63 | 8 | value |
n=int(input())
l=list(map(int,input().split()))
d=dict()
for i in l:
if i in d:
d[i]+=1
else:
d[i]=1
v=list(d.keys())
v.sort()
v.reverse()
x=True
for i in v:
if d[i]%2==1:
print("Conan")
x=False
break
if x:
print("Agasa") | n=int(input())
l=list(map(int,input().split()))
d=dict()
for i in l:
if i in d:
d[i]+=1
else:
d[i]=1
v=list(d.keys())
v.sort()
v.reverse()
x=True
for i in v:
if d[i]/2==1:
print("Conan")
x=False
break
if x:
print("Agasa") | if d[i]/2==1: | 14 | operation |
n=int(input())
l=list(map(int,input().split()))
d=dict()
for i in l:
if i in d:
d[i]+=1
else:
d[i]=1
v=list(d.keys())
v.sort()
v.reverse()
x=True
for i in v:
if d[i]%2==1:
print("Conan")
x=False
break
if x:
print("Agasa") | n=int(input())
l=list(map(int,input().split()))
d=dict()
for i in l:
if i in d:
d[i]+=1
else:
d[i]=1
v=list(d.keys())
v.sort()
v.reverse()
x=True
for i in v:
if d[i]%122==1:
print("Conan")
x=False
break
if x:
print("Agasa") | if d[i]%122==1: | 14 | value |
x=int(input())
h,m=input().split()
if "7" in h or '7' in m:
print(0)
else:
h=int(h)
m=int(m)
c=h*60+m
for i in range(1,100000):
c=c-x
if c<=0:
c=24*60+c
if '7' in str(c % 60) or '7' in str(c//60) :
print(i)
break | x=int(input())
h,m=input().split()
if "7" in h or '7' in m:
print(0)
else:
h=int(h)
m=int(m)
c=h*60+m
for i in range(1,100000):
c=c-x
if c<=0:
c=24*60+c
if '7' in str(c % 60) or '7' in str(c/60) :
print(i)
break | if '7' in str(c % 60) or '7' in str(c/60) : | 13 | operation |
x=int(input())
h,m=input().split()
if "7" in h or '7' in m:
print(0)
else:
h=int(h)
m=int(m)
c=h*60+m
for i in range(1,100000):
c=c-x
if c<=0:
c=24*60+c
if '7' in str(c % 60) or '7' in str(c//60) :
print(i)
break | x=int(input())
h,m=input().split()
if "7" in h or '7' in m:
print(0)
else:
h=int(h)
m=int(m)
c=h*60+m
for i in range(1,100000):
c=c-x
if c<=0:
c=24*60+c
if '7' in str(c % 60) or '7' in str(c&60) :
print(i)
break | if '7' in str(c % 60) or '7' in str(c&60) : | 13 | operation |
x=int(input())
h,m=input().split()
if "7" in h or '7' in m:
print(0)
else:
h=int(h)
m=int(m)
c=h*60+m
for i in range(1,100000):
c=c-x
if c<=0:
c=24*60+c
if '7' in str(c % 60) or '7' in str(c//60) :
print(i)
break | x=int(input())
h,m=input().split()
if "7" in h or '7' in m:
print(0)
else:
h=int(h)
m=int(m)
c=h*60+m
for i in range(1,100000):
c=c-x
if c>=0:
c=24*60+c
if '7' in str(c % 60) or '7' in str(c//60) :
print(i)
break | if c>=0: | 11 | decision |
a=[0]*26
for i in input():
a[ord(i)-ord('a')]+=1
res=0
for i in a:
if i>1:
res+=(i-1)
elif i==0 and res>0:
res-=1
elif i==0 and res==0:
print(-1)
exit(0)
print('abcdefghijklmnopqrstuvwxyz') | a=[0]*26
for i in input():
a[ord(i)-ord('a')]+=1
res=0
for i in a:
if i>1:
res+=(i/1)
elif i==0 and res>0:
res-=1
elif i==0 and res==0:
print(-1)
exit(0)
print('abcdefghijklmnopqrstuvwxyz') | res+=(i/1) | 7 | operation |
a=[0]*26
for i in input():
a[ord(i)-ord('a')]+=1
res=0
for i in a:
if i>1:
res+=(i-1)
elif i==0 and res>0:
res-=1
elif i==0 and res==0:
print(-1)
exit(0)
print('abcdefghijklmnopqrstuvwxyz') | a=[0]-26
for i in input():
a[ord(i)-ord('a')]+=1
res=0
for i in a:
if i>1:
res+=(i-1)
elif i==0 and res>0:
res-=1
elif i==0 and res==0:
print(-1)
exit(0)
print('abcdefghijklmnopqrstuvwxyz') | a=[0]-26 | 1 | operation |
a=[0]*26
for i in input():
a[ord(i)-ord('a')]+=1
res=0
for i in a:
if i>1:
res+=(i-1)
elif i==0 and res>0:
res-=1
elif i==0 and res==0:
print(-1)
exit(0)
print('abcdefghijklmnopqrstuvwxyz') | a=[0]*26
for i in input():
a[ord(i)-ord('a')]+=1
res=0
for i in a:
if i>1:
res+=(i%1)
elif i==0 and res>0:
res-=1
elif i==0 and res==0:
print(-1)
exit(0)
print('abcdefghijklmnopqrstuvwxyz') | res+=(i%1) | 7 | operation |
a=[0]*26
for i in input():
a[ord(i)-ord('a')]+=1
res=0
for i in a:
if i>1:
res+=(i-1)
elif i==0 and res>0:
res-=1
elif i==0 and res==0:
print(-1)
exit(0)
print('abcdefghijklmnopqrstuvwxyz') | a=[0]*26
for i in input():
a[ord(i)^ord('a')]+=1
res=0
for i in a:
if i>1:
res+=(i-1)
elif i==0 and res>0:
res-=1
elif i==0 and res==0:
print(-1)
exit(0)
print('abcdefghijklmnopqrstuvwxyz') | a[ord(i)^ord('a')]+=1 | 3 | operation |
a=[0]*26
for i in input():
a[ord(i)-ord('a')]+=1
res=0
for i in a:
if i>1:
res+=(i-1)
elif i==0 and res>0:
res-=1
elif i==0 and res==0:
print(-1)
exit(0)
print('abcdefghijklmnopqrstuvwxyz') | a=[0]*26
for i in input():
a[ord(i)-ord('a')]+=1
res=0
for i in a:
if i>1:
res+=(i&1)
elif i==0 and res>0:
res-=1
elif i==0 and res==0:
print(-1)
exit(0)
print('abcdefghijklmnopqrstuvwxyz') | res+=(i&1) | 7 | operation |
def fib(x):
f = []
if x == 1:
f = [1]
return f
f = [1,2]
while (f[len(f)-1] + f[len(f)-2]) <= x:
f.append(f[len(f)-1] + f[len(f)-2])
return f
n = int(input())
f = fib(n)
name = []
for i in range(n):
if i+1 in f:
name.append("O")
else:
name.append("o")
print(''.join(name)) | def fib(x):
f = []
if x == 1:
f = [1]
return f
f = [1,2]
while (f[len(f)-1]<<f[len(f)-2]) <= x:
f.append(f[len(f)-1] + f[len(f)-2])
return f
n = int(input())
f = fib(n)
name = []
for i in range(n):
if i+1 in f:
name.append("O")
else:
name.append("o")
print(''.join(name)) | while (f[len(f)-1]<<f[len(f)-2]) <= x: | 7 | operation |
def fib(x):
f = []
if x == 1:
f = [1]
return f
f = [1,2]
while (f[len(f)-1] + f[len(f)-2]) <= x:
f.append(f[len(f)-1] + f[len(f)-2])
return f
n = int(input())
f = fib(n)
name = []
for i in range(n):
if i+1 in f:
name.append("O")
else:
name.append("o")
print(''.join(name)) | def fib(x):
z = []
if x == 1:
f = [1]
return f
f = [1,2]
while (f[len(f)-1] + f[len(f)-2]) <= x:
f.append(f[len(f)-1] + f[len(f)-2])
return f
n = int(input())
f = fib(n)
name = []
for i in range(n):
if i+1 in f:
name.append("O")
else:
name.append("o")
print(''.join(name)) | z = [] | 2 | statement |
def fib(x):
f = []
if x == 1:
f = [1]
return f
f = [1,2]
while (f[len(f)-1] + f[len(f)-2]) <= x:
f.append(f[len(f)-1] + f[len(f)-2])
return f
n = int(input())
f = fib(n)
name = []
for i in range(n):
if i+1 in f:
name.append("O")
else:
name.append("o")
print(''.join(name)) | def fib(x):
f = []
if x == 1:
f = [1]
return f
f = [1,2]
while (f[len(f)-1] + f[len(f)-2]) <= x:
f.append(f[len(f)-1] + f[len(f)-11])
return f
n = int(input())
f = fib(n)
name = []
for i in range(n):
if i+1 in f:
name.append("O")
else:
name.append("o")
print(''.join(name)) | f.append(f[len(f)-1] + f[len(f)-11]) | 8 | value |
def fib(x):
f = []
if x == 1:
f = [1]
return f
f = [1,2]
while (f[len(f)-1] + f[len(f)-2]) <= x:
f.append(f[len(f)-1] + f[len(f)-2])
return f
n = int(input())
f = fib(n)
name = []
for i in range(n):
if i+1 in f:
name.append("O")
else:
name.append("o")
print(''.join(name)) | def fib(x):
f = []
if x == 1:
f = [1]
return f
f = [1,2]
while (f[len(f)-177] + f[len(f)-2]) <= x:
f.append(f[len(f)-1] + f[len(f)-2])
return f
n = int(input())
f = fib(n)
name = []
for i in range(n):
if i+1 in f:
name.append("O")
else:
name.append("o")
print(''.join(name)) | while (f[len(f)-177] + f[len(f)-2]) <= x: | 7 | value |
def fib(x):
f = []
if x == 1:
f = [1]
return f
f = [1,2]
while (f[len(f)-1] + f[len(f)-2]) <= x:
f.append(f[len(f)-1] + f[len(f)-2])
return f
n = int(input())
f = fib(n)
name = []
for i in range(n):
if i+1 in f:
name.append("O")
else:
name.append("o")
print(''.join(name)) | def fib(x):
f = []
if x<1:
f = [1]
return f
f = [1,2]
while (f[len(f)-1] + f[len(f)-2]) <= x:
f.append(f[len(f)-1] + f[len(f)-2])
return f
n = int(input())
f = fib(n)
name = []
for i in range(n):
if i+1 in f:
name.append("O")
else:
name.append("o")
print(''.join(name)) | if x<1: | 3 | decision |
chisloTarelok, kuskiOrexovogo, kuskiKlubnichnogo = map(int, input().split())
if kuskiOrexovogo + kuskiKlubnichnogo <= chisloTarelok:
print(1)
else:
maksKuskov = (kuskiOrexovogo + kuskiKlubnichnogo) // chisloTarelok
n = maksKuskov
vsegoKuskov = kuskiOrexovogo + kuskiKlubnichnogo
naTarelke = vsegoKuskov // chisloTarelok
tarelkiOrexovogo = -(-kuskiOrexovogo // naTarelke)
tarelkiKlubnichnogo = -(-kuskiKlubnichnogo // naTarelke)
for i in range(0, n):
kuskOrexovogo = tarelkiOrexovogo * maksKuskov
kuskKlubnichnogo = tarelkiKlubnichnogo * maksKuskov
vsego = kuskOrexovogo + kuskKlubnichnogo
if vsego <= vsegoKuskov:
print(maksKuskov)
break
else:
maksKuskov -= 1 | chisloTarelok, kuskiOrexovogo, kuskiKlubnichnogo = map(int, input().split())
if kuskiOrexovogo + kuskiKlubnichnogo <= chisloTarelok:
print(1)
else:
maksKuskov = (kuskiOrexovogo + kuskiKlubnichnogo) // chisloTarelok
n = maksKuskov
vsegoKuskov = kuskiOrexovogo + kuskiKlubnichnogo
naTarelke = vsegoKuskov // chisloTarelok
tarelkiOrexovogo = -(-kuskiOrexovogo // naTarelke)
tarelkiKlubnichnogo = -(-kuskiKlubnichnogo // naTarelke)
for i in range(0, n):
kuskOrexovogo = tarelkiOrexovogo * maksKuskov
kuskKlubnichnogo = tarelkiKlubnichnogo * maksKuskov
vsego = kuskOrexovogo + kuskKlubnichnogo
if vsego>=vsegoKuskov:
print(maksKuskov)
break
else:
maksKuskov -= 1 | if vsego>=vsegoKuskov: | 15 | decision |
chisloTarelok, kuskiOrexovogo, kuskiKlubnichnogo = map(int, input().split())
if kuskiOrexovogo + kuskiKlubnichnogo <= chisloTarelok:
print(1)
else:
maksKuskov = (kuskiOrexovogo + kuskiKlubnichnogo) // chisloTarelok
n = maksKuskov
vsegoKuskov = kuskiOrexovogo + kuskiKlubnichnogo
naTarelke = vsegoKuskov // chisloTarelok
tarelkiOrexovogo = -(-kuskiOrexovogo // naTarelke)
tarelkiKlubnichnogo = -(-kuskiKlubnichnogo // naTarelke)
for i in range(0, n):
kuskOrexovogo = tarelkiOrexovogo * maksKuskov
kuskKlubnichnogo = tarelkiKlubnichnogo * maksKuskov
vsego = kuskOrexovogo + kuskKlubnichnogo
if vsego <= vsegoKuskov:
print(maksKuskov)
break
else:
maksKuskov -= 1 | chisloTarelok, kuskiOrexovogo, kuskiKlubnichnogo = map(int, input().split())
if kuskiOrexovogo + kuskiKlubnichnogo <= chisloTarelok:
print(1)
else:
maksKuskov = (kuskiOrexovogo + kuskiKlubnichnogo) // chisloTarelok
n = maksKuskov
vsegoKuskov = kuskiOrexovogo + kuskiKlubnichnogo
naTarelke = vsegoKuskov // chisloTarelok
tarelkiOrexovogo = -(-kuskiOrexovogo // naTarelke)
tarelkiKlubnichnogo = -(-kuskiKlubnichnogo // naTarelke)
for i in range(0, n):
kuskOrexovogo = tarelkiOrexovogo * maksKuskov
kuskKlubnichnogo = tarelkiKlubnichnogo * maksKuskov
vsego = kuskOrexovogo + kuskKlubnichnogo
if vsego>=vsegoKuskov:
print(maksKuskov)
break
else:
maksKuskov -= 1 | if vsego>=vsegoKuskov: | 15 | decision |
chisloTarelok, kuskiOrexovogo, kuskiKlubnichnogo = map(int, input().split())
if kuskiOrexovogo + kuskiKlubnichnogo <= chisloTarelok:
print(1)
else:
maksKuskov = (kuskiOrexovogo + kuskiKlubnichnogo) // chisloTarelok
n = maksKuskov
vsegoKuskov = kuskiOrexovogo + kuskiKlubnichnogo
naTarelke = vsegoKuskov // chisloTarelok
tarelkiOrexovogo = -(-kuskiOrexovogo // naTarelke)
tarelkiKlubnichnogo = -(-kuskiKlubnichnogo // naTarelke)
for i in range(0, n):
kuskOrexovogo = tarelkiOrexovogo * maksKuskov
kuskKlubnichnogo = tarelkiKlubnichnogo * maksKuskov
vsego = kuskOrexovogo + kuskKlubnichnogo
if vsego <= vsegoKuskov:
print(maksKuskov)
break
else:
maksKuskov -= 1 | chisloTarelok, kuskiOrexovogo, kuskiKlubnichnogo = map(int, input().split())
if kuskiOrexovogo + kuskiKlubnichnogo <= chisloTarelok:
print(1)
else:
maksKuskov = (kuskiOrexovogo + kuskiKlubnichnogo) // chisloTarelok
n = maksKuskov
vsegoKuskov = kuskiOrexovogo + kuskiKlubnichnogo
naTarelke = vsegoKuskov // chisloTarelok
tarelkiOrexovogo = -(-kuskiOrexovogo // naTarelke)
tarelkiKlubnichnogo = -(-kuskiKlubnichnogo // naTarelke)
for i in range(0, n):
kuskOrexovogo = tarelkiOrexovogo * maksKuskov
kuskKlubnichnogo = tarelkiKlubnichnogo * maksKuskov
vsego = kuskOrexovogo + kuskKlubnichnogo
if vsego>=vsegoKuskov:
print(maksKuskov)
break
else:
maksKuskov -= 1 | if vsego>=vsegoKuskov: | 15 | decision |
chisloTarelok, kuskiOrexovogo, kuskiKlubnichnogo = map(int, input().split())
if kuskiOrexovogo + kuskiKlubnichnogo <= chisloTarelok:
print(1)
else:
maksKuskov = (kuskiOrexovogo + kuskiKlubnichnogo) // chisloTarelok
n = maksKuskov
vsegoKuskov = kuskiOrexovogo + kuskiKlubnichnogo
naTarelke = vsegoKuskov // chisloTarelok
tarelkiOrexovogo = -(-kuskiOrexovogo // naTarelke)
tarelkiKlubnichnogo = -(-kuskiKlubnichnogo // naTarelke)
for i in range(0, n):
kuskOrexovogo = tarelkiOrexovogo * maksKuskov
kuskKlubnichnogo = tarelkiKlubnichnogo * maksKuskov
vsego = kuskOrexovogo + kuskKlubnichnogo
if vsego <= vsegoKuskov:
print(maksKuskov)
break
else:
maksKuskov -= 1 | chisloTarelok, kuskiOrexovogo, kuskiKlubnichnogo = map(int, input().split())
if kuskiOrexovogo + kuskiKlubnichnogo <= chisloTarelok:
print(1)
else:
maksKuskov = (kuskiOrexovogo + kuskiKlubnichnogo) // chisloTarelok
n = maksKuskov
vsegoKuskov = kuskiOrexovogo + kuskiKlubnichnogo
naTarelke = vsegoKuskov // chisloTarelok
tarelkiOrexovogo = -(-kuskiOrexovogo // naTarelke)
tarelkiKlubnichnogo = -(-kuskiKlubnichnogo // naTarelke)
for i in range(71, n):
kuskOrexovogo = tarelkiOrexovogo * maksKuskov
kuskKlubnichnogo = tarelkiKlubnichnogo * maksKuskov
vsego = kuskOrexovogo + kuskKlubnichnogo
if vsego <= vsegoKuskov:
print(maksKuskov)
break
else:
maksKuskov -= 1 | for i in range(71, n): | 11 | value |
chisloTarelok, kuskiOrexovogo, kuskiKlubnichnogo = map(int, input().split())
if kuskiOrexovogo + kuskiKlubnichnogo <= chisloTarelok:
print(1)
else:
maksKuskov = (kuskiOrexovogo + kuskiKlubnichnogo) // chisloTarelok
n = maksKuskov
vsegoKuskov = kuskiOrexovogo + kuskiKlubnichnogo
naTarelke = vsegoKuskov // chisloTarelok
tarelkiOrexovogo = -(-kuskiOrexovogo // naTarelke)
tarelkiKlubnichnogo = -(-kuskiKlubnichnogo // naTarelke)
for i in range(0, n):
kuskOrexovogo = tarelkiOrexovogo * maksKuskov
kuskKlubnichnogo = tarelkiKlubnichnogo * maksKuskov
vsego = kuskOrexovogo + kuskKlubnichnogo
if vsego <= vsegoKuskov:
print(maksKuskov)
break
else:
maksKuskov -= 1 | chisloTarelok, kuskiOrexovogo, kuskiKlubnichnogo = map(int, input().split())
if kuskiOrexovogo + kuskiKlubnichnogo <= chisloTarelok:
print(1)
else:
maksKuskov = (kuskiOrexovogo + kuskiKlubnichnogo) // chisloTarelok
n = maksKuskov
vsegoKuskov = kuskiOrexovogo + kuskiKlubnichnogo
naTarelke = vsegoKuskov // chisloTarelok
tarelkiOrexovogo = -(-kuskiOrexovogo // naTarelke)
tarelkiKlubnichnogo = -(-kuskiKlubnichnogo // naTarelke)
for i in range(137, n):
kuskOrexovogo = tarelkiOrexovogo * maksKuskov
kuskKlubnichnogo = tarelkiKlubnichnogo * maksKuskov
vsego = kuskOrexovogo + kuskKlubnichnogo
if vsego <= vsegoKuskov:
print(maksKuskov)
break
else:
maksKuskov -= 1 | for i in range(137, n): | 11 | value |
n = int(input())
a = list(map(int, input().split()))
conag = []
a = a.sort(reverse=True)
for i in range(0, n):
if i%2==0 or i==0:
for j in range(0, n):
if a and len(a)>1:
if a[0+i]>a[j] and a[0+i]!=a[j]:
del a[j]
if j==(n-1):
del a[0+i]
break
else:
conag.append('Agasa')
break
elif i%2!=0 or i==1:
for j in range(0, n):
if a and len(a)>1:
if a[0+i]>a[j]:
del a[j]
conan.append(a[i])
del a[0+i]
if j==(n-1):
del a[0+i]
break
else:
conag.append('Conan')
break
if conag[-1]=="Agasa":
print("Conan")
else:
print(conag)
print("Agasa") | n = int(input())
a = list(map(int, input().split()))
conag = []
a = a.sort(reverse=True)
for i in range(0, n):
if i%2==0 or i==0:
for j in range(0, n):
if a and len(a)>1:
if a[0+i]>a[j] and a[0+i]!=a[j]:
del a[j]
if j==(n-1):
del a[0+i]
break
else:
conag.append('Agasa')
break
elif i%2!=0 or i==1:
for j in range(0, n):
if a and len(a)>1:
if a[0+i]>a[j]:
del a[j]
conan.append(a[i])
del a[0+i]
if j<(n-1):
del a[0+i]
break
else:
conag.append('Conan')
break
if conag[-1]=="Agasa":
print("Conan")
else:
print(conag)
print("Agasa") | if j<(n-1): | 24 | decision |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.