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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
u588341295 | p03713 | python | s030242706 | s551452883 | 249 | 18 | 3,064 | 3,188 | Accepted | Accepted | 92.77 | # -*- coding: utf-8 -*-
H,W = list(map(int, input().split()))
# T字で区切るパターンを縦横それぞれ試す
mnval = float("inf")
for i in range(1,H):
# Tの横棒に当たる方
tmpA = i * W
# 縦2等分
tmpB = (H-i) * (W // 2)
# 残り
tmpC = H*W - tmpA - tmpB
mnval = min(mnval, abs(max(tmpA,tmpB,tmpC) - min(tmpA,tmpB,tmpC)))
for i in range(1,W):
tmpA = i * H
tmpB = (W-i) * (H // 2)
tmpC = H*W - tmpA - tmpB
mnval = min(mnval, abs(max(tmpA,tmpB,tmpC) - min(tmpA,tmpB,tmpC)))
# 縦並び横並びパターンをそれぞれ試す
if W >= 3:
# 3等分
tmpA = H * (W // 3)
# 3等分と、その余った部分の半分
tmpB = H * (W // 3 + ((W % 3) // 2))
# 残り
tmpC = H*W - tmpA - tmpB
mnval = min(mnval, abs(max(tmpA,tmpB,tmpC) - min(tmpA,tmpB,tmpC)))
if H >= 3:
tmpA = W * (H // 3)
tmpB = W * (H // 3 + ((H % 3) // 2))
tmpC = H*W - tmpA - tmpB
mnval = min(mnval, abs(max(tmpA,tmpB,tmpC) - min(tmpA,tmpB,tmpC)))
print(mnval) | # -*- coding: utf-8 -*-
import sys
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 int(eval(input()))
def MAP(): return list(map(int, input().split()))
def LIST(): return list(map(int, input().split()))
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
MOD = 10 ** 9 + 7
H, W = MAP()
if H%3==0 or W%3==0:
print((0))
exit()
H, W = max(H, W), min(H, W)
a = H // 3
bc = H - a
ans1 = max(abs(bc*ceil(W, 2)-a*W), abs(bc*(W//2)-a*W))
a = ceil(H, 3)
bc = H - a
ans2 = max(abs(bc*ceil(W, 2)-a*W), abs(bc*(W//2)-a*W))
H, W = min(H, W), max(H, W)
a = H // 3
bc = H - a
ans3 = max(abs(bc*ceil(W, 2)-a*W), abs(bc*(W//2)-a*W))
a = ceil(H, 3)
bc = H - a
ans4 = max(abs(bc*ceil(W, 2)-a*W), abs(bc*(W//2)-a*W))
ans5 = abs(ceil(W, 3)*H-W//3*H)
ans6 = abs(ceil(H, 3)*W-H//3*W)
print((min(ans1, ans2, ans3, ans4, ans5, ans6)))
| 36 | 47 | 931 | 1,143 | # -*- coding: utf-8 -*-
H, W = list(map(int, input().split()))
# T字で区切るパターンを縦横それぞれ試す
mnval = float("inf")
for i in range(1, H):
# Tの横棒に当たる方
tmpA = i * W
# 縦2等分
tmpB = (H - i) * (W // 2)
# 残り
tmpC = H * W - tmpA - tmpB
mnval = min(mnval, abs(max(tmpA, tmpB, tmpC) - min(tmpA, tmpB, tmpC)))
for i in range(1, W):
tmpA = i * H
tmpB = (W - i) * (H // 2)
tmpC = H * W - tmpA - tmpB
mnval = min(mnval, abs(max(tmpA, tmpB, tmpC) - min(tmpA, tmpB, tmpC)))
# 縦並び横並びパターンをそれぞれ試す
if W >= 3:
# 3等分
tmpA = H * (W // 3)
# 3等分と、その余った部分の半分
tmpB = H * (W // 3 + ((W % 3) // 2))
# 残り
tmpC = H * W - tmpA - tmpB
mnval = min(mnval, abs(max(tmpA, tmpB, tmpC) - min(tmpA, tmpB, tmpC)))
if H >= 3:
tmpA = W * (H // 3)
tmpB = W * (H // 3 + ((H % 3) // 2))
tmpC = H * W - tmpA - tmpB
mnval = min(mnval, abs(max(tmpA, tmpB, tmpC) - min(tmpA, tmpB, tmpC)))
print(mnval)
| # -*- coding: utf-8 -*-
import sys
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 int(eval(input()))
def MAP():
return list(map(int, input().split()))
def LIST():
return list(map(int, input().split()))
def Yes():
print("Yes")
def No():
print("No")
def YES():
print("YES")
def NO():
print("NO")
sys.setrecursionlimit(10**9)
INF = float("inf")
MOD = 10**9 + 7
H, W = MAP()
if H % 3 == 0 or W % 3 == 0:
print((0))
exit()
H, W = max(H, W), min(H, W)
a = H // 3
bc = H - a
ans1 = max(abs(bc * ceil(W, 2) - a * W), abs(bc * (W // 2) - a * W))
a = ceil(H, 3)
bc = H - a
ans2 = max(abs(bc * ceil(W, 2) - a * W), abs(bc * (W // 2) - a * W))
H, W = min(H, W), max(H, W)
a = H // 3
bc = H - a
ans3 = max(abs(bc * ceil(W, 2) - a * W), abs(bc * (W // 2) - a * W))
a = ceil(H, 3)
bc = H - a
ans4 = max(abs(bc * ceil(W, 2) - a * W), abs(bc * (W // 2) - a * W))
ans5 = abs(ceil(W, 3) * H - W // 3 * H)
ans6 = abs(ceil(H, 3) * W - H // 3 * W)
print((min(ans1, ans2, ans3, ans4, ans5, ans6)))
| false | 23.404255 | [
"-H, W = list(map(int, input().split()))",
"-# T字で区切るパターンを縦横それぞれ試す",
"-mnval = float(\"inf\")",
"-for i in range(1, H):",
"- # Tの横棒に当たる方",
"- tmpA = i * W",
"- # 縦2等分",
"- tmpB = (H - i) * (W // 2)",
"- # 残り",
"- tmpC = H * W - tmpA - tmpB",
"- mnval = min(mnval, abs(max(tmp... | false | 0.423868 | 0.036106 | 11.739399 | [
"s030242706",
"s551452883"
] |
u168578024 | p03061 | python | s644038297 | s429039297 | 1,236 | 1,114 | 121,620 | 122,144 | Accepted | Accepted | 9.87 | from fractions import gcd
import copy
class SegmentTree:
def __init__(self, N, func, I):
self.sz = 2 ** (N-1).bit_length()
self.func = func
self.I = copy.deepcopy(I)
self.seg = [copy.deepcopy(I) for i in range(self.sz * 2)]
def assign(self, k, x):
self.seg[k + self.sz] = copy.deepcopy(x)
def build(self):
for i in range(self.sz - 1, 0, -1):
self.seg[i] = self.func(self.seg[2 * i], self.seg[2 * i + 1])
def update(self, k, x):
k += self.sz
self.seg[k] = copy.deepcopy(x)
while k > 1:
k //= 2
self.seg[k] = self.func(self.seg[2 * k], self.seg[2 * k + 1])
def query(self, a, b):
L = copy.deepcopy(self.I)
R = copy.deepcopy(self.I)
a += self.sz
b += self.sz
while a < b:
if a % 2 == 1:
L = self.func(L, self.seg[a])
a += 1
if b % 2 == 1:
b -= 1
R = self.func(self.seg[b], R)
a //= 2
b //= 2
return self.func(L, R)
N = int(eval(input()))
A = list(map(int,input().split()))
def f(x,y):
if x * y == 0:
return x + y
else:
return gcd(x,y)
seg = SegmentTree(N + 1, f, 0)
for i in range(N):
seg.assign(i , A[i])
seg.build()
ans = 1
for i in range(N):
ans = max(ans , f(seg.query(0 , i) , seg.query(i + 1 , N)))
print(ans)
| import copy
class SegmentTree:
def __init__(self, N, func, I):
self.sz = N
self.func = func
self.I = copy.deepcopy(I)
self.seg = [copy.deepcopy(I) for i in range(self.sz * 2)]
def assign(self, k, x):
self.seg[k + self.sz] = copy.deepcopy(x)
def build(self):
for i in range(self.sz - 1, 0, -1):
self.seg[i] = self.func(self.seg[2 * i], self.seg[2 * i + 1])
def update(self, k, x):
k += self.sz
self.seg[k] = copy.deepcopy(x)
while k > 1:
k //= 2
self.seg[k] = self.func(self.seg[2 * k], self.seg[2 * k + 1])
def query(self, a, b):
L = copy.deepcopy(self.I)
R = copy.deepcopy(self.I)
a += self.sz
b += self.sz
while a < b:
if a % 2 == 1:
L = self.func(L, self.seg[a])
a += 1
if b % 2 == 1:
b -= 1
R = self.func(self.seg[b], R)
a //= 2
b //= 2
return self.func(L, R)
N = int(eval(input()))
a = list(map(int,input().split()))
from fractions import gcd
seg = SegmentTree(N , gcd , 0)
for i in range(N):
seg.assign(i , a[i])
seg.build()
ans = 1
for i in range(N):
ans = max(ans,gcd(seg.query(0,i) , seg.query(i+1,N)))
print(ans) | 59 | 49 | 1,495 | 1,369 | from fractions import gcd
import copy
class SegmentTree:
def __init__(self, N, func, I):
self.sz = 2 ** (N - 1).bit_length()
self.func = func
self.I = copy.deepcopy(I)
self.seg = [copy.deepcopy(I) for i in range(self.sz * 2)]
def assign(self, k, x):
self.seg[k + self.sz] = copy.deepcopy(x)
def build(self):
for i in range(self.sz - 1, 0, -1):
self.seg[i] = self.func(self.seg[2 * i], self.seg[2 * i + 1])
def update(self, k, x):
k += self.sz
self.seg[k] = copy.deepcopy(x)
while k > 1:
k //= 2
self.seg[k] = self.func(self.seg[2 * k], self.seg[2 * k + 1])
def query(self, a, b):
L = copy.deepcopy(self.I)
R = copy.deepcopy(self.I)
a += self.sz
b += self.sz
while a < b:
if a % 2 == 1:
L = self.func(L, self.seg[a])
a += 1
if b % 2 == 1:
b -= 1
R = self.func(self.seg[b], R)
a //= 2
b //= 2
return self.func(L, R)
N = int(eval(input()))
A = list(map(int, input().split()))
def f(x, y):
if x * y == 0:
return x + y
else:
return gcd(x, y)
seg = SegmentTree(N + 1, f, 0)
for i in range(N):
seg.assign(i, A[i])
seg.build()
ans = 1
for i in range(N):
ans = max(ans, f(seg.query(0, i), seg.query(i + 1, N)))
print(ans)
| import copy
class SegmentTree:
def __init__(self, N, func, I):
self.sz = N
self.func = func
self.I = copy.deepcopy(I)
self.seg = [copy.deepcopy(I) for i in range(self.sz * 2)]
def assign(self, k, x):
self.seg[k + self.sz] = copy.deepcopy(x)
def build(self):
for i in range(self.sz - 1, 0, -1):
self.seg[i] = self.func(self.seg[2 * i], self.seg[2 * i + 1])
def update(self, k, x):
k += self.sz
self.seg[k] = copy.deepcopy(x)
while k > 1:
k //= 2
self.seg[k] = self.func(self.seg[2 * k], self.seg[2 * k + 1])
def query(self, a, b):
L = copy.deepcopy(self.I)
R = copy.deepcopy(self.I)
a += self.sz
b += self.sz
while a < b:
if a % 2 == 1:
L = self.func(L, self.seg[a])
a += 1
if b % 2 == 1:
b -= 1
R = self.func(self.seg[b], R)
a //= 2
b //= 2
return self.func(L, R)
N = int(eval(input()))
a = list(map(int, input().split()))
from fractions import gcd
seg = SegmentTree(N, gcd, 0)
for i in range(N):
seg.assign(i, a[i])
seg.build()
ans = 1
for i in range(N):
ans = max(ans, gcd(seg.query(0, i), seg.query(i + 1, N)))
print(ans)
| false | 16.949153 | [
"-from fractions import gcd",
"- self.sz = 2 ** (N - 1).bit_length()",
"+ self.sz = N",
"-A = list(map(int, input().split()))",
"+a = list(map(int, input().split()))",
"+from fractions import gcd",
"-",
"-def f(x, y):",
"- if x * y == 0:",
"- return x + y",
"- else:",
... | false | 0.11925 | 0.15151 | 0.78708 | [
"s644038297",
"s429039297"
] |
u687053495 | p03088 | python | s064587742 | s316884995 | 43 | 37 | 3,316 | 3,444 | Accepted | Accepted | 13.95 |
mod = 1000000007
N = int(eval(input()))
dp = [ [[[0 for c3 in range(4)] for c2 in range(4)] for c1 in range(4)] for n in range(N+1)]
# 全部TのときはOK
dp[0][3][3][3] = 1
# 文字の数
for n in range(N):
# 後ろから1文字目
for c1 in range(4):
# 後ろから2文字目
for c2 in range(4):
# 後ろから3文字目
for c3 in range(4):
# 該当するものがないとき
if dp[n][c1][c2][c3] == 0: continue
# 新しく追加する文字
for a in range(4):
# AGCに当てはまる文字
if(c2 == 0 and c1 == 1 and a == 2): continue
if(c2 == 0 and c1 == 2 and a == 1): continue
if(c2 == 1 and c1 == 0 and a == 2): continue
if(c3 == 0 and c1 == 1 and a == 2): continue
if(c3 == 0 and c2 == 1 and a == 2): continue
dp[n+1][a][c1][c2] += dp[n][c1][c2][c3]
dp[n+1][a][c1][c2] %= mod
ans = 0
# 後ろから1文字目
for c1 in range(4):
# 後ろから2文字目
for c2 in range(4):
# 後ろから3文字目
for c3 in range(4):
ans += dp[N][c1][c2][c3]
ans %= mod
print(ans) | # DPをつかった解放を全然思いつけなかった
# 解説動画がわかりやすい
mod = 1000000007
N = int(eval(input()))
dp = [ [[[0 for c3 in range(4)] for c2 in range(4)] for c1 in range(4)] for n in range(N+1)]
# 全部TのときはOK
dp[0][3][3][3] = 1
# 文字の数
for n in range(N):
# 後ろから1文字目
for c1 in range(4):
# 後ろから2文字目
for c2 in range(4):
# 後ろから3文字目
for c3 in range(4):
# 該当するものがないとき
if dp[n][c1][c2][c3] == 0: continue
# 新しく追加する文字
for a in range(4):
# AGCに当てはまる文字
if(c2 == 0 and c1 == 1 and a == 2): continue
if(c2 == 0 and c1 == 2 and a == 1): continue
if(c2 == 1 and c1 == 0 and a == 2): continue
if(c3 == 0 and c1 == 1 and a == 2): continue
if(c3 == 0 and c2 == 1 and a == 2): continue
dp[n+1][a][c1][c2] += dp[n][c1][c2][c3]
ans = 0
# 後ろから1文字目
for c1 in range(4):
# 後ろから2文字目
for c2 in range(4):
# 後ろから3文字目
for c3 in range(4):
ans += dp[N][c1][c2][c3]
print((ans % mod)) | 43 | 43 | 1,022 | 1,012 | mod = 1000000007
N = int(eval(input()))
dp = [
[[[0 for c3 in range(4)] for c2 in range(4)] for c1 in range(4)]
for n in range(N + 1)
]
# 全部TのときはOK
dp[0][3][3][3] = 1
# 文字の数
for n in range(N):
# 後ろから1文字目
for c1 in range(4):
# 後ろから2文字目
for c2 in range(4):
# 後ろから3文字目
for c3 in range(4):
# 該当するものがないとき
if dp[n][c1][c2][c3] == 0:
continue
# 新しく追加する文字
for a in range(4):
# AGCに当てはまる文字
if c2 == 0 and c1 == 1 and a == 2:
continue
if c2 == 0 and c1 == 2 and a == 1:
continue
if c2 == 1 and c1 == 0 and a == 2:
continue
if c3 == 0 and c1 == 1 and a == 2:
continue
if c3 == 0 and c2 == 1 and a == 2:
continue
dp[n + 1][a][c1][c2] += dp[n][c1][c2][c3]
dp[n + 1][a][c1][c2] %= mod
ans = 0
# 後ろから1文字目
for c1 in range(4):
# 後ろから2文字目
for c2 in range(4):
# 後ろから3文字目
for c3 in range(4):
ans += dp[N][c1][c2][c3]
ans %= mod
print(ans)
| # DPをつかった解放を全然思いつけなかった
# 解説動画がわかりやすい
mod = 1000000007
N = int(eval(input()))
dp = [
[[[0 for c3 in range(4)] for c2 in range(4)] for c1 in range(4)]
for n in range(N + 1)
]
# 全部TのときはOK
dp[0][3][3][3] = 1
# 文字の数
for n in range(N):
# 後ろから1文字目
for c1 in range(4):
# 後ろから2文字目
for c2 in range(4):
# 後ろから3文字目
for c3 in range(4):
# 該当するものがないとき
if dp[n][c1][c2][c3] == 0:
continue
# 新しく追加する文字
for a in range(4):
# AGCに当てはまる文字
if c2 == 0 and c1 == 1 and a == 2:
continue
if c2 == 0 and c1 == 2 and a == 1:
continue
if c2 == 1 and c1 == 0 and a == 2:
continue
if c3 == 0 and c1 == 1 and a == 2:
continue
if c3 == 0 and c2 == 1 and a == 2:
continue
dp[n + 1][a][c1][c2] += dp[n][c1][c2][c3]
ans = 0
# 後ろから1文字目
for c1 in range(4):
# 後ろから2文字目
for c2 in range(4):
# 後ろから3文字目
for c3 in range(4):
ans += dp[N][c1][c2][c3]
print((ans % mod))
| false | 0 | [
"+# DPをつかった解放を全然思いつけなかった",
"+# 解説動画がわかりやすい",
"- dp[n + 1][a][c1][c2] %= mod",
"- ans %= mod",
"-print(ans)",
"+print((ans % mod))"
] | false | 0.101292 | 0.09488 | 1.067572 | [
"s064587742",
"s316884995"
] |
u936985471 | p02948 | python | s022581069 | s110358843 | 592 | 317 | 24,140 | 27,832 | Accepted | Accepted | 46.45 | n,m=list(map(int,input().split()))
tasks=[None]*n
for i in range(n):
a,b=list(map(int,input().split()))
tasks[i]=[a,b]
tasks=sorted(tasks,key=lambda x:x[0])
import heapq
que=[]
ans=0
heapq.heapify(que)
j=0
for i in range(m,-1,-1):
left=m-i
while j<len(tasks):
if tasks[j][0]<=left:
heapq.heappush(que, tasks[j][1]*(-1))
else:
break
j+=1
if len(que)>0:
val=heapq.heappop(que)*(-1)
ans+=val
print(ans)
| import sys
readline = sys.stdin.readline
# 逆順に見ていく
# A_iの値が小さい順にheapqに追加していく
N,M = list(map(int,readline().split()))
from collections import defaultdict
tasks = defaultdict(list)
for i in range(N):
a,b = list(map(int,readline().split()))
tasks[a].append(b)
import heapq
q = []
heapq.heapify(q)
ans = 0
for i in range(1,M + 1):
for task in tasks[i]:
heapq.heappush(q,-task)
if q:
t = heapq.heappop(q)
ans += (-t)
print(ans) | 25 | 25 | 462 | 460 | n, m = list(map(int, input().split()))
tasks = [None] * n
for i in range(n):
a, b = list(map(int, input().split()))
tasks[i] = [a, b]
tasks = sorted(tasks, key=lambda x: x[0])
import heapq
que = []
ans = 0
heapq.heapify(que)
j = 0
for i in range(m, -1, -1):
left = m - i
while j < len(tasks):
if tasks[j][0] <= left:
heapq.heappush(que, tasks[j][1] * (-1))
else:
break
j += 1
if len(que) > 0:
val = heapq.heappop(que) * (-1)
ans += val
print(ans)
| import sys
readline = sys.stdin.readline
# 逆順に見ていく
# A_iの値が小さい順にheapqに追加していく
N, M = list(map(int, readline().split()))
from collections import defaultdict
tasks = defaultdict(list)
for i in range(N):
a, b = list(map(int, readline().split()))
tasks[a].append(b)
import heapq
q = []
heapq.heapify(q)
ans = 0
for i in range(1, M + 1):
for task in tasks[i]:
heapq.heappush(q, -task)
if q:
t = heapq.heappop(q)
ans += -t
print(ans)
| false | 0 | [
"-n, m = list(map(int, input().split()))",
"-tasks = [None] * n",
"-for i in range(n):",
"- a, b = list(map(int, input().split()))",
"- tasks[i] = [a, b]",
"-tasks = sorted(tasks, key=lambda x: x[0])",
"+import sys",
"+",
"+readline = sys.stdin.readline",
"+# 逆順に見ていく",
"+# A_iの値が小さい順にheapq... | false | 0.061083 | 0.037978 | 1.608373 | [
"s022581069",
"s110358843"
] |
u557792847 | p02595 | python | s646051987 | s585848615 | 881 | 560 | 63,444 | 45,328 | Accepted | Accepted | 36.44 | import sys
import numpy as np
import math
import collections
import copy
from collections import deque
from functools import reduce
from itertools import product
from itertools import combinations
# input = sys.stdin.readline
N, D = list(map(int, input().split()))
zn = [list(map(int, input().split())) for _ in range(N)]
ans = 0
for z in zn:
x, y = z
kyo = np.sqrt(x**2 + y**2)
if (kyo <= D):
ans += 1
print(ans)
| N, D = list(map(int, input().split()))
Zn = [list(map(int, input().split())) for _ in range(N)]
ans = 0
for Z in Zn:
X, Y = Z
if (X**2 + Y**2 <= D**2):
ans += 1
print(ans) | 31 | 8 | 471 | 188 | import sys
import numpy as np
import math
import collections
import copy
from collections import deque
from functools import reduce
from itertools import product
from itertools import combinations
# input = sys.stdin.readline
N, D = list(map(int, input().split()))
zn = [list(map(int, input().split())) for _ in range(N)]
ans = 0
for z in zn:
x, y = z
kyo = np.sqrt(x**2 + y**2)
if kyo <= D:
ans += 1
print(ans)
| N, D = list(map(int, input().split()))
Zn = [list(map(int, input().split())) for _ in range(N)]
ans = 0
for Z in Zn:
X, Y = Z
if X**2 + Y**2 <= D**2:
ans += 1
print(ans)
| false | 74.193548 | [
"-import sys",
"-import numpy as np",
"-import math",
"-import collections",
"-import copy",
"-from collections import deque",
"-from functools import reduce",
"-from itertools import product",
"-from itertools import combinations",
"-",
"-# input = sys.stdin.readline",
"-zn = [list(map(int, i... | false | 0.214315 | 0.062447 | 3.431921 | [
"s646051987",
"s585848615"
] |
u498487134 | p03606 | python | s330240661 | s241737232 | 215 | 169 | 39,024 | 38,384 | Accepted | Accepted | 21.4 | #!/usr/bin/env pypy3
def I(): return int(eval(input()))
def MI(): return list(map(int, input().split()))
def LI(): return list(map(int, input().split()))
def main():
mod=10**9+7
N=I()
ans=0
for i in range(N):
l,r=MI()
ans+=r-l+1
print(ans)
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():
mod=10**9+7
N=I()
ans=0
for i in range(N):
l,r=MI()
ans+=(r-l)+1
print(ans)
main()
| 16 | 18 | 297 | 319 | #!/usr/bin/env pypy3
def I():
return int(eval(input()))
def MI():
return list(map(int, input().split()))
def LI():
return list(map(int, input().split()))
def main():
mod = 10**9 + 7
N = I()
ans = 0
for i in range(N):
l, r = MI()
ans += r - l + 1
print(ans)
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():
mod = 10**9 + 7
N = I()
ans = 0
for i in range(N):
l, r = MI()
ans += (r - l) + 1
print(ans)
main()
| false | 11.111111 | [
"-#!/usr/bin/env pypy3",
"+import sys",
"+",
"+input = sys.stdin.readline",
"+",
"+",
"- ans += r - l + 1",
"+ ans += (r - l) + 1"
] | false | 0.036567 | 0.037544 | 0.97396 | [
"s330240661",
"s241737232"
] |
u729133443 | p02972 | python | s394930096 | s465783620 | 428 | 242 | 81,920 | 11,648 | Accepted | Accepted | 43.46 | n,*a=list(map(int,open(0).read().split()))
b=[0]*-~n
for i in range(n,0,-1):b[i]=(sum(b[j]for j in range(i,n+1,i))+a[i-1])%2
c=[i for i in range(n+1)if b[i]]
print((len(c),*c)) | n,*a=list(map(int,open(0).read().split()))
for i in range(n,0,-1):a[i-1]=sum(a[i-1::i])%2
print((sum(a),*[i+1for i in range(n)if a[i]])) | 5 | 3 | 172 | 130 | n, *a = list(map(int, open(0).read().split()))
b = [0] * -~n
for i in range(n, 0, -1):
b[i] = (sum(b[j] for j in range(i, n + 1, i)) + a[i - 1]) % 2
c = [i for i in range(n + 1) if b[i]]
print((len(c), *c))
| n, *a = list(map(int, open(0).read().split()))
for i in range(n, 0, -1):
a[i - 1] = sum(a[i - 1 :: i]) % 2
print((sum(a), *[i + 1 for i in range(n) if a[i]]))
| false | 40 | [
"-b = [0] * -~n",
"- b[i] = (sum(b[j] for j in range(i, n + 1, i)) + a[i - 1]) % 2",
"-c = [i for i in range(n + 1) if b[i]]",
"-print((len(c), *c))",
"+ a[i - 1] = sum(a[i - 1 :: i]) % 2",
"+print((sum(a), *[i + 1 for i in range(n) if a[i]]))"
] | false | 0.036098 | 0.03641 | 0.991419 | [
"s394930096",
"s465783620"
] |
u416011173 | p02720 | python | s339402871 | s920620350 | 191 | 131 | 14,168 | 11,900 | Accepted | Accepted | 31.41 | # -*- coding: utf-8 -*-
# D - Lunlun Number
# 標準入力の取得
K = int(eval(input()))
# 求解
def get_lunlun_number_list(ln_list:list) -> list:
lunlun_number_list = []
for ln in ln_list:
one_place_value = ln % 10
lunlun_number_list.append(int(str(ln) + str(one_place_value)))
if one_place_value != 0:
lunlun_number_list.append(int(str(ln) + str(one_place_value-1)))
if one_place_value != 9:
lunlun_number_list.append(int(str(ln) + str(one_place_value+1)))
return lunlun_number_list
lunlun_number_list = []
lunlun_number_list1 = list(range(1, 10))
lunlun_number_list.extend(lunlun_number_list1)
lunlun_number_list2 = get_lunlun_number_list(lunlun_number_list1)
lunlun_number_list.extend(lunlun_number_list2)
lunlun_number_list3 = get_lunlun_number_list(lunlun_number_list2)
lunlun_number_list.extend(lunlun_number_list3)
lunlun_number_list4 = get_lunlun_number_list(lunlun_number_list3)
lunlun_number_list.extend(lunlun_number_list4)
lunlun_number_list5 = get_lunlun_number_list(lunlun_number_list4)
lunlun_number_list.extend(lunlun_number_list5)
lunlun_number_list6 = get_lunlun_number_list(lunlun_number_list5)
lunlun_number_list.extend(lunlun_number_list6)
lunlun_number_list7 = get_lunlun_number_list(lunlun_number_list6)
lunlun_number_list.extend(lunlun_number_list7)
lunlun_number_list8 = get_lunlun_number_list(lunlun_number_list7)
lunlun_number_list.extend(lunlun_number_list8)
lunlun_number_list9 = get_lunlun_number_list(lunlun_number_list8)
lunlun_number_list.extend(lunlun_number_list9)
lunlun_number_list10 = get_lunlun_number_list(lunlun_number_list9)
lunlun_number_list.extend(lunlun_number_list10)
lunlun_number_list = sorted(lunlun_number_list)
# 結果出力
print((lunlun_number_list[K-1])) | # -*- coding: utf-8 -*-
# D - Lunlun Number
# モジュールのインポート
from collections import deque
# 標準入力の取得
K = int(eval(input()))
# 求解処理
# 空のQueueを一つ用意し、1, 2, ・・・, 9を順にEnqueue
que = deque(list(range(1, 10)))
lunlun_number = 0
for k in range(K):
# Queueに対して、Dequeueを行う
x = que.popleft()
# x mod 10 ≠ 0なら、10x + (x mod 10) - 1をEnqueue
if x % 10 != 0:
que.append(10*x + (x%10) - 1)
# 10x + (x mod 10)をEnqueue
que.append(10*x + (x%10))
# x mod 10 ≠ 9なら、10x + (x mod 10) + 1をEnqueue
if x % 10 != 9:
que.append(10*x + (x%10) + 1)
# 上の操作をK回実施したときの値がLunlun Number
lunlun_number = x
print(lunlun_number) | 45 | 28 | 1,798 | 665 | # -*- coding: utf-8 -*-
# D - Lunlun Number
# 標準入力の取得
K = int(eval(input()))
# 求解
def get_lunlun_number_list(ln_list: list) -> list:
lunlun_number_list = []
for ln in ln_list:
one_place_value = ln % 10
lunlun_number_list.append(int(str(ln) + str(one_place_value)))
if one_place_value != 0:
lunlun_number_list.append(int(str(ln) + str(one_place_value - 1)))
if one_place_value != 9:
lunlun_number_list.append(int(str(ln) + str(one_place_value + 1)))
return lunlun_number_list
lunlun_number_list = []
lunlun_number_list1 = list(range(1, 10))
lunlun_number_list.extend(lunlun_number_list1)
lunlun_number_list2 = get_lunlun_number_list(lunlun_number_list1)
lunlun_number_list.extend(lunlun_number_list2)
lunlun_number_list3 = get_lunlun_number_list(lunlun_number_list2)
lunlun_number_list.extend(lunlun_number_list3)
lunlun_number_list4 = get_lunlun_number_list(lunlun_number_list3)
lunlun_number_list.extend(lunlun_number_list4)
lunlun_number_list5 = get_lunlun_number_list(lunlun_number_list4)
lunlun_number_list.extend(lunlun_number_list5)
lunlun_number_list6 = get_lunlun_number_list(lunlun_number_list5)
lunlun_number_list.extend(lunlun_number_list6)
lunlun_number_list7 = get_lunlun_number_list(lunlun_number_list6)
lunlun_number_list.extend(lunlun_number_list7)
lunlun_number_list8 = get_lunlun_number_list(lunlun_number_list7)
lunlun_number_list.extend(lunlun_number_list8)
lunlun_number_list9 = get_lunlun_number_list(lunlun_number_list8)
lunlun_number_list.extend(lunlun_number_list9)
lunlun_number_list10 = get_lunlun_number_list(lunlun_number_list9)
lunlun_number_list.extend(lunlun_number_list10)
lunlun_number_list = sorted(lunlun_number_list)
# 結果出力
print((lunlun_number_list[K - 1]))
| # -*- coding: utf-8 -*-
# D - Lunlun Number
# モジュールのインポート
from collections import deque
# 標準入力の取得
K = int(eval(input()))
# 求解処理
# 空のQueueを一つ用意し、1, 2, ・・・, 9を順にEnqueue
que = deque(list(range(1, 10)))
lunlun_number = 0
for k in range(K):
# Queueに対して、Dequeueを行う
x = que.popleft()
# x mod 10 ≠ 0なら、10x + (x mod 10) - 1をEnqueue
if x % 10 != 0:
que.append(10 * x + (x % 10) - 1)
# 10x + (x mod 10)をEnqueue
que.append(10 * x + (x % 10))
# x mod 10 ≠ 9なら、10x + (x mod 10) + 1をEnqueue
if x % 10 != 9:
que.append(10 * x + (x % 10) + 1)
# 上の操作をK回実施したときの値がLunlun Number
lunlun_number = x
print(lunlun_number)
| false | 37.777778 | [
"+# モジュールのインポート",
"+from collections import deque",
"+",
"-# 求解",
"-def get_lunlun_number_list(ln_list: list) -> list:",
"- lunlun_number_list = []",
"- for ln in ln_list:",
"- one_place_value = ln % 10",
"- lunlun_number_list.append(int(str(ln) + str(one_place_value)))",
"- ... | false | 0.210483 | 0.058048 | 3.626025 | [
"s339402871",
"s920620350"
] |
u340781749 | p02758 | python | s522897138 | s863150173 | 1,259 | 663 | 122,308 | 45,432 | Accepted | Accepted | 47.34 | import sys
from bisect import bisect_left
from operator import itemgetter
class SegTreeMax:
"""
以下のクエリを処理する
1.update: i番目の値をxに更新する
2.get_min: 区間[l, r)の最小値を得る
"""
def __init__(self, n, INF):
"""
:param n: 要素数
:param INF: 初期値（入りうる要素より十分に大きな数）
"""
n2 = 1 << (n - 1).bit_length()
self.offset = n2
self.tree = [INF] * (n2 << 1)
self.INF = INF
def initialize(self, arr):
for i, v in enumerate(arr, start=self.offset):
self.tree[i] = v
for i in range(self.offset - 1, 0, -1):
j = i << 1
self.tree[i] = max(self.tree[j], self.tree[j + 1])
def update(self, i, x):
"""
i番目の値をxに更新
:param i: index(0-indexed)
:param x: update value
"""
i += self.offset
self.tree[i] = x
while i > 1:
y = self.tree[i ^ 1]
if y >= x:
break
i >>= 1
self.tree[i] = x
def get_max(self, a, b):
"""
[a, b)の最大値を得る
:param a: index(0-indexed)
:param b: index(0-indexed)
"""
result = self.INF
l = a + self.offset
r = b + self.offset
while l < r:
if r & 1:
result = max(result, self.tree[r - 1])
if l & 1:
result = max(result, self.tree[l])
l += 1
l >>= 1
r >>= 1
return result
n, *xd = list(map(int, sys.stdin.buffer.read().split()))
MOD = 998244353
xd = sorted(zip(xd[0::2], xd[1::2]))
xxx = list(map(itemgetter(0), xd))
ans = [0] * (n + 1)
skip = list(range(1, n + 1))
ans[n] = 1
sgt = SegTreeMax(n + 1, 0)
sgt.initialize(list(range(1, n + 2)))
for i in range(n - 1, -1, -1):
x, d = xd[i]
r = x + d
j = bisect_left(xxx, r)
k = sgt.get_max(i, j)
ans[i] = (ans[i + 1] + ans[k]) % MOD
sgt.update(i, k)
print((ans[0]))
| import sys
from operator import itemgetter
n, *xd = list(map(int, sys.stdin.buffer.read().split()))
MOD = 998244353
xd = sorted(zip(xd[0::2], xd[1::2]))
xxx = list(map(itemgetter(0), xd)) + [10 ** 10]
ans = [0] * n + [1]
stack = [n]
for i in range(n - 1, -1, -1):
x, d = xd[i]
r = x + d
while r > xxx[stack[-1]]:
stack.pop()
ans[i] = (ans[i + 1] + ans[stack[-1]]) % MOD
stack.append(i)
print((ans[0]))
| 83 | 18 | 2,042 | 441 | import sys
from bisect import bisect_left
from operator import itemgetter
class SegTreeMax:
"""
以下のクエリを処理する
1.update: i番目の値をxに更新する
2.get_min: 区間[l, r)の最小値を得る
"""
def __init__(self, n, INF):
"""
:param n: 要素数
:param INF: 初期値（入りうる要素より十分に大きな数）
"""
n2 = 1 << (n - 1).bit_length()
self.offset = n2
self.tree = [INF] * (n2 << 1)
self.INF = INF
def initialize(self, arr):
for i, v in enumerate(arr, start=self.offset):
self.tree[i] = v
for i in range(self.offset - 1, 0, -1):
j = i << 1
self.tree[i] = max(self.tree[j], self.tree[j + 1])
def update(self, i, x):
"""
i番目の値をxに更新
:param i: index(0-indexed)
:param x: update value
"""
i += self.offset
self.tree[i] = x
while i > 1:
y = self.tree[i ^ 1]
if y >= x:
break
i >>= 1
self.tree[i] = x
def get_max(self, a, b):
"""
[a, b)の最大値を得る
:param a: index(0-indexed)
:param b: index(0-indexed)
"""
result = self.INF
l = a + self.offset
r = b + self.offset
while l < r:
if r & 1:
result = max(result, self.tree[r - 1])
if l & 1:
result = max(result, self.tree[l])
l += 1
l >>= 1
r >>= 1
return result
n, *xd = list(map(int, sys.stdin.buffer.read().split()))
MOD = 998244353
xd = sorted(zip(xd[0::2], xd[1::2]))
xxx = list(map(itemgetter(0), xd))
ans = [0] * (n + 1)
skip = list(range(1, n + 1))
ans[n] = 1
sgt = SegTreeMax(n + 1, 0)
sgt.initialize(list(range(1, n + 2)))
for i in range(n - 1, -1, -1):
x, d = xd[i]
r = x + d
j = bisect_left(xxx, r)
k = sgt.get_max(i, j)
ans[i] = (ans[i + 1] + ans[k]) % MOD
sgt.update(i, k)
print((ans[0]))
| import sys
from operator import itemgetter
n, *xd = list(map(int, sys.stdin.buffer.read().split()))
MOD = 998244353
xd = sorted(zip(xd[0::2], xd[1::2]))
xxx = list(map(itemgetter(0), xd)) + [10**10]
ans = [0] * n + [1]
stack = [n]
for i in range(n - 1, -1, -1):
x, d = xd[i]
r = x + d
while r > xxx[stack[-1]]:
stack.pop()
ans[i] = (ans[i + 1] + ans[stack[-1]]) % MOD
stack.append(i)
print((ans[0]))
| false | 78.313253 | [
"-from bisect import bisect_left",
"-",
"-",
"-class SegTreeMax:",
"- \"\"\"",
"- 以下のクエリを処理する",
"- 1.update: i番目の値をxに更新する",
"- 2.get_min: 区間[l, r)の最小値を得る",
"- \"\"\"",
"-",
"- def __init__(self, n, INF):",
"- \"\"\"",
"- :param n: 要素数",
"- :param INF... | false | 0.115626 | 0.044221 | 2.614756 | [
"s522897138",
"s863150173"
] |
u483331319 | p02832 | python | s049876938 | s837950984 | 506 | 106 | 26,140 | 26,268 | Accepted | Accepted | 79.05 | import sys
input = sys.stdin.readline
N = int(input().rstrip())
a = list(map(int, input().rstrip().split()))
# print(a)
if not 1 in a:
print((-1))
exit()
def check(n):
for i in range(N):
if a[-1-i] == n:
n -= 1
return n == 0
r = N
left = 1
right = N
for _ in range(N):
if (right - left) <= 2:
if check(right):
r = right
break
elif check(right-1):
r = right - 1
break
else:
r = right - 2
break
t = (left + right) // 2
if check(t):
left = t
else:
right = t
print((N-r)) | import sys
input = sys.stdin.readline
N = int(input().rstrip())
a = list(map(int, input().rstrip().split()))
# print(a)
if not 1 in a:
print((-1))
exit()
ans = 1
for i in range(N):
if a[i] == ans:
ans += 1
print((N-ans+1))
| 38 | 17 | 587 | 249 | import sys
input = sys.stdin.readline
N = int(input().rstrip())
a = list(map(int, input().rstrip().split()))
# print(a)
if not 1 in a:
print((-1))
exit()
def check(n):
for i in range(N):
if a[-1 - i] == n:
n -= 1
return n == 0
r = N
left = 1
right = N
for _ in range(N):
if (right - left) <= 2:
if check(right):
r = right
break
elif check(right - 1):
r = right - 1
break
else:
r = right - 2
break
t = (left + right) // 2
if check(t):
left = t
else:
right = t
print((N - r))
| import sys
input = sys.stdin.readline
N = int(input().rstrip())
a = list(map(int, input().rstrip().split()))
# print(a)
if not 1 in a:
print((-1))
exit()
ans = 1
for i in range(N):
if a[i] == ans:
ans += 1
print((N - ans + 1))
| false | 55.263158 | [
"-",
"-",
"-def check(n):",
"- for i in range(N):",
"- if a[-1 - i] == n:",
"- n -= 1",
"- return n == 0",
"-",
"-",
"-r = N",
"-left = 1",
"-right = N",
"-for _ in range(N):",
"- if (right - left) <= 2:",
"- if check(right):",
"- r = right"... | false | 0.039944 | 0.039176 | 1.019606 | [
"s049876938",
"s837950984"
] |
u644907318 | p02837 | python | s404074930 | s344218966 | 245 | 186 | 44,656 | 75,444 | Accepted | Accepted | 24.08 | from itertools import product
N = int(eval(input()))
G = {i:[] for i in range(1,N+1)}
for i in range(1,N+1):
K = int(eval(input()))
for j in range(K):
G[i].append(list(map(int,input().split())))
cmax = 0
for z in product((0,1),repeat=N):
flag = 0
for i in range(N):
if z[i]==1:
ind = i+1
for [x,y] in G[ind]:
if z[x-1]==y:continue
else:
flag=1
break
if flag==1:
break
if flag==0:
cmax = max(cmax,sum(z))
print(cmax) | from itertools import product
N = int(eval(input()))
G = {i:[] for i in range(1,N+1)}
for i in range(1,N+1):
a = int(eval(input()))
G[i] = [list(map(int,input().split())) for _ in range(a)]
cmax = 0
for z in product((0,1),repeat=N+1):
if z[0]==0:
X = []
for i in range(1,N+1):
if z[i]==1:
X.append(i)
A = []
B = []
for i in X:
for x,y in G[i]:
if y==1:
A.append(x)
else:
B.append(x)
flag = 0
for a in A:
if a not in X:
flag = 1
break
for b in B:
if b in X:
flag = 1
break
if flag==0:
cmax = max(cmax,sum(z[1:]))
print(cmax) | 23 | 33 | 593 | 839 | from itertools import product
N = int(eval(input()))
G = {i: [] for i in range(1, N + 1)}
for i in range(1, N + 1):
K = int(eval(input()))
for j in range(K):
G[i].append(list(map(int, input().split())))
cmax = 0
for z in product((0, 1), repeat=N):
flag = 0
for i in range(N):
if z[i] == 1:
ind = i + 1
for [x, y] in G[ind]:
if z[x - 1] == y:
continue
else:
flag = 1
break
if flag == 1:
break
if flag == 0:
cmax = max(cmax, sum(z))
print(cmax)
| from itertools import product
N = int(eval(input()))
G = {i: [] for i in range(1, N + 1)}
for i in range(1, N + 1):
a = int(eval(input()))
G[i] = [list(map(int, input().split())) for _ in range(a)]
cmax = 0
for z in product((0, 1), repeat=N + 1):
if z[0] == 0:
X = []
for i in range(1, N + 1):
if z[i] == 1:
X.append(i)
A = []
B = []
for i in X:
for x, y in G[i]:
if y == 1:
A.append(x)
else:
B.append(x)
flag = 0
for a in A:
if a not in X:
flag = 1
break
for b in B:
if b in X:
flag = 1
break
if flag == 0:
cmax = max(cmax, sum(z[1:]))
print(cmax)
| false | 30.30303 | [
"- K = int(eval(input()))",
"- for j in range(K):",
"- G[i].append(list(map(int, input().split())))",
"+ a = int(eval(input()))",
"+ G[i] = [list(map(int, input().split())) for _ in range(a)]",
"-for z in product((0, 1), repeat=N):",
"- flag = 0",
"- for i in range(N):",
"- ... | false | 0.036801 | 0.034752 | 1.058964 | [
"s404074930",
"s344218966"
] |
u653837719 | p02702 | python | s751317300 | s121665958 | 135 | 113 | 16,180 | 9,288 | Accepted | Accepted | 16.3 | s = eval(input())
l = len(s)
t = [0] * l
t[l - 1] = int(s[l - 1])
m = [0] * 2019
m[0] = 1
m[int(s[l - 1])] = 1
ten = 10
ans = 0
for i in range(l - 1, 0, -1):
t[i - 1] = (t[i] + int(s[i - 1]) * ten) % 2019
ten = ten * 10 % 2019
m[t[i - 1]] += 1
for i in m:
ans += i * (i - 1) // 2
print(ans) | s = input()[::-1]
l = len(s)
c = [0] * 2019
c[0] = 1
ten = 1
mod = 0
ans = 0
for i in range(l):
mod = (mod + int(s[i]) * ten) % 2019
ten = ten * 10 % 2019
c[mod] += 1
for i in c:
ans += i * (i - 1) // 2
print(ans) | 19 | 17 | 321 | 248 | s = eval(input())
l = len(s)
t = [0] * l
t[l - 1] = int(s[l - 1])
m = [0] * 2019
m[0] = 1
m[int(s[l - 1])] = 1
ten = 10
ans = 0
for i in range(l - 1, 0, -1):
t[i - 1] = (t[i] + int(s[i - 1]) * ten) % 2019
ten = ten * 10 % 2019
m[t[i - 1]] += 1
for i in m:
ans += i * (i - 1) // 2
print(ans)
| s = input()[::-1]
l = len(s)
c = [0] * 2019
c[0] = 1
ten = 1
mod = 0
ans = 0
for i in range(l):
mod = (mod + int(s[i]) * ten) % 2019
ten = ten * 10 % 2019
c[mod] += 1
for i in c:
ans += i * (i - 1) // 2
print(ans)
| false | 10.526316 | [
"-s = eval(input())",
"+s = input()[::-1]",
"-t = [0] * l",
"-t[l - 1] = int(s[l - 1])",
"-m = [0] * 2019",
"-m[0] = 1",
"-m[int(s[l - 1])] = 1",
"-ten = 10",
"+c = [0] * 2019",
"+c[0] = 1",
"+ten = 1",
"+mod = 0",
"-for i in range(l - 1, 0, -1):",
"- t[i - 1] = (t[i] + int(s[i - 1]) * ... | false | 0.036438 | 0.035739 | 1.019573 | [
"s751317300",
"s121665958"
] |
u667024514 | p03457 | python | s206981518 | s667477526 | 444 | 382 | 3,064 | 3,060 | Accepted | Accepted | 13.96 | n = int(eval(input()))
x = 0
y = 0
time = 0
for i in range(n):
m = list(map(int,input().split()))
if (m[0]-time)>=abs(m[1]-x)+abs(m[2]-y):
if ((m[0]-time) -(abs(m[1]-x) + abs(m[2]-y)))%2 ==0:
x = m[1]
y = m[2]
time = m[0]
if i == n-1:
print("Yes")
else:
print("No")
break
else:
print("No")
break | a = int(eval(input()))
x = 0
y = 0
time = 0
for i in range(a):
aa,b,c = list(map(int,input().split()))
if (abs(b-x) + abs(c-y)) %2 == (aa - time)%2 and abs(b-x) + abs(c-y) <= aa - time:
x = b
y = c
time = aa
else:
print("No")
break
if i == a-1:
print("Yes") | 19 | 15 | 439 | 323 | n = int(eval(input()))
x = 0
y = 0
time = 0
for i in range(n):
m = list(map(int, input().split()))
if (m[0] - time) >= abs(m[1] - x) + abs(m[2] - y):
if ((m[0] - time) - (abs(m[1] - x) + abs(m[2] - y))) % 2 == 0:
x = m[1]
y = m[2]
time = m[0]
if i == n - 1:
print("Yes")
else:
print("No")
break
else:
print("No")
break
| a = int(eval(input()))
x = 0
y = 0
time = 0
for i in range(a):
aa, b, c = list(map(int, input().split()))
if (abs(b - x) + abs(c - y)) % 2 == (aa - time) % 2 and abs(b - x) + abs(
c - y
) <= aa - time:
x = b
y = c
time = aa
else:
print("No")
break
if i == a - 1:
print("Yes")
| false | 21.052632 | [
"-n = int(eval(input()))",
"+a = int(eval(input()))",
"-for i in range(n):",
"- m = list(map(int, input().split()))",
"- if (m[0] - time) >= abs(m[1] - x) + abs(m[2] - y):",
"- if ((m[0] - time) - (abs(m[1] - x) + abs(m[2] - y))) % 2 == 0:",
"- x = m[1]",
"- y = m[2]... | false | 0.057227 | 0.047354 | 1.208499 | [
"s206981518",
"s667477526"
] |
u906428167 | p03283 | python | s111811286 | s377459389 | 1,793 | 578 | 60,120 | 57,820 | Accepted | Accepted | 67.76 | n, m, q = list(map(int, input().split()))
train = [[0 for _ in range(n+1)] for __ in range(n+1)]
for _ in range(m):
l, r = list(map(int, input().split()))
train[l][r] += 1
ans = [[0 for _ in range(n+1)] for __ in range(n+1)]
for i in range(n):
for j in range(n+1):
ans[i+1][j] = ans[i][j] + train[i+1][j]
for j in range(n):
for i in range(n+1):
ans[i][j+1] = ans[i][j+1] + ans[i][j]
for __ in range(q):
p, q = list(map(int, input().split()))
print((ans[q][q] - ans[q][p-1] - ans[p-1][q] + ans[p-1][p-1])) | import sys
sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline
n, m, q = list(map(int, input().split()))
train = [[0 for _ in range(n)] for __ in range(n)]
for _ in range(m):
l, r = list(map(int, input().split()))
train[l-1][r-1] += 1
ans = [[0 for _ in range(n+1)] for __ in range(n+1)]
for i in range(n):
for j in range(1, n+1):
ans[i+1][j] = ans[i][j] + train[i][j-1]
for j in range(n):
for i in range(n+1):
ans[i][j+1] = ans[i][j+1] + ans[i][j]
for __ in range(q):
p, q = list(map(int, input().split()))
print((ans[q][q] - ans[q][p-1] - ans[p-1][q] + ans[p-1][p-1]))
| 21 | 25 | 550 | 628 | n, m, q = list(map(int, input().split()))
train = [[0 for _ in range(n + 1)] for __ in range(n + 1)]
for _ in range(m):
l, r = list(map(int, input().split()))
train[l][r] += 1
ans = [[0 for _ in range(n + 1)] for __ in range(n + 1)]
for i in range(n):
for j in range(n + 1):
ans[i + 1][j] = ans[i][j] + train[i + 1][j]
for j in range(n):
for i in range(n + 1):
ans[i][j + 1] = ans[i][j + 1] + ans[i][j]
for __ in range(q):
p, q = list(map(int, input().split()))
print((ans[q][q] - ans[q][p - 1] - ans[p - 1][q] + ans[p - 1][p - 1]))
| import sys
sys.setrecursionlimit(10**7)
input = sys.stdin.readline
n, m, q = list(map(int, input().split()))
train = [[0 for _ in range(n)] for __ in range(n)]
for _ in range(m):
l, r = list(map(int, input().split()))
train[l - 1][r - 1] += 1
ans = [[0 for _ in range(n + 1)] for __ in range(n + 1)]
for i in range(n):
for j in range(1, n + 1):
ans[i + 1][j] = ans[i][j] + train[i][j - 1]
for j in range(n):
for i in range(n + 1):
ans[i][j + 1] = ans[i][j + 1] + ans[i][j]
for __ in range(q):
p, q = list(map(int, input().split()))
print((ans[q][q] - ans[q][p - 1] - ans[p - 1][q] + ans[p - 1][p - 1]))
| false | 16 | [
"+import sys",
"+",
"+sys.setrecursionlimit(10**7)",
"+input = sys.stdin.readline",
"-train = [[0 for _ in range(n + 1)] for __ in range(n + 1)]",
"+train = [[0 for _ in range(n)] for __ in range(n)]",
"- train[l][r] += 1",
"+ train[l - 1][r - 1] += 1",
"- for j in range(n + 1):",
"- ... | false | 0.084887 | 0.03604 | 2.355327 | [
"s111811286",
"s377459389"
] |
u506858457 | p02678 | python | s228004264 | s040637782 | 703 | 642 | 33,984 | 34,804 | Accepted | Accepted | 8.68 | from collections import deque
N,M=list(map(int,input().split()))
ab=[[] for i in range(N+1)]
for i in range(M):
a,b=list(map(int,input().split()))
ab[a].append(b)
ab[b].append(a)
ans=[-1]*(N+1)
que=deque([1])
while que:
q=que.popleft()
for i in ab[q]:
if ans[i]==-1:
que.append(i)
ans[i]=q
print('Yes')
for i in range(2,N+1):
print((ans[i])) | import collections
n,m=list(map(int,input().split()))
g=[[] for _ in range(n+1)]
for _ in range(m):
a,b=list(map(int,input().split()))
g[a].append(b)
g[b].append(a)
q=collections.deque()
q.append(1)
check=[0]*(n+1)
check[1]=1
ans=[0]*(n+1)
while len(q)!=0:
v=q.popleft()
for u in g[v]:
if check[u]==0: #まだ探索していない頂点について、その頂点に親の頂点に移動する道しるべを置く
check[u]=1
ans[u]=v
q.append(u)
print('Yes')
for i in range(2,n+1):
print((ans[i])) | 18 | 23 | 372 | 467 | from collections import deque
N, M = list(map(int, input().split()))
ab = [[] for i in range(N + 1)]
for i in range(M):
a, b = list(map(int, input().split()))
ab[a].append(b)
ab[b].append(a)
ans = [-1] * (N + 1)
que = deque([1])
while que:
q = que.popleft()
for i in ab[q]:
if ans[i] == -1:
que.append(i)
ans[i] = q
print("Yes")
for i in range(2, N + 1):
print((ans[i]))
| import collections
n, m = list(map(int, input().split()))
g = [[] for _ in range(n + 1)]
for _ in range(m):
a, b = list(map(int, input().split()))
g[a].append(b)
g[b].append(a)
q = collections.deque()
q.append(1)
check = [0] * (n + 1)
check[1] = 1
ans = [0] * (n + 1)
while len(q) != 0:
v = q.popleft()
for u in g[v]:
if check[u] == 0: # まだ探索していない頂点について、その頂点に親の頂点に移動する道しるべを置く
check[u] = 1
ans[u] = v
q.append(u)
print("Yes")
for i in range(2, n + 1):
print((ans[i]))
| false | 21.73913 | [
"-from collections import deque",
"+import collections",
"-N, M = list(map(int, input().split()))",
"-ab = [[] for i in range(N + 1)]",
"-for i in range(M):",
"+n, m = list(map(int, input().split()))",
"+g = [[] for _ in range(n + 1)]",
"+for _ in range(m):",
"- ab[a].append(b)",
"- ab[b].ap... | false | 0.042161 | 0.040957 | 1.029391 | [
"s228004264",
"s040637782"
] |
u729133443 | p02844 | python | s883492336 | s708626613 | 778 | 660 | 3,060 | 3,188 | Accepted | Accepted | 15.17 | _,s=open(0)
x,y,z=eval('set(),'*3)
for c in s[:-1]:
for t in y:z.add(t+c)
for t in x:y.add(t+c)
x.add(c)
print((len(z))) | _,s=open(0)
x,y,z=eval('set(),'*3)
for c in s[:-1]:
z|={t+c for t in y}
y|={t+c for t in x}
x|={c}
print((len(z))) | 7 | 7 | 130 | 124 | _, s = open(0)
x, y, z = eval("set()," * 3)
for c in s[:-1]:
for t in y:
z.add(t + c)
for t in x:
y.add(t + c)
x.add(c)
print((len(z)))
| _, s = open(0)
x, y, z = eval("set()," * 3)
for c in s[:-1]:
z |= {t + c for t in y}
y |= {t + c for t in x}
x |= {c}
print((len(z)))
| false | 0 | [
"- for t in y:",
"- z.add(t + c)",
"- for t in x:",
"- y.add(t + c)",
"- x.add(c)",
"+ z |= {t + c for t in y}",
"+ y |= {t + c for t in x}",
"+ x |= {c}"
] | false | 0.060716 | 0.036754 | 1.651953 | [
"s883492336",
"s708626613"
] |
u706414019 | p02683 | python | s683212881 | s727539725 | 703 | 182 | 27,308 | 26,596 | Accepted | Accepted | 74.11 | import itertools
import numpy as np
N,M,X = list(map(int,input().split()))
ca = ([list(map(int,input().split())) for _ in range(N)])
ca = np.array(ca)
sumX = sum(ca)[1:]
sumcos = sum(ca)[0]
cost = sumcos
if sum(sumX>=X)<M:
print((-1))
else:
for j in range(1,N+1):
for a in itertools.combinations(list(range(1,N+1)),j):
x = sum(ca)[1:]
fx = np.array([0]*M)
c = sumcos
for i in range(len(a)):
x -= ca[a[i]-1][1:]
c -= ca[a[i]-1][0]
if sum(x>=X)<M:
break
else:
cost = min(c,cost)
print(cost)
| import sys
import numpy as np
input = sys.stdin.readline
N,M,X = list(map(int,input().split()))
CA = [ list(map(int,input().split())) for _ in range(N)]
bit = 2**N
cost = float('inf')
for bi in range(1,bit):
tmp=[]
for i in range(N):
if bi & 1<<i:
tmp.append(CA[i-1])
tmp = np.array(tmp)
a = sum(tmp)
if all( [a[j]>=X for j in range(1,M+1)]):
cost = min(cost,a[0])
print(( -1 if cost == float('inf') else cost))
| 25 | 19 | 680 | 486 | import itertools
import numpy as np
N, M, X = list(map(int, input().split()))
ca = [list(map(int, input().split())) for _ in range(N)]
ca = np.array(ca)
sumX = sum(ca)[1:]
sumcos = sum(ca)[0]
cost = sumcos
if sum(sumX >= X) < M:
print((-1))
else:
for j in range(1, N + 1):
for a in itertools.combinations(list(range(1, N + 1)), j):
x = sum(ca)[1:]
fx = np.array([0] * M)
c = sumcos
for i in range(len(a)):
x -= ca[a[i] - 1][1:]
c -= ca[a[i] - 1][0]
if sum(x >= X) < M:
break
else:
cost = min(c, cost)
print(cost)
| import sys
import numpy as np
input = sys.stdin.readline
N, M, X = list(map(int, input().split()))
CA = [list(map(int, input().split())) for _ in range(N)]
bit = 2**N
cost = float("inf")
for bi in range(1, bit):
tmp = []
for i in range(N):
if bi & 1 << i:
tmp.append(CA[i - 1])
tmp = np.array(tmp)
a = sum(tmp)
if all([a[j] >= X for j in range(1, M + 1)]):
cost = min(cost, a[0])
print((-1 if cost == float("inf") else cost))
| false | 24 | [
"-import itertools",
"+import sys",
"+input = sys.stdin.readline",
"-ca = [list(map(int, input().split())) for _ in range(N)]",
"-ca = np.array(ca)",
"-sumX = sum(ca)[1:]",
"-sumcos = sum(ca)[0]",
"-cost = sumcos",
"-if sum(sumX >= X) < M:",
"- print((-1))",
"-else:",
"- for j in range(1... | false | 0.23514 | 0.007801 | 30.142418 | [
"s683212881",
"s727539725"
] |
u559994901 | p02724 | python | s491358159 | s987711934 | 470 | 17 | 2,940 | 2,940 | Accepted | Accepted | 96.38 | X =eval(input())
X=int(X)
point =0
while X>=5:
if X>=500:
X-=500
point+=1000
elif 5<=X<500:
X-=5
point+=5
print(point) | X =int(eval(input()))
a =int(X/500)
b=int((X%500)/5)
print((1000*a+5*b))
| 12 | 5 | 164 | 77 | X = eval(input())
X = int(X)
point = 0
while X >= 5:
if X >= 500:
X -= 500
point += 1000
elif 5 <= X < 500:
X -= 5
point += 5
print(point)
| X = int(eval(input()))
a = int(X / 500)
b = int((X % 500) / 5)
print((1000 * a + 5 * b))
| false | 58.333333 | [
"-X = eval(input())",
"-X = int(X)",
"-point = 0",
"-while X >= 5:",
"- if X >= 500:",
"- X -= 500",
"- point += 1000",
"- elif 5 <= X < 500:",
"- X -= 5",
"- point += 5",
"-print(point)",
"+X = int(eval(input()))",
"+a = int(X / 500)",
"+b = int((X % 500)... | false | 0.254731 | 0.035675 | 7.14029 | [
"s491358159",
"s987711934"
] |
u076917070 | p03044 | python | s367141354 | s092482294 | 1,014 | 934 | 95,136 | 156,208 | Accepted | Accepted | 7.89 | import sys
import heapq
input = sys.stdin.readline
def dijkstra(s, n, edge):
d = [float("inf")] * n
d[s] = 0
q = []
for e in edge[s]:
heapq.heappush(q, e)
while q:
minedge = heapq.heappop(q)
v = minedge[1]
if d[v] < minedge[0]:
continue
d[v] = minedge[0]
for e in edge[v]:
heapq.heappush(q, [e[0]+d[v], e[1]])
return d
def main():
N = int(eval(input()))
E = [[] for _ in range(N)]
for _ in range(N-1):
u, v, w = list(map(int, input().split()))
E[u-1].append([w, v-1])
E[v-1].append([w, u-1])
D = dijkstra(0, N, E)
for d in D:
print((d % 2))
if __name__ == '__main__':
main()
| import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**5)
N = int(eval(input()))
G = [[] for _ in range(N)]
for _ in range(N-1):
u, v, w = list(map(int, input().split()))
G[u-1].append([v-1, w])
G[v-1].append([u-1, w])
ans = [0]*N
def dfs(v, p, c):
global ans
ans[v] = c
for e in G[v]:
nv, cost = e
if nv == p:
continue
if (cost % 2) == 0:
dfs(nv, v, c)
else:
dfs(nv, v, (c+1) % 2)
def main():
dfs(0, -1, 0)
for c in ans:
print(c)
if __name__ == '__main__':
main()
| 36 | 35 | 754 | 616 | import sys
import heapq
input = sys.stdin.readline
def dijkstra(s, n, edge):
d = [float("inf")] * n
d[s] = 0
q = []
for e in edge[s]:
heapq.heappush(q, e)
while q:
minedge = heapq.heappop(q)
v = minedge[1]
if d[v] < minedge[0]:
continue
d[v] = minedge[0]
for e in edge[v]:
heapq.heappush(q, [e[0] + d[v], e[1]])
return d
def main():
N = int(eval(input()))
E = [[] for _ in range(N)]
for _ in range(N - 1):
u, v, w = list(map(int, input().split()))
E[u - 1].append([w, v - 1])
E[v - 1].append([w, u - 1])
D = dijkstra(0, N, E)
for d in D:
print((d % 2))
if __name__ == "__main__":
main()
| import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**5)
N = int(eval(input()))
G = [[] for _ in range(N)]
for _ in range(N - 1):
u, v, w = list(map(int, input().split()))
G[u - 1].append([v - 1, w])
G[v - 1].append([u - 1, w])
ans = [0] * N
def dfs(v, p, c):
global ans
ans[v] = c
for e in G[v]:
nv, cost = e
if nv == p:
continue
if (cost % 2) == 0:
dfs(nv, v, c)
else:
dfs(nv, v, (c + 1) % 2)
def main():
dfs(0, -1, 0)
for c in ans:
print(c)
if __name__ == "__main__":
main()
| false | 2.777778 | [
"-import heapq",
"+sys.setrecursionlimit(10**5)",
"+N = int(eval(input()))",
"+G = [[] for _ in range(N)]",
"+for _ in range(N - 1):",
"+ u, v, w = list(map(int, input().split()))",
"+ G[u - 1].append([v - 1, w])",
"+ G[v - 1].append([u - 1, w])",
"+ans = [0] * N",
"-def dijkstra(s, n, ed... | false | 0.047918 | 0.125642 | 0.381389 | [
"s367141354",
"s092482294"
] |
u372144784 | p02631 | python | s889844526 | s246410267 | 256 | 153 | 98,524 | 111,704 | Accepted | Accepted | 40.23 | import sys
readline = sys.stdin.buffer.readline
def even(n): return 1 if n%2==0 else 0
"""
全員が自分以外の全員のxorを把握しているので、全員の値を求めよ
nは偶数
桁ごとに独立に考える。
テストケースで検証すると、
その桁において1の数が偶数個の場合は、自分自身の桁の数字を入れる
奇数個の場合は、自分自身の桁の値をbit反転したものを入れる
ことが正解であることが分かる。
これを実装するだけ。
"""
n = int(readline())
lst1 = list(map(int,readline().split()))
limit = 33 #制約10**9は2**32内に収まる。
ans = []
parity = [0]*limit
for i in lst1:
for j in range(limit):
parity[j] += i>>j
for i in range(limit):
parity[i] %= 2
for i in lst1:
res = 0
for j in range(limit):
p = i>>j&1
if parity[j]== 0 and p== 1:
res += 1<<j
elif parity[j] == 1 and p == 0:
res += 1<<j
ans.append(res)
print((*ans)) | import sys
readline = sys.stdin.buffer.readline
def even(n): return 1 if n%2==0 else 0
"""
全員が自分以外の全員のxorを把握しているので、全員の値を求めよ
nは偶数
桁ごとに独立に考える。
テストケースで検証すると、
その桁において1の数が偶数個の場合は、自分自身の桁の数字を入れる
奇数個の場合は、自分自身の桁の値をbit反転したものを入れる
ことが正解であることが分かる。
これを実装するだけ。
"""
n = int(readline())
lst1 = list(map(int,readline().split()))
res = 0
for i in lst1:
res = res^i
ans = []
for i in lst1:
ans.append(res^i)
print((*ans)) | 36 | 23 | 747 | 430 | import sys
readline = sys.stdin.buffer.readline
def even(n):
return 1 if n % 2 == 0 else 0
"""
全員が自分以外の全員のxorを把握しているので、全員の値を求めよ
nは偶数
桁ごとに独立に考える。
テストケースで検証すると、
その桁において1の数が偶数個の場合は、自分自身の桁の数字を入れる
奇数個の場合は、自分自身の桁の値をbit反転したものを入れる
ことが正解であることが分かる。
これを実装するだけ。
"""
n = int(readline())
lst1 = list(map(int, readline().split()))
limit = 33 # 制約10**9は2**32内に収まる。
ans = []
parity = [0] * limit
for i in lst1:
for j in range(limit):
parity[j] += i >> j
for i in range(limit):
parity[i] %= 2
for i in lst1:
res = 0
for j in range(limit):
p = i >> j & 1
if parity[j] == 0 and p == 1:
res += 1 << j
elif parity[j] == 1 and p == 0:
res += 1 << j
ans.append(res)
print((*ans))
| import sys
readline = sys.stdin.buffer.readline
def even(n):
return 1 if n % 2 == 0 else 0
"""
全員が自分以外の全員のxorを把握しているので、全員の値を求めよ
nは偶数
桁ごとに独立に考える。
テストケースで検証すると、
その桁において1の数が偶数個の場合は、自分自身の桁の数字を入れる
奇数個の場合は、自分自身の桁の値をbit反転したものを入れる
ことが正解であることが分かる。
これを実装するだけ。
"""
n = int(readline())
lst1 = list(map(int, readline().split()))
res = 0
for i in lst1:
res = res ^ i
ans = []
for i in lst1:
ans.append(res ^ i)
print((*ans))
| false | 36.111111 | [
"-limit = 33 # 制約10**9は2**32内に収まる。",
"+res = 0",
"+for i in lst1:",
"+ res = res ^ i",
"-parity = [0] * limit",
"- for j in range(limit):",
"- parity[j] += i >> j",
"-for i in range(limit):",
"- parity[i] %= 2",
"-for i in lst1:",
"- res = 0",
"- for j in range(limit):",... | false | 0.111988 | 0.039442 | 2.839295 | [
"s889844526",
"s246410267"
] |
u803617136 | p02802 | python | s181453299 | s778101451 | 563 | 303 | 51,176 | 12,652 | Accepted | Accepted | 46.18 | N, M = list(map(int, input().split()))
wa_stock = [0] * N
ac = 0
wa = 0
stat = ['NA'] * N
for _ in range(M):
p, S = input().split()
key = int(p) - 1
if S == 'WA':
wa_stock[key] += 1
elif stat[key] != 'AC' and S == 'AC':
stat[key] = 'AC'
ac += 1
wa += wa_stock[key]
print((ac, wa))
| n, m = list(map(int, input().split()))
ac = set()
wa = 0
wa_stock = [0] * n
for _ in range(m):
p, s = input().split()
p = int(p) - 1
if s == 'AC' and not p in ac:
ac.add(p)
wa += wa_stock[p]
elif not p in ac:
wa_stock[p] += 1
print((len(ac), wa)) | 18 | 13 | 341 | 290 | N, M = list(map(int, input().split()))
wa_stock = [0] * N
ac = 0
wa = 0
stat = ["NA"] * N
for _ in range(M):
p, S = input().split()
key = int(p) - 1
if S == "WA":
wa_stock[key] += 1
elif stat[key] != "AC" and S == "AC":
stat[key] = "AC"
ac += 1
wa += wa_stock[key]
print((ac, wa))
| n, m = list(map(int, input().split()))
ac = set()
wa = 0
wa_stock = [0] * n
for _ in range(m):
p, s = input().split()
p = int(p) - 1
if s == "AC" and not p in ac:
ac.add(p)
wa += wa_stock[p]
elif not p in ac:
wa_stock[p] += 1
print((len(ac), wa))
| false | 27.777778 | [
"-N, M = list(map(int, input().split()))",
"-wa_stock = [0] * N",
"-ac = 0",
"+n, m = list(map(int, input().split()))",
"+ac = set()",
"-stat = [\"NA\"] * N",
"-for _ in range(M):",
"- p, S = input().split()",
"- key = int(p) - 1",
"- if S == \"WA\":",
"- wa_stock[key] += 1",
"... | false | 0.037143 | 0.037677 | 0.985807 | [
"s181453299",
"s778101451"
] |
u562935282 | p02881 | python | s217741207 | s745174227 | 188 | 165 | 3,060 | 9,188 | Accepted | Accepted | 12.23 | def main():
N = int(eval(input()))
st = [N + 1] # (1,N)
d = 2
while d * d <= N:
if N % d == 0:
st.append(d + N // d) # (d, N // d)
d += 1
print((min(st) - 2))
if __name__ == '__main__':
main()
| def main():
N = int(eval(input()))
ans = N - 1
d = 1
while d * d <= N:
if N % d == 0:
ans = min(ans, d + N // d - 2)
d += 1
print(ans)
if __name__ == '__main__':
main()
| 15 | 16 | 257 | 235 | def main():
N = int(eval(input()))
st = [N + 1] # (1,N)
d = 2
while d * d <= N:
if N % d == 0:
st.append(d + N // d) # (d, N // d)
d += 1
print((min(st) - 2))
if __name__ == "__main__":
main()
| def main():
N = int(eval(input()))
ans = N - 1
d = 1
while d * d <= N:
if N % d == 0:
ans = min(ans, d + N // d - 2)
d += 1
print(ans)
if __name__ == "__main__":
main()
| false | 6.25 | [
"- st = [N + 1] # (1,N)",
"- d = 2",
"+ ans = N - 1",
"+ d = 1",
"- st.append(d + N // d) # (d, N // d)",
"+ ans = min(ans, d + N // d - 2)",
"- print((min(st) - 2))",
"+ print(ans)"
] | false | 0.050202 | 0.05203 | 0.964851 | [
"s217741207",
"s745174227"
] |
u261103969 | p02623 | python | s610543961 | s304342031 | 193 | 154 | 133,640 | 135,372 | Accepted | Accepted | 20.21 | from itertools import accumulate
import bisect
n, m, k = list(map(int, input().split()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
a_acc = [0] + list(accumulate(a)) # aを0冊読む=1冊も読まない場合があるので、[0]を先頭に追加します
b_acc = list(accumulate(b)) # bisect_rightでは、x以下の要素がいくつあるか？を求めるので、こちらに0は入れません
ans = 0
for an in range(n + 1):
rem = k - a_acc[an]
if rem < 0:
# aをこれ以上読めません
break
bn = bisect.bisect_right(b_acc, rem)
ans = max(ans, an + bn)
print(ans) | from itertools import accumulate
n, m, k = list(map(int, input().split()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
a_acc = [0] + list(accumulate(a))
b_acc = [0] + list((accumulate(b)))
ans = 0
bn = m
for an in range(n + 1):
rem = k - a_acc[an]
if rem < 0:
break
# rem >= 0 かつ、b_acc[0] = 0なので、bnはどんなに減っても0で必ず止まります。マイナスになってバグることはありません
while b_acc[bn] > rem:
bn -= 1
ans = max(ans, an + bn)
print(ans) | 21 | 23 | 518 | 488 | from itertools import accumulate
import bisect
n, m, k = list(map(int, input().split()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
a_acc = [0] + list(accumulate(a)) # aを0冊読む=1冊も読まない場合があるので、[0]を先頭に追加します
b_acc = list(accumulate(b)) # bisect_rightでは、x以下の要素がいくつあるか？を求めるので、こちらに0は入れません
ans = 0
for an in range(n + 1):
rem = k - a_acc[an]
if rem < 0:
# aをこれ以上読めません
break
bn = bisect.bisect_right(b_acc, rem)
ans = max(ans, an + bn)
print(ans)
| from itertools import accumulate
n, m, k = list(map(int, input().split()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
a_acc = [0] + list(accumulate(a))
b_acc = [0] + list((accumulate(b)))
ans = 0
bn = m
for an in range(n + 1):
rem = k - a_acc[an]
if rem < 0:
break
# rem >= 0 かつ、b_acc[0] = 0なので、bnはどんなに減っても0で必ず止まります。マイナスになってバグることはありません
while b_acc[bn] > rem:
bn -= 1
ans = max(ans, an + bn)
print(ans)
| false | 8.695652 | [
"-import bisect",
"-a_acc = [0] + list(accumulate(a)) # aを0冊読む=1冊も読まない場合があるので、[0]を先頭に追加します",
"-b_acc = list(accumulate(b)) # bisect_rightでは、x以下の要素がいくつあるか？を求めるので、こちらに0は入れません",
"+a_acc = [0] + list(accumulate(a))",
"+b_acc = [0] + list((accumulate(b)))",
"+bn = m",
"- # aをこれ以上読めません",
"- bn =... | false | 0.043078 | 0.007586 | 5.678358 | [
"s610543961",
"s304342031"
] |
u569960318 | p02417 | python | s819605723 | s758849235 | 40 | 30 | 7,512 | 7,532 | Accepted | Accepted | 25 | import sys
cnts = {chr(a):0 for a in range(ord('a'),ord('z')+1)}
for line in sys.stdin:
alpha_line = [x.lower() for x in list([c for c in list(line) if c.isalpha()])]
for a in alpha_line: cnts[a] += 1
for a in range(ord('a'),ord('z')+1): print((chr(a),':',cnts[chr(a)])) | import sys
cnts = {}
for line in sys.stdin:
alpha_line = [x.lower() for x in list([c for c in list(line) if c.isalpha()])]
for c in alpha_line:
cnts[c] = cnts.get(c,0) + 1
for c in range(ord('a'),ord('z')+1): print((chr(c),':',cnts.get(chr(c),0))) | 7 | 8 | 286 | 274 | import sys
cnts = {chr(a): 0 for a in range(ord("a"), ord("z") + 1)}
for line in sys.stdin:
alpha_line = [x.lower() for x in list([c for c in list(line) if c.isalpha()])]
for a in alpha_line:
cnts[a] += 1
for a in range(ord("a"), ord("z") + 1):
print((chr(a), ":", cnts[chr(a)]))
| import sys
cnts = {}
for line in sys.stdin:
alpha_line = [x.lower() for x in list([c for c in list(line) if c.isalpha()])]
for c in alpha_line:
cnts[c] = cnts.get(c, 0) + 1
for c in range(ord("a"), ord("z") + 1):
print((chr(c), ":", cnts.get(chr(c), 0)))
| false | 12.5 | [
"-cnts = {chr(a): 0 for a in range(ord(\"a\"), ord(\"z\") + 1)}",
"+cnts = {}",
"- for a in alpha_line:",
"- cnts[a] += 1",
"-for a in range(ord(\"a\"), ord(\"z\") + 1):",
"- print((chr(a), \":\", cnts[chr(a)]))",
"+ for c in alpha_line:",
"+ cnts[c] = cnts.get(c, 0) + 1",
"+f... | false | 0.047051 | 0.049729 | 0.946146 | [
"s819605723",
"s758849235"
] |
u533039576 | p03160 | python | s508603264 | s967139059 | 196 | 117 | 14,056 | 20,508 | Accepted | Accepted | 40.31 | n = int(eval(input()))
h = tuple(map(int, input().split()))
INF = float('inf')
dp = [INF] * n
dp[0] = 0
# dp[i] = (足場iにたどり着いた時点でのコストの最小値)
for i in range(n):
if i + 1 < n:
dp[i + 1] = min(dp[i + 1], dp[i] + abs(h[i + 1] - h[i]))
if i + 2 < n:
dp[i + 2] = min(dp[i + 2], dp[i] + abs(h[i + 2] - h[i]))
print((dp[n - 1]))
| n = int(eval(input()))
h = tuple(map(int, input().split()))
INF = float('inf')
dp = [INF] * n
dp[0] = 0
dp[1] = abs(h[0] - h[1])
# dp[i] = (足場iにたどり着いた時点でのコストの最小値)
for i in range(2, n):
dp[i] = min(dp[i - 1] + abs(h[i] - h[i - 1]),
dp[i - 2] + abs(h[i] - h[i - 2]))
print((dp[n - 1]))
| 15 | 14 | 351 | 312 | n = int(eval(input()))
h = tuple(map(int, input().split()))
INF = float("inf")
dp = [INF] * n
dp[0] = 0
# dp[i] = (足場iにたどり着いた時点でのコストの最小値)
for i in range(n):
if i + 1 < n:
dp[i + 1] = min(dp[i + 1], dp[i] + abs(h[i + 1] - h[i]))
if i + 2 < n:
dp[i + 2] = min(dp[i + 2], dp[i] + abs(h[i + 2] - h[i]))
print((dp[n - 1]))
| n = int(eval(input()))
h = tuple(map(int, input().split()))
INF = float("inf")
dp = [INF] * n
dp[0] = 0
dp[1] = abs(h[0] - h[1])
# dp[i] = (足場iにたどり着いた時点でのコストの最小値)
for i in range(2, n):
dp[i] = min(dp[i - 1] + abs(h[i] - h[i - 1]), dp[i - 2] + abs(h[i] - h[i - 2]))
print((dp[n - 1]))
| false | 6.666667 | [
"+dp[1] = abs(h[0] - h[1])",
"-for i in range(n):",
"- if i + 1 < n:",
"- dp[i + 1] = min(dp[i + 1], dp[i] + abs(h[i + 1] - h[i]))",
"- if i + 2 < n:",
"- dp[i + 2] = min(dp[i + 2], dp[i] + abs(h[i + 2] - h[i]))",
"+for i in range(2, n):",
"+ dp[i] = min(dp[i - 1] + abs(h[i] - h... | false | 0.035731 | 0.035878 | 0.995913 | [
"s508603264",
"s967139059"
] |
u334712262 | p03095 | python | s026868607 | s736849410 | 85 | 77 | 6,840 | 5,956 | Accepted | Accepted | 9.41 | # -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
import sys
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, product, permutations
from operator import add, mul, sub
sys.setrecursionlimit(100000)
def read_int():
return int(input())
def read_int_n():
return list(map(int, input().split()))
def read_float():
return float(input())
def read_float_n():
return list(map(float, input().split()))
def read_str():
return input().strip()
def read_str_n():
return list(map(str, input().split()))
def error_print(*args):
print(*args, file=sys.stderr)
def mt(f):
import time
def wrap(*args, **kwargs):
s = time.time()
ret = f(*args, **kwargs)
e = time.time()
error_print(e - s, 'sec')
return ret
return wrap
class Mod:
def __init__(self, m):
self.m = m
def add(self, a, b):
return (a + b ) % self.m
def sub(self, a, b):
return (a - b) % self.m
def mul(self, a, b):
return ((a % self.m) * (b % self.m)) % self.m
def div(self, a, b):
return self.mul(a, self.pow(b, self.m-2))
def pow(self, x, y):
if y == 0:
return 1
elif y == 1:
return x % self.m
elif y % 2 == 0:
return self.pow(x, y//2)**2 % self.m
else:
return self.pow(x, y//2)**2 * x % self.m
@mt
def slv(N, S):
ans = 0
CC = Counter()
for c in S:
CC[c] += 1
m = Mod(10**9+7)
cs = tuple(CC.values())
@lru_cache(maxsize=None)
def f(v):
if not v:
return 1
c = v[0]
v = v[1:]
return m.add(m.mul(c, f(v)), f(v))
return f(cs) - 1
def main():
N = read_int()
S = read_str()
print(slv(N, S))
if __name__ == '__main__':
main()
| # -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
import sys
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, product, permutations
from operator import add, mul, sub
sys.setrecursionlimit(100000)
def read_int():
return int(input())
def read_int_n():
return list(map(int, input().split()))
def read_float():
return float(input())
def read_float_n():
return list(map(float, input().split()))
def read_str():
return input().strip()
def read_str_n():
return list(map(str, input().split()))
def error_print(*args):
print(*args, file=sys.stderr)
def mt(f):
import time
def wrap(*args, **kwargs):
s = time.time()
ret = f(*args, **kwargs)
e = time.time()
error_print(e - s, 'sec')
return ret
return wrap
class Mod:
def __init__(self, m):
self.m = m
def add(self, a, b):
return (a + b ) % self.m
def sub(self, a, b):
return (a - b) % self.m
def mul(self, a, b):
return ((a % self.m) * (b % self.m)) % self.m
def div(self, a, b):
return self.mul(a, self.pow(b, self.m-2))
def pow(self, x, y):
if y == 0:
return 1
elif y == 1:
return x % self.m
elif y % 2 == 0:
return self.pow(x, y//2)**2 % self.m
else:
return self.pow(x, y//2)**2 * x % self.m
@mt
def slv(N, S):
CC = Counter()
for c in S:
CC[c] += 1
for c in CC:
CC[c] += 1
m = Mod(10**9+7)
return reduce(m.mul, CC.values()) - 1
def main():
N = read_int()
S = read_str()
print(slv(N, S))
if __name__ == '__main__':
main()
| 115 | 106 | 2,155 | 1,993 | # -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
import sys
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, product, permutations
from operator import add, mul, sub
sys.setrecursionlimit(100000)
def read_int():
return int(input())
def read_int_n():
return list(map(int, input().split()))
def read_float():
return float(input())
def read_float_n():
return list(map(float, input().split()))
def read_str():
return input().strip()
def read_str_n():
return list(map(str, input().split()))
def error_print(*args):
print(*args, file=sys.stderr)
def mt(f):
import time
def wrap(*args, **kwargs):
s = time.time()
ret = f(*args, **kwargs)
e = time.time()
error_print(e - s, "sec")
return ret
return wrap
class Mod:
def __init__(self, m):
self.m = m
def add(self, a, b):
return (a + b) % self.m
def sub(self, a, b):
return (a - b) % self.m
def mul(self, a, b):
return ((a % self.m) * (b % self.m)) % self.m
def div(self, a, b):
return self.mul(a, self.pow(b, self.m - 2))
def pow(self, x, y):
if y == 0:
return 1
elif y == 1:
return x % self.m
elif y % 2 == 0:
return self.pow(x, y // 2) ** 2 % self.m
else:
return self.pow(x, y // 2) ** 2 * x % self.m
@mt
def slv(N, S):
ans = 0
CC = Counter()
for c in S:
CC[c] += 1
m = Mod(10**9 + 7)
cs = tuple(CC.values())
@lru_cache(maxsize=None)
def f(v):
if not v:
return 1
c = v[0]
v = v[1:]
return m.add(m.mul(c, f(v)), f(v))
return f(cs) - 1
def main():
N = read_int()
S = read_str()
print(slv(N, S))
if __name__ == "__main__":
main()
| # -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
import sys
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, product, permutations
from operator import add, mul, sub
sys.setrecursionlimit(100000)
def read_int():
return int(input())
def read_int_n():
return list(map(int, input().split()))
def read_float():
return float(input())
def read_float_n():
return list(map(float, input().split()))
def read_str():
return input().strip()
def read_str_n():
return list(map(str, input().split()))
def error_print(*args):
print(*args, file=sys.stderr)
def mt(f):
import time
def wrap(*args, **kwargs):
s = time.time()
ret = f(*args, **kwargs)
e = time.time()
error_print(e - s, "sec")
return ret
return wrap
class Mod:
def __init__(self, m):
self.m = m
def add(self, a, b):
return (a + b) % self.m
def sub(self, a, b):
return (a - b) % self.m
def mul(self, a, b):
return ((a % self.m) * (b % self.m)) % self.m
def div(self, a, b):
return self.mul(a, self.pow(b, self.m - 2))
def pow(self, x, y):
if y == 0:
return 1
elif y == 1:
return x % self.m
elif y % 2 == 0:
return self.pow(x, y // 2) ** 2 % self.m
else:
return self.pow(x, y // 2) ** 2 * x % self.m
@mt
def slv(N, S):
CC = Counter()
for c in S:
CC[c] += 1
for c in CC:
CC[c] += 1
m = Mod(10**9 + 7)
return reduce(m.mul, CC.values()) - 1
def main():
N = read_int()
S = read_str()
print(slv(N, S))
if __name__ == "__main__":
main()
| false | 7.826087 | [
"- ans = 0",
"+ for c in CC:",
"+ CC[c] += 1",
"- cs = tuple(CC.values())",
"-",
"- @lru_cache(maxsize=None)",
"- def f(v):",
"- if not v:",
"- return 1",
"- c = v[0]",
"- v = v[1:]",
"- return m.add(m.mul(c, f(v)), f(v))",
"-",
... | false | 0.044568 | 0.077763 | 0.573129 | [
"s026868607",
"s736849410"
] |
u531599639 | p02627 | python | s777410513 | s361137315 | 28 | 25 | 9,020 | 9,004 | Accepted | Accepted | 10.71 | a = eval(input())
print(('A' if a.lower()!=a else 'a')) | print(('A' if input().isupper() else 'a')) | 2 | 1 | 48 | 40 | a = eval(input())
print(("A" if a.lower() != a else "a"))
| print(("A" if input().isupper() else "a"))
| false | 50 | [
"-a = eval(input())",
"-print((\"A\" if a.lower() != a else \"a\"))",
"+print((\"A\" if input().isupper() else \"a\"))"
] | false | 0.007712 | 0.042501 | 0.181461 | [
"s777410513",
"s361137315"
] |
u790710233 | p03408 | python | s214712199 | s472150015 | 26 | 18 | 3,316 | 2,940 | Accepted | Accepted | 30.77 | from collections import Counter
n = int(eval(input()))
b = [eval(input()) for _ in range(n)]
m = int(eval(input()))
r = [eval(input()) for _ in range(m)]
db, dr = [Counter(x) for x in (b, r)]
print((max(*[v-dr[k] for k, v in list(db.items())]+[0])))
| n = int(eval(input()))
s = [eval(input()) for _ in range(n)]
m = int(eval(input()))
t = [eval(input()) for _ in range(m)]
print((max(0, max(s.count(w)-t.count(w) for w in set(s)))))
| 9 | 5 | 228 | 160 | from collections import Counter
n = int(eval(input()))
b = [eval(input()) for _ in range(n)]
m = int(eval(input()))
r = [eval(input()) for _ in range(m)]
db, dr = [Counter(x) for x in (b, r)]
print((max(*[v - dr[k] for k, v in list(db.items())] + [0])))
| n = int(eval(input()))
s = [eval(input()) for _ in range(n)]
m = int(eval(input()))
t = [eval(input()) for _ in range(m)]
print((max(0, max(s.count(w) - t.count(w) for w in set(s)))))
| false | 44.444444 | [
"-from collections import Counter",
"-",
"-b = [eval(input()) for _ in range(n)]",
"+s = [eval(input()) for _ in range(n)]",
"-r = [eval(input()) for _ in range(m)]",
"-db, dr = [Counter(x) for x in (b, r)]",
"-print((max(*[v - dr[k] for k, v in list(db.items())] + [0])))",
"+t = [eval(input()) for _ ... | false | 0.040976 | 0.034454 | 1.189294 | [
"s214712199",
"s472150015"
] |
u620084012 | p03069 | python | s291280120 | s280394469 | 205 | 85 | 56,268 | 73,048 | Accepted | Accepted | 58.54 | n = int(eval(input()))
s = eval(input())
b = [0 for k in range(n+1)]
c = 0
for k in range(n):
if s[k] == "#":
c += 1
b[k+1] = c
w = [0 for k in range(n+1)]
c = 0
for k in range(n):
if s[-k-1] == ".":
c += 1
w[-k-2] = c
ans = 10**9
for k in range(n+1):
ans = min(ans,b[k]+w[k])
print(ans)
| N = int(eval(input()))
S = "." + eval(input()) + "#"
B = [0]*(N+2)
W = [0]*(N+2)
b = 0
for k in range(N+2):
if S[k] == "#":
b += 1
B[k] = b
w = 0
for k in range(N+1,-1,-1):
if S[k] == ".":
w += 1
W[k] = w
ans = 10**10
for k in range(N+1):
ans = min(ans,B[k]+W[k+1])
print(ans)
| 22 | 18 | 337 | 318 | n = int(eval(input()))
s = eval(input())
b = [0 for k in range(n + 1)]
c = 0
for k in range(n):
if s[k] == "#":
c += 1
b[k + 1] = c
w = [0 for k in range(n + 1)]
c = 0
for k in range(n):
if s[-k - 1] == ".":
c += 1
w[-k - 2] = c
ans = 10**9
for k in range(n + 1):
ans = min(ans, b[k] + w[k])
print(ans)
| N = int(eval(input()))
S = "." + eval(input()) + "#"
B = [0] * (N + 2)
W = [0] * (N + 2)
b = 0
for k in range(N + 2):
if S[k] == "#":
b += 1
B[k] = b
w = 0
for k in range(N + 1, -1, -1):
if S[k] == ".":
w += 1
W[k] = w
ans = 10**10
for k in range(N + 1):
ans = min(ans, B[k] + W[k + 1])
print(ans)
| false | 18.181818 | [
"-n = int(eval(input()))",
"-s = eval(input())",
"-b = [0 for k in range(n + 1)]",
"-c = 0",
"-for k in range(n):",
"- if s[k] == \"#\":",
"- c += 1",
"- b[k + 1] = c",
"-w = [0 for k in range(n + 1)]",
"-c = 0",
"-for k in range(n):",
"- if s[-k - 1] == \".\":",
"- c ... | false | 0.040039 | 0.041125 | 0.973594 | [
"s291280120",
"s280394469"
] |
u273010357 | p03162 | python | s553219285 | s602005109 | 680 | 626 | 71,644 | 61,400 | Accepted | Accepted | 7.94 | N = int(eval(input()))
a = [[0 for _ in range(3)] for _ in range(N)]
for i in range(N):
t = list(map(int, input().split()))
for j in range(3):
a[i][j] = t[j]
dp = [[0 for _ in range(3)] for _ in range(N+1)]
for i in range(N):
for j in range(3):
for k in range(3):
if j == k:
continue
dp[i+1][k] = max(dp[i+1][k], dp[i][j] + a[i][k])
#print(dp)
answer = 0
for j in range(3):
answer = max(answer, dp[N][j])
print(answer) | INF = float('inf')
MAX_N = 10**5
N = int(eval(input()))
a,b,c = [0]*N, [0]*N, [0]*N
for i in range(N):
a[i],b[i],c[i] = list(map(int, input().split()))
# dp table
# dp[i][j] := 状態jにおけるi日目に得る幸福度の総和の最大値
dp = [[0]*3 for _ in range(N)]
dp[0][0],dp[0][1],dp[0][2] = a[0],b[0],c[0]
for i in range(1,N):
for j in range(3):
if j==0:
dp[i][j] = max(dp[i-1][j+1]+a[i],dp[i-1][j+2]+a[i])
if j==1:
dp[i][j] = max(dp[i-1][j-1]+b[i],dp[i-1][j+1]+b[i])
if j==2:
dp[i][j] = max(dp[i-1][j-2]+c[i],dp[i-1][j-1]+c[i])
print((max(dp[N-1]))) | 23 | 23 | 511 | 600 | N = int(eval(input()))
a = [[0 for _ in range(3)] for _ in range(N)]
for i in range(N):
t = list(map(int, input().split()))
for j in range(3):
a[i][j] = t[j]
dp = [[0 for _ in range(3)] for _ in range(N + 1)]
for i in range(N):
for j in range(3):
for k in range(3):
if j == k:
continue
dp[i + 1][k] = max(dp[i + 1][k], dp[i][j] + a[i][k])
# print(dp)
answer = 0
for j in range(3):
answer = max(answer, dp[N][j])
print(answer)
| INF = float("inf")
MAX_N = 10**5
N = int(eval(input()))
a, b, c = [0] * N, [0] * N, [0] * N
for i in range(N):
a[i], b[i], c[i] = list(map(int, input().split()))
# dp table
# dp[i][j] := 状態jにおけるi日目に得る幸福度の総和の最大値
dp = [[0] * 3 for _ in range(N)]
dp[0][0], dp[0][1], dp[0][2] = a[0], b[0], c[0]
for i in range(1, N):
for j in range(3):
if j == 0:
dp[i][j] = max(dp[i - 1][j + 1] + a[i], dp[i - 1][j + 2] + a[i])
if j == 1:
dp[i][j] = max(dp[i - 1][j - 1] + b[i], dp[i - 1][j + 1] + b[i])
if j == 2:
dp[i][j] = max(dp[i - 1][j - 2] + c[i], dp[i - 1][j - 1] + c[i])
print((max(dp[N - 1])))
| false | 0 | [
"+INF = float(\"inf\")",
"+MAX_N = 10**5",
"-a = [[0 for _ in range(3)] for _ in range(N)]",
"+a, b, c = [0] * N, [0] * N, [0] * N",
"- t = list(map(int, input().split()))",
"+ a[i], b[i], c[i] = list(map(int, input().split()))",
"+# dp table",
"+# dp[i][j] := 状態jにおけるi日目に得る幸福度の総和の最大値",
"+dp = ... | false | 0.043407 | 0.07631 | 0.568829 | [
"s553219285",
"s602005109"
] |
u633068244 | p01268 | python | s881435023 | s916885037 | 400 | 290 | 9,016 | 9,020 | Accepted | Accepted | 27.5 | import itertools
r = 110000
s = int(r*0.5)
p = [1] * r
p[0] = 0
for i in range(1,s):
if p[i]:
p[2*i+1::i+1] = [0 for x in range(2*i+1,r,i+1)]
while 1:
N,P = list(map(int,input().split()))
if N == -1: break
i = N + 1
prime = []
while len(prime) < 30:
if p[i-1] == 1:
prime.append(i)
i += 1
wa = sorted([sum(comb) for comb in itertools.combinations(prime,2)] + [2*a for a in prime])
print(wa[P-1]) | import itertools
r = 110000
s = int(r*0.5)
p = [1] * r
p[0] = 0
for i in range(1,s):
if p[i]:
p[2*i+1::i+1] = [0 for x in range(2*i+1,r,i+1)]
while 1:
N,P = list(map(int,input().split()))
if N == -1: break
i = N + 1
prime = [0]*25
j = 0
while j < 25:
if p[i-1] == 1:
prime[j] = i
j += 1
i += 1
wa = sorted([sum(comb) for comb in itertools.combinations(prime,2)] + [2*a for a in prime])
print(wa[P-1]) | 20 | 22 | 431 | 442 | import itertools
r = 110000
s = int(r * 0.5)
p = [1] * r
p[0] = 0
for i in range(1, s):
if p[i]:
p[2 * i + 1 :: i + 1] = [0 for x in range(2 * i + 1, r, i + 1)]
while 1:
N, P = list(map(int, input().split()))
if N == -1:
break
i = N + 1
prime = []
while len(prime) < 30:
if p[i - 1] == 1:
prime.append(i)
i += 1
wa = sorted(
[sum(comb) for comb in itertools.combinations(prime, 2)]
+ [2 * a for a in prime]
)
print(wa[P - 1])
| import itertools
r = 110000
s = int(r * 0.5)
p = [1] * r
p[0] = 0
for i in range(1, s):
if p[i]:
p[2 * i + 1 :: i + 1] = [0 for x in range(2 * i + 1, r, i + 1)]
while 1:
N, P = list(map(int, input().split()))
if N == -1:
break
i = N + 1
prime = [0] * 25
j = 0
while j < 25:
if p[i - 1] == 1:
prime[j] = i
j += 1
i += 1
wa = sorted(
[sum(comb) for comb in itertools.combinations(prime, 2)]
+ [2 * a for a in prime]
)
print(wa[P - 1])
| false | 9.090909 | [
"- prime = []",
"- while len(prime) < 30:",
"+ prime = [0] * 25",
"+ j = 0",
"+ while j < 25:",
"- prime.append(i)",
"+ prime[j] = i",
"+ j += 1"
] | false | 0.066786 | 0.070239 | 0.950842 | [
"s881435023",
"s916885037"
] |
u969850098 | p03329 | python | s556790635 | s946827415 | 1,340 | 465 | 7,064 | 7,064 | Accepted | Accepted | 65.3 | import sys
readline = sys.stdin.readline
from math import floor, log
def main():
N = int(readline())
dp = [i for i in range(N+1)]
for i in range(N):
dp[i+1] = min(dp[i+1], dp[i]+1)
log9 = floor(log(N-i, 9))
for e in range(1, log9+2):
if i + 9**e <= N:
dp[i+9**e] = min(dp[i+9**e], dp[i]+1)
log6 = floor(log(N-i, 6))
for e in range(1, log6+2):
if i + 6**e <= N:
dp[i+6**e] = min(dp[i+6**e], dp[i]+1)
print((dp[N]))
if __name__ == '__main__':
main()
| import sys
readline = sys.stdin.readline
def main():
N = int(readline())
dp = [i for i in range(N+1)]
for i in range(N):
dp[i+1] = min(dp[i+1], dp[i]+1)
e = 9
while i + e <= N:
dp[i+e] = min(dp[i+e], dp[i]+1)
e *= 9
e = 6
while i + e <= N:
dp[i+e] = min(dp[i+e], dp[i]+1)
e *= 6
print((dp[N]))
if __name__ == '__main__':
main() | 23 | 23 | 586 | 460 | import sys
readline = sys.stdin.readline
from math import floor, log
def main():
N = int(readline())
dp = [i for i in range(N + 1)]
for i in range(N):
dp[i + 1] = min(dp[i + 1], dp[i] + 1)
log9 = floor(log(N - i, 9))
for e in range(1, log9 + 2):
if i + 9**e <= N:
dp[i + 9**e] = min(dp[i + 9**e], dp[i] + 1)
log6 = floor(log(N - i, 6))
for e in range(1, log6 + 2):
if i + 6**e <= N:
dp[i + 6**e] = min(dp[i + 6**e], dp[i] + 1)
print((dp[N]))
if __name__ == "__main__":
main()
| import sys
readline = sys.stdin.readline
def main():
N = int(readline())
dp = [i for i in range(N + 1)]
for i in range(N):
dp[i + 1] = min(dp[i + 1], dp[i] + 1)
e = 9
while i + e <= N:
dp[i + e] = min(dp[i + e], dp[i] + 1)
e *= 9
e = 6
while i + e <= N:
dp[i + e] = min(dp[i + e], dp[i] + 1)
e *= 6
print((dp[N]))
if __name__ == "__main__":
main()
| false | 0 | [
"-from math import floor, log",
"- log9 = floor(log(N - i, 9))",
"- for e in range(1, log9 + 2):",
"- if i + 9**e <= N:",
"- dp[i + 9**e] = min(dp[i + 9**e], dp[i] + 1)",
"- log6 = floor(log(N - i, 6))",
"- for e in range(1, log6 + 2):",
"- ... | false | 0.177295 | 0.288357 | 0.614843 | [
"s556790635",
"s946827415"
] |
u130900604 | p02991 | python | s774572229 | s440532653 | 393 | 349 | 56,828 | 56,316 | Accepted | Accepted | 11.2 | from collections import deque
import sys
input = sys.stdin.readline
def MI():return list(map(int,input().split()))
def main():
n,m=MI()
G=[[] for _ in range(n)]
for _ in range(m):
u,v=MI()
u-=1
v-=1
G[u].append(v)
s,t=MI()
s-=1
t-=1
fi=[True]*n
se=[True]*n
th=[True]*n
th[s]=False
dq=deque([])
dq.append(s)
depth=0
while dq:
depth+=1
tank1=[]
tank2=[]
tank3=[]
for p in dq:
for c in G[p]:
if fi[c]:
fi[c]=False
tank2.append(c)
for p in tank2:
for c in G[p]:
if se[c]:
se[c]=False
tank3.append(c)
for p in tank3:
for c in G[p]:
if th[c]:
th[c]=False
tank1.append(c)
if c==t:
print(depth)
exit()
dq=deque(tank1)
print((-1))
if __name__=='__main__':
main()
| #from collections import deque
import sys
input = sys.stdin.readline
def MI():return list(map(int,input().split()))
def main():
n,m=MI()
G=[[] for _ in range(n)]
for _ in range(m):
u,v=MI()
u-=1
v-=1
G[u].append(v)
s,t=MI()
s-=1
t-=1
fi=[True]*n
se=[True]*n
th=[True]*n
th[s]=False
#dq=deque([])
#dq.append(s)
dq=[s]
depth=0
while dq:
depth+=1
tank1=[]
tank2=[]
tank3=[]
for p in dq:
for c in G[p]:
if fi[c]:
fi[c]=False
tank2.append(c)
for p in tank2:
for c in G[p]:
if se[c]:
se[c]=False
tank3.append(c)
for p in tank3:
for c in G[p]:
if th[c]:
th[c]=False
tank1.append(c)
if c==t:
print(depth)
exit()
dq=tank1
print((-1))
if __name__=='__main__':
main()
| 53 | 54 | 924 | 930 | from collections import deque
import sys
input = sys.stdin.readline
def MI():
return list(map(int, input().split()))
def main():
n, m = MI()
G = [[] for _ in range(n)]
for _ in range(m):
u, v = MI()
u -= 1
v -= 1
G[u].append(v)
s, t = MI()
s -= 1
t -= 1
fi = [True] * n
se = [True] * n
th = [True] * n
th[s] = False
dq = deque([])
dq.append(s)
depth = 0
while dq:
depth += 1
tank1 = []
tank2 = []
tank3 = []
for p in dq:
for c in G[p]:
if fi[c]:
fi[c] = False
tank2.append(c)
for p in tank2:
for c in G[p]:
if se[c]:
se[c] = False
tank3.append(c)
for p in tank3:
for c in G[p]:
if th[c]:
th[c] = False
tank1.append(c)
if c == t:
print(depth)
exit()
dq = deque(tank1)
print((-1))
if __name__ == "__main__":
main()
| # from collections import deque
import sys
input = sys.stdin.readline
def MI():
return list(map(int, input().split()))
def main():
n, m = MI()
G = [[] for _ in range(n)]
for _ in range(m):
u, v = MI()
u -= 1
v -= 1
G[u].append(v)
s, t = MI()
s -= 1
t -= 1
fi = [True] * n
se = [True] * n
th = [True] * n
th[s] = False
# dq=deque([])
# dq.append(s)
dq = [s]
depth = 0
while dq:
depth += 1
tank1 = []
tank2 = []
tank3 = []
for p in dq:
for c in G[p]:
if fi[c]:
fi[c] = False
tank2.append(c)
for p in tank2:
for c in G[p]:
if se[c]:
se[c] = False
tank3.append(c)
for p in tank3:
for c in G[p]:
if th[c]:
th[c] = False
tank1.append(c)
if c == t:
print(depth)
exit()
dq = tank1
print((-1))
if __name__ == "__main__":
main()
| false | 1.851852 | [
"-from collections import deque",
"+# from collections import deque",
"- dq = deque([])",
"- dq.append(s)",
"+ # dq=deque([])",
"+ # dq.append(s)",
"+ dq = [s]",
"- dq = deque(tank1)",
"+ dq = tank1"
] | false | 0.065627 | 0.063814 | 1.028425 | [
"s774572229",
"s440532653"
] |
u256464928 | p03292 | python | s975866956 | s692758744 | 20 | 17 | 2,940 | 3,064 | Accepted | Accepted | 15 | a,b,c = list(map(int,input().split()))
print((max(a,b,c)-min(a,b,c))) | t = list(map(int,input().split()))
print((max(t)-min(t))) | 2 | 2 | 62 | 56 | a, b, c = list(map(int, input().split()))
print((max(a, b, c) - min(a, b, c)))
| t = list(map(int, input().split()))
print((max(t) - min(t)))
| false | 0 | [
"-a, b, c = list(map(int, input().split()))",
"-print((max(a, b, c) - min(a, b, c)))",
"+t = list(map(int, input().split()))",
"+print((max(t) - min(t)))"
] | false | 0.048134 | 0.048261 | 0.997381 | [
"s975866956",
"s692758744"
] |
u863370423 | p02912 | python | s044841904 | s592821895 | 317 | 139 | 65,520 | 20,328 | Accepted | Accepted | 56.15 | N = int(2e5+3)
heap_arr, heap_size = [0] * N, 0
def heap_push(x):
global heap_size
heap_arr[heap_size] = x
i = heap_size
while i > 0 and heap_arr[i] > heap_arr[(i-1)//2]:
heap_arr[i], heap_arr[(i-1)//2] = heap_arr[(i-1)//2], heap_arr[i]
i = (i-1)//2
heap_size += 1
def get_max():
global heap_size
if heap_size == 0:
return -2e9
return heap_arr[0]
def heap_pop():
global heap_size
if heap_size == 0:
return
heap_size -= 1
heap_arr[0], heap_arr[heap_size] = heap_arr[heap_size], heap_arr[0]
i, j = 0, -1
while i != j:
j = i
l = 2*i+1
r = 2*i+2
if l < heap_size and heap_arr[l] > heap_arr[i]:
i = l
if r < heap_size and heap_arr[r] > heap_arr[i]:
i = r
heap_arr[i], heap_arr[j] = heap_arr[j], heap_arr[i]
n, m = list(map(int, input().split()))
arr = list(map(int, input().split()))
for i in arr:
heap_push(i)
while m >= 1:
x = get_max() // 2
heap_pop()
heap_push(x)
m -= 1
print((sum(heap_arr)))
| import heapq
N,M=list(map(int,input().split()))
A=list([int(x)*(-1) for x in input().split()])
heapq.heapify(A)
for _ in range(M):
tmp=heapq.heappop(A)
tmp=-tmp//2
heapq.heappush(A,-tmp)
print((-sum(A)))
| 45 | 12 | 1,101 | 225 | N = int(2e5 + 3)
heap_arr, heap_size = [0] * N, 0
def heap_push(x):
global heap_size
heap_arr[heap_size] = x
i = heap_size
while i > 0 and heap_arr[i] > heap_arr[(i - 1) // 2]:
heap_arr[i], heap_arr[(i - 1) // 2] = heap_arr[(i - 1) // 2], heap_arr[i]
i = (i - 1) // 2
heap_size += 1
def get_max():
global heap_size
if heap_size == 0:
return -2e9
return heap_arr[0]
def heap_pop():
global heap_size
if heap_size == 0:
return
heap_size -= 1
heap_arr[0], heap_arr[heap_size] = heap_arr[heap_size], heap_arr[0]
i, j = 0, -1
while i != j:
j = i
l = 2 * i + 1
r = 2 * i + 2
if l < heap_size and heap_arr[l] > heap_arr[i]:
i = l
if r < heap_size and heap_arr[r] > heap_arr[i]:
i = r
heap_arr[i], heap_arr[j] = heap_arr[j], heap_arr[i]
n, m = list(map(int, input().split()))
arr = list(map(int, input().split()))
for i in arr:
heap_push(i)
while m >= 1:
x = get_max() // 2
heap_pop()
heap_push(x)
m -= 1
print((sum(heap_arr)))
| import heapq
N, M = list(map(int, input().split()))
A = list([int(x) * (-1) for x in input().split()])
heapq.heapify(A)
for _ in range(M):
tmp = heapq.heappop(A)
tmp = -tmp // 2
heapq.heappush(A, -tmp)
print((-sum(A)))
| false | 73.333333 | [
"-N = int(2e5 + 3)",
"-heap_arr, heap_size = [0] * N, 0",
"+import heapq",
"-",
"-def heap_push(x):",
"- global heap_size",
"- heap_arr[heap_size] = x",
"- i = heap_size",
"- while i > 0 and heap_arr[i] > heap_arr[(i - 1) // 2]:",
"- heap_arr[i], heap_arr[(i - 1) // 2] = heap_ar... | false | 0.07477 | 0.126757 | 0.589867 | [
"s044841904",
"s592821895"
] |
u496821919 | p02647 | python | s008800976 | s575511124 | 404 | 356 | 181,352 | 189,460 | Accepted | Accepted | 11.88 | from itertools import accumulate
n,k = list(map(int,input().split()))
A = list(map(int,input().split()))
for _ in range(min(k,50)):
c = [0]*n
for i,j in enumerate(A):
l = max(0,i-j)
r = min(n-1,i+j)
c[l] += 1
if r+1 < n:
c[r+1] -= 1
A = list(accumulate(c))
print((" ".join(map(str,A)))) | from itertools import accumulate
n,k = list(map(int,input().split()))
A = list(map(int,input().split()))
for _ in range(k):
c = [0]*n
for i,j in enumerate(A):
l = max(0,i-j)
r = min(n-1,i+j)
c[l] += 1
if r+1 < n:
c[r+1] -= 1
#print(c)
d = list(accumulate(c))
if A == d:
break
A = d
print((" ".join(map(str,A)))) | 13 | 17 | 346 | 395 | from itertools import accumulate
n, k = list(map(int, input().split()))
A = list(map(int, input().split()))
for _ in range(min(k, 50)):
c = [0] * n
for i, j in enumerate(A):
l = max(0, i - j)
r = min(n - 1, i + j)
c[l] += 1
if r + 1 < n:
c[r + 1] -= 1
A = list(accumulate(c))
print((" ".join(map(str, A))))
| from itertools import accumulate
n, k = list(map(int, input().split()))
A = list(map(int, input().split()))
for _ in range(k):
c = [0] * n
for i, j in enumerate(A):
l = max(0, i - j)
r = min(n - 1, i + j)
c[l] += 1
if r + 1 < n:
c[r + 1] -= 1
# print(c)
d = list(accumulate(c))
if A == d:
break
A = d
print((" ".join(map(str, A))))
| false | 23.529412 | [
"-for _ in range(min(k, 50)):",
"+for _ in range(k):",
"- A = list(accumulate(c))",
"+ # print(c)",
"+ d = list(accumulate(c))",
"+ if A == d:",
"+ break",
"+ A = d"
] | false | 0.090801 | 0.036754 | 2.470542 | [
"s008800976",
"s575511124"
] |
u408071652 | p02960 | python | s257491409 | s595271659 | 448 | 201 | 98,848 | 98,660 | Accepted | Accepted | 55.13 | import sys
import math
import bisect
import heapq
from collections import Counter
def input():
return sys.stdin.readline().rstrip()
def main():
mod = 10 ** 9 + 7
S = list(eval(input()))
l = len(S)
dp = [[0] * 13 for _ in range(l + 1)]
dp[0][0] = 1
for j in range(1, l + 1):
if S[j - 1] == "?":
for k in range(13):
for q in range(10):
new_k = (k * 10 + q) %13
dp[j][new_k] += dp[j - 1][k]
dp[j][new_k] %= mod
else:
n = int(S[j - 1])
for k in range(13):
new_k = (k * 10 + n)%13
dp[j][new_k] += dp[j - 1][k]
dp[j][new_k] %= mod
print((dp[l][5]))
if __name__ == "__main__":
main()
| import sys
import math
import bisect
import heapq
from collections import Counter
def input():
return sys.stdin.readline().rstrip()
def main():
mod = 10 ** 9 + 7
S = list(eval(input()))
l = len(S)
dp = [[0] * 13 for _ in range(l + 1)]
dp[0][0] = 1
for j in range(1, l + 1):
if S[j - 1] == "?":
for k in range(13):
for q in range(10):
new_k = (k * 10 + q) %13
dp[j][new_k] += dp[j - 1][k]
for k in range(13):
dp[j][k] %= mod
else:
n = int(S[j - 1])
for k in range(13):
new_k = (k * 10 + n)%13
dp[j][new_k] += dp[j - 1][k]
dp[j][new_k] %= mod
print((dp[l][5]))
if __name__ == "__main__":
main()
| 35 | 36 | 821 | 846 | import sys
import math
import bisect
import heapq
from collections import Counter
def input():
return sys.stdin.readline().rstrip()
def main():
mod = 10**9 + 7
S = list(eval(input()))
l = len(S)
dp = [[0] * 13 for _ in range(l + 1)]
dp[0][0] = 1
for j in range(1, l + 1):
if S[j - 1] == "?":
for k in range(13):
for q in range(10):
new_k = (k * 10 + q) % 13
dp[j][new_k] += dp[j - 1][k]
dp[j][new_k] %= mod
else:
n = int(S[j - 1])
for k in range(13):
new_k = (k * 10 + n) % 13
dp[j][new_k] += dp[j - 1][k]
dp[j][new_k] %= mod
print((dp[l][5]))
if __name__ == "__main__":
main()
| import sys
import math
import bisect
import heapq
from collections import Counter
def input():
return sys.stdin.readline().rstrip()
def main():
mod = 10**9 + 7
S = list(eval(input()))
l = len(S)
dp = [[0] * 13 for _ in range(l + 1)]
dp[0][0] = 1
for j in range(1, l + 1):
if S[j - 1] == "?":
for k in range(13):
for q in range(10):
new_k = (k * 10 + q) % 13
dp[j][new_k] += dp[j - 1][k]
for k in range(13):
dp[j][k] %= mod
else:
n = int(S[j - 1])
for k in range(13):
new_k = (k * 10 + n) % 13
dp[j][new_k] += dp[j - 1][k]
dp[j][new_k] %= mod
print((dp[l][5]))
if __name__ == "__main__":
main()
| false | 2.777778 | [
"- dp[j][new_k] %= mod",
"+ for k in range(13):",
"+ dp[j][k] %= mod"
] | false | 0.007408 | 0.036408 | 0.20346 | [
"s257491409",
"s595271659"
] |
u475503988 | p03078 | python | s605110775 | s862523527 | 1,984 | 120 | 160,292 | 8,708 | Accepted | Accepted | 93.95 | X, Y, Z, K = list(map(int, input().split()))
A = list(map(int, input().split()))
A.sort(reverse=True)
B = list(map(int, input().split()))
B.sort(reverse=True)
C = list(map(int, input().split()))
C.sort(reverse=True)
AB = []
for b in B:
for a in A:
AB.append(a+b)
AB.sort(reverse=True)
AB = AB[:K+1]
ABC = []
for c in C:
for ab in AB:
ABC.append(ab+c)
ABC.sort(reverse=True)
for i in range(K):
print((ABC[i])) | X, Y, Z, K = list(map(int, input().split()))
A = list(map(int, input().split()))
A.sort(reverse=True)
B = list(map(int, input().split()))
B.sort(reverse=True)
C = list(map(int, input().split()))
C.sort(reverse=True)
ABC = []
for xi in range(X):
if xi+1 > K:
break
for yi in range(Y):
if (xi+1)*(yi+1) > K:
break
for zi in range(Z):
if (xi+1)*(yi+1)*(zi+1) > K:
break
ABC.append(A[xi]+B[yi]+C[zi])
ABC.sort(reverse=True)
for i in range(K):
print((ABC[i])) | 22 | 22 | 451 | 558 | X, Y, Z, K = list(map(int, input().split()))
A = list(map(int, input().split()))
A.sort(reverse=True)
B = list(map(int, input().split()))
B.sort(reverse=True)
C = list(map(int, input().split()))
C.sort(reverse=True)
AB = []
for b in B:
for a in A:
AB.append(a + b)
AB.sort(reverse=True)
AB = AB[: K + 1]
ABC = []
for c in C:
for ab in AB:
ABC.append(ab + c)
ABC.sort(reverse=True)
for i in range(K):
print((ABC[i]))
| X, Y, Z, K = list(map(int, input().split()))
A = list(map(int, input().split()))
A.sort(reverse=True)
B = list(map(int, input().split()))
B.sort(reverse=True)
C = list(map(int, input().split()))
C.sort(reverse=True)
ABC = []
for xi in range(X):
if xi + 1 > K:
break
for yi in range(Y):
if (xi + 1) * (yi + 1) > K:
break
for zi in range(Z):
if (xi + 1) * (yi + 1) * (zi + 1) > K:
break
ABC.append(A[xi] + B[yi] + C[zi])
ABC.sort(reverse=True)
for i in range(K):
print((ABC[i]))
| false | 0 | [
"-AB = []",
"-for b in B:",
"- for a in A:",
"- AB.append(a + b)",
"-AB.sort(reverse=True)",
"-AB = AB[: K + 1]",
"-for c in C:",
"- for ab in AB:",
"- ABC.append(ab + c)",
"+for xi in range(X):",
"+ if xi + 1 > K:",
"+ break",
"+ for yi in range(Y):",
"+ ... | false | 0.063388 | 0.007201 | 8.802976 | [
"s605110775",
"s862523527"
] |
u119148115 | p02641 | python | s832068569 | s283861965 | 64 | 56 | 61,824 | 61,980 | Accepted | Accepted | 12.5 | import sys
sys.setrecursionlimit(10**7)
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split())) #空白あり
def LI2(): return list(map(int,sys.stdin.readline().rstrip())) #空白なし
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split()) #空白あり
def LS2(): return list(sys.stdin.readline().rstrip()) #空白なし
X,N = list(map(int,S().split()))
p = LI()
p = sorted(p)
for i in range(N+2):
if not (X-i in p):
print((X-i))
exit()
if not (X+i in p):
print((X+i))
exit() | import sys
def LI(): return list(map(int,sys.stdin.readline().rstrip().split())) #空白あり
def S(): return sys.stdin.readline().rstrip()
X,N = list(map(int,S().split()))
p = LI()
p = sorted(p)
for i in range((N+1)//2+1):
if not (X-i in p):
print((X-i))
exit()
if not (X+i in p):
print((X+i))
exit() | 21 | 16 | 620 | 343 | import sys
sys.setrecursionlimit(10**7)
def I():
return int(sys.stdin.readline().rstrip())
def LI():
return list(map(int, sys.stdin.readline().rstrip().split())) # 空白あり
def LI2():
return list(map(int, sys.stdin.readline().rstrip())) # 空白なし
def S():
return sys.stdin.readline().rstrip()
def LS():
return list(sys.stdin.readline().rstrip().split()) # 空白あり
def LS2():
return list(sys.stdin.readline().rstrip()) # 空白なし
X, N = list(map(int, S().split()))
p = LI()
p = sorted(p)
for i in range(N + 2):
if not (X - i in p):
print((X - i))
exit()
if not (X + i in p):
print((X + i))
exit()
| import sys
def LI():
return list(map(int, sys.stdin.readline().rstrip().split())) # 空白あり
def S():
return sys.stdin.readline().rstrip()
X, N = list(map(int, S().split()))
p = LI()
p = sorted(p)
for i in range((N + 1) // 2 + 1):
if not (X - i in p):
print((X - i))
exit()
if not (X + i in p):
print((X + i))
exit()
| false | 23.809524 | [
"-",
"-sys.setrecursionlimit(10**7)",
"-",
"-",
"-def I():",
"- return int(sys.stdin.readline().rstrip())",
"-def LI2():",
"- return list(map(int, sys.stdin.readline().rstrip())) # 空白なし",
"-",
"-",
"-",
"-",
"-def LS():",
"- return list(sys.stdin.readline().rstrip().split()) # 空... | false | 0.042619 | 0.038193 | 1.11589 | [
"s832068569",
"s283861965"
] |
u461833298 | p02813 | python | s971635081 | s634853748 | 34 | 27 | 8,052 | 8,052 | Accepted | Accepted | 20.59 | import itertools
N = int(eval(input()))
P = [int(x) for x in input().split()]
P = tuple(P)
Q = [int(x) for x in input().split()]
Q = tuple(Q)
N_ = list(range(1, N+1))
R = list(itertools.permutations(N_))
Pflg = Qflg = False
Pcnt = Qcnt = -1
for i, r in enumerate(R):
if P==r:
Pflg = True
Pcnt = i
if Q==r:
Qflg = True
Qcnt = i
if Pflg and Qflg:
break
print((abs(Pcnt - Qcnt))) | import itertools
N = int(eval(input()))
P = tuple(map(int, input().split()))
Q = tuple(map(int, input().split()))
pmt = list(itertools.permutations(list(range(1, N+1))))
pmtP = pmt.index(P)
pmtQ = pmt.index(Q)
print((abs(pmtP - pmtQ))) | 24 | 10 | 447 | 232 | import itertools
N = int(eval(input()))
P = [int(x) for x in input().split()]
P = tuple(P)
Q = [int(x) for x in input().split()]
Q = tuple(Q)
N_ = list(range(1, N + 1))
R = list(itertools.permutations(N_))
Pflg = Qflg = False
Pcnt = Qcnt = -1
for i, r in enumerate(R):
if P == r:
Pflg = True
Pcnt = i
if Q == r:
Qflg = True
Qcnt = i
if Pflg and Qflg:
break
print((abs(Pcnt - Qcnt)))
| import itertools
N = int(eval(input()))
P = tuple(map(int, input().split()))
Q = tuple(map(int, input().split()))
pmt = list(itertools.permutations(list(range(1, N + 1))))
pmtP = pmt.index(P)
pmtQ = pmt.index(Q)
print((abs(pmtP - pmtQ)))
| false | 58.333333 | [
"-P = [int(x) for x in input().split()]",
"-P = tuple(P)",
"-Q = [int(x) for x in input().split()]",
"-Q = tuple(Q)",
"-N_ = list(range(1, N + 1))",
"-R = list(itertools.permutations(N_))",
"-Pflg = Qflg = False",
"-Pcnt = Qcnt = -1",
"-for i, r in enumerate(R):",
"- if P == r:",
"- Pf... | false | 0.043068 | 0.037816 | 1.138883 | [
"s971635081",
"s634853748"
] |
u188827677 | p02720 | python | s602599121 | s991519516 | 1,896 | 98 | 18,508 | 18,684 | Accepted | Accepted | 94.83 | k = int(eval(input()))
nums = [i for i in range(1,10)]
for i in range(k):
a = nums.pop(0)
if a%10 != 0:
nums.append(a*10 + a%10 - 1)
nums.append(a*10 + a%10)
if a%10 != 9:
nums.append(a*10 + a%10 + 1)
print(a) | from collections import deque
k = int(eval(input()))
q = deque([i for i in range(1,10)])
for i in range(k):
a = q.popleft()
if a%10 != 0:
q.append(a*10 + a%10 - 1)
q.append(a*10 + a%10)
if a%10 != 9:
q.append(a*10 + a%10 + 1)
print(a) | 14 | 15 | 244 | 270 | k = int(eval(input()))
nums = [i for i in range(1, 10)]
for i in range(k):
a = nums.pop(0)
if a % 10 != 0:
nums.append(a * 10 + a % 10 - 1)
nums.append(a * 10 + a % 10)
if a % 10 != 9:
nums.append(a * 10 + a % 10 + 1)
print(a)
| from collections import deque
k = int(eval(input()))
q = deque([i for i in range(1, 10)])
for i in range(k):
a = q.popleft()
if a % 10 != 0:
q.append(a * 10 + a % 10 - 1)
q.append(a * 10 + a % 10)
if a % 10 != 9:
q.append(a * 10 + a % 10 + 1)
print(a)
| false | 6.666667 | [
"+from collections import deque",
"+",
"-nums = [i for i in range(1, 10)]",
"+q = deque([i for i in range(1, 10)])",
"- a = nums.pop(0)",
"+ a = q.popleft()",
"- nums.append(a * 10 + a % 10 - 1)",
"- nums.append(a * 10 + a % 10)",
"+ q.append(a * 10 + a % 10 - 1)",
"+ q.a... | false | 0.359961 | 0.044141 | 8.154702 | [
"s602599121",
"s991519516"
] |
u753803401 | p02971 | python | s751259195 | s709564432 | 556 | 437 | 88,544 | 59,824 | Accepted | Accepted | 21.4 | def slove():
import sys
import copy
input = sys.stdin.readline
n = int(input().rstrip('\n'))
a = [int(input().rstrip('\n')) for _ in range(n)]
b = copy.deepcopy(a)
b.sort(reverse=True)
for v in a:
if v == b[0]:
print((b[1]))
else:
print((b[0]))
if __name__ == '__main__':
slove()
| def slove():
import sys
input = sys.stdin.readline
n = int(input().rstrip('\n'))
a = [int(input().rstrip('\n')) for _ in range(n)]
b = sorted(a, reverse=True)
for i in range(len(a)):
if a[i] == b[0]:
print((b[1]))
else:
print((b[0]))
if __name__ == '__main__':
slove()
| 17 | 15 | 370 | 349 | def slove():
import sys
import copy
input = sys.stdin.readline
n = int(input().rstrip("\n"))
a = [int(input().rstrip("\n")) for _ in range(n)]
b = copy.deepcopy(a)
b.sort(reverse=True)
for v in a:
if v == b[0]:
print((b[1]))
else:
print((b[0]))
if __name__ == "__main__":
slove()
| def slove():
import sys
input = sys.stdin.readline
n = int(input().rstrip("\n"))
a = [int(input().rstrip("\n")) for _ in range(n)]
b = sorted(a, reverse=True)
for i in range(len(a)):
if a[i] == b[0]:
print((b[1]))
else:
print((b[0]))
if __name__ == "__main__":
slove()
| false | 11.764706 | [
"- import copy",
"- b = copy.deepcopy(a)",
"- b.sort(reverse=True)",
"- for v in a:",
"- if v == b[0]:",
"+ b = sorted(a, reverse=True)",
"+ for i in range(len(a)):",
"+ if a[i] == b[0]:"
] | false | 0.064223 | 0.049705 | 1.292093 | [
"s751259195",
"s709564432"
] |
u991567869 | p02984 | python | s302416199 | s916334027 | 106 | 96 | 20,536 | 20,724 | Accepted | Accepted | 9.43 | n = int(eval(input()))
a = list(map(int, input().split()))
ans = a[0]
l = []
for i in range(1, n, 2):
ans -= a[i]
ans += a[i + 1]
l.append(ans)
for i in range(n - 1):
ans = a[i]*2 - ans
l.append(ans)
print((*l)) | n = int(eval(input()))
a = list(map(int, input().split()))
l = []
ans = sum(a[0::2]) - sum(a[1::2])
l.append(ans)
for i in range(n - 1):
l.append(a[i]*2 - l[i])
print((*l)) | 16 | 11 | 238 | 181 | n = int(eval(input()))
a = list(map(int, input().split()))
ans = a[0]
l = []
for i in range(1, n, 2):
ans -= a[i]
ans += a[i + 1]
l.append(ans)
for i in range(n - 1):
ans = a[i] * 2 - ans
l.append(ans)
print((*l))
| n = int(eval(input()))
a = list(map(int, input().split()))
l = []
ans = sum(a[0::2]) - sum(a[1::2])
l.append(ans)
for i in range(n - 1):
l.append(a[i] * 2 - l[i])
print((*l))
| false | 31.25 | [
"-ans = a[0]",
"-for i in range(1, n, 2):",
"- ans -= a[i]",
"- ans += a[i + 1]",
"+ans = sum(a[0::2]) - sum(a[1::2])",
"- ans = a[i] * 2 - ans",
"- l.append(ans)",
"+ l.append(a[i] * 2 - l[i])"
] | false | 0.036928 | 0.10465 | 0.352871 | [
"s302416199",
"s916334027"
] |
u571281863 | p02555 | python | s519937939 | s984740269 | 80 | 24 | 63,520 | 9,184 | Accepted | Accepted | 70 | s=int(eval(input()))
L=[1,1,1]
if s<3:
print((0))
elif s<6:
print((1))
elif 6<=s:
for i in range(s-5):
x=(L[-1]+L[-3])%(10**9+7)
L.append(x)
print((L[-1])) | s=int(eval(input()))
L=[1,1,1]
if s<3:
print((0))
elif s<6:
print((1))
elif 6<=s:
for i in range(s-5):
L.append((L[-1]+L[-3])%(10**9+7))
print((L[-1])) | 11 | 10 | 169 | 160 | s = int(eval(input()))
L = [1, 1, 1]
if s < 3:
print((0))
elif s < 6:
print((1))
elif 6 <= s:
for i in range(s - 5):
x = (L[-1] + L[-3]) % (10**9 + 7)
L.append(x)
print((L[-1]))
| s = int(eval(input()))
L = [1, 1, 1]
if s < 3:
print((0))
elif s < 6:
print((1))
elif 6 <= s:
for i in range(s - 5):
L.append((L[-1] + L[-3]) % (10**9 + 7))
print((L[-1]))
| false | 9.090909 | [
"- x = (L[-1] + L[-3]) % (10**9 + 7)",
"- L.append(x)",
"+ L.append((L[-1] + L[-3]) % (10**9 + 7))"
] | false | 0.097711 | 0.036412 | 2.683474 | [
"s519937939",
"s984740269"
] |
u481221703 | p02406 | python | s982943944 | s618830705 | 30 | 20 | 4,216 | 4,216 | Accepted | Accepted | 33.33 | n=int(input())
i = 1
print("", end=' ')
while(i<=n):
x=i
if x%3 is 0:
print(i, end=' ')
elif x%10 is 3:
print(i, end=' ')
elif (x/10)%10 is 3:
print(i, end=' ')
elif (x/10**2)%10 is 3:
print(i, end=' ')
elif (x/10**3)%10 is 3:
print(i, end=' ')
elif (x/10**4)%10 is 3:
print(i, end=' ')
i = i+1 | n=int(input())
i = 1
print("", end=' ')
while(i<=n):
x=i
if x%3 is 0:
print(i, end=' ')
elif x%10 is 3:
print(i, end=' ')
elif (x/10**1)%10 is 3:
print(i, end=' ')
elif (x/10**2)%10 is 3:
print(i, end=' ')
elif (x/10**3)%10 is 3:
print(i, end=' ')
elif (x/10**4)%10 is 3:
print(i, end=' ')
i = i+1 | 18 | 18 | 332 | 335 | n = int(input())
i = 1
print("", end=" ")
while i <= n:
x = i
if x % 3 is 0:
print(i, end=" ")
elif x % 10 is 3:
print(i, end=" ")
elif (x / 10) % 10 is 3:
print(i, end=" ")
elif (x / 10**2) % 10 is 3:
print(i, end=" ")
elif (x / 10**3) % 10 is 3:
print(i, end=" ")
elif (x / 10**4) % 10 is 3:
print(i, end=" ")
i = i + 1
| n = int(input())
i = 1
print("", end=" ")
while i <= n:
x = i
if x % 3 is 0:
print(i, end=" ")
elif x % 10 is 3:
print(i, end=" ")
elif (x / 10**1) % 10 is 3:
print(i, end=" ")
elif (x / 10**2) % 10 is 3:
print(i, end=" ")
elif (x / 10**3) % 10 is 3:
print(i, end=" ")
elif (x / 10**4) % 10 is 3:
print(i, end=" ")
i = i + 1
| false | 0 | [
"- elif (x / 10) % 10 is 3:",
"+ elif (x / 10**1) % 10 is 3:"
] | false | 0.046896 | 0.047812 | 0.98084 | [
"s982943944",
"s618830705"
] |
u133936772 | p02571 | python | s242314432 | s202053438 | 74 | 63 | 9,108 | 9,080 | Accepted | Accepted | 14.86 | s=eval(input())
t=eval(input())
a=0
for i in range(len(s)-len(t)+1):
c=0
for j,d in enumerate(t):
if s[i+j]==d: c+=1
a=max(a,c)
print((len(t)-a)) | s,t=eval(input()),eval(input())
l=len(t)
print((l-max(sum(s[i+j]==t[j] for j in range(l)) for i in range(len(s)-l+1)))) | 9 | 3 | 149 | 107 | s = eval(input())
t = eval(input())
a = 0
for i in range(len(s) - len(t) + 1):
c = 0
for j, d in enumerate(t):
if s[i + j] == d:
c += 1
a = max(a, c)
print((len(t) - a))
| s, t = eval(input()), eval(input())
l = len(t)
print((l - max(sum(s[i + j] == t[j] for j in range(l)) for i in range(len(s) - l + 1))))
| false | 66.666667 | [
"-s = eval(input())",
"-t = eval(input())",
"-a = 0",
"-for i in range(len(s) - len(t) + 1):",
"- c = 0",
"- for j, d in enumerate(t):",
"- if s[i + j] == d:",
"- c += 1",
"- a = max(a, c)",
"-print((len(t) - a))",
"+s, t = eval(input()), eval(input())",
"+l = len(t)... | false | 0.039736 | 0.049323 | 0.805638 | [
"s242314432",
"s202053438"
] |
u933096856 | p02469 | python | s644006664 | s320124467 | 60 | 50 | 7,788 | 7,800 | Accepted | Accepted | 16.67 | def gcd(x,y):
p=min(x,y)
q=max(x,y)
while p != q:
if q > p:
q = q - p
else:
p = p - q
return q
c=0
n=int(eval(input()))
a=sorted(set(list(map(int, input().split()))))
b=[]
while len(a) > 1:
p=a[0]
q=a[1]
g=gcd(p,q)
if g !=0:
a.append(p*q//g)
a.pop(0)
a.pop(0)
a=sorted(a)
print((*a)) | def gcd(x,y):
p=min(x,y)
q=max(x,y)
while p != q:
if q > p:
q = q - p
else:
p = p - q
return q
n=int(eval(input()))
a=sorted(set(list(map(int, input().split()))))
while len(a) > 1:
p=a[0]
q=a[1]
g=gcd(p,q)
a.append(p*q//g)
a.pop(0)
a.pop(0)
a=sorted(a)
print((*a)) | 24 | 21 | 391 | 361 | def gcd(x, y):
p = min(x, y)
q = max(x, y)
while p != q:
if q > p:
q = q - p
else:
p = p - q
return q
c = 0
n = int(eval(input()))
a = sorted(set(list(map(int, input().split()))))
b = []
while len(a) > 1:
p = a[0]
q = a[1]
g = gcd(p, q)
if g != 0:
a.append(p * q // g)
a.pop(0)
a.pop(0)
a = sorted(a)
print((*a))
| def gcd(x, y):
p = min(x, y)
q = max(x, y)
while p != q:
if q > p:
q = q - p
else:
p = p - q
return q
n = int(eval(input()))
a = sorted(set(list(map(int, input().split()))))
while len(a) > 1:
p = a[0]
q = a[1]
g = gcd(p, q)
a.append(p * q // g)
a.pop(0)
a.pop(0)
a = sorted(a)
print((*a))
| false | 12.5 | [
"-c = 0",
"-b = []",
"- if g != 0:",
"- a.append(p * q // g)",
"+ a.append(p * q // g)"
] | false | 0.044612 | 0.041161 | 1.083831 | [
"s644006664",
"s320124467"
] |
u017415492 | p02732 | python | s881365422 | s702576431 | 559 | 333 | 26,140 | 33,908 | Accepted | Accepted | 40.43 | n=int(eval(input()))
a=list(map(int,input().split()))
sa=sorted(a)
count=1
k=[0]*(n+2)
for i in range(n-1):
if sa[i+1]==sa[i]:
count+=1
else:
k[sa[i]]=count
count=1
k[sa[-1]]=count
ans=0
for i in range(len(k)):
ans+=k[i]*(k[i]-1)/2
for i in a:
print((int(ans-(k[i]*(k[i]-1)/2)+((k[i]-1)*(k[i]-2)/2)))) | from collections import Counter
n= int(eval(input()))
a=list(map(int,input().split()))
ca = Counter(a)
sa = set(a)
sum_ans=0
for i in sa:
sum_ans+=(ca[i]*(ca[i]-1))//2
for i in a:
print((sum_ans-(ca[i]*(ca[i]-1))//2+((ca[i]-1)*(ca[i]-2))//2)) | 17 | 12 | 330 | 251 | n = int(eval(input()))
a = list(map(int, input().split()))
sa = sorted(a)
count = 1
k = [0] * (n + 2)
for i in range(n - 1):
if sa[i + 1] == sa[i]:
count += 1
else:
k[sa[i]] = count
count = 1
k[sa[-1]] = count
ans = 0
for i in range(len(k)):
ans += k[i] * (k[i] - 1) / 2
for i in a:
print((int(ans - (k[i] * (k[i] - 1) / 2) + ((k[i] - 1) * (k[i] - 2) / 2))))
| from collections import Counter
n = int(eval(input()))
a = list(map(int, input().split()))
ca = Counter(a)
sa = set(a)
sum_ans = 0
for i in sa:
sum_ans += (ca[i] * (ca[i] - 1)) // 2
for i in a:
print((sum_ans - (ca[i] * (ca[i] - 1)) // 2 + ((ca[i] - 1) * (ca[i] - 2)) // 2))
| false | 29.411765 | [
"+from collections import Counter",
"+",
"-sa = sorted(a)",
"-count = 1",
"-k = [0] * (n + 2)",
"-for i in range(n - 1):",
"- if sa[i + 1] == sa[i]:",
"- count += 1",
"- else:",
"- k[sa[i]] = count",
"- count = 1",
"-k[sa[-1]] = count",
"-ans = 0",
"-for i in ran... | false | 0.137738 | 0.099965 | 1.377856 | [
"s881365422",
"s702576431"
] |
u614314290 | p03212 | python | s239252474 | s779780439 | 501 | 89 | 3,064 | 2,940 | Accepted | Accepted | 82.24 | S = eval(input())
def solve(s, n=0, tight=True, value=""):
if n == len(s):
while value and value[0] == "0":
value = value[1:]
if set("753") == set(value):
#print(value)
return 1
return 0
hi = int(s[n]) if tight else 9
c = 0
for i in range(hi + 1):
if i in [7, 5, 3, 0]:
c += solve(s, n + 1, tight and not(i < hi), value + str(i))
return c
print((solve(S)))
| S = eval(input())
def solve(s):
if s and int(s) > int(S):
return 0
count = 0
if set(s) == set("753"):
#print(s)
count = 1
for c in "753":
count += solve(s + c)
return count
print((solve("")))
| 18 | 14 | 393 | 212 | S = eval(input())
def solve(s, n=0, tight=True, value=""):
if n == len(s):
while value and value[0] == "0":
value = value[1:]
if set("753") == set(value):
# print(value)
return 1
return 0
hi = int(s[n]) if tight else 9
c = 0
for i in range(hi + 1):
if i in [7, 5, 3, 0]:
c += solve(s, n + 1, tight and not (i < hi), value + str(i))
return c
print((solve(S)))
| S = eval(input())
def solve(s):
if s and int(s) > int(S):
return 0
count = 0
if set(s) == set("753"):
# print(s)
count = 1
for c in "753":
count += solve(s + c)
return count
print((solve("")))
| false | 22.222222 | [
"-def solve(s, n=0, tight=True, value=\"\"):",
"- if n == len(s):",
"- while value and value[0] == \"0\":",
"- value = value[1:]",
"- if set(\"753\") == set(value):",
"- # print(value)",
"- return 1",
"+def solve(s):",
"+ if s and int(s) > int(S):... | false | 0.041387 | 0.183544 | 0.225488 | [
"s239252474",
"s779780439"
] |
u141610915 | p03722 | python | s847574372 | s229354033 | 509 | 94 | 124,992 | 74,320 | Accepted | Accepted | 81.53 | import sys
input = sys.stdin.readline
N, M = list(map(int, input().split()))
e = [set() for _ in range(N + 1)]
reve = [[] for _ in range(N + 1)]
for _ in range(M):
u, v, c = list(map(int, input().split()))
e[u].add((v, -c))
reve[v].append(u)
vis = [0] * (N + 1)
def revdfs(x):
global vis
if x == 1: return True
res = 0
for y in reve[x]:
if vis[y]: continue
vis[y] = 1
res |= revdfs(y)
return res
def dfs(x):
global vis
if x == N: return True
res = 0
for y, _ in e[x]:
if vis[y]: continue
vis[y] = 1
res |= dfs(y)
return res
banned = [0] * (N + 1)
for x in range(1, N + 1):
vis = [0] * (N + 1)
banned[x] |= revdfs(x) ^ 1
vis = [0] * (N + 1)
banned[x] |= dfs(x) ^ 1
for x in range(1, N + 1):
t = list(e[x])
for y, d in t:
if banned[x] | banned[y]: e[x].discard((y, d))
#print(banned)
INF = 10**18
dist = [INF] * (N + 1)
dist[1] = 0
update = 1
for _ in range(N + 1):
update = 0
for v, x in enumerate(e):
for t, cost in x:
if dist[v] != INF and dist[v] + cost < dist[t]:
dist[t] = dist[v] + cost
update = 1
if not update:
break
else:
print("inf")
exit(0)
print((-dist[N])) | import sys
input = sys.stdin.readline
N, M = list(map(int, input().split()))
e = []
for _ in range(M):
u, v, c = list(map(int, input().split()))
e.append((u, v, -c))
inf = 10 ** 18
d = [inf] * (N + 1)
d[1] = 0
for _ in range(N - 1):
for u, v, c in e: d[v] = min(d[v], d[u] + c)
loop = []
for u, v, c in e:
if d[v] > d[u] + c:
d[v] = min(d[v], d[u] + c)
loop.append(v)
if len(loop) == 0:
print((-d[-1]))
exit(0)
for v in loop: d[v] = -inf
for _ in range(N - 1):
for u, v, c in e:
if v == N and (d[v] > d[u] + c): break
d[v] = min(d[v], d[u] + c)
else: continue
break
else:
print((-d[-1]))
exit(0)
print("inf") | 58 | 31 | 1,255 | 661 | import sys
input = sys.stdin.readline
N, M = list(map(int, input().split()))
e = [set() for _ in range(N + 1)]
reve = [[] for _ in range(N + 1)]
for _ in range(M):
u, v, c = list(map(int, input().split()))
e[u].add((v, -c))
reve[v].append(u)
vis = [0] * (N + 1)
def revdfs(x):
global vis
if x == 1:
return True
res = 0
for y in reve[x]:
if vis[y]:
continue
vis[y] = 1
res |= revdfs(y)
return res
def dfs(x):
global vis
if x == N:
return True
res = 0
for y, _ in e[x]:
if vis[y]:
continue
vis[y] = 1
res |= dfs(y)
return res
banned = [0] * (N + 1)
for x in range(1, N + 1):
vis = [0] * (N + 1)
banned[x] |= revdfs(x) ^ 1
vis = [0] * (N + 1)
banned[x] |= dfs(x) ^ 1
for x in range(1, N + 1):
t = list(e[x])
for y, d in t:
if banned[x] | banned[y]:
e[x].discard((y, d))
# print(banned)
INF = 10**18
dist = [INF] * (N + 1)
dist[1] = 0
update = 1
for _ in range(N + 1):
update = 0
for v, x in enumerate(e):
for t, cost in x:
if dist[v] != INF and dist[v] + cost < dist[t]:
dist[t] = dist[v] + cost
update = 1
if not update:
break
else:
print("inf")
exit(0)
print((-dist[N]))
| import sys
input = sys.stdin.readline
N, M = list(map(int, input().split()))
e = []
for _ in range(M):
u, v, c = list(map(int, input().split()))
e.append((u, v, -c))
inf = 10**18
d = [inf] * (N + 1)
d[1] = 0
for _ in range(N - 1):
for u, v, c in e:
d[v] = min(d[v], d[u] + c)
loop = []
for u, v, c in e:
if d[v] > d[u] + c:
d[v] = min(d[v], d[u] + c)
loop.append(v)
if len(loop) == 0:
print((-d[-1]))
exit(0)
for v in loop:
d[v] = -inf
for _ in range(N - 1):
for u, v, c in e:
if v == N and (d[v] > d[u] + c):
break
d[v] = min(d[v], d[u] + c)
else:
continue
break
else:
print((-d[-1]))
exit(0)
print("inf")
| false | 46.551724 | [
"-e = [set() for _ in range(N + 1)]",
"-reve = [[] for _ in range(N + 1)]",
"+e = []",
"- e[u].add((v, -c))",
"- reve[v].append(u)",
"-vis = [0] * (N + 1)",
"-",
"-",
"-def revdfs(x):",
"- global vis",
"- if x == 1:",
"- return True",
"- res = 0",
"- for y in reve[... | false | 0.040506 | 0.096043 | 0.421748 | [
"s847574372",
"s229354033"
] |
u447423362 | p02388 | python | s447252480 | s335760287 | 20 | 10 | 4,188 | 4,188 | Accepted | Accepted | 50 | x = int(input())
print((x**3)) | print(((int(input()))**3)) | 2 | 1 | 34 | 29 | x = int(input())
print((x**3))
| print(((int(input())) ** 3))
| false | 50 | [
"-x = int(input())",
"-print((x**3))",
"+print(((int(input())) ** 3))"
] | false | 0.203703 | 0.126369 | 1.61197 | [
"s447252480",
"s335760287"
] |
u497326082 | p02687 | python | s218406580 | s848068527 | 313 | 20 | 79,608 | 9,016 | Accepted | Accepted | 93.61 | if eval(input())=="ABC":
print("ARC")
else:
print("ABC")
| S = eval(input())
if S == "ARC":
print("ABC")
else:
print("ARC") | 4 | 5 | 56 | 66 | if eval(input()) == "ABC":
print("ARC")
else:
print("ABC")
| S = eval(input())
if S == "ARC":
print("ABC")
else:
print("ARC")
| false | 20 | [
"-if eval(input()) == \"ABC\":",
"+S = eval(input())",
"+if S == \"ARC\":",
"+ print(\"ABC\")",
"+else:",
"-else:",
"- print(\"ABC\")"
] | false | 0.04434 | 0.040131 | 1.104865 | [
"s218406580",
"s848068527"
] |
u753803401 | p03993 | python | s368878726 | s530983373 | 218 | 195 | 56,236 | 52,976 | Accepted | Accepted | 10.55 | def slove():
import sys
input = sys.stdin.readline
n = int(input().rstrip('\n'))
a = [i - 1 for i in list(map(int, input().rstrip('\n').split()))]
cnt = 0
for i in range(len(a)):
if i == a[a[i]]:
cnt += 1
print((cnt // 2))
if __name__ == '__main__':
slove()
| import sys
def solve():
readline = sys.stdin.buffer.readline
mod = 10 ** 9 + 7
n = int(readline())
a = list(map(int, readline().split()))
cnt = 0
for i in range(n):
if i + 1 == a[a[i]-1]:
cnt += 1
print((cnt // 2))
if __name__ == '__main__':
solve()
| 14 | 17 | 323 | 320 | def slove():
import sys
input = sys.stdin.readline
n = int(input().rstrip("\n"))
a = [i - 1 for i in list(map(int, input().rstrip("\n").split()))]
cnt = 0
for i in range(len(a)):
if i == a[a[i]]:
cnt += 1
print((cnt // 2))
if __name__ == "__main__":
slove()
| import sys
def solve():
readline = sys.stdin.buffer.readline
mod = 10**9 + 7
n = int(readline())
a = list(map(int, readline().split()))
cnt = 0
for i in range(n):
if i + 1 == a[a[i] - 1]:
cnt += 1
print((cnt // 2))
if __name__ == "__main__":
solve()
| false | 17.647059 | [
"-def slove():",
"- import sys",
"+import sys",
"- input = sys.stdin.readline",
"- n = int(input().rstrip(\"\\n\"))",
"- a = [i - 1 for i in list(map(int, input().rstrip(\"\\n\").split()))]",
"+",
"+def solve():",
"+ readline = sys.stdin.buffer.readline",
"+ mod = 10**9 + 7",
"... | false | 0.034332 | 0.03596 | 0.95472 | [
"s368878726",
"s530983373"
] |
u888092736 | p02971 | python | s225593835 | s451150847 | 507 | 173 | 17,268 | 31,792 | Accepted | Accepted | 65.88 | import sys
def input():
return sys.stdin.readline().strip()
N = int(input())
A = [int(input()) for _ in range(N)]
left = [0] * N
right = [0] * N
for i in range(1, N):
left[i] = max(A[i - 1], left[i - 1])
right[N - i - 1] = max(A[N - i], right[N - i])
[print(max(left[i], right[i])) for i in range(N)]
| N, *A = list(map(int, open(0).read().split()))
sorted_A = sorted(A)
for a in A:
if a == sorted_A[-1]:
print((sorted_A[-2]))
else:
print((sorted_A[-1]))
| 15 | 7 | 330 | 172 | import sys
def input():
return sys.stdin.readline().strip()
N = int(input())
A = [int(input()) for _ in range(N)]
left = [0] * N
right = [0] * N
for i in range(1, N):
left[i] = max(A[i - 1], left[i - 1])
right[N - i - 1] = max(A[N - i], right[N - i])
[print(max(left[i], right[i])) for i in range(N)]
| N, *A = list(map(int, open(0).read().split()))
sorted_A = sorted(A)
for a in A:
if a == sorted_A[-1]:
print((sorted_A[-2]))
else:
print((sorted_A[-1]))
| false | 53.333333 | [
"-import sys",
"-",
"-",
"-def input():",
"- return sys.stdin.readline().strip()",
"-",
"-",
"-N = int(input())",
"-A = [int(input()) for _ in range(N)]",
"-left = [0] * N",
"-right = [0] * N",
"-for i in range(1, N):",
"- left[i] = max(A[i - 1], left[i - 1])",
"- right[N - i - 1]... | false | 0.036348 | 0.037161 | 0.978121 | [
"s225593835",
"s451150847"
] |
u652057333 | p02728 | python | s468690339 | s524024586 | 2,965 | 2,648 | 175,176 | 160,840 | Accepted | Accepted | 10.69 | # 全方位DP
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)
from collections import defaultdict, deque
from math import factorial
MOD = 10**9+7
class Facts():
def __init__(self, max_num=10**5, p=10**9 + 7):
self.p = p
self.max_num = max_num
self.fact = [1] * (self.max_num + 1)
for i in range(1, self.max_num + 1):
self.fact[i] = self.fact[i-1] * i
self.fact[i] %= self.p
def power_func(self, a, b):
ans = 1
while b > 0:
if b & 1:
ans = ans * a % self.p
a = a * a % self.p
b >>= 1
return ans
def fact_inv(self, a):
return self.power_func(a, self.p-2) % self.p
n = int(input())
fact = Facts(max_num=200000)
edges = defaultdict(lambda: [])
for _ in range(n-1):
a, b = map(int, input().split())
edges[a].append(b)
edges[b].append(a)
# step1 吸い上げ
size = [1 for _ in range(n+1)]
def dfs1(num, par=-1):
res = 1
for node in edges[num]:
if node == par:
continue
else:
res += dfs1(node, num)
res %= MOD
size[num] = res
return res
dfs1(1)
# print(size)
dp = [0 for _ in range(n+1)]
def dfs2(n, par=-1):
res = fact.fact[size[n] - 1]
for node in edges[n]:
if node == par:
continue
else:
res *= dfs2(node, n) * fact.fact_inv(fact.fact[size[node]])
res %= MOD
dp[n] = res
return res
dfs2(1)
# print(dp)
# step2 還元
ans = [0 for _ in range(n+1)]
inv_1 = fact.fact_inv(fact.fact[n-1])
def dfs3(num, par=-1):
if par != -1:
res = dp[num] * fact.fact_inv(fact.fact[size[num] - 1]) * \
fact.fact[n-1] * ans[par] * inv_1 * \
fact.fact[n-size[num]-1] * fact.fact[size[num]] * \
fact.fact_inv(dp[num]) * \
fact.fact_inv(fact.fact[n-size[num]]) % MOD
ans[num] = res
else:
ans[num] = dp[num]
for node in edges[num]:
if node == par:
continue
dfs3(node, num)
dfs3(1)
print("\n".join(list(map(str, ans[1:]))))
| # 全方位DP
import sys
input = lambda: sys.stdin.readline().rstrip()
sys.setrecursionlimit(10**6)
from collections import defaultdict, deque
from math import factorial
MOD = 10**9+7
class Facts():
def __init__(self, max_num=10**5, p=10**9 + 7):
self.p = p
self.max_num = max_num
self.fact = [1] * (self.max_num + 1)
for i in range(1, self.max_num + 1):
self.fact[i] = self.fact[i-1] * i
self.fact[i] %= self.p
def power_func(self, a, b):
ans = 1
while b > 0:
if b & 1:
ans = ans * a % self.p
a = a * a % self.p
b >>= 1
return ans
def fact_inv(self, a):
return self.power_func(a, self.p-2) % self.p
n = int(input())
fact = Facts(max_num=200000)
edges = defaultdict(lambda: [])
for _ in range(n-1):
a, b = map(int, input().split())
edges[a].append(b)
edges[b].append(a)
# step1 吸い上げ
size = [1 for _ in range(n+1)]
def dfs1(num, par=-1):
res = 1
for node in edges[num]:
if node == par:
continue
else:
res += dfs1(node, num)
res %= MOD
size[num] = res
return res
dfs1(1)
# print(size)
dp = [0 for _ in range(n+1)]
def dfs2(n, par=-1):
res = fact.fact[size[n] - 1]
for node in edges[n]:
if node == par:
continue
else:
res *= dfs2(node, n) * fact.fact_inv(fact.fact[size[node]])
res %= MOD
dp[n] = res
return res
dfs2(1)
# print(dp)
# step2 還元
ans = [0 for _ in range(n+1)]
inv_1 = fact.fact_inv(fact.fact[n-1])
def dfs3(num, par=-1):
if par != -1:
res = dp[num] * fact.fact_inv(fact.fact[size[num] - 1]) * \
fact.fact[n-1] * ans[par] * inv_1 * \
fact.fact[n-size[num]-1] * fact.fact[size[num]] * \
fact.fact_inv(dp[num]) * \
fact.fact_inv(fact.fact[n-size[num]]) % MOD
ans[num] = res
else:
ans[num] = dp[num]
for node in edges[num]:
if node == par:
continue
dfs3(node, num)
dfs3(1)
print("\n".join(list(map(str, ans[1:]))))
| 85 | 85 | 2,183 | 2,202 | # 全方位DP
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)
from collections import defaultdict, deque
from math import factorial
MOD = 10**9 + 7
class Facts:
def __init__(self, max_num=10**5, p=10**9 + 7):
self.p = p
self.max_num = max_num
self.fact = [1] * (self.max_num + 1)
for i in range(1, self.max_num + 1):
self.fact[i] = self.fact[i - 1] * i
self.fact[i] %= self.p
def power_func(self, a, b):
ans = 1
while b > 0:
if b & 1:
ans = ans * a % self.p
a = a * a % self.p
b >>= 1
return ans
def fact_inv(self, a):
return self.power_func(a, self.p - 2) % self.p
n = int(input())
fact = Facts(max_num=200000)
edges = defaultdict(lambda: [])
for _ in range(n - 1):
a, b = map(int, input().split())
edges[a].append(b)
edges[b].append(a)
# step1 吸い上げ
size = [1 for _ in range(n + 1)]
def dfs1(num, par=-1):
res = 1
for node in edges[num]:
if node == par:
continue
else:
res += dfs1(node, num)
res %= MOD
size[num] = res
return res
dfs1(1)
# print(size)
dp = [0 for _ in range(n + 1)]
def dfs2(n, par=-1):
res = fact.fact[size[n] - 1]
for node in edges[n]:
if node == par:
continue
else:
res *= dfs2(node, n) * fact.fact_inv(fact.fact[size[node]])
res %= MOD
dp[n] = res
return res
dfs2(1)
# print(dp)
# step2 還元
ans = [0 for _ in range(n + 1)]
inv_1 = fact.fact_inv(fact.fact[n - 1])
def dfs3(num, par=-1):
if par != -1:
res = (
dp[num]
* fact.fact_inv(fact.fact[size[num] - 1])
* fact.fact[n - 1]
* ans[par]
* inv_1
* fact.fact[n - size[num] - 1]
* fact.fact[size[num]]
* fact.fact_inv(dp[num])
* fact.fact_inv(fact.fact[n - size[num]])
% MOD
)
ans[num] = res
else:
ans[num] = dp[num]
for node in edges[num]:
if node == par:
continue
dfs3(node, num)
dfs3(1)
print("\n".join(list(map(str, ans[1:]))))
| # 全方位DP
import sys
input = lambda: sys.stdin.readline().rstrip()
sys.setrecursionlimit(10**6)
from collections import defaultdict, deque
from math import factorial
MOD = 10**9 + 7
class Facts:
def __init__(self, max_num=10**5, p=10**9 + 7):
self.p = p
self.max_num = max_num
self.fact = [1] * (self.max_num + 1)
for i in range(1, self.max_num + 1):
self.fact[i] = self.fact[i - 1] * i
self.fact[i] %= self.p
def power_func(self, a, b):
ans = 1
while b > 0:
if b & 1:
ans = ans * a % self.p
a = a * a % self.p
b >>= 1
return ans
def fact_inv(self, a):
return self.power_func(a, self.p - 2) % self.p
n = int(input())
fact = Facts(max_num=200000)
edges = defaultdict(lambda: [])
for _ in range(n - 1):
a, b = map(int, input().split())
edges[a].append(b)
edges[b].append(a)
# step1 吸い上げ
size = [1 for _ in range(n + 1)]
def dfs1(num, par=-1):
res = 1
for node in edges[num]:
if node == par:
continue
else:
res += dfs1(node, num)
res %= MOD
size[num] = res
return res
dfs1(1)
# print(size)
dp = [0 for _ in range(n + 1)]
def dfs2(n, par=-1):
res = fact.fact[size[n] - 1]
for node in edges[n]:
if node == par:
continue
else:
res *= dfs2(node, n) * fact.fact_inv(fact.fact[size[node]])
res %= MOD
dp[n] = res
return res
dfs2(1)
# print(dp)
# step2 還元
ans = [0 for _ in range(n + 1)]
inv_1 = fact.fact_inv(fact.fact[n - 1])
def dfs3(num, par=-1):
if par != -1:
res = (
dp[num]
* fact.fact_inv(fact.fact[size[num] - 1])
* fact.fact[n - 1]
* ans[par]
* inv_1
* fact.fact[n - size[num] - 1]
* fact.fact[size[num]]
* fact.fact_inv(dp[num])
* fact.fact_inv(fact.fact[n - size[num]])
% MOD
)
ans[num] = res
else:
ans[num] = dp[num]
for node in edges[num]:
if node == par:
continue
dfs3(node, num)
dfs3(1)
print("\n".join(list(map(str, ans[1:]))))
| false | 0 | [
"-input = sys.stdin.readline",
"+input = lambda: sys.stdin.readline().rstrip()"
] | false | 0.036807 | 0.072481 | 0.507825 | [
"s468690339",
"s524024586"
] |
u677440371 | p03761 | python | s144483011 | s424488118 | 22 | 19 | 3,316 | 2,940 | Accepted | Accepted | 13.64 | N = int(eval(input()))
S = []
for i in range(N):
S.append(str(eval(input())))
import collections
L = []
for s in S:
S_dict = collections.Counter(s)
# print(S_dict.keys())
for i in list(S_dict.keys()):
L.append(i)
# print(L)
ans = ""
for i in "abcdefghijklmnopqrstuvwxyz":
if L.count(i) == N:
check = 10 ** 18
for j in S:
check = min(j.count(i), check)
ans += i * check
print(ans) | n = int(eval(input()))
L = []
for i in range(n):
L.append(eval(input()))
ans = ''
for i in 'abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ':
tmp = []
for j in range(n):
tmp.append(L[j].count(i))
ans += i * min(tmp)
print(ans)
| 21 | 12 | 446 | 256 | N = int(eval(input()))
S = []
for i in range(N):
S.append(str(eval(input())))
import collections
L = []
for s in S:
S_dict = collections.Counter(s)
# print(S_dict.keys())
for i in list(S_dict.keys()):
L.append(i)
# print(L)
ans = ""
for i in "abcdefghijklmnopqrstuvwxyz":
if L.count(i) == N:
check = 10**18
for j in S:
check = min(j.count(i), check)
ans += i * check
print(ans)
| n = int(eval(input()))
L = []
for i in range(n):
L.append(eval(input()))
ans = ""
for i in "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ":
tmp = []
for j in range(n):
tmp.append(L[j].count(i))
ans += i * min(tmp)
print(ans)
| false | 42.857143 | [
"-N = int(eval(input()))",
"-S = []",
"-for i in range(N):",
"- S.append(str(eval(input())))",
"-import collections",
"-",
"+n = int(eval(input()))",
"-for s in S:",
"- S_dict = collections.Counter(s)",
"- # print(S_dict.keys())",
"- for i in list(S_dict.keys()):",
"- L.... | false | 0.042667 | 0.045656 | 0.934537 | [
"s144483011",
"s424488118"
] |
u797106134 | p02615 | python | s204705056 | s132104376 | 254 | 157 | 31,700 | 31,520 | Accepted | Accepted | 38.19 | # 貪欲に大きい順に入れていって，入れる場所はもっとも周りが大きくなる場所
# この方針は正しいただし，値の取り出しだけではなく挿入が起こるので，優先度付きキュー（heap）を使う必要があるっ
N = int(eval(input()))
A = list(map(int,input().split()))
A.sort(reverse=True)
import heapq
C = []
# heapは最小値しか取り出せないことに注意
heapq.heapify(C)
ans = 0
# 初期条件として2つの値を挿入する
heapq.heappush(C,-A[0])
for i in range(1,N):
tmp = heapq.heappop(C)
ans += -tmp
heapq.heappush(C, -A[i])
heapq.heappush(C, -A[i])
print(ans)
| N = int(eval(input()))
A = list(map(int,input().split()))
A.sort(reverse=True)
ans = 0
for i in range(N-1):
if i == 0:
ans += A[i]
else:
ans += A[1+(i-1)//2]
print(ans) | 22 | 10 | 440 | 195 | # 貪欲に大きい順に入れていって，入れる場所はもっとも周りが大きくなる場所
# この方針は正しいただし，値の取り出しだけではなく挿入が起こるので，優先度付きキュー（heap）を使う必要があるっ
N = int(eval(input()))
A = list(map(int, input().split()))
A.sort(reverse=True)
import heapq
C = []
# heapは最小値しか取り出せないことに注意
heapq.heapify(C)
ans = 0
# 初期条件として2つの値を挿入する
heapq.heappush(C, -A[0])
for i in range(1, N):
tmp = heapq.heappop(C)
ans += -tmp
heapq.heappush(C, -A[i])
heapq.heappush(C, -A[i])
print(ans)
| N = int(eval(input()))
A = list(map(int, input().split()))
A.sort(reverse=True)
ans = 0
for i in range(N - 1):
if i == 0:
ans += A[i]
else:
ans += A[1 + (i - 1) // 2]
print(ans)
| false | 54.545455 | [
"-# 貪欲に大きい順に入れていって，入れる場所はもっとも周りが大きくなる場所",
"-# この方針は正しいただし，値の取り出しだけではなく挿入が起こるので，優先度付きキュー（heap）を使う必要があるっ",
"-import heapq",
"-",
"-C = []",
"-# heapは最小値しか取り出せないことに注意",
"-heapq.heapify(C)",
"-# 初期条件として2つの値を挿入する",
"-heapq.heappush(C, -A[0])",
"-for i in range(1, N):",
"- tmp = heapq.heappop(C)",
... | false | 0.044815 | 0.042702 | 1.049492 | [
"s204705056",
"s132104376"
] |
u958310608 | p02836 | python | s858479088 | s352643593 | 276 | 17 | 18,872 | 3,060 | Accepted | Accepted | 93.84 | import numpy as np
s = list(str(eval(input())))
if len(s) % 2 == 1:
c = len(s) // 2
del s[c]
half_len = int(len(s)/2)
h = s[:half_len]
t = s[-half_len:]
t.reverse()
count = 0
for i in range(0, half_len):
if h[i] != t[i]:
count = count + 1
print(count) | s = list(str(eval(input())))
half_len = int(len(s)/2)
h = s[:half_len]
t = s[-half_len:]
t.reverse()
count = 0
for i in range(0, half_len):
if h[i] != t[i]:
count = count + 1
print(count) | 18 | 12 | 276 | 202 | import numpy as np
s = list(str(eval(input())))
if len(s) % 2 == 1:
c = len(s) // 2
del s[c]
half_len = int(len(s) / 2)
h = s[:half_len]
t = s[-half_len:]
t.reverse()
count = 0
for i in range(0, half_len):
if h[i] != t[i]:
count = count + 1
print(count)
| s = list(str(eval(input())))
half_len = int(len(s) / 2)
h = s[:half_len]
t = s[-half_len:]
t.reverse()
count = 0
for i in range(0, half_len):
if h[i] != t[i]:
count = count + 1
print(count)
| false | 33.333333 | [
"-import numpy as np",
"-",
"-if len(s) % 2 == 1:",
"- c = len(s) // 2",
"- del s[c]"
] | false | 0.105194 | 0.036762 | 2.861526 | [
"s858479088",
"s352643593"
] |
u796942881 | p03575 | python | s257292653 | s569421621 | 25 | 18 | 3,064 | 3,064 | Accepted | Accepted | 28 | N, M = list(map(int, input().split()))
graph = [[False for j in range(N)] for i in range(N)]
am = [0] * M
bm = [0] * M
def dfs(visited, n):
visited[n] = True
for k, v in enumerate(visited):
if v:
continue
if not graph[n][k]:
continue
visited = dfs(visited, k)
return visited
def main():
for i in range(M):
# 0-indexed
ai, bi = list(map(int, input().split()))
ai -= 1
bi -= 1
am[i] = ai
bm[i] = bi
graph[ai][bi] = True
graph[bi][ai] = True
ans = 0
for ai, bi in zip(am, bm):
graph[ai][bi] = False
graph[bi][ai] = False
# 訪問済 All False
visited = dfs([False] * N, 0)
# All True ならば 橋 ではない
if not all(visited):
ans += 1
# 元に戻す
graph[ai][bi] = True
graph[bi][ai] = True
print(ans)
return
main()
| N, M = list(map(int, input().split()))
graph = [[] for i in range(N)]
for i in range(M):
ai, bi = list(map(int, input().split()))
ai -= 1
bi -= 1
graph[ai].append(bi)
graph[bi].append(ai)
rank = [N] * N
low = [N] * N
visited = [False] * N
def dfs(k, pos, parent):
rank[pos] = k
low[pos] = k
k += 1
visited[pos] = True
for i in graph[pos]:
if not visited[i]:
dfs(k, i, pos)
low[pos] = min(low[pos], low[i])
elif i != parent:
low[pos] = min(low[pos], rank[i])
def main():
dfs(0, 0, -1)
ans = 0
for i in range(N):
for j in graph[i]:
if rank[j] < low[i]:
ans += 1
print(ans)
return
main()
| 58 | 47 | 983 | 782 | N, M = list(map(int, input().split()))
graph = [[False for j in range(N)] for i in range(N)]
am = [0] * M
bm = [0] * M
def dfs(visited, n):
visited[n] = True
for k, v in enumerate(visited):
if v:
continue
if not graph[n][k]:
continue
visited = dfs(visited, k)
return visited
def main():
for i in range(M):
# 0-indexed
ai, bi = list(map(int, input().split()))
ai -= 1
bi -= 1
am[i] = ai
bm[i] = bi
graph[ai][bi] = True
graph[bi][ai] = True
ans = 0
for ai, bi in zip(am, bm):
graph[ai][bi] = False
graph[bi][ai] = False
# 訪問済 All False
visited = dfs([False] * N, 0)
# All True ならば 橋 ではない
if not all(visited):
ans += 1
# 元に戻す
graph[ai][bi] = True
graph[bi][ai] = True
print(ans)
return
main()
| N, M = list(map(int, input().split()))
graph = [[] for i in range(N)]
for i in range(M):
ai, bi = list(map(int, input().split()))
ai -= 1
bi -= 1
graph[ai].append(bi)
graph[bi].append(ai)
rank = [N] * N
low = [N] * N
visited = [False] * N
def dfs(k, pos, parent):
rank[pos] = k
low[pos] = k
k += 1
visited[pos] = True
for i in graph[pos]:
if not visited[i]:
dfs(k, i, pos)
low[pos] = min(low[pos], low[i])
elif i != parent:
low[pos] = min(low[pos], rank[i])
def main():
dfs(0, 0, -1)
ans = 0
for i in range(N):
for j in graph[i]:
if rank[j] < low[i]:
ans += 1
print(ans)
return
main()
| false | 18.965517 | [
"-graph = [[False for j in range(N)] for i in range(N)]",
"-am = [0] * M",
"-bm = [0] * M",
"+graph = [[] for i in range(N)]",
"+for i in range(M):",
"+ ai, bi = list(map(int, input().split()))",
"+ ai -= 1",
"+ bi -= 1",
"+ graph[ai].append(bi)",
"+ graph[bi].append(ai)",
"+rank ... | false | 0.046707 | 0.047845 | 0.976213 | [
"s257292653",
"s569421621"
] |
u837286475 | p03266 | python | s761750546 | s739519103 | 125 | 17 | 2,940 | 3,060 | Accepted | Accepted | 86.4 |
n, k = list(map(int, input().split()))
no_rem = 0
rem_half = 0
for i in range(1,n+1):
no_rem += 1 if i % k == 0 else 0
rem_half += 1 if k%2 == 0 and i%k == k//2 else 0
print((no_rem ** 3 + rem_half**3))
|
n, k = list(map(int, input().split()))
def solve1():
no_rem = 0
rem_half = 0
for i in range(1,n+1):
no_rem += 1 if i % k == 0 else 0
rem_half += 1 if k%2 == 0 and i%k == k//2 else 0
print((no_rem ** 3 + rem_half**3))
def solve2():
no_rem = n//k
rem_half = 0 if k%2==1 else (n + k//2)//k
print((no_rem**3 + rem_half**3))
solve2() | 13 | 22 | 224 | 396 | n, k = list(map(int, input().split()))
no_rem = 0
rem_half = 0
for i in range(1, n + 1):
no_rem += 1 if i % k == 0 else 0
rem_half += 1 if k % 2 == 0 and i % k == k // 2 else 0
print((no_rem**3 + rem_half**3))
| n, k = list(map(int, input().split()))
def solve1():
no_rem = 0
rem_half = 0
for i in range(1, n + 1):
no_rem += 1 if i % k == 0 else 0
rem_half += 1 if k % 2 == 0 and i % k == k // 2 else 0
print((no_rem**3 + rem_half**3))
def solve2():
no_rem = n // k
rem_half = 0 if k % 2 == 1 else (n + k // 2) // k
print((no_rem**3 + rem_half**3))
solve2()
| false | 40.909091 | [
"-no_rem = 0",
"-rem_half = 0",
"-for i in range(1, n + 1):",
"- no_rem += 1 if i % k == 0 else 0",
"- rem_half += 1 if k % 2 == 0 and i % k == k // 2 else 0",
"-print((no_rem**3 + rem_half**3))",
"+",
"+",
"+def solve1():",
"+ no_rem = 0",
"+ rem_half = 0",
"+ for i in range(1,... | false | 0.041441 | 0.037715 | 1.098811 | [
"s761750546",
"s739519103"
] |
u192154323 | p03164 | python | s237337063 | s559591106 | 1,135 | 708 | 311,888 | 328,528 | Accepted | Accepted | 37.62 | n,w = list(map(int,input().split()))
w_ls, v_ls = [0] * n, [0] * n
for i in range(n):
w_ls[i], v_ls[i] = list(map(int,input().split()))
V = sum(v_ls)
dp = [[float("inf")] * (V+1) for _ in range(n+1)]
dp[0][0] = 0
for i in range(n):
for j in range(V+1):
if j - v_ls[i] >= 0:
dp[i+1][j] = min(dp[i+1][j], dp[i][j-v_ls[i]] + w_ls[i])
dp[i+1][j] = min(dp[i+1][j], dp[i][j])
ans = 0
for j in range(V+1):
if dp[n][j] <= w:
ans = j
print(ans) | n,w_limit = list(map(int,input().split()))
item_ls = [[0,0]]
total_value = 0
for i in range(n):
cost, value = list(map(int,input().split()))
item_ls.append([cost, value])
total_value += value
dp = [[float('inf')] * (total_value+1) for _ in range(n+1)]
dp[0][0] = 0
for i in range(1,n+1):
item_cost, item_value = item_ls[i]
for sum_value in range(0,total_value+1):
if sum_value-item_value >= 0:
dp[i][sum_value] = min(dp[i][sum_value], dp[i-1][sum_value-item_value] + item_cost)
dp[i][sum_value] = min(dp[i][sum_value], dp[i-1][sum_value])
ans = 0
for value, cost in enumerate(dp[n]):
if cost <= w_limit:
ans = max(ans, value)
print(ans)
| 19 | 24 | 491 | 712 | n, w = list(map(int, input().split()))
w_ls, v_ls = [0] * n, [0] * n
for i in range(n):
w_ls[i], v_ls[i] = list(map(int, input().split()))
V = sum(v_ls)
dp = [[float("inf")] * (V + 1) for _ in range(n + 1)]
dp[0][0] = 0
for i in range(n):
for j in range(V + 1):
if j - v_ls[i] >= 0:
dp[i + 1][j] = min(dp[i + 1][j], dp[i][j - v_ls[i]] + w_ls[i])
dp[i + 1][j] = min(dp[i + 1][j], dp[i][j])
ans = 0
for j in range(V + 1):
if dp[n][j] <= w:
ans = j
print(ans)
| n, w_limit = list(map(int, input().split()))
item_ls = [[0, 0]]
total_value = 0
for i in range(n):
cost, value = list(map(int, input().split()))
item_ls.append([cost, value])
total_value += value
dp = [[float("inf")] * (total_value + 1) for _ in range(n + 1)]
dp[0][0] = 0
for i in range(1, n + 1):
item_cost, item_value = item_ls[i]
for sum_value in range(0, total_value + 1):
if sum_value - item_value >= 0:
dp[i][sum_value] = min(
dp[i][sum_value], dp[i - 1][sum_value - item_value] + item_cost
)
dp[i][sum_value] = min(dp[i][sum_value], dp[i - 1][sum_value])
ans = 0
for value, cost in enumerate(dp[n]):
if cost <= w_limit:
ans = max(ans, value)
print(ans)
| false | 20.833333 | [
"-n, w = list(map(int, input().split()))",
"-w_ls, v_ls = [0] * n, [0] * n",
"+n, w_limit = list(map(int, input().split()))",
"+item_ls = [[0, 0]]",
"+total_value = 0",
"- w_ls[i], v_ls[i] = list(map(int, input().split()))",
"-V = sum(v_ls)",
"-dp = [[float(\"inf\")] * (V + 1) for _ in range(n + 1)... | false | 0.064032 | 0.177193 | 0.361368 | [
"s237337063",
"s559591106"
] |
u562935282 | p03862 | python | s865959356 | s964785156 | 104 | 91 | 14,252 | 14,540 | Accepted | Accepted | 12.5 | def inpl(): return input().split()
n, x = list(map(int, inpl()))
a = list(map(int, inpl()))
ans = 0
if a[0] > x:
ans += a[0] - x
a[0] = x
for i in range(1, n):
if (a[i-1] + a[i]) > x:
ans += (a[i-1] + a[i]) - x
a[i] = x - a[i-1]
print(ans)
| n, x = list(map(int, input().split()))
a = list(map(int, input().split()))
ans = 0
b = 0
for i in range(n):
c = b + a[i]
if c > x:
ans += c - x
b = a[i] + x - c
else:
b = a[i]
print(ans) | 12 | 14 | 281 | 231 | def inpl():
return input().split()
n, x = list(map(int, inpl()))
a = list(map(int, inpl()))
ans = 0
if a[0] > x:
ans += a[0] - x
a[0] = x
for i in range(1, n):
if (a[i - 1] + a[i]) > x:
ans += (a[i - 1] + a[i]) - x
a[i] = x - a[i - 1]
print(ans)
| n, x = list(map(int, input().split()))
a = list(map(int, input().split()))
ans = 0
b = 0
for i in range(n):
c = b + a[i]
if c > x:
ans += c - x
b = a[i] + x - c
else:
b = a[i]
print(ans)
| false | 14.285714 | [
"-def inpl():",
"- return input().split()",
"-",
"-",
"-n, x = list(map(int, inpl()))",
"-a = list(map(int, inpl()))",
"+n, x = list(map(int, input().split()))",
"+a = list(map(int, input().split()))",
"-if a[0] > x:",
"- ans += a[0] - x",
"- a[0] = x",
"-for i in range(1, n):",
"- ... | false | 0.036816 | 0.037281 | 0.987531 | [
"s865959356",
"s964785156"
] |
u188827677 | p02861 | python | s426798298 | s021027635 | 424 | 286 | 8,180 | 9,404 | Accepted | Accepted | 32.55 | from itertools import permutations
N = int(eval(input()))
xy = [list(map(int, input().split())) for _ in range(N)]
ans = 0
l = list(permutations(xy,N))
for i in l:
for j in range(N-1):
ans += ((i[j][0] - i[j+1][0])**2 + (i[j][1] - i[j+1][1])**2)**0.5
print((ans/len(l))) | from itertools import permutations
n = int(eval(input()))
xy = [list(map(int, input().split())) for _ in range(n)]
ans = 0
count = 0
for i in permutations(list(range(n)), n):
for j in range(n-1):
ans += ((xy[i[j]][0] - xy[i[j+1]][0])**2 + (xy[i[j]][1] - xy[i[j+1]][1])**2)**0.5
count += 1
print((ans/count)) | 10 | 12 | 278 | 314 | from itertools import permutations
N = int(eval(input()))
xy = [list(map(int, input().split())) for _ in range(N)]
ans = 0
l = list(permutations(xy, N))
for i in l:
for j in range(N - 1):
ans += ((i[j][0] - i[j + 1][0]) ** 2 + (i[j][1] - i[j + 1][1]) ** 2) ** 0.5
print((ans / len(l)))
| from itertools import permutations
n = int(eval(input()))
xy = [list(map(int, input().split())) for _ in range(n)]
ans = 0
count = 0
for i in permutations(list(range(n)), n):
for j in range(n - 1):
ans += (
(xy[i[j]][0] - xy[i[j + 1]][0]) ** 2 + (xy[i[j]][1] - xy[i[j + 1]][1]) ** 2
) ** 0.5
count += 1
print((ans / count))
| false | 16.666667 | [
"-N = int(eval(input()))",
"-xy = [list(map(int, input().split())) for _ in range(N)]",
"+n = int(eval(input()))",
"+xy = [list(map(int, input().split())) for _ in range(n)]",
"-l = list(permutations(xy, N))",
"-for i in l:",
"- for j in range(N - 1):",
"- ans += ((i[j][0] - i[j + 1][0]) ** ... | false | 0.03336 | 0.152333 | 0.218994 | [
"s426798298",
"s021027635"
] |
u450478592 | p02887 | python | s937693568 | s419256810 | 37 | 28 | 3,956 | 4,652 | Accepted | Accepted | 24.32 | def main():
N = int(eval(input()))
S = eval(input())
merge = []
sura = S[0]
merge.append(sura)
for i in range(1, N):
if sura == S[i]:
continue
else:
sura = S[i]
merge.append(S[i])
print((len(merge)))
if __name__ == "__main__":
main()
| def main():
N = int(eval(input()))
S = list(eval(input()))
merge = []
sura = S[0]
merge.append(sura)
for i in S:
if i != merge[-1]:
merge.append(i)
print((len(merge)))
if __name__ == "__main__":
main()
| 22 | 18 | 332 | 263 | def main():
N = int(eval(input()))
S = eval(input())
merge = []
sura = S[0]
merge.append(sura)
for i in range(1, N):
if sura == S[i]:
continue
else:
sura = S[i]
merge.append(S[i])
print((len(merge)))
if __name__ == "__main__":
main()
| def main():
N = int(eval(input()))
S = list(eval(input()))
merge = []
sura = S[0]
merge.append(sura)
for i in S:
if i != merge[-1]:
merge.append(i)
print((len(merge)))
if __name__ == "__main__":
main()
| false | 18.181818 | [
"- S = eval(input())",
"+ S = list(eval(input()))",
"- for i in range(1, N):",
"- if sura == S[i]:",
"- continue",
"- else:",
"- sura = S[i]",
"- merge.append(S[i])",
"+ for i in S:",
"+ if i != merge[-1]:",
"+ merge.ap... | false | 0.068297 | 0.089019 | 0.767223 | [
"s937693568",
"s419256810"
] |
u140201022 | p02392 | python | s871767691 | s245685039 | 20 | 10 | 4,184 | 4,188 | Accepted | Accepted | 50 | a,b,c=list(map(int,input().split()));print('Yes' if a<b<c else 'No') | m,n,o=list(map(int,input().split()))
print('Yes'if m<n<o else'No') | 1 | 2 | 64 | 63 | a, b, c = list(map(int, input().split()))
print("Yes" if a < b < c else "No")
| m, n, o = list(map(int, input().split()))
print("Yes" if m < n < o else "No")
| false | 50 | [
"-a, b, c = list(map(int, input().split()))",
"-print(\"Yes\" if a < b < c else \"No\")",
"+m, n, o = list(map(int, input().split()))",
"+print(\"Yes\" if m < n < o else \"No\")"
] | false | 0.041564 | 0.041084 | 1.011672 | [
"s871767691",
"s245685039"
] |
u113971909 | p02786 | python | s751395155 | s371953552 | 21 | 17 | 3,060 | 2,940 | Accepted | Accepted | 19.05 | N=int(eval(input()))
NB=format(N,'0b')
K=len(NB)
print((2**K-1))
| #!/usr/bin python3
# -*- coding: utf-8 -*-
def cnt(hp):
if hp == 1:
return 1
else:
return 2 * cnt(hp//2) + 1
def main():
H = int(eval(input()))
print((cnt(H)))
if __name__ == '__main__':
main() | 4 | 15 | 60 | 238 | N = int(eval(input()))
NB = format(N, "0b")
K = len(NB)
print((2**K - 1))
| #!/usr/bin python3
# -*- coding: utf-8 -*-
def cnt(hp):
if hp == 1:
return 1
else:
return 2 * cnt(hp // 2) + 1
def main():
H = int(eval(input()))
print((cnt(H)))
if __name__ == "__main__":
main()
| false | 73.333333 | [
"-N = int(eval(input()))",
"-NB = format(N, \"0b\")",
"-K = len(NB)",
"-print((2**K - 1))",
"+#!/usr/bin python3",
"+# -*- coding: utf-8 -*-",
"+def cnt(hp):",
"+ if hp == 1:",
"+ return 1",
"+ else:",
"+ return 2 * cnt(hp // 2) + 1",
"+",
"+",
"+def main():",
"+ H... | false | 0.056255 | 0.03721 | 1.511812 | [
"s751395155",
"s371953552"
] |
u013408661 | p03074 | python | s749950097 | s064819220 | 125 | 111 | 8,432 | 8,592 | Accepted | Accepted | 11.2 | n,k=list(map(int,input().split()))
s=list(eval(input()))
s=list(map(int,s))
stack=[]
tmp=0
now=1
for i in range(n):
if s[i]==now:
tmp+=1
else:
stack.append(tmp)
tmp=1
now=1-now
stack.append(tmp)
if len(stack)%2==0:
stack.append(0)
Acc=[0]*(len(stack)+1)
for i in range(len(stack)):
Acc[i+1]=Acc[i]+stack[i]
ans=0
for i in range(0,len(stack),2):
left = i
right = min(i+k*2+1,len(stack))
ans=max(ans,Acc[right]-Acc[left])
print(ans) | n,k=list(map(int,input().split()))
s=list(eval(input()))
s=list(map(int,s))
stack=[]
tmp=1
flag=True
for i in range(1,len(s)):
if s[i]!=s[i-1]:
stack.append(tmp)
tmp=1
else:
tmp+=1
stack.append(tmp)
left=[0]
right=[0]
tmp=0
if s[0]==0:
flag=False
if len(stack)%2==1:
stack.append(0)
if len(stack)//2<=k:
print((len(s)))
exit()
else:
if len(stack)%2==0:
stack.append(0)
if len(stack)//2<=k:
print((len(s)))
exit()
for i in range(len(stack)):
tmp+=stack[i]
if i%2==0:
if flag:
right.append(tmp)
else:
left.append(tmp)
else:
if flag:
left.append(tmp)
else:
right.append(tmp)
ans=0
if flag:
for i in range(len(right)-k-1):
ans=max(ans,right[i+k+1]-left[i])
else:
for i in range(len(right)-k):
ans=max(ans,right[i+k]-left[i])
print(ans)
| 25 | 49 | 472 | 876 | n, k = list(map(int, input().split()))
s = list(eval(input()))
s = list(map(int, s))
stack = []
tmp = 0
now = 1
for i in range(n):
if s[i] == now:
tmp += 1
else:
stack.append(tmp)
tmp = 1
now = 1 - now
stack.append(tmp)
if len(stack) % 2 == 0:
stack.append(0)
Acc = [0] * (len(stack) + 1)
for i in range(len(stack)):
Acc[i + 1] = Acc[i] + stack[i]
ans = 0
for i in range(0, len(stack), 2):
left = i
right = min(i + k * 2 + 1, len(stack))
ans = max(ans, Acc[right] - Acc[left])
print(ans)
| n, k = list(map(int, input().split()))
s = list(eval(input()))
s = list(map(int, s))
stack = []
tmp = 1
flag = True
for i in range(1, len(s)):
if s[i] != s[i - 1]:
stack.append(tmp)
tmp = 1
else:
tmp += 1
stack.append(tmp)
left = [0]
right = [0]
tmp = 0
if s[0] == 0:
flag = False
if len(stack) % 2 == 1:
stack.append(0)
if len(stack) // 2 <= k:
print((len(s)))
exit()
else:
if len(stack) % 2 == 0:
stack.append(0)
if len(stack) // 2 <= k:
print((len(s)))
exit()
for i in range(len(stack)):
tmp += stack[i]
if i % 2 == 0:
if flag:
right.append(tmp)
else:
left.append(tmp)
else:
if flag:
left.append(tmp)
else:
right.append(tmp)
ans = 0
if flag:
for i in range(len(right) - k - 1):
ans = max(ans, right[i + k + 1] - left[i])
else:
for i in range(len(right) - k):
ans = max(ans, right[i + k] - left[i])
print(ans)
| false | 48.979592 | [
"-tmp = 0",
"-now = 1",
"-for i in range(n):",
"- if s[i] == now:",
"- tmp += 1",
"- else:",
"+tmp = 1",
"+flag = True",
"+for i in range(1, len(s)):",
"+ if s[i] != s[i - 1]:",
"- now = 1 - now",
"+ else:",
"+ tmp += 1",
"-if len(stack) % 2 == 0:",
"- ... | false | 0.043891 | 0.044568 | 0.984803 | [
"s749950097",
"s064819220"
] |
u781194524 | p02397 | python | s511988851 | s910938551 | 60 | 50 | 5,620 | 5,612 | Accepted | Accepted | 16.67 | while True:
x,y=sorted([int(x) for x in input().split()])
if x==0 and y==0: break
print((x,y))
| while True:
a,b=sorted([int(x) for x in input().split()])
if a==0 and b == 0 : break
print((a,b))
| 4 | 4 | 108 | 102 | while True:
x, y = sorted([int(x) for x in input().split()])
if x == 0 and y == 0:
break
print((x, y))
| while True:
a, b = sorted([int(x) for x in input().split()])
if a == 0 and b == 0:
break
print((a, b))
| false | 0 | [
"- x, y = sorted([int(x) for x in input().split()])",
"- if x == 0 and y == 0:",
"+ a, b = sorted([int(x) for x in input().split()])",
"+ if a == 0 and b == 0:",
"- print((x, y))",
"+ print((a, b))"
] | false | 0.094791 | 0.056422 | 1.680054 | [
"s511988851",
"s910938551"
] |
u745687363 | p02684 | python | s946315177 | s195650994 | 314 | 204 | 189,356 | 33,380 | Accepted | Accepted | 35.03 | import sys
sys.setrecursionlimit(10**6)
n, k = list(map(int, input().split()))
A = list(map(int, input().split()))
L = [1]
S = {1}
def f(L, S):
last = L[-1]-1
if A[last] not in S:
L.append(A[last])
S |= {A[last]}
return f(L, S)
else:
return L
P = f(L, S)
a = A[P[-1]-1]
j = P.index(a)
r = len(P)
l = r - j
if k+1 <= j:
print((P[k]))
else:
print((P[j+(k-j)%l])) | n, k = list(map(int, input().split()))
A = list(map(int, input().split()))
L = [1]
S = {1}
while A[L[-1]-1] not in S:
last = L[-1]-1
L.append(A[last])
S |= {A[last]}
a = A[L[-1]-1]
j = L.index(a)
r = len(L)
l = r - j
if k+1 <= j:
print((L[k]))
else:
print((L[j+(k-j)%l]))
| 26 | 19 | 430 | 297 | import sys
sys.setrecursionlimit(10**6)
n, k = list(map(int, input().split()))
A = list(map(int, input().split()))
L = [1]
S = {1}
def f(L, S):
last = L[-1] - 1
if A[last] not in S:
L.append(A[last])
S |= {A[last]}
return f(L, S)
else:
return L
P = f(L, S)
a = A[P[-1] - 1]
j = P.index(a)
r = len(P)
l = r - j
if k + 1 <= j:
print((P[k]))
else:
print((P[j + (k - j) % l]))
| n, k = list(map(int, input().split()))
A = list(map(int, input().split()))
L = [1]
S = {1}
while A[L[-1] - 1] not in S:
last = L[-1] - 1
L.append(A[last])
S |= {A[last]}
a = A[L[-1] - 1]
j = L.index(a)
r = len(L)
l = r - j
if k + 1 <= j:
print((L[k]))
else:
print((L[j + (k - j) % l]))
| false | 26.923077 | [
"-import sys",
"-",
"-sys.setrecursionlimit(10**6)",
"-",
"-",
"-def f(L, S):",
"+while A[L[-1] - 1] not in S:",
"- if A[last] not in S:",
"- L.append(A[last])",
"- S |= {A[last]}",
"- return f(L, S)",
"- else:",
"- return L",
"-",
"-",
"-P = f(L, S)",... | false | 0.04307 | 0.039041 | 1.103202 | [
"s946315177",
"s195650994"
] |
u350997995 | p03836 | python | s566786448 | s618224143 | 33 | 18 | 4,468 | 3,060 | Accepted | Accepted | 45.45 | sx,sy,tx,ty = map(int,input().split())
for t in range(sy,ty):
print("U",end="")
for t in range(sx,tx):
print("R",end="")
for t in range(sy,ty):
print("D",end="")
for t in range(sx,tx):
print("L",end="")
print("L",end="")
for t in range(sy,ty+1):
print("U",end="")
for t in range(sx,tx+1):
print("R",end="")
print("D",end="")
print("R",end="")
for t in range(sy,ty+1):
print("D",end="")
for t in range(sx,tx+1):
print("L",end="")
print("U")
| sx,sy,tx,ty = list(map(int,input().split()))
ans = "U"*(ty-sy)+"R"*(tx-sx)+"D"*(ty-sy)+"L"*(tx-sx)
ans += "L"+"U"*(ty-sy+1)+"R"*(tx-sx+1)+"D"
ans += "R"+"D"*(ty-sy+1)+"L"*(tx-sx+1)+"U"
print(ans) | 21 | 5 | 475 | 193 | sx, sy, tx, ty = map(int, input().split())
for t in range(sy, ty):
print("U", end="")
for t in range(sx, tx):
print("R", end="")
for t in range(sy, ty):
print("D", end="")
for t in range(sx, tx):
print("L", end="")
print("L", end="")
for t in range(sy, ty + 1):
print("U", end="")
for t in range(sx, tx + 1):
print("R", end="")
print("D", end="")
print("R", end="")
for t in range(sy, ty + 1):
print("D", end="")
for t in range(sx, tx + 1):
print("L", end="")
print("U")
| sx, sy, tx, ty = list(map(int, input().split()))
ans = "U" * (ty - sy) + "R" * (tx - sx) + "D" * (ty - sy) + "L" * (tx - sx)
ans += "L" + "U" * (ty - sy + 1) + "R" * (tx - sx + 1) + "D"
ans += "R" + "D" * (ty - sy + 1) + "L" * (tx - sx + 1) + "U"
print(ans)
| false | 76.190476 | [
"-sx, sy, tx, ty = map(int, input().split())",
"-for t in range(sy, ty):",
"- print(\"U\", end=\"\")",
"-for t in range(sx, tx):",
"- print(\"R\", end=\"\")",
"-for t in range(sy, ty):",
"- print(\"D\", end=\"\")",
"-for t in range(sx, tx):",
"- print(\"L\", end=\"\")",
"-print(\"L\", ... | false | 0.033262 | 0.041895 | 0.793928 | [
"s566786448",
"s618224143"
] |
u690536347 | p03281 | python | s682734935 | s654168148 | 96 | 23 | 3,444 | 3,572 | Accepted | Accepted | 76.04 | from collections import defaultdict
def f(n):
dd=defaultdict(int)
c=[2,3,5,7,11,13,17,19,23,29,31]
i=0
while i<11 and n//c[i]:
while i<11 and n%c[i]==0:
dd[c[i]]+=1
n=n//c[i]
i+=1
r=1
for i in list(dd.values()):
r*=(i+1)
return r
n=int(eval(input()))
l=[i for i in range(1,n+1,2)]
print((sum([1 for i in l if f(i)==8])))
| from collections import defaultdict as dd
from functools import reduce
d=[2,3,5,7,11,13,17,19,23,29,31]
cd=len(d)
def f(n):
i=0
pr=dd(int)
while i<cd and n//d[i]!=0:
while i<cd and n%d[i]==0:
pr[d[i]]+=1
n=n//d[i]
i+=1
if list(pr.values()):
return reduce(lambda x,y:x*y,[x+1 for x in list(pr.values())])
else:
return 0
n=int(eval(input()))
print((sum([1 for i in range(1,n+1,2) if f(i)==8]))) | 19 | 21 | 365 | 438 | from collections import defaultdict
def f(n):
dd = defaultdict(int)
c = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31]
i = 0
while i < 11 and n // c[i]:
while i < 11 and n % c[i] == 0:
dd[c[i]] += 1
n = n // c[i]
i += 1
r = 1
for i in list(dd.values()):
r *= i + 1
return r
n = int(eval(input()))
l = [i for i in range(1, n + 1, 2)]
print((sum([1 for i in l if f(i) == 8])))
| from collections import defaultdict as dd
from functools import reduce
d = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31]
cd = len(d)
def f(n):
i = 0
pr = dd(int)
while i < cd and n // d[i] != 0:
while i < cd and n % d[i] == 0:
pr[d[i]] += 1
n = n // d[i]
i += 1
if list(pr.values()):
return reduce(lambda x, y: x * y, [x + 1 for x in list(pr.values())])
else:
return 0
n = int(eval(input()))
print((sum([1 for i in range(1, n + 1, 2) if f(i) == 8])))
| false | 9.52381 | [
"-from collections import defaultdict",
"+from collections import defaultdict as dd",
"+from functools import reduce",
"+",
"+d = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31]",
"+cd = len(d)",
"- dd = defaultdict(int)",
"- c = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31]",
"- while i < 11 and n // ... | false | 0.047172 | 0.007768 | 6.07297 | [
"s682734935",
"s654168148"
] |
u046158516 | p04035 | python | s366402934 | s166711231 | 307 | 125 | 63,984 | 84,616 | Accepted | Accepted | 59.28 | n,l=list(map(int,input().split()))
a=list(map(int,input().split()))
failflag=1
for i in range(n-1):
if a[i]+a[i+1]>=l:
failflag=0
k=i
break
if failflag==1:
print('Impossible')
else:
print('Possible')
for i in range(1,k+1):
print(i)
for i in range(n-1-k):
print((n-1-i)) | import sys
n,x=list(map(int,input().split()))
a=list(map(int,input().split()))
k=-1
for i in range(n-1):
if a[i]+a[i+1]>=x:
k=i
break
if i==n-2:
print('Impossible')
sys.exit()
print('Possible')
for i in range(k):
print((i+1))
for i in range(n-2,k,-1):
print((i+1))
print((k+1)) | 16 | 17 | 306 | 305 | n, l = list(map(int, input().split()))
a = list(map(int, input().split()))
failflag = 1
for i in range(n - 1):
if a[i] + a[i + 1] >= l:
failflag = 0
k = i
break
if failflag == 1:
print("Impossible")
else:
print("Possible")
for i in range(1, k + 1):
print(i)
for i in range(n - 1 - k):
print((n - 1 - i))
| import sys
n, x = list(map(int, input().split()))
a = list(map(int, input().split()))
k = -1
for i in range(n - 1):
if a[i] + a[i + 1] >= x:
k = i
break
if i == n - 2:
print("Impossible")
sys.exit()
print("Possible")
for i in range(k):
print((i + 1))
for i in range(n - 2, k, -1):
print((i + 1))
print((k + 1))
| false | 5.882353 | [
"-n, l = list(map(int, input().split()))",
"+import sys",
"+",
"+n, x = list(map(int, input().split()))",
"-failflag = 1",
"+k = -1",
"- if a[i] + a[i + 1] >= l:",
"- failflag = 0",
"+ if a[i] + a[i + 1] >= x:",
"-if failflag == 1:",
"- print(\"Impossible\")",
"-else:",
"- ... | false | 0.071521 | 0.062352 | 1.147053 | [
"s366402934",
"s166711231"
] |
u699296734 | p03417 | python | s325064461 | s229740852 | 25 | 22 | 9,072 | 9,148 | Accepted | Accepted | 12 | n, m = list(map(int, input().split()))
if n == 2 or m == 2:
print((0))
elif n == 1 and m == 1:
print((1))
elif n == 1:
print((m - 2))
elif m == 1:
print((n - 2))
else:
print(((n - 2) * (m - 2)))
| n, m = list(map(int, input().split()))
n = abs(n - 2)
m = abs(m - 2)
print((n * m))
| 11 | 4 | 209 | 79 | n, m = list(map(int, input().split()))
if n == 2 or m == 2:
print((0))
elif n == 1 and m == 1:
print((1))
elif n == 1:
print((m - 2))
elif m == 1:
print((n - 2))
else:
print(((n - 2) * (m - 2)))
| n, m = list(map(int, input().split()))
n = abs(n - 2)
m = abs(m - 2)
print((n * m))
| false | 63.636364 | [
"-if n == 2 or m == 2:",
"- print((0))",
"-elif n == 1 and m == 1:",
"- print((1))",
"-elif n == 1:",
"- print((m - 2))",
"-elif m == 1:",
"- print((n - 2))",
"-else:",
"- print(((n - 2) * (m - 2)))",
"+n = abs(n - 2)",
"+m = abs(m - 2)",
"+print((n * m))"
] | false | 0.042547 | 0.038398 | 1.108047 | [
"s325064461",
"s229740852"
] |
u884323674 | p02614 | python | s207913675 | s415731102 | 184 | 59 | 27,192 | 9,100 | Accepted | Accepted | 67.93 | import numpy as np
H, W, K = list(map(int, input().split()))
C = np.array([[i for i in eval(input())] for j in range(H)])
ans = 0
for h_bit in range(1, 1 << H):
for w_bit in range(1, 1 << W):
h_count = []
for i in range(H):
if h_bit & (1 << i):
h_count.append(i)
w_count = []
for j in range(W):
if w_bit & (1 << j):
w_count.append(j)
if np.sum(C[np.ix_(h_count, w_count)] == "#") == K:
ans += 1
print(ans) | H, W, K = list(map(int, input().split()))
C = [[i for i in eval(input())] for j in range(H)]
ans = 0
for h_bit in range(1 << H):
for w_bit in range(1 << W):
black = 0
for i in range(H):
for j in range(W):
if h_bit & (1 << i) and w_bit & (1 << j):
if C[i][j] == '#':
black += 1
if black == K:
ans += 1
print(ans) | 22 | 16 | 531 | 347 | import numpy as np
H, W, K = list(map(int, input().split()))
C = np.array([[i for i in eval(input())] for j in range(H)])
ans = 0
for h_bit in range(1, 1 << H):
for w_bit in range(1, 1 << W):
h_count = []
for i in range(H):
if h_bit & (1 << i):
h_count.append(i)
w_count = []
for j in range(W):
if w_bit & (1 << j):
w_count.append(j)
if np.sum(C[np.ix_(h_count, w_count)] == "#") == K:
ans += 1
print(ans)
| H, W, K = list(map(int, input().split()))
C = [[i for i in eval(input())] for j in range(H)]
ans = 0
for h_bit in range(1 << H):
for w_bit in range(1 << W):
black = 0
for i in range(H):
for j in range(W):
if h_bit & (1 << i) and w_bit & (1 << j):
if C[i][j] == "#":
black += 1
if black == K:
ans += 1
print(ans)
| false | 27.272727 | [
"-import numpy as np",
"-",
"-C = np.array([[i for i in eval(input())] for j in range(H)])",
"+C = [[i for i in eval(input())] for j in range(H)]",
"-for h_bit in range(1, 1 << H):",
"- for w_bit in range(1, 1 << W):",
"- h_count = []",
"+for h_bit in range(1 << H):",
"+ for w_bit in ra... | false | 0.307804 | 0.045893 | 6.707036 | [
"s207913675",
"s415731102"
] |
u603234915 | p03262 | python | s943725152 | s323150440 | 325 | 69 | 14,252 | 14,224 | Accepted | Accepted | 78.77 | def gcd(A, B):
if A%B == 0:
return B
else:
return gcd(B, A%B)
N, X = list(map(int, input().split()))
x = [abs(int(i) - X) for i in input().split()]
if N == 1:
print((x[0]))
exit()
gcd_x = []
for i in range(N-1):
gcd_x.append(gcd(x[i], x[i+1]))
print((min(gcd_x))) | def gcd(A, B):
while B != 0:
A, B = B, A%B
return A
N, X = list(map(int, input().split()))
x = [abs(int(i) - X) for i in input().split()]
y = x[0]
for i in range(N):
if x[i] % y == 0:
continue
y = gcd(y, x[i])
print(y) | 14 | 12 | 303 | 256 | def gcd(A, B):
if A % B == 0:
return B
else:
return gcd(B, A % B)
N, X = list(map(int, input().split()))
x = [abs(int(i) - X) for i in input().split()]
if N == 1:
print((x[0]))
exit()
gcd_x = []
for i in range(N - 1):
gcd_x.append(gcd(x[i], x[i + 1]))
print((min(gcd_x)))
| def gcd(A, B):
while B != 0:
A, B = B, A % B
return A
N, X = list(map(int, input().split()))
x = [abs(int(i) - X) for i in input().split()]
y = x[0]
for i in range(N):
if x[i] % y == 0:
continue
y = gcd(y, x[i])
print(y)
| false | 14.285714 | [
"- if A % B == 0:",
"- return B",
"- else:",
"- return gcd(B, A % B)",
"+ while B != 0:",
"+ A, B = B, A % B",
"+ return A",
"-if N == 1:",
"- print((x[0]))",
"- exit()",
"-gcd_x = []",
"-for i in range(N - 1):",
"- gcd_x.append(gcd(x[i], x[i + 1]))"... | false | 0.039538 | 0.039398 | 1.003556 | [
"s943725152",
"s323150440"
] |
u456353530 | p03013 | python | s975896215 | s587533109 | 412 | 169 | 29,192 | 80,960 | Accepted | Accepted | 58.98 | N, M = list(map(int, input().split()))
a = [int(eval(input())) for _ in range(M)]
class comb():
F = [1, 1]
Fi = [1, 1]
I = [0, 1]
def __init__(self, num, mod):
self.MOD = mod
for i in range(2, num + 1):
self.F.append((self.F[-1] * i) % mod)
self.I.append(mod - self.I[mod % i] * (mod // i) % mod)
self.Fi.append(self.Fi[-1] * self.I[i] % mod)
def com(self, n, k):
if n < k: return 0
if n < 0 or k < 0: return 0
return self.F[n] * (self.Fi[k] * self.Fi[n - k] % self.MOD) % self.MOD
MOD = 10 ** 9 + 7
for i in range(1, M):
if a[i] - a[i - 1] == 1:
print((0))
exit()
com = comb(200000, MOD)
ans = 1
x = 0
a = a + [N + 1]
for i in a:
t = i - 1 - x
at = 0
for j in range(t // 2 + 1):
k = t - j
at = at + com.com(k, j) % MOD
ans = ans * at % MOD
x = i + 1
print(ans) | N, M = list(map(int, input().split()))
a = [int(eval(input())) for _ in range(M)]
MOD = 10 ** 9 + 7
D = [0] * (N + 1)
D[0] = 1
a.append(10 ** 15)
c = 0
for i in range(1, N + 1):
if a[c] == i:
c += 1
continue
D[i] = D[i - 1]
if i - 2 >= 0:
D[i] = (D[i] + D[i - 2]) % MOD
print((D[-1]))
| 42 | 19 | 880 | 317 | N, M = list(map(int, input().split()))
a = [int(eval(input())) for _ in range(M)]
class comb:
F = [1, 1]
Fi = [1, 1]
I = [0, 1]
def __init__(self, num, mod):
self.MOD = mod
for i in range(2, num + 1):
self.F.append((self.F[-1] * i) % mod)
self.I.append(mod - self.I[mod % i] * (mod // i) % mod)
self.Fi.append(self.Fi[-1] * self.I[i] % mod)
def com(self, n, k):
if n < k:
return 0
if n < 0 or k < 0:
return 0
return self.F[n] * (self.Fi[k] * self.Fi[n - k] % self.MOD) % self.MOD
MOD = 10**9 + 7
for i in range(1, M):
if a[i] - a[i - 1] == 1:
print((0))
exit()
com = comb(200000, MOD)
ans = 1
x = 0
a = a + [N + 1]
for i in a:
t = i - 1 - x
at = 0
for j in range(t // 2 + 1):
k = t - j
at = at + com.com(k, j) % MOD
ans = ans * at % MOD
x = i + 1
print(ans)
| N, M = list(map(int, input().split()))
a = [int(eval(input())) for _ in range(M)]
MOD = 10**9 + 7
D = [0] * (N + 1)
D[0] = 1
a.append(10**15)
c = 0
for i in range(1, N + 1):
if a[c] == i:
c += 1
continue
D[i] = D[i - 1]
if i - 2 >= 0:
D[i] = (D[i] + D[i - 2]) % MOD
print((D[-1]))
| false | 54.761905 | [
"-",
"-",
"-class comb:",
"- F = [1, 1]",
"- Fi = [1, 1]",
"- I = [0, 1]",
"-",
"- def __init__(self, num, mod):",
"- self.MOD = mod",
"- for i in range(2, num + 1):",
"- self.F.append((self.F[-1] * i) % mod)",
"- self.I.append(mod - self.I[mod %... | false | 1.042406 | 0.039398 | 26.458585 | [
"s975896215",
"s587533109"
] |
u340781749 | p02949 | python | s284633782 | s126171336 | 1,559 | 1,359 | 54,020 | 99,164 | Accepted | Accepted | 12.83 | import sys
from collections import defaultdict
def reverse_search(n, parents):
q = [n - 1]
visited = set()
while q:
v = q.pop()
if v in visited:
continue
visited.add(v)
q.extend(u for u in parents[v] if u not in visited)
return visited
n, m, p = list(map(int, input().split()))
INF = 10 ** 12
links = [set() for _ in range(n)]
parents = [set() for _ in range(n)]
costs = [defaultdict(lambda: INF) for _ in range(n)]
for line in sys.stdin:
a, b, c = list(map(int, line.split()))
a -= 1
b -= 1
links[a].add(b)
parents[b].add(a)
costs[a][b] = min(costs[a][b], p - c)
reachable = reverse_search(n, parents)
dist = [INF] * n
dist[0] = 0
for _ in range(len(reachable)):
updated = False
for v in reachable:
d = dist[v]
if d == INF:
continue
cv = costs[v]
for u in links[v]:
if dist[u] > d + cv[u]:
dist[u] = d + cv[u]
updated = True
if not updated:
break
else:
print((-1))
exit()
print((max(0, -dist[n - 1])))
| import sys
from collections import defaultdict
def reverse_search(n, parents):
q = [n - 1]
visited = set()
while q:
v = q.pop()
if v in visited:
continue
visited.add(v)
q.extend(u for u in parents[v] if u not in visited)
return visited
n, m, p = list(map(int, input().split()))
INF = 10 ** 12
links = [set() for _ in range(n)]
parents = [set() for _ in range(n)]
costs = [[INF] * n for _ in range(n)]
for line in sys.stdin:
a, b, c = list(map(int, line.split()))
a -= 1
b -= 1
links[a].add(b)
parents[b].add(a)
costs[a][b] = min(costs[a][b], p - c)
reachable = reverse_search(n, parents)
dist = [INF] * n
dist[0] = 0
for _ in range(len(reachable)):
updated = False
for v in reachable:
d = dist[v]
if d == INF:
continue
cv = costs[v]
for u in links[v]:
if dist[u] > d + cv[u]:
dist[u] = d + cv[u]
updated = True
if not updated:
break
else:
print((-1))
exit()
print((max(0, -dist[n - 1])))
| 50 | 50 | 1,148 | 1,133 | import sys
from collections import defaultdict
def reverse_search(n, parents):
q = [n - 1]
visited = set()
while q:
v = q.pop()
if v in visited:
continue
visited.add(v)
q.extend(u for u in parents[v] if u not in visited)
return visited
n, m, p = list(map(int, input().split()))
INF = 10**12
links = [set() for _ in range(n)]
parents = [set() for _ in range(n)]
costs = [defaultdict(lambda: INF) for _ in range(n)]
for line in sys.stdin:
a, b, c = list(map(int, line.split()))
a -= 1
b -= 1
links[a].add(b)
parents[b].add(a)
costs[a][b] = min(costs[a][b], p - c)
reachable = reverse_search(n, parents)
dist = [INF] * n
dist[0] = 0
for _ in range(len(reachable)):
updated = False
for v in reachable:
d = dist[v]
if d == INF:
continue
cv = costs[v]
for u in links[v]:
if dist[u] > d + cv[u]:
dist[u] = d + cv[u]
updated = True
if not updated:
break
else:
print((-1))
exit()
print((max(0, -dist[n - 1])))
| import sys
from collections import defaultdict
def reverse_search(n, parents):
q = [n - 1]
visited = set()
while q:
v = q.pop()
if v in visited:
continue
visited.add(v)
q.extend(u for u in parents[v] if u not in visited)
return visited
n, m, p = list(map(int, input().split()))
INF = 10**12
links = [set() for _ in range(n)]
parents = [set() for _ in range(n)]
costs = [[INF] * n for _ in range(n)]
for line in sys.stdin:
a, b, c = list(map(int, line.split()))
a -= 1
b -= 1
links[a].add(b)
parents[b].add(a)
costs[a][b] = min(costs[a][b], p - c)
reachable = reverse_search(n, parents)
dist = [INF] * n
dist[0] = 0
for _ in range(len(reachable)):
updated = False
for v in reachable:
d = dist[v]
if d == INF:
continue
cv = costs[v]
for u in links[v]:
if dist[u] > d + cv[u]:
dist[u] = d + cv[u]
updated = True
if not updated:
break
else:
print((-1))
exit()
print((max(0, -dist[n - 1])))
| false | 0 | [
"-costs = [defaultdict(lambda: INF) for _ in range(n)]",
"+costs = [[INF] * n for _ in range(n)]"
] | false | 0.042806 | 0.043931 | 0.974394 | [
"s284633782",
"s126171336"
] |
u460245024 | p03435 | python | s936147943 | s915514030 | 837 | 18 | 3,064 | 3,064 | Accepted | Accepted | 97.85 | from itertools import product as p
c = [list(map(int, input().split())) for _ in range(3)]
a = [0]*3
b = [0]*3
for a1 in range(c[0][0]+1):
a[0] = a1
b[0] = c[0][0] - a1
for a2 in range(c[1][1]+1):
a[1] = a2
b[1] = c[1][1] - a2
for a3 in range(c[2][2]+1):
a[2] = a3
b[2] = c[2][2] - a3
for i, j in p(list(range(3)), list(range(3))):
if c[i][j] != a[i] + b[j]:
break
else:
print('Yes')
exit()
print('No')
| from itertools import product as p
c = [list(map(int, input().split())) for _ in range(3)]
a = [-1]*3
a[0] = 0
b = c[0]
a[1] = c[1][0] - b[0]
a[2] = c[2][0] - b[0]
for i, j in p(list(range(3)), list(range(3))):
if c[i][j] != a[i] + b[j]:
print('No')
break
else:
print('Yes')
| 24 | 15 | 570 | 303 | from itertools import product as p
c = [list(map(int, input().split())) for _ in range(3)]
a = [0] * 3
b = [0] * 3
for a1 in range(c[0][0] + 1):
a[0] = a1
b[0] = c[0][0] - a1
for a2 in range(c[1][1] + 1):
a[1] = a2
b[1] = c[1][1] - a2
for a3 in range(c[2][2] + 1):
a[2] = a3
b[2] = c[2][2] - a3
for i, j in p(list(range(3)), list(range(3))):
if c[i][j] != a[i] + b[j]:
break
else:
print("Yes")
exit()
print("No")
| from itertools import product as p
c = [list(map(int, input().split())) for _ in range(3)]
a = [-1] * 3
a[0] = 0
b = c[0]
a[1] = c[1][0] - b[0]
a[2] = c[2][0] - b[0]
for i, j in p(list(range(3)), list(range(3))):
if c[i][j] != a[i] + b[j]:
print("No")
break
else:
print("Yes")
| false | 37.5 | [
"-a = [0] * 3",
"-b = [0] * 3",
"-for a1 in range(c[0][0] + 1):",
"- a[0] = a1",
"- b[0] = c[0][0] - a1",
"- for a2 in range(c[1][1] + 1):",
"- a[1] = a2",
"- b[1] = c[1][1] - a2",
"- for a3 in range(c[2][2] + 1):",
"- a[2] = a3",
"- b[2] = c[2... | false | 0.0347 | 0.034538 | 1.004702 | [
"s936147943",
"s915514030"
] |
u452512115 | p02996 | python | s407160579 | s162290339 | 855 | 783 | 39,756 | 31,808 | Accepted | Accepted | 8.42 | N = int(eval(input()))
lst = []
for i in range(N):
N, K = list(map(int, input().split()))
lst.append((K-N, N, K))
lst.sort(key=lambda tup: tup[2])
count = 0
for ind, x in enumerate(lst):
if count > x[0]:
print("No")
exit()
count += x[1]
print("Yes")
| N = int(eval(input()))
lst = []
for i in range(N):
N, K = list(map(int, input().split()))
lst.append((N, K))
lst.sort(key=lambda tup: tup[1])
time = 0
for x in lst:
time += x[0]
if time > x[1]:
print("No")
exit()
print("Yes")
| 16 | 16 | 272 | 248 | N = int(eval(input()))
lst = []
for i in range(N):
N, K = list(map(int, input().split()))
lst.append((K - N, N, K))
lst.sort(key=lambda tup: tup[2])
count = 0
for ind, x in enumerate(lst):
if count > x[0]:
print("No")
exit()
count += x[1]
print("Yes")
| N = int(eval(input()))
lst = []
for i in range(N):
N, K = list(map(int, input().split()))
lst.append((N, K))
lst.sort(key=lambda tup: tup[1])
time = 0
for x in lst:
time += x[0]
if time > x[1]:
print("No")
exit()
print("Yes")
| false | 0 | [
"- lst.append((K - N, N, K))",
"-lst.sort(key=lambda tup: tup[2])",
"-count = 0",
"-for ind, x in enumerate(lst):",
"- if count > x[0]:",
"+ lst.append((N, K))",
"+lst.sort(key=lambda tup: tup[1])",
"+time = 0",
"+for x in lst:",
"+ time += x[0]",
"+ if time > x[1]:",
"- coun... | false | 0.037025 | 0.094824 | 0.390461 | [
"s407160579",
"s162290339"
] |
u813387707 | p02773 | python | s736969278 | s761596753 | 692 | 639 | 33,372 | 36,040 | Accepted | Accepted | 7.66 | from collections import defaultdict
n = int(eval(input()))
s_dict = defaultdict(int)
for _ in range(n):
s = eval(input())
s_dict[s] += 1
count_max = max(s_dict.values())
s_list = sorted([s for s, count in list(s_dict.items()) if count == count_max])
for s in s_list:
print(s) | from collections import defaultdict
n = int(eval(input()))
s_dict = defaultdict(int)
for _ in range(n):
s = eval(input())
s_dict[s] += 1
count_max = max(s_dict.values())
s_list = sorted([s for s, count in list(s_dict.items()) if count == count_max])
print(("\n".join(s_list))) | 13 | 12 | 284 | 278 | from collections import defaultdict
n = int(eval(input()))
s_dict = defaultdict(int)
for _ in range(n):
s = eval(input())
s_dict[s] += 1
count_max = max(s_dict.values())
s_list = sorted([s for s, count in list(s_dict.items()) if count == count_max])
for s in s_list:
print(s)
| from collections import defaultdict
n = int(eval(input()))
s_dict = defaultdict(int)
for _ in range(n):
s = eval(input())
s_dict[s] += 1
count_max = max(s_dict.values())
s_list = sorted([s for s, count in list(s_dict.items()) if count == count_max])
print(("\n".join(s_list)))
| false | 7.692308 | [
"-for s in s_list:",
"- print(s)",
"+print((\"\\n\".join(s_list)))"
] | false | 0.040046 | 0.044806 | 0.893775 | [
"s736969278",
"s761596753"
] |
u508732591 | p02258 | python | s391364011 | s652954442 | 450 | 180 | 7,692 | 21,828 | Accepted | Accepted | 60 | n = int(eval(input()))
minv = int(eval(input()))
maxv = -1000000000
for i in range(1,n):
r = int(eval(input()))
m = r-minv
if maxv < m < 0:
maxv = m
minv = r
elif maxv < m:
maxv = m
elif m < 0:
minv = r
print(maxv) | import sys
n = int(eval(input()))
minv = int(eval(input()))
maxv = -1000000000
for r in map(int,sys.stdin.readlines()):
m = r-minv
if maxv < m < 0:
maxv = m
minv = r
elif maxv < m:
maxv = m
elif m < 0:
minv = r
print(maxv) | 16 | 17 | 239 | 253 | n = int(eval(input()))
minv = int(eval(input()))
maxv = -1000000000
for i in range(1, n):
r = int(eval(input()))
m = r - minv
if maxv < m < 0:
maxv = m
minv = r
elif maxv < m:
maxv = m
elif m < 0:
minv = r
print(maxv)
| import sys
n = int(eval(input()))
minv = int(eval(input()))
maxv = -1000000000
for r in map(int, sys.stdin.readlines()):
m = r - minv
if maxv < m < 0:
maxv = m
minv = r
elif maxv < m:
maxv = m
elif m < 0:
minv = r
print(maxv)
| false | 5.882353 | [
"+import sys",
"+",
"-for i in range(1, n):",
"- r = int(eval(input()))",
"+for r in map(int, sys.stdin.readlines()):"
] | false | 0.04411 | 0.045276 | 0.974242 | [
"s391364011",
"s652954442"
] |
u499381410 | p03546 | python | s945759950 | s949838429 | 315 | 180 | 19,180 | 12,984 | Accepted | Accepted | 42.86 | from heapq import heappop, heappush
import numpy as np
def dijkstra(graph, n, vst=0):
distance = [float('inf')] * n
distance[vst] = 0
checked_v = [0] * n
route = [''] * 10
route[vst] = str(vst)
dist = [float('inf')] * n
dist[vst] = 0
q = []
heappush(q, (0, vst))
for _ in range(n):
while True:
min_dist, search_v = heappop(q)
if checked_v[search_v] == 0:
break
checked_v[search_v] = 1
for to_v in range(n):
if checked_v[to_v] == 0:
cost = graph[search_v][to_v]
if dist[search_v] + cost < dist[to_v]:
dist[to_v] = dist[search_v] + cost
route[to_v] = route[search_v] + str(to_v)
heappush(q, (dist[to_v], to_v))
return dist
h, w = list(map(int, input().split()))
graph = np.array([np.array(list(map(int, input().split()))) for _ in range(10)])
graph = np.transpose(graph)
dist = dijkstra(graph, 10, vst=1)
wall_num = []
for i in range(h):
wall_num += list(map(int, input().split()))
ret = 0
for num in wall_num:
if num != -1:
ret += dist[num]
print(ret) | import numpy as np
def dijkstra(cost_matrix, start_node=0):
node_num = len(cost_matrix)
distance = np.full(node_num, np.inf)
distance[start_node] = 0
unsearched_nodes = [i for i in range(node_num)]
while unsearched_nodes:
min_distance = np.inf
for each_node in unsearched_nodes:
if distance[each_node] < min_distance:
min_distance = distance[each_node]
target_node = each_node
unsearched_nodes.remove(target_node)
each_distance = cost_matrix[target_node]
for i in range(node_num):
if each_distance[i] != 0:
distance[i] = min(distance[i], distance[target_node] + each_distance[i])
return distance.astype(int)
h, w = list(map(int, input().split()))
graph = np.array([np.array(list(map(int, input().split()))) for _ in range(10)])
graph = np.transpose(graph)
dist = dijkstra(graph, start_node=1)
wall_num = []
for i in range(h):
wall_num += list(map(int, input().split()))
ret = 0
for num in wall_num:
if num != -1:
ret += dist[num]
print(ret) | 50 | 41 | 1,233 | 1,137 | from heapq import heappop, heappush
import numpy as np
def dijkstra(graph, n, vst=0):
distance = [float("inf")] * n
distance[vst] = 0
checked_v = [0] * n
route = [""] * 10
route[vst] = str(vst)
dist = [float("inf")] * n
dist[vst] = 0
q = []
heappush(q, (0, vst))
for _ in range(n):
while True:
min_dist, search_v = heappop(q)
if checked_v[search_v] == 0:
break
checked_v[search_v] = 1
for to_v in range(n):
if checked_v[to_v] == 0:
cost = graph[search_v][to_v]
if dist[search_v] + cost < dist[to_v]:
dist[to_v] = dist[search_v] + cost
route[to_v] = route[search_v] + str(to_v)
heappush(q, (dist[to_v], to_v))
return dist
h, w = list(map(int, input().split()))
graph = np.array([np.array(list(map(int, input().split()))) for _ in range(10)])
graph = np.transpose(graph)
dist = dijkstra(graph, 10, vst=1)
wall_num = []
for i in range(h):
wall_num += list(map(int, input().split()))
ret = 0
for num in wall_num:
if num != -1:
ret += dist[num]
print(ret)
| import numpy as np
def dijkstra(cost_matrix, start_node=0):
node_num = len(cost_matrix)
distance = np.full(node_num, np.inf)
distance[start_node] = 0
unsearched_nodes = [i for i in range(node_num)]
while unsearched_nodes:
min_distance = np.inf
for each_node in unsearched_nodes:
if distance[each_node] < min_distance:
min_distance = distance[each_node]
target_node = each_node
unsearched_nodes.remove(target_node)
each_distance = cost_matrix[target_node]
for i in range(node_num):
if each_distance[i] != 0:
distance[i] = min(distance[i], distance[target_node] + each_distance[i])
return distance.astype(int)
h, w = list(map(int, input().split()))
graph = np.array([np.array(list(map(int, input().split()))) for _ in range(10)])
graph = np.transpose(graph)
dist = dijkstra(graph, start_node=1)
wall_num = []
for i in range(h):
wall_num += list(map(int, input().split()))
ret = 0
for num in wall_num:
if num != -1:
ret += dist[num]
print(ret)
| false | 18 | [
"-from heapq import heappop, heappush",
"-def dijkstra(graph, n, vst=0):",
"- distance = [float(\"inf\")] * n",
"- distance[vst] = 0",
"- checked_v = [0] * n",
"- route = [\"\"] * 10",
"- route[vst] = str(vst)",
"- dist = [float(\"inf\")] * n",
"- dist[vst] = 0",
"- q = []"... | false | 0.233986 | 0.20787 | 1.125634 | [
"s945759950",
"s949838429"
] |
u228223940 | p03241 | python | s510384349 | s596776572 | 524 | 184 | 40,044 | 38,640 | Accepted | Accepted | 64.89 | n,m = list(map(int,input().split()))
max_cnd = m//n
for i in range(max_cnd):
if m % (max_cnd-i) == 0:
print((max_cnd-i))
exit() | n,m = list(map(int,input().split()))
def make_divisors(n):
divisors = []
for i in range(1, int(n**0.5)+1):
if n % i == 0:
divisors.append(i)
if i != n // i:
divisors.append(n//i)
divisors.sort(reverse=True)
return divisors
cnd = make_divisors(m)
for i in range(len(cnd)):
if m // cnd[i] >= n:
print((cnd[i]))
exit()
| 8 | 22 | 148 | 420 | n, m = list(map(int, input().split()))
max_cnd = m // n
for i in range(max_cnd):
if m % (max_cnd - i) == 0:
print((max_cnd - i))
exit()
| n, m = list(map(int, input().split()))
def make_divisors(n):
divisors = []
for i in range(1, int(n**0.5) + 1):
if n % i == 0:
divisors.append(i)
if i != n // i:
divisors.append(n // i)
divisors.sort(reverse=True)
return divisors
cnd = make_divisors(m)
for i in range(len(cnd)):
if m // cnd[i] >= n:
print((cnd[i]))
exit()
| false | 63.636364 | [
"-max_cnd = m // n",
"-for i in range(max_cnd):",
"- if m % (max_cnd - i) == 0:",
"- print((max_cnd - i))",
"+",
"+",
"+def make_divisors(n):",
"+ divisors = []",
"+ for i in range(1, int(n**0.5) + 1):",
"+ if n % i == 0:",
"+ divisors.append(i)",
"+ ... | false | 0.055629 | 0.062994 | 0.883081 | [
"s510384349",
"s596776572"
] |
u919017918 | p02945 | python | s101467931 | s076170222 | 20 | 17 | 3,060 | 2,940 | Accepted | Accepted | 15 | A, B = list(map(int, input().split()))
mymax = -99999
if mymax < A + B:
mymax = A + B
if mymax < A - B:
mymax = A - B
if mymax < A * B:
mymax = A * B
print(mymax) | A, B = list(map(int, input().split()))
mymax = -999
if A+B > mymax:
mymax = A+B
if A-B > mymax:
mymax = A-B
if A*B > mymax:
mymax = A*B
print(mymax) | 15 | 11 | 183 | 166 | A, B = list(map(int, input().split()))
mymax = -99999
if mymax < A + B:
mymax = A + B
if mymax < A - B:
mymax = A - B
if mymax < A * B:
mymax = A * B
print(mymax)
| A, B = list(map(int, input().split()))
mymax = -999
if A + B > mymax:
mymax = A + B
if A - B > mymax:
mymax = A - B
if A * B > mymax:
mymax = A * B
print(mymax)
| false | 26.666667 | [
"-mymax = -99999",
"-if mymax < A + B:",
"+mymax = -999",
"+if A + B > mymax:",
"-if mymax < A - B:",
"+if A - B > mymax:",
"-if mymax < A * B:",
"+if A * B > mymax:"
] | false | 0.178073 | 0.048026 | 3.707878 | [
"s101467931",
"s076170222"
] |
u844646164 | p02837 | python | s279622592 | s050739363 | 326 | 283 | 3,192 | 45,276 | Accepted | Accepted | 13.19 | n = int(eval(input()))
xy = [[] for _ in range(n)]
for i in range(n):
a = int(eval(input()))
for j in range(a):
x, y = list(map(int, input().split()))
x -= 1
xy[i] += [[x, y]]
result = 0
for i in range(2**n):
dic = {i:-1 for i in range(n)}
flag = True
ans = 0
for j in range(n):
if (i>>j)&1:
if dic[j] != -1 and dic[j] != 1:
flag = False
break
dic[j] = 1
for x, y in xy[j]:
if dic[x] == -1:
dic[x] = y
elif dic[x] != -1 and dic[x] != y:
flag = False
break
if flag:
ans += 1
else:
if dic[j] != -1 and dic[j] == 1:
flag = False
break
dic[j] = 0
"""
for x, y in xy[j]:
if dic[x] == -1:
dic[x] = 1-y
elif dic[x] != -1 and dic[x] == y:
flag = False
break
"""
if flag:
result = max(result, ans)
print(result) | N = int(eval(input()))
A = []
xy = []
for _ in range(N):
a = int(eval(input()))
tmp = [list(map(int, input().split())) for _ in range(a)]
xy += [tmp]
ans = 0
for i in range(2**N):
d = {i:-1 for i in range(1, N+1)}
flag = True
tmp = 0
#print("---i---", i)
for j in range(N):
#print(d, j)
if (i>>j)&1: # 正直
tmp += 1
if d[j+1] == 0:
flag = False
break
d[j+1] = 1
for x, y in xy[j]:
if d[x] == -1:
d[x] = y
else:
if d[x] != y:
flag = False
break
else:
if d[j+1] == 1:
flag = False
break
d[j+1] = 0
if flag:
ans = max(tmp, ans)
print(ans)
| 45 | 40 | 957 | 731 | n = int(eval(input()))
xy = [[] for _ in range(n)]
for i in range(n):
a = int(eval(input()))
for j in range(a):
x, y = list(map(int, input().split()))
x -= 1
xy[i] += [[x, y]]
result = 0
for i in range(2**n):
dic = {i: -1 for i in range(n)}
flag = True
ans = 0
for j in range(n):
if (i >> j) & 1:
if dic[j] != -1 and dic[j] != 1:
flag = False
break
dic[j] = 1
for x, y in xy[j]:
if dic[x] == -1:
dic[x] = y
elif dic[x] != -1 and dic[x] != y:
flag = False
break
if flag:
ans += 1
else:
if dic[j] != -1 and dic[j] == 1:
flag = False
break
dic[j] = 0
"""
for x, y in xy[j]:
if dic[x] == -1:
dic[x] = 1-y
elif dic[x] != -1 and dic[x] == y:
flag = False
break
"""
if flag:
result = max(result, ans)
print(result)
| N = int(eval(input()))
A = []
xy = []
for _ in range(N):
a = int(eval(input()))
tmp = [list(map(int, input().split())) for _ in range(a)]
xy += [tmp]
ans = 0
for i in range(2**N):
d = {i: -1 for i in range(1, N + 1)}
flag = True
tmp = 0
# print("---i---", i)
for j in range(N):
# print(d, j)
if (i >> j) & 1: # 正直
tmp += 1
if d[j + 1] == 0:
flag = False
break
d[j + 1] = 1
for x, y in xy[j]:
if d[x] == -1:
d[x] = y
else:
if d[x] != y:
flag = False
break
else:
if d[j + 1] == 1:
flag = False
break
d[j + 1] = 0
if flag:
ans = max(tmp, ans)
print(ans)
| false | 11.111111 | [
"-n = int(eval(input()))",
"-xy = [[] for _ in range(n)]",
"-for i in range(n):",
"+N = int(eval(input()))",
"+A = []",
"+xy = []",
"+for _ in range(N):",
"- for j in range(a):",
"- x, y = list(map(int, input().split()))",
"- x -= 1",
"- xy[i] += [[x, y]]",
"-result = 0... | false | 0.033859 | 0.035901 | 0.943128 | [
"s279622592",
"s050739363"
] |
u392029857 | p03103 | python | s481194868 | s207299771 | 573 | 510 | 28,648 | 28,648 | Accepted | Accepted | 10.99 | N, M = list(map(int, input().split()))
x = sorted([list(map(int, input().split())) for i in range(N)])
i = 0
minprice = x[i][0]
minnumber = x[i][1]
price = 0
while True:
if M <= minnumber:
price += minprice * M
break
else:
price += minprice * minnumber
M -= minnumber
i += 1
minprice = x[i][0]
minnumber = x[i][1]
print(price) | N, M = list(map(int, input().split()))
x = sorted([list(map(int, input().split())) for i in range(N)])
i = 0
price = 0
minprice = x[i][0]
minnumber = x[i][1]
while True:
if minnumber >= M:
price += minprice*M
break
else:
price += minprice * minnumber
M -= minnumber
i += 1
minprice = x[i][0]
minnumber = x[i][1]
print(price) | 17 | 17 | 400 | 398 | N, M = list(map(int, input().split()))
x = sorted([list(map(int, input().split())) for i in range(N)])
i = 0
minprice = x[i][0]
minnumber = x[i][1]
price = 0
while True:
if M <= minnumber:
price += minprice * M
break
else:
price += minprice * minnumber
M -= minnumber
i += 1
minprice = x[i][0]
minnumber = x[i][1]
print(price)
| N, M = list(map(int, input().split()))
x = sorted([list(map(int, input().split())) for i in range(N)])
i = 0
price = 0
minprice = x[i][0]
minnumber = x[i][1]
while True:
if minnumber >= M:
price += minprice * M
break
else:
price += minprice * minnumber
M -= minnumber
i += 1
minprice = x[i][0]
minnumber = x[i][1]
print(price)
| false | 0 | [
"+price = 0",
"-price = 0",
"- if M <= minnumber:",
"+ if minnumber >= M:"
] | false | 0.047418 | 0.046595 | 1.01765 | [
"s481194868",
"s207299771"
] |
u600402037 | p03087 | python | s228981282 | s801612841 | 867 | 398 | 9,204 | 8,732 | Accepted | Accepted | 54.09 | N, Q = list(map(int, input().split()))
S = eval(input())
B = [0] * N
for i in range(N-1):
if S[i] == 'A' and S[i+1] == 'C':
B[i] = 1
for i in range(1, N-1):
B[i] += B[i-1]
for i in range(Q):
l, r = list(map(int, input().split()))
print((B[r-2] - B[l-2])) | # coding: utf-8
import sys
import itertools
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
N, Q = lr()
S = sr()
ac = [0] * (N-1)
for i, x in enumerate(zip(S[:], S[1:])):
if x[0] == 'A' and x[1] == 'C':
ac[i] = 1
cum = list(itertools.accumulate(ac))
for _ in range(Q):
l, r = lr()
result = cum[r-2]
if l > 1:
result -= cum[l-2]
print(result)
| 11 | 22 | 268 | 462 | N, Q = list(map(int, input().split()))
S = eval(input())
B = [0] * N
for i in range(N - 1):
if S[i] == "A" and S[i + 1] == "C":
B[i] = 1
for i in range(1, N - 1):
B[i] += B[i - 1]
for i in range(Q):
l, r = list(map(int, input().split()))
print((B[r - 2] - B[l - 2]))
| # coding: utf-8
import sys
import itertools
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
N, Q = lr()
S = sr()
ac = [0] * (N - 1)
for i, x in enumerate(zip(S[:], S[1:])):
if x[0] == "A" and x[1] == "C":
ac[i] = 1
cum = list(itertools.accumulate(ac))
for _ in range(Q):
l, r = lr()
result = cum[r - 2]
if l > 1:
result -= cum[l - 2]
print(result)
| false | 50 | [
"-N, Q = list(map(int, input().split()))",
"-S = eval(input())",
"-B = [0] * N",
"-for i in range(N - 1):",
"- if S[i] == \"A\" and S[i + 1] == \"C\":",
"- B[i] = 1",
"-for i in range(1, N - 1):",
"- B[i] += B[i - 1]",
"-for i in range(Q):",
"- l, r = list(map(int, input().split())... | false | 0.037609 | 0.037452 | 1.004187 | [
"s228981282",
"s801612841"
] |
u811967730 | p03624 | python | s445013260 | s868362091 | 24 | 17 | 3,828 | 3,188 | Accepted | Accepted | 29.17 | import string
S = str(eval(input()))
ans = "None"
for s in string.ascii_lowercase:
if s not in S:
ans = s
break
print(ans)
| S = eval(input())
ans = "None"
alphabet = [chr(ord("a") + i) for i in range(26)]
for s in alphabet:
if s not in S:
ans = s
break
print(ans)
| 11 | 10 | 150 | 165 | import string
S = str(eval(input()))
ans = "None"
for s in string.ascii_lowercase:
if s not in S:
ans = s
break
print(ans)
| S = eval(input())
ans = "None"
alphabet = [chr(ord("a") + i) for i in range(26)]
for s in alphabet:
if s not in S:
ans = s
break
print(ans)
| false | 9.090909 | [
"-import string",
"-",
"-S = str(eval(input()))",
"+S = eval(input())",
"-for s in string.ascii_lowercase:",
"+alphabet = [chr(ord(\"a\") + i) for i in range(26)]",
"+for s in alphabet:"
] | false | 0.046972 | 0.039007 | 1.204195 | [
"s445013260",
"s868362091"
] |
u057993957 | p02711 | python | s345125641 | s542122316 | 20 | 18 | 9,088 | 8,980 | Accepted | Accepted | 10 | n = list(eval(input()))
print(("Yes" if "7" in n else "No")) | print(("Yes" if "7" in list(eval(input())) else "No")) | 2 | 1 | 53 | 46 | n = list(eval(input()))
print(("Yes" if "7" in n else "No"))
| print(("Yes" if "7" in list(eval(input())) else "No"))
| false | 50 | [
"-n = list(eval(input()))",
"-print((\"Yes\" if \"7\" in n else \"No\"))",
"+print((\"Yes\" if \"7\" in list(eval(input())) else \"No\"))"
] | false | 0.035196 | 0.035885 | 0.980809 | [
"s345125641",
"s542122316"
] |
u633068244 | p00061 | python | s394747761 | s431374906 | 20 | 10 | 4,212 | 4,216 | Accepted | Accepted | 50 | tp = {}
while 1:
t,p = list(map(int,input().split(",")))
if t == p == 0: break
tp[t] = p
plist = sorted(list(set([tp[key] for key in list(tp.keys())])),reverse = True)
while 1:
try:
team = int(input())
except:
break
print(plist.index(tp[team])+1) | tp = {}
while 1:
t,p = list(map(int,input().split(",")))
if t==p==0:break
tp[t]=p
ls=sorted(list(set([tp[key] for key in list(tp.keys())])),reverse=True)
while 1:
try:team=int(input())
except:break
print(ls.index(tp[team])+1) | 12 | 10 | 262 | 235 | tp = {}
while 1:
t, p = list(map(int, input().split(",")))
if t == p == 0:
break
tp[t] = p
plist = sorted(list(set([tp[key] for key in list(tp.keys())])), reverse=True)
while 1:
try:
team = int(input())
except:
break
print(plist.index(tp[team]) + 1)
| tp = {}
while 1:
t, p = list(map(int, input().split(",")))
if t == p == 0:
break
tp[t] = p
ls = sorted(list(set([tp[key] for key in list(tp.keys())])), reverse=True)
while 1:
try:
team = int(input())
except:
break
print(ls.index(tp[team]) + 1)
| false | 16.666667 | [
"-plist = sorted(list(set([tp[key] for key in list(tp.keys())])), reverse=True)",
"+ls = sorted(list(set([tp[key] for key in list(tp.keys())])), reverse=True)",
"- print(plist.index(tp[team]) + 1)",
"+ print(ls.index(tp[team]) + 1)"
] | false | 0.046264 | 0.045767 | 1.010856 | [
"s394747761",
"s431374906"
] |
u562016607 | p03286 | python | s557640093 | s576368901 | 162 | 17 | 38,384 | 2,940 | Accepted | Accepted | 89.51 | N=int(eval(input()))
S=""
if N==0:
print((0))
exit()
while(True):
if N==1:
S="1"+S
break
if N%2==1:
S="1"+S
else:
S="0"+S
N-=N%2
N=N//(-2)
print(S)
| def minus2(K):
if K==1:
return "1"
if K==0:
return "0"
S=""
if K%2==1:
S="1"
else:
S="0"
K-=K%2
return minus2(-K//2)+S
print((minus2(int(eval(input())))))
| 16 | 14 | 215 | 221 | N = int(eval(input()))
S = ""
if N == 0:
print((0))
exit()
while True:
if N == 1:
S = "1" + S
break
if N % 2 == 1:
S = "1" + S
else:
S = "0" + S
N -= N % 2
N = N // (-2)
print(S)
| def minus2(K):
if K == 1:
return "1"
if K == 0:
return "0"
S = ""
if K % 2 == 1:
S = "1"
else:
S = "0"
K -= K % 2
return minus2(-K // 2) + S
print((minus2(int(eval(input())))))
| false | 12.5 | [
"-N = int(eval(input()))",
"-S = \"\"",
"-if N == 0:",
"- print((0))",
"- exit()",
"-while True:",
"- if N == 1:",
"- S = \"1\" + S",
"- break",
"- if N % 2 == 1:",
"- S = \"1\" + S",
"+def minus2(K):",
"+ if K == 1:",
"+ return \"1\"",
"+ if... | false | 0.040931 | 0.035967 | 1.138011 | [
"s557640093",
"s576368901"
] |
u537905693 | p03112 | python | s914712280 | s680084628 | 623 | 558 | 36,620 | 40,976 | Accepted | Accepted | 10.43 | #!/usr/bin/env python
# coding: utf-8
import sys
input = sys.stdin.readline
inf = float('inf')
def main():
A, B, Q = list(map(int, input().split()))
ls = [-inf] + [int(eval(input())) for _ in range(A)] + [inf]
lt = [-inf] + [int(eval(input())) for _ in range(B)] + [inf]
lx = [(int(eval(input())), i) for i in range(Q)]
ls.sort()
lt.sort()
lx.sort()
ans = {}
s = 1
t = 1
for i in range(Q):
dist = -1
x = lx[i][0]
while s <= A and ls[s] < x:
s += 1
while t <= B and lt[t] < x:
t += 1
s_min = ls[s-1]
s_max = ls[s]
t_min = lt[t-1]
t_max = lt[t]
d = min(max(s_max-x, t_max-x),
(s_max-x)*2 + (x-t_min),
(t_max-x)*2 + (x-s_min),
(s_max-x) + (x-t_min)*2,
(t_max-x) + (x-s_min)*2,
max(x-s_min,x-t_min))
ans[lx[i][1]] = d
for i in range(Q):
print((ans[i]))
if __name__ == '__main__':
main()
| #!/usr/bin/env python
# coding: utf-8
import sys
input = sys.stdin.readline
inf = float('inf')
def main():
A, B, Q = list(map(int, input().split()))
ls = [-inf] + [int(eval(input())) for _ in range(A)] + [inf]
lt = [-inf] + [int(eval(input())) for _ in range(B)] + [inf]
lx = [(int(eval(input())), i) for i in range(Q)]
ls.sort()
lt.sort()
lx.sort()
ans = {}
s = 1
t = 1
for i in range(Q):
dist = -1
x = lx[i][0]
while s <= A and ls[s] < x:
s += 1
while t <= B and lt[t] < x:
t += 1
s_min = ls[s-1]
s_max = ls[s]
t_min = lt[t-1]
t_max = lt[t]
d = min(max(s_max-x, t_max-x),
(s_max-x)*2 + (x-t_min),
(t_max-x)*2 + (x-s_min),
(s_max-x) + (x-t_min)*2,
(t_max-x) + (x-s_min)*2,
max(x-s_min,x-t_min))
ans[lx[i][1]] = str(d)
print(("\n".join(ans[i] for i in range(Q))))
if __name__ == '__main__':
main()
| 43 | 42 | 1,054 | 1,060 | #!/usr/bin/env python
# coding: utf-8
import sys
input = sys.stdin.readline
inf = float("inf")
def main():
A, B, Q = list(map(int, input().split()))
ls = [-inf] + [int(eval(input())) for _ in range(A)] + [inf]
lt = [-inf] + [int(eval(input())) for _ in range(B)] + [inf]
lx = [(int(eval(input())), i) for i in range(Q)]
ls.sort()
lt.sort()
lx.sort()
ans = {}
s = 1
t = 1
for i in range(Q):
dist = -1
x = lx[i][0]
while s <= A and ls[s] < x:
s += 1
while t <= B and lt[t] < x:
t += 1
s_min = ls[s - 1]
s_max = ls[s]
t_min = lt[t - 1]
t_max = lt[t]
d = min(
max(s_max - x, t_max - x),
(s_max - x) * 2 + (x - t_min),
(t_max - x) * 2 + (x - s_min),
(s_max - x) + (x - t_min) * 2,
(t_max - x) + (x - s_min) * 2,
max(x - s_min, x - t_min),
)
ans[lx[i][1]] = d
for i in range(Q):
print((ans[i]))
if __name__ == "__main__":
main()
| #!/usr/bin/env python
# coding: utf-8
import sys
input = sys.stdin.readline
inf = float("inf")
def main():
A, B, Q = list(map(int, input().split()))
ls = [-inf] + [int(eval(input())) for _ in range(A)] + [inf]
lt = [-inf] + [int(eval(input())) for _ in range(B)] + [inf]
lx = [(int(eval(input())), i) for i in range(Q)]
ls.sort()
lt.sort()
lx.sort()
ans = {}
s = 1
t = 1
for i in range(Q):
dist = -1
x = lx[i][0]
while s <= A and ls[s] < x:
s += 1
while t <= B and lt[t] < x:
t += 1
s_min = ls[s - 1]
s_max = ls[s]
t_min = lt[t - 1]
t_max = lt[t]
d = min(
max(s_max - x, t_max - x),
(s_max - x) * 2 + (x - t_min),
(t_max - x) * 2 + (x - s_min),
(s_max - x) + (x - t_min) * 2,
(t_max - x) + (x - s_min) * 2,
max(x - s_min, x - t_min),
)
ans[lx[i][1]] = str(d)
print(("\n".join(ans[i] for i in range(Q))))
if __name__ == "__main__":
main()
| false | 2.325581 | [
"- ans[lx[i][1]] = d",
"- for i in range(Q):",
"- print((ans[i]))",
"+ ans[lx[i][1]] = str(d)",
"+ print((\"\\n\".join(ans[i] for i in range(Q))))"
] | false | 0.040419 | 0.046244 | 0.874046 | [
"s914712280",
"s680084628"
] |
u692632484 | p03796 | python | s906914900 | s075432547 | 46 | 35 | 2,940 | 2,940 | Accepted | Accepted | 23.91 | N=int(eval(input()))
ans=1
for i in range(1,N+1):
ans*=i
if ans>=(10**9+7):
ans%=(10**9+7)
print(ans) | N=int(eval(input()))
res=1
for i in range(1,N+1):
res=(res*i)%(10**9+7)
print(res)
| 7 | 5 | 105 | 85 | N = int(eval(input()))
ans = 1
for i in range(1, N + 1):
ans *= i
if ans >= (10**9 + 7):
ans %= 10**9 + 7
print(ans)
| N = int(eval(input()))
res = 1
for i in range(1, N + 1):
res = (res * i) % (10**9 + 7)
print(res)
| false | 28.571429 | [
"-ans = 1",
"+res = 1",
"- ans *= i",
"- if ans >= (10**9 + 7):",
"- ans %= 10**9 + 7",
"-print(ans)",
"+ res = (res * i) % (10**9 + 7)",
"+print(res)"
] | false | 0.043675 | 0.120468 | 0.362542 | [
"s906914900",
"s075432547"
] |
u433375322 | p02811 | python | s642256228 | s849863867 | 28 | 23 | 9,088 | 9,088 | Accepted | Accepted | 17.86 | a,b = list(map(int,input().split()))
if a*500>=b:
print("Yes")
else:
print("No") | K,X=list(map(int,input().split()))
if 500*K>=X:
print("Yes")
else:
print("No") | 5 | 5 | 82 | 84 | a, b = list(map(int, input().split()))
if a * 500 >= b:
print("Yes")
else:
print("No")
| K, X = list(map(int, input().split()))
if 500 * K >= X:
print("Yes")
else:
print("No")
| false | 0 | [
"-a, b = list(map(int, input().split()))",
"-if a * 500 >= b:",
"+K, X = list(map(int, input().split()))",
"+if 500 * K >= X:"
] | false | 0.036342 | 0.039373 | 0.923004 | [
"s642256228",
"s849863867"
] |
u512212329 | p02691 | python | s589627917 | s394263767 | 182 | 148 | 66,964 | 46,300 | Accepted | Accepted | 18.68 | # class Map(dict):
# def __missing__(self, key):
# # この割当てなしのほうが速い。
# # self[key] = 0
# return 0
def main():
int(eval(input()))
d = {}
ans = 0
d_setdefault = d.setdefault
d_get = d.get
for i, height in enumerate(input().split()):
height = int(height)
# 引き算のほうの i は足し算のよりも大きい。
# 従って，このように順番に見ていく必要がある。
got = d_get(i + height) or 0
d[i + height] = got + 1
ans += d_setdefault(i - height, 0)
return ans
if __name__ == '__main__':
print((main()))
# 大いに参考にした。
# https://kmjp.hatenablog.jp/entry/2020/05/03/1030
| def main():
int(eval(input()))
d = {}
ans = 0
d_get = d.get
for i, height in enumerate(input().split()):
height = int(height)
# 引き算のほうの i は足し算のよりも大きい。
# 従って，このように順番に見ていく必要がある。
got = d_get(i + height) or 0
d[i + height] = got + 1
ans += d_get(i - height) or 0
return ans
if __name__ == '__main__':
print((main()))
# 大いに参考にした。
# https://kmjp.hatenablog.jp/entry/2020/05/03/1030
| 30 | 22 | 642 | 470 | # class Map(dict):
# def __missing__(self, key):
# # この割当てなしのほうが速い。
# # self[key] = 0
# return 0
def main():
int(eval(input()))
d = {}
ans = 0
d_setdefault = d.setdefault
d_get = d.get
for i, height in enumerate(input().split()):
height = int(height)
# 引き算のほうの i は足し算のよりも大きい。
# 従って，このように順番に見ていく必要がある。
got = d_get(i + height) or 0
d[i + height] = got + 1
ans += d_setdefault(i - height, 0)
return ans
if __name__ == "__main__":
print((main()))
# 大いに参考にした。
# https://kmjp.hatenablog.jp/entry/2020/05/03/1030
| def main():
int(eval(input()))
d = {}
ans = 0
d_get = d.get
for i, height in enumerate(input().split()):
height = int(height)
# 引き算のほうの i は足し算のよりも大きい。
# 従って，このように順番に見ていく必要がある。
got = d_get(i + height) or 0
d[i + height] = got + 1
ans += d_get(i - height) or 0
return ans
if __name__ == "__main__":
print((main()))
# 大いに参考にした。
# https://kmjp.hatenablog.jp/entry/2020/05/03/1030
| false | 26.666667 | [
"-# class Map(dict):",
"-# def __missing__(self, key):",
"-# # この割当てなしのほうが速い。",
"-# # self[key] = 0",
"-# return 0",
"- d_setdefault = d.setdefault",
"- ans += d_setdefault(i - height, 0)",
"+ ans += d_get(i - height) or 0"
] | false | 0.041185 | 0.035851 | 1.148786 | [
"s589627917",
"s394263767"
] |
u188827677 | p03043 | python | s118505127 | s567768108 | 45 | 37 | 2,940 | 2,940 | Accepted | Accepted | 17.78 | n,k = list(map(int, input().split()))
ans = 0
for i in range(1, n+1):
t = 0
while i < k:
i = i*2
t += 1
ans += (0.5**t)/n
print(ans) | n,k = list(map(int, input().split()))
ans = 0
for i in range(1,n+1):
t = 0
while i < k:
i *= 2
t += 1
ans += 0.5**t
print((ans/n)) | 10 | 10 | 150 | 146 | n, k = list(map(int, input().split()))
ans = 0
for i in range(1, n + 1):
t = 0
while i < k:
i = i * 2
t += 1
ans += (0.5**t) / n
print(ans)
| n, k = list(map(int, input().split()))
ans = 0
for i in range(1, n + 1):
t = 0
while i < k:
i *= 2
t += 1
ans += 0.5**t
print((ans / n))
| false | 0 | [
"- i = i * 2",
"+ i *= 2",
"- ans += (0.5**t) / n",
"-print(ans)",
"+ ans += 0.5**t",
"+print((ans / n))"
] | false | 0.056059 | 0.053055 | 1.056626 | [
"s118505127",
"s567768108"
] |
u562935282 | p03163 | python | s753918185 | s036020913 | 464 | 391 | 119,916 | 122,444 | Accepted | Accepted | 15.73 | n, w = list(map(int, input().split()))
wv = [tuple(map(int, input().split())) for _ in range(n)]
dp = [[0] * (w + 1) for _ in range(n + 1)]
for i in range(1, n + 1):
wi, vi = wv[i - 1]
for j in range(w + 1):
if j < wi:
dp[i][j] = dp[i - 1][j]
else:
dp[i][j] = max(dp[i - 1][j], dp[i - 1][j - wi] + vi)
print((dp[n][w]))
| n, w = list(map(int, input().split()))
e = tuple(list(map(int, input().split())) for _ in range(n))
wt, vt = list(zip(*e))
dp = tuple([0] * (w + 1) for _ in range(n + 1))
for i in range(n):
dp[i + 1][:wt[i]] = dp[i][:wt[i]]
for j in range(wt[i], w + 1):
dp[i + 1][j] = max(dp[i][j], dp[i][j - wt[i]] + vt[i])
print((dp[n][w]))
| 13 | 11 | 374 | 335 | n, w = list(map(int, input().split()))
wv = [tuple(map(int, input().split())) for _ in range(n)]
dp = [[0] * (w + 1) for _ in range(n + 1)]
for i in range(1, n + 1):
wi, vi = wv[i - 1]
for j in range(w + 1):
if j < wi:
dp[i][j] = dp[i - 1][j]
else:
dp[i][j] = max(dp[i - 1][j], dp[i - 1][j - wi] + vi)
print((dp[n][w]))
| n, w = list(map(int, input().split()))
e = tuple(list(map(int, input().split())) for _ in range(n))
wt, vt = list(zip(*e))
dp = tuple([0] * (w + 1) for _ in range(n + 1))
for i in range(n):
dp[i + 1][: wt[i]] = dp[i][: wt[i]]
for j in range(wt[i], w + 1):
dp[i + 1][j] = max(dp[i][j], dp[i][j - wt[i]] + vt[i])
print((dp[n][w]))
| false | 15.384615 | [
"-wv = [tuple(map(int, input().split())) for _ in range(n)]",
"-dp = [[0] * (w + 1) for _ in range(n + 1)]",
"-for i in range(1, n + 1):",
"- wi, vi = wv[i - 1]",
"- for j in range(w + 1):",
"- if j < wi:",
"- dp[i][j] = dp[i - 1][j]",
"- else:",
"- dp[i][j]... | false | 0.040243 | 0.039329 | 1.023235 | [
"s753918185",
"s036020913"
] |
u767797498 | p02658 | python | s913565241 | s135212116 | 58 | 50 | 21,616 | 21,600 | Accepted | Accepted | 13.79 | def multiply(num_list):
# if "0" in list, return 0
if 0 in set(num_list):
return 0
# if res > 10^18: return -1
MAX = pow(10,18)
res = 1
for i in num_list:
res *= i
if res == 0:
return 0
if res > MAX:
return -1
return res
eval(input())
num_list = list(map(int,input().split()))
print((multiply(num_list))) | def multiply(num_list):
# if "0" in list, return 0
if 0 in num_list:
return 0
# if res > 10^18: return -1
MAX = pow(10,18)
res = 1
for i in num_list:
res *= i
if res > MAX:
return -1
return res
eval(input())
num_list = list(map(int,input().split()))
print((multiply(num_list))) | 19 | 17 | 360 | 321 | def multiply(num_list):
# if "0" in list, return 0
if 0 in set(num_list):
return 0
# if res > 10^18: return -1
MAX = pow(10, 18)
res = 1
for i in num_list:
res *= i
if res == 0:
return 0
if res > MAX:
return -1
return res
eval(input())
num_list = list(map(int, input().split()))
print((multiply(num_list)))
| def multiply(num_list):
# if "0" in list, return 0
if 0 in num_list:
return 0
# if res > 10^18: return -1
MAX = pow(10, 18)
res = 1
for i in num_list:
res *= i
if res > MAX:
return -1
return res
eval(input())
num_list = list(map(int, input().split()))
print((multiply(num_list)))
| false | 10.526316 | [
"- if 0 in set(num_list):",
"+ if 0 in num_list:",
"- if res == 0:",
"- return 0"
] | false | 0.041278 | 0.038484 | 1.072606 | [
"s913565241",
"s135212116"
] |
u119148115 | p03818 | python | s093441038 | s457864500 | 111 | 97 | 120,228 | 84,580 | Accepted | Accepted | 12.61 | import sys
sys.setrecursionlimit(10**7)
def I(): return int(sys.stdin.readline().rstrip())
def MI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LI(): return list(map(int,sys.stdin.readline().rstrip().split())) #空白あり
def LI2(): return list(map(int,sys.stdin.readline().rstrip())) #空白なし
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split()) #空白あり
def LS2(): return list(sys.stdin.readline().rstrip()) #空白なし
N = I()
A = LI()
B = sorted(set(A))
d = {}
for b in B:
d[b] = 0
for a in A:
d[a] += 1
C = [d[b] for b in B]
ans = len(B)
x = sum(c-1 for c in C)
if x % 2 == 1:
ans -= 1
print(ans)
| import sys
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split())) #空白あり
N = I()
A = LI()
B = [0]*(10**5+1)
for a in A:
B[a] += 1
print((sum(B[i] != 0 for i in range(10**5+1))-(sum(max(0,B[i]-1) for i in range(10**5+1)) % 2)))
| 29 | 12 | 703 | 309 | import sys
sys.setrecursionlimit(10**7)
def I():
return int(sys.stdin.readline().rstrip())
def MI():
return list(map(int, sys.stdin.readline().rstrip().split()))
def LI():
return list(map(int, sys.stdin.readline().rstrip().split())) # 空白あり
def LI2():
return list(map(int, sys.stdin.readline().rstrip())) # 空白なし
def S():
return sys.stdin.readline().rstrip()
def LS():
return list(sys.stdin.readline().rstrip().split()) # 空白あり
def LS2():
return list(sys.stdin.readline().rstrip()) # 空白なし
N = I()
A = LI()
B = sorted(set(A))
d = {}
for b in B:
d[b] = 0
for a in A:
d[a] += 1
C = [d[b] for b in B]
ans = len(B)
x = sum(c - 1 for c in C)
if x % 2 == 1:
ans -= 1
print(ans)
| import sys
def I():
return int(sys.stdin.readline().rstrip())
def LI():
return list(map(int, sys.stdin.readline().rstrip().split())) # 空白あり
N = I()
A = LI()
B = [0] * (10**5 + 1)
for a in A:
B[a] += 1
print(
(
sum(B[i] != 0 for i in range(10**5 + 1))
- (sum(max(0, B[i] - 1) for i in range(10**5 + 1)) % 2)
)
)
| false | 58.62069 | [
"-",
"-sys.setrecursionlimit(10**7)",
"-def MI():",
"- return list(map(int, sys.stdin.readline().rstrip().split()))",
"-",
"-",
"-def LI2():",
"- return list(map(int, sys.stdin.readline().rstrip())) # 空白なし",
"-",
"-",
"-def S():",
"- return sys.stdin.readline().rstrip()",
"-",
"-... | false | 0.036983 | 0.062404 | 0.592641 | [
"s093441038",
"s457864500"
] |
u191874006 | p02947 | python | s676298008 | s456600323 | 1,738 | 695 | 163,972 | 121,424 | Accepted | Accepted | 60.01 | #!/usr/bin/env python3
#ABC137 C
import sys
import math
import bisect
sys.setrecursionlimit(1000000000)
from heapq import heappush, heappop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
def comb(n,r):
return math.factorial(n)//math.factorial(n-r)//math.factorial(r)
n = I()
s = [eval(input()) for _ in range(n)]
x = [list(Counter(s[i]).items()) for i in range(n)]
for i in x:
i.sort()
y = [tuple(i) for i in x]
f = defaultdict(lambda : 0)
for i in range(n):
f[y[i]] += 1
ans = 0
for i in list(f.values()):
if i < 2:
continue
ans += comb(i,2)
print(ans)
| #!/usr/bin/env python3
#ABC137 C
import sys
import math
import bisect
sys.setrecursionlimit(1000000000)
from heapq import heappush, heappop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
n = I()
s = [list(eval(input())) for _ in range(n)]
for i in s:
i.sort()
s = [''.join(i) for i in s]
t = list(Counter(s).items())
ans = 0
for i,j in t:
if j == 1:
continue
else:
ans += (j)*(j-1)//2
print(ans)
| 36 | 31 | 878 | 720 | #!/usr/bin/env python3
# ABC137 C
import sys
import math
import bisect
sys.setrecursionlimit(1000000000)
from heapq import heappush, heappop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7
def I():
return int(sys.stdin.readline())
def LI():
return list(map(int, sys.stdin.readline().split()))
def comb(n, r):
return math.factorial(n) // math.factorial(n - r) // math.factorial(r)
n = I()
s = [eval(input()) for _ in range(n)]
x = [list(Counter(s[i]).items()) for i in range(n)]
for i in x:
i.sort()
y = [tuple(i) for i in x]
f = defaultdict(lambda: 0)
for i in range(n):
f[y[i]] += 1
ans = 0
for i in list(f.values()):
if i < 2:
continue
ans += comb(i, 2)
print(ans)
| #!/usr/bin/env python3
# ABC137 C
import sys
import math
import bisect
sys.setrecursionlimit(1000000000)
from heapq import heappush, heappop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7
def I():
return int(sys.stdin.readline())
def LI():
return list(map(int, sys.stdin.readline().split()))
n = I()
s = [list(eval(input())) for _ in range(n)]
for i in s:
i.sort()
s = ["".join(i) for i in s]
t = list(Counter(s).items())
ans = 0
for i, j in t:
if j == 1:
continue
else:
ans += (j) * (j - 1) // 2
print(ans)
| false | 13.888889 | [
"-def comb(n, r):",
"- return math.factorial(n) // math.factorial(n - r) // math.factorial(r)",
"-",
"-",
"-s = [eval(input()) for _ in range(n)]",
"-x = [list(Counter(s[i]).items()) for i in range(n)]",
"-for i in x:",
"+s = [list(eval(input())) for _ in range(n)]",
"+for i in s:",
"-y = [tupl... | false | 0.040196 | 0.00796 | 5.04986 | [
"s676298008",
"s456600323"
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.