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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
u177398299 | p03411 | python | s570384466 | s521255266 | 32 | 22 | 3,316 | 3,188 | Accepted | Accepted | 31.25 | # ２部マッチング
# 最大流
# Ford-Fulkerson
N = int(eval(input()))
A = [list(map(int, input().split())) for _ in range(N)]
B = [list(map(int, input().split())) for _ in range(N)]
# -1: source, 2N: sink
edge = {-1: {}, 2 * N: {}}
for i, a in enumerate(A):
edge[i] = {}
edge[-1][i] = 1
for j, b in enumerate(... | # ２部マッチング
N = int(eval(input()))
A = [list(map(int, input().split())) for _ in range(N)]
B = [list(map(int, input().split())) for _ in range(N)]
def dfs(v, visited):
for u in edge[v]:
if u in visited:
continue
visited.add(u)
if matched[u] == -1 or dfs(matched[u], visit... | 44 | 22 | 1,182 | 617 | # ２部マッチング
# 最大流
# Ford-Fulkerson
N = int(eval(input()))
A = [list(map(int, input().split())) for _ in range(N)]
B = [list(map(int, input().split())) for _ in range(N)]
# -1: source, 2N: sink
edge = {-1: {}, 2 * N: {}}
for i, a in enumerate(A):
edge[i] = {}
edge[-1][i] = 1
for j, b in enumerate(B):
j... | # ２部マッチング
N = int(eval(input()))
A = [list(map(int, input().split())) for _ in range(N)]
B = [list(map(int, input().split())) for _ in range(N)]
def dfs(v, visited):
for u in edge[v]:
if u in visited:
continue
visited.add(u)
if matched[u] == -1 or dfs(matched[u], visited):
... | false | 50 | [
"-# 最大流",
"-# Ford-Fulkerson",
"-# -1: source, 2N: sink",
"-edge = {-1: {}, 2 * N: {}}",
"-for i, a in enumerate(A):",
"- edge[i] = {}",
"- edge[-1][i] = 1",
"- for j, b in enumerate(B):",
"- j += N",
"- if j not in edge:",
"- edge[j] = {}",
"- edge[j][... | false | 0.042443 | 0.043216 | 0.98213 | [
"s570384466",
"s521255266"
] |
u707124227 | p02573 | python | s575661221 | s885348915 | 731 | 491 | 41,808 | 110,344 | Accepted | Accepted | 32.83 | import sys
sys.setrecursionlimit(10**7)
N,Q = list(map(int,input().split()))
par = [i for i in range(N)]
rank = [0]*(N+1)
def find(x):
if par[x] == x:
return x
else:
par[x] = find(par[x]) #経路圧縮
return par[x]
def same(x,y):
return find(x) == find(y)
def unite(x,y):
... | import sys
sys.setrecursionlimit(10**7)
N,Q = list(map(int,input().split()))
class UF():
def __init__(self,par,rank):
self.par = par
self.rank = rank
def find(self,x):
if self.par[x] == x:
return x
else:
self.par[x] = self.find(self.par[x]) #経路圧縮
retur... | 38 | 40 | 733 | 948 | import sys
sys.setrecursionlimit(10**7)
N, Q = list(map(int, input().split()))
par = [i for i in range(N)]
rank = [0] * (N + 1)
def find(x):
if par[x] == x:
return x
else:
par[x] = find(par[x]) # 経路圧縮
return par[x]
def same(x, y):
return find(x) == find(y)
def unite(x, y):
... | import sys
sys.setrecursionlimit(10**7)
N, Q = list(map(int, input().split()))
class UF:
def __init__(self, par, rank):
self.par = par
self.rank = rank
def find(self, x):
if self.par[x] == x:
return x
else:
self.par[x] = self.find(self.par[x]) # 経路圧縮
... | false | 5 | [
"-par = [i for i in range(N)]",
"-rank = [0] * (N + 1)",
"-def find(x):",
"- if par[x] == x:",
"- return x",
"- else:",
"- par[x] = find(par[x]) # 経路圧縮",
"- return par[x]",
"+class UF:",
"+ def __init__(self, par, rank):",
"+ self.par = par",
"+ sel... | false | 0.04477 | 0.045541 | 0.983073 | [
"s575661221",
"s885348915"
] |
u962718741 | p03456 | python | s246895113 | s834656559 | 164 | 26 | 38,384 | 9,408 | Accepted | Accepted | 84.15 | def resolve():
a, b = input().split()
num = int(a+b)
ans = (num**0.5)%1
if ans == 0:
print('Yes')
else:
print('No')
resolve() | #!/usr/bin/env python3
def main():
ab = int(input().replace(" ", ""))
print(("Yes" if int(ab**.5)**2 == ab else "No"))
if __name__ == "__main__":
main()
| 9 | 9 | 169 | 174 | def resolve():
a, b = input().split()
num = int(a + b)
ans = (num**0.5) % 1
if ans == 0:
print("Yes")
else:
print("No")
resolve()
| #!/usr/bin/env python3
def main():
ab = int(input().replace(" ", ""))
print(("Yes" if int(ab**0.5) ** 2 == ab else "No"))
if __name__ == "__main__":
main()
| false | 0 | [
"-def resolve():",
"- a, b = input().split()",
"- num = int(a + b)",
"- ans = (num**0.5) % 1",
"- if ans == 0:",
"- print(\"Yes\")",
"- else:",
"- print(\"No\")",
"+#!/usr/bin/env python3",
"+def main():",
"+ ab = int(input().replace(\" \", \"\"))",
"+ print(... | false | 0.092318 | 0.038107 | 2.422608 | [
"s246895113",
"s834656559"
] |
u047796752 | p02720 | python | s240297829 | s236648502 | 350 | 78 | 53,084 | 70,248 | Accepted | Accepted | 77.71 | from collections import deque
def dfs(q, keta):
global K
if len(q)==keta:
K -= 1
if K==0:
q = list(map(str, q))
print((''.join(q)))
exit()
return
for nex in range(max(0, q[-1]-1), min(9, q[-1]+1)+1):
... | import sys
input = sys.stdin.readline
from collections import deque
K = int(eval(input()))
q = deque([])
for i in range(1, 10):
q.append(i)
cnt = 0
while q:
v = q.popleft()
cnt += 1
if cnt==K:
print(v)
exit()
for i in range(max(0, v%10-1), min(9,... | 26 | 22 | 493 | 353 | from collections import deque
def dfs(q, keta):
global K
if len(q) == keta:
K -= 1
if K == 0:
q = list(map(str, q))
print(("".join(q)))
exit()
return
for nex in range(max(0, q[-1] - 1), min(9, q[-1] + 1) + 1):
q.append(nex)
dfs(q,... | import sys
input = sys.stdin.readline
from collections import deque
K = int(eval(input()))
q = deque([])
for i in range(1, 10):
q.append(i)
cnt = 0
while q:
v = q.popleft()
cnt += 1
if cnt == K:
print(v)
exit()
for i in range(max(0, v % 10 - 1), min(9, v % 10 + 1) + 1):
q.a... | false | 15.384615 | [
"+import sys",
"+",
"+input = sys.stdin.readline",
"-",
"-def dfs(q, keta):",
"- global K",
"- if len(q) == keta:",
"- K -= 1",
"- if K == 0:",
"- q = list(map(str, q))",
"- print((\"\".join(q)))",
"- exit()",
"- return",
"- fo... | false | 0.056298 | 0.05126 | 1.098283 | [
"s240297829",
"s236648502"
] |
u761529120 | p03160 | python | s337058640 | s359961446 | 240 | 98 | 52,208 | 86,104 | Accepted | Accepted | 59.17 | def main():
N = int(eval(input()))
H = list(map(int, input().split()))
dp = [float('inf')] * (N + 5)
dp[0] = 0
for i in range(N):
if i + 1 <= N - 1:
dp[i+1] = min(dp[i+1], dp[i] + abs(H[i+1] - H[i]))
if i + 2 <= N - 1:
dp[i+2] = min(dp[i+2], dp[i] + a... | def main():
N = int(eval(input()))
H = list(map(int, input().split()))
dp = [float('inf')] * (N + 5)
dp[0] = 0
for i in range(1,N):
dp[i] = min(dp[i], dp[i-1] + abs(H[i] - H[i-1]))
if i - 2 >= 0:
dp[i] = min(dp[i], dp[i-2] + abs(H[i] - H[i-2]))
print((dp[N-... | 17 | 14 | 408 | 358 | def main():
N = int(eval(input()))
H = list(map(int, input().split()))
dp = [float("inf")] * (N + 5)
dp[0] = 0
for i in range(N):
if i + 1 <= N - 1:
dp[i + 1] = min(dp[i + 1], dp[i] + abs(H[i + 1] - H[i]))
if i + 2 <= N - 1:
dp[i + 2] = min(dp[i + 2], dp[i] + ... | def main():
N = int(eval(input()))
H = list(map(int, input().split()))
dp = [float("inf")] * (N + 5)
dp[0] = 0
for i in range(1, N):
dp[i] = min(dp[i], dp[i - 1] + abs(H[i] - H[i - 1]))
if i - 2 >= 0:
dp[i] = min(dp[i], dp[i - 2] + abs(H[i] - H[i - 2]))
print((dp[N - ... | false | 17.647059 | [
"- for i in range(N):",
"- if i + 1 <= N - 1:",
"- dp[i + 1] = min(dp[i + 1], dp[i] + abs(H[i + 1] - H[i]))",
"- if i + 2 <= N - 1:",
"- dp[i + 2] = min(dp[i + 2], dp[i] + abs(H[i + 2] - H[i]))",
"+ for i in range(1, N):",
"+ dp[i] = min(dp[i], dp[i - 1] ... | false | 0.126412 | 0.127804 | 0.989111 | [
"s337058640",
"s359961446"
] |
u932465688 | p03425 | python | s315655807 | s073659974 | 276 | 179 | 21,308 | 3,188 | Accepted | Accepted | 35.14 | N = int(eval(input()))
S = [list(eval(input())) for i in range(N)]
M = []
A = []
R = []
C = []
H = []
for j in range(N):
if (S[j][0] == 'M'):
M.append(S[j])
elif (S[j][0] == 'A'):
A.append(S[j])
elif (S[j][0] == 'R'):
R.append(S[j])
elif (S[j][0] == 'C'):
C.append(S[j])
elif (S... | import itertools
N = int(eval(input()))
L = [0]*5
for i in range(N):
S = eval(input())
if S[0] == 'M':
L[0] += 1
elif S[0] == 'A':
L[1] += 1
elif S[0] == 'R':
L[2] += 1
elif S[0] == 'C':
L[3] += 1
elif S[0] == 'H':
L[4] += 1
K = list(itertools.combinations(L,3))
ans = 0
... | 21 | 20 | 581 | 377 | N = int(eval(input()))
S = [list(eval(input())) for i in range(N)]
M = []
A = []
R = []
C = []
H = []
for j in range(N):
if S[j][0] == "M":
M.append(S[j])
elif S[j][0] == "A":
A.append(S[j])
elif S[j][0] == "R":
R.append(S[j])
elif S[j][0] == "C":
C.append(S[j])
elif ... | import itertools
N = int(eval(input()))
L = [0] * 5
for i in range(N):
S = eval(input())
if S[0] == "M":
L[0] += 1
elif S[0] == "A":
L[1] += 1
elif S[0] == "R":
L[2] += 1
elif S[0] == "C":
L[3] += 1
elif S[0] == "H":
L[4] += 1
K = list(itertools.combinati... | false | 4.761905 | [
"+import itertools",
"+",
"-S = [list(eval(input())) for i in range(N)]",
"-M = []",
"-A = []",
"-R = []",
"-C = []",
"-H = []",
"-for j in range(N):",
"- if S[j][0] == \"M\":",
"- M.append(S[j])",
"- elif S[j][0] == \"A\":",
"- A.append(S[j])",
"- elif S[j][0] == \"... | false | 0.038271 | 0.038091 | 1.004724 | [
"s315655807",
"s073659974"
] |
u477638578 | p02554 | python | s953799803 | s502730766 | 31 | 28 | 9,140 | 9,140 | Accepted | Accepted | 9.68 | # #
# author : samars_diary #
# 16-09-2020 │ 18:28:11 #
# #
import sys, os.path, math
#if(os.path.exists('input.txt')):
#sys.stdin = open('input.txt',"r")
#sys.stdout = open('output.txt',"w")
sys.setrecursionlimit(10 ** 5)
mod ... | # #
# author : samars_diary #
# 16-09-2020 │ 18:28:11 #
# #
import sys, os.path, math
#if(os.path.exists('input.txt')):
#sys.stdin = open('input.txt',"r")
#sys.stdout = open('output.txt',"w")
sys.setrecursionlimit(10 ** 5)
mod ... | 26 | 26 | 751 | 749 | # #
# author : samars_diary #
# 16-09-2020 │ 18:28:11 #
# #
import sys, os.path, math
# if(os.path.exists('input.txt')):
# sys.stdin = open('input.txt',"r")
# sys.stdout = open('output.txt',"w")
sys.setrecursionlimit(10**5)
mod = 1000000000 + 7
def i():
... | # #
# author : samars_diary #
# 16-09-2020 │ 18:28:11 #
# #
import sys, os.path, math
# if(os.path.exists('input.txt')):
# sys.stdin = open('input.txt',"r")
# sys.stdout = open('output.txt',"w")
sys.setrecursionlimit(10**5)
mod = 1000000007
def i():
ret... | false | 0 | [
"-mod = 1000000000 + 7",
"+mod = 1000000007"
] | false | 0.102567 | 0.047982 | 2.137607 | [
"s953799803",
"s502730766"
] |
u169696482 | p02948 | python | s355591945 | s731820709 | 454 | 278 | 23,748 | 23,752 | Accepted | Accepted | 38.77 | import heapq
def main():
N, M = list(map(int, input().split()))
jobs = [[] for _ in range(M)]
for i in range(N):
d, r = list(map(int, input().split()))
if d-1 < M:
jobs[d-1].append(-r)
m = 0
heap = []
for i in range(M):
for a in jobs[i]:
heapq.heappush(heap, a)
if ... | import sys
input = sys.stdin.readline
import heapq
def main():
N, M = list(map(int, input().split()))
jobs = [[] for _ in range(M)]
for i in range(N):
d, r = list(map(int, input().split()))
if d-1 < M:
jobs[d-1].append(-r)
m = 0
heap = []
for i in range(M):
for a in jobs[i]:... | 20 | 22 | 431 | 471 | import heapq
def main():
N, M = list(map(int, input().split()))
jobs = [[] for _ in range(M)]
for i in range(N):
d, r = list(map(int, input().split()))
if d - 1 < M:
jobs[d - 1].append(-r)
m = 0
heap = []
for i in range(M):
for a in jobs[i]:
heap... | import sys
input = sys.stdin.readline
import heapq
def main():
N, M = list(map(int, input().split()))
jobs = [[] for _ in range(M)]
for i in range(N):
d, r = list(map(int, input().split()))
if d - 1 < M:
jobs[d - 1].append(-r)
m = 0
heap = []
for i in range(M):
... | false | 9.090909 | [
"+import sys",
"+",
"+input = sys.stdin.readline"
] | false | 0.075702 | 0.057531 | 1.315857 | [
"s355591945",
"s731820709"
] |
u347600233 | p02791 | python | s758782908 | s656155682 | 106 | 92 | 32,268 | 32,228 | Accepted | Accepted | 13.21 | n = int(eval(input()))
p = list(map(int, input().split()))
min_sp, cnt = p[0], 0
for i in range(n):
if p[i] <= min_sp:
cnt += 1
min_sp = p[i]
print(cnt) | n = int(eval(input()))
p = list(map(int, input().split()))
min_sp, cnt = p[0], 0
for pi in p:
if pi <= min_sp:
cnt += 1
min_sp = pi
print(cnt) | 8 | 8 | 173 | 163 | n = int(eval(input()))
p = list(map(int, input().split()))
min_sp, cnt = p[0], 0
for i in range(n):
if p[i] <= min_sp:
cnt += 1
min_sp = p[i]
print(cnt)
| n = int(eval(input()))
p = list(map(int, input().split()))
min_sp, cnt = p[0], 0
for pi in p:
if pi <= min_sp:
cnt += 1
min_sp = pi
print(cnt)
| false | 0 | [
"-for i in range(n):",
"- if p[i] <= min_sp:",
"+for pi in p:",
"+ if pi <= min_sp:",
"- min_sp = p[i]",
"+ min_sp = pi"
] | false | 0.039256 | 0.037983 | 1.033501 | [
"s758782908",
"s656155682"
] |
u138781768 | p02860 | python | s007337059 | s716274892 | 19 | 17 | 3,060 | 3,060 | Accepted | Accepted | 10.53 | n = int(eval(input()))
s = eval(input())
a = []
b = []
count = 1
for i in s:
if count > (n/2):
a.append(i)
else:
b.append(i)
count += 1
if a == b:
print("Yes")
else:
print("No") | l = int(eval(input()))
s = eval(input())
h = l // 2
if l % 2 == 1:
print("No")
else:
flag = True
for i in range(0, h):
if s[i] != s[i + h]:
flag = False
break
if flag:
print("Yes")
else:
print("No") | 15 | 15 | 197 | 234 | n = int(eval(input()))
s = eval(input())
a = []
b = []
count = 1
for i in s:
if count > (n / 2):
a.append(i)
else:
b.append(i)
count += 1
if a == b:
print("Yes")
else:
print("No")
| l = int(eval(input()))
s = eval(input())
h = l // 2
if l % 2 == 1:
print("No")
else:
flag = True
for i in range(0, h):
if s[i] != s[i + h]:
flag = False
break
if flag:
print("Yes")
else:
print("No")
| false | 0 | [
"-n = int(eval(input()))",
"+l = int(eval(input()))",
"-a = []",
"-b = []",
"-count = 1",
"-for i in s:",
"- if count > (n / 2):",
"- a.append(i)",
"+h = l // 2",
"+if l % 2 == 1:",
"+ print(\"No\")",
"+else:",
"+ flag = True",
"+ for i in range(0, h):",
"+ if s... | false | 0.064197 | 0.047016 | 1.365441 | [
"s007337059",
"s716274892"
] |
u118642796 | p03309 | python | s503051756 | s024627443 | 1,939 | 211 | 26,180 | 27,712 | Accepted | Accepted | 89.12 | N = int(eval(input()))
A = list(map(int,input().split()))
ans = sum(A)
imin = min(A)-N
imax = max(A)+N
def calcAns(b):
global A
return sum([abs(A[i]-(b+i+1)) for i in range(N)])
while True:
if imin == imax:
break
else:
imid = imin + (im... | N = int(eval(input()))
A = list(map(int,input().split()))
B = [A[i]-i-1 for i in range(N)]
B.sort()
if N%2:
b = B[(N-1)//2]
else:
b = (B[N//2]+B[N//2 - 1])//2
print((sum([abs(A[i]-b-i-1) for i in range(N)]))) | 27 | 11 | 647 | 228 | N = int(eval(input()))
A = list(map(int, input().split()))
ans = sum(A)
imin = min(A) - N
imax = max(A) + N
def calcAns(b):
global A
return sum([abs(A[i] - (b + i + 1)) for i in range(N)])
while True:
if imin == imax:
break
else:
imid = imin + (imax - imin) // 2
tmp = calcAns... | N = int(eval(input()))
A = list(map(int, input().split()))
B = [A[i] - i - 1 for i in range(N)]
B.sort()
if N % 2:
b = B[(N - 1) // 2]
else:
b = (B[N // 2] + B[N // 2 - 1]) // 2
print((sum([abs(A[i] - b - i - 1) for i in range(N)])))
| false | 59.259259 | [
"-ans = sum(A)",
"-imin = min(A) - N",
"-imax = max(A) + N",
"-",
"-",
"-def calcAns(b):",
"- global A",
"- return sum([abs(A[i] - (b + i + 1)) for i in range(N)])",
"-",
"-",
"-while True:",
"- if imin == imax:",
"- break",
"- else:",
"- imid = imin + (imax - i... | false | 0.040082 | 0.034503 | 1.161715 | [
"s503051756",
"s024627443"
] |
u060938295 | p03167 | python | s568866505 | s865267594 | 1,538 | 1,136 | 56,348 | 57,384 | Accepted | Accepted | 26.14 |
import numpy as np
H, W = list(map(int,input().split()))
A = np.array([list(eval(input())) for _ in range(H)], 'U1')
mod = 10**9+7
dp = [[0 for j in range(W+1)] for i in range(H+1)]
dp[0][1] = 1
for i in range(H):
for j in range(W):
if A[i][j] == '.':
dp[i+1][j+1] = (dp[i][j+1] ... | import numpy as np
H, W = list(map(int,input().split()))
#A = [input() for _ in range(H)]
A = np.array([list(eval(input())) for _ in range(H)], 'U1')
mod = 10**9+7
eq = A == '.'
dp = [[0 for j in range(W+1)] for i in range(H+1)]
dp[0][1] = 1
for i in range(H):
for j in range(W):
if eq[i][j... | 16 | 18 | 348 | 392 | import numpy as np
H, W = list(map(int, input().split()))
A = np.array([list(eval(input())) for _ in range(H)], "U1")
mod = 10**9 + 7
dp = [[0 for j in range(W + 1)] for i in range(H + 1)]
dp[0][1] = 1
for i in range(H):
for j in range(W):
if A[i][j] == ".":
dp[i + 1][j + 1] = (dp[i][j + 1] + d... | import numpy as np
H, W = list(map(int, input().split()))
# A = [input() for _ in range(H)]
A = np.array([list(eval(input())) for _ in range(H)], "U1")
mod = 10**9 + 7
eq = A == "."
dp = [[0 for j in range(W + 1)] for i in range(H + 1)]
dp[0][1] = 1
for i in range(H):
for j in range(W):
if eq[i][j]:
... | false | 11.111111 | [
"+# A = [input() for _ in range(H)]",
"+eq = A == \".\"",
"- if A[i][j] == \".\":",
"+ if eq[i][j]:"
] | false | 0.284959 | 0.225321 | 1.264681 | [
"s568866505",
"s865267594"
] |
u580404776 | p02731 | python | s366858824 | s038145146 | 33 | 17 | 5,076 | 2,940 | Accepted | Accepted | 48.48 | from decimal import Decimal
L=int(eval(input()))
l=Decimal(L/3)
print(("{:.12f}".format((l)**3))) | L=int(eval(input()))
print(("{:.12f}".format(L**3/27))) | 5 | 2 | 94 | 48 | from decimal import Decimal
L = int(eval(input()))
l = Decimal(L / 3)
print(("{:.12f}".format((l) ** 3)))
| L = int(eval(input()))
print(("{:.12f}".format(L**3 / 27)))
| false | 60 | [
"-from decimal import Decimal",
"-",
"-l = Decimal(L / 3)",
"-print((\"{:.12f}\".format((l) ** 3)))",
"+print((\"{:.12f}\".format(L**3 / 27)))"
] | false | 0.047779 | 0.225308 | 0.212062 | [
"s366858824",
"s038145146"
] |
u075012704 | p02743 | python | s156605878 | s778883491 | 36 | 17 | 5,076 | 2,940 | Accepted | Accepted | 52.78 | from decimal import Decimal, getcontext
getcontext().prec = 50
a, b, c = list(map(Decimal, input().split()))
print(('Yes' if a.sqrt() + b.sqrt() < c.sqrt() else 'No'))
| a, b, c = list(map(int, input().split()))
if c - a - b <= 0:
print('No')
elif 4 * a * b < (c - a - b) ** 2:
print('Yes')
else:
print('No')
| 6 | 10 | 167 | 157 | from decimal import Decimal, getcontext
getcontext().prec = 50
a, b, c = list(map(Decimal, input().split()))
print(("Yes" if a.sqrt() + b.sqrt() < c.sqrt() else "No"))
| a, b, c = list(map(int, input().split()))
if c - a - b <= 0:
print("No")
elif 4 * a * b < (c - a - b) ** 2:
print("Yes")
else:
print("No")
| false | 40 | [
"-from decimal import Decimal, getcontext",
"-",
"-getcontext().prec = 50",
"-a, b, c = list(map(Decimal, input().split()))",
"-print((\"Yes\" if a.sqrt() + b.sqrt() < c.sqrt() else \"No\"))",
"+a, b, c = list(map(int, input().split()))",
"+if c - a - b <= 0:",
"+ print(\"No\")",
"+elif 4 * a * b... | false | 0.097174 | 0.130452 | 0.744897 | [
"s156605878",
"s778883491"
] |
u583507988 | p03161 | python | s687220931 | s431254848 | 1,730 | 186 | 20,528 | 85,728 | Accepted | Accepted | 89.25 | n, k = list(map(int, input().split()))
h = list(map(int, input().split()))
dp = [float('inf')] * n
dp[0] = 0
for i in range(1, n):
dp[i] = min(dp[j]+abs(h[i]-h[j]) for j in range(max(0, i-k), i))
print((dp[n-1])) | n,k=list(map(int,input().split()))
h=list(map(int,input().split()))
dp=[float('inf')]*n
dp[0]=0
dp[1]=abs(h[1]-h[0])
for i in range(2,n):
for j in range(1,k+1):
if i-j>=0:
res=abs(h[i]-h[i-j])
dp[i]=min(dp[i],dp[i-j]+res)
else:
break
print((dp[n-1]))
| 11 | 14 | 224 | 286 | n, k = list(map(int, input().split()))
h = list(map(int, input().split()))
dp = [float("inf")] * n
dp[0] = 0
for i in range(1, n):
dp[i] = min(dp[j] + abs(h[i] - h[j]) for j in range(max(0, i - k), i))
print((dp[n - 1]))
| n, k = list(map(int, input().split()))
h = list(map(int, input().split()))
dp = [float("inf")] * n
dp[0] = 0
dp[1] = abs(h[1] - h[0])
for i in range(2, n):
for j in range(1, k + 1):
if i - j >= 0:
res = abs(h[i] - h[i - j])
dp[i] = min(dp[i], dp[i - j] + res)
else:
... | false | 21.428571 | [
"-for i in range(1, n):",
"- dp[i] = min(dp[j] + abs(h[i] - h[j]) for j in range(max(0, i - k), i))",
"+dp[1] = abs(h[1] - h[0])",
"+for i in range(2, n):",
"+ for j in range(1, k + 1):",
"+ if i - j >= 0:",
"+ res = abs(h[i] - h[i - j])",
"+ dp[i] = min(dp[i], dp[i ... | false | 0.091298 | 0.037219 | 2.452976 | [
"s687220931",
"s431254848"
] |
u633068244 | p00102 | python | s458090987 | s643654577 | 20 | 10 | 4,232 | 4,228 | Accepted | Accepted | 50 | while True:
n = eval(input())
if n == 0: break
ls = [list(map(int, input().split()))+[0] for i in range(n)]+[[0]*(n+1)]
for row in range(n+1):
for col in range(n):
ls[n][col] += ls[row][col] if row != n else 0
ls[row][n] += ls[row][col]
print("".join([str(x).rjust(5) for x in ls[row]])) | while 1:
n = eval(input())
if n == 0: break
l = [list(map(int, input().split()))+[0] for i in range(n)]+[[0]*(n+1)]
for r in range(n+1):
for c in range(n):
l[n][c] += l[r][c] if r != n else 0
l[r][n] += l[r][c]
print("".join([str(x).rjust(5) for x in l[r]])) | 9 | 9 | 305 | 276 | while True:
n = eval(input())
if n == 0:
break
ls = [list(map(int, input().split())) + [0] for i in range(n)] + [[0] * (n + 1)]
for row in range(n + 1):
for col in range(n):
ls[n][col] += ls[row][col] if row != n else 0
ls[row][n] += ls[row][col]
print("".... | while 1:
n = eval(input())
if n == 0:
break
l = [list(map(int, input().split())) + [0] for i in range(n)] + [[0] * (n + 1)]
for r in range(n + 1):
for c in range(n):
l[n][c] += l[r][c] if r != n else 0
l[r][n] += l[r][c]
print("".join([str(x).rjust(5) for ... | false | 0 | [
"-while True:",
"+while 1:",
"- ls = [list(map(int, input().split())) + [0] for i in range(n)] + [[0] * (n + 1)]",
"- for row in range(n + 1):",
"- for col in range(n):",
"- ls[n][col] += ls[row][col] if row != n else 0",
"- ls[row][n] += ls[row][col]",
"- pri... | false | 0.037834 | 0.034697 | 1.090421 | [
"s458090987",
"s643654577"
] |
u648881683 | p03161 | python | s373238159 | s847719988 | 1,915 | 489 | 22,892 | 56,032 | Accepted | Accepted | 74.46 | import numpy as np
N, K = list(map(int, input().split()))
h = np.array(list(map(int, input().split())))
# dp = np.array([-1 for _ in range(N)])
dp = np.zeros(N, dtype=int)
dp[0] = 0
for i in range(1, N):
start = max(0, i-K)
dp[i] = min(dp[start: i] + np.abs(h[i] - h[start: i]))
print((dp[-1])... | N, K = list(map(int, input().split()))
h = list(map(int, input().split()))
dp = [-1 for _ in range(N)]
dp[0] = 0
for i in range(1, N):
dp[i] = min([dp[i-j] + abs(h[i]-h[i-j]) for j in range(1, K+1) if i-j >= 0])
print((dp[N-1])) | 15 | 11 | 314 | 242 | import numpy as np
N, K = list(map(int, input().split()))
h = np.array(list(map(int, input().split())))
# dp = np.array([-1 for _ in range(N)])
dp = np.zeros(N, dtype=int)
dp[0] = 0
for i in range(1, N):
start = max(0, i - K)
dp[i] = min(dp[start:i] + np.abs(h[i] - h[start:i]))
print((dp[-1]))
| N, K = list(map(int, input().split()))
h = list(map(int, input().split()))
dp = [-1 for _ in range(N)]
dp[0] = 0
for i in range(1, N):
dp[i] = min(
[dp[i - j] + abs(h[i] - h[i - j]) for j in range(1, K + 1) if i - j >= 0]
)
print((dp[N - 1]))
| false | 26.666667 | [
"-import numpy as np",
"-",
"-h = np.array(list(map(int, input().split())))",
"-# dp = np.array([-1 for _ in range(N)])",
"-dp = np.zeros(N, dtype=int)",
"+h = list(map(int, input().split()))",
"+dp = [-1 for _ in range(N)]",
"- start = max(0, i - K)",
"- dp[i] = min(dp[start:i] + np.abs(h[i] ... | false | 0.240262 | 0.037369 | 6.429491 | [
"s373238159",
"s847719988"
] |
u865383026 | p03073 | python | s711711705 | s191792233 | 60 | 54 | 9,212 | 9,848 | Accepted | Accepted | 10 | S = eval(input())
b = 1
B = 0
l = 0
for i in S:
if int(i) != b:
B += 1
b = 1 - b
l += 1
print((min(B, l - B))) | S = eval(input())
L = [int(i) for i in S]
b = 1
B = 0
for i in L:
if i != b:
B += 1
b = 1 - b
l = len(L)
print((min(B, l - B))) | 10 | 10 | 121 | 136 | S = eval(input())
b = 1
B = 0
l = 0
for i in S:
if int(i) != b:
B += 1
b = 1 - b
l += 1
print((min(B, l - B)))
| S = eval(input())
L = [int(i) for i in S]
b = 1
B = 0
for i in L:
if i != b:
B += 1
b = 1 - b
l = len(L)
print((min(B, l - B)))
| false | 0 | [
"+L = [int(i) for i in S]",
"-l = 0",
"-for i in S:",
"- if int(i) != b:",
"+for i in L:",
"+ if i != b:",
"- l += 1",
"+l = len(L)"
] | false | 0.037399 | 0.071692 | 0.521662 | [
"s711711705",
"s191792233"
] |
u753803401 | p03061 | python | s921587661 | s517472769 | 404 | 360 | 89,580 | 89,580 | Accepted | Accepted | 10.89 | def slove():
import sys
import fractions
input = sys.stdin.readline
n = int(input().rstrip('\n'))
a = list(map(int, input().rstrip('\n').split()))
f = [0] * (n + 1)
b = [0] * (n + 1)
for i in range(n):
f[i+1] = fractions.gcd(f[i], a[i])
b[-i-2] = fractions.gcd(b... | def slove():
import sys
import fractions
input = sys.stdin.readline
n = int(input().rstrip('\n'))
a = list(map(int, input().rstrip('\n').split()))
l = [0] * (n + 1)
r = [0] * (n + 1)
for i in range(n):
l[i+1] = fractions.gcd(l[i], a[i])
r[-i-2] = fractions.gcd(r... | 19 | 19 | 496 | 484 | def slove():
import sys
import fractions
input = sys.stdin.readline
n = int(input().rstrip("\n"))
a = list(map(int, input().rstrip("\n").split()))
f = [0] * (n + 1)
b = [0] * (n + 1)
for i in range(n):
f[i + 1] = fractions.gcd(f[i], a[i])
b[-i - 2] = fractions.gcd(b[-i -... | def slove():
import sys
import fractions
input = sys.stdin.readline
n = int(input().rstrip("\n"))
a = list(map(int, input().rstrip("\n").split()))
l = [0] * (n + 1)
r = [0] * (n + 1)
for i in range(n):
l[i + 1] = fractions.gcd(l[i], a[i])
r[-i - 2] = fractions.gcd(r[-i -... | false | 0 | [
"- f = [0] * (n + 1)",
"- b = [0] * (n + 1)",
"+ l = [0] * (n + 1)",
"+ r = [0] * (n + 1)",
"- f[i + 1] = fractions.gcd(f[i], a[i])",
"- b[-i - 2] = fractions.gcd(b[-i - 1], a[-i - 1])",
"- m_gcd = 0",
"+ l[i + 1] = fractions.gcd(l[i], a[i])",
"+ r[-i - 2] ... | false | 0.054794 | 0.055385 | 0.98933 | [
"s921587661",
"s517472769"
] |
u525065967 | p02600 | python | s297417135 | s523822450 | 31 | 28 | 9,044 | 9,044 | Accepted | Accepted | 9.68 | print((8 - (int(eval(input())) - 400) // 200))
| print((10 - int(eval(input())) // 200))
| 1 | 1 | 39 | 32 | print((8 - (int(eval(input())) - 400) // 200))
| print((10 - int(eval(input())) // 200))
| false | 0 | [
"-print((8 - (int(eval(input())) - 400) // 200))",
"+print((10 - int(eval(input())) // 200))"
] | false | 0.037716 | 0.037209 | 1.013634 | [
"s297417135",
"s523822450"
] |
u533713111 | p03997 | python | s061402692 | s201191669 | 20 | 17 | 2,940 | 2,940 | Accepted | Accepted | 15 | a = int(eval(input()))
b = int(eval(input()))
h = int(eval(input()))
s = int((a + b) * h / 2)
print(s) | a = int(eval(input()))
b = int(eval(input()))
h = int(eval(input()))
print((int((a + b) * h / 2))) | 7 | 4 | 92 | 81 | a = int(eval(input()))
b = int(eval(input()))
h = int(eval(input()))
s = int((a + b) * h / 2)
print(s)
| a = int(eval(input()))
b = int(eval(input()))
h = int(eval(input()))
print((int((a + b) * h / 2)))
| false | 42.857143 | [
"-s = int((a + b) * h / 2)",
"-print(s)",
"+print((int((a + b) * h / 2)))"
] | false | 0.055332 | 0.055128 | 1.003707 | [
"s061402692",
"s201191669"
] |
u157020659 | p02616 | python | s835818890 | s763761556 | 231 | 194 | 31,648 | 30,892 | Accepted | Accepted | 16.02 | n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
mod = 10 ** 9 + 7
plus = []
minus = []
for i in a:
if i >= 0: plus.append(i)
if i < 0: minus.append(-i)
plus.sort(reverse=True)
minus.sort(reverse=True)
ans = 1
i, j = 0, 0
if n == k:
if len(plus) % 2 == 1:
... | n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
mod = 10 ** 9 + 7
plus = []
minus = []
for i in a:
if i >= 0: plus.append(i)
if i < 0: minus.append(-i)
plus.sort(reverse=True)
minus.sort(reverse=True)
ans = 1
i, j = 0, 0
if n == k:
for x in a:
ans = (ans ... | 39 | 36 | 884 | 857 | n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
mod = 10**9 + 7
plus = []
minus = []
for i in a:
if i >= 0:
plus.append(i)
if i < 0:
minus.append(-i)
plus.sort(reverse=True)
minus.sort(reverse=True)
ans = 1
i, j = 0, 0
if n == k:
if len(plus) % 2 == 1:
ans ... | n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
mod = 10**9 + 7
plus = []
minus = []
for i in a:
if i >= 0:
plus.append(i)
if i < 0:
minus.append(-i)
plus.sort(reverse=True)
minus.sort(reverse=True)
ans = 1
i, j = 0, 0
if n == k:
for x in a:
ans = (ans * x)... | false | 7.692308 | [
"- if len(plus) % 2 == 1:",
"- ans *= plus[0]",
"- i += 1",
"- if len(minus) % 2 == 1:",
"- ans *= -minus[0]",
"- j += 1",
"-if n != k and k % 2 == 1:",
"- if len(plus) != 0:",
"- ans = plus[0]",
"- i += 1",
"- else:",
"- minus.sort(... | false | 0.048032 | 0.006816 | 7.046738 | [
"s835818890",
"s763761556"
] |
u290563917 | p03059 | python | s504085668 | s031969935 | 173 | 64 | 38,384 | 61,480 | Accepted | Accepted | 63.01 | a, b, t = list(map(int, input().split()))
ans = (t // a) * b
print(ans) | a, b, t = list(map(int, input().split()))
print(((t // a) * b)) | 5 | 2 | 71 | 56 | a, b, t = list(map(int, input().split()))
ans = (t // a) * b
print(ans)
| a, b, t = list(map(int, input().split()))
print(((t // a) * b))
| false | 60 | [
"-ans = (t // a) * b",
"-print(ans)",
"+print(((t // a) * b))"
] | false | 0.043029 | 0.043282 | 0.994151 | [
"s504085668",
"s031969935"
] |
u405483159 | p02900 | python | s533016535 | s411537058 | 201 | 109 | 3,064 | 3,064 | Accepted | Accepted | 45.77 | import math
A, B = list(map( int, input().split() ))
def factorization(n):
arr = []
temp = n
for i in range(2, int(-(-n**0.5//1))+1):
if temp%i==0:
cnt=0
while temp%i==0:
cnt+=1
temp //= i
arr.append(i)
if temp!=1:... | import math
A, B = list(map( int, input().split() ))
def euclid( A, B ):
a = A
b = B
r = a % b
while r != 0:
a = b
b = r
r = a % b
return b
def factorization(n):
arr = []
temp = n
for i in range( 2, int(-(-n**0.5//1))+1):
if temp % i == 0:
cnt=0
... | 30 | 36 | 543 | 636 | import math
A, B = list(map(int, input().split()))
def factorization(n):
arr = []
temp = n
for i in range(2, int(-(-(n**0.5) // 1)) + 1):
if temp % i == 0:
cnt = 0
while temp % i == 0:
cnt += 1
temp //= i
arr.append(i)
if tem... | import math
A, B = list(map(int, input().split()))
def euclid(A, B):
a = A
b = B
r = a % b
while r != 0:
a = b
b = r
r = a % b
return b
def factorization(n):
arr = []
temp = n
for i in range(2, int(-(-(n**0.5) // 1)) + 1):
if temp % i == 0:
... | false | 16.666667 | [
"+",
"+",
"+def euclid(A, B):",
"+ a = A",
"+ b = B",
"+ r = a % b",
"+ while r != 0:",
"+ a = b",
"+ b = r",
"+ r = a % b",
"+ return b",
"- return set(arr)",
"+ return len(set(arr))",
"-a = factorization(A)",
"-b = factorization(B)",
"-cnt = ... | false | 0.080304 | 0.082183 | 0.97713 | [
"s533016535",
"s411537058"
] |
u977661421 | p02887 | python | s741584895 | s461392179 | 1,528 | 45 | 4,084 | 4,084 | Accepted | Accepted | 97.05 | # -*- coding: utf-8 -*-
n = int(eval(input()))
s = list(str(eval(input())))
def remove_adjacent(nums):
i = 1
while i < len(nums):
if nums[i] == nums[i-1]:
nums.pop(i)
i -= 1
i += 1
return nums
remove_adjacent(s)
print((len(s)))
| # -*- coding: utf-8 -*-
n = int(eval(input()))
s = list(str(eval(input())))
ans = 1
for i in range(n - 1):
if s[i] != s[i + 1]:
ans += 1
print(ans)
"""
def remove_adjacent(nums):
i = 1
while i < len(nums):
if nums[i] == nums[i-1]:
nums.pop(i)
i -= 1
i += 1
... | 15 | 23 | 262 | 362 | # -*- coding: utf-8 -*-
n = int(eval(input()))
s = list(str(eval(input())))
def remove_adjacent(nums):
i = 1
while i < len(nums):
if nums[i] == nums[i - 1]:
nums.pop(i)
i -= 1
i += 1
return nums
remove_adjacent(s)
print((len(s)))
| # -*- coding: utf-8 -*-
n = int(eval(input()))
s = list(str(eval(input())))
ans = 1
for i in range(n - 1):
if s[i] != s[i + 1]:
ans += 1
print(ans)
"""
def remove_adjacent(nums):
i = 1
while i < len(nums):
if nums[i] == nums[i-1]:
nums.pop(i)
i -= 1
i += 1
return nums
remove_... | false | 34.782609 | [
"-",
"-",
"+ans = 1",
"+for i in range(n - 1):",
"+ if s[i] != s[i + 1]:",
"+ ans += 1",
"+print(ans)",
"+\"\"\"",
"- i = 1",
"- while i < len(nums):",
"- if nums[i] == nums[i - 1]:",
"- nums.pop(i)",
"- i -= 1",
"- i += 1",
"- retur... | false | 0.101035 | 0.036735 | 2.750368 | [
"s741584895",
"s461392179"
] |
u145231176 | p03805 | python | s678482868 | s597512979 | 277 | 158 | 65,900 | 83,800 | Accepted | Accepted | 42.96 | def getN():
return int(eval(input()))
def getNM():
return list(map(int, input().split()))
def getList():
return list(map(int, input().split()))
def getArray(intn):
return [int(eval(input())) for i in range(intn)]
def input():
return sys.stdin.readline().rstrip()
from collections import d... | def getN():
return int(eval(input()))
def getNM():
return list(map(int, input().split()))
def getList():
return list(map(int, input().split()))
def getArray(intn):
return [int(eval(input())) for i in range(intn)]
def input():
return sys.stdin.readline().rstrip()
def rand_N(ran1, ran2):
... | 46 | 93 | 1,026 | 2,398 | def getN():
return int(eval(input()))
def getNM():
return list(map(int, input().split()))
def getList():
return list(map(int, input().split()))
def getArray(intn):
return [int(eval(input())) for i in range(intn)]
def input():
return sys.stdin.readline().rstrip()
from collections import def... | def getN():
return int(eval(input()))
def getNM():
return list(map(int, input().split()))
def getList():
return list(map(int, input().split()))
def getArray(intn):
return [int(eval(input())) for i in range(intn)]
def input():
return sys.stdin.readline().rstrip()
def rand_N(ran1, ran2):
... | false | 50.537634 | [
"+def rand_N(ran1, ran2):",
"+ return random.randint(ran1, ran2)",
"+",
"+",
"+def rand_List(ran1, ran2, rantime):",
"+ return [random.randint(ran1, ran2) for i in range(rantime)]",
"+",
"+",
"+def rand_ints_nodup(ran1, ran2, rantime):",
"+ ns = []",
"+ while len(ns) < rantime:",
"... | false | 0.043135 | 0.075345 | 0.572494 | [
"s678482868",
"s597512979"
] |
u634079249 | p03607 | python | s191848039 | s438273893 | 124 | 102 | 11,884 | 15,460 | Accepted | Accepted | 17.74 | import sys
import os
import math
ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: list(map(int, sys.stdin.buffer.readline().split()))
fl = lambda: list(map(float, sys.stdin.buffer.readline().split()))
iln = lambda n: [int(sys.stdin.buffer.readline().rstrip()) for _ in range(n)]
iss = lambd... | import sys
import os
import math
import bisect
import collections
import itertools
ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: list(map(int, sys.stdin.buffer.readline().split()))
fl = lambda: list(map(float, sys.stdin.buffer.readline().split()))
iln = lambda n: [int(sys.stdin.buffer.r... | 30 | 38 | 802 | 1,002 | import sys
import os
import math
ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: list(map(int, sys.stdin.buffer.readline().split()))
fl = lambda: list(map(float, sys.stdin.buffer.readline().split()))
iln = lambda n: [int(sys.stdin.buffer.readline().rstrip()) for _ in range(n)]
iss = lambda: sys.std... | import sys
import os
import math
import bisect
import collections
import itertools
ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: list(map(int, sys.stdin.buffer.readline().split()))
fl = lambda: list(map(float, sys.stdin.buffer.readline().split()))
iln = lambda n: [int(sys.stdin.buffer.readline().... | false | 21.052632 | [
"+import bisect",
"+import collections",
"+import itertools",
"+lcm = lambda x, y: x * y / math.gcd(x, y)",
"+MAX = float(\"inf\")",
"+",
"+",
"+def f(A, B, x):",
"+ return math.floor(A * x / B) - A * math.floor(x / B)",
"- ret = set()",
"- for n in range(N):",
"- i = [ii()]",
... | false | 0.042976 | 0.043701 | 0.983404 | [
"s191848039",
"s438273893"
] |
u062484507 | p02689 | python | s330603880 | s222677192 | 318 | 155 | 31,900 | 18,288 | Accepted | Accepted | 51.26 | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
n, m = list(map(int, readline().split()))
h = list(map(int, readline().split()))
ab = [list(map(int, input().split())) for _ in range(m)]
l = [1]*n
for i in range(m):
if h[ab[i][0] - 1] <... | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
n, m = list(map(int, readline().split()))
h = list(map(int, readline().split()))
l = [1]*n
for i in range(m):
a, b= list(map(int, readline().split()))
if h[a - 1] < h[b - 1]:
... | 19 | 19 | 518 | 445 | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
n, m = list(map(int, readline().split()))
h = list(map(int, readline().split()))
ab = [list(map(int, input().split())) for _ in range(m)]
l = [1] * n
for i in range(m):
if h[ab[i][0] - 1] < h[ab[i][1... | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
n, m = list(map(int, readline().split()))
h = list(map(int, readline().split()))
l = [1] * n
for i in range(m):
a, b = list(map(int, readline().split()))
if h[a - 1] < h[b - 1]:
l[a - 1] ... | false | 0 | [
"-ab = [list(map(int, input().split())) for _ in range(m)]",
"- if h[ab[i][0] - 1] < h[ab[i][1] - 1]:",
"- l[ab[i][0] - 1] = 0",
"- elif h[ab[i][0] - 1] > h[ab[i][1] - 1]:",
"- l[ab[i][1] - 1] = 0",
"+ a, b = list(map(int, readline().split()))",
"+ if h[a - 1] < h[b - 1]:",
"... | false | 0.126712 | 0.049217 | 2.574536 | [
"s330603880",
"s222677192"
] |
u790710233 | p03470 | python | s824769847 | s569963812 | 20 | 17 | 2,940 | 2,940 | Accepted | Accepted | 15 | n = int(eval(input()))
s = set(int(eval(input())) for _ in range(n))
print((len(s)))
| n = int(eval(input()))
print((len(set(eval(input()) for _ in range(n)))))
| 3 | 2 | 73 | 61 | n = int(eval(input()))
s = set(int(eval(input())) for _ in range(n))
print((len(s)))
| n = int(eval(input()))
print((len(set(eval(input()) for _ in range(n)))))
| false | 33.333333 | [
"-s = set(int(eval(input())) for _ in range(n))",
"-print((len(s)))",
"+print((len(set(eval(input()) for _ in range(n)))))"
] | false | 0.068692 | 0.069334 | 0.990748 | [
"s824769847",
"s569963812"
] |
u028973125 | p03673 | python | s683997140 | s084103498 | 471 | 328 | 93,908 | 108,880 | Accepted | Accepted | 30.36 | n = int(input())
a = list(map(int, input().split()))
if n % 2 == 0:
for i in reversed(range(1, n, 2)):
print(a[i],end=" ")
for i in range(0,n-1,2):
print(a[i],end=" ")
elif n % 2 == 1:
for i in reversed(range(0, n, 2)):
print(a[i],end=" ")
for i in range(1, n, 2):
... | import sys
from collections import deque
n = int(sys.stdin.readline().strip())
A = list(map(int, sys.stdin.readline().strip().split()))
q = deque()
for i, a_i in enumerate(A):
if i % 2 == 0:
q.append(a_i)
else:
q.appendleft(a_i)
ans = list(map(str, q))
if n % 2 == 1:
ans ... | 13 | 19 | 346 | 349 | n = int(input())
a = list(map(int, input().split()))
if n % 2 == 0:
for i in reversed(range(1, n, 2)):
print(a[i], end=" ")
for i in range(0, n - 1, 2):
print(a[i], end=" ")
elif n % 2 == 1:
for i in reversed(range(0, n, 2)):
print(a[i], end=" ")
for i in range(1, n, 2):
... | import sys
from collections import deque
n = int(sys.stdin.readline().strip())
A = list(map(int, sys.stdin.readline().strip().split()))
q = deque()
for i, a_i in enumerate(A):
if i % 2 == 0:
q.append(a_i)
else:
q.appendleft(a_i)
ans = list(map(str, q))
if n % 2 == 1:
ans = ans[::-1]
print((... | false | 31.578947 | [
"-n = int(input())",
"-a = list(map(int, input().split()))",
"-if n % 2 == 0:",
"- for i in reversed(range(1, n, 2)):",
"- print(a[i], end=\" \")",
"- for i in range(0, n - 1, 2):",
"- print(a[i], end=\" \")",
"-elif n % 2 == 1:",
"- for i in reversed(range(0, n, 2)):",
"- ... | false | 0.041053 | 0.063715 | 0.644333 | [
"s683997140",
"s084103498"
] |
u223133214 | p03111 | python | s898358601 | s737890178 | 639 | 74 | 3,064 | 3,064 | Accepted | Accepted | 88.42 | def Base_10_to_n(X, n):
if (int(X/n)):
return Base_10_to_n(int(X/n), n)+str(X%n)
return str(X%n)
n,a,b,c=list(map(int,input().split()))
L=[]
for _ in range(n):
L.append(int(eval(input())))
ans=99999
for i in range(4**len(L)):
i_4_list=list(Base_10_to_n(i, 4).zfill(len(L)))
at,... | N,A,B,C=list(map(int,input().split()))
L = []
for i in range(N):
L.append(int(eval(input())))
def dfs(n,a,b,c):
if n == N:
if min(a,b,c)>0:
return abs(A-a)+abs(B-b)+abs(C-c)-30
else:
return 10000
root1=dfs(n+1,a+L[n],b,c)+10
root2=dfs(n+1,a,b+L[n],c)+... | 30 | 19 | 775 | 441 | def Base_10_to_n(X, n):
if int(X / n):
return Base_10_to_n(int(X / n), n) + str(X % n)
return str(X % n)
n, a, b, c = list(map(int, input().split()))
L = []
for _ in range(n):
L.append(int(eval(input())))
ans = 99999
for i in range(4 ** len(L)):
i_4_list = list(Base_10_to_n(i, 4).zfill(len(L))... | N, A, B, C = list(map(int, input().split()))
L = []
for i in range(N):
L.append(int(eval(input())))
def dfs(n, a, b, c):
if n == N:
if min(a, b, c) > 0:
return abs(A - a) + abs(B - b) + abs(C - c) - 30
else:
return 10000
root1 = dfs(n + 1, a + L[n], b, c) + 10
r... | false | 36.666667 | [
"-def Base_10_to_n(X, n):",
"- if int(X / n):",
"- return Base_10_to_n(int(X / n), n) + str(X % n)",
"- return str(X % n)",
"+N, A, B, C = list(map(int, input().split()))",
"+L = []",
"+for i in range(N):",
"+ L.append(int(eval(input())))",
"-n, a, b, c = list(map(int, input().split(... | false | 0.676159 | 0.089352 | 7.567378 | [
"s898358601",
"s737890178"
] |
u753803401 | p03481 | python | s656646775 | s118991134 | 178 | 163 | 38,384 | 38,384 | Accepted | Accepted | 8.43 | def slove():
import sys
input = sys.stdin.readline
n, m = list(map(int, input().rstrip('\n').split()))
cnt = 1
t = n
while True:
t *= 2
if t <= m:
cnt += 1
else:
print(cnt)
exit()
if __name__ == '__main__':
slove()... | def slove():
import sys
input = sys.stdin.readline
x, y = list(map(int, input().rstrip('\n').split()))
t = x
cnt = 1
while True:
t *= 2
if t <= y:
cnt += 1
else:
print(cnt)
exit()
if __name__ == '__main__':
slove()... | 17 | 17 | 321 | 321 | def slove():
import sys
input = sys.stdin.readline
n, m = list(map(int, input().rstrip("\n").split()))
cnt = 1
t = n
while True:
t *= 2
if t <= m:
cnt += 1
else:
print(cnt)
exit()
if __name__ == "__main__":
slove()
| def slove():
import sys
input = sys.stdin.readline
x, y = list(map(int, input().rstrip("\n").split()))
t = x
cnt = 1
while True:
t *= 2
if t <= y:
cnt += 1
else:
print(cnt)
exit()
if __name__ == "__main__":
slove()
| false | 0 | [
"- n, m = list(map(int, input().rstrip(\"\\n\").split()))",
"+ x, y = list(map(int, input().rstrip(\"\\n\").split()))",
"+ t = x",
"- t = n",
"- if t <= m:",
"+ if t <= y:"
] | false | 0.047747 | 0.120894 | 0.39495 | [
"s656646775",
"s118991134"
] |
u761320129 | p02951 | python | s109889772 | s547695555 | 20 | 17 | 3,316 | 2,940 | Accepted | Accepted | 15 | A,B,C= list(map(int,input().split()))
print((max(0,C-(A-B)))) | a,b,c = list(map(int,input().split()))
rem = a-b
print((max(0,c-rem)))
| 2 | 3 | 55 | 65 | A, B, C = list(map(int, input().split()))
print((max(0, C - (A - B))))
| a, b, c = list(map(int, input().split()))
rem = a - b
print((max(0, c - rem)))
| false | 33.333333 | [
"-A, B, C = list(map(int, input().split()))",
"-print((max(0, C - (A - B))))",
"+a, b, c = list(map(int, input().split()))",
"+rem = a - b",
"+print((max(0, c - rem)))"
] | false | 0.038101 | 0.039271 | 0.970212 | [
"s109889772",
"s547695555"
] |
u261103969 | p02601 | python | s617954607 | s144488697 | 71 | 27 | 61,740 | 9,056 | Accepted | Accepted | 61.97 | import sys
readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)
def main():
a, b, c = list(map(int, readline().split()))
k = int(readline())
cnt = 0
while a >= b:
b *= 2
cnt += 1
while b >= c:
c *= 2
... | a, b, c = list(map(int, input().split()))
k = int(eval(input()))
cnt = 0
while a >= b:
b *= 2
cnt += 1
while b >= c:
c *= 2
cnt += 1
if cnt <= k:
print("Yes")
else:
print("No")
| 29 | 17 | 442 | 209 | import sys
readline = sys.stdin.readline
MOD = 10**9 + 7
INF = float("INF")
sys.setrecursionlimit(10**5)
def main():
a, b, c = list(map(int, readline().split()))
k = int(readline())
cnt = 0
while a >= b:
b *= 2
cnt += 1
while b >= c:
c *= 2
cnt += 1
if cnt <= k... | a, b, c = list(map(int, input().split()))
k = int(eval(input()))
cnt = 0
while a >= b:
b *= 2
cnt += 1
while b >= c:
c *= 2
cnt += 1
if cnt <= k:
print("Yes")
else:
print("No")
| false | 41.37931 | [
"-import sys",
"-",
"-readline = sys.stdin.readline",
"-MOD = 10**9 + 7",
"-INF = float(\"INF\")",
"-sys.setrecursionlimit(10**5)",
"-",
"-",
"-def main():",
"- a, b, c = list(map(int, readline().split()))",
"- k = int(readline())",
"- cnt = 0",
"- while a >= b:",
"- b *... | false | 0.042028 | 0.037054 | 1.134238 | [
"s617954607",
"s144488697"
] |
u093500767 | p04044 | python | s013470351 | s248075002 | 19 | 17 | 3,316 | 3,060 | Accepted | Accepted | 10.53 | a = list(map(int,input().split()))
b = [eval(input()) for i in range(a[0])]
c = sorted(b)
print(("".join(c))) | N , L= list(map(int,input().split()))
lst = []
for i in range(N):
lst.append(eval(input()))
lst.sort()
Str = ''
for j in range(N):
Str += lst[j]
print(Str) | 4 | 9 | 104 | 159 | a = list(map(int, input().split()))
b = [eval(input()) for i in range(a[0])]
c = sorted(b)
print(("".join(c)))
| N, L = list(map(int, input().split()))
lst = []
for i in range(N):
lst.append(eval(input()))
lst.sort()
Str = ""
for j in range(N):
Str += lst[j]
print(Str)
| false | 55.555556 | [
"-a = list(map(int, input().split()))",
"-b = [eval(input()) for i in range(a[0])]",
"-c = sorted(b)",
"-print((\"\".join(c)))",
"+N, L = list(map(int, input().split()))",
"+lst = []",
"+for i in range(N):",
"+ lst.append(eval(input()))",
"+lst.sort()",
"+Str = \"\"",
"+for j in range(N):",
... | false | 0.054279 | 0.064141 | 0.846241 | [
"s013470351",
"s248075002"
] |
u073852194 | p03111 | python | s029208653 | s097788532 | 577 | 327 | 5,012 | 51,036 | Accepted | Accepted | 43.33 | n,a,b,c = list(map(int,input().split()))
L = [int(eval(input())) for i in range(n)]
MP = []
for i in range(4**n):
i_bit = bin(i)[2:].zfill(2*n)
co_a = 0
co_b = 0
co_c = 0
p_a = 0
p_b = 0
p_c = 0
for j in range(n):
if i_bit[-1-2*j:-3-2*j:-1] == '00':
co_a ... | N,A,B,C = list(map(int,input().split()))
L = [int(eval(input())) for _ in range(N)]
minmp = 10**18
for i in range(4**N):
mp = 0
a = []
b = []
c = []
d = []
for j in range(N):
if i>>(2*j) & 1:
if i>>(2*j+1) & 1:
a.append(j)
el... | 26 | 36 | 712 | 784 | n, a, b, c = list(map(int, input().split()))
L = [int(eval(input())) for i in range(n)]
MP = []
for i in range(4**n):
i_bit = bin(i)[2:].zfill(2 * n)
co_a = 0
co_b = 0
co_c = 0
p_a = 0
p_b = 0
p_c = 0
for j in range(n):
if i_bit[-1 - 2 * j : -3 - 2 * j : -1] == "00":
... | N, A, B, C = list(map(int, input().split()))
L = [int(eval(input())) for _ in range(N)]
minmp = 10**18
for i in range(4**N):
mp = 0
a = []
b = []
c = []
d = []
for j in range(N):
if i >> (2 * j) & 1:
if i >> (2 * j + 1) & 1:
a.append(j)
else:
... | false | 27.777778 | [
"-n, a, b, c = list(map(int, input().split()))",
"-L = [int(eval(input())) for i in range(n)]",
"-MP = []",
"-for i in range(4**n):",
"- i_bit = bin(i)[2:].zfill(2 * n)",
"- co_a = 0",
"- co_b = 0",
"- co_c = 0",
"- p_a = 0",
"- p_b = 0",
"- p_c = 0",
"- for j in range(... | false | 0.960406 | 0.542101 | 1.771635 | [
"s029208653",
"s097788532"
] |
u968166680 | p02720 | python | s653989846 | s519026802 | 167 | 82 | 77,924 | 74,360 | Accepted | Accepted | 50.9 | import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
def main():
K = int(readline())
n = 0
def dfs(vec, d):
nonlocal n
if d == 0:
n += 1
if ... | import sys
from collections import deque
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
def main():
K = int(readline())
queue = deque(list(range(1, 10)))
for _ in range(K):
n = queu... | 44 | 32 | 861 | 609 | import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10**9)
INF = 1 << 60
MOD = 1000000007
def main():
K = int(readline())
n = 0
def dfs(vec, d):
nonlocal n
if d == 0:
n += 1
if n == K:
... | import sys
from collections import deque
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10**9)
INF = 1 << 60
MOD = 1000000007
def main():
K = int(readline())
queue = deque(list(range(1, 10)))
for _ in range(K):
n = queue.popleft()
... | false | 27.272727 | [
"+from collections import deque",
"- n = 0",
"-",
"- def dfs(vec, d):",
"- nonlocal n",
"- if d == 0:",
"- n += 1",
"- if n == K:",
"- print((\"\".join(map(str, vec))))",
"- return",
"- else:",
"- ... | false | 0.053418 | 0.094116 | 0.567571 | [
"s653989846",
"s519026802"
] |
u815763296 | p02957 | python | s490345162 | s464632852 | 27 | 24 | 9,096 | 9,020 | Accepted | Accepted | 11.11 | A, B = list(map(int, input().split()))
if (A+B) % 2 == 0:
print(((A+B)//2))
else:
print("IMPOSSIBLE")
| def LI():
return list(map(int, input().split()))
A, B = LI()
if (A+B) % 2 == 0:
ans = (A+B)//2
else:
ans = "IMPOSSIBLE"
print(ans)
| 5 | 10 | 106 | 154 | A, B = list(map(int, input().split()))
if (A + B) % 2 == 0:
print(((A + B) // 2))
else:
print("IMPOSSIBLE")
| def LI():
return list(map(int, input().split()))
A, B = LI()
if (A + B) % 2 == 0:
ans = (A + B) // 2
else:
ans = "IMPOSSIBLE"
print(ans)
| false | 50 | [
"-A, B = list(map(int, input().split()))",
"+def LI():",
"+ return list(map(int, input().split()))",
"+",
"+",
"+A, B = LI()",
"- print(((A + B) // 2))",
"+ ans = (A + B) // 2",
"- print(\"IMPOSSIBLE\")",
"+ ans = \"IMPOSSIBLE\"",
"+print(ans)"
] | false | 0.039392 | 0.045952 | 0.857242 | [
"s490345162",
"s464632852"
] |
u951601135 | p03835 | python | s878464186 | s768057919 | 1,593 | 1,460 | 2,940 | 2,940 | Accepted | Accepted | 8.35 | K,S=list(map(int,input().split()))
count=0
for x in range(K+1):
for y in range(K+1):
z=S-x-y
if(0<=z<=K):
count+=1
else:pass
print(count) | K , S = list(map(int,input().split()))
count = 0
for x in range(K + 1):
for y in range(K + 1):
z = S - x - y
if(0 <= z <= K):
count += 1
print(count) | 9 | 8 | 159 | 166 | K, S = list(map(int, input().split()))
count = 0
for x in range(K + 1):
for y in range(K + 1):
z = S - x - y
if 0 <= z <= K:
count += 1
else:
pass
print(count)
| K, S = list(map(int, input().split()))
count = 0
for x in range(K + 1):
for y in range(K + 1):
z = S - x - y
if 0 <= z <= K:
count += 1
print(count)
| false | 11.111111 | [
"- else:",
"- pass"
] | false | 0.00877 | 0.038085 | 0.230279 | [
"s878464186",
"s768057919"
] |
u022407960 | p02257 | python | s819808698 | s011262731 | 500 | 40 | 8,648 | 8,820 | Accepted | Accepted | 92 | #!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
input:
11
7
8
9
10
11
12
13
14
15
16
17
output:
4
"""
import sys
import math
def is_prime(x):
if x == 2:
return True
elif x < 2 or not x % 2:
return False
i = 3
x_sqrt = math.sqrt(x)
while i <... | #!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
input:
11
7
8
9
10
11
12
13
14
15
16
17
output:
4
"""
import sys
def is_prime(x):
if x == 2:
return True
elif x < 2 or not x % 2:
return False
return pow(2, x - 1, x) == 1
def solve(_c_list):
c... | 57 | 49 | 719 | 594 | #!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
input:
11
7
8
9
10
11
12
13
14
15
16
17
output:
4
"""
import sys
import math
def is_prime(x):
if x == 2:
return True
elif x < 2 or not x % 2:
return False
i = 3
x_sqrt = math.sqrt(x)
while i <= x_sqrt:
if not x % i:
... | #!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
input:
11
7
8
9
10
11
12
13
14
15
16
17
output:
4
"""
import sys
def is_prime(x):
if x == 2:
return True
elif x < 2 or not x % 2:
return False
return pow(2, x - 1, x) == 1
def solve(_c_list):
cnt = 0
for ele in _c_list:
if... | false | 14.035088 | [
"-import math",
"- i = 3",
"- x_sqrt = math.sqrt(x)",
"- while i <= x_sqrt:",
"- if not x % i:",
"- return False",
"- i += 2",
"- return True",
"+ return pow(2, x - 1, x) == 1"
] | false | 0.098788 | 0.039507 | 2.500495 | [
"s819808698",
"s011262731"
] |
u691018832 | p03137 | python | s828142743 | s128806117 | 1,545 | 112 | 13,960 | 11,696 | Accepted | Accepted | 92.75 | n, m = list(map(int, input().split()))
x = list(map(int, input().split()))
if n >= m:
ans = 0
else:
x.sort()
cheak = [0]*(m-1)
for i in range(m-1):
cheak[i] = abs(x[i+1]-x[i])
cheak.sort(reverse=True)
for j in range(n-1):
cheak.pop(0)
ans = sum... | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)
n, m, *x = list(map(int, read().split()))
x.sort(reverse=True)
memo = [0] * m
for i, (bf, af) in enumerate(zip(x, x[1:])):
memo[i] = bf - af
memo.sort(revers... | 18 | 13 | 333 | 348 | n, m = list(map(int, input().split()))
x = list(map(int, input().split()))
if n >= m:
ans = 0
else:
x.sort()
cheak = [0] * (m - 1)
for i in range(m - 1):
cheak[i] = abs(x[i + 1] - x[i])
cheak.sort(reverse=True)
for j in range(n - 1):
cheak.pop(0)
ans = sum(cheak)
print(ans)
| import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10**7)
n, m, *x = list(map(int, read().split()))
x.sort(reverse=True)
memo = [0] * m
for i, (bf, af) in enumerate(zip(x, x[1:])):
memo[i] = bf - af
memo.sort(reverse=True)
print... | false | 27.777778 | [
"-n, m = list(map(int, input().split()))",
"-x = list(map(int, input().split()))",
"-if n >= m:",
"- ans = 0",
"-else:",
"- x.sort()",
"- cheak = [0] * (m - 1)",
"- for i in range(m - 1):",
"- cheak[i] = abs(x[i + 1] - x[i])",
"- cheak.sort(reverse=True)",
"- for j in ra... | false | 0.095178 | 0.035115 | 2.710452 | [
"s828142743",
"s128806117"
] |
u125205981 | p03732 | python | s393725996 | s245706112 | 1,012 | 402 | 9,808 | 9,804 | Accepted | Accepted | 60.28 | def main():
N, W = list(map(int, input().split()))
w1 = [0, 0]
w2 = [0, 0]
w3 = [0, 0]
w4 = [0, 0]
v1 = []
v2 = []
v3 = []
v4 = []
i = 0
while i < N:
w, v = list(map(int, input().split()))
if i == 0 or w == w1[0]:
w1[0] = w
... | def main():
N, W = list(map(int, input().split()))
w1 = [0, 0]
w2 = [0, 0]
w3 = [0, 0]
w4 = [0, 0]
v1 = []
v2 = []
v3 = []
v4 = []
i = 0
while i < N:
w, v = list(map(int, input().split()))
if i == 0 or w == w1[0]:
w1[0] = w
... | 49 | 51 | 1,190 | 1,198 | def main():
N, W = list(map(int, input().split()))
w1 = [0, 0]
w2 = [0, 0]
w3 = [0, 0]
w4 = [0, 0]
v1 = []
v2 = []
v3 = []
v4 = []
i = 0
while i < N:
w, v = list(map(int, input().split()))
if i == 0 or w == w1[0]:
w1[0] = w
w1[1] += 1
... | def main():
N, W = list(map(int, input().split()))
w1 = [0, 0]
w2 = [0, 0]
w3 = [0, 0]
w4 = [0, 0]
v1 = []
v2 = []
v3 = []
v4 = []
i = 0
while i < N:
w, v = list(map(int, input().split()))
if i == 0 or w == w1[0]:
w1[0] = w
w1[1] += 1
... | false | 3.921569 | [
"- v = sum(v1[:i] + v2[:j] + v3[:k] + v4[:l])",
"+ v = sum(v1[:i] + v2[:j] + v3[:k] + v4[:l])"
] | false | 0.046416 | 0.045859 | 1.01213 | [
"s393725996",
"s245706112"
] |
u189023301 | p02959 | python | s854722937 | s258395153 | 143 | 131 | 23,896 | 24,092 | Accepted | Accepted | 8.39 | def solve():
n = int(eval(input()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
ans = 0
for i in range(n):
ans += min(B[i], A[i] + A[i + 1])
A[i + 1] = min(A[i + 1], max(A[i] + A[i + 1] - B[i], 0))
print(ans)
solve()
| def solve():
n = int(eval(input()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
ans = 0
for i in range(n):
x = A[i] + A[i + 1]
ans += min(B[i], x)
A[i + 1] = min(A[i + 1], max(x - B[i], 0))
print(ans)
solve()
| 12 | 13 | 292 | 293 | def solve():
n = int(eval(input()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
ans = 0
for i in range(n):
ans += min(B[i], A[i] + A[i + 1])
A[i + 1] = min(A[i + 1], max(A[i] + A[i + 1] - B[i], 0))
print(ans)
solve()
| def solve():
n = int(eval(input()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
ans = 0
for i in range(n):
x = A[i] + A[i + 1]
ans += min(B[i], x)
A[i + 1] = min(A[i + 1], max(x - B[i], 0))
print(ans)
solve()
| false | 7.692308 | [
"- ans += min(B[i], A[i] + A[i + 1])",
"- A[i + 1] = min(A[i + 1], max(A[i] + A[i + 1] - B[i], 0))",
"+ x = A[i] + A[i + 1]",
"+ ans += min(B[i], x)",
"+ A[i + 1] = min(A[i + 1], max(x - B[i], 0))"
] | false | 0.039565 | 0.046956 | 0.842595 | [
"s854722937",
"s258395153"
] |
u543954314 | p03169 | python | s896095630 | s546027503 | 951 | 619 | 253,832 | 253,960 | Accepted | Accepted | 34.91 | from collections import Counter
import sys
input = sys.stdin.buffer.readline
def main():
n = int(eval(input()))
m = float(n)
a = Counter(list(map(int, input().split())))
dp = [[[.0] * (n+1) for _ in range(n+1)] for _ in range(n+1)]
for k in range(a[3]+1):
for j in range(a[2]+a[3]-... | n = int(eval(input()))
a = list(map(int, input().split()))
uno = a.count(1)
dos = a.count(2)
tres = n - uno - dos
dp = [[[.0]*(n+1) for _ in range(dos+tres+1)] for j in range(tres+1)]
for k in range(tres+1):
for j in range(dos+tres-k+1):
for i in range(n+1-j-k):
if i+j+k == 0: continue
v = i... | 26 | 17 | 786 | 509 | from collections import Counter
import sys
input = sys.stdin.buffer.readline
def main():
n = int(eval(input()))
m = float(n)
a = Counter(list(map(int, input().split())))
dp = [[[0.0] * (n + 1) for _ in range(n + 1)] for _ in range(n + 1)]
for k in range(a[3] + 1):
for j in range(a[2] + a[... | n = int(eval(input()))
a = list(map(int, input().split()))
uno = a.count(1)
dos = a.count(2)
tres = n - uno - dos
dp = [[[0.0] * (n + 1) for _ in range(dos + tres + 1)] for j in range(tres + 1)]
for k in range(tres + 1):
for j in range(dos + tres - k + 1):
for i in range(n + 1 - j - k):
if i + j... | false | 34.615385 | [
"-from collections import Counter",
"-import sys",
"-",
"-input = sys.stdin.buffer.readline",
"-",
"-",
"-def main():",
"- n = int(eval(input()))",
"- m = float(n)",
"- a = Counter(list(map(int, input().split())))",
"- dp = [[[0.0] * (n + 1) for _ in range(n + 1)] for _ in range(n + ... | false | 0.116931 | 0.065978 | 1.772286 | [
"s896095630",
"s546027503"
] |
u971091945 | p02761 | python | s637459146 | s318342479 | 20 | 18 | 3,188 | 3,064 | Accepted | Accepted | 10 | n, m = map(int, input().split())
li = [0]*n
for i in range(m):
s, c = map(int, input().split())
if li[s-1] != 0 and li[s-1] != c:
print(-1)
exit(0)
if s==1 and c==0:
if n>1:
print(-1)
exit(0)
li[s-1]=c
if n>1 and li[0]==0:
li[0]=1
... | n, m = list(map(int, input().split()))
sc_li = [list(map(int,input().split())) for _ in range(m)]
sc = []
i_s = ""
for i in range(1000):
flag = True
i_s= str(i)
if len(i_s) != n:
continue
for j in range(m):
sc = sc_li[j]
s = sc[0]
c = sc[1]
if int(i... | 20 | 21 | 365 | 418 | n, m = map(int, input().split())
li = [0] * n
for i in range(m):
s, c = map(int, input().split())
if li[s - 1] != 0 and li[s - 1] != c:
print(-1)
exit(0)
if s == 1 and c == 0:
if n > 1:
print(-1)
exit(0)
li[s - 1] = c
if n > 1 and li[0] == 0:
li[0] = 1... | n, m = list(map(int, input().split()))
sc_li = [list(map(int, input().split())) for _ in range(m)]
sc = []
i_s = ""
for i in range(1000):
flag = True
i_s = str(i)
if len(i_s) != n:
continue
for j in range(m):
sc = sc_li[j]
s = sc[0]
c = sc[1]
if int(i_s[s - 1]) !=... | false | 4.761905 | [
"-n, m = map(int, input().split())",
"-li = [0] * n",
"-for i in range(m):",
"- s, c = map(int, input().split())",
"- if li[s - 1] != 0 and li[s - 1] != c:",
"- print(-1)",
"+n, m = list(map(int, input().split()))",
"+sc_li = [list(map(int, input().split())) for _ in range(m)]",
"+sc = ... | false | 0.037799 | 0.040014 | 0.944653 | [
"s637459146",
"s318342479"
] |
u644907318 | p03213 | python | s519766251 | s799050937 | 166 | 100 | 38,640 | 63,652 | Accepted | Accepted | 39.76 | P = [1 for _ in range(100)]
P[0]=0
P[1]=0
for i in range(2,11):
for j in range(i*i,100,i):
P[j] = 0
Q = []
for i in range(100):
if P[i]==1:
Q.append(i)
N = int(eval(input()))
C = {p:0 for p in Q}
for p in Q:
cnt = 0
k = 1
while p**k<=N:
for i in range(2,N+1):
... | P = [1 for _ in range(100)]
P[0]=0
P[1]=0
for i in range(2,11):
for j in range(i*i,100,i):
P[j] = 0
Q = []
for i in range(2,100):
if P[i]==1:
Q.append(i)
C = {q:0 for q in Q}
N = int(eval(input()))
for i in range(2,N+1):
x = i
for q in Q:
while x%q==0:
... | 42 | 35 | 713 | 757 | P = [1 for _ in range(100)]
P[0] = 0
P[1] = 0
for i in range(2, 11):
for j in range(i * i, 100, i):
P[j] = 0
Q = []
for i in range(100):
if P[i] == 1:
Q.append(i)
N = int(eval(input()))
C = {p: 0 for p in Q}
for p in Q:
cnt = 0
k = 1
while p**k <= N:
for i in range(2, N + 1):... | P = [1 for _ in range(100)]
P[0] = 0
P[1] = 0
for i in range(2, 11):
for j in range(i * i, 100, i):
P[j] = 0
Q = []
for i in range(2, 100):
if P[i] == 1:
Q.append(i)
C = {q: 0 for q in Q}
N = int(eval(input()))
for i in range(2, N + 1):
x = i
for q in Q:
while x % q == 0:
... | false | 16.666667 | [
"-for i in range(100):",
"+for i in range(2, 100):",
"+C = {q: 0 for q in Q}",
"-C = {p: 0 for p in Q}",
"-for p in Q:",
"- cnt = 0",
"- k = 1",
"- while p**k <= N:",
"- for i in range(2, N + 1):",
"- if i % (p**k) == 0:",
"- cnt += 1",
"- k += ... | false | 0.03781 | 0.03792 | 0.997092 | [
"s519766251",
"s799050937"
] |
u879309973 | p03660 | python | s927267611 | s281657800 | 1,417 | 616 | 43,048 | 42,780 | Accepted | Accepted | 56.53 | EMPTY = 0
BLACK = 1
WHITE = 2
N = eval(input())
G = {i: [] for i in range(1, N+1)}
for i in range(N-1):
a, b = list(map(int, input().split()))
G[a].append(b)
G[b].append(a)
parent = {}
dist = [N] * (N+1)
dist[1] = 0
que = [1]
while len(que) > 0:
s = que.pop(0)
for t in G[s]:
... | from collections import deque
EMPTY = 0
BLACK = 1
WHITE = 2
N = eval(input())
G = {i: [] for i in range(1, N+1)}
for i in range(N-1):
a, b = list(map(int, input().split()))
G[a].append(b)
G[b].append(a)
parent = {}
dist = [N] * (N+1)
dist[1] = 0
que = deque([1])
while len(que) > 0:
s = ... | 58 | 59 | 1,222 | 1,277 | EMPTY = 0
BLACK = 1
WHITE = 2
N = eval(input())
G = {i: [] for i in range(1, N + 1)}
for i in range(N - 1):
a, b = list(map(int, input().split()))
G[a].append(b)
G[b].append(a)
parent = {}
dist = [N] * (N + 1)
dist[1] = 0
que = [1]
while len(que) > 0:
s = que.pop(0)
for t in G[s]:
if dist[t]... | from collections import deque
EMPTY = 0
BLACK = 1
WHITE = 2
N = eval(input())
G = {i: [] for i in range(1, N + 1)}
for i in range(N - 1):
a, b = list(map(int, input().split()))
G[a].append(b)
G[b].append(a)
parent = {}
dist = [N] * (N + 1)
dist[1] = 0
que = deque([1])
while len(que) > 0:
s = que.poplef... | false | 1.694915 | [
"+from collections import deque",
"+",
"-que = [1]",
"+que = deque([1])",
"- s = que.pop(0)",
"+ s = que.popleft()",
"-que_black, que_white = [], []",
"+que_black, que_white = deque(), deque()",
"- s = que.pop(0)",
"+ s = que.popleft()"
] | false | 0.092454 | 0.041211 | 2.243411 | [
"s927267611",
"s281657800"
] |
u952708174 | p03568 | python | s472702833 | s228325184 | 1,024 | 17 | 14,440 | 2,940 | Accepted | Accepted | 98.34 | import numpy
import itertools
N = int(eval(input()))
A = [int(i) for i in input().split()]
per = itertools.product([-1,0,1], repeat=N)
ans = 0
for p in per:
combined = numpy.array([x - y for (x,y) in zip(A,p)])
product = numpy.prod(combined)
if product % 2 == 0:
ans += 1
print(ans) | N = int(eval(input()))
A = [int(i) for i in input().split()]
num_even = 0
for k in A:
if k % 2 == 0:
num_even += 1
print((pow(3, N) - pow(2, num_even))) | 14 | 9 | 301 | 160 | import numpy
import itertools
N = int(eval(input()))
A = [int(i) for i in input().split()]
per = itertools.product([-1, 0, 1], repeat=N)
ans = 0
for p in per:
combined = numpy.array([x - y for (x, y) in zip(A, p)])
product = numpy.prod(combined)
if product % 2 == 0:
ans += 1
print(ans)
| N = int(eval(input()))
A = [int(i) for i in input().split()]
num_even = 0
for k in A:
if k % 2 == 0:
num_even += 1
print((pow(3, N) - pow(2, num_even)))
| false | 35.714286 | [
"-import numpy",
"-import itertools",
"-",
"-per = itertools.product([-1, 0, 1], repeat=N)",
"-ans = 0",
"-for p in per:",
"- combined = numpy.array([x - y for (x, y) in zip(A, p)])",
"- product = numpy.prod(combined)",
"- if product % 2 == 0:",
"- ans += 1",
"-print(ans)",
"+n... | false | 0.761928 | 0.049727 | 15.322323 | [
"s472702833",
"s228325184"
] |
u054556734 | p03253 | python | s102392812 | s445140524 | 1,997 | 968 | 112,732 | 42,780 | Accepted | Accepted | 51.53 | import collections as col
import math as ma
MOD = 10**9 + 7
def inv(a): return pow(a, MOD-2, MOD)
def comb(n,r,MOD):
ans = ma.factorial(n)%MOD * inv(ma.factorial(r)) * inv(ma.factorial(n-r))
return ans%MOD
def prime(n):
ans = []
for i in range(2, int(n**0.5)+1):
while not n%i: n //... | import collections as col
import math as ma
MOD = 10**9 + 7
def inv(a): return pow(a, MOD-2, MOD)
def comb(n,r,MOD):
ans = 1
for i in range(r): # r-i==0でbreak
ans *= n-i
ans *= inv(r-i)
ans %= MOD
return ans
def prime(n):
ans = []
for i in range(2, int(n**0.5... | 25 | 30 | 556 | 624 | import collections as col
import math as ma
MOD = 10**9 + 7
def inv(a):
return pow(a, MOD - 2, MOD)
def comb(n, r, MOD):
ans = ma.factorial(n) % MOD * inv(ma.factorial(r)) * inv(ma.factorial(n - r))
return ans % MOD
def prime(n):
ans = []
for i in range(2, int(n**0.5) + 1):
while not ... | import collections as col
import math as ma
MOD = 10**9 + 7
def inv(a):
return pow(a, MOD - 2, MOD)
def comb(n, r, MOD):
ans = 1
for i in range(r): # r-i==0でbreak
ans *= n - i
ans *= inv(r - i)
ans %= MOD
return ans
def prime(n):
ans = []
for i in range(2, int(n**... | false | 16.666667 | [
"- ans = ma.factorial(n) % MOD * inv(ma.factorial(r)) * inv(ma.factorial(n - r))",
"- return ans % MOD",
"+ ans = 1",
"+ for i in range(r): # r-i==0でbreak",
"+ ans *= n - i",
"+ ans *= inv(r - i)",
"+ ans %= MOD",
"+ return ans",
"+ # ans *= comb(val + n-1, n-... | false | 0.196299 | 0.251987 | 0.779007 | [
"s102392812",
"s445140524"
] |
u143492911 | p04039 | python | s420927411 | s396487433 | 102 | 73 | 2,940 | 2,940 | Accepted | Accepted | 28.43 | n,k=list(map(int,input().split()))
d=set(input().split())
a=[]
for i in range(n,10*n):
if not set(str(i))&set(d):
print(i)
exit() | n,k=list(map(int,input().split()))
d=set(input().split())
for i in range(n,10*n):
if not set(str(i))&d:
print(i)
exit()
| 7 | 6 | 149 | 139 | n, k = list(map(int, input().split()))
d = set(input().split())
a = []
for i in range(n, 10 * n):
if not set(str(i)) & set(d):
print(i)
exit()
| n, k = list(map(int, input().split()))
d = set(input().split())
for i in range(n, 10 * n):
if not set(str(i)) & d:
print(i)
exit()
| false | 14.285714 | [
"-a = []",
"- if not set(str(i)) & set(d):",
"+ if not set(str(i)) & d:"
] | false | 0.036856 | 0.093004 | 0.39628 | [
"s420927411",
"s396487433"
] |
u608088992 | p03945 | python | s776189394 | s271975936 | 40 | 32 | 3,188 | 3,188 | Accepted | Accepted | 20 | S = eval(input())
reverse = 0
current = S[0]
for i in range(1, len(S)):
if S[i] != current:
reverse += 1
current = S[i]
print(reverse) | import sys
def solve():
input = sys.stdin.readline
S = input().strip("\n")
turn = 0
current = S[0]
for i in range(1, len(S)):
if S[i] != current:
turn += 1
current = S[i]
print(turn)
return 0
if __name__ == "__main__":
solve() | 9 | 17 | 157 | 309 | S = eval(input())
reverse = 0
current = S[0]
for i in range(1, len(S)):
if S[i] != current:
reverse += 1
current = S[i]
print(reverse)
| import sys
def solve():
input = sys.stdin.readline
S = input().strip("\n")
turn = 0
current = S[0]
for i in range(1, len(S)):
if S[i] != current:
turn += 1
current = S[i]
print(turn)
return 0
if __name__ == "__main__":
solve()
| false | 47.058824 | [
"-S = eval(input())",
"-reverse = 0",
"-current = S[0]",
"-for i in range(1, len(S)):",
"- if S[i] != current:",
"- reverse += 1",
"- current = S[i]",
"-print(reverse)",
"+import sys",
"+",
"+",
"+def solve():",
"+ input = sys.stdin.readline",
"+ S = input().strip(\"... | false | 0.044433 | 0.094193 | 0.471728 | [
"s776189394",
"s271975936"
] |
u254871849 | p02991 | python | s837452898 | s103894950 | 656 | 459 | 32,280 | 32,472 | Accepted | Accepted | 30.03 | import sys
from heapq import heappush,heappop
inf = float('inf')
n, m = list(map(int, sys.stdin.readline().split()))
g = [[] for _ in range(n+1)]
for _ in range(m):
u, v = list(map(int, sys.stdin.readline().split()))
g[u].append(v)
s, t = list(map(int, sys.stdin.readline().split()))
def main():... | import sys
from collections import deque
inf = float('inf')
n, m = list(map(int, sys.stdin.readline().split()))
g = [[] for _ in range(n+1)]
for _ in range(m):
u, v = list(map(int, sys.stdin.readline().split()))
g[u].append(v)
s, t = list(map(int, sys.stdin.readline().split()))
def main():
... | 33 | 33 | 812 | 824 | import sys
from heapq import heappush, heappop
inf = float("inf")
n, m = list(map(int, sys.stdin.readline().split()))
g = [[] for _ in range(n + 1)]
for _ in range(m):
u, v = list(map(int, sys.stdin.readline().split()))
g[u].append(v)
s, t = list(map(int, sys.stdin.readline().split()))
def main():
dist =... | import sys
from collections import deque
inf = float("inf")
n, m = list(map(int, sys.stdin.readline().split()))
g = [[] for _ in range(n + 1)]
for _ in range(m):
u, v = list(map(int, sys.stdin.readline().split()))
g[u].append(v)
s, t = list(map(int, sys.stdin.readline().split()))
def main():
dist = [inf]... | false | 0 | [
"-from heapq import heappush, heappop",
"+from collections import deque",
"- hq = [(0, s)]",
"+ queue = deque([(0, s)])",
"- while hq:",
"- d, x = heappop(hq)",
"+ while queue:",
"+ d, x = queue.popleft()",
"- heappush(hq, (d, y))",
"+ queue.... | false | 0.046327 | 0.046163 | 1.003553 | [
"s837452898",
"s103894950"
] |
u077291787 | p03309 | python | s845956120 | s821813692 | 212 | 185 | 26,708 | 25,180 | Accepted | Accepted | 12.74 | #!/usr/bin/env python3
n = int(eval(input()))
a = list(map(int, input().split()))
for i in range(n):
a[i] -= i
a.sort()
b = a[n // 2]
answer = 0
for a_i in a:
answer += abs(a_i - b)
print(answer) | # ABC102C - Linear Approximation (ARC100C)
def main():
N, *A = list(map(int, open(0).read().split()))
B = [j - i for i, j in enumerate(A, 1)]
B.sort()
b = B[N // 2]
ans = sum(abs(i - b) for i in B)
print(ans)
if __name__ == "__main__":
main() | 11 | 12 | 207 | 277 | #!/usr/bin/env python3
n = int(eval(input()))
a = list(map(int, input().split()))
for i in range(n):
a[i] -= i
a.sort()
b = a[n // 2]
answer = 0
for a_i in a:
answer += abs(a_i - b)
print(answer)
| # ABC102C - Linear Approximation (ARC100C)
def main():
N, *A = list(map(int, open(0).read().split()))
B = [j - i for i, j in enumerate(A, 1)]
B.sort()
b = B[N // 2]
ans = sum(abs(i - b) for i in B)
print(ans)
if __name__ == "__main__":
main()
| false | 8.333333 | [
"-#!/usr/bin/env python3",
"-n = int(eval(input()))",
"-a = list(map(int, input().split()))",
"-for i in range(n):",
"- a[i] -= i",
"-a.sort()",
"-b = a[n // 2]",
"-answer = 0",
"-for a_i in a:",
"- answer += abs(a_i - b)",
"-print(answer)",
"+# ABC102C - Linear Approximation (ARC100C)",... | false | 0.038323 | 0.039488 | 0.970515 | [
"s845956120",
"s821813692"
] |
u367130284 | p03156 | python | s214912929 | s284530356 | 168 | 149 | 13,108 | 12,500 | Accepted | Accepted | 11.31 | from numpy import*;n,a,b,*p=list(map(int,open(0).read().split()));c=array(p);print((min(len(c[c<=a]),len(c[(a<c)&(c<=b)]),len(c[b<c])))) | from numpy import*;n,a,b,*p=list(map(int,open(0).read().split()));c=array(p);print((min(sum(c<=a),sum((a<c)&(c<=b)),sum(b<c)))) | 1 | 1 | 128 | 119 | from numpy import *
n, a, b, *p = list(map(int, open(0).read().split()))
c = array(p)
print((min(len(c[c <= a]), len(c[(a < c) & (c <= b)]), len(c[b < c]))))
| from numpy import *
n, a, b, *p = list(map(int, open(0).read().split()))
c = array(p)
print((min(sum(c <= a), sum((a < c) & (c <= b)), sum(b < c))))
| false | 0 | [
"-print((min(len(c[c <= a]), len(c[(a < c) & (c <= b)]), len(c[b < c]))))",
"+print((min(sum(c <= a), sum((a < c) & (c <= b)), sum(b < c))))"
] | false | 0.252725 | 0.206429 | 1.22427 | [
"s214912929",
"s284530356"
] |
u842964692 | p02911 | python | s777105493 | s498341743 | 1,228 | 270 | 16,832 | 6,596 | Accepted | Accepted | 78.01 | #ABC141_C
import numpy as np
N,K,Q=list(map(int,input().split()))
ans=(K-Q)*np.ones((1,N),dtype='int32')
for _ in range(Q):
idx=int(eval(input()))
ans[0,idx-1]+=1
ans=ans.tolist()[0]
for i in range(len(ans)):
if ans[i]>0:
print('Yes')
else:
print('No') | #ABC141_C
N,K,Q=list(map(int,input().split()))
ans=[K-Q]*N
for _ in range(Q):
idx=int(eval(input()))
ans[idx-1]+=1
for i in range(len(ans)):
if ans[i]>0:
print('Yes')
else:
print('No') | 14 | 11 | 289 | 216 | # ABC141_C
import numpy as np
N, K, Q = list(map(int, input().split()))
ans = (K - Q) * np.ones((1, N), dtype="int32")
for _ in range(Q):
idx = int(eval(input()))
ans[0, idx - 1] += 1
ans = ans.tolist()[0]
for i in range(len(ans)):
if ans[i] > 0:
print("Yes")
else:
print("No")
| # ABC141_C
N, K, Q = list(map(int, input().split()))
ans = [K - Q] * N
for _ in range(Q):
idx = int(eval(input()))
ans[idx - 1] += 1
for i in range(len(ans)):
if ans[i] > 0:
print("Yes")
else:
print("No")
| false | 21.428571 | [
"-import numpy as np",
"-",
"-ans = (K - Q) * np.ones((1, N), dtype=\"int32\")",
"+ans = [K - Q] * N",
"- ans[0, idx - 1] += 1",
"-ans = ans.tolist()[0]",
"+ ans[idx - 1] += 1"
] | false | 0.180467 | 0.036386 | 4.959811 | [
"s777105493",
"s498341743"
] |
u562935282 | p03032 | python | s113426203 | s700065813 | 29 | 25 | 3,060 | 3,064 | Accepted | Accepted | 13.79 | n, k = list(map(int, input().split()))
v = list(map(int, input().split()))
ans = 0
m = min(n, k)
for i in range(m + 1):
for j in range(m - i + 1):
t = v[:i] + v[n - j:]
t.sort()
d = tuple([x for x in t if x < 0])[:k - i - j]
ans = max(ans, sum(t) - sum(d))
print(ans)
| def main():
N, K = list(map(int, input().split()))
*V, = list(map(int, input().split()))
m = min(N, K)
ans = 0
for left in range(m + 1):
_r = m - left
for right in range(_r + 1):
rest = K - left - right
take = V[:left] + V[N - right:]
... | 12 | 29 | 313 | 625 | n, k = list(map(int, input().split()))
v = list(map(int, input().split()))
ans = 0
m = min(n, k)
for i in range(m + 1):
for j in range(m - i + 1):
t = v[:i] + v[n - j :]
t.sort()
d = tuple([x for x in t if x < 0])[: k - i - j]
ans = max(ans, sum(t) - sum(d))
print(ans)
| def main():
N, K = list(map(int, input().split()))
(*V,) = list(map(int, input().split()))
m = min(N, K)
ans = 0
for left in range(m + 1):
_r = m - left
for right in range(_r + 1):
rest = K - left - right
take = V[:left] + V[N - right :]
take.sort(... | false | 58.62069 | [
"-n, k = list(map(int, input().split()))",
"-v = list(map(int, input().split()))",
"-ans = 0",
"-m = min(n, k)",
"-for i in range(m + 1):",
"- for j in range(m - i + 1):",
"- t = v[:i] + v[n - j :]",
"- t.sort()",
"- d = tuple([x for x in t if x < 0])[: k - i - j]",
"- ... | false | 0.073447 | 0.060251 | 1.21903 | [
"s113426203",
"s700065813"
] |
u463655976 | p03061 | python | s492752217 | s957384822 | 298 | 189 | 14,052 | 16,148 | Accepted | Accepted | 36.58 | N = int(eval(input()))
A = list(map(int, input().split()))
def gcd(x, y):
if x == 0 or y == 0:
return max(x, y)
return gcd(y, x % y) if y!=0 else x
w = 0
B = [w]
for x in range(N-1, 0, -1):
B += [gcd(B[-1], A[x])]
w = 0
M = 0
for x in range(N):
M = max(M, gcd(w, B.pop()))
... | from fractions import*
N,*A=list(map(int,open(0).read().split()))
w,B=0,[0]
a=list(range(N))
for x in a[:]:B+=[gcd(B[-1],A[x])]
w=M=0
for x in a[::-1]:M,w=max(M,gcd(w,B[x])),gcd(w,A[x])
print(M) | 20 | 8 | 344 | 189 | N = int(eval(input()))
A = list(map(int, input().split()))
def gcd(x, y):
if x == 0 or y == 0:
return max(x, y)
return gcd(y, x % y) if y != 0 else x
w = 0
B = [w]
for x in range(N - 1, 0, -1):
B += [gcd(B[-1], A[x])]
w = 0
M = 0
for x in range(N):
M = max(M, gcd(w, B.pop()))
w = gcd(w, ... | from fractions import *
N, *A = list(map(int, open(0).read().split()))
w, B = 0, [0]
a = list(range(N))
for x in a[:]:
B += [gcd(B[-1], A[x])]
w = M = 0
for x in a[::-1]:
M, w = max(M, gcd(w, B[x])), gcd(w, A[x])
print(M)
| false | 60 | [
"-N = int(eval(input()))",
"-A = list(map(int, input().split()))",
"+from fractions import *",
"-",
"-def gcd(x, y):",
"- if x == 0 or y == 0:",
"- return max(x, y)",
"- return gcd(y, x % y) if y != 0 else x",
"-",
"-",
"-w = 0",
"-B = [w]",
"-for x in range(N - 1, 0, -1):",
"... | false | 0.044535 | 0.088293 | 0.504404 | [
"s492752217",
"s957384822"
] |
u588341295 | p02991 | python | s056663418 | s340134503 | 973 | 786 | 84,460 | 84,696 | Accepted | Accepted | 19.22 | # -*- coding: utf-8 -*-
import sys
from heapq import heappop, heappush
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def ceil(x, y=1): return int(-(-x // y))
def INT(): re... | # -*- coding: utf-8 -*-
import sys
from collections import deque
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def ceil(x, y=1): return int(-(-x // y))
def INT(): return i... | 64 | 64 | 1,755 | 1,743 | # -*- coding: utf-8 -*-
import sys
from heapq import heappop, heappush
def input():
return sys.stdin.readline().strip()
def list2d(a, b, c):
return [[c] * b for i in range(a)]
def list3d(a, b, c, d):
return [[[d] * c for j in range(b)] for i in range(a)]
def ceil(x, y=1):
return int(-(-x // y))
... | # -*- coding: utf-8 -*-
import sys
from collections import deque
def input():
return sys.stdin.readline().strip()
def list2d(a, b, c):
return [[c] * b for i in range(a)]
def list3d(a, b, c, d):
return [[[d] * c for j in range(b)] for i in range(a)]
def ceil(x, y=1):
return int(-(-x // y))
def ... | false | 0 | [
"-from heapq import heappop, heappush",
"+from collections import deque",
"-def dijkstra(N: int, nodes: list, src: int) -> list:",
"- \"\"\"ダイクストラ(頂点数, 隣接リスト(0-indexed), 始点)\"\"\"",
"+def bfs(N: int, nodes: list, src: int) -> list:",
"+ \"\"\"幅優先探索(頂点数, 隣接リスト(0-indexed), 始点)\"\"\"",
"- que = [(... | false | 0.03755 | 0.037803 | 0.993324 | [
"s056663418",
"s340134503"
] |
u510630535 | p02695 | python | s028233294 | s516648304 | 1,179 | 630 | 9,080 | 12,548 | Accepted | Accepted | 46.56 | from itertools import combinations_with_replacement
N, M, Q = list(map(int, input().split()))
abcdn = [tuple(map(int, input().split())) for _ in range(Q)]
mx = 0
for AN in combinations_with_replacement(list(range(1, M+1)), N):
score = 0
for a, b, c, d in abcdn:
score += d if AN[b-1] - AN[a-1] == c else 0... | from itertools import combinations_with_replacement
N, M, Q = list(map(int, input().split()))
abcdn = [tuple(map(int, input().split())) for _ in range(Q)]
print((max([sum(d if AN[b-1] - AN[a-1] == c else 0 for a, b, c, d in abcdn) for AN in combinations_with_replacement(list(range(1, M+1)), N)]))) | 12 | 6 | 341 | 291 | from itertools import combinations_with_replacement
N, M, Q = list(map(int, input().split()))
abcdn = [tuple(map(int, input().split())) for _ in range(Q)]
mx = 0
for AN in combinations_with_replacement(list(range(1, M + 1)), N):
score = 0
for a, b, c, d in abcdn:
score += d if AN[b - 1] - AN[a - 1] == ... | from itertools import combinations_with_replacement
N, M, Q = list(map(int, input().split()))
abcdn = [tuple(map(int, input().split())) for _ in range(Q)]
print(
(
max(
[
sum(d if AN[b - 1] - AN[a - 1] == c else 0 for a, b, c, d in abcdn)
for AN in combinations_w... | false | 50 | [
"-mx = 0",
"-for AN in combinations_with_replacement(list(range(1, M + 1)), N):",
"- score = 0",
"- for a, b, c, d in abcdn:",
"- score += d if AN[b - 1] - AN[a - 1] == c else 0",
"- mx = max(score, mx)",
"-print(mx)",
"+print(",
"+ (",
"+ max(",
"+ [",
"+ ... | false | 0.044696 | 0.044499 | 1.004444 | [
"s028233294",
"s516648304"
] |
u934442292 | p02715 | python | s597320727 | s115283606 | 444 | 317 | 19,412 | 11,224 | Accepted | Accepted | 28.6 | import sys
input = sys.stdin.readline
P = 10 ** 9 + 7
def main():
N, K = list(map(int, input().split()))
ans = 0
n_gcd = dict.fromkeys(list(range(K + 1)), 0)
for k in reversed(list(range(1, K + 1))):
n_gcd[k] = pow(K // k, N, mod=P)
for m in range(2, K // k + 1):
... | import sys
input = sys.stdin.readline
P = 10 ** 9 + 7
def main():
N, K = list(map(int, input().split()))
ans = 0
n_gcd = [0] * (K + 1)
for k in reversed(list(range(1, K + 1))):
n_gcd[k] = pow(K // k, N, mod=P)
for m in range(2, K // k + 1):
n_gcd[k] -= n_gcd... | 22 | 23 | 451 | 441 | import sys
input = sys.stdin.readline
P = 10**9 + 7
def main():
N, K = list(map(int, input().split()))
ans = 0
n_gcd = dict.fromkeys(list(range(K + 1)), 0)
for k in reversed(list(range(1, K + 1))):
n_gcd[k] = pow(K // k, N, mod=P)
for m in range(2, K // k + 1):
n_gcd[k] = ... | import sys
input = sys.stdin.readline
P = 10**9 + 7
def main():
N, K = list(map(int, input().split()))
ans = 0
n_gcd = [0] * (K + 1)
for k in reversed(list(range(1, K + 1))):
n_gcd[k] = pow(K // k, N, mod=P)
for m in range(2, K // k + 1):
n_gcd[k] -= n_gcd[k * m]
n... | false | 4.347826 | [
"- n_gcd = dict.fromkeys(list(range(K + 1)), 0)",
"+ n_gcd = [0] * (K + 1)",
"- n_gcd[k] = (n_gcd[k] - n_gcd[k * m]) % P",
"+ n_gcd[k] -= n_gcd[k * m]",
"+ n_gcd[k] %= P"
] | false | 0.241403 | 0.147148 | 1.640548 | [
"s597320727",
"s115283606"
] |
u936985471 | p02838 | python | s836924280 | s056527807 | 664 | 336 | 125,624 | 62,756 | Accepted | Accepted | 49.4 | n=int(eval(input()))
A=list(map(int,input().split()))
keta=[0]*60
for i in range(n):
tar=A[i]
ind=0
while tar>0:
if tar&1==1:
keta[ind]+=1
tar>>=1
ind+=1
pair=[0]*60
for i in range(len(keta)):
pair[i]=keta[i]*(len(A)-keta[i])
ans=0
mul=1
DIV=10**9+7
for i in range(le... | import numpy as np
N=int(eval(input()))
A=np.array(input().split(),dtype=int)
DIV=10**9+7
ans=0
for i in range(60):
bits=(A>>i)&1
nonzero=np.count_nonzero(bits)
zeros=N-nonzero
pat=nonzero*zeros
for p in range(i):
pat*=2
ans+=pat
ans%=DIV
print(ans)
| 25 | 19 | 378 | 286 | n = int(eval(input()))
A = list(map(int, input().split()))
keta = [0] * 60
for i in range(n):
tar = A[i]
ind = 0
while tar > 0:
if tar & 1 == 1:
keta[ind] += 1
tar >>= 1
ind += 1
pair = [0] * 60
for i in range(len(keta)):
pair[i] = keta[i] * (len(A) - keta[i])
ans = 0... | import numpy as np
N = int(eval(input()))
A = np.array(input().split(), dtype=int)
DIV = 10**9 + 7
ans = 0
for i in range(60):
bits = (A >> i) & 1
nonzero = np.count_nonzero(bits)
zeros = N - nonzero
pat = nonzero * zeros
for p in range(i):
pat *= 2
ans += pat
ans %= DIV
print(ans)
| false | 24 | [
"-n = int(eval(input()))",
"-A = list(map(int, input().split()))",
"-keta = [0] * 60",
"-for i in range(n):",
"- tar = A[i]",
"- ind = 0",
"- while tar > 0:",
"- if tar & 1 == 1:",
"- keta[ind] += 1",
"- tar >>= 1",
"- ind += 1",
"-pair = [0] * 60",
"... | false | 0.063129 | 0.273073 | 0.231179 | [
"s836924280",
"s056527807"
] |
u562016607 | p03495 | python | s088898267 | s570034961 | 1,566 | 143 | 46,256 | 35,616 | Accepted | Accepted | 90.87 | import numpy as np
st=input().split()
N=int(st[0]);K=int(st[1])
S=set([])
st=input().split()
P=[0]*(N+1)
Q=[0]*(N+1)
for i in range(N):
k=int(st[i])
S.add(k)
P[k-1]+=1
Q[P[k-1]-1]-=1
Q[P[k-1]]+=1
out=0
change=0
count=0
if len(S)<=K:
print((0))
else:
for i in range(1,N+1):
... | N,K=list(map(int,input().split()))
D=dict()
for i in input().split():
if i in D:
D[i]+=1
else:
D[i]=1
L=[]
for i in D:
L.append(D[i])
L.sort()
print((sum(L[:-K]))) | 30 | 12 | 558 | 194 | import numpy as np
st = input().split()
N = int(st[0])
K = int(st[1])
S = set([])
st = input().split()
P = [0] * (N + 1)
Q = [0] * (N + 1)
for i in range(N):
k = int(st[i])
S.add(k)
P[k - 1] += 1
Q[P[k - 1] - 1] -= 1
Q[P[k - 1]] += 1
out = 0
change = 0
count = 0
if len(S) <= K:
print((0))
else:... | N, K = list(map(int, input().split()))
D = dict()
for i in input().split():
if i in D:
D[i] += 1
else:
D[i] = 1
L = []
for i in D:
L.append(D[i])
L.sort()
print((sum(L[:-K])))
| false | 60 | [
"-import numpy as np",
"-",
"-st = input().split()",
"-N = int(st[0])",
"-K = int(st[1])",
"-S = set([])",
"-st = input().split()",
"-P = [0] * (N + 1)",
"-Q = [0] * (N + 1)",
"-for i in range(N):",
"- k = int(st[i])",
"- S.add(k)",
"- P[k - 1] += 1",
"- Q[P[k - 1] - 1] -= 1",
... | false | 0.037808 | 0.040584 | 0.931598 | [
"s088898267",
"s570034961"
] |
u832039789 | p03361 | python | s787826630 | s406070834 | 22 | 18 | 3,064 | 3,064 | Accepted | Accepted | 18.18 | h,w = list(map(int,input().split()))
s = [eval(input()) for _ in range(h)]
def countSharp(x,y):
res = 0
if x!=0:
res += s[x-1][y]=='#'
if y!=0:
res += s[x][y-1]=='#'
if x!=h-1:
res += s[x+1][y]=='#'
if y!=w-1:
res += s[x][y+1]=='#'
return res
flag... | H,W=list(map(int,input().split()))
A=[]
for i in range(H):
S='.'+eval(input())+'.'
A.append(S)
K='.'
A.insert(0,K*(W+2))
A.append(K*(W+2))
for i in range(1,H):
for j in range(1,W):
if A[i][j]=='#':
if A[i+1][j]=='.' and A[i-1][j]=='.' and A[i][j+1]=='.' and A[i][j-1]=='.':
... | 41 | 17 | 952 | 377 | h, w = list(map(int, input().split()))
s = [eval(input()) for _ in range(h)]
def countSharp(x, y):
res = 0
if x != 0:
res += s[x - 1][y] == "#"
if y != 0:
res += s[x][y - 1] == "#"
if x != h - 1:
res += s[x + 1][y] == "#"
if y != w - 1:
res += s[x][y + 1] == "#"
... | H, W = list(map(int, input().split()))
A = []
for i in range(H):
S = "." + eval(input()) + "."
A.append(S)
K = "."
A.insert(0, K * (W + 2))
A.append(K * (W + 2))
for i in range(1, H):
for j in range(1, W):
if A[i][j] == "#":
if (
A[i + 1][j] == "."
and A[i... | false | 58.536585 | [
"-h, w = list(map(int, input().split()))",
"-s = [eval(input()) for _ in range(h)]",
"-",
"-",
"-def countSharp(x, y):",
"- res = 0",
"- if x != 0:",
"- res += s[x - 1][y] == \"#\"",
"- if y != 0:",
"- res += s[x][y - 1] == \"#\"",
"- if x != h - 1:",
"- res +=... | false | 0.034457 | 0.03587 | 0.960616 | [
"s787826630",
"s406070834"
] |
u332906195 | p02726 | python | s842653007 | s905815394 | 1,989 | 323 | 3,572 | 48,604 | Accepted | Accepted | 83.76 | N, X, Y = list(map(int, input().split()))
d = {k: 0 for k in range(1, N)}
for i in range(1, N + 1):
for j in range(i + 1, N + 1):
m = min(abs(j - i),
abs(X - i) + 1 + abs(j - Y),
abs(Y - i) + 1 + abs(j - X),)
d[m] += 1
for k in range(1, N):
print((d[k]))
| N, X, Y = list(map(int, input().split()))
d = {k: 0 for k in range(1, N)}
for i in range(1, N + 1):
for j in range(i + 1, N + 1):
m = min(abs(j - i),
abs(X - i) + 1 + abs(j - Y),
abs(Y - i) + 1 + abs(j - X))
d[m] += 1
for k in range(1, N):
print((d[k]))
| 10 | 10 | 312 | 311 | N, X, Y = list(map(int, input().split()))
d = {k: 0 for k in range(1, N)}
for i in range(1, N + 1):
for j in range(i + 1, N + 1):
m = min(
abs(j - i),
abs(X - i) + 1 + abs(j - Y),
abs(Y - i) + 1 + abs(j - X),
)
d[m] += 1
for k in range(1, N):
print((d[... | N, X, Y = list(map(int, input().split()))
d = {k: 0 for k in range(1, N)}
for i in range(1, N + 1):
for j in range(i + 1, N + 1):
m = min(abs(j - i), abs(X - i) + 1 + abs(j - Y), abs(Y - i) + 1 + abs(j - X))
d[m] += 1
for k in range(1, N):
print((d[k]))
| false | 0 | [
"- m = min(",
"- abs(j - i),",
"- abs(X - i) + 1 + abs(j - Y),",
"- abs(Y - i) + 1 + abs(j - X),",
"- )",
"+ m = min(abs(j - i), abs(X - i) + 1 + abs(j - Y), abs(Y - i) + 1 + abs(j - X))"
] | false | 0.037436 | 0.248917 | 0.150395 | [
"s842653007",
"s905815394"
] |
u057109575 | p02962 | python | s207127644 | s339106213 | 486 | 408 | 171,972 | 151,400 | Accepted | Accepted | 16.05 | s = eval(input())
t = eval(input())
def z_algorithm(s):
n = len(s)
res = [0] * n
i = 1
j = 0
while i < n:
# i番目以降の一致文字数
while i + j < n and s[j] == s[i + j]:
j += 1
res[i] = j
# 一文字も一致しない場合，次の文字へ
if j == 0:
i += 1
... | s = eval(input())
t = eval(input())
def z_algorithm(s):
n = len(s)
res = [0] * n
i = 1
j = 0
while i < n:
# i番目以降の一致文字数
while i + j < n and s[j] == s[i + j]:
j += 1
res[i] = j
# 一文字も一致しない場合，次の文字へ
if j == 0:
i += 1
... | 54 | 54 | 937 | 937 | s = eval(input())
t = eval(input())
def z_algorithm(s):
n = len(s)
res = [0] * n
i = 1
j = 0
while i < n:
# i番目以降の一致文字数
while i + j < n and s[j] == s[i + j]:
j += 1
res[i] = j
# 一文字も一致しない場合，次の文字へ
if j == 0:
i += 1
continue... | s = eval(input())
t = eval(input())
def z_algorithm(s):
n = len(s)
res = [0] * n
i = 1
j = 0
while i < n:
# i番目以降の一致文字数
while i + j < n and s[j] == s[i + j]:
j += 1
res[i] = j
# 一文字も一致しない場合，次の文字へ
if j == 0:
i += 1
continue... | false | 0 | [
"- ss = s * (n // len(s) + 2)",
"+ ss = s * (n // len(s) + 1)"
] | false | 0.035048 | 0.036607 | 0.957409 | [
"s207127644",
"s339106213"
] |
u078042885 | p00252 | python | s041014169 | s260946808 | 40 | 30 | 7,672 | 7,652 | Accepted | Accepted | 25 | a,b,c=list(map(int,input().split()))
print((['Close','Open'][(a&b)^c])) | a,b,c=list(map(int,input().split()))
print((['Close','Open'][a&b^c])) | 2 | 2 | 64 | 62 | a, b, c = list(map(int, input().split()))
print((["Close", "Open"][(a & b) ^ c]))
| a, b, c = list(map(int, input().split()))
print((["Close", "Open"][a & b ^ c]))
| false | 0 | [
"-print(([\"Close\", \"Open\"][(a & b) ^ c]))",
"+print(([\"Close\", \"Open\"][a & b ^ c]))"
] | false | 0.081707 | 0.111235 | 0.734546 | [
"s041014169",
"s260946808"
] |
u250583425 | p02720 | python | s088414564 | s974985950 | 68 | 57 | 10,816 | 6,084 | Accepted | Accepted | 16.18 | import sys
import heapq
def input(): return sys.stdin.readline().rstrip()
def main():
K = int(eval(input()))
q = [1, 2, 3, 4, 5, 6, 7, 8, 9]
heapq.heapify(q)
while len(q) < K:
K -= len(q)
new_q = []
for i in q:
d1 = i % 10
if d1 > 0:
... | import sys
from collections import deque
def input(): return sys.stdin.readline().rstrip()
def main():
K = int(eval(input()))
q = deque()
for i in range(1, 10):
if K == 1:
print(i)
exit()
K -= 1
q.append(i)
while q:
v = q.popleft()
... | 24 | 26 | 569 | 607 | import sys
import heapq
def input():
return sys.stdin.readline().rstrip()
def main():
K = int(eval(input()))
q = [1, 2, 3, 4, 5, 6, 7, 8, 9]
heapq.heapify(q)
while len(q) < K:
K -= len(q)
new_q = []
for i in q:
d1 = i % 10
if d1 > 0:
... | import sys
from collections import deque
def input():
return sys.stdin.readline().rstrip()
def main():
K = int(eval(input()))
q = deque()
for i in range(1, 10):
if K == 1:
print(i)
exit()
K -= 1
q.append(i)
while q:
v = q.popleft()
... | false | 7.692308 | [
"-import heapq",
"+from collections import deque",
"- q = [1, 2, 3, 4, 5, 6, 7, 8, 9]",
"- heapq.heapify(q)",
"- while len(q) < K:",
"- K -= len(q)",
"- new_q = []",
"- for i in q:",
"- d1 = i % 10",
"- if d1 > 0:",
"- new_q.appe... | false | 0.078341 | 0.079096 | 0.990458 | [
"s088414564",
"s974985950"
] |
u268470352 | p02923 | python | s741771679 | s845654095 | 83 | 60 | 14,252 | 14,224 | Accepted | Accepted | 27.71 | N = int(eval(input()))
numbers = [int(n) for n in input().split(' ')]
distances = []
counter = 0
for i in range(0, len(numbers)):
if i == len(numbers) - 1:
distances.append(counter)
break
if numbers[i] >= numbers[i + 1]:
counter += 1
else:
distances.append(counter)... | N = int(eval(input()))
numbers = [int(n) for n in input().split(' ')]
counter = -1
last_h = float('inf')
_max = 0
for h in numbers:
if h <= last_h:
counter += 1
else:
if _max < counter:
_max = counter
counter = 0
last_h = h
if _max < counter:
_max = co... | 14 | 17 | 358 | 333 | N = int(eval(input()))
numbers = [int(n) for n in input().split(" ")]
distances = []
counter = 0
for i in range(0, len(numbers)):
if i == len(numbers) - 1:
distances.append(counter)
break
if numbers[i] >= numbers[i + 1]:
counter += 1
else:
distances.append(counter)
co... | N = int(eval(input()))
numbers = [int(n) for n in input().split(" ")]
counter = -1
last_h = float("inf")
_max = 0
for h in numbers:
if h <= last_h:
counter += 1
else:
if _max < counter:
_max = counter
counter = 0
last_h = h
if _max < counter:
_max = counter
print(_max... | false | 17.647059 | [
"-distances = []",
"-counter = 0",
"-for i in range(0, len(numbers)):",
"- if i == len(numbers) - 1:",
"- distances.append(counter)",
"- break",
"- if numbers[i] >= numbers[i + 1]:",
"+counter = -1",
"+last_h = float(\"inf\")",
"+_max = 0",
"+for h in numbers:",
"+ if h ... | false | 0.040894 | 0.100138 | 0.408373 | [
"s741771679",
"s845654095"
] |
u682467216 | p02891 | python | s779919732 | s421854963 | 31 | 28 | 9,116 | 9,192 | Accepted | Accepted | 9.68 |
def main():
s = list(eval(input()))
k = int(eval(input()))
lst = []
cnt = 1
flg = 0
ans = 0
prev = s[0]
for i in range(1, len(s)):
if prev == s[i]:
cnt += 1
else:
lst.append(cnt)
cnt = 1
prev = s[i]
... |
def main():
s = list(eval(input()))
k = int(eval(input()))
lst = []
cnt = 1
flg = 0
ans = 0
prev = s[0]
for i in range(1, len(s)):
if prev == s[i]:
cnt += 1
else:
lst.append(cnt)
cnt = 1
prev = s[i]
... | 35 | 34 | 811 | 803 | def main():
s = list(eval(input()))
k = int(eval(input()))
lst = []
cnt = 1
flg = 0
ans = 0
prev = s[0]
for i in range(1, len(s)):
if prev == s[i]:
cnt += 1
else:
lst.append(cnt)
cnt = 1
prev = s[i]
flg = 1
l... | def main():
s = list(eval(input()))
k = int(eval(input()))
lst = []
cnt = 1
flg = 0
ans = 0
prev = s[0]
for i in range(1, len(s)):
if prev == s[i]:
cnt += 1
else:
lst.append(cnt)
cnt = 1
prev = s[i]
flg = 1
l... | false | 2.857143 | [
"- ans += sum(list([x // 2 for x in lst[1 : len(lst) - 1]])) * k",
"+ ans += sum([x // 2 for x in lst[1 : len(lst) - 1]]) * k"
] | false | 0.084709 | 0.042086 | 2.012762 | [
"s779919732",
"s421854963"
] |
u319589470 | p03053 | python | s643792428 | s441902387 | 721 | 381 | 222,240 | 214,504 | Accepted | Accepted | 47.16 | #!/usr/bin/env python3
import sys
sys.setrecursionlimit(10**7)
import bisect
import heapq
import itertools
import math
from collections import Counter, defaultdict, deque
from copy import deepcopy
from decimal import Decimal
from math import gcd
from operator import add, itemgetter, mul, xor
def cmb(n,r,mod... | #!/usr/bin/env python3
import sys
sys.setrecursionlimit(10**7)
import bisect
import heapq
import itertools
import math
from collections import Counter, defaultdict, deque
from copy import deepcopy
from decimal import Decimal
from math import gcd
from operator import add, itemgetter, mul, xor
def cmb(n,r,mod... | 54 | 53 | 1,381 | 1,349 | #!/usr/bin/env python3
import sys
sys.setrecursionlimit(10**7)
import bisect
import heapq
import itertools
import math
from collections import Counter, defaultdict, deque
from copy import deepcopy
from decimal import Decimal
from math import gcd
from operator import add, itemgetter, mul, xor
def cmb(n, r, mod):
... | #!/usr/bin/env python3
import sys
sys.setrecursionlimit(10**7)
import bisect
import heapq
import itertools
import math
from collections import Counter, defaultdict, deque
from copy import deepcopy
from decimal import Decimal
from math import gcd
from operator import add, itemgetter, mul, xor
def cmb(n, r, mod):
... | false | 1.851852 | [
"+ans = 0",
"+ ans = max(ans, dist[nx][ny])",
"-ans = 0",
"-for i in range(h):",
"- for j in range(w):",
"- ans = max(ans, dist[i][j])"
] | false | 0.039857 | 0.036892 | 1.080371 | [
"s643792428",
"s441902387"
] |
u077291787 | p03294 | python | s885654268 | s838982624 | 171 | 18 | 5,344 | 3,316 | Accepted | Accepted | 89.47 | # ABC103C - Modulo Summation
from fractions import gcd
def lcm(a, b):
return (a * b) // gcd(a, b)
n = int(eval(input()))
lst = list(map(int, input().rstrip().split()))
ans = 0
f = lcm(lst[0], lst[1])
for i in range(n):
f = lcm(f, lst[i])
f -= 1
for i in lst:
ans += f % i
print(ans) | n = int(eval(input()))
lst = list(map(int, input().rstrip().split()))
ans = 0
for i in lst:
ans += i - 1
print(ans) | 18 | 6 | 309 | 118 | # ABC103C - Modulo Summation
from fractions import gcd
def lcm(a, b):
return (a * b) // gcd(a, b)
n = int(eval(input()))
lst = list(map(int, input().rstrip().split()))
ans = 0
f = lcm(lst[0], lst[1])
for i in range(n):
f = lcm(f, lst[i])
f -= 1
for i in lst:
ans += f % i
print(ans)
| n = int(eval(input()))
lst = list(map(int, input().rstrip().split()))
ans = 0
for i in lst:
ans += i - 1
print(ans)
| false | 66.666667 | [
"-# ABC103C - Modulo Summation",
"-from fractions import gcd",
"-",
"-",
"-def lcm(a, b):",
"- return (a * b) // gcd(a, b)",
"-",
"-",
"-f = lcm(lst[0], lst[1])",
"-for i in range(n):",
"- f = lcm(f, lst[i])",
"-f -= 1",
"- ans += f % i",
"+ ans += i - 1"
] | false | 0.051293 | 0.039014 | 1.314734 | [
"s885654268",
"s838982624"
] |
u815659544 | p03111 | python | s355026909 | s935661663 | 211 | 73 | 3,064 | 3,064 | Accepted | Accepted | 65.4 | #%%
import itertools
#%%
N, A, B, C = list(map(int, input().split()))
materials = [int(eval(input())) for _ in range(N)]
iterobj = itertools.product(list(range(4)),repeat=N)
ans = 10**8
for use in iterobj:
if 1 in use and 2 in use and 3 in use:
synth = [0,0,0,0]
for m, ... | #%%
import sys
INPUT = sys.stdin.readline
def SINGLE_INT(): return int(INPUT())
def MULTIPLE_INT_LIST(): return list(map(int, INPUT().split()))
def MULTIPLE_INT_MAP(): return list(map(int, INPUT().split()))
def SINGLE_STRING(): return INPUT()
def MULTIPLE_STRING(): return INPUT().split()
#%%
N, A, B, C =... | 30 | 36 | 539 | 1,183 | #%%
import itertools
#%%
N, A, B, C = list(map(int, input().split()))
materials = [int(eval(input())) for _ in range(N)]
iterobj = itertools.product(list(range(4)), repeat=N)
ans = 10**8
for use in iterobj:
if 1 in use and 2 in use and 3 in use:
synth = [0, 0, 0, 0]
for m, u in zip(materials, use):... | #%%
import sys
INPUT = sys.stdin.readline
def SINGLE_INT():
return int(INPUT())
def MULTIPLE_INT_LIST():
return list(map(int, INPUT().split()))
def MULTIPLE_INT_MAP():
return list(map(int, INPUT().split()))
def SINGLE_STRING():
return INPUT()
def MULTIPLE_STRING():
return INPUT().split()
... | false | 16.666667 | [
"-import itertools",
"+import sys",
"+",
"+INPUT = sys.stdin.readline",
"+",
"+",
"+def SINGLE_INT():",
"+ return int(INPUT())",
"+",
"+",
"+def MULTIPLE_INT_LIST():",
"+ return list(map(int, INPUT().split()))",
"+",
"+",
"+def MULTIPLE_INT_MAP():",
"+ return list(map(int, INP... | false | 0.198469 | 0.077831 | 2.549999 | [
"s355026909",
"s935661663"
] |
u852690916 | p02787 | python | s895688190 | s371168889 | 542 | 185 | 42,988 | 73,904 | Accepted | Accepted | 65.87 | H,N=list(map(int, input().split()))
AB=[list(map(int, input().split())) for _ in range(N)]
INF=10**9
dp=[INF for _ in range(H+1)]
dp[H]=0
for h in range(H,0,-1):
for n in range(N):
A,B=AB[n]
newH=max(0,h-A)
dp[newH]=min(dp[newH], dp[h]+B)
print((dp[0])) | # でつoO(YOU PLAY WITH THE CARDS YOU'RE DEALT..)
import sys
def main(H, N, AB):
INF = 10**9
dp = [INF] * (H + 1)
dp[H] = 0
for h in reversed(list(range(H + 1))):
for i, (a, b) in enumerate(AB):
nh = max(0, h - a)
dp[nh] = min(dp[nh], dp[h] + b)
print((dp[0]))
... | 14 | 17 | 289 | 495 | H, N = list(map(int, input().split()))
AB = [list(map(int, input().split())) for _ in range(N)]
INF = 10**9
dp = [INF for _ in range(H + 1)]
dp[H] = 0
for h in range(H, 0, -1):
for n in range(N):
A, B = AB[n]
newH = max(0, h - A)
dp[newH] = min(dp[newH], dp[h] + B)
print((dp[0]))
| # でつoO(YOU PLAY WITH THE CARDS YOU'RE DEALT..)
import sys
def main(H, N, AB):
INF = 10**9
dp = [INF] * (H + 1)
dp[H] = 0
for h in reversed(list(range(H + 1))):
for i, (a, b) in enumerate(AB):
nh = max(0, h - a)
dp[nh] = min(dp[nh], dp[h] + b)
print((dp[0]))
if __n... | false | 17.647059 | [
"-H, N = list(map(int, input().split()))",
"-AB = [list(map(int, input().split())) for _ in range(N)]",
"-INF = 10**9",
"-dp = [INF for _ in range(H + 1)]",
"-dp[H] = 0",
"-for h in range(H, 0, -1):",
"- for n in range(N):",
"- A, B = AB[n]",
"- newH = max(0, h - A)",
"- dp... | false | 0.124895 | 0.066844 | 1.868458 | [
"s895688190",
"s371168889"
] |
u606045429 | p02891 | python | s524147291 | s945031618 | 19 | 17 | 3,064 | 3,064 | Accepted | Accepted | 10.53 | from itertools import groupby
S = eval(input())
K = int(eval(input()))
A = [len(tuple(v)) for _, v in groupby(S)]
if len(A) == 1:
print(((len(S) * K) // 2))
quit()
t = sum(a // 2 for a in A)
if S[0] == S[-1]:
l, r = A[0], A[-1]
m = t - l // 2 - r // 2
print((K * m + (K - 1) * ((r + ... | from itertools import groupby
S = eval(input())
K = int(eval(input()))
A = [len(tuple(v)) for _, v in groupby(S)]
if len(A) == 1:
print(((A[0] * K) // 2))
quit()
if S[0] == S[-1]:
m = sum(a // 2 for a in A) - A[0] // 2 - A[-1] // 2
print((K * m + (K - 1) * ((A[0] + A[-1]) // 2) + A[0] // ... | 17 | 15 | 358 | 367 | from itertools import groupby
S = eval(input())
K = int(eval(input()))
A = [len(tuple(v)) for _, v in groupby(S)]
if len(A) == 1:
print(((len(S) * K) // 2))
quit()
t = sum(a // 2 for a in A)
if S[0] == S[-1]:
l, r = A[0], A[-1]
m = t - l // 2 - r // 2
print((K * m + (K - 1) * ((r + l) // 2) + r // ... | from itertools import groupby
S = eval(input())
K = int(eval(input()))
A = [len(tuple(v)) for _, v in groupby(S)]
if len(A) == 1:
print(((A[0] * K) // 2))
quit()
if S[0] == S[-1]:
m = sum(a // 2 for a in A) - A[0] // 2 - A[-1] // 2
print((K * m + (K - 1) * ((A[0] + A[-1]) // 2) + A[0] // 2 + A[-1] // 2... | false | 11.764706 | [
"- print(((len(S) * K) // 2))",
"+ print(((A[0] * K) // 2))",
"-t = sum(a // 2 for a in A)",
"- l, r = A[0], A[-1]",
"- m = t - l // 2 - r // 2",
"- print((K * m + (K - 1) * ((r + l) // 2) + r // 2 + l // 2))",
"+ m = sum(a // 2 for a in A) - A[0] // 2 - A[-1] // 2",
"+ print((K *... | false | 0.008402 | 0.040708 | 0.206403 | [
"s524147291",
"s945031618"
] |
u707808519 | p02584 | python | s191643055 | s775841790 | 34 | 25 | 9,212 | 9,124 | Accepted | Accepted | 26.47 | X, K, D = list(map(int, input().split()))
n = (K-X//D)//2
#print(n)
if X - K*D > 0:
ans = X-K*D
elif X + D*K < 0:
ans = abs(X+D*K)
else:
ans = float('inf')
for i in range(-1, 2):
res = X + D*(K-2*(n+i))
ans = min(ans, abs(res))
for i in range(-1, 2):
res = X + D*... | X, K, D = list(map(int, input().split()))
n = (K-X//D)//2
#print(n)
if X - K*D > 0:
ans = X-K*D
elif X + D*K < 0:
ans = abs(X+D*K)
else:
ans = float('inf')
for i in range(-1, 2):
res = X + D*(2*(n+i)-K)
ans = min(ans, abs(res))
#print(res)
print(ans) | 18 | 15 | 394 | 299 | X, K, D = list(map(int, input().split()))
n = (K - X // D) // 2
# print(n)
if X - K * D > 0:
ans = X - K * D
elif X + D * K < 0:
ans = abs(X + D * K)
else:
ans = float("inf")
for i in range(-1, 2):
res = X + D * (K - 2 * (n + i))
ans = min(ans, abs(res))
for i in range(-1, 2):
... | X, K, D = list(map(int, input().split()))
n = (K - X // D) // 2
# print(n)
if X - K * D > 0:
ans = X - K * D
elif X + D * K < 0:
ans = abs(X + D * K)
else:
ans = float("inf")
for i in range(-1, 2):
res = X + D * (2 * (n + i) - K)
ans = min(ans, abs(res))
# print(res)
print(ans)
| false | 16.666667 | [
"- res = X + D * (K - 2 * (n + i))",
"- ans = min(ans, abs(res))",
"- for i in range(-1, 2):"
] | false | 0.042106 | 0.070106 | 0.600596 | [
"s191643055",
"s775841790"
] |
u561083515 | p03316 | python | s265447493 | s010276476 | 19 | 17 | 2,940 | 2,940 | Accepted | Accepted | 10.53 | def sum_digit(num):
sum = 0
while num > 0:
sum += num % 10
num //= 10
return sum
N = int(eval(input()))
S = sum_digit(N)
if N % S == 0:
print("Yes")
else:
print("No") | def sum_digit(num):
sum = 0
while num > 0:
sum += num % 10
num //= 10
return sum
N = int(eval(input()))
print(("Yes" if N % sum_digit(N) == 0 else "No")) | 13 | 9 | 209 | 182 | def sum_digit(num):
sum = 0
while num > 0:
sum += num % 10
num //= 10
return sum
N = int(eval(input()))
S = sum_digit(N)
if N % S == 0:
print("Yes")
else:
print("No")
| def sum_digit(num):
sum = 0
while num > 0:
sum += num % 10
num //= 10
return sum
N = int(eval(input()))
print(("Yes" if N % sum_digit(N) == 0 else "No"))
| false | 30.769231 | [
"-S = sum_digit(N)",
"-if N % S == 0:",
"- print(\"Yes\")",
"-else:",
"- print(\"No\")",
"+print((\"Yes\" if N % sum_digit(N) == 0 else \"No\"))"
] | false | 0.050752 | 0.085319 | 0.594843 | [
"s265447493",
"s010276476"
] |
u339199690 | p03752 | python | s528351166 | s841965363 | 144 | 128 | 3,064 | 9,188 | Accepted | Accepted | 11.11 | N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
res = 10 ** 15
for bit in range(2 ** N):
cnt = 0
for i in range(N):
if (bit >> i) & 1:
cnt += 1
if cnt < K:
continue
cost = 0
height = A[0]
if (bit >> 0) & 1:
for i... | import sys
N, K = list(map(int, input().split()))
B = list(map(int, sys.stdin.readline().rsplit()))
res = 10 ** 18
for i in range(2 ** N):
cnt = 0
for j in range(N):
# print(bin(i), bin(i >> j))
if (i >> j) & 1:
cnt += 1
# print(cnt)
if cnt != K:
conti... | 27 | 31 | 563 | 615 | N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
res = 10**15
for bit in range(2**N):
cnt = 0
for i in range(N):
if (bit >> i) & 1:
cnt += 1
if cnt < K:
continue
cost = 0
height = A[0]
if (bit >> 0) & 1:
for i in range(1, N):
... | import sys
N, K = list(map(int, input().split()))
B = list(map(int, sys.stdin.readline().rsplit()))
res = 10**18
for i in range(2**N):
cnt = 0
for j in range(N):
# print(bin(i), bin(i >> j))
if (i >> j) & 1:
cnt += 1
# print(cnt)
if cnt != K:
continue
A = B[::]
... | false | 12.903226 | [
"+import sys",
"+",
"-A = list(map(int, input().split()))",
"-res = 10**15",
"-for bit in range(2**N):",
"+B = list(map(int, sys.stdin.readline().rsplit()))",
"+res = 10**18",
"+for i in range(2**N):",
"- for i in range(N):",
"- if (bit >> i) & 1:",
"+ for j in range(N):",
"+ ... | false | 0.048708 | 0.044298 | 1.099548 | [
"s528351166",
"s841965363"
] |
u329232967 | p03165 | python | s059272669 | s410118780 | 1,172 | 399 | 307,076 | 111,452 | Accepted | Accepted | 65.96 | from io import StringIO
UP = 0
LEFT = 1
LEFTUP = 2
def lcs(s, t):
m = len(s)
n = len(t)
# dp[i][j] = LCS-length of (s[:i], t[:j])
dp = [[(0, None)] * (n + 1) for i in range(m + 1)]
for i in range(m + 1):
for j in range(n + 1):
if i == 0 or j == 0:
... | from io import StringIO
UP = 0
LEFT = 1
LEFTUP = 2
def lcs(s, t):
m = len(s)
n = len(t)
# dp[i][j] = LCS-length of (s[:i], t[:j])
dp = [[0] * (n + 1) for i in range(m + 1)]
for i in range(1, m + 1):
for j in range(1, n + 1):
if s[i - 1] == t[j - 1]:
... | 43 | 39 | 1,007 | 877 | from io import StringIO
UP = 0
LEFT = 1
LEFTUP = 2
def lcs(s, t):
m = len(s)
n = len(t)
# dp[i][j] = LCS-length of (s[:i], t[:j])
dp = [[(0, None)] * (n + 1) for i in range(m + 1)]
for i in range(m + 1):
for j in range(n + 1):
if i == 0 or j == 0:
continue
... | from io import StringIO
UP = 0
LEFT = 1
LEFTUP = 2
def lcs(s, t):
m = len(s)
n = len(t)
# dp[i][j] = LCS-length of (s[:i], t[:j])
dp = [[0] * (n + 1) for i in range(m + 1)]
for i in range(1, m + 1):
for j in range(1, n + 1):
if s[i - 1] == t[j - 1]:
dp[i][j] = ... | false | 9.302326 | [
"- dp = [[(0, None)] * (n + 1) for i in range(m + 1)]",
"- for i in range(m + 1):",
"- for j in range(n + 1):",
"- if i == 0 or j == 0:",
"- continue",
"- elif s[i - 1] == t[j - 1]:",
"- dp[i][j] = (dp[i - 1][j - 1][0] + 1, LEFTUP)",
"- ... | false | 0.042375 | 0.042507 | 0.9969 | [
"s059272669",
"s410118780"
] |
u498487134 | p02731 | python | s348477713 | s985733795 | 162 | 68 | 38,256 | 61,716 | Accepted | Accepted | 58.02 | import sys
input = sys.stdin.readline
def I(): return int(eval(input()))
def MI(): return list(map(int, input().split()))
def LI(): return list(map(int, input().split()))
def main():
mod=10**9+7
L=I()
print(((L/3)**3))
main()
| import sys
input = sys.stdin.readline
def I(): return int(eval(input()))
def MI(): return list(map(int, input().split()))
def LI(): return list(map(int, input().split()))
def main():
L=I()
print(((L/3)**3))
main()
| 13 | 13 | 239 | 224 | import sys
input = sys.stdin.readline
def I():
return int(eval(input()))
def MI():
return list(map(int, input().split()))
def LI():
return list(map(int, input().split()))
def main():
mod = 10**9 + 7
L = I()
print(((L / 3) ** 3))
main()
| import sys
input = sys.stdin.readline
def I():
return int(eval(input()))
def MI():
return list(map(int, input().split()))
def LI():
return list(map(int, input().split()))
def main():
L = I()
print(((L / 3) ** 3))
main()
| false | 0 | [
"- mod = 10**9 + 7"
] | false | 0.116459 | 0.040598 | 2.868571 | [
"s348477713",
"s985733795"
] |
u606045429 | p02888 | python | s593184201 | s774754723 | 1,651 | 1,491 | 3,188 | 3,188 | Accepted | Accepted | 9.69 | from itertools import accumulate
N, *L = list(map(int, open(0).read().split()))
A = [0] * (2 * 10 ** 3 + 7)
for l in L:
A[l] += 1
S = list(accumulate(A))
ans = 0
for i in range(N):
b = L[i]
for j in range(i + 1, N):
c = L[j]
l, r = abs(b - c), b + c
ans += S[r - 1... | from itertools import accumulate, combinations
N, *L = list(map(int, open(0).read().split()))
A = [0] * (2 * 10 ** 3 + 7)
for l in L:
A[l] += 1
S = list(accumulate(A))
ans = 0
for b, c in combinations(L, 2):
l, r = abs(b - c), b + c
ans += S[r - 1] - S[l] - (l < b < r) - (l < c < r)
prin... | 19 | 16 | 370 | 326 | from itertools import accumulate
N, *L = list(map(int, open(0).read().split()))
A = [0] * (2 * 10**3 + 7)
for l in L:
A[l] += 1
S = list(accumulate(A))
ans = 0
for i in range(N):
b = L[i]
for j in range(i + 1, N):
c = L[j]
l, r = abs(b - c), b + c
ans += S[r - 1] - S[l] - (l < b < r... | from itertools import accumulate, combinations
N, *L = list(map(int, open(0).read().split()))
A = [0] * (2 * 10**3 + 7)
for l in L:
A[l] += 1
S = list(accumulate(A))
ans = 0
for b, c in combinations(L, 2):
l, r = abs(b - c), b + c
ans += S[r - 1] - S[l] - (l < b < r) - (l < c < r)
print((ans // 3))
| false | 15.789474 | [
"-from itertools import accumulate",
"+from itertools import accumulate, combinations",
"-for i in range(N):",
"- b = L[i]",
"- for j in range(i + 1, N):",
"- c = L[j]",
"- l, r = abs(b - c), b + c",
"- ans += S[r - 1] - S[l] - (l < b < r) - (l < c < r)",
"+for b, c in com... | false | 0.092326 | 0.073825 | 1.250604 | [
"s593184201",
"s774754723"
] |
u644907318 | p03730 | python | s867231758 | s387452455 | 216 | 61 | 61,644 | 61,780 | Accepted | Accepted | 71.76 | A,B,C = list(map(int,input().split()))
flag = 0
for i in range(B):
if (i*A)%B==C:
flag = 1
break
if flag==1:
print("YES")
else:
print("NO") | A,B,C = list(map(int,input().split()))
flag = 0
for k in range(B):
if (k*A)%B==C:
flag = 1
break
if flag==1:
print("YES")
else:
print("NO") | 10 | 10 | 170 | 170 | A, B, C = list(map(int, input().split()))
flag = 0
for i in range(B):
if (i * A) % B == C:
flag = 1
break
if flag == 1:
print("YES")
else:
print("NO")
| A, B, C = list(map(int, input().split()))
flag = 0
for k in range(B):
if (k * A) % B == C:
flag = 1
break
if flag == 1:
print("YES")
else:
print("NO")
| false | 0 | [
"-for i in range(B):",
"- if (i * A) % B == C:",
"+for k in range(B):",
"+ if (k * A) % B == C:"
] | false | 0.043957 | 0.037788 | 1.163247 | [
"s867231758",
"s387452455"
] |
u227082700 | p02580 | python | s528976412 | s940776133 | 1,481 | 892 | 175,636 | 58,776 | Accepted | Accepted | 39.77 | h,w,m=map(int,input().split())
hh=[[0,i]for i in range(h)]
ww=[[0,i]for i in range(w)]
hw=set()
for _ in range(m):
a,b=map(int,input().split())
a-=1
b-=1
hh[a][0]+=1
ww[b][0]+=1
hw.add((a,b))
ww.sort(reverse=1)
s=ww[0][0]
w=[]
for x,j in ww:
if x==s:w.append(j)
hh.sort(reverse=1)
ans=0
t... | import sys
input = lambda: sys.stdin.readline().rstrip()
h, w, m = list(map(int, input().split()))
hw = []
hcount = [0] * h
wcount = [0] * w
for _ in range(m):
a, b = list(map(int, input().split()))
a -= 1
b -= 1
hcount[a] += 1
wcount[b] += 1
hw.append([a, b])
hmax = max(hcount)
wmax = m... | 27 | 28 | 467 | 511 | h, w, m = map(int, input().split())
hh = [[0, i] for i in range(h)]
ww = [[0, i] for i in range(w)]
hw = set()
for _ in range(m):
a, b = map(int, input().split())
a -= 1
b -= 1
hh[a][0] += 1
ww[b][0] += 1
hw.add((a, b))
ww.sort(reverse=1)
s = ww[0][0]
w = []
for x, j in ww:
if x == s:
... | import sys
input = lambda: sys.stdin.readline().rstrip()
h, w, m = list(map(int, input().split()))
hw = []
hcount = [0] * h
wcount = [0] * w
for _ in range(m):
a, b = list(map(int, input().split()))
a -= 1
b -= 1
hcount[a] += 1
wcount[b] += 1
hw.append([a, b])
hmax = max(hcount)
wmax = max(wcou... | false | 3.571429 | [
"-h, w, m = map(int, input().split())",
"-hh = [[0, i] for i in range(h)]",
"-ww = [[0, i] for i in range(w)]",
"-hw = set()",
"+import sys",
"+",
"+input = lambda: sys.stdin.readline().rstrip()",
"+h, w, m = list(map(int, input().split()))",
"+hw = []",
"+hcount = [0] * h",
"+wcount = [0] * w",... | false | 0.038639 | 0.036989 | 1.044593 | [
"s528976412",
"s940776133"
] |
u347640436 | p02768 | python | s268651726 | s720209189 | 160 | 125 | 3,064 | 9,104 | Accepted | Accepted | 21.88 | def mcomb(n, k):
a = 1
b = 1
for i in range(k):
a *= n - i
a %= 1000000007
b *= i + 1
b %= 1000000007
return a * pow(b, 1000000005, 1000000007) % 1000000007
n, a, b = list(map(int, input().split()))
result = pow(2, n, 1000000007) - 1
result -= mcomb(n, a)... | # フェルマーの小定理
def mcomb(n, k):
a = 1
b = 1
for i in range(k):
a *= n - i
a %= m
b *= i + 1
b %= m
return a * pow(b, m - 2, m) % m
n, a, b = list(map(int, input().split()))
m = 1000000007
result = pow(2, n, m) - 1
result += m - mcomb(n, a)
result %= m
... | 21 | 22 | 439 | 368 | def mcomb(n, k):
a = 1
b = 1
for i in range(k):
a *= n - i
a %= 1000000007
b *= i + 1
b %= 1000000007
return a * pow(b, 1000000005, 1000000007) % 1000000007
n, a, b = list(map(int, input().split()))
result = pow(2, n, 1000000007) - 1
result -= mcomb(n, a)
result + 10000... | # フェルマーの小定理
def mcomb(n, k):
a = 1
b = 1
for i in range(k):
a *= n - i
a %= m
b *= i + 1
b %= m
return a * pow(b, m - 2, m) % m
n, a, b = list(map(int, input().split()))
m = 1000000007
result = pow(2, n, m) - 1
result += m - mcomb(n, a)
result %= m
result += m - mcomb(n... | false | 4.545455 | [
"+# フェルマーの小定理",
"- a %= 1000000007",
"+ a %= m",
"- b %= 1000000007",
"- return a * pow(b, 1000000005, 1000000007) % 1000000007",
"+ b %= m",
"+ return a * pow(b, m - 2, m) % m",
"-result = pow(2, n, 1000000007) - 1",
"-result -= mcomb(n, a)",
"-result + 100000000... | false | 0.091002 | 0.165756 | 0.549012 | [
"s268651726",
"s720209189"
] |
u330661451 | p02743 | python | s636717749 | s177788069 | 157 | 35 | 12,488 | 5,204 | Accepted | Accepted | 77.71 | import numpy as np
a,b,c = list(map(int,input().split()))
if np.sqrt(np.float128(a)) + np.sqrt(np.float128(b)) + np.float128(1e-14) < np.sqrt(np.float128(c)) :
print("Yes")
else:
print("No")
| from decimal import Decimal, getcontext
getcontext().prec = 1000
a,b,c = list(map(int,input().split()))
sq_a = Decimal(a).sqrt()
sq_b = Decimal(b).sqrt()
sq_c = Decimal(c).sqrt()
eps = Decimal(10) ** (-100)
cond = sq_a + sq_b + eps < sq_c
answer = 'Yes' if cond else 'No'
print(answer)
| 8 | 14 | 207 | 297 | import numpy as np
a, b, c = list(map(int, input().split()))
if np.sqrt(np.float128(a)) + np.sqrt(np.float128(b)) + np.float128(1e-14) < np.sqrt(
np.float128(c)
):
print("Yes")
else:
print("No")
| from decimal import Decimal, getcontext
getcontext().prec = 1000
a, b, c = list(map(int, input().split()))
sq_a = Decimal(a).sqrt()
sq_b = Decimal(b).sqrt()
sq_c = Decimal(c).sqrt()
eps = Decimal(10) ** (-100)
cond = sq_a + sq_b + eps < sq_c
answer = "Yes" if cond else "No"
print(answer)
| false | 42.857143 | [
"-import numpy as np",
"+from decimal import Decimal, getcontext",
"+getcontext().prec = 1000",
"-if np.sqrt(np.float128(a)) + np.sqrt(np.float128(b)) + np.float128(1e-14) < np.sqrt(",
"- np.float128(c)",
"-):",
"- print(\"Yes\")",
"-else:",
"- print(\"No\")",
"+sq_a = Decimal(a).sqrt()",... | false | 0.007591 | 0.046518 | 0.163187 | [
"s636717749",
"s177788069"
] |
u290211456 | p03416 | python | s591460457 | s925371084 | 51 | 45 | 3,064 | 2,940 | Accepted | Accepted | 11.76 | a,b = list(map(int, input().split()))
cnt = 0
itr = b - a
for i in range(a,b+1):
m = str(i)
if m[0] == m[4] and m[1] == m[3]:
cnt += 1
print(cnt)
| a, b = list(map(int, input().split()))
cnt = 0
for i in range(a, b+1):
si = str(i)
if si[0] == si[4] and si[1] == si[3]:
cnt += 1
print(cnt)
| 8 | 7 | 158 | 157 | a, b = list(map(int, input().split()))
cnt = 0
itr = b - a
for i in range(a, b + 1):
m = str(i)
if m[0] == m[4] and m[1] == m[3]:
cnt += 1
print(cnt)
| a, b = list(map(int, input().split()))
cnt = 0
for i in range(a, b + 1):
si = str(i)
if si[0] == si[4] and si[1] == si[3]:
cnt += 1
print(cnt)
| false | 12.5 | [
"-itr = b - a",
"- m = str(i)",
"- if m[0] == m[4] and m[1] == m[3]:",
"+ si = str(i)",
"+ if si[0] == si[4] and si[1] == si[3]:"
] | false | 0.051963 | 0.043499 | 1.194566 | [
"s591460457",
"s925371084"
] |
u130900604 | p02681 | python | s423340446 | s212199022 | 22 | 20 | 9,024 | 8,948 | Accepted | Accepted | 9.09 | s=eval(input())
t=input()[:-1]
print(("Yes" if s==t else "No")) | s=eval(input())
t=input()[:-1]
if s==t:
print("Yes")
else:
print("No") | 3 | 6 | 57 | 73 | s = eval(input())
t = input()[:-1]
print(("Yes" if s == t else "No"))
| s = eval(input())
t = input()[:-1]
if s == t:
print("Yes")
else:
print("No")
| false | 50 | [
"-print((\"Yes\" if s == t else \"No\"))",
"+if s == t:",
"+ print(\"Yes\")",
"+else:",
"+ print(\"No\")"
] | false | 0.048029 | 0.045689 | 1.051224 | [
"s423340446",
"s212199022"
] |
u235376569 | p02819 | python | s883794615 | s875745477 | 37 | 26 | 2,940 | 2,940 | Accepted | Accepted | 29.73 | X=int(eval(input()))
flag=1
if X==2:
flag=0
while(flag==1):
for i in range(2,X+1):
if(X%i==0):
X+=1
break
if(i==X-1):
flag=0
break
print(X) | X=int(eval(input()))
def prime(N):
for i in range(2,N-1):
if N%i==0:
return -1
return N
for x in range(X,10**10):
if prime(x)==x:
print(x)
break | 17 | 13 | 244 | 179 | X = int(eval(input()))
flag = 1
if X == 2:
flag = 0
while flag == 1:
for i in range(2, X + 1):
if X % i == 0:
X += 1
break
if i == X - 1:
flag = 0
break
print(X)
| X = int(eval(input()))
def prime(N):
for i in range(2, N - 1):
if N % i == 0:
return -1
return N
for x in range(X, 10**10):
if prime(x) == x:
print(x)
break
| false | 23.529412 | [
"-flag = 1",
"-if X == 2:",
"- flag = 0",
"-while flag == 1:",
"- for i in range(2, X + 1):",
"- if X % i == 0:",
"- X += 1",
"- break",
"- if i == X - 1:",
"- flag = 0",
"- break",
"-print(X)",
"+",
"+",
"+def prime(N):",
... | false | 0.161364 | 0.100862 | 1.599844 | [
"s883794615",
"s875745477"
] |
u095426154 | p03240 | python | s053686691 | s427177882 | 1,653 | 34 | 4,244 | 3,064 | Accepted | Accepted | 97.94 | n=int(eval(input()))
l=[[] for i in range(n)]
for i in range(n):
l[i]=list(map(int,input().split()))
xy=[[] for i in range(101**2)]
k=0
for x in range(101):
for y in range(101):
xy[k]=[x,y]
k+=1
for i in l:
for j in l:
tmp=[]
if i==j:
continue
... | N=int(eval(input()))
xyh=[]
for i in range(N):
xyh.append(list(map(int,input().split())))
xyh.sort(key=lambda x: x[2])
for x in range(101):
for y in range(101):
flg = True
H = xyh[-1][2] + abs(xyh[-1][0] - x) + abs(xyh[-1][1] - y)
X = x
Y = y
for i ... | 31 | 24 | 952 | 549 | n = int(eval(input()))
l = [[] for i in range(n)]
for i in range(n):
l[i] = list(map(int, input().split()))
xy = [[] for i in range(101**2)]
k = 0
for x in range(101):
for y in range(101):
xy[k] = [x, y]
k += 1
for i in l:
for j in l:
tmp = []
if i == j:
continue
... | N = int(eval(input()))
xyh = []
for i in range(N):
xyh.append(list(map(int, input().split())))
xyh.sort(key=lambda x: x[2])
for x in range(101):
for y in range(101):
flg = True
H = xyh[-1][2] + abs(xyh[-1][0] - x) + abs(xyh[-1][1] - y)
X = x
Y = y
for i in range(N):
... | false | 22.580645 | [
"-n = int(eval(input()))",
"-l = [[] for i in range(n)]",
"-for i in range(n):",
"- l[i] = list(map(int, input().split()))",
"-xy = [[] for i in range(101**2)]",
"-k = 0",
"+N = int(eval(input()))",
"+xyh = []",
"+for i in range(N):",
"+ xyh.append(list(map(int, input().split())))",
"+xyh.... | false | 0.212432 | 0.039823 | 5.334386 | [
"s053686691",
"s427177882"
] |
u591295155 | p02686 | python | s611406272 | s907916925 | 1,549 | 328 | 84,532 | 66,952 | Accepted | Accepted | 78.83 | from cython import longlong
def main():
n: longlong
n=int(eval(input()))
lp, lm = [], []
for i in range(n):
s=eval(input())
x: longlong
y: longlong
x,y=0,0
for j in s:
if j=="(":x+=1
else:x-=1
... | import cython
def main():
import sys
readline = sys.stdin.readline
N: cython.longlong
N = int(readline())
S = [readline().strip() for i in range(N)]
D = []
L, R = [], []
for s in S:
l: cython.longlong = 0
r: cython.longlong = 0
for c in ... | 47 | 59 | 848 | 1,214 | from cython import longlong
def main():
n: longlong
n = int(eval(input()))
lp, lm = [], []
for i in range(n):
s = eval(input())
x: longlong
y: longlong
x, y = 0, 0
for j in s:
if j == "(":
x += 1
else:
x -=... | import cython
def main():
import sys
readline = sys.stdin.readline
N: cython.longlong
N = int(readline())
S = [readline().strip() for i in range(N)]
D = []
L, R = [], []
for s in S:
l: cython.longlong = 0
r: cython.longlong = 0
for c in s:
if c == "... | false | 20.338983 | [
"-from cython import longlong",
"+import cython",
"- n: longlong",
"- n = int(eval(input()))",
"- lp, lm = [], []",
"- for i in range(n):",
"- s = eval(input())",
"- x: longlong",
"- y: longlong",
"- x, y = 0, 0",
"- for j in s:",
"- if... | false | 0.06496 | 0.058397 | 1.112382 | [
"s611406272",
"s907916925"
] |
u204478136 | p03835 | python | s990520227 | s848849037 | 1,448 | 833 | 2,940 | 39,832 | Accepted | Accepted | 42.47 | # 入力
k,s=list(map(int,input().split()))
count = 0
for x in range(k+1):
for y in range(k+1):
if 0 <= (s-x-y) <= k:
count += 1
print(count)
| # 入力
k,s=list(map(int,input().split()))
b = [x for x in range(k+1) for y in range(k+1) if 0<=(s-x-y)<=k]
print((len(b)))
| 8 | 4 | 163 | 116 | # 入力
k, s = list(map(int, input().split()))
count = 0
for x in range(k + 1):
for y in range(k + 1):
if 0 <= (s - x - y) <= k:
count += 1
print(count)
| # 入力
k, s = list(map(int, input().split()))
b = [x for x in range(k + 1) for y in range(k + 1) if 0 <= (s - x - y) <= k]
print((len(b)))
| false | 50 | [
"-count = 0",
"-for x in range(k + 1):",
"- for y in range(k + 1):",
"- if 0 <= (s - x - y) <= k:",
"- count += 1",
"-print(count)",
"+b = [x for x in range(k + 1) for y in range(k + 1) if 0 <= (s - x - y) <= k]",
"+print((len(b)))"
] | false | 0.096213 | 0.036416 | 2.642069 | [
"s990520227",
"s848849037"
] |
u603958124 | p03497 | python | s261385270 | s763378216 | 209 | 107 | 44,160 | 35,240 | Accepted | Accepted | 48.8 | from collections import defaultdict
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
d = defaultdict(int)
for x in a:
d[x] += 1
new_d = sorted(list(d.items()), key=lambda x: x[1])
ans = 0
cnt = 0
for x in new_d:
if(cnt < len(new_d) - k):
ans += x[1]
cnt += 1
el... | from collections import Counter
n,k=list(map(int,input().split()))
a=list(map(int,input().split()))
c=Counter(a)
v=list(c.values())
n=len(v)
if n>k:
ans=sum(sorted(v)[:n-k])
print(ans)
else:
print((0))
| 19 | 11 | 334 | 216 | from collections import defaultdict
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
d = defaultdict(int)
for x in a:
d[x] += 1
new_d = sorted(list(d.items()), key=lambda x: x[1])
ans = 0
cnt = 0
for x in new_d:
if cnt < len(new_d) - k:
ans += x[1]
cnt += 1
else:
... | from collections import Counter
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
c = Counter(a)
v = list(c.values())
n = len(v)
if n > k:
ans = sum(sorted(v)[: n - k])
print(ans)
else:
print((0))
| false | 42.105263 | [
"-from collections import defaultdict",
"+from collections import Counter",
"-d = defaultdict(int)",
"-for x in a:",
"- d[x] += 1",
"-new_d = sorted(list(d.items()), key=lambda x: x[1])",
"-ans = 0",
"-cnt = 0",
"-for x in new_d:",
"- if cnt < len(new_d) - k:",
"- ans += x[1]",
"-... | false | 0.032254 | 0.034828 | 0.926105 | [
"s261385270",
"s763378216"
] |
u340781749 | p02644 | python | s536360598 | s060553709 | 2,679 | 1,507 | 550,596 | 534,320 | Accepted | Accepted | 43.75 | from heapq import heappop, heappush
import numpy as np
from numba import njit
@njit('UniTuple(i8[:],4)(i1[:],i8,i8,i8)')
def reachable(field, h2, w2, k):
# 各マスから上下左右にどこまで行けるか
hw = h2 * w2
up = np.full(hw, -1, dtype=np.int64)
dw = np.full(hw, -1, dtype=np.int64)
lf = np.full(hw, -1, ... | from heapq import heappop, heappush
import numpy as np
from numba import njit
@njit('UniTuple(i8[:],4)(i1[:],i8,i8,i8)', cache=True)
def reachable(field, h2, w2, k):
# 各マスから上下左右にどこまで行けるか
hw = h2 * w2
up = np.full(hw, -1, dtype=np.int64)
dw = np.full(hw, -1, dtype=np.int64)
lf = np.f... | 110 | 110 | 2,827 | 2,851 | from heapq import heappop, heappush
import numpy as np
from numba import njit
@njit("UniTuple(i8[:],4)(i1[:],i8,i8,i8)")
def reachable(field, h2, w2, k):
# 各マスから上下左右にどこまで行けるか
hw = h2 * w2
up = np.full(hw, -1, dtype=np.int64)
dw = np.full(hw, -1, dtype=np.int64)
lf = np.full(hw, -1, dtype=np.int64)... | from heapq import heappop, heappush
import numpy as np
from numba import njit
@njit("UniTuple(i8[:],4)(i1[:],i8,i8,i8)", cache=True)
def reachable(field, h2, w2, k):
# 各マスから上下左右にどこまで行けるか
hw = h2 * w2
up = np.full(hw, -1, dtype=np.int64)
dw = np.full(hw, -1, dtype=np.int64)
lf = np.full(hw, -1, dty... | false | 0 | [
"-@njit(\"UniTuple(i8[:],4)(i1[:],i8,i8,i8)\")",
"+@njit(\"UniTuple(i8[:],4)(i1[:],i8,i8,i8)\", cache=True)",
"-@njit(\"i8(i8,i8,i8,i1[:],i8,i8,i8,i8)\")",
"+@njit(\"i8(i8,i8,i8,i1[:],i8,i8,i8,i8)\", cache=True)"
] | false | 0.170091 | 0.165322 | 1.028844 | [
"s536360598",
"s060553709"
] |
u163783894 | p03329 | python | s837452029 | s061868671 | 1,081 | 234 | 13,812 | 42,860 | Accepted | Accepted | 78.35 | # import math
# import itertools
# from collections import deque
# from collections import defaultdict
# import heapq
import sys
# import numpy as np
# from scipy.special import comb
sys.setrecursionlimit(100000)
INF = 100100100
N = int(eval(input()))
memo = [-1] * (N + 1)
memo[0] = 0
def f(n):
... | # import math
# import itertools
# from collections import deque
# from collections import defaultdict
# import heapq
# import sys
# import numpy as np
# from scipy.special import comb
INF = 100100100
def main():
N = int(eval(input()))
memo = [INF] * (N + 1)
memo[0] = 0
for i in r... | 56 | 34 | 863 | 740 | # import math
# import itertools
# from collections import deque
# from collections import defaultdict
# import heapq
import sys
# import numpy as np
# from scipy.special import comb
sys.setrecursionlimit(100000)
INF = 100100100
N = int(eval(input()))
memo = [-1] * (N + 1)
memo[0] = 0
def f(n):
# 0なら終了
if n ... | # import math
# import itertools
# from collections import deque
# from collections import defaultdict
# import heapq
# import sys
# import numpy as np
# from scipy.special import comb
INF = 100100100
def main():
N = int(eval(input()))
memo = [INF] * (N + 1)
memo[0] = 0
for i in range(1, N + 1):
... | false | 39.285714 | [
"-import sys",
"-",
"+# import sys",
"-sys.setrecursionlimit(100000)",
"-N = int(eval(input()))",
"-memo = [-1] * (N + 1)",
"-memo[0] = 0",
"-",
"-",
"-def f(n):",
"- # 0なら終了",
"- if n == 0:",
"- return 0",
"- # メモされてたら終了",
"- if not memo[n] == -1:",
"- return... | false | 0.162323 | 0.253158 | 0.641194 | [
"s837452029",
"s061868671"
] |
u325119213 | p03042 | python | s391168155 | s822920317 | 53 | 17 | 4,952 | 3,060 | Accepted | Accepted | 67.92 | import datetime
def actual(s):
try:
is_valid_yymm = bool(datetime.datetime.strptime(s, '%y%m'))
except ValueError:
is_valid_yymm = False
try:
is_valid_mmyy = bool(datetime.datetime.strptime(s, '%m%y'))
except ValueError:
is_valid_mmyy = False
if is_v... | def actual(s):
left, right = int(s[:2]), int(s[2:])
valid_right_as_mm = 1 <= right <= 12
valid_left_as_mm = 1 <= left <= 12
if valid_left_as_mm and valid_right_as_mm:
return 'AMBIGUOUS'
if valid_left_as_mm:
return 'MMYY'
if valid_right_as_mm:
return 'YYMM... | 27 | 19 | 568 | 373 | import datetime
def actual(s):
try:
is_valid_yymm = bool(datetime.datetime.strptime(s, "%y%m"))
except ValueError:
is_valid_yymm = False
try:
is_valid_mmyy = bool(datetime.datetime.strptime(s, "%m%y"))
except ValueError:
is_valid_mmyy = False
if is_valid_yymm and is... | def actual(s):
left, right = int(s[:2]), int(s[2:])
valid_right_as_mm = 1 <= right <= 12
valid_left_as_mm = 1 <= left <= 12
if valid_left_as_mm and valid_right_as_mm:
return "AMBIGUOUS"
if valid_left_as_mm:
return "MMYY"
if valid_right_as_mm:
return "YYMM"
return "NA"... | false | 29.62963 | [
"-import datetime",
"-",
"-",
"- try:",
"- is_valid_yymm = bool(datetime.datetime.strptime(s, \"%y%m\"))",
"- except ValueError:",
"- is_valid_yymm = False",
"- try:",
"- is_valid_mmyy = bool(datetime.datetime.strptime(s, \"%m%y\"))",
"- except ValueError:",
"- ... | false | 0.045302 | 0.075272 | 0.601848 | [
"s391168155",
"s822920317"
] |
u940139461 | p03283 | python | s182632650 | s410705355 | 2,706 | 1,653 | 55,672 | 58,584 | Accepted | Accepted | 38.91 | n, m, q = list(map(int, input().split()))
cities = [[0] * (n + 1) for _ in range(n + 1)]
trains = [[0] * (n + 1) for _ in range(n + 1)]
for _ in range(m):
l, r = list(map(int, input().split()))
trains[l][r] += 1
for i in range(n):
for j in range(n):
cities[i + 1][j + 1] = cities[i + 1][j] ... | n, m, q = list(map(int, input().split()))
trains = [[0] * (n + 1) for _ in range(n + 1)]
for _ in range(m):
l, r = list(map(int, input().split()))
trains[l][r] += 1
for i in range(n):
for j in range(n):
trains[i][j + 1] += trains[i][j]
for i in range(n):
for j in range(n):
tr... | 16 | 17 | 497 | 508 | n, m, q = list(map(int, input().split()))
cities = [[0] * (n + 1) for _ in range(n + 1)]
trains = [[0] * (n + 1) for _ in range(n + 1)]
for _ in range(m):
l, r = list(map(int, input().split()))
trains[l][r] += 1
for i in range(n):
for j in range(n):
cities[i + 1][j + 1] = cities[i + 1][j] + trains[i... | n, m, q = list(map(int, input().split()))
trains = [[0] * (n + 1) for _ in range(n + 1)]
for _ in range(m):
l, r = list(map(int, input().split()))
trains[l][r] += 1
for i in range(n):
for j in range(n):
trains[i][j + 1] += trains[i][j]
for i in range(n):
for j in range(n):
trains[i + 1][... | false | 5.882353 | [
"-cities = [[0] * (n + 1) for _ in range(n + 1)]",
"- cities[i + 1][j + 1] = cities[i + 1][j] + trains[i + 1][j + 1]",
"+ trains[i][j + 1] += trains[i][j]",
"+for i in range(n):",
"+ for j in range(n):",
"+ trains[i + 1][j + 1] += trains[i][j + 1]",
"- ans = 0",
"- for i ... | false | 0.049202 | 0.049223 | 0.999565 | [
"s182632650",
"s410705355"
] |
u094999522 | p03565 | python | s901264387 | s141060693 | 28 | 25 | 9,128 | 9,064 | Accepted | Accepted | 10.71 | #!/usr/bin/env python3
s = eval(input())
t = eval(input())
n = len(t)
m = len(s)
c = "z" * m
for i in range(m - n + 1):
if all(j in (t[k], "?") for k, j in enumerate(s[i:n + i])):
c = min(c, s[:i] + t + s[i + n:])
print(("UNRESTORABLE" if c == "z" * m else c.replace("?", "a")))
| S = eval(input())
T = eval(input())
s, t = len(S), len(T)
c = "z" * s
for i in range(s - t + 1):
if all(S[i + j] in (T[j], "?") for j in range(t)):
c = min(c, S[:i] + T + S[i + t:])
print(("UNRESTORABLE" if c == "z" * s else c.replace("?", "a")))
| 10 | 8 | 286 | 252 | #!/usr/bin/env python3
s = eval(input())
t = eval(input())
n = len(t)
m = len(s)
c = "z" * m
for i in range(m - n + 1):
if all(j in (t[k], "?") for k, j in enumerate(s[i : n + i])):
c = min(c, s[:i] + t + s[i + n :])
print(("UNRESTORABLE" if c == "z" * m else c.replace("?", "a")))
| S = eval(input())
T = eval(input())
s, t = len(S), len(T)
c = "z" * s
for i in range(s - t + 1):
if all(S[i + j] in (T[j], "?") for j in range(t)):
c = min(c, S[:i] + T + S[i + t :])
print(("UNRESTORABLE" if c == "z" * s else c.replace("?", "a")))
| false | 20 | [
"-#!/usr/bin/env python3",
"-s = eval(input())",
"-t = eval(input())",
"-n = len(t)",
"-m = len(s)",
"-c = \"z\" * m",
"-for i in range(m - n + 1):",
"- if all(j in (t[k], \"?\") for k, j in enumerate(s[i : n + i])):",
"- c = min(c, s[:i] + t + s[i + n :])",
"-print((\"UNRESTORABLE\" if ... | false | 0.03597 | 0.07142 | 0.503638 | [
"s901264387",
"s141060693"
] |
u492605584 | p03045 | python | s559179846 | s401450553 | 833 | 620 | 93,668 | 81,764 | Accepted | Accepted | 25.57 | import sys
input = sys.stdin.readline
N, M = list(map(int, input().split()))
pair = {}
rank = {}
def root(x):
if x == pair[x]:
return x
else:
pair[x] = root(pair[x])
return pair[x]
def unite(x, y):
rx = root(x)
ry = root(y)
if rx > ry:
pair[rx] = pair[r... | import sys
input = sys.stdin.readline
N, M = list(map(int, input().split()))
pair = {}
rank = {}
def root(x):
if x == pair[x]:
return x
else:
pair[x] = root(pair[x])
return pair[x]
def unite(x, y):
rx = root(x)
ry = root(y)
if rx > ry:
pair[rx] = pair[r... | 43 | 39 | 771 | 688 | import sys
input = sys.stdin.readline
N, M = list(map(int, input().split()))
pair = {}
rank = {}
def root(x):
if x == pair[x]:
return x
else:
pair[x] = root(pair[x])
return pair[x]
def unite(x, y):
rx = root(x)
ry = root(y)
if rx > ry:
pair[rx] = pair[ry]
else:
... | import sys
input = sys.stdin.readline
N, M = list(map(int, input().split()))
pair = {}
rank = {}
def root(x):
if x == pair[x]:
return x
else:
pair[x] = root(pair[x])
return pair[x]
def unite(x, y):
rx = root(x)
ry = root(y)
if rx > ry:
pair[rx] = pair[ry]
else:
... | false | 9.302326 | [
"-tmp = []",
"- tmp.append(list(map(int, input().split())))",
"-tmp.sort()",
"-for i in range(M):",
"- x, y = tmp[i][0], tmp[i][1]",
"+ x, y, z = list(map(int, input().split()))"
] | false | 0.065229 | 0.125319 | 0.520501 | [
"s559179846",
"s401450553"
] |
u652656291 | p02983 | python | s547758836 | s936460319 | 416 | 223 | 75,448 | 76,256 | Accepted | Accepted | 46.39 | l, r = (int(_) for _ in input().split())
r = min(r,l+2019)
x = [i*ii%2019 for i in range(l,r+1) for ii in range(i+1,r+1)]
print((min(x)))
| import numpy as np
L,R = (int(x) for x in input().split())
if R - L > 3000:
print((0))
exit()
x = np.arange(L,R+1,dtype=np.int64)
y = x[:,None] * x[None,:] % 2019
for i in range(len(x)):
y[i,i] = 3000
answer = y.min()
print(answer)
| 4 | 13 | 139 | 252 | l, r = (int(_) for _ in input().split())
r = min(r, l + 2019)
x = [i * ii % 2019 for i in range(l, r + 1) for ii in range(i + 1, r + 1)]
print((min(x)))
| import numpy as np
L, R = (int(x) for x in input().split())
if R - L > 3000:
print((0))
exit()
x = np.arange(L, R + 1, dtype=np.int64)
y = x[:, None] * x[None, :] % 2019
for i in range(len(x)):
y[i, i] = 3000
answer = y.min()
print(answer)
| false | 69.230769 | [
"-l, r = (int(_) for _ in input().split())",
"-r = min(r, l + 2019)",
"-x = [i * ii % 2019 for i in range(l, r + 1) for ii in range(i + 1, r + 1)]",
"-print((min(x)))",
"+import numpy as np",
"+",
"+L, R = (int(x) for x in input().split())",
"+if R - L > 3000:",
"+ print((0))",
"+ exit()",
... | false | 0.047309 | 0.477116 | 0.099156 | [
"s547758836",
"s936460319"
] |
u330799501 | p03544 | python | s868348893 | s867732379 | 30 | 26 | 9,112 | 9,168 | Accepted | Accepted | 13.33 | #k = int(input())
#s = input()
#a, b = map(int, input().split())
#s, t = map(str, input().split())
#l = list(map(int, input().split()))
#l = [list(map(int,input().split())) for i in range(n)]
#a = [list(input()) for _ in range(n)]
#a = [int(input()) for _ in range(n)]
n = int(eval(input()))
if (n == 1):
... | #k = int(input())
#s = input()
#a, b = map(int, input().split())
#s, t = map(str, input().split())
#l = list(map(int, input().split()))
#l = [list(map(int,input().split())) for i in range(n)]
#a = [list(input()) for _ in range(n)]
#a = [int(input()) for _ in range(n)]
n = int(eval(input()))
if (n == 1):
... | 25 | 25 | 476 | 476 | # k = int(input())
# s = input()
# a, b = map(int, input().split())
# s, t = map(str, input().split())
# l = list(map(int, input().split()))
# l = [list(map(int,input().split())) for i in range(n)]
# a = [list(input()) for _ in range(n)]
# a = [int(input()) for _ in range(n)]
n = int(eval(input()))
if n == 1:
print... | # k = int(input())
# s = input()
# a, b = map(int, input().split())
# s, t = map(str, input().split())
# l = list(map(int, input().split()))
# l = [list(map(int,input().split())) for i in range(n)]
# a = [list(input()) for _ in range(n)]
# a = [int(input()) for _ in range(n)]
n = int(eval(input()))
if n == 1:
print... | false | 0 | [
"- l1 = 1",
"- l2 = 3",
"- ans = 3",
"- for i in range(n - 2):",
"+ l1 = 2",
"+ l2 = 1",
"+ ans = 0",
"+ for i in range(n - 1):"
] | false | 0.045513 | 0.045755 | 0.994719 | [
"s868348893",
"s867732379"
] |
u358254559 | p03112 | python | s262937206 | s624379161 | 1,556 | 867 | 101,208 | 82,652 | Accepted | Accepted | 44.28 | a, b, q = list(map(int, input().split()))
s = []
t = []
x = []
for i in range(a):
s.append(int(eval(input())))
for i in range(b):
t.append(int(eval(input())))
for i in range(q):
x.append(int(eval(input())))
import bisect
def get(x):
ls,rs,lt,rt=10**13,10**13,10**13,10**13
s_ind = bisect... | import sys
input=sys.stdin.readline
a, b, q = list(map(int, input().split()))
s = []
t = []
x = []
for i in range(a):
s.append(int(eval(input())))
for i in range(b):
t.append(int(eval(input())))
for i in range(q):
x.append(int(eval(input())))
import bisect
def get(x):
ls,rs,lt,rt=10**13,10... | 36 | 38 | 799 | 837 | a, b, q = list(map(int, input().split()))
s = []
t = []
x = []
for i in range(a):
s.append(int(eval(input())))
for i in range(b):
t.append(int(eval(input())))
for i in range(q):
x.append(int(eval(input())))
import bisect
def get(x):
ls, rs, lt, rt = 10**13, 10**13, 10**13, 10**13
s_ind = bisect.bi... | import sys
input = sys.stdin.readline
a, b, q = list(map(int, input().split()))
s = []
t = []
x = []
for i in range(a):
s.append(int(eval(input())))
for i in range(b):
t.append(int(eval(input())))
for i in range(q):
x.append(int(eval(input())))
import bisect
def get(x):
ls, rs, lt, rt = 10**13, 10**1... | false | 5.263158 | [
"+import sys",
"+",
"+input = sys.stdin.readline"
] | false | 0.033714 | 0.042341 | 0.79626 | [
"s262937206",
"s624379161"
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.