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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
u123756661 | p03852 | python | s778654106 | s677192680 | 205 | 169 | 38,256 | 38,256 | Accepted | Accepted | 17.56 | c=eval(input())
print(('vowel' if c in 'aiueo' else 'consonant')) | c=eval(input())
print((["consonant","vowel"][c in "aiueo"])) | 2 | 2 | 58 | 53 | c = eval(input())
print(("vowel" if c in "aiueo" else "consonant"))
| c = eval(input())
print((["consonant", "vowel"][c in "aiueo"]))
| false | 0 | [
"-print((\"vowel\" if c in \"aiueo\" else \"consonant\"))",
"+print(([\"consonant\", \"vowel\"][c in \"aiueo\"]))"
] | false | 0.040843 | 0.04154 | 0.983213 | [
"s778654106",
"s677192680"
] |
u367965715 | p03078 | python | s863958329 | s373114600 | 825 | 46 | 219,252 | 10,388 | Accepted | Accepted | 94.42 | from itertools import product
x, y, z, k = list(map(int, input().split()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
c = list(map(int, input().split()))
p = [i + k for i, k in product(a, b)]
p.sort(reverse=True)
q = [i + k for i, k in product(p[:k], c)]
q.sort(reverse=True)
pr... | import heapq
x, y, z, k = list(map(int, input().split()))
a = sorted(list(map(int, input().split())), reverse=True)
b = sorted(list(map(int, input().split())), reverse=True)
c = sorted(list(map(int, input().split())), reverse=True)
que = [(-(a[0]+b[0]+c[0]), 0, 0, 0)]
is_pushed = {(0, 0, 0): 1}
for _ in rang... | 12 | 21 | 346 | 825 | from itertools import product
x, y, z, k = list(map(int, input().split()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
c = list(map(int, input().split()))
p = [i + k for i, k in product(a, b)]
p.sort(reverse=True)
q = [i + k for i, k in product(p[:k], c)]
q.sort(reverse=True)
print(("\n".jo... | import heapq
x, y, z, k = list(map(int, input().split()))
a = sorted(list(map(int, input().split())), reverse=True)
b = sorted(list(map(int, input().split())), reverse=True)
c = sorted(list(map(int, input().split())), reverse=True)
que = [(-(a[0] + b[0] + c[0]), 0, 0, 0)]
is_pushed = {(0, 0, 0): 1}
for _ in range(k):
... | false | 42.857143 | [
"-from itertools import product",
"+import heapq",
"-a = list(map(int, input().split()))",
"-b = list(map(int, input().split()))",
"-c = list(map(int, input().split()))",
"-p = [i + k for i, k in product(a, b)]",
"-p.sort(reverse=True)",
"-q = [i + k for i, k in product(p[:k], c)]",
"-q.sort(reverse... | false | 0.034589 | 0.036427 | 0.949557 | [
"s863958329",
"s373114600"
] |
u219197917 | p03599 | python | s590464905 | s468976878 | 210 | 60 | 3,064 | 3,188 | Accepted | Accepted | 71.43 | def main():
a, b, c, d, e, f = list(map(int, input().split()))
a *= 100
b *= 100
m = (-1, 0, 0)
for i in range(f // a + 1):
for j in range((f - (a * i)) // b + 1):
ma = a * i + b * j
if ma == 0:
continue
for k in range((f - ma) //... | def main():
a, b, c, d, e, f = list(map(int, input().split()))
x, y = set(), set()
for i in range(f // (100 * a) + 1):
for j in range((f - 100 * a * i) // (100 * b) + 1):
x.add(100 * a * i + 100 * b * j)
for i in range(f // c + 1):
for j in range((f - c * i) // d + 1):... | 25 | 26 | 761 | 740 | def main():
a, b, c, d, e, f = list(map(int, input().split()))
a *= 100
b *= 100
m = (-1, 0, 0)
for i in range(f // a + 1):
for j in range((f - (a * i)) // b + 1):
ma = a * i + b * j
if ma == 0:
continue
for k in range((f - ma) // c + 1):
... | def main():
a, b, c, d, e, f = list(map(int, input().split()))
x, y = set(), set()
for i in range(f // (100 * a) + 1):
for j in range((f - 100 * a * i) // (100 * b) + 1):
x.add(100 * a * i + 100 * b * j)
for i in range(f // c + 1):
for j in range((f - c * i) // d + 1):
... | false | 3.846154 | [
"- a *= 100",
"- b *= 100",
"- m = (-1, 0, 0)",
"- for i in range(f // a + 1):",
"- for j in range((f - (a * i)) // b + 1):",
"- ma = a * i + b * j",
"- if ma == 0:",
"+ x, y = set(), set()",
"+ for i in range(f // (100 * a) + 1):",
"+ for j in... | false | 0.062774 | 0.117258 | 0.535352 | [
"s590464905",
"s468976878"
] |
u597374218 | p03359 | python | s325605445 | s903394992 | 30 | 25 | 9,032 | 9,088 | Accepted | Accepted | 16.67 | a, b = list(map(int, input().split()))
print((a-1 if a > b else a)) | a,b=list(map(int,input().split()))
print((a-(a>b))) | 2 | 2 | 60 | 44 | a, b = list(map(int, input().split()))
print((a - 1 if a > b else a))
| a, b = list(map(int, input().split()))
print((a - (a > b)))
| false | 0 | [
"-print((a - 1 if a > b else a))",
"+print((a - (a > b)))"
] | false | 0.266222 | 0.045424 | 5.860814 | [
"s325605445",
"s903394992"
] |
u345966487 | p03569 | python | s924034144 | s720327081 | 78 | 48 | 4,096 | 3,316 | Accepted | Accepted | 38.46 | s = eval(input())
N = len(s)
s_trim = ''.join([c for c in s if c != 'x'])
N_trim = len(s_trim)
def check_anagram():
for i in range(N_trim):
j = N_trim - 1 - i
if s_trim[i] != s_trim[j]:
return False
return True
def solve():
if not check_anagram():
return -... | s = eval(input())
N = len(s)
def solve():
l = 0
r = N - 1
cost = 0
while l < r:
if s[l] == s[r]:
l += 1
r -= 1
elif s[l] == 'x':
cost += 1
l += 1
elif s[r] == 'x':
cost += 1
r -= 1
e... | 61 | 22 | 1,416 | 377 | s = eval(input())
N = len(s)
s_trim = "".join([c for c in s if c != "x"])
N_trim = len(s_trim)
def check_anagram():
for i in range(N_trim):
j = N_trim - 1 - i
if s_trim[i] != s_trim[j]:
return False
return True
def solve():
if not check_anagram():
return -1
if N_t... | s = eval(input())
N = len(s)
def solve():
l = 0
r = N - 1
cost = 0
while l < r:
if s[l] == s[r]:
l += 1
r -= 1
elif s[l] == "x":
cost += 1
l += 1
elif s[r] == "x":
cost += 1
r -= 1
else:
... | false | 63.934426 | [
"-s_trim = \"\".join([c for c in s if c != \"x\"])",
"-N_trim = len(s_trim)",
"-",
"-",
"-def check_anagram():",
"- for i in range(N_trim):",
"- j = N_trim - 1 - i",
"- if s_trim[i] != s_trim[j]:",
"- return False",
"- return True",
"- if not check_anagram():",
... | false | 0.047389 | 0.037358 | 1.268514 | [
"s924034144",
"s720327081"
] |
u296518383 | p03681 | python | s617361067 | s268140271 | 62 | 42 | 3,064 | 3,064 | Accepted | Accepted | 32.26 | import math as m
N,M=list(map(int,input().split()))
if abs(N-M)>=2:
print((0))
else:
N,M=max(N,M),min(N,M)
Pm=1
for i in range(1,M+1):
Pm*=i
Pm%=10**9+7
Pn=1
for i in range(1,N+1):
Pn*=i
Pn%=10**9+7
print(((Pm*Pn*1)%(10**9+7) if M!=N else (Pm*Pn*2)%(10**9+7)... | N, M = list(map(int, input().split()))
MOD = 10 ** 9 + 7
def permutation(n):
res = 1
for i in range(1, n + 1):
res = (res * i) % MOD
return res
if abs(N - M) >= 2:
print((0))
else:
if N == M:
print(((permutation(N) * permutation(M) * 2) % MOD))
else:
N, M = max(N, M), min(N, M)
... | 22 | 17 | 315 | 361 | import math as m
N, M = list(map(int, input().split()))
if abs(N - M) >= 2:
print((0))
else:
N, M = max(N, M), min(N, M)
Pm = 1
for i in range(1, M + 1):
Pm *= i
Pm %= 10**9 + 7
Pn = 1
for i in range(1, N + 1):
Pn *= i
Pn %= 10**9 + 7
print(((Pm * Pn * 1) % (... | N, M = list(map(int, input().split()))
MOD = 10**9 + 7
def permutation(n):
res = 1
for i in range(1, n + 1):
res = (res * i) % MOD
return res
if abs(N - M) >= 2:
print((0))
else:
if N == M:
print(((permutation(N) * permutation(M) * 2) % MOD))
else:
N, M = max(N, M), m... | false | 22.727273 | [
"-import math as m",
"+N, M = list(map(int, input().split()))",
"+MOD = 10**9 + 7",
"-N, M = list(map(int, input().split()))",
"+",
"+def permutation(n):",
"+ res = 1",
"+ for i in range(1, n + 1):",
"+ res = (res * i) % MOD",
"+ return res",
"+",
"+",
"- N, M = max(N, M),... | false | 0.045723 | 0.045785 | 0.998654 | [
"s617361067",
"s268140271"
] |
u143509139 | p03040 | python | s261365235 | s559037196 | 1,739 | 738 | 11,132 | 89,332 | Accepted | Accepted | 57.56 | import heapq
Q = int(eval(input()))
INF = 2 * (10 ** 9)
a1, a2 = [INF], [INF]
asum1 = 0
asum2 = 0
bsum = 0
for i in range(Q):
query = list(map(int, input().split()))
if query[0] == 3:
break
if query[0] == 1:
a, b = query[1:]
bsum += b
if len(a1) == len(a2):
... | import heapq
qq = int(eval(input()))
ans = 0
hq1 = []
hq2 = []
x = 10 ** 10
c = 0
p, q = 0, 0
for _ in range(qq):
que = list(map(int, input().split()))
if que[0] == 1:
a, b = que[1:]
ans += b
if c % 2 == 0:
if a <= x:
heapq.heappush(hq1, -a)
... | 38 | 39 | 1,055 | 972 | import heapq
Q = int(eval(input()))
INF = 2 * (10**9)
a1, a2 = [INF], [INF]
asum1 = 0
asum2 = 0
bsum = 0
for i in range(Q):
query = list(map(int, input().split()))
if query[0] == 3:
break
if query[0] == 1:
a, b = query[1:]
bsum += b
if len(a1) == len(a2):
if -a1[... | import heapq
qq = int(eval(input()))
ans = 0
hq1 = []
hq2 = []
x = 10**10
c = 0
p, q = 0, 0
for _ in range(qq):
que = list(map(int, input().split()))
if que[0] == 1:
a, b = que[1:]
ans += b
if c % 2 == 0:
if a <= x:
heapq.heappush(hq1, -a)
p +... | false | 2.564103 | [
"-Q = int(eval(input()))",
"-INF = 2 * (10**9)",
"-a1, a2 = [INF], [INF]",
"-asum1 = 0",
"-asum2 = 0",
"-bsum = 0",
"-for i in range(Q):",
"- query = list(map(int, input().split()))",
"- if query[0] == 3:",
"- break",
"- if query[0] == 1:",
"- a, b = query[1:]",
"- ... | false | 0.130608 | 0.073426 | 1.778768 | [
"s261365235",
"s559037196"
] |
u580093517 | p04044 | python | s849057915 | s089275894 | 20 | 17 | 3,060 | 3,060 | Accepted | Accepted | 15 | n,l = map(int,input().split())
s = sorted([input() for i in range(n)])
print(*s,sep = "")
| n,l = list(map(int,input().split()))
s = sorted([eval(input()) for i in range(n)])
print(("".join(s))) | 3 | 3 | 91 | 90 | n, l = map(int, input().split())
s = sorted([input() for i in range(n)])
print(*s, sep="")
| n, l = list(map(int, input().split()))
s = sorted([eval(input()) for i in range(n)])
print(("".join(s)))
| false | 0 | [
"-n, l = map(int, input().split())",
"-s = sorted([input() for i in range(n)])",
"-print(*s, sep=\"\")",
"+n, l = list(map(int, input().split()))",
"+s = sorted([eval(input()) for i in range(n)])",
"+print((\"\".join(s)))"
] | false | 0.069455 | 0.051221 | 1.355984 | [
"s849057915",
"s089275894"
] |
u682860781 | p02888 | python | s278806668 | s675783377 | 1,951 | 1,365 | 3,188 | 3,188 | Accepted | Accepted | 30.04 | from bisect import bisect_left
n = int(eval(input()))
l = sorted(list(map(int, input().split())))
answer = 0
for i in range(n - 2):
for j in range(i + 1, n - 1):
lij = l[i] + l[j]
r = bisect_left(l, lij)
answer += max(0, r - j - 1)
print(answer)
| from bisect import bisect_left
n = int(eval(input()))
l = sorted(list(map(int, input().split())))
answer = 0
for i in range(n - 2):
for j in range(i + 1, n - 1):
lij = l[i] + l[j]
r = bisect_left(l, lij)
answer += r - j - 1
print(answer)
| 13 | 13 | 291 | 283 | from bisect import bisect_left
n = int(eval(input()))
l = sorted(list(map(int, input().split())))
answer = 0
for i in range(n - 2):
for j in range(i + 1, n - 1):
lij = l[i] + l[j]
r = bisect_left(l, lij)
answer += max(0, r - j - 1)
print(answer)
| from bisect import bisect_left
n = int(eval(input()))
l = sorted(list(map(int, input().split())))
answer = 0
for i in range(n - 2):
for j in range(i + 1, n - 1):
lij = l[i] + l[j]
r = bisect_left(l, lij)
answer += r - j - 1
print(answer)
| false | 0 | [
"- answer += max(0, r - j - 1)",
"+ answer += r - j - 1"
] | false | 0.039154 | 0.039408 | 0.993561 | [
"s278806668",
"s675783377"
] |
u677523557 | p02991 | python | s828002044 | s976531717 | 693 | 365 | 18,992 | 42,184 | Accepted | Accepted | 47.33 | import sys
input = sys.stdin.readline
N, M = list(map(int, input().split()))
# N-1辺表示をグラフ表示に
graph = [[] for _ in range(N)]
for _ in range(M):
a, b = list(map(int, input().split()))
graph[a-1].append(b-1)
S, T = [int(x)-1 for x in input().split()]
q = {S}
checked = [False]*N
checked[S] = True
... | import sys
input = sys.stdin.readline
N, M = list(map(int, input().split()))
graph = [[] for _ in range(N)]
for _ in range(M):
a, b = list(map(int, input().split()))
graph[a-1].append(b-1)
#graph[b-1].append(a-1)
S, T = list(map(int, input().split()))
S -= 1; T -= 1
D = [[-1]*3 for _ in range(... | 42 | 29 | 820 | 619 | import sys
input = sys.stdin.readline
N, M = list(map(int, input().split()))
# N-1辺表示をグラフ表示に
graph = [[] for _ in range(N)]
for _ in range(M):
a, b = list(map(int, input().split()))
graph[a - 1].append(b - 1)
S, T = [int(x) - 1 for x in input().split()]
q = {S}
checked = [False] * N
checked[S] = True
ok = Fals... | import sys
input = sys.stdin.readline
N, M = list(map(int, input().split()))
graph = [[] for _ in range(N)]
for _ in range(M):
a, b = list(map(int, input().split()))
graph[a - 1].append(b - 1)
# graph[b-1].append(a-1)
S, T = list(map(int, input().split()))
S -= 1
T -= 1
D = [[-1] * 3 for _ in range(N)]
D[S... | false | 30.952381 | [
"-# N-1辺表示をグラフ表示に",
"-S, T = [int(x) - 1 for x in input().split()]",
"-q = {S}",
"-checked = [False] * N",
"-checked[S] = True",
"-ok = False",
"-c = 0",
"+ # graph[b-1].append(a-1)",
"+S, T = list(map(int, input().split()))",
"+S -= 1",
"+T -= 1",
"+D = [[-1] * 3 for _ in range(N)]",
"+D... | false | 0.063888 | 0.04399 | 1.452333 | [
"s828002044",
"s976531717"
] |
u644907318 | p02606 | python | s163377330 | s740612940 | 83 | 72 | 61,524 | 61,580 | Accepted | Accepted | 13.25 | L,R,d = list(map(int,input().split()))
k = L//d
n = R//d
if L%d==0:
print((n-k+1))
else:
print((n-k)) | L,R,d = list(map(int,input().split()))
print((R//d-(L-1)//d)) | 7 | 2 | 105 | 54 | L, R, d = list(map(int, input().split()))
k = L // d
n = R // d
if L % d == 0:
print((n - k + 1))
else:
print((n - k))
| L, R, d = list(map(int, input().split()))
print((R // d - (L - 1) // d))
| false | 71.428571 | [
"-k = L // d",
"-n = R // d",
"-if L % d == 0:",
"- print((n - k + 1))",
"-else:",
"- print((n - k))",
"+print((R // d - (L - 1) // d))"
] | false | 0.078603 | 0.183168 | 0.42913 | [
"s163377330",
"s740612940"
] |
u489959379 | p03152 | python | s146042660 | s296239571 | 1,562 | 753 | 68,648 | 9,288 | Accepted | Accepted | 51.79 | import sys
from bisect import bisect_left
sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline
f_inf = float('inf')
mod = 10 ** 9 + 7
def resolve():
n, m = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
if len(A) != len(set(A)... | import sys
from bisect import bisect_left
sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline
f_inf = float('inf')
mod = 10 ** 9 + 7
def resolve():
n, m = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
if len(A) != len(set(A)... | 38 | 38 | 895 | 897 | import sys
from bisect import bisect_left
sys.setrecursionlimit(10**7)
input = sys.stdin.readline
f_inf = float("inf")
mod = 10**9 + 7
def resolve():
n, m = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
if len(A) != len(set(A)) or len(B) != le... | import sys
from bisect import bisect_left
sys.setrecursionlimit(10**7)
input = sys.stdin.readline
f_inf = float("inf")
mod = 10**9 + 7
def resolve():
n, m = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
if len(A) != len(set(A)) or len(B) != le... | false | 0 | [
"- elif x in A:",
"+ elif x in As:",
"- elif x in B:",
"+ elif x in Bs:"
] | false | 0.149826 | 0.066371 | 2.257389 | [
"s146042660",
"s296239571"
] |
u242031676 | p03208 | python | s098320653 | s167853873 | 181 | 115 | 14,092 | 14,092 | Accepted | Accepted | 36.46 | n, k, *a = list(map(int, open(0).read().split()))
a.sort()
for i in range(n-1): a[n-i-1] = abs(a[n-i-1]-a[n-i-2])
a[0] = 0
for i in range(n-1): a[i+1] += a[i]
mn = 1e18
for i in range(n-k+1): mn = min(mn, a[i+k-1]-a[i])
print(mn) | n, k, *a = list(map(int, open(0).read().split()))
a.sort()
ans = 1e18
for i in range(n-k+1): ans = min(ans, a[i+k-1]-a[i])
print(ans) | 9 | 6 | 232 | 133 | n, k, *a = list(map(int, open(0).read().split()))
a.sort()
for i in range(n - 1):
a[n - i - 1] = abs(a[n - i - 1] - a[n - i - 2])
a[0] = 0
for i in range(n - 1):
a[i + 1] += a[i]
mn = 1e18
for i in range(n - k + 1):
mn = min(mn, a[i + k - 1] - a[i])
print(mn)
| n, k, *a = list(map(int, open(0).read().split()))
a.sort()
ans = 1e18
for i in range(n - k + 1):
ans = min(ans, a[i + k - 1] - a[i])
print(ans)
| false | 33.333333 | [
"-for i in range(n - 1):",
"- a[n - i - 1] = abs(a[n - i - 1] - a[n - i - 2])",
"-a[0] = 0",
"-for i in range(n - 1):",
"- a[i + 1] += a[i]",
"-mn = 1e18",
"+ans = 1e18",
"- mn = min(mn, a[i + k - 1] - a[i])",
"-print(mn)",
"+ ans = min(ans, a[i + k - 1] - a[i])",
"+print(ans)"
] | false | 0.036457 | 0.075925 | 0.480172 | [
"s098320653",
"s167853873"
] |
u021763820 | p02813 | python | s399721036 | s541155379 | 58 | 49 | 8,052 | 8,052 | Accepted | Accepted | 15.52 | # -*- coding: utf-8 -*-
from itertools import permutations as perm
N = int(eval(input()))
P = tuple(list(map(int, input().split())))
Q = tuple(list(map(int, input().split())))
a = 0
b = 0
for Pi in sorted(perm(P)):
if P != Pi:
a += 1
if P == Pi:
a += 1
break
for ... | # -*- coding: utf-8 -*-
from itertools import permutations as p
N = int(eval(input()))
A = [i for i in range(1, N+1)]
P = tuple(list(map(int, input().split())))
Q = tuple(list(map(int, input().split())))
cntp = 1
cntq = 1
for i in sorted(p(A)):
if i != P:
cntp += 1
if i == P:
cntp +=... | 25 | 21 | 436 | 463 | # -*- coding: utf-8 -*-
from itertools import permutations as perm
N = int(eval(input()))
P = tuple(list(map(int, input().split())))
Q = tuple(list(map(int, input().split())))
a = 0
b = 0
for Pi in sorted(perm(P)):
if P != Pi:
a += 1
if P == Pi:
a += 1
break
for Qi in sorted(perm(Q)):
... | # -*- coding: utf-8 -*-
from itertools import permutations as p
N = int(eval(input()))
A = [i for i in range(1, N + 1)]
P = tuple(list(map(int, input().split())))
Q = tuple(list(map(int, input().split())))
cntp = 1
cntq = 1
for i in sorted(p(A)):
if i != P:
cntp += 1
if i == P:
cntp += 1
... | false | 16 | [
"-from itertools import permutations as perm",
"+from itertools import permutations as p",
"+A = [i for i in range(1, N + 1)]",
"-a = 0",
"-b = 0",
"-for Pi in sorted(perm(P)):",
"- if P != Pi:",
"- a += 1",
"- if P == Pi:",
"- a += 1",
"+cntp = 1",
"+cntq = 1",
"+for i i... | false | 0.040157 | 0.03998 | 1.004436 | [
"s399721036",
"s541155379"
] |
u761529120 | p02796 | python | s618367422 | s298923340 | 901 | 424 | 55,000 | 91,840 | Accepted | Accepted | 52.94 | def main():
N = int(eval(input()))
A = []
for _ in range(N):
X, L = list(map(int, input().split()))
A.append((X, L))
A.sort()
cnt = 0
right = 0
left = 0
for i in range(N):
if i == 0:
left = A[i][0] - A[i][1]
right = A[i][0] ... | def main():
N = int(eval(input()))
robot = []
for _ in range(N):
X, L = list(map(int, input().split()))
robot.append([X-L,X+L])
robot.sort(key=lambda x: x[1])
cnt = 1
l = robot[0][1]
for i in range(1,N):
if l <= robot[i][0]:
cnt += 1
... | 32 | 20 | 777 | 389 | def main():
N = int(eval(input()))
A = []
for _ in range(N):
X, L = list(map(int, input().split()))
A.append((X, L))
A.sort()
cnt = 0
right = 0
left = 0
for i in range(N):
if i == 0:
left = A[i][0] - A[i][1]
right = A[i][0] + A[i][1]
... | def main():
N = int(eval(input()))
robot = []
for _ in range(N):
X, L = list(map(int, input().split()))
robot.append([X - L, X + L])
robot.sort(key=lambda x: x[1])
cnt = 1
l = robot[0][1]
for i in range(1, N):
if l <= robot[i][0]:
cnt += 1
l = ... | false | 37.5 | [
"- A = []",
"+ robot = []",
"- A.append((X, L))",
"- A.sort()",
"- cnt = 0",
"- right = 0",
"- left = 0",
"- for i in range(N):",
"- if i == 0:",
"- left = A[i][0] - A[i][1]",
"- right = A[i][0] + A[i][1]",
"- else:",
"- ... | false | 0.102004 | 0.059989 | 1.700372 | [
"s618367422",
"s298923340"
] |
u633068244 | p00120 | python | s477422388 | s625191388 | 30 | 20 | 4,336 | 4,332 | Accepted | Accepted | 33.33 | def L(cake1,cake2):
return ((cake1+cake2)**2-abs(cake1-cake2)**2)**0.5
while 1:
try:
Cakes=list(map(int,input().split()))
size_max=Cakes.pop(0)
Cakes=sorted(Cakes)[::-1]
size_min=999
for j in range(len(Cakes)):
cakes=Cakes[:]
box=[cake... | def L(cake1,cake2):
return ((cake1+cake2)**2-abs(cake1-cake2)**2)**0.5
while 1:
try:
Cakes=list(map(int,input().split()))
size_max=Cakes.pop(0)
size_min=999
for j in range(len(Cakes)):
cakes=Cakes[:]
box=[cakes.pop(j)]
while cakes:
cos=[L(box[-1],i)/(box[-1]+i) for i in cakes]
... | 22 | 21 | 713 | 549 | def L(cake1, cake2):
return ((cake1 + cake2) ** 2 - abs(cake1 - cake2) ** 2) ** 0.5
while 1:
try:
Cakes = list(map(int, input().split()))
size_max = Cakes.pop(0)
Cakes = sorted(Cakes)[::-1]
size_min = 999
for j in range(len(Cakes)):
cakes = Cakes[:]
... | def L(cake1, cake2):
return ((cake1 + cake2) ** 2 - abs(cake1 - cake2) ** 2) ** 0.5
while 1:
try:
Cakes = list(map(int, input().split()))
size_max = Cakes.pop(0)
size_min = 999
for j in range(len(Cakes)):
cakes = Cakes[:]
box = [cakes.pop(j)]
... | false | 4.545455 | [
"- Cakes = sorted(Cakes)[::-1]"
] | false | 0.041153 | 0.042022 | 0.979333 | [
"s477422388",
"s625191388"
] |
u352394527 | p00494 | python | s522854638 | s704592087 | 780 | 400 | 7,516 | 7,520 | Accepted | Accepted | 48.72 | s = eval(input())
length = len(s)
ind = 0
ans = 0
while ind < length:
j_num = 0
o_num = 0
i_num = 0
while ind < length and s[ind] != "J":
ind += 1
while ind < length and s[ind] == "J":
j_num += 1
ind += 1
while ind < length and s[ind] == "O":
o_num += 1
ind += 1
while i... | def main():
s = eval(input())
end = len(s)
ind = 0
ans = 0
while ind < end:
j_num = 0
o_num = 0
i_num = 0
while ind < end and s[ind] != "J":
ind += 1
while ind < end and s[ind] == "J":
j_num += 1
ind += 1
while ind < end and s[ind] == "O":
o_num +... | 22 | 24 | 455 | 502 | s = eval(input())
length = len(s)
ind = 0
ans = 0
while ind < length:
j_num = 0
o_num = 0
i_num = 0
while ind < length and s[ind] != "J":
ind += 1
while ind < length and s[ind] == "J":
j_num += 1
ind += 1
while ind < length and s[ind] == "O":
o_num += 1
in... | def main():
s = eval(input())
end = len(s)
ind = 0
ans = 0
while ind < end:
j_num = 0
o_num = 0
i_num = 0
while ind < end and s[ind] != "J":
ind += 1
while ind < end and s[ind] == "J":
j_num += 1
ind += 1
while ind <... | false | 8.333333 | [
"-s = eval(input())",
"-length = len(s)",
"-ind = 0",
"-ans = 0",
"-while ind < length:",
"- j_num = 0",
"- o_num = 0",
"- i_num = 0",
"- while ind < length and s[ind] != \"J\":",
"- ind += 1",
"- while ind < length and s[ind] == \"J\":",
"- j_num += 1",
"- ... | false | 0.17222 | 0.089094 | 1.933023 | [
"s522854638",
"s704592087"
] |
u864197622 | p02563 | python | s493611592 | s753164238 | 1,391 | 1,280 | 203,040 | 203,264 | Accepted | Accepted | 7.98 | p, g = 998244353, 3
invg = pow(g, p-2, p)
W = [pow(g, (p - 1) >> i, p) for i in range(24)]
iW = [pow(invg, (p - 1) >> i, p) for i in range(24)]
def convolve(a, b):
def fft(f):
for l in range(k)[::-1]:
d = 1 << l
u = 1
for i in range(d):
for j in ... | p, g = 998244353, 3
def convolve(a, b):
def fft(f):
for l in range(k)[::-1]:
d = 1 << l
v = W[k-1-l]
u = 1
for i in range(d):
for j in range(i, n, 2*d):
f[j], f[j+d] = (f[j] + f[j+d]) % p, u * (f[j] - f[j+d]) % p
... | 40 | 47 | 1,226 | 1,342 | p, g = 998244353, 3
invg = pow(g, p - 2, p)
W = [pow(g, (p - 1) >> i, p) for i in range(24)]
iW = [pow(invg, (p - 1) >> i, p) for i in range(24)]
def convolve(a, b):
def fft(f):
for l in range(k)[::-1]:
d = 1 << l
u = 1
for i in range(d):
for j in range(... | p, g = 998244353, 3
def convolve(a, b):
def fft(f):
for l in range(k)[::-1]:
d = 1 << l
v = W[k - 1 - l]
u = 1
for i in range(d):
for j in range(i, n, 2 * d):
f[j], f[j + d] = (f[j] + f[j + d]) % p, u * (f[j] - f[j + d]) %... | false | 14.893617 | [
"-invg = pow(g, p - 2, p)",
"-W = [pow(g, (p - 1) >> i, p) for i in range(24)]",
"-iW = [pow(invg, (p - 1) >> i, p) for i in range(24)]",
"+ v = W[k - 1 - l]",
"- u = u * W[l + 1] % p",
"+ u = u * v % p",
"+ v = iW[k - 1 - l]",
"- u = ... | false | 0.040994 | 0.041838 | 0.979817 | [
"s493611592",
"s753164238"
] |
u312025627 | p02955 | python | s138049973 | s273693393 | 253 | 145 | 41,692 | 73,984 | Accepted | Accepted | 42.69 | def main():
N, K = (int(i) for i in input().split())
A = [int(i) for i in input().split()]
sumA = sum(A)
def trial_division(n):
divs = []
for i in range(1, int(n**0.5)+1):
if n % i == 0:
divs.append(i)
if i != n//i:
... | def main():
from itertools import accumulate
N, K = (int(i) for i in input().split())
A = [int(i) for i in input().split()]
sumA = sum(A)
def enum_divisors(n):
# 約数列挙
divs = []
for i in range(1, n+1):
if i*i > n:
break
if n... | 36 | 45 | 928 | 1,156 | def main():
N, K = (int(i) for i in input().split())
A = [int(i) for i in input().split()]
sumA = sum(A)
def trial_division(n):
divs = []
for i in range(1, int(n**0.5) + 1):
if n % i == 0:
divs.append(i)
if i != n // i:
div... | def main():
from itertools import accumulate
N, K = (int(i) for i in input().split())
A = [int(i) for i in input().split()]
sumA = sum(A)
def enum_divisors(n):
# 約数列挙
divs = []
for i in range(1, n + 1):
if i * i > n:
break
if n % i ==... | false | 20 | [
"+ from itertools import accumulate",
"+",
"- def trial_division(n):",
"+ def enum_divisors(n):",
"+ # 約数列挙",
"- for i in range(1, int(n**0.5) + 1):",
"+ for i in range(1, n + 1):",
"+ if i * i > n:",
"+ break",
"- if i != n //... | false | 0.038302 | 0.042978 | 0.89119 | [
"s138049973",
"s273693393"
] |
u923279197 | p02762 | python | s577066075 | s824923608 | 1,641 | 1,482 | 113,184 | 76,448 | Accepted | Accepted | 9.69 | class UnionFind:
def __init__(self, n):
# 親要素のノード番号を格納 par[x] == x の時そのノードは根
self.par = [i for i in range(n+1)]
# 木の高さを格納する（初期状態では0)
self.rank = [0] * (n+1)
# 各々の集合の要素数（根が代表して値を持っておく）
self.count = [1] * (n+1)
# 検索
def find(self, x):
# 根ならその... | class UnionFind:
def __init__(self, n):
# 親要素のノード番号を格納 par[x] == x の時そのノードは根
self.par = [i for i in range(n+1)]
# 木の高さを格納する（初期状態では0)
self.rank = [0] * (n+1)
# 各々の集合の要素数（根が代表して値を持っておく）
self.count = [1] * (n+1)
# 検索
def find(self, x):
# 根ならその... | 69 | 77 | 1,711 | 1,922 | class UnionFind:
def __init__(self, n):
# 親要素のノード番号を格納 par[x] == x の時そのノードは根
self.par = [i for i in range(n + 1)]
# 木の高さを格納する（初期状態では0)
self.rank = [0] * (n + 1)
# 各々の集合の要素数（根が代表して値を持っておく）
self.count = [1] * (n + 1)
# 検索
def find(self, x):
# 根ならその番号を返す... | class UnionFind:
def __init__(self, n):
# 親要素のノード番号を格納 par[x] == x の時そのノードは根
self.par = [i for i in range(n + 1)]
# 木の高さを格納する（初期状態では0)
self.rank = [0] * (n + 1)
# 各々の集合の要素数（根が代表して値を持っておく）
self.count = [1] * (n + 1)
# 検索
def find(self, x):
# 根ならその番号を返す... | false | 10.38961 | [
"- if self.par[x] == x:",
"- return x",
"- # 根でないなら親の要素で再検索",
"- else:",
"- # 検索する過程で親を更新",
"- self.par[x] = self.find(self.par[x])",
"- return self.par[x]",
"+ root = x",
"+ queue = [x]",
"+ data = []",
"+ ... | false | 0.037832 | 0.036253 | 1.043569 | [
"s577066075",
"s824923608"
] |
u766684188 | p03472 | python | s320100666 | s816486932 | 1,864 | 373 | 12,848 | 12,928 | Accepted | Accepted | 79.99 | n,h=list(map(int,input().split()))
A,B=[],[]
for _ in range(n):
a,b=list(map(int,input().split()))
A.append(a)
B.append(b)
a=max(A)
B=sorted(list([x for x in B if x>a]),reverse=True)
ans=0
while h>0 and B:
h-=B[0]
B.pop(0)
ans+=1
if h>0:
if h%a==0:
ans+=h//a
else:... | from math import ceil
n,h=list(map(int,input().split()))
A,B=[],[]
for _ in range(n):
a,b=list(map(int,input().split()))
A.append(a)
B.append(b)
a=max(A)
B=sorted(list([x for x in B if x>a]),reverse=True)
ans=0
i=0
l=len(B)
while h>0 and i<l:
h-=B[i]
ans+=1
i+=1
if h>0:
ans+... | 19 | 19 | 344 | 331 | n, h = list(map(int, input().split()))
A, B = [], []
for _ in range(n):
a, b = list(map(int, input().split()))
A.append(a)
B.append(b)
a = max(A)
B = sorted(list([x for x in B if x > a]), reverse=True)
ans = 0
while h > 0 and B:
h -= B[0]
B.pop(0)
ans += 1
if h > 0:
if h % a == 0:
an... | from math import ceil
n, h = list(map(int, input().split()))
A, B = [], []
for _ in range(n):
a, b = list(map(int, input().split()))
A.append(a)
B.append(b)
a = max(A)
B = sorted(list([x for x in B if x > a]), reverse=True)
ans = 0
i = 0
l = len(B)
while h > 0 and i < l:
h -= B[i]
ans += 1
i +=... | false | 0 | [
"+from math import ceil",
"+",
"-while h > 0 and B:",
"- h -= B[0]",
"- B.pop(0)",
"+i = 0",
"+l = len(B)",
"+while h > 0 and i < l:",
"+ h -= B[i]",
"+ i += 1",
"- if h % a == 0:",
"- ans += h // a",
"- else:",
"- ans += h // a + 1",
"+ ans += ceil(h /... | false | 0.05275 | 0.032605 | 1.617848 | [
"s320100666",
"s816486932"
] |
u186838327 | p03240 | python | s871433027 | s671885526 | 210 | 106 | 42,224 | 73,868 | Accepted | Accepted | 49.52 | n = int(eval(input()))
HXY = []
for i in range(n):
x, y, h = list(map(int, input().split()))
HXY.append((h, x, y))
HXY.sort(reverse=True)
for i in range(101):
for j in range(101):
H = -1
for k in range(n):
h, x, y = HXY[k]
if h > 0:
tem... | n = int(eval(input()))
XYH = []
for i in range(n):
x, y, h = list(map(int, input().split()))
XYH.append((h, x, y))
XYH.sort(reverse=True)
for i in range(101):
for j in range(101):
H = -1
flag = True
for k in range(n):
h, x, y = XYH[k]
if H ==... | 26 | 23 | 647 | 527 | n = int(eval(input()))
HXY = []
for i in range(n):
x, y, h = list(map(int, input().split()))
HXY.append((h, x, y))
HXY.sort(reverse=True)
for i in range(101):
for j in range(101):
H = -1
for k in range(n):
h, x, y = HXY[k]
if h > 0:
temp = h + abs(x - ... | n = int(eval(input()))
XYH = []
for i in range(n):
x, y, h = list(map(int, input().split()))
XYH.append((h, x, y))
XYH.sort(reverse=True)
for i in range(101):
for j in range(101):
H = -1
flag = True
for k in range(n):
h, x, y = XYH[k]
if H == -1:
... | false | 11.538462 | [
"-HXY = []",
"+XYH = []",
"- HXY.append((h, x, y))",
"-HXY.sort(reverse=True)",
"+ XYH.append((h, x, y))",
"+XYH.sort(reverse=True)",
"+ flag = True",
"- h, x, y = HXY[k]",
"- if h > 0:",
"- temp = h + abs(x - i) + abs(y - j)",
"- ... | false | 0.058289 | 0.048053 | 1.213016 | [
"s871433027",
"s671885526"
] |
u562016607 | p03326 | python | s721390528 | s127822833 | 56 | 27 | 3,564 | 3,188 | Accepted | Accepted | 51.79 | import itertools
N,M=list(map(int,input().split()))
x=[0 for i in range(N)]
y=[0 for i in range(N)]
z=[0 for i in range(N)]
for i in range(N):
x[i],y[i],z[i]=list(map(int,input().split()))
w=[[0 for i in range(N)] for i in range(8)]
S=list(itertools.product([-1,1],repeat=3))
def num(inp):
res=0
f... | import itertools
N,M=list(map(int,input().split()))
x=[0 for i in range(N)]
y=[0 for i in range(N)]
z=[0 for i in range(N)]
for i in range(N):
x[i],y[i],z[i]=list(map(int,input().split()))
S=list(itertools.product([-1,1],repeat=3))
def num(seq):
res=0
for i in range(3):
if seq[i]==1:
... | 23 | 24 | 622 | 554 | import itertools
N, M = list(map(int, input().split()))
x = [0 for i in range(N)]
y = [0 for i in range(N)]
z = [0 for i in range(N)]
for i in range(N):
x[i], y[i], z[i] = list(map(int, input().split()))
w = [[0 for i in range(N)] for i in range(8)]
S = list(itertools.product([-1, 1], repeat=3))
def num(inp):
... | import itertools
N, M = list(map(int, input().split()))
x = [0 for i in range(N)]
y = [0 for i in range(N)]
z = [0 for i in range(N)]
for i in range(N):
x[i], y[i], z[i] = list(map(int, input().split()))
S = list(itertools.product([-1, 1], repeat=3))
def num(seq):
res = 0
for i in range(3):
if se... | false | 4.166667 | [
"-w = [[0 for i in range(N)] for i in range(8)]",
"-def num(inp):",
"+def num(seq):",
"- res += 2**i * (inp[i] + 1) // 2",
"+ if seq[i] == 1:",
"+ res += 2**i",
"-for sg in S:",
"- for i in range(N):",
"- w[num(sg)][i] = x[i] * sg[0] + y[i] * sg[1] + z[i] * sg[2]",... | false | 0.111173 | 0.043604 | 2.549626 | [
"s721390528",
"s127822833"
] |
u860829879 | p03074 | python | s873694872 | s976691993 | 190 | 80 | 46,064 | 81,656 | Accepted | Accepted | 57.89 | n,k=list(map(int,input().split()))
s=eval(input())
if s[0]=='0':
seq=[0]
else:
seq=[]
i=0
while i<n:
j=i
while j<n and s[j]==s[i]:
j+=1
seq.append(j-i)
i=j
if s[-1]=='0':
seq.append(0)
bleft=0
bright=min(2*k,len(seq)-1)
cursum=sum(seq[bleft:bright+1])
ret=... | from itertools import accumulate
n,k=list(map(int,input().split()))
s=eval(input())
i=0
if s[0]=='1':
lst=[]
else:
lst=[0]
while i<n:
j=i
cnt=0
while j<n and s[i]==s[j]:
cnt+=1
j+=1
lst.append(cnt)
i=j
if 2*k+1>=len(lst):
print(n)
exit(... | 39 | 34 | 618 | 485 | n, k = list(map(int, input().split()))
s = eval(input())
if s[0] == "0":
seq = [0]
else:
seq = []
i = 0
while i < n:
j = i
while j < n and s[j] == s[i]:
j += 1
seq.append(j - i)
i = j
if s[-1] == "0":
seq.append(0)
bleft = 0
bright = min(2 * k, len(seq) - 1)
cursum = sum(seq[bleft : ... | from itertools import accumulate
n, k = list(map(int, input().split()))
s = eval(input())
i = 0
if s[0] == "1":
lst = []
else:
lst = [0]
while i < n:
j = i
cnt = 0
while j < n and s[i] == s[j]:
cnt += 1
j += 1
lst.append(cnt)
i = j
if 2 * k + 1 >= len(lst):
print(n)
... | false | 12.820513 | [
"+from itertools import accumulate",
"+",
"-if s[0] == \"0\":",
"- seq = [0]",
"+i = 0",
"+if s[0] == \"1\":",
"+ lst = []",
"- seq = []",
"-i = 0",
"+ lst = [0]",
"- while j < n and s[j] == s[i]:",
"+ cnt = 0",
"+ while j < n and s[i] == s[j]:",
"+ cnt += 1",
... | false | 0.049425 | 0.049548 | 0.997508 | [
"s873694872",
"s976691993"
] |
u994521204 | p03221 | python | s502629074 | s294257878 | 842 | 694 | 31,188 | 46,260 | Accepted | Accepted | 17.58 | n,m=list(map(int,input().split()))
L=[]
for i in range(m):
p,y=list(map(int,input().split()))
L.append([p,y,i])
L.sort(key=lambda L:(L[0],L[1]))
L[0][1]=1
for i in range(1,m):
if L[i][0]!=L[i-1][0]:
L[i][1]=1
else:
L[i][1]=L[i-1][1]+1
L.sort(key=lambda L:L[2])
for i in range... | from collections import defaultdict
from bisect import bisect_left
n, m = list(map(int, input().split()))
years = defaultdict(list)
sorted_years = defaultdict(list)
PY = []
for i in range(m):
prefecture, year = list(map(int, input().split()))
years[prefecture].append(year)
PY.append((prefecture, ... | 16 | 22 | 379 | 583 | n, m = list(map(int, input().split()))
L = []
for i in range(m):
p, y = list(map(int, input().split()))
L.append([p, y, i])
L.sort(key=lambda L: (L[0], L[1]))
L[0][1] = 1
for i in range(1, m):
if L[i][0] != L[i - 1][0]:
L[i][1] = 1
else:
L[i][1] = L[i - 1][1] + 1
L.sort(key=lambda L: L[2... | from collections import defaultdict
from bisect import bisect_left
n, m = list(map(int, input().split()))
years = defaultdict(list)
sorted_years = defaultdict(list)
PY = []
for i in range(m):
prefecture, year = list(map(int, input().split()))
years[prefecture].append(year)
PY.append((prefecture, year))
for... | false | 27.272727 | [
"+from collections import defaultdict",
"+from bisect import bisect_left",
"+",
"-L = []",
"+years = defaultdict(list)",
"+sorted_years = defaultdict(list)",
"+PY = []",
"- p, y = list(map(int, input().split()))",
"- L.append([p, y, i])",
"-L.sort(key=lambda L: (L[0], L[1]))",
"-L[0][1] = ... | false | 0.072462 | 0.047323 | 1.531225 | [
"s502629074",
"s294257878"
] |
u535803878 | p02954 | python | s871167136 | s609586116 | 140 | 96 | 174,372 | 92,128 | Accepted | Accepted | 31.43 | import sys
input = lambda : sys.stdin.readline().rstrip()
sys.setrecursionlimit(max(1000, 10**9))
write = lambda x: sys.stdout.write(x+"\n")
s = eval(input())
n = len(s)
nx = []
for i in range(n):
if s[i]=="R":
nx.append(i+1)
else:
nx.append(i-1)
v = 1
while v<10*n:
nx = [n... | import sys
input = lambda : sys.stdin.readline().rstrip()
sys.setrecursionlimit(max(1000, 10**9))
write = lambda x: sys.stdout.write(x+"\n")
s = eval(input())
n = len(s)
def run_length(s):
if not s:
return []
c = s[0]
v = 1
n = len(s)
l = []
for i in range(1, n):
... | 22 | 36 | 423 | 763 | import sys
input = lambda: sys.stdin.readline().rstrip()
sys.setrecursionlimit(max(1000, 10**9))
write = lambda x: sys.stdout.write(x + "\n")
s = eval(input())
n = len(s)
nx = []
for i in range(n):
if s[i] == "R":
nx.append(i + 1)
else:
nx.append(i - 1)
v = 1
while v < 10 * n:
nx = [nx[i] f... | import sys
input = lambda: sys.stdin.readline().rstrip()
sys.setrecursionlimit(max(1000, 10**9))
write = lambda x: sys.stdout.write(x + "\n")
s = eval(input())
n = len(s)
def run_length(s):
if not s:
return []
c = s[0]
v = 1
n = len(s)
l = []
for i in range(1, n):
if c == s[i]... | false | 38.888889 | [
"-nx = []",
"-for i in range(n):",
"- if s[i] == \"R\":",
"- nx.append(i + 1)",
"- else:",
"- nx.append(i - 1)",
"-v = 1",
"-while v < 10 * n:",
"- nx = [nx[i] for i in nx]",
"- v *= 2",
"-ans = [0] * n",
"-for num in nx:",
"- ans[num] += 1",
"-write(\" \".join... | false | 0.043787 | 0.04358 | 1.004747 | [
"s871167136",
"s609586116"
] |
u074220993 | p03607 | python | s569978115 | s700944301 | 163 | 71 | 18,864 | 22,224 | Accepted | Accepted | 56.44 | N = int(eval(input()))
A = [int(eval(input())) for _ in range(N)]
paper = set()
for a in A:
if a in paper:
paper.remove(a)
else:
paper.add(a)
ans = len(paper)
print(ans) | from collections import Counter
with open(0) as f:
N, *A = list(map(int, f.read().split()))
ans = sum(1 for v in list(Counter(A).values()) if v&1)
print(ans) | 11 | 5 | 192 | 153 | N = int(eval(input()))
A = [int(eval(input())) for _ in range(N)]
paper = set()
for a in A:
if a in paper:
paper.remove(a)
else:
paper.add(a)
ans = len(paper)
print(ans)
| from collections import Counter
with open(0) as f:
N, *A = list(map(int, f.read().split()))
ans = sum(1 for v in list(Counter(A).values()) if v & 1)
print(ans)
| false | 54.545455 | [
"-N = int(eval(input()))",
"-A = [int(eval(input())) for _ in range(N)]",
"-paper = set()",
"-for a in A:",
"- if a in paper:",
"- paper.remove(a)",
"- else:",
"- paper.add(a)",
"-ans = len(paper)",
"+from collections import Counter",
"+",
"+with open(0) as f:",
"+ N, ... | false | 0.064411 | 0.0531 | 1.213018 | [
"s569978115",
"s700944301"
] |
u899645116 | p02856 | python | s576809960 | s043908896 | 689 | 625 | 3,064 | 3,060 | Accepted | Accepted | 9.29 | m = int(eval(input()))
csum = 0
dsum = 0
for i in range(m):
d,c = (int(x) for x in input().split())
csum += c
dsum += d*c
print((csum-1 + (dsum-1) // 9))
| m = int(eval(input()))
csum = 0
dsum = 0
for i in range(m):
c = [int(x) for x in input().split()]
csum += c[1]
dsum += c[0]*c[1]
print((csum-1 + (dsum-1) // 9))
| 8 | 8 | 159 | 166 | m = int(eval(input()))
csum = 0
dsum = 0
for i in range(m):
d, c = (int(x) for x in input().split())
csum += c
dsum += d * c
print((csum - 1 + (dsum - 1) // 9))
| m = int(eval(input()))
csum = 0
dsum = 0
for i in range(m):
c = [int(x) for x in input().split()]
csum += c[1]
dsum += c[0] * c[1]
print((csum - 1 + (dsum - 1) // 9))
| false | 0 | [
"- d, c = (int(x) for x in input().split())",
"- csum += c",
"- dsum += d * c",
"+ c = [int(x) for x in input().split()]",
"+ csum += c[1]",
"+ dsum += c[0] * c[1]"
] | false | 0.046976 | 0.047038 | 0.998696 | [
"s576809960",
"s043908896"
] |
u054514819 | p02713 | python | s428313239 | s430521194 | 1,581 | 730 | 365,876 | 9,180 | Accepted | Accepted | 53.83 | K = int(eval(input()))
from math import gcd
ans = 0
dic = {}
for i in range(1, K+1):
for j in range(i, K+1):
for k in range(j, K+1):
time = len(set([i, j, k]))
if time==3:
t=6
elif time==2:
t=3
else:
... | from math import gcd
def solve():
K = int(eval(input()))
ans = 0
for i in range(1, K+1):
for j in range(1, K+1):
a = gcd(i, j)
for k in range(1, K+1):
ans += gcd(a, k)
return ans
print((solve())) | 25 | 13 | 570 | 263 | K = int(eval(input()))
from math import gcd
ans = 0
dic = {}
for i in range(1, K + 1):
for j in range(i, K + 1):
for k in range(j, K + 1):
time = len(set([i, j, k]))
if time == 3:
t = 6
elif time == 2:
t = 3
else:
... | from math import gcd
def solve():
K = int(eval(input()))
ans = 0
for i in range(1, K + 1):
for j in range(1, K + 1):
a = gcd(i, j)
for k in range(1, K + 1):
ans += gcd(a, k)
return ans
print((solve()))
| false | 48 | [
"-K = int(eval(input()))",
"-ans = 0",
"-dic = {}",
"-for i in range(1, K + 1):",
"- for j in range(i, K + 1):",
"- for k in range(j, K + 1):",
"- time = len(set([i, j, k]))",
"- if time == 3:",
"- t = 6",
"- elif time == 2:",
"- ... | false | 0.041092 | 0.103393 | 0.397431 | [
"s428313239",
"s430521194"
] |
u941753895 | p03607 | python | s409938903 | s800185584 | 250 | 178 | 10,432 | 21,240 | Accepted | Accepted | 28.8 | import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time
sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7
def LI(): return list(map(int,input().split()))
def I(): return int(eval(input()))
def LS(): return input().split()
def S(): return eval(input())
def main():
n=I(... | import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,queue,copy
sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7
dd=[(-1,0),(0,1),(1,0),(0,-1)]
ddn=[(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]
def LI(): return [int(x) for x in sys.stdin.readline().split()]
de... | 31 | 47 | 542 | 934 | import math, string, itertools, fractions, heapq, collections, re, array, bisect, sys, random, time
sys.setrecursionlimit(10**7)
inf = 10**20
mod = 10**9 + 7
def LI():
return list(map(int, input().split()))
def I():
return int(eval(input()))
def LS():
return input().split()
def S():
return eval... | import math, string, itertools, fractions, heapq, collections, re, array, bisect, sys, random, time, queue, copy
sys.setrecursionlimit(10**7)
inf = 10**20
mod = 10**9 + 7
dd = [(-1, 0), (0, 1), (1, 0), (0, -1)]
ddn = [(-1, 0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1)]
def LI():
return [int(x) ... | false | 34.042553 | [
"-import math, string, itertools, fractions, heapq, collections, re, array, bisect, sys, random, time",
"+import math, string, itertools, fractions, heapq, collections, re, array, bisect, sys, random, time, queue, copy",
"+dd = [(-1, 0), (0, 1), (1, 0), (0, -1)]",
"+ddn = [(-1, 0), (-1, 1), (0, 1), (1, 1), (1... | false | 0.133924 | 0.071632 | 1.869609 | [
"s409938903",
"s800185584"
] |
u241159583 | p02885 | python | s863943766 | s299507833 | 25 | 17 | 2,940 | 2,940 | Accepted | Accepted | 32 | a,b = list(map(int, input().split()))
print((a-b*2 if a >= b*2 else 0)) | a,b = list(map(int, input().split()))
print((a-b*2 if a-b*2 >= 0 else 0)) | 2 | 2 | 64 | 66 | a, b = list(map(int, input().split()))
print((a - b * 2 if a >= b * 2 else 0))
| a, b = list(map(int, input().split()))
print((a - b * 2 if a - b * 2 >= 0 else 0))
| false | 0 | [
"-print((a - b * 2 if a >= b * 2 else 0))",
"+print((a - b * 2 if a - b * 2 >= 0 else 0))"
] | false | 0.034882 | 0.074323 | 0.469327 | [
"s863943766",
"s299507833"
] |
u073852194 | p02773 | python | s070815720 | s976496870 | 1,084 | 472 | 121,552 | 43,484 | Accepted | Accepted | 56.46 | from collections import Counter
N = int(eval(input()))
S = [eval(input()) for _ in range(N)]
C = Counter(S).most_common()
ans = []
m = C[0][1]
for i in range(len(C)):
if C[i][1]==m:
ans.append(C[i][0])
else:
break
ans.sort()
for a in ans:
print(a) | #!/usr/bin/env python3
#import sys; sys.stdin=open('input_file.txt')
#------------------------------------------
from collections import defaultdict
import sys
input = sys.stdin.readline
N = int(eval(input()))
D = defaultdict(int)
for i in range(N):
D[input().rstrip()] += 1
A = []
maxv = 0
for k,v in so... | 16 | 19 | 280 | 457 | from collections import Counter
N = int(eval(input()))
S = [eval(input()) for _ in range(N)]
C = Counter(S).most_common()
ans = []
m = C[0][1]
for i in range(len(C)):
if C[i][1] == m:
ans.append(C[i][0])
else:
break
ans.sort()
for a in ans:
print(a)
| #!/usr/bin/env python3
# import sys; sys.stdin=open('input_file.txt')
# ------------------------------------------
from collections import defaultdict
import sys
input = sys.stdin.readline
N = int(eval(input()))
D = defaultdict(int)
for i in range(N):
D[input().rstrip()] += 1
A = []
maxv = 0
for k, v in sorted(lis... | false | 15.789474 | [
"-from collections import Counter",
"+#!/usr/bin/env python3",
"+# import sys; sys.stdin=open('input_file.txt')",
"+from collections import defaultdict",
"+import sys",
"+input = sys.stdin.readline",
"-S = [eval(input()) for _ in range(N)]",
"-C = Counter(S).most_common()",
"-ans = []",
"-m = C[0]... | false | 0.067784 | 0.031642 | 2.142253 | [
"s070815720",
"s976496870"
] |
u094191970 | p03037 | python | s748459943 | s832188357 | 339 | 277 | 27,336 | 3,060 | Accepted | Accepted | 18.29 | n,m=list(map(int,input().split()))
ll=[list(map(int,input().split())) for i in range(m)]
a=0
b=n
for l,r in ll:
if a<l:
a=l
if r<b:
b=r
print((max(b-a+1,0))) | n,m=list(map(int,input().split()))
a=0
b=n
for i in range(m):
l,r=list(map(int,input().split()))
if a<l:
a=l
if r<b:
b=r
print((max(b-a+1,0))) | 11 | 11 | 166 | 146 | n, m = list(map(int, input().split()))
ll = [list(map(int, input().split())) for i in range(m)]
a = 0
b = n
for l, r in ll:
if a < l:
a = l
if r < b:
b = r
print((max(b - a + 1, 0)))
| n, m = list(map(int, input().split()))
a = 0
b = n
for i in range(m):
l, r = list(map(int, input().split()))
if a < l:
a = l
if r < b:
b = r
print((max(b - a + 1, 0)))
| false | 0 | [
"-ll = [list(map(int, input().split())) for i in range(m)]",
"-for l, r in ll:",
"+for i in range(m):",
"+ l, r = list(map(int, input().split()))"
] | false | 0.036608 | 0.036927 | 0.991377 | [
"s748459943",
"s832188357"
] |
u075012704 | p03722 | python | s556190354 | s850684991 | 1,626 | 1,352 | 3,316 | 3,416 | Accepted | Accepted | 16.85 | N, M = list(map(int, input().split()))
E = []
for i in range(M):
a, b, c = list(map(int, input().split()))
a, b = a - 1, b - 1
c = -c
E.append([a, b, c])
dist = [float('inf')] * (N+1)
dist[0] = 0
for n in range(N):
for a, b, c in E:
if (dist[a] != float('inf')) & (dist[b] > di... | N, M = list(map(int, input().split()))
Edges = []
for i in range(M):
a, b, c = list(map(int, input().split()))
a, b = a - 1, b - 1
c = -c
Edges.append([a, b, c])
dist = [float('inf')] * N
dist[0] = 0
for i in range(N):
for fr, to, cost in Edges:
if (dist[fr] != float('inf')) a... | 20 | 20 | 477 | 501 | N, M = list(map(int, input().split()))
E = []
for i in range(M):
a, b, c = list(map(int, input().split()))
a, b = a - 1, b - 1
c = -c
E.append([a, b, c])
dist = [float("inf")] * (N + 1)
dist[0] = 0
for n in range(N):
for a, b, c in E:
if (dist[a] != float("inf")) & (dist[b] > dist[a] + c):
... | N, M = list(map(int, input().split()))
Edges = []
for i in range(M):
a, b, c = list(map(int, input().split()))
a, b = a - 1, b - 1
c = -c
Edges.append([a, b, c])
dist = [float("inf")] * N
dist[0] = 0
for i in range(N):
for fr, to, cost in Edges:
if (dist[fr] != float("inf")) and (dist[to] > ... | false | 0 | [
"-E = []",
"+Edges = []",
"- E.append([a, b, c])",
"-dist = [float(\"inf\")] * (N + 1)",
"+ Edges.append([a, b, c])",
"+dist = [float(\"inf\")] * N",
"-for n in range(N):",
"- for a, b, c in E:",
"- if (dist[a] != float(\"inf\")) & (dist[b] > dist[a] + c):",
"- dist[b] =... | false | 0.06159 | 0.105343 | 0.584661 | [
"s556190354",
"s850684991"
] |
u219180252 | p03163 | python | s172713259 | s107502037 | 685 | 454 | 171,656 | 119,916 | Accepted | Accepted | 33.72 | N, W = list(map(int, input().split()))
w_v = [list(map(int, input().split())) for _ in range(N)]
# 1~i-1番目の品物から重さの総和がj以下になるように選んだときの価値
dp = [[0 for _ in range(W+1)] for _ in range(N+1)]
for i in range(N):
w, v = w_v[i]
for j in range(W+1):
if j - w >= 0:
dp[i+1][j] = max(dp[i][... | n, W = list(map(int, input().split()))
data = []
for _ in range(n):
w, v = list(map(int, input().split()))
data.append((w, v))
dp = [[0] * (W+1) for i in range(n+1)]
for i in range(1, n+1):
w, v = data[i-1]
for j in range(W+1):
if j - w >= 0:
dp[i][j] = ... | 19 | 17 | 409 | 432 | N, W = list(map(int, input().split()))
w_v = [list(map(int, input().split())) for _ in range(N)]
# 1~i-1番目の品物から重さの総和がj以下になるように選んだときの価値
dp = [[0 for _ in range(W + 1)] for _ in range(N + 1)]
for i in range(N):
w, v = w_v[i]
for j in range(W + 1):
if j - w >= 0:
dp[i + 1][j] = max(dp[i][j - w]... | n, W = list(map(int, input().split()))
data = []
for _ in range(n):
w, v = list(map(int, input().split()))
data.append((w, v))
dp = [[0] * (W + 1) for i in range(n + 1)]
for i in range(1, n + 1):
w, v = data[i - 1]
for j in range(W + 1):
if j - w >= 0:
dp[i][j] = max(dp[i - 1][j - w]... | false | 10.526316 | [
"-N, W = list(map(int, input().split()))",
"-w_v = [list(map(int, input().split())) for _ in range(N)]",
"-# 1~i-1番目の品物から重さの総和がj以下になるように選んだときの価値",
"-dp = [[0 for _ in range(W + 1)] for _ in range(N + 1)]",
"-for i in range(N):",
"- w, v = w_v[i]",
"+n, W = list(map(int, input().split()))",
"+data =... | false | 0.036574 | 0.036694 | 0.996715 | [
"s172713259",
"s107502037"
] |
u607074939 | p02755 | python | s663620293 | s161592916 | 21 | 17 | 3,316 | 2,940 | Accepted | Accepted | 19.05 | A, B = list(map(int, input().split()))
for i in range(1,1001):
a = int(i*0.08)
b = int(i*0.1)
if A==a and B==b:
print(i)
break
else:
print((-1)) | A, B = list(map(int, input().split()))
for i in range(1,1001):
if A== int(i*0.08) and B== int(i*0.1):
print(i)
break
else:
print((-1)) | 9 | 7 | 176 | 156 | A, B = list(map(int, input().split()))
for i in range(1, 1001):
a = int(i * 0.08)
b = int(i * 0.1)
if A == a and B == b:
print(i)
break
else:
print((-1))
| A, B = list(map(int, input().split()))
for i in range(1, 1001):
if A == int(i * 0.08) and B == int(i * 0.1):
print(i)
break
else:
print((-1))
| false | 22.222222 | [
"- a = int(i * 0.08)",
"- b = int(i * 0.1)",
"- if A == a and B == b:",
"+ if A == int(i * 0.08) and B == int(i * 0.1):"
] | false | 0.041106 | 0.041065 | 1.001008 | [
"s663620293",
"s161592916"
] |
u858748695 | p03556 | python | s407190708 | s029764439 | 20 | 18 | 2,940 | 2,940 | Accepted | Accepted | 10 | #!/usr/bin/env python3
import math
N = int(eval(input()))
print((int(math.sqrt(N)) ** 2))
| N = int(eval(input()))
print((int(N ** 0.5) ** 2)) | 5 | 2 | 87 | 43 | #!/usr/bin/env python3
import math
N = int(eval(input()))
print((int(math.sqrt(N)) ** 2))
| N = int(eval(input()))
print((int(N**0.5) ** 2))
| false | 60 | [
"-#!/usr/bin/env python3",
"-import math",
"-",
"-print((int(math.sqrt(N)) ** 2))",
"+print((int(N**0.5) ** 2))"
] | false | 0.033083 | 0.036041 | 0.917925 | [
"s407190708",
"s029764439"
] |
u983918956 | p03112 | python | s458538092 | s035664037 | 1,206 | 842 | 17,412 | 17,156 | Accepted | Accepted | 30.18 | from bisect import bisect_left
A,B,Q = list(map(int,input().split()))
inf = float('inf')
S = [-inf] + [int(eval(input())) for i in range(A)] + [inf]
T = [-inf] + [int(eval(input())) for i in range(B)] + [inf]
X = [int(eval(input())) for i in range(Q)]
for x in X:
si = bisect_left(S,x); ti = bisect_left(T,x)
... | import sys
input = sys.stdin.readline
from bisect import bisect
inf = float('inf')
A,B,Q = list(map(int,input().split()))
S = [-inf] + [int(eval(input())) for _ in range(A)] + [inf]
T = [-inf] + [int(eval(input())) for _ in range(B)] + [inf]
X = [int(eval(input())) for _ in range(Q)]
for x in X:
an... | 15 | 21 | 502 | 514 | from bisect import bisect_left
A, B, Q = list(map(int, input().split()))
inf = float("inf")
S = [-inf] + [int(eval(input())) for i in range(A)] + [inf]
T = [-inf] + [int(eval(input())) for i in range(B)] + [inf]
X = [int(eval(input())) for i in range(Q)]
for x in X:
si = bisect_left(S, x)
ti = bisect_left(T, x... | import sys
input = sys.stdin.readline
from bisect import bisect
inf = float("inf")
A, B, Q = list(map(int, input().split()))
S = [-inf] + [int(eval(input())) for _ in range(A)] + [inf]
T = [-inf] + [int(eval(input())) for _ in range(B)] + [inf]
X = [int(eval(input())) for _ in range(Q)]
for x in X:
ans = inf
... | false | 28.571429 | [
"-from bisect import bisect_left",
"+import sys",
"+input = sys.stdin.readline",
"+from bisect import bisect",
"+",
"+inf = float(\"inf\")",
"-inf = float(\"inf\")",
"-S = [-inf] + [int(eval(input())) for i in range(A)] + [inf]",
"-T = [-inf] + [int(eval(input())) for i in range(B)] + [inf]",
"-X ... | false | 0.03672 | 0.069395 | 0.529145 | [
"s458538092",
"s035664037"
] |
u078181689 | p02983 | python | s849852825 | s711564158 | 841 | 684 | 75,340 | 75,336 | Accepted | Accepted | 18.67 | L,R = list(map(int, input().split()))
n = 2019
if R-L >= n:
print((0))
else:
L %= n
R %= n
if L == 0 or R == 0:
print((0))
elif L >= R:
print((0))
else:
numbers = []
for i in range(R-L):
for j in range(R-L-i):
numbers.app... | L,R = list(map(int, input().split()))
n = 2019
if R-L >= n or L%n == 0 or R%n == 0 or L%n >= R%n:
print((0))
else:
L %= n
R %= n
numbers = []
for i in range(R-L):
for j in range(i+1,R-L+1):
numbers.append( ((L+i) * (L+j)) % n )
print((min(numbers))) | 18 | 12 | 376 | 294 | L, R = list(map(int, input().split()))
n = 2019
if R - L >= n:
print((0))
else:
L %= n
R %= n
if L == 0 or R == 0:
print((0))
elif L >= R:
print((0))
else:
numbers = []
for i in range(R - L):
for j in range(R - L - i):
numbers.append(((... | L, R = list(map(int, input().split()))
n = 2019
if R - L >= n or L % n == 0 or R % n == 0 or L % n >= R % n:
print((0))
else:
L %= n
R %= n
numbers = []
for i in range(R - L):
for j in range(i + 1, R - L + 1):
numbers.append(((L + i) * (L + j)) % n)
print((min(numbers)))
| false | 33.333333 | [
"-if R - L >= n:",
"+if R - L >= n or L % n == 0 or R % n == 0 or L % n >= R % n:",
"- if L == 0 or R == 0:",
"- print((0))",
"- elif L >= R:",
"- print((0))",
"- else:",
"- numbers = []",
"- for i in range(R - L):",
"- for j in range(R - L - i):",
... | false | 0.048647 | 0.047335 | 1.027713 | [
"s849852825",
"s711564158"
] |
u368249389 | p02718 | python | s223556887 | s372445341 | 188 | 166 | 38,384 | 38,256 | Accepted | Accepted | 11.7 | # Problem B
N, M = list(map(int, input().split()))
A_list = list(map(int, input().split()))
# initialization
a_sum = sum(A_list)
a_limit = a_sum / (4*M)
a_count = 0
is_ok = False
# search
for a in A_list:
if a>=a_limit:
a_count += 1
# output
if a_count>=M:
print("Yes")
else:
pr... | # Problem B - Popular Vote
# input
N, M = list(map(int, input().split()))
A_list = list(map(int, input().split()))
# initialization
A_list = sorted(A_list, reverse=True)
is_ok = True
test_limit = sum(A_list) / (4*M)
# check
test_list = A_list[:M]
for t in test_list:
if t<test_limit:
is_ok ... | 20 | 23 | 324 | 402 | # Problem B
N, M = list(map(int, input().split()))
A_list = list(map(int, input().split()))
# initialization
a_sum = sum(A_list)
a_limit = a_sum / (4 * M)
a_count = 0
is_ok = False
# search
for a in A_list:
if a >= a_limit:
a_count += 1
# output
if a_count >= M:
print("Yes")
else:
print("No")
| # Problem B - Popular Vote
# input
N, M = list(map(int, input().split()))
A_list = list(map(int, input().split()))
# initialization
A_list = sorted(A_list, reverse=True)
is_ok = True
test_limit = sum(A_list) / (4 * M)
# check
test_list = A_list[:M]
for t in test_list:
if t < test_limit:
is_ok = False
... | false | 13.043478 | [
"-# Problem B",
"+# Problem B - Popular Vote",
"+# input",
"-a_sum = sum(A_list)",
"-a_limit = a_sum / (4 * M)",
"-a_count = 0",
"-is_ok = False",
"-# search",
"-for a in A_list:",
"- if a >= a_limit:",
"- a_count += 1",
"+A_list = sorted(A_list, reverse=True)",
"+is_ok = True",
... | false | 0.032884 | 0.033589 | 0.978994 | [
"s223556887",
"s372445341"
] |
u417365712 | p02556 | python | s984167710 | s919905110 | 262 | 167 | 55,028 | 54,956 | Accepted | Accepted | 36.26 | n, *XY = list(map(int, open(0).read().split()))
X, Y = XY[::2], XY[1::2]
A = [x+y for x, y in zip(X, Y)]
B = [x-y for x, y in zip(X, Y)]
A.sort()
B.sort()
print((max(A[-1] - A[0], B[-1] - B[0]))) | n, *XY = list(map(int, open(0).read().split()))
X, Y = XY[::2], XY[1::2]
A = [x+y for x, y in zip(X, Y)]
B = [x-y for x, y in zip(X, Y)]
print((max(max(A) - min(A), max(B) - min(B)))) | 7 | 5 | 193 | 179 | n, *XY = list(map(int, open(0).read().split()))
X, Y = XY[::2], XY[1::2]
A = [x + y for x, y in zip(X, Y)]
B = [x - y for x, y in zip(X, Y)]
A.sort()
B.sort()
print((max(A[-1] - A[0], B[-1] - B[0])))
| n, *XY = list(map(int, open(0).read().split()))
X, Y = XY[::2], XY[1::2]
A = [x + y for x, y in zip(X, Y)]
B = [x - y for x, y in zip(X, Y)]
print((max(max(A) - min(A), max(B) - min(B))))
| false | 28.571429 | [
"-A.sort()",
"-B.sort()",
"-print((max(A[-1] - A[0], B[-1] - B[0])))",
"+print((max(max(A) - min(A), max(B) - min(B))))"
] | false | 0.034005 | 0.072462 | 0.469277 | [
"s984167710",
"s919905110"
] |
u987164499 | p03475 | python | s292778636 | s751064167 | 238 | 105 | 12,528 | 3,064 | Accepted | Accepted | 55.88 | from sys import stdin
from itertools import combinations
from math import factorial
import numpy as np
import math
import bisect
n = int(stdin.readline().rstrip())
c = [0]*n#次の駅までの時間
s = [0]*n#開通してからの時間
f = [0]*n#次の列車が来るまでの間隔
for i in range(1,n):
c[i],s[i],f[i] = [int(x) for x in stdin.readline().r... | from sys import stdin
n = int(stdin.readline().rstrip())
c = [0]*n#次の駅までの時間
s = [0]*n#開通してからの時間
f = [0]*n#次の列車が来るまでの間隔
for i in range(1,n):
c[i],s[i],f[i] = [int(x) for x in stdin.readline().rstrip().split()]
for j in range(n):
time = 0
for i in range(1+j,n):
if time < s[i]:
... | 27 | 20 | 595 | 443 | from sys import stdin
from itertools import combinations
from math import factorial
import numpy as np
import math
import bisect
n = int(stdin.readline().rstrip())
c = [0] * n # 次の駅までの時間
s = [0] * n # 開通してからの時間
f = [0] * n # 次の列車が来るまでの間隔
for i in range(1, n):
c[i], s[i], f[i] = [int(x) for x in stdin.readline()... | from sys import stdin
n = int(stdin.readline().rstrip())
c = [0] * n # 次の駅までの時間
s = [0] * n # 開通してからの時間
f = [0] * n # 次の列車が来るまでの間隔
for i in range(1, n):
c[i], s[i], f[i] = [int(x) for x in stdin.readline().rstrip().split()]
for j in range(n):
time = 0
for i in range(1 + j, n):
if time < s[i]:
... | false | 25.925926 | [
"-from itertools import combinations",
"-from math import factorial",
"-import numpy as np",
"-import math",
"-import bisect",
"- fi = [0] * n",
"- fi[i] = time",
"- print((fi[-1]))",
"+ print(time)"
] | false | 0.10083 | 0.082561 | 1.221272 | [
"s292778636",
"s751064167"
] |
u863442865 | p02959 | python | s726212850 | s721985337 | 291 | 116 | 73,444 | 19,008 | Accepted | Accepted | 60.14 | def main():
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
from collections import Counter, deque
#from collections import defaultdict
from itertools import combinations, permutations, accumulate, groupby
#from itertools import product
from bisect import bisec... | def main():
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
from collections import Counter, deque
#from collections import defaultdict
from itertools import combinations, permutations, accumulate, groupby
#from itertools import product
from bisect import bisec... | 30 | 39 | 800 | 962 | def main():
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
from collections import Counter, deque
# from collections import defaultdict
from itertools import combinations, permutations, accumulate, groupby
# from itertools import product
from bisect import bisect_l... | def main():
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
from collections import Counter, deque
# from collections import defaultdict
from itertools import combinations, permutations, accumulate, groupby
# from itertools import product
from bisect import bisect_l... | false | 23.076923 | [
"- res += min(a[i], b[i] + n)",
"- c = max(a[i] - n, 0)",
"- n = max(b[i] - c, 0)",
"+ if a[i] < b[i] + n:",
"+ res += a[i]",
"+ else:",
"+ res += b[i] + n",
"+ if a[i] - n > 0:",
"+ c = a[i] - n",
"+ else:",
"+ ... | false | 0.041368 | 0.118098 | 0.350287 | [
"s726212850",
"s721985337"
] |
u883040023 | p02683 | python | s233635600 | s756183418 | 314 | 80 | 85,584 | 9,256 | Accepted | Accepted | 74.52 | n,m,x = list(map(int,input().split()))
CA = [list(map(int,input().split())) for i in range(n)]
com = []
import itertools
for i in range(1,n+1):
c = list(itertools.combinations(CA,i))
for j in c:
com.append(j)
ans = 12*(10**5)+1
for i in com:
res = [0]*(m+1)
... | n,m,x = list(map(int,input().split()))
ans = 12*(10**5)+1
C = []
A = []
for _ in range(n):
AC = list(map(int,input().split()))
C.append(AC[0])
A.append(AC[1:])
for i in range(2**n):
understood = [0]*m
cost = 0
for j in range(n):
if (i>>j)&1:
cost += C[j... | 33 | 34 | 661 | 633 | n, m, x = list(map(int, input().split()))
CA = [list(map(int, input().split())) for i in range(n)]
com = []
import itertools
for i in range(1, n + 1):
c = list(itertools.combinations(CA, i))
for j in c:
com.append(j)
ans = 12 * (10**5) + 1
for i in com:
res = [0] * (m + 1)
for j in range(len(i)... | n, m, x = list(map(int, input().split()))
ans = 12 * (10**5) + 1
C = []
A = []
for _ in range(n):
AC = list(map(int, input().split()))
C.append(AC[0])
A.append(AC[1:])
for i in range(2**n):
understood = [0] * m
cost = 0
for j in range(n):
if (i >> j) & 1:
cost += C[j]
... | false | 2.941176 | [
"-CA = [list(map(int, input().split())) for i in range(n)]",
"-com = []",
"-import itertools",
"-",
"-for i in range(1, n + 1):",
"- c = list(itertools.combinations(CA, i))",
"- for j in c:",
"- com.append(j)",
"-for i in com:",
"- res = [0] * (m + 1)",
"- for j in range(len(i... | false | 0.048166 | 0.03888 | 1.238843 | [
"s233635600",
"s756183418"
] |
u882323840 | p02732 | python | s755347659 | s269047753 | 678 | 231 | 117,156 | 110,200 | Accepted | Accepted | 65.93 | from collections import Counter
import math
def combinations_count(n, r):
return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))
N = int(eval(input()))
A_lst = list(map(int,input().split()))
S = Counter(A_lst)
sums = 0
for i in list(S.keys()):
if S[i] > 1:
sums += combinat... | from collections import Counter
import math
def combinations_count(n, r):
return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))
N = int(eval(input()))
A_lst = list(map(int,input().split()))
S = Counter(A_lst)
sums = 0
#for i in S.keys():
# if S[i] > 1:
# sums += combination... | 21 | 24 | 588 | 641 | from collections import Counter
import math
def combinations_count(n, r):
return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))
N = int(eval(input()))
A_lst = list(map(int, input().split()))
S = Counter(A_lst)
sums = 0
for i in list(S.keys()):
if S[i] > 1:
sums += combinations_coun... | from collections import Counter
import math
def combinations_count(n, r):
return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))
N = int(eval(input()))
A_lst = list(map(int, input().split()))
S = Counter(A_lst)
sums = 0
# for i in S.keys():
# if S[i] > 1:
# sums += combinations_count(... | false | 12.5 | [
"-for i in list(S.keys()):",
"- if S[i] > 1:",
"- sums += combinations_count(S[i], 2)",
"+# for i in S.keys():",
"+# if S[i] > 1:",
"+# sums += combinations_count(S[i], 2)",
"+for c, i in list(S.items()):",
"+ sums += i * (i - 1) // 2"
] | false | 0.11038 | 0.047001 | 2.348443 | [
"s755347659",
"s269047753"
] |
u360258922 | p03448 | python | s636179092 | s042793243 | 57 | 49 | 3,064 | 3,064 | Accepted | Accepted | 14.04 | a = int(eval(input()))
b = int(eval(input()))
c = int(eval(input()))
x = int(eval(input()))
bb = b
cc = c
cnt = 0
while a > -1:
b = bb
while b > -1:
c = cc
while c > -1:
if (500 * a + 100 * b + 50 * c) == x:
cnt += 1
c -= 1
b ... | a = int(eval(input()))
b = int(eval(input()))
c = int(eval(input()))
x = int(eval(input()))
cnt = 0
for i in range(a+1):
for j in range(b+1):
for k in range(c+1):
if (500 * i + 100 * j + 50 * k) == x:
cnt += 1
print(cnt) | 22 | 13 | 326 | 251 | a = int(eval(input()))
b = int(eval(input()))
c = int(eval(input()))
x = int(eval(input()))
bb = b
cc = c
cnt = 0
while a > -1:
b = bb
while b > -1:
c = cc
while c > -1:
if (500 * a + 100 * b + 50 * c) == x:
cnt += 1
c -= 1
b -= 1
a -= 1
print(... | a = int(eval(input()))
b = int(eval(input()))
c = int(eval(input()))
x = int(eval(input()))
cnt = 0
for i in range(a + 1):
for j in range(b + 1):
for k in range(c + 1):
if (500 * i + 100 * j + 50 * k) == x:
cnt += 1
print(cnt)
| false | 40.909091 | [
"-bb = b",
"-cc = c",
"-while a > -1:",
"- b = bb",
"- while b > -1:",
"- c = cc",
"- while c > -1:",
"- if (500 * a + 100 * b + 50 * c) == x:",
"+for i in range(a + 1):",
"+ for j in range(b + 1):",
"+ for k in range(c + 1):",
"+ if (500 * i... | false | 0.091829 | 0.091604 | 1.002462 | [
"s636179092",
"s042793243"
] |
u794448346 | p02910 | python | s947174381 | s177072129 | 30 | 27 | 9,108 | 9,048 | Accepted | Accepted | 10 | S = eval(input())
ans = "Yes"
for i in range(len(S)):
if i%2 == 0 and S[i] == "L":
ans = "No"
elif i%2 == 1 and S[i] == "R":
ans = "No"
print(ans) | S = eval(input())
ans = "Yes"
for i in range(len(S)):
if i%2 == 0 and S[i] == "L":
ans = "No"
break
elif i%2 == 1 and S[i] == "R":
ans = "No"
break
print(ans) | 8 | 10 | 171 | 201 | S = eval(input())
ans = "Yes"
for i in range(len(S)):
if i % 2 == 0 and S[i] == "L":
ans = "No"
elif i % 2 == 1 and S[i] == "R":
ans = "No"
print(ans)
| S = eval(input())
ans = "Yes"
for i in range(len(S)):
if i % 2 == 0 and S[i] == "L":
ans = "No"
break
elif i % 2 == 1 and S[i] == "R":
ans = "No"
break
print(ans)
| false | 20 | [
"+ break",
"+ break"
] | false | 0.037623 | 0.037646 | 0.999381 | [
"s947174381",
"s177072129"
] |
u419686324 | p03102 | python | s107084156 | s436010870 | 312 | 147 | 21,644 | 12,452 | Accepted | Accepted | 52.88 | #!/usr/bin/env python3
# -*- coding: utf-8 -*-
from itertools import chain
from functools import reduce
from collections import OrderedDict, Counter, deque
import operator
import numpy as np
N, M, C = list(map(int, input().split()))
B = np.array(list(map(int, input().split())))
ans = 0
for _ in range(N)... | #!/usr/bin/env python3
# -*- coding: utf-8 -*-
import numpy as np
N, M, C = list(map(int, input().split()))
B = np.array([int(x) for x in input().split()])
A = np.array([
[int(x) for x in input().split()]
for _ in range(N)])
print((((A.dot(B) + C) > 0).sum())) | 18 | 12 | 424 | 282 | #!/usr/bin/env python3
# -*- coding: utf-8 -*-
from itertools import chain
from functools import reduce
from collections import OrderedDict, Counter, deque
import operator
import numpy as np
N, M, C = list(map(int, input().split()))
B = np.array(list(map(int, input().split())))
ans = 0
for _ in range(N):
A = np.ar... | #!/usr/bin/env python3
# -*- coding: utf-8 -*-
import numpy as np
N, M, C = list(map(int, input().split()))
B = np.array([int(x) for x in input().split()])
A = np.array([[int(x) for x in input().split()] for _ in range(N)])
print((((A.dot(B) + C) > 0).sum()))
| false | 33.333333 | [
"-from itertools import chain",
"-from functools import reduce",
"-from collections import OrderedDict, Counter, deque",
"-import operator",
"-B = np.array(list(map(int, input().split())))",
"-ans = 0",
"-for _ in range(N):",
"- A = np.array(list(map(int, input().split())))",
"- if sum(A * B) ... | false | 0.45134 | 0.179034 | 2.520979 | [
"s107084156",
"s436010870"
] |
u285891772 | p03031 | python | s885818949 | s929114306 | 52 | 46 | 5,204 | 5,400 | Accepted | Accepted | 11.54 | import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, tan, asin, acos, atan, radians, degrees, log2
from itertools import accumulate, permutations, combinations, combinations_with_replacement, product, groupby
from operator import itemgetter,... | import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, tan, asin, acos, atan, radians, degrees, log2
from itertools import accumulate, permutations, combinations, combinations_with_replacement, product, groupby
from operator import itemgetter,... | 39 | 37 | 1,166 | 1,111 | import sys, re
from collections import deque, defaultdict, Counter
from math import (
ceil,
sqrt,
hypot,
factorial,
pi,
sin,
cos,
tan,
asin,
acos,
atan,
radians,
degrees,
log2,
)
from itertools import (
accumulate,
permutations,
combinations,
combi... | import sys, re
from collections import deque, defaultdict, Counter
from math import (
ceil,
sqrt,
hypot,
factorial,
pi,
sin,
cos,
tan,
asin,
acos,
atan,
radians,
degrees,
log2,
)
from itertools import (
accumulate,
permutations,
combinations,
combi... | false | 5.128205 | [
"-ks = [LIST() for _ in range(M)]",
"+s = [LIST()[1:] for _ in range(M)]",
"- # print(x)",
"- for j in range(ks[i][0]):",
"- # print(i, ks[i][j+1])",
"- if x[ks[i][j + 1] - 1] == 1:",
"+ for n in s[i]:",
"+ if x[n - 1] == 1:"
] | false | 0.042804 | 0.042217 | 1.013893 | [
"s885818949",
"s929114306"
] |
u525065967 | p02586 | python | s134784259 | s517079084 | 1,512 | 1,395 | 433,808 | 433,460 | Accepted | Accepted | 7.74 | R, C, K = list(map(int, input().split()))
V = [[0]*(C+1) for _ in range(R+1)]
for _ in range(K):
r, c, v = list(map(int, input().split()))
V[r][c] = v
dp0 = [[0]*(C+1) for _ in range(R+1)]
dp1 = [[0]*(C+1) for _ in range(R+1)]
dp2 = [[0]*(C+1) for _ in range(R+1)]
dp3 = [[0]*(C+1) for _ in range(R+1... | R, C, K = list(map(int, input().split()))
V = [[0]*(C+1) for _ in range(R+1)]
for _ in range(K):
r, c, v = list(map(int, input().split()))
V[r][c] = v
dp0 = [[0]*(C+1) for _ in range(R+1)]
dp1 = [[0]*(C+1) for _ in range(R+1)]
dp2 = [[0]*(C+1) for _ in range(R+1)]
dp3 = [[0]*(C+1) for _ in range(R+1... | 33 | 30 | 933 | 926 | R, C, K = list(map(int, input().split()))
V = [[0] * (C + 1) for _ in range(R + 1)]
for _ in range(K):
r, c, v = list(map(int, input().split()))
V[r][c] = v
dp0 = [[0] * (C + 1) for _ in range(R + 1)]
dp1 = [[0] * (C + 1) for _ in range(R + 1)]
dp2 = [[0] * (C + 1) for _ in range(R + 1)]
dp3 = [[0] * (C + 1) fo... | R, C, K = list(map(int, input().split()))
V = [[0] * (C + 1) for _ in range(R + 1)]
for _ in range(K):
r, c, v = list(map(int, input().split()))
V[r][c] = v
dp0 = [[0] * (C + 1) for _ in range(R + 1)]
dp1 = [[0] * (C + 1) for _ in range(R + 1)]
dp2 = [[0] * (C + 1) for _ in range(R + 1)]
dp3 = [[0] * (C + 1) fo... | false | 9.090909 | [
"- max_p = 0",
"- if i > 0:",
"- max_p = max(dp0[i - 1][j], dp1[i - 1][j], dp2[i - 1][j], dp3[i - 1][j])",
"- dp0[i][j] = max(dp0[i][j], max_p, la)",
"- dp1[i][j] = max(dp0[i][j], max_p + v, lb, la + v)",
"- dp2[i][j] = max(dp2[i][j], lc, lb + v)",
"- ... | false | 0.042343 | 0.036583 | 1.157476 | [
"s134784259",
"s517079084"
] |
u156815136 | p03387 | python | s339328927 | s001924633 | 48 | 37 | 5,532 | 5,148 | Accepted | Accepted | 22.92 | from statistics import median
#import collections
#aa = collections.Counter(a) # list to list || .most_common(2)で最大の2個とりだせるお a[0][0]
from fractions import gcd
from itertools import combinations # (string,3) 3回
from collections import deque
from collections import defaultdict
import bisect
#
# d = m - k[i] -... | from statistics import median
#import collections
#aa = collections.Counter(a) # list to list || .most_common(2)で最大の2個とりだせるお a[0][0]
from fractions import gcd
from itertools import combinations # (string,3) 3回
from collections import deque
from collections import defaultdict
import bisect
#
# d = m - k[i] -... | 34 | 30 | 736 | 682 | from statistics import median
# import collections
# aa = collections.Counter(a) # list to list || .most_common(2)で最大の2個とりだせるお a[0][0]
from fractions import gcd
from itertools import combinations # (string,3) 3回
from collections import deque
from collections import defaultdict
import bisect
#
# d = m - k[i] - k[j... | from statistics import median
# import collections
# aa = collections.Counter(a) # list to list || .most_common(2)で最大の2個とりだせるお a[0][0]
from fractions import gcd
from itertools import combinations # (string,3) 3回
from collections import deque
from collections import defaultdict
import bisect
#
# d = m - k[i] - k[j... | false | 11.764706 | [
"- d = max(a, b, c) * 3 - a - b - c",
"- if d % 2 == 0:",
"- print((d // 2))",
"- else:",
"- print((d // 2 + 2))",
"+ d = max(a, b, c) * 3 - (a + b + c)",
"+ print((d % 2 + (d + 1) // 2))"
] | false | 0.047826 | 0.047098 | 1.015455 | [
"s339328927",
"s001924633"
] |
u844895214 | p02954 | python | s565914493 | s148936878 | 96 | 87 | 13,592 | 14,756 | Accepted | Accepted | 9.38 | import sys
def S(): return sys.stdin.readline().rstrip()
def Main():
s = S()
n = len(s)
times = 10**100
ans = [0]*n
i = 0
while i<n:
if s[i]=='L':
i += 1
continue
save = [i]
while s[i+1]!='L':
i += 1
save.ap... | import sys
def S(): return sys.stdin.readline().rstrip()
def Main():
s = S()
n = len(s)
times = 10**100
ans = [0]*n
i = 0
while i<n:
if s[i]=='L':
i += 1
continue
save = [i]
while s[i+1]!='L':
i += 1
save.ap... | 44 | 42 | 939 | 859 | import sys
def S():
return sys.stdin.readline().rstrip()
def Main():
s = S()
n = len(s)
times = 10**100
ans = [0] * n
i = 0
while i < n:
if s[i] == "L":
i += 1
continue
save = [i]
while s[i + 1] != "L":
i += 1
save.a... | import sys
def S():
return sys.stdin.readline().rstrip()
def Main():
s = S()
n = len(s)
times = 10**100
ans = [0] * n
i = 0
while i < n:
if s[i] == "L":
i += 1
continue
save = [i]
while s[i + 1] != "L":
i += 1
save.a... | false | 4.545455 | [
"- for j in range(len(save)):",
"- tmp = save.pop()",
"- ans[flg + abs(flg - tmp) % 2] += 1",
"+ for rep in save:",
"+ ans[flg + abs(flg - rep) % 2] += 1",
"- for j in range(len(save)):",
"- tmp = save.pop()",
"- ans[flg - abs... | false | 0.046303 | 0.130805 | 0.353987 | [
"s565914493",
"s148936878"
] |
u796563423 | p03493 | python | s198567279 | s980393601 | 29 | 26 | 9,104 | 8,980 | Accepted | Accepted | 10.34 | a=int(eval(input()))
sum=0
if a//100==1:
sum+=1
if a//10==1 or a//10==11:
sum+=1
if a%2==1:
sum+=1
print(sum) | a=str(eval(input()))
sum=0
if a[0]=="1":
sum+=1
if a[1]=="1":
sum+=1
if a[2]=="1":
sum+=1
print(sum) | 9 | 9 | 122 | 111 | a = int(eval(input()))
sum = 0
if a // 100 == 1:
sum += 1
if a // 10 == 1 or a // 10 == 11:
sum += 1
if a % 2 == 1:
sum += 1
print(sum)
| a = str(eval(input()))
sum = 0
if a[0] == "1":
sum += 1
if a[1] == "1":
sum += 1
if a[2] == "1":
sum += 1
print(sum)
| false | 0 | [
"-a = int(eval(input()))",
"+a = str(eval(input()))",
"-if a // 100 == 1:",
"+if a[0] == \"1\":",
"-if a // 10 == 1 or a // 10 == 11:",
"+if a[1] == \"1\":",
"-if a % 2 == 1:",
"+if a[2] == \"1\":"
] | false | 0.08347 | 0.120765 | 0.691178 | [
"s198567279",
"s980393601"
] |
u723792785 | p02947 | python | s928310120 | s450830638 | 375 | 250 | 19,400 | 29,228 | Accepted | Accepted | 33.33 | n=int(eval(input()))
s=["".join(sorted(eval(input()))) for _ in range(n)]
d={}
ans = 0
for i in s:
k = d.get(i, 0)
ans += k
if k == 0:
d[i] = 1
else:
d[i] += 1
print(ans) | from collections import Counter
n = int(eval(input()))
s = ["".join(sorted(eval(input()))) for _ in range(n)]
k = Counter(s)
ans = 0
for i, j in k.most_common():
ans += j*(j-1)//2
print(ans) | 12 | 8 | 177 | 186 | n = int(eval(input()))
s = ["".join(sorted(eval(input()))) for _ in range(n)]
d = {}
ans = 0
for i in s:
k = d.get(i, 0)
ans += k
if k == 0:
d[i] = 1
else:
d[i] += 1
print(ans)
| from collections import Counter
n = int(eval(input()))
s = ["".join(sorted(eval(input()))) for _ in range(n)]
k = Counter(s)
ans = 0
for i, j in k.most_common():
ans += j * (j - 1) // 2
print(ans)
| false | 33.333333 | [
"+from collections import Counter",
"+",
"-d = {}",
"+k = Counter(s)",
"-for i in s:",
"- k = d.get(i, 0)",
"- ans += k",
"- if k == 0:",
"- d[i] = 1",
"- else:",
"- d[i] += 1",
"+for i, j in k.most_common():",
"+ ans += j * (j - 1) // 2"
] | false | 0.035754 | 0.046707 | 0.765486 | [
"s928310120",
"s450830638"
] |
u588785393 | p03165 | python | s192228191 | s690417905 | 567 | 387 | 231,984 | 153,384 | Accepted | Accepted | 31.75 | def LCS_iter(s1, s2):
dp = [[-10000 for i in range(len(s2) + 1)] for i in range(len(s1) + 1)]
ans = [['' for i in range(len(s2) + 1)] for i in range(len(s1) + 1)]
for i in range(len(s2) + 1):
dp[0][i] = 0
for i in range(len(s1) + 1):
dp[i][0] = 0
i = 1
j = 1
while i <= len(s1):
while j <= len(s2)... | s = eval(input())
t = eval(input())
mx = 0
mxp = [-1, -1]
dp = [[0 for i in range(len(t) + 1)] for j in range(len(s) + 1)]
for i in range(len(s)):
for j in range(len(t)):
if s[i] == t[j]:
dp[i + 1][j + 1] = 1 + dp[i][j]
else:
dp[i + 1][j + 1] = max(dp[i + 1][j], dp[i][j + 1])
if dp[i + 1][j + 1]... | 43 | 31 | 880 | 619 | def LCS_iter(s1, s2):
dp = [[-10000 for i in range(len(s2) + 1)] for i in range(len(s1) + 1)]
ans = [["" for i in range(len(s2) + 1)] for i in range(len(s1) + 1)]
for i in range(len(s2) + 1):
dp[0][i] = 0
for i in range(len(s1) + 1):
dp[i][0] = 0
i = 1
j = 1
while i <= len(s1... | s = eval(input())
t = eval(input())
mx = 0
mxp = [-1, -1]
dp = [[0 for i in range(len(t) + 1)] for j in range(len(s) + 1)]
for i in range(len(s)):
for j in range(len(t)):
if s[i] == t[j]:
dp[i + 1][j + 1] = 1 + dp[i][j]
else:
dp[i + 1][j + 1] = max(dp[i + 1][j], dp[i][j + 1])... | false | 27.906977 | [
"-def LCS_iter(s1, s2):",
"- dp = [[-10000 for i in range(len(s2) + 1)] for i in range(len(s1) + 1)]",
"- ans = [[\"\" for i in range(len(s2) + 1)] for i in range(len(s1) + 1)]",
"- for i in range(len(s2) + 1):",
"- dp[0][i] = 0",
"- for i in range(len(s1) + 1):",
"- dp[i][0] =... | false | 0.110005 | 0.07837 | 1.403662 | [
"s192228191",
"s690417905"
] |
u602702913 | p02392 | python | s086825245 | s105145635 | 30 | 20 | 7,768 | 5,588 | Accepted | Accepted | 33.33 | a,b,c=(int(i) for i in input().split())
if a<b<c:
print("Yes")
else:
print("No") | a,b,c=list(map(int,input().split()))
if a<b<c:
print("Yes")
else:
print("No")
| 6 | 8 | 90 | 86 | a, b, c = (int(i) for i in input().split())
if a < b < c:
print("Yes")
else:
print("No")
| a, b, c = list(map(int, input().split()))
if a < b < c:
print("Yes")
else:
print("No")
| false | 25 | [
"-a, b, c = (int(i) for i in input().split())",
"+a, b, c = list(map(int, input().split()))"
] | false | 0.067373 | 0.085903 | 0.784284 | [
"s086825245",
"s105145635"
] |
u252964975 | p02608 | python | s956992051 | s861927321 | 422 | 367 | 27,476 | 27,128 | Accepted | Accepted | 13.03 | import math
import numpy as np
def f(x,y,z):
return x**2+y**2+z**2+x*y+y*z+z*x
N = int(eval(input()))
f_list = np.zeros((N,1), dtype=int)
for x in range(1,math.floor((N//6)**0.5)+10):
for z in range(1,math.floor(N**0.5)+10):
# for x in range(1,math.floor((N//6)**0.5)+1):
# for z in range(1,math.flo... | import math
import numpy as np
def f(x,y,z):
return x**2+y**2+z**2+x*y+y*z+z*x
N = int(eval(input()))
f_list = np.zeros((N,1), dtype=int)
for x in range(1,math.floor((N//6)**0.5)+1):
for z in range(1,math.floor(N**0.5)+1):
for y in range(x,z+1):
if f(x,y,z)<=N:
if((x-y)*(y-z)*(z... | 25 | 23 | 704 | 613 | import math
import numpy as np
def f(x, y, z):
return x**2 + y**2 + z**2 + x * y + y * z + z * x
N = int(eval(input()))
f_list = np.zeros((N, 1), dtype=int)
for x in range(1, math.floor((N // 6) ** 0.5) + 10):
for z in range(1, math.floor(N**0.5) + 10):
# for x in range(1,math.floor((N//6)**0.5)+1):... | import math
import numpy as np
def f(x, y, z):
return x**2 + y**2 + z**2 + x * y + y * z + z * x
N = int(eval(input()))
f_list = np.zeros((N, 1), dtype=int)
for x in range(1, math.floor((N // 6) ** 0.5) + 1):
for z in range(1, math.floor(N**0.5) + 1):
for y in range(x, z + 1):
if f(x, y,... | false | 8 | [
"-for x in range(1, math.floor((N // 6) ** 0.5) + 10):",
"- for z in range(1, math.floor(N**0.5) + 10):",
"- # for x in range(1,math.floor((N//6)**0.5)+1):",
"- # for z in range(1,math.floor(N**0.5)+1):",
"+for x in range(1, math.floor((N // 6) ** 0.5) + 1):",
"+ for z in range(1, ma... | false | 0.225069 | 0.292658 | 0.769051 | [
"s956992051",
"s861927321"
] |
u609061751 | p02675 | python | s608172628 | s775947912 | 110 | 64 | 27,144 | 61,628 | Accepted | Accepted | 41.82 | import numpy as np
n = np.array(list(input().rstrip()))
ans = "bon" if n[-1] == "3" else "pon" if n[-1] in ["0", "1", "6", "8"] else "hon"
print(ans) | import sys
input = sys.stdin.readline
n = input().rstrip()
if n[-1] == "3":
print("bon")
elif n[-1] in ["0", "1", "6", "8"]:
print("pon")
else:
print("hon") | 5 | 11 | 154 | 180 | import numpy as np
n = np.array(list(input().rstrip()))
ans = "bon" if n[-1] == "3" else "pon" if n[-1] in ["0", "1", "6", "8"] else "hon"
print(ans)
| import sys
input = sys.stdin.readline
n = input().rstrip()
if n[-1] == "3":
print("bon")
elif n[-1] in ["0", "1", "6", "8"]:
print("pon")
else:
print("hon")
| false | 54.545455 | [
"-import numpy as np",
"+import sys",
"-n = np.array(list(input().rstrip()))",
"-ans = \"bon\" if n[-1] == \"3\" else \"pon\" if n[-1] in [\"0\", \"1\", \"6\", \"8\"] else \"hon\"",
"-print(ans)",
"+input = sys.stdin.readline",
"+n = input().rstrip()",
"+if n[-1] == \"3\":",
"+ print(\"bon\")",
... | false | 0.188053 | 0.03776 | 4.98029 | [
"s608172628",
"s775947912"
] |
u576917603 | p03013 | python | s550704649 | s934893452 | 452 | 187 | 460,020 | 13,984 | Accepted | Accepted | 58.63 | n,m=list(map(int,input().split()))
a=[]
for i in range(m):
a.append(int(eval(input())))
dp=[0]*n
if 1 not in a:
dp[0]=1
else:
dp[0]=0
a=set(a)
for i in range(1,n):
if i+1 in a:
continue
if i==1:
dp[i]=dp[i-1]+1
continue
dp[i]=dp[i-1]+dp[i-2]
print((dp[-1]... | n,m=list(map(int,input().split()))
a=[int(eval(input())) for i in range(m)]
mod=10**9+7
dp=[0]*(n+1)
dp[0]=1
a=set(a)
for i in range(1,n+1):
if i in a:
dp[i]=0
elif i==1:
dp[i]=1
else:
dp[i]=(dp[i-1]+dp[i-2])%mod
print((dp[-1]))
| 18 | 15 | 320 | 266 | n, m = list(map(int, input().split()))
a = []
for i in range(m):
a.append(int(eval(input())))
dp = [0] * n
if 1 not in a:
dp[0] = 1
else:
dp[0] = 0
a = set(a)
for i in range(1, n):
if i + 1 in a:
continue
if i == 1:
dp[i] = dp[i - 1] + 1
continue
dp[i] = dp[i - 1] + dp[i ... | n, m = list(map(int, input().split()))
a = [int(eval(input())) for i in range(m)]
mod = 10**9 + 7
dp = [0] * (n + 1)
dp[0] = 1
a = set(a)
for i in range(1, n + 1):
if i in a:
dp[i] = 0
elif i == 1:
dp[i] = 1
else:
dp[i] = (dp[i - 1] + dp[i - 2]) % mod
print((dp[-1]))
| false | 16.666667 | [
"-a = []",
"-for i in range(m):",
"- a.append(int(eval(input())))",
"-dp = [0] * n",
"-if 1 not in a:",
"- dp[0] = 1",
"-else:",
"- dp[0] = 0",
"+a = [int(eval(input())) for i in range(m)]",
"+mod = 10**9 + 7",
"+dp = [0] * (n + 1)",
"+dp[0] = 1",
"-for i in range(1, n):",
"- i... | false | 0.037594 | 0.038269 | 0.982365 | [
"s550704649",
"s934893452"
] |
u067983636 | p03128 | python | s246455290 | s860106078 | 26 | 22 | 3,192 | 3,192 | Accepted | Accepted | 15.38 | N, M = list(map(int, input().split()))
A = list(map(int, input().split()))
cost = [-1, 2, 5, 5, 4, 5, 6, 3, 7, 6]
can_cost = sorted([cost[a] for a in A])
D = {}
for a in A:
c = cost[a]
D[c] = max(a, D.setdefault(c, -1))
min_cost = can_cost[0]
min_cost_num = D[min_cost]
def f2(v, l, num):
L ... | N, M = list(map(int, input().split()))
A = list(map(int, input().split()))
cost = [-1, 2, 5, 5, 4, 5, 6, 3, 7, 6]
can_cost = sorted([cost[a] for a in A])
D = {}
for a in A:
c = cost[a]
D[c] = max(a, D.setdefault(c, -1))
min_cost = can_cost[0]
min_cost_num = D[min_cost]
def f2(v, l, num):
L ... | 52 | 54 | 1,248 | 1,263 | N, M = list(map(int, input().split()))
A = list(map(int, input().split()))
cost = [-1, 2, 5, 5, 4, 5, 6, 3, 7, 6]
can_cost = sorted([cost[a] for a in A])
D = {}
for a in A:
c = cost[a]
D[c] = max(a, D.setdefault(c, -1))
min_cost = can_cost[0]
min_cost_num = D[min_cost]
def f2(v, l, num):
L = list(str(v))
... | N, M = list(map(int, input().split()))
A = list(map(int, input().split()))
cost = [-1, 2, 5, 5, 4, 5, 6, 3, 7, 6]
can_cost = sorted([cost[a] for a in A])
D = {}
for a in A:
c = cost[a]
D[c] = max(a, D.setdefault(c, -1))
min_cost = can_cost[0]
min_cost_num = D[min_cost]
def f2(v, l, num):
L = list(str(v))
... | false | 3.703704 | [
"-if g(K, r) == -1:",
"- res = g(K - 1, r + min_cost)",
"+while res == -1:",
"+ K -= 1",
"+ r += min_cost",
"+ res = g(K, r)"
] | false | 0.039656 | 0.116305 | 0.340963 | [
"s246455290",
"s860106078"
] |
u256363575 | p03308 | python | s125275759 | s257268273 | 19 | 17 | 2,940 | 2,940 | Accepted | Accepted | 10.53 | N = int(eval(input()))
ans = 0
A=list(map(int,input().split()))
for i in range(N):
for j in range(i,N,):
ans = max(ans, abs(A[i]-A[j]))
print(ans) | N = int(eval(input()))
ans = 0
A=list(map(int,input().split()))
A.sort()
print((A[-1]-A[0])) | 7 | 5 | 158 | 88 | N = int(eval(input()))
ans = 0
A = list(map(int, input().split()))
for i in range(N):
for j in range(
i,
N,
):
ans = max(ans, abs(A[i] - A[j]))
print(ans)
| N = int(eval(input()))
ans = 0
A = list(map(int, input().split()))
A.sort()
print((A[-1] - A[0]))
| false | 28.571429 | [
"-for i in range(N):",
"- for j in range(",
"- i,",
"- N,",
"- ):",
"- ans = max(ans, abs(A[i] - A[j]))",
"-print(ans)",
"+A.sort()",
"+print((A[-1] - A[0]))"
] | false | 0.091037 | 0.07797 | 1.167597 | [
"s125275759",
"s257268273"
] |
u360116509 | p02996 | python | s518844655 | s573474966 | 837 | 702 | 36,596 | 33,396 | Accepted | Accepted | 16.13 | def main():
N = int(eval(input()))
A = []
B = []
AB = []
for _ in range(N):
a, b = list(map(int, input().split()))
A.append(a)
B.append(b)
AB.append((a, b))
if sum(A) > max(B):
print('No')
return
AB = sorted(AB, key=lambda x: x[1])... | def main():
N = int(eval(input()))
AB = []
for _ in range(N):
a, b = list(map(int, input().split()))
AB.append((a, b))
AB = sorted(AB, key=lambda x: x[1])
c = 0
for a, b in AB:
c += a
if c > b:
print('No')
return
print('Yes... | 24 | 17 | 451 | 323 | def main():
N = int(eval(input()))
A = []
B = []
AB = []
for _ in range(N):
a, b = list(map(int, input().split()))
A.append(a)
B.append(b)
AB.append((a, b))
if sum(A) > max(B):
print("No")
return
AB = sorted(AB, key=lambda x: x[1])
c = 0
... | def main():
N = int(eval(input()))
AB = []
for _ in range(N):
a, b = list(map(int, input().split()))
AB.append((a, b))
AB = sorted(AB, key=lambda x: x[1])
c = 0
for a, b in AB:
c += a
if c > b:
print("No")
return
print("Yes")
main()
| false | 29.166667 | [
"- A = []",
"- B = []",
"- A.append(a)",
"- B.append(b)",
"- if sum(A) > max(B):",
"- print(\"No\")",
"- return"
] | false | 0.007866 | 0.036147 | 0.217617 | [
"s518844655",
"s573474966"
] |
u802963389 | p03805 | python | s298200277 | s685243718 | 207 | 30 | 43,484 | 3,316 | Accepted | Accepted | 85.51 | N, M = list(map(int, input().split()))
graph = [[] for _ in range(N)]
for i in range(M):
a, b = list(map(int, input().split()))
graph[a - 1].append(b - 1)
graph[b - 1].append(a - 1)
def dfs(i, visited):
if all(visited):
return 1
total = 0
for j in graph[i]:
if not ... | # C. One-stroke Path
# https://atcoder.jp/contests/abc054/tasks/abc054_c
from collections import deque
def dfs(i, visited):
stack = deque()
total = 0
stack.append((i, visited))
while stack:
idx, vis = stack.pop()
if all(vis):
total += 1
for j in graph[i... | 27 | 32 | 597 | 728 | N, M = list(map(int, input().split()))
graph = [[] for _ in range(N)]
for i in range(M):
a, b = list(map(int, input().split()))
graph[a - 1].append(b - 1)
graph[b - 1].append(a - 1)
def dfs(i, visited):
if all(visited):
return 1
total = 0
for j in graph[i]:
if not visited[j]:
... | # C. One-stroke Path
# https://atcoder.jp/contests/abc054/tasks/abc054_c
from collections import deque
def dfs(i, visited):
stack = deque()
total = 0
stack.append((i, visited))
while stack:
idx, vis = stack.pop()
if all(vis):
total += 1
for j in graph[idx]:
... | false | 15.625 | [
"+# C. One-stroke Path",
"+# https://atcoder.jp/contests/abc054/tasks/abc054_c",
"+from collections import deque",
"+",
"+",
"+def dfs(i, visited):",
"+ stack = deque()",
"+ total = 0",
"+ stack.append((i, visited))",
"+ while stack:",
"+ idx, vis = stack.pop()",
"+ i... | false | 0.038851 | 0.038657 | 1.005005 | [
"s298200277",
"s685243718"
] |
u599669731 | p02742 | python | s319930705 | s913743172 | 179 | 17 | 38,384 | 2,940 | Accepted | Accepted | 90.5 | import math
h,w=list(map(int,input().split()))
print((math.ceil(h*w/2) if h!=1 and w!=1 else 1)) | h,w=list(map(int,input().split()))
print((int((h*w+1)/2) if min(h,w)!=1 else "1")) | 3 | 2 | 91 | 75 | import math
h, w = list(map(int, input().split()))
print((math.ceil(h * w / 2) if h != 1 and w != 1 else 1))
| h, w = list(map(int, input().split()))
print((int((h * w + 1) / 2) if min(h, w) != 1 else "1"))
| false | 33.333333 | [
"-import math",
"-",
"-print((math.ceil(h * w / 2) if h != 1 and w != 1 else 1))",
"+print((int((h * w + 1) / 2) if min(h, w) != 1 else \"1\"))"
] | false | 0.035631 | 0.038089 | 0.935474 | [
"s319930705",
"s913743172"
] |
u729133443 | p03986 | python | s842904151 | s681635978 | 187 | 47 | 42,076 | 3,500 | Accepted | Accepted | 74.87 | x=eval(input());c=0
for t in x:c+=t=='S'or(c>0)*-1
print((2*c)) | c=0
for x in eval(input()):c+=x=='S'or(c>0)*-1
print((2*c)) | 3 | 3 | 57 | 53 | x = eval(input())
c = 0
for t in x:
c += t == "S" or (c > 0) * -1
print((2 * c))
| c = 0
for x in eval(input()):
c += x == "S" or (c > 0) * -1
print((2 * c))
| false | 0 | [
"-x = eval(input())",
"-for t in x:",
"- c += t == \"S\" or (c > 0) * -1",
"+for x in eval(input()):",
"+ c += x == \"S\" or (c > 0) * -1"
] | false | 0.067475 | 0.161647 | 0.417421 | [
"s842904151",
"s681635978"
] |
u074220993 | p03501 | python | s622834946 | s121832374 | 30 | 24 | 9,064 | 9,160 | Accepted | Accepted | 20 | N, A, B =(int(x) for x in input().split())
print((min(A*N, B))) | N, A, B = list(map(int, input().split()))
print((min(A*N, B))) | 2 | 2 | 62 | 55 | N, A, B = (int(x) for x in input().split())
print((min(A * N, B)))
| N, A, B = list(map(int, input().split()))
print((min(A * N, B)))
| false | 0 | [
"-N, A, B = (int(x) for x in input().split())",
"+N, A, B = list(map(int, input().split()))"
] | false | 0.081103 | 0.041624 | 1.948455 | [
"s622834946",
"s121832374"
] |
u607865971 | p03031 | python | s110115504 | s568432536 | 51 | 42 | 3,064 | 3,064 | Accepted | Accepted | 17.65 | # N = int(input())
# A = [int(x) for x in input().split()]
# V = [[0] * 100 for _ in range(100)]
N, M = [int(x) for x in input().split()]
S = [[0] * N for _ in range(M)]
for m in range(M):
s = [int(x) for x in input().split()]
for s1 in s[1:]:
S[m][s1 - 1] = 1
P = [int(x) for x in input()... | N, M = list(map(int, input().split()))
S = []
for _ in range(M):
tmp = [int(x) for x in input().split()]
k = tmp[0]
S.append(tmp[1:])
P = [int(x) for x in input().split()]
ret = 0
for pt in range(1<<N):
allOn = True
for i in range(M):
swcnt = 0
for s in S[i]:
... | 34 | 26 | 763 | 483 | # N = int(input())
# A = [int(x) for x in input().split()]
# V = [[0] * 100 for _ in range(100)]
N, M = [int(x) for x in input().split()]
S = [[0] * N for _ in range(M)]
for m in range(M):
s = [int(x) for x in input().split()]
for s1 in s[1:]:
S[m][s1 - 1] = 1
P = [int(x) for x in input().split()]
cnt =... | N, M = list(map(int, input().split()))
S = []
for _ in range(M):
tmp = [int(x) for x in input().split()]
k = tmp[0]
S.append(tmp[1:])
P = [int(x) for x in input().split()]
ret = 0
for pt in range(1 << N):
allOn = True
for i in range(M):
swcnt = 0
for s in S[i]:
if pt & (1... | false | 23.529412 | [
"-# N = int(input())",
"-# A = [int(x) for x in input().split()]",
"-# V = [[0] * 100 for _ in range(100)]",
"-N, M = [int(x) for x in input().split()]",
"-S = [[0] * N for _ in range(M)]",
"-for m in range(M):",
"- s = [int(x) for x in input().split()]",
"- for s1 in s[1:]:",
"- S[m][s... | false | 0.042372 | 0.077611 | 0.545959 | [
"s110115504",
"s568432536"
] |
u119148115 | p03545 | python | s805918706 | s865135489 | 73 | 60 | 62,196 | 62,196 | Accepted | Accepted | 17.81 | import sys
sys.setrecursionlimit(10**7)
def I(): return int(sys.stdin.readline().rstrip())
def MI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LI(): return list(map(int,sys.stdin.readline().rstrip().split())) #空白あり
def LI2(): return list(map(int,sys.stdin.readline().rstrip())) #空白なし
def ... | import sys
A = list(map(int,sys.stdin.readline().rstrip()))
from itertools import product
X = ['+','-']
for a in product(X,repeat=3):
b = A[0]
for i in range(3):
if a[i] == '+':
b += A[i+1]
else:
b -= A[i+1]
if b == 7:
print((str(A[0])+a[0]+s... | 26 | 17 | 855 | 379 | import sys
sys.setrecursionlimit(10**7)
def I():
return int(sys.stdin.readline().rstrip())
def MI():
return list(map(int, sys.stdin.readline().rstrip().split()))
def LI():
return list(map(int, sys.stdin.readline().rstrip().split())) # 空白あり
def LI2():
return list(map(int, sys.stdin.readline().r... | import sys
A = list(map(int, sys.stdin.readline().rstrip()))
from itertools import product
X = ["+", "-"]
for a in product(X, repeat=3):
b = A[0]
for i in range(3):
if a[i] == "+":
b += A[i + 1]
else:
b -= A[i + 1]
if b == 7:
print(
(str(A[0]) + ... | false | 34.615385 | [
"-",
"-sys.setrecursionlimit(10**7)",
"-",
"-",
"-def I():",
"- return int(sys.stdin.readline().rstrip())",
"-",
"-",
"-def MI():",
"- return list(map(int, sys.stdin.readline().rstrip().split()))",
"-",
"-",
"-def LI():",
"- return list(map(int, sys.stdin.readline().rstrip().split... | false | 0.045739 | 0.049067 | 0.932179 | [
"s805918706",
"s865135489"
] |
u189487046 | p02796 | python | s702162981 | s691505093 | 294 | 211 | 23,808 | 23,896 | Accepted | Accepted | 28.23 | N = int(eval(input()))
ST = []
for _ in range(N):
x, l = list(map(int, input().split()))
ST.append((x-l, x+l))
ST.sort(key=lambda x: x[1])
ans = 0
cur = -1e9
for i in range(N):
s, t = ST[i]
if cur <= s:
ans += 1
cur = t
print(ans)
| import sys
def input():
return sys.stdin.readline()[:-1]
N = int(eval(input()))
XL = []
for _ in range(N):
x, l = list(map(int, input().split()))
XL.append((x-l, x+l))
XL.sort(key=lambda x: x[1])
ans = 0
cur = -1e9
for i in range(N):
if cur <= XL[i][0]:
ans += 1
... | 17 | 23 | 270 | 338 | N = int(eval(input()))
ST = []
for _ in range(N):
x, l = list(map(int, input().split()))
ST.append((x - l, x + l))
ST.sort(key=lambda x: x[1])
ans = 0
cur = -1e9
for i in range(N):
s, t = ST[i]
if cur <= s:
ans += 1
cur = t
print(ans)
| import sys
def input():
return sys.stdin.readline()[:-1]
N = int(eval(input()))
XL = []
for _ in range(N):
x, l = list(map(int, input().split()))
XL.append((x - l, x + l))
XL.sort(key=lambda x: x[1])
ans = 0
cur = -1e9
for i in range(N):
if cur <= XL[i][0]:
ans += 1
cur = XL[i][1]
pr... | false | 26.086957 | [
"+import sys",
"+",
"+",
"+def input():",
"+ return sys.stdin.readline()[:-1]",
"+",
"+",
"-ST = []",
"+XL = []",
"- ST.append((x - l, x + l))",
"-ST.sort(key=lambda x: x[1])",
"+ XL.append((x - l, x + l))",
"+XL.sort(key=lambda x: x[1])",
"- s, t = ST[i]",
"- if cur <= s:... | false | 0.04581 | 0.046814 | 0.978569 | [
"s702162981",
"s691505093"
] |
u652583512 | p02763 | python | s288062920 | s386999701 | 1,706 | 873 | 48,420 | 51,992 | Accepted | Accepted | 48.83 | class my_segment_tree:
def __init__(self, base_array, size, f=lambda a, b: a + b, default_value = 0):
self.f = f
self._seg_size = 2 ** (size.bit_length() + 1) - 1
self._default_value = default_value
self._array = [default_value] * (self._seg_size)
k = 2 ** size.bit_leng... |
class SegmentTree:
def __init__(self, base_array,n , default_value = 0, segfunc = lambda a, b: a + b): #元配列、大きさ、デフォルト値
self._num = 2 ** (n - 1).bit_length()
self._seg = [default_value] * 2 * self._num
self._segfunc = segfunc
self._ide_ele = default_value
for i in rang... | 62 | 67 | 1,929 | 1,953 | class my_segment_tree:
def __init__(self, base_array, size, f=lambda a, b: a + b, default_value=0):
self.f = f
self._seg_size = 2 ** (size.bit_length() + 1) - 1
self._default_value = default_value
self._array = [default_value] * (self._seg_size)
k = 2 ** size.bit_length() - 1... | class SegmentTree:
def __init__(
self, base_array, n, default_value=0, segfunc=lambda a, b: a + b
): # 元配列、大きさ、デフォルト値
self._num = 2 ** (n - 1).bit_length()
self._seg = [default_value] * 2 * self._num
self._segfunc = segfunc
self._ide_ele = default_value
for i in ... | false | 7.462687 | [
"-class my_segment_tree:",
"- def __init__(self, base_array, size, f=lambda a, b: a + b, default_value=0):",
"- self.f = f",
"- self._seg_size = 2 ** (size.bit_length() + 1) - 1",
"- self._default_value = default_value",
"- self._array = [default_value] * (self._seg_size)",
... | false | 0.048873 | 0.041554 | 1.176135 | [
"s288062920",
"s386999701"
] |
u360116509 | p03164 | python | s245641056 | s316450530 | 924 | 851 | 301,160 | 299,184 | Accepted | Accepted | 7.9 | def main():
N, W = list(map(int, input().split()))
Ws = []
Vs = []
for _ in range(N):
w, v = list(map(int, input().split()))
Ws.append(w)
Vs.append(v)
mv = sum(Vs)
dp = [[float('INF')] * (mv + 1) for _ in range(N + 1)]
dp[0][0] = 0
for i in range(N):
... | def main():
N, W = list(map(int, input().split()))
Ws = []
Vs = []
for _ in range(N):
w, v = list(map(int, input().split()))
Ws.append(w)
Vs.append(v)
mv = sum(Vs)
dp = [[float('INF')] * (mv + 1) for _ in range(N + 1)]
dp[0][0] = 0
for i in range(N):
... | 26 | 24 | 651 | 611 | def main():
N, W = list(map(int, input().split()))
Ws = []
Vs = []
for _ in range(N):
w, v = list(map(int, input().split()))
Ws.append(w)
Vs.append(v)
mv = sum(Vs)
dp = [[float("INF")] * (mv + 1) for _ in range(N + 1)]
dp[0][0] = 0
for i in range(N):
for j... | def main():
N, W = list(map(int, input().split()))
Ws = []
Vs = []
for _ in range(N):
w, v = list(map(int, input().split()))
Ws.append(w)
Vs.append(v)
mv = sum(Vs)
dp = [[float("INF")] * (mv + 1) for _ in range(N + 1)]
dp[0][0] = 0
for i in range(N):
for j... | false | 7.692308 | [
"- ans = 0",
"- for r in dp:",
"- for v, w in enumerate(r):",
"- if W >= w:",
"- ans = max(ans, v)",
"- print(ans)",
"+ for j in range(mv, -1, -1):",
"+ if W >= dp[N][j]:",
"+ print(j)",
"+ break"
] | false | 0.044202 | 0.039834 | 1.109638 | [
"s245641056",
"s316450530"
] |
u614875193 | p02629 | python | s417743987 | s318108286 | 34 | 30 | 8,944 | 9,144 | Accepted | Accepted | 11.76 | n=int(eval(input()))
ans=''
alpha='abcdefghijklmnopqrstuvwxyza'
while n>0:
n-=1
ans+=alpha[n%26]
n//=26
print((ans[::-1])) | n=int(eval(input()))
keta=[26]
t=2
while keta[-1]<10**15+1:
keta.append(keta[-1]+26**t)
t+=1
#print(keta)
import bisect,sys
nagasa=bisect.bisect_left(keta,n)+1
#print(nagasa)
alpha='abcdefghijklmnopqrstuvwxyza'
if nagasa==1:
print((alpha[n-1]))
sys.exit()
n-=keta[nagasa-2]
n-=1
a... | 8 | 30 | 133 | 456 | n = int(eval(input()))
ans = ""
alpha = "abcdefghijklmnopqrstuvwxyza"
while n > 0:
n -= 1
ans += alpha[n % 26]
n //= 26
print((ans[::-1]))
| n = int(eval(input()))
keta = [26]
t = 2
while keta[-1] < 10**15 + 1:
keta.append(keta[-1] + 26**t)
t += 1
# print(keta)
import bisect, sys
nagasa = bisect.bisect_left(keta, n) + 1
# print(nagasa)
alpha = "abcdefghijklmnopqrstuvwxyza"
if nagasa == 1:
print((alpha[n - 1]))
sys.exit()
n -= keta[nagasa - ... | false | 73.333333 | [
"+keta = [26]",
"+t = 2",
"+while keta[-1] < 10**15 + 1:",
"+ keta.append(keta[-1] + 26**t)",
"+ t += 1",
"+# print(keta)",
"+import bisect, sys",
"+",
"+nagasa = bisect.bisect_left(keta, n) + 1",
"+# print(nagasa)",
"+alpha = \"abcdefghijklmnopqrstuvwxyza\"",
"+if nagasa == 1:",
"+ ... | false | 0.038021 | 0.039028 | 0.974192 | [
"s417743987",
"s318108286"
] |
u941753895 | p03147 | python | s402681454 | s744544149 | 62 | 42 | 6,432 | 5,420 | Accepted | Accepted | 32.26 | import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time
sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7
def LI(): return list(map(int,input().split()))
def I(): return int(eval(input()))
def LS(): return input().split()
def S(): return eval(input())
# 方針
# 前から順に-1していく... | import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time
sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7
def LI(): return list(map(int,input().split()))
def I(): return int(eval(input()))
def LS(): return input().split()
def S(): return eval(input())
def main():
n=I(... | 51 | 35 | 786 | 544 | import math, string, itertools, fractions, heapq, collections, re, array, bisect, sys, random, time
sys.setrecursionlimit(10**7)
inf = 10**20
mod = 10**9 + 7
def LI():
return list(map(int, input().split()))
def I():
return int(eval(input()))
def LS():
return input().split()
def S():
return eval... | import math, string, itertools, fractions, heapq, collections, re, array, bisect, sys, random, time
sys.setrecursionlimit(10**7)
inf = 10**20
mod = 10**9 + 7
def LI():
return list(map(int, input().split()))
def I():
return int(eval(input()))
def LS():
return input().split()
def S():
return eval... | false | 31.372549 | [
"-# 方針",
"-# 前から順に-1していく",
"-# その際、常に前の数を見ておき、0になった場合一区切り",
"-# カウンターを+1する",
"-# また、最後の項に達したときも+1",
"-# インデックスは先頭に戻して",
"-# 全ての項が0になるまで繰り返す",
"-# （全部0になったことを確認するため、初めにsumを取って",
"-# 引き算するたびにsumも-1していき、0になったらループ脱出）",
"+ c = 0",
"- c = 0",
"- # print(l)",
"- # print(c)",
"... | false | 0.036849 | 0.036424 | 1.01168 | [
"s402681454",
"s744544149"
] |
u430726059 | p03031 | python | s523870031 | s675869341 | 144 | 49 | 27,228 | 9,316 | Accepted | Accepted | 65.97 | import numpy as np
N, M = list(map(int, input().split()))
array = np.zeros([M, N])
for i in range(M):
l = list(map(int, input().split()))
for j in l[1:]:
array[i, j-1] = 1
p = np.array(list(map(int, input().split())))
count = 0
for i in range(1<<N):
array_i = array.copy()
for j in ... | import itertools
n,m=list(map(int, input().split()))
k=[list(map(int, input().split())) for i in range(m)]
p=list(map(int, input().split()))
bit=list(itertools.product([0,1], repeat=n))
ans=0
for i in bit:
cnt=0
for j in range(m):
cnt2=0
for l in range(1,k[j][0]+1):
if i[k[j][l]-1]==1:
... | 18 | 18 | 451 | 400 | import numpy as np
N, M = list(map(int, input().split()))
array = np.zeros([M, N])
for i in range(M):
l = list(map(int, input().split()))
for j in l[1:]:
array[i, j - 1] = 1
p = np.array(list(map(int, input().split())))
count = 0
for i in range(1 << N):
array_i = array.copy()
for j in range(N):... | import itertools
n, m = list(map(int, input().split()))
k = [list(map(int, input().split())) for i in range(m)]
p = list(map(int, input().split()))
bit = list(itertools.product([0, 1], repeat=n))
ans = 0
for i in bit:
cnt = 0
for j in range(m):
cnt2 = 0
for l in range(1, k[j][0] + 1):
... | false | 0 | [
"-import numpy as np",
"+import itertools",
"-N, M = list(map(int, input().split()))",
"-array = np.zeros([M, N])",
"-for i in range(M):",
"- l = list(map(int, input().split()))",
"- for j in l[1:]:",
"- array[i, j - 1] = 1",
"-p = np.array(list(map(int, input().split())))",
"-count =... | false | 0.279338 | 0.038668 | 7.223969 | [
"s523870031",
"s675869341"
] |
u148551245 | p03337 | python | s740945777 | s150846103 | 163 | 17 | 38,384 | 2,940 | Accepted | Accepted | 89.57 | (a, b) = list(map(int, input().split()))
r = []
r.append(a + b)
r.append(a - b)
r.append(a * b)
print((max(r))) | a, b = list(map(int, input().split()))
print((max(a+b, a-b, a*b))) | 6 | 2 | 108 | 59 | (a, b) = list(map(int, input().split()))
r = []
r.append(a + b)
r.append(a - b)
r.append(a * b)
print((max(r)))
| a, b = list(map(int, input().split()))
print((max(a + b, a - b, a * b)))
| false | 66.666667 | [
"-(a, b) = list(map(int, input().split()))",
"-r = []",
"-r.append(a + b)",
"-r.append(a - b)",
"-r.append(a * b)",
"-print((max(r)))",
"+a, b = list(map(int, input().split()))",
"+print((max(a + b, a - b, a * b)))"
] | false | 0.040531 | 0.035491 | 1.142027 | [
"s740945777",
"s150846103"
] |
u848647227 | p03640 | python | s452879025 | s225764813 | 47 | 35 | 3,828 | 3,948 | Accepted | Accepted | 25.53 | a,b= map(int,input().split(" "))
c = int(input())
ar = list(map(int,input().split(" ")))
br = [[0 for i in range(b)] for j in range(a)]
go = "M"
ap = 1
for i in range(a):
if go == "M":
for j in range(b):
if ar[0] == 0:
del ar[0]
ap += 1
br[... | n,w = map(int,input().split(" "))
c = int(input())
ar = [[0 for i in range(w)] for j in range(n)]
br = list(map(int,input().split(" ")))
z = 1
for i in range(n):
if i % 2 ==0:
for j in range(w):
ar[i][j] = z
br[z-1] -= 1
if br[z-1] == 0:
z += 1
... | 27 | 22 | 656 | 561 | a, b = map(int, input().split(" "))
c = int(input())
ar = list(map(int, input().split(" ")))
br = [[0 for i in range(b)] for j in range(a)]
go = "M"
ap = 1
for i in range(a):
if go == "M":
for j in range(b):
if ar[0] == 0:
del ar[0]
ap += 1
br[i][j] = ... | n, w = map(int, input().split(" "))
c = int(input())
ar = [[0 for i in range(w)] for j in range(n)]
br = list(map(int, input().split(" ")))
z = 1
for i in range(n):
if i % 2 == 0:
for j in range(w):
ar[i][j] = z
br[z - 1] -= 1
if br[z - 1] == 0:
z += 1
... | false | 18.518519 | [
"-a, b = map(int, input().split(\" \"))",
"+n, w = map(int, input().split(\" \"))",
"-ar = list(map(int, input().split(\" \")))",
"-br = [[0 for i in range(b)] for j in range(a)]",
"-go = \"M\"",
"-ap = 1",
"-for i in range(a):",
"- if go == \"M\":",
"- for j in range(b):",
"- ... | false | 0.041769 | 0.042345 | 0.986381 | [
"s452879025",
"s225764813"
] |
u285891772 | p02708 | python | s055728684 | s913924006 | 163 | 135 | 10,052 | 9,992 | Accepted | Accepted | 17.18 | import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, gcd
from itertools import accumulate, permutations, combinations, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowerc... | import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, gcd
from itertools import accumulate, permutations, combinations, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowerc... | 30 | 26 | 921 | 885 | import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, gcd
from itertools import accumulate, permutations, combinations, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, a... | import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, gcd
from itertools import accumulate, permutations, combinations, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, a... | false | 13.333333 | [
"-for k in range(K, N + 2):",
"- mi = k * (k - 1) // 2",
"- x = N - k",
"- ma = N * (N + 1) // 2 - x * (x + 1) // 2",
"- ans += ma - mi + 1",
"- ans %= mod",
"+for i in range(K, N + 2):",
"+ ans += N * (N + 1) // 2 - (N - i) * (N - i + 1) // 2 - i * (i - 1) // 2 + 1"
] | false | 0.073288 | 0.203662 | 0.35985 | [
"s055728684",
"s913924006"
] |
u123756661 | p04013 | python | s457280683 | s722211786 | 361 | 211 | 95,580 | 42,052 | Accepted | Accepted | 41.55 | n,a=list(map(int,input().split()))
l=[int(i) for i in input().split()]
ans=0
#dp=[[[0 for i in range(51)] for j in range(51)] for k in range(2501)]
dp=[[[0 for i in range(2501)] for j in range(51)] for k in range(51)]
dp[0][0][0]=1
for i in range(n):
for j in range(50):
for k in range(2501):
... | def sol():
n,a=list(map(int,input().split()))
x=[int(i) for i in input().split()]
ans=chk=0
d=[[0]*2501 for j in range(51)]
d[0][0]=1
for i in x:
for j in range(2500,i-1,-1):
for k in range(50,0,-1):
d[k][j]+=d[k-1][j-i]
for i in range(1,51):
... | 16 | 16 | 492 | 390 | n, a = list(map(int, input().split()))
l = [int(i) for i in input().split()]
ans = 0
# dp=[[[0 for i in range(51)] for j in range(51)] for k in range(2501)]
dp = [[[0 for i in range(2501)] for j in range(51)] for k in range(51)]
dp[0][0][0] = 1
for i in range(n):
for j in range(50):
for k in range(2501):
... | def sol():
n, a = list(map(int, input().split()))
x = [int(i) for i in input().split()]
ans = chk = 0
d = [[0] * 2501 for j in range(51)]
d[0][0] = 1
for i in x:
for j in range(2500, i - 1, -1):
for k in range(50, 0, -1):
d[k][j] += d[k - 1][j - i]
for i i... | false | 0 | [
"-n, a = list(map(int, input().split()))",
"-l = [int(i) for i in input().split()]",
"-ans = 0",
"-# dp=[[[0 for i in range(51)] for j in range(51)] for k in range(2501)]",
"-dp = [[[0 for i in range(2501)] for j in range(51)] for k in range(51)]",
"-dp[0][0][0] = 1",
"-for i in range(n):",
"- for ... | false | 0.465917 | 0.149302 | 3.120647 | [
"s457280683",
"s722211786"
] |
u277312083 | p02640 | python | s332772820 | s587754704 | 29 | 26 | 8,872 | 9,092 | Accepted | Accepted | 10.34 | x, y = list(map(int, input().split()))
if y % 2 == 0 and y >= 2 * x and 4 * x >= y:
print("Yes")
else:
print("No")
| x, y = list(map(int, input().split()))
print(("Yes" if y % 2 == 0 and y >= 2 * x and 4 * x >= y else "No"))
| 5 | 2 | 121 | 101 | x, y = list(map(int, input().split()))
if y % 2 == 0 and y >= 2 * x and 4 * x >= y:
print("Yes")
else:
print("No")
| x, y = list(map(int, input().split()))
print(("Yes" if y % 2 == 0 and y >= 2 * x and 4 * x >= y else "No"))
| false | 60 | [
"-if y % 2 == 0 and y >= 2 * x and 4 * x >= y:",
"- print(\"Yes\")",
"-else:",
"- print(\"No\")",
"+print((\"Yes\" if y % 2 == 0 and y >= 2 * x and 4 * x >= y else \"No\"))"
] | false | 0.048385 | 0.171633 | 0.281906 | [
"s332772820",
"s587754704"
] |
u554503378 | p02259 | python | s081211329 | s483318491 | 30 | 20 | 5,604 | 5,604 | Accepted | Accepted | 33.33 | def bubble_sort(num_list):
list_length = len(num_list)-1
cnt = 0
for i in range(list_length):
for j in range(list_length,i,-1):
if num_list[j] < num_list[j-1]:
num_list[j],num_list[j-1] = num_list[j-1],num_list[j]
cnt += 1
return num_list,cnt... | def bubble_sort(num_list):
cnt = 0
flag = 1
while flag:
flag = 0
for i in range(len(num_list)-1,0,-1):
if num_list[i] < num_list[i-1]:
num_list[i],num_list[i-1] = num_list[i-1],num_list[i]
cnt += 1
flag = 1
return cn... | 17 | 20 | 508 | 489 | def bubble_sort(num_list):
list_length = len(num_list) - 1
cnt = 0
for i in range(list_length):
for j in range(list_length, i, -1):
if num_list[j] < num_list[j - 1]:
num_list[j], num_list[j - 1] = num_list[j - 1], num_list[j]
cnt += 1
return num_list, ... | def bubble_sort(num_list):
cnt = 0
flag = 1
while flag:
flag = 0
for i in range(len(num_list) - 1, 0, -1):
if num_list[i] < num_list[i - 1]:
num_list[i], num_list[i - 1] = num_list[i - 1], num_list[i]
cnt += 1
flag = 1
return cn... | false | 15 | [
"- list_length = len(num_list) - 1",
"- for i in range(list_length):",
"- for j in range(list_length, i, -1):",
"- if num_list[j] < num_list[j - 1]:",
"- num_list[j], num_list[j - 1] = num_list[j - 1], num_list[j]",
"+ flag = 1",
"+ while flag:",
"+ ... | false | 0.050375 | 0.068094 | 0.739787 | [
"s081211329",
"s483318491"
] |
u729133443 | p03631 | python | s518225259 | s736944142 | 163 | 17 | 38,384 | 2,940 | Accepted | Accepted | 89.57 | s=eval(input());print(('YNeos'[s!=s[::-1]::2])) | a,b,c=eval(input());print(('YNeos'[a!=c::2])) | 1 | 1 | 39 | 37 | s = eval(input())
print(("YNeos"[s != s[::-1] :: 2]))
| a, b, c = eval(input())
print(("YNeos"[a != c :: 2]))
| false | 0 | [
"-s = eval(input())",
"-print((\"YNeos\"[s != s[::-1] :: 2]))",
"+a, b, c = eval(input())",
"+print((\"YNeos\"[a != c :: 2]))"
] | false | 0.035972 | 0.037076 | 0.970224 | [
"s518225259",
"s736944142"
] |
u822961851 | p02837 | python | s540538753 | s954792195 | 232 | 113 | 3,064 | 3,064 | Accepted | Accepted | 51.29 | def resolve():
N = int(eval(input()))
L = [[] for i in range(N)]
for i in range(N):
A = int(eval(input()))
for j in range(A):
x, y = list(map(int, input().split()))
L[i].append((x, y))
ans = 0
for p in range(1, 2**N):
isOk = True
f... | def resolve():
N = int(eval(input()))
L = [[] for i in range(N)]
for i in range(N):
A = int(eval(input()))
for j in range(A):
x, y = list(map(int,input().split()))
L[i].append((x, y))
ans = 0
for p in range(2**N):
ok = True
for i... | 32 | 33 | 815 | 809 | def resolve():
N = int(eval(input()))
L = [[] for i in range(N)]
for i in range(N):
A = int(eval(input()))
for j in range(A):
x, y = list(map(int, input().split()))
L[i].append((x, y))
ans = 0
for p in range(1, 2**N):
isOk = True
for i in range... | def resolve():
N = int(eval(input()))
L = [[] for i in range(N)]
for i in range(N):
A = int(eval(input()))
for j in range(A):
x, y = list(map(int, input().split()))
L[i].append((x, y))
ans = 0
for p in range(2**N):
ok = True
for i in range(N):
... | false | 3.030303 | [
"- for p in range(1, 2**N):",
"- isOk = True",
"+ for p in range(2**N):",
"+ ok = True",
"- if p & 1 << (x - 1) and not y:",
"- isOk = False",
"+ if p & (1 << (x - 1)) > 0 and y == 0:",
"+ ok = Fals... | false | 0.035634 | 0.033349 | 1.068517 | [
"s540538753",
"s954792195"
] |
u669812251 | p03240 | python | s289969628 | s371715120 | 36 | 28 | 3,064 | 3,064 | Accepted | Accepted | 22.22 | def dist(a, b, x, y, h):
return h + abs(a - x) + abs(b - y)
N = int(eval(input()))
P = []
for i in range(N):
x, y, h = list(map(int, input().split()))
P.append([h, x, y])
P.sort(reverse = True)
for i in range(101):
for j in range(101):
H = dist(i, j, P[0][1], P[0][2], P[0][0])
... | # -*- coding: utf-8 -*-
def main():
N = int(eval(input()))
P = []
for i in range(N):
x, y, h = list(map(int, input().split()))
P.append([h, x, y])
P.sort(reverse = True)
for x in range(101):
for y in range(101):
distance =abs(x-P[0][1]) + abs(y-P[0]... | 19 | 22 | 474 | 579 | def dist(a, b, x, y, h):
return h + abs(a - x) + abs(b - y)
N = int(eval(input()))
P = []
for i in range(N):
x, y, h = list(map(int, input().split()))
P.append([h, x, y])
P.sort(reverse=True)
for i in range(101):
for j in range(101):
H = dist(i, j, P[0][1], P[0][2], P[0][0])
for p in P... | # -*- coding: utf-8 -*-
def main():
N = int(eval(input()))
P = []
for i in range(N):
x, y, h = list(map(int, input().split()))
P.append([h, x, y])
P.sort(reverse=True)
for x in range(101):
for y in range(101):
distance = abs(x - P[0][1]) + abs(y - P[0][2]) + P[0][... | false | 13.636364 | [
"-def dist(a, b, x, y, h):",
"- return h + abs(a - x) + abs(b - y)",
"+# -*- coding: utf-8 -*-",
"+def main():",
"+ N = int(eval(input()))",
"+ P = []",
"+ for i in range(N):",
"+ x, y, h = list(map(int, input().split()))",
"+ P.append([h, x, y])",
"+ P.sort(reverse=Tr... | false | 0.058428 | 0.107874 | 0.54163 | [
"s289969628",
"s371715120"
] |
u802977614 | p02763 | python | s299778105 | s758362360 | 634 | 496 | 111,876 | 113,728 | Accepted | Accepted | 21.77 | import sys, bisect, math, itertools, heapq, collections
from operator import itemgetter
# a.sort(key=itemgetter(i)) # i番目要素でsort
from functools import lru_cache
# @lru_cache(maxsize=None)
sys.setrecursionlimit(10**8)
input = sys.stdin.readline
INF = float('inf')
mod = 10**9+7
eps = 10**-7
def inp():
'''
... | import sys, bisect, math, itertools, heapq, collections
from operator import itemgetter
# a.sort(key=itemgetter(i)) # i番目要素でsort
from functools import lru_cache
# @lru_cache(maxsize=None)
sys.setrecursionlimit(10**8)
input = sys.stdin.readline
INF = float('inf')
mod = 10**9+7
eps = 10**-7
def inp():
'''
... | 104 | 101 | 2,581 | 2,459 | import sys, bisect, math, itertools, heapq, collections
from operator import itemgetter
# a.sort(key=itemgetter(i)) # i番目要素でsort
from functools import lru_cache
# @lru_cache(maxsize=None)
sys.setrecursionlimit(10**8)
input = sys.stdin.readline
INF = float("inf")
mod = 10**9 + 7
eps = 10**-7
def inp():
"""
一... | import sys, bisect, math, itertools, heapq, collections
from operator import itemgetter
# a.sort(key=itemgetter(i)) # i番目要素でsort
from functools import lru_cache
# @lru_cache(maxsize=None)
sys.setrecursionlimit(10**8)
input = sys.stdin.readline
INF = float("inf")
mod = 10**9 + 7
eps = 10**-7
def inp():
"""
一... | false | 2.884615 | [
"- while k >= 0:",
"+ while k > 0:",
"-def main():",
"- n = inp()",
"- s = [chartobit(i) for i in list(eval(input())) if i != \"\\n\"]",
"- st = SegmentTree(0, n)",
"- for i in range(n):",
"- st.update(i, s[i])",
"- q = inp()",
"- ans = []",
"- for i in ... | false | 0.034542 | 0.042384 | 0.814991 | [
"s299778105",
"s758362360"
] |
u389910364 | p02984 | python | s858861041 | s131006130 | 938 | 126 | 16,828 | 14,408 | Accepted | Accepted | 86.57 | import os
import sys
if os.getenv("LOCAL"):
sys.stdin = open("_in.txt", "r")
sys.setrecursionlimit(2147483647)
INF = float("inf")
IINF = 10 ** 18
MOD = 10 ** 9 + 7
N = int(sys.stdin.readline())
A = list(map(int, sys.stdin.readline().split()))
def bisect_left_callable(fn, x, lo, hi):
"""
... | import os
import sys
if os.getenv("LOCAL"):
sys.stdin = open("_in.txt", "r")
sys.setrecursionlimit(2147483647)
INF = float("inf")
IINF = 10 ** 18
MOD = 10 ** 9 + 7
N = int(sys.stdin.readline())
A = list(map(int, sys.stdin.readline().split()))
S = sum(A)
ans = [0] * N
ans[0] = S - sum(A[1::2]) * ... | 52 | 20 | 1,124 | 405 | import os
import sys
if os.getenv("LOCAL"):
sys.stdin = open("_in.txt", "r")
sys.setrecursionlimit(2147483647)
INF = float("inf")
IINF = 10**18
MOD = 10**9 + 7
N = int(sys.stdin.readline())
A = list(map(int, sys.stdin.readline().split()))
def bisect_left_callable(fn, x, lo, hi):
"""
(memo) いっぱい呼ぶなら np.se... | import os
import sys
if os.getenv("LOCAL"):
sys.stdin = open("_in.txt", "r")
sys.setrecursionlimit(2147483647)
INF = float("inf")
IINF = 10**18
MOD = 10**9 + 7
N = int(sys.stdin.readline())
A = list(map(int, sys.stdin.readline().split()))
S = sum(A)
ans = [0] * N
ans[0] = S - sum(A[1::2]) * 2
for i in range(1, N):... | false | 61.538462 | [
"-",
"-",
"-def bisect_left_callable(fn, x, lo, hi):",
"- \"\"\"",
"- (memo) いっぱい呼ぶなら np.searchsorted のほうがベクトル化されててはやそう",
"- lo から hi-1 のうち、fn の結果が x 以上となる、最も左の値",
"- bisect.bisect_left と同じ",
"- https://docs.python.org/ja/3/library/bisect.html",
"- :param callable fn:",
"- :pa... | false | 0.035949 | 0.038399 | 0.936198 | [
"s858861041",
"s131006130"
] |
u163501259 | p02608 | python | s737579443 | s122507681 | 715 | 308 | 9,132 | 9,008 | Accepted | Accepted | 56.92 | import sys
input = sys.stdin.readline
import math
def main():
N = int(eval(input()))
n = int(math.sqrt(N)) + 1
ans = [0]*10001
for x in range(1,n):
for y in range(1,n):
for z in range(1,n):
v = x**2 + y**2 + z**2 + x*y + y*z + z*x
if v <= 10... | import sys
input = sys.stdin.readline
from math import sqrt
def main():
N = int(eval(input()))
A = [0]*(N+1)
n = int(sqrt(N)) + 1
for x in range(1, n):
for y in range(1, n):
for z in range(1, n):
tmp = x*x + y*y + z*z + x*y + y*z + z*x
if tm... | 18 | 18 | 445 | 445 | import sys
input = sys.stdin.readline
import math
def main():
N = int(eval(input()))
n = int(math.sqrt(N)) + 1
ans = [0] * 10001
for x in range(1, n):
for y in range(1, n):
for z in range(1, n):
v = x**2 + y**2 + z**2 + x * y + y * z + z * x
if v <=... | import sys
input = sys.stdin.readline
from math import sqrt
def main():
N = int(eval(input()))
A = [0] * (N + 1)
n = int(sqrt(N)) + 1
for x in range(1, n):
for y in range(1, n):
for z in range(1, n):
tmp = x * x + y * y + z * z + x * y + y * z + z * x
... | false | 0 | [
"-import math",
"+from math import sqrt",
"- n = int(math.sqrt(N)) + 1",
"- ans = [0] * 10001",
"+ A = [0] * (N + 1)",
"+ n = int(sqrt(N)) + 1",
"- v = x**2 + y**2 + z**2 + x * y + y * z + z * x",
"- if v <= 10000:",
"- ans[v] += 1",
"+ ... | false | 0.038736 | 0.038784 | 0.998768 | [
"s737579443",
"s122507681"
] |
u250583425 | p03557 | python | s710171875 | s748091679 | 792 | 293 | 23,328 | 22,720 | Accepted | Accepted | 63.01 | import sys
def input(): return sys.stdin.readline().rstrip()
def main():
N = int(eval(input()))
A = sorted(map(int, input().split()))
B = sorted(map(int, input().split()))
C = sorted(map(int, input().split()))
ans = 0
for b in B:
sum_v = 1
l = -1
r = N
... | import sys
import bisect
def input(): return sys.stdin.readline().rstrip()
def main():
N = int(eval(input()))
A = sorted(map(int, input().split()))
B = sorted(map(int, input().split()))
C = sorted(map(int, input().split()))
ans = 0
for b in B:
ans += bisect.bisect_left(A, b... | 36 | 17 | 765 | 408 | import sys
def input():
return sys.stdin.readline().rstrip()
def main():
N = int(eval(input()))
A = sorted(map(int, input().split()))
B = sorted(map(int, input().split()))
C = sorted(map(int, input().split()))
ans = 0
for b in B:
sum_v = 1
l = -1
r = N
whi... | import sys
import bisect
def input():
return sys.stdin.readline().rstrip()
def main():
N = int(eval(input()))
A = sorted(map(int, input().split()))
B = sorted(map(int, input().split()))
C = sorted(map(int, input().split()))
ans = 0
for b in B:
ans += bisect.bisect_left(A, b) * (N... | false | 52.777778 | [
"+import bisect",
"- sum_v = 1",
"- l = -1",
"- r = N",
"- while r - l > 1:",
"- m = (l + r) // 2",
"- if b > A[m]:",
"- l = m",
"- else:",
"- r = m",
"- sum_v *= l + 1",
"- l = -1",
"- ... | false | 0.035003 | 0.040817 | 0.857557 | [
"s710171875",
"s748091679"
] |
u472065247 | p03575 | python | s923538566 | s195313293 | 248 | 194 | 17,612 | 13,768 | Accepted | Accepted | 21.77 | from scipy.sparse import *;from scipy.sparse.csgraph import connected_components;N,M=list(map(int,input().split()));g=lil_matrix((N,N))
for _ in [0]*M:
a,b=list(map(int,input().split()));g[a-1,b-1]=1
c=0
for a,b in zip(*g.nonzero()):
g[a,b]=0;c+=connected_components(g,return_labels=False)!=1;g[a,b]=1
print(c) | from scipy.sparse import *;N,M,*A=list(map(int,open(0).read().split()));g=csr_matrix(([1]*M,(A[::2],A[1::2])),shape=(N+1,N+1)).tolil();c=0
for a,b in zip(*g.nonzero()):
g[a,b]=0;n,_=csgraph.connected_components(g);c+=n!=2;g[a,b]=1
print(c) | 7 | 4 | 314 | 237 | from scipy.sparse import *
from scipy.sparse.csgraph import connected_components
N, M = list(map(int, input().split()))
g = lil_matrix((N, N))
for _ in [0] * M:
a, b = list(map(int, input().split()))
g[a - 1, b - 1] = 1
c = 0
for a, b in zip(*g.nonzero()):
g[a, b] = 0
c += connected_components(g, retur... | from scipy.sparse import *
N, M, *A = list(map(int, open(0).read().split()))
g = csr_matrix(([1] * M, (A[::2], A[1::2])), shape=(N + 1, N + 1)).tolil()
c = 0
for a, b in zip(*g.nonzero()):
g[a, b] = 0
n, _ = csgraph.connected_components(g)
c += n != 2
g[a, b] = 1
print(c)
| false | 42.857143 | [
"-from scipy.sparse.csgraph import connected_components",
"-N, M = list(map(int, input().split()))",
"-g = lil_matrix((N, N))",
"-for _ in [0] * M:",
"- a, b = list(map(int, input().split()))",
"- g[a - 1, b - 1] = 1",
"+N, M, *A = list(map(int, open(0).read().split()))",
"+g = csr_matrix(([1] *... | false | 0.351161 | 0.378173 | 0.928572 | [
"s923538566",
"s195313293"
] |
u581187895 | p02721 | python | s725402807 | s206518628 | 185 | 170 | 25,088 | 26,256 | Accepted | Accepted | 8.11 |
def resolve():
def sub(s):
cur = 0
last = -(C + 1)
res = [0] * (N + 1)
for i in range(N):
if i - last > C and s[i] == "o":
cur += 1
last = i
res[i + 1] = cur
return res
N, K, C = list(map(int, input().... |
def resolve():
N, K, C = list(map(int, input().split()))
S = eval(input())
left = [0]*N
i = 0
cnt = 1
while i < N:
if S[i] == "o":
left[i] = cnt
i += C
cnt += 1
i += 1
right = [0]*N
i = 0
cnt = K
T = S[::-1]... | 28 | 35 | 587 | 639 | def resolve():
def sub(s):
cur = 0
last = -(C + 1)
res = [0] * (N + 1)
for i in range(N):
if i - last > C and s[i] == "o":
cur += 1
last = i
res[i + 1] = cur
return res
N, K, C = list(map(int, input().split()))
... | def resolve():
N, K, C = list(map(int, input().split()))
S = eval(input())
left = [0] * N
i = 0
cnt = 1
while i < N:
if S[i] == "o":
left[i] = cnt
i += C
cnt += 1
i += 1
right = [0] * N
i = 0
cnt = K
T = S[::-1]
while i < N:... | false | 20 | [
"- def sub(s):",
"- cur = 0",
"- last = -(C + 1)",
"- res = [0] * (N + 1)",
"- for i in range(N):",
"- if i - last > C and s[i] == \"o\":",
"- cur += 1",
"- last = i",
"- res[i + 1] = cur",
"- return res",
... | false | 0.069604 | 0.081332 | 0.855808 | [
"s725402807",
"s206518628"
] |
u261103969 | p02576 | python | s031957693 | s635525802 | 68 | 26 | 61,760 | 9,020 | Accepted | Accepted | 61.76 | import sys
readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)
def main():
n, x, t = list(map(int, readline().split()))
print(((n + x - 1) // x * t))
if __name__ == '__main__':
main()
| from math import ceil
n, x, t = list(map(int, input().split()))
k = ceil(n / x)
print((k * t)) | 15 | 4 | 253 | 89 | import sys
readline = sys.stdin.readline
MOD = 10**9 + 7
INF = float("INF")
sys.setrecursionlimit(10**5)
def main():
n, x, t = list(map(int, readline().split()))
print(((n + x - 1) // x * t))
if __name__ == "__main__":
main()
| from math import ceil
n, x, t = list(map(int, input().split()))
k = ceil(n / x)
print((k * t))
| false | 73.333333 | [
"-import sys",
"+from math import ceil",
"-readline = sys.stdin.readline",
"-MOD = 10**9 + 7",
"-INF = float(\"INF\")",
"-sys.setrecursionlimit(10**5)",
"-",
"-",
"-def main():",
"- n, x, t = list(map(int, readline().split()))",
"- print(((n + x - 1) // x * t))",
"-",
"-",
"-if __nam... | false | 0.04374 | 0.037507 | 1.166173 | [
"s031957693",
"s635525802"
] |
u787562674 | p03721 | python | s466373422 | s649749047 | 533 | 434 | 27,608 | 23,540 | Accepted | Accepted | 18.57 | from collections import Counter
N, K = list(map(int, input().split()))
input_list = [[int(i) for i in input().split()] for j in range(N)]
input_list.sort()
input_counter = Counter()
for element in input_list:
input_counter[element[0]] += element[1]
for element in input_list:
K -= element[1]
... | from collections import Counter
N, K = list(map(int, input().split()))
input_list = [[int(i) for i in input().split()] for j in range(N)]
input_list.sort()
for element in input_list:
K -= element[1]
if K <= 0:
print((element[0]))
break | 16 | 11 | 367 | 263 | from collections import Counter
N, K = list(map(int, input().split()))
input_list = [[int(i) for i in input().split()] for j in range(N)]
input_list.sort()
input_counter = Counter()
for element in input_list:
input_counter[element[0]] += element[1]
for element in input_list:
K -= element[1]
if K <= 0:
... | from collections import Counter
N, K = list(map(int, input().split()))
input_list = [[int(i) for i in input().split()] for j in range(N)]
input_list.sort()
for element in input_list:
K -= element[1]
if K <= 0:
print((element[0]))
break
| false | 31.25 | [
"-input_counter = Counter()",
"-for element in input_list:",
"- input_counter[element[0]] += element[1]"
] | false | 0.150266 | 0.183734 | 0.817845 | [
"s466373422",
"s649749047"
] |
u532966492 | p03987 | python | s268888648 | s687013582 | 1,494 | 1,127 | 129,360 | 47,448 | Accepted | Accepted | 24.56 | n=int(eval(input()))
a=list(map(int,input().split()))
a=sorted(list(enumerate(a)),key=lambda x:x[1])
l=1
while l<2*(n+2)-1:
l*=2
l-=1
seg=[True]*l
seg[0]=False
def update(i):
if seg[i]:
seg[i]=False
update((i-1)//2)
update((l-1)//2)
update((l-1)//2+n+1)
def search_left(i,j):
if j==1:
i... | def main():
n = int(eval(input()))
a = list(map(int, input().split()))
a = sorted(list(enumerate(a)), key=lambda x: -x[1])
class unionfind():
# size:要素数,tree：unionfind木
def __init__(self, size): # self,要素数
self.size = size
self.tree = [i for i in range(... | 58 | 63 | 957 | 1,735 | n = int(eval(input()))
a = list(map(int, input().split()))
a = sorted(list(enumerate(a)), key=lambda x: x[1])
l = 1
while l < 2 * (n + 2) - 1:
l *= 2
l -= 1
seg = [True] * l
seg[0] = False
def update(i):
if seg[i]:
seg[i] = False
update((i - 1) // 2)
update((l - 1) // 2)
update((l - 1) // 2 ... | def main():
n = int(eval(input()))
a = list(map(int, input().split()))
a = sorted(list(enumerate(a)), key=lambda x: -x[1])
class unionfind:
# size:要素数,tree：unionfind木
def __init__(self, size): # self,要素数
self.size = size
self.tree = [i for i in range(self.size)]... | false | 7.936508 | [
"-n = int(eval(input()))",
"-a = list(map(int, input().split()))",
"-a = sorted(list(enumerate(a)), key=lambda x: x[1])",
"-l = 1",
"-while l < 2 * (n + 2) - 1:",
"- l *= 2",
"-l -= 1",
"-seg = [True] * l",
"-seg[0] = False",
"+def main():",
"+ n = int(eval(input()))",
"+ a = list(map... | false | 0.056347 | 0.196844 | 0.286252 | [
"s268888648",
"s687013582"
] |
u608088992 | p03464 | python | s090826555 | s188829434 | 100 | 91 | 14,076 | 14,252 | Accepted | Accepted | 9 | import sys
def solve():
input = sys.stdin.readline
K = int(eval(input()))
A = [int(a) for a in input().split()]
if A[K-1] != 2: print((-1))
else:
minN, maxN = 2, 3
for i in reversed(list(range(K - 1))):
lb = (minN - 1) // A[i]
hb = maxN // A[i]
... | import sys
def solve():
input = sys.stdin.readline
K = int(eval(input()))
A = [int(a) for a in input().split()]
if A[K-1] != 2: print((-1))
else:
minK, maxK = 2, 3
for i in reversed(list(range(K - 1))):
mod = A[i]
lb, hb = (minK - 1) // mod, maxK /... | 23 | 24 | 573 | 581 | import sys
def solve():
input = sys.stdin.readline
K = int(eval(input()))
A = [int(a) for a in input().split()]
if A[K - 1] != 2:
print((-1))
else:
minN, maxN = 2, 3
for i in reversed(list(range(K - 1))):
lb = (minN - 1) // A[i]
hb = maxN // A[i]
... | import sys
def solve():
input = sys.stdin.readline
K = int(eval(input()))
A = [int(a) for a in input().split()]
if A[K - 1] != 2:
print((-1))
else:
minK, maxK = 2, 3
for i in reversed(list(range(K - 1))):
mod = A[i]
lb, hb = (minK - 1) // mod, maxK /... | false | 4.166667 | [
"- minN, maxN = 2, 3",
"+ minK, maxK = 2, 3",
"- lb = (minN - 1) // A[i]",
"- hb = maxN // A[i]",
"- if lb == hb:",
"+ mod = A[i]",
"+ lb, hb = (minK - 1) // mod, maxK // mod",
"+ if lb >= hb:",
"- minN = ... | false | 0.039394 | 0.084268 | 0.467483 | [
"s090826555",
"s188829434"
] |
u969190727 | p02845 | python | s364679118 | s266120462 | 174 | 160 | 13,964 | 14,396 | Accepted | Accepted | 8.05 | n=int(eval(input()))
A=[int(i) for i in input().split()]
mod=10**9+7
ans=1
B=[0,0,0]
for i in range(n):
ct=0
chk=False
for j in range(3):
if B[j]==A[i]:
ct+=1
if not chk:
B[j]+=1
chk=True
ans=(ans*ct)%mod
print(ans)
| import sys
input=lambda: sys.stdin.readline().rstrip()
n=int(eval(input()))
A=[int(i) for i in input().split()]
ans=1
mod=10**9+7
C=[0,0,0]
for i in range(n):
cur=A[i]
ct=0
Chk=True
for i,c in enumerate(C):
if cur==c:
ct+=1
if Chk:
C[i]+=1
Chk=False
ans=(ans*... | 17 | 21 | 267 | 338 | n = int(eval(input()))
A = [int(i) for i in input().split()]
mod = 10**9 + 7
ans = 1
B = [0, 0, 0]
for i in range(n):
ct = 0
chk = False
for j in range(3):
if B[j] == A[i]:
ct += 1
if not chk:
B[j] += 1
chk = True
ans = (ans * ct) % mod
pri... | import sys
input = lambda: sys.stdin.readline().rstrip()
n = int(eval(input()))
A = [int(i) for i in input().split()]
ans = 1
mod = 10**9 + 7
C = [0, 0, 0]
for i in range(n):
cur = A[i]
ct = 0
Chk = True
for i, c in enumerate(C):
if cur == c:
ct += 1
if Chk:
... | false | 19.047619 | [
"+import sys",
"+",
"+input = lambda: sys.stdin.readline().rstrip()",
"+ans = 1",
"-ans = 1",
"-B = [0, 0, 0]",
"+C = [0, 0, 0]",
"+ cur = A[i]",
"- chk = False",
"- for j in range(3):",
"- if B[j] == A[i]:",
"+ Chk = True",
"+ for i, c in enumerate(C):",
"+ if... | false | 0.062391 | 0.038007 | 1.641565 | [
"s364679118",
"s266120462"
] |
u883621917 | p02678 | python | s631264095 | s398533237 | 323 | 247 | 95,896 | 95,392 | Accepted | Accepted | 23.53 | 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, ... | 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,... | 37 | 37 | 831 | 834 | 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, pr... | 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, dist, prev):
... | false | 0 | [
"- 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)",
"- for n in graph[current]:",
"- if dist[n] != -1:",
"+ for _next i... | false | 0.03534 | 0.035853 | 0.98567 | [
"s631264095",
"s398533237"
] |
u879674287 | p03244 | python | s805745183 | s310290272 | 131 | 121 | 21,140 | 21,140 | Accepted | Accepted | 7.63 | from collections import defaultdict
def main():
n = int(eval(input()))
v = list(map(int, input().split(' ')))
odd = defaultdict(int)
even = defaultdict(int)
odd[0] = 0
even[0] = 0
for i, num in enumerate(v):
# print(i % 2)
if (i % 2) == 0:
e... | from collections import defaultdict
def main():
n = int(eval(input()))
v = list(map(int, input().split(' ')))
odd = defaultdict(int)
even = defaultdict(int)
odd[0] = 0
even[0] = 0
for i, num in enumerate(v):
# print(i % 2)
if (i % 2) == 0:
e... | 34 | 37 | 716 | 825 | from collections import defaultdict
def main():
n = int(eval(input()))
v = list(map(int, input().split(" ")))
odd = defaultdict(int)
even = defaultdict(int)
odd[0] = 0
even[0] = 0
for i, num in enumerate(v):
# print(i % 2)
if (i % 2) == 0:
even[num] += 1
... | from collections import defaultdict
def main():
n = int(eval(input()))
v = list(map(int, input().split(" ")))
odd = defaultdict(int)
even = defaultdict(int)
odd[0] = 0
even[0] = 0
for i, num in enumerate(v):
# print(i % 2)
if (i % 2) == 0:
even[num] += 1
... | false | 8.108108 | [
"- a = sorted(list(even.items()), key=lambda x: x[1], reverse=True)",
"- b = sorted(list(odd.items()), key=lambda x: x[1], reverse=True)",
"- if a[0][0] != b[0][0]:",
"- ans = n - a[0][1] - b[0][1]",
"- else:",
"- ans = n - max(a[0][1] + b[1][1], a[1][1] + b[0][1])",
"- prin... | false | 0.094004 | 0.090397 | 1.039902 | [
"s805745183",
"s310290272"
] |
u340781749 | p03452 | python | s395166167 | s714896428 | 1,473 | 1,272 | 93,544 | 95,956 | Accepted | Accepted | 13.65 | def check(si, xs, checked):
q = [si]
while q:
i = q.pop()
xi = xs[i]
for j, d in links[i]:
if checked[j]:
continue
if j not in xs:
xs[j] = xi + d
elif xi + d != xs[j]:
return False
... | def check(si, xs, checked):
q = {si}
while q:
i = q.pop()
xi = xs[i]
for j, d in links[i]:
if checked[j]:
continue
if j not in xs:
xs[j] = xi + d
elif xi + d != xs[j]:
return False
... | 37 | 37 | 854 | 851 | def check(si, xs, checked):
q = [si]
while q:
i = q.pop()
xi = xs[i]
for j, d in links[i]:
if checked[j]:
continue
if j not in xs:
xs[j] = xi + d
elif xi + d != xs[j]:
return False
q.append(j)... | def check(si, xs, checked):
q = {si}
while q:
i = q.pop()
xi = xs[i]
for j, d in links[i]:
if checked[j]:
continue
if j not in xs:
xs[j] = xi + d
elif xi + d != xs[j]:
return False
q.add(j)
... | false | 0 | [
"- q = [si]",
"+ q = {si}",
"- q.append(j)",
"+ q.add(j)"
] | false | 0.043505 | 0.042849 | 1.015293 | [
"s395166167",
"s714896428"
] |
u218834617 | p02802 | python | s229827143 | s499668344 | 128 | 111 | 29,000 | 25,964 | Accepted | Accepted | 13.28 | import sys
eval(input())
d={}
nc=np=0
for ln in sys.stdin:
p,S=ln.split()
if p not in d:
d[p]=[0,0]
if not d[p][0]:
if S=='AC':
d[p][0]=1
nc+=1
np+=d[p][1]
else:
d[p][1]+=1
print((nc,np))
| import sys
eval(input())
ac,wa={*()},{}
nc=np=0
for ln in sys.stdin:
p,S=ln.split()
if p in ac:
continue
if p not in wa:
wa[p]=0
if S=='AC':
ac.add(p)
nc+=1
np+=wa[p]
else:
wa[p]+=1
print((nc,np))
| 17 | 18 | 281 | 275 | import sys
eval(input())
d = {}
nc = np = 0
for ln in sys.stdin:
p, S = ln.split()
if p not in d:
d[p] = [0, 0]
if not d[p][0]:
if S == "AC":
d[p][0] = 1
nc += 1
np += d[p][1]
else:
d[p][1] += 1
print((nc, np))
| import sys
eval(input())
ac, wa = {*()}, {}
nc = np = 0
for ln in sys.stdin:
p, S = ln.split()
if p in ac:
continue
if p not in wa:
wa[p] = 0
if S == "AC":
ac.add(p)
nc += 1
np += wa[p]
else:
wa[p] += 1
print((nc, np))
| false | 5.555556 | [
"-d = {}",
"+ac, wa = {*()}, {}",
"- if p not in d:",
"- d[p] = [0, 0]",
"- if not d[p][0]:",
"- if S == \"AC\":",
"- d[p][0] = 1",
"- nc += 1",
"- np += d[p][1]",
"- else:",
"- d[p][1] += 1",
"+ if p in ac:",
"+ ... | false | 0.046327 | 0.046367 | 0.999123 | [
"s229827143",
"s499668344"
] |
u279955105 | p02390 | python | s171217060 | s623232564 | 50 | 30 | 7,660 | 7,660 | Accepted | Accepted | 40 | t = int(eval(input()))
h = t//3600
m = int(t%3600/60)
s = int(t%3600%60)
print((str(h) + ":" + str(m) + ":" + str(s))) | t = int(eval(input()))
a = int(t / 3600)
b = int(t % 3600 / 60)
c = int(t % 3600 % 60)
print((str(a)+':'+str(b)+':'+str(c))) | 5 | 5 | 114 | 120 | t = int(eval(input()))
h = t // 3600
m = int(t % 3600 / 60)
s = int(t % 3600 % 60)
print((str(h) + ":" + str(m) + ":" + str(s)))
| t = int(eval(input()))
a = int(t / 3600)
b = int(t % 3600 / 60)
c = int(t % 3600 % 60)
print((str(a) + ":" + str(b) + ":" + str(c)))
| false | 0 | [
"-h = t // 3600",
"-m = int(t % 3600 / 60)",
"-s = int(t % 3600 % 60)",
"-print((str(h) + \":\" + str(m) + \":\" + str(s)))",
"+a = int(t / 3600)",
"+b = int(t % 3600 / 60)",
"+c = int(t % 3600 % 60)",
"+print((str(a) + \":\" + str(b) + \":\" + str(c)))"
] | false | 0.071031 | 0.040131 | 1.769975 | [
"s171217060",
"s623232564"
] |
u411203878 | p03607 | python | s667103246 | s144484169 | 517 | 188 | 50,264 | 86,588 | Accepted | Accepted | 63.64 | n=int(eval(input()))
ab = []
for _ in range(n):
a= int(eval(input()))
ab.append(a)
ab.sort()
memo = 1
ans = 0
for i in range(n):
if i == n-1:
ans += memo%2
elif ab[i] == ab[i+1]:
memo += 1
else:
ans += memo%2
memo = 1
print(ans) | N = int(eval(input()))
memo = {}
for i in range(N):
s = int(eval(input()))
if s in memo:
memo[s] += 1
else:
memo[s] = 1
ans = 0
for key, val in list(memo.items()):
if val%2:
ans += 1
print(ans) | 18 | 13 | 286 | 227 | n = int(eval(input()))
ab = []
for _ in range(n):
a = int(eval(input()))
ab.append(a)
ab.sort()
memo = 1
ans = 0
for i in range(n):
if i == n - 1:
ans += memo % 2
elif ab[i] == ab[i + 1]:
memo += 1
else:
ans += memo % 2
memo = 1
print(ans)
| N = int(eval(input()))
memo = {}
for i in range(N):
s = int(eval(input()))
if s in memo:
memo[s] += 1
else:
memo[s] = 1
ans = 0
for key, val in list(memo.items()):
if val % 2:
ans += 1
print(ans)
| false | 27.777778 | [
"-n = int(eval(input()))",
"-ab = []",
"-for _ in range(n):",
"- a = int(eval(input()))",
"- ab.append(a)",
"-ab.sort()",
"-memo = 1",
"+N = int(eval(input()))",
"+memo = {}",
"+for i in range(N):",
"+ s = int(eval(input()))",
"+ if s in memo:",
"+ memo[s] += 1",
"+ e... | false | 0.059058 | 0.077876 | 0.75835 | [
"s667103246",
"s144484169"
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.