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 list | 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 list |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
u489959379 | p02898 | python | s139230390 | s749374348 | 54 | 48 | 11,908 | 11,916 | Accepted | Accepted | 11.11 | n,k = list(map(int,input().split()))
h_list = list(int(i) for i in input().split())
cnt = 0
for i in h_list:
if i >= k:
cnt += 1
print(cnt) | import sys
sys.setrecursionlimit(10 ** 7)
f_inf = float('inf')
mod = 10 ** 9 + 7
def resolve():
n, k = list(map(int, input().split()))
H = list(map(int, input().split()))
res = 0
for i in range(n):
if H[i] >= k:
res += 1
print(res)
if __name__ == '__main__':
resolve()
| 7 | 20 | 151 | 332 | n, k = list(map(int, input().split()))
h_list = list(int(i) for i in input().split())
cnt = 0
for i in h_list:
if i >= k:
cnt += 1
print(cnt)
| import sys
sys.setrecursionlimit(10**7)
f_inf = float("inf")
mod = 10**9 + 7
def resolve():
n, k = list(map(int, input().split()))
H = list(map(int, input().split()))
res = 0
for i in range(n):
if H[i] >= k:
res += 1
print(res)
if __name__ == "__main__":
resolve()
| false | 65 | [
"-n, k = list(map(int, input().split()))",
"-h_list = list(int(i) for i in input().split())",
"-cnt = 0",
"-for i in h_list:",
"- if i >= k:",
"- cnt += 1",
"-print(cnt)",
"+import sys",
"+",
"+sys.setrecursionlimit(10**7)",
"+f_inf = float(\"inf\")",
"+mod = 10**9 + 7",
"+",
"+"... | false | 0.039267 | 0.080005 | 0.490807 | [
"s139230390",
"s749374348"
] |
u392319141 | p02726 | python | s819873814 | s942867111 | 1,744 | 286 | 3,444 | 46,812 | Accepted | Accepted | 83.6 | N, X, Y = map(int, input().split())
def dist(fr, to):
return min(
to - fr,
abs(to - Y) + 1 + abs(fr - X),
abs(fr - Y) + 1 + abs(to - X)
)
cnt = [0] * N
ans = 0
for fr in range(1, N + 1):
for to in range(fr + 1, N + 1):
cnt[dist(fr, to)] += 1
print(*(cnt[1:]), sep='\n')
| N, X, Y = map(int, input().split())
ans = [0] * N
for i in range(1, N + 1):
for j in range(i + 1, N + 1):
d = min(
j - i,
abs(i - X) + 1 + abs(j - Y),
abs(j - X) + 1 + abs(i - Y)
)
ans[d] += 1
print(*ans[1:], sep='\n')
| 17 | 13 | 334 | 297 | N, X, Y = map(int, input().split())
def dist(fr, to):
return min(to - fr, abs(to - Y) + 1 + abs(fr - X), abs(fr - Y) + 1 + abs(to - X))
cnt = [0] * N
ans = 0
for fr in range(1, N + 1):
for to in range(fr + 1, N + 1):
cnt[dist(fr, to)] += 1
print(*(cnt[1:]), sep="\n")
| N, X, Y = map(int, input().split())
ans = [0] * N
for i in range(1, N + 1):
for j in range(i + 1, N + 1):
d = min(j - i, abs(i - X) + 1 + abs(j - Y), abs(j - X) + 1 + abs(i - Y))
ans[d] += 1
print(*ans[1:], sep="\n")
| false | 23.529412 | [
"-",
"-",
"-def dist(fr, to):",
"- return min(to - fr, abs(to - Y) + 1 + abs(fr - X), abs(fr - Y) + 1 + abs(to - X))",
"-",
"-",
"-cnt = [0] * N",
"-ans = 0",
"-for fr in range(1, N + 1):",
"- for to in range(fr + 1, N + 1):",
"- cnt[dist(fr, to)] += 1",
"-print(*(cnt[1:]), sep=\"... | false | 0.063111 | 0.046397 | 1.360228 | [
"s819873814",
"s942867111"
] |
u759949288 | p00154 | python | s506315886 | s035629939 | 250 | 120 | 7,392 | 4,472 | Accepted | Accepted | 52 | import sys
def main():
while True:
m = eval(input())
if m == 0: return 0
dp = {}
dp[(0, 0)] = 1
for i in range(m):
v, c = list(map(int, input().split()))
for j in range(1001):
for k in range(c + 1):
key = (i + 1, j + v * k)
dp.setdefault(key, 0)
dp[key] += dp.get((i, j), 0)
n = eval(input())
for i in range(n):
x = eval(input())
print(dp.get((m, x), 0))
if __name__ == '__main__':
sys.exit(main()) | import sys
from array import array
def main():
while True:
m = eval(input())
if m == 0: return 0
dp = [array('I', [0] * 1001) for i in range(m + 1)]
dp[0][0] = 1
for i in range(m):
v, c = list(map(int, input().split()))
for j in range(1001):
for k in range(c + 1):
next = j + v * k
if next > 1000: continue
dp[i + 1][next] += dp[i][j]
n = eval(input())
for i in range(n):
x = eval(input())
print(dp[m][x])
if __name__ == '__main__':
sys.exit(main()) | 22 | 23 | 450 | 502 | import sys
def main():
while True:
m = eval(input())
if m == 0:
return 0
dp = {}
dp[(0, 0)] = 1
for i in range(m):
v, c = list(map(int, input().split()))
for j in range(1001):
for k in range(c + 1):
key = (i + 1, j + v * k)
dp.setdefault(key, 0)
dp[key] += dp.get((i, j), 0)
n = eval(input())
for i in range(n):
x = eval(input())
print(dp.get((m, x), 0))
if __name__ == "__main__":
sys.exit(main())
| import sys
from array import array
def main():
while True:
m = eval(input())
if m == 0:
return 0
dp = [array("I", [0] * 1001) for i in range(m + 1)]
dp[0][0] = 1
for i in range(m):
v, c = list(map(int, input().split()))
for j in range(1001):
for k in range(c + 1):
next = j + v * k
if next > 1000:
continue
dp[i + 1][next] += dp[i][j]
n = eval(input())
for i in range(n):
x = eval(input())
print(dp[m][x])
if __name__ == "__main__":
sys.exit(main())
| false | 4.347826 | [
"+from array import array",
"- dp = {}",
"- dp[(0, 0)] = 1",
"+ dp = [array(\"I\", [0] * 1001) for i in range(m + 1)]",
"+ dp[0][0] = 1",
"- key = (i + 1, j + v * k)",
"- dp.setdefault(key, 0)",
"- dp[key] += dp.get((... | false | 0.203423 | 0.176885 | 1.15003 | [
"s506315886",
"s035629939"
] |
u989345508 | p02665 | python | s011920053 | s740875686 | 87 | 78 | 19,988 | 19,972 | Accepted | Accepted | 10.34 | n,*a=map(int,open(0).read().split());t=sum(a);v=w=1
for q in a:
if(w:=min(2*(w-q),t:=t-q))<0:exit(print(-1))
v+=w
print(v)
| n,*a=map(int,open(0).read().split());t=sum(a);v=w=1
print(sum([1]+[exit(print(-1)) if(w:=min(2*(w-q),t:=t-q))<0 else w for q in a]))
| 5 | 2 | 130 | 133 | n, *a = map(int, open(0).read().split())
t = sum(a)
v = w = 1
for q in a:
if (w := min(2 * (w - q), t := t - q)) < 0:
exit(print(-1))
v += w
print(v)
| n, *a = map(int, open(0).read().split())
t = sum(a)
v = w = 1
print(
sum(
[1]
+ [exit(print(-1)) if (w := min(2 * (w - q), t := t - q)) < 0 else w for q in a]
)
)
| false | 60 | [
"-for q in a:",
"- if (w := min(2 * (w - q), t := t - q)) < 0:",
"- exit(print(-1))",
"- v += w",
"-print(v)",
"+print(",
"+ sum(",
"+ [1]",
"+ + [exit(print(-1)) if (w := min(2 * (w - q), t := t - q)) < 0 else w for q in a]",
"+ )",
"+)"
] | false | 0.167456 | 0.113398 | 1.476721 | [
"s011920053",
"s740875686"
] |
u649887106 | p03448 | python | s476025723 | s573678858 | 66 | 18 | 3,064 | 3,060 | Accepted | Accepted | 72.73 | A, B, C, X = [int(eval(input())) for _ in range (4)]
ans = 0
for i in range(A+1):
if 500 * i > X:
break
for j in range(B+1):
if 500 * i + 100 * j > X:
break
for k in range(C+1):
if 500 * i + 100 * j + 50 * k > X:
break
if 500 * i + 100 * j + 50 * k == X:
ans += 1
print(ans) | A, B, C, X = [int(eval(input())) for _ in range(4)]
ans = 0
for i in range(A+1):
if 500*i > X:
break
for j in range(B+1):
if 500*i + 100*j > X:
break
if X - 500*i - 100*j <= 50*C:
ans += 1
print(ans) | 16 | 13 | 385 | 263 | A, B, C, X = [int(eval(input())) for _ in range(4)]
ans = 0
for i in range(A + 1):
if 500 * i > X:
break
for j in range(B + 1):
if 500 * i + 100 * j > X:
break
for k in range(C + 1):
if 500 * i + 100 * j + 50 * k > X:
break
if 500 * i + 100 * j + 50 * k == X:
ans += 1
print(ans)
| A, B, C, X = [int(eval(input())) for _ in range(4)]
ans = 0
for i in range(A + 1):
if 500 * i > X:
break
for j in range(B + 1):
if 500 * i + 100 * j > X:
break
if X - 500 * i - 100 * j <= 50 * C:
ans += 1
print(ans)
| false | 18.75 | [
"- for k in range(C + 1):",
"- if 500 * i + 100 * j + 50 * k > X:",
"- break",
"- if 500 * i + 100 * j + 50 * k == X:",
"- ans += 1",
"+ if X - 500 * i - 100 * j <= 50 * C:",
"+ ans += 1"
] | false | 0.054182 | 0.045508 | 1.190597 | [
"s476025723",
"s573678858"
] |
u283869437 | p03027 | python | s153544679 | s985115982 | 1,377 | 552 | 94,188 | 108,908 | Accepted | Accepted | 59.91 | p,M,f=pow,1000003,[1]
for i in range(1,M):f.append(f[i-1]*i%M)
for _ in'_'*int(eval(input())):x,d,n=list(map(int,input().split()));t=x*p(d,M-2,M)%M;print(([p(x,n,M),M//(t+n)*t and f[t+n-1]*p(f[t-1],M-2,M)*p(d,n,M)%M][d>0])) | p,M,f=pow,1000003,[1]
for i in range(1,M):f.append(f[i-1]*i%M)
for _ in'_'*eval(input()):x,d,n=list(map(int,input().split()));t=x*p(d,M-2,M)%M;print(([p(x,n,M),M/(t+n)*t and f[t+n-1]*p(f[t-1],M-2,M)*p(d,n,M)%M][d>0])) | 3 | 3 | 211 | 209 | p, M, f = pow, 1000003, [1]
for i in range(1, M):
f.append(f[i - 1] * i % M)
for _ in "_" * int(eval(input())):
x, d, n = list(map(int, input().split()))
t = x * p(d, M - 2, M) % M
print(
(
[
p(x, n, M),
M // (t + n) * t
and f[t + n - 1] * p(f[t - 1], M - 2, M) * p(d, n, M) % M,
][d > 0]
)
)
| p, M, f = pow, 1000003, [1]
for i in range(1, M):
f.append(f[i - 1] * i % M)
for _ in "_" * eval(input()):
x, d, n = list(map(int, input().split()))
t = x * p(d, M - 2, M) % M
print(
(
[
p(x, n, M),
M / (t + n) * t
and f[t + n - 1] * p(f[t - 1], M - 2, M) * p(d, n, M) % M,
][d > 0]
)
)
| false | 0 | [
"-for _ in \"_\" * int(eval(input())):",
"+for _ in \"_\" * eval(input()):",
"- M // (t + n) * t",
"+ M / (t + n) * t"
] | false | 0.779975 | 0.654506 | 1.191701 | [
"s153544679",
"s985115982"
] |
u547492399 | p02414 | python | s807901791 | s580174004 | 320 | 280 | 9,076 | 9,084 | Accepted | Accepted | 12.5 | n, m, l = list(map(int, input().split()))
a = [0]*n
b = [0]*m
c = [[0 for col in range(l)] for row in range(n)]
for i in range(n):
a[i] = list(map(int,input().split()))
for i in range(m):
b[i] = list(map(int,input().split()))
for i in range(n):
for j in range(l):
c[i][j] = sum([a[i][k]*b[k][j] for k in range(m)])
# for k in range(m):
# c[i][j] += a[i][k]*b[k][j]
print((*c[i])) | n, m, l = list(map(int, input().split()))
a = [0]*n
b = [0]*m
c = [[0 for col in range(l)] for row in range(n)]
for i in range(n):
a[i] = list(map(int,input().split()))
for i in range(m):
b[i] = list(map(int,input().split()))
#for i in range(n):
# for j in range(l):
# for k in range(m):
# c[i][j] += a[i][k]*b[k][j]
for i in range(n):
c[i] = [sum([a[i][k]*b[k][j] for k in range(m)]) for j in range(l)]
print((*c[i])) | 19 | 19 | 442 | 475 | n, m, l = list(map(int, input().split()))
a = [0] * n
b = [0] * m
c = [[0 for col in range(l)] for row in range(n)]
for i in range(n):
a[i] = list(map(int, input().split()))
for i in range(m):
b[i] = list(map(int, input().split()))
for i in range(n):
for j in range(l):
c[i][j] = sum([a[i][k] * b[k][j] for k in range(m)])
# for k in range(m):
# c[i][j] += a[i][k]*b[k][j]
print((*c[i]))
| n, m, l = list(map(int, input().split()))
a = [0] * n
b = [0] * m
c = [[0 for col in range(l)] for row in range(n)]
for i in range(n):
a[i] = list(map(int, input().split()))
for i in range(m):
b[i] = list(map(int, input().split()))
# for i in range(n):
# for j in range(l):
# for k in range(m):
# c[i][j] += a[i][k]*b[k][j]
for i in range(n):
c[i] = [sum([a[i][k] * b[k][j] for k in range(m)]) for j in range(l)]
print((*c[i]))
| false | 0 | [
"+# for i in range(n):",
"+# for j in range(l):",
"+# for k in range(m):",
"+# c[i][j] += a[i][k]*b[k][j]",
"- for j in range(l):",
"- c[i][j] = sum([a[i][k] * b[k][j] for k in range(m)])",
"- # for k in range(m):",
"- # c[i][j] += a[i][k]*b[k][j]... | false | 0.047172 | 0.04107 | 1.148571 | [
"s807901791",
"s580174004"
] |
u546285759 | p00469 | python | s687155179 | s980270750 | 50 | 30 | 8,164 | 7,964 | Accepted | Accepted | 40 | from itertools import permutations as P
while True:
n, k = int(eval(input())), int(eval(input()))
if k == 0:
break
card = [int(eval(input())) for _ in range(n)]
print((len(set([''.join(map(str, s)) for s in set(P(card, k))])))) | from itertools import permutations as P
while True:
n, k = int(eval(input())), int(eval(input()))
if k == 0:
break
card = [eval(input()) for _ in range(n)]
print((len(set([''.join(s) for s in P(card, k)])))) | 8 | 8 | 239 | 219 | from itertools import permutations as P
while True:
n, k = int(eval(input())), int(eval(input()))
if k == 0:
break
card = [int(eval(input())) for _ in range(n)]
print((len(set(["".join(map(str, s)) for s in set(P(card, k))]))))
| from itertools import permutations as P
while True:
n, k = int(eval(input())), int(eval(input()))
if k == 0:
break
card = [eval(input()) for _ in range(n)]
print((len(set(["".join(s) for s in P(card, k)]))))
| false | 0 | [
"- card = [int(eval(input())) for _ in range(n)]",
"- print((len(set([\"\".join(map(str, s)) for s in set(P(card, k))]))))",
"+ card = [eval(input()) for _ in range(n)]",
"+ print((len(set([\"\".join(s) for s in P(card, k)]))))"
] | false | 0.037312 | 0.082179 | 0.45404 | [
"s687155179",
"s980270750"
] |
u934442292 | p02888 | python | s553270952 | s861241663 | 817 | 562 | 106,908 | 106,164 | Accepted | Accepted | 31.21 | import sys
import numba as nb
input = sys.stdin.readline
@nb.njit("i8(List(i8, reflected=True),i8)", cache=True)
def binary_search(a, key):
"""Meguru type binary search"""
ok = -1
ng = len(a)
def is_ok(a, key, idx):
if a[idx] < key:
return True
else:
return False
while (abs(ok - ng) > 1):
mid = (ok + ng) // 2
if is_ok(a, key, mid):
ok = mid
else:
ng = mid
return ok
@nb.njit("i8(i8,List(i8, reflected=True))", cache=True)
def solve(N, L):
L.sort()
ans = 0
for a in range(N - 2):
for b in range(a + 1, N - 1):
x = binary_search(L, L[a] + L[b])
ans += (x - b)
return ans
def main():
N = int(eval(input()))
L = list(map(int, input().split()))
ans = solve(N, L)
print(ans)
if __name__ == "__main__":
main()
| import sys
import numba as nb
import numpy as np
input = sys.stdin.readline
@nb.njit("i8(i8[:],i8)", cache=True)
def binary_search(a, key):
"""Meguru type binary search"""
ok = -1
ng = len(a)
def is_ok(a, key, idx):
if a[idx] < key:
return True
else:
return False
while (abs(ok - ng) > 1):
mid = (ok + ng) // 2
if is_ok(a, key, mid):
ok = mid
else:
ng = mid
return ok
@nb.njit("i8(i8,i8[:])", cache=True)
def solve(N, L):
L.sort()
ans = 0
for a in range(N - 2):
for b in range(a + 1, N - 1):
x = binary_search(L, L[a] + L[b])
ans += (x - b)
return ans
def main():
N = int(eval(input()))
L = np.array(input().split(), dtype=np.int64)
ans = solve(N, L)
print(ans)
if __name__ == "__main__":
main()
| 51 | 52 | 944 | 936 | import sys
import numba as nb
input = sys.stdin.readline
@nb.njit("i8(List(i8, reflected=True),i8)", cache=True)
def binary_search(a, key):
"""Meguru type binary search"""
ok = -1
ng = len(a)
def is_ok(a, key, idx):
if a[idx] < key:
return True
else:
return False
while abs(ok - ng) > 1:
mid = (ok + ng) // 2
if is_ok(a, key, mid):
ok = mid
else:
ng = mid
return ok
@nb.njit("i8(i8,List(i8, reflected=True))", cache=True)
def solve(N, L):
L.sort()
ans = 0
for a in range(N - 2):
for b in range(a + 1, N - 1):
x = binary_search(L, L[a] + L[b])
ans += x - b
return ans
def main():
N = int(eval(input()))
L = list(map(int, input().split()))
ans = solve(N, L)
print(ans)
if __name__ == "__main__":
main()
| import sys
import numba as nb
import numpy as np
input = sys.stdin.readline
@nb.njit("i8(i8[:],i8)", cache=True)
def binary_search(a, key):
"""Meguru type binary search"""
ok = -1
ng = len(a)
def is_ok(a, key, idx):
if a[idx] < key:
return True
else:
return False
while abs(ok - ng) > 1:
mid = (ok + ng) // 2
if is_ok(a, key, mid):
ok = mid
else:
ng = mid
return ok
@nb.njit("i8(i8,i8[:])", cache=True)
def solve(N, L):
L.sort()
ans = 0
for a in range(N - 2):
for b in range(a + 1, N - 1):
x = binary_search(L, L[a] + L[b])
ans += x - b
return ans
def main():
N = int(eval(input()))
L = np.array(input().split(), dtype=np.int64)
ans = solve(N, L)
print(ans)
if __name__ == "__main__":
main()
| false | 1.923077 | [
"+import numpy as np",
"-@nb.njit(\"i8(List(i8, reflected=True),i8)\", cache=True)",
"+@nb.njit(\"i8(i8[:],i8)\", cache=True)",
"-@nb.njit(\"i8(i8,List(i8, reflected=True))\", cache=True)",
"+@nb.njit(\"i8(i8,i8[:])\", cache=True)",
"- L = list(map(int, input().split()))",
"+ L = np.array(input().... | false | 0.036051 | 0.035682 | 1.010326 | [
"s553270952",
"s861241663"
] |
u934442292 | p03588 | python | s625205282 | s157545291 | 135 | 113 | 10,868 | 3,060 | Accepted | Accepted | 16.3 | import sys
input = sys.stdin.readline
def main():
N = int(eval(input()))
A = [None] * N
B = [None] * N
for i in range(N):
A[i], B[i] = list(map(int, input().split()))
x = max(A)
y = B[A.index(x)]
ans = x + y
print(ans)
if __name__ == "__main__":
main()
| import sys
input = sys.stdin.readline
def main():
N = int(eval(input()))
x = y = 0
for _ in range(N):
A, B = list(map(int, input().split()))
if A > x:
x = A
y = B
ans = x + y
print(ans)
if __name__ == "__main__":
main()
| 21 | 20 | 312 | 297 | import sys
input = sys.stdin.readline
def main():
N = int(eval(input()))
A = [None] * N
B = [None] * N
for i in range(N):
A[i], B[i] = list(map(int, input().split()))
x = max(A)
y = B[A.index(x)]
ans = x + y
print(ans)
if __name__ == "__main__":
main()
| import sys
input = sys.stdin.readline
def main():
N = int(eval(input()))
x = y = 0
for _ in range(N):
A, B = list(map(int, input().split()))
if A > x:
x = A
y = B
ans = x + y
print(ans)
if __name__ == "__main__":
main()
| false | 4.761905 | [
"- A = [None] * N",
"- B = [None] * N",
"- for i in range(N):",
"- A[i], B[i] = list(map(int, input().split()))",
"- x = max(A)",
"- y = B[A.index(x)]",
"+ x = y = 0",
"+ for _ in range(N):",
"+ A, B = list(map(int, input().split()))",
"+ if A > x:",
"+ ... | false | 0.048147 | 0.04879 | 0.986803 | [
"s625205282",
"s157545291"
] |
u608241985 | p02614 | python | s629063247 | s311777264 | 136 | 68 | 9,344 | 9,196 | Accepted | Accepted | 50 | from copy import deepcopy as dc
h, w, k = list(map(int, input().split()))
c = [list(eval(input())) for _ in range(h)]
ans = 0
for h_i in range(2 ** h):
temp = dc(c)
for h_j in range(h):
if (h_i >> h_j) & 1:
temp[h_j] = ["+"] * w
for w_i in range(2 ** w):
temp2 = dc(temp)
for w_j in range(w):
if (w_i >> w_j) & 1:
for i in range(h):
temp2[i][w_j] = "+"
temp_ans = 0
for i in range(h):
temp_ans = temp_ans + "".join(temp2[i]).count("#")
if temp_ans == k:
ans = ans + 1
print(ans) | from itertools import product as pd
h, w, k = list(map(int, input().split()))
c = [list(eval(input())) for _ in range(h)]
ans = 0
for i, j in pd(list(range(1 << h)), list(range(1 << w))):
temp = 0
for x, y in pd(list(range(h)), list(range(w))):
if 1 << x & i and 1 << y & j:
if c[x][y] == "#":
temp += 1
ans += temp == k
print(ans) | 23 | 14 | 634 | 358 | from copy import deepcopy as dc
h, w, k = list(map(int, input().split()))
c = [list(eval(input())) for _ in range(h)]
ans = 0
for h_i in range(2**h):
temp = dc(c)
for h_j in range(h):
if (h_i >> h_j) & 1:
temp[h_j] = ["+"] * w
for w_i in range(2**w):
temp2 = dc(temp)
for w_j in range(w):
if (w_i >> w_j) & 1:
for i in range(h):
temp2[i][w_j] = "+"
temp_ans = 0
for i in range(h):
temp_ans = temp_ans + "".join(temp2[i]).count("#")
if temp_ans == k:
ans = ans + 1
print(ans)
| from itertools import product as pd
h, w, k = list(map(int, input().split()))
c = [list(eval(input())) for _ in range(h)]
ans = 0
for i, j in pd(list(range(1 << h)), list(range(1 << w))):
temp = 0
for x, y in pd(list(range(h)), list(range(w))):
if 1 << x & i and 1 << y & j:
if c[x][y] == "#":
temp += 1
ans += temp == k
print(ans)
| false | 39.130435 | [
"-from copy import deepcopy as dc",
"+from itertools import product as pd",
"-for h_i in range(2**h):",
"- temp = dc(c)",
"- for h_j in range(h):",
"- if (h_i >> h_j) & 1:",
"- temp[h_j] = [\"+\"] * w",
"- for w_i in range(2**w):",
"- temp2 = dc(temp)",
"- ... | false | 0.08089 | 0.037174 | 2.175999 | [
"s629063247",
"s311777264"
] |
u478870821 | p03334 | python | s283026241 | s681424457 | 1,553 | 396 | 21,612 | 21,696 | Accepted | Accepted | 74.5 | from sys import exit, setrecursionlimit, stderr
from functools import reduce
from itertools import *
from collections import defaultdict
from bisect import bisect
def read():
return int(eval(input()))
def reads():
return [int(x) for x in input().split()]
N, D1, D2 = reads()
NN = 2 * N
def deg(x):
return next(i for i in count() if x >> i & 1 == 1)
def group(x, y, d):
p = deg(d)
hp = p >> 1
if p & 1 == 0:
return (x >> hp & 1) ^ (y >> hp & 1)
else:
return x >> hp & 1
pts = [(x, y) for x in range(NN) for y in range(NN) if group(x, y, D1) == 0 and group(x, y, D2) == 0]
for x, y in pts[:N**2]:
print((x, y))
| from sys import exit, setrecursionlimit, stderr
from functools import reduce
from itertools import *
from collections import defaultdict
from bisect import bisect
def read():
return int(eval(input()))
def reads():
return [int(x) for x in input().split()]
N, D1, D2 = reads()
NN = 2 * N
def deg(x):
return next(i for i in count() if x >> i & 1 == 1)
p1 = deg(D1)
p2 = deg(D2)
def group(x, y, p):
hp = p >> 1
if p & 1 == 0:
return (x >> hp & 1) ^ (y >> hp & 1)
else:
return x >> hp & 1
pts = [(x, y) for x in range(NN) for y in range(NN) if group(x, y, p1) == 0 and group(x, y, p2) == 0]
for x, y in pts[:N**2]:
print((x, y))
| 29 | 31 | 659 | 675 | from sys import exit, setrecursionlimit, stderr
from functools import reduce
from itertools import *
from collections import defaultdict
from bisect import bisect
def read():
return int(eval(input()))
def reads():
return [int(x) for x in input().split()]
N, D1, D2 = reads()
NN = 2 * N
def deg(x):
return next(i for i in count() if x >> i & 1 == 1)
def group(x, y, d):
p = deg(d)
hp = p >> 1
if p & 1 == 0:
return (x >> hp & 1) ^ (y >> hp & 1)
else:
return x >> hp & 1
pts = [
(x, y)
for x in range(NN)
for y in range(NN)
if group(x, y, D1) == 0 and group(x, y, D2) == 0
]
for x, y in pts[: N**2]:
print((x, y))
| from sys import exit, setrecursionlimit, stderr
from functools import reduce
from itertools import *
from collections import defaultdict
from bisect import bisect
def read():
return int(eval(input()))
def reads():
return [int(x) for x in input().split()]
N, D1, D2 = reads()
NN = 2 * N
def deg(x):
return next(i for i in count() if x >> i & 1 == 1)
p1 = deg(D1)
p2 = deg(D2)
def group(x, y, p):
hp = p >> 1
if p & 1 == 0:
return (x >> hp & 1) ^ (y >> hp & 1)
else:
return x >> hp & 1
pts = [
(x, y)
for x in range(NN)
for y in range(NN)
if group(x, y, p1) == 0 and group(x, y, p2) == 0
]
for x, y in pts[: N**2]:
print((x, y))
| false | 6.451613 | [
"-def group(x, y, d):",
"- p = deg(d)",
"+p1 = deg(D1)",
"+p2 = deg(D2)",
"+",
"+",
"+def group(x, y, p):",
"- if group(x, y, D1) == 0 and group(x, y, D2) == 0",
"+ if group(x, y, p1) == 0 and group(x, y, p2) == 0"
] | false | 0.040608 | 0.041395 | 0.981009 | [
"s283026241",
"s681424457"
] |
u754022296 | p03880 | python | s392739677 | s235402712 | 488 | 252 | 7,072 | 24,656 | Accepted | Accepted | 48.36 | n = int(eval(input()))
A = [int(eval(input())) for _ in range(n)]
m = 30
C = [False]*m
x = 0
for a in A:
x ^= a
for i in range(m):
if a>>i & 1:
C[i] = True
break
total = 0
ans = 0
for i in range(m-1, -1, -1):
if (x>>i & 1) ^ total:
if C[i]:
ans += 1
total ^= 1
else:
print((-1))
break
else:
print(ans) | import sys
input = sys.stdin.readline
read = sys.stdin.read
import numpy as np
n = int(eval(input()))
A = np.array(read().split(), dtype=np.int64)
m = 30
C = np.zeros(m, dtype=bool)
used = np.zeros(n, dtype=bool)
x = 0
for a in A:
x ^= a
for i in range(m):
idx = np.where(A>>i & 1)
if np.any(~used[idx]):
C[i] = True
used[idx] = True
total = 0
ans = 0
for i in range(m-1, -1, -1):
if (x>>i & 1) ^ total:
if C[i]:
ans += 1
total ^= 1
else:
print((-1))
break
else:
print(ans) | 23 | 30 | 365 | 543 | n = int(eval(input()))
A = [int(eval(input())) for _ in range(n)]
m = 30
C = [False] * m
x = 0
for a in A:
x ^= a
for i in range(m):
if a >> i & 1:
C[i] = True
break
total = 0
ans = 0
for i in range(m - 1, -1, -1):
if (x >> i & 1) ^ total:
if C[i]:
ans += 1
total ^= 1
else:
print((-1))
break
else:
print(ans)
| import sys
input = sys.stdin.readline
read = sys.stdin.read
import numpy as np
n = int(eval(input()))
A = np.array(read().split(), dtype=np.int64)
m = 30
C = np.zeros(m, dtype=bool)
used = np.zeros(n, dtype=bool)
x = 0
for a in A:
x ^= a
for i in range(m):
idx = np.where(A >> i & 1)
if np.any(~used[idx]):
C[i] = True
used[idx] = True
total = 0
ans = 0
for i in range(m - 1, -1, -1):
if (x >> i & 1) ^ total:
if C[i]:
ans += 1
total ^= 1
else:
print((-1))
break
else:
print(ans)
| false | 23.333333 | [
"+import sys",
"+",
"+input = sys.stdin.readline",
"+read = sys.stdin.read",
"+import numpy as np",
"+",
"-A = [int(eval(input())) for _ in range(n)]",
"+A = np.array(read().split(), dtype=np.int64)",
"-C = [False] * m",
"+C = np.zeros(m, dtype=bool)",
"+used = np.zeros(n, dtype=bool)",
"- ... | false | 0.064419 | 0.420737 | 0.15311 | [
"s392739677",
"s235402712"
] |
u163421511 | p03971 | python | s995993127 | s837816052 | 138 | 64 | 76,132 | 9,836 | Accepted | Accepted | 53.62 | N, A, B = list(map(int, input().split()))
S = eval(input())
a_cnt = 0
b_cnt = 0
for i in range(N):
if S[i] == "a":
if a_cnt + b_cnt < A + B:
print("Yes")
a_cnt += 1
else:
print("No")
elif S[i] == "b":
if a_cnt + b_cnt < A + B and b_cnt < B:
print("Yes")
b_cnt += 1
else:
print("No")
else:
print("No") | N, A, B = list(map(int, input().split()))
S = eval(input())
J = ""
a_cnt = 0
b_cnt = 0
for i in range(N):
if S[i] == "a":
if a_cnt + b_cnt < A + B:
J += "Yes\n"
a_cnt += 1
else:
J += "No\n"
elif S[i] == "b":
if a_cnt + b_cnt < A + B and b_cnt < B:
J += "Yes\n"
b_cnt += 1
else:
J += "No\n"
else:
J += "No\n"
print(J) | 21 | 24 | 434 | 454 | N, A, B = list(map(int, input().split()))
S = eval(input())
a_cnt = 0
b_cnt = 0
for i in range(N):
if S[i] == "a":
if a_cnt + b_cnt < A + B:
print("Yes")
a_cnt += 1
else:
print("No")
elif S[i] == "b":
if a_cnt + b_cnt < A + B and b_cnt < B:
print("Yes")
b_cnt += 1
else:
print("No")
else:
print("No")
| N, A, B = list(map(int, input().split()))
S = eval(input())
J = ""
a_cnt = 0
b_cnt = 0
for i in range(N):
if S[i] == "a":
if a_cnt + b_cnt < A + B:
J += "Yes\n"
a_cnt += 1
else:
J += "No\n"
elif S[i] == "b":
if a_cnt + b_cnt < A + B and b_cnt < B:
J += "Yes\n"
b_cnt += 1
else:
J += "No\n"
else:
J += "No\n"
print(J)
| false | 12.5 | [
"+J = \"\"",
"- print(\"Yes\")",
"+ J += \"Yes\\n\"",
"- print(\"No\")",
"+ J += \"No\\n\"",
"- print(\"Yes\")",
"+ J += \"Yes\\n\"",
"- print(\"No\")",
"+ J += \"No\\n\"",
"- print(\"No\")",
"+ ... | false | 0.036389 | 0.044548 | 0.816852 | [
"s995993127",
"s837816052"
] |
u097216046 | p03246 | python | s899620356 | s594239114 | 93 | 79 | 18,656 | 14,268 | Accepted | Accepted | 15.05 | from collections import Counter
size = int(input())
ary = list(map(int, input().split()))
even, odd = Counter(ary[::2]), Counter(ary[1::2])
even[0], odd[0] = 0, 0
(e, em), (_, es) = even.most_common(2)
(o, om), (_, os) = odd.most_common(2)
print(size - max(em + os, es + om)) if e == o else print(size - em - om)
| def solve(size=int(eval(input())), ary=list(map(int, input().split())), max_range=100001):
even = [0 for _ in range(max_range)]
odd = [0 for _ in range(max_range)]
(em, ei), (om, oi) = (0, 0), (0, 0)
for i in range(size):
if i % 2 == 0:
even[ary[i]] += 1
if even[ary[i]] > em:
em, ei = even[ary[i]], ary[i]
else:
odd[ary[i]] += 1
if odd[ary[i]] > om:
om, oi = odd[ary[i]], ary[i]
if ei == oi:
even[ei], odd[oi] = 0, 0
return size - max(max(even) + om, max(odd) + em)
else:
return size - (em + om)
print((solve())) | 8 | 23 | 319 | 675 | from collections import Counter
size = int(input())
ary = list(map(int, input().split()))
even, odd = Counter(ary[::2]), Counter(ary[1::2])
even[0], odd[0] = 0, 0
(e, em), (_, es) = even.most_common(2)
(o, om), (_, os) = odd.most_common(2)
print(size - max(em + os, es + om)) if e == o else print(size - em - om)
| def solve(
size=int(eval(input())), ary=list(map(int, input().split())), max_range=100001
):
even = [0 for _ in range(max_range)]
odd = [0 for _ in range(max_range)]
(em, ei), (om, oi) = (0, 0), (0, 0)
for i in range(size):
if i % 2 == 0:
even[ary[i]] += 1
if even[ary[i]] > em:
em, ei = even[ary[i]], ary[i]
else:
odd[ary[i]] += 1
if odd[ary[i]] > om:
om, oi = odd[ary[i]], ary[i]
if ei == oi:
even[ei], odd[oi] = 0, 0
return size - max(max(even) + om, max(odd) + em)
else:
return size - (em + om)
print((solve()))
| false | 65.217391 | [
"-from collections import Counter",
"+def solve(",
"+ size=int(eval(input())), ary=list(map(int, input().split())), max_range=100001",
"+):",
"+ even = [0 for _ in range(max_range)]",
"+ odd = [0 for _ in range(max_range)]",
"+ (em, ei), (om, oi) = (0, 0), (0, 0)",
"+ for i in range(siz... | false | 0.106858 | 0.052551 | 2.033413 | [
"s899620356",
"s594239114"
] |
u724687935 | p02629 | python | s959613606 | s630284681 | 73 | 30 | 61,756 | 9,216 | Accepted | Accepted | 58.9 | N = int(eval(input()))
# 桁数を決める
tmp = 0
digit = 1
tmp += pow(26, digit)
while N > tmp:
digit += 1
tmp += pow(26, digit)
order = N - (tmp - pow(26, digit)) - 1
X = [0] * digit
cur = digit - 1
while order > 0:
X[cur] = order % 26
order //= 26
cur -= 1
# X = list(reversed(X))
# print(X)
a = ord('a')
ans = []
for x in X:
c = chr(a + x)
ans.append(c)
print((''.join(ans)))
| N = int(eval(input()))
# 桁数を決める
digit = 1 # 桁数
num = pow(26, digit) # その桁数での最大番号
while num < N:
digit += 1
num += pow(26, digit)
# その桁数内でのNの順番を0-indexで求める.
# (つまり, 2桁であれば'aa' -> 0, 'zz' -> 675 となる.)
order = N - (num - pow(26, digit)) - 1
# orderを26進数表記する.
# 例えば, 3桁でorder=28のとき, X = [0, 1, 2]
X = [0] * digit
cur = digit - 1
while order > 0:
X[cur] = order % 26
order //= 26
cur -= 1
# 各桁の文字は'a' + Xiとなる
ans = []
a = ord('a')
for x in X:
c = chr(a + x)
ans.append(c)
print((''.join(ans))) | 28 | 30 | 422 | 543 | N = int(eval(input()))
# 桁数を決める
tmp = 0
digit = 1
tmp += pow(26, digit)
while N > tmp:
digit += 1
tmp += pow(26, digit)
order = N - (tmp - pow(26, digit)) - 1
X = [0] * digit
cur = digit - 1
while order > 0:
X[cur] = order % 26
order //= 26
cur -= 1
# X = list(reversed(X))
# print(X)
a = ord("a")
ans = []
for x in X:
c = chr(a + x)
ans.append(c)
print(("".join(ans)))
| N = int(eval(input()))
# 桁数を決める
digit = 1 # 桁数
num = pow(26, digit) # その桁数での最大番号
while num < N:
digit += 1
num += pow(26, digit)
# その桁数内でのNの順番を0-indexで求める.
# (つまり, 2桁であれば'aa' -> 0, 'zz' -> 675 となる.)
order = N - (num - pow(26, digit)) - 1
# orderを26進数表記する.
# 例えば, 3桁でorder=28のとき, X = [0, 1, 2]
X = [0] * digit
cur = digit - 1
while order > 0:
X[cur] = order % 26
order //= 26
cur -= 1
# 各桁の文字は'a' + Xiとなる
ans = []
a = ord("a")
for x in X:
c = chr(a + x)
ans.append(c)
print(("".join(ans)))
| false | 6.666667 | [
"-tmp = 0",
"-digit = 1",
"-tmp += pow(26, digit)",
"-while N > tmp:",
"+digit = 1 # 桁数",
"+num = pow(26, digit) # その桁数での最大番号",
"+while num < N:",
"- tmp += pow(26, digit)",
"-order = N - (tmp - pow(26, digit)) - 1",
"+ num += pow(26, digit)",
"+# その桁数内でのNの順番を0-indexで求める.",
"+# (つまり, 2... | false | 0.056906 | 0.034996 | 1.626077 | [
"s959613606",
"s630284681"
] |
u124498235 | p02695 | python | s837159885 | s697774690 | 622 | 385 | 9,136 | 10,828 | Accepted | Accepted | 38.1 | import itertools
n, m, q = list(map(int, input().split()))
a,b,c,d = [],[],[],[]
for i in range(q):
A,B,C,D = list(map(int, input().split()))
a.append(A)
b.append(B)
c.append(C)
d.append(D)
e = [i+1 for i in range(m)]
ans = 0
for i in itertools.combinations_with_replacement(e,n-1):
f = list(i)
f.append(1)
f.sort()
w = 0
for j in range(q):
if f[b[j]-1]-f[a[j]-1] == c[j]:
w += d[j]
ans = max(ans,w)
print (ans)
| n, m, q = list(map(int, input().split()))
query = []
for i in range(q):
query.append(list(map(int, input().split())))
v = []
def dfs(u,ary):
if len(ary) == n:
ary.sort()
cnt = 0
for j in range(q):
a,b,c,d = query[j]
if ary[b-1] - ary[a-1] == c:
cnt += d
v.append(cnt)
else:
for j in range(u,m+1):
dfs(j,ary+[j])
dfs(1,[1])
print((max(v))) | 21 | 23 | 436 | 383 | import itertools
n, m, q = list(map(int, input().split()))
a, b, c, d = [], [], [], []
for i in range(q):
A, B, C, D = list(map(int, input().split()))
a.append(A)
b.append(B)
c.append(C)
d.append(D)
e = [i + 1 for i in range(m)]
ans = 0
for i in itertools.combinations_with_replacement(e, n - 1):
f = list(i)
f.append(1)
f.sort()
w = 0
for j in range(q):
if f[b[j] - 1] - f[a[j] - 1] == c[j]:
w += d[j]
ans = max(ans, w)
print(ans)
| n, m, q = list(map(int, input().split()))
query = []
for i in range(q):
query.append(list(map(int, input().split())))
v = []
def dfs(u, ary):
if len(ary) == n:
ary.sort()
cnt = 0
for j in range(q):
a, b, c, d = query[j]
if ary[b - 1] - ary[a - 1] == c:
cnt += d
v.append(cnt)
else:
for j in range(u, m + 1):
dfs(j, ary + [j])
dfs(1, [1])
print((max(v)))
| false | 8.695652 | [
"-import itertools",
"+n, m, q = list(map(int, input().split()))",
"+query = []",
"+for i in range(q):",
"+ query.append(list(map(int, input().split())))",
"+v = []",
"-n, m, q = list(map(int, input().split()))",
"-a, b, c, d = [], [], [], []",
"-for i in range(q):",
"- A, B, C, D = list(map... | false | 0.062524 | 0.081259 | 0.769438 | [
"s837159885",
"s697774690"
] |
u735335967 | p02773 | python | s162216524 | s188459087 | 813 | 645 | 57,940 | 24,744 | Accepted | Accepted | 20.66 | import collections
n = int(eval(input()))
s = collections.Counter([eval(input()) for i in range(n)])
values, counts = list(zip(*s.most_common()))
len = counts.count(max(counts))
values = sorted(values[:len])
for i in range(len):
print((values[i]))
| n = int(eval(input()))
s = sorted([eval(input()) for i in range(n)])
c = [1]*n
for i in range(n-1):
if s[i] == s[i+1]:
c[i+1] += c[i]
m = max(c)
for i in range(n):
if c[i] == m:
print((s[i]))
| 11 | 12 | 245 | 215 | import collections
n = int(eval(input()))
s = collections.Counter([eval(input()) for i in range(n)])
values, counts = list(zip(*s.most_common()))
len = counts.count(max(counts))
values = sorted(values[:len])
for i in range(len):
print((values[i]))
| n = int(eval(input()))
s = sorted([eval(input()) for i in range(n)])
c = [1] * n
for i in range(n - 1):
if s[i] == s[i + 1]:
c[i + 1] += c[i]
m = max(c)
for i in range(n):
if c[i] == m:
print((s[i]))
| false | 8.333333 | [
"-import collections",
"-",
"-s = collections.Counter([eval(input()) for i in range(n)])",
"-values, counts = list(zip(*s.most_common()))",
"-len = counts.count(max(counts))",
"-values = sorted(values[:len])",
"-for i in range(len):",
"- print((values[i]))",
"+s = sorted([eval(input()) for i in r... | false | 0.037653 | 0.036625 | 1.028072 | [
"s162216524",
"s188459087"
] |
u548545174 | p02681 | python | s603081221 | s740376234 | 22 | 20 | 9,096 | 9,024 | Accepted | Accepted | 9.09 | S = eval(input())
T = eval(input())
if S == T[:-1] and len(T) == len(S) + 1:
print("Yes")
else:
print("No") | S = eval(input())
T = eval(input())
print(("Yes" if S == T[:-1] else "No"))
| 7 | 4 | 110 | 66 | S = eval(input())
T = eval(input())
if S == T[:-1] and len(T) == len(S) + 1:
print("Yes")
else:
print("No")
| S = eval(input())
T = eval(input())
print(("Yes" if S == T[:-1] else "No"))
| false | 42.857143 | [
"-if S == T[:-1] and len(T) == len(S) + 1:",
"- print(\"Yes\")",
"-else:",
"- print(\"No\")",
"+print((\"Yes\" if S == T[:-1] else \"No\"))"
] | false | 0.0381 | 0.040179 | 0.948254 | [
"s603081221",
"s740376234"
] |
u237299453 | p02628 | python | s139359984 | s921462704 | 47 | 40 | 9,188 | 9,116 | Accepted | Accepted | 14.89 | a = list(map(int, input().split()))
b = list(map(int, input().split()))
count = 0
result = []
while count < a[1]:
result.append(min(b))
b.remove(min(b))
count += 1
print((sum(result))) | n, k = list(map(int,input().split()))
p = list(map(int, input().split()))
ans = 0
for _ in range(k):
m = min(p)
ans += m
p.remove(m)
print(ans) | 11 | 9 | 202 | 154 | a = list(map(int, input().split()))
b = list(map(int, input().split()))
count = 0
result = []
while count < a[1]:
result.append(min(b))
b.remove(min(b))
count += 1
print((sum(result)))
| n, k = list(map(int, input().split()))
p = list(map(int, input().split()))
ans = 0
for _ in range(k):
m = min(p)
ans += m
p.remove(m)
print(ans)
| false | 18.181818 | [
"-a = list(map(int, input().split()))",
"-b = list(map(int, input().split()))",
"-count = 0",
"-result = []",
"-while count < a[1]:",
"- result.append(min(b))",
"- b.remove(min(b))",
"- count += 1",
"-print((sum(result)))",
"+n, k = list(map(int, input().split()))",
"+p = list(map(int, ... | false | 0.044884 | 0.045314 | 0.990515 | [
"s139359984",
"s921462704"
] |
u597374218 | p02627 | python | s239905071 | s216103202 | 33 | 27 | 9,024 | 9,028 | Accepted | Accepted | 18.18 | a=eval(input())
print(("A" if 65<=ord(a)<=90 else "a")) | a = eval(input())
if a in "ABCDEFGHIJKLMNOPQRSTUVWXYZ":
print("A")
else:
print("a") | 2 | 5 | 48 | 89 | a = eval(input())
print(("A" if 65 <= ord(a) <= 90 else "a"))
| a = eval(input())
if a in "ABCDEFGHIJKLMNOPQRSTUVWXYZ":
print("A")
else:
print("a")
| false | 60 | [
"-print((\"A\" if 65 <= ord(a) <= 90 else \"a\"))",
"+if a in \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\":",
"+ print(\"A\")",
"+else:",
"+ print(\"a\")"
] | false | 0.048009 | 0.125043 | 0.383938 | [
"s239905071",
"s216103202"
] |
u127499732 | p02873 | python | s513438250 | s287641990 | 293 | 207 | 11,676 | 12,316 | Accepted | Accepted | 29.35 | from itertools import groupby
s = list(eval(input()))
f = 0
ans = 0
for k,v in groupby(s):
d = len(list(v))
left = d if k==">" else 0
right = d if k=="<" else 0
if f>left:
ans += d*(d+1)//2 - left
else:
ans += -1*f + d*(d+1)//2
f = right
print(ans) |
def main():
from itertools import groupby
s = list(eval(input()))
f = 0
ans = 0
for k,v in groupby(s):
d = len(tuple(v))
left = d if k==">" else 0
right = d if k=="<" else 0
if f>left:
ans += d*(d+1)//2 - left
else:
ans += -1*f + d*(d+1)//2
f = right
print(ans)
if __name__ == '__main__':
main() | 15 | 22 | 281 | 371 | from itertools import groupby
s = list(eval(input()))
f = 0
ans = 0
for k, v in groupby(s):
d = len(list(v))
left = d if k == ">" else 0
right = d if k == "<" else 0
if f > left:
ans += d * (d + 1) // 2 - left
else:
ans += -1 * f + d * (d + 1) // 2
f = right
print(ans)
| def main():
from itertools import groupby
s = list(eval(input()))
f = 0
ans = 0
for k, v in groupby(s):
d = len(tuple(v))
left = d if k == ">" else 0
right = d if k == "<" else 0
if f > left:
ans += d * (d + 1) // 2 - left
else:
ans += -1 * f + d * (d + 1) // 2
f = right
print(ans)
if __name__ == "__main__":
main()
| false | 31.818182 | [
"-from itertools import groupby",
"+def main():",
"+ from itertools import groupby",
"-s = list(eval(input()))",
"-f = 0",
"-ans = 0",
"-for k, v in groupby(s):",
"- d = len(list(v))",
"- left = d if k == \">\" else 0",
"- right = d if k == \"<\" else 0",
"- if f > left:",
"- ... | false | 0.036574 | 0.046823 | 0.7811 | [
"s513438250",
"s287641990"
] |
u864197622 | p02649 | python | s769212318 | s000885444 | 909 | 749 | 68,880 | 68,724 | Accepted | Accepted | 17.6 | def popcount_parity(x):
for i in range(8):
x ^= x >> (1 << i)
return -1 if x & 1 else 1
N, K, S, T = list(map(int, input().split()))
if S & T != S:
print((0))
exit()
C = [[1]]
CC = [0] * 51
for i in range(1, 51):
C.append([1] * (i + 1))
for j in range(1, i):
C[i][j] = C[i-1][j-1] + C[i-1][j]
for i in range(51):
CC[i] = sum(C[i][1:K+1])
A = [int(a) for a in input().split()]
aa, oo = - 1, 0
for i in range(N)[::-1]:
a = A[i]
if a & S != S or a | T != T:
del A[i]
continue
aa &= a
oo |= a
aa ^= oo
i = aa
ans = 0
while 1:
D = {}
for a in A:
t = i & a
if t not in D: D[t] = 1
else: D[t] += 1
ans += sum([CC[t] for t in list(D.values())]) * popcount_parity(i)
if not i: break
i = (i - 1) & aa
print(ans) | def popcount_parity(x):
x ^= x >> 1
x ^= x >> 2
x ^= x >> 4
x ^= x >> 8
x ^= x >> 16
return -1 if x & 1 else 1
N, K, S, T = list(map(int, input().split()))
if S & T != S:
print((0))
exit()
C = [[1]]
CC = [0] * 51
for i in range(1, 51):
C.append([1] * (i + 1))
for j in range(1, i):
C[i][j] = C[i-1][j-1] + C[i-1][j]
for i in range(51):
CC[i] = sum(C[i][1:K+1])
A = [int(a) for a in input().split()]
aa, oo = - 1, 0
for i in range(N)[::-1]:
a = A[i]
if a & S != S or a | T != T:
del A[i]
continue
aa &= a
oo |= a
aa ^= oo
i = aa
ans = 0
while 1:
D = {}
for a in A:
t = i & a
if t not in D: D[t] = 1
else: D[t] += 1
c = 0
for t in list(D.values()):
c += CC[t]
ans += c * popcount_parity(i)
if not i: break
i = (i - 1) & aa
print(ans) | 42 | 48 | 852 | 912 | def popcount_parity(x):
for i in range(8):
x ^= x >> (1 << i)
return -1 if x & 1 else 1
N, K, S, T = list(map(int, input().split()))
if S & T != S:
print((0))
exit()
C = [[1]]
CC = [0] * 51
for i in range(1, 51):
C.append([1] * (i + 1))
for j in range(1, i):
C[i][j] = C[i - 1][j - 1] + C[i - 1][j]
for i in range(51):
CC[i] = sum(C[i][1 : K + 1])
A = [int(a) for a in input().split()]
aa, oo = -1, 0
for i in range(N)[::-1]:
a = A[i]
if a & S != S or a | T != T:
del A[i]
continue
aa &= a
oo |= a
aa ^= oo
i = aa
ans = 0
while 1:
D = {}
for a in A:
t = i & a
if t not in D:
D[t] = 1
else:
D[t] += 1
ans += sum([CC[t] for t in list(D.values())]) * popcount_parity(i)
if not i:
break
i = (i - 1) & aa
print(ans)
| def popcount_parity(x):
x ^= x >> 1
x ^= x >> 2
x ^= x >> 4
x ^= x >> 8
x ^= x >> 16
return -1 if x & 1 else 1
N, K, S, T = list(map(int, input().split()))
if S & T != S:
print((0))
exit()
C = [[1]]
CC = [0] * 51
for i in range(1, 51):
C.append([1] * (i + 1))
for j in range(1, i):
C[i][j] = C[i - 1][j - 1] + C[i - 1][j]
for i in range(51):
CC[i] = sum(C[i][1 : K + 1])
A = [int(a) for a in input().split()]
aa, oo = -1, 0
for i in range(N)[::-1]:
a = A[i]
if a & S != S or a | T != T:
del A[i]
continue
aa &= a
oo |= a
aa ^= oo
i = aa
ans = 0
while 1:
D = {}
for a in A:
t = i & a
if t not in D:
D[t] = 1
else:
D[t] += 1
c = 0
for t in list(D.values()):
c += CC[t]
ans += c * popcount_parity(i)
if not i:
break
i = (i - 1) & aa
print(ans)
| false | 12.5 | [
"- for i in range(8):",
"- x ^= x >> (1 << i)",
"+ x ^= x >> 1",
"+ x ^= x >> 2",
"+ x ^= x >> 4",
"+ x ^= x >> 8",
"+ x ^= x >> 16",
"- ans += sum([CC[t] for t in list(D.values())]) * popcount_parity(i)",
"+ c = 0",
"+ for t in list(D.values()):",
"+ c +... | false | 0.128039 | 0.051822 | 2.470723 | [
"s769212318",
"s000885444"
] |
u312025627 | p03557 | python | s142798770 | s098625001 | 445 | 221 | 104,804 | 104,664 | Accepted | Accepted | 50.34 | def main():
N = int(eval(input()))
A = [int(i) for i in input().split()]
B = [int(i) for i in input().split()]
C = [int(i) for i in input().split()]
A.sort()
B.sort()
C.sort()
def is_ok1(mid, S, K):
if K <= S[mid]:
return True
else:
return False
def is_ok2(mid, S, K):
if K < S[mid]:
return True
else:
return False
def binary_search_meguru(S, K, is_ok):
left = -1
right = N
while right - left > 1:
mid = left + ((right - left) // 2)
if is_ok(mid, S, K):
right = mid
else:
left = mid
return right
ans = 0
for b in B:
a = binary_search_meguru(A, b, is_ok1)
c = binary_search_meguru(C, b, is_ok2)
ans += a * (N-c)
print(ans)
if __name__ == '__main__':
main()
| def main():
import sys
input = sys.stdin.buffer.readline
from bisect import bisect, bisect_left
N = int(eval(input()))
A = [int(i) for i in input().split()]
B = [int(i) for i in input().split()]
C = [int(i) for i in input().split()]
A.sort()
C.sort()
ans = 0
for b in B:
a = bisect_left(A, b)
c = N - bisect(C, b)
ans += a*c
print(ans)
if __name__ == '__main__':
main()
| 42 | 20 | 957 | 461 | def main():
N = int(eval(input()))
A = [int(i) for i in input().split()]
B = [int(i) for i in input().split()]
C = [int(i) for i in input().split()]
A.sort()
B.sort()
C.sort()
def is_ok1(mid, S, K):
if K <= S[mid]:
return True
else:
return False
def is_ok2(mid, S, K):
if K < S[mid]:
return True
else:
return False
def binary_search_meguru(S, K, is_ok):
left = -1
right = N
while right - left > 1:
mid = left + ((right - left) // 2)
if is_ok(mid, S, K):
right = mid
else:
left = mid
return right
ans = 0
for b in B:
a = binary_search_meguru(A, b, is_ok1)
c = binary_search_meguru(C, b, is_ok2)
ans += a * (N - c)
print(ans)
if __name__ == "__main__":
main()
| def main():
import sys
input = sys.stdin.buffer.readline
from bisect import bisect, bisect_left
N = int(eval(input()))
A = [int(i) for i in input().split()]
B = [int(i) for i in input().split()]
C = [int(i) for i in input().split()]
A.sort()
C.sort()
ans = 0
for b in B:
a = bisect_left(A, b)
c = N - bisect(C, b)
ans += a * c
print(ans)
if __name__ == "__main__":
main()
| false | 52.380952 | [
"+ import sys",
"+",
"+ input = sys.stdin.buffer.readline",
"+ from bisect import bisect, bisect_left",
"+",
"- B.sort()",
"-",
"- def is_ok1(mid, S, K):",
"- if K <= S[mid]:",
"- return True",
"- else:",
"- return False",
"-",
"- def i... | false | 0.109765 | 0.040896 | 2.684008 | [
"s142798770",
"s098625001"
] |
u189479417 | p03835 | python | s717583475 | s373014413 | 1,248 | 1,011 | 3,060 | 9,044 | Accepted | Accepted | 18.99 | K, S = list(map(int,input().split()))
ans = 0
for X in range(0, K+1):
for Y in range(0, K+1):
if 0 <= S - X - Y <= K:
ans += 1
print(ans) | K, S = list(map(int,input().split()))
ans = 0
for i in range(K+1):
for j in range(K+1):
if 0 <= S - i - j <= K:
ans += 1
print(ans) | 7 | 7 | 161 | 155 | K, S = list(map(int, input().split()))
ans = 0
for X in range(0, K + 1):
for Y in range(0, K + 1):
if 0 <= S - X - Y <= K:
ans += 1
print(ans)
| K, S = list(map(int, input().split()))
ans = 0
for i in range(K + 1):
for j in range(K + 1):
if 0 <= S - i - j <= K:
ans += 1
print(ans)
| false | 0 | [
"-for X in range(0, K + 1):",
"- for Y in range(0, K + 1):",
"- if 0 <= S - X - Y <= K:",
"+for i in range(K + 1):",
"+ for j in range(K + 1):",
"+ if 0 <= S - i - j <= K:"
] | false | 0.04252 | 0.043094 | 0.986689 | [
"s717583475",
"s373014413"
] |
u928385607 | p03486 | python | s249508305 | s216641992 | 19 | 17 | 2,940 | 2,940 | Accepted | Accepted | 10.53 | s = eval(input())
s_asc = ''.join(sorted(s))
t = eval(input())
t_desc = ''.join(sorted(t, reverse=True))
if s_asc < t_desc:
print('Yes')
else:
print('No') | s = sorted(eval(input()))
t = sorted(eval(input()), reverse=True)
if s < t:
print("Yes")
else:
print("No") | 10 | 8 | 155 | 105 | s = eval(input())
s_asc = "".join(sorted(s))
t = eval(input())
t_desc = "".join(sorted(t, reverse=True))
if s_asc < t_desc:
print("Yes")
else:
print("No")
| s = sorted(eval(input()))
t = sorted(eval(input()), reverse=True)
if s < t:
print("Yes")
else:
print("No")
| false | 20 | [
"-s = eval(input())",
"-s_asc = \"\".join(sorted(s))",
"-t = eval(input())",
"-t_desc = \"\".join(sorted(t, reverse=True))",
"-if s_asc < t_desc:",
"+s = sorted(eval(input()))",
"+t = sorted(eval(input()), reverse=True)",
"+if s < t:"
] | false | 0.048131 | 0.048763 | 0.987049 | [
"s249508305",
"s216641992"
] |
u238510421 | p03495 | python | s896434154 | s378988273 | 290 | 115 | 44,544 | 32,540 | Accepted | Accepted | 60.34 | from collections import Counter
import numpy as np
n,k = input().split()
n = int(n)
k = int(k)
a_list = input().split()
count = np.array(list(Counter(a_list).values()))
count.sort()
count = count[::-1]
print((count[k:].sum())) | from collections import Counter
n,k = list([int(x) for x in input().split()])
a = list([int(x) for x in input().split()])
print((sum(sorted(list(Counter(a).values()),reverse=True)[k:]))) | 11 | 6 | 235 | 201 | from collections import Counter
import numpy as np
n, k = input().split()
n = int(n)
k = int(k)
a_list = input().split()
count = np.array(list(Counter(a_list).values()))
count.sort()
count = count[::-1]
print((count[k:].sum()))
| from collections import Counter
n, k = list([int(x) for x in input().split()])
a = list([int(x) for x in input().split()])
print((sum(sorted(list(Counter(a).values()), reverse=True)[k:])))
| false | 45.454545 | [
"-import numpy as np",
"-n, k = input().split()",
"-n = int(n)",
"-k = int(k)",
"-a_list = input().split()",
"-count = np.array(list(Counter(a_list).values()))",
"-count.sort()",
"-count = count[::-1]",
"-print((count[k:].sum()))",
"+n, k = list([int(x) for x in input().split()])",
"+a = list([i... | false | 0.162815 | 0.039876 | 4.083024 | [
"s896434154",
"s378988273"
] |
u256678932 | p02408 | python | s037052864 | s151306828 | 30 | 20 | 7,580 | 5,596 | Accepted | Accepted | 33.33 | from sys import stdin
cards = {}
n = int(eval(input()))
for line in stdin:
m, num = line.rstrip().split(' ')
cards[(m, int(num))] = True
for s in ['S','H','C','D']:
for i in range(1, 14):
if not (s, i) in cards:
print(("{} {}".format(s, i))) | marks = ["S", "H", "C", "D"]
cards = {}
n = int(eval(input()))
for _ in range(0, n):
mark, num = input().split()
if mark not in cards:
cards[mark] = []
cards[mark].append(int(num))
for mark in marks:
for n in range(1, 14):
if n in cards[mark]:
continue
print(("{} {}".format(mark, n)))
| 13 | 20 | 280 | 356 | from sys import stdin
cards = {}
n = int(eval(input()))
for line in stdin:
m, num = line.rstrip().split(" ")
cards[(m, int(num))] = True
for s in ["S", "H", "C", "D"]:
for i in range(1, 14):
if not (s, i) in cards:
print(("{} {}".format(s, i)))
| marks = ["S", "H", "C", "D"]
cards = {}
n = int(eval(input()))
for _ in range(0, n):
mark, num = input().split()
if mark not in cards:
cards[mark] = []
cards[mark].append(int(num))
for mark in marks:
for n in range(1, 14):
if n in cards[mark]:
continue
print(("{} {}".format(mark, n)))
| false | 35 | [
"-from sys import stdin",
"-",
"+marks = [\"S\", \"H\", \"C\", \"D\"]",
"-for line in stdin:",
"- m, num = line.rstrip().split(\" \")",
"- cards[(m, int(num))] = True",
"-for s in [\"S\", \"H\", \"C\", \"D\"]:",
"- for i in range(1, 14):",
"- if not (s, i) in cards:",
"- ... | false | 0.050602 | 0.036951 | 1.369415 | [
"s037052864",
"s151306828"
] |
u724548524 | p02284 | python | s500613765 | s893951161 | 3,740 | 3,210 | 55,688 | 55,688 | Accepted | Accepted | 14.17 | import sys
class Node():
__slots__ = ['key', 'left', 'right']
def __init__(self, key):
self.key = key
self.left, self.right = None, None
def __str__(self):
return " " + str(self.key)
def insert(z):
global root
x, y = root, None
while x:
y = x
if z < x.key:
x = x.left
else:
x = x.right
if y == None:
root = Node(z)
elif z < y.key:
y.left = Node(z)
else:
y.right = Node(z)
def find(z):
global root
x, y = root, None
while x:
y = x
if z < x.key:
x = x.left
elif z > x.key:
x = x.right
else:
print("yes")
return
print("no")
def preorder(x):
return str(x) + preorder(x.left) + preorder(x.right) if x else ""
def inorder(x):
return inorder(x.left) + str(x) + inorder(x.right) if x else ""
eval(input())
root = None
for s in sys.stdin:
if s[0] == "p":
print((inorder(root)))
print((preorder(root)))
elif s[0] == "f":
find(int(s[5:]))
else:
insert(int(s[7:]))
| import sys
class Node():
__slots__ = ['key', 'left', 'right']
def __init__(self, key):
self.key = key
self.left, self.right = None, None
def insert(z):
global root
x, y = root, None
while x:
y = x
if z < x.key:
x = x.left
else:
x = x.right
if y == None:
root = Node(z)
elif z < y.key:
y.left = Node(z)
else:
y.right = Node(z)
def find(z):
global root
x, y = root, None
while x:
y = x
if z < x.key:
x = x.left
elif z > x.key:
x = x.right
else:
print("yes")
return
print("no")
def preorder(x):
return f" {x.key}" + preorder(x.left) + preorder(x.right) if x else ""
def inorder(x):
return inorder(x.left) + f" {x.key}" + inorder(x.right) if x else ""
eval(input())
root = None
for s in sys.stdin:
if s[0] == "p":
print((inorder(root)))
print((preorder(root)))
elif s[0] == "f":
find(int(s[5:]))
else:
insert(int(s[7:]))
| 58 | 55 | 1,224 | 1,164 | import sys
class Node:
__slots__ = ["key", "left", "right"]
def __init__(self, key):
self.key = key
self.left, self.right = None, None
def __str__(self):
return " " + str(self.key)
def insert(z):
global root
x, y = root, None
while x:
y = x
if z < x.key:
x = x.left
else:
x = x.right
if y == None:
root = Node(z)
elif z < y.key:
y.left = Node(z)
else:
y.right = Node(z)
def find(z):
global root
x, y = root, None
while x:
y = x
if z < x.key:
x = x.left
elif z > x.key:
x = x.right
else:
print("yes")
return
print("no")
def preorder(x):
return str(x) + preorder(x.left) + preorder(x.right) if x else ""
def inorder(x):
return inorder(x.left) + str(x) + inorder(x.right) if x else ""
eval(input())
root = None
for s in sys.stdin:
if s[0] == "p":
print((inorder(root)))
print((preorder(root)))
elif s[0] == "f":
find(int(s[5:]))
else:
insert(int(s[7:]))
| import sys
class Node:
__slots__ = ["key", "left", "right"]
def __init__(self, key):
self.key = key
self.left, self.right = None, None
def insert(z):
global root
x, y = root, None
while x:
y = x
if z < x.key:
x = x.left
else:
x = x.right
if y == None:
root = Node(z)
elif z < y.key:
y.left = Node(z)
else:
y.right = Node(z)
def find(z):
global root
x, y = root, None
while x:
y = x
if z < x.key:
x = x.left
elif z > x.key:
x = x.right
else:
print("yes")
return
print("no")
def preorder(x):
return f" {x.key}" + preorder(x.left) + preorder(x.right) if x else ""
def inorder(x):
return inorder(x.left) + f" {x.key}" + inorder(x.right) if x else ""
eval(input())
root = None
for s in sys.stdin:
if s[0] == "p":
print((inorder(root)))
print((preorder(root)))
elif s[0] == "f":
find(int(s[5:]))
else:
insert(int(s[7:]))
| false | 5.172414 | [
"-",
"- def __str__(self):",
"- return \" \" + str(self.key)",
"- return str(x) + preorder(x.left) + preorder(x.right) if x else \"\"",
"+ return f\" {x.key}\" + preorder(x.left) + preorder(x.right) if x else \"\"",
"- return inorder(x.left) + str(x) + inorder(x.right) if x else \"\"",
... | false | 0.135457 | 0.085766 | 1.579376 | [
"s500613765",
"s893951161"
] |
u677121387 | p03330 | python | s345973939 | s344471143 | 909 | 479 | 47,452 | 45,148 | Accepted | Accepted | 47.3 | n,C = list(map(int,input().split()))
d = [[int(i) for i in input().split()] for _ in range(C)]
c = [[int(i)-1 for i in input().split()] for _ in range(n)]
cnt = [[0]*C for _ in range(3)]
for i in range(n):
for j in range(n):
for k in range(C):
for r in range(3):
if (i+j)%3 == r: cnt[r][k] += d[c[i][j]][k]
ans = float("inf")
for i in range(C):
for j in range(C):
if i == j: continue
for k in range(C):
if i == k or j == k: continue
ans = min(ans, cnt[0][i] + cnt[1][j] + cnt[2][k])
print(ans) | n,C = list(map(int,input().split()))
d = [[int(i) for i in input().split()] for _ in range(C)]
c = [[int(i)-1 for i in input().split()] for _ in range(n)]
cnt = [[0]*C for _ in range(3)]
for i in range(n):
for j in range(n):
for k in range(C):
cnt[(i+j)%3][k] += d[c[i][j]][k]
ans = float("inf")
for i in range(C):
for j in range(C):
if i == j: continue
for k in range(C):
if i == k or j == k: continue
ans = min(ans, cnt[0][i] + cnt[1][j] + cnt[2][k])
print(ans) | 19 | 18 | 591 | 544 | n, C = list(map(int, input().split()))
d = [[int(i) for i in input().split()] for _ in range(C)]
c = [[int(i) - 1 for i in input().split()] for _ in range(n)]
cnt = [[0] * C for _ in range(3)]
for i in range(n):
for j in range(n):
for k in range(C):
for r in range(3):
if (i + j) % 3 == r:
cnt[r][k] += d[c[i][j]][k]
ans = float("inf")
for i in range(C):
for j in range(C):
if i == j:
continue
for k in range(C):
if i == k or j == k:
continue
ans = min(ans, cnt[0][i] + cnt[1][j] + cnt[2][k])
print(ans)
| n, C = list(map(int, input().split()))
d = [[int(i) for i in input().split()] for _ in range(C)]
c = [[int(i) - 1 for i in input().split()] for _ in range(n)]
cnt = [[0] * C for _ in range(3)]
for i in range(n):
for j in range(n):
for k in range(C):
cnt[(i + j) % 3][k] += d[c[i][j]][k]
ans = float("inf")
for i in range(C):
for j in range(C):
if i == j:
continue
for k in range(C):
if i == k or j == k:
continue
ans = min(ans, cnt[0][i] + cnt[1][j] + cnt[2][k])
print(ans)
| false | 5.263158 | [
"- for r in range(3):",
"- if (i + j) % 3 == r:",
"- cnt[r][k] += d[c[i][j]][k]",
"+ cnt[(i + j) % 3][k] += d[c[i][j]][k]"
] | false | 0.041624 | 0.049557 | 0.839925 | [
"s345973939",
"s344471143"
] |
u416758623 | p03274 | python | s310555289 | s905544918 | 96 | 60 | 14,252 | 14,224 | Accepted | Accepted | 37.5 | n,k = list(map(int,input().split()))
x = list(map(int, input().split()))
ans = 10 **10
rx = x[k-1:]
for i, j in zip(x,rx):
if ans >= abs(i -j) + min(abs(i),abs(j)):
ans = abs(i -j) + min(abs(i),abs(j))
print(ans) | n,k = list(map(int, input().split()))
x = list(map(int, input().split()))
print((min(r-l + min(abs(l), abs(r)) for l, r in zip(x,x[k-1:])))) | 8 | 3 | 225 | 134 | n, k = list(map(int, input().split()))
x = list(map(int, input().split()))
ans = 10**10
rx = x[k - 1 :]
for i, j in zip(x, rx):
if ans >= abs(i - j) + min(abs(i), abs(j)):
ans = abs(i - j) + min(abs(i), abs(j))
print(ans)
| n, k = list(map(int, input().split()))
x = list(map(int, input().split()))
print((min(r - l + min(abs(l), abs(r)) for l, r in zip(x, x[k - 1 :]))))
| false | 62.5 | [
"-ans = 10**10",
"-rx = x[k - 1 :]",
"-for i, j in zip(x, rx):",
"- if ans >= abs(i - j) + min(abs(i), abs(j)):",
"- ans = abs(i - j) + min(abs(i), abs(j))",
"-print(ans)",
"+print((min(r - l + min(abs(l), abs(r)) for l, r in zip(x, x[k - 1 :]))))"
] | false | 0.03727 | 0.037438 | 0.995513 | [
"s310555289",
"s905544918"
] |
u079022693 | p03053 | python | s882174543 | s747042944 | 833 | 646 | 136,676 | 131,728 | Accepted | Accepted | 22.45 | from sys import stdin
import numpy as np
from numba import njit
@njit("i8(i8[:,:],i8,i8)")
def search(grid,h,w):
q=np.zeros(2*10**6+4,dtype=np.int64)
now=0
for i in range(h):
for j in range(w):
if grid[i][j]==1:
q[now]=i
q[now+1]=j
now+=2
now,nex=0,now
cnt=0
while now!=nex:
tmp=nex
for i in range(now,nex,2):
y=q[i]
x=q[i+1]
for dy,dx in (-1,0),(1,0),(0,-1),(0,1):
ny=y+dy
nx=x+dx
if 0<=ny<h and 0<=nx<w:
if grid[ny][nx]==0:
grid[ny][nx]=1
q[tmp]=ny
q[tmp+1]=nx
tmp+=2
now,nex=nex,tmp
cnt+=1
return cnt-1
def main():
#入力
readline=stdin.readline
h,w=list(map(int,readline().split()))
grid=[readline().strip() for _ in range(h)]
grid=np.array([[1 if grid[i][j]=="#" else 0 for j in range(w)] for i in range(h)],dtype=np.int64)
print((search(grid,h,w)))
if __name__=="__main__":
main() | from sys import stdin
import numpy as np
from numba import njit
@njit("i8(i8[:,:],i8,i8)",cache=True)
def search(grid,h,w):
q=np.zeros(2*10**6+4,dtype=np.int64)
now=0
for i in range(h):
for j in range(w):
if grid[i][j]==1:
q[now]=i
q[now+1]=j
now+=2
now,nex=0,now
cnt=0
while now!=nex:
tmp=nex
for i in range(now,nex,2):
y=q[i]
x=q[i+1]
for dy,dx in (-1,0),(1,0),(0,-1),(0,1):
ny=y+dy
nx=x+dx
if 0<=ny<h and 0<=nx<w:
if grid[ny][nx]==0:
grid[ny][nx]=1
q[tmp]=ny
q[tmp+1]=nx
tmp+=2
now,nex=nex,tmp
cnt+=1
return cnt-1
def main():
#入力
readline=stdin.readline
h,w=list(map(int,readline().split()))
grid=[readline().strip() for _ in range(h)]
grid=np.array([[1 if grid[i][j]=="#" else 0 for j in range(w)] for i in range(h)],dtype=np.int64)
print((search(grid,h,w)))
if __name__=="__main__":
main() | 47 | 47 | 1,183 | 1,194 | from sys import stdin
import numpy as np
from numba import njit
@njit("i8(i8[:,:],i8,i8)")
def search(grid, h, w):
q = np.zeros(2 * 10**6 + 4, dtype=np.int64)
now = 0
for i in range(h):
for j in range(w):
if grid[i][j] == 1:
q[now] = i
q[now + 1] = j
now += 2
now, nex = 0, now
cnt = 0
while now != nex:
tmp = nex
for i in range(now, nex, 2):
y = q[i]
x = q[i + 1]
for dy, dx in (-1, 0), (1, 0), (0, -1), (0, 1):
ny = y + dy
nx = x + dx
if 0 <= ny < h and 0 <= nx < w:
if grid[ny][nx] == 0:
grid[ny][nx] = 1
q[tmp] = ny
q[tmp + 1] = nx
tmp += 2
now, nex = nex, tmp
cnt += 1
return cnt - 1
def main():
# 入力
readline = stdin.readline
h, w = list(map(int, readline().split()))
grid = [readline().strip() for _ in range(h)]
grid = np.array(
[[1 if grid[i][j] == "#" else 0 for j in range(w)] for i in range(h)],
dtype=np.int64,
)
print((search(grid, h, w)))
if __name__ == "__main__":
main()
| from sys import stdin
import numpy as np
from numba import njit
@njit("i8(i8[:,:],i8,i8)", cache=True)
def search(grid, h, w):
q = np.zeros(2 * 10**6 + 4, dtype=np.int64)
now = 0
for i in range(h):
for j in range(w):
if grid[i][j] == 1:
q[now] = i
q[now + 1] = j
now += 2
now, nex = 0, now
cnt = 0
while now != nex:
tmp = nex
for i in range(now, nex, 2):
y = q[i]
x = q[i + 1]
for dy, dx in (-1, 0), (1, 0), (0, -1), (0, 1):
ny = y + dy
nx = x + dx
if 0 <= ny < h and 0 <= nx < w:
if grid[ny][nx] == 0:
grid[ny][nx] = 1
q[tmp] = ny
q[tmp + 1] = nx
tmp += 2
now, nex = nex, tmp
cnt += 1
return cnt - 1
def main():
# 入力
readline = stdin.readline
h, w = list(map(int, readline().split()))
grid = [readline().strip() for _ in range(h)]
grid = np.array(
[[1 if grid[i][j] == "#" else 0 for j in range(w)] for i in range(h)],
dtype=np.int64,
)
print((search(grid, h, w)))
if __name__ == "__main__":
main()
| false | 0 | [
"-@njit(\"i8(i8[:,:],i8,i8)\")",
"+@njit(\"i8(i8[:,:],i8,i8)\", cache=True)"
] | false | 0.419216 | 0.3911 | 1.07189 | [
"s882174543",
"s747042944"
] |
u759412327 | p03220 | python | s336469276 | s757213598 | 320 | 31 | 22,292 | 9,156 | Accepted | Accepted | 90.31 | import numpy as np
a = int(eval(input()))
b = list(map(int,input().split()))
c = np.array(input().split(),dtype=np.int)
d = np.abs(b[0]-0.006*c-b[1])
print((np.argmin(d)+1)) | N = int(eval(input()))
T,A = list(map(int,input().split()))
H = list(map(int,input().split()))
B = [abs(T-0.006*h-A) for h in H]
print((1+B.index(min(B)))) | 6 | 5 | 170 | 145 | import numpy as np
a = int(eval(input()))
b = list(map(int, input().split()))
c = np.array(input().split(), dtype=np.int)
d = np.abs(b[0] - 0.006 * c - b[1])
print((np.argmin(d) + 1))
| N = int(eval(input()))
T, A = list(map(int, input().split()))
H = list(map(int, input().split()))
B = [abs(T - 0.006 * h - A) for h in H]
print((1 + B.index(min(B))))
| false | 16.666667 | [
"-import numpy as np",
"-",
"-a = int(eval(input()))",
"-b = list(map(int, input().split()))",
"-c = np.array(input().split(), dtype=np.int)",
"-d = np.abs(b[0] - 0.006 * c - b[1])",
"-print((np.argmin(d) + 1))",
"+N = int(eval(input()))",
"+T, A = list(map(int, input().split()))",
"+H = list(map(... | false | 0.24588 | 0.048169 | 5.104573 | [
"s336469276",
"s757213598"
] |
u095094246 | p02659 | python | s597207306 | s651886285 | 61 | 24 | 62,056 | 9,168 | Accepted | Accepted | 60.66 | import math
x=input().split()
a=int(x[0])
b=int(x[1].replace('.',''))
c = int(a * b)
print((c//100))
| x=input().split()
a=int(x[0])
b=int(x[1].replace('.',''))
print((a*b//100)) | 8 | 4 | 108 | 76 | import math
x = input().split()
a = int(x[0])
b = int(x[1].replace(".", ""))
c = int(a * b)
print((c // 100))
| x = input().split()
a = int(x[0])
b = int(x[1].replace(".", ""))
print((a * b // 100))
| false | 50 | [
"-import math",
"-",
"-c = int(a * b)",
"-print((c // 100))",
"+print((a * b // 100))"
] | false | 0.075759 | 0.132432 | 0.572061 | [
"s597207306",
"s651886285"
] |
u367965715 | p02632 | python | s514736251 | s933744500 | 1,908 | 1,203 | 11,036 | 49,460 | Accepted | Accepted | 36.95 | k = int(eval(input()))
s = eval(input())
n = len(s)
MOD = 10**9+7
d = pow(26, -1, MOD)
ans = val = pow(26, k, MOD)
for i in range(1, k+1):
val *= (i+n-1) * 25 * pow(i, -1, MOD) * d % MOD
val %= MOD
ans += val
ans %= MOD
print(ans) | k = int(eval(input()))
s = eval(input())
n = len(s)
MAX = 10**6
MOD = 10**9+7
inv = [0] * (MAX+1)
inv[1] = 1
for i in range(2, MAX+1):
q, r = divmod(MOD, i)
inv[i] = -inv[r] * q % MOD
ans = val = pow(26, k, MOD)
for i in range(1, k+1):
val *= (i+n-1) * 25 * inv[i] * inv[26] % MOD
val %= MOD
ans += val
ans %= MOD
print(ans)
| 13 | 20 | 247 | 359 | k = int(eval(input()))
s = eval(input())
n = len(s)
MOD = 10**9 + 7
d = pow(26, -1, MOD)
ans = val = pow(26, k, MOD)
for i in range(1, k + 1):
val *= (i + n - 1) * 25 * pow(i, -1, MOD) * d % MOD
val %= MOD
ans += val
ans %= MOD
print(ans)
| k = int(eval(input()))
s = eval(input())
n = len(s)
MAX = 10**6
MOD = 10**9 + 7
inv = [0] * (MAX + 1)
inv[1] = 1
for i in range(2, MAX + 1):
q, r = divmod(MOD, i)
inv[i] = -inv[r] * q % MOD
ans = val = pow(26, k, MOD)
for i in range(1, k + 1):
val *= (i + n - 1) * 25 * inv[i] * inv[26] % MOD
val %= MOD
ans += val
ans %= MOD
print(ans)
| false | 35 | [
"+MAX = 10**6",
"-d = pow(26, -1, MOD)",
"+inv = [0] * (MAX + 1)",
"+inv[1] = 1",
"+for i in range(2, MAX + 1):",
"+ q, r = divmod(MOD, i)",
"+ inv[i] = -inv[r] * q % MOD",
"- val *= (i + n - 1) * 25 * pow(i, -1, MOD) * d % MOD",
"+ val *= (i + n - 1) * 25 * inv[i] * inv[26] % MOD"
] | false | 0.066709 | 0.043019 | 1.550666 | [
"s514736251",
"s933744500"
] |
u190405389 | p02868 | python | s872644902 | s891250377 | 1,254 | 980 | 102,360 | 94,896 | Accepted | Accepted | 21.85 | from operator import itemgetter
inf = float('inf')
n,m = list(map(int, input().split()))
a = [list(map(int, input().split())) for i in range(m)]
a.sort(key=itemgetter(2))
a.sort(key=itemgetter(1))
a.sort(key=itemgetter(0))
d = [inf]*(n+1)
d[1]=0
for i in range(m):
l,r,c = a[i]
if d[l]==inf:
print((-1))
exit()
for j in range(r-l):
if d[r-j]>d[l]+c:
d[r-j]=d[l]+c
else:
break
print((d[n]if d[n]!=inf else -1)) | import heapq
def dijkstra(s,path):
inf = float('inf')
n = len(path)
# 距離をinfで初期化
d = [inf for i in range(n)]
d[s] = 0
# sへの距離は0
q = [(0,s)]
heapq.heapify(q)
# 距離が最小の頂点から更新していけば良い
while q:
c,p = heapq.heappop(q)
# 頂点pまでの距離がheap内のpまでの距離より小さい場合、continue
if d[p]<c:
continue
# 頂点pから伸びる、全ての辺の距離を確認
for cost,to in path[p]:
# 頂点pから行ける頂点の距離がpまでの距離とpからの距離の和より小さい場合 -> 距離を更新し、heapに追加
if d[to] > d[p] + cost:
d[to] = d[p]+cost
heapq.heappush(q,(d[to], to))
return d
n,m = list(map(int, input().split()))
path = [[] for i in range(n)]
for i in range(n-1):
path[i+1].append([0,i])
for i in range(m):
l,r,c = list(map(int, input().split()))
path[l-1].append([c,r-1])
ans = dijkstra(0,path)[-1]
print((-1 if ans==float('inf') else ans)) | 23 | 41 | 492 | 920 | from operator import itemgetter
inf = float("inf")
n, m = list(map(int, input().split()))
a = [list(map(int, input().split())) for i in range(m)]
a.sort(key=itemgetter(2))
a.sort(key=itemgetter(1))
a.sort(key=itemgetter(0))
d = [inf] * (n + 1)
d[1] = 0
for i in range(m):
l, r, c = a[i]
if d[l] == inf:
print((-1))
exit()
for j in range(r - l):
if d[r - j] > d[l] + c:
d[r - j] = d[l] + c
else:
break
print((d[n] if d[n] != inf else -1))
| import heapq
def dijkstra(s, path):
inf = float("inf")
n = len(path)
# 距離をinfで初期化
d = [inf for i in range(n)]
d[s] = 0
# sへの距離は0
q = [(0, s)]
heapq.heapify(q)
# 距離が最小の頂点から更新していけば良い
while q:
c, p = heapq.heappop(q)
# 頂点pまでの距離がheap内のpまでの距離より小さい場合、continue
if d[p] < c:
continue
# 頂点pから伸びる、全ての辺の距離を確認
for cost, to in path[p]:
# 頂点pから行ける頂点の距離がpまでの距離とpからの距離の和より小さい場合 -> 距離を更新し、heapに追加
if d[to] > d[p] + cost:
d[to] = d[p] + cost
heapq.heappush(q, (d[to], to))
return d
n, m = list(map(int, input().split()))
path = [[] for i in range(n)]
for i in range(n - 1):
path[i + 1].append([0, i])
for i in range(m):
l, r, c = list(map(int, input().split()))
path[l - 1].append([c, r - 1])
ans = dijkstra(0, path)[-1]
print((-1 if ans == float("inf") else ans))
| false | 43.902439 | [
"-from operator import itemgetter",
"+import heapq",
"-inf = float(\"inf\")",
"+",
"+def dijkstra(s, path):",
"+ inf = float(\"inf\")",
"+ n = len(path)",
"+ # 距離をinfで初期化",
"+ d = [inf for i in range(n)]",
"+ d[s] = 0",
"+ # sへの距離は0",
"+ q = [(0, s)]",
"+ heapq.heapif... | false | 0.035477 | 0.037074 | 0.956928 | [
"s872644902",
"s891250377"
] |
u792720861 | p03250 | python | s100069138 | s887061331 | 31 | 26 | 9,088 | 9,028 | Accepted | Accepted | 16.13 | a = sorted(list(map(int, input().split())),reverse=True)
print((a[0]*10+a[1]+a[2]))
| a = sorted(list(map(int, input().split())),reverse=True)
print((sum(a)+a[0]*9))
| 2 | 2 | 83 | 79 | a = sorted(list(map(int, input().split())), reverse=True)
print((a[0] * 10 + a[1] + a[2]))
| a = sorted(list(map(int, input().split())), reverse=True)
print((sum(a) + a[0] * 9))
| false | 0 | [
"-print((a[0] * 10 + a[1] + a[2]))",
"+print((sum(a) + a[0] * 9))"
] | false | 0.155065 | 0.038373 | 4.040959 | [
"s100069138",
"s887061331"
] |
u373047809 | p03163 | python | s410601345 | s634089524 | 366 | 98 | 152,616 | 68,428 | Accepted | Accepted | 73.22 | (N, W), *D = [list(map(int, o.split())) for o in open(0)]
w, v = 0, 1
dp = [[0]*-~W for _ in [0]*-~N]
for i in range(N):
for j in range(W + 1):
dp[i + 1][j] = max(dp[i][j], (dp[i][j - D[i][w]] + D[i][v])*(j >= D[i][w]))
print((dp[N][W])) | N, W = list(map(int,input().split()))
dp = [0]*-~W
for _ in [None]*N:
w, v = list(map(int,input().split()))
for j in range(W, w-1, -1):
dp[j] = max(dp[j], dp[j - w] + v)
print((max(dp))) | 7 | 7 | 247 | 186 | (N, W), *D = [list(map(int, o.split())) for o in open(0)]
w, v = 0, 1
dp = [[0] * -~W for _ in [0] * -~N]
for i in range(N):
for j in range(W + 1):
dp[i + 1][j] = max(dp[i][j], (dp[i][j - D[i][w]] + D[i][v]) * (j >= D[i][w]))
print((dp[N][W]))
| N, W = list(map(int, input().split()))
dp = [0] * -~W
for _ in [None] * N:
w, v = list(map(int, input().split()))
for j in range(W, w - 1, -1):
dp[j] = max(dp[j], dp[j - w] + v)
print((max(dp)))
| false | 0 | [
"-(N, W), *D = [list(map(int, o.split())) for o in open(0)]",
"-w, v = 0, 1",
"-dp = [[0] * -~W for _ in [0] * -~N]",
"-for i in range(N):",
"- for j in range(W + 1):",
"- dp[i + 1][j] = max(dp[i][j], (dp[i][j - D[i][w]] + D[i][v]) * (j >= D[i][w]))",
"-print((dp[N][W]))",
"+N, W = list(map(... | false | 0.080702 | 0.078167 | 1.032426 | [
"s410601345",
"s634089524"
] |
u432551953 | p03805 | python | s453493180 | s594222286 | 203 | 176 | 42,972 | 39,664 | Accepted | Accepted | 13.3 | import sys
input = sys.stdin.readline
from operator import itemgetter
lis = []
n = 0
m = 0
ans = 0
visited = []
def dfs(i, d, fr):
global lis, ans, visited
if visited[i] == 1:
return
if d == n - 1:
ans += 1
return
for j in lis[i]:
if j != fr:
visited[i] = 1
# print(i+1 , j+1)
dfs(j, d+1, i)
visited[i] = -1
def main():
global lis, n, m, ans, visited
n, m = list(map(int, input().strip().split()))
lis = [[] for _ in range(n)]
visited = [-1] * n
for _ in range(m):
a, b = list([x-1 for x in list(map(int, input().strip().split()))])
lis[a].append(b)
lis[b].append(a)
# print("##")
dfs(0, 0, -1)
print(ans)
if __name__ == '__main__':
main()
| import sys
input = sys.stdin.readline
from operator import itemgetter
import itertools
def main():
n, m = list(map(int, input().strip().split()))
lis = [[] for _ in range(n)]
visited = [-1] * n
for _ in range(m):
a, b = list([x-1 for x in list(map(int, input().strip().split()))])
lis[a].append(b)
lis[b].append(a)
ans = 0
for path in itertools.permutations(list(range(n)), n):
if path[0] != 0:
continue
c = True
for i in range(n-1):
pi1 = path[i+1]
pi = path[i]
# print(path)
if pi1 not in lis[pi]:
c = False
break
if c:
ans += 1
print(ans)
if __name__ == '__main__':
main()
| 40 | 32 | 833 | 793 | import sys
input = sys.stdin.readline
from operator import itemgetter
lis = []
n = 0
m = 0
ans = 0
visited = []
def dfs(i, d, fr):
global lis, ans, visited
if visited[i] == 1:
return
if d == n - 1:
ans += 1
return
for j in lis[i]:
if j != fr:
visited[i] = 1
# print(i+1 , j+1)
dfs(j, d + 1, i)
visited[i] = -1
def main():
global lis, n, m, ans, visited
n, m = list(map(int, input().strip().split()))
lis = [[] for _ in range(n)]
visited = [-1] * n
for _ in range(m):
a, b = list([x - 1 for x in list(map(int, input().strip().split()))])
lis[a].append(b)
lis[b].append(a)
# print("##")
dfs(0, 0, -1)
print(ans)
if __name__ == "__main__":
main()
| import sys
input = sys.stdin.readline
from operator import itemgetter
import itertools
def main():
n, m = list(map(int, input().strip().split()))
lis = [[] for _ in range(n)]
visited = [-1] * n
for _ in range(m):
a, b = list([x - 1 for x in list(map(int, input().strip().split()))])
lis[a].append(b)
lis[b].append(a)
ans = 0
for path in itertools.permutations(list(range(n)), n):
if path[0] != 0:
continue
c = True
for i in range(n - 1):
pi1 = path[i + 1]
pi = path[i]
# print(path)
if pi1 not in lis[pi]:
c = False
break
if c:
ans += 1
print(ans)
if __name__ == "__main__":
main()
| false | 20 | [
"-",
"-lis = []",
"-n = 0",
"-m = 0",
"-ans = 0",
"-visited = []",
"-",
"-",
"-def dfs(i, d, fr):",
"- global lis, ans, visited",
"- if visited[i] == 1:",
"- return",
"- if d == n - 1:",
"- ans += 1",
"- return",
"- for j in lis[i]:",
"- if j !... | false | 0.036349 | 0.043215 | 0.841137 | [
"s453493180",
"s594222286"
] |
u373047809 | p03558 | python | s709332583 | s769902659 | 153 | 131 | 24,316 | 23,088 | Accepted | Accepted | 14.38 | from collections import*
q=deque([(1,1)])
k=int(eval(input()))
m={}
while q:
n,s=q.pop()
if(n in m)-1:m[n]=s;q+=(n*10%k,s),;q.appendleft((-~n%k,s+1))
print((m[0])) | from collections import*
q=deque([(1,1)])
k=eval(input())
m={}
while q:
n,s=q.pop()
if(n in m)-1:m[n]=s;q+=(n*10%k,s),;q.appendleft((-~n%k,s+1))
print(m[0]) | 8 | 8 | 164 | 158 | from collections import *
q = deque([(1, 1)])
k = int(eval(input()))
m = {}
while q:
n, s = q.pop()
if (n in m) - 1:
m[n] = s
q += ((n * 10 % k, s),)
q.appendleft((-~n % k, s + 1))
print((m[0]))
| from collections import *
q = deque([(1, 1)])
k = eval(input())
m = {}
while q:
n, s = q.pop()
if (n in m) - 1:
m[n] = s
q += ((n * 10 % k, s),)
q.appendleft((-~n % k, s + 1))
print(m[0])
| false | 0 | [
"-k = int(eval(input()))",
"+k = eval(input())",
"-print((m[0]))",
"+print(m[0])"
] | false | 0.051003 | 0.0086 | 5.930602 | [
"s709332583",
"s769902659"
] |
u620480037 | p03325 | python | s918779745 | s789404422 | 212 | 98 | 42,092 | 4,148 | Accepted | Accepted | 53.77 | N=int(eval(input()))
a=list(map(int,input().split()))
ans=0
for i in range(N):
for j in range(40):
if a[i]%2==0:
ans+=1
a[i]//=2
print(ans) | N=int(eval(input()))
A=list(map(int,input().split()))
ans=0
for i in range(N):
while A[i]%2==0:
ans+=1
A[i]//=2
print(ans) | 9 | 10 | 177 | 147 | N = int(eval(input()))
a = list(map(int, input().split()))
ans = 0
for i in range(N):
for j in range(40):
if a[i] % 2 == 0:
ans += 1
a[i] //= 2
print(ans)
| N = int(eval(input()))
A = list(map(int, input().split()))
ans = 0
for i in range(N):
while A[i] % 2 == 0:
ans += 1
A[i] //= 2
print(ans)
| false | 10 | [
"-a = list(map(int, input().split()))",
"+A = list(map(int, input().split()))",
"- for j in range(40):",
"- if a[i] % 2 == 0:",
"- ans += 1",
"- a[i] //= 2",
"+ while A[i] % 2 == 0:",
"+ ans += 1",
"+ A[i] //= 2"
] | false | 0.037439 | 0.042348 | 0.884073 | [
"s918779745",
"s789404422"
] |
u896588506 | p02887 | python | s979244271 | s680202640 | 77 | 68 | 72,956 | 70,376 | Accepted | Accepted | 11.69 | from itertools import groupby
n = int(eval(input()))
s = eval(input())
gr = groupby(s)
ans = 0
for key, value in gr:
ans += 1
print(ans) | n = int(eval(input()))
s = eval(input())
ans = 0
before = ""
for i in s:
if i != before:
ans += 1
before = i
print(ans) | 10 | 11 | 139 | 139 | from itertools import groupby
n = int(eval(input()))
s = eval(input())
gr = groupby(s)
ans = 0
for key, value in gr:
ans += 1
print(ans)
| n = int(eval(input()))
s = eval(input())
ans = 0
before = ""
for i in s:
if i != before:
ans += 1
before = i
print(ans)
| false | 9.090909 | [
"-from itertools import groupby",
"-",
"-gr = groupby(s)",
"-for key, value in gr:",
"- ans += 1",
"+before = \"\"",
"+for i in s:",
"+ if i != before:",
"+ ans += 1",
"+ before = i"
] | false | 0.258865 | 0.091217 | 2.83791 | [
"s979244271",
"s680202640"
] |
u133936772 | p02803 | python | s453531653 | s599347410 | 303 | 198 | 27,088 | 9,412 | Accepted | Accepted | 34.65 | h,w=list(map(int,input().split()))
g=[[*eval(input())] for _ in range(h)]
from collections import *
def bfs(sx,sy):
d=[[-1]*w for _ in range(h)]
d[sx][sy]=0
q=deque([(sx,sy)])
while q:
x,y=q.popleft()
t=d[x][y]+1
for dx,dy in [(1,0),(0,1),(-1,0),(0,-1)]:
nx,ny=x+dx,y+dy
if 0<=nx<h and 0<=ny<w and g[nx][ny]=='.' and d[nx][ny]<0:
d[nx][ny]=t
q.append((nx,ny))
return d
import numpy as np
a=0
for sx in range(h):
for sy in range(w):
if g[sx][sy]=='#': continue
a=max(a,np.max(bfs(sx,sy)))
print(a) | h,w=list(map(int,input().split()))
g=[eval(input()) for _ in range(h)]
from collections import *
def bfs(sx,sy):
d=[[-1]*w for _ in range(h)]
d[sx][sy]=0
q=deque([(sx,sy)])
while q:
x,y=q.popleft()
for dx,dy in [(1,0),(0,1),(-1,0),(0,-1)]:
nx,ny=x+dx,y+dy
if 0<=nx<h and 0<=ny<w and g[nx][ny]=='.' and d[nx][ny]<0:
r=d[nx][ny]=d[x][y]+1
q.append((nx,ny))
return r
print((max(bfs(sx,sy) for sx in range(h) for sy in range(w) if g[sx][sy]=='.'))) | 23 | 16 | 566 | 491 | h, w = list(map(int, input().split()))
g = [[*eval(input())] for _ in range(h)]
from collections import *
def bfs(sx, sy):
d = [[-1] * w for _ in range(h)]
d[sx][sy] = 0
q = deque([(sx, sy)])
while q:
x, y = q.popleft()
t = d[x][y] + 1
for dx, dy in [(1, 0), (0, 1), (-1, 0), (0, -1)]:
nx, ny = x + dx, y + dy
if 0 <= nx < h and 0 <= ny < w and g[nx][ny] == "." and d[nx][ny] < 0:
d[nx][ny] = t
q.append((nx, ny))
return d
import numpy as np
a = 0
for sx in range(h):
for sy in range(w):
if g[sx][sy] == "#":
continue
a = max(a, np.max(bfs(sx, sy)))
print(a)
| h, w = list(map(int, input().split()))
g = [eval(input()) for _ in range(h)]
from collections import *
def bfs(sx, sy):
d = [[-1] * w for _ in range(h)]
d[sx][sy] = 0
q = deque([(sx, sy)])
while q:
x, y = q.popleft()
for dx, dy in [(1, 0), (0, 1), (-1, 0), (0, -1)]:
nx, ny = x + dx, y + dy
if 0 <= nx < h and 0 <= ny < w and g[nx][ny] == "." and d[nx][ny] < 0:
r = d[nx][ny] = d[x][y] + 1
q.append((nx, ny))
return r
print((max(bfs(sx, sy) for sx in range(h) for sy in range(w) if g[sx][sy] == ".")))
| false | 30.434783 | [
"-g = [[*eval(input())] for _ in range(h)]",
"+g = [eval(input()) for _ in range(h)]",
"- t = d[x][y] + 1",
"- d[nx][ny] = t",
"+ r = d[nx][ny] = d[x][y] + 1",
"- return d",
"+ return r",
"-import numpy as np",
"-",
"-a = 0",
"-for sx in range(h):",
"... | false | 0.113069 | 0.064219 | 1.760682 | [
"s453531653",
"s599347410"
] |
u562935282 | p02813 | python | s926188233 | s573451166 | 38 | 27 | 7,992 | 3,188 | Accepted | Accepted | 28.95 | # https://atcoder.jp/contests/abc150/submissions/9394047
from itertools import permutations
N = int(eval(input()))
P = tuple(map(int, input().split()))
Q = tuple(map(int, input().split()))
perms = tuple(permutations(list(range(1, N + 1))))
p = perms.index(P)
q = perms.index(Q)
print((abs(p - q)))
| from itertools import permutations
n = int(eval(input()))
p = tuple(map(int, input().split()))
q = tuple(map(int, input().split()))
pi, qi = -1, -1
for i, perm in enumerate(permutations(list(range(1, n + 1)))):
if perm == p:
pi = i
if qi != -1:
break
if perm == q:
qi = i
if pi != -1:
break
print((abs(pi - qi)))
| 12 | 17 | 298 | 381 | # https://atcoder.jp/contests/abc150/submissions/9394047
from itertools import permutations
N = int(eval(input()))
P = tuple(map(int, input().split()))
Q = tuple(map(int, input().split()))
perms = tuple(permutations(list(range(1, N + 1))))
p = perms.index(P)
q = perms.index(Q)
print((abs(p - q)))
| from itertools import permutations
n = int(eval(input()))
p = tuple(map(int, input().split()))
q = tuple(map(int, input().split()))
pi, qi = -1, -1
for i, perm in enumerate(permutations(list(range(1, n + 1)))):
if perm == p:
pi = i
if qi != -1:
break
if perm == q:
qi = i
if pi != -1:
break
print((abs(pi - qi)))
| false | 29.411765 | [
"-# https://atcoder.jp/contests/abc150/submissions/9394047",
"-N = int(eval(input()))",
"-P = tuple(map(int, input().split()))",
"-Q = tuple(map(int, input().split()))",
"-perms = tuple(permutations(list(range(1, N + 1))))",
"-p = perms.index(P)",
"-q = perms.index(Q)",
"-print((abs(p - q)))",
"+n =... | false | 0.045752 | 0.044672 | 1.024182 | [
"s926188233",
"s573451166"
] |
u883621917 | p02678 | python | s445420165 | s258934044 | 284 | 259 | 94,384 | 92,500 | Accepted | Accepted | 8.8 | import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
n, m = list(map(int, input().split()))
graph = [0] + [[] for _ in range(n)]
for _ in range(m):
n1, n2 = list(map(int, input().split()))
graph[n1].append(n2)
graph[n2].append(n1)
from collections import deque
def bfs(graph, queue, dist, prev):
while queue:
current = queue.popleft()
for c in graph[current]:
if dist[c] != -1:
continue
dist[c] = dist[current] + 1
prev[c] = current
queue.append(c)
queue = deque([1])
dist = [0] + [-1] * n
dist[1] = 0
prev = [0] + [-1] * n
prev[1] = 0
bfs(graph, queue, dist, prev)
if -1 in prev:
print('No')
else:
print('Yes')
for n in prev[2:]:
print(n)
| import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
n, m = list(map(int, input().split()))
graph = [0] + [[] for _ in range(n)]
for _ in range(m):
a, b = list(map(int, input().split()))
graph[a].append(b)
graph[b].append(a)
from collections import deque
def bfs(graph, queue, prev):
while queue:
current = queue.popleft()
for n in graph[current]:
if prev[n] != -1:
continue
prev[n] = current
queue.append(n)
queue = deque([1])
prev = [0] + [-1] * n
prev[1] = 0
bfs(graph, queue, prev)
if -1 not in prev:
print('Yes')
for i in prev[2:]:
print(i)
else:
print('No')
| 37 | 34 | 802 | 711 | import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
n, m = list(map(int, input().split()))
graph = [0] + [[] for _ in range(n)]
for _ in range(m):
n1, n2 = list(map(int, input().split()))
graph[n1].append(n2)
graph[n2].append(n1)
from collections import deque
def bfs(graph, queue, dist, prev):
while queue:
current = queue.popleft()
for c in graph[current]:
if dist[c] != -1:
continue
dist[c] = dist[current] + 1
prev[c] = current
queue.append(c)
queue = deque([1])
dist = [0] + [-1] * n
dist[1] = 0
prev = [0] + [-1] * n
prev[1] = 0
bfs(graph, queue, dist, prev)
if -1 in prev:
print("No")
else:
print("Yes")
for n in prev[2:]:
print(n)
| import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
n, m = list(map(int, input().split()))
graph = [0] + [[] for _ in range(n)]
for _ in range(m):
a, b = list(map(int, input().split()))
graph[a].append(b)
graph[b].append(a)
from collections import deque
def bfs(graph, queue, prev):
while queue:
current = queue.popleft()
for n in graph[current]:
if prev[n] != -1:
continue
prev[n] = current
queue.append(n)
queue = deque([1])
prev = [0] + [-1] * n
prev[1] = 0
bfs(graph, queue, prev)
if -1 not in prev:
print("Yes")
for i in prev[2:]:
print(i)
else:
print("No")
| false | 8.108108 | [
"- n1, n2 = list(map(int, input().split()))",
"- graph[n1].append(n2)",
"- graph[n2].append(n1)",
"+ a, b = list(map(int, input().split()))",
"+ graph[a].append(b)",
"+ graph[b].append(a)",
"-def bfs(graph, queue, dist, prev):",
"+def bfs(graph, queue, prev):",
"- for c in g... | false | 0.049182 | 0.04944 | 0.994779 | [
"s445420165",
"s258934044"
] |
u867848444 | p02803 | python | s730641906 | s599121091 | 528 | 444 | 3,316 | 3,316 | Accepted | Accepted | 15.91 | from collections import deque
h,w=list(map(int,input().split()))
maze=[eval(input()) for i in range(h)]
def bfs():
global goal
#0はstartとまだ通ってない場所
d=[[float('inf')]*w for _ in range(h)]
d[st[0]][st[1]]=0
#進行方向
x=[0,1,0,-1]
y=[1,0,-1,0]
p=deque([])
p.append(st)#start座標を入れる
while p:
zahyo=p.popleft()
for i in range(4):
nx=zahyo[0]+x[i]
ny=zahyo[1]+y[i]
if 0<=nx<=h-1 and 0<=ny<=w-1 and d[nx][ny]==float('inf') and maze[nx][ny]=='.':
d[nx][ny]=d[zahyo[0]][zahyo[1]]+1
p.append([nx,ny])
if goal<d[nx][ny]:
goal=d[nx][ny]
goal=0
ans=0
#starを決める
for i in range(h):
for j in range(w):
if maze[i][j]=='.':
st=[i,j]
bfs()
if ans<goal:
ans=goal
print(ans)
| #BFS
from collections import deque
def bfs(i,j):
q=deque()
q.append((i,j))
log=[[-1]*w for i in range(h)]
log[i][j]=0
dx=[0,1,0,-1]
dy=[1,0,-1,0]
long=0
while q:
#qの先頭を取り出す
p=q.popleft()
for i in range(4):
nx=p[0]+dx[i]
ny=p[1]+dy[i]
if not(0<=nx<h and 0<=ny<w):continue
if maze[nx][ny]=='#':continue
if log[nx][ny]!=-1:continue
log[nx][ny]=log[p[0]][p[1]]+1
q.append((nx,ny))
if int<=log[nx][ny]:long=log[nx][ny]
return int
h,w=list(map(int,input().split()))
maze=[list(eval(input())) for i in range(h)]
ans=0
for i in range(h):
for j in range(w):
if maze[i][j]=='.':
temp=bfs(i,j)
if ans<temp:ans=temp
print(ans) | 39 | 35 | 902 | 833 | from collections import deque
h, w = list(map(int, input().split()))
maze = [eval(input()) for i in range(h)]
def bfs():
global goal
# 0はstartとまだ通ってない場所
d = [[float("inf")] * w for _ in range(h)]
d[st[0]][st[1]] = 0
# 進行方向
x = [0, 1, 0, -1]
y = [1, 0, -1, 0]
p = deque([])
p.append(st) # start座標を入れる
while p:
zahyo = p.popleft()
for i in range(4):
nx = zahyo[0] + x[i]
ny = zahyo[1] + y[i]
if (
0 <= nx <= h - 1
and 0 <= ny <= w - 1
and d[nx][ny] == float("inf")
and maze[nx][ny] == "."
):
d[nx][ny] = d[zahyo[0]][zahyo[1]] + 1
p.append([nx, ny])
if goal < d[nx][ny]:
goal = d[nx][ny]
goal = 0
ans = 0
# starを決める
for i in range(h):
for j in range(w):
if maze[i][j] == ".":
st = [i, j]
bfs()
if ans < goal:
ans = goal
print(ans)
| # BFS
from collections import deque
def bfs(i, j):
q = deque()
q.append((i, j))
log = [[-1] * w for i in range(h)]
log[i][j] = 0
dx = [0, 1, 0, -1]
dy = [1, 0, -1, 0]
long = 0
while q:
# qの先頭を取り出す
p = q.popleft()
for i in range(4):
nx = p[0] + dx[i]
ny = p[1] + dy[i]
if not (0 <= nx < h and 0 <= ny < w):
continue
if maze[nx][ny] == "#":
continue
if log[nx][ny] != -1:
continue
log[nx][ny] = log[p[0]][p[1]] + 1
q.append((nx, ny))
if int <= log[nx][ny]:
long = log[nx][ny]
return int
h, w = list(map(int, input().split()))
maze = [list(eval(input())) for i in range(h)]
ans = 0
for i in range(h):
for j in range(w):
if maze[i][j] == ".":
temp = bfs(i, j)
if ans < temp:
ans = temp
print(ans)
| false | 10.25641 | [
"+# BFS",
"-h, w = list(map(int, input().split()))",
"-maze = [eval(input()) for i in range(h)]",
"+",
"+def bfs(i, j):",
"+ q = deque()",
"+ q.append((i, j))",
"+ log = [[-1] * w for i in range(h)]",
"+ log[i][j] = 0",
"+ dx = [0, 1, 0, -1]",
"+ dy = [1, 0, -1, 0]",
"+ lo... | false | 0.119456 | 0.099578 | 1.199622 | [
"s730641906",
"s599121091"
] |
u970267139 | p02767 | python | s050434952 | s874911909 | 33 | 26 | 9,176 | 9,036 | Accepted | Accepted | 21.21 | n = int(eval(input()))
X = list(map(int, input().split()))
ans = 10000000
for p in range(1, max(X) + 1):
total = 0
for x in X:
t = (x - p) ** 2
total += t
ans = min(total, ans)
print(ans) | n = int(eval(input()))
X = list(map(int, input().split()))
ans = 10000000
for p in range(min(X), max(X) + 1):
total = 0
for x in X:
t = (x - p) ** 2
total += t
ans = min(total, ans)
print(ans) | 11 | 11 | 220 | 225 | n = int(eval(input()))
X = list(map(int, input().split()))
ans = 10000000
for p in range(1, max(X) + 1):
total = 0
for x in X:
t = (x - p) ** 2
total += t
ans = min(total, ans)
print(ans)
| n = int(eval(input()))
X = list(map(int, input().split()))
ans = 10000000
for p in range(min(X), max(X) + 1):
total = 0
for x in X:
t = (x - p) ** 2
total += t
ans = min(total, ans)
print(ans)
| false | 0 | [
"-for p in range(1, max(X) + 1):",
"+for p in range(min(X), max(X) + 1):"
] | false | 0.058194 | 0.048412 | 1.202075 | [
"s050434952",
"s874911909"
] |
u677440371 | p03599 | python | s293045426 | s544695223 | 197 | 119 | 12,820 | 12,456 | Accepted | Accepted | 39.59 | a,b,c,d,e,f = list(map(int, input().split()))
water_list = []
for i in range(f+1):
for j in range(f+1):
water = a * 100 * i + b * 100 * j
if water <= f:
water_list.append(water)
else:
break
sugar_list = []
for i in range(f+1):
for j in range(f+1):
sugar = c * i + d * j
if sugar <= f:
sugar_list.append(sugar)
else:
break
ans = []
for i in list(set(water_list)):
for j in list(set(sugar_list)):
if i != 0:
if float(j) / i <= e / 100 and (i + j) <= f:
ans.append((i+j, j))
ans_sorted = sorted(ans, key=lambda x: (x[1] / (x[0])))[-1]
print((ans_sorted[0],ans_sorted[1])) | a, b, c, d, e, f = list(map(int, input().split()))
water = []
for i in range(31):
for j in range(31):
if a * i * 100 + b * j * 100 > f:
break
water.append(a * i * 100 + b * j * 100)
water = sorted(list(set(water)))
sugar = []
for i in range(3001):
for j in range(3001):
if c * i + d * j > f:
break
sugar.append(c * i + d * j)
sugar = sorted(list(set((sugar))))
sugar_ratio = 0
for i in water:
for j in sugar:
if i != 0:
sugar_water = i + j
if sugar_water <= f:
if j / i <= e / 100:
if j / sugar_water >= sugar_ratio:
sugar_ratio = j / sugar_water
ans_sugar_water = sugar_water
ans_sugar = j
print((ans_sugar_water, ans_sugar)) | 28 | 31 | 775 | 901 | a, b, c, d, e, f = list(map(int, input().split()))
water_list = []
for i in range(f + 1):
for j in range(f + 1):
water = a * 100 * i + b * 100 * j
if water <= f:
water_list.append(water)
else:
break
sugar_list = []
for i in range(f + 1):
for j in range(f + 1):
sugar = c * i + d * j
if sugar <= f:
sugar_list.append(sugar)
else:
break
ans = []
for i in list(set(water_list)):
for j in list(set(sugar_list)):
if i != 0:
if float(j) / i <= e / 100 and (i + j) <= f:
ans.append((i + j, j))
ans_sorted = sorted(ans, key=lambda x: (x[1] / (x[0])))[-1]
print((ans_sorted[0], ans_sorted[1]))
| a, b, c, d, e, f = list(map(int, input().split()))
water = []
for i in range(31):
for j in range(31):
if a * i * 100 + b * j * 100 > f:
break
water.append(a * i * 100 + b * j * 100)
water = sorted(list(set(water)))
sugar = []
for i in range(3001):
for j in range(3001):
if c * i + d * j > f:
break
sugar.append(c * i + d * j)
sugar = sorted(list(set((sugar))))
sugar_ratio = 0
for i in water:
for j in sugar:
if i != 0:
sugar_water = i + j
if sugar_water <= f:
if j / i <= e / 100:
if j / sugar_water >= sugar_ratio:
sugar_ratio = j / sugar_water
ans_sugar_water = sugar_water
ans_sugar = j
print((ans_sugar_water, ans_sugar))
| false | 9.677419 | [
"-water_list = []",
"-for i in range(f + 1):",
"- for j in range(f + 1):",
"- water = a * 100 * i + b * 100 * j",
"- if water <= f:",
"- water_list.append(water)",
"- else:",
"+water = []",
"+for i in range(31):",
"+ for j in range(31):",
"+ if a * i ... | false | 0.070931 | 0.059263 | 1.196879 | [
"s293045426",
"s544695223"
] |
u767664985 | p03239 | python | s340484374 | s985682926 | 20 | 18 | 2,940 | 2,940 | Accepted | Accepted | 10 | N, T = list(map(int, input().split()))
C = []
for _ in range(N):
c, t = list(map(int, input().split()))
if t <= T:
C.append(c)
if C == []:
print("TLE")
else:
print((min(C)))
| N, T = list(map(int, input().split()))
ct = [list(map(int, input().split())) for _ in range(N)]
cti = [i for i in ct if i[1] <= T]
if len(cti) == 0:
print("TLE")
else:
print((min(cti)[0]))
| 10 | 8 | 175 | 197 | N, T = list(map(int, input().split()))
C = []
for _ in range(N):
c, t = list(map(int, input().split()))
if t <= T:
C.append(c)
if C == []:
print("TLE")
else:
print((min(C)))
| N, T = list(map(int, input().split()))
ct = [list(map(int, input().split())) for _ in range(N)]
cti = [i for i in ct if i[1] <= T]
if len(cti) == 0:
print("TLE")
else:
print((min(cti)[0]))
| false | 20 | [
"-C = []",
"-for _ in range(N):",
"- c, t = list(map(int, input().split()))",
"- if t <= T:",
"- C.append(c)",
"-if C == []:",
"+ct = [list(map(int, input().split())) for _ in range(N)]",
"+cti = [i for i in ct if i[1] <= T]",
"+if len(cti) == 0:",
"- print((min(C)))",
"+ prin... | false | 0.040493 | 0.039667 | 1.020819 | [
"s340484374",
"s985682926"
] |
u252828980 | p03325 | python | s212836666 | s170074485 | 142 | 75 | 4,148 | 10,000 | Accepted | Accepted | 47.18 | n = int(eval(input()))
li = list(map(int,input().split()))
li = [x for x in li if x%2 ==0]
li2 = []
for i in range(len(li)):
num = 0
while li[i]%2 == 0:
li[i] = li[i]/2
num += 1
li2.append(num)
print((sum(li2))) | n = int(eval(input()))
L = list(map(int,input().split()))
ans = 0
for i in range(n):
cnt = 0
while True:
if L[i]%2 == 0:
cnt +=1
L[i]//=2
else:
break
ans +=cnt
print(ans) | 14 | 14 | 259 | 242 | n = int(eval(input()))
li = list(map(int, input().split()))
li = [x for x in li if x % 2 == 0]
li2 = []
for i in range(len(li)):
num = 0
while li[i] % 2 == 0:
li[i] = li[i] / 2
num += 1
li2.append(num)
print((sum(li2)))
| n = int(eval(input()))
L = list(map(int, input().split()))
ans = 0
for i in range(n):
cnt = 0
while True:
if L[i] % 2 == 0:
cnt += 1
L[i] //= 2
else:
break
ans += cnt
print(ans)
| false | 0 | [
"-li = list(map(int, input().split()))",
"-li = [x for x in li if x % 2 == 0]",
"-li2 = []",
"-for i in range(len(li)):",
"- num = 0",
"- while li[i] % 2 == 0:",
"- li[i] = li[i] / 2",
"- num += 1",
"- li2.append(num)",
"-print((sum(li2)))",
"+L = list(map(int, input().spl... | false | 0.064508 | 0.127218 | 0.50707 | [
"s212836666",
"s170074485"
] |
u405483159 | p02779 | python | s150525477 | s936571594 | 92 | 83 | 36,660 | 25,172 | Accepted | Accepted | 9.78 | n = int( eval(input()) )
a = set( map( int, input().split() ) )
if n == len(a):
ans = "YES"
else:
ans = "NO"
print( ans ) | n = int( eval(input()) )
a = list( map( int, input().split() ) )
if len(a) == len(set( a )):
print( "YES" )
else:
print( "NO" ) | 9 | 7 | 129 | 133 | n = int(eval(input()))
a = set(map(int, input().split()))
if n == len(a):
ans = "YES"
else:
ans = "NO"
print(ans)
| n = int(eval(input()))
a = list(map(int, input().split()))
if len(a) == len(set(a)):
print("YES")
else:
print("NO")
| false | 22.222222 | [
"-a = set(map(int, input().split()))",
"-if n == len(a):",
"- ans = \"YES\"",
"+a = list(map(int, input().split()))",
"+if len(a) == len(set(a)):",
"+ print(\"YES\")",
"- ans = \"NO\"",
"-print(ans)",
"+ print(\"NO\")"
] | false | 0.039941 | 0.039868 | 1.001834 | [
"s150525477",
"s936571594"
] |
u810288681 | p02760 | python | s341897477 | s811315344 | 183 | 20 | 38,256 | 3,188 | Accepted | Accepted | 89.07 | a =[list(map(int, input().split())) for i in range(3)]
n=int(eval(input()))
ans = 'No'
for i in range(n):
d = int(eval(input()))
for i in range(3):
for j in range(3):
if d == a[i][j]:
a[i][j]=0
if a[0][0] == 0 and a[1][1] == 0 and a[2][2]==0:
ans = 'Yes'
elif a[0][2] == 0 and a[1][1] == 0 and a[2][0]==0:
ans = 'Yes'
else:
for l in a:
if sum(l)==0:
ans = 'Yes'
break
for l in zip(*a):
if sum(l)==0:
ans = 'Yes'
break
print(ans) | al = []
ans = 'No'
for i in range(3):
al.append(list(map(int, input().split())))
n = int(eval(input()))
bl = [int(eval(input())) for i in range(n)]
for i in bl:
for a in al:
if i in a:
a[a.index(i)]=0
t1 = al[0][0]+al[1][1]+al[2][2]
t2 = al[0][2]+al[1][1]+al[2][0]
if t1 ==0 or t2==0:
ans = 'Yes'
else:
for a in al:
if sum(a)==0:
ans = 'Yes'
break
else:
for va in zip(*al):
if sum(va)==0:
ans = 'Yes'
break
print(ans)
| 26 | 35 | 578 | 636 | a = [list(map(int, input().split())) for i in range(3)]
n = int(eval(input()))
ans = "No"
for i in range(n):
d = int(eval(input()))
for i in range(3):
for j in range(3):
if d == a[i][j]:
a[i][j] = 0
if a[0][0] == 0 and a[1][1] == 0 and a[2][2] == 0:
ans = "Yes"
elif a[0][2] == 0 and a[1][1] == 0 and a[2][0] == 0:
ans = "Yes"
else:
for l in a:
if sum(l) == 0:
ans = "Yes"
break
for l in zip(*a):
if sum(l) == 0:
ans = "Yes"
break
print(ans)
| al = []
ans = "No"
for i in range(3):
al.append(list(map(int, input().split())))
n = int(eval(input()))
bl = [int(eval(input())) for i in range(n)]
for i in bl:
for a in al:
if i in a:
a[a.index(i)] = 0
t1 = al[0][0] + al[1][1] + al[2][2]
t2 = al[0][2] + al[1][1] + al[2][0]
if t1 == 0 or t2 == 0:
ans = "Yes"
else:
for a in al:
if sum(a) == 0:
ans = "Yes"
break
else:
for va in zip(*al):
if sum(va) == 0:
ans = "Yes"
break
print(ans)
| false | 25.714286 | [
"-a = [list(map(int, input().split())) for i in range(3)]",
"+al = []",
"+ans = \"No\"",
"+for i in range(3):",
"+ al.append(list(map(int, input().split())))",
"-ans = \"No\"",
"-for i in range(n):",
"- d = int(eval(input()))",
"- for i in range(3):",
"- for j in range(3):",
"- ... | false | 0.180374 | 0.132263 | 1.36375 | [
"s341897477",
"s811315344"
] |
u392319141 | p03268 | python | s362463663 | s677017018 | 43 | 17 | 3,060 | 2,940 | Accepted | Accepted | 60.47 | N, K = list(map(int, input().split()))
if K == 1:
print((N**3))
exit()
ans = 0
for k in range(K):
if (k * 2) % K != 0:
continue
M = (N // K) - (1 if k == 0 else 0)
if N % K >= k:
M += 1
ans += M**3
print(ans)
| N, K = list(map(int, input().split()))
M = N // K
ans = M * (M - 1) * (M - 2) + M * (M - 1) * 3 + M
if K % 2 == 0:
if N % K >= K // 2:
M += 1
ans += M * (M - 1) * (M - 2) + M * (M - 1) * 3 + M
print(ans)
| 15 | 11 | 257 | 227 | N, K = list(map(int, input().split()))
if K == 1:
print((N**3))
exit()
ans = 0
for k in range(K):
if (k * 2) % K != 0:
continue
M = (N // K) - (1 if k == 0 else 0)
if N % K >= k:
M += 1
ans += M**3
print(ans)
| N, K = list(map(int, input().split()))
M = N // K
ans = M * (M - 1) * (M - 2) + M * (M - 1) * 3 + M
if K % 2 == 0:
if N % K >= K // 2:
M += 1
ans += M * (M - 1) * (M - 2) + M * (M - 1) * 3 + M
print(ans)
| false | 26.666667 | [
"-if K == 1:",
"- print((N**3))",
"- exit()",
"-ans = 0",
"-for k in range(K):",
"- if (k * 2) % K != 0:",
"- continue",
"- M = (N // K) - (1 if k == 0 else 0)",
"- if N % K >= k:",
"+M = N // K",
"+ans = M * (M - 1) * (M - 2) + M * (M - 1) * 3 + M",
"+if K % 2 == 0:",
... | false | 0.036422 | 0.037504 | 0.971143 | [
"s362463663",
"s677017018"
] |
u869790980 | p02702 | python | s779968829 | s371813442 | 1,882 | 1,592 | 106,396 | 89,268 | Accepted | Accepted | 15.41 | import collections
s = list(map(int,input()))
dp = [0] * 2019
count = 0
for j in range(len(s)):
ndp = [0] * 2019
ndp[s[j]] += 1
for k in range(len(dp)):
ndp[(10*k + s[j]) % 2019] += dp[k]
count += ndp[0]
dp = ndp[::]
print(count)
| s = list(map(int,input()))
dp = [0] * 2019
count = 0
for j in range(len(s)):
ndp = [0] * 2019
ndp[s[j]] += 1
for k in range(len(dp)):ndp[(10*k + s[j]) % 2019] += dp[k]
count += ndp[0]
dp = ndp
print(count)
| 16 | 13 | 274 | 238 | import collections
s = list(map(int, input()))
dp = [0] * 2019
count = 0
for j in range(len(s)):
ndp = [0] * 2019
ndp[s[j]] += 1
for k in range(len(dp)):
ndp[(10 * k + s[j]) % 2019] += dp[k]
count += ndp[0]
dp = ndp[::]
print(count)
| s = list(map(int, input()))
dp = [0] * 2019
count = 0
for j in range(len(s)):
ndp = [0] * 2019
ndp[s[j]] += 1
for k in range(len(dp)):
ndp[(10 * k + s[j]) % 2019] += dp[k]
count += ndp[0]
dp = ndp
print(count)
| false | 18.75 | [
"-import collections",
"-",
"- dp = ndp[::]",
"+ dp = ndp"
] | false | 0.043153 | 0.159294 | 0.270905 | [
"s779968829",
"s371813442"
] |
u075595666 | p02796 | python | s969189822 | s088429627 | 309 | 255 | 19,124 | 27,800 | Accepted | Accepted | 17.48 | import sys
input = sys.stdin.readline
n = int(eval(input()))
c = []
for i in range(n):
l,x = list(map(int,input().split()))
c.append((l-x,l+x))
from operator import itemgetter
c = sorted(c,key=itemgetter(0))
c = sorted(c,key=itemgetter(1))
ans = 1
chk = c[0][1]
for i,j in c:
if i >= chk:
ans +=1
chk = j
print(ans) | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
n = int(readline())
m = list(map(int,read().split()))
xl = list(zip(m,m))
c = [(x-l,x+l) for x,l in xl]
from operator import itemgetter
c.sort()
c.sort(key=itemgetter(1))
ans = 1
chk = c[0][1]
for i,j in c:
if i >= chk:
ans +=1
chk = j
print(ans) | 20 | 22 | 345 | 392 | import sys
input = sys.stdin.readline
n = int(eval(input()))
c = []
for i in range(n):
l, x = list(map(int, input().split()))
c.append((l - x, l + x))
from operator import itemgetter
c = sorted(c, key=itemgetter(0))
c = sorted(c, key=itemgetter(1))
ans = 1
chk = c[0][1]
for i, j in c:
if i >= chk:
ans += 1
chk = j
print(ans)
| import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
n = int(readline())
m = list(map(int, read().split()))
xl = list(zip(m, m))
c = [(x - l, x + l) for x, l in xl]
from operator import itemgetter
c.sort()
c.sort(key=itemgetter(1))
ans = 1
chk = c[0][1]
for i, j in c:
if i >= chk:
ans += 1
chk = j
print(ans)
| false | 9.090909 | [
"-input = sys.stdin.readline",
"-n = int(eval(input()))",
"-c = []",
"-for i in range(n):",
"- l, x = list(map(int, input().split()))",
"- c.append((l - x, l + x))",
"+read = sys.stdin.buffer.read",
"+readline = sys.stdin.buffer.readline",
"+readlines = sys.stdin.buffer.readlines",
"+n = int... | false | 0.109444 | 0.046878 | 2.334679 | [
"s969189822",
"s088429627"
] |
u020390084 | p02843 | python | s336710498 | s428268873 | 143 | 42 | 11,636 | 3,864 | Accepted | Accepted | 70.63 | #!/usr/bin/env python3
import sys
def solve(X: int):
dp = [[-1]*(X+1) for _ in range(7)]
price = [100,101,102,103,104,105]
m = [10**5]*6
for i in range(7):
dp[i][0] = 10**5
## i番目まででjを払えるか
for i in range(6):
for j in range(X+1):
if dp[i][j]>=0:
dp[i+1][j] = m[i]
elif j < price[i] or dp[i+1][j-price[i]]<=0:
dp[i+1][j] = -1
else:
dp[i+1][j] = dp[i+1][j-price[i]]-1
if dp[6][X]>=0:
print((1))
else:
print((0))
return
def main():
def iterate_tokens():
for line in sys.stdin:
for word in line.split():
yield word
tokens = iterate_tokens()
X = int(next(tokens)) # type: int
solve(X)
if __name__ == '__main__':
main()
| #!/usr/bin/env python3
import sys
def solve(X: int):
dp = [False for _ in range(X+1)]
dp[0] = True
prices = [100,101,102,103,104,105]
for i in range(1,X+1):
for price in prices:
if i >= price:
if dp[i-price]:
dp[i] = dp[i-price]
break
print((int(dp[X])))
return
def main():
def iterate_tokens():
for line in sys.stdin:
for word in line.split():
yield word
tokens = iterate_tokens()
X = int(next(tokens)) # type: int
solve(X)
if __name__ == '__main__':
main()
| 41 | 30 | 867 | 653 | #!/usr/bin/env python3
import sys
def solve(X: int):
dp = [[-1] * (X + 1) for _ in range(7)]
price = [100, 101, 102, 103, 104, 105]
m = [10**5] * 6
for i in range(7):
dp[i][0] = 10**5
## i番目まででjを払えるか
for i in range(6):
for j in range(X + 1):
if dp[i][j] >= 0:
dp[i + 1][j] = m[i]
elif j < price[i] or dp[i + 1][j - price[i]] <= 0:
dp[i + 1][j] = -1
else:
dp[i + 1][j] = dp[i + 1][j - price[i]] - 1
if dp[6][X] >= 0:
print((1))
else:
print((0))
return
def main():
def iterate_tokens():
for line in sys.stdin:
for word in line.split():
yield word
tokens = iterate_tokens()
X = int(next(tokens)) # type: int
solve(X)
if __name__ == "__main__":
main()
| #!/usr/bin/env python3
import sys
def solve(X: int):
dp = [False for _ in range(X + 1)]
dp[0] = True
prices = [100, 101, 102, 103, 104, 105]
for i in range(1, X + 1):
for price in prices:
if i >= price:
if dp[i - price]:
dp[i] = dp[i - price]
break
print((int(dp[X])))
return
def main():
def iterate_tokens():
for line in sys.stdin:
for word in line.split():
yield word
tokens = iterate_tokens()
X = int(next(tokens)) # type: int
solve(X)
if __name__ == "__main__":
main()
| false | 26.829268 | [
"- dp = [[-1] * (X + 1) for _ in range(7)]",
"- price = [100, 101, 102, 103, 104, 105]",
"- m = [10**5] * 6",
"- for i in range(7):",
"- dp[i][0] = 10**5",
"- ## i番目まででjを払えるか",
"- for i in range(6):",
"- for j in range(X + 1):",
"- if dp[i][j] >= 0:",
"- ... | false | 0.04763 | 0.038838 | 1.226385 | [
"s336710498",
"s428268873"
] |
u893063840 | p02900 | python | s080446085 | s857825598 | 286 | 202 | 4,624 | 3,064 | Accepted | Accepted | 29.37 | from math import sqrt
def is_prime(x):
if x < 2:
return False
for i in range(2, int(sqrt(x)) + 1):
if x % i == 0:
return False
return True
def f(x):
st = set()
for i in range(1, int(sqrt(x)) + 1):
if x % i == 0:
st.add(i)
st.add(x // i)
return st
a, b = list(map(int, input().split()))
a_set = f(a)
b_set = f(b)
ans = 0
for e in a_set:
if is_prime(e) or e == 1:
if e in b_set:
ans += 1
print(ans)
| from math import sqrt
def prime_factorization(x):
li = []
num = x
for i in range(2, int(sqrt(x)) + 1):
if num % i == 0:
cnt = 0
while num % i == 0:
cnt += 1
num //= i
li.append((i, cnt))
if num != 1:
li.append((num, 1))
#if not li:
# li.append((x, 1))
return li
a, b = list(map(int, input().split()))
a_pf = [(1, 1)] + prime_factorization(a)
b_pf = [(1, 1)] + prime_factorization(b)
ans = 0
for ap, at in a_pf:
for bp, bt in b_pf:
if ap == bp:
ans += 1
print(ans)
| 35 | 35 | 544 | 641 | from math import sqrt
def is_prime(x):
if x < 2:
return False
for i in range(2, int(sqrt(x)) + 1):
if x % i == 0:
return False
return True
def f(x):
st = set()
for i in range(1, int(sqrt(x)) + 1):
if x % i == 0:
st.add(i)
st.add(x // i)
return st
a, b = list(map(int, input().split()))
a_set = f(a)
b_set = f(b)
ans = 0
for e in a_set:
if is_prime(e) or e == 1:
if e in b_set:
ans += 1
print(ans)
| from math import sqrt
def prime_factorization(x):
li = []
num = x
for i in range(2, int(sqrt(x)) + 1):
if num % i == 0:
cnt = 0
while num % i == 0:
cnt += 1
num //= i
li.append((i, cnt))
if num != 1:
li.append((num, 1))
# if not li:
# li.append((x, 1))
return li
a, b = list(map(int, input().split()))
a_pf = [(1, 1)] + prime_factorization(a)
b_pf = [(1, 1)] + prime_factorization(b)
ans = 0
for ap, at in a_pf:
for bp, bt in b_pf:
if ap == bp:
ans += 1
print(ans)
| false | 0 | [
"-def is_prime(x):",
"- if x < 2:",
"- return False",
"+def prime_factorization(x):",
"+ li = []",
"+ num = x",
"- if x % i == 0:",
"- return False",
"- return True",
"-",
"-",
"-def f(x):",
"- st = set()",
"- for i in range(1, int(sqrt(x)) + 1):"... | false | 0.107732 | 0.043637 | 2.468832 | [
"s080446085",
"s857825598"
] |
u179169725 | p03240 | python | s952705355 | s112347709 | 594 | 493 | 12,464 | 20,628 | Accepted | Accepted | 17 | # https://atcoder.jp/contests/abc112/tasks/abc112_c
# ピラミッドの中心は必ず0-100の中にある
# Hは1以上
# 与えられる情報だけで一意に定まる
# 中心座標をa,bと置いたとき、ある点x,yにおける高さは
# h(x,y; a,b)=max(H-|x-a|-|y-b|,0)である。
# ここで、真の高さとの誤差としてe(x,y;a,b)=|h(x,y;a,b) - h(x,y;Cx,Cy)|とすると。
# 任意のx,yでe=0となるa,bが答え。しかしHはわからないので0とする。
# そうすると任意のx,yでe(x,y;a,b)=constとなるa,bが答え。(ただしmaxの扱いが面倒なのでh==0は無視して処理を行う)
# またその定数constはHである
# 座標は10**4点。Nはたかだか100なので 最悪10**6回計算。間に合う。
# あー結局全探索してるんだから問題の定義を借りて素直に実装すればバグらせずに済んだな
import numpy as np
from itertools import product
N = int(eval(input()))
X, Y, H = [], [], []
for n in range(N):
x, y, h = list(map(int, input().split()))
X.append(x)
Y.append(y)
H.append(h)
if N == 1:
print((x, y, h))
exit()
X = np.array(X)
Y = np.array(Y)
H = np.array(H)
def is_eq_loss(X, Y, H, a, b):
loss = np.abs(- np.abs(X - a) - np.abs(Y - b) - H)
mask = (H == 0) # 高さがない疑いのところは最小値に合わせる
if np.any(mask):
loss[mask] = loss.min()
if (loss[-1] == loss).all():
return True, loss[-1]
else:
return False, False
# for a, b in product(range(101), range(101)):
# flg, ansH = is_eq_loss(X, Y, H, a, b)
# if flg:
# ans = (a, b, ansH)
# print(*ans)
# バグらせずに実装したい
def is_ok(X, Y, H, a, b):
height = H + np.abs(X - a) + np.abs(Y - b) # minの扱いどうする?
if (height == height[-1]).all():
return True, height[-1]
else:
return False, False
for a, b in product(list(range(101)), list(range(101))):
flg, ansH = is_eq_loss(X, Y, H, a, b)
if flg:
ans = (a, b, ansH)
print((*ans))
| # https://atcoder.jp/contests/abc112/tasks/abc112_c
# ピラミッドの中心は必ず0-100の中にある
# Hは1以上
# 与えられる情報だけで一意に定まる
# 中心座標をa,bと置いたとき、ある点x,yにおける高さは
# h(x,y; a,b)=max(H-|x-a|-|y-b|,0)である。
# ここで、真の高さとの誤差としてe(x,y;a,b)=|h(x,y;a,b) - h(x,y;Cx,Cy)|とすると。
# 任意のx,yでe=0となるa,bが答え。しかしHはわからないので0とする。
# そうすると任意のx,yでe(x,y;a,b)=constとなるa,bが答え。(ただしmaxの扱いが面倒なのでh==0は無視して処理を行う)
# またその定数constはHである
# 座標は10**4点。Nはたかだか100なので 最悪10**6回計算。間に合う。
# あー結局全探索してるんだから問題の定義を借りて素直に実装すればバグらせずに済んだな
import numpy as np
from itertools import product
N = int(eval(input()))
X, Y, H = [], [], []
for n in range(N):
x, y, h = list(map(int, input().split()))
if h == 0:
continue
X.append(x)
Y.append(y)
H.append(h)
if len(H) == 1:
print((X[-1], Y[-1], H[-1]))
exit()
X = np.array(X)
Y = np.array(Y)
H = np.array(H)
def is_ok(X, Y, H, a, b):
height = H + np.abs(X - a) + np.abs(Y - b)
if (height == height[-1]).all():
return True, height[-1]
else:
return False, False
for a, b in product(list(range(101)), list(range(101))):
flg, ansH = is_ok(X, Y, H, a, b)
if flg:
ans = (a, b, ansH)
print((*ans))
| 72 | 53 | 1,609 | 1,167 | # https://atcoder.jp/contests/abc112/tasks/abc112_c
# ピラミッドの中心は必ず0-100の中にある
# Hは1以上
# 与えられる情報だけで一意に定まる
# 中心座標をa,bと置いたとき、ある点x,yにおける高さは
# h(x,y; a,b)=max(H-|x-a|-|y-b|,0)である。
# ここで、真の高さとの誤差としてe(x,y;a,b)=|h(x,y;a,b) - h(x,y;Cx,Cy)|とすると。
# 任意のx,yでe=0となるa,bが答え。しかしHはわからないので0とする。
# そうすると任意のx,yでe(x,y;a,b)=constとなるa,bが答え。(ただしmaxの扱いが面倒なのでh==0は無視して処理を行う)
# またその定数constはHである
# 座標は10**4点。Nはたかだか100なので 最悪10**6回計算。間に合う。
# あー結局全探索してるんだから問題の定義を借りて素直に実装すればバグらせずに済んだな
import numpy as np
from itertools import product
N = int(eval(input()))
X, Y, H = [], [], []
for n in range(N):
x, y, h = list(map(int, input().split()))
X.append(x)
Y.append(y)
H.append(h)
if N == 1:
print((x, y, h))
exit()
X = np.array(X)
Y = np.array(Y)
H = np.array(H)
def is_eq_loss(X, Y, H, a, b):
loss = np.abs(-np.abs(X - a) - np.abs(Y - b) - H)
mask = H == 0 # 高さがない疑いのところは最小値に合わせる
if np.any(mask):
loss[mask] = loss.min()
if (loss[-1] == loss).all():
return True, loss[-1]
else:
return False, False
# for a, b in product(range(101), range(101)):
# flg, ansH = is_eq_loss(X, Y, H, a, b)
# if flg:
# ans = (a, b, ansH)
# print(*ans)
# バグらせずに実装したい
def is_ok(X, Y, H, a, b):
height = H + np.abs(X - a) + np.abs(Y - b) # minの扱いどうする?
if (height == height[-1]).all():
return True, height[-1]
else:
return False, False
for a, b in product(list(range(101)), list(range(101))):
flg, ansH = is_eq_loss(X, Y, H, a, b)
if flg:
ans = (a, b, ansH)
print((*ans))
| # https://atcoder.jp/contests/abc112/tasks/abc112_c
# ピラミッドの中心は必ず0-100の中にある
# Hは1以上
# 与えられる情報だけで一意に定まる
# 中心座標をa,bと置いたとき、ある点x,yにおける高さは
# h(x,y; a,b)=max(H-|x-a|-|y-b|,0)である。
# ここで、真の高さとの誤差としてe(x,y;a,b)=|h(x,y;a,b) - h(x,y;Cx,Cy)|とすると。
# 任意のx,yでe=0となるa,bが答え。しかしHはわからないので0とする。
# そうすると任意のx,yでe(x,y;a,b)=constとなるa,bが答え。(ただしmaxの扱いが面倒なのでh==0は無視して処理を行う)
# またその定数constはHである
# 座標は10**4点。Nはたかだか100なので 最悪10**6回計算。間に合う。
# あー結局全探索してるんだから問題の定義を借りて素直に実装すればバグらせずに済んだな
import numpy as np
from itertools import product
N = int(eval(input()))
X, Y, H = [], [], []
for n in range(N):
x, y, h = list(map(int, input().split()))
if h == 0:
continue
X.append(x)
Y.append(y)
H.append(h)
if len(H) == 1:
print((X[-1], Y[-1], H[-1]))
exit()
X = np.array(X)
Y = np.array(Y)
H = np.array(H)
def is_ok(X, Y, H, a, b):
height = H + np.abs(X - a) + np.abs(Y - b)
if (height == height[-1]).all():
return True, height[-1]
else:
return False, False
for a, b in product(list(range(101)), list(range(101))):
flg, ansH = is_ok(X, Y, H, a, b)
if flg:
ans = (a, b, ansH)
print((*ans))
| false | 26.388889 | [
"+ if h == 0:",
"+ continue",
"-if N == 1:",
"- print((x, y, h))",
"+if len(H) == 1:",
"+ print((X[-1], Y[-1], H[-1]))",
"-def is_eq_loss(X, Y, H, a, b):",
"- loss = np.abs(-np.abs(X - a) - np.abs(Y - b) - H)",
"- mask = H == 0 # 高さがない疑いのところは最小値に合わせる",
"- if np.any(mask):... | false | 0.368501 | 0.277751 | 1.32673 | [
"s952705355",
"s112347709"
] |
u730769327 | p02814 | python | s357835170 | s855309736 | 176 | 162 | 92,928 | 84,040 | Accepted | Accepted | 7.95 | from math import gcd
from functools import reduce
def lcm_base(x, y):
return (x * y) // gcd(x, y)
def lcm(*numbers):
return reduce(lcm_base, numbers, 1)
def evencount(n):
cnt=0
while n%2==0:
cnt+=1
n//=2
return cnt
n,m=list(map(int,input().split()))
a=list(map(int,input().split()))
for i in range(n):
a[i]//=2
if all(evencount(i) == evencount(a[0]) for i in a):
d=lcm(*a)
print(((m+d)//2//d))
else:print((0)) | from math import gcd
from functools import reduce
def lcm_base(x, y):
return (x * y) // gcd(x, y)
def lcm(*numbers):
return reduce(lcm_base, numbers, 1)
n,m=list(map(int,input().split()))
a=list(map(int,input().split()))
for i in range(n):
a[i]//=2
b=lcm(*a)
if b>m:
print((0))
exit()
i=a[0]
j=0
cnt=0
while (i>>j)&1==0:
j+=1
cnt+=1
for i in a[1:]:
j=0
ans=0
while (i>>j)&1==0:
j+=1
ans+=1
if ans!=cnt:
print((0))
break
else:print(((m+b)//(2*b)))
| 20 | 31 | 446 | 512 | from math import gcd
from functools import reduce
def lcm_base(x, y):
return (x * y) // gcd(x, y)
def lcm(*numbers):
return reduce(lcm_base, numbers, 1)
def evencount(n):
cnt = 0
while n % 2 == 0:
cnt += 1
n //= 2
return cnt
n, m = list(map(int, input().split()))
a = list(map(int, input().split()))
for i in range(n):
a[i] //= 2
if all(evencount(i) == evencount(a[0]) for i in a):
d = lcm(*a)
print(((m + d) // 2 // d))
else:
print((0))
| from math import gcd
from functools import reduce
def lcm_base(x, y):
return (x * y) // gcd(x, y)
def lcm(*numbers):
return reduce(lcm_base, numbers, 1)
n, m = list(map(int, input().split()))
a = list(map(int, input().split()))
for i in range(n):
a[i] //= 2
b = lcm(*a)
if b > m:
print((0))
exit()
i = a[0]
j = 0
cnt = 0
while (i >> j) & 1 == 0:
j += 1
cnt += 1
for i in a[1:]:
j = 0
ans = 0
while (i >> j) & 1 == 0:
j += 1
ans += 1
if ans != cnt:
print((0))
break
else:
print(((m + b) // (2 * b)))
| false | 35.483871 | [
"-def evencount(n):",
"- cnt = 0",
"- while n % 2 == 0:",
"- cnt += 1",
"- n //= 2",
"- return cnt",
"-",
"-",
"-if all(evencount(i) == evencount(a[0]) for i in a):",
"- d = lcm(*a)",
"- print(((m + d) // 2 // d))",
"+b = lcm(*a)",
"+if b > m:",
"+ print((0)... | false | 0.045522 | 0.007943 | 5.731124 | [
"s357835170",
"s855309736"
] |
u648212584 | p03253 | python | s213912213 | s223758809 | 213 | 178 | 54,512 | 40,432 | Accepted | Accepted | 16.43 | import sys
input = sys.stdin.buffer.readline
def main():
K,M = list(map(int,input().split()))
def factorize(n):
fct = [] # prime factor
b, e = 2, 0 # base, exponent
while b * b <= n:
while n % b == 0:
n = n // b
e = e + 1
if e > 0:
fct.append((b, e))
b, e = b + 1, 0
if n > 1:
fct.append((n, 1))
return fct
N = 10**6
MOD = 10**9+7
fac = [0]*(N+1)
fac[0],fac[1] = 1,1
invfac = [0]*(N+1)
invfac[0],invfac[1] = 1,1
for i in range(2,N+1):
fac[i] = (fac[i-1]*i)%MOD
invfac[-1] = pow(fac[-1],MOD-2,MOD)
for i in range(N,0,-1):
invfac[i-1] = (invfac[i]*i)%MOD
def coef(x,y):
num = ((fac[x]*invfac[y])%MOD)*invfac[x-y]%MOD
return num
fl = factorize(M)
ans = 1
for pr,cnt in fl:
ans *= coef(K+cnt-1,K-1)
ans %= MOD
print(ans)
if __name__ == "__main__":
main()
| import sys
input = sys.stdin.buffer.readline
def main():
K,M = list(map(int,input().split()))
def factorize(n):
fct = [] # prime factor
b, e = 2, 0 # base, exponent
while b * b <= n:
while n % b == 0:
n = n // b
e = e + 1
if e > 0:
fct.append((b, e))
b, e = b + 1, 0
if n > 1:
fct.append((n, 1))
return fct
N = 10**5+100
MOD = 10**9+7
fac = [0]*(N+1)
fac[0],fac[1] = 1,1
invfac = [0]*(N+1)
invfac[0],invfac[1] = 1,1
for i in range(2,N+1):
fac[i] = (fac[i-1]*i)%MOD
invfac[-1] = pow(fac[-1],MOD-2,MOD)
for i in range(N,0,-1):
invfac[i-1] = (invfac[i]*i)%MOD
def coef(x,y):
num = ((fac[x]*invfac[y])%MOD)*invfac[x-y]%MOD
return num
fl = factorize(M)
ans = 1
for pr,cnt in fl:
ans *= coef(K+cnt-1,K-1)
ans %= MOD
print(ans)
if __name__ == "__main__":
main()
| 49 | 49 | 880 | 884 | import sys
input = sys.stdin.buffer.readline
def main():
K, M = list(map(int, input().split()))
def factorize(n):
fct = [] # prime factor
b, e = 2, 0 # base, exponent
while b * b <= n:
while n % b == 0:
n = n // b
e = e + 1
if e > 0:
fct.append((b, e))
b, e = b + 1, 0
if n > 1:
fct.append((n, 1))
return fct
N = 10**6
MOD = 10**9 + 7
fac = [0] * (N + 1)
fac[0], fac[1] = 1, 1
invfac = [0] * (N + 1)
invfac[0], invfac[1] = 1, 1
for i in range(2, N + 1):
fac[i] = (fac[i - 1] * i) % MOD
invfac[-1] = pow(fac[-1], MOD - 2, MOD)
for i in range(N, 0, -1):
invfac[i - 1] = (invfac[i] * i) % MOD
def coef(x, y):
num = ((fac[x] * invfac[y]) % MOD) * invfac[x - y] % MOD
return num
fl = factorize(M)
ans = 1
for pr, cnt in fl:
ans *= coef(K + cnt - 1, K - 1)
ans %= MOD
print(ans)
if __name__ == "__main__":
main()
| import sys
input = sys.stdin.buffer.readline
def main():
K, M = list(map(int, input().split()))
def factorize(n):
fct = [] # prime factor
b, e = 2, 0 # base, exponent
while b * b <= n:
while n % b == 0:
n = n // b
e = e + 1
if e > 0:
fct.append((b, e))
b, e = b + 1, 0
if n > 1:
fct.append((n, 1))
return fct
N = 10**5 + 100
MOD = 10**9 + 7
fac = [0] * (N + 1)
fac[0], fac[1] = 1, 1
invfac = [0] * (N + 1)
invfac[0], invfac[1] = 1, 1
for i in range(2, N + 1):
fac[i] = (fac[i - 1] * i) % MOD
invfac[-1] = pow(fac[-1], MOD - 2, MOD)
for i in range(N, 0, -1):
invfac[i - 1] = (invfac[i] * i) % MOD
def coef(x, y):
num = ((fac[x] * invfac[y]) % MOD) * invfac[x - y] % MOD
return num
fl = factorize(M)
ans = 1
for pr, cnt in fl:
ans *= coef(K + cnt - 1, K - 1)
ans %= MOD
print(ans)
if __name__ == "__main__":
main()
| false | 0 | [
"- N = 10**6",
"+ N = 10**5 + 100"
] | false | 1.134619 | 0.105661 | 10.738322 | [
"s213912213",
"s223758809"
] |
u146816547 | p00109 | python | s178581054 | s927113497 | 20 | 10 | 6,372 | 6,360 | Accepted | Accepted | 50 | def String2List(s):
L = []
flag = True
l = len(s)
for i in range(l):
if s[i].isdigit() and flag:
t = ""
j = 0
while s[i+j].isdigit():
t += s[i+j]
if i+j == l-1:
break
j += 1
L.append(t)
flag = False
elif not s[i].isdigit():
L.append(s[i])
flag = True
return L
def RPN_list(L):
S, L2 = [], []
table = {"*": 1, "/": 1, "+": 0, "-": 0, "(": -1, ")": -1}
for i in L:
if i.isdigit():
L2.append(i)
elif i == "(":
S.append(i)
elif i == ")":
while S[-1] != "(":
L2.append(S.pop())
S.pop()
else:
while len(S) != 0 and (table[S[-1]] >= table[i]):
L2.append(S.pop())
S.append(i)
while len(S) != 0:
L2.append(S.pop())
return L2
def RPN_cal(L):
St = []
for i in L:
if i == '+':
St.append(int(St.pop()) + int(St.pop()))
elif i == '-':
St.append(-int(St.pop()) + int(St.pop()))
elif i == '*':
St.append(int(St.pop()) * int(St.pop()))
elif i == '/':
a = int(St.pop())
b = float(St.pop())
St.append(b/a)
else:
St.append(i)
return St[0]
N = int(input())
for i in range(N):
s = input()
L = String2List(s[:-1])
L = RPN_list(L)
print(int(RPN_cal(L))) | def String2List(s):
L = []
flag = True
l = len(s)
for i in range(l):
if s[i].isdigit() and flag:
t = ""
j = 0
while s[i+j].isdigit():
t += s[i+j]
if i+j == l-1:
break
j += 1
L.append(t)
flag = False
elif not s[i].isdigit():
L.append(s[i])
flag = True
return L
def Generate_RPN(L):
S, L2 = [], []
table = {"*": 1, "/": 1, "+": 0, "-": 0, "(": -1, ")": -1}
for i in L:
if i.isdigit():
L2.append(i)
elif i == "(":
S.append(i)
elif i == ")":
while S[-1] != "(":
L2.append(S.pop())
S.pop()
else:
while len(S) != 0 and (table[S[-1]] >= table[i]):
L2.append(S.pop())
S.append(i)
while len(S) != 0:
L2.append(S.pop())
return L2
def Calculate_RPN(L):
St = []
for i in L:
if i == '+':
St.append(int(St.pop()) + int(St.pop()))
elif i == '-':
St.append(-int(St.pop()) + int(St.pop()))
elif i == '*':
St.append(int(St.pop()) * int(St.pop()))
elif i == '/':
a = int(St.pop())
b = float(St.pop())
St.append(b/a)
else:
St.append(i)
return St[0]
N = int(input())
for i in range(N):
s = input()
L = Generate_RPN(String2List(s[:-1]))
print(int(Calculate_RPN(L))) | 73 | 72 | 1,637 | 1,635 | def String2List(s):
L = []
flag = True
l = len(s)
for i in range(l):
if s[i].isdigit() and flag:
t = ""
j = 0
while s[i + j].isdigit():
t += s[i + j]
if i + j == l - 1:
break
j += 1
L.append(t)
flag = False
elif not s[i].isdigit():
L.append(s[i])
flag = True
return L
def RPN_list(L):
S, L2 = [], []
table = {"*": 1, "/": 1, "+": 0, "-": 0, "(": -1, ")": -1}
for i in L:
if i.isdigit():
L2.append(i)
elif i == "(":
S.append(i)
elif i == ")":
while S[-1] != "(":
L2.append(S.pop())
S.pop()
else:
while len(S) != 0 and (table[S[-1]] >= table[i]):
L2.append(S.pop())
S.append(i)
while len(S) != 0:
L2.append(S.pop())
return L2
def RPN_cal(L):
St = []
for i in L:
if i == "+":
St.append(int(St.pop()) + int(St.pop()))
elif i == "-":
St.append(-int(St.pop()) + int(St.pop()))
elif i == "*":
St.append(int(St.pop()) * int(St.pop()))
elif i == "/":
a = int(St.pop())
b = float(St.pop())
St.append(b / a)
else:
St.append(i)
return St[0]
N = int(input())
for i in range(N):
s = input()
L = String2List(s[:-1])
L = RPN_list(L)
print(int(RPN_cal(L)))
| def String2List(s):
L = []
flag = True
l = len(s)
for i in range(l):
if s[i].isdigit() and flag:
t = ""
j = 0
while s[i + j].isdigit():
t += s[i + j]
if i + j == l - 1:
break
j += 1
L.append(t)
flag = False
elif not s[i].isdigit():
L.append(s[i])
flag = True
return L
def Generate_RPN(L):
S, L2 = [], []
table = {"*": 1, "/": 1, "+": 0, "-": 0, "(": -1, ")": -1}
for i in L:
if i.isdigit():
L2.append(i)
elif i == "(":
S.append(i)
elif i == ")":
while S[-1] != "(":
L2.append(S.pop())
S.pop()
else:
while len(S) != 0 and (table[S[-1]] >= table[i]):
L2.append(S.pop())
S.append(i)
while len(S) != 0:
L2.append(S.pop())
return L2
def Calculate_RPN(L):
St = []
for i in L:
if i == "+":
St.append(int(St.pop()) + int(St.pop()))
elif i == "-":
St.append(-int(St.pop()) + int(St.pop()))
elif i == "*":
St.append(int(St.pop()) * int(St.pop()))
elif i == "/":
a = int(St.pop())
b = float(St.pop())
St.append(b / a)
else:
St.append(i)
return St[0]
N = int(input())
for i in range(N):
s = input()
L = Generate_RPN(String2List(s[:-1]))
print(int(Calculate_RPN(L)))
| false | 1.369863 | [
"-def RPN_list(L):",
"+def Generate_RPN(L):",
"-def RPN_cal(L):",
"+def Calculate_RPN(L):",
"- L = String2List(s[:-1])",
"- L = RPN_list(L)",
"- print(int(RPN_cal(L)))",
"+ L = Generate_RPN(String2List(s[:-1]))",
"+ print(int(Calculate_RPN(L)))"
] | false | 0.036557 | 0.037986 | 0.962384 | [
"s178581054",
"s927113497"
] |
u361826811 | p03073 | python | s824274170 | s773812097 | 100 | 19 | 3,444 | 3,188 | Accepted | Accepted | 81 | """
author : halo2halo
date : 4, Feb, 2020
"""
import sys
import itertools
# import math
# import numpy as np
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
INF = 10 ** 9
S = readline().decode('utf8').rstrip()
L = len(S)
def odd(M):
while len(M) != L:
if len(M) % 2 == 0:
M += '1'
else:
M += '0'
return M
def even(M):
while len(M) != L:
if len(M) % 2 == 0:
M += '0'
else:
M += '1'
return M
temp = ''
A = odd(temp)
B = even(temp)
na = sum(i == j for i, j in zip(S, A))
nb = sum(i == j for i, j in zip(S, B))
print((min(na, nb)))
| """
author : halo2halo
date : 4, Feb, 2020
"""
import sys
import itertools
# import math
# import numpy as np
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
INF = 10 ** 9
S = readline().decode('utf8').rstrip()
f0 = S[::2].count('0') + S[1::2].count('1')
f1 = S[::2].count('1') + S[1::2].count('0')
print((min(f0, f1))) | 45 | 22 | 735 | 401 | """
author : halo2halo
date : 4, Feb, 2020
"""
import sys
import itertools
# import math
# import numpy as np
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
INF = 10**9
S = readline().decode("utf8").rstrip()
L = len(S)
def odd(M):
while len(M) != L:
if len(M) % 2 == 0:
M += "1"
else:
M += "0"
return M
def even(M):
while len(M) != L:
if len(M) % 2 == 0:
M += "0"
else:
M += "1"
return M
temp = ""
A = odd(temp)
B = even(temp)
na = sum(i == j for i, j in zip(S, A))
nb = sum(i == j for i, j in zip(S, B))
print((min(na, nb)))
| """
author : halo2halo
date : 4, Feb, 2020
"""
import sys
import itertools
# import math
# import numpy as np
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
INF = 10**9
S = readline().decode("utf8").rstrip()
f0 = S[::2].count("0") + S[1::2].count("1")
f1 = S[::2].count("1") + S[1::2].count("0")
print((min(f0, f1)))
| false | 51.111111 | [
"-L = len(S)",
"-",
"-",
"-def odd(M):",
"- while len(M) != L:",
"- if len(M) % 2 == 0:",
"- M += \"1\"",
"- else:",
"- M += \"0\"",
"- return M",
"-",
"-",
"-def even(M):",
"- while len(M) != L:",
"- if len(M) % 2 == 0:",
"- ... | false | 0.039199 | 0.047153 | 0.831307 | [
"s824274170",
"s773812097"
] |
u564902833 | p03112 | python | s512394688 | s439959182 | 1,134 | 955 | 16,128 | 25,476 | Accepted | Accepted | 15.78 | from bisect import bisect_right
A, B, Q = list(map(int, input().split()))
INF = 10 ** 18
s = [-INF] + [int(eval(input())) for i in range(A)] + [INF]
t = [-INF] + [int(eval(input())) for i in range(B)] + [INF]
xs = [int(eval(input())) for i in range(Q)]
for x in xs:
b, d = bisect_right(s, x), bisect_right(t, x)
res = INF
for S in [s[b - 1], s[b]]:
for T in [t[d - 1], t[d]]:
d1, d2 = abs(S - x) + abs(T - S), abs(T - x) + abs(S - T)
res = min(res, d1, d2)
print(res)
| from bisect import bisect_right
# 入力
A, B, Q = list(map(int, input().split()))
s = [int(eval(input())) for _ in range(A)]
t = [int(eval(input())) for _ in range(B)]
x = [int(eval(input())) for _ in range(Q)]
# 計算の便宜のため番兵を導入
INF = 10 ** 18
S = [-INF] + s + [INF]
T = [-INF] + t + [INF]
# 指定した変位に対する問に二分探索を用いて回答
def f(y):
i = bisect_right(S, y)
j = bisect_right(T, y)
return min(
abs(b - a) + min(abs(a - y), abs(b - y))
for a in (S[i - 1], S[i])
for b in (T[j - 1], T[j])
)
# 各問に対して、fにより解を得る
ans = '\n'.join(map(str, list(map(f, x))))
# 出力
print(ans)
| 14 | 29 | 505 | 594 | from bisect import bisect_right
A, B, Q = list(map(int, input().split()))
INF = 10**18
s = [-INF] + [int(eval(input())) for i in range(A)] + [INF]
t = [-INF] + [int(eval(input())) for i in range(B)] + [INF]
xs = [int(eval(input())) for i in range(Q)]
for x in xs:
b, d = bisect_right(s, x), bisect_right(t, x)
res = INF
for S in [s[b - 1], s[b]]:
for T in [t[d - 1], t[d]]:
d1, d2 = abs(S - x) + abs(T - S), abs(T - x) + abs(S - T)
res = min(res, d1, d2)
print(res)
| from bisect import bisect_right
# 入力
A, B, Q = list(map(int, input().split()))
s = [int(eval(input())) for _ in range(A)]
t = [int(eval(input())) for _ in range(B)]
x = [int(eval(input())) for _ in range(Q)]
# 計算の便宜のため番兵を導入
INF = 10**18
S = [-INF] + s + [INF]
T = [-INF] + t + [INF]
# 指定した変位に対する問に二分探索を用いて回答
def f(y):
i = bisect_right(S, y)
j = bisect_right(T, y)
return min(
abs(b - a) + min(abs(a - y), abs(b - y))
for a in (S[i - 1], S[i])
for b in (T[j - 1], T[j])
)
# 各問に対して、fにより解を得る
ans = "\n".join(map(str, list(map(f, x))))
# 出力
print(ans)
| false | 51.724138 | [
"+# 入力",
"+s = [int(eval(input())) for _ in range(A)]",
"+t = [int(eval(input())) for _ in range(B)]",
"+x = [int(eval(input())) for _ in range(Q)]",
"+# 計算の便宜のため番兵を導入",
"-s = [-INF] + [int(eval(input())) for i in range(A)] + [INF]",
"-t = [-INF] + [int(eval(input())) for i in range(B)] + [INF]",
"-xs... | false | 0.113833 | 0.036497 | 3.118933 | [
"s512394688",
"s439959182"
] |
u345966487 | p02623 | python | s937595604 | s169639433 | 241 | 221 | 41,636 | 49,408 | Accepted | Accepted | 8.3 | import sys
from itertools import accumulate
import bisect
sys.setrecursionlimit(10 ** 8)
ini = lambda: int(sys.stdin.readline())
inm = lambda: map(int, sys.stdin.readline().split())
inl = lambda: list(inm())
ins = lambda: sys.stdin.readline().rstrip()
debug = lambda *a, **kw: print("\033[33m", *a, "\033[0m", **dict(file=sys.stderr, **kw))
N, M, K = inm()
A = inl()
B = inl()
def solve():
acum = accumulate(A)
bcum = list(accumulate(B))
ans = 0
for i, b in enumerate(bcum):
if b <= K:
ans = i + 1
for i, x in enumerate(acum):
if x > K:
break
j = bisect.bisect_right(bcum, K - x)
s = i + 1 + j
if ans < s:
ans = s
return ans
print(solve())
| from itertools import accumulate
from bisect import bisect
n, m, k = list(map(int, input().split()))
a = [*list(map(int, input().split()))]
b = [*list(map(int, input().split()))]
ca = [*accumulate(a, initial=0)]
cb = [*accumulate(b, initial=0)]
print((max(i - 1 + bisect(cb, k - x) for i, x in enumerate(ca) if x <= k)))
| 36 | 9 | 783 | 310 | import sys
from itertools import accumulate
import bisect
sys.setrecursionlimit(10**8)
ini = lambda: int(sys.stdin.readline())
inm = lambda: map(int, sys.stdin.readline().split())
inl = lambda: list(inm())
ins = lambda: sys.stdin.readline().rstrip()
debug = lambda *a, **kw: print("\033[33m", *a, "\033[0m", **dict(file=sys.stderr, **kw))
N, M, K = inm()
A = inl()
B = inl()
def solve():
acum = accumulate(A)
bcum = list(accumulate(B))
ans = 0
for i, b in enumerate(bcum):
if b <= K:
ans = i + 1
for i, x in enumerate(acum):
if x > K:
break
j = bisect.bisect_right(bcum, K - x)
s = i + 1 + j
if ans < s:
ans = s
return ans
print(solve())
| from itertools import accumulate
from bisect import bisect
n, m, k = list(map(int, input().split()))
a = [*list(map(int, input().split()))]
b = [*list(map(int, input().split()))]
ca = [*accumulate(a, initial=0)]
cb = [*accumulate(b, initial=0)]
print((max(i - 1 + bisect(cb, k - x) for i, x in enumerate(ca) if x <= k)))
| false | 75 | [
"-import sys",
"-import bisect",
"+from bisect import bisect",
"-sys.setrecursionlimit(10**8)",
"-ini = lambda: int(sys.stdin.readline())",
"-inm = lambda: map(int, sys.stdin.readline().split())",
"-inl = lambda: list(inm())",
"-ins = lambda: sys.stdin.readline().rstrip()",
"-debug = lambda *a, **kw... | false | 0.048546 | 0.11465 | 0.423425 | [
"s937595604",
"s169639433"
] |
u219197917 | p03044 | python | s232181945 | s507437354 | 654 | 580 | 52,456 | 52,564 | Accepted | Accepted | 11.31 | from heapq import heappop, heappush
n = int(eval(input()))
a = [[] for _ in range(n)]
for _ in range(n - 1):
u, v, w = list(map(int, input().split()))
a[u - 1].append((v - 1, w))
a[v - 1].append((u - 1, w))
d = [-1] * n
todo = [(0, 0)]
seen = set()
while todo:
e, p = heappop(todo)
if p in seen:
continue
seen.add(p)
d[p] = e
for pi, ei in a[p]:
heappush(todo, (e + ei, pi))
for di in d:
print((di % 2))
| from collections import deque
n = int(eval(input()))
a = [[] for _ in range(n)]
for _ in range(n - 1):
u, v, w = list(map(int, input().split()))
a[u - 1].append((v - 1, w))
a[v - 1].append((u - 1, w))
d = [-1] * n
todo = deque([(0, 0)])
seen = set()
while todo:
p, e = todo.popleft()
if p in seen:
continue
seen.add(p)
d[p] = e
for pi, ei in a[p]:
todo.append((pi, e + ei))
for di in d:
print((di % 2))
| 21 | 21 | 463 | 462 | from heapq import heappop, heappush
n = int(eval(input()))
a = [[] for _ in range(n)]
for _ in range(n - 1):
u, v, w = list(map(int, input().split()))
a[u - 1].append((v - 1, w))
a[v - 1].append((u - 1, w))
d = [-1] * n
todo = [(0, 0)]
seen = set()
while todo:
e, p = heappop(todo)
if p in seen:
continue
seen.add(p)
d[p] = e
for pi, ei in a[p]:
heappush(todo, (e + ei, pi))
for di in d:
print((di % 2))
| from collections import deque
n = int(eval(input()))
a = [[] for _ in range(n)]
for _ in range(n - 1):
u, v, w = list(map(int, input().split()))
a[u - 1].append((v - 1, w))
a[v - 1].append((u - 1, w))
d = [-1] * n
todo = deque([(0, 0)])
seen = set()
while todo:
p, e = todo.popleft()
if p in seen:
continue
seen.add(p)
d[p] = e
for pi, ei in a[p]:
todo.append((pi, e + ei))
for di in d:
print((di % 2))
| false | 0 | [
"-from heapq import heappop, heappush",
"+from collections import deque",
"-todo = [(0, 0)]",
"+todo = deque([(0, 0)])",
"- e, p = heappop(todo)",
"+ p, e = todo.popleft()",
"- heappush(todo, (e + ei, pi))",
"+ todo.append((pi, e + ei))"
] | false | 0.040506 | 0.039824 | 1.01714 | [
"s232181945",
"s507437354"
] |
u729133443 | p03609 | python | s039205180 | s778802817 | 167 | 23 | 38,384 | 9,000 | Accepted | Accepted | 86.23 | print((max(0,eval(input().replace(' ','-'))))) | print((max(eval(input().replace(*' -')),0))) | 1 | 1 | 44 | 42 | print((max(0, eval(input().replace(" ", "-")))))
| print((max(eval(input().replace(*" -")), 0)))
| false | 0 | [
"-print((max(0, eval(input().replace(\" \", \"-\")))))",
"+print((max(eval(input().replace(*\" -\")), 0)))"
] | false | 0.037278 | 0.062044 | 0.600835 | [
"s039205180",
"s778802817"
] |
u056358163 | p03557 | python | s172627762 | s295820659 | 298 | 225 | 31,892 | 99,176 | Accepted | Accepted | 24.5 | from bisect import bisect
import random
def binary_search(L, n, i, j):
# print(L, n, i, j)
low = i
high = j
while low <= high:
mid = (low + high) //2
guess = L[mid]
# if guess == n:
# return mid
if guess > n:
high = mid -1
else:
low = mid + 1
# print(low)
return low
N = int(eval(input()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
C = list(map(int, input().split()))
# N = 10 ** 5
# A = [random.randint(1, 10**9) for _ in range(N)]
# B = [random.randint(1, 10**9) for _ in range(N)]
# C = [random.randint(1, 10**9) for _ in range(N)]
A.sort()
B.sort()
C.sort()
ans = 0
i, j = 0, 0
A_ind = []
B_cum = [0]
for a in A:
# i = binary_search(B, a, i, N-1)
i = bisect(B, a)
A_ind.append(i)
s = 0
for b in B:
# j = binary_search(C, b, j, N-1)
j = i = bisect(C, b)
s += N-j
B_cum.append(s)
for a in A_ind:
ans += B_cum[-1] - B_cum[a]
print(ans)
| from bisect import bisect_left, bisect_right
# import random
N = int(eval(input()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
C = list(map(int, input().split()))
# N = 10 ** 5
# A = [random.randint(1, 10**9) for _ in range(N)]
# B = [random.randint(1, 10**9) for _ in range(N)]
# C = [random.randint(1, 10**9) for _ in range(N)]
A.sort()
B.sort()
C.sort()
ans = 0
for b in B:
a = bisect_left(A, b)
c = N-bisect_right(C, b)
ans += a * c
print(ans)
| 56 | 24 | 1,059 | 511 | from bisect import bisect
import random
def binary_search(L, n, i, j):
# print(L, n, i, j)
low = i
high = j
while low <= high:
mid = (low + high) // 2
guess = L[mid]
# if guess == n:
# return mid
if guess > n:
high = mid - 1
else:
low = mid + 1
# print(low)
return low
N = int(eval(input()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
C = list(map(int, input().split()))
# N = 10 ** 5
# A = [random.randint(1, 10**9) for _ in range(N)]
# B = [random.randint(1, 10**9) for _ in range(N)]
# C = [random.randint(1, 10**9) for _ in range(N)]
A.sort()
B.sort()
C.sort()
ans = 0
i, j = 0, 0
A_ind = []
B_cum = [0]
for a in A:
# i = binary_search(B, a, i, N-1)
i = bisect(B, a)
A_ind.append(i)
s = 0
for b in B:
# j = binary_search(C, b, j, N-1)
j = i = bisect(C, b)
s += N - j
B_cum.append(s)
for a in A_ind:
ans += B_cum[-1] - B_cum[a]
print(ans)
| from bisect import bisect_left, bisect_right
# import random
N = int(eval(input()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
C = list(map(int, input().split()))
# N = 10 ** 5
# A = [random.randint(1, 10**9) for _ in range(N)]
# B = [random.randint(1, 10**9) for _ in range(N)]
# C = [random.randint(1, 10**9) for _ in range(N)]
A.sort()
B.sort()
C.sort()
ans = 0
for b in B:
a = bisect_left(A, b)
c = N - bisect_right(C, b)
ans += a * c
print(ans)
| false | 57.142857 | [
"-from bisect import bisect",
"-import random",
"+from bisect import bisect_left, bisect_right",
"-",
"-def binary_search(L, n, i, j):",
"- # print(L, n, i, j)",
"- low = i",
"- high = j",
"- while low <= high:",
"- mid = (low + high) // 2",
"- guess = L[mid]",
"- ... | false | 0.048472 | 0.047666 | 1.016914 | [
"s172627762",
"s295820659"
] |
u086716588 | p03161 | python | s694473299 | s338129022 | 1,972 | 327 | 22,916 | 54,752 | Accepted | Accepted | 83.42 | import numpy as np
import sys
imput = sys.stdin.readline
def main():
n, k = list(map(int, input().split()))
h = list(map(int, input().split()))
h = np.array(h)
cost = np.empty(n)
cost[0] = 0
cost[1] = abs(h[1] - h[0])
for i in range(2, n):
j = min(i, k)
cost[i] = np.min(cost[i-j:i] + np.abs(h[i-j:i] - h[i]))
print((int(cost[-1])))
main()
| def main():
n, k = list(map(int, input().split()))
h = tuple(map(int, input().split()))
dp = [0]*(n)
for i in range(1, n):
temp = 10**10
for j in range(1, min(i, k)+1):
temp = min(temp, dp[i-j]+abs(h[i]-h[i-j]))
dp[i] = temp
print((dp[-1]))
if __name__ == '__main__':
main()
| 15 | 16 | 394 | 346 | import numpy as np
import sys
imput = sys.stdin.readline
def main():
n, k = list(map(int, input().split()))
h = list(map(int, input().split()))
h = np.array(h)
cost = np.empty(n)
cost[0] = 0
cost[1] = abs(h[1] - h[0])
for i in range(2, n):
j = min(i, k)
cost[i] = np.min(cost[i - j : i] + np.abs(h[i - j : i] - h[i]))
print((int(cost[-1])))
main()
| def main():
n, k = list(map(int, input().split()))
h = tuple(map(int, input().split()))
dp = [0] * (n)
for i in range(1, n):
temp = 10**10
for j in range(1, min(i, k) + 1):
temp = min(temp, dp[i - j] + abs(h[i] - h[i - j]))
dp[i] = temp
print((dp[-1]))
if __name__ == "__main__":
main()
| false | 6.25 | [
"-import numpy as np",
"-import sys",
"-",
"-imput = sys.stdin.readline",
"+def main():",
"+ n, k = list(map(int, input().split()))",
"+ h = tuple(map(int, input().split()))",
"+ dp = [0] * (n)",
"+ for i in range(1, n):",
"+ temp = 10**10",
"+ for j in range(1, min(i, ... | false | 0.159134 | 0.035528 | 4.479166 | [
"s694473299",
"s338129022"
] |
u670567845 | p02953 | python | s250708163 | s938001519 | 117 | 87 | 14,396 | 85,328 | Accepted | Accepted | 25.64 | N = int(eval(input()))
H = list(map(int,input().split()))
ans = "Yes"
RMH = [0]*N
# 右端から右からi番目の要素のうち最小の値
for i in range(N):
if i == 0:
RMH[i] = H[-i-1]
else:
RMH[i] = min([RMH[i-1],H[-i-1]]) #reversed
# 左からi番目の要素が、左からi+1番目から右端の要素の最小値との差が常に１以下ならOK
for i in range(N-1):
if H[i] - RMH[-i-2] > 1:
ans = "No"
print(ans) | N = int(eval(input()))
H = list(map(int, input().split()))
H.reverse()
def main():
for i in range(N-1):
if (H[i+1] - H[i] >= 2):
print("No")
return
if (H[i+1] - H[i] == 1):
H[i+1] -= 1
print("Yes")
main() | 17 | 13 | 344 | 241 | N = int(eval(input()))
H = list(map(int, input().split()))
ans = "Yes"
RMH = [0] * N
# 右端から右からi番目の要素のうち最小の値
for i in range(N):
if i == 0:
RMH[i] = H[-i - 1]
else:
RMH[i] = min([RMH[i - 1], H[-i - 1]]) # reversed
# 左からi番目の要素が、左からi+1番目から右端の要素の最小値との差が常に１以下ならOK
for i in range(N - 1):
if H[i] - RMH[-i - 2] > 1:
ans = "No"
print(ans)
| N = int(eval(input()))
H = list(map(int, input().split()))
H.reverse()
def main():
for i in range(N - 1):
if H[i + 1] - H[i] >= 2:
print("No")
return
if H[i + 1] - H[i] == 1:
H[i + 1] -= 1
print("Yes")
main()
| false | 23.529412 | [
"-ans = \"Yes\"",
"-RMH = [0] * N",
"-# 右端から右からi番目の要素のうち最小の値",
"-for i in range(N):",
"- if i == 0:",
"- RMH[i] = H[-i - 1]",
"- else:",
"- RMH[i] = min([RMH[i - 1], H[-i - 1]]) # reversed",
"-# 左からi番目の要素が、左からi+1番目から右端の要素の最小値との差が常に１以下ならOK",
"-for i in range(N - 1):",
"- i... | false | 0.0377 | 0.035911 | 1.049816 | [
"s250708163",
"s938001519"
] |
u357751375 | p04045 | python | s501427595 | s079266690 | 130 | 76 | 9,100 | 9,032 | Accepted | Accepted | 41.54 | n,k = list(map(int,input().split()))
d = list(map(int,input().split()))
while True:
a = []
m = n
while m > 0:
a.append(m % 10)
m = m // 10
j = 0
for i in range(len(a)):
if a[i] in d:
break
j += 1
if j == len(a):
print(n)
exit(0)
else:
n += 1 | n,k = list(map(int,input().split()))
d = list(input().split())
flg = True
while flg:
flg = False
m = list(str(n))
for i in m:
if i in d:
flg = True
break
if flg:
n += 1
print(n) | 21 | 13 | 366 | 239 | n, k = list(map(int, input().split()))
d = list(map(int, input().split()))
while True:
a = []
m = n
while m > 0:
a.append(m % 10)
m = m // 10
j = 0
for i in range(len(a)):
if a[i] in d:
break
j += 1
if j == len(a):
print(n)
exit(0)
else:
n += 1
| n, k = list(map(int, input().split()))
d = list(input().split())
flg = True
while flg:
flg = False
m = list(str(n))
for i in m:
if i in d:
flg = True
break
if flg:
n += 1
print(n)
| false | 38.095238 | [
"-d = list(map(int, input().split()))",
"-while True:",
"- a = []",
"- m = n",
"- while m > 0:",
"- a.append(m % 10)",
"- m = m // 10",
"- j = 0",
"- for i in range(len(a)):",
"- if a[i] in d:",
"+d = list(input().split())",
"+flg = True",
"+while flg:",
... | false | 0.043458 | 0.046365 | 0.937317 | [
"s501427595",
"s079266690"
] |
u094155508 | p04001 | python | s440244448 | s515582272 | 28 | 20 | 3,064 | 2,940 | Accepted | Accepted | 28.57 | s = eval(input())
ans = 0
n = len(s) - 1
for i in range(2 ** n):
op = [''] * n
for j in range(n):
if ((i >> j) & 1):
op[n - j - 1] = '+'
formula = ''
for p_n, p_o in zip(s,op+['']):
formula += (p_n+p_o)
ans += eval(formula)
print(ans)
| s = eval(input())
ans = 0
n = len(s)
for i in range(2 ** (n-1)):
t = 0
for j in range(n):
t *= 10
t += int(s[j])
if ((i >> j) & 1):
ans += t
t = 0
ans += t
print(ans)
| 15 | 16 | 293 | 247 | s = eval(input())
ans = 0
n = len(s) - 1
for i in range(2**n):
op = [""] * n
for j in range(n):
if (i >> j) & 1:
op[n - j - 1] = "+"
formula = ""
for p_n, p_o in zip(s, op + [""]):
formula += p_n + p_o
ans += eval(formula)
print(ans)
| s = eval(input())
ans = 0
n = len(s)
for i in range(2 ** (n - 1)):
t = 0
for j in range(n):
t *= 10
t += int(s[j])
if (i >> j) & 1:
ans += t
t = 0
ans += t
print(ans)
| false | 6.25 | [
"-n = len(s) - 1",
"-for i in range(2**n):",
"- op = [\"\"] * n",
"+n = len(s)",
"+for i in range(2 ** (n - 1)):",
"+ t = 0",
"+ t *= 10",
"+ t += int(s[j])",
"- op[n - j - 1] = \"+\"",
"- formula = \"\"",
"- for p_n, p_o in zip(s, op + [\"\"]):",
"- ... | false | 0.044549 | 0.081446 | 0.546971 | [
"s440244448",
"s515582272"
] |
u255067135 | p03353 | python | s827906302 | s013849745 | 1,779 | 37 | 3,952 | 5,052 | Accepted | Accepted | 97.92 | s = str(eval(input()))
K = int(eval(input()))
stack = []
for i in range(len(s)):
for j in range(i+1, min(i+K, len(s))+1):
sub = s[i:j]
if sub not in stack:
stack.append(sub)
stack.sort()
print((stack[K-1])) | s = str(eval(input()))
K = int(eval(input()))
stack = []
for i in range(len(s)):
for j in range(i+1, min(i+K, len(s))+1):
sub = s[i:j]
stack.append(sub)
stack = sorted(set(stack))
print((stack[K-1])) | 10 | 9 | 233 | 213 | s = str(eval(input()))
K = int(eval(input()))
stack = []
for i in range(len(s)):
for j in range(i + 1, min(i + K, len(s)) + 1):
sub = s[i:j]
if sub not in stack:
stack.append(sub)
stack.sort()
print((stack[K - 1]))
| s = str(eval(input()))
K = int(eval(input()))
stack = []
for i in range(len(s)):
for j in range(i + 1, min(i + K, len(s)) + 1):
sub = s[i:j]
stack.append(sub)
stack = sorted(set(stack))
print((stack[K - 1]))
| false | 10 | [
"- if sub not in stack:",
"- stack.append(sub)",
"-stack.sort()",
"+ stack.append(sub)",
"+stack = sorted(set(stack))"
] | false | 0.088446 | 0.042917 | 2.060864 | [
"s827906302",
"s013849745"
] |
u342563578 | p02573 | python | s786477719 | s108448497 | 641 | 581 | 97,548 | 100,488 | Accepted | Accepted | 9.36 | n,m = list(map(int,input().split()))
par = []
for i in range(n):
par.append(i) #初期親
rank = [1 for i in range(n)] #初期ランク
cut = []
def find(n): #親検索andランク短縮
global cut
if par[n] == n:
for i in range(len(cut)):
par[cut[i]] = n
cut = []
return n
else:
cut.append(n)
find(par[n])
return find(par[n])
def shorten(n): # 根に直接接続する
global cut
if par[n] == n:
for i in range(len(cut)):
par[cut[i]] = n
cut = []
else:
cut.append(n)
shorten(par[n])
def unite(a,b): #グループ併合
x = find(a)
y = find(b) #根っこ同士をくっつける
if x == y:
return #既に同一ユニオンなら何もしない
if rank[x] < rank[y]:
par[x] = y
elif rank[x] == rank[y]:
par[y] = x
rank[x] += 1
else:
par[y] = x
def judge(a,b):
return par[a] == par[b]
for i in range(m):
a,b = list(map(int,input().split()))
a -= 1
b -= 1
unite(a,b)
for i in range(n):
shorten(i)
import collections
c = collections.Counter(par)
ans = 0
for i in range(n):
ans = max(ans,c[i])
print(ans) | n,m = list(map(int,input().split()))
par = []
for i in range(n):
par.append(-1) #初期親
rank = [1 for i in range(n)] #初期ランク
cut = []
def find(n): #親検索andランク短縮
global cut
if par[n] < 0:
for i in range(len(cut)):
par[cut[i]] = n
cut = []
return n
else:
cut.append(n)
find(par[n])
return find(par[n])
def shorten(n): # 根に直接接続する
global cut
if par[n] < 0:
for i in range(len(cut)):
par[cut[i]] = n
cut = []
else:
cut.append(n)
shorten(par[n])
def unite(a,b): #グループ併合
x = find(a)
y = find(b) #根っこ同士をくっつける
if x == y:
return #既に同一ユニオンなら何もしない
if rank[x] < rank[y]:
par[y] += par[x]
par[x] = y
elif rank[x] == rank[y]:
par[x] += par[y]
par[y] = x
rank[x] += 1
else:
par[x] += par[y]
par[y] = x
def judge(a,b):
return par[a] == par[b]
for i in range(m):
a,b = list(map(int,input().split()))
a -= 1
b -= 1
unite(a,b)
ans = 0
for i in range(n):
ans = max(ans,-par[i])
print(ans) | 53 | 52 | 1,157 | 1,151 | n, m = list(map(int, input().split()))
par = []
for i in range(n):
par.append(i) # 初期親
rank = [1 for i in range(n)] # 初期ランク
cut = []
def find(n): # 親検索andランク短縮
global cut
if par[n] == n:
for i in range(len(cut)):
par[cut[i]] = n
cut = []
return n
else:
cut.append(n)
find(par[n])
return find(par[n])
def shorten(n): # 根に直接接続する
global cut
if par[n] == n:
for i in range(len(cut)):
par[cut[i]] = n
cut = []
else:
cut.append(n)
shorten(par[n])
def unite(a, b): # グループ併合
x = find(a)
y = find(b) # 根っこ同士をくっつける
if x == y:
return # 既に同一ユニオンなら何もしない
if rank[x] < rank[y]:
par[x] = y
elif rank[x] == rank[y]:
par[y] = x
rank[x] += 1
else:
par[y] = x
def judge(a, b):
return par[a] == par[b]
for i in range(m):
a, b = list(map(int, input().split()))
a -= 1
b -= 1
unite(a, b)
for i in range(n):
shorten(i)
import collections
c = collections.Counter(par)
ans = 0
for i in range(n):
ans = max(ans, c[i])
print(ans)
| n, m = list(map(int, input().split()))
par = []
for i in range(n):
par.append(-1) # 初期親
rank = [1 for i in range(n)] # 初期ランク
cut = []
def find(n): # 親検索andランク短縮
global cut
if par[n] < 0:
for i in range(len(cut)):
par[cut[i]] = n
cut = []
return n
else:
cut.append(n)
find(par[n])
return find(par[n])
def shorten(n): # 根に直接接続する
global cut
if par[n] < 0:
for i in range(len(cut)):
par[cut[i]] = n
cut = []
else:
cut.append(n)
shorten(par[n])
def unite(a, b): # グループ併合
x = find(a)
y = find(b) # 根っこ同士をくっつける
if x == y:
return # 既に同一ユニオンなら何もしない
if rank[x] < rank[y]:
par[y] += par[x]
par[x] = y
elif rank[x] == rank[y]:
par[x] += par[y]
par[y] = x
rank[x] += 1
else:
par[x] += par[y]
par[y] = x
def judge(a, b):
return par[a] == par[b]
for i in range(m):
a, b = list(map(int, input().split()))
a -= 1
b -= 1
unite(a, b)
ans = 0
for i in range(n):
ans = max(ans, -par[i])
print(ans)
| false | 1.886792 | [
"- par.append(i) # 初期親",
"+ par.append(-1) # 初期親",
"- if par[n] == n:",
"+ if par[n] < 0:",
"- if par[n] == n:",
"+ if par[n] < 0:",
"+ par[y] += par[x]",
"+ par[x] += par[y]",
"+ par[x] += par[y]",
"-for i in range(n):",
"- shorten(i)",
"-import col... | false | 0.038489 | 0.104817 | 0.367197 | [
"s786477719",
"s108448497"
] |
u631277801 | p03607 | python | s440272357 | s123237024 | 202 | 101 | 13,204 | 16,636 | Accepted | Accepted | 50 | n = int(eval(input()))
a = [int(eval(input())) for _ in range(n)]
a_set = set()
for ai in a:
if ai in a_set:
a_set.remove(ai)
else:
a_set.add(ai)
print((len(a_set))) | import sys
stdin = sys.stdin
def li(): return list(map(int, stdin.readline().split()))
def li_(): return [int(x)-1 for x in stdin.readline().split()]
def lf(): return list(map(float, stdin.readline().split()))
def ls(): return stdin.readline().split()
def ns(): return stdin.readline().rstrip()
def lc(): return list(ns())
def ni(): return int(stdin.readline())
def nf(): return float(stdin.readline())
from collections import Counter
n = ni()
a = [ni() for _ in range(n)]
cnt = Counter(a)
ans = 0
for ci in list(cnt.values()):
if ci % 2 == 1:
ans += 1
print(ans) | 12 | 25 | 197 | 600 | n = int(eval(input()))
a = [int(eval(input())) for _ in range(n)]
a_set = set()
for ai in a:
if ai in a_set:
a_set.remove(ai)
else:
a_set.add(ai)
print((len(a_set)))
| import sys
stdin = sys.stdin
def li():
return list(map(int, stdin.readline().split()))
def li_():
return [int(x) - 1 for x in stdin.readline().split()]
def lf():
return list(map(float, stdin.readline().split()))
def ls():
return stdin.readline().split()
def ns():
return stdin.readline().rstrip()
def lc():
return list(ns())
def ni():
return int(stdin.readline())
def nf():
return float(stdin.readline())
from collections import Counter
n = ni()
a = [ni() for _ in range(n)]
cnt = Counter(a)
ans = 0
for ci in list(cnt.values()):
if ci % 2 == 1:
ans += 1
print(ans)
| false | 52 | [
"-n = int(eval(input()))",
"-a = [int(eval(input())) for _ in range(n)]",
"-a_set = set()",
"-for ai in a:",
"- if ai in a_set:",
"- a_set.remove(ai)",
"- else:",
"- a_set.add(ai)",
"-print((len(a_set)))",
"+import sys",
"+",
"+stdin = sys.stdin",
"+",
"+",
"+def li()... | false | 0.158345 | 0.110635 | 1.431235 | [
"s440272357",
"s123237024"
] |
u368796742 | p03305 | python | s424821823 | s718672866 | 1,173 | 1,020 | 61,024 | 60,332 | Accepted | Accepted | 13.04 | from heapq import heappush, heappop
n,m,s,t = map(int,input().split())
e = [[] for i in range(n+1)]
for i in range(m):
u,v,a,b = map(int,input().split())
e[u].append((v,a,b))
e[v].append((u,a,b))
def dik(s,v):
S = [float("INF")]*(n+1)
S[s] = 0
h = []
heappush(h,[0,s])
while h:
d,now = heappop(h)
for nex in e[now]:
a,b = nex[0],nex[v]
if d+b < S[a]:
S[a] = d+b
heappush(h,[d+b,a])
return S
S = dik(s,1)
T = dik(t,2)
ans = [0]*(n)
cost = 10**15
now = 0
for i in range(n-1,-1,-1):
now = max(now,cost-S[i+1]-T[i+1])
ans[i] = now
print(*ans,sep="\n")
| from heapq import heappush as pu, heappop as po
n,m,s,t = map(int,input().split())
e = [[] for i in range(n+1)]
for i in range(m):
u,v,a,b = map(int,input().split())
e[u].append((v,a,b))
e[v].append((u,a,b))
def dik(s,v):
S = [float("INF")]*(n+1)
S[s] = 0
h = []
pu(h,[0,s])
while h:
d,now = po(h)
for nex in e[now]:
a,b = nex[0],nex[v]
if d+b < S[a]:
S[a] = d+b
pu(h,[d+b,a])
return S[::-1]
ans = []
cost = 10**15
now = 0
for i,j in zip(dik(s,1),dik(t,2)):
now = max(now,cost-i-j)
ans.append(now)
print(*ans[:-1][::-1],sep="\n")
| 31 | 29 | 699 | 675 | from heapq import heappush, heappop
n, m, s, t = map(int, input().split())
e = [[] for i in range(n + 1)]
for i in range(m):
u, v, a, b = map(int, input().split())
e[u].append((v, a, b))
e[v].append((u, a, b))
def dik(s, v):
S = [float("INF")] * (n + 1)
S[s] = 0
h = []
heappush(h, [0, s])
while h:
d, now = heappop(h)
for nex in e[now]:
a, b = nex[0], nex[v]
if d + b < S[a]:
S[a] = d + b
heappush(h, [d + b, a])
return S
S = dik(s, 1)
T = dik(t, 2)
ans = [0] * (n)
cost = 10**15
now = 0
for i in range(n - 1, -1, -1):
now = max(now, cost - S[i + 1] - T[i + 1])
ans[i] = now
print(*ans, sep="\n")
| from heapq import heappush as pu, heappop as po
n, m, s, t = map(int, input().split())
e = [[] for i in range(n + 1)]
for i in range(m):
u, v, a, b = map(int, input().split())
e[u].append((v, a, b))
e[v].append((u, a, b))
def dik(s, v):
S = [float("INF")] * (n + 1)
S[s] = 0
h = []
pu(h, [0, s])
while h:
d, now = po(h)
for nex in e[now]:
a, b = nex[0], nex[v]
if d + b < S[a]:
S[a] = d + b
pu(h, [d + b, a])
return S[::-1]
ans = []
cost = 10**15
now = 0
for i, j in zip(dik(s, 1), dik(t, 2)):
now = max(now, cost - i - j)
ans.append(now)
print(*ans[:-1][::-1], sep="\n")
| false | 6.451613 | [
"-from heapq import heappush, heappop",
"+from heapq import heappush as pu, heappop as po",
"- heappush(h, [0, s])",
"+ pu(h, [0, s])",
"- d, now = heappop(h)",
"+ d, now = po(h)",
"- heappush(h, [d + b, a])",
"- return S",
"+ pu(h, [d + b, a])",
... | false | 0.038772 | 0.039325 | 0.98594 | [
"s424821823",
"s718672866"
] |
u716530146 | p02720 | python | s492874012 | s876680185 | 458 | 223 | 68,572 | 7,792 | Accepted | Accepted | 51.31 | #!/usr/bin/env python3
import sys, math, itertools, collections, bisect
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
inf = float('inf') ;mod = 10**9+7
mans = inf ;ans = 0 ;count = 0 ;pro = 1
sys.setrecursionlimit(10**7)
k = int(eval(input()))
data = [1,2,3,4,5,6,7,8,9]
def dfs(prenum,numberstr):
if int(numberstr) > 3234566667:return
if prenum - 1 >= 0:
data.append(int(numberstr+str(prenum-1)))
dfs(prenum-1,numberstr+str(prenum-1))
data.append(int(numberstr+str(prenum)))
dfs(prenum,numberstr+str(prenum))
if prenum +1 <= 9:
data.append(int(numberstr+str(prenum+1)))
dfs(prenum+1,numberstr+str(prenum+1))
for i in range(1,10):
dfs(i,str(i))
data.sort()
print((data[k-1]))
# print(data[:20])
# print(len(data)) | #!/usr/bin/env python3
import sys, math, itertools, collections, bisect
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
inf = float('inf') ;mod = 10**9+7
mans = inf ;ans = 0 ;count = 0 ;pro = 1
sys.setrecursionlimit(10**7)
k = int(eval(input()))
ans = []
def dfs(string):
if int(string) > 3234566667: return
ans.append(int(string))
botom = string[-1]
intbotom = int(botom)
if 0 <= intbotom -1 :
dfs(string + str(intbotom-1))
dfs(string+botom)
if intbotom + 1 <= 9:
dfs(string + str(intbotom+1))
for i in range(1,10):
dfs(str(i))
ans .sort()
print((ans[k-1])) | 26 | 24 | 783 | 620 | #!/usr/bin/env python3
import sys, math, itertools, collections, bisect
input = lambda: sys.stdin.buffer.readline().rstrip().decode("utf-8")
inf = float("inf")
mod = 10**9 + 7
mans = inf
ans = 0
count = 0
pro = 1
sys.setrecursionlimit(10**7)
k = int(eval(input()))
data = [1, 2, 3, 4, 5, 6, 7, 8, 9]
def dfs(prenum, numberstr):
if int(numberstr) > 3234566667:
return
if prenum - 1 >= 0:
data.append(int(numberstr + str(prenum - 1)))
dfs(prenum - 1, numberstr + str(prenum - 1))
data.append(int(numberstr + str(prenum)))
dfs(prenum, numberstr + str(prenum))
if prenum + 1 <= 9:
data.append(int(numberstr + str(prenum + 1)))
dfs(prenum + 1, numberstr + str(prenum + 1))
for i in range(1, 10):
dfs(i, str(i))
data.sort()
print((data[k - 1]))
# print(data[:20])
# print(len(data))
| #!/usr/bin/env python3
import sys, math, itertools, collections, bisect
input = lambda: sys.stdin.buffer.readline().rstrip().decode("utf-8")
inf = float("inf")
mod = 10**9 + 7
mans = inf
ans = 0
count = 0
pro = 1
sys.setrecursionlimit(10**7)
k = int(eval(input()))
ans = []
def dfs(string):
if int(string) > 3234566667:
return
ans.append(int(string))
botom = string[-1]
intbotom = int(botom)
if 0 <= intbotom - 1:
dfs(string + str(intbotom - 1))
dfs(string + botom)
if intbotom + 1 <= 9:
dfs(string + str(intbotom + 1))
for i in range(1, 10):
dfs(str(i))
ans.sort()
print((ans[k - 1]))
| false | 7.692308 | [
"-data = [1, 2, 3, 4, 5, 6, 7, 8, 9]",
"+ans = []",
"-def dfs(prenum, numberstr):",
"- if int(numberstr) > 3234566667:",
"+def dfs(string):",
"+ if int(string) > 3234566667:",
"- if prenum - 1 >= 0:",
"- data.append(int(numberstr + str(prenum - 1)))",
"- dfs(prenum - 1, number... | false | 0.981732 | 0.592721 | 1.656314 | [
"s492874012",
"s876680185"
] |
u021019433 | p02928 | python | s058641375 | s787583194 | 319 | 273 | 3,564 | 3,564 | Accepted | Accepted | 14.42 | from collections import Counter
R = lambda: list(map(int, input().split()))
n, k = R()
a = list(R())
r = k * sum(a[i] < a[j] for i in range(n) for j in range(i))
r += k*(k-1)//2 * (n*(n-1)//2 - sum(x*(x-1)//2 for x in list(Counter(a).values())))
print((r % (10**9 + 7)))
| from collections import Counter
R = lambda: list(map(int, input().split()))
n, k = R()
a = list(R())
r = sum(k for i in range(n) for j in range(i) if a[i] < a[j])
r += k*(k-1)//2 * (n*(n-1)//2 - sum(x*(x-1)//2 for x in list(Counter(a).values())))
print((r % (10**9 + 7)))
| 7 | 7 | 263 | 264 | from collections import Counter
R = lambda: list(map(int, input().split()))
n, k = R()
a = list(R())
r = k * sum(a[i] < a[j] for i in range(n) for j in range(i))
r += (
k
* (k - 1)
// 2
* (n * (n - 1) // 2 - sum(x * (x - 1) // 2 for x in list(Counter(a).values())))
)
print((r % (10**9 + 7)))
| from collections import Counter
R = lambda: list(map(int, input().split()))
n, k = R()
a = list(R())
r = sum(k for i in range(n) for j in range(i) if a[i] < a[j])
r += (
k
* (k - 1)
// 2
* (n * (n - 1) // 2 - sum(x * (x - 1) // 2 for x in list(Counter(a).values())))
)
print((r % (10**9 + 7)))
| false | 0 | [
"-r = k * sum(a[i] < a[j] for i in range(n) for j in range(i))",
"+r = sum(k for i in range(n) for j in range(i) if a[i] < a[j])"
] | false | 0.035791 | 0.132888 | 0.269334 | [
"s058641375",
"s787583194"
] |
u631277801 | p03805 | python | s979131905 | s958996706 | 38 | 31 | 3,064 | 3,572 | Accepted | Accepted | 18.42 | # 入力
import sys
stdin = sys.stdin
def li(): return [int(x) for x in stdin.readline().split()]
def li_(): return [int(x)-1 for x in stdin.readline().split()]
def lf(): return [float(x) for x in stdin.readline().split()]
def ls(): return stdin.readline().split()
def ns(): return stdin.readline().rstrip()
def lc(): return list(ns())
def ni(): return int(ns())
def nf(): return float(ns())
from itertools import permutations
# 全探索をするのです
n,m = li()
edges = set()
for _ in range(m):
a,b = li()
edges.add((a,b))
edges.add((b,a))
paths = permutations([str(i) for i in range(2,n+1)],n-1)
cnt = 0
for path in paths:
path = [1] + [int(i) for i in path]
exist = True
for i in range(n-1):
if not (path[i], path[i+1]) in edges:
exist = False
if exist:
cnt += 1
print(cnt) | import sys
stdin = sys.stdin
sys.setrecursionlimit(10**5)
def li(): return list(map(int, stdin.readline().split()))
def li_(): return [int(x)-1 for x in stdin.readline().split()]
def lf(): return list(map(float, stdin.readline().split()))
def ls(): return stdin.readline().split()
def ns(): return stdin.readline().rstrip()
def lc(): return list(ns())
def ni(): return int(stdin.readline())
def nf(): return float(stdin.readline())
from itertools import permutations
n,m = li()
graph = [[False]*n for _ in range(n)]
for _ in range(m):
a,b = li_()
graph[a][b] = True
graph[b][a] = True
cands = list(permutations([i for i in range(1,n)]))
ans = 0
for c in cands:
cand = [0] + list(c)
ok = True
for i in range(n-1):
if not graph[cand[i+1]][cand[i]]:
ok = False
if ok:
ans += 1
print(ans) | 37 | 39 | 874 | 899 | # 入力
import sys
stdin = sys.stdin
def li():
return [int(x) for x in stdin.readline().split()]
def li_():
return [int(x) - 1 for x in stdin.readline().split()]
def lf():
return [float(x) for x in stdin.readline().split()]
def ls():
return stdin.readline().split()
def ns():
return stdin.readline().rstrip()
def lc():
return list(ns())
def ni():
return int(ns())
def nf():
return float(ns())
from itertools import permutations
# 全探索をするのです
n, m = li()
edges = set()
for _ in range(m):
a, b = li()
edges.add((a, b))
edges.add((b, a))
paths = permutations([str(i) for i in range(2, n + 1)], n - 1)
cnt = 0
for path in paths:
path = [1] + [int(i) for i in path]
exist = True
for i in range(n - 1):
if not (path[i], path[i + 1]) in edges:
exist = False
if exist:
cnt += 1
print(cnt)
| import sys
stdin = sys.stdin
sys.setrecursionlimit(10**5)
def li():
return list(map(int, stdin.readline().split()))
def li_():
return [int(x) - 1 for x in stdin.readline().split()]
def lf():
return list(map(float, stdin.readline().split()))
def ls():
return stdin.readline().split()
def ns():
return stdin.readline().rstrip()
def lc():
return list(ns())
def ni():
return int(stdin.readline())
def nf():
return float(stdin.readline())
from itertools import permutations
n, m = li()
graph = [[False] * n for _ in range(n)]
for _ in range(m):
a, b = li_()
graph[a][b] = True
graph[b][a] = True
cands = list(permutations([i for i in range(1, n)]))
ans = 0
for c in cands:
cand = [0] + list(c)
ok = True
for i in range(n - 1):
if not graph[cand[i + 1]][cand[i]]:
ok = False
if ok:
ans += 1
print(ans)
| false | 5.128205 | [
"-# 入力",
"+sys.setrecursionlimit(10**5)",
"- return [int(x) for x in stdin.readline().split()]",
"+ return list(map(int, stdin.readline().split()))",
"- return [float(x) for x in stdin.readline().split()]",
"+ return list(map(float, stdin.readline().split()))",
"- return int(ns())",
"+ ... | false | 0.132892 | 0.058364 | 2.276932 | [
"s979131905",
"s958996706"
] |
u297109012 | p03128 | python | s696755190 | s195965246 | 268 | 239 | 52,444 | 51,164 | Accepted | Accepted | 10.82 | Matches = {num: c for num, c in zip([1, 2, 3, 4, 5, 6, 7, 8, 9], [2, 5, 5, 4, 5, 6, 3, 7, 6])}
def solve(N, M, As):
dp = [-1 for _ in range(N + 1)]
dp[0] = 0
for i in range(N):
for a in sorted(As, reverse=True):
c = Matches[a]
if dp[i] == -1:
continue
if i + c <= N:
dp[i + c] = max(dp[i+c],
dp[i] * 10 + a)
return dp[N]
if __name__ == "__main__":
N, M = tuple(map(int, input().split(" ")))
As = list(map(int, input().split(" ")))
print((solve(N, M, As)))
| Matches = {num: c for num, c in zip([1, 2, 3, 4, 5, 6, 7, 8, 9], [2, 5, 5, 4, 5, 6, 3, 7, 6])}
def solve(N, M, As):
dp = [-1 for _ in range(N + 1)]
dp[0] = 0
for i in range(N + 1):
for a in As:
c = Matches[a]
if dp[i] == -1:
continue
if i + c <= N:
dp[i + c] = max(dp[i + c],
dp[i] * 10 + a)
return dp[N]
if __name__ == "__main__":
N, M = tuple(map(int, input().split(" ")))
As = list(map(int, input().split(" ")))
print((solve(N, M, As)))
| 20 | 20 | 612 | 596 | Matches = {
num: c for num, c in zip([1, 2, 3, 4, 5, 6, 7, 8, 9], [2, 5, 5, 4, 5, 6, 3, 7, 6])
}
def solve(N, M, As):
dp = [-1 for _ in range(N + 1)]
dp[0] = 0
for i in range(N):
for a in sorted(As, reverse=True):
c = Matches[a]
if dp[i] == -1:
continue
if i + c <= N:
dp[i + c] = max(dp[i + c], dp[i] * 10 + a)
return dp[N]
if __name__ == "__main__":
N, M = tuple(map(int, input().split(" ")))
As = list(map(int, input().split(" ")))
print((solve(N, M, As)))
| Matches = {
num: c for num, c in zip([1, 2, 3, 4, 5, 6, 7, 8, 9], [2, 5, 5, 4, 5, 6, 3, 7, 6])
}
def solve(N, M, As):
dp = [-1 for _ in range(N + 1)]
dp[0] = 0
for i in range(N + 1):
for a in As:
c = Matches[a]
if dp[i] == -1:
continue
if i + c <= N:
dp[i + c] = max(dp[i + c], dp[i] * 10 + a)
return dp[N]
if __name__ == "__main__":
N, M = tuple(map(int, input().split(" ")))
As = list(map(int, input().split(" ")))
print((solve(N, M, As)))
| false | 0 | [
"- for i in range(N):",
"- for a in sorted(As, reverse=True):",
"+ for i in range(N + 1):",
"+ for a in As:"
] | false | 0.044199 | 0.043717 | 1.011031 | [
"s696755190",
"s195965246"
] |
u512212329 | p02606 | python | s078373928 | s418821921 | 29 | 26 | 9,160 | 9,072 | Accepted | Accepted | 10.34 | def main():
left, right, div = [int(x) for x in input().split()]
ans = sum(x % div == 0 for x in range(left, right + 1))
print(ans)
if __name__ == '__main__':
main()
| def main():
left, right, div = [int(x) for x in input().split()]
ans = right // div - (left - 1) // div
print(ans)
if __name__ == '__main__':
main()
| 8 | 8 | 191 | 174 | def main():
left, right, div = [int(x) for x in input().split()]
ans = sum(x % div == 0 for x in range(left, right + 1))
print(ans)
if __name__ == "__main__":
main()
| def main():
left, right, div = [int(x) for x in input().split()]
ans = right // div - (left - 1) // div
print(ans)
if __name__ == "__main__":
main()
| false | 0 | [
"- ans = sum(x % div == 0 for x in range(left, right + 1))",
"+ ans = right // div - (left - 1) // div"
] | false | 0.109768 | 0.047447 | 2.313498 | [
"s078373928",
"s418821921"
] |
u167908302 | p02848 | python | s059319882 | s524879030 | 51 | 21 | 3,188 | 3,188 | Accepted | Accepted | 58.82 | #coding:utf-8
n = int(eval(input()))
s = eval(input())
string = ['A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P','Q','R','S','T','U','V','W','X','Y','Z']
letter = []
ans = []
for i in s:
letter.append(i)
for i in letter:
for j in range(0, 26):
if i == string[j]:
tmp = j + n
#print(tmp)
if tmp > 25:
tmp = tmp % 26
ans.append(string[tmp])
#print(ans)
print((''.join(ans)))
| #coding:utf-8
n = int(eval(input()))
s = list(eval(input()))
#print(s)
ans = []
for i in s:
tmp = ((ord(i) - 65 + n) % 26) + 65
ans.append(chr(tmp))
print((''.join(ans))) | 22 | 11 | 481 | 176 | # coding:utf-8
n = int(eval(input()))
s = eval(input())
string = [
"A",
"B",
"C",
"D",
"E",
"F",
"G",
"H",
"I",
"J",
"K",
"L",
"M",
"N",
"O",
"P",
"Q",
"R",
"S",
"T",
"U",
"V",
"W",
"X",
"Y",
"Z",
]
letter = []
ans = []
for i in s:
letter.append(i)
for i in letter:
for j in range(0, 26):
if i == string[j]:
tmp = j + n
# print(tmp)
if tmp > 25:
tmp = tmp % 26
ans.append(string[tmp])
# print(ans)
print(("".join(ans)))
| # coding:utf-8
n = int(eval(input()))
s = list(eval(input()))
# print(s)
ans = []
for i in s:
tmp = ((ord(i) - 65 + n) % 26) + 65
ans.append(chr(tmp))
print(("".join(ans)))
| false | 50 | [
"-s = eval(input())",
"-string = [",
"- \"A\",",
"- \"B\",",
"- \"C\",",
"- \"D\",",
"- \"E\",",
"- \"F\",",
"- \"G\",",
"- \"H\",",
"- \"I\",",
"- \"J\",",
"- \"K\",",
"- \"L\",",
"- \"M\",",
"- \"N\",",
"- \"O\",",
"- \"P\",",
"- ... | false | 0.048345 | 0.042924 | 1.126295 | [
"s059319882",
"s524879030"
] |
u630511239 | p02923 | python | s241673472 | s974353244 | 87 | 66 | 14,252 | 20,448 | Accepted | Accepted | 24.14 | N = int(eval(input()))
H = list(map(int, input().split()))
q = 0
s = [0]
for i in range(N-1):
if H[i] >= H[i+1]:
p = q + 1
s.append(p)
q = q + 1
else:
s.append(0)
q = 0
s.sort()
ans = s[-1]
print(ans) | N = int(eval(input()))
H = list(map(int, input().split()))
old = H[0]
ans = 0
a = 0
for i in range(1,N):
if H[i] <= old:
a += 1
else:
if a > ans:
ans = a
a = 0
old = H[i]
if a > ans:
ans = a
print(ans)
| 16 | 17 | 234 | 242 | N = int(eval(input()))
H = list(map(int, input().split()))
q = 0
s = [0]
for i in range(N - 1):
if H[i] >= H[i + 1]:
p = q + 1
s.append(p)
q = q + 1
else:
s.append(0)
q = 0
s.sort()
ans = s[-1]
print(ans)
| N = int(eval(input()))
H = list(map(int, input().split()))
old = H[0]
ans = 0
a = 0
for i in range(1, N):
if H[i] <= old:
a += 1
else:
if a > ans:
ans = a
a = 0
old = H[i]
if a > ans:
ans = a
print(ans)
| false | 5.882353 | [
"-q = 0",
"-s = [0]",
"-for i in range(N - 1):",
"- if H[i] >= H[i + 1]:",
"- p = q + 1",
"- s.append(p)",
"- q = q + 1",
"+old = H[0]",
"+ans = 0",
"+a = 0",
"+for i in range(1, N):",
"+ if H[i] <= old:",
"+ a += 1",
"- s.append(0)",
"- q ... | false | 0.034762 | 0.041058 | 0.846652 | [
"s241673472",
"s974353244"
] |
u426534722 | p02270 | python | s556262516 | s504437802 | 910 | 280 | 9,560 | 9,588 | Accepted | Accepted | 69.23 | import sys
readline = sys.stdin.readline
n, k = list(map(int, readline().split()))
v = [int(readline()) for _ in range(n)]
lo = max(v) - 1
hi = sum(v)
while hi - lo > 1:
p = P = (lo + hi) // 2
m = 1
for i in range(n):
if v[i] > p:
p = P
m += 1
p -= v[i]
if m <= k:
hi = P
else:
lo = P
print(hi)
| import sys
readline = sys.stdin.readline
N, K = list(map(int, input().split()))
W = tuple(int(readline()) for _ in range(N))
ma = max(W)
def check(x):
if x < ma:
return False
use = 1
rest = x
for w in W:
if rest >= w:
rest -= w
else:
rest = x - w
use += 1
return use <= K
l = 0
r = sum(W)
while r - l > 1:
m = (r + l) // 2
if check(m):
r = m
else:
l = m
print(r)
| 20 | 26 | 385 | 490 | import sys
readline = sys.stdin.readline
n, k = list(map(int, readline().split()))
v = [int(readline()) for _ in range(n)]
lo = max(v) - 1
hi = sum(v)
while hi - lo > 1:
p = P = (lo + hi) // 2
m = 1
for i in range(n):
if v[i] > p:
p = P
m += 1
p -= v[i]
if m <= k:
hi = P
else:
lo = P
print(hi)
| import sys
readline = sys.stdin.readline
N, K = list(map(int, input().split()))
W = tuple(int(readline()) for _ in range(N))
ma = max(W)
def check(x):
if x < ma:
return False
use = 1
rest = x
for w in W:
if rest >= w:
rest -= w
else:
rest = x - w
use += 1
return use <= K
l = 0
r = sum(W)
while r - l > 1:
m = (r + l) // 2
if check(m):
r = m
else:
l = m
print(r)
| false | 23.076923 | [
"-n, k = list(map(int, readline().split()))",
"-v = [int(readline()) for _ in range(n)]",
"-lo = max(v) - 1",
"-hi = sum(v)",
"-while hi - lo > 1:",
"- p = P = (lo + hi) // 2",
"- m = 1",
"- for i in range(n):",
"- if v[i] > p:",
"- p = P",
"- m += 1",
"- ... | false | 0.03715 | 0.083786 | 0.443389 | [
"s556262516",
"s504437802"
] |
u714300041 | p04001 | python | s740952784 | s551405746 | 228 | 24 | 42,860 | 3,316 | Accepted | Accepted | 89.47 | S = eval(input())
N = len(S) - 1
def culc(string):
string = list(string)
digit = []
prev = 0
for i, s in enumerate(string):
if s == "+":
digit.append(int("".join(string[prev:i])))
prev = i+1
if i == len(string)-1:
digit.append(int("".join(string[prev:])))
return sum(digit)
SUM = 0
for bit in range(0, 1<<N):
string = S
for i in reversed(list(range(N))):
if (bit>>i) & 1:
string = string[:i+1] + "+" + string[i+1:]
SUM += culc(string)
print(SUM) | import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
S = input()[:-1] # 改行をなくす
n = len(S) - 1 # +を入れる事ができる場所の数
# bit全探索
P = []
for bit in range(0, 1<<n): # 00 ~ 11
plus = [""] * n
for j in range(n):
if bit>>j & 1:
plus[j] = "+"
P.append(plus)
ans = 0
if n == 0:
print((int(S)))
else:
for plus in P:
nums = []
tmp = S
pre = 0
for i in range(n):
if plus[i] == "+":
nums.append(int(tmp[pre:i+1]))
pre = i+1
if i == n-1:
nums.append(int(tmp[pre:]))
ans += sum(nums)
print(ans)
| 24 | 34 | 570 | 684 | S = eval(input())
N = len(S) - 1
def culc(string):
string = list(string)
digit = []
prev = 0
for i, s in enumerate(string):
if s == "+":
digit.append(int("".join(string[prev:i])))
prev = i + 1
if i == len(string) - 1:
digit.append(int("".join(string[prev:])))
return sum(digit)
SUM = 0
for bit in range(0, 1 << N):
string = S
for i in reversed(list(range(N))):
if (bit >> i) & 1:
string = string[: i + 1] + "+" + string[i + 1 :]
SUM += culc(string)
print(SUM)
| import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
S = input()[:-1] # 改行をなくす
n = len(S) - 1 # +を入れる事ができる場所の数
# bit全探索
P = []
for bit in range(0, 1 << n): # 00 ~ 11
plus = [""] * n
for j in range(n):
if bit >> j & 1:
plus[j] = "+"
P.append(plus)
ans = 0
if n == 0:
print((int(S)))
else:
for plus in P:
nums = []
tmp = S
pre = 0
for i in range(n):
if plus[i] == "+":
nums.append(int(tmp[pre : i + 1]))
pre = i + 1
if i == n - 1:
nums.append(int(tmp[pre:]))
ans += sum(nums)
print(ans)
| false | 29.411765 | [
"-S = eval(input())",
"-N = len(S) - 1",
"+import sys",
"-",
"-def culc(string):",
"- string = list(string)",
"- digit = []",
"- prev = 0",
"- for i, s in enumerate(string):",
"- if s == \"+\":",
"- digit.append(int(\"\".join(string[prev:i])))",
"- prev... | false | 0.113407 | 0.048391 | 2.343556 | [
"s740952784",
"s551405746"
] |
u892882715 | p02707 | python | s432875114 | s877446468 | 138 | 119 | 24,672 | 26,976 | Accepted | Accepted | 13.77 | N = int(eval(input()))
bosses = list(map(int, input().split()))
subordinates = [0] * (N + 1)
for boss in bosses:
subordinates[boss] += 1
for count in subordinates[1:]:
print(count) | N = int(eval(input()))
bosses = list(map(int, input().split()))
subordinates = [0] * (N + 1)
for boss in bosses:
subordinates[boss] += 1
print(("\n".join(map(str, subordinates[1:]))))
| 9 | 8 | 184 | 181 | N = int(eval(input()))
bosses = list(map(int, input().split()))
subordinates = [0] * (N + 1)
for boss in bosses:
subordinates[boss] += 1
for count in subordinates[1:]:
print(count)
| N = int(eval(input()))
bosses = list(map(int, input().split()))
subordinates = [0] * (N + 1)
for boss in bosses:
subordinates[boss] += 1
print(("\n".join(map(str, subordinates[1:]))))
| false | 11.111111 | [
"-for count in subordinates[1:]:",
"- print(count)",
"+print((\"\\n\".join(map(str, subordinates[1:]))))"
] | false | 0.042258 | 0.094724 | 0.446119 | [
"s432875114",
"s877446468"
] |
u112364985 | p03325 | python | s235463933 | s234533556 | 76 | 67 | 10,092 | 10,064 | Accepted | Accepted | 11.84 | n=int(eval(input()))
a=list(map(int,input().split()))
ans=0
for i in range(len(a)):
while a[i]%2==0:
a[i]//=2
ans+=1
print(ans) | n=int(eval(input()))
a=list(map(int,input().split()))
cnt=0
for i in a:
while(i%2==0):
cnt+=1
i//=2
print(cnt) | 8 | 8 | 148 | 131 | n = int(eval(input()))
a = list(map(int, input().split()))
ans = 0
for i in range(len(a)):
while a[i] % 2 == 0:
a[i] //= 2
ans += 1
print(ans)
| n = int(eval(input()))
a = list(map(int, input().split()))
cnt = 0
for i in a:
while i % 2 == 0:
cnt += 1
i //= 2
print(cnt)
| false | 0 | [
"-ans = 0",
"-for i in range(len(a)):",
"- while a[i] % 2 == 0:",
"- a[i] //= 2",
"- ans += 1",
"-print(ans)",
"+cnt = 0",
"+for i in a:",
"+ while i % 2 == 0:",
"+ cnt += 1",
"+ i //= 2",
"+print(cnt)"
] | false | 0.130138 | 0.137981 | 0.943159 | [
"s235463933",
"s234533556"
] |
u145950990 | p03145 | python | s486751329 | s790647980 | 191 | 170 | 38,384 | 38,256 | Accepted | Accepted | 10.99 | a,b,c = list(map(int,input().split()))
if a**2+b**2==c**2:
ans = a*b//2
elif a**2+c**2==b**2:
ans = a*c//2
else:
ans = b*c//2
print(ans) | a,b,c = list(map(int,input().split()))
print((a*b//2)) | 8 | 2 | 149 | 47 | a, b, c = list(map(int, input().split()))
if a**2 + b**2 == c**2:
ans = a * b // 2
elif a**2 + c**2 == b**2:
ans = a * c // 2
else:
ans = b * c // 2
print(ans)
| a, b, c = list(map(int, input().split()))
print((a * b // 2))
| false | 75 | [
"-if a**2 + b**2 == c**2:",
"- ans = a * b // 2",
"-elif a**2 + c**2 == b**2:",
"- ans = a * c // 2",
"-else:",
"- ans = b * c // 2",
"-print(ans)",
"+print((a * b // 2))"
] | false | 0.041773 | 0.088041 | 0.47447 | [
"s486751329",
"s790647980"
] |
u794173881 | p02852 | python | s504176010 | s779645346 | 315 | 188 | 63,216 | 11,076 | Accepted | Accepted | 40.32 | class SegmentTree():
"""区間更新、一点取得クエリをそれぞれO(logN)で答えるデータ構造を構築する
update: 区間[begin, end)をvalに更新する
get_val: i番目の値を求める
"""
def __init__(self, n):
self.update_cnt = 0
self.n = n
self.size = 1
INF = 2**32 - 1
while self.size < n:
self.size *= 2
self.node = [(self.update_cnt, -1) for i in range(2*self.size - 1)]
def update(self, begin, end, val):
self.update_cnt += 1
begin += (self.size - 1)
end += (self.size - 1)
while begin < end:
if (end - 1) & 1:
end -= 1
self.node[end] = (self.update_cnt, val)
if (begin - 1) & 1:
self.node[begin] = (self.update_cnt, val)
begin += 1
begin = (begin - 1) // 2
end = (end - 1) // 2
def get_val(self, i):
i += (self.size - 1)
val = self.node[i]
while i > 0:
i = (i - 1) // 2
val = max(val, self.node[i])
return val[1]
n, m = list(map(int, input().split()))
s = eval(input())
st = SegmentTree(n+1)
for i in range(n+1)[::-1]:
if s[i] == "0":
st.update(i+1, min(i+1+m,n+1) , i)
pos = []
start = n
while True:
if start == 0:
break
tmp = st.get_val(start)
if tmp == -1:
print((-1))
exit()
pos.append(start - tmp)
start= tmp
print((*pos[::-1])) | n, m = list(map(int, input().split()))
s = eval(input())
n += 1
pos = [n - 1]
ind = n - 1
while True:
tmp = -1
for i in range(1, m + 1):
if s[max(ind - i, 0)] == "0":
tmp = max(ind - i, 0)
if tmp == -1:
print((-1))
exit()
pos.append(tmp)
ind = tmp
if ind == 0:
break
tmp = pos[::-1]
ans = []
for i in range(len(tmp) - 1):
ans.append(tmp[i + 1] - tmp[i])
print((*ans)) | 58 | 23 | 1,470 | 446 | class SegmentTree:
"""区間更新、一点取得クエリをそれぞれO(logN)で答えるデータ構造を構築する
update: 区間[begin, end)をvalに更新する
get_val: i番目の値を求める
"""
def __init__(self, n):
self.update_cnt = 0
self.n = n
self.size = 1
INF = 2**32 - 1
while self.size < n:
self.size *= 2
self.node = [(self.update_cnt, -1) for i in range(2 * self.size - 1)]
def update(self, begin, end, val):
self.update_cnt += 1
begin += self.size - 1
end += self.size - 1
while begin < end:
if (end - 1) & 1:
end -= 1
self.node[end] = (self.update_cnt, val)
if (begin - 1) & 1:
self.node[begin] = (self.update_cnt, val)
begin += 1
begin = (begin - 1) // 2
end = (end - 1) // 2
def get_val(self, i):
i += self.size - 1
val = self.node[i]
while i > 0:
i = (i - 1) // 2
val = max(val, self.node[i])
return val[1]
n, m = list(map(int, input().split()))
s = eval(input())
st = SegmentTree(n + 1)
for i in range(n + 1)[::-1]:
if s[i] == "0":
st.update(i + 1, min(i + 1 + m, n + 1), i)
pos = []
start = n
while True:
if start == 0:
break
tmp = st.get_val(start)
if tmp == -1:
print((-1))
exit()
pos.append(start - tmp)
start = tmp
print((*pos[::-1]))
| n, m = list(map(int, input().split()))
s = eval(input())
n += 1
pos = [n - 1]
ind = n - 1
while True:
tmp = -1
for i in range(1, m + 1):
if s[max(ind - i, 0)] == "0":
tmp = max(ind - i, 0)
if tmp == -1:
print((-1))
exit()
pos.append(tmp)
ind = tmp
if ind == 0:
break
tmp = pos[::-1]
ans = []
for i in range(len(tmp) - 1):
ans.append(tmp[i + 1] - tmp[i])
print((*ans))
| false | 60.344828 | [
"-class SegmentTree:",
"- \"\"\"区間更新、一点取得クエリをそれぞれO(logN)で答えるデータ構造を構築する",
"- update: 区間[begin, end)をvalに更新する",
"- get_val: i番目の値を求める",
"- \"\"\"",
"-",
"- def __init__(self, n):",
"- self.update_cnt = 0",
"- self.n = n",
"- self.size = 1",
"- INF = 2**32... | false | 0.041727 | 0.037257 | 1.119987 | [
"s504176010",
"s779645346"
] |
u602500004 | p02602 | python | s291598643 | s008971762 | 203 | 148 | 50,136 | 31,684 | Accepted | Accepted | 27.09 | import decimal
import numpy as np
import sys
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
N,K = LI()
A = LI()
ans = []
for i in range(K,N):
if A[i-K] < A[i]:
ans.append('Yes')
else:
ans.append('No')
print(('\n'.join(ans))) | import sys
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
N,K = LI()
A = LI()
ans = []
for i in range(K,N):
if A[i-K] < A[i]:
print('Yes')
else:
print('No')
| 18 | 14 | 291 | 221 | import decimal
import numpy as np
import sys
def LI():
return list(map(int, sys.stdin.readline().rstrip().split()))
N, K = LI()
A = LI()
ans = []
for i in range(K, N):
if A[i - K] < A[i]:
ans.append("Yes")
else:
ans.append("No")
print(("\n".join(ans)))
| import sys
def LI():
return list(map(int, sys.stdin.readline().rstrip().split()))
N, K = LI()
A = LI()
ans = []
for i in range(K, N):
if A[i - K] < A[i]:
print("Yes")
else:
print("No")
| false | 22.222222 | [
"-import decimal",
"-import numpy as np",
"- ans.append(\"Yes\")",
"+ print(\"Yes\")",
"- ans.append(\"No\")",
"-print((\"\\n\".join(ans)))",
"+ print(\"No\")"
] | false | 0.037019 | 0.036593 | 1.011656 | [
"s291598643",
"s008971762"
] |
u919633157 | p03196 | python | s961924968 | s330774431 | 119 | 102 | 5,304 | 3,316 | Accepted | Accepted | 14.29 | # 2019/07/31
# 考え方
# 素因数分解した数 p を n個に分割 残りの数を適当な項に入れる
# eg.
# input
"""
4 972439611840
"""
# output
"""
206
"""
# 素因数分解=>
# 2 :6
# 103 :4
# 3 :3
# 5 :1
# n個に分割
"""
//////////////////////
1 2 3 4
----------------
2 2 2 2
* * * *
103 103 103 103
*
2^2
*
103^0
*
3^3
*
5^1
----------------
111240 206 206 206
=972439611840
/////////////////////
"""
from fractions import gcd
from collections import Counter
n,p=list(map(int,input().split()))
def trial_div(n):
prime=Counter()
for i in range(2,int(pow(n,0.5)+2)):
while n%i==0:
n//=i
prime[i]+=1
if n>1:prime[n]+=1
return prime
res=trial_div(p)
ans=1
for k,v in list(res.items()):
tmp=k**(v//n)
ans*=tmp
print(ans) | # 2019/11/29
from collections import Counter
n,p=list(map(int,input().split()))
def trial_div(n):
prime=Counter()
for i in range(2,int(pow(n,0.5)+2)):
while n%i==0:
n//=i
prime[i]+=1
if n>1:prime[n]+=1
return prime
prime=trial_div(p)
if prime is None:
print((1))
exit()
ans=1
for k,v in list(prime.items()):
if v>=n:
ans*=k**(v//n)
print(ans) | 66 | 26 | 823 | 435 | # 2019/07/31
# 考え方
# 素因数分解した数 p を n個に分割 残りの数を適当な項に入れる
# eg.
# input
"""
4 972439611840
"""
# output
"""
206
"""
# 素因数分解=>
# 2 :6
# 103 :4
# 3 :3
# 5 :1
# n個に分割
"""
//////////////////////
1 2 3 4
----------------
2 2 2 2
* * * *
103 103 103 103
*
2^2
*
103^0
*
3^3
*
5^1
----------------
111240 206 206 206
=972439611840
/////////////////////
"""
from fractions import gcd
from collections import Counter
n, p = list(map(int, input().split()))
def trial_div(n):
prime = Counter()
for i in range(2, int(pow(n, 0.5) + 2)):
while n % i == 0:
n //= i
prime[i] += 1
if n > 1:
prime[n] += 1
return prime
res = trial_div(p)
ans = 1
for k, v in list(res.items()):
tmp = k ** (v // n)
ans *= tmp
print(ans)
| # 2019/11/29
from collections import Counter
n, p = list(map(int, input().split()))
def trial_div(n):
prime = Counter()
for i in range(2, int(pow(n, 0.5) + 2)):
while n % i == 0:
n //= i
prime[i] += 1
if n > 1:
prime[n] += 1
return prime
prime = trial_div(p)
if prime is None:
print((1))
exit()
ans = 1
for k, v in list(prime.items()):
if v >= n:
ans *= k ** (v // n)
print(ans)
| false | 60.606061 | [
"-# 2019/07/31",
"-# 考え方",
"-# 素因数分解した数 p を n個に分割 残りの数を適当な項に入れる",
"-# eg.",
"-# input",
"-\"\"\"",
"-4 972439611840",
"-\"\"\"",
"-# output",
"-\"\"\"",
"-206",
"-\"\"\"",
"-# 素因数分解=>",
"-# 2 :6",
"-# 103 :4",
"-# 3 :3",
"-# 5 :1",
"-# n個に分割",
"-\"\"\"",
"-///////////////... | false | 0.039486 | 0.040278 | 0.980328 | [
"s961924968",
"s330774431"
] |
u998262711 | p02696 | python | s667441520 | s635057717 | 22 | 20 | 9,112 | 9,032 | Accepted | Accepted | 9.09 | a,b,n=list(map(int,input().split()))
a1=a*n//b
i=(n+1)//b
if i!=0:
a2=a*(b-1)//b
print(a2)
else:
print(a1) | A,B,N=list(map(int,input().split()))
if N>=B:
print((int(A*(B-1)/B)))
else:
print((int(A*N/B)))
| 8 | 6 | 119 | 103 | a, b, n = list(map(int, input().split()))
a1 = a * n // b
i = (n + 1) // b
if i != 0:
a2 = a * (b - 1) // b
print(a2)
else:
print(a1)
| A, B, N = list(map(int, input().split()))
if N >= B:
print((int(A * (B - 1) / B)))
else:
print((int(A * N / B)))
| false | 25 | [
"-a, b, n = list(map(int, input().split()))",
"-a1 = a * n // b",
"-i = (n + 1) // b",
"-if i != 0:",
"- a2 = a * (b - 1) // b",
"- print(a2)",
"+A, B, N = list(map(int, input().split()))",
"+if N >= B:",
"+ print((int(A * (B - 1) / B)))",
"- print(a1)",
"+ print((int(A * N / B)))... | false | 0.036587 | 0.035645 | 1.026431 | [
"s667441520",
"s635057717"
] |
u634046173 | p02791 | python | s198137648 | s151768224 | 126 | 113 | 24,744 | 24,744 | Accepted | Accepted | 10.32 | N = int(eval(input()))
P = list(map(int,input().split()))
count = 1
if N > 0:
min = P[0]
for i in range(1, N):
if min < P[i]:
continue
elif min >= P[i]:
min = P[i]
count += 1
continue
print(count) | N = int(eval(input()))
P = list(map(int,input().split()))
count = 1
min = P[0]
for i in range(1, N):
if min >= P[i]:
min = P[i]
count += 1
print(count) | 15 | 11 | 238 | 174 | N = int(eval(input()))
P = list(map(int, input().split()))
count = 1
if N > 0:
min = P[0]
for i in range(1, N):
if min < P[i]:
continue
elif min >= P[i]:
min = P[i]
count += 1
continue
print(count)
| N = int(eval(input()))
P = list(map(int, input().split()))
count = 1
min = P[0]
for i in range(1, N):
if min >= P[i]:
min = P[i]
count += 1
print(count)
| false | 26.666667 | [
"-if N > 0:",
"- min = P[0]",
"+min = P[0]",
"- if min < P[i]:",
"- continue",
"- elif min >= P[i]:",
"+ if min >= P[i]:",
"- continue"
] | false | 0.0406 | 0.041544 | 0.97727 | [
"s198137648",
"s151768224"
] |
u894381129 | p02912 | python | s128207687 | s350968824 | 165 | 151 | 14,184 | 14,180 | Accepted | Accepted | 8.48 | import heapq
N, M = list(map(int, input().split()))
A = [-int(i) for i in input().split()]
heapq.heapify(A)
for i in range(M):
a = -int(heapq.heappop(A) / 2)
heapq.heappush(A, -a)
print((-sum(A))) | import heapq
N, M = list(map(int, input().split()))
A = [-int(i) for i in input().split()]
heapq.heapify(A)
for i in range(M):
a = -heapq.heappop(A) // 2
heapq.heappush(A, -a)
print((-sum(A))) | 8 | 8 | 203 | 199 | import heapq
N, M = list(map(int, input().split()))
A = [-int(i) for i in input().split()]
heapq.heapify(A)
for i in range(M):
a = -int(heapq.heappop(A) / 2)
heapq.heappush(A, -a)
print((-sum(A)))
| import heapq
N, M = list(map(int, input().split()))
A = [-int(i) for i in input().split()]
heapq.heapify(A)
for i in range(M):
a = -heapq.heappop(A) // 2
heapq.heappush(A, -a)
print((-sum(A)))
| false | 0 | [
"- a = -int(heapq.heappop(A) / 2)",
"+ a = -heapq.heappop(A) // 2"
] | false | 0.041491 | 0.039853 | 1.041118 | [
"s128207687",
"s350968824"
] |
u936985471 | p02862 | python | s844955831 | s222958505 | 995 | 165 | 82,448 | 3,572 | Accepted | Accepted | 83.42 | x,y=list(map(int,input().split()))
a3=2*x-y
b3=2*y-x
MOD=10**9+7
def cmb(n, r, mod):
if ( r<0 or r>n ):
return 0
r = min(r, n-r)
return g1[n] * g2[r] * g2[n-r] % mod
if a3%3!=0 or b3%3!=0:
print((0))
else:
a=a3//3
b=b3//3
if a>b:
a,b=b,a
N=a+b
g1 = [1, 1]
g2 = [1, 1]
inverse = [0, 1]
for i in range( 2, N + 1 ):
g1.append( ( g1[-1] * i ) % MOD )
inverse.append( ( -inverse[MOD % i] * (MOD//i) ) % MOD )
g2.append( (g2[-1] * inverse[-1]) % MOD )
ans = cmb(N,a,MOD)
print((ans%MOD)) | X,Y=list(map(int,input().split()))
# (i+1,j+2)の移動をa回
# (i+2,j+1)の移動をb回
# X=a+2b
# Y=2a+b
# となるa,bが存在するか？
# b=(2X-Y)/3が整数となればOK
b=(2*X-Y)/3
if not float.is_integer(b):
print((0))
exit(0)
b=int(b)
a=X-2*b
# aとbの回数が決まったので、a+bCmin(a,b)をやればいい
DIV=10**9+7
from functools import reduce
def nCr(n,r,DIV):
if r<n-r:
r=n-r
if r==0:
return 1
f=lambda x,y:x*y%DIV
X=reduce(f,list(range(n-r+1,n+1)))
Y=reduce(f,list(range(1,r+1)))
return X*pow(Y,DIV-2,DIV)%DIV
print((nCr(a+b,b,DIV))) | 32 | 32 | 558 | 512 | x, y = list(map(int, input().split()))
a3 = 2 * x - y
b3 = 2 * y - x
MOD = 10**9 + 7
def cmb(n, r, mod):
if r < 0 or r > n:
return 0
r = min(r, n - r)
return g1[n] * g2[r] * g2[n - r] % mod
if a3 % 3 != 0 or b3 % 3 != 0:
print((0))
else:
a = a3 // 3
b = b3 // 3
if a > b:
a, b = b, a
N = a + b
g1 = [1, 1]
g2 = [1, 1]
inverse = [0, 1]
for i in range(2, N + 1):
g1.append((g1[-1] * i) % MOD)
inverse.append((-inverse[MOD % i] * (MOD // i)) % MOD)
g2.append((g2[-1] * inverse[-1]) % MOD)
ans = cmb(N, a, MOD)
print((ans % MOD))
| X, Y = list(map(int, input().split()))
# (i+1,j+2)の移動をa回
# (i+2,j+1)の移動をb回
# X=a+2b
# Y=2a+b
# となるa,bが存在するか？
# b=(2X-Y)/3が整数となればOK
b = (2 * X - Y) / 3
if not float.is_integer(b):
print((0))
exit(0)
b = int(b)
a = X - 2 * b
# aとbの回数が決まったので、a+bCmin(a,b)をやればいい
DIV = 10**9 + 7
from functools import reduce
def nCr(n, r, DIV):
if r < n - r:
r = n - r
if r == 0:
return 1
f = lambda x, y: x * y % DIV
X = reduce(f, list(range(n - r + 1, n + 1)))
Y = reduce(f, list(range(1, r + 1)))
return X * pow(Y, DIV - 2, DIV) % DIV
print((nCr(a + b, b, DIV)))
| false | 0 | [
"-x, y = list(map(int, input().split()))",
"-a3 = 2 * x - y",
"-b3 = 2 * y - x",
"-MOD = 10**9 + 7",
"+X, Y = list(map(int, input().split()))",
"+# (i+1,j+2)の移動をa回",
"+# (i+2,j+1)の移動をb回",
"+# X=a+2b",
"+# Y=2a+b",
"+# となるa,bが存在するか？",
"+# b=(2X-Y)/3が整数となればOK",
"+b = (2 * X - Y) / 3",
"+if not... | false | 0.394498 | 0.070784 | 5.573253 | [
"s844955831",
"s222958505"
] |
u581187895 | p03074 | python | s511871906 | s541607290 | 75 | 64 | 10,088 | 14,664 | Accepted | Accepted | 14.67 |
def resolve():
N, K = map(int, input().split())
S = input()
# even:1
# odd:0
# 1-0-1-0-1 の配列にする. 両端は1にする
L = []
pre = "1"
cnt = 0
for i in range(N):
if pre == S[i]:
cnt += 1
else:
L.append(cnt)
cnt = 1
pre = S[i]
L.append(cnt)
# 最後が0で終わっていたら、仮の1を付け足す。(値が0なので影響ない)
if pre == "0":
L.append(0)
# 1-0-1-0-1の配列を作成し、K＝2だとする。
# 0を2個含めた個数は, 1＝3、0＝2の長さが作成できる
length = 2 * K + 1
# 0をすべて変換できる
if len(L) <= length:
return print(N)
# 1-0-1-0-1の配列なので間に0を含んだ数え上げ
# なので偶数とびに1を起点に数え上げ
left = 0
right = 0
tmp = 0
# しゃくとり
ans = 0
for i in range(0, len(L), 2):
nextL = i
nextR = min(i + length, len(L))
while nextL > left:
tmp -= L[left]
left += 1
while nextR > right:
tmp += L[right]
right += 1
ans = max(ans, tmp)
print(ans)
if __name__ == "__main__":
resolve()
|
from itertools import accumulate
def resolve():
N, K = map(int, input().split())
S = input()
# even:1
# odd:0
# 1-0-1-0-1 の配列にする. 両端は1にする
L = []
pre = "1"
cnt = 0
for i in range(N):
if pre == S[i]:
cnt += 1
else:
L.append(cnt)
cnt = 1
pre = S[i]
L.append(cnt)
# 最後が0で終わっていたら、仮の1を付け足す。(値が0なので影響ない)
if pre == "0":
L.append(0)
# 1-0-1-0-1の配列を作成し、K＝2だとする。
# 0を2個含めた個数は, 1＝3、0＝2の長さが作成できる
length = 2 * K + 1
# 0をすべて変換できる
if len(L) <= length:
return print(N)
# 1-0-1-0-1の配列なので間に0を含んだ数え上げ
# なので偶数とびに1を起点に数え上げ
# 累積
acc = [0] + list(accumulate(L))
ans = 0
for i in range(0, len(L), 2):
left = i
right = min(i + length, len(L))
tmp = acc[right] - acc[left]
ans = max(ans, tmp)
print(ans)
if __name__ == "__main__":
resolve()
| 56 | 49 | 1,088 | 979 | def resolve():
N, K = map(int, input().split())
S = input()
# even:1
# odd:0
# 1-0-1-0-1 の配列にする. 両端は1にする
L = []
pre = "1"
cnt = 0
for i in range(N):
if pre == S[i]:
cnt += 1
else:
L.append(cnt)
cnt = 1
pre = S[i]
L.append(cnt)
# 最後が0で終わっていたら、仮の1を付け足す。(値が0なので影響ない)
if pre == "0":
L.append(0)
# 1-0-1-0-1の配列を作成し、K＝2だとする。
# 0を2個含めた個数は, 1＝3、0＝2の長さが作成できる
length = 2 * K + 1
# 0をすべて変換できる
if len(L) <= length:
return print(N)
# 1-0-1-0-1の配列なので間に0を含んだ数え上げ
# なので偶数とびに1を起点に数え上げ
left = 0
right = 0
tmp = 0
# しゃくとり
ans = 0
for i in range(0, len(L), 2):
nextL = i
nextR = min(i + length, len(L))
while nextL > left:
tmp -= L[left]
left += 1
while nextR > right:
tmp += L[right]
right += 1
ans = max(ans, tmp)
print(ans)
if __name__ == "__main__":
resolve()
| from itertools import accumulate
def resolve():
N, K = map(int, input().split())
S = input()
# even:1
# odd:0
# 1-0-1-0-1 の配列にする. 両端は1にする
L = []
pre = "1"
cnt = 0
for i in range(N):
if pre == S[i]:
cnt += 1
else:
L.append(cnt)
cnt = 1
pre = S[i]
L.append(cnt)
# 最後が0で終わっていたら、仮の1を付け足す。(値が0なので影響ない)
if pre == "0":
L.append(0)
# 1-0-1-0-1の配列を作成し、K＝2だとする。
# 0を2個含めた個数は, 1＝3、0＝2の長さが作成できる
length = 2 * K + 1
# 0をすべて変換できる
if len(L) <= length:
return print(N)
# 1-0-1-0-1の配列なので間に0を含んだ数え上げ
# なので偶数とびに1を起点に数え上げ
# 累積
acc = [0] + list(accumulate(L))
ans = 0
for i in range(0, len(L), 2):
left = i
right = min(i + length, len(L))
tmp = acc[right] - acc[left]
ans = max(ans, tmp)
print(ans)
if __name__ == "__main__":
resolve()
| false | 12.5 | [
"+from itertools import accumulate",
"+",
"+",
"- left = 0",
"- right = 0",
"- tmp = 0",
"- # しゃくとり",
"+ # 累積",
"+ acc = [0] + list(accumulate(L))",
"- nextL = i",
"- nextR = min(i + length, len(L))",
"- while nextL > left:",
"- tmp -= L[left... | false | 0.046798 | 0.04542 | 1.030328 | [
"s511871906",
"s541607290"
] |
u268793453 | p03722 | python | s413634487 | s668365794 | 1,026 | 880 | 3,828 | 3,828 | Accepted | Accepted | 14.23 | import sys
from copy import deepcopy
n, m = [int(i) for i in input().split()]
es = [[int(j) for j in input().split()] for i in range(m)]
x = [float('-inf')] * (n+1)
x[1] = 0
border = sys.maxsize // 1000
for i in range(n):
for a, b, c in es:
x[b] = max(x[b], x[a]+c)
if x[b] >= border:
x[b] = float('inf')
prevxn = x[n]
for a, b, c in es:
x[b] = max(x[b], x[a]+c)
if prevxn != x[n]:
print('inf')
else:
print((x[n])) | from copy import deepcopy
n, m = [int(i) for i in input().split()]
es = [[int(j) for j in input().split()] for i in range(m)]
x = [float('-inf')] * (n+1)
x[1] = 0
for i in range(n):
for a, b, c in es:
x[b] = max(x[b], x[a]+c)
prevxn = x[n]
for a, b, c in es:
x[b] = max(x[b], x[a]+c)
if prevxn != x[n]:
print('inf')
else:
print((x[n])) | 24 | 20 | 488 | 385 | import sys
from copy import deepcopy
n, m = [int(i) for i in input().split()]
es = [[int(j) for j in input().split()] for i in range(m)]
x = [float("-inf")] * (n + 1)
x[1] = 0
border = sys.maxsize // 1000
for i in range(n):
for a, b, c in es:
x[b] = max(x[b], x[a] + c)
if x[b] >= border:
x[b] = float("inf")
prevxn = x[n]
for a, b, c in es:
x[b] = max(x[b], x[a] + c)
if prevxn != x[n]:
print("inf")
else:
print((x[n]))
| from copy import deepcopy
n, m = [int(i) for i in input().split()]
es = [[int(j) for j in input().split()] for i in range(m)]
x = [float("-inf")] * (n + 1)
x[1] = 0
for i in range(n):
for a, b, c in es:
x[b] = max(x[b], x[a] + c)
prevxn = x[n]
for a, b, c in es:
x[b] = max(x[b], x[a] + c)
if prevxn != x[n]:
print("inf")
else:
print((x[n]))
| false | 16.666667 | [
"-import sys",
"-border = sys.maxsize // 1000",
"- if x[b] >= border:",
"- x[b] = float(\"inf\")"
] | false | 0.008158 | 0.042593 | 0.191538 | [
"s413634487",
"s668365794"
] |
u325282913 | p03061 | python | s713353047 | s155824910 | 222 | 109 | 16,152 | 98,072 | Accepted | Accepted | 50.9 | import fractions
N = int(eval(input()))
A = list(map(int, input().split()))
right = [A[0]]*N
left = [A[-1]]*N
for i in range(1,N):
right[i] = fractions.gcd(right[i-1],A[i])
left[N-1-i] = fractions.gcd(left[N-i],A[N-1-i])
ans = left[1]
for i in range(N-2):
ans = max(ans,fractions.gcd(right[i],left[i+2]))
print((max(ans,right[N-2])))
| import math
N = int(eval(input()))
arr = list(map(int, input().split()))
gcd_right = [arr[0]]
for i in range(1,N-1):
gcd_right.append(math.gcd(gcd_right[i-1],arr[i]))
arr = arr[::-1]
gcd_left = [arr[0]]
for i in range(1,N-1):
gcd_left.append(math.gcd(gcd_left[i-1],arr[i]))
gcd_left = gcd_left[::-1]
ans = max(gcd_right[-1],gcd_left[0])
for i in range(N-2):
ans = max(ans,math.gcd(gcd_left[i+1],gcd_right[i]))
print(ans) | 12 | 15 | 349 | 440 | import fractions
N = int(eval(input()))
A = list(map(int, input().split()))
right = [A[0]] * N
left = [A[-1]] * N
for i in range(1, N):
right[i] = fractions.gcd(right[i - 1], A[i])
left[N - 1 - i] = fractions.gcd(left[N - i], A[N - 1 - i])
ans = left[1]
for i in range(N - 2):
ans = max(ans, fractions.gcd(right[i], left[i + 2]))
print((max(ans, right[N - 2])))
| import math
N = int(eval(input()))
arr = list(map(int, input().split()))
gcd_right = [arr[0]]
for i in range(1, N - 1):
gcd_right.append(math.gcd(gcd_right[i - 1], arr[i]))
arr = arr[::-1]
gcd_left = [arr[0]]
for i in range(1, N - 1):
gcd_left.append(math.gcd(gcd_left[i - 1], arr[i]))
gcd_left = gcd_left[::-1]
ans = max(gcd_right[-1], gcd_left[0])
for i in range(N - 2):
ans = max(ans, math.gcd(gcd_left[i + 1], gcd_right[i]))
print(ans)
| false | 20 | [
"-import fractions",
"+import math",
"-A = list(map(int, input().split()))",
"-right = [A[0]] * N",
"-left = [A[-1]] * N",
"-for i in range(1, N):",
"- right[i] = fractions.gcd(right[i - 1], A[i])",
"- left[N - 1 - i] = fractions.gcd(left[N - i], A[N - 1 - i])",
"-ans = left[1]",
"+arr = lis... | false | 0.07184 | 0.036119 | 1.98899 | [
"s713353047",
"s155824910"
] |
u347600233 | p03611 | python | s328300521 | s828361404 | 116 | 95 | 13,964 | 13,964 | Accepted | Accepted | 18.1 | n = int(eval(input()))
a = [int(i) for i in input().split()]
cnt_a = [0] * (10**5 + 2)
for i in range(n):
cnt_a[a[i]] += 1
max_cnt = 0
for i in range(1, 10**5 + 1):
max_cnt = max(max_cnt, sum(cnt_a[i - 1:i + 2]))
print(max_cnt) | n = int(eval(input()))
a = [int(i) for i in input().split()]
cnt_x = [0] * (10**5 + 2)
for i in range(n):
cnt_x[a[i] - 1] += 1
cnt_x[a[i]] += 1
cnt_x[a[i] + 1] += 1
print((max(cnt_x))) | 9 | 8 | 237 | 195 | n = int(eval(input()))
a = [int(i) for i in input().split()]
cnt_a = [0] * (10**5 + 2)
for i in range(n):
cnt_a[a[i]] += 1
max_cnt = 0
for i in range(1, 10**5 + 1):
max_cnt = max(max_cnt, sum(cnt_a[i - 1 : i + 2]))
print(max_cnt)
| n = int(eval(input()))
a = [int(i) for i in input().split()]
cnt_x = [0] * (10**5 + 2)
for i in range(n):
cnt_x[a[i] - 1] += 1
cnt_x[a[i]] += 1
cnt_x[a[i] + 1] += 1
print((max(cnt_x)))
| false | 11.111111 | [
"-cnt_a = [0] * (10**5 + 2)",
"+cnt_x = [0] * (10**5 + 2)",
"- cnt_a[a[i]] += 1",
"-max_cnt = 0",
"-for i in range(1, 10**5 + 1):",
"- max_cnt = max(max_cnt, sum(cnt_a[i - 1 : i + 2]))",
"-print(max_cnt)",
"+ cnt_x[a[i] - 1] += 1",
"+ cnt_x[a[i]] += 1",
"+ cnt_x[a[i] + 1] += 1",
"... | false | 0.158553 | 0.010119 | 15.668484 | [
"s328300521",
"s828361404"
] |
u608088992 | p03107 | python | s334162839 | s055315640 | 34 | 30 | 3,188 | 3,188 | Accepted | Accepted | 11.76 | S = eval(input())
zero, one = 0, 0
for i in range(len(S)):
if S[i] == "0": zero += 1
else: one += 1
print((min(zero, one)*2)) | import sys
def solve():
input = sys.stdin.readline
zero, one = 0, 0
s = input().strip("\n")
for i in range(len(s)):
if s[i] == "0": zero += 1
else: one += 1
print((2 * min(zero, one)))
return 0
if __name__ == "__main__":
solve() | 6 | 15 | 130 | 287 | S = eval(input())
zero, one = 0, 0
for i in range(len(S)):
if S[i] == "0":
zero += 1
else:
one += 1
print((min(zero, one) * 2))
| import sys
def solve():
input = sys.stdin.readline
zero, one = 0, 0
s = input().strip("\n")
for i in range(len(s)):
if s[i] == "0":
zero += 1
else:
one += 1
print((2 * min(zero, one)))
return 0
if __name__ == "__main__":
solve()
| false | 60 | [
"-S = eval(input())",
"-zero, one = 0, 0",
"-for i in range(len(S)):",
"- if S[i] == \"0\":",
"- zero += 1",
"- else:",
"- one += 1",
"-print((min(zero, one) * 2))",
"+import sys",
"+",
"+",
"+def solve():",
"+ input = sys.stdin.readline",
"+ zero, one = 0, 0",
... | false | 0.06471 | 0.064685 | 1.000378 | [
"s334162839",
"s055315640"
] |
u070201429 | p03372 | python | s238657837 | s844520359 | 625 | 233 | 29,688 | 26,676 | Accepted | Accepted | 62.72 | def main():
from numpy import zeros
from sys import stdin
def input():
return stdin.readline().strip()
n, c = list(map(int, input().split()))
# v: cumulative sum
x, v = zeros(n+2, dtype=int), zeros(n+2, dtype=int)
for i in range(n):
j, k = list(map(int, input().split()))
x[i+1] = j
v[i+1] = v[i] + k
x[n+1] = c
v[n+1] = v[n]
max_nut_clockwise = zeros(n+1, dtype=int)
for i in range(1, n+1):
max_nut_clockwise[i] = max(max_nut_clockwise[i-1], v[i] - x[i])
max_nut_counterclockwise = zeros(n+1, dtype=int)
for i in range(n-1, -1, -1):
max_nut_counterclockwise[i] = max(max_nut_counterclockwise[i+1], v[-1] - v[i] - c + x[i+1])
ans = 0
# rotate clockwise, then rotate counterclockwise
for i in range(n):
if ans < v[i] - 2*x[i] + max_nut_counterclockwise[i]:
ans = v[i] - 2*x[i] + max_nut_counterclockwise[i]
# rotate counterclockwise, then rotate clockwise
for i in range(2, n+2):
if ans < v[-1] - v[i-1] - 2 * (c - x[i]) + max_nut_clockwise[i-1]:
ans = v[-1] - v[i-1] - 2 * (c - x[i]) + max_nut_clockwise[i-1]
print(ans)
main()
| def main():
from sys import stdin
def input():
return stdin.readline().strip()
n, c = list(map(int, input().split()))
# v: cumulative sum
x, v = [0] * (n+2), [0] * (n+2)
for i in range(n):
j, k = list(map(int, input().split()))
x[i+1] = j
v[i+1] = v[i] + k
x[n+1] = c
v[n+1] = v[n]
max_nut_clockwise = [0] * (n+1)
for i in range(1, n+1):
max_nut_clockwise[i] = max(max_nut_clockwise[i-1], v[i] - x[i])
max_nut_counterclockwise = [0] * (n+1)
for i in range(n-1, -1, -1):
max_nut_counterclockwise[i] = max(max_nut_counterclockwise[i+1], v[-1] - v[i] - c + x[i+1])
ans = 0
# rotate clockwise, then rotate counterclockwise
for i in range(n):
if ans < v[i] - 2*x[i] + max_nut_counterclockwise[i]:
ans = v[i] - 2*x[i] + max_nut_counterclockwise[i]
# rotate counterclockwise, then rotate clockwise
for i in range(2, n+2):
if ans < v[-1] - v[i-1] - 2 * (c - x[i]) + max_nut_clockwise[i-1]:
ans = v[-1] - v[i-1] - 2 * (c - x[i]) + max_nut_clockwise[i-1]
print(ans)
main()
| 36 | 35 | 1,227 | 1,158 | def main():
from numpy import zeros
from sys import stdin
def input():
return stdin.readline().strip()
n, c = list(map(int, input().split()))
# v: cumulative sum
x, v = zeros(n + 2, dtype=int), zeros(n + 2, dtype=int)
for i in range(n):
j, k = list(map(int, input().split()))
x[i + 1] = j
v[i + 1] = v[i] + k
x[n + 1] = c
v[n + 1] = v[n]
max_nut_clockwise = zeros(n + 1, dtype=int)
for i in range(1, n + 1):
max_nut_clockwise[i] = max(max_nut_clockwise[i - 1], v[i] - x[i])
max_nut_counterclockwise = zeros(n + 1, dtype=int)
for i in range(n - 1, -1, -1):
max_nut_counterclockwise[i] = max(
max_nut_counterclockwise[i + 1], v[-1] - v[i] - c + x[i + 1]
)
ans = 0
# rotate clockwise, then rotate counterclockwise
for i in range(n):
if ans < v[i] - 2 * x[i] + max_nut_counterclockwise[i]:
ans = v[i] - 2 * x[i] + max_nut_counterclockwise[i]
# rotate counterclockwise, then rotate clockwise
for i in range(2, n + 2):
if ans < v[-1] - v[i - 1] - 2 * (c - x[i]) + max_nut_clockwise[i - 1]:
ans = v[-1] - v[i - 1] - 2 * (c - x[i]) + max_nut_clockwise[i - 1]
print(ans)
main()
| def main():
from sys import stdin
def input():
return stdin.readline().strip()
n, c = list(map(int, input().split()))
# v: cumulative sum
x, v = [0] * (n + 2), [0] * (n + 2)
for i in range(n):
j, k = list(map(int, input().split()))
x[i + 1] = j
v[i + 1] = v[i] + k
x[n + 1] = c
v[n + 1] = v[n]
max_nut_clockwise = [0] * (n + 1)
for i in range(1, n + 1):
max_nut_clockwise[i] = max(max_nut_clockwise[i - 1], v[i] - x[i])
max_nut_counterclockwise = [0] * (n + 1)
for i in range(n - 1, -1, -1):
max_nut_counterclockwise[i] = max(
max_nut_counterclockwise[i + 1], v[-1] - v[i] - c + x[i + 1]
)
ans = 0
# rotate clockwise, then rotate counterclockwise
for i in range(n):
if ans < v[i] - 2 * x[i] + max_nut_counterclockwise[i]:
ans = v[i] - 2 * x[i] + max_nut_counterclockwise[i]
# rotate counterclockwise, then rotate clockwise
for i in range(2, n + 2):
if ans < v[-1] - v[i - 1] - 2 * (c - x[i]) + max_nut_clockwise[i - 1]:
ans = v[-1] - v[i - 1] - 2 * (c - x[i]) + max_nut_clockwise[i - 1]
print(ans)
main()
| false | 2.777778 | [
"- from numpy import zeros",
"- x, v = zeros(n + 2, dtype=int), zeros(n + 2, dtype=int)",
"+ x, v = [0] * (n + 2), [0] * (n + 2)",
"- max_nut_clockwise = zeros(n + 1, dtype=int)",
"+ max_nut_clockwise = [0] * (n + 1)",
"- max_nut_counterclockwise = zeros(n + 1, dtype=int)",
"+ max_n... | false | 0.235679 | 0.007668 | 30.733823 | [
"s238657837",
"s844520359"
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.