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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
u938486382 | p02898 | python | s154331302 | s241100673 | 49 | 45 | 11,908 | 11,912 | Accepted | Accepted | 8.16 | n, k = list(map(int, input().split(' ')))
talls = list(map(int, input().split(' ')))
ans = 0
for t in talls:
if t >= k:
ans += 1
print(ans)
| n, k = list(map(int, input().split(' ')))
print((sum([tall >= k for tall in list(map(int, input().split(' ')))]))) | 7 | 2 | 152 | 113 | n, k = list(map(int, input().split(" ")))
talls = list(map(int, input().split(" ")))
ans = 0
for t in talls:
if t >= k:
ans += 1
print(ans)
| n, k = list(map(int, input().split(" ")))
print((sum([tall >= k for tall in list(map(int, input().split(" ")))])))
| false | 71.428571 | [
"-talls = list(map(int, input().split(\" \")))",
"-ans = 0",
"-for t in talls:",
"- if t >= k:",
"- ans += 1",
"-print(ans)",
"+print((sum([tall >= k for tall in list(map(int, input().split(\" \")))])))"
] | false | 0.047196 | 0.04713 | 1.001406 | [
"s154331302",
"s241100673"
] |
u977389981 | p03323 | python | s055373075 | s710270800 | 19 | 17 | 3,316 | 2,940 | Accepted | Accepted | 10.53 | A = [int(i) for i in input().split()]
if max(A) <= 8:
print('Yay!')
else:
print(':(') | A, B = list(map(int, input().split()))
print(('Yay!' if A <= 8 and B <= 8 else ':(')) | 5 | 2 | 97 | 78 | A = [int(i) for i in input().split()]
if max(A) <= 8:
print("Yay!")
else:
print(":(")
| A, B = list(map(int, input().split()))
print(("Yay!" if A <= 8 and B <= 8 else ":("))
| false | 60 | [
"-A = [int(i) for i in input().split()]",
"-if max(A) <= 8:",
"- print(\"Yay!\")",
"-else:",
"- print(\":(\")",
"+A, B = list(map(int, input().split()))",
"+print((\"Yay!\" if A <= 8 and B <= 8 else \":(\"))"
] | false | 0.050239 | 0.068634 | 0.731986 | [
"s055373075",
"s710270800"
] |
u002459665 | p03687 | python | s022134999 | s208326415 | 221 | 62 | 3,444 | 3,444 | Accepted | Accepted | 71.95 | S = eval(input())
N = len(S)
from collections import Counter
chars = [chr(i) for i in range(ord('a'), ord('z')+1)]
def check(arr):
e = arr[0]
return len(arr) == arr.count(e)
ans = float('inf')
for c in chars:
SL = list(S)
cnt = 0
while not check(SL):
for i, si in enumerat... | S = eval(input())
N = len(S)
from collections import Counter
chars = [chr(i) for i in range(ord('a'), ord('z')+1)]
def check(arr):
e = arr[0]
return len(arr) == arr.count(e)
ans = float('inf')
for c in chars:
cnt = 0
t = S
while not check(t):
u = ''
for i in rang... | 27 | 27 | 524 | 510 | S = eval(input())
N = len(S)
from collections import Counter
chars = [chr(i) for i in range(ord("a"), ord("z") + 1)]
def check(arr):
e = arr[0]
return len(arr) == arr.count(e)
ans = float("inf")
for c in chars:
SL = list(S)
cnt = 0
while not check(SL):
for i, si in enumerate(SL):
... | S = eval(input())
N = len(S)
from collections import Counter
chars = [chr(i) for i in range(ord("a"), ord("z") + 1)]
def check(arr):
e = arr[0]
return len(arr) == arr.count(e)
ans = float("inf")
for c in chars:
cnt = 0
t = S
while not check(t):
u = ""
for i in range(len(t) - 1):... | false | 0 | [
"- SL = list(S)",
"- while not check(SL):",
"- for i, si in enumerate(SL):",
"- if i == 0:",
"- continue",
"- if si == c:",
"- SL[i - 1] = c",
"- SL = SL[:-1]",
"+ t = S",
"+ while not check(t):",
"+ u = \"\"",
... | false | 0.040824 | 0.036397 | 1.121635 | [
"s022134999",
"s208326415"
] |
u826637752 | p02552 | python | s815518632 | s571672397 | 31 | 26 | 9,144 | 9,064 | Accepted | Accepted | 16.13 | x = int(eval(input()))
if x ==1:
print((0))
else:
print((1)) | n = int(eval(input()))
print((1-n)) | 5 | 3 | 58 | 32 | x = int(eval(input()))
if x == 1:
print((0))
else:
print((1))
| n = int(eval(input()))
print((1 - n))
| false | 40 | [
"-x = int(eval(input()))",
"-if x == 1:",
"- print((0))",
"-else:",
"- print((1))",
"+n = int(eval(input()))",
"+print((1 - n))"
] | false | 0.043494 | 0.118146 | 0.368136 | [
"s815518632",
"s571672397"
] |
u191874006 | p04013 | python | s396366675 | s527479838 | 220 | 27 | 5,232 | 3,572 | Accepted | Accepted | 87.73 | #復習用
N, A = list(map(int, input().split()))
X = list([int(x) - A for x in input().split()])
maxn = max(max(X), A)
dp = [[0 for _ in range(2 * N * maxn + 1)] for _ in range(N + 1)]
dp[0][N * maxn] = 1
for i in range(N):
for k in range(2 * N * maxn + 1):
dp[i + 1][k] = dp[i][k]
if 0 <= k -... | #!/usr/bin/env python3
#ABC44 C
import sys
import math
import bisect
from heapq import heappush, heappop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
mod = 10**9 + 7
n,a = list(map(int, ... | 13 | 24 | 414 | 516 | # 復習用
N, A = list(map(int, input().split()))
X = list([int(x) - A for x in input().split()])
maxn = max(max(X), A)
dp = [[0 for _ in range(2 * N * maxn + 1)] for _ in range(N + 1)]
dp[0][N * maxn] = 1
for i in range(N):
for k in range(2 * N * maxn + 1):
dp[i + 1][k] = dp[i][k]
if 0 <= k - X[i] < 2 *... | #!/usr/bin/env python3
# ABC44 C
import sys
import math
import bisect
from heapq import heappush, heappop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
mod = 10**9 + 7
n, a = list(map(int, input().split... | false | 45.833333 | [
"-# 復習用",
"-N, A = list(map(int, input().split()))",
"-X = list([int(x) - A for x in input().split()])",
"-maxn = max(max(X), A)",
"-dp = [[0 for _ in range(2 * N * maxn + 1)] for _ in range(N + 1)]",
"-dp[0][N * maxn] = 1",
"-for i in range(N):",
"- for k in range(2 * N * maxn + 1):",
"- ... | false | 0.046118 | 0.037647 | 1.224994 | [
"s396366675",
"s527479838"
] |
u670567845 | p02594 | python | s905789835 | s124937135 | 74 | 27 | 61,632 | 9,052 | Accepted | Accepted | 63.51 | X = int(eval(input()))
if (X >= 30):
print("Yes")
else:
print("No") | x=int(eval(input()))
if x >= 30:
print("Yes")
else:
print("No") | 5 | 5 | 69 | 65 | X = int(eval(input()))
if X >= 30:
print("Yes")
else:
print("No")
| x = int(eval(input()))
if x >= 30:
print("Yes")
else:
print("No")
| false | 0 | [
"-X = int(eval(input()))",
"-if X >= 30:",
"+x = int(eval(input()))",
"+if x >= 30:"
] | false | 0.053626 | 0.034955 | 1.53411 | [
"s905789835",
"s124937135"
] |
u716530146 | p02781 | python | s823024890 | s428542616 | 169 | 18 | 38,256 | 3,064 | Accepted | Accepted | 89.35 | #!/usr/bin/env python3
import sys, math, itertools, collections, bisect
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
inf = float('inf') ;mod = 10**9+7
mans = inf ;ans = 0 ;count = 0 ;pro = 1
s=int(eval(input())); n=len(str(s))
k=int(eval(input()))
S=[int(i) for i in str(s)]
dpl=[[0]*(k... | s=int(eval(input()))
n=len(str(s))
k=int(eval(input()))
S=[int(i) for i in str(s)]
dpl=[[0]*(k+1) for i in range(n+1)]
dpj=[[0]*(k+1) for i in range(n+1)]
dpj[0][0]=1
for i in range(n):
for j in range(k+1):
dpj[i+1][j]+=dpj[i][j]*(S[i]==0)
dpl[i+1][j]+=dpl[i][j]+dpj[i][j]*(S[i]>0)
... | 23 | 15 | 731 | 456 | #!/usr/bin/env python3
import sys, math, itertools, collections, bisect
input = lambda: sys.stdin.buffer.readline().rstrip().decode("utf-8")
inf = float("inf")
mod = 10**9 + 7
mans = inf
ans = 0
count = 0
pro = 1
s = int(eval(input()))
n = len(str(s))
k = int(eval(input()))
S = [int(i) for i in str(s)]
dpl = [[0] * (k... | s = int(eval(input()))
n = len(str(s))
k = int(eval(input()))
S = [int(i) for i in str(s)]
dpl = [[0] * (k + 1) for i in range(n + 1)]
dpj = [[0] * (k + 1) for i in range(n + 1)]
dpj[0][0] = 1
for i in range(n):
for j in range(k + 1):
dpj[i + 1][j] += dpj[i][j] * (S[i] == 0)
dpl[i + 1][j] += dpl[i][... | false | 34.782609 | [
"-#!/usr/bin/env python3",
"-import sys, math, itertools, collections, bisect",
"-",
"-input = lambda: sys.stdin.buffer.readline().rstrip().decode(\"utf-8\")",
"-inf = float(\"inf\")",
"-mod = 10**9 + 7",
"-mans = inf",
"-ans = 0",
"-count = 0",
"-pro = 1",
"- dpl[i + 1][j] += dpl[i][j] +... | false | 0.039591 | 0.039473 | 1.002979 | [
"s823024890",
"s428542616"
] |
u780342333 | p02383 | python | s892387981 | s502339716 | 30 | 20 | 7,780 | 5,588 | Accepted | Accepted | 33.33 | class Dice:
def __init__(self):
self.faces=[]
def rotate(self, direction):
tmp = self.faces.copy()
if direction =="N":
self.faces[5-1] = tmp[1-1]
self.faces[1-1] = tmp[2-1]
self.faces[2-1] = tmp[6-1]
self.faces[6-1] = tmp[5-1]
... | def roll(l, command):
'''
return rolled list
l : string list
command: string
'''
res = []
i = -1
if command =='N':
res = [l[i+2], l[i+6], l[i+3], l[i+4], l[i+1], l[i+5]]
if command =='S':
res = [l[i+5], l[i+1], l[i+3], l[i+4], l[i+6], l[i+2]]
if comm... | 37 | 28 | 1,056 | 636 | class Dice:
def __init__(self):
self.faces = []
def rotate(self, direction):
tmp = self.faces.copy()
if direction == "N":
self.faces[5 - 1] = tmp[1 - 1]
self.faces[1 - 1] = tmp[2 - 1]
self.faces[2 - 1] = tmp[6 - 1]
self.faces[6 - 1] = tmp[... | def roll(l, command):
"""
return rolled list
l : string list
command: string
"""
res = []
i = -1
if command == "N":
res = [l[i + 2], l[i + 6], l[i + 3], l[i + 4], l[i + 1], l[i + 5]]
if command == "S":
res = [l[i + 5], l[i + 1], l[i + 3], l[i + 4], l[i + 6], l[i + 2]]... | false | 24.324324 | [
"-class Dice:",
"- def __init__(self):",
"- self.faces = []",
"-",
"- def rotate(self, direction):",
"- tmp = self.faces.copy()",
"- if direction == \"N\":",
"- self.faces[5 - 1] = tmp[1 - 1]",
"- self.faces[1 - 1] = tmp[2 - 1]",
"- self.... | false | 0.042524 | 0.043574 | 0.975901 | [
"s892387981",
"s502339716"
] |
u077291787 | p02771 | python | s326172728 | s796128277 | 21 | 17 | 3,316 | 2,940 | Accepted | Accepted | 19.05 | # A - Poor
def main():
A, B, C = list(map(int, input().split()))
is_poor = (A == B and A != C) or (A == C and A != B) or (B == C and A != B)
print(("Yes" if is_poor else "No"))
if __name__ == "__main__":
main()
| # A - Poor
def main():
A, B, C = list(map(int, input().split()))
is_poor = A == B != C or A == C != B or B == C != A
print(("Yes" if is_poor else "No"))
if __name__ == "__main__":
main()
| 9 | 9 | 229 | 205 | # A - Poor
def main():
A, B, C = list(map(int, input().split()))
is_poor = (A == B and A != C) or (A == C and A != B) or (B == C and A != B)
print(("Yes" if is_poor else "No"))
if __name__ == "__main__":
main()
| # A - Poor
def main():
A, B, C = list(map(int, input().split()))
is_poor = A == B != C or A == C != B or B == C != A
print(("Yes" if is_poor else "No"))
if __name__ == "__main__":
main()
| false | 0 | [
"- is_poor = (A == B and A != C) or (A == C and A != B) or (B == C and A != B)",
"+ is_poor = A == B != C or A == C != B or B == C != A"
] | false | 0.045432 | 0.047144 | 0.963691 | [
"s326172728",
"s796128277"
] |
u077291787 | p02678 | python | s386071494 | s555550645 | 385 | 257 | 56,528 | 56,548 | Accepted | Accepted | 33.25 | # D - .. (Double Dots)
from collections import deque
def main():
N, M, *AB = list(map(int, open(0).read().split()))
graph = [[] for _ in range(N + 1)]
for a, b in zip(*[iter(AB)] * 2):
graph[a].append(b)
graph[b].append(a)
# bfs
depth = [1 << 30] * (N + 1)
depth... | # D - .. (Double Dots)
from collections import deque
def main():
N, M, *AB = list(map(int, open(0).read().split()))
graph = [[] for _ in range(N + 1)]
for a, b in zip(*[iter(AB)] * 2):
graph[a].append(b)
graph[b].append(a)
# bfs
queue = deque([1])
signposts = [0... | 39 | 32 | 976 | 703 | # D - .. (Double Dots)
from collections import deque
def main():
N, M, *AB = list(map(int, open(0).read().split()))
graph = [[] for _ in range(N + 1)]
for a, b in zip(*[iter(AB)] * 2):
graph[a].append(b)
graph[b].append(a)
# bfs
depth = [1 << 30] * (N + 1)
depth[1] = 0
queu... | # D - .. (Double Dots)
from collections import deque
def main():
N, M, *AB = list(map(int, open(0).read().split()))
graph = [[] for _ in range(N + 1)]
for a, b in zip(*[iter(AB)] * 2):
graph[a].append(b)
graph[b].append(a)
# bfs
queue = deque([1])
signposts = [0] * (N + 1)
... | false | 17.948718 | [
"- depth = [1 << 30] * (N + 1)",
"- depth[1] = 0",
"- queue = deque([(1, 0)])",
"+ queue = deque([1])",
"+ signposts = [0] * (N + 1)",
"+ signposts[1] = 1",
"- u, cur_depth = queue.popleft()",
"- next_depth = cur_depth + 1",
"+ u = queue.popleft()",
"- ... | false | 0.158987 | 0.048051 | 3.308754 | [
"s386071494",
"s555550645"
] |
u706330549 | p02552 | python | s791827070 | s179500650 | 30 | 26 | 9,136 | 9,028 | Accepted | Accepted | 13.33 | x = int(eval(input()))
if x == 1:
print("0")
else:
print("1")
| x = int(eval(input()))
print((x^1)) | 7 | 2 | 75 | 28 | x = int(eval(input()))
if x == 1:
print("0")
else:
print("1")
| x = int(eval(input()))
print((x ^ 1))
| false | 71.428571 | [
"-if x == 1:",
"- print(\"0\")",
"-else:",
"- print(\"1\")",
"+print((x ^ 1))"
] | false | 0.035754 | 0.040993 | 0.872217 | [
"s791827070",
"s179500650"
] |
u724687935 | p02721 | python | s430881623 | s868676580 | 818 | 750 | 191,068 | 191,072 | Accepted | Accepted | 8.31 | import sys
sys.setrecursionlimit(10 ** 6)
def dfs(n, rest):
global C, N
rst = 0
if maxR[n] > 0:
rst = maxR[n]
elif rest >= C and S[n] == 'o':
rst += 1
if n + (C + 1) < N:
rst += dfs(n + C + 1, C)
else:
if n + 1 < N:
rst += dfs(... | import sys
sys.setrecursionlimit(10 ** 6)
def dfs(n, rest):
global C, N
rst = 0
if maxR[n] > 0:
rst = maxR[n]
elif rest >= C and S[n] == 'o':
rst += 1
if n + (C + 1) < N:
rst += dfs(n + C + 1, C)
else:
if n + 1 < N:
rst += dfs(... | 68 | 68 | 1,414 | 1,402 | import sys
sys.setrecursionlimit(10**6)
def dfs(n, rest):
global C, N
rst = 0
if maxR[n] > 0:
rst = maxR[n]
elif rest >= C and S[n] == "o":
rst += 1
if n + (C + 1) < N:
rst += dfs(n + C + 1, C)
else:
if n + 1 < N:
rst += dfs(n + 1, rest + 1)... | import sys
sys.setrecursionlimit(10**6)
def dfs(n, rest):
global C, N
rst = 0
if maxR[n] > 0:
rst = maxR[n]
elif rest >= C and S[n] == "o":
rst += 1
if n + (C + 1) < N:
rst += dfs(n + C + 1, C)
else:
if n + 1 < N:
rst += dfs(n + 1, rest + 1)... | false | 0 | [
"- if S[i] == \"o\" and maxR[i] == -1:",
"+ if maxR[i] == -1:",
"-if maxR[-1] == -1:",
"- maxR[-1] = 0",
"-for i in range(N - 2, -1, -1):",
"- if maxR[i] == -1:",
"- maxR[i] = maxR[i + 1]",
"+# if maxR[-1] == -1:",
"+# maxR[-1] = 0",
"+# for i in range(N - 2, -1, -1):",
"+... | false | 0.1175 | 0.040049 | 2.933873 | [
"s430881623",
"s868676580"
] |
u729133443 | p02904 | python | s569146160 | s998301665 | 1,651 | 621 | 29,212 | 121,148 | Accepted | Accepted | 62.39 | class SWAG():
def __init__(self,unit,f):
self.fold_r=[unit]
self.fold_l=[unit]
self.data_r=[]
self.data_l=[]
self.f=f
def __refill_right(self):
temp=[]
n=len(self.data_l)
for _ in range(n//2):
temp.append(self.popleft())
... | class SWAG():
def __init__(self,unit,f):
self.fold_r=[unit]
self.fold_l=[unit]
self.data_r=[]
self.data_l=[]
self.f=f
def __refill_right(self):
temp=[]
n=len(self.data_l)
for _ in range(n//2):
temp.append(self.popleft())
... | 60 | 60 | 1,838 | 1,812 | class SWAG:
def __init__(self, unit, f):
self.fold_r = [unit]
self.fold_l = [unit]
self.data_r = []
self.data_l = []
self.f = f
def __refill_right(self):
temp = []
n = len(self.data_l)
for _ in range(n // 2):
temp.append(self.popleft()... | class SWAG:
def __init__(self, unit, f):
self.fold_r = [unit]
self.fold_l = [unit]
self.data_r = []
self.data_l = []
self.f = f
def __refill_right(self):
temp = []
n = len(self.data_l)
for _ in range(n // 2):
temp.append(self.popleft()... | false | 0 | [
"- for t in temp[::-1]:",
"- self.appendleft(t)",
"+ for _ in range(n // 2):",
"+ self.appendleft(temp.pop())",
"- for t in temp[::-1]:",
"- self.append(t)",
"+ for _ in range(n // 2):",
"+ self.append(temp.pop())",
"-s_min = SW... | false | 0.036061 | 0.042058 | 0.857413 | [
"s569146160",
"s998301665"
] |
u895515293 | p02955 | python | s155659007 | s142359154 | 814 | 484 | 3,188 | 3,192 | Accepted | Accepted | 40.54 | import sys
import math
import heapq
sys.setrecursionlimit(10**7)
INTMAX = 9223372036854775807
INTMIN = -9223372036854775808
DVSR = 1000000007
def POW(x, y): return pow(x, y, DVSR)
def INV(x, m=DVSR): return pow(x, m - 2, m)
def DIV(x, y, m=DVSR): return (x * INV(y, m)) % m
def LI(): return [int(x) for x in in... | import sys
import math
import heapq
sys.setrecursionlimit(10**7)
INTMAX = 9223372036854775807
INTMIN = -9223372036854775808
DVSR = 1000000007
def POW(x, y): return pow(x, y, DVSR)
def INV(x, m=DVSR): return pow(x, m - 2, m)
def DIV(x, y, m=DVSR): return (x * INV(y, m)) % m
def LI(): return [int(x) for x in in... | 62 | 61 | 1,428 | 1,349 | import sys
import math
import heapq
sys.setrecursionlimit(10**7)
INTMAX = 9223372036854775807
INTMIN = -9223372036854775808
DVSR = 1000000007
def POW(x, y):
return pow(x, y, DVSR)
def INV(x, m=DVSR):
return pow(x, m - 2, m)
def DIV(x, y, m=DVSR):
return (x * INV(y, m)) % m
def LI():
return [int... | import sys
import math
import heapq
sys.setrecursionlimit(10**7)
INTMAX = 9223372036854775807
INTMIN = -9223372036854775808
DVSR = 1000000007
def POW(x, y):
return pow(x, y, DVSR)
def INV(x, m=DVSR):
return pow(x, m - 2, m)
def DIV(x, y, m=DVSR):
return (x * INV(y, m)) % m
def LI():
return [int... | false | 1.612903 | [
"-# DIVS.sort(reversed=True)",
"-ACC = [0] * N",
"-# res = 0",
"-for div in sorted(DIVS, reverse=True):",
"+res = 0",
"+for div in DIVS:",
"- ACC[0] = DIFF[0]",
"- for i in range(1, N):",
"- ACC[i] = ACC[i - 1] + DIFF[i]",
"- # print(ACC)",
"- for i in range(N - 1):",
"- ... | false | 0.0425 | 0.050557 | 0.840634 | [
"s155659007",
"s142359154"
] |
u170324846 | p02762 | python | s524899738 | s881978835 | 1,796 | 1,587 | 125,856 | 112,544 | Accepted | Accepted | 11.64 | class UnionFind():
def __init__(self, n):
self.n = n
self.parents = [-1] * n
def find(self, x):
if self.parents[x] < 0:
return x
else:
self.parents[x] = self.find(self.parents[x])
return self.parents[x]
def union(self, x, y):
... | class UnionFind():
def __init__(self, n):
self.n = n
self.parents = [-1] * n
def find(self, x):
if self.parents[x] < 0:
return x
else:
self.parents[x] = self.find(self.parents[x])
return self.parents[x]
def union(self, x, y):
... | 57 | 54 | 1,329 | 1,238 | class UnionFind:
def __init__(self, n):
self.n = n
self.parents = [-1] * n
def find(self, x):
if self.parents[x] < 0:
return x
else:
self.parents[x] = self.find(self.parents[x])
return self.parents[x]
def union(self, x, y):
x = se... | class UnionFind:
def __init__(self, n):
self.n = n
self.parents = [-1] * n
def find(self, x):
if self.parents[x] < 0:
return x
else:
self.parents[x] = self.find(self.parents[x])
return self.parents[x]
def union(self, x, y):
x = se... | false | 5.263158 | [
"-Friend = [[] for i in range(N)]",
"- Friend[A - 1].append(B - 1)",
"- Friend[B - 1].append(A - 1)"
] | false | 0.048743 | 0.045202 | 1.078342 | [
"s524899738",
"s881978835"
] |
u307516601 | p02725 | python | s931171192 | s712818130 | 170 | 145 | 24,908 | 24,908 | Accepted | Accepted | 14.71 | import sys
sys.setrecursionlimit(10**6)
readline = sys.stdin.readline
k,n = [int(i) for i in readline().split()]
a = [int(i) for i in readline().split()]
a.sort()
d = a[0]+(k-a[n-1])
for i in range(n-1):
d = max(d, a[i+1]-a[i])
print((k-d)) | import sys
sys.setrecursionlimit(10**6)
readline = sys.stdin.readline
k,n = [int(i) for i in readline().split()]
a = [int(i) for i in readline().split()]
a.sort()
a.append(a[0]+k) # 1番目の家とn番目の家の間の距離
d = 0
for i in range(n): # 1番目の家と2番目の家、2番目の家と3番目の家、、、n-1番目の家とn番目の家の間の距離
d = max(d, a[i+1]-a[i]) # 一番離れてい... | 13 | 14 | 257 | 371 | import sys
sys.setrecursionlimit(10**6)
readline = sys.stdin.readline
k, n = [int(i) for i in readline().split()]
a = [int(i) for i in readline().split()]
a.sort()
d = a[0] + (k - a[n - 1])
for i in range(n - 1):
d = max(d, a[i + 1] - a[i])
print((k - d))
| import sys
sys.setrecursionlimit(10**6)
readline = sys.stdin.readline
k, n = [int(i) for i in readline().split()]
a = [int(i) for i in readline().split()]
a.sort()
a.append(a[0] + k) # 1番目の家とn番目の家の間の距離
d = 0
for i in range(n): # 1番目の家と2番目の家、2番目の家と3番目の家、、、n-1番目の家とn番目の家の間の距離
d = max(d, a[i + 1] - a[i]) # 一番離れている家... | false | 7.142857 | [
"-d = a[0] + (k - a[n - 1])",
"-for i in range(n - 1):",
"- d = max(d, a[i + 1] - a[i])",
"-print((k - d))",
"+a.append(a[0] + k) # 1番目の家とn番目の家の間の距離",
"+d = 0",
"+for i in range(n): # 1番目の家と2番目の家、2番目の家と3番目の家、、、n-1番目の家とn番目の家の間の距離",
"+ d = max(d, a[i + 1] - a[i]) # 一番離れている家はどれか",
"+print((k -... | false | 0.04821 | 0.045556 | 1.058246 | [
"s931171192",
"s712818130"
] |
u633068244 | p00512 | python | s837761163 | s255109755 | 40 | 30 | 4,272 | 4,272 | Accepted | Accepted | 25 | l={}
for i in [1]*eval(input()):
a,n=list(map(str,input().split()))
n=int(n)
try:l[a]+=n
except:l[a]=n
for i in sorted(sorted(l.keys()),key=len):print(i,l[i]) | l={}
for i in [1]*eval(input()):
a,n=input().split()
n=int(n)
try:l[a]+=n
except:l[a]=n
for i in sorted(sorted(l.keys()),key=len):print(i,l[i]) | 7 | 7 | 159 | 150 | l = {}
for i in [1] * eval(input()):
a, n = list(map(str, input().split()))
n = int(n)
try:
l[a] += n
except:
l[a] = n
for i in sorted(sorted(l.keys()), key=len):
print(i, l[i])
| l = {}
for i in [1] * eval(input()):
a, n = input().split()
n = int(n)
try:
l[a] += n
except:
l[a] = n
for i in sorted(sorted(l.keys()), key=len):
print(i, l[i])
| false | 0 | [
"- a, n = list(map(str, input().split()))",
"+ a, n = input().split()"
] | false | 0.041933 | 0.009026 | 4.645997 | [
"s837761163",
"s255109755"
] |
u401686269 | p03109 | python | s785848412 | s086305439 | 30 | 24 | 9,136 | 9,080 | Accepted | Accepted | 20 | S=eval(input())
if int(S[:4])<2019:
print('Heisei')
elif int(S[:4])==2019 and int(S[5:7])<4:
print('Heisei')
elif int(S[:4])==2019 and int(S[5:7])==4 and int(S[8:10])<=30:
print('Heisei')
else:
print('TBD') | S=eval(input())
if S<='2019/04/30':
print('Heisei')
else:
print('TBD') | 9 | 5 | 216 | 72 | S = eval(input())
if int(S[:4]) < 2019:
print("Heisei")
elif int(S[:4]) == 2019 and int(S[5:7]) < 4:
print("Heisei")
elif int(S[:4]) == 2019 and int(S[5:7]) == 4 and int(S[8:10]) <= 30:
print("Heisei")
else:
print("TBD")
| S = eval(input())
if S <= "2019/04/30":
print("Heisei")
else:
print("TBD")
| false | 44.444444 | [
"-if int(S[:4]) < 2019:",
"- print(\"Heisei\")",
"-elif int(S[:4]) == 2019 and int(S[5:7]) < 4:",
"- print(\"Heisei\")",
"-elif int(S[:4]) == 2019 and int(S[5:7]) == 4 and int(S[8:10]) <= 30:",
"+if S <= \"2019/04/30\":"
] | false | 0.007562 | 0.040689 | 0.185851 | [
"s785848412",
"s086305439"
] |
u543954314 | p02617 | python | s287668535 | s618621959 | 189 | 162 | 9,216 | 9,216 | Accepted | Accepted | 14.29 | import sys
readline = sys.stdin.readline
readall = sys.stdin.read
ns = lambda: readline().rstrip()
ni = lambda: int(readline().rstrip())
nm = lambda: map(int, readline().split())
nl = lambda: list(map(int, readline().split()))
prn = lambda x: print(*x, sep='\n')
def solve():
n = ni()
a = n
fo... | import sys
readline = sys.stdin.readline
readall = sys.stdin.read
ns = lambda: readline().rstrip()
ni = lambda: int(readline().rstrip())
nm = lambda: map(int, readline().split())
nl = lambda: list(map(int, readline().split()))
prn = lambda x: print(*x, sep='\n')
def solve():
n = ni()
a = n * (n + ... | 23 | 22 | 499 | 496 | import sys
readline = sys.stdin.readline
readall = sys.stdin.read
ns = lambda: readline().rstrip()
ni = lambda: int(readline().rstrip())
nm = lambda: map(int, readline().split())
nl = lambda: list(map(int, readline().split()))
prn = lambda x: print(*x, sep="\n")
def solve():
n = ni()
a = n
for i in range... | import sys
readline = sys.stdin.readline
readall = sys.stdin.read
ns = lambda: readline().rstrip()
ni = lambda: int(readline().rstrip())
nm = lambda: map(int, readline().split())
nl = lambda: list(map(int, readline().split()))
prn = lambda x: print(*x, sep="\n")
def solve():
n = ni()
a = n * (n + 1) * (n + 2... | false | 4.347826 | [
"- a = n",
"+ a = n * (n + 1) * (n + 2) // 6",
"- a += (i + 1) * (n - i)"
] | false | 0.035794 | 0.037018 | 0.966936 | [
"s287668535",
"s618621959"
] |
u141786930 | p02912 | python | s151519736 | s164238258 | 399 | 151 | 72,088 | 14,180 | Accepted | Accepted | 62.16 | import heapq
n, m = list(map(int, input().split()))
a = [-int(x) for x in input().split()]
heapq.heapify(a)
for i in range(m):
l = -heapq.heappop(a)
heapq.heappush(a, -(l//2))
print((-sum(a))) | import heapq
def main():
N, M = list(map(int, input().split()))
A = list(int(x)*-1 for x in input().split())
heapq.heapify(A)
for _ in range(M):
a = (heapq.heappop(A)*-1)//2
heapq.heappush(A,a*-1)
print((sum(A)*-1))
if __name__ == '__main__':
main() | 10 | 14 | 207 | 297 | import heapq
n, m = list(map(int, input().split()))
a = [-int(x) for x in input().split()]
heapq.heapify(a)
for i in range(m):
l = -heapq.heappop(a)
heapq.heappush(a, -(l // 2))
print((-sum(a)))
| import heapq
def main():
N, M = list(map(int, input().split()))
A = list(int(x) * -1 for x in input().split())
heapq.heapify(A)
for _ in range(M):
a = (heapq.heappop(A) * -1) // 2
heapq.heappush(A, a * -1)
print((sum(A) * -1))
if __name__ == "__main__":
main()
| false | 28.571429 | [
"-n, m = list(map(int, input().split()))",
"-a = [-int(x) for x in input().split()]",
"-heapq.heapify(a)",
"-for i in range(m):",
"- l = -heapq.heappop(a)",
"- heapq.heappush(a, -(l // 2))",
"-print((-sum(a)))",
"+",
"+def main():",
"+ N, M = list(map(int, input().split()))",
"+ A = ... | false | 0.038269 | 0.049031 | 0.780504 | [
"s151519736",
"s164238258"
] |
u863442865 | p03682 | python | s614292610 | s842657361 | 1,219 | 971 | 56,868 | 56,892 | Accepted | Accepted | 20.34 | '''
https://atcoder.jp/contests/abc065/tasks/arc076_b
最小全域木を考える際にある頂点について他の頂点への最小コストを
考えて繋げていくのは間違い(全域木になる保証がない)
考えたいのはあくまでも全辺のコスト
今回はxとyでそれぞれソートして隣り合う2点のコストのみを考えれば良い
'''
def main():
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10000000)
from collections import Counter, deque... | def main():
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10000000)
from collections import Counter, deque
#from collections import defaultdict
from itertools import combinations, permutations, accumulate
#from itertools import product
from bisect import bisect_left... | 73 | 65 | 1,829 | 1,639 | """
https://atcoder.jp/contests/abc065/tasks/arc076_b
最小全域木を考える際にある頂点について他の頂点への最小コストを
考えて繋げていくのは間違い(全域木になる保証がない)
考えたいのはあくまでも全辺のコスト
今回はxとyでそれぞれソートして隣り合う2点のコストのみを考えれば良い
"""
def main():
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10000000)
from collections import Counter, deque
# fr... | def main():
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10000000)
from collections import Counter, deque
# from collections import defaultdict
from itertools import combinations, permutations, accumulate
# from itertools import product
from bisect import bisect_left, b... | false | 10.958904 | [
"-\"\"\"",
"-https://atcoder.jp/contests/abc065/tasks/arc076_b",
"-最小全域木を考える際にある頂点について他の頂点への最小コストを",
"-考えて繋げていくのは間違い(全域木になる保証がない)",
"-考えたいのはあくまでも全辺のコスト",
"-今回はxとyでそれぞれソートして隣り合う2点のコストのみを考えれば良い",
"-\"\"\"",
"-",
"-",
"- cost.append(",
"- [abs(x_sort[i][0] - x_sort[i + 1][0]), x_s... | false | 0.046899 | 0.097804 | 0.479517 | [
"s614292610",
"s842657361"
] |
u007465618 | p03163 | python | s958278197 | s258992447 | 661 | 294 | 171,912 | 45,040 | Accepted | Accepted | 55.52 | n, w = list(map(int, input().split()))
wt, v = [], []
for i in range(n):
a, b = list(map(int, input().split()))
wt.append(a)
v.append(b)
dp = [[0 for i in range(w + 1)] for j in range(n + 1)]
for i in range(1, len(wt)+1):
for j in range(w + 1):
if j >= wt[i-1]:
dp[i][j] = m... | n, w = list(map(int, input().split()))
wt, v = [], []
for i in range(n):
a, b = list(map(int, input().split()))
wt.append(a)
v.append(b)
dp = [0 for i in range(w + 1)]
for i in range(len(wt)):
for j in range(w, wt[i]-1, -1):
dp[j] = max(dp[j], v[i] + dp[j - wt[i]])
print((dp[-1]))
| 14 | 11 | 429 | 302 | n, w = list(map(int, input().split()))
wt, v = [], []
for i in range(n):
a, b = list(map(int, input().split()))
wt.append(a)
v.append(b)
dp = [[0 for i in range(w + 1)] for j in range(n + 1)]
for i in range(1, len(wt) + 1):
for j in range(w + 1):
if j >= wt[i - 1]:
dp[i][j] = max(dp[... | n, w = list(map(int, input().split()))
wt, v = [], []
for i in range(n):
a, b = list(map(int, input().split()))
wt.append(a)
v.append(b)
dp = [0 for i in range(w + 1)]
for i in range(len(wt)):
for j in range(w, wt[i] - 1, -1):
dp[j] = max(dp[j], v[i] + dp[j - wt[i]])
print((dp[-1]))
| false | 21.428571 | [
"-dp = [[0 for i in range(w + 1)] for j in range(n + 1)]",
"-for i in range(1, len(wt) + 1):",
"- for j in range(w + 1):",
"- if j >= wt[i - 1]:",
"- dp[i][j] = max(dp[i - 1][j], v[i - 1] + dp[i - 1][j - wt[i - 1]])",
"- else:",
"- dp[i][j] = dp[i - 1][j]",
"-pri... | false | 0.123483 | 0.044937 | 2.747922 | [
"s958278197",
"s258992447"
] |
u690536347 | p03584 | python | s029127877 | s934510040 | 619 | 352 | 22,556 | 22,596 | Accepted | Accepted | 43.13 | N, K = list(map(int, input().split()))
l = [tuple(map(int, input().split())) for _ in range(N)]
cds = [K]
b = 0
for i in range(30)[::-1]:
if K&(1<<i):
cds.append(b + (1<<i) - 1)
b += (1<<i)
ans = 0
for k in cds:
buf = 0
for i, j in l:
if i|k==k:
buf += j
... | import sys
input=sys.stdin.readline
def solve():
N, K = list(map(int, input().split()))
l = [tuple(map(int, input().split())) for _ in range(N)]
candidates = [K]
b = 0
for i in range(30)[::-1]:
if K&(1<<i):
candidates.append(b + (1<<i) - 1)
b += (1<<i)
... | 17 | 26 | 349 | 535 | N, K = list(map(int, input().split()))
l = [tuple(map(int, input().split())) for _ in range(N)]
cds = [K]
b = 0
for i in range(30)[::-1]:
if K & (1 << i):
cds.append(b + (1 << i) - 1)
b += 1 << i
ans = 0
for k in cds:
buf = 0
for i, j in l:
if i | k == k:
buf += j
ans... | import sys
input = sys.stdin.readline
def solve():
N, K = list(map(int, input().split()))
l = [tuple(map(int, input().split())) for _ in range(N)]
candidates = [K]
b = 0
for i in range(30)[::-1]:
if K & (1 << i):
candidates.append(b + (1 << i) - 1)
b += 1 << i
... | false | 34.615385 | [
"-N, K = list(map(int, input().split()))",
"-l = [tuple(map(int, input().split())) for _ in range(N)]",
"-cds = [K]",
"-b = 0",
"-for i in range(30)[::-1]:",
"- if K & (1 << i):",
"- cds.append(b + (1 << i) - 1)",
"- b += 1 << i",
"-ans = 0",
"-for k in cds:",
"- buf = 0",
... | false | 0.040916 | 0.03824 | 1.069993 | [
"s029127877",
"s934510040"
] |
u979552932 | p02642 | python | s640915488 | s254575361 | 795 | 332 | 40,128 | 38,216 | Accepted | Accepted | 58.24 | from sys import stdin
def main():
from collections import defaultdict
input = stdin.readline
n = int(eval(input()))
a = sorted(list(map(int, input().split())))
p = defaultdict(int)
for x in a:
p[x] += 1
f = [True] * (10 ** 6 + 1)
for k, v in list(p.items()):
... | from sys import stdin
def main():
from collections import defaultdict
input = stdin.readline
n = int(eval(input()))
a = sorted(list(map(int, input().split())))
p = defaultdict(int)
for x in a:
p[x] += 1
q = a[-1] + 1
f = [True] * (q)
for k, v in list(p.items())... | 19 | 20 | 465 | 464 | from sys import stdin
def main():
from collections import defaultdict
input = stdin.readline
n = int(eval(input()))
a = sorted(list(map(int, input().split())))
p = defaultdict(int)
for x in a:
p[x] += 1
f = [True] * (10**6 + 1)
for k, v in list(p.items()):
if v > 1:
... | from sys import stdin
def main():
from collections import defaultdict
input = stdin.readline
n = int(eval(input()))
a = sorted(list(map(int, input().split())))
p = defaultdict(int)
for x in a:
p[x] += 1
q = a[-1] + 1
f = [True] * (q)
for k, v in list(p.items()):
if... | false | 5 | [
"- f = [True] * (10**6 + 1)",
"+ q = a[-1] + 1",
"+ f = [True] * (q)",
"- for i in range(k + k, 10**6 + 1, k):",
"+ for i in range(k + k, q, k):"
] | false | 0.098225 | 0.034924 | 2.812556 | [
"s640915488",
"s254575361"
] |
u434208140 | p03206 | python | s662559294 | s014997905 | 20 | 18 | 3,060 | 2,940 | Accepted | Accepted | 10 | a='Christmas'
for i in range (0,25-int(eval(input()))):
a+=' Eve'
print(a) | print(('Christmas'+(25-int(eval(input())))*' Eve')) | 4 | 1 | 73 | 43 | a = "Christmas"
for i in range(0, 25 - int(eval(input()))):
a += " Eve"
print(a)
| print(("Christmas" + (25 - int(eval(input()))) * " Eve"))
| false | 75 | [
"-a = \"Christmas\"",
"-for i in range(0, 25 - int(eval(input()))):",
"- a += \" Eve\"",
"-print(a)",
"+print((\"Christmas\" + (25 - int(eval(input()))) * \" Eve\"))"
] | false | 0.042882 | 0.041642 | 1.029789 | [
"s662559294",
"s014997905"
] |
u845937249 | p03227 | python | s757297721 | s776212632 | 181 | 162 | 38,384 | 38,384 | Accepted | Accepted | 10.5 | S=eval(input())
if len(S)==2:
print(S)
else:
print((''.join(list(reversed(S)))))
| s = eval(input())
if len(s)==2:
print(s)
else:
s = list(s)
s.reverse()
print(("".join(s))) | 6 | 8 | 87 | 94 | S = eval(input())
if len(S) == 2:
print(S)
else:
print(("".join(list(reversed(S)))))
| s = eval(input())
if len(s) == 2:
print(s)
else:
s = list(s)
s.reverse()
print(("".join(s)))
| false | 25 | [
"-S = eval(input())",
"-if len(S) == 2:",
"- print(S)",
"+s = eval(input())",
"+if len(s) == 2:",
"+ print(s)",
"- print((\"\".join(list(reversed(S)))))",
"+ s = list(s)",
"+ s.reverse()",
"+ print((\"\".join(s)))"
] | false | 0.046257 | 0.047561 | 0.972579 | [
"s757297721",
"s776212632"
] |
u617002802 | p02713 | python | s533569419 | s761755843 | 505 | 141 | 67,608 | 68,152 | Accepted | Accepted | 72.08 | from math import gcd
n = int(eval(input()))
ans = 0
for i in range(1, n + 1):
for j in range(1, n + 1):
for k in range(1, n + 1):
ans += gcd(gcd(i, j), k)
print(ans)
| from math import gcd
n = int(eval(input()))
ans = 0
for i in range(1, n + 1):
for j in range(i, n + 1):
for k in range(j, n + 1):
if i == j == k:
ans += gcd(gcd(i, j), k)
elif i == j or i == k or j == k:
ans += gcd(gcd(i, j), k) * 3
... | 9 | 14 | 193 | 383 | from math import gcd
n = int(eval(input()))
ans = 0
for i in range(1, n + 1):
for j in range(1, n + 1):
for k in range(1, n + 1):
ans += gcd(gcd(i, j), k)
print(ans)
| from math import gcd
n = int(eval(input()))
ans = 0
for i in range(1, n + 1):
for j in range(i, n + 1):
for k in range(j, n + 1):
if i == j == k:
ans += gcd(gcd(i, j), k)
elif i == j or i == k or j == k:
ans += gcd(gcd(i, j), k) * 3
else:
... | false | 35.714286 | [
"- for j in range(1, n + 1):",
"- for k in range(1, n + 1):",
"- ans += gcd(gcd(i, j), k)",
"+ for j in range(i, n + 1):",
"+ for k in range(j, n + 1):",
"+ if i == j == k:",
"+ ans += gcd(gcd(i, j), k)",
"+ elif i == j or i == k or j... | false | 0.047965 | 0.175101 | 0.27393 | [
"s533569419",
"s761755843"
] |
u347600233 | p02819 | python | s277963718 | s995620101 | 259 | 26 | 9,420 | 9,356 | Accepted | Accepted | 89.96 | def is_prime(n):
if n == 1:
return False
return all(n % i != 0 for i in range(2, int(n**0.5) + 1))
x = int(eval(input()))
print((min(i for i in range(x, 100004) if is_prime(i)))) | def is_prime(n):
if n == 1:
return False
return all(n % i != 0 for i in range(2, int(n**0.5) + 1))
x = int(eval(input()))
while not is_prime(x):
x += 1
print(x) | 7 | 9 | 193 | 183 | def is_prime(n):
if n == 1:
return False
return all(n % i != 0 for i in range(2, int(n**0.5) + 1))
x = int(eval(input()))
print((min(i for i in range(x, 100004) if is_prime(i))))
| def is_prime(n):
if n == 1:
return False
return all(n % i != 0 for i in range(2, int(n**0.5) + 1))
x = int(eval(input()))
while not is_prime(x):
x += 1
print(x)
| false | 22.222222 | [
"-print((min(i for i in range(x, 100004) if is_prime(i))))",
"+while not is_prime(x):",
"+ x += 1",
"+print(x)"
] | false | 0.511415 | 0.03165 | 16.158472 | [
"s277963718",
"s995620101"
] |
u431624930 | p03455 | python | s910436128 | s468064606 | 26 | 24 | 8,992 | 9,088 | Accepted | Accepted | 7.69 | a, b = list(map(int, input().split()))
if(a*b%2 == 0):
print('Even')
else:
print('Odd') | a, b = list(map(int, input().split()))
if(a%2 == 0):
print('Even')
elif(b%2 == 0):
print('Even')
else:
print('Odd') | 5 | 7 | 89 | 121 | a, b = list(map(int, input().split()))
if a * b % 2 == 0:
print("Even")
else:
print("Odd")
| a, b = list(map(int, input().split()))
if a % 2 == 0:
print("Even")
elif b % 2 == 0:
print("Even")
else:
print("Odd")
| false | 28.571429 | [
"-if a * b % 2 == 0:",
"+if a % 2 == 0:",
"+ print(\"Even\")",
"+elif b % 2 == 0:"
] | false | 0.033817 | 0.044069 | 0.767367 | [
"s910436128",
"s468064606"
] |
u704284486 | p02734 | python | s862098543 | s928558182 | 1,736 | 305 | 3,316 | 13,748 | Accepted | Accepted | 82.43 | from sys import stdin
mod = 998244353
def main():
N,S = list(map(int,stdin.readline().split()))
a = list(map(int,stdin.readline().split()))
dp = [0]*(S+1)
ans = 0
for A in a:
dp[0] += 1
for i in reversed(list(range(A,S+1))):
dp[i] += dp[i-A]
dp[... | from sys import stdin
mod = 998244353
def solveAsPolynomial():
import numpy as np
N,S = list(map(int,stdin.readline().split()))
a = list(map(int,stdin.readline().split()))
ans = 0
f = np.zeros(S+1,np.int64)#f[k] := ある多項式のx**kの係数
for A in a:
#f = (f+1)(1+x**A)として更新していく
f... | 17 | 22 | 416 | 595 | from sys import stdin
mod = 998244353
def main():
N, S = list(map(int, stdin.readline().split()))
a = list(map(int, stdin.readline().split()))
dp = [0] * (S + 1)
ans = 0
for A in a:
dp[0] += 1
for i in reversed(list(range(A, S + 1))):
dp[i] += dp[i - A]
dp[... | from sys import stdin
mod = 998244353
def solveAsPolynomial():
import numpy as np
N, S = list(map(int, stdin.readline().split()))
a = list(map(int, stdin.readline().split()))
ans = 0
f = np.zeros(S + 1, np.int64) # f[k] := ある多項式のx**kの係数
for A in a:
# f = (f+1)(1+x**A)として更新していく
... | false | 22.727273 | [
"-def main():",
"+def solveAsPolynomial():",
"+ import numpy as np",
"+",
"- dp = [0] * (S + 1)",
"+ f = np.zeros(S + 1, np.int64) # f[k] := ある多項式のx**kの係数",
"- dp[0] += 1",
"- for i in reversed(list(range(A, S + 1))):",
"- dp[i] += dp[i - A]",
"- dp[i]... | false | 0.047713 | 0.55175 | 0.086475 | [
"s862098543",
"s928558182"
] |
u699296734 | p02678 | python | s554471102 | s667720628 | 925 | 661 | 132,348 | 132,024 | Accepted | Accepted | 28.54 | import queue
n,m=list(map(int,input().split()))
road_list=[set() for i in range(n)]
mitisirube=[0]*n
mitisirube[0]=1
for i in range(m):
a,b=list(map(int,input().split()))
road_list[a-1].add(b)
road_list[b-1].add(a)
q = queue.Queue()
counter_set=set()
counter_set.add(1)
for i in road_list[0]:... | import queue
n,m=list(map(int,input().split()))
road_list=[set() for i in range(n)]
mitisirube=[0]*n
mitisirube[0]=1
for i in range(m):
a,b=list(map(int,input().split()))
road_list[a-1].add(b)
road_list[b-1].add(a)
q = queue.Queue()
counter_set=set()
counter_set.add(1)
for i in road_list[0]:... | 34 | 30 | 744 | 679 | import queue
n, m = list(map(int, input().split()))
road_list = [set() for i in range(n)]
mitisirube = [0] * n
mitisirube[0] = 1
for i in range(m):
a, b = list(map(int, input().split()))
road_list[a - 1].add(b)
road_list[b - 1].add(a)
q = queue.Queue()
counter_set = set()
counter_set.add(1)
for i in road_l... | import queue
n, m = list(map(int, input().split()))
road_list = [set() for i in range(n)]
mitisirube = [0] * n
mitisirube[0] = 1
for i in range(m):
a, b = list(map(int, input().split()))
road_list[a - 1].add(b)
road_list[b - 1].add(a)
q = queue.Queue()
counter_set = set()
counter_set.add(1)
for i in road_l... | false | 11.764706 | [
"-if mitisirube.count(0) > 0:",
"- print(\"No\")",
"-else:",
"- print(\"Yes\")",
"- for i in range(1, len(mitisirube)):",
"- print((mitisirube[i]))",
"+print(\"Yes\")",
"+for i in range(1, len(mitisirube)):",
"+ print((mitisirube[i]))"
] | false | 0.051212 | 0.087926 | 0.582439 | [
"s554471102",
"s667720628"
] |
u905203728 | p02850 | python | s989492141 | s366088226 | 1,191 | 958 | 86,724 | 86,748 | Accepted | Accepted | 19.56 | import sys
sys.setrecursionlimit(100000)
def rootedTree(node,parent,root,num):
A.append([node,parent,root,num])
for root_num,num in root:
rootedTree(root_num,node,tree[root_num],num)
n=int(eval(input()))
AB=[list(map(int,input().split()))+[i+1] for i in range(n-1)]
A=[]
tree=[[] for... | import sys
sys.setrecursionlimit(10**7)
def rootedTree(node,parent,root,num):
A.append([node,parent,root,num])
for root_num,num in root:
rootedTree(root_num,node,tree[root_num],num)
n=int(eval(input()))
AB=[list(map(int,input().split()))+[i+1] for i in range(n-1)]
A=[]
tree=[[] for ... | 27 | 27 | 604 | 603 | import sys
sys.setrecursionlimit(100000)
def rootedTree(node, parent, root, num):
A.append([node, parent, root, num])
for root_num, num in root:
rootedTree(root_num, node, tree[root_num], num)
n = int(eval(input()))
AB = [list(map(int, input().split())) + [i + 1] for i in range(n - 1)]
A = []
tree ... | import sys
sys.setrecursionlimit(10**7)
def rootedTree(node, parent, root, num):
A.append([node, parent, root, num])
for root_num, num in root:
rootedTree(root_num, node, tree[root_num], num)
n = int(eval(input()))
AB = [list(map(int, input().split())) + [i + 1] for i in range(n - 1)]
A = []
tree =... | false | 0 | [
"-sys.setrecursionlimit(100000)",
"+sys.setrecursionlimit(10**7)"
] | false | 0.060158 | 0.064274 | 0.935966 | [
"s989492141",
"s366088226"
] |
u201802797 | p02838 | python | s341641152 | s679296136 | 331 | 289 | 49,952 | 44,524 | Accepted | Accepted | 12.69 | import numpy as np
data = int(eval(input()))
array = np.array(list(map(int, input().split())))
mod = 10 ** 9 + 7
counter = 0
for i in range(60):
tmp = array & 1
array >>= 1
x = np.count_nonzero(tmp)
x *= data - x
counter = (counter + pow(2, i, mod) * x) % mod
print(counter) | import numpy as np
data = int(eval(input()))
array = np.fromiter(list(map(int, input().split())), np.int64)
result = 0
for bit in range(60):
array01 = int((array & 1).sum())
result = (result + array01 * (data - array01) * (1 << bit)) % 1000000007
array >>= 1
print(result) | 13 | 11 | 301 | 286 | import numpy as np
data = int(eval(input()))
array = np.array(list(map(int, input().split())))
mod = 10**9 + 7
counter = 0
for i in range(60):
tmp = array & 1
array >>= 1
x = np.count_nonzero(tmp)
x *= data - x
counter = (counter + pow(2, i, mod) * x) % mod
print(counter)
| import numpy as np
data = int(eval(input()))
array = np.fromiter(list(map(int, input().split())), np.int64)
result = 0
for bit in range(60):
array01 = int((array & 1).sum())
result = (result + array01 * (data - array01) * (1 << bit)) % 1000000007
array >>= 1
print(result)
| false | 15.384615 | [
"-array = np.array(list(map(int, input().split())))",
"-mod = 10**9 + 7",
"-counter = 0",
"-for i in range(60):",
"- tmp = array & 1",
"+array = np.fromiter(list(map(int, input().split())), np.int64)",
"+result = 0",
"+for bit in range(60):",
"+ array01 = int((array & 1).sum())",
"+ resul... | false | 0.495652 | 0.007666 | 64.652718 | [
"s341641152",
"s679296136"
] |
u352394527 | p00096 | python | s625325510 | s643971612 | 710 | 110 | 6,204 | 6,204 | Accepted | Accepted | 84.51 | from collections import Counter
two_dict = Counter()
for i in range(1001):
for j in range(1001):
two_dict[i + j] += 1
while True:
try:
n = int(eval(input()))
ans = 0
for i in range(n + 1):
ans += two_dict[i] * two_dict[n - i]
print(ans)
except EOFError:
break
| from collections import Counter
pair_dict = Counter()
for i in range(2001):
pair_dict[i] = min(i, 2000 - i) + 1
while True:
try:
n = int(eval(input()))
ans = 0
for i in range(n + 1):
ans += pair_dict[i] * pair_dict[n - i]
print(ans)
except EOFError:
break
| 19 | 17 | 313 | 303 | from collections import Counter
two_dict = Counter()
for i in range(1001):
for j in range(1001):
two_dict[i + j] += 1
while True:
try:
n = int(eval(input()))
ans = 0
for i in range(n + 1):
ans += two_dict[i] * two_dict[n - i]
print(ans)
except EOFError:
... | from collections import Counter
pair_dict = Counter()
for i in range(2001):
pair_dict[i] = min(i, 2000 - i) + 1
while True:
try:
n = int(eval(input()))
ans = 0
for i in range(n + 1):
ans += pair_dict[i] * pair_dict[n - i]
print(ans)
except EOFError:
break... | false | 10.526316 | [
"-two_dict = Counter()",
"-for i in range(1001):",
"- for j in range(1001):",
"- two_dict[i + j] += 1",
"+pair_dict = Counter()",
"+for i in range(2001):",
"+ pair_dict[i] = min(i, 2000 - i) + 1",
"- ans += two_dict[i] * two_dict[n - i]",
"+ ans += pair_dict[i] * p... | false | 0.830109 | 0.054904 | 15.119389 | [
"s625325510",
"s643971612"
] |
u645250356 | p02898 | python | s648493606 | s452560236 | 216 | 66 | 51,948 | 19,836 | Accepted | Accepted | 69.44 | from collections import Counter,defaultdict,deque
import sys,heapq,bisect,math,itertools,string,queue
sys.setrecursionlimit(10**8)
mod = 10**9+7
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
def inpl_str(): return list(sys.stdin.readline().split())
de... | from collections import Counter,defaultdict,deque
from heapq import heappop,heappush,heapify
import sys,bisect,math,itertools,fractions,pprint
sys.setrecursionlimit(10**8)
mod = 10**9+7
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
... | 16 | 16 | 485 | 415 | from collections import Counter, defaultdict, deque
import sys, heapq, bisect, math, itertools, string, queue
sys.setrecursionlimit(10**8)
mod = 10**9 + 7
def inp():
return int(sys.stdin.readline())
def inpl():
return list(map(int, sys.stdin.readline().split()))
def inpl_str():
return list(sys.stdin.... | from collections import Counter, defaultdict, deque
from heapq import heappop, heappush, heapify
import sys, bisect, math, itertools, fractions, pprint
sys.setrecursionlimit(10**8)
mod = 10**9 + 7
INF = float("inf")
def inp():
return int(sys.stdin.readline())
def inpl():
return list(map(int, sys.stdin.read... | false | 0 | [
"-import sys, heapq, bisect, math, itertools, string, queue",
"+from heapq import heappop, heappush, heapify",
"+import sys, bisect, math, itertools, fractions, pprint",
"+INF = float(\"inf\")",
"-def inpl_str():",
"- return list(sys.stdin.readline().split())",
"-",
"-",
"-def inpln(n):",
"- ... | false | 0.045386 | 0.117124 | 0.3875 | [
"s648493606",
"s452560236"
] |
u745087332 | p03828 | python | s038929278 | s747653172 | 26 | 24 | 3,444 | 3,316 | Accepted | Accepted | 7.69 | # coding:utf-8
import sys
from collections import defaultdict
INF = float('inf')
MOD = 10 ** 9 + 7
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x) - 1 for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdi... | from collections import defaultdict
MOD = 10 ** 9 + 7
n = int(eval(input()))
prime_cnt = defaultdict(int)
for num in range(2, n + 1):
i = 2
while i * i <= num:
if num % i == 0:
cnt = 0
while num % i == 0:
cnt += 1
num //= i
... | 39 | 26 | 819 | 492 | # coding:utf-8
import sys
from collections import defaultdict
INF = float("inf")
MOD = 10**9 + 7
def LI():
return [int(x) for x in sys.stdin.readline().split()]
def LI_():
return [int(x) - 1 for x in sys.stdin.readline().split()]
def LS():
return sys.stdin.readline().split()
def I():
return int... | from collections import defaultdict
MOD = 10**9 + 7
n = int(eval(input()))
prime_cnt = defaultdict(int)
for num in range(2, n + 1):
i = 2
while i * i <= num:
if num % i == 0:
cnt = 0
while num % i == 0:
cnt += 1
num //= i
prime_cnt[i] ... | false | 33.333333 | [
"-# coding:utf-8",
"-import sys",
"-INF = float(\"inf\")",
"-",
"-",
"-def LI():",
"- return [int(x) for x in sys.stdin.readline().split()]",
"-",
"-",
"-def LI_():",
"- return [int(x) - 1 for x in sys.stdin.readline().split()]",
"-",
"-",
"-def LS():",
"- return sys.stdin.readl... | false | 0.037173 | 0.038742 | 0.959499 | [
"s038929278",
"s747653172"
] |
u803617136 | p02969 | python | s688273194 | s786855676 | 167 | 18 | 38,384 | 2,940 | Accepted | Accepted | 89.22 | r = int(eval(input()))
print((3 * r ** 2)) | r = int(eval(input()))
ans = 3 * r ** 2
print(ans) | 2 | 3 | 35 | 46 | r = int(eval(input()))
print((3 * r**2))
| r = int(eval(input()))
ans = 3 * r**2
print(ans)
| false | 33.333333 | [
"-print((3 * r**2))",
"+ans = 3 * r**2",
"+print(ans)"
] | false | 0.042646 | 0.043257 | 0.98587 | [
"s688273194",
"s786855676"
] |
u832039789 | p03338 | python | s033318457 | s715328066 | 21 | 18 | 3,316 | 3,060 | Accepted | Accepted | 14.29 | from collections import Counter as C
n = int(eval(input()))
s = eval(input())
res = 0
for i in range(1,n):
a = s[:i]
b = s[i:]
tmp = 0
for k in C(a):
if k in b:
tmp += 1
res = max(res,tmp)
print(res)
| n = int(eval(input()))
s = eval(input())
res = 0
for i in range(1,n):
b,c =(s[:i], s[i:])
cnt = 0
for j in range(26):
p = chr(ord('a') + j)
cnt += (p in b) and (p in c)
res = max(res, cnt)
print(res)
| 14 | 11 | 242 | 230 | from collections import Counter as C
n = int(eval(input()))
s = eval(input())
res = 0
for i in range(1, n):
a = s[:i]
b = s[i:]
tmp = 0
for k in C(a):
if k in b:
tmp += 1
res = max(res, tmp)
print(res)
| n = int(eval(input()))
s = eval(input())
res = 0
for i in range(1, n):
b, c = (s[:i], s[i:])
cnt = 0
for j in range(26):
p = chr(ord("a") + j)
cnt += (p in b) and (p in c)
res = max(res, cnt)
print(res)
| false | 21.428571 | [
"-from collections import Counter as C",
"-",
"- a = s[:i]",
"- b = s[i:]",
"- tmp = 0",
"- for k in C(a):",
"- if k in b:",
"- tmp += 1",
"- res = max(res, tmp)",
"+ b, c = (s[:i], s[i:])",
"+ cnt = 0",
"+ for j in range(26):",
"+ p = chr(ord... | false | 0.045908 | 0.108578 | 0.422813 | [
"s033318457",
"s715328066"
] |
u780698286 | p02663 | python | s059041143 | s309851035 | 25 | 19 | 9,092 | 9,164 | Accepted | Accepted | 24 | a = list(map(int, input().split()))
kishou = a[0] * 60 + a[1]
shuusin = a[2] * 60 + a[3]
print((shuusin - kishou - a[4])) | a = list(map(int, input().split()))
b = (a[2] * 60 + a[3]) - (a[0] * 60 + a[1])
print((b - a[4])) | 4 | 3 | 122 | 97 | a = list(map(int, input().split()))
kishou = a[0] * 60 + a[1]
shuusin = a[2] * 60 + a[3]
print((shuusin - kishou - a[4]))
| a = list(map(int, input().split()))
b = (a[2] * 60 + a[3]) - (a[0] * 60 + a[1])
print((b - a[4]))
| false | 25 | [
"-kishou = a[0] * 60 + a[1]",
"-shuusin = a[2] * 60 + a[3]",
"-print((shuusin - kishou - a[4]))",
"+b = (a[2] * 60 + a[3]) - (a[0] * 60 + a[1])",
"+print((b - a[4]))"
] | false | 0.054001 | 0.034237 | 1.577264 | [
"s059041143",
"s309851035"
] |
u821624310 | p02415 | python | s972319575 | s670579440 | 30 | 20 | 7,416 | 7,336 | Accepted | Accepted | 33.33 | s = input()
for c in s:
if c.isupper():
print(c.lower(), end = "")
elif c.islower():
print(c.upper(), end = "")
else:
print(c, end = "")
print()
| s = eval(input())
print((s.swapcase())) | 9 | 2 | 188 | 32 | s = input()
for c in s:
if c.isupper():
print(c.lower(), end="")
elif c.islower():
print(c.upper(), end="")
else:
print(c, end="")
print()
| s = eval(input())
print((s.swapcase()))
| false | 77.777778 | [
"-s = input()",
"-for c in s:",
"- if c.isupper():",
"- print(c.lower(), end=\"\")",
"- elif c.islower():",
"- print(c.upper(), end=\"\")",
"- else:",
"- print(c, end=\"\")",
"-print()",
"+s = eval(input())",
"+print((s.swapcase()))"
] | false | 0.039198 | 0.040242 | 0.974064 | [
"s972319575",
"s670579440"
] |
u254871849 | p03645 | python | s581964983 | s204141636 | 344 | 210 | 33,132 | 37,232 | Accepted | Accepted | 38.95 | import sys
l = sys.stdin.readlines()
n, m = (int(x) for x in l[0].split())
from_1, to_n = set(), set()
for a, b in ((int(x) for x in l[i].split()) for i in range(1, m+1)):
if a == 1: from_1.add(b)
elif b == n: to_n.add(a)
print(("POSSIBLE" if from_1 & to_n else "IMPOSSIBLE"))
| import sys
l = sys.stdin.readlines()
n, m = l[0].split()
from_1, to_n = set(), set()
for a, b in (l[i].split() for i in range(1, int(m)+1)):
if a == '1': from_1.add(b)
elif b == n: to_n.add(a)
print(("POSSIBLE" if from_1 & to_n else "IMPOSSIBLE"))
| 10 | 10 | 294 | 265 | import sys
l = sys.stdin.readlines()
n, m = (int(x) for x in l[0].split())
from_1, to_n = set(), set()
for a, b in ((int(x) for x in l[i].split()) for i in range(1, m + 1)):
if a == 1:
from_1.add(b)
elif b == n:
to_n.add(a)
print(("POSSIBLE" if from_1 & to_n else "IMPOSSIBLE"))
| import sys
l = sys.stdin.readlines()
n, m = l[0].split()
from_1, to_n = set(), set()
for a, b in (l[i].split() for i in range(1, int(m) + 1)):
if a == "1":
from_1.add(b)
elif b == n:
to_n.add(a)
print(("POSSIBLE" if from_1 & to_n else "IMPOSSIBLE"))
| false | 0 | [
"-n, m = (int(x) for x in l[0].split())",
"+n, m = l[0].split()",
"-for a, b in ((int(x) for x in l[i].split()) for i in range(1, m + 1)):",
"- if a == 1:",
"+for a, b in (l[i].split() for i in range(1, int(m) + 1)):",
"+ if a == \"1\":"
] | false | 0.076987 | 0.040248 | 1.912795 | [
"s581964983",
"s204141636"
] |
u147801965 | p00027 | python | s388074654 | s387896963 | 20 | 10 | 4,224 | 4,228 | Accepted | Accepted | 50 | a=['Wednesday','Thursday','Friday','Saturday','Sunday','Monday','Tuesday',0]
while True:
q=list(map(int,input().split()))
if sum(q) == 0: break
print(a[(sum([0,31,29,31,30,31,30,31,31,30,31,30,31][:q[0]])+q[1])%7]) | while True:
q=list(map(int,input().split()))
if sum(q) == 0: break
print(['Wednesday','Thursday','Friday','Saturday','Sunday','Monday','Tuesday',0][(sum([0,31,29,31,30,31,30,31,31,30,31,30,31][:q[0]])+q[1])%7]) | 5 | 4 | 227 | 222 | a = ["Wednesday", "Thursday", "Friday", "Saturday", "Sunday", "Monday", "Tuesday", 0]
while True:
q = list(map(int, input().split()))
if sum(q) == 0:
break
print(
a[(sum([0, 31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31][: q[0]]) + q[1]) % 7]
)
| while True:
q = list(map(int, input().split()))
if sum(q) == 0:
break
print(
[
"Wednesday",
"Thursday",
"Friday",
"Saturday",
"Sunday",
"Monday",
"Tuesday",
0,
][(sum([0, 31, 29, 31, 30, 3... | false | 20 | [
"-a = [\"Wednesday\", \"Thursday\", \"Friday\", \"Saturday\", \"Sunday\", \"Monday\", \"Tuesday\", 0]",
"- a[(sum([0, 31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31][: q[0]]) + q[1]) % 7]",
"+ [",
"+ \"Wednesday\",",
"+ \"Thursday\",",
"+ \"Friday\",",
"+ ... | false | 0.036165 | 0.031489 | 1.1485 | [
"s388074654",
"s387896963"
] |
u134019875 | p03487 | python | s959662278 | s750072508 | 127 | 81 | 18,160 | 18,676 | Accepted | Accepted | 36.22 | n = int(eval(input()))
L = sorted(map(int, input().split()))
d = {}
for i in range(n):
if L[i] not in d:
d[L[i]] = 1
else:
d[L[i]] += 1
cnt = 0
for k, v in list(d.items()):
if k == v:
continue
else:
if k > v:
cnt += v
else:
... | from collections import Counter
n = int(eval(input()))
a = list(map(int, input().split()))
c = Counter(a)
ans = 0
for k, v in list(c.items()):
if k > v:
ans += v
elif k < v:
ans += v - k
print(ans)
| 18 | 12 | 333 | 222 | n = int(eval(input()))
L = sorted(map(int, input().split()))
d = {}
for i in range(n):
if L[i] not in d:
d[L[i]] = 1
else:
d[L[i]] += 1
cnt = 0
for k, v in list(d.items()):
if k == v:
continue
else:
if k > v:
cnt += v
else:
cnt += v - k
pri... | from collections import Counter
n = int(eval(input()))
a = list(map(int, input().split()))
c = Counter(a)
ans = 0
for k, v in list(c.items()):
if k > v:
ans += v
elif k < v:
ans += v - k
print(ans)
| false | 33.333333 | [
"+from collections import Counter",
"+",
"-L = sorted(map(int, input().split()))",
"-d = {}",
"-for i in range(n):",
"- if L[i] not in d:",
"- d[L[i]] = 1",
"- else:",
"- d[L[i]] += 1",
"-cnt = 0",
"-for k, v in list(d.items()):",
"- if k == v:",
"- continue",
... | false | 0.137911 | 0.085294 | 1.616893 | [
"s959662278",
"s750072508"
] |
u353919145 | p03448 | python | s882587468 | s850762611 | 50 | 11 | 3,060 | 2,696 | Accepted | Accepted | 78 | A = int(eval(input()))
B = int(eval(input()))
C = int(eval(input()))
X = int(eval(input()))
counter = 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:
counter += 1
print(counter) | a = int(input())
b = int(input())
c = int(input())
x = int(input())
def run():
if x % 50 != 0 or a*500 + b*100 + c*50 < x:
return 0
#greedy
an = 0
bn = 0
cn = 0
xa = x
while xa >= 500:
xa -= 500
an += 1
while xa >= 100:
xa -= 100
bn += 1
while xa >= 50:
xa -= 50
cn += 1... | 13 | 40 | 250 | 573 | A = int(eval(input()))
B = int(eval(input()))
C = int(eval(input()))
X = int(eval(input()))
counter = 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:
counter += 1
print(counter)
| a = int(input())
b = int(input())
c = int(input())
x = int(input())
def run():
if x % 50 != 0 or a * 500 + b * 100 + c * 50 < x:
return 0
# greedy
an = 0
bn = 0
cn = 0
xa = x
while xa >= 500:
xa -= 500
an += 1
while xa >= 100:
xa -= 100
bn += 1
... | false | 67.5 | [
"-A = int(eval(input()))",
"-B = int(eval(input()))",
"-C = int(eval(input()))",
"-X = int(eval(input()))",
"-counter = 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:",
"- counter += ... | false | 0.077881 | 0.044451 | 1.75208 | [
"s882587468",
"s850762611"
] |
u672898046 | p03845 | python | s347587570 | s248887380 | 24 | 18 | 3,444 | 3,060 | Accepted | Accepted | 25 | import copy
N = int(eval(input()))
Ts = list(map(int, input().split()))
M = int(eval(input()))
for i in range(M):
P, x = list(map(int, input().split()))
Ts_2 = copy.copy(Ts) #コピーを行う
Ts_2[P-1] = x
print((sum(Ts_2)))
| N = int(eval(input()))
Ts = list(map(int, input().split()))
M = int(eval(input()))
for i in range(M):
p, x = list(map(int, input().split()))
print((sum(Ts)-Ts[p-1]+x)) | 10 | 6 | 214 | 156 | import copy
N = int(eval(input()))
Ts = list(map(int, input().split()))
M = int(eval(input()))
for i in range(M):
P, x = list(map(int, input().split()))
Ts_2 = copy.copy(Ts) # コピーを行う
Ts_2[P - 1] = x
print((sum(Ts_2)))
| N = int(eval(input()))
Ts = list(map(int, input().split()))
M = int(eval(input()))
for i in range(M):
p, x = list(map(int, input().split()))
print((sum(Ts) - Ts[p - 1] + x))
| false | 40 | [
"-import copy",
"-",
"- P, x = list(map(int, input().split()))",
"- Ts_2 = copy.copy(Ts) # コピーを行う",
"- Ts_2[P - 1] = x",
"- print((sum(Ts_2)))",
"+ p, x = list(map(int, input().split()))",
"+ print((sum(Ts) - Ts[p - 1] + x))"
] | false | 0.046661 | 0.047484 | 0.982668 | [
"s347587570",
"s248887380"
] |
u596536048 | p03852 | python | s316890720 | s639632390 | 31 | 25 | 8,892 | 8,884 | Accepted | Accepted | 19.35 | v = 'aiueo'
if eval(input()) in v:
print('vowel')
else:
print('consonant') | word = eval(input())
if word == 'a':
print('vowel')
elif word == 'i':
print('vowel')
elif word == 'u':
print('vowel')
elif word == 'e':
print('vowel')
elif word == 'o':
print('vowel')
else:
print('consonant') | 5 | 13 | 80 | 238 | v = "aiueo"
if eval(input()) in v:
print("vowel")
else:
print("consonant")
| word = eval(input())
if word == "a":
print("vowel")
elif word == "i":
print("vowel")
elif word == "u":
print("vowel")
elif word == "e":
print("vowel")
elif word == "o":
print("vowel")
else:
print("consonant")
| false | 61.538462 | [
"-v = \"aiueo\"",
"-if eval(input()) in v:",
"+word = eval(input())",
"+if word == \"a\":",
"+ print(\"vowel\")",
"+elif word == \"i\":",
"+ print(\"vowel\")",
"+elif word == \"u\":",
"+ print(\"vowel\")",
"+elif word == \"e\":",
"+ print(\"vowel\")",
"+elif word == \"o\":"
] | false | 0.007816 | 0.103708 | 0.075366 | [
"s316890720",
"s639632390"
] |
u674588203 | p02681 | python | s504224486 | s841604002 | 23 | 21 | 9,076 | 9,100 | Accepted | Accepted | 8.7 | a= [eval(input()) for i in range(2)]
S=a[0]
T=a[1]
def CK(S,T):
m=["a","b","c","d","e","f","g","h","i","j","k","l","m","n","o","p","q","r","s","t","u","v","w","x","y","z"]
for a in range(len(m)):
Sa=S+m[a]
if(T == Sa):
return True
break
else:
... | S=eval(input())
T=eval(input())
if T[:-1]==S:
print("Yes")
exit()
print("No") | 22 | 8 | 421 | 76 | a = [eval(input()) for i in range(2)]
S = a[0]
T = a[1]
def CK(S, T):
m = [
"a",
"b",
"c",
"d",
"e",
"f",
"g",
"h",
"i",
"j",
"k",
"l",
"m",
"n",
"o",
"p",
"q",
"r",
... | S = eval(input())
T = eval(input())
if T[:-1] == S:
print("Yes")
exit()
print("No")
| false | 63.636364 | [
"-a = [eval(input()) for i in range(2)]",
"-S = a[0]",
"-T = a[1]",
"-",
"-",
"-def CK(S, T):",
"- m = [",
"- \"a\",",
"- \"b\",",
"- \"c\",",
"- \"d\",",
"- \"e\",",
"- \"f\",",
"- \"g\",",
"- \"h\",",
"- \"i\",",
"- ... | false | 0.07654 | 0.078151 | 0.979387 | [
"s504224486",
"s841604002"
] |
u936985471 | p03137 | python | s075621152 | s185647421 | 115 | 104 | 13,968 | 13,968 | Accepted | Accepted | 9.57 | N,M=list(map(int,input().split()))
X=sorted(list(map(int,input().split())))
d=[0]*(M-1)
for i in range(len(X)-1):
d[i]=X[i+1]-X[i]
d=sorted(d)[::-1]
print((sum(d[N-1:]))) | N,M=list(map(int,input().split()))
X=sorted(list(map(int,input().split())))
print((sum(sorted([X[i+1]-X[i] for i in range(M-1)])[::-1][N-1:]))) | 7 | 3 | 170 | 137 | N, M = list(map(int, input().split()))
X = sorted(list(map(int, input().split())))
d = [0] * (M - 1)
for i in range(len(X) - 1):
d[i] = X[i + 1] - X[i]
d = sorted(d)[::-1]
print((sum(d[N - 1 :])))
| N, M = list(map(int, input().split()))
X = sorted(list(map(int, input().split())))
print((sum(sorted([X[i + 1] - X[i] for i in range(M - 1)])[::-1][N - 1 :])))
| false | 57.142857 | [
"-d = [0] * (M - 1)",
"-for i in range(len(X) - 1):",
"- d[i] = X[i + 1] - X[i]",
"-d = sorted(d)[::-1]",
"-print((sum(d[N - 1 :])))",
"+print((sum(sorted([X[i + 1] - X[i] for i in range(M - 1)])[::-1][N - 1 :])))"
] | false | 0.119508 | 0.08673 | 1.37793 | [
"s075621152",
"s185647421"
] |
u125481461 | p02270 | python | s162030408 | s830205973 | 820 | 630 | 9,564 | 16,424 | Accepted | Accepted | 23.17 | def can_load(num_baggages, baggages, num_truck, max_load):
bag_no = 0
for i in range(num_truck):
load_cap = max_load
while load_cap > 0:
if bag_no >= num_baggages:
#print(max_load, "True")
return True
if load_cap >= baggages[bag_n... | import sys
def can_load(num_baggages, baggages, num_truck, max_load):
bag_no = 0
for i in range(num_truck):
load_cap = max_load
while load_cap > 0:
if bag_no >= num_baggages:
#print(max_load, "True")
return True
if load_cap >= ba... | 36 | 37 | 977 | 991 | def can_load(num_baggages, baggages, num_truck, max_load):
bag_no = 0
for i in range(num_truck):
load_cap = max_load
while load_cap > 0:
if bag_no >= num_baggages:
# print(max_load, "True")
return True
if load_cap >= baggages[bag_no]:
... | import sys
def can_load(num_baggages, baggages, num_truck, max_load):
bag_no = 0
for i in range(num_truck):
load_cap = max_load
while load_cap > 0:
if bag_no >= num_baggages:
# print(max_load, "True")
return True
if load_cap >= baggages[b... | false | 2.702703 | [
"+import sys",
"+",
"+",
"- baggages = [int(eval(input())) for x in range(num_baggages)]",
"+ baggages = list(map(int, sys.stdin.read().splitlines()))"
] | false | 0.042699 | 0.037955 | 1.124992 | [
"s162030408",
"s830205973"
] |
u076917070 | p02937 | python | s377227929 | s130759558 | 395 | 114 | 8,184 | 8,308 | Accepted | Accepted | 71.14 | import sys
input=sys.stdin.readline
import string
import bisect
def main():
S = input().strip()
T = input().strip()
if any(S.find(c) < 0 for c in T):
print((-1))
return
dS = {c:[] for c in string.ascii_lowercase}
for i, s in enumerate(S):
dS[s].append(i)
... | import sys
input=sys.stdin.readline
import string
import bisect
def main():
S = input().strip()
T = input().strip()
dS = {c:[] for c in string.ascii_lowercase}
for i, s in enumerate(S):
dS[s].append(i)
ans = 0
pos = 0
ls = len(S)
for c in T:
if n... | 31 | 31 | 594 | 586 | import sys
input = sys.stdin.readline
import string
import bisect
def main():
S = input().strip()
T = input().strip()
if any(S.find(c) < 0 for c in T):
print((-1))
return
dS = {c: [] for c in string.ascii_lowercase}
for i, s in enumerate(S):
dS[s].append(i)
ans = 0
... | import sys
input = sys.stdin.readline
import string
import bisect
def main():
S = input().strip()
T = input().strip()
dS = {c: [] for c in string.ascii_lowercase}
for i, s in enumerate(S):
dS[s].append(i)
ans = 0
pos = 0
ls = len(S)
for c in T:
if not dS[c]:
... | false | 0 | [
"- if any(S.find(c) < 0 for c in T):",
"- print((-1))",
"- return",
"+ if not dS[c]:",
"+ print((-1))",
"+ return"
] | false | 0.122083 | 0.151715 | 0.804689 | [
"s377227929",
"s130759558"
] |
u467307100 | p04043 | python | s379744503 | s638808156 | 20 | 17 | 2,940 | 2,940 | Accepted | Accepted | 15 | a ,b, c = list(map(int,input().split()))
if a*b*c == 175:
print("YES")
else:
print("NO") | ABC=[int(x) for x in input().split()]
ABC.sort()
print(('YES' if ABC == [5,5,7] else 'NO'))
| 5 | 3 | 90 | 92 | a, b, c = list(map(int, input().split()))
if a * b * c == 175:
print("YES")
else:
print("NO")
| ABC = [int(x) for x in input().split()]
ABC.sort()
print(("YES" if ABC == [5, 5, 7] else "NO"))
| false | 40 | [
"-a, b, c = list(map(int, input().split()))",
"-if a * b * c == 175:",
"- print(\"YES\")",
"-else:",
"- print(\"NO\")",
"+ABC = [int(x) for x in input().split()]",
"+ABC.sort()",
"+print((\"YES\" if ABC == [5, 5, 7] else \"NO\"))"
] | false | 0.035125 | 0.035715 | 0.983491 | [
"s379744503",
"s638808156"
] |
u667135132 | p02787 | python | s424890227 | s351050013 | 976 | 508 | 285,192 | 49,756 | Accepted | Accepted | 47.95 | H, N = list(map(int, input().split()))
A = [0]*N
B = [0]*N
for i in range(N):
A[i], B[i] = list(map(int, input().split()))
#i番目までの魔法を使い, モンスターの体力をj以上減らすのに必要な魔力の最小値(個数制限なしナップザック)
dp = [[float("inf")]*(H+1) for _ in range(N+1)]
dp[0][0] = 0
for i in range(1, N+1):
for j in range(H+1):
if j... |
H, N = list(map(int, input().split()))
A = [0]*N
B = [0]*N
for i in range(N):
A[i], B[i] = list(map(int, input().split()))
"""
# i番目までの魔法を使い, モンスターの体力をj以上減らすのに必要な魔力の最小値(個数制限なしナップザック)
dp = [[float("inf")]*(H+1) for _ in range(N+1)]
dp[0][0] = 0
for i in range(1, N+1):
for j in range(H+1):
... | 19 | 35 | 464 | 771 | H, N = list(map(int, input().split()))
A = [0] * N
B = [0] * N
for i in range(N):
A[i], B[i] = list(map(int, input().split()))
# i番目までの魔法を使い, モンスターの体力をj以上減らすのに必要な魔力の最小値(個数制限なしナップザック)
dp = [[float("inf")] * (H + 1) for _ in range(N + 1)]
dp[0][0] = 0
for i in range(1, N + 1):
for j in range(H + 1):
if j ... | H, N = list(map(int, input().split()))
A = [0] * N
B = [0] * N
for i in range(N):
A[i], B[i] = list(map(int, input().split()))
"""
# i番目までの魔法を使い, モンスターの体力をj以上減らすのに必要な魔力の最小値(個数制限なしナップザック)
dp = [[float("inf")]*(H+1) for _ in range(N+1)]
dp[0][0] = 0
for i in range(1, N+1):
for j in range(H+1):
if j < A[i-... | false | 45.714286 | [
"+\"\"\"",
"-dp = [[float(\"inf\")] * (H + 1) for _ in range(N + 1)]",
"+dp = [[float(\"inf\")]*(H+1) for _ in range(N+1)]",
"-for i in range(1, N + 1):",
"- for j in range(H + 1):",
"- if j < A[i - 1]:",
"- dp[i][j] = min(dp[i - 1][j], B[i - 1])",
"+for i in range(1, N+1):",
"+... | false | 0.166072 | 0.103593 | 1.603114 | [
"s424890227",
"s351050013"
] |
u539367121 | p02937 | python | s078007368 | s737355193 | 144 | 102 | 17,920 | 18,292 | Accepted | Accepted | 29.17 | import bisect
s=eval(input())
t=eval(input())
n=len(s)
dic={}
for idx,i in enumerate(s*2):
if i in list(dic.keys()):
dic[i].append(idx)
else:
dic[i]=[idx]
ans,p=0,-1
for i in t:
if i not in list(dic.keys()):
print((-1))
exit()
p=dic[i][bisect.bisect_left(dic[i], p+1)]
if ... | from bisect import bisect_left
from collections import defaultdict as dd
def main():
s=eval(input())
t=eval(input())
n=len(s)
dic=dd(list)
for idx,i in enumerate(s*2):
dic[i].append(idx)
ans,p=0,-1
for i in t:
if i not in list(dic.keys()):
print((-1))
exit()
p... | 24 | 27 | 341 | 431 | import bisect
s = eval(input())
t = eval(input())
n = len(s)
dic = {}
for idx, i in enumerate(s * 2):
if i in list(dic.keys()):
dic[i].append(idx)
else:
dic[i] = [idx]
ans, p = 0, -1
for i in t:
if i not in list(dic.keys()):
print((-1))
exit()
p = dic[i][bisect.bisect_le... | from bisect import bisect_left
from collections import defaultdict as dd
def main():
s = eval(input())
t = eval(input())
n = len(s)
dic = dd(list)
for idx, i in enumerate(s * 2):
dic[i].append(idx)
ans, p = 0, -1
for i in t:
if i not in list(dic.keys()):
print((... | false | 11.111111 | [
"-import bisect",
"+from bisect import bisect_left",
"+from collections import defaultdict as dd",
"-s = eval(input())",
"-t = eval(input())",
"-n = len(s)",
"-dic = {}",
"-for idx, i in enumerate(s * 2):",
"- if i in list(dic.keys()):",
"+",
"+def main():",
"+ s = eval(input())",
"+ ... | false | 0.039364 | 0.044009 | 0.894451 | [
"s078007368",
"s737355193"
] |
u046158516 | p03077 | python | s855840831 | s583921661 | 163 | 66 | 38,512 | 61,996 | Accepted | Accepted | 59.51 | import math
n=int(eval(input()))
a=int(eval(input()))
b=int(eval(input()))
c=int(eval(input()))
d=int(eval(input()))
e=int(eval(input()))
k=min(a,min(b,min(c,min(d,e))))
s=math.ceil(n/k)
while s*k<n:
s+=1
print((5+s-1)) | import math
n=int(eval(input()))
a=int(eval(input()))
b=int(eval(input()))
c=int(eval(input()))
d=int(eval(input()))
e=int(eval(input()))
k=min(a,min(b,min(c,min(d,e))))
i=math.ceil(n/k)
while i*k<n:
i+=1
print((4+i))
| 12 | 12 | 194 | 193 | import math
n = int(eval(input()))
a = int(eval(input()))
b = int(eval(input()))
c = int(eval(input()))
d = int(eval(input()))
e = int(eval(input()))
k = min(a, min(b, min(c, min(d, e))))
s = math.ceil(n / k)
while s * k < n:
s += 1
print((5 + s - 1))
| import math
n = int(eval(input()))
a = int(eval(input()))
b = int(eval(input()))
c = int(eval(input()))
d = int(eval(input()))
e = int(eval(input()))
k = min(a, min(b, min(c, min(d, e))))
i = math.ceil(n / k)
while i * k < n:
i += 1
print((4 + i))
| false | 0 | [
"-s = math.ceil(n / k)",
"-while s * k < n:",
"- s += 1",
"-print((5 + s - 1))",
"+i = math.ceil(n / k)",
"+while i * k < n:",
"+ i += 1",
"+print((4 + i))"
] | false | 0.04388 | 0.079553 | 0.551577 | [
"s855840831",
"s583921661"
] |
u714642969 | p03108 | python | s049248713 | s412817919 | 544 | 501 | 76,636 | 76,124 | Accepted | Accepted | 7.9 | import sys
sys.setrecursionlimit(10**9)
INF=10**18
MOD=10**9+7
def input():
return sys.stdin.readline().rstrip()
def main():
class UnionFind():
def __init__(self,n):
self.par=[i for i in range(n)]
self.siz=[1]*n
def root(self,x):
wh... | import sys
sys.setrecursionlimit(10**9)
INF=10**18
MOD=10**9+7
def input():
return sys.stdin.readline().rstrip()
def main():
class UnionFind():
def __init__(self,n):
self.par=[i for i in range(n)]
self.siz=[1]*n
def root(self,x):
wh... | 56 | 57 | 1,348 | 1,399 | import sys
sys.setrecursionlimit(10**9)
INF = 10**18
MOD = 10**9 + 7
def input():
return sys.stdin.readline().rstrip()
def main():
class UnionFind:
def __init__(self, n):
self.par = [i for i in range(n)]
self.siz = [1] * n
def root(self, x):
while self.p... | import sys
sys.setrecursionlimit(10**9)
INF = 10**18
MOD = 10**9 + 7
def input():
return sys.stdin.readline().rstrip()
def main():
class UnionFind:
def __init__(self, n):
self.par = [i for i in range(n)]
self.siz = [1] * n
def root(self, x):
while self.p... | false | 1.754386 | [
"+ self.par[x] = self.par[self.par[x]]"
] | false | 0.044501 | 0.036506 | 1.219025 | [
"s049248713",
"s412817919"
] |
u991567869 | p03149 | python | s927238422 | s962611878 | 31 | 27 | 9,156 | 9,148 | Accepted | Accepted | 12.9 | n = list(map(int, input().split()))
if 1 in n:
if 9 in n:
if 7 in n:
if 4 in n:
print("YES")
exit()
print("NO") | n = set(map(int, input().split()))
if {1, 9, 7, 4} == n:
print("YES")
else:
print("NO") | 9 | 6 | 176 | 101 | n = list(map(int, input().split()))
if 1 in n:
if 9 in n:
if 7 in n:
if 4 in n:
print("YES")
exit()
print("NO")
| n = set(map(int, input().split()))
if {1, 9, 7, 4} == n:
print("YES")
else:
print("NO")
| false | 33.333333 | [
"-n = list(map(int, input().split()))",
"-if 1 in n:",
"- if 9 in n:",
"- if 7 in n:",
"- if 4 in n:",
"- print(\"YES\")",
"- exit()",
"-print(\"NO\")",
"+n = set(map(int, input().split()))",
"+if {1, 9, 7, 4} == n:",
"+ print(\"YES\")",
"+... | false | 0.083336 | 0.039092 | 2.131822 | [
"s927238422",
"s962611878"
] |
u789339072 | p03087 | python | s558837428 | s452249068 | 877 | 323 | 7,788 | 53,980 | Accepted | Accepted | 63.17 | N, Q = list(map(int,input().split()))
S = eval(input())
memo = [0 for _ in [0]*(N+1)]
for i in range(2,N+1):
memo[i] = memo[i-1] + int(S[i-2:i]=="AC")
for _ in range(Q):
l, r = list(map(int,input().split()))
print((memo[r]-memo[l])) | import sys
input = sys.stdin.readline
N, Q = map(int, input().split())
S = input()
dp = [0]*(N+1)
cnt = 0
for i in range(2,N+1):
if S[i-1] == "C" and S[i-2] == "A":
cnt += 1
dp[i] = cnt
ans = []
for _ in [0]*Q:
l, r = map(int, input().split())
ans.append(dp[r] - dp[l])
print(*ans, ... | 8 | 15 | 231 | 329 | N, Q = list(map(int, input().split()))
S = eval(input())
memo = [0 for _ in [0] * (N + 1)]
for i in range(2, N + 1):
memo[i] = memo[i - 1] + int(S[i - 2 : i] == "AC")
for _ in range(Q):
l, r = list(map(int, input().split()))
print((memo[r] - memo[l]))
| import sys
input = sys.stdin.readline
N, Q = map(int, input().split())
S = input()
dp = [0] * (N + 1)
cnt = 0
for i in range(2, N + 1):
if S[i - 1] == "C" and S[i - 2] == "A":
cnt += 1
dp[i] = cnt
ans = []
for _ in [0] * Q:
l, r = map(int, input().split())
ans.append(dp[r] - dp[l])
print(*ans, ... | false | 46.666667 | [
"-N, Q = list(map(int, input().split()))",
"-S = eval(input())",
"-memo = [0 for _ in [0] * (N + 1)]",
"+import sys",
"+",
"+input = sys.stdin.readline",
"+N, Q = map(int, input().split())",
"+S = input()",
"+dp = [0] * (N + 1)",
"+cnt = 0",
"- memo[i] = memo[i - 1] + int(S[i - 2 : i] == \"AC... | false | 0.077504 | 0.041525 | 1.866425 | [
"s558837428",
"s452249068"
] |
u565448206 | p02706 | python | s525185276 | s977346782 | 24 | 20 | 9,876 | 9,884 | Accepted | Accepted | 16.67 | N, M = list(map(int, input().split(' ')))
a = list(map(int, input().split(' ')))
sum_a = 0
for i in a:
sum_a += i
if sum_a > N:
print((-1))
else:
print((N - sum_a)) | def to_do():
N,M=list(map(int,input().split()))
day_list=list(map(int,input().split()))
sum=0
for i in range(0,M):
sum=sum+day_list[i]
if sum>N:
print((-1))
if sum<=N:
print((N-sum))
if __name__=="__main__":
to_do() | 9 | 12 | 174 | 269 | N, M = list(map(int, input().split(" ")))
a = list(map(int, input().split(" ")))
sum_a = 0
for i in a:
sum_a += i
if sum_a > N:
print((-1))
else:
print((N - sum_a))
| def to_do():
N, M = list(map(int, input().split()))
day_list = list(map(int, input().split()))
sum = 0
for i in range(0, M):
sum = sum + day_list[i]
if sum > N:
print((-1))
if sum <= N:
print((N - sum))
if __name__ == "__main__":
to_do()
| false | 25 | [
"-N, M = list(map(int, input().split(\" \")))",
"-a = list(map(int, input().split(\" \")))",
"-sum_a = 0",
"-for i in a:",
"- sum_a += i",
"-if sum_a > N:",
"- print((-1))",
"-else:",
"- print((N - sum_a))",
"+def to_do():",
"+ N, M = list(map(int, input().split()))",
"+ day_lis... | false | 0.099933 | 0.04431 | 2.255341 | [
"s525185276",
"s977346782"
] |
u223663729 | p03409 | python | s339198322 | s446701997 | 181 | 18 | 39,024 | 3,064 | Accepted | Accepted | 90.06 | # AtCoder Beginner Contest 091
# C - 2D Plane 2N Points
# https://atcoder.jp/contests/abc091/tasks/arc092_a
N = int(eval(input()))
A = [tuple(map(int, input().split())) for _ in range(N)]
B = [tuple(map(int, input().split())) for _ in range(N)]
A.sort(key=lambda x: x[0])
B.sort(key=lambda x: x[0])
used = ... | N = int(eval(input()))
A = [tuple(map(int, input().split())) for _ in range(N)]
B = [tuple(map(int, input().split())) for _ in range(N)]
A.sort()
B.sort()
cnt = 0
for u, v in B:
maxy = -1
maxi = -1
for i, (x, y) in enumerate(A):
if x >= u:
break
if y >= v:
... | 34 | 28 | 661 | 475 | # AtCoder Beginner Contest 091
# C - 2D Plane 2N Points
# https://atcoder.jp/contests/abc091/tasks/arc092_a
N = int(eval(input()))
A = [tuple(map(int, input().split())) for _ in range(N)]
B = [tuple(map(int, input().split())) for _ in range(N)]
A.sort(key=lambda x: x[0])
B.sort(key=lambda x: x[0])
used = [False] * N
cn... | N = int(eval(input()))
A = [tuple(map(int, input().split())) for _ in range(N)]
B = [tuple(map(int, input().split())) for _ in range(N)]
A.sort()
B.sort()
cnt = 0
for u, v in B:
maxy = -1
maxi = -1
for i, (x, y) in enumerate(A):
if x >= u:
break
if y >= v:
continue
... | false | 17.647059 | [
"-# AtCoder Beginner Contest 091",
"-# C - 2D Plane 2N Points",
"-# https://atcoder.jp/contests/abc091/tasks/arc092_a",
"-A.sort(key=lambda x: x[0])",
"-B.sort(key=lambda x: x[0])",
"-used = [False] * N",
"+A.sort()",
"+B.sort()",
"- if used[i] or y >= v:",
"+ if y >= v:",
"- ... | false | 0.035409 | 0.041851 | 0.846079 | [
"s339198322",
"s446701997"
] |
u961683878 | p02861 | python | s254246504 | s294630014 | 1,389 | 501 | 14,452 | 3,188 | Accepted | Accepted | 63.93 | import sys
from itertools import permutations
from math import factorial
import numpy as np
int1 = lambda x: int(x) - 1
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(500000)
N = int(readline())
XY = [list(map(int, readline().sp... | import sys
from itertools import permutations
from math import factorial
int1 = lambda x: int(x) - 1
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(500000)
N = int(readline())
XY = [list(map(int, readline().split())) for _ in ran... | 23 | 22 | 625 | 605 | import sys
from itertools import permutations
from math import factorial
import numpy as np
int1 = lambda x: int(x) - 1
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(500000)
N = int(readline())
XY = [list(map(int, readline().split())) for... | import sys
from itertools import permutations
from math import factorial
int1 = lambda x: int(x) - 1
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(500000)
N = int(readline())
XY = [list(map(int, readline().split())) for _ in range(N)]
dis... | false | 4.347826 | [
"-import numpy as np",
"- np.sqrt(",
"+ pow(",
"- + pow(route[i][1] - route[i + 1][1], 2)",
"+ + pow(route[i][1] - route[i + 1][1], 2),",
"+ 0.5,"
] | false | 0.181321 | 0.039151 | 4.63129 | [
"s254246504",
"s294630014"
] |
u691018832 | p03724 | python | s674862687 | s945528268 | 209 | 150 | 28,148 | 3,828 | Accepted | Accepted | 28.23 | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)
n, m = list(map(int, readline().split()))
ab = [list(map(int, readline().split())) for i in range(m)]
ans = [0] * n
for a, b in ab:
ans[a - 1] += 1
ans[b... | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)
n, m = list(map(int, readline().split()))
check = [0] * (n + 1)
for i in range(m):
a, b = list(map(int, readline().split()))
check[a] += 1
check[b] +... | 17 | 18 | 421 | 410 | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10**7)
n, m = list(map(int, readline().split()))
ab = [list(map(int, readline().split())) for i in range(m)]
ans = [0] * n
for a, b in ab:
ans[a - 1] += 1
ans[b - 1] += 1
fo... | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10**7)
n, m = list(map(int, readline().split()))
check = [0] * (n + 1)
for i in range(m):
a, b = list(map(int, readline().split()))
check[a] += 1
check[b] += 1
for v in ... | false | 5.555556 | [
"-ab = [list(map(int, readline().split())) for i in range(m)]",
"-ans = [0] * n",
"-for a, b in ab:",
"- ans[a - 1] += 1",
"- ans[b - 1] += 1",
"-for i in range(n):",
"- if ans[i] % 2 == 1:",
"+check = [0] * (n + 1)",
"+for i in range(m):",
"+ a, b = list(map(int, readline().split()))"... | false | 0.04791 | 0.044606 | 1.074078 | [
"s674862687",
"s945528268"
] |
u214617707 | p03338 | python | s140180198 | s375942910 | 22 | 18 | 3,064 | 3,060 | Accepted | Accepted | 18.18 | n = int(eval(input()))
s = eval(input())
num = 0
for i in range(len(s)):
t1 = s[:i]
t2 = s[i:]
rec = 0
rec1 = []
for j in range(len(s)):
if s[j] in t1 and s[j] in t2 and s[j] not in rec1:
rec += 1
rec1.append(s[j])
num = max(num, rec)
print(num) | n = int(eval(input()))
s = eval(input())
num = 0
for i in range(1, n):
q = s[:i]
p = s[i:]
tmp1 = set()
for j in q:
tmp1.add(j)
tmp2 = set()
for j in p:
tmp2.add(j)
num = max(num, len(tmp1 & tmp2))
print(num)
| 15 | 16 | 304 | 258 | n = int(eval(input()))
s = eval(input())
num = 0
for i in range(len(s)):
t1 = s[:i]
t2 = s[i:]
rec = 0
rec1 = []
for j in range(len(s)):
if s[j] in t1 and s[j] in t2 and s[j] not in rec1:
rec += 1
rec1.append(s[j])
num = max(num, rec)
print(num)
| n = int(eval(input()))
s = eval(input())
num = 0
for i in range(1, n):
q = s[:i]
p = s[i:]
tmp1 = set()
for j in q:
tmp1.add(j)
tmp2 = set()
for j in p:
tmp2.add(j)
num = max(num, len(tmp1 & tmp2))
print(num)
| false | 6.25 | [
"-for i in range(len(s)):",
"- t1 = s[:i]",
"- t2 = s[i:]",
"- rec = 0",
"- rec1 = []",
"- for j in range(len(s)):",
"- if s[j] in t1 and s[j] in t2 and s[j] not in rec1:",
"- rec += 1",
"- rec1.append(s[j])",
"- num = max(num, rec)",
"+for i in ran... | false | 0.035522 | 0.035917 | 0.989014 | [
"s140180198",
"s375942910"
] |
u347640436 | p03167 | python | s744765402 | s782863673 | 1,298 | 699 | 43,712 | 43,648 | Accepted | Accepted | 46.15 | divisor = 10 ** 9 + 7
h, w = list(map(int, input().split()))
a = [eval(input()) for _ in range(h)]
dp = [[0] * w for _ in range(h)]
dp[0][0] = 1
for i in range(h):
for j in range(w):
if i + 1 < h and a[i + 1][j] != '#':
dp[i + 1][j] = (dp[i + 1][j] + dp[i][j]) % divisor
if j + 1 < w and a[i][j ... | def main():
divisor = 10 ** 9 + 7
h, w = list(map(int, input().split()))
a = [eval(input()) for _ in range(h)]
dp = [[0] * w for _ in range(h)]
dp[0][0] = 1
for i in range(h):
ai = a[i]
dpi = dp[i]
if i + 1 < h:
ai1 = a[i + 1]
dpi1 = dp[i + 1]
for j in range(w... | 12 | 19 | 404 | 528 | divisor = 10**9 + 7
h, w = list(map(int, input().split()))
a = [eval(input()) for _ in range(h)]
dp = [[0] * w for _ in range(h)]
dp[0][0] = 1
for i in range(h):
for j in range(w):
if i + 1 < h and a[i + 1][j] != "#":
dp[i + 1][j] = (dp[i + 1][j] + dp[i][j]) % divisor
if j + 1 < w and a[... | def main():
divisor = 10**9 + 7
h, w = list(map(int, input().split()))
a = [eval(input()) for _ in range(h)]
dp = [[0] * w for _ in range(h)]
dp[0][0] = 1
for i in range(h):
ai = a[i]
dpi = dp[i]
if i + 1 < h:
ai1 = a[i + 1]
dpi1 = dp[i + 1]
... | false | 36.842105 | [
"-divisor = 10**9 + 7",
"-h, w = list(map(int, input().split()))",
"-a = [eval(input()) for _ in range(h)]",
"-dp = [[0] * w for _ in range(h)]",
"-dp[0][0] = 1",
"-for i in range(h):",
"- for j in range(w):",
"- if i + 1 < h and a[i + 1][j] != \"#\":",
"- dp[i + 1][j] = (dp[i +... | false | 0.036108 | 0.037358 | 0.966536 | [
"s744765402",
"s782863673"
] |
u327466606 | p03704 | python | s730269651 | s437989633 | 20 | 18 | 3,188 | 3,064 | Accepted | Accepted | 10 | # (10-x) ways: (0,x)-(9-x,9) -> (x, -x) <- This should never happens when D > 0
# (x) ways: (10-x,0)-(9,x-1) -> (x-10, 10 - x)
def solve(d, k, outer):
if k <= 1:
return 10**k if d == 0 else 0
# if d >= 10**k:
# return 0
t = (-d)%10 # 10-d%10 doesn't work when d = 10
d -= t*10**(... | def solve(d, K):
r = 1
for k in range(K,1,-2):
if d >= 10**k:
return 0
t = (-d)%10
d = abs((d-t*(10**(k-1)-1))//10)
r *= 10-t-(K==k)
return r*(10**(K%2)) if d == 0 else 0
D = int(eval(input()))
result = 0
l = len(str(D))
for k in range(l,2*l+1):
result += solve(D, k)
prin... | 19 | 17 | 477 | 323 | # (10-x) ways: (0,x)-(9-x,9) -> (x, -x) <- This should never happens when D > 0
# (x) ways: (10-x,0)-(9,x-1) -> (x-10, 10 - x)
def solve(d, k, outer):
if k <= 1:
return 10**k if d == 0 else 0
# if d >= 10**k:
# return 0
t = (-d) % 10 # 10-d%10 doesn't work when d = 10
d -= t ... | def solve(d, K):
r = 1
for k in range(K, 1, -2):
if d >= 10**k:
return 0
t = (-d) % 10
d = abs((d - t * (10 ** (k - 1) - 1)) // 10)
r *= 10 - t - (K == k)
return r * (10 ** (K % 2)) if d == 0 else 0
D = int(eval(input()))
result = 0
l = len(str(D))
for k in rang... | false | 10.526316 | [
"-# (10-x) ways: (0,x)-(9-x,9) -> (x, -x) <- This should never happens when D > 0",
"-# (x) ways: (10-x,0)-(9,x-1) -> (x-10, 10 - x)",
"-def solve(d, k, outer):",
"- if k <= 1:",
"- return 10**k if d == 0 else 0",
"- # if d >= 10**k:",
"- # return 0",
"- t = (-d) % 10... | false | 0.075552 | 0.089657 | 0.842686 | [
"s730269651",
"s437989633"
] |
u282228874 | p03069 | python | s833975489 | s809607511 | 210 | 97 | 20,712 | 3,500 | Accepted | Accepted | 53.81 | import sys
sys.setrecursionlimit(10**7)
input = sys.stdin.readline
INF = float('inf')
MOD = 10**9+7
n = int(eval(input()))
S = eval(input())
W = [0]*(2*10**5+1)
B = [0]*(2*10**5+1)
for i in range(n):
if S[i] == '.':
W[i] = 1
else:
B[i] = 1
for i in range(1,2*10**5+1):
W[i] +... | n = int(eval(input()))
S = eval(input())
b = 0
w = S.count('.')
res = w
for s in S:
if s == '.':
w -= 1
else:
b += 1
res = min(res,b+w)
print(res)
| 26 | 13 | 480 | 155 | import sys
sys.setrecursionlimit(10**7)
input = sys.stdin.readline
INF = float("inf")
MOD = 10**9 + 7
n = int(eval(input()))
S = eval(input())
W = [0] * (2 * 10**5 + 1)
B = [0] * (2 * 10**5 + 1)
for i in range(n):
if S[i] == ".":
W[i] = 1
else:
B[i] = 1
for i in range(1, 2 * 10**5 + 1):
W[i... | n = int(eval(input()))
S = eval(input())
b = 0
w = S.count(".")
res = w
for s in S:
if s == ".":
w -= 1
else:
b += 1
res = min(res, b + w)
print(res)
| false | 50 | [
"-import sys",
"-",
"-sys.setrecursionlimit(10**7)",
"-input = sys.stdin.readline",
"-INF = float(\"inf\")",
"-MOD = 10**9 + 7",
"-W = [0] * (2 * 10**5 + 1)",
"-B = [0] * (2 * 10**5 + 1)",
"-for i in range(n):",
"- if S[i] == \".\":",
"- W[i] = 1",
"+b = 0",
"+w = S.count(\".\")",
... | false | 0.04187 | 0.037707 | 1.110406 | [
"s833975489",
"s809607511"
] |
u319245933 | p03470 | python | s632762580 | s060532441 | 34 | 29 | 9,376 | 9,156 | Accepted | Accepted | 14.71 | from collections import Counter
N, *D = list(map(int, open(0).read().split()))
print((len(Counter(D).most_common()))) | N, *D = list(map(int, open(0).read().split()))
print((len(set(D)))) | 5 | 3 | 115 | 62 | from collections import Counter
N, *D = list(map(int, open(0).read().split()))
print((len(Counter(D).most_common())))
| N, *D = list(map(int, open(0).read().split()))
print((len(set(D))))
| false | 40 | [
"-from collections import Counter",
"-",
"-print((len(Counter(D).most_common())))",
"+print((len(set(D))))"
] | false | 0.043952 | 0.045826 | 0.959098 | [
"s632762580",
"s060532441"
] |
u585482323 | p02874 | python | s648306625 | s793556049 | 856 | 747 | 91,792 | 76,892 | Accepted | Accepted | 12.73 | #!usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
import sys
import math
import bisect
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS():return [list(x) for x in sys.stdin.readline().split()]
def ... | #!usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
import sys
import math
import bisect
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS():return [list(x) for x in sys.stdin.readline().split()]
def ... | 89 | 82 | 2,526 | 2,293 | #!usr/bin/env python3
from collections import defaultdict, deque
from heapq import heappush, heappop
import sys
import math
import bisect
def LI():
return [int(x) for x in sys.stdin.readline().split()]
def I():
return int(sys.stdin.readline())
def LS():
return [list(x) for x in sys.stdin.readline().sp... | #!usr/bin/env python3
from collections import defaultdict, deque
from heapq import heappush, heappop
import sys
import math
import bisect
def LI():
return [int(x) for x in sys.stdin.readline().split()]
def I():
return int(sys.stdin.readline())
def LS():
return [list(x) for x in sys.stdin.readline().sp... | false | 7.865169 | [
"- swaglr = SlidingWindowAggretgation(float(\"inf\"), min)",
"- swagrl = SlidingWindowAggretgation(0, max)",
"- swagrl.append(l)",
"- swaglr.append(r)",
"- swagrl.popleft()",
"- lr = swaglr.get()",
"- rl = swagrl.get()",
"- k = max(lr - ll + 1, 0) + max(... | false | 0.038754 | 0.045081 | 0.859658 | [
"s648306625",
"s793556049"
] |
u088552457 | p04034 | python | s558023281 | s979220603 | 353 | 225 | 4,596 | 76,324 | Accepted | Accepted | 36.26 | def main():
n, m = input_list()
box = [False]*n
box[0] = True
nums = [1]*n
for i in range(m):
x, y = input_list()
if box[x-1]:
box[y-1] = True
nums[x-1] = nums[x-1] - 1
nums[y-1] = nums[y-1] + 1
if nums[x-1] == 0:
box[x-1] = False
print((box.count(True)))
... | # import sys
# input = sys.stdin.readline
import itertools
# 持っているビスケットを叩き、1枚増やす
# ビスケット A枚を 1円に交換する
# 1円をビスケット B枚に交換する
def main():
n, m = input_list()
balls = [1] * n
reds = [False] * n
reds[0] = True
for _ in range(m):
x, y = input_list()
if reds[x-1]:
... | 21 | 38 | 396 | 710 | def main():
n, m = input_list()
box = [False] * n
box[0] = True
nums = [1] * n
for i in range(m):
x, y = input_list()
if box[x - 1]:
box[y - 1] = True
nums[x - 1] = nums[x - 1] - 1
nums[y - 1] = nums[y - 1] + 1
if nums[x - 1] == 0:
box[... | # import sys
# input = sys.stdin.readline
import itertools
# 持っているビスケットを叩き、1枚増やす
# ビスケット A枚を 1円に交換する
# 1円をビスケット B枚に交換する
def main():
n, m = input_list()
balls = [1] * n
reds = [False] * n
reds[0] = True
for _ in range(m):
x, y = input_list()
if reds[x - 1]:
reds[y - 1] = ... | false | 44.736842 | [
"+# import sys",
"+# input = sys.stdin.readline",
"+import itertools",
"+",
"+# 持っているビスケットを叩き、1枚増やす",
"+# ビスケット A枚を 1円に交換する",
"+# 1円をビスケット B枚に交換する",
"- box = [False] * n",
"- box[0] = True",
"- nums = [1] * n",
"- for i in range(m):",
"+ balls = [1] * n",
"+ reds = [False] ... | false | 0.03622 | 0.056908 | 0.636468 | [
"s558023281",
"s979220603"
] |
u057109575 | p02913 | python | s748304512 | s011156290 | 742 | 279 | 48,860 | 49,264 | Accepted | Accepted | 62.4 | N = int(eval(input()))
S = eval(input())
def z_algorithm(s):
n = len(s)
res = [0] * n
i = 1
j = 0
while i < n:
while i + j < n and s[j] == s[i + j]:
j += 1
res[i] = j
if j == 0:
i += 1
continue
... | N = int(eval(input()))
S = eval(input())
class RollingHash:
base1 = 1007
base2 = 2009
mod1 = 10 ** 9 + 7
mod2 = 10 ** 9 + 9
def __init__(self, s):
self.s = s
n = len(s)
self.hash1 = [0] * (n + 1)
self.hash2 = [0] * (n + 1)
self.... | 36 | 74 | 637 | 1,987 | N = int(eval(input()))
S = eval(input())
def z_algorithm(s):
n = len(s)
res = [0] * n
i = 1
j = 0
while i < n:
while i + j < n and s[j] == s[i + j]:
j += 1
res[i] = j
if j == 0:
i += 1
continue
k = 1
while i + k < n and k ... | N = int(eval(input()))
S = eval(input())
class RollingHash:
base1 = 1007
base2 = 2009
mod1 = 10**9 + 7
mod2 = 10**9 + 9
def __init__(self, s):
self.s = s
n = len(s)
self.hash1 = [0] * (n + 1)
self.hash2 = [0] * (n + 1)
self.power1 = [1] * (n + 1)
se... | false | 51.351351 | [
"-def z_algorithm(s):",
"- n = len(s)",
"- res = [0] * n",
"- i = 1",
"- j = 0",
"- while i < n:",
"- while i + j < n and s[j] == s[i + j]:",
"- j += 1",
"- res[i] = j",
"- if j == 0:",
"- i += 1",
"- continue",
"- k... | false | 0.033772 | 0.042134 | 0.801552 | [
"s748304512",
"s011156290"
] |
u537962130 | p03814 | python | s893242383 | s587821569 | 191 | 65 | 40,688 | 64,448 | Accepted | Accepted | 65.97 | def resolve():
s=eval(input())
t=0
while s[t]!='A':
t+=1
b=-1
while s[b]!='Z':
b-=1
print((len(s[t:b])+1))
resolve() | s=eval(input())
t,b=0,len(s)-1
while s[t]!='A':
t+=1
while s[b]!='Z':
b-=1
print((b-t+1)) | 10 | 7 | 157 | 89 | def resolve():
s = eval(input())
t = 0
while s[t] != "A":
t += 1
b = -1
while s[b] != "Z":
b -= 1
print((len(s[t:b]) + 1))
resolve()
| s = eval(input())
t, b = 0, len(s) - 1
while s[t] != "A":
t += 1
while s[b] != "Z":
b -= 1
print((b - t + 1))
| false | 30 | [
"-def resolve():",
"- s = eval(input())",
"- t = 0",
"- while s[t] != \"A\":",
"- t += 1",
"- b = -1",
"- while s[b] != \"Z\":",
"- b -= 1",
"- print((len(s[t:b]) + 1))",
"-",
"-",
"-resolve()",
"+s = eval(input())",
"+t, b = 0, len(s) - 1",
"+while s[t] !... | false | 0.007563 | 0.036636 | 0.206426 | [
"s893242383",
"s587821569"
] |
u077291787 | p03459 | python | s403787477 | s205958353 | 370 | 333 | 3,060 | 3,060 | Accepted | Accepted | 10 | # ARC089C - Traveling (ABC086C)
n = int(eval(input()))
for _ in range(n):
t, x, y = list(map(int, input().split()))
if x + y > t or (t + x + y) % 2 != 0:
print("No")
break
else:
print("Yes") | # ARC089C - Traveling (ABC086C)
def main():
n = int(eval(input()))
for _ in range(n):
t, x, y = list(map(int, input().split()))
if x + y > t or (t + x + y) % 2 != 0:
print("No")
break
else:
print("Yes")
if __name__ == "__main__":
main() | 9 | 14 | 220 | 309 | # ARC089C - Traveling (ABC086C)
n = int(eval(input()))
for _ in range(n):
t, x, y = list(map(int, input().split()))
if x + y > t or (t + x + y) % 2 != 0:
print("No")
break
else:
print("Yes")
| # ARC089C - Traveling (ABC086C)
def main():
n = int(eval(input()))
for _ in range(n):
t, x, y = list(map(int, input().split()))
if x + y > t or (t + x + y) % 2 != 0:
print("No")
break
else:
print("Yes")
if __name__ == "__main__":
main()
| false | 35.714286 | [
"-n = int(eval(input()))",
"-for _ in range(n):",
"- t, x, y = list(map(int, input().split()))",
"- if x + y > t or (t + x + y) % 2 != 0:",
"- print(\"No\")",
"- break",
"-else:",
"- print(\"Yes\")",
"+def main():",
"+ n = int(eval(input()))",
"+ for _ in range(n):",... | false | 0.04759 | 0.047727 | 0.997138 | [
"s403787477",
"s205958353"
] |
u753803401 | p02948 | python | s746597229 | s193804488 | 1,560 | 932 | 95,196 | 75,740 | Accepted | Accepted | 40.26 | def slove():
import sys
import heapq
input = sys.stdin.readline
n, m = list(map(int, input().rstrip('\n').split()))
l = [list(map(int, input().rstrip('\n').split())) for _ in range(n)]
r = []
heapq.heapify(l)
heapq.heapify(r)
t = 0
for i in range(m + 1):
while ... | def slove():
import sys
import heapq
input = sys.stdin.readline
n, m = list(map(int, input().rstrip('\n').split()))
ls =[]
v = []
heapq.heapify(v)
for i in range(n):
a, b = list(map(int, input().rstrip('\n').split()))
ls.append([a, b])
ls.sort(reverse=True)... | 28 | 31 | 726 | 769 | def slove():
import sys
import heapq
input = sys.stdin.readline
n, m = list(map(int, input().rstrip("\n").split()))
l = [list(map(int, input().rstrip("\n").split())) for _ in range(n)]
r = []
heapq.heapify(l)
heapq.heapify(r)
t = 0
for i in range(m + 1):
while True:
... | def slove():
import sys
import heapq
input = sys.stdin.readline
n, m = list(map(int, input().rstrip("\n").split()))
ls = []
v = []
heapq.heapify(v)
for i in range(n):
a, b = list(map(int, input().rstrip("\n").split()))
ls.append([a, b])
ls.sort(reverse=True)
r = ... | false | 9.677419 | [
"- l = [list(map(int, input().rstrip(\"\\n\").split())) for _ in range(n)]",
"- r = []",
"- heapq.heapify(l)",
"- heapq.heapify(r)",
"- t = 0",
"- for i in range(m + 1):",
"+ ls = []",
"+ v = []",
"+ heapq.heapify(v)",
"+ for i in range(n):",
"+ a, b = list(m... | false | 0.032653 | 0.035049 | 0.931654 | [
"s746597229",
"s193804488"
] |
u716530146 | p03026 | python | s322729058 | s678515908 | 278 | 69 | 49,116 | 6,260 | Accepted | Accepted | 75.18 | #!/usr/bin/env python3
import sys, math, itertools, collections, bisect
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
inf = float('inf') ;mod = 10**9+7
mans = inf ;ans = 0 ;count = 0 ;pro = 1
n = int(eval(input()))
G = [[] for i in range(n)]
F = [-1]*n
AB = []
for i in range(n-1):
a... | #!/usr/bin/env python3
import sys, math, itertools, collections, bisect
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
inf = float('inf') ;mod = 10**9+7
mans = inf ;ans = 0 ;count = 0 ;pro = 1
n = int(eval(input()))
G = [[] for i in range(n)]
for i in range(n-1):
a,b = list(map(int,inp... | 38 | 30 | 862 | 699 | #!/usr/bin/env python3
import sys, math, itertools, collections, bisect
input = lambda: sys.stdin.buffer.readline().rstrip().decode("utf-8")
inf = float("inf")
mod = 10**9 + 7
mans = inf
ans = 0
count = 0
pro = 1
n = int(eval(input()))
G = [[] for i in range(n)]
F = [-1] * n
AB = []
for i in range(n - 1):
a, b = l... | #!/usr/bin/env python3
import sys, math, itertools, collections, bisect
input = lambda: sys.stdin.buffer.readline().rstrip().decode("utf-8")
inf = float("inf")
mod = 10**9 + 7
mans = inf
ans = 0
count = 0
pro = 1
n = int(eval(input()))
G = [[] for i in range(n)]
for i in range(n - 1):
a, b = list(map(int, input().... | false | 21.052632 | [
"-F = [-1] * n",
"-AB = []",
"- AB.append((a, b))",
"-C = sorted(map(int, input().split()), reverse=True)",
"-for i in range(n):",
"- G[i].sort(key=lambda x: len(G[x]))",
"-m = max(list(range(n)), key=lambda x: len(G[x]))",
"-count = 1",
"-que = collections.deque()",
"-que.append(m)",
"-F[... | false | 0.047263 | 0.047174 | 1.001884 | [
"s322729058",
"s678515908"
] |
u902973687 | p03164 | python | s888765270 | s413450815 | 1,588 | 670 | 173,640 | 171,376 | Accepted | Accepted | 57.81 | MAX_V = 100100
MAX_N = 101
INF = pow(2, 63)
N, W = list(map(int, input().split()))
w = [0 for _ in range(N)]
v = [0 for _ in range(N)]
for i in range(N):
w[i], v[i] = list(map(int, input().split()))
dp = [[INF for _ in range(MAX_V)] for _ in range(N + 1)]
dp[0][0] = 0
for i in range(N):
for sum_v... | MAX_V = 100100
MAX_N = 101
INF = pow(2, 62)
N, W = list(map(int, input().split()))
w = [0 for _ in range(N)]
v = [0 for _ in range(N)]
for i in range(N):
w[i], v[i] = list(map(int, input().split()))
dp = [[INF for _ in range(MAX_V)] for _ in range(N + 1)]
dp[0][0] = 0
for i in range(N):
for sum_v... | 25 | 25 | 713 | 713 | MAX_V = 100100
MAX_N = 101
INF = pow(2, 63)
N, W = list(map(int, input().split()))
w = [0 for _ in range(N)]
v = [0 for _ in range(N)]
for i in range(N):
w[i], v[i] = list(map(int, input().split()))
dp = [[INF for _ in range(MAX_V)] for _ in range(N + 1)]
dp[0][0] = 0
for i in range(N):
for sum_v in range(MAX_V... | MAX_V = 100100
MAX_N = 101
INF = pow(2, 62)
N, W = list(map(int, input().split()))
w = [0 for _ in range(N)]
v = [0 for _ in range(N)]
for i in range(N):
w[i], v[i] = list(map(int, input().split()))
dp = [[INF for _ in range(MAX_V)] for _ in range(N + 1)]
dp[0][0] = 0
for i in range(N):
for sum_v in range(MAX_V... | false | 0 | [
"-INF = pow(2, 63)",
"+INF = pow(2, 62)"
] | false | 1.510359 | 1.193351 | 1.265645 | [
"s888765270",
"s413450815"
] |
u151625340 | p03212 | python | s521707462 | s860476771 | 53 | 37 | 7,304 | 6,060 | Accepted | Accepted | 30.19 | N = int(eval(input()))
def n_ary(l,d): # リストl中の文字でd桁までを全列挙(sorted)
if d == 1:
return(l)
n = len(l)
ll = n_ary(l,d-1)
lll = []
for i in l:
for j in ll[n*(n**(d-2)-1)//(n-1):]:
lll.append(i+j)
return(ll+lll)
possible = [i.replace('0','3').replace('1', '5').re... | N = int(eval(input()))
def n_ary(l,d): # リストl中の文字でd桁までを全列挙(sorted)
if d == 1:
return(l)
n = len(l)
ll = n_ary(l,d-1)
lll = []
for i in l:
for j in ll[n*(n**(d-2)-1)//(n-1):]:
lll.append(i+j)
return(ll+lll)
possible = [i for i in n_ary(['3','5','7'],9)] # 制約... | 13 | 13 | 472 | 420 | N = int(eval(input()))
def n_ary(l, d): # リストl中の文字でd桁までを全列挙(sorted)
if d == 1:
return l
n = len(l)
ll = n_ary(l, d - 1)
lll = []
for i in l:
for j in ll[n * (n ** (d - 2) - 1) // (n - 1) :]:
lll.append(i + j)
return ll + lll
possible = [
i.replace("0", "3").r... | N = int(eval(input()))
def n_ary(l, d): # リストl中の文字でd桁までを全列挙(sorted)
if d == 1:
return l
n = len(l)
ll = n_ary(l, d - 1)
lll = []
for i in l:
for j in ll[n * (n ** (d - 2) - 1) // (n - 1) :]:
lll.append(i + j)
return ll + lll
possible = [i for i in n_ary(["3", "5"... | false | 0 | [
"-possible = [",
"- i.replace(\"0\", \"3\").replace(\"1\", \"5\").replace(\"2\", \"7\")",
"- for i in n_ary([\"0\", \"1\", \"2\"], 9)",
"-] # 制約が10^9なので9",
"+possible = [i for i in n_ary([\"3\", \"5\", \"7\"], 9)] # 制約が10**9なので9"
] | false | 0.065506 | 0.05071 | 1.291779 | [
"s521707462",
"s860476771"
] |
u814663076 | p03141 | python | s384301056 | s424590450 | 732 | 357 | 60,576 | 29,152 | Accepted | Accepted | 51.23 | N = int(eval(input()))
A = [0] * N
B = [0] * N
Sum = [[0] * 2 for i in range(N)]
for i in range(N):
A[i], B[i] = list(map(int, input().split()))
Sum[i][0] = i
Sum[i][1] = A[i] + B[i]
a = 0
b = 0
turn = 0
Sum.sort(key=lambda x:x[1], reverse=True)
for i in range(N):
if turn ==... | import sys
input = sys.stdin.readline
N = int(eval(input()))
A = [0] * N
B = [0] * N
Sum = [[0] * 2 for i in range(N)]
for i in range(N):
A[i], B[i] = list(map(int, input().split()))
Sum[i][0] = i
Sum[i][1] = A[i] + B[i]
a = 0
b = 0
turn = 0
Sum.sort(key=lambda x:x[1], reverse=True)... | 25 | 28 | 428 | 471 | N = int(eval(input()))
A = [0] * N
B = [0] * N
Sum = [[0] * 2 for i in range(N)]
for i in range(N):
A[i], B[i] = list(map(int, input().split()))
Sum[i][0] = i
Sum[i][1] = A[i] + B[i]
a = 0
b = 0
turn = 0
Sum.sort(key=lambda x: x[1], reverse=True)
for i in range(N):
if turn == 0:
a += A[Sum[i][0]... | import sys
input = sys.stdin.readline
N = int(eval(input()))
A = [0] * N
B = [0] * N
Sum = [[0] * 2 for i in range(N)]
for i in range(N):
A[i], B[i] = list(map(int, input().split()))
Sum[i][0] = i
Sum[i][1] = A[i] + B[i]
a = 0
b = 0
turn = 0
Sum.sort(key=lambda x: x[1], reverse=True)
for i in range(N):
... | false | 10.714286 | [
"+import sys",
"+",
"+input = sys.stdin.readline"
] | false | 0.035604 | 0.03349 | 1.063144 | [
"s384301056",
"s424590450"
] |
u241159583 | p03574 | python | s050992980 | s854556282 | 28 | 23 | 3,064 | 3,064 | Accepted | Accepted | 17.86 | H, W = list(map(int, input().split()))
S = [list(eval(input())) for _ in range(H)]
dx = [1, 1, 0, -1, -1, -1, 0, 1]
dy = [0, 1, 1, 1, 0, -1, -1, -1]
c = 0
for i in range(H):
if S[i] != "#" * W:
for j in range(W):
if S[i][j] == ".":
S[i][j] = "0"
else:
c += 1
if c != H *... | H, W = list(map(int, input().split()))
S = [list(eval(input())) for _ in range(H)]
for s in S:
for i in range(W):
if s[i] == ".": s[i] = 0
for i in range(H):
for j in range(W):
if S[i][j] == "#":
if i > 0:
if S[i-1][j] != "#": S[i-1][j] += 1
... | 31 | 23 | 658 | 812 | H, W = list(map(int, input().split()))
S = [list(eval(input())) for _ in range(H)]
dx = [1, 1, 0, -1, -1, -1, 0, 1]
dy = [0, 1, 1, 1, 0, -1, -1, -1]
c = 0
for i in range(H):
if S[i] != "#" * W:
for j in range(W):
if S[i][j] == ".":
S[i][j] = "0"
else:
... | H, W = list(map(int, input().split()))
S = [list(eval(input())) for _ in range(H)]
for s in S:
for i in range(W):
if s[i] == ".":
s[i] = 0
for i in range(H):
for j in range(W):
if S[i][j] == "#":
if i > 0:
if S[i - 1][j] != "#":
S[i - 1... | false | 25.806452 | [
"-dx = [1, 1, 0, -1, -1, -1, 0, 1]",
"-dy = [0, 1, 1, 1, 0, -1, -1, -1]",
"-c = 0",
"+for s in S:",
"+ for i in range(W):",
"+ if s[i] == \".\":",
"+ s[i] = 0",
"- if S[i] != \"#\" * W:",
"- for j in range(W):",
"- if S[i][j] == \".\":",
"- ... | false | 0.049859 | 0.050595 | 0.985454 | [
"s050992980",
"s854556282"
] |
u242031676 | p03274 | python | s701349004 | s940826906 | 72 | 58 | 14,052 | 14,052 | Accepted | Accepted | 19.44 | n,k,*a=list(map(int,open(0).read().split()));print((min([a[i+k-1]-a[i]+min(abs(a[i+k-1]),abs(a[i]))for i in range(n-k+1)]))) | n,k,*a=list(map(int,open(0).read().split()));print((min([r-l+min(abs(l),abs(r))for l,r in zip(a,a[k-1:])]))) | 1 | 1 | 116 | 100 | n, k, *a = list(map(int, open(0).read().split()))
print(
(
min(
[
a[i + k - 1] - a[i] + min(abs(a[i + k - 1]), abs(a[i]))
for i in range(n - k + 1)
]
)
)
)
| n, k, *a = list(map(int, open(0).read().split()))
print((min([r - l + min(abs(l), abs(r)) for l, r in zip(a, a[k - 1 :])])))
| false | 0 | [
"-print(",
"- (",
"- min(",
"- [",
"- a[i + k - 1] - a[i] + min(abs(a[i + k - 1]), abs(a[i]))",
"- for i in range(n - k + 1)",
"- ]",
"- )",
"- )",
"-)",
"+print((min([r - l + min(abs(l), abs(r)) for l, r in zip(a, a[k - 1 :... | false | 0.042817 | 0.037972 | 1.127594 | [
"s701349004",
"s940826906"
] |
u241190159 | p02900 | python | s431109837 | s928745999 | 273 | 166 | 64,364 | 38,512 | Accepted | Accepted | 39.19 | import fractions
def main():
A, B = list(map(int, input().split()))
n = fractions.gcd(A, B)
print((num_prime_factor(n)))
def num_prime_factor(n):
if n == 1: return 1
ret = 1
cursor = 2
if n % cursor == 0: ret += 1
while n % cursor == 0: n = n // cursor
... | def main():
A, B = list(map(int, input().split()))
while B!= 0: A, B = B, A % B
print((num_prime_factor(A)))
def num_prime_factor(n):
if n == 1: return 1
ret = 1
cursor = 2
if n % cursor == 0: ret += 1
while n % cursor == 0: n = n // cursor
cursor = 3
... | 30 | 27 | 586 | 570 | import fractions
def main():
A, B = list(map(int, input().split()))
n = fractions.gcd(A, B)
print((num_prime_factor(n)))
def num_prime_factor(n):
if n == 1:
return 1
ret = 1
cursor = 2
if n % cursor == 0:
ret += 1
while n % cursor == 0:
n = n // cursor
cur... | def main():
A, B = list(map(int, input().split()))
while B != 0:
A, B = B, A % B
print((num_prime_factor(A)))
def num_prime_factor(n):
if n == 1:
return 1
ret = 1
cursor = 2
if n % cursor == 0:
ret += 1
while n % cursor == 0:
n = n // cursor
cursor =... | false | 10 | [
"-import fractions",
"-",
"-",
"- n = fractions.gcd(A, B)",
"- print((num_prime_factor(n)))",
"+ while B != 0:",
"+ A, B = B, A % B",
"+ print((num_prime_factor(A)))"
] | false | 0.063556 | 0.047722 | 1.331807 | [
"s431109837",
"s928745999"
] |
u716530146 | p02901 | python | s531424428 | s980504584 | 1,597 | 682 | 3,444 | 186,392 | Accepted | Accepted | 57.29 | import itertools
import sys
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 7)
N, M = list(map(int, readline().split()))
AB = []
C = []
for _ in range(M):
AB.append(tuple(int(x) for x in readline().split()))
C.append(sum(1 << (int(x)-1) for x in readline().s... | #!/usr/bin/env python3
import sys, math, itertools, collections, bisect
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
inf = float('inf') ;mod = 10**9+7
mans = inf ;ans = 0 ;count = 0 ;pro = 1
n,m=list(map(int,input().split()))
A=[0]*(m+1); S=[0]*m
for i in range(m):
a,b=list(map(i... | 27 | 32 | 582 | 943 | import itertools
import sys
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10**7)
N, M = list(map(int, readline().split()))
AB = []
C = []
for _ in range(M):
AB.append(tuple(int(x) for x in readline().split()))
C.append(sum(1 << (int(x) - 1) for x in readline().split()))
IN... | #!/usr/bin/env python3
import sys, math, itertools, collections, bisect
input = lambda: sys.stdin.buffer.readline().rstrip().decode("utf-8")
inf = float("inf")
mod = 10**9 + 7
mans = inf
ans = 0
count = 0
pro = 1
n, m = list(map(int, input().split()))
A = [0] * (m + 1)
S = [0] * m
for i in range(m):
a, b = list(ma... | false | 15.625 | [
"-import itertools",
"-import sys",
"+#!/usr/bin/env python3",
"+import sys, math, itertools, collections, bisect",
"-readline = sys.stdin.readline",
"-readlines = sys.stdin.readlines",
"-sys.setrecursionlimit(10**7)",
"-N, M = list(map(int, readline().split()))",
"-AB = []",
"-C = []",
"-for _ ... | false | 0.03694 | 0.047521 | 0.777345 | [
"s531424428",
"s980504584"
] |
u956433805 | p02879 | python | s465332971 | s906630381 | 20 | 17 | 3,316 | 2,940 | Accepted | Accepted | 15 | A, B = list(map(int, input().split()))
if A >= 10 or B >= 10:
print((-1))
exit()
ans = A * B
print(ans) | A, B = list(map(int, input().split()))
if 1 <= A <= 9 and 1 <= B <= 9:
print((A*B))
else:
print((-1)) | 8 | 6 | 112 | 106 | A, B = list(map(int, input().split()))
if A >= 10 or B >= 10:
print((-1))
exit()
ans = A * B
print(ans)
| A, B = list(map(int, input().split()))
if 1 <= A <= 9 and 1 <= B <= 9:
print((A * B))
else:
print((-1))
| false | 25 | [
"-if A >= 10 or B >= 10:",
"+if 1 <= A <= 9 and 1 <= B <= 9:",
"+ print((A * B))",
"+else:",
"- exit()",
"-ans = A * B",
"-print(ans)"
] | false | 0.066133 | 0.069004 | 0.958393 | [
"s465332971",
"s906630381"
] |
u079022693 | p02714 | python | s875018255 | s007419241 | 831 | 186 | 9,048 | 28,040 | Accepted | Accepted | 77.62 | from sys import stdin
def main():
#入力
readline=stdin.readline
n=int(readline())
s=readline().strip()
ans=s.count("R")*s.count("G")*s.count("B")
for i in range(n):
for j in range(i+1,n):
k=2*j-i
if k>=n: break
x=s[i]
y=s[j]
... | from sys import stdin
import numpy as np
def main():
#入力
readline=stdin.readline
n=int(readline())
s=readline().strip()
t=np.array([1 if s[i]=="R" else 2 if s[i]=="G" else 3 for i in range(n)],dtype=np.int64)
ans=t[t==1].size*t[t==2].size*t[t==3].size
for i in range(n):
i... | 22 | 28 | 458 | 675 | from sys import stdin
def main():
# 入力
readline = stdin.readline
n = int(readline())
s = readline().strip()
ans = s.count("R") * s.count("G") * s.count("B")
for i in range(n):
for j in range(i + 1, n):
k = 2 * j - i
if k >= n:
break
x... | from sys import stdin
import numpy as np
def main():
# 入力
readline = stdin.readline
n = int(readline())
s = readline().strip()
t = np.array(
[1 if s[i] == "R" else 2 if s[i] == "G" else 3 for i in range(n)],
dtype=np.int64,
)
ans = t[t == 1].size * t[t == 2].size * t[t == 3... | false | 21.428571 | [
"+import numpy as np",
"- ans = s.count(\"R\") * s.count(\"G\") * s.count(\"B\")",
"+ t = np.array(",
"+ [1 if s[i] == \"R\" else 2 if s[i] == \"G\" else 3 for i in range(n)],",
"+ dtype=np.int64,",
"+ )",
"+ ans = t[t == 1].size * t[t == 2].size * t[t == 3].size",
"- ... | false | 0.093882 | 0.297896 | 0.31515 | [
"s875018255",
"s007419241"
] |
u794173881 | p02844 | python | s649030068 | s971100859 | 262 | 200 | 44,892 | 42,096 | Accepted | Accepted | 23.66 | n = int(eval(input()))
s= eval(input())
next_ = [[-1]*(n+1) for i in range(10)]
for num in range(10):
pos = -1
for i in range(n)[::-1]:
next_[num][i] = pos
if num == int(s[i]):
pos = i
start = [-1] * 10
for num in range(10):
for i in range(n)[::-1]:
if num... | n = int(eval(input()))
s = eval(input())
alph = "0123456789"
next_ = [[-1] * (n + 1) for i in range(len(alph))]
for ai in range(len(alph)):
tmp = - 1
for si in range(n)[::-1]:
if s[si] == alph[ai]:
tmp = si + 1
next_[ai][si] = tmp
ans = 0
for i in range(10):
for j... | 25 | 22 | 555 | 513 | n = int(eval(input()))
s = eval(input())
next_ = [[-1] * (n + 1) for i in range(10)]
for num in range(10):
pos = -1
for i in range(n)[::-1]:
next_[num][i] = pos
if num == int(s[i]):
pos = i
start = [-1] * 10
for num in range(10):
for i in range(n)[::-1]:
if num == int(s[i... | n = int(eval(input()))
s = eval(input())
alph = "0123456789"
next_ = [[-1] * (n + 1) for i in range(len(alph))]
for ai in range(len(alph)):
tmp = -1
for si in range(n)[::-1]:
if s[si] == alph[ai]:
tmp = si + 1
next_[ai][si] = tmp
ans = 0
for i in range(10):
for j in range(10):
... | false | 12 | [
"-next_ = [[-1] * (n + 1) for i in range(10)]",
"-for num in range(10):",
"- pos = -1",
"- for i in range(n)[::-1]:",
"- next_[num][i] = pos",
"- if num == int(s[i]):",
"- pos = i",
"-start = [-1] * 10",
"-for num in range(10):",
"- for i in range(n)[::-1]:",
"-... | false | 0.111689 | 0.037326 | 2.992265 | [
"s649030068",
"s971100859"
] |
u844789719 | p03599 | python | s368199755 | s386995919 | 845 | 101 | 111,644 | 73,424 | Accepted | Accepted | 88.05 | from numba import njit
A, B, C, D, E, F = [int(_) for _ in input().split()]
@njit
def main(A, B, C, D, E, F):
conc = -1
ans = (1, 2)
for na in range(F // (100 * A) + 1):
for nb in range(F // (100 * B) + 1):
if na == nb == 0:
continue
G = F - na *... | A, B, C, D, E, F = [int(_) for _ in input().split()]
def main(A, B, C, D, E, F):
conc = -1
ans = (1, 2)
for na in range(F // (100 * A) + 1):
for nb in range(F // (100 * B) + 1):
if na == nb == 0:
continue
G = F - na * 100 * A - nb * 100 * B
... | 25 | 23 | 860 | 829 | from numba import njit
A, B, C, D, E, F = [int(_) for _ in input().split()]
@njit
def main(A, B, C, D, E, F):
conc = -1
ans = (1, 2)
for na in range(F // (100 * A) + 1):
for nb in range(F // (100 * B) + 1):
if na == nb == 0:
continue
G = F - na * 100 * A - ... | A, B, C, D, E, F = [int(_) for _ in input().split()]
def main(A, B, C, D, E, F):
conc = -1
ans = (1, 2)
for na in range(F // (100 * A) + 1):
for nb in range(F // (100 * B) + 1):
if na == nb == 0:
continue
G = F - na * 100 * A - nb * 100 * B
for n... | false | 8 | [
"-from numba import njit",
"-",
"-@njit"
] | false | 0.03378 | 0.210907 | 0.160164 | [
"s368199755",
"s386995919"
] |
u462329577 | p03779 | python | s631285106 | s978984432 | 30 | 19 | 2,940 | 3,188 | Accepted | Accepted | 36.67 | #!/usr/bin/env python3
n = int(eval(input()))
for i in range(10**5):
if n <= i*(i+1)/2:
print(i)
break
| #!/usr/bin/env python3
n = int(eval(input()))
#for i in range(10**5):
for i in range(int((2*n)**(1/2))-1,int((2*n)**(1/2))+2) :
if n <= i*(i+1)/2:
print(i)
break | 7 | 7 | 128 | 182 | #!/usr/bin/env python3
n = int(eval(input()))
for i in range(10**5):
if n <= i * (i + 1) / 2:
print(i)
break
| #!/usr/bin/env python3
n = int(eval(input()))
# for i in range(10**5):
for i in range(int((2 * n) ** (1 / 2)) - 1, int((2 * n) ** (1 / 2)) + 2):
if n <= i * (i + 1) / 2:
print(i)
break
| false | 0 | [
"-for i in range(10**5):",
"+# for i in range(10**5):",
"+for i in range(int((2 * n) ** (1 / 2)) - 1, int((2 * n) ** (1 / 2)) + 2):"
] | false | 0.032482 | 0.038959 | 0.833746 | [
"s631285106",
"s978984432"
] |
u393481615 | p04047 | python | s827993277 | s946617492 | 165 | 17 | 13,228 | 3,060 | Accepted | Accepted | 89.7 | import numpy as np
N = int(eval(input()))
L = list(map(int, input().split()))
if(len(L) != 2*N):
print("wrong number !")
exit()
x=0
L.sort(reverse=True)
for i in range(N):
x = x + min(L[2*i:2*(i+1)])
print(x)
| N = int(eval(input()))
L = list(map(int, input().split()))
if(len(L) != 2*N):
print("wrong number !")
exit()
x=0
L.sort(reverse=True)
for i in range(N):
x = x + min(L[2*i:2*(i+1)])
print(x)
| 15 | 13 | 233 | 211 | import numpy as np
N = int(eval(input()))
L = list(map(int, input().split()))
if len(L) != 2 * N:
print("wrong number !")
exit()
x = 0
L.sort(reverse=True)
for i in range(N):
x = x + min(L[2 * i : 2 * (i + 1)])
print(x)
| N = int(eval(input()))
L = list(map(int, input().split()))
if len(L) != 2 * N:
print("wrong number !")
exit()
x = 0
L.sort(reverse=True)
for i in range(N):
x = x + min(L[2 * i : 2 * (i + 1)])
print(x)
| false | 13.333333 | [
"-import numpy as np",
"-"
] | false | 0.044843 | 0.044956 | 0.997496 | [
"s827993277",
"s946617492"
] |
u380524497 | p03660 | python | s819063041 | s285308334 | 480 | 349 | 23,448 | 23,444 | Accepted | Accepted | 27.29 | from collections import deque
n = int(eval(input()))
edges = [[] for i in range(n)]
for _ in range(n-1):
a, b = list(map(int, input().split()))
edges[a-1].append(b-1)
edges[b-1].append(a-1)
todo = deque([(0, 1), (n-1, 2)])
colors = [0] * n
colors[0] = 1
colors[-1] = 2
while todo:
... | from collections import deque
import sys
input = sys.stdin.readline
n = int(eval(input()))
edges = [[] for i in range(n)]
for _ in range(n-1):
a, b = list(map(int, input().split()))
edges[a-1].append(b-1)
edges[b-1].append(a-1)
todo = deque([(0, 1), (n-1, 2)])
colors = [0] * n
colors[0]... | 32 | 34 | 610 | 650 | from collections import deque
n = int(eval(input()))
edges = [[] for i in range(n)]
for _ in range(n - 1):
a, b = list(map(int, input().split()))
edges[a - 1].append(b - 1)
edges[b - 1].append(a - 1)
todo = deque([(0, 1), (n - 1, 2)])
colors = [0] * n
colors[0] = 1
colors[-1] = 2
while todo:
node, colo... | from collections import deque
import sys
input = sys.stdin.readline
n = int(eval(input()))
edges = [[] for i in range(n)]
for _ in range(n - 1):
a, b = list(map(int, input().split()))
edges[a - 1].append(b - 1)
edges[b - 1].append(a - 1)
todo = deque([(0, 1), (n - 1, 2)])
colors = [0] * n
colors[0] = 1
col... | false | 5.882353 | [
"+import sys",
"+input = sys.stdin.readline"
] | false | 0.101925 | 0.038359 | 2.657105 | [
"s819063041",
"s285308334"
] |
u844789719 | p03855 | python | s479305151 | s502552426 | 1,409 | 1,296 | 55,052 | 55,056 | Accepted | Accepted | 8.02 | N, K, L = [int(_) for _ in input().split()]
def find(a, x):
if a[x] != x:
a[x] = find(a, a[x])
return a[x]
def unite(a, x, y):
x = find(a, x)
y = find(a, y)
if x != y:
a[x] = max(x, y)
a[y] = a[x]
a_road = [i for i in range(N)]
for _ in range(K):
... | N, K, L = [int(_) for _ in input().split()]
def find(a, x):
if a[x] != x:
a[x] = find(a, a[x])
return a[x]
def unite(a, x, y):
x = find(a, x)
y = find(a, y)
if x != y:
a[x] = min(x, y)
a[y] = a[x]
a_road = [i for i in range(N)]
for _ in range(K):
... | 32 | 31 | 769 | 741 | N, K, L = [int(_) for _ in input().split()]
def find(a, x):
if a[x] != x:
a[x] = find(a, a[x])
return a[x]
def unite(a, x, y):
x = find(a, x)
y = find(a, y)
if x != y:
a[x] = max(x, y)
a[y] = a[x]
a_road = [i for i in range(N)]
for _ in range(K):
p, q = [int(_) - 1 ... | N, K, L = [int(_) for _ in input().split()]
def find(a, x):
if a[x] != x:
a[x] = find(a, a[x])
return a[x]
def unite(a, x, y):
x = find(a, x)
y = find(a, y)
if x != y:
a[x] = min(x, y)
a[y] = a[x]
a_road = [i for i in range(N)]
for _ in range(K):
p, q = [int(_) - 1 ... | false | 3.125 | [
"- a[x] = max(x, y)",
"+ a[x] = min(x, y)",
"-print((\" \".join(str(memo[find(a_road, i), find(a_railway, i)]) for i in range(N))))",
"+print((\" \".join(str(memo[a_road[i], a_railway[i]]) for i in range(N))))"
] | false | 0.117574 | 0.116173 | 1.012058 | [
"s479305151",
"s502552426"
] |
u481187938 | p04015 | python | s906779483 | s745986587 | 266 | 136 | 127,828 | 73,948 | Accepted | Accepted | 48.87 | #!usr/bin/env python3
from collections import defaultdict, deque, Counter, OrderedDict
from bisect import bisect_left, bisect_right
from functools import reduce, lru_cache
from heapq import heappush, heappop, heapify
import itertools
import math, fractions
import sys, copy
def L(): return sys.stdin.readline... | #!usr/bin/env python3
from collections import defaultdict, deque, Counter, OrderedDict
from bisect import bisect_left, bisect_right
from functools import reduce, lru_cache
from heapq import heappush, heappop, heapify
import itertools
import math, fractions
import sys, copy
def L(): return sys.stdin.readline... | 58 | 59 | 2,027 | 2,000 | #!usr/bin/env python3
from collections import defaultdict, deque, Counter, OrderedDict
from bisect import bisect_left, bisect_right
from functools import reduce, lru_cache
from heapq import heappush, heappop, heapify
import itertools
import math, fractions
import sys, copy
def L():
return sys.stdin.readline().spl... | #!usr/bin/env python3
from collections import defaultdict, deque, Counter, OrderedDict
from bisect import bisect_left, bisect_right
from functools import reduce, lru_cache
from heapq import heappush, heappop, heapify
import itertools
import math, fractions
import sys, copy
def L():
return sys.stdin.readline().spl... | false | 1.694915 | [
"- dp = make_list(N + 1, N + 1, 2501)",
"- dp[0][0][0] = 1",
"+ Y = [xi - A for xi in X]",
"+ z = max(A, max(X))",
"+ dp = make_list(N + 1, 2 * z * N + 1)",
"+ dp[0][z * N] = 1",
"- for k in range(i + 1):",
"- for s in range(2501):",
"- if X[i - 1] ... | false | 0.491135 | 0.096579 | 5.085325 | [
"s906779483",
"s745986587"
] |
u415154163 | p02954 | python | s368210510 | s851444830 | 170 | 156 | 90,636 | 90,636 | Accepted | Accepted | 8.24 | import sys
sys.setrecursionlimit(1000000000)
char = list(eval(input()))
char_list_num = len(char)
count_list = [0] * char_list_num
def f(first_char,n,add_num):
if first_char == char[n+add_num] and n + add_num != char_list_num - 1:
return f(first_char,n+add_num,add_num)
else:
return n+... | import sys
sys.setrecursionlimit(1000000000)
char = list(eval(input()))
char_list_num = len(char)
count_list = [0] * char_list_num
def f(first_char,n,add_num):
if first_char == char[n+add_num] and n + add_num != char_list_num - 1:
return f(first_char,n+add_num,add_num)
else:
return n+... | 37 | 37 | 1,213 | 1,181 | import sys
sys.setrecursionlimit(1000000000)
char = list(eval(input()))
char_list_num = len(char)
count_list = [0] * char_list_num
def f(first_char, n, add_num):
if first_char == char[n + add_num] and n + add_num != char_list_num - 1:
return f(first_char, n + add_num, add_num)
else:
return n ... | import sys
sys.setrecursionlimit(1000000000)
char = list(eval(input()))
char_list_num = len(char)
count_list = [0] * char_list_num
def f(first_char, n, add_num):
if first_char == char[n + add_num] and n + add_num != char_list_num - 1:
return f(first_char, n + add_num, add_num)
else:
return n ... | false | 0 | [
"- count_list[reach_loop_num] += int(diff / 2)",
"- count_list[reach_loop_num - 1] += int(diff / 2)",
"+ count_list[reach_loop_num] += diff // 2",
"+ count_list[reach_loop_num - 1] += diff // 2",
"- count_list[reach_loop_num] += int(diff / 2)",
"- ... | false | 0.131021 | 0.090546 | 1.447014 | [
"s368210510",
"s851444830"
] |
u922233913 | p02756 | python | s874436181 | s977526565 | 1,784 | 439 | 4,480 | 4,340 | Accepted | Accepted | 75.39 | s = eval(input())
d = True
f = '' # Front
b = '' # Back
q = int(eval(input()))
for _ in range(q):
a = input().split()
if a[0] == '1':
d = not d
else:
if a[1] == '1':
if d:
f = ''.join([a[2], f])
else:
b = ''.join([b, a[2]]... | s = eval(input())
d = True
f = '' # Front
b = '' # Back
q = int(eval(input()))
for _ in range(q):
a = input().split()
if a[0] == '1':
d = not d
else:
if a[1] == '1':
if d:
f = f + a[2]
else:
b = b + a[2]
else:
... | 25 | 25 | 543 | 503 | s = eval(input())
d = True
f = "" # Front
b = "" # Back
q = int(eval(input()))
for _ in range(q):
a = input().split()
if a[0] == "1":
d = not d
else:
if a[1] == "1":
if d:
f = "".join([a[2], f])
else:
b = "".join([b, a[2]])
el... | s = eval(input())
d = True
f = "" # Front
b = "" # Back
q = int(eval(input()))
for _ in range(q):
a = input().split()
if a[0] == "1":
d = not d
else:
if a[1] == "1":
if d:
f = f + a[2]
else:
b = b + a[2]
else:
if d... | false | 0 | [
"- f = \"\".join([a[2], f])",
"+ f = f + a[2]",
"- b = \"\".join([b, a[2]])",
"+ b = b + a[2]",
"- b = \"\".join([b, a[2]])",
"+ b = b + a[2]",
"- f = \"\".join([a[2], f])",
"+ f = f... | false | 0.039278 | 0.07464 | 0.526232 | [
"s874436181",
"s977526565"
] |
u779805689 | p02669 | python | s107989604 | s868010206 | 559 | 512 | 96,152 | 94,980 | Accepted | Accepted | 8.41 | T=int(eval(input()))
for i in range(T):
N,A,B,C,D=list(map(int,input().split()))
M={0:0,1:D}
def f(N):
if N in M:
return M[N]
p,q=N//2*2,(N+1)//2*2
r,s=N//3*3,(N+2)//3*3
t,u=N//5*5,(N+4)//5*5
R=min(D*N,
D*abs(N-p)+A+f... | T=int(eval(input()))
X=[]
for i in range(T):
N,A,B,C,D=list(map(int,input().split()))
M={0:0,1:D}
S={2:A,3:B,5:C}
def f(N):
if N in M:
return M[N]
R=D*N
for k in S:
p,q=N//k*k,(N+k-1)//k*k
R=min(R,
... | 28 | 26 | 608 | 490 | T = int(eval(input()))
for i in range(T):
N, A, B, C, D = list(map(int, input().split()))
M = {0: 0, 1: D}
def f(N):
if N in M:
return M[N]
p, q = N // 2 * 2, (N + 1) // 2 * 2
r, s = N // 3 * 3, (N + 2) // 3 * 3
t, u = N // 5 * 5, (N + 4) // 5 * 5
R = min... | T = int(eval(input()))
X = []
for i in range(T):
N, A, B, C, D = list(map(int, input().split()))
M = {0: 0, 1: D}
S = {2: A, 3: B, 5: C}
def f(N):
if N in M:
return M[N]
R = D * N
for k in S:
p, q = N // k * k, (N + k - 1) // k * k
R = min(
... | false | 7.142857 | [
"+X = []",
"+ S = {2: A, 3: B, 5: C}",
"- p, q = N // 2 * 2, (N + 1) // 2 * 2",
"- r, s = N // 3 * 3, (N + 2) // 3 * 3",
"- t, u = N // 5 * 5, (N + 4) // 5 * 5",
"- R = min(",
"- D * N,",
"- D * abs(N - p) + A + f(p // 2),",
"- D * abs(... | false | 0.106475 | 0.139015 | 0.765925 | [
"s107989604",
"s868010206"
] |
u427344224 | p03722 | python | s993402572 | s395619356 | 1,470 | 916 | 3,444 | 3,444 | Accepted | Accepted | 37.69 | class BellmanFord:
def __init__(self, graph, num_v, start_point):
self.num_v = num_v
self.graph = graph
self.start_point = start_point
def execute(self):
dist = [float("inf") for _ in range(self.num_v)]
dist[self.start_point] = 0
negative = [False for ... | class BellmanFord:
def __init__(self, graph, num_v, start_point):
self.num_v = num_v
self.graph = graph
self.start_point = start_point
def execute(self):
dist = [float("inf") for _ in range(self.num_v)]
dist[self.start_point] = 0
negative = [False for ... | 40 | 38 | 1,318 | 1,164 | class BellmanFord:
def __init__(self, graph, num_v, start_point):
self.num_v = num_v
self.graph = graph
self.start_point = start_point
def execute(self):
dist = [float("inf") for _ in range(self.num_v)]
dist[self.start_point] = 0
negative = [False for _ in range(... | class BellmanFord:
def __init__(self, graph, num_v, start_point):
self.num_v = num_v
self.graph = graph
self.start_point = start_point
def execute(self):
dist = [float("inf") for _ in range(self.num_v)]
dist[self.start_point] = 0
negative = [False for _ in range(... | false | 5 | [
"- for src in range(self.num_v):",
"- for dest, cost in list(self.graph[src].items()):",
"- if dist[dest] > dist[src] + cost:",
"- dist[dest] = dist[src] + cost",
"+ for src, dest, cost in self.graph:",
"+ if dis... | false | 0.034071 | 0.066704 | 0.510784 | [
"s993402572",
"s395619356"
] |
u945181840 | p02901 | python | s543783435 | s839405099 | 1,963 | 1,433 | 3,188 | 3,188 | Accepted | Accepted | 27 | import sys
input = sys.stdin.readline
N, M = list(map(int, input().split()))
INF = 10 ** 10
p = 2 ** N
dp = [INF] * p
dp[0] = 0
for _ in range(M):
a, b = list(map(int, input().split()))
c = sum([2 ** (i - 1) for i in map(int, input().split())])
for i in range(p):
dp[i | c] = min(dp[i]... | import sys
input = sys.stdin.readline
def main():
N, M = list(map(int, input().split()))
INF = 10 ** 10
p = 2 ** N
dp = [INF] * p
dp[0] = 0
for _ in range(M):
a, b = list(map(int, input().split()))
c = sum([2 ** (i - 1) for i in map(int, input().split())])
... | 19 | 25 | 386 | 501 | import sys
input = sys.stdin.readline
N, M = list(map(int, input().split()))
INF = 10**10
p = 2**N
dp = [INF] * p
dp[0] = 0
for _ in range(M):
a, b = list(map(int, input().split()))
c = sum([2 ** (i - 1) for i in map(int, input().split())])
for i in range(p):
dp[i | c] = min(dp[i] + a, dp[i | c])
i... | import sys
input = sys.stdin.readline
def main():
N, M = list(map(int, input().split()))
INF = 10**10
p = 2**N
dp = [INF] * p
dp[0] = 0
for _ in range(M):
a, b = list(map(int, input().split()))
c = sum([2 ** (i - 1) for i in map(int, input().split())])
for i in range(p... | false | 24 | [
"-N, M = list(map(int, input().split()))",
"-INF = 10**10",
"-p = 2**N",
"-dp = [INF] * p",
"-dp[0] = 0",
"-for _ in range(M):",
"- a, b = list(map(int, input().split()))",
"- c = sum([2 ** (i - 1) for i in map(int, input().split())])",
"- for i in range(p):",
"- dp[i | c] = min(dp... | false | 0.042896 | 0.037266 | 1.151053 | [
"s543783435",
"s839405099"
] |
u847467233 | p00462 | python | s652216990 | s527384285 | 380 | 190 | 10,724 | 10,716 | Accepted | Accepted | 50 | # AOJ 0539: Pizza
# Python3 2018.7.1 bal4u
import bisect
while True:
d = int(eval(input()))
if d == 0: break
n, m = int(eval(input())), int(eval(input()))
p = [0] + [int(eval(input())) for i in range(n-1)] + [d]
p.sort()
ans = 0
for i in range(m):
k = int(eval(input()))
if k > 0:
t = bise... | # AOJ 0539: Pizza
# Python3 2018.7.1 bal4u
import sys
from sys import stdin
input = stdin.readline
import bisect
while True:
d = int(eval(input()))
if d == 0: break
n, m = int(eval(input())), int(eval(input()))
p = [0] + [int(eval(input())) for i in range(n-1)] + [d]
p.sort()
ans = 0
for i in ra... | 18 | 21 | 357 | 416 | # AOJ 0539: Pizza
# Python3 2018.7.1 bal4u
import bisect
while True:
d = int(eval(input()))
if d == 0:
break
n, m = int(eval(input())), int(eval(input()))
p = [0] + [int(eval(input())) for i in range(n - 1)] + [d]
p.sort()
ans = 0
for i in range(m):
k = int(eval(input()))
... | # AOJ 0539: Pizza
# Python3 2018.7.1 bal4u
import sys
from sys import stdin
input = stdin.readline
import bisect
while True:
d = int(eval(input()))
if d == 0:
break
n, m = int(eval(input())), int(eval(input()))
p = [0] + [int(eval(input())) for i in range(n - 1)] + [d]
p.sort()
ans = 0... | false | 14.285714 | [
"+import sys",
"+from sys import stdin",
"+",
"+input = stdin.readline"
] | false | 0.055359 | 0.036213 | 1.528699 | [
"s652216990",
"s527384285"
] |
u657361950 | p02315 | python | s518267520 | s053480364 | 570 | 510 | 25,940 | 25,936 | Accepted | Accepted | 10.53 | def get_max_value(n, W, v, w):
dp = [[0 for x in range(W+1)] for x in range(n+1)]
for i in range(1, n+1):
wt = w[i-1]
vl = v[i-1]
for j in range(W+1):
if wt > j:
dp[i][j]=dp[i-1][j]
else:
dp[i][j]=max(dp[i-1][j], dp[i-1][j-wt]+vl)
return dp[n][W]
n, W = list(map(int, input().split())... | def get_max_value(n, W, v, w):
dp = [[0 for x in range(W+1)] for x in range(n+1)]
for i in range(1,n+1):
wt = w[i-1]
vl = v[i-1]
for j in range(1,W+1):
if wt > j:
dp[i][j]=dp[i-1][j]
else:
dp[i][j]=max(dp[i-1][j], dp[i-1][j-wt]+vl)
return dp[n][W]
n, W = list(map(int, input().split()... | 19 | 19 | 435 | 436 | def get_max_value(n, W, v, w):
dp = [[0 for x in range(W + 1)] for x in range(n + 1)]
for i in range(1, n + 1):
wt = w[i - 1]
vl = v[i - 1]
for j in range(W + 1):
if wt > j:
dp[i][j] = dp[i - 1][j]
else:
dp[i][j] = max(dp[i - 1][j],... | def get_max_value(n, W, v, w):
dp = [[0 for x in range(W + 1)] for x in range(n + 1)]
for i in range(1, n + 1):
wt = w[i - 1]
vl = v[i - 1]
for j in range(1, W + 1):
if wt > j:
dp[i][j] = dp[i - 1][j]
else:
dp[i][j] = max(dp[i - 1][... | false | 0 | [
"- for j in range(W + 1):",
"+ for j in range(1, W + 1):"
] | false | 0.040879 | 0.041693 | 0.980482 | [
"s518267520",
"s053480364"
] |
u367701763 | p02586 | python | s512217254 | s244895524 | 403 | 366 | 140,668 | 145,748 | Accepted | Accepted | 9.18 | import sys
input = sys.stdin.readline
R, L, K = list(map(int, input().split()))
V = [[0]*R for _ in range(L)]
for _ in range(K):
r, c, v = list(map(int, input().split()))
V[c-1][r-1] = v
A, B, C, D = [[0]*(R+1) for _ in range(4)]
for i in range(L):
for j in range(R):
A[j] = max(A[j-1],B[j-... | import sys
input = sys.stdin.readline
R, L, K = list(map(int, input().split()))
V = [0]*(R*L)
for _ in range(K):
r, c, v = list(map(int, input().split()))
V[(c-1)*R+(r-1)] = v
A, B, C, D = [[0]*(R+1) for _ in range(4)]
for i in range(L):
for j in range(R):
A[j] = max(A[j-1],B[j-1],C[j-1],D... | 15 | 15 | 488 | 478 | import sys
input = sys.stdin.readline
R, L, K = list(map(int, input().split()))
V = [[0] * R for _ in range(L)]
for _ in range(K):
r, c, v = list(map(int, input().split()))
V[c - 1][r - 1] = v
A, B, C, D = [[0] * (R + 1) for _ in range(4)]
for i in range(L):
for j in range(R):
A[j] = max(A[j - 1], ... | import sys
input = sys.stdin.readline
R, L, K = list(map(int, input().split()))
V = [0] * (R * L)
for _ in range(K):
r, c, v = list(map(int, input().split()))
V[(c - 1) * R + (r - 1)] = v
A, B, C, D = [[0] * (R + 1) for _ in range(4)]
for i in range(L):
for j in range(R):
A[j] = max(A[j - 1], B[j -... | false | 0 | [
"-V = [[0] * R for _ in range(L)]",
"+V = [0] * (R * L)",
"- V[c - 1][r - 1] = v",
"+ V[(c - 1) * R + (r - 1)] = v",
"- v = V[i][j]",
"+ v = V[i * R + j]"
] | false | 0.037086 | 0.055125 | 0.672754 | [
"s512217254",
"s244895524"
] |
u186838327 | p02928 | python | s253228897 | s872166837 | 1,163 | 88 | 3,280 | 70,484 | Accepted | Accepted | 92.43 | n, k = list(map(int, input().split()))
A = list(map(int, input().split()))
mod = 10**9+7
C1 = [0]*n
C2 = [0]*n
for i in range(n):
for j in range(n):
if A[i] > A[j]:
if j >= i:
C1[i] += k*(k+1)//2
else:
C2[i] += (k-1)*k//2
ans = 0
#prin... | n, k = list(map(int,input().split()))
A = list(map(int, input().split()))
mod = 10**9+7
if n == 1:
print((0))
exit()
ans = 0
for i in range(n-1):
for j in range(i, n):
if A[i] < A[j]:
ans += (k-1)*k//2
elif A[i] > A[j]:
ans += k*(k+1)//2
else:... | 20 | 19 | 392 | 363 | n, k = list(map(int, input().split()))
A = list(map(int, input().split()))
mod = 10**9 + 7
C1 = [0] * n
C2 = [0] * n
for i in range(n):
for j in range(n):
if A[i] > A[j]:
if j >= i:
C1[i] += k * (k + 1) // 2
else:
C2[i] += (k - 1) * k // 2
ans = 0
# pr... | n, k = list(map(int, input().split()))
A = list(map(int, input().split()))
mod = 10**9 + 7
if n == 1:
print((0))
exit()
ans = 0
for i in range(n - 1):
for j in range(i, n):
if A[i] < A[j]:
ans += (k - 1) * k // 2
elif A[i] > A[j]:
ans += k * (k + 1) // 2
else:... | false | 5 | [
"-C1 = [0] * n",
"-C2 = [0] * n",
"-for i in range(n):",
"- for j in range(n):",
"- if A[i] > A[j]:",
"- if j >= i:",
"- C1[i] += k * (k + 1) // 2",
"- else:",
"- C2[i] += (k - 1) * k // 2",
"+if n == 1:",
"+ print((0))",
"+ e... | false | 0.043844 | 0.037297 | 1.175526 | [
"s253228897",
"s872166837"
] |
u072717685 | p02595 | python | s325269627 | s950180249 | 218 | 199 | 42,172 | 107,832 | Accepted | Accepted | 8.72 | import sys
read = sys.stdin.read
readlines = sys.stdin.readlines
from math import sqrt
def main():
n, d = list(map(int, input().split()))
m = list(map(int, read().split()))
ab = list(zip(m, m))
r = 0
for a, b in ab:
dis = sqrt(a**2 + b**2)
r += dis <= d
print(r)
... | import sys
read = sys.stdin.read
#readlines = sys.stdin.readlines
def main():
n, d = list(map(int, input().split()))
r = 0
m = list(map(int, read().split()))
ab = list(zip(m, m))
d2 = d**2
for a, b in ab:
r += (a ** 2 + b ** 2) <= d2
print(r)
if __name__ == '__main__':
... | 17 | 15 | 341 | 313 | import sys
read = sys.stdin.read
readlines = sys.stdin.readlines
from math import sqrt
def main():
n, d = list(map(int, input().split()))
m = list(map(int, read().split()))
ab = list(zip(m, m))
r = 0
for a, b in ab:
dis = sqrt(a**2 + b**2)
r += dis <= d
print(r)
if __name__ ... | import sys
read = sys.stdin.read
# readlines = sys.stdin.readlines
def main():
n, d = list(map(int, input().split()))
r = 0
m = list(map(int, read().split()))
ab = list(zip(m, m))
d2 = d**2
for a, b in ab:
r += (a**2 + b**2) <= d2
print(r)
if __name__ == "__main__":
main()
| false | 11.764706 | [
"-readlines = sys.stdin.readlines",
"-from math import sqrt",
"-",
"-",
"+# readlines = sys.stdin.readlines",
"+ r = 0",
"- r = 0",
"+ d2 = d**2",
"- dis = sqrt(a**2 + b**2)",
"- r += dis <= d",
"+ r += (a**2 + b**2) <= d2"
] | false | 0.044827 | 0.087593 | 0.511761 | [
"s325269627",
"s950180249"
] |
u191874006 | p02770 | python | s623784930 | s471512774 | 1,221 | 937 | 94,044 | 64,988 | Accepted | Accepted | 23.26 | #!/usr/bin/env python3
import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from... | #!/usr/bin/env python3
import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from... | 34 | 31 | 837 | 782 | #!/usr/bin/env python3
import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop, heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collectio... | #!/usr/bin/env python3
import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop, heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collectio... | false | 8.823529 | [
"- f = list(accumulate(e))",
"- s = f[-1] * ((n - 1) // k)",
"- if (n - 1) % k != 0:",
"- s += f[(n - 1) % k - 1]",
"- tmp = (s + x % m) // m",
"+ s = sum(e) * ((n - 1) // k) + sum(e[: (n - 1) % k])",
"+ tmp = (s + x) // m - x // m"
] | false | 0.039425 | 0.108373 | 0.363791 | [
"s623784930",
"s471512774"
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.