user_id
stringlengths 10
10
| problem_id
stringlengths 6
6
| language
stringclasses 1
value | submission_id_v0
stringlengths 10
10
| submission_id_v1
stringlengths 10
10
| cpu_time_v0
int64 10
38.3k
| cpu_time_v1
int64 0
24.7k
| memory_v0
int64 2.57k
1.02M
| memory_v1
int64 2.57k
869k
| status_v0
stringclasses 1
value | status_v1
stringclasses 1
value | improvement_frac
float64 7.51
100
| input
stringlengths 20
4.55k
| target
stringlengths 17
3.34k
| code_v0_loc
int64 1
148
| code_v1_loc
int64 1
184
| code_v0_num_chars
int64 13
4.55k
| code_v1_num_chars
int64 14
3.34k
| code_v0_no_empty_lines
stringlengths 21
6.88k
| code_v1_no_empty_lines
stringlengths 20
4.93k
| code_same
bool 1
class | relative_loc_diff_percent
float64 0
79.8
| diff
sequence | diff_only_import_comment
bool 1
class | measured_runtime_v0
float64 0.01
4.45
| measured_runtime_v1
float64 0.01
4.31
| runtime_lift
float64 0
359
| key
sequence |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
u711238850 | p02688 | python | s574971585 | s918368137 | 23 | 21 | 9,208 | 9,080 | Accepted | Accepted | 8.7 | def main():
n,k = tuple([int(t)for t in input().split()])
t = [0]*n
for _ in range(k):
eval(input())
k = tuple([int(t)-1 for t in input().split()])
for k_i in k:
t[k_i]+=1
ans = 0
for t_i in t:
if t_i==0:
ans+=1
print(ans)
if __name__ == "__main__":
main() | n,k = tuple(map(int,input().split()))
ans = [1]*n
for i in range(k):
d = int(eval(input()))
a_i = tuple(map(int,input().split()))
for a_ij in a_i:
ans[a_ij-1] = 0
print((sum(ans)))
| 18 | 10 | 358 | 201 | def main():
n, k = tuple([int(t) for t in input().split()])
t = [0] * n
for _ in range(k):
eval(input())
k = tuple([int(t) - 1 for t in input().split()])
for k_i in k:
t[k_i] += 1
ans = 0
for t_i in t:
if t_i == 0:
ans += 1
print(ans)
if __name__ == "__main__":
main()
| n, k = tuple(map(int, input().split()))
ans = [1] * n
for i in range(k):
d = int(eval(input()))
a_i = tuple(map(int, input().split()))
for a_ij in a_i:
ans[a_ij - 1] = 0
print((sum(ans)))
| false | 44.444444 | [
"-def main():",
"- n, k = tuple([int(t) for t in input().split()])",
"- t = [0] * n",
"- for _ in range(k):",
"- eval(input())",
"- k = tuple([int(t) - 1 for t in input().split()])",
"- for k_i in k:",
"- t[k_i] += 1",
"- ans = 0",
"- for t_i in t:",
"- if t_i == 0:",
"- ans += 1",
"- print(ans)",
"-",
"-",
"-if __name__ == \"__main__\":",
"- main()",
"+n, k = tuple(map(int, input().split()))",
"+ans = [1] * n",
"+for i in range(k):",
"+ d = int(eval(input()))",
"+ a_i = tuple(map(int, input().split()))",
"+ for a_ij in a_i:",
"+ ans[a_ij - 1] = 0",
"+print((sum(ans)))"
] | false | 0.055844 | 0.072725 | 0.767873 | [
"s574971585",
"s918368137"
] |
u245641078 | p03292 | python | s491913437 | s443936950 | 31 | 25 | 9,176 | 9,076 | Accepted | Accepted | 19.35 | list1 = sorted(map(int,input().split()))
print((sum([abs(list1[i]-list1[i+1]) for i in range(0,len(list1)-1)]))) | *a,=list(map(int,input().split()))
print((max(a)-min(a))) | 2 | 2 | 111 | 50 | list1 = sorted(map(int, input().split()))
print((sum([abs(list1[i] - list1[i + 1]) for i in range(0, len(list1) - 1)])))
| (*a,) = list(map(int, input().split()))
print((max(a) - min(a)))
| false | 0 | [
"-list1 = sorted(map(int, input().split()))",
"-print((sum([abs(list1[i] - list1[i + 1]) for i in range(0, len(list1) - 1)])))",
"+(*a,) = list(map(int, input().split()))",
"+print((max(a) - min(a)))"
] | false | 0.037549 | 0.036313 | 1.034031 | [
"s491913437",
"s443936950"
] |
u457901067 | p02888 | python | s831150421 | s567380486 | 1,815 | 821 | 51,676 | 45,832 | Accepted | Accepted | 54.77 | import bisect
N = int(eval(input()))
L = list(map(int, input().split()))
L.sort()
ans = 0
# a <= b <= c
for b in range(1,N-1):
for c in range(b+1,N):
# search min(c) with a + b > c <=> a > c - b
idx = bisect.bisect_left(L[:b],L[c]-L[b]+1)
#print(L[b],L[c],idx)
ans += max(b-idx,0) if idx >= 0 else 0
#print(idx, ans)
#print(L)
print(ans) | import bisect
N = int(eval(input()))
L = list(map(int, input().split()))
L.sort()
ans = 0
# a <= b <= c
for b in range(1,N-1):
for c in range(b+1,N):
# search min(c) with a + b > c <=> a > c - b
idx = bisect.bisect_left(L,L[c]-L[b]+1)
#print(L[b],L[c],idx)
ans += max(b-idx,0) if idx >= 0 else 0
#print(idx, ans)
#print(L)
print(ans) | 18 | 18 | 374 | 370 | import bisect
N = int(eval(input()))
L = list(map(int, input().split()))
L.sort()
ans = 0
# a <= b <= c
for b in range(1, N - 1):
for c in range(b + 1, N):
# search min(c) with a + b > c <=> a > c - b
idx = bisect.bisect_left(L[:b], L[c] - L[b] + 1)
# print(L[b],L[c],idx)
ans += max(b - idx, 0) if idx >= 0 else 0
# print(idx, ans)
# print(L)
print(ans)
| import bisect
N = int(eval(input()))
L = list(map(int, input().split()))
L.sort()
ans = 0
# a <= b <= c
for b in range(1, N - 1):
for c in range(b + 1, N):
# search min(c) with a + b > c <=> a > c - b
idx = bisect.bisect_left(L, L[c] - L[b] + 1)
# print(L[b],L[c],idx)
ans += max(b - idx, 0) if idx >= 0 else 0
# print(idx, ans)
# print(L)
print(ans)
| false | 0 | [
"- idx = bisect.bisect_left(L[:b], L[c] - L[b] + 1)",
"+ idx = bisect.bisect_left(L, L[c] - L[b] + 1)"
] | false | 0.13624 | 0.007149 | 19.057675 | [
"s831150421",
"s567380486"
] |
u363407238 | p03457 | python | s183147372 | s471196759 | 421 | 339 | 3,060 | 3,060 | Accepted | Accepted | 19.48 | n = int(eval(input()))
bt, bx, by = 0, 0, 0
ans = 'Yes'
for i in range(n):
t, x, y = list(map(int, input().split()))
if ((t % 2 == 0 and (x + y) % 2 == 0) or (t % 2 == 1 and (x + y) % 2 == 1)) and (abs(x - bx) + abs(y - by) <= t - bt):
bt, bx, by = t, x, y
continue
else:
ans = 'No'
break
print(ans)
| n = int(eval(input()))
ans = "Yes"
for _ in range(n):
t, x, y = list(map(int, input().split()))
if (t < x + y) or (t + x + y) % 2 == 1:
ans = "No"
print(ans)
| 12 | 7 | 343 | 168 | n = int(eval(input()))
bt, bx, by = 0, 0, 0
ans = "Yes"
for i in range(n):
t, x, y = list(map(int, input().split()))
if ((t % 2 == 0 and (x + y) % 2 == 0) or (t % 2 == 1 and (x + y) % 2 == 1)) and (
abs(x - bx) + abs(y - by) <= t - bt
):
bt, bx, by = t, x, y
continue
else:
ans = "No"
break
print(ans)
| n = int(eval(input()))
ans = "Yes"
for _ in range(n):
t, x, y = list(map(int, input().split()))
if (t < x + y) or (t + x + y) % 2 == 1:
ans = "No"
print(ans)
| false | 41.666667 | [
"-bt, bx, by = 0, 0, 0",
"-for i in range(n):",
"+for _ in range(n):",
"- if ((t % 2 == 0 and (x + y) % 2 == 0) or (t % 2 == 1 and (x + y) % 2 == 1)) and (",
"- abs(x - bx) + abs(y - by) <= t - bt",
"- ):",
"- bt, bx, by = t, x, y",
"- continue",
"- else:",
"+ if (t < x + y) or (t + x + y) % 2 == 1:",
"- break"
] | false | 0.075444 | 0.052223 | 1.444645 | [
"s183147372",
"s471196759"
] |
u538276565 | p02889 | python | s815170905 | s103724816 | 801 | 512 | 17,632 | 18,844 | Accepted | Accepted | 36.08 | from scipy.sparse.csgraph import floyd_warshall
import numpy as np
N, M, L = map(int, input().split())
graph = np.full((N, N), 10**10)
for _ in range(M):
s, t, w = map(int, input().split())
if w <= L:
graph[s-1][t-1] = graph[t-1][s-1] = w
graph = floyd_warshall(graph, directed=False)
graph = floyd_warshall(graph <= L, directed=False)
graph[np.isinf(graph)] = 0
Q = int(input())
ans = []
for _ in range(Q):
s, t = map(int, input().split())
ans.append(int(graph[s-1][t-1]) - 1)
print(*ans, sep='\n')
| def use_fast_io():
global input
import io
import sys
f = io.BytesIO(sys.stdin.buffer.read())
input = f.readline
use_fast_io()
from scipy.sparse.csgraph import floyd_warshall
import numpy as np
def solve():
n, m, l = map(int, input().split())
graph = np.full((n, n), 10 ** 10)
for _ in range(m):
s, t, w = map(int, input().split())
if w <= l:
graph[s - 1][t - 1] = graph[t - 1][s - 1] = w
graph = floyd_warshall(graph, directed=False)
graph = floyd_warshall(graph <= l, directed=False)
graph[np.isinf(graph)] = 0
Q = int(input())
ans = []
for _ in range(Q):
s, t = map(int, input().split())
ans.append(int(graph[s - 1][t - 1]) - 1)
print(*ans, sep='\n')
if __name__ == '__main__':
solve()
| 19 | 34 | 545 | 836 | from scipy.sparse.csgraph import floyd_warshall
import numpy as np
N, M, L = map(int, input().split())
graph = np.full((N, N), 10**10)
for _ in range(M):
s, t, w = map(int, input().split())
if w <= L:
graph[s - 1][t - 1] = graph[t - 1][s - 1] = w
graph = floyd_warshall(graph, directed=False)
graph = floyd_warshall(graph <= L, directed=False)
graph[np.isinf(graph)] = 0
Q = int(input())
ans = []
for _ in range(Q):
s, t = map(int, input().split())
ans.append(int(graph[s - 1][t - 1]) - 1)
print(*ans, sep="\n")
| def use_fast_io():
global input
import io
import sys
f = io.BytesIO(sys.stdin.buffer.read())
input = f.readline
use_fast_io()
from scipy.sparse.csgraph import floyd_warshall
import numpy as np
def solve():
n, m, l = map(int, input().split())
graph = np.full((n, n), 10**10)
for _ in range(m):
s, t, w = map(int, input().split())
if w <= l:
graph[s - 1][t - 1] = graph[t - 1][s - 1] = w
graph = floyd_warshall(graph, directed=False)
graph = floyd_warshall(graph <= l, directed=False)
graph[np.isinf(graph)] = 0
Q = int(input())
ans = []
for _ in range(Q):
s, t = map(int, input().split())
ans.append(int(graph[s - 1][t - 1]) - 1)
print(*ans, sep="\n")
if __name__ == "__main__":
solve()
| false | 44.117647 | [
"+def use_fast_io():",
"+ global input",
"+ import io",
"+ import sys",
"+",
"+ f = io.BytesIO(sys.stdin.buffer.read())",
"+ input = f.readline",
"+",
"+",
"+use_fast_io()",
"-N, M, L = map(int, input().split())",
"-graph = np.full((N, N), 10**10)",
"-for _ in range(M):",
"- s, t, w = map(int, input().split())",
"- if w <= L:",
"- graph[s - 1][t - 1] = graph[t - 1][s - 1] = w",
"-graph = floyd_warshall(graph, directed=False)",
"-graph = floyd_warshall(graph <= L, directed=False)",
"-graph[np.isinf(graph)] = 0",
"-Q = int(input())",
"-ans = []",
"-for _ in range(Q):",
"- s, t = map(int, input().split())",
"- ans.append(int(graph[s - 1][t - 1]) - 1)",
"-print(*ans, sep=\"\\n\")",
"+",
"+def solve():",
"+ n, m, l = map(int, input().split())",
"+ graph = np.full((n, n), 10**10)",
"+ for _ in range(m):",
"+ s, t, w = map(int, input().split())",
"+ if w <= l:",
"+ graph[s - 1][t - 1] = graph[t - 1][s - 1] = w",
"+ graph = floyd_warshall(graph, directed=False)",
"+ graph = floyd_warshall(graph <= l, directed=False)",
"+ graph[np.isinf(graph)] = 0",
"+ Q = int(input())",
"+ ans = []",
"+ for _ in range(Q):",
"+ s, t = map(int, input().split())",
"+ ans.append(int(graph[s - 1][t - 1]) - 1)",
"+ print(*ans, sep=\"\\n\")",
"+",
"+",
"+if __name__ == \"__main__\":",
"+ solve()"
] | false | 0.539567 | 0.582765 | 0.925874 | [
"s815170905",
"s103724816"
] |
u896791216 | p03680 | python | s293512281 | s182208094 | 217 | 193 | 7,084 | 7,084 | Accepted | Accepted | 11.06 | n = int(eval(input()))
a = [int(eval(input())) for i in range(n)]
j = 0
for k in range(n):
j = a[j] - 1
if j == 1:
print((k+1))
break
elif k == n-1:
print((-1))
else:
pass | n = int(eval(input()))
a = [int(eval(input())) for i in range(n)]
j = 0
for k in range(n):
j = a[j] - 1
if j == 1:
print((k+1))
break
else:
pass
else:
print((-1)) | 12 | 12 | 214 | 197 | n = int(eval(input()))
a = [int(eval(input())) for i in range(n)]
j = 0
for k in range(n):
j = a[j] - 1
if j == 1:
print((k + 1))
break
elif k == n - 1:
print((-1))
else:
pass
| n = int(eval(input()))
a = [int(eval(input())) for i in range(n)]
j = 0
for k in range(n):
j = a[j] - 1
if j == 1:
print((k + 1))
break
else:
pass
else:
print((-1))
| false | 0 | [
"- elif k == n - 1:",
"- print((-1))",
"+else:",
"+ print((-1))"
] | false | 0.035514 | 0.035186 | 1.00931 | [
"s293512281",
"s182208094"
] |
u368796742 | p03014 | python | s631025691 | s381818291 | 1,259 | 1,031 | 251,656 | 126,680 | Accepted | Accepted | 18.11 | def main():
h,w = list(map(int,input().split()))
l = [list(eval(input())) for i in range(h)]
c1 = [[0 for i in range(w)] for i in range(h)]
c2 = [[0 for i in range(w)] for i in range(h)]
ans = 0
for i in range(h):
for j in range(w):
if c1[i][j] == 0:
n = 0
k = i
while k < h:
if l[k][j] == ".":
n +=1
k += 1
else:
break
for r in range(i,k):
c1[r][j] = n
if c2[i][j] == 0:
n = 0
k = j
while k < w:
if l[i][k] == ".":
n +=1
k += 1
else:
break
for r in range(j,k):
c2[i][r] = n
ans = max(ans,c1[i][j]+c2[i][j])
print((ans-1))
if __name__ == "__main__":
main() | h,w = list(map(int,input().split()))
maze = [eval(input()) for _ in range(h)]
dph = [[0 for _ in range(w)] for _ in range(h)]
dpw = [[0 for _ in range(w)] for _ in range(h)]
for i in range(h):
for j in range(w):
if maze[i][j] == '#':
continue
if dpw[i][j] != 0:
continue
k = j
count = 0
while k< w:
if maze[i][k] == '.':
count += 1
k += 1
else:
break
for l in range(j,k):
dpw[i][l] = count
for i in range(w):
for j in range(h):
if maze[j][i] == '#':
continue
if dph[j][i] != 0:
continue
k = j
count = 0
while k< h:
if maze[k][i] == '.':
count += 1
k += 1
else:
break
for l in range(j,k):
dph[l][i] = count
ans = 0
for i in range(h):
for j in range(w):
ans = max(ans, dpw[i][j] + dph[i][j])
print((ans-1))
| 39 | 48 | 1,069 | 929 | def main():
h, w = list(map(int, input().split()))
l = [list(eval(input())) for i in range(h)]
c1 = [[0 for i in range(w)] for i in range(h)]
c2 = [[0 for i in range(w)] for i in range(h)]
ans = 0
for i in range(h):
for j in range(w):
if c1[i][j] == 0:
n = 0
k = i
while k < h:
if l[k][j] == ".":
n += 1
k += 1
else:
break
for r in range(i, k):
c1[r][j] = n
if c2[i][j] == 0:
n = 0
k = j
while k < w:
if l[i][k] == ".":
n += 1
k += 1
else:
break
for r in range(j, k):
c2[i][r] = n
ans = max(ans, c1[i][j] + c2[i][j])
print((ans - 1))
if __name__ == "__main__":
main()
| h, w = list(map(int, input().split()))
maze = [eval(input()) for _ in range(h)]
dph = [[0 for _ in range(w)] for _ in range(h)]
dpw = [[0 for _ in range(w)] for _ in range(h)]
for i in range(h):
for j in range(w):
if maze[i][j] == "#":
continue
if dpw[i][j] != 0:
continue
k = j
count = 0
while k < w:
if maze[i][k] == ".":
count += 1
k += 1
else:
break
for l in range(j, k):
dpw[i][l] = count
for i in range(w):
for j in range(h):
if maze[j][i] == "#":
continue
if dph[j][i] != 0:
continue
k = j
count = 0
while k < h:
if maze[k][i] == ".":
count += 1
k += 1
else:
break
for l in range(j, k):
dph[l][i] = count
ans = 0
for i in range(h):
for j in range(w):
ans = max(ans, dpw[i][j] + dph[i][j])
print((ans - 1))
| false | 18.75 | [
"-def main():",
"- h, w = list(map(int, input().split()))",
"- l = [list(eval(input())) for i in range(h)]",
"- c1 = [[0 for i in range(w)] for i in range(h)]",
"- c2 = [[0 for i in range(w)] for i in range(h)]",
"- ans = 0",
"- for i in range(h):",
"- for j in range(w):",
"- if c1[i][j] == 0:",
"- n = 0",
"- k = i",
"- while k < h:",
"- if l[k][j] == \".\":",
"- n += 1",
"- k += 1",
"- else:",
"- break",
"- for r in range(i, k):",
"- c1[r][j] = n",
"- if c2[i][j] == 0:",
"- n = 0",
"- k = j",
"- while k < w:",
"- if l[i][k] == \".\":",
"- n += 1",
"- k += 1",
"- else:",
"- break",
"- for r in range(j, k):",
"- c2[i][r] = n",
"- ans = max(ans, c1[i][j] + c2[i][j])",
"- print((ans - 1))",
"-",
"-",
"-if __name__ == \"__main__\":",
"- main()",
"+h, w = list(map(int, input().split()))",
"+maze = [eval(input()) for _ in range(h)]",
"+dph = [[0 for _ in range(w)] for _ in range(h)]",
"+dpw = [[0 for _ in range(w)] for _ in range(h)]",
"+for i in range(h):",
"+ for j in range(w):",
"+ if maze[i][j] == \"#\":",
"+ continue",
"+ if dpw[i][j] != 0:",
"+ continue",
"+ k = j",
"+ count = 0",
"+ while k < w:",
"+ if maze[i][k] == \".\":",
"+ count += 1",
"+ k += 1",
"+ else:",
"+ break",
"+ for l in range(j, k):",
"+ dpw[i][l] = count",
"+for i in range(w):",
"+ for j in range(h):",
"+ if maze[j][i] == \"#\":",
"+ continue",
"+ if dph[j][i] != 0:",
"+ continue",
"+ k = j",
"+ count = 0",
"+ while k < h:",
"+ if maze[k][i] == \".\":",
"+ count += 1",
"+ k += 1",
"+ else:",
"+ break",
"+ for l in range(j, k):",
"+ dph[l][i] = count",
"+ans = 0",
"+for i in range(h):",
"+ for j in range(w):",
"+ ans = max(ans, dpw[i][j] + dph[i][j])",
"+print((ans - 1))"
] | false | 0.107903 | 0.201327 | 0.535961 | [
"s631025691",
"s381818291"
] |
u397384480 | p02756 | python | s269039625 | s059612343 | 1,970 | 1,485 | 106,712 | 102,876 | Accepted | Accepted | 24.62 | from collections import deque
S = deque(eval(input()))
Q = int(eval(input()))
lst = deque()
for i in range(Q):
tmp = list(input().split())
lst.append(tmp)
reverse = 0
c = 1
for i in range(Q):
if int(lst[i][0]) == 1:
reverse += 1
c += 1
if int(lst[i][0]) == 2:
if c%2 == 1:
if int(lst[i][1]) == 1:
S.appendleft(lst[i][2])
else:
S.append(lst[i][2])
else:
if int(lst[i][1]) == 2:
S.appendleft(lst[i][2])
else:
S.append(lst[i][2])
if reverse%2 == 1:
S.reverse()
ans = "".join(S)
print(ans) | from collections import deque
import sys
input = sys.stdin.readline
S = deque(input().rstrip())
Q = int(eval(input()))
lst = deque()
for i in range(Q):
tmp = list(input().split())
lst.append(tmp)
reverse = 0
c = 1
for i in range(Q):
if int(lst[i][0]) == 1:
reverse += 1
c += 1
if int(lst[i][0]) == 2:
if c%2 == 1:
if int(lst[i][1]) == 1:
S.appendleft(lst[i][2])
else:
S.append(lst[i][2])
else:
if int(lst[i][1]) == 2:
S.appendleft(lst[i][2])
else:
S.append(lst[i][2])
if reverse%2 == 1:
S.reverse()
ans = "".join(S)
print(ans) | 35 | 37 | 682 | 735 | from collections import deque
S = deque(eval(input()))
Q = int(eval(input()))
lst = deque()
for i in range(Q):
tmp = list(input().split())
lst.append(tmp)
reverse = 0
c = 1
for i in range(Q):
if int(lst[i][0]) == 1:
reverse += 1
c += 1
if int(lst[i][0]) == 2:
if c % 2 == 1:
if int(lst[i][1]) == 1:
S.appendleft(lst[i][2])
else:
S.append(lst[i][2])
else:
if int(lst[i][1]) == 2:
S.appendleft(lst[i][2])
else:
S.append(lst[i][2])
if reverse % 2 == 1:
S.reverse()
ans = "".join(S)
print(ans)
| from collections import deque
import sys
input = sys.stdin.readline
S = deque(input().rstrip())
Q = int(eval(input()))
lst = deque()
for i in range(Q):
tmp = list(input().split())
lst.append(tmp)
reverse = 0
c = 1
for i in range(Q):
if int(lst[i][0]) == 1:
reverse += 1
c += 1
if int(lst[i][0]) == 2:
if c % 2 == 1:
if int(lst[i][1]) == 1:
S.appendleft(lst[i][2])
else:
S.append(lst[i][2])
else:
if int(lst[i][1]) == 2:
S.appendleft(lst[i][2])
else:
S.append(lst[i][2])
if reverse % 2 == 1:
S.reverse()
ans = "".join(S)
print(ans)
| false | 5.405405 | [
"+import sys",
"-S = deque(eval(input()))",
"+input = sys.stdin.readline",
"+S = deque(input().rstrip())"
] | false | 0.04819 | 0.075424 | 0.638919 | [
"s269039625",
"s059612343"
] |
u311299757 | p02412 | python | s001123265 | s493019358 | 520 | 330 | 7,716 | 7,716 | Accepted | Accepted | 36.54 | while True:
n, x = (int(x) for x in input().split())
if (n, x) == (0, 0): break
cnt = 0
for i in range(1, n + 1):
for j in range(i + 1, n + 1):
for k in range(j + 1, n + 1):
if i + j + k == x:
cnt += 1
print(cnt) | while True:
n, x = (int(x) for x in input().split())
if (n, x) == (0, 0): break
cnt = sum(1 for i in range(1, n+1) for j in range(i+1, n+1) for k in range(j+1, n+1) if i + j + k == x)
print(cnt) | 12 | 5 | 301 | 214 | while True:
n, x = (int(x) for x in input().split())
if (n, x) == (0, 0):
break
cnt = 0
for i in range(1, n + 1):
for j in range(i + 1, n + 1):
for k in range(j + 1, n + 1):
if i + j + k == x:
cnt += 1
print(cnt)
| while True:
n, x = (int(x) for x in input().split())
if (n, x) == (0, 0):
break
cnt = sum(
1
for i in range(1, n + 1)
for j in range(i + 1, n + 1)
for k in range(j + 1, n + 1)
if i + j + k == x
)
print(cnt)
| false | 58.333333 | [
"- cnt = 0",
"- for i in range(1, n + 1):",
"- for j in range(i + 1, n + 1):",
"- for k in range(j + 1, n + 1):",
"- if i + j + k == x:",
"- cnt += 1",
"+ cnt = sum(",
"+ 1",
"+ for i in range(1, n + 1)",
"+ for j in range(i + 1, n + 1)",
"+ for k in range(j + 1, n + 1)",
"+ if i + j + k == x",
"+ )"
] | false | 0.007556 | 0.035952 | 0.210182 | [
"s001123265",
"s493019358"
] |
u860002137 | p03274 | python | s747860454 | s492934019 | 89 | 77 | 14,384 | 14,252 | Accepted | Accepted | 13.48 | n, k = list(map(int, input().split()))
x = list(map(int, input().split()))
ans = []
for i in range(n - k + 1):
left = x[i]
right = x[i + k - 1]
ans.append(min(abs(left) + abs(right - left),
abs(right) + abs(left - right)))
print((min(ans))) | n, k = list(map(int, input().split()))
x = list(map(int, input().split()))
ans = []
for i in range(n - k + 1):
left = x[i]
right = x[i + k - 1]
if abs(left) > abs(right):
ans.append(abs(right) + abs(left - right))
else:
ans.append(abs(left) + abs(right - left))
print((min(ans))) | 11 | 13 | 275 | 317 | n, k = list(map(int, input().split()))
x = list(map(int, input().split()))
ans = []
for i in range(n - k + 1):
left = x[i]
right = x[i + k - 1]
ans.append(min(abs(left) + abs(right - left), abs(right) + abs(left - right)))
print((min(ans)))
| n, k = list(map(int, input().split()))
x = list(map(int, input().split()))
ans = []
for i in range(n - k + 1):
left = x[i]
right = x[i + k - 1]
if abs(left) > abs(right):
ans.append(abs(right) + abs(left - right))
else:
ans.append(abs(left) + abs(right - left))
print((min(ans)))
| false | 15.384615 | [
"- ans.append(min(abs(left) + abs(right - left), abs(right) + abs(left - right)))",
"+ if abs(left) > abs(right):",
"+ ans.append(abs(right) + abs(left - right))",
"+ else:",
"+ ans.append(abs(left) + abs(right - left))"
] | false | 0.097697 | 0.085658 | 1.140548 | [
"s747860454",
"s492934019"
] |
u333139319 | p03160 | python | s955027387 | s175596987 | 222 | 120 | 52,208 | 13,928 | Accepted | Accepted | 45.95 | n = int(eval(input()))
h = [int(i) for i in input().split()]
#dp[i] = そこに辿り着くまでのコスト
#初期条件 dp[0] = 0, dp[1] = |h[1] - h[0]|, dp[2以上] = 10 ** 9 + 7
dp = [10**9+7] * n
dp[0] = 0
dp[1] = abs(h[1] - h[0])
if n == 2:
print((dp[1]))
else:
for i in range(2,n):
dp[i] = min(dp[i-1] + abs(h[i] - h[i-1]),dp[i-2] + abs(h[i]-h[i-2]))
print((dp[n-1]))
| n = int(eval(input()))
h = [int(i) for i in input().split()]
dp = [0,abs(h[1]-h[0])]
for i in range(2,n):
dp.append(min(dp[-2] + abs(h[i] - h[i-2]),dp[-1] + abs(h[i] - h[i-1])))
print((dp[n-1]))
| 14 | 7 | 363 | 198 | n = int(eval(input()))
h = [int(i) for i in input().split()]
# dp[i] = そこに辿り着くまでのコスト
# 初期条件 dp[0] = 0, dp[1] = |h[1] - h[0]|, dp[2以上] = 10 ** 9 + 7
dp = [10**9 + 7] * n
dp[0] = 0
dp[1] = abs(h[1] - h[0])
if n == 2:
print((dp[1]))
else:
for i in range(2, n):
dp[i] = min(dp[i - 1] + abs(h[i] - h[i - 1]), dp[i - 2] + abs(h[i] - h[i - 2]))
print((dp[n - 1]))
| n = int(eval(input()))
h = [int(i) for i in input().split()]
dp = [0, abs(h[1] - h[0])]
for i in range(2, n):
dp.append(min(dp[-2] + abs(h[i] - h[i - 2]), dp[-1] + abs(h[i] - h[i - 1])))
print((dp[n - 1]))
| false | 50 | [
"-# dp[i] = そこに辿り着くまでのコスト",
"-# 初期条件 dp[0] = 0, dp[1] = |h[1] - h[0]|, dp[2以上] = 10 ** 9 + 7",
"-dp = [10**9 + 7] * n",
"-dp[0] = 0",
"-dp[1] = abs(h[1] - h[0])",
"-if n == 2:",
"- print((dp[1]))",
"-else:",
"- for i in range(2, n):",
"- dp[i] = min(dp[i - 1] + abs(h[i] - h[i - 1]), dp[i - 2] + abs(h[i] - h[i - 2]))",
"- print((dp[n - 1]))",
"+dp = [0, abs(h[1] - h[0])]",
"+for i in range(2, n):",
"+ dp.append(min(dp[-2] + abs(h[i] - h[i - 2]), dp[-1] + abs(h[i] - h[i - 1])))",
"+print((dp[n - 1]))"
] | false | 0.092053 | 0.102537 | 0.897752 | [
"s955027387",
"s175596987"
] |
u013756322 | p03001 | python | s545872300 | s353453650 | 181 | 165 | 38,384 | 38,256 | Accepted | Accepted | 8.84 | import sys
input = sys.stdin.readline
W, H, x, y = list(map(int, input().split()))
S = W * H * 0.5
if (x != 0 and y/x == H/W and W % 2 == 0):
print((S, 1))
else:
print((S, 0)) | import sys
input = sys.stdin.readline
W, H, x, y = list(map(int, input().split()))
S = W * H * 0.5
center = (W / 2, H / 2)
p = (x, y)
if (p == center):
print((S, 1))
else:
print((S, 0)) | 8 | 10 | 176 | 188 | import sys
input = sys.stdin.readline
W, H, x, y = list(map(int, input().split()))
S = W * H * 0.5
if x != 0 and y / x == H / W and W % 2 == 0:
print((S, 1))
else:
print((S, 0))
| import sys
input = sys.stdin.readline
W, H, x, y = list(map(int, input().split()))
S = W * H * 0.5
center = (W / 2, H / 2)
p = (x, y)
if p == center:
print((S, 1))
else:
print((S, 0))
| false | 20 | [
"-if x != 0 and y / x == H / W and W % 2 == 0:",
"+center = (W / 2, H / 2)",
"+p = (x, y)",
"+if p == center:"
] | false | 0.036469 | 0.042139 | 0.865427 | [
"s545872300",
"s353453650"
] |
u399892098 | p00710 | python | s902948185 | s162013469 | 40 | 30 | 6,276 | 6,172 | Accepted | Accepted | 25 | while True:
n,r = list(map(int,input().split()))
if(n == 0 and r == 0):
break
n_list = []
for i in range(n):
n_list.append(i+1)
for i in range(r):
p,c = list(map(int, input().split()))
n_list = n_list[0:n-(p-1)-c] + n_list[n-(p-1):n] + n_list[n-(p-1)-c:n-(p-1)]
print(n_list[n-1]) | while True:
n,r = list(map(int,input().split()))
if(n == 0 and r == 0):
break
li = []
for i in range(1,n+1):
li.append(i)
for i in range(r):
temp_lis1 = []
p,c = list(map(int,input().split()))
if(c == 1):
temp_lis1.append(li[n-p])
del(li[n-p])
else:
temp_lis1.extend(li[n-p-c+1:n-p+1])
del(li[n-p-c+1:n-p+1])
li.extend(temp_lis1)
print(li[n-1]) | 11 | 18 | 344 | 486 | while True:
n, r = list(map(int, input().split()))
if n == 0 and r == 0:
break
n_list = []
for i in range(n):
n_list.append(i + 1)
for i in range(r):
p, c = list(map(int, input().split()))
n_list = (
n_list[0 : n - (p - 1) - c]
+ n_list[n - (p - 1) : n]
+ n_list[n - (p - 1) - c : n - (p - 1)]
)
print(n_list[n - 1])
| while True:
n, r = list(map(int, input().split()))
if n == 0 and r == 0:
break
li = []
for i in range(1, n + 1):
li.append(i)
for i in range(r):
temp_lis1 = []
p, c = list(map(int, input().split()))
if c == 1:
temp_lis1.append(li[n - p])
del li[n - p]
else:
temp_lis1.extend(li[n - p - c + 1 : n - p + 1])
del li[n - p - c + 1 : n - p + 1]
li.extend(temp_lis1)
print(li[n - 1])
| false | 38.888889 | [
"- n_list = []",
"- for i in range(n):",
"- n_list.append(i + 1)",
"+ li = []",
"+ for i in range(1, n + 1):",
"+ li.append(i)",
"+ temp_lis1 = []",
"- n_list = (",
"- n_list[0 : n - (p - 1) - c]",
"- + n_list[n - (p - 1) : n]",
"- + n_list[n - (p - 1) - c : n - (p - 1)]",
"- )",
"- print(n_list[n - 1])",
"+ if c == 1:",
"+ temp_lis1.append(li[n - p])",
"+ del li[n - p]",
"+ else:",
"+ temp_lis1.extend(li[n - p - c + 1 : n - p + 1])",
"+ del li[n - p - c + 1 : n - p + 1]",
"+ li.extend(temp_lis1)",
"+ print(li[n - 1])"
] | false | 0.042515 | 0.036686 | 1.158899 | [
"s902948185",
"s162013469"
] |
u588341295 | p03476 | python | s803643803 | s000094083 | 1,036 | 327 | 9,816 | 9,052 | Accepted | Accepted | 68.44 | # -*- coding: utf-8 -*-
from math import sqrt
# 素数判定用関数
def is_prime2(num):
if num < 2:
return False
if num == 2 or num == 3 or num == 5:
return True
if num % 2 == 0 or num % 3 == 0 or num % 5 == 0:
return False
# 疑似素数(2でも3でも割り切れない数字)で次々に割っていく
prime = 7
step = 4
num_sqrt = sqrt(num)
while prime <= num_sqrt:
if num % prime == 0:
return False
prime += step
step = 6 - step
return True
# 同じ数2回素数判定やりたくないのでここに保存
prime = [is_prime2(i) for i in range(100001)]
# 2017に似た数
like2017 = [0] * 100001
for i in range(1, 100001, 2):
if prime[i] and prime[(i+1)//2]:
like2017[i] = 1
# 累積和
sm = [0] * 100001
for i in range(1, 100001):
sm[i] = sm[i-1] + like2017[i]
Q = int(eval(input()))
for i in range(Q):
l, r = list(map(int, input().split()))
# 累積和から各QはO(1)で出せる
print((sm[r]-sm[l-1]))
| # -*- coding: utf-8 -*-
import sys
from itertools import accumulate
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]
def ceil(x, y=1): return int(-(-x // y))
def INT(): return int(eval(input()))
def MAP(): return list(map(int, input().split()))
def LIST(N=None): return list(MAP()) if N is None else [INT() for i in range(N)]
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
MOD = 10 ** 9 + 7
def eratosthenes_sieve(n):
""" 素数列挙(エラトステネスの篩) """
table = [0] * (n + 1)
prime_list = []
for i in range(2, n + 1):
if table[i] == 0:
prime_list.append(i)
for j in range(i + i, n + 1, i):
table[j] = 1
return prime_list
N = 100000
primes = set(eratosthenes_sieve(N+1))
A = [0] * (N+1)
for a in range(1, N+1, 2):
if a in primes and (a+1)//2 in primes:
A[a] = 1
acc = [0] + list(accumulate(A))
for i in range(INT()):
l, r = MAP()
ans = acc[r+1] - acc[l]
print(ans)
| 40 | 46 | 927 | 1,316 | # -*- coding: utf-8 -*-
from math import sqrt
# 素数判定用関数
def is_prime2(num):
if num < 2:
return False
if num == 2 or num == 3 or num == 5:
return True
if num % 2 == 0 or num % 3 == 0 or num % 5 == 0:
return False
# 疑似素数(2でも3でも割り切れない数字)で次々に割っていく
prime = 7
step = 4
num_sqrt = sqrt(num)
while prime <= num_sqrt:
if num % prime == 0:
return False
prime += step
step = 6 - step
return True
# 同じ数2回素数判定やりたくないのでここに保存
prime = [is_prime2(i) for i in range(100001)]
# 2017に似た数
like2017 = [0] * 100001
for i in range(1, 100001, 2):
if prime[i] and prime[(i + 1) // 2]:
like2017[i] = 1
# 累積和
sm = [0] * 100001
for i in range(1, 100001):
sm[i] = sm[i - 1] + like2017[i]
Q = int(eval(input()))
for i in range(Q):
l, r = list(map(int, input().split()))
# 累積和から各QはO(1)で出せる
print((sm[r] - sm[l - 1]))
| # -*- coding: utf-8 -*-
import sys
from itertools import accumulate
def input():
return sys.stdin.readline().strip()
def list2d(a, b, c):
return [[c] * b for i in range(a)]
def list3d(a, b, c, d):
return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e):
return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]
def ceil(x, y=1):
return int(-(-x // y))
def INT():
return int(eval(input()))
def MAP():
return list(map(int, input().split()))
def LIST(N=None):
return list(MAP()) if N is None else [INT() for i in range(N)]
def Yes():
print("Yes")
def No():
print("No")
def YES():
print("YES")
def NO():
print("NO")
sys.setrecursionlimit(10**9)
INF = float("inf")
MOD = 10**9 + 7
def eratosthenes_sieve(n):
"""素数列挙(エラトステネスの篩)"""
table = [0] * (n + 1)
prime_list = []
for i in range(2, n + 1):
if table[i] == 0:
prime_list.append(i)
for j in range(i + i, n + 1, i):
table[j] = 1
return prime_list
N = 100000
primes = set(eratosthenes_sieve(N + 1))
A = [0] * (N + 1)
for a in range(1, N + 1, 2):
if a in primes and (a + 1) // 2 in primes:
A[a] = 1
acc = [0] + list(accumulate(A))
for i in range(INT()):
l, r = MAP()
ans = acc[r + 1] - acc[l]
print(ans)
| false | 13.043478 | [
"-from math import sqrt",
"-",
"-# 素数判定用関数",
"-def is_prime2(num):",
"- if num < 2:",
"- return False",
"- if num == 2 or num == 3 or num == 5:",
"- return True",
"- if num % 2 == 0 or num % 3 == 0 or num % 5 == 0:",
"- return False",
"- # 疑似素数(2でも3でも割り切れない数字)で次々に割っていく",
"- prime = 7",
"- step = 4",
"- num_sqrt = sqrt(num)",
"- while prime <= num_sqrt:",
"- if num % prime == 0:",
"- return False",
"- prime += step",
"- step = 6 - step",
"- return True",
"+import sys",
"+from itertools import accumulate",
"-# 同じ数2回素数判定やりたくないのでここに保存",
"-prime = [is_prime2(i) for i in range(100001)]",
"-# 2017に似た数",
"-like2017 = [0] * 100001",
"-for i in range(1, 100001, 2):",
"- if prime[i] and prime[(i + 1) // 2]:",
"- like2017[i] = 1",
"-# 累積和",
"-sm = [0] * 100001",
"-for i in range(1, 100001):",
"- sm[i] = sm[i - 1] + like2017[i]",
"-Q = int(eval(input()))",
"-for i in range(Q):",
"- l, r = list(map(int, input().split()))",
"- # 累積和から各QはO(1)で出せる",
"- print((sm[r] - sm[l - 1]))",
"+def input():",
"+ return sys.stdin.readline().strip()",
"+",
"+",
"+def list2d(a, b, c):",
"+ return [[c] * b for i in range(a)]",
"+",
"+",
"+def list3d(a, b, c, d):",
"+ return [[[d] * c for j in range(b)] for i in range(a)]",
"+",
"+",
"+def list4d(a, b, c, d, e):",
"+ return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]",
"+",
"+",
"+def ceil(x, y=1):",
"+ return int(-(-x // y))",
"+",
"+",
"+def INT():",
"+ return int(eval(input()))",
"+",
"+",
"+def MAP():",
"+ return list(map(int, input().split()))",
"+",
"+",
"+def LIST(N=None):",
"+ return list(MAP()) if N is None else [INT() for i in range(N)]",
"+",
"+",
"+def Yes():",
"+ print(\"Yes\")",
"+",
"+",
"+def No():",
"+ print(\"No\")",
"+",
"+",
"+def YES():",
"+ print(\"YES\")",
"+",
"+",
"+def NO():",
"+ print(\"NO\")",
"+",
"+",
"+sys.setrecursionlimit(10**9)",
"+INF = float(\"inf\")",
"+MOD = 10**9 + 7",
"+",
"+",
"+def eratosthenes_sieve(n):",
"+ \"\"\"素数列挙(エラトステネスの篩)\"\"\"",
"+ table = [0] * (n + 1)",
"+ prime_list = []",
"+ for i in range(2, n + 1):",
"+ if table[i] == 0:",
"+ prime_list.append(i)",
"+ for j in range(i + i, n + 1, i):",
"+ table[j] = 1",
"+ return prime_list",
"+",
"+",
"+N = 100000",
"+primes = set(eratosthenes_sieve(N + 1))",
"+A = [0] * (N + 1)",
"+for a in range(1, N + 1, 2):",
"+ if a in primes and (a + 1) // 2 in primes:",
"+ A[a] = 1",
"+acc = [0] + list(accumulate(A))",
"+for i in range(INT()):",
"+ l, r = MAP()",
"+ ans = acc[r + 1] - acc[l]",
"+ print(ans)"
] | false | 0.257868 | 0.235266 | 1.096067 | [
"s803643803",
"s000094083"
] |
u840310460 | p03370 | python | s403180389 | s304015843 | 198 | 18 | 38,256 | 2,940 | Accepted | Accepted | 90.91 | N, X = list(map(int, input().split()))
m = [int(eval(input())) for i in range(N)]
XX = X - sum(m)
ans = N + XX // min(m)
print(ans) | N, X = [int(i) for i in input().split()]
m = [int(eval(input())) for i in range(N)]
X_2 = X - sum([m[i] for i in range(N)])
print((N + X_2 // min(m))) | 5 | 5 | 123 | 147 | N, X = list(map(int, input().split()))
m = [int(eval(input())) for i in range(N)]
XX = X - sum(m)
ans = N + XX // min(m)
print(ans)
| N, X = [int(i) for i in input().split()]
m = [int(eval(input())) for i in range(N)]
X_2 = X - sum([m[i] for i in range(N)])
print((N + X_2 // min(m)))
| false | 0 | [
"-N, X = list(map(int, input().split()))",
"+N, X = [int(i) for i in input().split()]",
"-XX = X - sum(m)",
"-ans = N + XX // min(m)",
"-print(ans)",
"+X_2 = X - sum([m[i] for i in range(N)])",
"+print((N + X_2 // min(m)))"
] | false | 0.083975 | 0.063087 | 1.331085 | [
"s403180389",
"s304015843"
] |
u439396449 | p03241 | python | s567887671 | s472892657 | 25 | 22 | 3,444 | 3,060 | Accepted | Accepted | 12 | from collections import Counter
N, M = list(map(int, input().split()))
def factorize(n):
if n == 1:
return [1]
i, factors = 2, []
while i * i <= n:
while n % i == 0:
n //= i
factors.append(i)
i += 1
if n > 1:
factors.append(n)
return factors
c = Counter(factorize(M))
a = [1]
for k, v in list(c.items()):
tmp = []
for x in a:
for i in range(v + 1):
tmp.append(x * (k**i))
a = list(set(a) | set(tmp))
ans = 0
for x in a:
y = M // x
if N <= y:
ans = max(ans, x)
print(ans)
| N, M = list(map(int, input().split()))
def make_divisors(n):
i, divisors = 1, []
while i * i <= n:
if n % i == 0:
divisors.append(i)
if i != n // i:
divisors.append(n // i)
i += 1
return divisors
ans = 0
for x in make_divisors(M):
if N <= M // x:
ans = max(ans, x)
print(ans)
| 35 | 19 | 624 | 372 | from collections import Counter
N, M = list(map(int, input().split()))
def factorize(n):
if n == 1:
return [1]
i, factors = 2, []
while i * i <= n:
while n % i == 0:
n //= i
factors.append(i)
i += 1
if n > 1:
factors.append(n)
return factors
c = Counter(factorize(M))
a = [1]
for k, v in list(c.items()):
tmp = []
for x in a:
for i in range(v + 1):
tmp.append(x * (k**i))
a = list(set(a) | set(tmp))
ans = 0
for x in a:
y = M // x
if N <= y:
ans = max(ans, x)
print(ans)
| N, M = list(map(int, input().split()))
def make_divisors(n):
i, divisors = 1, []
while i * i <= n:
if n % i == 0:
divisors.append(i)
if i != n // i:
divisors.append(n // i)
i += 1
return divisors
ans = 0
for x in make_divisors(M):
if N <= M // x:
ans = max(ans, x)
print(ans)
| false | 45.714286 | [
"-from collections import Counter",
"-",
"-def factorize(n):",
"- if n == 1:",
"- return [1]",
"- i, factors = 2, []",
"+def make_divisors(n):",
"+ i, divisors = 1, []",
"- while n % i == 0:",
"- n //= i",
"- factors.append(i)",
"+ if n % i == 0:",
"+ divisors.append(i)",
"+ if i != n // i:",
"+ divisors.append(n // i)",
"- if n > 1:",
"- factors.append(n)",
"- return factors",
"+ return divisors",
"-c = Counter(factorize(M))",
"-a = [1]",
"-for k, v in list(c.items()):",
"- tmp = []",
"- for x in a:",
"- for i in range(v + 1):",
"- tmp.append(x * (k**i))",
"- a = list(set(a) | set(tmp))",
"-for x in a:",
"- y = M // x",
"- if N <= y:",
"+for x in make_divisors(M):",
"+ if N <= M // x:"
] | false | 0.043473 | 0.047364 | 0.917853 | [
"s567887671",
"s472892657"
] |
u289547799 | p03545 | python | s994200042 | s424767322 | 19 | 17 | 3,188 | 3,064 | Accepted | Accepted | 10.53 | s = list(eval(input()))
import sys
def bitlist(n, a, b):
res = []
for i in range(2**n):
pattern = []
for j in range(n):
if (i >> j) & 1:
pattern.insert(0, a)
else:
pattern.insert(0, b)
res.append(pattern)
return res
n = len(s)
lst = bitlist(n-1, "+", "-")
for i in range(2**n):
calc = int(s[0])
for j in range(n-1):
if lst[i][j] == "+":
calc += int(s[j+1])
else:
calc -= int(s[j+1])
if calc == 7:
res = s[0]
for k in range(n-1):
res += lst[i][k] + s[k+1]
res += "=7"
print(res)
sys.exit() | s = list(eval(input()))
import sys
def bitlist(n, a, b):
res = []
for i in range(2**n):
pattern = []
for j in range(n):
if (i >> j) & 1:
pattern.insert(0, a)
else:
pattern.insert(0, b)
res.append(pattern)
return res
n = len(s)
lst = bitlist(n-1, "+", "-")
for i in range(2**(n-1)):
calc = s[0]
for j in range(n-1):
calc += lst[i][j] + s[j+1]
if eval(calc) == 7:
calc += "=7"
print(calc)
sys.exit() | 30 | 24 | 610 | 483 | s = list(eval(input()))
import sys
def bitlist(n, a, b):
res = []
for i in range(2**n):
pattern = []
for j in range(n):
if (i >> j) & 1:
pattern.insert(0, a)
else:
pattern.insert(0, b)
res.append(pattern)
return res
n = len(s)
lst = bitlist(n - 1, "+", "-")
for i in range(2**n):
calc = int(s[0])
for j in range(n - 1):
if lst[i][j] == "+":
calc += int(s[j + 1])
else:
calc -= int(s[j + 1])
if calc == 7:
res = s[0]
for k in range(n - 1):
res += lst[i][k] + s[k + 1]
res += "=7"
print(res)
sys.exit()
| s = list(eval(input()))
import sys
def bitlist(n, a, b):
res = []
for i in range(2**n):
pattern = []
for j in range(n):
if (i >> j) & 1:
pattern.insert(0, a)
else:
pattern.insert(0, b)
res.append(pattern)
return res
n = len(s)
lst = bitlist(n - 1, "+", "-")
for i in range(2 ** (n - 1)):
calc = s[0]
for j in range(n - 1):
calc += lst[i][j] + s[j + 1]
if eval(calc) == 7:
calc += "=7"
print(calc)
sys.exit()
| false | 20 | [
"-for i in range(2**n):",
"- calc = int(s[0])",
"+for i in range(2 ** (n - 1)):",
"+ calc = s[0]",
"- if lst[i][j] == \"+\":",
"- calc += int(s[j + 1])",
"- else:",
"- calc -= int(s[j + 1])",
"- if calc == 7:",
"- res = s[0]",
"- for k in range(n - 1):",
"- res += lst[i][k] + s[k + 1]",
"- res += \"=7\"",
"- print(res)",
"+ calc += lst[i][j] + s[j + 1]",
"+ if eval(calc) == 7:",
"+ calc += \"=7\"",
"+ print(calc)"
] | false | 0.044031 | 0.048443 | 0.908934 | [
"s994200042",
"s424767322"
] |
u785989355 | p02949 | python | s301843024 | s199629159 | 1,985 | 1,766 | 75,608 | 72,284 | Accepted | Accepted | 11.03 | N,M,P = list(map(int,input().split()))
e_list = []
for i in range(M):
A,B,C = list(map(int,input().split()))
A,B = A-1,B-1
e_list.append((A,B,P-C))
#ベルマンフォード法
#e_listの用意
vi=0
min_dis_list = [10**27 for i in range(N)]
min_dis_list[vi] = 0
prev_list = [-1 for i in range(N)]
for i in range(N-1):
for e in e_list:
u,v,d = e
if min_dis_list[v]>min_dis_list[u]+d:
min_dis_list[v]=min_dis_list[u]+d
prev_list[v]=u
neg_loop_flag=[False for i in range(N)]
for i in range(N):
for e in e_list:
u,v,d = e
if min_dis_list[u] < 10**26:
if min_dis_list[u] + d < min_dis_list[v]:
neg_loop_flag[v]=True
min_dis_list[v] = min_dis_list[u] + d
if neg_loop_flag[u]:
neg_loop_flag[v]=True
if neg_loop_flag[N-1]:
print((-1))
else:
print((max(0,-min_dis_list[N-1]))) | import sys
def input():
return sys.stdin.readline()[:-1]
N,M,P = list(map(int,input().split()))
e_list = []
for i in range(M):
A,B,C = list(map(int,input().split()))
A,B = A-1,B-1
e_list.append((A,B,P-C))
#ベルマンフォード法
#e_listの用意
vi=0
min_dis_list = [10**27]*N
min_dis_list[vi] = 0
for i in range(N-1):
for e in e_list:
u,v,d = e
if min_dis_list[v]>min_dis_list[u]+d:
min_dis_list[v]=min_dis_list[u]+d
neg_loop_flag=[False]*N
for i in range(N):
for e in e_list:
u,v,d = e
if min_dis_list[u] < 10**26:
if min_dis_list[u] + d < min_dis_list[v]:
neg_loop_flag[v]=True
min_dis_list[v] = min_dis_list[u] + d
if neg_loop_flag[u]:
neg_loop_flag[v]=True
if neg_loop_flag[N-1]:
print((-1))
else:
print((max(0,-min_dis_list[N-1]))) | 40 | 42 | 946 | 923 | N, M, P = list(map(int, input().split()))
e_list = []
for i in range(M):
A, B, C = list(map(int, input().split()))
A, B = A - 1, B - 1
e_list.append((A, B, P - C))
# ベルマンフォード法
# e_listの用意
vi = 0
min_dis_list = [10**27 for i in range(N)]
min_dis_list[vi] = 0
prev_list = [-1 for i in range(N)]
for i in range(N - 1):
for e in e_list:
u, v, d = e
if min_dis_list[v] > min_dis_list[u] + d:
min_dis_list[v] = min_dis_list[u] + d
prev_list[v] = u
neg_loop_flag = [False for i in range(N)]
for i in range(N):
for e in e_list:
u, v, d = e
if min_dis_list[u] < 10**26:
if min_dis_list[u] + d < min_dis_list[v]:
neg_loop_flag[v] = True
min_dis_list[v] = min_dis_list[u] + d
if neg_loop_flag[u]:
neg_loop_flag[v] = True
if neg_loop_flag[N - 1]:
print((-1))
else:
print((max(0, -min_dis_list[N - 1])))
| import sys
def input():
return sys.stdin.readline()[:-1]
N, M, P = list(map(int, input().split()))
e_list = []
for i in range(M):
A, B, C = list(map(int, input().split()))
A, B = A - 1, B - 1
e_list.append((A, B, P - C))
# ベルマンフォード法
# e_listの用意
vi = 0
min_dis_list = [10**27] * N
min_dis_list[vi] = 0
for i in range(N - 1):
for e in e_list:
u, v, d = e
if min_dis_list[v] > min_dis_list[u] + d:
min_dis_list[v] = min_dis_list[u] + d
neg_loop_flag = [False] * N
for i in range(N):
for e in e_list:
u, v, d = e
if min_dis_list[u] < 10**26:
if min_dis_list[u] + d < min_dis_list[v]:
neg_loop_flag[v] = True
min_dis_list[v] = min_dis_list[u] + d
if neg_loop_flag[u]:
neg_loop_flag[v] = True
if neg_loop_flag[N - 1]:
print((-1))
else:
print((max(0, -min_dis_list[N - 1])))
| false | 4.761905 | [
"+import sys",
"+",
"+",
"+def input():",
"+ return sys.stdin.readline()[:-1]",
"+",
"+",
"-min_dis_list = [10**27 for i in range(N)]",
"+min_dis_list = [10**27] * N",
"-prev_list = [-1 for i in range(N)]",
"- prev_list[v] = u",
"-neg_loop_flag = [False for i in range(N)]",
"+neg_loop_flag = [False] * N"
] | false | 0.046618 | 0.046911 | 0.99376 | [
"s301843024",
"s199629159"
] |
u133936772 | p02972 | python | s355658919 | s678648610 | 235 | 195 | 11,704 | 11,700 | Accepted | Accepted | 17.02 | n=int(eval(input()))
l=list(map(int,input().split()))
for i in range(n,0,-1):
l[i-1]=sum(l[i-1::i])%2
print((sum(l)))
print((*[i+1 for i in range(n) if l[i]])) | n=int(eval(input()))
l=list(map(int,input().split()))
for i in range(n//2,0,-1):
l[i-1]=sum(l[i-1::i])%2
print((sum(l)))
print((*[i+1 for i in range(n) if l[i]])) | 6 | 6 | 156 | 159 | n = int(eval(input()))
l = list(map(int, input().split()))
for i in range(n, 0, -1):
l[i - 1] = sum(l[i - 1 :: i]) % 2
print((sum(l)))
print((*[i + 1 for i in range(n) if l[i]]))
| n = int(eval(input()))
l = list(map(int, input().split()))
for i in range(n // 2, 0, -1):
l[i - 1] = sum(l[i - 1 :: i]) % 2
print((sum(l)))
print((*[i + 1 for i in range(n) if l[i]]))
| false | 0 | [
"-for i in range(n, 0, -1):",
"+for i in range(n // 2, 0, -1):"
] | false | 0.040623 | 0.044366 | 0.915623 | [
"s355658919",
"s678648610"
] |
u730769327 | p03545 | python | s983713042 | s043046164 | 168 | 72 | 38,256 | 61,608 | Accepted | Accepted | 57.14 | a=eval(input())
for i in ('+','-'):
for j in ('+','-'):
for k in ('+','-'):
sm=a[0]+i+a[1]+j+a[2]+k+a[3]
if eval(sm)==7:
print((sm+'=7'))
exit() | s=eval(input())
p=['+','-']
for i in range(8):
t=s
for j in range(3):
t=t[:3-j]+p[(i>>j)&1]+t[3-j:]
if eval(t)==7:
print((t+'=7'))
exit() | 8 | 9 | 177 | 155 | a = eval(input())
for i in ("+", "-"):
for j in ("+", "-"):
for k in ("+", "-"):
sm = a[0] + i + a[1] + j + a[2] + k + a[3]
if eval(sm) == 7:
print((sm + "=7"))
exit()
| s = eval(input())
p = ["+", "-"]
for i in range(8):
t = s
for j in range(3):
t = t[: 3 - j] + p[(i >> j) & 1] + t[3 - j :]
if eval(t) == 7:
print((t + "=7"))
exit()
| false | 11.111111 | [
"-a = eval(input())",
"-for i in (\"+\", \"-\"):",
"- for j in (\"+\", \"-\"):",
"- for k in (\"+\", \"-\"):",
"- sm = a[0] + i + a[1] + j + a[2] + k + a[3]",
"- if eval(sm) == 7:",
"- print((sm + \"=7\"))",
"- exit()",
"+s = eval(input())",
"+p = [\"+\", \"-\"]",
"+for i in range(8):",
"+ t = s",
"+ for j in range(3):",
"+ t = t[: 3 - j] + p[(i >> j) & 1] + t[3 - j :]",
"+ if eval(t) == 7:",
"+ print((t + \"=7\"))",
"+ exit()"
] | false | 0.043653 | 0.077294 | 0.56477 | [
"s983713042",
"s043046164"
] |
u608088992 | p03808 | python | s150625149 | s317477917 | 121 | 78 | 14,588 | 15,012 | Accepted | Accepted | 35.54 | N = int(eval(input()))
A = [int(a) for a in input().split()]
RejectStones = N * (N+1) // 2
if sum(A) % RejectStones != 0: print("NO")
else:
TotalOperation = sum(A) // RejectStones
sumcheck = 0
for i in range(N-1):
if (TotalOperation - A[i+1] + A[i]) % N != 0 or TotalOperation < A[i+1] - A[i]:
print("NO")
break
else:
sumcheck += (TotalOperation - A[i+1] + A[i]) // N
else:
if (TotalOperation - A[0] + A[-1]) % N != 0 or TotalOperation < A[0] - A[-1]: print("NO")
else:
sumcheck += (TotalOperation - A[0] + A[-1]) // N
if sumcheck == TotalOperation: print("YES")
else: print("NO") | import sys
def solve():
input = sys.stdin.readline
N = int(eval(input()))
A = [int(a) for a in input().split()]
totalA = sum(A)
if totalA % (N * (N + 1) // 2) != 0: print("NO")
else:
Op = totalA // (N * (N + 1) // 2)
subA = [A[(i + 1) % N] - A[i] for i in range(N)]
count = 0
for i, a in enumerate(subA):
if (Op - a) % N != 0 or a > Op:
print("NO")
break
else: count += (Op - a) // N
else:
if count == Op: print("YES")
else: print("NO")
return 0
if __name__ == "__main__":
solve()
| 20 | 26 | 715 | 661 | N = int(eval(input()))
A = [int(a) for a in input().split()]
RejectStones = N * (N + 1) // 2
if sum(A) % RejectStones != 0:
print("NO")
else:
TotalOperation = sum(A) // RejectStones
sumcheck = 0
for i in range(N - 1):
if (TotalOperation - A[i + 1] + A[i]) % N != 0 or TotalOperation < A[i + 1] - A[
i
]:
print("NO")
break
else:
sumcheck += (TotalOperation - A[i + 1] + A[i]) // N
else:
if (TotalOperation - A[0] + A[-1]) % N != 0 or TotalOperation < A[0] - A[-1]:
print("NO")
else:
sumcheck += (TotalOperation - A[0] + A[-1]) // N
if sumcheck == TotalOperation:
print("YES")
else:
print("NO")
| import sys
def solve():
input = sys.stdin.readline
N = int(eval(input()))
A = [int(a) for a in input().split()]
totalA = sum(A)
if totalA % (N * (N + 1) // 2) != 0:
print("NO")
else:
Op = totalA // (N * (N + 1) // 2)
subA = [A[(i + 1) % N] - A[i] for i in range(N)]
count = 0
for i, a in enumerate(subA):
if (Op - a) % N != 0 or a > Op:
print("NO")
break
else:
count += (Op - a) // N
else:
if count == Op:
print("YES")
else:
print("NO")
return 0
if __name__ == "__main__":
solve()
| false | 23.076923 | [
"-N = int(eval(input()))",
"-A = [int(a) for a in input().split()]",
"-RejectStones = N * (N + 1) // 2",
"-if sum(A) % RejectStones != 0:",
"- print(\"NO\")",
"-else:",
"- TotalOperation = sum(A) // RejectStones",
"- sumcheck = 0",
"- for i in range(N - 1):",
"- if (TotalOperation - A[i + 1] + A[i]) % N != 0 or TotalOperation < A[i + 1] - A[",
"- i",
"- ]:",
"- print(\"NO\")",
"- break",
"+import sys",
"+",
"+",
"+def solve():",
"+ input = sys.stdin.readline",
"+ N = int(eval(input()))",
"+ A = [int(a) for a in input().split()]",
"+ totalA = sum(A)",
"+ if totalA % (N * (N + 1) // 2) != 0:",
"+ print(\"NO\")",
"+ else:",
"+ Op = totalA // (N * (N + 1) // 2)",
"+ subA = [A[(i + 1) % N] - A[i] for i in range(N)]",
"+ count = 0",
"+ for i, a in enumerate(subA):",
"+ if (Op - a) % N != 0 or a > Op:",
"+ print(\"NO\")",
"+ break",
"+ else:",
"+ count += (Op - a) // N",
"- sumcheck += (TotalOperation - A[i + 1] + A[i]) // N",
"- else:",
"- if (TotalOperation - A[0] + A[-1]) % N != 0 or TotalOperation < A[0] - A[-1]:",
"- print(\"NO\")",
"- else:",
"- sumcheck += (TotalOperation - A[0] + A[-1]) // N",
"- if sumcheck == TotalOperation:",
"+ if count == Op:",
"+ return 0",
"+",
"+",
"+if __name__ == \"__main__\":",
"+ solve()"
] | false | 0.036956 | 0.035386 | 1.044358 | [
"s150625149",
"s317477917"
] |
u608088992 | p03807 | python | s171748880 | s090807542 | 62 | 54 | 14,108 | 11,104 | Accepted | Accepted | 12.9 | N = int(eval(input()))
A = [int(a) for a in input().split()]
odd = 0
for a in A:
odd += a%2
print(("YES" if odd%2==0 else "NO"))
| N = int(eval(input()))
A = [int(a)%2 for a in input().split()]
print(("YES" if sum(A)%2==0 else "NO")) | 6 | 3 | 130 | 96 | N = int(eval(input()))
A = [int(a) for a in input().split()]
odd = 0
for a in A:
odd += a % 2
print(("YES" if odd % 2 == 0 else "NO"))
| N = int(eval(input()))
A = [int(a) % 2 for a in input().split()]
print(("YES" if sum(A) % 2 == 0 else "NO"))
| false | 50 | [
"-A = [int(a) for a in input().split()]",
"-odd = 0",
"-for a in A:",
"- odd += a % 2",
"-print((\"YES\" if odd % 2 == 0 else \"NO\"))",
"+A = [int(a) % 2 for a in input().split()]",
"+print((\"YES\" if sum(A) % 2 == 0 else \"NO\"))"
] | false | 0.098641 | 0.077657 | 1.270211 | [
"s171748880",
"s090807542"
] |
u652057333 | p03087 | python | s185999343 | s508203193 | 1,045 | 375 | 52,348 | 52,824 | Accepted | Accepted | 64.11 | n, q = list(map(int, input().split()))
s = str(eval(input()))
ac = [0] * n
for i in range(1, n):
ac[i] = ac[i-1]
if(s[i-1] == "A" and s[i] == "C"):
ac[i] += 1
for i in range(q):
l, r = list(map(int, input().split()))
print((ac[r-1] - ac[l-1])) | import sys
input = sys.stdin.readline
n, q = list(map(int, input().split()))
s = str(eval(input()))
ac = [0] * n
for i in range(1, n):
ac[i] = ac[i-1]
if(s[i-1] == "A" and s[i] == "C"):
ac[i] += 1
for i in range(q):
l, r = list(map(int, input().split()))
print((ac[r-1] - ac[l-1])) | 10 | 13 | 256 | 298 | n, q = list(map(int, input().split()))
s = str(eval(input()))
ac = [0] * n
for i in range(1, n):
ac[i] = ac[i - 1]
if s[i - 1] == "A" and s[i] == "C":
ac[i] += 1
for i in range(q):
l, r = list(map(int, input().split()))
print((ac[r - 1] - ac[l - 1]))
| import sys
input = sys.stdin.readline
n, q = list(map(int, input().split()))
s = str(eval(input()))
ac = [0] * n
for i in range(1, n):
ac[i] = ac[i - 1]
if s[i - 1] == "A" and s[i] == "C":
ac[i] += 1
for i in range(q):
l, r = list(map(int, input().split()))
print((ac[r - 1] - ac[l - 1]))
| false | 23.076923 | [
"+import sys",
"+",
"+input = sys.stdin.readline"
] | false | 0.037892 | 0.007628 | 4.967204 | [
"s185999343",
"s508203193"
] |
u912237403 | p00086 | python | s667130244 | s316461005 | 20 | 10 | 4,212 | 4,212 | Accepted | Accepted | 50 | while 1:
c=[0,1,1]+[0]*98
while 1:
try: a, b = list(map(int, input().split()))
except: exit()
if a==0==b:break
c[a] = -c[a]+1
c[b] = -c[b]+1
print(["NG","OK"][sum(c)==0]) | while 1:
c=[0,1,1]+[0]*98
while 1:
try: a, b = list(map(int, input().split()))
except: exit()
if a==0==b:break
c[a] = 1-c[a]
c[b] = 1-c[b]
print(["NG","OK"][sum(c)==0]) | 9 | 9 | 201 | 199 | while 1:
c = [0, 1, 1] + [0] * 98
while 1:
try:
a, b = list(map(int, input().split()))
except:
exit()
if a == 0 == b:
break
c[a] = -c[a] + 1
c[b] = -c[b] + 1
print(["NG", "OK"][sum(c) == 0])
| while 1:
c = [0, 1, 1] + [0] * 98
while 1:
try:
a, b = list(map(int, input().split()))
except:
exit()
if a == 0 == b:
break
c[a] = 1 - c[a]
c[b] = 1 - c[b]
print(["NG", "OK"][sum(c) == 0])
| false | 0 | [
"- c[a] = -c[a] + 1",
"- c[b] = -c[b] + 1",
"+ c[a] = 1 - c[a]",
"+ c[b] = 1 - c[b]"
] | false | 0.046808 | 0.047194 | 0.991817 | [
"s667130244",
"s316461005"
] |
u063596417 | p03494 | python | s763535350 | s038355559 | 67 | 61 | 63,472 | 64,016 | Accepted | Accepted | 8.96 | import sys
n = int(eval(input()))
a = list(map(int, input().split()))
ans = sys.maxsize
for an in a:
cnt = 0
while an % 2 == 0:
an /= 2
cnt += 1
if cnt < ans:
ans = cnt
print(ans) | import sys
n = int(eval(input()))
a = list(map(int, input().split()))
# ans = sys.maxsize
# for an in a:
# cnt = 0
# while an % 2 == 0:
# an /= 2
# cnt += 1
# if cnt < ans:
# ans = cnt
ans = 0
isEven = True
while isEven:
list_tmp = []
for an in a:
if an % 2 ==0:
list_tmp.append(an / 2)
else:
isEven = False
break;
a = list_tmp
ans += 1
print((ans - 1))
| 13 | 29 | 198 | 425 | import sys
n = int(eval(input()))
a = list(map(int, input().split()))
ans = sys.maxsize
for an in a:
cnt = 0
while an % 2 == 0:
an /= 2
cnt += 1
if cnt < ans:
ans = cnt
print(ans)
| import sys
n = int(eval(input()))
a = list(map(int, input().split()))
# ans = sys.maxsize
# for an in a:
# cnt = 0
# while an % 2 == 0:
# an /= 2
# cnt += 1
# if cnt < ans:
# ans = cnt
ans = 0
isEven = True
while isEven:
list_tmp = []
for an in a:
if an % 2 == 0:
list_tmp.append(an / 2)
else:
isEven = False
break
a = list_tmp
ans += 1
print((ans - 1))
| false | 55.172414 | [
"-ans = sys.maxsize",
"-for an in a:",
"- cnt = 0",
"- while an % 2 == 0:",
"- an /= 2",
"- cnt += 1",
"- if cnt < ans:",
"- ans = cnt",
"-print(ans)",
"+# ans = sys.maxsize",
"+# for an in a:",
"+# cnt = 0",
"+# while an % 2 == 0:",
"+# an /= 2",
"+# cnt += 1",
"+# if cnt < ans:",
"+# ans = cnt",
"+ans = 0",
"+isEven = True",
"+while isEven:",
"+ list_tmp = []",
"+ for an in a:",
"+ if an % 2 == 0:",
"+ list_tmp.append(an / 2)",
"+ else:",
"+ isEven = False",
"+ break",
"+ a = list_tmp",
"+ ans += 1",
"+print((ans - 1))"
] | false | 0.03789 | 0.037618 | 1.007249 | [
"s763535350",
"s038355559"
] |
u858742833 | p03168 | python | s790179720 | s665408873 | 1,385 | 681 | 3,316 | 3,316 | Accepted | Accepted | 50.83 | def main():
N = int(eval(input()))
p = list(map(float, input().split()))
u = [0.0]
v = [1 - p[0], p[0]]
for i, p in enumerate(p[1:], 1):
u, v = v, u + [0.0, 0.0]
t = u[0]
v[0] = t * (1 - p)
for j, uu in enumerate(u[1:], 1):
v[j] = t * p + uu * (1 - p)
t = uu
v[-1] = t * p
print((sum(v[(N + 1) // 2:])))
main()
| def main():
N = int(eval(input()))
pl = list(map(float, input().split()))
v = [1 - pl[0], pl[0]]
mid = (N + 1) // 2
for i, p in enumerate(pl[1:mid], 1):
v = v + [0.0]
t = v[0]
v[0] = t * (1 - p)
for j, uu in enumerate(v[1:], 1):
v[j] = t * p + uu * (1 - p)
t = uu
for i, p in enumerate(pl[mid:], mid):
t = v[i - mid + 1]
for j, uu in enumerate(v[i - mid + 2:-1], i - mid + 2):
v[j] = t * p + uu * (1 - p)
t = uu
v[mid] += t * p
print((v[mid]))
main()
| 16 | 21 | 407 | 596 | def main():
N = int(eval(input()))
p = list(map(float, input().split()))
u = [0.0]
v = [1 - p[0], p[0]]
for i, p in enumerate(p[1:], 1):
u, v = v, u + [0.0, 0.0]
t = u[0]
v[0] = t * (1 - p)
for j, uu in enumerate(u[1:], 1):
v[j] = t * p + uu * (1 - p)
t = uu
v[-1] = t * p
print((sum(v[(N + 1) // 2 :])))
main()
| def main():
N = int(eval(input()))
pl = list(map(float, input().split()))
v = [1 - pl[0], pl[0]]
mid = (N + 1) // 2
for i, p in enumerate(pl[1:mid], 1):
v = v + [0.0]
t = v[0]
v[0] = t * (1 - p)
for j, uu in enumerate(v[1:], 1):
v[j] = t * p + uu * (1 - p)
t = uu
for i, p in enumerate(pl[mid:], mid):
t = v[i - mid + 1]
for j, uu in enumerate(v[i - mid + 2 : -1], i - mid + 2):
v[j] = t * p + uu * (1 - p)
t = uu
v[mid] += t * p
print((v[mid]))
main()
| false | 23.809524 | [
"- p = list(map(float, input().split()))",
"- u = [0.0]",
"- v = [1 - p[0], p[0]]",
"- for i, p in enumerate(p[1:], 1):",
"- u, v = v, u + [0.0, 0.0]",
"- t = u[0]",
"+ pl = list(map(float, input().split()))",
"+ v = [1 - pl[0], pl[0]]",
"+ mid = (N + 1) // 2",
"+ for i, p in enumerate(pl[1:mid], 1):",
"+ v = v + [0.0]",
"+ t = v[0]",
"- for j, uu in enumerate(u[1:], 1):",
"+ for j, uu in enumerate(v[1:], 1):",
"- v[-1] = t * p",
"- print((sum(v[(N + 1) // 2 :])))",
"+ for i, p in enumerate(pl[mid:], mid):",
"+ t = v[i - mid + 1]",
"+ for j, uu in enumerate(v[i - mid + 2 : -1], i - mid + 2):",
"+ v[j] = t * p + uu * (1 - p)",
"+ t = uu",
"+ v[mid] += t * p",
"+ print((v[mid]))"
] | false | 0.007338 | 0.036855 | 0.19909 | [
"s790179720",
"s665408873"
] |
u735752582 | p03262 | python | s620295226 | s956541001 | 242 | 155 | 24,004 | 16,292 | Accepted | Accepted | 35.95 | # -*- coding: utf-8 -*-
import fractions
import numpy as np
N,X = list(map(int, input().split()))
x = list(map(int,input().split()))
x.append(X)
x.sort()
x=np.array(x)
y=x[1:]-x[:-1]
y.sort()
y=list(set(y))
z=y[0]
m=len(y)
i=0
while i < m:
z=fractions.gcd(z,y[i])
i+=1
print(z) | # -*- coding: utf-8 -*-
import fractions
n,X = list(map(int, input().split()))
x = list(map(int,input().split()))
x.append(X)
x.sort()
y=[]
i=0
while i < n:
y.append(x[i+1]-x[i])
i +=1
y.sort()
y=list(set(y))
m=len(y)
z=y[0]
i=0
while i < m:
z=fractions.gcd(z,y[i])
i+=1
print(z) | 23 | 24 | 311 | 320 | # -*- coding: utf-8 -*-
import fractions
import numpy as np
N, X = list(map(int, input().split()))
x = list(map(int, input().split()))
x.append(X)
x.sort()
x = np.array(x)
y = x[1:] - x[:-1]
y.sort()
y = list(set(y))
z = y[0]
m = len(y)
i = 0
while i < m:
z = fractions.gcd(z, y[i])
i += 1
print(z)
| # -*- coding: utf-8 -*-
import fractions
n, X = list(map(int, input().split()))
x = list(map(int, input().split()))
x.append(X)
x.sort()
y = []
i = 0
while i < n:
y.append(x[i + 1] - x[i])
i += 1
y.sort()
y = list(set(y))
m = len(y)
z = y[0]
i = 0
while i < m:
z = fractions.gcd(z, y[i])
i += 1
print(z)
| false | 4.166667 | [
"-import numpy as np",
"-N, X = list(map(int, input().split()))",
"+n, X = list(map(int, input().split()))",
"-x = np.array(x)",
"-y = x[1:] - x[:-1]",
"+y = []",
"+i = 0",
"+while i < n:",
"+ y.append(x[i + 1] - x[i])",
"+ i += 1",
"+m = len(y)",
"-m = len(y)"
] | false | 0.322933 | 0.045716 | 7.063913 | [
"s620295226",
"s956541001"
] |
u001024152 | p03476 | python | s685603046 | s955981764 | 889 | 259 | 7,284 | 14,696 | Accepted | Accepted | 70.87 | # D
from math import sqrt
def sieve(n:int)->list:
"""エラトステネスの篩"""
if n<2: return [False]*(n+1)
is_prime = [True]*(n+1)
is_prime[0] = False
is_prime[1] = False
for i in range(2, int(sqrt(n))+1):
if is_prime[i]:
for j in range(i*2, n+1, i):
is_prime[j] = False
return is_prime
N = int(1e5)
is_prime = sieve(N)
# like-2017
cnt = [0]*(N+1)
for i in range(1, N+1):
cnt[i] += cnt[i-1]
if is_prime[i] and is_prime[(i+1)//2]:
cnt[i] += 1
Q = int(eval(input()))
for _ in range(Q):
l,r = list(map(int, input().split()))
print((cnt[r]-cnt[l-1])) | # D
from math import sqrt
def sieve(n:int)->list:
"""エラトステネスの篩"""
if n<2: return [False]*(n+1)
is_prime = [True]*(n+1)
is_prime[0] = False
is_prime[1] = False
for i in range(2, int(sqrt(n))+1):
if is_prime[i]:
for j in range(i*2, n+1, i):
is_prime[j] = False
return is_prime
N = int(1e5)
is_prime = sieve(N)
# like-2017
cnt = [0]*(N+1)
for i in range(1, N+1):
cnt[i] += cnt[i-1]
if is_prime[i] and is_prime[(i+1)//2]:
cnt[i] += 1
import sys
Q = sys.stdin.readline()
for l,r in (list(map(int, line.split())) for line in sys.stdin.readlines()):
print((cnt[r] - cnt[l-1])) | 29 | 29 | 649 | 686 | # D
from math import sqrt
def sieve(n: int) -> list:
"""エラトステネスの篩"""
if n < 2:
return [False] * (n + 1)
is_prime = [True] * (n + 1)
is_prime[0] = False
is_prime[1] = False
for i in range(2, int(sqrt(n)) + 1):
if is_prime[i]:
for j in range(i * 2, n + 1, i):
is_prime[j] = False
return is_prime
N = int(1e5)
is_prime = sieve(N)
# like-2017
cnt = [0] * (N + 1)
for i in range(1, N + 1):
cnt[i] += cnt[i - 1]
if is_prime[i] and is_prime[(i + 1) // 2]:
cnt[i] += 1
Q = int(eval(input()))
for _ in range(Q):
l, r = list(map(int, input().split()))
print((cnt[r] - cnt[l - 1]))
| # D
from math import sqrt
def sieve(n: int) -> list:
"""エラトステネスの篩"""
if n < 2:
return [False] * (n + 1)
is_prime = [True] * (n + 1)
is_prime[0] = False
is_prime[1] = False
for i in range(2, int(sqrt(n)) + 1):
if is_prime[i]:
for j in range(i * 2, n + 1, i):
is_prime[j] = False
return is_prime
N = int(1e5)
is_prime = sieve(N)
# like-2017
cnt = [0] * (N + 1)
for i in range(1, N + 1):
cnt[i] += cnt[i - 1]
if is_prime[i] and is_prime[(i + 1) // 2]:
cnt[i] += 1
import sys
Q = sys.stdin.readline()
for l, r in (list(map(int, line.split())) for line in sys.stdin.readlines()):
print((cnt[r] - cnt[l - 1]))
| false | 0 | [
"-Q = int(eval(input()))",
"-for _ in range(Q):",
"- l, r = list(map(int, input().split()))",
"+import sys",
"+",
"+Q = sys.stdin.readline()",
"+for l, r in (list(map(int, line.split())) for line in sys.stdin.readlines()):"
] | false | 0.073103 | 0.196389 | 0.372237 | [
"s685603046",
"s955981764"
] |
u094191970 | p03382 | python | s157612791 | s815982906 | 118 | 82 | 14,052 | 14,052 | Accepted | Accepted | 30.51 | n=int(eval(input()))
a=sorted(list(map(int,input().split())))
N=a[-1]
x=0
for i in a:
if abs(N/2-i)<abs(N/2-x):
x=i
print((N,x)) | n=int(eval(input()))
a=list(map(int,input().split()))
N=max(a)
x=0
for i in a:
if abs(N/2-i)<abs(N/2-x):
x=i
print((N,x)) | 8 | 8 | 130 | 123 | n = int(eval(input()))
a = sorted(list(map(int, input().split())))
N = a[-1]
x = 0
for i in a:
if abs(N / 2 - i) < abs(N / 2 - x):
x = i
print((N, x))
| n = int(eval(input()))
a = list(map(int, input().split()))
N = max(a)
x = 0
for i in a:
if abs(N / 2 - i) < abs(N / 2 - x):
x = i
print((N, x))
| false | 0 | [
"-a = sorted(list(map(int, input().split())))",
"-N = a[-1]",
"+a = list(map(int, input().split()))",
"+N = max(a)"
] | false | 0.035016 | 0.042414 | 0.825595 | [
"s157612791",
"s815982906"
] |
u039360403 | p03329 | python | s028747457 | s614788609 | 405 | 261 | 7,064 | 43,612 | Accepted | Accepted | 35.56 | n=int(eval(input()))
l9=list(9**i for i in range(1,6))
l6=list(6**j for j in range(1,8))
l=sorted(l9+l6)
dp=[_ for _ in range(100010)]
for k in l:
for m in range(k,n+1):
dp[m]=min(dp[m-k]+1,dp[m])
print((dp[n])) | n=int(eval(input()))
dp=[0]*n
l69=sorted([1]+[6**i for i in range(1,7)]+[9**i for i in range(1,6)])
g=0
for i in range(n):
for j in range(len(l69)):
if i+1-l69[j]>=0:
g=j
dp[i]=min(dp[i-p]+1 for p in l69[:g+1])
print((dp[n-1])) | 9 | 11 | 223 | 258 | n = int(eval(input()))
l9 = list(9**i for i in range(1, 6))
l6 = list(6**j for j in range(1, 8))
l = sorted(l9 + l6)
dp = [_ for _ in range(100010)]
for k in l:
for m in range(k, n + 1):
dp[m] = min(dp[m - k] + 1, dp[m])
print((dp[n]))
| n = int(eval(input()))
dp = [0] * n
l69 = sorted([1] + [6**i for i in range(1, 7)] + [9**i for i in range(1, 6)])
g = 0
for i in range(n):
for j in range(len(l69)):
if i + 1 - l69[j] >= 0:
g = j
dp[i] = min(dp[i - p] + 1 for p in l69[: g + 1])
print((dp[n - 1]))
| false | 18.181818 | [
"-l9 = list(9**i for i in range(1, 6))",
"-l6 = list(6**j for j in range(1, 8))",
"-l = sorted(l9 + l6)",
"-dp = [_ for _ in range(100010)]",
"-for k in l:",
"- for m in range(k, n + 1):",
"- dp[m] = min(dp[m - k] + 1, dp[m])",
"-print((dp[n]))",
"+dp = [0] * n",
"+l69 = sorted([1] + [6**i for i in range(1, 7)] + [9**i for i in range(1, 6)])",
"+g = 0",
"+for i in range(n):",
"+ for j in range(len(l69)):",
"+ if i + 1 - l69[j] >= 0:",
"+ g = j",
"+ dp[i] = min(dp[i - p] + 1 for p in l69[: g + 1])",
"+print((dp[n - 1]))"
] | false | 0.243992 | 0.096294 | 2.533836 | [
"s028747457",
"s614788609"
] |
u729133443 | p02549 | python | s545447522 | s848143645 | 776 | 703 | 24,528 | 24,740 | Accepted | Accepted | 9.41 | (n,_),*s=[[*list(map(int,t.split()))]for t in open(0)]
d=[1,-1]+[0]*2*n
for i in range(n):
d[i]=(d[i-1]+d[i])%998244353
for l,r in s:
d[i+l]+=d[i]
d[i-~r]-=d[i]
print((d[n-1])) | (n,_),*s=[[*list(map(int,t.split()))]for t in open(0)]
d=[1,-1]+[c:=0]*2*n
for i in range(n):
c=(c+d[i])%998244353
for l,r in s:d[i+l]+=c;d[i-~r]-=c
print(c) | 8 | 6 | 187 | 158 | (n, _), *s = [[*list(map(int, t.split()))] for t in open(0)]
d = [1, -1] + [0] * 2 * n
for i in range(n):
d[i] = (d[i - 1] + d[i]) % 998244353
for l, r in s:
d[i + l] += d[i]
d[i - ~r] -= d[i]
print((d[n - 1]))
| (n, _), *s = [[*list(map(int, t.split()))] for t in open(0)]
d = [1, -1] + [c := 0] * 2 * n
for i in range(n):
c = (c + d[i]) % 998244353
for l, r in s:
d[i + l] += c
d[i - ~r] -= c
print(c)
| false | 25 | [
"-d = [1, -1] + [0] * 2 * n",
"+d = [1, -1] + [c := 0] * 2 * n",
"- d[i] = (d[i - 1] + d[i]) % 998244353",
"+ c = (c + d[i]) % 998244353",
"- d[i + l] += d[i]",
"- d[i - ~r] -= d[i]",
"-print((d[n - 1]))",
"+ d[i + l] += c",
"+ d[i - ~r] -= c",
"+print(c)"
] | false | 0.067739 | 0.04721 | 1.43483 | [
"s545447522",
"s848143645"
] |
u553881259 | p00761 | python | s508528190 | s389244561 | 30 | 20 | 4,252 | 4,228 | Accepted | Accepted | 33.33 | while True:
a, l = list(map(int, input().split()))
if((a|l) == 0): break
dic = {}
cnt = 0
dic[a] = cnt
while True:
cnt+=1
Sa = str(a)
Sa = [ x for x in list(Sa) if x is not '0']
if len(Sa) is 0: Sa.append('0')
Sa.sort()
S = int("".join(Sa))
La = [x for x in Sa]
La.reverse()
while len(La) < l: La.append('0')
L = int("".join(La))
a = L - S
if a in dic:
print(dic[a], a, cnt - dic[a])
break
else:
dic[a] = cnt | while True:
a, l = list(map(int, input().split()))
if((a|l) == 0): break
dic = {}
cnt = 0
dic[a] = cnt
while True:
cnt+=1
La = list(str(a).zfill(l))
La.sort()
a = int(''.join(La[::-1])) - int(''.join(La))
if a in dic:
print(dic[a], a, cnt-dic[a])
break
else:
dic[a] = cnt | 23 | 16 | 591 | 391 | while True:
a, l = list(map(int, input().split()))
if (a | l) == 0:
break
dic = {}
cnt = 0
dic[a] = cnt
while True:
cnt += 1
Sa = str(a)
Sa = [x for x in list(Sa) if x is not "0"]
if len(Sa) is 0:
Sa.append("0")
Sa.sort()
S = int("".join(Sa))
La = [x for x in Sa]
La.reverse()
while len(La) < l:
La.append("0")
L = int("".join(La))
a = L - S
if a in dic:
print(dic[a], a, cnt - dic[a])
break
else:
dic[a] = cnt
| while True:
a, l = list(map(int, input().split()))
if (a | l) == 0:
break
dic = {}
cnt = 0
dic[a] = cnt
while True:
cnt += 1
La = list(str(a).zfill(l))
La.sort()
a = int("".join(La[::-1])) - int("".join(La))
if a in dic:
print(dic[a], a, cnt - dic[a])
break
else:
dic[a] = cnt
| false | 30.434783 | [
"- Sa = str(a)",
"- Sa = [x for x in list(Sa) if x is not \"0\"]",
"- if len(Sa) is 0:",
"- Sa.append(\"0\")",
"- Sa.sort()",
"- S = int(\"\".join(Sa))",
"- La = [x for x in Sa]",
"- La.reverse()",
"- while len(La) < l:",
"- La.append(\"0\")",
"- L = int(\"\".join(La))",
"- a = L - S",
"+ La = list(str(a).zfill(l))",
"+ La.sort()",
"+ a = int(\"\".join(La[::-1])) - int(\"\".join(La))"
] | false | 0.045116 | 0.037456 | 1.20452 | [
"s508528190",
"s389244561"
] |
u268793453 | p03266 | python | s384786089 | s344978096 | 92 | 17 | 3,060 | 2,940 | Accepted | Accepted | 81.52 | n, k = [int(i) for i in input().split()]
ans = [0, 0]
d = k // 2
for i in range(1, n+1):
if k % 2 == 0 and i % k == d:
ans[0] += 1
if i % k == 0:
ans[1] += 1
print((ans[0] ** 3 + ans[1] ** 3)) | n, k = [int(i) for i in input().split()]
ans = (n // k) ** 3
if k % 2 == 0:
ans += ((n - k // 2) // k + 1) ** 3
print(ans) | 12 | 7 | 228 | 132 | n, k = [int(i) for i in input().split()]
ans = [0, 0]
d = k // 2
for i in range(1, n + 1):
if k % 2 == 0 and i % k == d:
ans[0] += 1
if i % k == 0:
ans[1] += 1
print((ans[0] ** 3 + ans[1] ** 3))
| n, k = [int(i) for i in input().split()]
ans = (n // k) ** 3
if k % 2 == 0:
ans += ((n - k // 2) // k + 1) ** 3
print(ans)
| false | 41.666667 | [
"-ans = [0, 0]",
"-d = k // 2",
"-for i in range(1, n + 1):",
"- if k % 2 == 0 and i % k == d:",
"- ans[0] += 1",
"- if i % k == 0:",
"- ans[1] += 1",
"-print((ans[0] ** 3 + ans[1] ** 3))",
"+ans = (n // k) ** 3",
"+if k % 2 == 0:",
"+ ans += ((n - k // 2) // k + 1) ** 3",
"+print(ans)"
] | false | 0.084093 | 0.129183 | 0.65096 | [
"s384786089",
"s344978096"
] |
u941407962 | p03040 | python | s008097145 | s378499585 | 1,234 | 968 | 122,332 | 110,940 | Accepted | Accepted | 21.56 | from heapq import *
import sys;input=sys.stdin.readline
Q, = list(map(int, input().split()))
qs = []
c = 0
for i in range(Q):
q = input().split()
if len(q) == 1:
c += 1
else:
a, b = int(q[1]), int(q[2])
qs.append((a, b, c))
c = 0
if c:
qs.append((a, b, c))
R = [10**18]
L = [10**18]
ss = 0
for a, b, c in qs:
xs = []
if c:
x = heappop(L)
for _ in range(c):
print((-x, ss))
heappush(L, x)
x = heappop(R)
y = -heappop(L)
if x < a:
heappush(R, a)
heappush(R, a)
heappush(L, -x)
heappush(L, -y)
ss += a-x
elif y > a:
heappush(L, -a)
heappush(L, -a)
heappush(R, x)
heappush(R, y)
ss += y-a
else:
heappush(L, -a)
heappush(R, a)
heappush(L, -y)
heappush(R, x)
ss += b
| class Bit:
def __init__(self, n):
self.size = n
self.tree = [0] * (n + 1)
def sum(self, i):
s = 0
while i > 0:
s += self.tree[i]
i -= i & -i
return s
def add(self, i, x):
while i <= self.size:
self.tree[i] += x
i += i & -i
def bsearch(mn, mx, func):
#func(i)=True を満たす最大のi (mn<=i<mx)
idx = (mx + mn)//2
while mx-mn>1:
if func(idx):
idx, mn = (idx + mx)//2, idx
continue
idx, mx = (idx + mn)//2, idx
return idx
import sys;input=sys.stdin.readline
Q, = list(map(int, input().split()))
qs = []
c = 0
j = 0
for _ in range(Q):
q = input().split()
if len(q) == 1:
c += 1
else:
a, b = int(q[1]), int(q[2])
qs.append((a, b, c, j))
c = 0
j+=1
if c:
qs.append((a, b, c, j))
m = j
qqs = sorted(qs, key=lambda x:x[0])
j2i = dict()
i2a = dict()
for i, (a, b, c, j) in enumerate(qqs):
j2i[j] = i+1
i2a[i+1] = a
m = len(j2i)
st = Bit(m)
st_sum = Bit(m)
asum=bsum=0
#print(i2a)
#print(j2i)
for a, b, c, i in qs:
if c:
j = bsearch(0, m+1, lambda x: st.sum(x)<ci)
# print(st_sum.sum(j+1))
for _ in range(c):
if not i%2:
print((i2a[j+1], -2*st_sum.sum(j+1)+asum+bsum))
else:
print((i2a[j+1], -st_sum.sum(j)+(asum-st_sum.sum(j+1))+bsum))
asum += a
bsum += b
st.add(j2i[i], 1)
st_sum.add(j2i[i], a)
ci = -(-(i+1)//2)
| 46 | 72 | 927 | 1,594 | from heapq import *
import sys
input = sys.stdin.readline
(Q,) = list(map(int, input().split()))
qs = []
c = 0
for i in range(Q):
q = input().split()
if len(q) == 1:
c += 1
else:
a, b = int(q[1]), int(q[2])
qs.append((a, b, c))
c = 0
if c:
qs.append((a, b, c))
R = [10**18]
L = [10**18]
ss = 0
for a, b, c in qs:
xs = []
if c:
x = heappop(L)
for _ in range(c):
print((-x, ss))
heappush(L, x)
x = heappop(R)
y = -heappop(L)
if x < a:
heappush(R, a)
heappush(R, a)
heappush(L, -x)
heappush(L, -y)
ss += a - x
elif y > a:
heappush(L, -a)
heappush(L, -a)
heappush(R, x)
heappush(R, y)
ss += y - a
else:
heappush(L, -a)
heappush(R, a)
heappush(L, -y)
heappush(R, x)
ss += b
| class Bit:
def __init__(self, n):
self.size = n
self.tree = [0] * (n + 1)
def sum(self, i):
s = 0
while i > 0:
s += self.tree[i]
i -= i & -i
return s
def add(self, i, x):
while i <= self.size:
self.tree[i] += x
i += i & -i
def bsearch(mn, mx, func):
# func(i)=True を満たす最大のi (mn<=i<mx)
idx = (mx + mn) // 2
while mx - mn > 1:
if func(idx):
idx, mn = (idx + mx) // 2, idx
continue
idx, mx = (idx + mn) // 2, idx
return idx
import sys
input = sys.stdin.readline
(Q,) = list(map(int, input().split()))
qs = []
c = 0
j = 0
for _ in range(Q):
q = input().split()
if len(q) == 1:
c += 1
else:
a, b = int(q[1]), int(q[2])
qs.append((a, b, c, j))
c = 0
j += 1
if c:
qs.append((a, b, c, j))
m = j
qqs = sorted(qs, key=lambda x: x[0])
j2i = dict()
i2a = dict()
for i, (a, b, c, j) in enumerate(qqs):
j2i[j] = i + 1
i2a[i + 1] = a
m = len(j2i)
st = Bit(m)
st_sum = Bit(m)
asum = bsum = 0
# print(i2a)
# print(j2i)
for a, b, c, i in qs:
if c:
j = bsearch(0, m + 1, lambda x: st.sum(x) < ci)
# print(st_sum.sum(j+1))
for _ in range(c):
if not i % 2:
print((i2a[j + 1], -2 * st_sum.sum(j + 1) + asum + bsum))
else:
print((i2a[j + 1], -st_sum.sum(j) + (asum - st_sum.sum(j + 1)) + bsum))
asum += a
bsum += b
st.add(j2i[i], 1)
st_sum.add(j2i[i], a)
ci = -(-(i + 1) // 2)
| false | 36.111111 | [
"-from heapq import *",
"+class Bit:",
"+ def __init__(self, n):",
"+ self.size = n",
"+ self.tree = [0] * (n + 1)",
"+",
"+ def sum(self, i):",
"+ s = 0",
"+ while i > 0:",
"+ s += self.tree[i]",
"+ i -= i & -i",
"+ return s",
"+",
"+ def add(self, i, x):",
"+ while i <= self.size:",
"+ self.tree[i] += x",
"+ i += i & -i",
"+",
"+",
"+def bsearch(mn, mx, func):",
"+ # func(i)=True を満たす最大のi (mn<=i<mx)",
"+ idx = (mx + mn) // 2",
"+ while mx - mn > 1:",
"+ if func(idx):",
"+ idx, mn = (idx + mx) // 2, idx",
"+ continue",
"+ idx, mx = (idx + mn) // 2, idx",
"+ return idx",
"+",
"+",
"-for i in range(Q):",
"+j = 0",
"+for _ in range(Q):",
"- qs.append((a, b, c))",
"+ qs.append((a, b, c, j))",
"+ j += 1",
"- qs.append((a, b, c))",
"-R = [10**18]",
"-L = [10**18]",
"-ss = 0",
"-for a, b, c in qs:",
"- xs = []",
"+ qs.append((a, b, c, j))",
"+m = j",
"+qqs = sorted(qs, key=lambda x: x[0])",
"+j2i = dict()",
"+i2a = dict()",
"+for i, (a, b, c, j) in enumerate(qqs):",
"+ j2i[j] = i + 1",
"+ i2a[i + 1] = a",
"+m = len(j2i)",
"+st = Bit(m)",
"+st_sum = Bit(m)",
"+asum = bsum = 0",
"+# print(i2a)",
"+# print(j2i)",
"+for a, b, c, i in qs:",
"- x = heappop(L)",
"+ j = bsearch(0, m + 1, lambda x: st.sum(x) < ci)",
"+ # print(st_sum.sum(j+1))",
"- print((-x, ss))",
"- heappush(L, x)",
"- x = heappop(R)",
"- y = -heappop(L)",
"- if x < a:",
"- heappush(R, a)",
"- heappush(R, a)",
"- heappush(L, -x)",
"- heappush(L, -y)",
"- ss += a - x",
"- elif y > a:",
"- heappush(L, -a)",
"- heappush(L, -a)",
"- heappush(R, x)",
"- heappush(R, y)",
"- ss += y - a",
"- else:",
"- heappush(L, -a)",
"- heappush(R, a)",
"- heappush(L, -y)",
"- heappush(R, x)",
"- ss += b",
"+ if not i % 2:",
"+ print((i2a[j + 1], -2 * st_sum.sum(j + 1) + asum + bsum))",
"+ else:",
"+ print((i2a[j + 1], -st_sum.sum(j) + (asum - st_sum.sum(j + 1)) + bsum))",
"+ asum += a",
"+ bsum += b",
"+ st.add(j2i[i], 1)",
"+ st_sum.add(j2i[i], a)",
"+ ci = -(-(i + 1) // 2)"
] | false | 0.040235 | 0.043142 | 0.932616 | [
"s008097145",
"s378499585"
] |
u227020436 | p02702 | python | s021788802 | s354040062 | 200 | 169 | 16,500 | 9,676 | Accepted | Accepted | 15.5 | # D - Multiple of 2019
from collections import Counter
s = eval(input())
count = 0
counter = Counter([0])
suffix = [0] * (len(s) + 1)
pow = 1
for i in range(len(s) - 1, -1, -1):
suffix[i] = (int(s[i]) * pow + suffix[i + 1]) % 2019
pow = pow * 10 % 2019
count += counter[suffix[i]]
counter[suffix[i]] += 1
print(count)
| # D - Multiple of 2019
from collections import Counter
s = eval(input())
count = 0
counter = Counter([0])
suffix = 0
pow = 1
for i in range(len(s) - 1, -1, -1):
suffix = (int(s[i]) * pow + suffix) % 2019
pow = pow * 10 % 2019
count += counter[suffix]
counter[suffix] += 1
print(count)
| 18 | 18 | 350 | 317 | # D - Multiple of 2019
from collections import Counter
s = eval(input())
count = 0
counter = Counter([0])
suffix = [0] * (len(s) + 1)
pow = 1
for i in range(len(s) - 1, -1, -1):
suffix[i] = (int(s[i]) * pow + suffix[i + 1]) % 2019
pow = pow * 10 % 2019
count += counter[suffix[i]]
counter[suffix[i]] += 1
print(count)
| # D - Multiple of 2019
from collections import Counter
s = eval(input())
count = 0
counter = Counter([0])
suffix = 0
pow = 1
for i in range(len(s) - 1, -1, -1):
suffix = (int(s[i]) * pow + suffix) % 2019
pow = pow * 10 % 2019
count += counter[suffix]
counter[suffix] += 1
print(count)
| false | 0 | [
"-suffix = [0] * (len(s) + 1)",
"+suffix = 0",
"- suffix[i] = (int(s[i]) * pow + suffix[i + 1]) % 2019",
"+ suffix = (int(s[i]) * pow + suffix) % 2019",
"- count += counter[suffix[i]]",
"- counter[suffix[i]] += 1",
"+ count += counter[suffix]",
"+ counter[suffix] += 1"
] | false | 0.038495 | 0.054341 | 0.70839 | [
"s021788802",
"s354040062"
] |
u852690916 | p02901 | python | s000491662 | s910176589 | 519 | 303 | 74,476 | 73,328 | Accepted | Accepted | 41.62 | import sys
def main():
input = sys.stdin.readline
N,M=list(map(int, input().split()))
A,B,C=[],[],[]
for _ in range(M):
a,b=list(map(int, input().split()))
A.append(a)
B.append(b-1)
C.append(list([int(x)-1 for x in input().split()]))
#dp[i][j]=i番目の鍵まで見たとき、jの宝箱を開けられるようになった場合の費用の最小値
dp = [[10**9] * (1<<N) for _ in range(M+1)]
dp[0][0] = 0
for i in range(M):
ni = i + 1
for j in range(1<<N):
dp[ni][j] = min(dp[ni][j], dp[i][j])
nj = j
for c in C[i]: nj |= 1 << c
dp[ni][nj] = min(dp[ni][nj], dp[i][j] + A[i])
print((dp[M][(1<<N)-1] if dp[M][(1<<N)-1] < 10**9 else -1))
if __name__ == '__main__':
main() | import sys
def main():
input = sys.stdin.readline
N,M=list(map(int, input().split()))
A,B,C=[],[],[]
for _ in range(M):
a,b=list(map(int, input().split()))
A.append(a)
B.append(b-1)
C.append(list([int(x)-1 for x in input().split()]))
#dp[i][j]=i番目の鍵まで見たとき、jの宝箱を開けられるようになった場合の費用の最小値
dp = [[10**9] * (1<<N) for _ in range(M+1)]
dp[0][0] = 0
for i in range(M):
ni = i + 1
nj = 0
for c in C[i]: nj |= 1 << c
for j in range(1<<N):
dp[ni][j] = min(dp[ni][j], dp[i][j])
dp[ni][j|nj] = min(dp[ni][j|nj], dp[i][j] + A[i])
print((dp[M][(1<<N)-1] if dp[M][(1<<N)-1] < 10**9 else -1))
if __name__ == '__main__':
main() | 27 | 27 | 758 | 754 | import sys
def main():
input = sys.stdin.readline
N, M = list(map(int, input().split()))
A, B, C = [], [], []
for _ in range(M):
a, b = list(map(int, input().split()))
A.append(a)
B.append(b - 1)
C.append(list([int(x) - 1 for x in input().split()]))
# dp[i][j]=i番目の鍵まで見たとき、jの宝箱を開けられるようになった場合の費用の最小値
dp = [[10**9] * (1 << N) for _ in range(M + 1)]
dp[0][0] = 0
for i in range(M):
ni = i + 1
for j in range(1 << N):
dp[ni][j] = min(dp[ni][j], dp[i][j])
nj = j
for c in C[i]:
nj |= 1 << c
dp[ni][nj] = min(dp[ni][nj], dp[i][j] + A[i])
print((dp[M][(1 << N) - 1] if dp[M][(1 << N) - 1] < 10**9 else -1))
if __name__ == "__main__":
main()
| import sys
def main():
input = sys.stdin.readline
N, M = list(map(int, input().split()))
A, B, C = [], [], []
for _ in range(M):
a, b = list(map(int, input().split()))
A.append(a)
B.append(b - 1)
C.append(list([int(x) - 1 for x in input().split()]))
# dp[i][j]=i番目の鍵まで見たとき、jの宝箱を開けられるようになった場合の費用の最小値
dp = [[10**9] * (1 << N) for _ in range(M + 1)]
dp[0][0] = 0
for i in range(M):
ni = i + 1
nj = 0
for c in C[i]:
nj |= 1 << c
for j in range(1 << N):
dp[ni][j] = min(dp[ni][j], dp[i][j])
dp[ni][j | nj] = min(dp[ni][j | nj], dp[i][j] + A[i])
print((dp[M][(1 << N) - 1] if dp[M][(1 << N) - 1] < 10**9 else -1))
if __name__ == "__main__":
main()
| false | 0 | [
"+ nj = 0",
"+ for c in C[i]:",
"+ nj |= 1 << c",
"- nj = j",
"- for c in C[i]:",
"- nj |= 1 << c",
"- dp[ni][nj] = min(dp[ni][nj], dp[i][j] + A[i])",
"+ dp[ni][j | nj] = min(dp[ni][j | nj], dp[i][j] + A[i])"
] | false | 0.03794 | 0.060834 | 0.623669 | [
"s000491662",
"s910176589"
] |
u020390084 | p02995 | python | s925070941 | s957798092 | 268 | 36 | 64,236 | 5,204 | Accepted | Accepted | 86.57 | import fractions
a,b,c,d = list(map(int, input().split()))
cc = b//c - (a-1)//c
dd = b//d - (a-1)//d
gcd = int(c*d / fractions.gcd(c, d))
cd = b//gcd - (a-1)//gcd
print(((b-a+1) + cd - cc -dd))
| #!/usr/bin/env python3
import sys
import fractions
## 最小公倍数
def lcm(x, y):
return (x * y) // fractions.gcd(x, y)
def solve(A: int, B: int, C: int, D: int):
# n以下のCでもDでも割り切れない数を返す
def counter(n):
c_ct=n//C
d_ct =n//D
cd_ct=n//lcm(C,D)
return n-c_ct-d_ct+cd_ct
print((counter(B)-counter(A-1)))
return
def main():
def iterate_tokens():
for line in sys.stdin:
for word in line.split():
yield word
tokens = iterate_tokens()
A = int(next(tokens)) # type: int
B = int(next(tokens)) # type: int
C = int(next(tokens)) # type: int
D = int(next(tokens)) # type: int
solve(A, B, C, D)
if __name__ == '__main__':
main()
| 8 | 36 | 194 | 776 | import fractions
a, b, c, d = list(map(int, input().split()))
cc = b // c - (a - 1) // c
dd = b // d - (a - 1) // d
gcd = int(c * d / fractions.gcd(c, d))
cd = b // gcd - (a - 1) // gcd
print(((b - a + 1) + cd - cc - dd))
| #!/usr/bin/env python3
import sys
import fractions
## 最小公倍数
def lcm(x, y):
return (x * y) // fractions.gcd(x, y)
def solve(A: int, B: int, C: int, D: int):
# n以下のCでもDでも割り切れない数を返す
def counter(n):
c_ct = n // C
d_ct = n // D
cd_ct = n // lcm(C, D)
return n - c_ct - d_ct + cd_ct
print((counter(B) - counter(A - 1)))
return
def main():
def iterate_tokens():
for line in sys.stdin:
for word in line.split():
yield word
tokens = iterate_tokens()
A = int(next(tokens)) # type: int
B = int(next(tokens)) # type: int
C = int(next(tokens)) # type: int
D = int(next(tokens)) # type: int
solve(A, B, C, D)
if __name__ == "__main__":
main()
| false | 77.777778 | [
"+#!/usr/bin/env python3",
"+import sys",
"-a, b, c, d = list(map(int, input().split()))",
"-cc = b // c - (a - 1) // c",
"-dd = b // d - (a - 1) // d",
"-gcd = int(c * d / fractions.gcd(c, d))",
"-cd = b // gcd - (a - 1) // gcd",
"-print(((b - a + 1) + cd - cc - dd))",
"+## 最小公倍数",
"+def lcm(x, y):",
"+ return (x * y) // fractions.gcd(x, y)",
"+",
"+",
"+def solve(A: int, B: int, C: int, D: int):",
"+ # n以下のCでもDでも割り切れない数を返す",
"+ def counter(n):",
"+ c_ct = n // C",
"+ d_ct = n // D",
"+ cd_ct = n // lcm(C, D)",
"+ return n - c_ct - d_ct + cd_ct",
"+",
"+ print((counter(B) - counter(A - 1)))",
"+ return",
"+",
"+",
"+def main():",
"+ def iterate_tokens():",
"+ for line in sys.stdin:",
"+ for word in line.split():",
"+ yield word",
"+",
"+ tokens = iterate_tokens()",
"+ A = int(next(tokens)) # type: int",
"+ B = int(next(tokens)) # type: int",
"+ C = int(next(tokens)) # type: int",
"+ D = int(next(tokens)) # type: int",
"+ solve(A, B, C, D)",
"+",
"+",
"+if __name__ == \"__main__\":",
"+ main()"
] | false | 0.111291 | 0.08355 | 1.332029 | [
"s925070941",
"s957798092"
] |
u894941280 | p00001 | python | s606506462 | s799386968 | 20 | 10 | 4,208 | 4,208 | Accepted | Accepted | 50 | a = []
for i in range(10):
b = int(eval(input()))
a.append(b)
a.sort()
print(a[9])
print(a[8])
print(a[7]) | b=[]
for i in range(10):
a=int(eval(input()))
b.append(a)
b.sort()
for i in range(9,6,-1):
print(b[i]) | 8 | 7 | 108 | 104 | a = []
for i in range(10):
b = int(eval(input()))
a.append(b)
a.sort()
print(a[9])
print(a[8])
print(a[7])
| b = []
for i in range(10):
a = int(eval(input()))
b.append(a)
b.sort()
for i in range(9, 6, -1):
print(b[i])
| false | 12.5 | [
"-a = []",
"+b = []",
"- b = int(eval(input()))",
"- a.append(b)",
"-a.sort()",
"-print(a[9])",
"-print(a[8])",
"-print(a[7])",
"+ a = int(eval(input()))",
"+ b.append(a)",
"+b.sort()",
"+for i in range(9, 6, -1):",
"+ print(b[i])"
] | false | 0.035349 | 0.034779 | 1.016391 | [
"s606506462",
"s799386968"
] |
u408071652 | p03163 | python | s741194600 | s787848815 | 321 | 110 | 151,836 | 66,500 | Accepted | Accepted | 65.73 | import sys
import math
import itertools
# \n
def input():
return sys.stdin.readline().rstrip()
def main():
N, WW = list(map(int, input().split()))
dp = [[0] * (WW+1) for _ in range(N)]
for i in range(N):
w, v = list(map(int, input().split()))
for j in range(WW+1):
if w<=j:
dp[i][j] =max(dp[i-1][j],dp[i-1][j-w]+v)
else:
dp[i][j] =dp[i-1][j]
print((max(dp[N-1])))
if __name__ == "__main__":
main()
| import sys
# \n
def input():
return sys.stdin.readline().rstrip()
def main():
N, W = list(map(int, input().split()))
dp =[0] *(W+1)
for i in range(N):
w,v =list(map(int,input().split()))
for i in range(W,w-1,-1):
dp[i] =max(dp[i],dp[i-w]+v)
print((max(dp)))
if __name__ == "__main__":
main()
| 30 | 27 | 520 | 369 | import sys
import math
import itertools
# \n
def input():
return sys.stdin.readline().rstrip()
def main():
N, WW = list(map(int, input().split()))
dp = [[0] * (WW + 1) for _ in range(N)]
for i in range(N):
w, v = list(map(int, input().split()))
for j in range(WW + 1):
if w <= j:
dp[i][j] = max(dp[i - 1][j], dp[i - 1][j - w] + v)
else:
dp[i][j] = dp[i - 1][j]
print((max(dp[N - 1])))
if __name__ == "__main__":
main()
| import sys
# \n
def input():
return sys.stdin.readline().rstrip()
def main():
N, W = list(map(int, input().split()))
dp = [0] * (W + 1)
for i in range(N):
w, v = list(map(int, input().split()))
for i in range(W, w - 1, -1):
dp[i] = max(dp[i], dp[i - w] + v)
print((max(dp)))
if __name__ == "__main__":
main()
| false | 10 | [
"-import math",
"-import itertools",
"- N, WW = list(map(int, input().split()))",
"- dp = [[0] * (WW + 1) for _ in range(N)]",
"+ N, W = list(map(int, input().split()))",
"+ dp = [0] * (W + 1)",
"- for j in range(WW + 1):",
"- if w <= j:",
"- dp[i][j] = max(dp[i - 1][j], dp[i - 1][j - w] + v)",
"- else:",
"- dp[i][j] = dp[i - 1][j]",
"- print((max(dp[N - 1])))",
"+ for i in range(W, w - 1, -1):",
"+ dp[i] = max(dp[i], dp[i - w] + v)",
"+ print((max(dp)))"
] | false | 0.041329 | 0.039156 | 1.055499 | [
"s741194600",
"s787848815"
] |
u770828422 | p03210 | python | s552141416 | s530047423 | 19 | 17 | 2,940 | 2,940 | Accepted | Accepted | 10.53 | a = int(eval(input()))
print(("YES" if a == 3 or a == 5 or a == 7 else "NO")) | a = int(eval(input()))
print(("YES" if a == 3 or a == 5 or a == 7 else "NO")) # if a in (3, 5, 7) else | 2 | 2 | 70 | 95 | a = int(eval(input()))
print(("YES" if a == 3 or a == 5 or a == 7 else "NO"))
| a = int(eval(input()))
print(("YES" if a == 3 or a == 5 or a == 7 else "NO")) # if a in (3, 5, 7) else
| false | 0 | [
"-print((\"YES\" if a == 3 or a == 5 or a == 7 else \"NO\"))",
"+print((\"YES\" if a == 3 or a == 5 or a == 7 else \"NO\")) # if a in (3, 5, 7) else"
] | false | 0.080478 | 0.075643 | 1.063924 | [
"s552141416",
"s530047423"
] |
u268793453 | p02821 | python | s425094564 | s271119830 | 682 | 489 | 41,140 | 48,444 | Accepted | Accepted | 28.3 | import numpy
n, m = [int(i) for i in input().split()]
A = [int(i) for i in input().split()]
sup_A = 10 ** 5
B = [0] * (2 * sup_A + 1)
for a in A:
B[a] += 1
C = numpy.fft.fft(B)
D = numpy.fft.ifft(C * C)
ans = 0
cnt = 0
for i in range(2 * sup_A, -1, -1):
d = int(D[i].real + 0.5)
if cnt + d >= m:
ans += (m - cnt) * i
break
cnt += d
ans += i * d
print(ans) | import numpy
n, m = [int(i) for i in input().split()]
A = [int(i) for i in input().split()]
sup_A = 10 ** 5
B = [0] * (1 << 18)
for a in A:
B[a] += 1
C = numpy.fft.fft(B)
D = numpy.fft.ifft(C * C)
ans = 0
cnt = 0
for i in range(2 * sup_A, -1, -1):
d = int(D[i].real + 0.5)
if cnt + d >= m:
ans += (m - cnt) * i
break
cnt += d
ans += i * d
print(ans) | 22 | 22 | 415 | 409 | import numpy
n, m = [int(i) for i in input().split()]
A = [int(i) for i in input().split()]
sup_A = 10**5
B = [0] * (2 * sup_A + 1)
for a in A:
B[a] += 1
C = numpy.fft.fft(B)
D = numpy.fft.ifft(C * C)
ans = 0
cnt = 0
for i in range(2 * sup_A, -1, -1):
d = int(D[i].real + 0.5)
if cnt + d >= m:
ans += (m - cnt) * i
break
cnt += d
ans += i * d
print(ans)
| import numpy
n, m = [int(i) for i in input().split()]
A = [int(i) for i in input().split()]
sup_A = 10**5
B = [0] * (1 << 18)
for a in A:
B[a] += 1
C = numpy.fft.fft(B)
D = numpy.fft.ifft(C * C)
ans = 0
cnt = 0
for i in range(2 * sup_A, -1, -1):
d = int(D[i].real + 0.5)
if cnt + d >= m:
ans += (m - cnt) * i
break
cnt += d
ans += i * d
print(ans)
| false | 0 | [
"-B = [0] * (2 * sup_A + 1)",
"+B = [0] * (1 << 18)"
] | false | 0.641084 | 1.329023 | 0.482372 | [
"s425094564",
"s271119830"
] |
u264349861 | p02536 | python | s751933428 | s586206594 | 1,770 | 548 | 897,824 | 88,160 | Accepted | Accepted | 69.04 | #dt = {} for i in x: dt[i] = dt.get(i,0)+1
import sys;input = sys.stdin.readline
inp,ip = lambda :int(eval(input())),lambda :[int(w) for w in input().split()]
"""
n,k = ip()
x = [inp() for i in range(n)]
"""
import sys
sys.setrecursionlimit(10**6)
def dfs(u):
global vis,graph
vis.add(u)
for i in graph[u]:
if i not in vis:
dfs(i)
n,m = ip()
graph = {i:[] for i in range(1,n+1)}
for i in range(m):
a,b = ip()
graph[a].append(b)
graph[b].append(a)
vis = set()
ct = 0
for i in range(1,n+1):
if i not in vis:
dfs(i)
ct += 1
print((ct-1)) | #dt = {} for i in x: dt[i] = dt.get(i,0)+1
import sys;input = sys.stdin.readline
#import io,os; input = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline #for pypy
inp,ip = lambda :int(eval(input())),lambda :[int(w) for w in input().split()]
class DisjSet:
def __init__(self,n):
self.rank = [1]*n
self.parent = [i for i in range(n)]
def find(self,x):
if self.parent[x] != x:
self.parent[x] = self.find(self.parent[x])
return self.parent[x]
def Union(self,x,y):
xset = self.find(x)
yset = self.find(y)
if xset == yset: return
if self.rank[xset] < self.rank[yset]:
self.parent[xset] = yset
elif self.rank[xset] > self.rank[yset]:
self.parent[yset] = xset
else:
self.parent[yset] = xset
self.rank[xset] += 1
n,m = ip()
obj = DisjSet(n)
for i in range(m):
a,b = ip()
obj.Union(a-1,b-1)
dt = {}
for i in range(n):
p = obj.find(i)
dt[p] = dt.get(p,0)+1
print((len(list(dt.keys()))-1))
| 30 | 39 | 621 | 1,096 | # dt = {} for i in x: dt[i] = dt.get(i,0)+1
import sys
input = sys.stdin.readline
inp, ip = lambda: int(eval(input())), lambda: [int(w) for w in input().split()]
"""
n,k = ip()
x = [inp() for i in range(n)]
"""
import sys
sys.setrecursionlimit(10**6)
def dfs(u):
global vis, graph
vis.add(u)
for i in graph[u]:
if i not in vis:
dfs(i)
n, m = ip()
graph = {i: [] for i in range(1, n + 1)}
for i in range(m):
a, b = ip()
graph[a].append(b)
graph[b].append(a)
vis = set()
ct = 0
for i in range(1, n + 1):
if i not in vis:
dfs(i)
ct += 1
print((ct - 1))
| # dt = {} for i in x: dt[i] = dt.get(i,0)+1
import sys
input = sys.stdin.readline
# import io,os; input = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline #for pypy
inp, ip = lambda: int(eval(input())), lambda: [int(w) for w in input().split()]
class DisjSet:
def __init__(self, n):
self.rank = [1] * n
self.parent = [i for i in range(n)]
def find(self, x):
if self.parent[x] != x:
self.parent[x] = self.find(self.parent[x])
return self.parent[x]
def Union(self, x, y):
xset = self.find(x)
yset = self.find(y)
if xset == yset:
return
if self.rank[xset] < self.rank[yset]:
self.parent[xset] = yset
elif self.rank[xset] > self.rank[yset]:
self.parent[yset] = xset
else:
self.parent[yset] = xset
self.rank[xset] += 1
n, m = ip()
obj = DisjSet(n)
for i in range(m):
a, b = ip()
obj.Union(a - 1, b - 1)
dt = {}
for i in range(n):
p = obj.find(i)
dt[p] = dt.get(p, 0) + 1
print((len(list(dt.keys())) - 1))
| false | 23.076923 | [
"+# import io,os; input = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline #for pypy",
"-\"\"\"",
"-n,k = ip()",
"-x = [inp() for i in range(n)]",
"-\"\"\"",
"-import sys",
"-",
"-sys.setrecursionlimit(10**6)",
"-def dfs(u):",
"- global vis, graph",
"- vis.add(u)",
"- for i in graph[u]:",
"- if i not in vis:",
"- dfs(i)",
"+class DisjSet:",
"+ def __init__(self, n):",
"+ self.rank = [1] * n",
"+ self.parent = [i for i in range(n)]",
"+",
"+ def find(self, x):",
"+ if self.parent[x] != x:",
"+ self.parent[x] = self.find(self.parent[x])",
"+ return self.parent[x]",
"+",
"+ def Union(self, x, y):",
"+ xset = self.find(x)",
"+ yset = self.find(y)",
"+ if xset == yset:",
"+ return",
"+ if self.rank[xset] < self.rank[yset]:",
"+ self.parent[xset] = yset",
"+ elif self.rank[xset] > self.rank[yset]:",
"+ self.parent[yset] = xset",
"+ else:",
"+ self.parent[yset] = xset",
"+ self.rank[xset] += 1",
"-graph = {i: [] for i in range(1, n + 1)}",
"+obj = DisjSet(n)",
"- graph[a].append(b)",
"- graph[b].append(a)",
"-vis = set()",
"-ct = 0",
"-for i in range(1, n + 1):",
"- if i not in vis:",
"- dfs(i)",
"- ct += 1",
"-print((ct - 1))",
"+ obj.Union(a - 1, b - 1)",
"+dt = {}",
"+for i in range(n):",
"+ p = obj.find(i)",
"+ dt[p] = dt.get(p, 0) + 1",
"+print((len(list(dt.keys())) - 1))"
] | false | 0.039359 | 0.047468 | 0.829173 | [
"s751933428",
"s586206594"
] |
u352394527 | p00507 | python | s887715182 | s245098649 | 50 | 30 | 5,924 | 5,936 | Accepted | Accepted | 40 | def con(m,n):
ln = len(str(n))
return m * 10 ** ln + n
n = int(eval(input()))
lst = [int(eval(input())) for i in range(n)]
lst.sort()
lst = lst[0:4]
save = []
for i in lst:
for j in lst:
if i != j:
save.append(con(i, j))
save.sort()
print((save[2]))
| def main():
def con(m,n):
ln = len(str(n))
return m * 10 ** ln + n
n = int(eval(input()))
lst = [int(eval(input())) for i in range(n)]
lst.sort()
lst = lst[0:4]
save = []
for i in lst:
for j in lst:
if i != j:
save.append(con(i, j))
save.sort()
print((save[2]))
main()
| 15 | 17 | 267 | 318 | def con(m, n):
ln = len(str(n))
return m * 10**ln + n
n = int(eval(input()))
lst = [int(eval(input())) for i in range(n)]
lst.sort()
lst = lst[0:4]
save = []
for i in lst:
for j in lst:
if i != j:
save.append(con(i, j))
save.sort()
print((save[2]))
| def main():
def con(m, n):
ln = len(str(n))
return m * 10**ln + n
n = int(eval(input()))
lst = [int(eval(input())) for i in range(n)]
lst.sort()
lst = lst[0:4]
save = []
for i in lst:
for j in lst:
if i != j:
save.append(con(i, j))
save.sort()
print((save[2]))
main()
| false | 11.764706 | [
"-def con(m, n):",
"- ln = len(str(n))",
"- return m * 10**ln + n",
"+def main():",
"+ def con(m, n):",
"+ ln = len(str(n))",
"+ return m * 10**ln + n",
"+",
"+ n = int(eval(input()))",
"+ lst = [int(eval(input())) for i in range(n)]",
"+ lst.sort()",
"+ lst = lst[0:4]",
"+ save = []",
"+ for i in lst:",
"+ for j in lst:",
"+ if i != j:",
"+ save.append(con(i, j))",
"+ save.sort()",
"+ print((save[2]))",
"-n = int(eval(input()))",
"-lst = [int(eval(input())) for i in range(n)]",
"-lst.sort()",
"-lst = lst[0:4]",
"-save = []",
"-for i in lst:",
"- for j in lst:",
"- if i != j:",
"- save.append(con(i, j))",
"-save.sort()",
"-print((save[2]))",
"+main()"
] | false | 0.045335 | 0.038438 | 1.179433 | [
"s887715182",
"s245098649"
] |
u226108478 | p03325 | python | s261568858 | s343948402 | 86 | 60 | 4,148 | 4,148 | Accepted | Accepted | 30.23 | # -*- coding: utf-8 -*-
# AtCoder Beginner Contest
if __name__ == '__main__':
n = int(eval(input()))
a = list(map(int, input().split()))
count = 0
# See:
# https://beta.atcoder.jp/contests/abc100/submissions/2675457
for ai in a:
while ai % 2 == 0:
ai //= 2
count += 1
print(count)
| # -*- coding: utf-8 -*-
def main():
n = int(eval(input()))
a = list(map(int, input().split()))
ans = 0
for ai in a:
while ai % 2 == 0:
ans += 1
ai = ai // 2
print(ans)
if __name__ == '__main__':
main()
| 17 | 18 | 355 | 275 | # -*- coding: utf-8 -*-
# AtCoder Beginner Contest
if __name__ == "__main__":
n = int(eval(input()))
a = list(map(int, input().split()))
count = 0
# See:
# https://beta.atcoder.jp/contests/abc100/submissions/2675457
for ai in a:
while ai % 2 == 0:
ai //= 2
count += 1
print(count)
| # -*- coding: utf-8 -*-
def main():
n = int(eval(input()))
a = list(map(int, input().split()))
ans = 0
for ai in a:
while ai % 2 == 0:
ans += 1
ai = ai // 2
print(ans)
if __name__ == "__main__":
main()
| false | 5.555556 | [
"-# AtCoder Beginner Contest",
"-if __name__ == \"__main__\":",
"+def main():",
"- count = 0",
"- # See:",
"- # https://beta.atcoder.jp/contests/abc100/submissions/2675457",
"+ ans = 0",
"- ai //= 2",
"- count += 1",
"- print(count)",
"+ ans += 1",
"+ ai = ai // 2",
"+ print(ans)",
"+",
"+",
"+if __name__ == \"__main__\":",
"+ main()"
] | false | 0.054884 | 0.036492 | 1.504023 | [
"s261568858",
"s343948402"
] |
u561083515 | p02780 | python | s723928615 | s366634248 | 267 | 178 | 86,348 | 23,524 | Accepted | Accepted | 33.33 | import sys
input = sys.stdin.readline
from itertools import accumulate
def main():
N,K = list(map(int,input().split()))
p = [int(i) for i in input().split()]
for i in range(N):
p[i] = (p[i] + 1) / 2
p = [0] + list(accumulate(p))
ans = 0
for i in range(N-K+2):
ans = max(ans, p[i+(K-1)] - p[i-1])
print(ans)
if __name__ == "__main__":
main() | N,K = list(map(int, input().split()))
# p[i]での出目の期待値
P = [(int(i) + 1) / 2 for i in input().split()]
from itertools import accumulate
P = [0] + list(accumulate(P))
ans = 0
for i in range(N - K + 1):
ans = max(ans, P[i + K] - P[i])
print(ans) | 21 | 13 | 408 | 255 | import sys
input = sys.stdin.readline
from itertools import accumulate
def main():
N, K = list(map(int, input().split()))
p = [int(i) for i in input().split()]
for i in range(N):
p[i] = (p[i] + 1) / 2
p = [0] + list(accumulate(p))
ans = 0
for i in range(N - K + 2):
ans = max(ans, p[i + (K - 1)] - p[i - 1])
print(ans)
if __name__ == "__main__":
main()
| N, K = list(map(int, input().split()))
# p[i]での出目の期待値
P = [(int(i) + 1) / 2 for i in input().split()]
from itertools import accumulate
P = [0] + list(accumulate(P))
ans = 0
for i in range(N - K + 1):
ans = max(ans, P[i + K] - P[i])
print(ans)
| false | 38.095238 | [
"-import sys",
"-",
"-input = sys.stdin.readline",
"+N, K = list(map(int, input().split()))",
"+# p[i]での出目の期待値",
"+P = [(int(i) + 1) / 2 for i in input().split()]",
"-",
"-def main():",
"- N, K = list(map(int, input().split()))",
"- p = [int(i) for i in input().split()]",
"- for i in range(N):",
"- p[i] = (p[i] + 1) / 2",
"- p = [0] + list(accumulate(p))",
"- ans = 0",
"- for i in range(N - K + 2):",
"- ans = max(ans, p[i + (K - 1)] - p[i - 1])",
"- print(ans)",
"-",
"-",
"-if __name__ == \"__main__\":",
"- main()",
"+P = [0] + list(accumulate(P))",
"+ans = 0",
"+for i in range(N - K + 1):",
"+ ans = max(ans, P[i + K] - P[i])",
"+print(ans)"
] | false | 0.046058 | 0.044845 | 1.027042 | [
"s723928615",
"s366634248"
] |
u761320129 | p02941 | python | s957979488 | s970700523 | 1,989 | 1,212 | 128,276 | 123,540 | Accepted | Accepted | 39.06 | import heapq
N = int(eval(input()))
A = list(map(int,input().split()))
B = list(map(int,input().split()))
if any(a>b for a,b in zip(A,B)):
print((-1))
exit()
def pb(i):
return i-1 if i-1 >= 0 else N-1
def nx(i):
return i+1 if i+1 < N else 0
hq = []
for i,(a,b) in enumerate(zip(A,B)):
if a <= b - B[pb(i)] - B[nx(i)]:
hq.append((-b,i))
heapq.heapify(hq)
ans = 0
while hq:
_,i = heapq.heappop(hq)
if B[i] == A[i]: continue
l = B[pb(i)]
r = B[nx(i)]
if B[i]-l-r < A[i]: continue
k = (B[i]-A[i]) // (l+r)
ans += k
B[i] -= k*(l+r)
ll = B[pb(pb(i))]
rr = B[nx(nx(i))]
if A[nx(i)] <= r - B[i] - rr:
heapq.heappush(hq, (-r,nx(i)))
if A[pb(i)] <= l - B[i] - ll:
heapq.heappush(hq, (-l,pb(i)))
if all(a==b for a,b in zip(A,B)):
print(ans)
else:
print((-1)) | import heapq
N = int(eval(input()))
A = list(map(int,input().split()))
B = list(map(int,input().split()))
if any(a>b for a,b in zip(A,B)):
print((-1))
exit()
def pb(i):
return i-1 if i-1 >= 0 else N-1
def nx(i):
return i+1 if i+1 < N else 0
hq = []
for i,(a,b) in enumerate(zip(A,B)):
if a <= b - B[pb(i)] - B[nx(i)]:
hq.append(-(b*N+i))
heapq.heapify(hq)
ans = 0
while hq:
i = (-heapq.heappop(hq)) % N
if B[i] == A[i]: continue
l = B[pb(i)]
r = B[nx(i)]
if B[i]-l-r < A[i]: continue
k = (B[i]-A[i]) // (l+r)
ans += k
B[i] -= k*(l+r)
ll = B[pb(pb(i))]
rr = B[nx(nx(i))]
if A[nx(i)] <= r - B[i] - rr:
heapq.heappush(hq, -(r*N + nx(i)))
if A[pb(i)] <= l - B[i] - ll:
heapq.heappush(hq, -(l*N + pb(i)))
if all(a==b for a,b in zip(A,B)):
print(ans)
else:
print((-1)) | 41 | 41 | 882 | 897 | import heapq
N = int(eval(input()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
if any(a > b for a, b in zip(A, B)):
print((-1))
exit()
def pb(i):
return i - 1 if i - 1 >= 0 else N - 1
def nx(i):
return i + 1 if i + 1 < N else 0
hq = []
for i, (a, b) in enumerate(zip(A, B)):
if a <= b - B[pb(i)] - B[nx(i)]:
hq.append((-b, i))
heapq.heapify(hq)
ans = 0
while hq:
_, i = heapq.heappop(hq)
if B[i] == A[i]:
continue
l = B[pb(i)]
r = B[nx(i)]
if B[i] - l - r < A[i]:
continue
k = (B[i] - A[i]) // (l + r)
ans += k
B[i] -= k * (l + r)
ll = B[pb(pb(i))]
rr = B[nx(nx(i))]
if A[nx(i)] <= r - B[i] - rr:
heapq.heappush(hq, (-r, nx(i)))
if A[pb(i)] <= l - B[i] - ll:
heapq.heappush(hq, (-l, pb(i)))
if all(a == b for a, b in zip(A, B)):
print(ans)
else:
print((-1))
| import heapq
N = int(eval(input()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
if any(a > b for a, b in zip(A, B)):
print((-1))
exit()
def pb(i):
return i - 1 if i - 1 >= 0 else N - 1
def nx(i):
return i + 1 if i + 1 < N else 0
hq = []
for i, (a, b) in enumerate(zip(A, B)):
if a <= b - B[pb(i)] - B[nx(i)]:
hq.append(-(b * N + i))
heapq.heapify(hq)
ans = 0
while hq:
i = (-heapq.heappop(hq)) % N
if B[i] == A[i]:
continue
l = B[pb(i)]
r = B[nx(i)]
if B[i] - l - r < A[i]:
continue
k = (B[i] - A[i]) // (l + r)
ans += k
B[i] -= k * (l + r)
ll = B[pb(pb(i))]
rr = B[nx(nx(i))]
if A[nx(i)] <= r - B[i] - rr:
heapq.heappush(hq, -(r * N + nx(i)))
if A[pb(i)] <= l - B[i] - ll:
heapq.heappush(hq, -(l * N + pb(i)))
if all(a == b for a, b in zip(A, B)):
print(ans)
else:
print((-1))
| false | 0 | [
"- hq.append((-b, i))",
"+ hq.append(-(b * N + i))",
"- _, i = heapq.heappop(hq)",
"+ i = (-heapq.heappop(hq)) % N",
"- heapq.heappush(hq, (-r, nx(i)))",
"+ heapq.heappush(hq, -(r * N + nx(i)))",
"- heapq.heappush(hq, (-l, pb(i)))",
"+ heapq.heappush(hq, -(l * N + pb(i)))"
] | false | 0.040877 | 0.040175 | 1.017479 | [
"s957979488",
"s970700523"
] |
u063596417 | p03494 | python | s284064991 | s798501649 | 92 | 27 | 63,992 | 9,172 | Accepted | Accepted | 70.65 | n = int(eval(input()))
a = list(map(int, input().split()))
ans = 0
isEven = True
while isEven:
list_tmp = []
for an in a:
q, mod = divmod(an, 2)
if mod ==0:
list_tmp.append(q)
else:
isEven = False
break;
a = list_tmp
ans += 1
print((ans - 1))
| def main():
n = int(eval(input()))
a = list(map(int, input().split()))
ans = 0
is_even = True
while is_even:
list_tmp = []
for an in a:
if an % 2 == 0:
list_tmp.append(an / 2)
else:
is_even = False
break
if is_even:
a = list_tmp
ans += 1
print(ans)
if __name__ == '__main__':
main()
| 19 | 24 | 288 | 447 | n = int(eval(input()))
a = list(map(int, input().split()))
ans = 0
isEven = True
while isEven:
list_tmp = []
for an in a:
q, mod = divmod(an, 2)
if mod == 0:
list_tmp.append(q)
else:
isEven = False
break
a = list_tmp
ans += 1
print((ans - 1))
| def main():
n = int(eval(input()))
a = list(map(int, input().split()))
ans = 0
is_even = True
while is_even:
list_tmp = []
for an in a:
if an % 2 == 0:
list_tmp.append(an / 2)
else:
is_even = False
break
if is_even:
a = list_tmp
ans += 1
print(ans)
if __name__ == "__main__":
main()
| false | 20.833333 | [
"-n = int(eval(input()))",
"-a = list(map(int, input().split()))",
"-ans = 0",
"-isEven = True",
"-while isEven:",
"- list_tmp = []",
"- for an in a:",
"- q, mod = divmod(an, 2)",
"- if mod == 0:",
"- list_tmp.append(q)",
"- else:",
"- isEven = False",
"- break",
"- a = list_tmp",
"- ans += 1",
"-print((ans - 1))",
"+def main():",
"+ n = int(eval(input()))",
"+ a = list(map(int, input().split()))",
"+ ans = 0",
"+ is_even = True",
"+ while is_even:",
"+ list_tmp = []",
"+ for an in a:",
"+ if an % 2 == 0:",
"+ list_tmp.append(an / 2)",
"+ else:",
"+ is_even = False",
"+ break",
"+ if is_even:",
"+ a = list_tmp",
"+ ans += 1",
"+ print(ans)",
"+",
"+",
"+if __name__ == \"__main__\":",
"+ main()"
] | false | 0.0556 | 0.14504 | 0.383344 | [
"s284064991",
"s798501649"
] |
u284854859 | p03377 | python | s526856143 | s148656138 | 19 | 17 | 2,940 | 2,940 | Accepted | Accepted | 10.53 | a,b,x = list(map(int,input().split()))
if a <= x and a + b >= x:
print('YES')
else:
print('NO') | a,b,x = list(map(int,input().split()))
if a <= x <= a+b:
print("YES")
else:
print("NO") | 6 | 6 | 99 | 95 | a, b, x = list(map(int, input().split()))
if a <= x and a + b >= x:
print("YES")
else:
print("NO")
| a, b, x = list(map(int, input().split()))
if a <= x <= a + b:
print("YES")
else:
print("NO")
| false | 0 | [
"-if a <= x and a + b >= x:",
"+if a <= x <= a + b:"
] | false | 0.047449 | 0.137323 | 0.345527 | [
"s526856143",
"s148656138"
] |
u102461423 | p03001 | python | s770263839 | s090479823 | 19 | 17 | 2,940 | 3,060 | Accepted | Accepted | 10.53 | W,H,x,y = list(map(int,input().split()))
# 中心とx,yを通る直線で切る
area = (W*H)/2
bl = (W == 2*x and H == 2*y)
t = 1 if bl else 0
print(('{} {}'.format(area, t))) | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
W,H,x,y = list(map(int,read().split()))
W,H,x,y
bl = (W == 2*x and H == 2*y)
area = W*H/2
print((area,1 if bl else 0)) | 9 | 12 | 156 | 240 | W, H, x, y = list(map(int, input().split()))
# 中心とx,yを通る直線で切る
area = (W * H) / 2
bl = W == 2 * x and H == 2 * y
t = 1 if bl else 0
print(("{} {}".format(area, t)))
| import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
W, H, x, y = list(map(int, read().split()))
W, H, x, y
bl = W == 2 * x and H == 2 * y
area = W * H / 2
print((area, 1 if bl else 0))
| false | 25 | [
"-W, H, x, y = list(map(int, input().split()))",
"-# 中心とx,yを通る直線で切る",
"-area = (W * H) / 2",
"+import sys",
"+",
"+read = sys.stdin.buffer.read",
"+readline = sys.stdin.buffer.readline",
"+readlines = sys.stdin.buffer.readlines",
"+W, H, x, y = list(map(int, read().split()))",
"+W, H, x, y",
"-t = 1 if bl else 0",
"-print((\"{} {}\".format(area, t)))",
"+area = W * H / 2",
"+print((area, 1 if bl else 0))"
] | false | 0.047759 | 0.051293 | 0.931092 | [
"s770263839",
"s090479823"
] |
u067983636 | p03666 | python | s979024222 | s639218311 | 142 | 30 | 4,076 | 4,172 | Accepted | Accepted | 78.87 | import bisect
import copy
import heapq
import sys
import itertools
import math
import queue
input = sys.stdin.readline
sys.setrecursionlimit(1000000)
# mod = 10 ** 9 + 7
def read_values(): return list(map(int, input().split()))
def read_index(): return [int(x) - 1 for x in input().split()]
def read_list(): return list(read_values())
def read_lists(N): return [read_list() for n in range(N)]
def init_dp1(init, N): return [init for _ in range(N)]
def init_dp2(init, N, M): return [[init for _ in range(M)] for _ in range(N)]
def main():
N, A, B, C, D = read_values()
M = A + (N - 1) * D
m = A + (N - 1) * C
for _ in range(N):
if m <= B <= M:
print("YES")
return
M -= D + C
m -= D + C
print("NO")
if __name__ == "__main__":
main()
| import bisect
import copy
import heapq
import sys
import itertools
import math
import queue
input = sys.stdin.readline
sys.setrecursionlimit(1000000)
# mod = 10 ** 9 + 7
def read_values(): return list(map(int, input().split()))
def read_index(): return [int(x) - 1 for x in input().split()]
def read_list(): return list(read_values())
def read_lists(N): return [read_list() for n in range(N)]
def init_dp1(init, N): return [init for _ in range(N)]
def init_dp2(init, N, M): return [[init for _ in range(M)] for _ in range(N)]
def main():
N, A, B, C, D = read_values()
K = (A - B + (N - 1) * D) // (C + D)
M = A + (N - K - 1) * D - K * C
m = A + (N - K - 1) * C - K * D
print(("YES" if 0 <= K and m <= B <= M else "NO"))
if __name__ == "__main__":
main()
| 38 | 31 | 856 | 812 | import bisect
import copy
import heapq
import sys
import itertools
import math
import queue
input = sys.stdin.readline
sys.setrecursionlimit(1000000)
# mod = 10 ** 9 + 7
def read_values():
return list(map(int, input().split()))
def read_index():
return [int(x) - 1 for x in input().split()]
def read_list():
return list(read_values())
def read_lists(N):
return [read_list() for n in range(N)]
def init_dp1(init, N):
return [init for _ in range(N)]
def init_dp2(init, N, M):
return [[init for _ in range(M)] for _ in range(N)]
def main():
N, A, B, C, D = read_values()
M = A + (N - 1) * D
m = A + (N - 1) * C
for _ in range(N):
if m <= B <= M:
print("YES")
return
M -= D + C
m -= D + C
print("NO")
if __name__ == "__main__":
main()
| import bisect
import copy
import heapq
import sys
import itertools
import math
import queue
input = sys.stdin.readline
sys.setrecursionlimit(1000000)
# mod = 10 ** 9 + 7
def read_values():
return list(map(int, input().split()))
def read_index():
return [int(x) - 1 for x in input().split()]
def read_list():
return list(read_values())
def read_lists(N):
return [read_list() for n in range(N)]
def init_dp1(init, N):
return [init for _ in range(N)]
def init_dp2(init, N, M):
return [[init for _ in range(M)] for _ in range(N)]
def main():
N, A, B, C, D = read_values()
K = (A - B + (N - 1) * D) // (C + D)
M = A + (N - K - 1) * D - K * C
m = A + (N - K - 1) * C - K * D
print(("YES" if 0 <= K and m <= B <= M else "NO"))
if __name__ == "__main__":
main()
| false | 18.421053 | [
"- M = A + (N - 1) * D",
"- m = A + (N - 1) * C",
"- for _ in range(N):",
"- if m <= B <= M:",
"- print(\"YES\")",
"- return",
"- M -= D + C",
"- m -= D + C",
"- print(\"NO\")",
"+ K = (A - B + (N - 1) * D) // (C + D)",
"+ M = A + (N - K - 1) * D - K * C",
"+ m = A + (N - K - 1) * C - K * D",
"+ print((\"YES\" if 0 <= K and m <= B <= M else \"NO\"))"
] | false | 0.118298 | 0.044415 | 2.663503 | [
"s979024222",
"s639218311"
] |
u884323674 | p03448 | python | s626747750 | s022403672 | 51 | 33 | 8,344 | 3,064 | Accepted | Accepted | 35.29 | A = int(eval(input()))
B = int(eval(input()))
C = int(eval(input()))
X = int(eval(input()))
A_list = [500*i for i in range(A+1)]
B_list = [100*i for i in range(B+1)]
C_list = [50*i for i in range(C+1)]
sum_list = []
for i in A_list:
for j in B_list:
i_j = i + j
for k in C_list:
sum_list.append(i_j + k)
result = 0
for i in sum_list:
if i == X:
result += 1
print(result) | A = int(eval(input()))
B = int(eval(input()))
C = int(eval(input()))
X = int(eval(input()))
A_list = [500*i for i in range(A+1)]
B_list = [100*i for i in range(B+1)]
C_list = [50*i for i in range(C+1)]
result = 0
for i in A_list:
for j in B_list:
i_j = i + j
for k in C_list:
if i_j + k == X:
result += 1
print(result) | 22 | 19 | 415 | 364 | A = int(eval(input()))
B = int(eval(input()))
C = int(eval(input()))
X = int(eval(input()))
A_list = [500 * i for i in range(A + 1)]
B_list = [100 * i for i in range(B + 1)]
C_list = [50 * i for i in range(C + 1)]
sum_list = []
for i in A_list:
for j in B_list:
i_j = i + j
for k in C_list:
sum_list.append(i_j + k)
result = 0
for i in sum_list:
if i == X:
result += 1
print(result)
| A = int(eval(input()))
B = int(eval(input()))
C = int(eval(input()))
X = int(eval(input()))
A_list = [500 * i for i in range(A + 1)]
B_list = [100 * i for i in range(B + 1)]
C_list = [50 * i for i in range(C + 1)]
result = 0
for i in A_list:
for j in B_list:
i_j = i + j
for k in C_list:
if i_j + k == X:
result += 1
print(result)
| false | 13.636364 | [
"-sum_list = []",
"+result = 0",
"- sum_list.append(i_j + k)",
"-result = 0",
"-for i in sum_list:",
"- if i == X:",
"- result += 1",
"+ if i_j + k == X:",
"+ result += 1"
] | false | 0.090326 | 0.068372 | 1.321104 | [
"s626747750",
"s022403672"
] |
u761320129 | p03426 | python | s170300490 | s468491444 | 643 | 556 | 39,280 | 40,812 | Accepted | Accepted | 13.53 | H,W,D = list(map(int,input().split()))
src = [list(map(int,input().split())) for i in range(H)]
Q = int(eval(input()))
qs = [tuple(map(int,input().split())) for i in range(Q)]
pos = [[None for i in range(D)] for j in range(H*W//D + 1)]
for y in range(H):
for x in range(W):
a = src[y][x]
b,c = a//D, a%D
pos[b][c] = (x,y)
cums = [[0] for i in range(D)]
for i in range(D):
for j in range(H*W//D):
if pos[j][i] is None or pos[j+1][i] is None:
cums[i].append(cums[i][-1])
else:
x1,y1 = pos[j][i]
x2,y2 = pos[j+1][i]
dist = abs(x1-x2) + abs(y1-y2)
cums[i].append(cums[i][-1] + dist)
for l,r in qs:
d = l%D
print((cums[d][r//D] - cums[d][l//D]))
| H,W,D = map(int,input().split())
A = [list(map(int,input().split())) for i in range(H)]
Q = int(input())
qs = [tuple(map(int,input().split())) for i in range(Q)]
places = [None] * (H*W+1)
for i in range(H):
for j in range(W):
places[A[i][j]] = (j,i)
costs = [[] for i in range(D)]
for i in range(H*W+1):
if i <= D:
costs[i%D].append(0)
else:
x1,y1 = places[i-D]
x2,y2 = places[i]
c = abs(x1-x2) + abs(y1-y2)
costs[i%D].append(costs[i%D][-1] + c)
ans = []
for l,r in qs:
m = l%D
a = costs[m][r//D] - costs[m][l//D]
ans.append(a)
print(*ans, sep='\n')
| 26 | 26 | 783 | 649 | H, W, D = list(map(int, input().split()))
src = [list(map(int, input().split())) for i in range(H)]
Q = int(eval(input()))
qs = [tuple(map(int, input().split())) for i in range(Q)]
pos = [[None for i in range(D)] for j in range(H * W // D + 1)]
for y in range(H):
for x in range(W):
a = src[y][x]
b, c = a // D, a % D
pos[b][c] = (x, y)
cums = [[0] for i in range(D)]
for i in range(D):
for j in range(H * W // D):
if pos[j][i] is None or pos[j + 1][i] is None:
cums[i].append(cums[i][-1])
else:
x1, y1 = pos[j][i]
x2, y2 = pos[j + 1][i]
dist = abs(x1 - x2) + abs(y1 - y2)
cums[i].append(cums[i][-1] + dist)
for l, r in qs:
d = l % D
print((cums[d][r // D] - cums[d][l // D]))
| H, W, D = map(int, input().split())
A = [list(map(int, input().split())) for i in range(H)]
Q = int(input())
qs = [tuple(map(int, input().split())) for i in range(Q)]
places = [None] * (H * W + 1)
for i in range(H):
for j in range(W):
places[A[i][j]] = (j, i)
costs = [[] for i in range(D)]
for i in range(H * W + 1):
if i <= D:
costs[i % D].append(0)
else:
x1, y1 = places[i - D]
x2, y2 = places[i]
c = abs(x1 - x2) + abs(y1 - y2)
costs[i % D].append(costs[i % D][-1] + c)
ans = []
for l, r in qs:
m = l % D
a = costs[m][r // D] - costs[m][l // D]
ans.append(a)
print(*ans, sep="\n")
| false | 0 | [
"-H, W, D = list(map(int, input().split()))",
"-src = [list(map(int, input().split())) for i in range(H)]",
"-Q = int(eval(input()))",
"+H, W, D = map(int, input().split())",
"+A = [list(map(int, input().split())) for i in range(H)]",
"+Q = int(input())",
"-pos = [[None for i in range(D)] for j in range(H * W // D + 1)]",
"-for y in range(H):",
"- for x in range(W):",
"- a = src[y][x]",
"- b, c = a // D, a % D",
"- pos[b][c] = (x, y)",
"-cums = [[0] for i in range(D)]",
"-for i in range(D):",
"- for j in range(H * W // D):",
"- if pos[j][i] is None or pos[j + 1][i] is None:",
"- cums[i].append(cums[i][-1])",
"- else:",
"- x1, y1 = pos[j][i]",
"- x2, y2 = pos[j + 1][i]",
"- dist = abs(x1 - x2) + abs(y1 - y2)",
"- cums[i].append(cums[i][-1] + dist)",
"+places = [None] * (H * W + 1)",
"+for i in range(H):",
"+ for j in range(W):",
"+ places[A[i][j]] = (j, i)",
"+costs = [[] for i in range(D)]",
"+for i in range(H * W + 1):",
"+ if i <= D:",
"+ costs[i % D].append(0)",
"+ else:",
"+ x1, y1 = places[i - D]",
"+ x2, y2 = places[i]",
"+ c = abs(x1 - x2) + abs(y1 - y2)",
"+ costs[i % D].append(costs[i % D][-1] + c)",
"+ans = []",
"- d = l % D",
"- print((cums[d][r // D] - cums[d][l // D]))",
"+ m = l % D",
"+ a = costs[m][r // D] - costs[m][l // D]",
"+ ans.append(a)",
"+print(*ans, sep=\"\\n\")"
] | false | 0.038228 | 0.045328 | 0.843356 | [
"s170300490",
"s468491444"
] |
u754022296 | p03043 | python | s525173439 | s328546332 | 96 | 44 | 3,188 | 9,108 | Accepted | Accepted | 54.17 | import math
n, k = list(map(int, input().split()))
count = 0
for i in range(1, n+1):
a = max(0, math.ceil(math.log2(k/i)))
count += 1 / (n * 2**a)
print(count) | n, k = list(map(int, input().split()))
ans = 0
for i in range(1, n+1):
cnt = 1
while i < k:
i *= 2
cnt /= 2
ans += cnt
ans /= n
print(ans) | 8 | 10 | 165 | 155 | import math
n, k = list(map(int, input().split()))
count = 0
for i in range(1, n + 1):
a = max(0, math.ceil(math.log2(k / i)))
count += 1 / (n * 2**a)
print(count)
| n, k = list(map(int, input().split()))
ans = 0
for i in range(1, n + 1):
cnt = 1
while i < k:
i *= 2
cnt /= 2
ans += cnt
ans /= n
print(ans)
| false | 20 | [
"-import math",
"-",
"-count = 0",
"+ans = 0",
"- a = max(0, math.ceil(math.log2(k / i)))",
"- count += 1 / (n * 2**a)",
"-print(count)",
"+ cnt = 1",
"+ while i < k:",
"+ i *= 2",
"+ cnt /= 2",
"+ ans += cnt",
"+ans /= n",
"+print(ans)"
] | false | 0.073929 | 0.045259 | 1.633454 | [
"s525173439",
"s328546332"
] |
u023958502 | p02900 | python | s641391760 | s121521965 | 333 | 113 | 5,176 | 5,048 | Accepted | Accepted | 66.07 | import fractions
a,b = list(map(int,input().split()))
longer = max(a,b)
lcm = fractions.gcd(a,b)
i = 1
ans = 1
while True:
i += 1
if i * i >= longer:
if lcm != 1:
ans += 1
break
elif lcm == 1:
break
if lcm % i == 0:
# print(i)
ans += 1
while lcm % i == 0:
lcm //= i
# print(lcm)
print(ans) | import fractions
a, b = list(map(int, input().split()))
gc = fractions.gcd(a, b)
def prime_factorize(n):
a = []
if n % 2 == 0:
a.append(2)
while n % 2 == 0:
n //= 2
f = 3
while f * f <= n:
if n % f == 0:
a.append(f)
while n % f == 0:
n //= f
else:
f += 2
if n != 1:
a.append(n)
return a
print((len(prime_factorize(gc)) + 1)) | 22 | 23 | 349 | 468 | import fractions
a, b = list(map(int, input().split()))
longer = max(a, b)
lcm = fractions.gcd(a, b)
i = 1
ans = 1
while True:
i += 1
if i * i >= longer:
if lcm != 1:
ans += 1
break
elif lcm == 1:
break
if lcm % i == 0:
# print(i)
ans += 1
while lcm % i == 0:
lcm //= i
# print(lcm)
print(ans)
| import fractions
a, b = list(map(int, input().split()))
gc = fractions.gcd(a, b)
def prime_factorize(n):
a = []
if n % 2 == 0:
a.append(2)
while n % 2 == 0:
n //= 2
f = 3
while f * f <= n:
if n % f == 0:
a.append(f)
while n % f == 0:
n //= f
else:
f += 2
if n != 1:
a.append(n)
return a
print((len(prime_factorize(gc)) + 1))
| false | 4.347826 | [
"-longer = max(a, b)",
"-lcm = fractions.gcd(a, b)",
"-i = 1",
"-ans = 1",
"-while True:",
"- i += 1",
"- if i * i >= longer:",
"- if lcm != 1:",
"- ans += 1",
"- break",
"- elif lcm == 1:",
"- break",
"- if lcm % i == 0:",
"- # print(i)",
"- ans += 1",
"- while lcm % i == 0:",
"- lcm //= i",
"-# print(lcm)",
"-print(ans)",
"+gc = fractions.gcd(a, b)",
"+",
"+",
"+def prime_factorize(n):",
"+ a = []",
"+ if n % 2 == 0:",
"+ a.append(2)",
"+ while n % 2 == 0:",
"+ n //= 2",
"+ f = 3",
"+ while f * f <= n:",
"+ if n % f == 0:",
"+ a.append(f)",
"+ while n % f == 0:",
"+ n //= f",
"+ else:",
"+ f += 2",
"+ if n != 1:",
"+ a.append(n)",
"+ return a",
"+",
"+",
"+print((len(prime_factorize(gc)) + 1))"
] | false | 0.048724 | 0.04748 | 1.026214 | [
"s641391760",
"s121521965"
] |
u297089927 | p02693 | python | s636542069 | s310364522 | 23 | 20 | 9,164 | 9,028 | Accepted | Accepted | 13.04 | k=int(eval(input()))
a,b=list(map(int,input().split()))
f=0
for i in range(1,1001):
if a<=i*k<=b:
f=1
print("OK")
break
if f==0:
print("NG")
| k=int(eval(input()))
a,b=list(map(int,input().split()))
f=0
for i in range(1,1001):
if a<=i*k<=b:
print("OK")
f=1
break
if f==0:
print("NG")
| 10 | 10 | 170 | 154 | k = int(eval(input()))
a, b = list(map(int, input().split()))
f = 0
for i in range(1, 1001):
if a <= i * k <= b:
f = 1
print("OK")
break
if f == 0:
print("NG")
| k = int(eval(input()))
a, b = list(map(int, input().split()))
f = 0
for i in range(1, 1001):
if a <= i * k <= b:
print("OK")
f = 1
break
if f == 0:
print("NG")
| false | 0 | [
"+ print(\"OK\")",
"- print(\"OK\")"
] | false | 0.092455 | 0.113633 | 0.813632 | [
"s636542069",
"s310364522"
] |
u278886389 | p02695 | python | s408660529 | s618981156 | 185 | 127 | 68,280 | 68,684 | Accepted | Accepted | 31.35 | from collections import deque
N,M,Q = list(map(int,input().split()))
QUERY = [0]*Q
for i in range(Q):
QUERY[i] = tuple(map(int,input().split()))
ans = 0
D = deque()
D.append((1,[1]))
dlen = 1
while dlen != 0:
Alen,A = D.pop()
dlen -= 1
if Alen == N:
e = 0
for a,b,c,d in QUERY:
a -= 1
b -= 1
if A[b] - A[a] == c:
e += d
ans = max(ans,e)
else:
for AA in range(A[-1],M+1):
D.append((Alen+1,A+[AA]))
dlen += 1
print(ans)
| from collections import deque
N,M,Q = list(map(int,input().split()))
QUERY = [0]*Q
for i in range(Q):
QUERY[i] = tuple(map(int,input().split()))
ans = 0
D = deque()
D.append(-1)
D.append(1)
dlen = 2
A = deque()
Alen = 0
while dlen != 0:
f = D.pop()
dlen -= 1
if f == -1:
A.pop()
Alen -= 1
continue
A.append(f)
Alen += 1
if Alen == N:
e = 0
for a,b,c,d in QUERY:
a -= 1
b -= 1
if A[b] - A[a] == c:
e += d
ans = max(ans,e)
else:
for AA in range(A[-1],M+1):
D.append(-1)
D.append(AA)
dlen += 2
print(ans)
| 28 | 38 | 570 | 712 | from collections import deque
N, M, Q = list(map(int, input().split()))
QUERY = [0] * Q
for i in range(Q):
QUERY[i] = tuple(map(int, input().split()))
ans = 0
D = deque()
D.append((1, [1]))
dlen = 1
while dlen != 0:
Alen, A = D.pop()
dlen -= 1
if Alen == N:
e = 0
for a, b, c, d in QUERY:
a -= 1
b -= 1
if A[b] - A[a] == c:
e += d
ans = max(ans, e)
else:
for AA in range(A[-1], M + 1):
D.append((Alen + 1, A + [AA]))
dlen += 1
print(ans)
| from collections import deque
N, M, Q = list(map(int, input().split()))
QUERY = [0] * Q
for i in range(Q):
QUERY[i] = tuple(map(int, input().split()))
ans = 0
D = deque()
D.append(-1)
D.append(1)
dlen = 2
A = deque()
Alen = 0
while dlen != 0:
f = D.pop()
dlen -= 1
if f == -1:
A.pop()
Alen -= 1
continue
A.append(f)
Alen += 1
if Alen == N:
e = 0
for a, b, c, d in QUERY:
a -= 1
b -= 1
if A[b] - A[a] == c:
e += d
ans = max(ans, e)
else:
for AA in range(A[-1], M + 1):
D.append(-1)
D.append(AA)
dlen += 2
print(ans)
| false | 26.315789 | [
"-D.append((1, [1]))",
"-dlen = 1",
"+D.append(-1)",
"+D.append(1)",
"+dlen = 2",
"+A = deque()",
"+Alen = 0",
"- Alen, A = D.pop()",
"+ f = D.pop()",
"+ if f == -1:",
"+ A.pop()",
"+ Alen -= 1",
"+ continue",
"+ A.append(f)",
"+ Alen += 1",
"- D.append((Alen + 1, A + [AA]))",
"- dlen += 1",
"+ D.append(-1)",
"+ D.append(AA)",
"+ dlen += 2"
] | false | 0.131049 | 0.171091 | 0.765957 | [
"s408660529",
"s618981156"
] |
u519452411 | p03289 | python | s058047832 | s564742315 | 24 | 19 | 3,188 | 3,188 | Accepted | Accepted | 20.83 | import re
s = eval(input())
if re.match(r'A[a-z]+C[a-z]+\Z',s) == None:
print("WA")
else:
print("AC") | import re
S = eval(input())
if S[0] != 'A':
print('WA')
exit()
if S[2:-1].count('C') != 1:
print('WA')
exit()
if re.match(r'A[a-z]+C[a-z]+\Z', S) == None:
print('WA')
exit()
print('AC')
| 9 | 17 | 110 | 213 | import re
s = eval(input())
if re.match(r"A[a-z]+C[a-z]+\Z", s) == None:
print("WA")
else:
print("AC")
| import re
S = eval(input())
if S[0] != "A":
print("WA")
exit()
if S[2:-1].count("C") != 1:
print("WA")
exit()
if re.match(r"A[a-z]+C[a-z]+\Z", S) == None:
print("WA")
exit()
print("AC")
| false | 47.058824 | [
"-s = eval(input())",
"-if re.match(r\"A[a-z]+C[a-z]+\\Z\", s) == None:",
"+S = eval(input())",
"+if S[0] != \"A\":",
"-else:",
"- print(\"AC\")",
"+ exit()",
"+if S[2:-1].count(\"C\") != 1:",
"+ print(\"WA\")",
"+ exit()",
"+if re.match(r\"A[a-z]+C[a-z]+\\Z\", S) == None:",
"+ print(\"WA\")",
"+ exit()",
"+print(\"AC\")"
] | false | 0.042293 | 0.041084 | 1.029443 | [
"s058047832",
"s564742315"
] |
u063596417 | p03597 | python | s818684017 | s112893549 | 27 | 24 | 9,148 | 9,084 | Accepted | Accepted | 11.11 | def main():
n = int(eval(input()))
a = int(eval(input()))
print((n * n - a))
if __name__ == '__main__':
main()
| n = int(eval(input()))
a = int(eval(input()))
print((n * n - a)) | 8 | 3 | 122 | 52 | def main():
n = int(eval(input()))
a = int(eval(input()))
print((n * n - a))
if __name__ == "__main__":
main()
| n = int(eval(input()))
a = int(eval(input()))
print((n * n - a))
| false | 62.5 | [
"-def main():",
"- n = int(eval(input()))",
"- a = int(eval(input()))",
"- print((n * n - a))",
"-",
"-",
"-if __name__ == \"__main__\":",
"- main()",
"+n = int(eval(input()))",
"+a = int(eval(input()))",
"+print((n * n - a))"
] | false | 0.068721 | 0.093926 | 0.73165 | [
"s818684017",
"s112893549"
] |
u796942881 | p03503 | python | s336403304 | s650114449 | 59 | 42 | 3,064 | 3,064 | Accepted | Accepted | 28.81 | MAX_TIME = 10
N = int(eval(input()))
F = [int(input().replace(" ", ""), 2) for i in range(N)]
P = [[int(j) for j in input().split()] for i in range(N)]
def main():
# 1 から 2 ** MAX_TIME - 1
# 営業時間帯 最低でも ひとつの時間帯
# 選択する時間帯を2進法で表現したもの
# F[店のインデックス]
# 他の店
# 選択する時間帯を2進法で表現したもの
# P[店のインデックス][合致した時間帯の数]
# 利益
print((max(sum(
[p[bin(f & i).count("1")] for f, p in zip(F, P)])
for i in range(1, 2 ** MAX_TIME))))
return
main()
| MAX_TIME = 10
N = int(eval(input()))
# F[店のインデックス]
# 他の店
# 選択する時間帯を2進法で表現したもの
F = [sum(v << MAX_TIME - k - 1 for k, v
in enumerate(map(int, input().split())))
for i in range(N)]
# P[店のインデックス][合致した時間帯の数]
# 利益
P = [[int(j) for j in input().split()] for i in range(N)]
def main():
# 予めビットをカウントしておく
pattern = [sum(i >> j & 1 for j in range(MAX_TIME))
for i in range(2 ** MAX_TIME)]
# 営業時間帯 すべて試す
# 最低でも ひとつの時間帯
print((max(sum(
P[j][pattern[F[j] & i]] for j in range(N))
for i in range(1, 2 ** MAX_TIME))))
return
main()
| 28 | 31 | 503 | 616 | MAX_TIME = 10
N = int(eval(input()))
F = [int(input().replace(" ", ""), 2) for i in range(N)]
P = [[int(j) for j in input().split()] for i in range(N)]
def main():
# 1 から 2 ** MAX_TIME - 1
# 営業時間帯 最低でも ひとつの時間帯
# 選択する時間帯を2進法で表現したもの
# F[店のインデックス]
# 他の店
# 選択する時間帯を2進法で表現したもの
# P[店のインデックス][合致した時間帯の数]
# 利益
print(
(
max(
sum([p[bin(f & i).count("1")] for f, p in zip(F, P)])
for i in range(1, 2**MAX_TIME)
)
)
)
return
main()
| MAX_TIME = 10
N = int(eval(input()))
# F[店のインデックス]
# 他の店
# 選択する時間帯を2進法で表現したもの
F = [
sum(v << MAX_TIME - k - 1 for k, v in enumerate(map(int, input().split())))
for i in range(N)
]
# P[店のインデックス][合致した時間帯の数]
# 利益
P = [[int(j) for j in input().split()] for i in range(N)]
def main():
# 予めビットをカウントしておく
pattern = [sum(i >> j & 1 for j in range(MAX_TIME)) for i in range(2**MAX_TIME)]
# 営業時間帯 すべて試す
# 最低でも ひとつの時間帯
print(
(
max(
sum(P[j][pattern[F[j] & i]] for j in range(N))
for i in range(1, 2**MAX_TIME)
)
)
)
return
main()
| false | 9.677419 | [
"-F = [int(input().replace(\" \", \"\"), 2) for i in range(N)]",
"+# F[店のインデックス]",
"+# 他の店",
"+# 選択する時間帯を2進法で表現したもの",
"+F = [",
"+ sum(v << MAX_TIME - k - 1 for k, v in enumerate(map(int, input().split())))",
"+ for i in range(N)",
"+]",
"+# P[店のインデックス][合致した時間帯の数]",
"+# 利益",
"- # 1 から 2 ** MAX_TIME - 1",
"- # 営業時間帯 最低でも ひとつの時間帯",
"- # 選択する時間帯を2進法で表現したもの",
"- # F[店のインデックス]",
"- # 他の店",
"- # 選択する時間帯を2進法で表現したもの",
"- # P[店のインデックス][合致した時間帯の数]",
"- # 利益",
"+ # 予めビットをカウントしておく",
"+ pattern = [sum(i >> j & 1 for j in range(MAX_TIME)) for i in range(2**MAX_TIME)]",
"+ # 営業時間帯 すべて試す",
"+ # 最低でも ひとつの時間帯",
"- sum([p[bin(f & i).count(\"1\")] for f, p in zip(F, P)])",
"+ sum(P[j][pattern[F[j] & i]] for j in range(N))"
] | false | 0.143269 | 0.115543 | 1.23997 | [
"s336403304",
"s650114449"
] |
u825685913 | p03965 | python | s994600896 | s208637232 | 48 | 30 | 9,204 | 9,104 | Accepted | Accepted | 37.5 | s = eval(input())
n = len(s)
gcount = 0
pcount = 0
score = 0
for i in range(n):
if s[i] == "g":
if gcount > pcount:
pcount += 1
score += 1
else:
gcount += 1
else:
if gcount > pcount:
pcount += 1
else:
gcount += 1
score -= 1
print(score) | import math
s = eval(input())
n = len(s)
print((math.floor(n/2) - s.count("p"))) | 19 | 4 | 360 | 75 | s = eval(input())
n = len(s)
gcount = 0
pcount = 0
score = 0
for i in range(n):
if s[i] == "g":
if gcount > pcount:
pcount += 1
score += 1
else:
gcount += 1
else:
if gcount > pcount:
pcount += 1
else:
gcount += 1
score -= 1
print(score)
| import math
s = eval(input())
n = len(s)
print((math.floor(n / 2) - s.count("p")))
| false | 78.947368 | [
"+import math",
"+",
"-gcount = 0",
"-pcount = 0",
"-score = 0",
"-for i in range(n):",
"- if s[i] == \"g\":",
"- if gcount > pcount:",
"- pcount += 1",
"- score += 1",
"- else:",
"- gcount += 1",
"- else:",
"- if gcount > pcount:",
"- pcount += 1",
"- else:",
"- gcount += 1",
"- score -= 1",
"-print(score)",
"+print((math.floor(n / 2) - s.count(\"p\")))"
] | false | 0.062402 | 0.092709 | 0.6731 | [
"s994600896",
"s208637232"
] |
u095021077 | p03456 | python | s742106595 | s842449239 | 29 | 23 | 9,172 | 9,340 | Accepted | Accepted | 20.69 | a, b=list(map(int, input().split()))
N=int(str(a)+str(b))
for i in range(1, 10000):
if N//i==i and N%i==0:
print('Yes')
exit()
print('No') | a, b=list(map(int, input().split()))
N=int(str(a)+str(b))
if pow(N, 1/2)%1==0:
print('Yes')
else:
print('No') | 7 | 6 | 148 | 112 | a, b = list(map(int, input().split()))
N = int(str(a) + str(b))
for i in range(1, 10000):
if N // i == i and N % i == 0:
print("Yes")
exit()
print("No")
| a, b = list(map(int, input().split()))
N = int(str(a) + str(b))
if pow(N, 1 / 2) % 1 == 0:
print("Yes")
else:
print("No")
| false | 14.285714 | [
"-for i in range(1, 10000):",
"- if N // i == i and N % i == 0:",
"- print(\"Yes\")",
"- exit()",
"-print(\"No\")",
"+if pow(N, 1 / 2) % 1 == 0:",
"+ print(\"Yes\")",
"+else:",
"+ print(\"No\")"
] | false | 0.087654 | 0.083128 | 1.054451 | [
"s742106595",
"s842449239"
] |
u576917603 | p03796 | python | s868854752 | s497244820 | 230 | 119 | 3,980 | 83,316 | Accepted | Accepted | 48.26 | n=int(eval(input()))
import math
print((math.factorial(n)%((10**9)+7))) | def training(n):
if n==1:
return 1
else:
x=training(n-1)*n
return x%mod
import sys
n=int(eval(input()))
sys.setrecursionlimit(10**9)
mod=10**9+7
print((training(n))) | 3 | 11 | 66 | 199 | n = int(eval(input()))
import math
print((math.factorial(n) % ((10**9) + 7)))
| def training(n):
if n == 1:
return 1
else:
x = training(n - 1) * n
return x % mod
import sys
n = int(eval(input()))
sys.setrecursionlimit(10**9)
mod = 10**9 + 7
print((training(n)))
| false | 72.727273 | [
"+def training(n):",
"+ if n == 1:",
"+ return 1",
"+ else:",
"+ x = training(n - 1) * n",
"+ return x % mod",
"+",
"+",
"+import sys",
"+",
"-import math",
"-",
"-print((math.factorial(n) % ((10**9) + 7)))",
"+sys.setrecursionlimit(10**9)",
"+mod = 10**9 + 7",
"+print((training(n)))"
] | false | 0.078857 | 0.110365 | 0.714513 | [
"s868854752",
"s497244820"
] |
u075012704 | p02720 | python | s513338598 | s300572695 | 1,424 | 1,237 | 11,064 | 11,036 | Accepted | Accepted | 13.13 | from itertools import product
K = int(eval(input()))
ans = []
for l in range(10):
for s in range(1, 10):
for pattern in product([0, 1, 2], repeat=l): # そのまま, １つ上, １つ下
X = [s]
for p in pattern:
if X[-1] == 0 and p == 2:
break
if X[-1] == 9 and p == 1:
break
if p == 0:
X.append(X[-1])
if p == 1:
X.append(X[-1] + 1)
if p == 2:
X.append(X[-1] - 1)
else:
ans.append(int(''.join(map(str, X))))
ans.sort()
print((ans[K - 1]))
| from itertools import product
K = int(eval(input()))
ans = []
for l in range(10):
for s in range(1, 10):
for pattern in product([-1, 0, 1], repeat=l):
X = [s]
for p in pattern:
if not (0 <= X[-1] + p <= 9):
break
X.append(X[-1] + p)
else:
ans.append(int(''.join(map(str, X))))
ans.sort()
print((ans[K - 1]))
| 27 | 17 | 689 | 434 | from itertools import product
K = int(eval(input()))
ans = []
for l in range(10):
for s in range(1, 10):
for pattern in product([0, 1, 2], repeat=l): # そのまま, １つ上, １つ下
X = [s]
for p in pattern:
if X[-1] == 0 and p == 2:
break
if X[-1] == 9 and p == 1:
break
if p == 0:
X.append(X[-1])
if p == 1:
X.append(X[-1] + 1)
if p == 2:
X.append(X[-1] - 1)
else:
ans.append(int("".join(map(str, X))))
ans.sort()
print((ans[K - 1]))
| from itertools import product
K = int(eval(input()))
ans = []
for l in range(10):
for s in range(1, 10):
for pattern in product([-1, 0, 1], repeat=l):
X = [s]
for p in pattern:
if not (0 <= X[-1] + p <= 9):
break
X.append(X[-1] + p)
else:
ans.append(int("".join(map(str, X))))
ans.sort()
print((ans[K - 1]))
| false | 37.037037 | [
"- for pattern in product([0, 1, 2], repeat=l): # そのまま, １つ上, １つ下",
"+ for pattern in product([-1, 0, 1], repeat=l):",
"- if X[-1] == 0 and p == 2:",
"+ if not (0 <= X[-1] + p <= 9):",
"- if X[-1] == 9 and p == 1:",
"- break",
"- if p == 0:",
"- X.append(X[-1])",
"- if p == 1:",
"- X.append(X[-1] + 1)",
"- if p == 2:",
"- X.append(X[-1] - 1)",
"+ X.append(X[-1] + p)"
] | false | 1.582185 | 1.272838 | 1.243037 | [
"s513338598",
"s300572695"
] |
u863397945 | p03075 | python | s122866971 | s280658462 | 29 | 24 | 9,160 | 9,156 | Accepted | Accepted | 17.24 | l = [int(eval(input())) for i in range(6)]
if l[4]-l[0]>l[5]:
print(":(")
else:
print("Yay!") | l = [int(eval(input())) for i in range(5)]
k = int(eval(input()))
if l[4] - l[0] > k:
print(":(")
else:
print("Yay!") | 6 | 6 | 101 | 118 | l = [int(eval(input())) for i in range(6)]
if l[4] - l[0] > l[5]:
print(":(")
else:
print("Yay!")
| l = [int(eval(input())) for i in range(5)]
k = int(eval(input()))
if l[4] - l[0] > k:
print(":(")
else:
print("Yay!")
| false | 0 | [
"-l = [int(eval(input())) for i in range(6)]",
"-if l[4] - l[0] > l[5]:",
"+l = [int(eval(input())) for i in range(5)]",
"+k = int(eval(input()))",
"+if l[4] - l[0] > k:"
] | false | 0.103176 | 0.036501 | 2.826642 | [
"s122866971",
"s280658462"
] |
u472065247 | p03732 | python | s104561672 | s813921084 | 107 | 83 | 10,932 | 3,632 | Accepted | Accepted | 22.43 | N, WW = list(map(int, input().split()))
l = [list(map(int, input().split())) for _ in range(N)]
W, V = list(zip(*l))
M = [{} for i in range(N + 1)]
def cal(i, w):
if w in M[i]:
return M[i][w]
if i == N:
v = 0
elif w < W[i]:
v = cal(i + 1, w)
else:
v = max(cal(i + 1, w), cal(i + 1, w - W[i]) + V[i])
M[i][w] = v
return v
print((cal(0, WW))) | N, W = list(map(int, input().split()))
d = {0:0}
for _ in range(N):
w, v = list(map(int, input().split()))
for dw, dv in list(d.copy().items()):
if dw + w <= W:
d[dw + w] = max(d.get(dw + w, 0), dv + v)
print((max(d.values()))) | 17 | 8 | 371 | 228 | N, WW = list(map(int, input().split()))
l = [list(map(int, input().split())) for _ in range(N)]
W, V = list(zip(*l))
M = [{} for i in range(N + 1)]
def cal(i, w):
if w in M[i]:
return M[i][w]
if i == N:
v = 0
elif w < W[i]:
v = cal(i + 1, w)
else:
v = max(cal(i + 1, w), cal(i + 1, w - W[i]) + V[i])
M[i][w] = v
return v
print((cal(0, WW)))
| N, W = list(map(int, input().split()))
d = {0: 0}
for _ in range(N):
w, v = list(map(int, input().split()))
for dw, dv in list(d.copy().items()):
if dw + w <= W:
d[dw + w] = max(d.get(dw + w, 0), dv + v)
print((max(d.values())))
| false | 52.941176 | [
"-N, WW = list(map(int, input().split()))",
"-l = [list(map(int, input().split())) for _ in range(N)]",
"-W, V = list(zip(*l))",
"-M = [{} for i in range(N + 1)]",
"-",
"-",
"-def cal(i, w):",
"- if w in M[i]:",
"- return M[i][w]",
"- if i == N:",
"- v = 0",
"- elif w < W[i]:",
"- v = cal(i + 1, w)",
"- else:",
"- v = max(cal(i + 1, w), cal(i + 1, w - W[i]) + V[i])",
"- M[i][w] = v",
"- return v",
"-",
"-",
"-print((cal(0, WW)))",
"+N, W = list(map(int, input().split()))",
"+d = {0: 0}",
"+for _ in range(N):",
"+ w, v = list(map(int, input().split()))",
"+ for dw, dv in list(d.copy().items()):",
"+ if dw + w <= W:",
"+ d[dw + w] = max(d.get(dw + w, 0), dv + v)",
"+print((max(d.values())))"
] | false | 0.045942 | 0.044083 | 1.042168 | [
"s104561672",
"s813921084"
] |
u252828980 | p02910 | python | s924030078 | s339058569 | 19 | 17 | 3,064 | 3,064 | Accepted | Accepted | 10.53 | s=list(eval(input()))
s_o = s[::2]
s_e = s[1::2]
od = ["R","U","D"]
ev = ["L","U","D"]
for i in range(len(s_o)):
if (s_o[i] not in od):
print("No")
exit()
for i in range(len(s_e)):
if (s_e[i] not in ev):
print("No")
exit()
print("Yes") | s = eval(input())
R = ["R","U","D"]
L = ["L","U","D"]
for i in range(len(s)):
if i%2 == 0:
if (s[i] in R):
flag = True
else:
flag = False
break
if i%2 == 1:
if (s[i] in L):
flag = True
else:
flag = False
break
if flag:
print("Yes")
else:
print("No") | 17 | 20 | 288 | 382 | s = list(eval(input()))
s_o = s[::2]
s_e = s[1::2]
od = ["R", "U", "D"]
ev = ["L", "U", "D"]
for i in range(len(s_o)):
if s_o[i] not in od:
print("No")
exit()
for i in range(len(s_e)):
if s_e[i] not in ev:
print("No")
exit()
print("Yes")
| s = eval(input())
R = ["R", "U", "D"]
L = ["L", "U", "D"]
for i in range(len(s)):
if i % 2 == 0:
if s[i] in R:
flag = True
else:
flag = False
break
if i % 2 == 1:
if s[i] in L:
flag = True
else:
flag = False
break
if flag:
print("Yes")
else:
print("No")
| false | 15 | [
"-s = list(eval(input()))",
"-s_o = s[::2]",
"-s_e = s[1::2]",
"-od = [\"R\", \"U\", \"D\"]",
"-ev = [\"L\", \"U\", \"D\"]",
"-for i in range(len(s_o)):",
"- if s_o[i] not in od:",
"- print(\"No\")",
"- exit()",
"-for i in range(len(s_e)):",
"- if s_e[i] not in ev:",
"- print(\"No\")",
"- exit()",
"-print(\"Yes\")",
"+s = eval(input())",
"+R = [\"R\", \"U\", \"D\"]",
"+L = [\"L\", \"U\", \"D\"]",
"+for i in range(len(s)):",
"+ if i % 2 == 0:",
"+ if s[i] in R:",
"+ flag = True",
"+ else:",
"+ flag = False",
"+ break",
"+ if i % 2 == 1:",
"+ if s[i] in L:",
"+ flag = True",
"+ else:",
"+ flag = False",
"+ break",
"+if flag:",
"+ print(\"Yes\")",
"+else:",
"+ print(\"No\")"
] | false | 0.043864 | 0.043228 | 1.014711 | [
"s924030078",
"s339058569"
] |
u496744988 | p03360 | python | s070152966 | s200372823 | 64 | 41 | 7,740 | 5,384 | Accepted | Accepted | 35.94 | from collections import Counter
from functools import reduce
import fractions
import math
import statistics
import sys
import time
sys.setrecursionlimit(10**7)
INF = 10 ** 18
MOD = 10 ** 9 + 7
def LI(): return [int(x) for x in sys.stdin.readline().split()] # LIST INT
def LF(): return [float(x) for x in sys.stdin.readline().split()] # LIST FLOAT
def LS(): return sys.stdin.readline().split() # LIST STRING
def MI(): return map(int, sys.stdin.readline().split()) # MAP INT
def II(): return int(sys.stdin.readline()) # INPUT INT
def IS(): return input() # INPUT STRING
def P(x): return print(x)
def C(x): return Counter(x)
def GCD_LIST(numbers): # greatest common divisor
return reduce(fractions.gcd, numbers)
def LCM_LIST(numbers): # least common multiple
return reduce(LCM, numbers)
def LCM(m, n):
return (m * n // fractions.gcd(m, n))
li = LI()
k = II()
ans = []
def calc(a, b, c, count):
if count == k:
val = a+b+c
ans.append(val)
count -= 1
return
count += 1
calc(a*2, b, c, count)
calc(a, b*2, c, count)
calc(a, b, c*2, count)
calc(li[0], li[1], li[2], 0)
print(max(ans))
# 変だな
| from collections import Counter
from functools import reduce
import fractions
import math
import statistics
import sys
import time
sys.setrecursionlimit(10**7)
INF = 10 ** 18
MOD = 10 ** 9 + 7
def LI(): return [int(x) for x in sys.stdin.readline().split()] # LIST INT
def LF(): return [float(x) for x in sys.stdin.readline().split()] # LIST FLOAT
def LS(): return sys.stdin.readline().split() # LIST STRING
def MI(): return map(int, sys.stdin.readline().split()) # MAP INT
def II(): return int(sys.stdin.readline()) # INPUT INT
def IS(): return input() # INPUT STRING
def P(x): return print(x)
def C(x): return Counter(x)
def GCD_LIST(numbers): # greatest common divisor
return reduce(fractions.gcd, numbers)
def LCM_LIST(numbers): # least common multiple
return reduce(LCM, numbers)
def LCM(m, n):
return (m * n // fractions.gcd(m, n))
li = LI()
k = II()
print(li[0] + li[1] + li[2] + max(li)*((2**k)-1))
| 47 | 29 | 1,208 | 956 | from collections import Counter
from functools import reduce
import fractions
import math
import statistics
import sys
import time
sys.setrecursionlimit(10**7)
INF = 10**18
MOD = 10**9 + 7
def LI():
return [int(x) for x in sys.stdin.readline().split()] # LIST INT
def LF():
return [float(x) for x in sys.stdin.readline().split()] # LIST FLOAT
def LS():
return sys.stdin.readline().split() # LIST STRING
def MI():
return map(int, sys.stdin.readline().split()) # MAP INT
def II():
return int(sys.stdin.readline()) # INPUT INT
def IS():
return input() # INPUT STRING
def P(x):
return print(x)
def C(x):
return Counter(x)
def GCD_LIST(numbers): # greatest common divisor
return reduce(fractions.gcd, numbers)
def LCM_LIST(numbers): # least common multiple
return reduce(LCM, numbers)
def LCM(m, n):
return m * n // fractions.gcd(m, n)
li = LI()
k = II()
ans = []
def calc(a, b, c, count):
if count == k:
val = a + b + c
ans.append(val)
count -= 1
return
count += 1
calc(a * 2, b, c, count)
calc(a, b * 2, c, count)
calc(a, b, c * 2, count)
calc(li[0], li[1], li[2], 0)
print(max(ans))
# 変だな
| from collections import Counter
from functools import reduce
import fractions
import math
import statistics
import sys
import time
sys.setrecursionlimit(10**7)
INF = 10**18
MOD = 10**9 + 7
def LI():
return [int(x) for x in sys.stdin.readline().split()] # LIST INT
def LF():
return [float(x) for x in sys.stdin.readline().split()] # LIST FLOAT
def LS():
return sys.stdin.readline().split() # LIST STRING
def MI():
return map(int, sys.stdin.readline().split()) # MAP INT
def II():
return int(sys.stdin.readline()) # INPUT INT
def IS():
return input() # INPUT STRING
def P(x):
return print(x)
def C(x):
return Counter(x)
def GCD_LIST(numbers): # greatest common divisor
return reduce(fractions.gcd, numbers)
def LCM_LIST(numbers): # least common multiple
return reduce(LCM, numbers)
def LCM(m, n):
return m * n // fractions.gcd(m, n)
li = LI()
k = II()
print(li[0] + li[1] + li[2] + max(li) * ((2**k) - 1))
| false | 38.297872 | [
"-ans = []",
"-",
"-",
"-def calc(a, b, c, count):",
"- if count == k:",
"- val = a + b + c",
"- ans.append(val)",
"- count -= 1",
"- return",
"- count += 1",
"- calc(a * 2, b, c, count)",
"- calc(a, b * 2, c, count)",
"- calc(a, b, c * 2, count)",
"-",
"-",
"-calc(li[0], li[1], li[2], 0)",
"-print(max(ans))",
"-# 変だな",
"+print(li[0] + li[1] + li[2] + max(li) * ((2**k) - 1))"
] | false | 0.121446 | 0.057497 | 2.112224 | [
"s070152966",
"s200372823"
] |
u501952592 | p03160 | python | s456826211 | s862656088 | 265 | 92 | 100,352 | 13,980 | Accepted | Accepted | 65.28 | import sys
sys.setrecursionlimit(10**7)
N = int(eval(input()))
h = list(map(int, input().split()))
cost = [0, abs(h[1]-h[0])]
def dp(i):
if i >= len(cost):
cost.append(min(dp(i-1)+abs(h[i]-h[i-1]), dp(i-2)+abs(h[i]-h[i-2])))
return cost[i]
print((dp(N-1))) | N = int(eval(input()))
h = list(map(int, input().split()))
def dp(n):
a, b = 0, abs(h[1]-h[0])
if n == 0:
return a
for i in range(2, n+1):
a, b = b, min(a+abs(h[i]-h[i-2]), b+abs(h[i]-h[i-1]))
return b
print((dp(N-1))) | 13 | 12 | 271 | 240 | import sys
sys.setrecursionlimit(10**7)
N = int(eval(input()))
h = list(map(int, input().split()))
cost = [0, abs(h[1] - h[0])]
def dp(i):
if i >= len(cost):
cost.append(
min(dp(i - 1) + abs(h[i] - h[i - 1]), dp(i - 2) + abs(h[i] - h[i - 2]))
)
return cost[i]
print((dp(N - 1)))
| N = int(eval(input()))
h = list(map(int, input().split()))
def dp(n):
a, b = 0, abs(h[1] - h[0])
if n == 0:
return a
for i in range(2, n + 1):
a, b = b, min(a + abs(h[i] - h[i - 2]), b + abs(h[i] - h[i - 1]))
return b
print((dp(N - 1)))
| false | 7.692308 | [
"-import sys",
"-",
"-sys.setrecursionlimit(10**7)",
"-cost = [0, abs(h[1] - h[0])]",
"-def dp(i):",
"- if i >= len(cost):",
"- cost.append(",
"- min(dp(i - 1) + abs(h[i] - h[i - 1]), dp(i - 2) + abs(h[i] - h[i - 2]))",
"- )",
"- return cost[i]",
"+def dp(n):",
"+ a, b = 0, abs(h[1] - h[0])",
"+ if n == 0:",
"+ return a",
"+ for i in range(2, n + 1):",
"+ a, b = b, min(a + abs(h[i] - h[i - 2]), b + abs(h[i] - h[i - 1]))",
"+ return b"
] | false | 0.044515 | 0.108605 | 0.409877 | [
"s456826211",
"s862656088"
] |
u501952592 | p03160 | python | s778103111 | s287115476 | 305 | 185 | 93,588 | 13,924 | Accepted | Accepted | 39.34 | import sys
sys.setrecursionlimit(1000000)
N = int(eval(input()))
h = list(map(int, input().split()))
memo = [10**10 for _ in range(N+1)]
def dp(i):
if i == 1:
return 0
elif i == 2:
memo[i] = abs(h[i-2]-h[i-1])
return memo[i]
elif memo[i] < 10**10:
return memo[i]
else:
memo[i] = min(
dp(i-1) + abs(h[i-2]-h[i-1]),
dp(i-2) + abs(h[i-3]-h[i-1]),
dp(i-2) + abs(h[i-3]-h[i-2]) + abs(h[i-2]-h[i-1])
)
return memo[i]
print((dp(N))) | N = int(eval(input()))
h = list(map(int, input().split()))
memo = [-1 for _ in range(N+1)]
def dp(i):
if i == 1:
return 0
elif i == 2:
memo[i] = abs(h[i-2]-h[i-1])
return memo[i]
elif memo[i] >= 0:
return memo[i]
else:
memo[i] = min(
dp(i-1) + abs(h[i-2]-h[i-1]),
dp(i-2) + abs(h[i-3]-h[i-1])
)
return memo[i]
for i in range(1, N):
dp(i)
print((dp(N))) | 25 | 24 | 553 | 471 | import sys
sys.setrecursionlimit(1000000)
N = int(eval(input()))
h = list(map(int, input().split()))
memo = [10**10 for _ in range(N + 1)]
def dp(i):
if i == 1:
return 0
elif i == 2:
memo[i] = abs(h[i - 2] - h[i - 1])
return memo[i]
elif memo[i] < 10**10:
return memo[i]
else:
memo[i] = min(
dp(i - 1) + abs(h[i - 2] - h[i - 1]),
dp(i - 2) + abs(h[i - 3] - h[i - 1]),
dp(i - 2) + abs(h[i - 3] - h[i - 2]) + abs(h[i - 2] - h[i - 1]),
)
return memo[i]
print((dp(N)))
| N = int(eval(input()))
h = list(map(int, input().split()))
memo = [-1 for _ in range(N + 1)]
def dp(i):
if i == 1:
return 0
elif i == 2:
memo[i] = abs(h[i - 2] - h[i - 1])
return memo[i]
elif memo[i] >= 0:
return memo[i]
else:
memo[i] = min(
dp(i - 1) + abs(h[i - 2] - h[i - 1]), dp(i - 2) + abs(h[i - 3] - h[i - 1])
)
return memo[i]
for i in range(1, N):
dp(i)
print((dp(N)))
| false | 4 | [
"-import sys",
"-",
"-sys.setrecursionlimit(1000000)",
"-memo = [10**10 for _ in range(N + 1)]",
"+memo = [-1 for _ in range(N + 1)]",
"- elif memo[i] < 10**10:",
"+ elif memo[i] >= 0:",
"- dp(i - 1) + abs(h[i - 2] - h[i - 1]),",
"- dp(i - 2) + abs(h[i - 3] - h[i - 1]),",
"- dp(i - 2) + abs(h[i - 3] - h[i - 2]) + abs(h[i - 2] - h[i - 1]),",
"+ dp(i - 1) + abs(h[i - 2] - h[i - 1]), dp(i - 2) + abs(h[i - 3] - h[i - 1])",
"+for i in range(1, N):",
"+ dp(i)"
] | false | 0.149215 | 0.065513 | 2.277625 | [
"s778103111",
"s287115476"
] |
u844895214 | p03680 | python | s038441684 | s365188553 | 135 | 98 | 23,740 | 14,036 | Accepted | Accepted | 27.41 | import sys
from collections import deque, Counter
def I(): return int(sys.stdin.readline().rstrip())
if __name__=='__main__':
n = I()
l = []
for _ in range(n):
l.append(I())
c = Counter()
now = 0
for i in range(1,n+1):
now = l[now]-1
c[now] += 1
if now==1:
print(i)
exit()
if c[now]==2:
print((-1))
exit()
exit() | import sys
from collections import deque, Counter
def I(): return int(sys.stdin.readline().rstrip())
if __name__=='__main__':
n = I()
l = []
for _ in range(n):
l.append(I())
c = [0]*n
now = 0
c[now] = 1
for i in range(1,n+1):
now = l[now]-1
c[now] += 1
if now==1:
print(i)
exit()
if c[now]==2:
print((-1))
exit()
exit() | 21 | 22 | 447 | 459 | import sys
from collections import deque, Counter
def I():
return int(sys.stdin.readline().rstrip())
if __name__ == "__main__":
n = I()
l = []
for _ in range(n):
l.append(I())
c = Counter()
now = 0
for i in range(1, n + 1):
now = l[now] - 1
c[now] += 1
if now == 1:
print(i)
exit()
if c[now] == 2:
print((-1))
exit()
exit()
| import sys
from collections import deque, Counter
def I():
return int(sys.stdin.readline().rstrip())
if __name__ == "__main__":
n = I()
l = []
for _ in range(n):
l.append(I())
c = [0] * n
now = 0
c[now] = 1
for i in range(1, n + 1):
now = l[now] - 1
c[now] += 1
if now == 1:
print(i)
exit()
if c[now] == 2:
print((-1))
exit()
exit()
| false | 4.545455 | [
"- c = Counter()",
"+ c = [0] * n",
"+ c[now] = 1"
] | false | 0.035348 | 0.04259 | 0.829972 | [
"s038441684",
"s365188553"
] |
u535659144 | p02689 | python | s907936633 | s470926393 | 600 | 216 | 151,340 | 91,200 | Accepted | Accepted | 64 | from collections import deque
n,m=[int(_) for _ in input().split()]
H=[int(_) for _ in input().split()]
Hlist=deque(deque() for a in range(n))
count=0
for a in range(m):
a,b=[int(_) for _ in input().split()]
Hlist[a-1].append(b-1)
Hlist[b-1].append(a-1)
for i,j in enumerate(Hlist):
flag=1
for a in j:
if H[a]>=H[i]:
flag=0
if flag==1:
count+=1
flag=1
print(count) | n,m=list(map(int,input().split()))
li = []
h=list(map(int,input().split()))
for i in range(m):
a,b=list(map(int,input().split()))
if h[a-1]<h[b-1]:
li.append(a)
elif h[a-1]==h[b-1]:
li.append(a)
li.append(b)
else:
li.append(b)
print((n-len(set(li))))
| 18 | 13 | 437 | 297 | from collections import deque
n, m = [int(_) for _ in input().split()]
H = [int(_) for _ in input().split()]
Hlist = deque(deque() for a in range(n))
count = 0
for a in range(m):
a, b = [int(_) for _ in input().split()]
Hlist[a - 1].append(b - 1)
Hlist[b - 1].append(a - 1)
for i, j in enumerate(Hlist):
flag = 1
for a in j:
if H[a] >= H[i]:
flag = 0
if flag == 1:
count += 1
flag = 1
print(count)
| n, m = list(map(int, input().split()))
li = []
h = list(map(int, input().split()))
for i in range(m):
a, b = list(map(int, input().split()))
if h[a - 1] < h[b - 1]:
li.append(a)
elif h[a - 1] == h[b - 1]:
li.append(a)
li.append(b)
else:
li.append(b)
print((n - len(set(li))))
| false | 27.777778 | [
"-from collections import deque",
"-",
"-n, m = [int(_) for _ in input().split()]",
"-H = [int(_) for _ in input().split()]",
"-Hlist = deque(deque() for a in range(n))",
"-count = 0",
"-for a in range(m):",
"- a, b = [int(_) for _ in input().split()]",
"- Hlist[a - 1].append(b - 1)",
"- Hlist[b - 1].append(a - 1)",
"-for i, j in enumerate(Hlist):",
"- flag = 1",
"- for a in j:",
"- if H[a] >= H[i]:",
"- flag = 0",
"- if flag == 1:",
"- count += 1",
"- flag = 1",
"-print(count)",
"+n, m = list(map(int, input().split()))",
"+li = []",
"+h = list(map(int, input().split()))",
"+for i in range(m):",
"+ a, b = list(map(int, input().split()))",
"+ if h[a - 1] < h[b - 1]:",
"+ li.append(a)",
"+ elif h[a - 1] == h[b - 1]:",
"+ li.append(a)",
"+ li.append(b)",
"+ else:",
"+ li.append(b)",
"+print((n - len(set(li))))"
] | false | 0.036836 | 0.035978 | 1.023841 | [
"s907936633",
"s470926393"
] |
u111365362 | p02762 | python | s896531560 | s724185475 | 1,243 | 1,094 | 88,992 | 89,632 | Accepted | Accepted | 11.99 | #01:55
#UnionFind最適化に向けた実験
n,m,k = list(map(int,input().split()))
cnt = [1 for _ in range(n)]
pre = [i for i in range(n)]
num = [1 for _ in range(n)]
for _ in range(m):
a,b = list(map(int,input().split()))
a -= 1
b -= 1
num[a] += 1
num[b] += 1
A = []
B = []
while a != pre[a]:
a = pre[a]
A.append(a)
while b != pre[b]:
b = pre[b]
B.append(b)
if a != b:
if cnt[a] >= cnt[b]:
pre[b] = a
for aa in A:
pre[aa] = a
for bb in B:
pre[bb] = a
cnt[a] += cnt[b]
cnt[b] = 0
else:
pre[a] = b
for aa in A:
pre[aa] = b
for bb in B:
pre[bb] = b
cnt[b] += cnt[a]
cnt[a] = 0
#print(pre)
#print(cnt)
root = []
ans = []
for i in range(n):
I = int(i)
while I != pre[I]:
I = pre[I]
root.append(I)
ans.append(cnt[I]-num[i])
#print(root)
#print(ans)
for _ in range(k):
a,b = list(map(int,input().split()))
a -= 1
b -= 1
if root[a] == root[b]:
ans[a] -= 1
ans[b] -= 1
print((' '.join(map(str,ans)))) | #02:08
#BFS
n,m,k = list(map(int,input().split()))
peer = [[] for _ in range(n)]
num = [1 for _ in range(n)]
for _ in range(m):
a,b = list(map(int,input().split()))
a -= 1
b -= 1
num[a] += 1
num[b] += 1
peer[a].append(b)
peer[b].append(a)
seen = [0 for _ in range(n)]
root = [i for i in range(n)]
cnt = [0 for _ in range(n)]
for i in range(n):
if seen[i] == 1:
continue
seen[i] = 1
now = [i]
tmp = 1
while now:
last = now
now = []
for x in last:
for y in peer[x]:
if seen[y] == 0:
seen[y] = 1
now.append(y)
root[y] = i
tmp += 1
cnt[i] = tmp
#print(root)
#print(cnt)
for i in range(n):
cnt[i] = cnt[root[i]]
#print(cnt)
for i in range(n):
cnt[i] -= num[i]
#print(cnt)
for _ in range(k):
a,b = list(map(int,input().split()))
a -= 1
b -= 1
if root[a] == root[b]:
cnt[a] -= 1
cnt[b] -= 1
print((' '.join(map(str,cnt)))) | 57 | 49 | 1,075 | 959 | # 01:55
# UnionFind最適化に向けた実験
n, m, k = list(map(int, input().split()))
cnt = [1 for _ in range(n)]
pre = [i for i in range(n)]
num = [1 for _ in range(n)]
for _ in range(m):
a, b = list(map(int, input().split()))
a -= 1
b -= 1
num[a] += 1
num[b] += 1
A = []
B = []
while a != pre[a]:
a = pre[a]
A.append(a)
while b != pre[b]:
b = pre[b]
B.append(b)
if a != b:
if cnt[a] >= cnt[b]:
pre[b] = a
for aa in A:
pre[aa] = a
for bb in B:
pre[bb] = a
cnt[a] += cnt[b]
cnt[b] = 0
else:
pre[a] = b
for aa in A:
pre[aa] = b
for bb in B:
pre[bb] = b
cnt[b] += cnt[a]
cnt[a] = 0
# print(pre)
# print(cnt)
root = []
ans = []
for i in range(n):
I = int(i)
while I != pre[I]:
I = pre[I]
root.append(I)
ans.append(cnt[I] - num[i])
# print(root)
# print(ans)
for _ in range(k):
a, b = list(map(int, input().split()))
a -= 1
b -= 1
if root[a] == root[b]:
ans[a] -= 1
ans[b] -= 1
print((" ".join(map(str, ans))))
| # 02:08
# BFS
n, m, k = list(map(int, input().split()))
peer = [[] for _ in range(n)]
num = [1 for _ in range(n)]
for _ in range(m):
a, b = list(map(int, input().split()))
a -= 1
b -= 1
num[a] += 1
num[b] += 1
peer[a].append(b)
peer[b].append(a)
seen = [0 for _ in range(n)]
root = [i for i in range(n)]
cnt = [0 for _ in range(n)]
for i in range(n):
if seen[i] == 1:
continue
seen[i] = 1
now = [i]
tmp = 1
while now:
last = now
now = []
for x in last:
for y in peer[x]:
if seen[y] == 0:
seen[y] = 1
now.append(y)
root[y] = i
tmp += 1
cnt[i] = tmp
# print(root)
# print(cnt)
for i in range(n):
cnt[i] = cnt[root[i]]
# print(cnt)
for i in range(n):
cnt[i] -= num[i]
# print(cnt)
for _ in range(k):
a, b = list(map(int, input().split()))
a -= 1
b -= 1
if root[a] == root[b]:
cnt[a] -= 1
cnt[b] -= 1
print((" ".join(map(str, cnt))))
| false | 14.035088 | [
"-# 01:55",
"-# UnionFind最適化に向けた実験",
"+# 02:08",
"+# BFS",
"-cnt = [1 for _ in range(n)]",
"-pre = [i for i in range(n)]",
"+peer = [[] for _ in range(n)]",
"- A = []",
"- B = []",
"- while a != pre[a]:",
"- a = pre[a]",
"- A.append(a)",
"- while b != pre[b]:",
"- b = pre[b]",
"- B.append(b)",
"- if a != b:",
"- if cnt[a] >= cnt[b]:",
"- pre[b] = a",
"- for aa in A:",
"- pre[aa] = a",
"- for bb in B:",
"- pre[bb] = a",
"- cnt[a] += cnt[b]",
"- cnt[b] = 0",
"- else:",
"- pre[a] = b",
"- for aa in A:",
"- pre[aa] = b",
"- for bb in B:",
"- pre[bb] = b",
"- cnt[b] += cnt[a]",
"- cnt[a] = 0",
"-# print(pre)",
"+ peer[a].append(b)",
"+ peer[b].append(a)",
"+seen = [0 for _ in range(n)]",
"+root = [i for i in range(n)]",
"+cnt = [0 for _ in range(n)]",
"+for i in range(n):",
"+ if seen[i] == 1:",
"+ continue",
"+ seen[i] = 1",
"+ now = [i]",
"+ tmp = 1",
"+ while now:",
"+ last = now",
"+ now = []",
"+ for x in last:",
"+ for y in peer[x]:",
"+ if seen[y] == 0:",
"+ seen[y] = 1",
"+ now.append(y)",
"+ root[y] = i",
"+ tmp += 1",
"+ cnt[i] = tmp",
"+# print(root)",
"-root = []",
"-ans = []",
"- I = int(i)",
"- while I != pre[I]:",
"- I = pre[I]",
"- root.append(I)",
"- ans.append(cnt[I] - num[i])",
"-# print(root)",
"-# print(ans)",
"+ cnt[i] = cnt[root[i]]",
"+# print(cnt)",
"+for i in range(n):",
"+ cnt[i] -= num[i]",
"+# print(cnt)",
"- ans[a] -= 1",
"- ans[b] -= 1",
"-print((\" \".join(map(str, ans))))",
"+ cnt[a] -= 1",
"+ cnt[b] -= 1",
"+print((\" \".join(map(str, cnt))))"
] | false | 0.045473 | 0.10697 | 0.4251 | [
"s896531560",
"s724185475"
] |
u291373585 | p03478 | python | s526780947 | s358352054 | 47 | 35 | 3,060 | 3,060 | Accepted | Accepted | 25.53 | length,mi,ma = list(map(int,input().split()))
summ = 0
for i in range(1,length + 1):
digits = len(str(i))
digits_summary = 0
for j in range(digits):
digits_summary += int(str(i)[j])
if mi<=digits_summary and digits_summary<=ma:
summ += i
else:
pass
print(summ) | length,mi,ma = list(map(int,input().split()))
summ = 0
for i in range(1,length + 1):
s = str(i)
arr = list(map(int,s))
su = sum(arr)
if(su <= ma and su >= mi):
summ += i
print(summ)
| 14 | 10 | 295 | 199 | length, mi, ma = list(map(int, input().split()))
summ = 0
for i in range(1, length + 1):
digits = len(str(i))
digits_summary = 0
for j in range(digits):
digits_summary += int(str(i)[j])
if mi <= digits_summary and digits_summary <= ma:
summ += i
else:
pass
print(summ)
| length, mi, ma = list(map(int, input().split()))
summ = 0
for i in range(1, length + 1):
s = str(i)
arr = list(map(int, s))
su = sum(arr)
if su <= ma and su >= mi:
summ += i
print(summ)
| false | 28.571429 | [
"- digits = len(str(i))",
"- digits_summary = 0",
"- for j in range(digits):",
"- digits_summary += int(str(i)[j])",
"- if mi <= digits_summary and digits_summary <= ma:",
"+ s = str(i)",
"+ arr = list(map(int, s))",
"+ su = sum(arr)",
"+ if su <= ma and su >= mi:",
"- else:",
"- pass"
] | false | 0.035907 | 0.041764 | 0.859778 | [
"s526780947",
"s358352054"
] |
u263830634 | p03854 | python | s885592990 | s608769574 | 460 | 52 | 28,676 | 4,084 | Accepted | Accepted | 88.7 | import numpy as np
import sys
sys.setrecursionlimit(10 **9)
S = str(eval(input()))
dp = [0] * (2 * len(S))
#再帰関数
def check(i): #i最初の文字
flag0 = False
flag1 = False
flag2 = False
flag3 = False
flag4 = False
flag5 = False
if dp[i+5] != 0 or dp[i+6] != 0 or dp[i+7] != 0:
return dp[i+5] or dp[i+6] or dp[i+7]
#S[i:]=残りが条件を満たす
if S[i:] == 'dream' or S[i:] == 'dreamer' or S[i:] == 'erase' or S[i:] == 'eraser':
return True
if S[i:i+7] == 'dreamer': #dreamerを使った時に、条件を満たすかを再帰で計算
dp[i+7] = check(i+7)
flag2 = dp[i+7]
if S[i:i+5] == 'dream':
dp[i+5] = check(i+5)
flag3 = dp[i+5]
if S[i:i+6] == 'eraser':
dp[i+6] = check(i+6)
flag4 = dp[i+6]
if S[i:i+5] == 'erase':
dp[i+5] = check(i+5)
flag5 = dp[i+5]
return flag0 or flag1 or flag2 or flag3 or flag4 or flag5 #どれかがTrueならOK
if check(0):
print ('YES')
else:
print ('NO') | import sys
# input = sys.stdin.readline
sys.setrecursionlimit(10 ** 9)
MOD = 10 ** 9 + 7
S = list(eval(input()))
i = len(S) - 1
T = ['dream', 'dreamer', 'erase', 'eraser']
while i > 0:
if S[i] == 'm':
for j in range(5):
if S[i - j] == T[0][4 - j]:
continue
else:
print ('NO')
exit()
i -= 5
elif S[i] == 'r':
if S[i - 2] == 'm':
for j in range(7):
if S[i - j] == T[1][6 - j]:
continue
else:
print ('NO')
exit()
i -= 7
else:
for j in range(6):
if S[i - j] == T[3][5 - j]:
continue
else:
print ('NO')
exit()
i -= 6
else:
for j in range(5):
if S[i - j] == T[2][4 - j]:
continue
else:
print ('NO')
exit()
i -= 5
if i == -1:
print ('YES')
else:
print ('NO') | 39 | 49 | 996 | 1,141 | import numpy as np
import sys
sys.setrecursionlimit(10**9)
S = str(eval(input()))
dp = [0] * (2 * len(S))
# 再帰関数
def check(i): # i最初の文字
flag0 = False
flag1 = False
flag2 = False
flag3 = False
flag4 = False
flag5 = False
if dp[i + 5] != 0 or dp[i + 6] != 0 or dp[i + 7] != 0:
return dp[i + 5] or dp[i + 6] or dp[i + 7]
# S[i:]=残りが条件を満たす
if S[i:] == "dream" or S[i:] == "dreamer" or S[i:] == "erase" or S[i:] == "eraser":
return True
if S[i : i + 7] == "dreamer": # dreamerを使った時に、条件を満たすかを再帰で計算
dp[i + 7] = check(i + 7)
flag2 = dp[i + 7]
if S[i : i + 5] == "dream":
dp[i + 5] = check(i + 5)
flag3 = dp[i + 5]
if S[i : i + 6] == "eraser":
dp[i + 6] = check(i + 6)
flag4 = dp[i + 6]
if S[i : i + 5] == "erase":
dp[i + 5] = check(i + 5)
flag5 = dp[i + 5]
return flag0 or flag1 or flag2 or flag3 or flag4 or flag5 # どれかがTrueならOK
if check(0):
print("YES")
else:
print("NO")
| import sys
# input = sys.stdin.readline
sys.setrecursionlimit(10**9)
MOD = 10**9 + 7
S = list(eval(input()))
i = len(S) - 1
T = ["dream", "dreamer", "erase", "eraser"]
while i > 0:
if S[i] == "m":
for j in range(5):
if S[i - j] == T[0][4 - j]:
continue
else:
print("NO")
exit()
i -= 5
elif S[i] == "r":
if S[i - 2] == "m":
for j in range(7):
if S[i - j] == T[1][6 - j]:
continue
else:
print("NO")
exit()
i -= 7
else:
for j in range(6):
if S[i - j] == T[3][5 - j]:
continue
else:
print("NO")
exit()
i -= 6
else:
for j in range(5):
if S[i - j] == T[2][4 - j]:
continue
else:
print("NO")
exit()
i -= 5
if i == -1:
print("YES")
else:
print("NO")
| false | 20.408163 | [
"-import numpy as np",
"+# input = sys.stdin.readline",
"-S = str(eval(input()))",
"-dp = [0] * (2 * len(S))",
"-# 再帰関数",
"-def check(i): # i最初の文字",
"- flag0 = False",
"- flag1 = False",
"- flag2 = False",
"- flag3 = False",
"- flag4 = False",
"- flag5 = False",
"- if dp[i + 5] != 0 or dp[i + 6] != 0 or dp[i + 7] != 0:",
"- return dp[i + 5] or dp[i + 6] or dp[i + 7]",
"- # S[i:]=残りが条件を満たす",
"- if S[i:] == \"dream\" or S[i:] == \"dreamer\" or S[i:] == \"erase\" or S[i:] == \"eraser\":",
"- return True",
"- if S[i : i + 7] == \"dreamer\": # dreamerを使った時に、条件を満たすかを再帰で計算",
"- dp[i + 7] = check(i + 7)",
"- flag2 = dp[i + 7]",
"- if S[i : i + 5] == \"dream\":",
"- dp[i + 5] = check(i + 5)",
"- flag3 = dp[i + 5]",
"- if S[i : i + 6] == \"eraser\":",
"- dp[i + 6] = check(i + 6)",
"- flag4 = dp[i + 6]",
"- if S[i : i + 5] == \"erase\":",
"- dp[i + 5] = check(i + 5)",
"- flag5 = dp[i + 5]",
"- return flag0 or flag1 or flag2 or flag3 or flag4 or flag5 # どれかがTrueならOK",
"-",
"-",
"-if check(0):",
"+MOD = 10**9 + 7",
"+S = list(eval(input()))",
"+i = len(S) - 1",
"+T = [\"dream\", \"dreamer\", \"erase\", \"eraser\"]",
"+while i > 0:",
"+ if S[i] == \"m\":",
"+ for j in range(5):",
"+ if S[i - j] == T[0][4 - j]:",
"+ continue",
"+ else:",
"+ print(\"NO\")",
"+ exit()",
"+ i -= 5",
"+ elif S[i] == \"r\":",
"+ if S[i - 2] == \"m\":",
"+ for j in range(7):",
"+ if S[i - j] == T[1][6 - j]:",
"+ continue",
"+ else:",
"+ print(\"NO\")",
"+ exit()",
"+ i -= 7",
"+ else:",
"+ for j in range(6):",
"+ if S[i - j] == T[3][5 - j]:",
"+ continue",
"+ else:",
"+ print(\"NO\")",
"+ exit()",
"+ i -= 6",
"+ else:",
"+ for j in range(5):",
"+ if S[i - j] == T[2][4 - j]:",
"+ continue",
"+ else:",
"+ print(\"NO\")",
"+ exit()",
"+ i -= 5",
"+if i == -1:"
] | false | 0.114597 | 0.059391 | 1.929531 | [
"s885592990",
"s608769574"
] |
u864197622 | p02690 | python | s715582882 | s211972190 | 22 | 20 | 9,204 | 9,216 | Accepted | Accepted | 9.09 | def f(n):
l, r = 0, 1 << 10
while r - l > 1:
m = (l + r) // 2
if m ** 5 <= n:
l = m
else:
r = m
return l if l ** 5 == n else 0
X = int(eval(input()))
for i in range(1 << 10):
a = f(X + i ** 5)
if a:
print((a, i))
break
a = f(X - i ** 5)
if a:
print((a, -i))
break | def calc(n):
x = 1 << (n.bit_length() + 4) // 5
y = (4 * x + n // (x ** 4)) // 5
while y < x:
x = y
y = (4 * x + n // (x ** 4)) // 5
return x
def f(n):
return calc(n) if n > 0 and calc(n) ** 5 == n else 0
X = int(eval(input()))
for i in range(1 << 10):
a = f(X + i ** 5)
if a:
print((a, i))
break
a = f(X - i ** 5)
if a:
print((a, -i))
break | 20 | 20 | 381 | 435 | def f(n):
l, r = 0, 1 << 10
while r - l > 1:
m = (l + r) // 2
if m**5 <= n:
l = m
else:
r = m
return l if l**5 == n else 0
X = int(eval(input()))
for i in range(1 << 10):
a = f(X + i**5)
if a:
print((a, i))
break
a = f(X - i**5)
if a:
print((a, -i))
break
| def calc(n):
x = 1 << (n.bit_length() + 4) // 5
y = (4 * x + n // (x**4)) // 5
while y < x:
x = y
y = (4 * x + n // (x**4)) // 5
return x
def f(n):
return calc(n) if n > 0 and calc(n) ** 5 == n else 0
X = int(eval(input()))
for i in range(1 << 10):
a = f(X + i**5)
if a:
print((a, i))
break
a = f(X - i**5)
if a:
print((a, -i))
break
| false | 0 | [
"+def calc(n):",
"+ x = 1 << (n.bit_length() + 4) // 5",
"+ y = (4 * x + n // (x**4)) // 5",
"+ while y < x:",
"+ x = y",
"+ y = (4 * x + n // (x**4)) // 5",
"+ return x",
"+",
"+",
"- l, r = 0, 1 << 10",
"- while r - l > 1:",
"- m = (l + r) // 2",
"- if m**5 <= n:",
"- l = m",
"- else:",
"- r = m",
"- return l if l**5 == n else 0",
"+ return calc(n) if n > 0 and calc(n) ** 5 == n else 0"
] | false | 0.0499 | 0.049712 | 1.003777 | [
"s715582882",
"s211972190"
] |
u111365362 | p02880 | python | s061512208 | s117108570 | 33 | 17 | 3,060 | 2,940 | Accepted | Accepted | 48.48 | n = int(eval(input()))
s = set()
for i in range(1,10):
for j in range(1,10):
s.add(i*j)
if n in s:
print('Yes')
else:
print('No') | n = int(eval(input()))
for i in range(1,10):
if n % i == 0 and 0 < n // i < 10:
print('Yes')
break
else:
print('No') | 9 | 7 | 141 | 128 | n = int(eval(input()))
s = set()
for i in range(1, 10):
for j in range(1, 10):
s.add(i * j)
if n in s:
print("Yes")
else:
print("No")
| n = int(eval(input()))
for i in range(1, 10):
if n % i == 0 and 0 < n // i < 10:
print("Yes")
break
else:
print("No")
| false | 22.222222 | [
"-s = set()",
"- for j in range(1, 10):",
"- s.add(i * j)",
"-if n in s:",
"- print(\"Yes\")",
"+ if n % i == 0 and 0 < n // i < 10:",
"+ print(\"Yes\")",
"+ break"
] | false | 0.073616 | 0.080866 | 0.910348 | [
"s061512208",
"s117108570"
] |
u706217959 | p02399 | python | s769338645 | s432638679 | 30 | 20 | 5,608 | 5,616 | Accepted | Accepted | 33.33 | def main():
data = []
n = input().split()
a = int(n[0])
b = int(n[1])
divans = a / b
intdiv = int(divans)
divr = a % b
print(("{0} {1} %.5f".format(intdiv,divr) % divans))
if __name__ == '__main__':
main() | def main():
data = []
n = input().split()
a = int(n[0])
b = int(n[1])
divans = a / b
intdiv = int(divans)
divr = a % b
print(("{0} {1} {2:.5f}".format(intdiv, divr, divans)))
if __name__ == "__main__":
main() | 14 | 14 | 255 | 262 | def main():
data = []
n = input().split()
a = int(n[0])
b = int(n[1])
divans = a / b
intdiv = int(divans)
divr = a % b
print(("{0} {1} %.5f".format(intdiv, divr) % divans))
if __name__ == "__main__":
main()
| def main():
data = []
n = input().split()
a = int(n[0])
b = int(n[1])
divans = a / b
intdiv = int(divans)
divr = a % b
print(("{0} {1} {2:.5f}".format(intdiv, divr, divans)))
if __name__ == "__main__":
main()
| false | 0 | [
"- print((\"{0} {1} %.5f\".format(intdiv, divr) % divans))",
"+ print((\"{0} {1} {2:.5f}\".format(intdiv, divr, divans)))"
] | false | 0.074865 | 0.04233 | 1.768604 | [
"s769338645",
"s432638679"
] |
u525366883 | p02257 | python | s506435827 | s228496431 | 1,180 | 350 | 4,864 | 5,668 | Accepted | Accepted | 70.34 | import math
n = int(input())
cnt = 0
for i in range(n):
j = 2
num = int(input())
while j <= math.sqrt(num):
if num % j == 0:
break
j+=1
if j > math.sqrt(num):
cnt+=1
print(cnt)
| import math
n = int(eval(input()))
cnt = 0
for i in range(n):
num = int(eval(input()))
flag = 1
if num == 2:
flag = 1
elif num % 2 == 0 or num < 2:
flag = 0
else:
for j in range(3, int(math.sqrt(num))+1, 2):
if num % j == 0:
flag = 0
break
if flag:
cnt+=1
print(cnt)
| 13 | 19 | 248 | 374 | import math
n = int(input())
cnt = 0
for i in range(n):
j = 2
num = int(input())
while j <= math.sqrt(num):
if num % j == 0:
break
j += 1
if j > math.sqrt(num):
cnt += 1
print(cnt)
| import math
n = int(eval(input()))
cnt = 0
for i in range(n):
num = int(eval(input()))
flag = 1
if num == 2:
flag = 1
elif num % 2 == 0 or num < 2:
flag = 0
else:
for j in range(3, int(math.sqrt(num)) + 1, 2):
if num % j == 0:
flag = 0
break
if flag:
cnt += 1
print(cnt)
| false | 31.578947 | [
"-n = int(input())",
"+n = int(eval(input()))",
"- j = 2",
"- num = int(input())",
"- while j <= math.sqrt(num):",
"- if num % j == 0:",
"- break",
"- j += 1",
"- if j > math.sqrt(num):",
"+ num = int(eval(input()))",
"+ flag = 1",
"+ if num == 2:",
"+ flag = 1",
"+ elif num % 2 == 0 or num < 2:",
"+ flag = 0",
"+ else:",
"+ for j in range(3, int(math.sqrt(num)) + 1, 2):",
"+ if num % j == 0:",
"+ flag = 0",
"+ break",
"+ if flag:"
] | false | 0.088671 | 0.126979 | 0.698313 | [
"s506435827",
"s228496431"
] |
u678167152 | p03626 | python | s040384144 | s109446131 | 185 | 18 | 38,384 | 3,064 | Accepted | Accepted | 90.27 | N = int(eval(input()))
S1 = eval(input())
S2 = eval(input())
lis = []
i = 0
while i < N:
if i == N-1:
lis.append(1)
i += 1
elif S1[i] == S1[i+1]:
lis.append(2)
i += 2
else:
lis.append(1)
i += 1
#print(lis)
ans = 3
if lis[0]==2:
ans = 6
for i in range(len(lis)-1):
if lis[i]==2:
if lis[i+1]==2:
ans *= 3
else:
ans *= 2
ans %= 10**9+7
print(ans)
#print(*ans, sep='\n')
| def solve():
mod = 10**9+7
N = int(eval(input()))
s1 = eval(input())
s2 = eval(input())
lis = []
i=0
while i<N-1:
if s1[i]==s1[i+1]:
lis.append(2)
i += 2
else:
lis.append(1)
i += 1
if i==N-1:
lis.append(1)
if N==1:
lis = [1]
if lis[0]==1:
ans = 3
else:
ans = 6
for i in range(len(lis)-1):
if lis[i]==1:
ans *= 2
ans %= mod
if lis[i]==2 and lis[i+1]==2:
ans *=3
ans %= mod
return ans
print((solve())) | 30 | 31 | 432 | 621 | N = int(eval(input()))
S1 = eval(input())
S2 = eval(input())
lis = []
i = 0
while i < N:
if i == N - 1:
lis.append(1)
i += 1
elif S1[i] == S1[i + 1]:
lis.append(2)
i += 2
else:
lis.append(1)
i += 1
# print(lis)
ans = 3
if lis[0] == 2:
ans = 6
for i in range(len(lis) - 1):
if lis[i] == 2:
if lis[i + 1] == 2:
ans *= 3
else:
ans *= 2
ans %= 10**9 + 7
print(ans)
# print(*ans, sep='\n')
| def solve():
mod = 10**9 + 7
N = int(eval(input()))
s1 = eval(input())
s2 = eval(input())
lis = []
i = 0
while i < N - 1:
if s1[i] == s1[i + 1]:
lis.append(2)
i += 2
else:
lis.append(1)
i += 1
if i == N - 1:
lis.append(1)
if N == 1:
lis = [1]
if lis[0] == 1:
ans = 3
else:
ans = 6
for i in range(len(lis) - 1):
if lis[i] == 1:
ans *= 2
ans %= mod
if lis[i] == 2 and lis[i + 1] == 2:
ans *= 3
ans %= mod
return ans
print((solve()))
| false | 3.225806 | [
"-N = int(eval(input()))",
"-S1 = eval(input())",
"-S2 = eval(input())",
"-lis = []",
"-i = 0",
"-while i < N:",
"+def solve():",
"+ mod = 10**9 + 7",
"+ N = int(eval(input()))",
"+ s1 = eval(input())",
"+ s2 = eval(input())",
"+ lis = []",
"+ i = 0",
"+ while i < N - 1:",
"+ if s1[i] == s1[i + 1]:",
"+ lis.append(2)",
"+ i += 2",
"+ else:",
"+ lis.append(1)",
"+ i += 1",
"- i += 1",
"- elif S1[i] == S1[i + 1]:",
"- lis.append(2)",
"- i += 2",
"+ if N == 1:",
"+ lis = [1]",
"+ if lis[0] == 1:",
"+ ans = 3",
"- lis.append(1)",
"- i += 1",
"-# print(lis)",
"-ans = 3",
"-if lis[0] == 2:",
"- ans = 6",
"-for i in range(len(lis) - 1):",
"- if lis[i] == 2:",
"- if lis[i + 1] == 2:",
"+ ans = 6",
"+ for i in range(len(lis) - 1):",
"+ if lis[i] == 1:",
"+ ans *= 2",
"+ ans %= mod",
"+ if lis[i] == 2 and lis[i + 1] == 2:",
"- else:",
"- ans *= 2",
"- ans %= 10**9 + 7",
"-print(ans)",
"-# print(*ans, sep='\\n')",
"+ ans %= mod",
"+ return ans",
"+",
"+",
"+print((solve()))"
] | false | 0.076764 | 0.037015 | 2.07384 | [
"s040384144",
"s109446131"
] |
u049708565 | p02540 | python | s778373101 | s892001199 | 545 | 350 | 26,380 | 78,728 | Accepted | Accepted | 35.78 | n=int(eval(input()))
n+=1
p=[0]*n
a=[0]*n
an=[0]*n
for i in range(1, n):
p[i],a[p[i]]=list(map(int,input().split()))
mi=n+1
cu=0
for i in range(1,n):
if mi>a[i]:
mi=a[i]
if n-i==mi:
cn=i-cu
while cu<i:
cu+=1
an[cu]=cn
for i in range(1,n):
print((an[p[i]])) | n=int(eval(input()))
n+=1
p=[0]*n
a=[0]*n
b=[0]*n
for i in range(1, n):
p[i],a[p[i]]=list(map(int,input().split()))
m=n+1
c=0
for i in range(1,n):
m=min(m,a[i])
if n-i==m:
d=i-c
while c<i:
c+=1
b[c]=d
for i in range(1,n):
print((b[p[i]])) | 19 | 18 | 324 | 297 | n = int(eval(input()))
n += 1
p = [0] * n
a = [0] * n
an = [0] * n
for i in range(1, n):
p[i], a[p[i]] = list(map(int, input().split()))
mi = n + 1
cu = 0
for i in range(1, n):
if mi > a[i]:
mi = a[i]
if n - i == mi:
cn = i - cu
while cu < i:
cu += 1
an[cu] = cn
for i in range(1, n):
print((an[p[i]]))
| n = int(eval(input()))
n += 1
p = [0] * n
a = [0] * n
b = [0] * n
for i in range(1, n):
p[i], a[p[i]] = list(map(int, input().split()))
m = n + 1
c = 0
for i in range(1, n):
m = min(m, a[i])
if n - i == m:
d = i - c
while c < i:
c += 1
b[c] = d
for i in range(1, n):
print((b[p[i]]))
| false | 5.263158 | [
"-an = [0] * n",
"+b = [0] * n",
"-mi = n + 1",
"-cu = 0",
"+m = n + 1",
"+c = 0",
"- if mi > a[i]:",
"- mi = a[i]",
"- if n - i == mi:",
"- cn = i - cu",
"- while cu < i:",
"- cu += 1",
"- an[cu] = cn",
"+ m = min(m, a[i])",
"+ if n - i == m:",
"+ d = i - c",
"+ while c < i:",
"+ c += 1",
"+ b[c] = d",
"- print((an[p[i]]))",
"+ print((b[p[i]]))"
] | false | 0.043217 | 0.078952 | 0.54738 | [
"s778373101",
"s892001199"
] |
u261103969 | p02628 | python | s599957324 | s220362883 | 83 | 28 | 62,288 | 9,072 | Accepted | Accepted | 66.27 | import sys
readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)
def main():
n, k = list(map(int, readline().split()))
a = list(map(int, readline().split()))
a.sort()
print((sum(a[:k])))
if __name__ == '__main__':
main()
| n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
a.sort()
ans = sum(a[:k])
print(ans) | 18 | 6 | 300 | 111 | import sys
readline = sys.stdin.readline
MOD = 10**9 + 7
INF = float("INF")
sys.setrecursionlimit(10**5)
def main():
n, k = list(map(int, readline().split()))
a = list(map(int, readline().split()))
a.sort()
print((sum(a[:k])))
if __name__ == "__main__":
main()
| n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
a.sort()
ans = sum(a[:k])
print(ans)
| false | 66.666667 | [
"-import sys",
"-",
"-readline = sys.stdin.readline",
"-MOD = 10**9 + 7",
"-INF = float(\"INF\")",
"-sys.setrecursionlimit(10**5)",
"-",
"-",
"-def main():",
"- n, k = list(map(int, readline().split()))",
"- a = list(map(int, readline().split()))",
"- a.sort()",
"- print((sum(a[:k])))",
"-",
"-",
"-if __name__ == \"__main__\":",
"- main()",
"+n, k = list(map(int, input().split()))",
"+a = list(map(int, input().split()))",
"+a.sort()",
"+ans = sum(a[:k])",
"+print(ans)"
] | false | 0.044644 | 0.043872 | 1.017612 | [
"s599957324",
"s220362883"
] |
u560867850 | p02837 | python | s053508492 | s354153391 | 73 | 58 | 3,064 | 3,064 | Accepted | Accepted | 20.55 | import sys
input = sys.stdin.readline
from operator import eq, ne
def readlines(n):
for _ in range(n):
x, y = input().split()
yield int(x)-1, y
def main():
n = int(eval(input()))
graph = []
for _ in range(n):
a = int(eval(input()))
graph.append(list(readlines(a)))
def check(bits):
for pre_honest, asserts in zip(bits, graph):
if pre_honest == "0":
continue
for x, y in asserts:
if bits[x] != y:
return -1
return len([b for b in bits if b == "1"])
for i in range(2**n-1, -1, -1):
bit = format(i, "0{}b".format(n))
ans = check(bit)
if ans > -1:
print(ans)
return
print((0))
main()
| import sys
input = sys.stdin.readline
from itertools import combinations
from operator import contains
def readlines(n):
for _ in range(n):
x, y = input().split()
yield int(x)-1, y=="1"
def main():
n = int(eval(input()))
asserts = []
for _ in range(n):
a = int(eval(input()))
asserts.append(list(readlines(a)))
def check(comb):
for i in comb:
for x, y in asserts[i]:
mujun = contains if not y else lambda a, b: b not in a
if mujun(comb, x):
return -1
return len(comb)
for i in range(n+1):
for comb in combinations(list(range(n)), i):
yield check(set(comb))
yield 0
print((max(main()))) | 37 | 34 | 822 | 774 | import sys
input = sys.stdin.readline
from operator import eq, ne
def readlines(n):
for _ in range(n):
x, y = input().split()
yield int(x) - 1, y
def main():
n = int(eval(input()))
graph = []
for _ in range(n):
a = int(eval(input()))
graph.append(list(readlines(a)))
def check(bits):
for pre_honest, asserts in zip(bits, graph):
if pre_honest == "0":
continue
for x, y in asserts:
if bits[x] != y:
return -1
return len([b for b in bits if b == "1"])
for i in range(2**n - 1, -1, -1):
bit = format(i, "0{}b".format(n))
ans = check(bit)
if ans > -1:
print(ans)
return
print((0))
main()
| import sys
input = sys.stdin.readline
from itertools import combinations
from operator import contains
def readlines(n):
for _ in range(n):
x, y = input().split()
yield int(x) - 1, y == "1"
def main():
n = int(eval(input()))
asserts = []
for _ in range(n):
a = int(eval(input()))
asserts.append(list(readlines(a)))
def check(comb):
for i in comb:
for x, y in asserts[i]:
mujun = contains if not y else lambda a, b: b not in a
if mujun(comb, x):
return -1
return len(comb)
for i in range(n + 1):
for comb in combinations(list(range(n)), i):
yield check(set(comb))
yield 0
print((max(main())))
| false | 8.108108 | [
"-from operator import eq, ne",
"+from itertools import combinations",
"+from operator import contains",
"- yield int(x) - 1, y",
"+ yield int(x) - 1, y == \"1\"",
"- graph = []",
"+ asserts = []",
"- graph.append(list(readlines(a)))",
"+ asserts.append(list(readlines(a)))",
"- def check(bits):",
"- for pre_honest, asserts in zip(bits, graph):",
"- if pre_honest == \"0\":",
"- continue",
"- for x, y in asserts:",
"- if bits[x] != y:",
"+ def check(comb):",
"+ for i in comb:",
"+ for x, y in asserts[i]:",
"+ mujun = contains if not y else lambda a, b: b not in a",
"+ if mujun(comb, x):",
"- return len([b for b in bits if b == \"1\"])",
"+ return len(comb)",
"- for i in range(2**n - 1, -1, -1):",
"- bit = format(i, \"0{}b\".format(n))",
"- ans = check(bit)",
"- if ans > -1:",
"- print(ans)",
"- return",
"- print((0))",
"+ for i in range(n + 1):",
"+ for comb in combinations(list(range(n)), i):",
"+ yield check(set(comb))",
"+ yield 0",
"-main()",
"+print((max(main())))"
] | false | 0.068105 | 0.037319 | 1.824937 | [
"s053508492",
"s354153391"
] |
u227082700 | p02599 | python | s832451554 | s833148398 | 1,036 | 940 | 306,100 | 194,572 | Accepted | Accepted | 9.27 | def main():
n,q,*x=list(map(int,open(0).read().split()))
a=x[:n]
queries=[[]for _ in[0]*n]
for i in range(q):
l,r=x[n+i*2],x[n+i*2+1]
l-=1
r-=1
queries[r].append((l,i))
lastAppeared=[0]*n
bit=[0]*(n+1)
ans=[0]*q
for i in range(n):
x=lastAppeared[a[i]-1]+1
while x<=n+1:
bit[x-1]-=1
x+=x&-x
x=i+2
while x<=n+1:
bit[x-1]+=1
x+=x&-x
lastAppeared[a[i]-1]=i+1
for l,ind in queries[i]:
x=i+2
while x:
ans[ind]+=bit[x-1]
x-=x&-x
x=l+1
while x:
ans[ind]-=bit[x-1]
x-=x&-x
print((*ans))
if __name__ == "__main__":
main() | import sys
input = sys.stdin.buffer.readline
n,q=list(map(int,input().split()))
a=list(map(int,input().split()))
queries=[[]for _ in[0]*n]
for i in range(q):
l,r=list(map(int,input().split()))
l-=1
r-=1
queries[r].append((l,i))
lastAppeared=[0]*n
bit=[0]*(n+1)
ans=[0]*q
for i in range(n):
x=lastAppeared[a[i]-1]+1
while x<=n+1:
bit[x-1]-=1
x+=x&-x
x=i+2
while x<=n+1:
bit[x-1]+=1
x+=x&-x
lastAppeared[a[i]-1]=i+1
for l,ind in queries[i]:
x=i+2
while x:
ans[ind]+=bit[x-1]
x-=x&-x
x=l+1
while x:
ans[ind]-=bit[x-1]
x-=x&-x
print((*ans))
| 35 | 33 | 678 | 631 | def main():
n, q, *x = list(map(int, open(0).read().split()))
a = x[:n]
queries = [[] for _ in [0] * n]
for i in range(q):
l, r = x[n + i * 2], x[n + i * 2 + 1]
l -= 1
r -= 1
queries[r].append((l, i))
lastAppeared = [0] * n
bit = [0] * (n + 1)
ans = [0] * q
for i in range(n):
x = lastAppeared[a[i] - 1] + 1
while x <= n + 1:
bit[x - 1] -= 1
x += x & -x
x = i + 2
while x <= n + 1:
bit[x - 1] += 1
x += x & -x
lastAppeared[a[i] - 1] = i + 1
for l, ind in queries[i]:
x = i + 2
while x:
ans[ind] += bit[x - 1]
x -= x & -x
x = l + 1
while x:
ans[ind] -= bit[x - 1]
x -= x & -x
print((*ans))
if __name__ == "__main__":
main()
| import sys
input = sys.stdin.buffer.readline
n, q = list(map(int, input().split()))
a = list(map(int, input().split()))
queries = [[] for _ in [0] * n]
for i in range(q):
l, r = list(map(int, input().split()))
l -= 1
r -= 1
queries[r].append((l, i))
lastAppeared = [0] * n
bit = [0] * (n + 1)
ans = [0] * q
for i in range(n):
x = lastAppeared[a[i] - 1] + 1
while x <= n + 1:
bit[x - 1] -= 1
x += x & -x
x = i + 2
while x <= n + 1:
bit[x - 1] += 1
x += x & -x
lastAppeared[a[i] - 1] = i + 1
for l, ind in queries[i]:
x = i + 2
while x:
ans[ind] += bit[x - 1]
x -= x & -x
x = l + 1
while x:
ans[ind] -= bit[x - 1]
x -= x & -x
print((*ans))
| false | 5.714286 | [
"-def main():",
"- n, q, *x = list(map(int, open(0).read().split()))",
"- a = x[:n]",
"- queries = [[] for _ in [0] * n]",
"- for i in range(q):",
"- l, r = x[n + i * 2], x[n + i * 2 + 1]",
"- l -= 1",
"- r -= 1",
"- queries[r].append((l, i))",
"- lastAppeared = [0] * n",
"- bit = [0] * (n + 1)",
"- ans = [0] * q",
"- for i in range(n):",
"- x = lastAppeared[a[i] - 1] + 1",
"- while x <= n + 1:",
"- bit[x - 1] -= 1",
"- x += x & -x",
"+import sys",
"+",
"+input = sys.stdin.buffer.readline",
"+n, q = list(map(int, input().split()))",
"+a = list(map(int, input().split()))",
"+queries = [[] for _ in [0] * n]",
"+for i in range(q):",
"+ l, r = list(map(int, input().split()))",
"+ l -= 1",
"+ r -= 1",
"+ queries[r].append((l, i))",
"+lastAppeared = [0] * n",
"+bit = [0] * (n + 1)",
"+ans = [0] * q",
"+for i in range(n):",
"+ x = lastAppeared[a[i] - 1] + 1",
"+ while x <= n + 1:",
"+ bit[x - 1] -= 1",
"+ x += x & -x",
"+ x = i + 2",
"+ while x <= n + 1:",
"+ bit[x - 1] += 1",
"+ x += x & -x",
"+ lastAppeared[a[i] - 1] = i + 1",
"+ for l, ind in queries[i]:",
"- while x <= n + 1:",
"- bit[x - 1] += 1",
"- x += x & -x",
"- lastAppeared[a[i] - 1] = i + 1",
"- for l, ind in queries[i]:",
"- x = i + 2",
"- while x:",
"- ans[ind] += bit[x - 1]",
"- x -= x & -x",
"- x = l + 1",
"- while x:",
"- ans[ind] -= bit[x - 1]",
"- x -= x & -x",
"- print((*ans))",
"-",
"-",
"-if __name__ == \"__main__\":",
"- main()",
"+ while x:",
"+ ans[ind] += bit[x - 1]",
"+ x -= x & -x",
"+ x = l + 1",
"+ while x:",
"+ ans[ind] -= bit[x - 1]",
"+ x -= x & -x",
"+print((*ans))"
] | false | 0.038235 | 0.078783 | 0.485323 | [
"s832451554",
"s833148398"
] |
u094191970 | p02916 | python | s587053690 | s920676871 | 20 | 17 | 3,064 | 3,064 | Accepted | Accepted | 15 | n=int(eval(input()))
a=list(map(int,input().split()))
b=list(map(int,input().split()))
c=list(map(int,input().split()))
ans=0
b_n=-2
for i in range(n):
num=a[i]-1
ans+=b[num]
if num==b_n+1:
ans+=c[b_n]
b_n=a[i]-1
print(ans) | n=int(eval(input()))
a=list(map(int,input().split()))
b=list(map(int,input().split()))
c=list(map(int,input().split()))
ans=sum(b)
for i in range(n-1):
if a[i+1]==a[i]+1:
ans+=c[a[i]-1]
print(ans) | 14 | 10 | 243 | 206 | n = int(eval(input()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
c = list(map(int, input().split()))
ans = 0
b_n = -2
for i in range(n):
num = a[i] - 1
ans += b[num]
if num == b_n + 1:
ans += c[b_n]
b_n = a[i] - 1
print(ans)
| n = int(eval(input()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
c = list(map(int, input().split()))
ans = sum(b)
for i in range(n - 1):
if a[i + 1] == a[i] + 1:
ans += c[a[i] - 1]
print(ans)
| false | 28.571429 | [
"-ans = 0",
"-b_n = -2",
"-for i in range(n):",
"- num = a[i] - 1",
"- ans += b[num]",
"- if num == b_n + 1:",
"- ans += c[b_n]",
"- b_n = a[i] - 1",
"+ans = sum(b)",
"+for i in range(n - 1):",
"+ if a[i + 1] == a[i] + 1:",
"+ ans += c[a[i] - 1]"
] | false | 0.127396 | 0.046215 | 2.756583 | [
"s587053690",
"s920676871"
] |
u170201762 | p03472 | python | s945137564 | s217675284 | 528 | 430 | 24,460 | 28,584 | Accepted | Accepted | 18.56 | from math import ceil
N,H = list(map(int,input().split()))
katana = []
for i in range(N):
a,b = list(map(int,input().split()))
katana.append((a,'a'))
katana.append((b,'b'))
katana.sort()
katana.reverse()
damage = 0
ans = 0
i = 0
while damage < H:
if katana[i][1] == 'b':
ans += 1
damage += katana[i][0]
i += 1
else:
ans += ceil((H-damage)/katana[i][0])
break
print(ans) | from math import ceil
N,H = list(map(int,input().split()))
ab = [list(map(int,input().split())) for _ in range(N)]
amax = 0
for i in range(N):
amax = max(amax,ab[i][0])
B = []
for i in range(N):
if ab[i][1]>amax:
B.append(ab[i][1])
B.sort(reverse=True)
ans = 0
for b in B:
H -= b
ans += 1
if H <= 0:
break
if H > 0:
ans += ceil(H/amax)
print(ans) | 22 | 24 | 439 | 407 | from math import ceil
N, H = list(map(int, input().split()))
katana = []
for i in range(N):
a, b = list(map(int, input().split()))
katana.append((a, "a"))
katana.append((b, "b"))
katana.sort()
katana.reverse()
damage = 0
ans = 0
i = 0
while damage < H:
if katana[i][1] == "b":
ans += 1
damage += katana[i][0]
i += 1
else:
ans += ceil((H - damage) / katana[i][0])
break
print(ans)
| from math import ceil
N, H = list(map(int, input().split()))
ab = [list(map(int, input().split())) for _ in range(N)]
amax = 0
for i in range(N):
amax = max(amax, ab[i][0])
B = []
for i in range(N):
if ab[i][1] > amax:
B.append(ab[i][1])
B.sort(reverse=True)
ans = 0
for b in B:
H -= b
ans += 1
if H <= 0:
break
if H > 0:
ans += ceil(H / amax)
print(ans)
| false | 8.333333 | [
"-katana = []",
"+ab = [list(map(int, input().split())) for _ in range(N)]",
"+amax = 0",
"- a, b = list(map(int, input().split()))",
"- katana.append((a, \"a\"))",
"- katana.append((b, \"b\"))",
"-katana.sort()",
"-katana.reverse()",
"-damage = 0",
"+ amax = max(amax, ab[i][0])",
"+B = []",
"+for i in range(N):",
"+ if ab[i][1] > amax:",
"+ B.append(ab[i][1])",
"+B.sort(reverse=True)",
"-i = 0",
"-while damage < H:",
"- if katana[i][1] == \"b\":",
"- ans += 1",
"- damage += katana[i][0]",
"- i += 1",
"- else:",
"- ans += ceil((H - damage) / katana[i][0])",
"+for b in B:",
"+ H -= b",
"+ ans += 1",
"+ if H <= 0:",
"+if H > 0:",
"+ ans += ceil(H / amax)"
] | false | 0.118276 | 0.048692 | 2.429074 | [
"s945137564",
"s217675284"
] |
u922449550 | p02586 | python | s126823976 | s327881357 | 2,184 | 1,874 | 162,344 | 162,464 | Accepted | Accepted | 14.19 | # pypy
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
R, C, K = list(map(int, readline().split()))
rcv = list(map(int, read().split()))
rc2v = {}
for rr, cc, vv in zip(rcv[::3], rcv[1::3], rcv[2::3]):
rc2v[(rr, cc)] = vv
dp = [[0]*4 for c in range(C+1)]
for r in range(1, R+1):
for c in range(1, C+1):
v = rc2v[(r, c)] if (r, c) in rc2v else 0
dp[c][0] = max(dp[c-1][0], max(dp[c]))
dp[c][1] = max(dp[c-1][1], dp[c][0] + v)
for k in range(2, 4):
dp[c][k] = max(dp[c-1][k], dp[c-1][k-1] + v)
print((max(dp[-1]))) | # pypy
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
R, C, K = list(map(int, readline().split()))
rcv = list(map(int, read().split()))
rc2v = {}
for rr, cc, vv in zip(rcv[::3], rcv[1::3], rcv[2::3]):
rc2v[(rr, cc)] = vv
dp = [[0]*4 for c in range(C+1)]
for r in range(1, R+1):
for c in range(1, C+1):
v = rc2v[(r, c)] if (r, c) in rc2v else 0
dp[c][0] = max(dp[c-1][0], max(dp[c]))
dp[c][1] = max(dp[c-1][1], dp[c][0] + v)
dp[c][2] = max(dp[c-1][2], dp[c-1][1] + v)
dp[c][3] = max(dp[c-1][3], dp[c-1][2] + v)
print((max(dp[-1]))) | 22 | 22 | 603 | 620 | # pypy
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
R, C, K = list(map(int, readline().split()))
rcv = list(map(int, read().split()))
rc2v = {}
for rr, cc, vv in zip(rcv[::3], rcv[1::3], rcv[2::3]):
rc2v[(rr, cc)] = vv
dp = [[0] * 4 for c in range(C + 1)]
for r in range(1, R + 1):
for c in range(1, C + 1):
v = rc2v[(r, c)] if (r, c) in rc2v else 0
dp[c][0] = max(dp[c - 1][0], max(dp[c]))
dp[c][1] = max(dp[c - 1][1], dp[c][0] + v)
for k in range(2, 4):
dp[c][k] = max(dp[c - 1][k], dp[c - 1][k - 1] + v)
print((max(dp[-1])))
| # pypy
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
R, C, K = list(map(int, readline().split()))
rcv = list(map(int, read().split()))
rc2v = {}
for rr, cc, vv in zip(rcv[::3], rcv[1::3], rcv[2::3]):
rc2v[(rr, cc)] = vv
dp = [[0] * 4 for c in range(C + 1)]
for r in range(1, R + 1):
for c in range(1, C + 1):
v = rc2v[(r, c)] if (r, c) in rc2v else 0
dp[c][0] = max(dp[c - 1][0], max(dp[c]))
dp[c][1] = max(dp[c - 1][1], dp[c][0] + v)
dp[c][2] = max(dp[c - 1][2], dp[c - 1][1] + v)
dp[c][3] = max(dp[c - 1][3], dp[c - 1][2] + v)
print((max(dp[-1])))
| false | 0 | [
"- for k in range(2, 4):",
"- dp[c][k] = max(dp[c - 1][k], dp[c - 1][k - 1] + v)",
"+ dp[c][2] = max(dp[c - 1][2], dp[c - 1][1] + v)",
"+ dp[c][3] = max(dp[c - 1][3], dp[c - 1][2] + v)"
] | false | 0.056166 | 0.040769 | 1.377665 | [
"s126823976",
"s327881357"
] |
u690536347 | p02720 | python | s617453931 | s301632712 | 227 | 183 | 21,100 | 20,972 | Accepted | Accepted | 19.38 | from collections import deque
q = deque([1,2,3,4,5,6,7,8,9])
cnt = 0
l = []
used = set()
while cnt<100000:
p = q.popleft()
if p in used:continue
used.add(p)
l.append(p)
cnt += 1
for i in range(max((p%10)-1,0), min((p%10)+1, 9)+1):
q.append(10*p+i)
N = int(eval(input()))
print((l[N-1])) | from collections import deque
def solve():
N = int(eval(input()))
q = deque([1,2,3,4,5,6,7,8,9])
cnt = 0
l = []
used = set()
while cnt<N:
p = q.popleft()
if p in used:continue
used.add(p)
l.append(p)
cnt += 1
for i in range(max((p%10)-1,0), min((p%10)+1, 9)+1):
q.append(10*p+i)
print((l[N-1]))
if __name__ == "__main__":
solve()
| 18 | 24 | 330 | 443 | from collections import deque
q = deque([1, 2, 3, 4, 5, 6, 7, 8, 9])
cnt = 0
l = []
used = set()
while cnt < 100000:
p = q.popleft()
if p in used:
continue
used.add(p)
l.append(p)
cnt += 1
for i in range(max((p % 10) - 1, 0), min((p % 10) + 1, 9) + 1):
q.append(10 * p + i)
N = int(eval(input()))
print((l[N - 1]))
| from collections import deque
def solve():
N = int(eval(input()))
q = deque([1, 2, 3, 4, 5, 6, 7, 8, 9])
cnt = 0
l = []
used = set()
while cnt < N:
p = q.popleft()
if p in used:
continue
used.add(p)
l.append(p)
cnt += 1
for i in range(max((p % 10) - 1, 0), min((p % 10) + 1, 9) + 1):
q.append(10 * p + i)
print((l[N - 1]))
if __name__ == "__main__":
solve()
| false | 25 | [
"-q = deque([1, 2, 3, 4, 5, 6, 7, 8, 9])",
"-cnt = 0",
"-l = []",
"-used = set()",
"-while cnt < 100000:",
"- p = q.popleft()",
"- if p in used:",
"- continue",
"- used.add(p)",
"- l.append(p)",
"- cnt += 1",
"- for i in range(max((p % 10) - 1, 0), min((p % 10) + 1, 9) + 1):",
"- q.append(10 * p + i)",
"-N = int(eval(input()))",
"-print((l[N - 1]))",
"+",
"+def solve():",
"+ N = int(eval(input()))",
"+ q = deque([1, 2, 3, 4, 5, 6, 7, 8, 9])",
"+ cnt = 0",
"+ l = []",
"+ used = set()",
"+ while cnt < N:",
"+ p = q.popleft()",
"+ if p in used:",
"+ continue",
"+ used.add(p)",
"+ l.append(p)",
"+ cnt += 1",
"+ for i in range(max((p % 10) - 1, 0), min((p % 10) + 1, 9) + 1):",
"+ q.append(10 * p + i)",
"+ print((l[N - 1]))",
"+",
"+",
"+if __name__ == \"__main__\":",
"+ solve()"
] | false | 0.497216 | 0.065622 | 7.576927 | [
"s617453931",
"s301632712"
] |
u815763296 | p04005 | python | s586662228 | s707490922 | 28 | 25 | 9,156 | 9,072 | Accepted | Accepted | 10.71 |
A, B, C = list(map(int, input().split()))
total = A*B*C
if A >= B and A >= C:
x = A
y = B
z = C
elif B >= A and B >= C:
x = B
y = A
z = C
else:
x = C
y = A
z = B
if x % 2 == 0:
ans = 0
else:
ans = x % 2*y*z
print(ans)
| A, B, C = list(map(int, input().split()))
x = max(A, B, C)
y = min(A, B, C)
z = A+B+C-(x+y)
if x % 2 == 0:
ans = 0
else:
ans = y*z
print(ans)
| 20 | 9 | 276 | 152 | A, B, C = list(map(int, input().split()))
total = A * B * C
if A >= B and A >= C:
x = A
y = B
z = C
elif B >= A and B >= C:
x = B
y = A
z = C
else:
x = C
y = A
z = B
if x % 2 == 0:
ans = 0
else:
ans = x % 2 * y * z
print(ans)
| A, B, C = list(map(int, input().split()))
x = max(A, B, C)
y = min(A, B, C)
z = A + B + C - (x + y)
if x % 2 == 0:
ans = 0
else:
ans = y * z
print(ans)
| false | 55 | [
"-total = A * B * C",
"-if A >= B and A >= C:",
"- x = A",
"- y = B",
"- z = C",
"-elif B >= A and B >= C:",
"- x = B",
"- y = A",
"- z = C",
"-else:",
"- x = C",
"- y = A",
"- z = B",
"+x = max(A, B, C)",
"+y = min(A, B, C)",
"+z = A + B + C - (x + y)",
"- ans = x % 2 * y * z",
"+ ans = y * z"
] | false | 0.040807 | 0.042171 | 0.967654 | [
"s586662228",
"s707490922"
] |
u261533743 | p02392 | python | s414570904 | s743841156 | 30 | 20 | 7,520 | 5,600 | Accepted | Accepted | 33.33 |
[a,b,c] = list(map(int,input().split()))
print(({True: 'Yes', False: 'No'}[a < b < c]))
| def lessthen (a, b):
return a < b
def range (a, b, c):
return lessthen(a, b) and lessthen(b, c)
a, b, c = list(map(int, input().split()))
if list(range(a, b, c)):
print('Yes')
else:
print('No')
| 6 | 12 | 90 | 216 | [a, b, c] = list(map(int, input().split()))
print(({True: "Yes", False: "No"}[a < b < c]))
| def lessthen(a, b):
return a < b
def range(a, b, c):
return lessthen(a, b) and lessthen(b, c)
a, b, c = list(map(int, input().split()))
if list(range(a, b, c)):
print("Yes")
else:
print("No")
| false | 50 | [
"-[a, b, c] = list(map(int, input().split()))",
"-print(({True: \"Yes\", False: \"No\"}[a < b < c]))",
"+def lessthen(a, b):",
"+ return a < b",
"+",
"+",
"+def range(a, b, c):",
"+ return lessthen(a, b) and lessthen(b, c)",
"+",
"+",
"+a, b, c = list(map(int, input().split()))",
"+if list(range(a, b, c)):",
"+ print(\"Yes\")",
"+else:",
"+ print(\"No\")"
] | false | 0.084327 | 0.037476 | 2.250148 | [
"s414570904",
"s743841156"
] |
u223663729 | p02761 | python | s317282385 | s890482762 | 171 | 20 | 38,384 | 3,060 | Accepted | Accepted | 88.3 | def f():
N, M = list(map(int, input().split()))
s = []
c = []
for m in range(M):
_s, _c = list(map(int, input().split()))
s.append(_s)
c.append(_c)
if N == 1:
rg = list(range(10))
else:
rg = list(range(10 ** (N - 1), 10 ** N - 1))
for i in rg:
bl = True
for m in range(M):
if (i//(10**(N-s[m])))%10 != c[m]:
bl = False
break
if bl:
return i
return -1
print((f())) | N, M = list(map(int, input().split()))
S = [input().split() for _ in [0]*M]
for i in range(1000):
if len(str(i)) != N:
continue
for s, c in S:
if str(i)[int(s)-1] == c:
continue
else:
break
else:
print(i)
break
else:
print((-1))
| 30 | 16 | 526 | 317 | def f():
N, M = list(map(int, input().split()))
s = []
c = []
for m in range(M):
_s, _c = list(map(int, input().split()))
s.append(_s)
c.append(_c)
if N == 1:
rg = list(range(10))
else:
rg = list(range(10 ** (N - 1), 10**N - 1))
for i in rg:
bl = True
for m in range(M):
if (i // (10 ** (N - s[m]))) % 10 != c[m]:
bl = False
break
if bl:
return i
return -1
print((f()))
| N, M = list(map(int, input().split()))
S = [input().split() for _ in [0] * M]
for i in range(1000):
if len(str(i)) != N:
continue
for s, c in S:
if str(i)[int(s) - 1] == c:
continue
else:
break
else:
print(i)
break
else:
print((-1))
| false | 46.666667 | [
"-def f():",
"- N, M = list(map(int, input().split()))",
"- s = []",
"- c = []",
"- for m in range(M):",
"- _s, _c = list(map(int, input().split()))",
"- s.append(_s)",
"- c.append(_c)",
"- if N == 1:",
"- rg = list(range(10))",
"+N, M = list(map(int, input().split()))",
"+S = [input().split() for _ in [0] * M]",
"+for i in range(1000):",
"+ if len(str(i)) != N:",
"+ continue",
"+ for s, c in S:",
"+ if str(i)[int(s) - 1] == c:",
"+ continue",
"+ else:",
"+ break",
"- rg = list(range(10 ** (N - 1), 10**N - 1))",
"- for i in rg:",
"- bl = True",
"- for m in range(M):",
"- if (i // (10 ** (N - s[m]))) % 10 != c[m]:",
"- bl = False",
"- break",
"- if bl:",
"- return i",
"- return -1",
"-",
"-",
"-print((f()))",
"+ print(i)",
"+ break",
"+else:",
"+ print((-1))"
] | false | 0.098677 | 0.048655 | 2.028095 | [
"s317282385",
"s890482762"
] |
u562935282 | p03222 | python | s862172035 | s479080080 | 46 | 26 | 3,064 | 3,064 | Accepted | Accepted | 43.48 | MOD = 10 ** 9 + 7
H, W, K = list(map(int, input().split()))
K -= 1
# 0-indexed
dp = [[0 for _ in range(W)] for _ in range(H + 1)]
dp[0][0] = 1
# dp[h][k]
# h段のあみだくじで横線kに到達する本数
for h in range(H):
# h: 移動前の高さ
for b in range(1 << (W - 1)):
# 各段はW - 1箇所の横線配置位置をもつ
if '11' in bin(b): continue
# 横線同士がつながっているケースは不適
goto = [i for i in range(W)]
# goto[i]: 縦線iからの移動先
for j in range(W - 1):
# j: 横線の番号 かつ 横線の左側の縦線の番号
if (b >> j) & 1 == 1:
# 横線が存在する場合
goto[j], goto[j + 1] = goto[j + 1], goto[j]
# gotoで横線配置bによる移動を表現する
for i in range(W):
# i: 移動前の縦線
dp[h + 1][goto[i]] += dp[h][i]
dp[h + 1][goto[i]] %= MOD
print((dp[H][K]))
| def f(n):
# 縦線n本で構成できる横線の組み合わせ
if n <= 1: return 1
return f(n - 1) + f(n - 2)
MOD = 10 ** 9 + 7
H, W, K = list(map(int, input().split()))
K -= 1
# 0-indexed
dp = [[0 for _ in range(W)] for _ in range(H + 1)]
dp[0][0] = 1
# dp[h][k]
# h段のあみだくじで横線kに到達する本数
for h in range(H):
# h: 移動前の高さ
for i in range(W):
# i: 移動前の縦線
if i >= 1:
dp[h + 1][i - 1] += dp[h][i] * f(i - 1) * f(W - 1 - i)
dp[h + 1][i - 1] %= MOD
dp[h + 1][i] += dp[h][i] * f(i) * f(W - 1 - i)
dp[h + 1][i] %= MOD
if i < W - 1:
dp[h + 1][i + 1] += dp[h][i] * f(i) * f(W - 2 - i)
dp[h + 1][i + 1] %= MOD
print((dp[H][K]))
| 35 | 31 | 813 | 716 | MOD = 10**9 + 7
H, W, K = list(map(int, input().split()))
K -= 1
# 0-indexed
dp = [[0 for _ in range(W)] for _ in range(H + 1)]
dp[0][0] = 1
# dp[h][k]
# h段のあみだくじで横線kに到達する本数
for h in range(H):
# h: 移動前の高さ
for b in range(1 << (W - 1)):
# 各段はW - 1箇所の横線配置位置をもつ
if "11" in bin(b):
continue
# 横線同士がつながっているケースは不適
goto = [i for i in range(W)]
# goto[i]: 縦線iからの移動先
for j in range(W - 1):
# j: 横線の番号 かつ 横線の左側の縦線の番号
if (b >> j) & 1 == 1:
# 横線が存在する場合
goto[j], goto[j + 1] = goto[j + 1], goto[j]
# gotoで横線配置bによる移動を表現する
for i in range(W):
# i: 移動前の縦線
dp[h + 1][goto[i]] += dp[h][i]
dp[h + 1][goto[i]] %= MOD
print((dp[H][K]))
| def f(n):
# 縦線n本で構成できる横線の組み合わせ
if n <= 1:
return 1
return f(n - 1) + f(n - 2)
MOD = 10**9 + 7
H, W, K = list(map(int, input().split()))
K -= 1
# 0-indexed
dp = [[0 for _ in range(W)] for _ in range(H + 1)]
dp[0][0] = 1
# dp[h][k]
# h段のあみだくじで横線kに到達する本数
for h in range(H):
# h: 移動前の高さ
for i in range(W):
# i: 移動前の縦線
if i >= 1:
dp[h + 1][i - 1] += dp[h][i] * f(i - 1) * f(W - 1 - i)
dp[h + 1][i - 1] %= MOD
dp[h + 1][i] += dp[h][i] * f(i) * f(W - 1 - i)
dp[h + 1][i] %= MOD
if i < W - 1:
dp[h + 1][i + 1] += dp[h][i] * f(i) * f(W - 2 - i)
dp[h + 1][i + 1] %= MOD
print((dp[H][K]))
| false | 11.428571 | [
"+def f(n):",
"+ # 縦線n本で構成できる横線の組み合わせ",
"+ if n <= 1:",
"+ return 1",
"+ return f(n - 1) + f(n - 2)",
"+",
"+",
"- for b in range(1 << (W - 1)):",
"- # 各段はW - 1箇所の横線配置位置をもつ",
"- if \"11\" in bin(b):",
"- continue",
"- # 横線同士がつながっているケースは不適",
"- goto = [i for i in range(W)]",
"- # goto[i]: 縦線iからの移動先",
"- for j in range(W - 1):",
"- # j: 横線の番号 かつ 横線の左側の縦線の番号",
"- if (b >> j) & 1 == 1:",
"- # 横線が存在する場合",
"- goto[j], goto[j + 1] = goto[j + 1], goto[j]",
"- # gotoで横線配置bによる移動を表現する",
"- for i in range(W):",
"- # i: 移動前の縦線",
"- dp[h + 1][goto[i]] += dp[h][i]",
"- dp[h + 1][goto[i]] %= MOD",
"+ for i in range(W):",
"+ # i: 移動前の縦線",
"+ if i >= 1:",
"+ dp[h + 1][i - 1] += dp[h][i] * f(i - 1) * f(W - 1 - i)",
"+ dp[h + 1][i - 1] %= MOD",
"+ dp[h + 1][i] += dp[h][i] * f(i) * f(W - 1 - i)",
"+ dp[h + 1][i] %= MOD",
"+ if i < W - 1:",
"+ dp[h + 1][i + 1] += dp[h][i] * f(i) * f(W - 2 - i)",
"+ dp[h + 1][i + 1] %= MOD"
] | false | 0.038662 | 0.059484 | 0.649952 | [
"s862172035",
"s479080080"
] |
u206460435 | p03253 | python | s716689740 | s130752631 | 63 | 40 | 5,420 | 6,052 | Accepted | Accepted | 36.51 | #!/usr/bin/env python3
import sys
from math import *
from itertools import *
from collections import *
from functools import *
from operator import *
try:
from math import gcd
except Exception:
from fractions import gcd
MOD = 1000000007 # type: int
def prime_table(n):
rn = int(ceil(sqrt(n)))
t = [True] * (rn + 1)
t[0] = False
t[1] = False
i = 2
while i * i <= n:
for ii in range(2 * i, rn + 1, i):
t[ii] = False
i += 1
return [x for x, i in enumerate(t) if i == True]
def combination(n, m):
return reduce(mul, list(range(n, n - m, -1)), 1) // factorial(m)
def solve(N: int, M: int):
fs = defaultdict(int)
for p in prime_table(M):
while (M % p) == 0:
fs[p] += 1
M //= p
if M != 1:
fs[M] = 1
ret = 1
for c in list(fs.values()):
ret *= combination(c + N - 1, c)
return ret % MOD
def main():
def iterate_tokens():
for line in sys.stdin:
for word in line.split():
yield word
tokens = iterate_tokens()
N = int(next(tokens)) # type: int
M = int(next(tokens)) # type: int
result = solve(N, M)
print(result)
if __name__ == '__main__':
main()
| #!/usr/bin/env python3
import sys
from math import *
from itertools import *
from collections import *
from functools import *
from operator import *
try:
from math import gcd
except Exception:
from fractions import gcd
MOD = 1000000007 # type: int
def prime_table(n):
t = [True] * (n + 1)
t[0] = False
t[1] = False
for p in range(2, n + 1, 2):
if n < p ** 2:
break
if t[p]:
for i in range(p * p, n + 1, 2 * p):
t[i] = False
return [2] + [p for p in range(3, n + 1, 2) if t[p]]
def pow_mod(a, k, M):
if k == 0:
return 1
t = pow_mod(a, k // 2, M)
res = (t * t) % M
if k % 2 == 1:
res = (res * a) % M
return res
def inv_mod(a, M):
return pow_mod(a, M - 2, M)
def fact_mod(a, M):
ret = 1
for i in range(2, a + 1):
ret = (ret * i) % M
return ret
def perm_mod(n, m, M):
ret = 1
for i in range(n, n - m, -1):
ret = (ret * i) % M
return ret
def comb_mod(n, m, M):
return (perm_mod(n, m, M) * inv_mod(fact_mod(m, M), M)) % M
def solve(N: int, M: int):
fs = defaultdict(int)
for p in prime_table(int(M ** 0.5) + 1):
while (M % p) == 0:
fs[p] += 1
M //= p
if M != 1:
fs[M] = 1
ret = 1
for c in list(fs.values()):
ret = (ret * comb_mod(c + N - 1, c, MOD)) % MOD
return ret
def main():
def iterate_tokens():
for line in sys.stdin:
for word in line.split():
yield word
tokens = iterate_tokens()
N = int(next(tokens)) # type: int
M = int(next(tokens)) # type: int
result = solve(N, M)
print(result)
if __name__ == '__main__':
main()
| 61 | 90 | 1,302 | 1,830 | #!/usr/bin/env python3
import sys
from math import *
from itertools import *
from collections import *
from functools import *
from operator import *
try:
from math import gcd
except Exception:
from fractions import gcd
MOD = 1000000007 # type: int
def prime_table(n):
rn = int(ceil(sqrt(n)))
t = [True] * (rn + 1)
t[0] = False
t[1] = False
i = 2
while i * i <= n:
for ii in range(2 * i, rn + 1, i):
t[ii] = False
i += 1
return [x for x, i in enumerate(t) if i == True]
def combination(n, m):
return reduce(mul, list(range(n, n - m, -1)), 1) // factorial(m)
def solve(N: int, M: int):
fs = defaultdict(int)
for p in prime_table(M):
while (M % p) == 0:
fs[p] += 1
M //= p
if M != 1:
fs[M] = 1
ret = 1
for c in list(fs.values()):
ret *= combination(c + N - 1, c)
return ret % MOD
def main():
def iterate_tokens():
for line in sys.stdin:
for word in line.split():
yield word
tokens = iterate_tokens()
N = int(next(tokens)) # type: int
M = int(next(tokens)) # type: int
result = solve(N, M)
print(result)
if __name__ == "__main__":
main()
| #!/usr/bin/env python3
import sys
from math import *
from itertools import *
from collections import *
from functools import *
from operator import *
try:
from math import gcd
except Exception:
from fractions import gcd
MOD = 1000000007 # type: int
def prime_table(n):
t = [True] * (n + 1)
t[0] = False
t[1] = False
for p in range(2, n + 1, 2):
if n < p**2:
break
if t[p]:
for i in range(p * p, n + 1, 2 * p):
t[i] = False
return [2] + [p for p in range(3, n + 1, 2) if t[p]]
def pow_mod(a, k, M):
if k == 0:
return 1
t = pow_mod(a, k // 2, M)
res = (t * t) % M
if k % 2 == 1:
res = (res * a) % M
return res
def inv_mod(a, M):
return pow_mod(a, M - 2, M)
def fact_mod(a, M):
ret = 1
for i in range(2, a + 1):
ret = (ret * i) % M
return ret
def perm_mod(n, m, M):
ret = 1
for i in range(n, n - m, -1):
ret = (ret * i) % M
return ret
def comb_mod(n, m, M):
return (perm_mod(n, m, M) * inv_mod(fact_mod(m, M), M)) % M
def solve(N: int, M: int):
fs = defaultdict(int)
for p in prime_table(int(M**0.5) + 1):
while (M % p) == 0:
fs[p] += 1
M //= p
if M != 1:
fs[M] = 1
ret = 1
for c in list(fs.values()):
ret = (ret * comb_mod(c + N - 1, c, MOD)) % MOD
return ret
def main():
def iterate_tokens():
for line in sys.stdin:
for word in line.split():
yield word
tokens = iterate_tokens()
N = int(next(tokens)) # type: int
M = int(next(tokens)) # type: int
result = solve(N, M)
print(result)
if __name__ == "__main__":
main()
| false | 32.222222 | [
"- rn = int(ceil(sqrt(n)))",
"- t = [True] * (rn + 1)",
"+ t = [True] * (n + 1)",
"- i = 2",
"- while i * i <= n:",
"- for ii in range(2 * i, rn + 1, i):",
"- t[ii] = False",
"- i += 1",
"- return [x for x, i in enumerate(t) if i == True]",
"+ for p in range(2, n + 1, 2):",
"+ if n < p**2:",
"+ break",
"+ if t[p]:",
"+ for i in range(p * p, n + 1, 2 * p):",
"+ t[i] = False",
"+ return [2] + [p for p in range(3, n + 1, 2) if t[p]]",
"-def combination(n, m):",
"- return reduce(mul, list(range(n, n - m, -1)), 1) // factorial(m)",
"+def pow_mod(a, k, M):",
"+ if k == 0:",
"+ return 1",
"+ t = pow_mod(a, k // 2, M)",
"+ res = (t * t) % M",
"+ if k % 2 == 1:",
"+ res = (res * a) % M",
"+ return res",
"+",
"+",
"+def inv_mod(a, M):",
"+ return pow_mod(a, M - 2, M)",
"+",
"+",
"+def fact_mod(a, M):",
"+ ret = 1",
"+ for i in range(2, a + 1):",
"+ ret = (ret * i) % M",
"+ return ret",
"+",
"+",
"+def perm_mod(n, m, M):",
"+ ret = 1",
"+ for i in range(n, n - m, -1):",
"+ ret = (ret * i) % M",
"+ return ret",
"+",
"+",
"+def comb_mod(n, m, M):",
"+ return (perm_mod(n, m, M) * inv_mod(fact_mod(m, M), M)) % M",
"- for p in prime_table(M):",
"+ for p in prime_table(int(M**0.5) + 1):",
"- ret *= combination(c + N - 1, c)",
"- return ret % MOD",
"+ ret = (ret * comb_mod(c + N - 1, c, MOD)) % MOD",
"+ return ret"
] | false | 0.095209 | 0.103746 | 0.917717 | [
"s716689740",
"s130752631"
] |
u734816542 | p03494 | python | s374893954 | s393353428 | 21 | 18 | 3,060 | 3,060 | Accepted | Accepted | 14.29 | if __name__ == '__main__':
n = eval(input())
li = list(map(int, input().split(' ')))
flag, cnt = True, 0
while flag:
for list_index in range(len(li)):
value = li[list_index]
if value % 2 == 0:
li[list_index] /= 2
else:
flag = False
break
if flag:
cnt += 1
print(cnt)
| import math
n = eval(input())
a = list(map(int, input().split()))
ans = float("inf")
for i in a:
ans = min(ans, len(bin(i)) - bin(i).rfind("1") - 1)
print((round(ans))) | 18 | 7 | 413 | 170 | if __name__ == "__main__":
n = eval(input())
li = list(map(int, input().split(" ")))
flag, cnt = True, 0
while flag:
for list_index in range(len(li)):
value = li[list_index]
if value % 2 == 0:
li[list_index] /= 2
else:
flag = False
break
if flag:
cnt += 1
print(cnt)
| import math
n = eval(input())
a = list(map(int, input().split()))
ans = float("inf")
for i in a:
ans = min(ans, len(bin(i)) - bin(i).rfind("1") - 1)
print((round(ans)))
| false | 61.111111 | [
"-if __name__ == \"__main__\":",
"- n = eval(input())",
"- li = list(map(int, input().split(\" \")))",
"- flag, cnt = True, 0",
"- while flag:",
"- for list_index in range(len(li)):",
"- value = li[list_index]",
"- if value % 2 == 0:",
"- li[list_index] /= 2",
"- else:",
"- flag = False",
"- break",
"- if flag:",
"- cnt += 1",
"- print(cnt)",
"+import math",
"+",
"+n = eval(input())",
"+a = list(map(int, input().split()))",
"+ans = float(\"inf\")",
"+for i in a:",
"+ ans = min(ans, len(bin(i)) - bin(i).rfind(\"1\") - 1)",
"+print((round(ans)))"
] | false | 0.034754 | 0.13912 | 0.249812 | [
"s374893954",
"s393353428"
] |
u690536347 | p03178 | python | s223318038 | s181938932 | 1,004 | 806 | 61,788 | 61,920 | Accepted | Accepted | 19.72 | K = eval(input())
N = len(K)
D = int(eval(input()))
mod = 10**9+7
dp = [[[0]*D for _ in range(2)] for _ in range(N+1)]
dp[0][0][0] = 1
for i in range(N):
a = ord(K[i])-48
for j in range(D):
for k in range(10):
b = (j+k)%D
dp[i+1][1][b] += dp[i][1][j]
dp[i+1][1][b] %= mod
if k<a:
dp[i+1][1][b] += dp[i][0][j]
dp[i+1][1][b] %= mod
for j in range(D):
b = (j+a)%D
dp[i+1][0][b] += dp[i][0][j]
dp[i+1][0][b] %= mod
print(((dp[N][1][0]+dp[N][0][0]-1)%mod)) | K = eval(input())
N = len(K)
D = int(eval(input()))
mod = 10**9+7
dp = [[[0]*D for _ in range(2)] for _ in range(N+1)]
dp[0][0][0] = 1
for i in range(N):
a = ord(K[i])-48
for j in range(D):
for k in range(10):
b = (j+k)%D
dp[i+1][1][b] += dp[i][1][j]
if k<a:
dp[i+1][1][b] += dp[i][0][j]
dp[i+1][1][b] %= mod
for j in range(D):
b = (j+a)%D
dp[i+1][0][b] += dp[i][0][j]
dp[i+1][0][b] %= mod
print(((dp[N][1][0]+dp[N][0][0]-1)%mod)) | 26 | 24 | 595 | 555 | K = eval(input())
N = len(K)
D = int(eval(input()))
mod = 10**9 + 7
dp = [[[0] * D for _ in range(2)] for _ in range(N + 1)]
dp[0][0][0] = 1
for i in range(N):
a = ord(K[i]) - 48
for j in range(D):
for k in range(10):
b = (j + k) % D
dp[i + 1][1][b] += dp[i][1][j]
dp[i + 1][1][b] %= mod
if k < a:
dp[i + 1][1][b] += dp[i][0][j]
dp[i + 1][1][b] %= mod
for j in range(D):
b = (j + a) % D
dp[i + 1][0][b] += dp[i][0][j]
dp[i + 1][0][b] %= mod
print(((dp[N][1][0] + dp[N][0][0] - 1) % mod))
| K = eval(input())
N = len(K)
D = int(eval(input()))
mod = 10**9 + 7
dp = [[[0] * D for _ in range(2)] for _ in range(N + 1)]
dp[0][0][0] = 1
for i in range(N):
a = ord(K[i]) - 48
for j in range(D):
for k in range(10):
b = (j + k) % D
dp[i + 1][1][b] += dp[i][1][j]
if k < a:
dp[i + 1][1][b] += dp[i][0][j]
dp[i + 1][1][b] %= mod
for j in range(D):
b = (j + a) % D
dp[i + 1][0][b] += dp[i][0][j]
dp[i + 1][0][b] %= mod
print(((dp[N][1][0] + dp[N][0][0] - 1) % mod))
| false | 7.692308 | [
"- dp[i + 1][1][b] %= mod",
"- dp[i + 1][1][b] %= mod",
"+ dp[i + 1][1][b] %= mod"
] | false | 0.063259 | 0.080168 | 0.78908 | [
"s223318038",
"s181938932"
] |
u969850098 | p02714 | python | s873362442 | s327609508 | 1,417 | 737 | 9,144 | 9,232 | Accepted | Accepted | 47.99 | def main():
N = int(eval(input()))
S = eval(input())
ans = S.count('R') * S.count('G') * S.count('B')
for i in range(N-2):
for j in range(i+1, i+1+(N-1-i)//2):
k = j + (j - i)
if len(set([S[i], S[j], S[k]])) == 3:
ans -= 1
print(ans)
if __name__ == "__main__":
main() | def main():
N = int(eval(input()))
S = eval(input())
ans = S.count('R') * S.count('G') * S.count('B')
for i in range(N-2):
for j in range(i+1, i+1+(N-1-i)//2):
k = j + (j - i)
if S[i] != S[j] and S[j] != S[k] and S[k] != S[i]:
ans -= 1
print(ans)
if __name__ == "__main__":
main() | 17 | 17 | 364 | 377 | def main():
N = int(eval(input()))
S = eval(input())
ans = S.count("R") * S.count("G") * S.count("B")
for i in range(N - 2):
for j in range(i + 1, i + 1 + (N - 1 - i) // 2):
k = j + (j - i)
if len(set([S[i], S[j], S[k]])) == 3:
ans -= 1
print(ans)
if __name__ == "__main__":
main()
| def main():
N = int(eval(input()))
S = eval(input())
ans = S.count("R") * S.count("G") * S.count("B")
for i in range(N - 2):
for j in range(i + 1, i + 1 + (N - 1 - i) // 2):
k = j + (j - i)
if S[i] != S[j] and S[j] != S[k] and S[k] != S[i]:
ans -= 1
print(ans)
if __name__ == "__main__":
main()
| false | 0 | [
"- if len(set([S[i], S[j], S[k]])) == 3:",
"+ if S[i] != S[j] and S[j] != S[k] and S[k] != S[i]:"
] | false | 0.076515 | 0.114259 | 0.669662 | [
"s873362442",
"s327609508"
] |
u744920373 | p03268 | python | s874136144 | s254511398 | 61 | 17 | 3,188 | 3,064 | Accepted | Accepted | 72.13 | import sys
def ii(): return int(sys.stdin.readline())
def mi(): return list(map(int, sys.stdin.readline().split()))
def li(): return list(map(int, sys.stdin.readline().split()))
def li2(N): return [list(map(int, sys.stdin.readline().split())) for i in range(N)]
def dp2(ini, i, j): return [[ini]*i for i2 in range(j)]
def dp3(ini, i, j, k): return [[[ini]*i for i2 in range(j)] for i3 in range(k)]
#import bisect #bisect.bisect_left(B, a)
#from collections import defaultdict #d = defaultdict(int) d[key] += value
N, K = mi()
cnt_n = 0
ini_n = K
while ini_n <= N:
cnt_n += 1
ini_n += K
ans = cnt_n ** 3
if K % 2 == 0:
ini_k = K // 2
cnt_k = 0
while ini_k <= N:
cnt_k += 1
ini_k += K
ans += cnt_k ** 3
print(ans) | import sys
def ii(): return int(sys.stdin.readline())
def mi(): return list(map(int, sys.stdin.readline().split()))
def li(): return list(map(int, sys.stdin.readline().split()))
def li2(N): return [list(map(int, sys.stdin.readline().split())) for i in range(N)]
def dp2(ini, i, j): return [[ini]*i for i2 in range(j)]
def dp3(ini, i, j, k): return [[[ini]*i for i2 in range(j)] for i3 in range(k)]
#import bisect #bisect.bisect_left(B, a)
#from collections import defaultdict #d = defaultdict(int) d[key] += value
N, K = mi()
cnt_n = 0
ini_n = K
#while ini_n <= N:
#cnt_n += 1
#ini_n += K
cnt_n = N // K
ans = cnt_n ** 3
if K % 2 == 0:
ini_k = K // 2
'''
cnt_k = 0
while ini_k <= N:
cnt_k += 1
ini_k += K
ans += cnt_k ** 3
'''
if N >= ini_k:
ans += ((N - ini_k) // K + 1)**3
print(ans) | 29 | 34 | 782 | 881 | import sys
def ii():
return int(sys.stdin.readline())
def mi():
return list(map(int, sys.stdin.readline().split()))
def li():
return list(map(int, sys.stdin.readline().split()))
def li2(N):
return [list(map(int, sys.stdin.readline().split())) for i in range(N)]
def dp2(ini, i, j):
return [[ini] * i for i2 in range(j)]
def dp3(ini, i, j, k):
return [[[ini] * i for i2 in range(j)] for i3 in range(k)]
# import bisect #bisect.bisect_left(B, a)
# from collections import defaultdict #d = defaultdict(int) d[key] += value
N, K = mi()
cnt_n = 0
ini_n = K
while ini_n <= N:
cnt_n += 1
ini_n += K
ans = cnt_n**3
if K % 2 == 0:
ini_k = K // 2
cnt_k = 0
while ini_k <= N:
cnt_k += 1
ini_k += K
ans += cnt_k**3
print(ans)
| import sys
def ii():
return int(sys.stdin.readline())
def mi():
return list(map(int, sys.stdin.readline().split()))
def li():
return list(map(int, sys.stdin.readline().split()))
def li2(N):
return [list(map(int, sys.stdin.readline().split())) for i in range(N)]
def dp2(ini, i, j):
return [[ini] * i for i2 in range(j)]
def dp3(ini, i, j, k):
return [[[ini] * i for i2 in range(j)] for i3 in range(k)]
# import bisect #bisect.bisect_left(B, a)
# from collections import defaultdict #d = defaultdict(int) d[key] += value
N, K = mi()
cnt_n = 0
ini_n = K
# while ini_n <= N:
# cnt_n += 1
# ini_n += K
cnt_n = N // K
ans = cnt_n**3
if K % 2 == 0:
ini_k = K // 2
"""
cnt_k = 0
while ini_k <= N:
cnt_k += 1
ini_k += K
ans += cnt_k ** 3
"""
if N >= ini_k:
ans += ((N - ini_k) // K + 1) ** 3
print(ans)
| false | 14.705882 | [
"-while ini_n <= N:",
"- cnt_n += 1",
"- ini_n += K",
"+# while ini_n <= N:",
"+# cnt_n += 1",
"+# ini_n += K",
"+cnt_n = N // K",
"+ \"\"\"",
"- ans += cnt_k**3",
"+ ans += cnt_k ** 3",
"+ \"\"\"",
"+ if N >= ini_k:",
"+ ans += ((N - ini_k) // K + 1) ** 3"
] | false | 0.047048 | 0.046613 | 1.009317 | [
"s874136144",
"s254511398"
] |
u186838327 | p03730 | python | s071866597 | s782353237 | 265 | 60 | 63,980 | 61,908 | Accepted | Accepted | 77.36 | a, b, c = list(map(int,input().split()))
import fractions
g = fractions.gcd(a, b)
if c%g == 0:
print('YES')
else:
print('NO')
| a, b, c = list(map(int, input().split()))
for i in range(1, b+1):
if (a*i)%b == c:
print('YES')
exit()
else:
print('NO')
| 7 | 7 | 134 | 145 | a, b, c = list(map(int, input().split()))
import fractions
g = fractions.gcd(a, b)
if c % g == 0:
print("YES")
else:
print("NO")
| a, b, c = list(map(int, input().split()))
for i in range(1, b + 1):
if (a * i) % b == c:
print("YES")
exit()
else:
print("NO")
| false | 0 | [
"-import fractions",
"-",
"-g = fractions.gcd(a, b)",
"-if c % g == 0:",
"- print(\"YES\")",
"+for i in range(1, b + 1):",
"+ if (a * i) % b == c:",
"+ print(\"YES\")",
"+ exit()"
] | false | 0.047349 | 0.037603 | 1.259169 | [
"s071866597",
"s782353237"
] |
u453634104 | p02596 | python | s790190451 | s459166510 | 400 | 66 | 80,340 | 63,088 | Accepted | Accepted | 83.5 | k = int(eval(input()))
x = 7%k
s = set()
#i = 1
#while len(s) == 0:
for i in range(1, k+1):
if x == 0:
print(i)
exit()
#s.add(x)
x = (x*10+7)%k
#i += 1
print((-1))
| k = int(eval(input()))
x = 7%k
for i in range(1, k+1):
if x == 0:
print(i)
exit()
x = (x*10+7)%k
print((-1))
| 13 | 8 | 184 | 120 | k = int(eval(input()))
x = 7 % k
s = set()
# i = 1
# while len(s) == 0:
for i in range(1, k + 1):
if x == 0:
print(i)
exit()
# s.add(x)
x = (x * 10 + 7) % k
# i += 1
print((-1))
| k = int(eval(input()))
x = 7 % k
for i in range(1, k + 1):
if x == 0:
print(i)
exit()
x = (x * 10 + 7) % k
print((-1))
| false | 38.461538 | [
"-s = set()",
"-# i = 1",
"-# while len(s) == 0:",
"- # s.add(x)",
"- # i += 1"
] | false | 0.102387 | 0.130076 | 0.787133 | [
"s790190451",
"s459166510"
] |
u498487134 | p02911 | python | s738320015 | s157361245 | 539 | 109 | 56,024 | 75,908 | Accepted | Accepted | 79.78 | N,K,Q = list(map(int,input().split()))
A = [int(eval(input())) for _ in range(Q)]
B=[0]*N
for i in range(Q):
B[A[i]-1]+=1
for i in range(N):
if Q-B[i]>=K:
print("No")
else:
print("Yes") | import sys
input = sys.stdin.readline
def I(): return int(eval(input()))
def MI(): return list(map(int, input().split()))
def LI(): return list(map(int, input().split()))
def main():
mod=10**9+7
N,K,Q=MI()
L=[K-Q]*N
for i in range(Q):
a=I()
a-=1
L[a]+=1
for i in range(N):
if L[i]>0:
print("Yes")
else:
print("No")
main()
| 12 | 23 | 214 | 428 | N, K, Q = list(map(int, input().split()))
A = [int(eval(input())) for _ in range(Q)]
B = [0] * N
for i in range(Q):
B[A[i] - 1] += 1
for i in range(N):
if Q - B[i] >= K:
print("No")
else:
print("Yes")
| import sys
input = sys.stdin.readline
def I():
return int(eval(input()))
def MI():
return list(map(int, input().split()))
def LI():
return list(map(int, input().split()))
def main():
mod = 10**9 + 7
N, K, Q = MI()
L = [K - Q] * N
for i in range(Q):
a = I()
a -= 1
L[a] += 1
for i in range(N):
if L[i] > 0:
print("Yes")
else:
print("No")
main()
| false | 47.826087 | [
"-N, K, Q = list(map(int, input().split()))",
"-A = [int(eval(input())) for _ in range(Q)]",
"-B = [0] * N",
"-for i in range(Q):",
"- B[A[i] - 1] += 1",
"-for i in range(N):",
"- if Q - B[i] >= K:",
"- print(\"No\")",
"- else:",
"- print(\"Yes\")",
"+import sys",
"+",
"+input = sys.stdin.readline",
"+",
"+",
"+def I():",
"+ return int(eval(input()))",
"+",
"+",
"+def MI():",
"+ return list(map(int, input().split()))",
"+",
"+",
"+def LI():",
"+ return list(map(int, input().split()))",
"+",
"+",
"+def main():",
"+ mod = 10**9 + 7",
"+ N, K, Q = MI()",
"+ L = [K - Q] * N",
"+ for i in range(Q):",
"+ a = I()",
"+ a -= 1",
"+ L[a] += 1",
"+ for i in range(N):",
"+ if L[i] > 0:",
"+ print(\"Yes\")",
"+ else:",
"+ print(\"No\")",
"+",
"+",
"+main()"
] | false | 0.035527 | 0.053269 | 0.666934 | [
"s738320015",
"s157361245"
] |
u144913062 | p02588 | python | s929986837 | s328962941 | 318 | 186 | 81,116 | 80,320 | Accepted | Accepted | 41.51 | import sys
input = sys.stdin.readline
class BIT2D:
def __init__(self, H, W):
self.H = H
self.W = W
self.data = [[0] * (H+1) for _ in range(W+1)]
def add(self, a, b, x):
a += 1
b += 1
i = a
while i <= self.H:
j = b
while j <= self.W:
self.data[i][j] += x
j += j & -j
i += i & -i
def sum(self, a, b):
a += 1
b += 1
ret = 0
i = a
while i > 0:
j = b
while j > 0:
ret += self.data[i][j]
j -= j & -j
i -= i & -i
return ret
N = int(eval(input()))
A = []
for _ in range(N):
n = input().rstrip()
if '.' not in n:
A.append(int(n) * 10**9)
else:
a, b = n.split('.')
b += '0' * (9 - len(b))
A.append(int(a + b))
ans = 0
bit = BIT2D(100, 100)
for i in range(N):
cnt2 = cnt5 = 0
while A[i] % 2 == 0:
A[i] //= 2
cnt2 += 1
while A[i] % 5 == 0:
A[i] //= 5
cnt5 += 1
if cnt2 >= 18 and cnt5 >= 18:
ans += i
else:
ans += i - bit.sum(99, 17 - cnt5) - bit.sum(17 - cnt2, 99) + bit.sum(17 - cnt2, 17 - cnt5)
bit.add(cnt2, cnt5, 1)
print(ans)
| from collections import defaultdict
import sys
input = sys.stdin.readline
N = int(eval(input()))
A = []
for _ in range(N):
n = input().rstrip()
if '.' not in n:
A.append(int(n) * 10**9)
else:
a, b = n.split('.')
b += '0' * (9 - len(b))
A.append(int(a + b))
cnt = defaultdict(int)
ans = 0
for i in range(N):
cnt2 = cnt5 = 0
while A[i] % 2 == 0:
A[i] //= 2
cnt2 += 1
while A[i] % 5 == 0:
A[i] //= 5
cnt5 += 1
cnt[(cnt2, cnt5)] += 1
for p1, c1 in list(cnt.items()):
for p2, c2 in list(cnt.items()):
if p1 > p2:
continue
if p1[0] + p2[0] >= 18 and p1[1] + p2[1] >= 18:
if p1 == p2:
ans += c1 * (c1 - 1) // 2
else:
ans += c1 * c2
print(ans)
| 59 | 35 | 1,343 | 833 | import sys
input = sys.stdin.readline
class BIT2D:
def __init__(self, H, W):
self.H = H
self.W = W
self.data = [[0] * (H + 1) for _ in range(W + 1)]
def add(self, a, b, x):
a += 1
b += 1
i = a
while i <= self.H:
j = b
while j <= self.W:
self.data[i][j] += x
j += j & -j
i += i & -i
def sum(self, a, b):
a += 1
b += 1
ret = 0
i = a
while i > 0:
j = b
while j > 0:
ret += self.data[i][j]
j -= j & -j
i -= i & -i
return ret
N = int(eval(input()))
A = []
for _ in range(N):
n = input().rstrip()
if "." not in n:
A.append(int(n) * 10**9)
else:
a, b = n.split(".")
b += "0" * (9 - len(b))
A.append(int(a + b))
ans = 0
bit = BIT2D(100, 100)
for i in range(N):
cnt2 = cnt5 = 0
while A[i] % 2 == 0:
A[i] //= 2
cnt2 += 1
while A[i] % 5 == 0:
A[i] //= 5
cnt5 += 1
if cnt2 >= 18 and cnt5 >= 18:
ans += i
else:
ans += (
i
- bit.sum(99, 17 - cnt5)
- bit.sum(17 - cnt2, 99)
+ bit.sum(17 - cnt2, 17 - cnt5)
)
bit.add(cnt2, cnt5, 1)
print(ans)
| from collections import defaultdict
import sys
input = sys.stdin.readline
N = int(eval(input()))
A = []
for _ in range(N):
n = input().rstrip()
if "." not in n:
A.append(int(n) * 10**9)
else:
a, b = n.split(".")
b += "0" * (9 - len(b))
A.append(int(a + b))
cnt = defaultdict(int)
ans = 0
for i in range(N):
cnt2 = cnt5 = 0
while A[i] % 2 == 0:
A[i] //= 2
cnt2 += 1
while A[i] % 5 == 0:
A[i] //= 5
cnt5 += 1
cnt[(cnt2, cnt5)] += 1
for p1, c1 in list(cnt.items()):
for p2, c2 in list(cnt.items()):
if p1 > p2:
continue
if p1[0] + p2[0] >= 18 and p1[1] + p2[1] >= 18:
if p1 == p2:
ans += c1 * (c1 - 1) // 2
else:
ans += c1 * c2
print(ans)
| false | 40.677966 | [
"+from collections import defaultdict",
"-",
"-",
"-class BIT2D:",
"- def __init__(self, H, W):",
"- self.H = H",
"- self.W = W",
"- self.data = [[0] * (H + 1) for _ in range(W + 1)]",
"-",
"- def add(self, a, b, x):",
"- a += 1",
"- b += 1",
"- i = a",
"- while i <= self.H:",
"- j = b",
"- while j <= self.W:",
"- self.data[i][j] += x",
"- j += j & -j",
"- i += i & -i",
"-",
"- def sum(self, a, b):",
"- a += 1",
"- b += 1",
"- ret = 0",
"- i = a",
"- while i > 0:",
"- j = b",
"- while j > 0:",
"- ret += self.data[i][j]",
"- j -= j & -j",
"- i -= i & -i",
"- return ret",
"-",
"-",
"+cnt = defaultdict(int)",
"-bit = BIT2D(100, 100)",
"- if cnt2 >= 18 and cnt5 >= 18:",
"- ans += i",
"- else:",
"- ans += (",
"- i",
"- - bit.sum(99, 17 - cnt5)",
"- - bit.sum(17 - cnt2, 99)",
"- + bit.sum(17 - cnt2, 17 - cnt5)",
"- )",
"- bit.add(cnt2, cnt5, 1)",
"+ cnt[(cnt2, cnt5)] += 1",
"+for p1, c1 in list(cnt.items()):",
"+ for p2, c2 in list(cnt.items()):",
"+ if p1 > p2:",
"+ continue",
"+ if p1[0] + p2[0] >= 18 and p1[1] + p2[1] >= 18:",
"+ if p1 == p2:",
"+ ans += c1 * (c1 - 1) // 2",
"+ else:",
"+ ans += c1 * c2"
] | false | 0.115614 | 0.036235 | 3.19071 | [
"s929986837",
"s328962941"
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.