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
sequence | 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
sequence |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
u350997995 | p03061 | python | s976837125 | s072223381 | 370 | 192 | 14,080 | 14,584 | Accepted | Accepted | 48.11 | N = int(eval(input()))
A = list(map(int,input().split()))
A.sort()
min_ptn = A[1]
for i in range(min_ptn,0,-1):
count = 0
for a in A:
if a%i!=0:
count+=1
if count>1:
break
if count<2:
print(i)
break | def gcd(x,y):
if x<y:x,y =y,x
if y==0: return x
return gcd(y,x%y)
N = int(eval(input()))
A = list(map(int,input().split()))
L = [0]
R = [0]
M = []
for i in range(N):
L.append(gcd(L[i],A[i]))
R.append(gcd(R[i],A[N-i-1]))
R.reverse()
print((max([gcd(L[i],R[i+1])for i in range(N)]))) | 14 | 14 | 239 | 306 | N = int(eval(input()))
A = list(map(int, input().split()))
A.sort()
min_ptn = A[1]
for i in range(min_ptn, 0, -1):
count = 0
for a in A:
if a % i != 0:
count += 1
if count > 1:
break
if count < 2:
print(i)
break
| def gcd(x, y):
if x < y:
x, y = y, x
if y == 0:
return x
return gcd(y, x % y)
N = int(eval(input()))
A = list(map(int, input().split()))
L = [0]
R = [0]
M = []
for i in range(N):
L.append(gcd(L[i], A[i]))
R.append(gcd(R[i], A[N - i - 1]))
R.reverse()
print((max([gcd(L[i], R[i + 1]) for i in range(N)])))
| false | 0 | [
"+def gcd(x, y):",
"+ if x < y:",
"+ x, y = y, x",
"+ if y == 0:",
"+ return x",
"+ return gcd(y, x % y)",
"+",
"+",
"-A.sort()",
"-min_ptn = A[1]",
"-for i in range(min_ptn, 0, -1):",
"- count = 0",
"- for a in A:",
"- if a % i != 0:",
"- count += 1",
"- if count > 1:",
"- break",
"- if count < 2:",
"- print(i)",
"- break",
"+L = [0]",
"+R = [0]",
"+M = []",
"+for i in range(N):",
"+ L.append(gcd(L[i], A[i]))",
"+ R.append(gcd(R[i], A[N - i - 1]))",
"+R.reverse()",
"+print((max([gcd(L[i], R[i + 1]) for i in range(N)])))"
] | false | 0.035633 | 0.058437 | 0.609768 | [
"s976837125",
"s072223381"
] |
u952708174 | p02597 | python | s161616335 | s683172553 | 95 | 54 | 20,460 | 9,476 | Accepted | Accepted | 43.16 | def d_alter_altar():
N = int(eval(input()))
C = eval(input())
stone_white_total, stone_red_total = C.count('W'), C.count('R')
stone_white_left, stone_red_right = [0], [stone_red_total]
stone_white, stone_red = 0, stone_red_total
for stone in C:
if stone == 'W':
stone_white += 1
else:
stone_red -= 1
stone_white_left.append(stone_white)
stone_red_right.append(stone_red)
return min([max(w, r) for w, r in zip(stone_white_left, stone_red_right)])
print((d_alter_altar())) | def d_alter_altar_2():
N = int(eval(input()))
C = eval(input())
left, right = 0, N - 1
ans = 0
while left < right:
while left < right and C[left] == 'R':
left += 1
while right >= 0 and C[right] == 'W':
right -= 1
if left >= right:
break
left += 1
right -= 1
ans += 1
return ans
print((d_alter_altar_2())) | 19 | 20 | 562 | 420 | def d_alter_altar():
N = int(eval(input()))
C = eval(input())
stone_white_total, stone_red_total = C.count("W"), C.count("R")
stone_white_left, stone_red_right = [0], [stone_red_total]
stone_white, stone_red = 0, stone_red_total
for stone in C:
if stone == "W":
stone_white += 1
else:
stone_red -= 1
stone_white_left.append(stone_white)
stone_red_right.append(stone_red)
return min([max(w, r) for w, r in zip(stone_white_left, stone_red_right)])
print((d_alter_altar()))
| def d_alter_altar_2():
N = int(eval(input()))
C = eval(input())
left, right = 0, N - 1
ans = 0
while left < right:
while left < right and C[left] == "R":
left += 1
while right >= 0 and C[right] == "W":
right -= 1
if left >= right:
break
left += 1
right -= 1
ans += 1
return ans
print((d_alter_altar_2()))
| false | 5 | [
"-def d_alter_altar():",
"+def d_alter_altar_2():",
"- stone_white_total, stone_red_total = C.count(\"W\"), C.count(\"R\")",
"- stone_white_left, stone_red_right = [0], [stone_red_total]",
"- stone_white, stone_red = 0, stone_red_total",
"- for stone in C:",
"- if stone == \"W\":",
"- stone_white += 1",
"- else:",
"- stone_red -= 1",
"- stone_white_left.append(stone_white)",
"- stone_red_right.append(stone_red)",
"- return min([max(w, r) for w, r in zip(stone_white_left, stone_red_right)])",
"+ left, right = 0, N - 1",
"+ ans = 0",
"+ while left < right:",
"+ while left < right and C[left] == \"R\":",
"+ left += 1",
"+ while right >= 0 and C[right] == \"W\":",
"+ right -= 1",
"+ if left >= right:",
"+ break",
"+ left += 1",
"+ right -= 1",
"+ ans += 1",
"+ return ans",
"-print((d_alter_altar()))",
"+print((d_alter_altar_2()))"
] | false | 0.095255 | 0.110666 | 0.860738 | [
"s161616335",
"s683172553"
] |
u418826171 | p02639 | python | s739871607 | s084855066 | 24 | 20 | 9,104 | 8,936 | Accepted | Accepted | 16.67 | x = tuple(map(int, input().split()))
for i in range(5):
if x[i] == 0:
print((i+1)) | x = list(map(int, input().split()))
for i in range(5):
if x[i] == 0:
print((i+1)) | 4 | 4 | 95 | 94 | x = tuple(map(int, input().split()))
for i in range(5):
if x[i] == 0:
print((i + 1))
| x = list(map(int, input().split()))
for i in range(5):
if x[i] == 0:
print((i + 1))
| false | 0 | [
"-x = tuple(map(int, input().split()))",
"+x = list(map(int, input().split()))"
] | false | 0.039168 | 0.041367 | 0.946838 | [
"s739871607",
"s084855066"
] |
u193019328 | p04001 | python | s190302689 | s546881310 | 23 | 20 | 3,064 | 3,060 | Accepted | Accepted | 13.04 | s = eval(input())
n = len(s) - 1
answers = []
sl = [s[i] for i in range(len(s))]
for i in range(2 ** n):
tmp = []
for j in range(n):
if ((i >> j) & 1):
tmp.append(j)
ll = ['*']*len(s)
for k in tmp:
ll[k] = '+'
ans = []
for k, _ in zip(sl, ll):
ans.append(k)
ans.append(_)
ans = [_ for _ in ans if _ != '*']
ans = ''.join(ans)
ans = ans.split('+')
ans = [int(_) for _ in ans if _ != '+']
ans = sum(ans)
answers.append(ans)
print((sum(answers))) | s = eval(input())
n = len(s)
ans = 0
for bit in range(1 << (n - 1)):
f = s[0]
for i in range(n - 1):
# ここのif文の判定基準が理解できていません。
if bit & (1 << i):
f += "+"
f += s[i + 1]
ans += sum(map(int, f.split("+")))
print(ans) | 23 | 17 | 549 | 276 | s = eval(input())
n = len(s) - 1
answers = []
sl = [s[i] for i in range(len(s))]
for i in range(2**n):
tmp = []
for j in range(n):
if (i >> j) & 1:
tmp.append(j)
ll = ["*"] * len(s)
for k in tmp:
ll[k] = "+"
ans = []
for k, _ in zip(sl, ll):
ans.append(k)
ans.append(_)
ans = [_ for _ in ans if _ != "*"]
ans = "".join(ans)
ans = ans.split("+")
ans = [int(_) for _ in ans if _ != "+"]
ans = sum(ans)
answers.append(ans)
print((sum(answers)))
| s = eval(input())
n = len(s)
ans = 0
for bit in range(1 << (n - 1)):
f = s[0]
for i in range(n - 1):
# ここのif文の判定基準が理解できていません。
if bit & (1 << i):
f += "+"
f += s[i + 1]
ans += sum(map(int, f.split("+")))
print(ans)
| false | 26.086957 | [
"-n = len(s) - 1",
"-answers = []",
"-sl = [s[i] for i in range(len(s))]",
"-for i in range(2**n):",
"- tmp = []",
"- for j in range(n):",
"- if (i >> j) & 1:",
"- tmp.append(j)",
"- ll = [\"*\"] * len(s)",
"- for k in tmp:",
"- ll[k] = \"+\"",
"- ans = []",
"- for k, _ in zip(sl, ll):",
"- ans.append(k)",
"- ans.append(_)",
"- ans = [_ for _ in ans if _ != \"*\"]",
"- ans = \"\".join(ans)",
"- ans = ans.split(\"+\")",
"- ans = [int(_) for _ in ans if _ != \"+\"]",
"- ans = sum(ans)",
"- answers.append(ans)",
"-print((sum(answers)))",
"+n = len(s)",
"+ans = 0",
"+for bit in range(1 << (n - 1)):",
"+ f = s[0]",
"+ for i in range(n - 1):",
"+ # ここのif文の判定基準が理解できていません。",
"+ if bit & (1 << i):",
"+ f += \"+\"",
"+ f += s[i + 1]",
"+ ans += sum(map(int, f.split(\"+\")))",
"+print(ans)"
] | false | 0.06744 | 0.066608 | 1.012481 | [
"s190302689",
"s546881310"
] |
u806976856 | p03645 | python | s800193777 | s869777568 | 498 | 300 | 108,924 | 77,696 | Accepted | Accepted | 39.76 | n,m=list(map(int,input().split()))
edg=[[] for i in range(n+1)]
for i in range(m):
a,b=list(map(int,input().split()))
edg[a].append(b)
edg[b].append(a)
f=1
for i in range(2,n+1):
if 1 in edg[i] and n in edg[i]:
f=0
print(("POSSIBLE" if f==0 else "IMPOSSIBLE"))
| n,m=list(map(int,input().split()))
edg1=[0]*(n+1)
edgn=[0]*(n+1)
for i in range(m):
a,b=list(map(int,input().split()))
if a==1:
edg1[b]=1
if b==n:
edgn[a]=1
f=1
for i in range(2,n+1):
if edg1[i]==1 and edgn[i]==1:
f=0
print(("POSSIBLE" if f==0 else "IMPOSSIBLE"))
| 11 | 15 | 281 | 305 | n, m = list(map(int, input().split()))
edg = [[] for i in range(n + 1)]
for i in range(m):
a, b = list(map(int, input().split()))
edg[a].append(b)
edg[b].append(a)
f = 1
for i in range(2, n + 1):
if 1 in edg[i] and n in edg[i]:
f = 0
print(("POSSIBLE" if f == 0 else "IMPOSSIBLE"))
| n, m = list(map(int, input().split()))
edg1 = [0] * (n + 1)
edgn = [0] * (n + 1)
for i in range(m):
a, b = list(map(int, input().split()))
if a == 1:
edg1[b] = 1
if b == n:
edgn[a] = 1
f = 1
for i in range(2, n + 1):
if edg1[i] == 1 and edgn[i] == 1:
f = 0
print(("POSSIBLE" if f == 0 else "IMPOSSIBLE"))
| false | 26.666667 | [
"-edg = [[] for i in range(n + 1)]",
"+edg1 = [0] * (n + 1)",
"+edgn = [0] * (n + 1)",
"- edg[a].append(b)",
"- edg[b].append(a)",
"+ if a == 1:",
"+ edg1[b] = 1",
"+ if b == n:",
"+ edgn[a] = 1",
"- if 1 in edg[i] and n in edg[i]:",
"+ if edg1[i] == 1 and edgn[i] == 1:"
] | false | 0.007908 | 0.076299 | 0.103642 | [
"s800193777",
"s869777568"
] |
u899975427 | p02973 | python | s366129416 | s339770536 | 422 | 122 | 7,284 | 7,068 | Accepted | Accepted | 71.09 | import sys
import bisect
from collections import deque
input = sys.stdin.readline
n = int(input().strip())
q = deque()
qappL = q.appendleft
for i in range(n):
a = int(input().strip())
b = bisect.bisect_left(q,a)
if b == 0:
qappL(a)
else:
q[b-1] = a
print((len(q))) | import sys
import bisect
input = sys.stdin.readline
n = int(input().strip())
q = [-int(input().strip())]
qapp = q.append
bis_r = bisect.bisect_right
for i in range(n-1):
a = -int(input().strip())
if q[-1] <= a:
qapp(a)
else:
b = bis_r(q,a)
q[b] = a
print((len(q))) | 15 | 15 | 292 | 294 | import sys
import bisect
from collections import deque
input = sys.stdin.readline
n = int(input().strip())
q = deque()
qappL = q.appendleft
for i in range(n):
a = int(input().strip())
b = bisect.bisect_left(q, a)
if b == 0:
qappL(a)
else:
q[b - 1] = a
print((len(q)))
| import sys
import bisect
input = sys.stdin.readline
n = int(input().strip())
q = [-int(input().strip())]
qapp = q.append
bis_r = bisect.bisect_right
for i in range(n - 1):
a = -int(input().strip())
if q[-1] <= a:
qapp(a)
else:
b = bis_r(q, a)
q[b] = a
print((len(q)))
| false | 0 | [
"-from collections import deque",
"-q = deque()",
"-qappL = q.appendleft",
"-for i in range(n):",
"- a = int(input().strip())",
"- b = bisect.bisect_left(q, a)",
"- if b == 0:",
"- qappL(a)",
"+q = [-int(input().strip())]",
"+qapp = q.append",
"+bis_r = bisect.bisect_right",
"+for i in range(n - 1):",
"+ a = -int(input().strip())",
"+ if q[-1] <= a:",
"+ qapp(a)",
"- q[b - 1] = a",
"+ b = bis_r(q, a)",
"+ q[b] = a"
] | false | 0.037416 | 0.037212 | 1.005477 | [
"s366129416",
"s339770536"
] |
u620084012 | p03805 | python | s269817279 | s431106681 | 32 | 28 | 3,064 | 9,216 | Accepted | Accepted | 12.5 | N, M = list(map(int, input().split()))
P = [list(map(int, input().split())) for k in range(M)]
G = [[0 for k in range(N)] for k in range(N)]
for p in P:
G[p[0]-1][p[1]-1] = G[p[1]-1][p[0]-1] = 1
def dfs(ima,itta):
if len(itta)==N:
return 1
ans = 0
for k in range(N):
if ima[k]==1 and k not in itta:
itta.append(k)
ans += dfs(G[k],itta)
itta.remove(k)
return ans
print((dfs(G[0],[0])))
| N, M = list(map(int,input().split()))
G = [[] for k in range(N)]
for k in range(M):
a, b = list(map(int,input().split()))
G[a-1].append(b-1)
G[b-1].append(a-1)
def dfs(ima,visited):
global ans
visited[ima] = 1
for tsugi in G[ima]:
if visited[tsugi] == 0:
visited[tsugi] = 1
if sum(visited) == N:
ans += 1
dfs(tsugi,visited)
visited[tsugi] = 0
ans = 0
dfs(0,[0]*N)
print(ans)
| 18 | 21 | 468 | 481 | N, M = list(map(int, input().split()))
P = [list(map(int, input().split())) for k in range(M)]
G = [[0 for k in range(N)] for k in range(N)]
for p in P:
G[p[0] - 1][p[1] - 1] = G[p[1] - 1][p[0] - 1] = 1
def dfs(ima, itta):
if len(itta) == N:
return 1
ans = 0
for k in range(N):
if ima[k] == 1 and k not in itta:
itta.append(k)
ans += dfs(G[k], itta)
itta.remove(k)
return ans
print((dfs(G[0], [0])))
| N, M = list(map(int, input().split()))
G = [[] for k in range(N)]
for k in range(M):
a, b = list(map(int, input().split()))
G[a - 1].append(b - 1)
G[b - 1].append(a - 1)
def dfs(ima, visited):
global ans
visited[ima] = 1
for tsugi in G[ima]:
if visited[tsugi] == 0:
visited[tsugi] = 1
if sum(visited) == N:
ans += 1
dfs(tsugi, visited)
visited[tsugi] = 0
ans = 0
dfs(0, [0] * N)
print(ans)
| false | 14.285714 | [
"-P = [list(map(int, input().split())) for k in range(M)]",
"-G = [[0 for k in range(N)] for k in range(N)]",
"-for p in P:",
"- G[p[0] - 1][p[1] - 1] = G[p[1] - 1][p[0] - 1] = 1",
"+G = [[] for k in range(N)]",
"+for k in range(M):",
"+ a, b = list(map(int, input().split()))",
"+ G[a - 1].append(b - 1)",
"+ G[b - 1].append(a - 1)",
"-def dfs(ima, itta):",
"- if len(itta) == N:",
"- return 1",
"- ans = 0",
"- for k in range(N):",
"- if ima[k] == 1 and k not in itta:",
"- itta.append(k)",
"- ans += dfs(G[k], itta)",
"- itta.remove(k)",
"- return ans",
"+def dfs(ima, visited):",
"+ global ans",
"+ visited[ima] = 1",
"+ for tsugi in G[ima]:",
"+ if visited[tsugi] == 0:",
"+ visited[tsugi] = 1",
"+ if sum(visited) == N:",
"+ ans += 1",
"+ dfs(tsugi, visited)",
"+ visited[tsugi] = 0",
"-print((dfs(G[0], [0])))",
"+ans = 0",
"+dfs(0, [0] * N)",
"+print(ans)"
] | false | 0.043098 | 0.067626 | 0.637304 | [
"s269817279",
"s431106681"
] |
u596536048 | p03694 | python | s651572941 | s713323805 | 30 | 27 | 9,148 | 9,024 | Accepted | Accepted | 10 | N = eval(input())
a = list(map(int, input().split()))
print((max(a)-min(a))) | total_house = int(eval(input()))
house_coordinate = sorted(list(map(int, input().split())))
print((house_coordinate[total_house - 1]- house_coordinate[0])) | 3 | 3 | 70 | 149 | N = eval(input())
a = list(map(int, input().split()))
print((max(a) - min(a)))
| total_house = int(eval(input()))
house_coordinate = sorted(list(map(int, input().split())))
print((house_coordinate[total_house - 1] - house_coordinate[0]))
| false | 0 | [
"-N = eval(input())",
"-a = list(map(int, input().split()))",
"-print((max(a) - min(a)))",
"+total_house = int(eval(input()))",
"+house_coordinate = sorted(list(map(int, input().split())))",
"+print((house_coordinate[total_house - 1] - house_coordinate[0]))"
] | false | 0.041378 | 0.03783 | 1.093787 | [
"s651572941",
"s713323805"
] |
u896741788 | p03252 | python | s425052798 | s752814448 | 171 | 28 | 47,228 | 3,672 | Accepted | Accepted | 83.63 | s=eval(input());d=eval(input());n=len(s)
di={"abcdefghijklmnopqrstuvwxyz"[i]:i for i in range(26)}
sl,dl=[set() for _ in range(26)],[set() for _ in range(26)]
for i,(x,y) in enumerate(zip(s,d)):
sl[di[x]].add(i);dl[di[y]].add(i)
for i in dl:
if i and i not in sl :print("No");exit()
print("Yes")
| s=eval(input());d=eval(input())
l=('a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z')
for a,c in zip(sorted([s.count(i)for i in l]),sorted([d.count(i)for i in l])):
if a!=c:print("No");exit()
print("Yes") | 8 | 5 | 296 | 252 | s = eval(input())
d = eval(input())
n = len(s)
di = {"abcdefghijklmnopqrstuvwxyz"[i]: i for i in range(26)}
sl, dl = [set() for _ in range(26)], [set() for _ in range(26)]
for i, (x, y) in enumerate(zip(s, d)):
sl[di[x]].add(i)
dl[di[y]].add(i)
for i in dl:
if i and i not in sl:
print("No")
exit()
print("Yes")
| s = eval(input())
d = eval(input())
l = (
"a",
"b",
"c",
"d",
"e",
"f",
"g",
"h",
"i",
"j",
"k",
"l",
"m",
"n",
"o",
"p",
"q",
"r",
"s",
"t",
"u",
"v",
"w",
"x",
"y",
"z",
)
for a, c in zip(sorted([s.count(i) for i in l]), sorted([d.count(i) for i in l])):
if a != c:
print("No")
exit()
print("Yes")
| false | 37.5 | [
"-n = len(s)",
"-di = {\"abcdefghijklmnopqrstuvwxyz\"[i]: i for i in range(26)}",
"-sl, dl = [set() for _ in range(26)], [set() for _ in range(26)]",
"-for i, (x, y) in enumerate(zip(s, d)):",
"- sl[di[x]].add(i)",
"- dl[di[y]].add(i)",
"-for i in dl:",
"- if i and i not in sl:",
"+l = (",
"+ \"a\",",
"+ \"b\",",
"+ \"c\",",
"+ \"d\",",
"+ \"e\",",
"+ \"f\",",
"+ \"g\",",
"+ \"h\",",
"+ \"i\",",
"+ \"j\",",
"+ \"k\",",
"+ \"l\",",
"+ \"m\",",
"+ \"n\",",
"+ \"o\",",
"+ \"p\",",
"+ \"q\",",
"+ \"r\",",
"+ \"s\",",
"+ \"t\",",
"+ \"u\",",
"+ \"v\",",
"+ \"w\",",
"+ \"x\",",
"+ \"y\",",
"+ \"z\",",
"+)",
"+for a, c in zip(sorted([s.count(i) for i in l]), sorted([d.count(i) for i in l])):",
"+ if a != c:"
] | false | 0.122762 | 0.047072 | 2.607975 | [
"s425052798",
"s752814448"
] |
u762540523 | p02683 | python | s790234229 | s511667996 | 93 | 58 | 69,000 | 9,208 | Accepted | Accepted | 37.63 | def resolve():
import itertools
impossible = 10 ** 20
n, m, x = list(map(int, input().split()))
ans = impossible
books = [None] * n
for i in range(n):
books[i] = list(map(int, input().split()))
for i in list(itertools.product([True, False], repeat=n)):
u = [0] * m
yen = 0
for index, j in enumerate(i):
if not j:
continue
yen += books[index][0]
for k in range(m):
u[k] += books[index][k + 1]
for j in u:
if j < x:
break
else:
ans = min(yen, ans)
print((ans if ans < impossible else -1))
if __name__ == '__main__':
resolve()
| def resolve():
import itertools
impossible = 10 ** 20
n, m, x = list(map(int, input().split()))
ans = impossible
books = [None] * n
for i in range(n):
books[i] = list(map(int, input().split()))
for i in itertools.product([True, False], repeat=n):
u = [0] * m
yen = 0
for index, j in enumerate(i):
if not j:
continue
yen += books[index][0]
for k in range(m):
u[k] += books[index][k + 1]
for j in u:
if j < x:
break
else:
ans = min(yen, ans)
print((ans if ans < impossible else -1))
if __name__ == '__main__':
resolve()
| 27 | 27 | 736 | 730 | def resolve():
import itertools
impossible = 10**20
n, m, x = list(map(int, input().split()))
ans = impossible
books = [None] * n
for i in range(n):
books[i] = list(map(int, input().split()))
for i in list(itertools.product([True, False], repeat=n)):
u = [0] * m
yen = 0
for index, j in enumerate(i):
if not j:
continue
yen += books[index][0]
for k in range(m):
u[k] += books[index][k + 1]
for j in u:
if j < x:
break
else:
ans = min(yen, ans)
print((ans if ans < impossible else -1))
if __name__ == "__main__":
resolve()
| def resolve():
import itertools
impossible = 10**20
n, m, x = list(map(int, input().split()))
ans = impossible
books = [None] * n
for i in range(n):
books[i] = list(map(int, input().split()))
for i in itertools.product([True, False], repeat=n):
u = [0] * m
yen = 0
for index, j in enumerate(i):
if not j:
continue
yen += books[index][0]
for k in range(m):
u[k] += books[index][k + 1]
for j in u:
if j < x:
break
else:
ans = min(yen, ans)
print((ans if ans < impossible else -1))
if __name__ == "__main__":
resolve()
| false | 0 | [
"- for i in list(itertools.product([True, False], repeat=n)):",
"+ for i in itertools.product([True, False], repeat=n):"
] | false | 0.043287 | 0.076832 | 0.563401 | [
"s790234229",
"s511667996"
] |
u102242691 | p03814 | python | s231678372 | s256669589 | 35 | 23 | 3,516 | 9,216 | Accepted | Accepted | 34.29 |
s = eval(input())
n = len(s)
for i in range(n):
if s[i] == "A":
l = i
break
for i in range(n-1,i,-1):
if s[i] == "Z":
r = i+1
break
ans = max(0,r-l)
print(ans) |
s = eval(input())
i = s.find("A")
j = s.rfind("Z")
print((j-i+1))
| 15 | 6 | 210 | 65 | s = eval(input())
n = len(s)
for i in range(n):
if s[i] == "A":
l = i
break
for i in range(n - 1, i, -1):
if s[i] == "Z":
r = i + 1
break
ans = max(0, r - l)
print(ans)
| s = eval(input())
i = s.find("A")
j = s.rfind("Z")
print((j - i + 1))
| false | 60 | [
"-n = len(s)",
"-for i in range(n):",
"- if s[i] == \"A\":",
"- l = i",
"- break",
"-for i in range(n - 1, i, -1):",
"- if s[i] == \"Z\":",
"- r = i + 1",
"- break",
"-ans = max(0, r - l)",
"-print(ans)",
"+i = s.find(\"A\")",
"+j = s.rfind(\"Z\")",
"+print((j - i + 1))"
] | false | 0.037096 | 0.037072 | 1.000645 | [
"s231678372",
"s256669589"
] |
u279605379 | p02300 | python | s408406402 | s666726353 | 900 | 800 | 33,752 | 33,740 | Accepted | Accepted | 11.11 | def isCLKWISE(ph):
return not ((ph[-1][0] - ph[-3][0])*(- ph[-3][1] + ph[-2][1]) - (ph[-2][0] - ph[-3][0])*(- ph[-3][1] + ph[-1][1] ) < 0)
def ConvexHullScan(P):
P.sort()
phU = [P[0],P[1]]
for p in P[2:]:
phU.append(p)
while(True):
if isCLKWISE(phU) : break
else :
del phU[-2]
if len(phU) == 2 : break
phL = [P[-1],P[-2]]
for p in P[-3::-1]:
phL.append(p)
while(True):
if isCLKWISE(phL) : break
else :
del phL[-2]
if len(phL) == 2 : break
ph = phU + phL[1:-1]
return ph
n = list(range(int(eval(input()))))
P = []
for i in n:
P.append([int(x) for x in input().split()])
Q = ConvexHullScan(P)
Q.reverse()
print((len(Q)))
idx = min([[x[1][1],x[1][0],x[0]] for x in enumerate(Q)])[2]
R = Q[idx:] + Q[:idx]
for r in R : print((r[0],r[1])) | def isCLKWISE(ph):
return not ((ph[-1][0] - ph[-3][0])*(- ph[-3][1] + ph[-2][1]) - (ph[-2][0] - ph[-3][0])*(- ph[-3][1] + ph[-1][1] ) < 0)
def ConvexHullScan(P):
P = sorted(P)
phU = [P[0],P[1]]
for p in P[2:]:
phU.append(p)
while(True):
if isCLKWISE(phU) : break
else :
del phU[-2]
if len(phU) == 2 : break
phL = [P[-1],P[-2]]
for p in P[-3::-1]:
phL.append(p)
while(True):
if isCLKWISE(phL) : break
else :
del phL[-2]
if len(phL) == 2 : break
ph = phU + phL[1:-1]
return ph
n = list(range(int(eval(input()))))
P = []
for i in n:
P.append([int(x) for x in input().split()])
Q = ConvexHullScan(P)
Q.reverse()
print((len(Q)))
idx = min([[x[1][1],x[1][0],x[0]] for x in enumerate(Q)])[2]
R = Q[idx:] + Q[:idx]
for r in R : print((r[0],r[1])) | 35 | 35 | 948 | 953 | def isCLKWISE(ph):
return not (
(ph[-1][0] - ph[-3][0]) * (-ph[-3][1] + ph[-2][1])
- (ph[-2][0] - ph[-3][0]) * (-ph[-3][1] + ph[-1][1])
< 0
)
def ConvexHullScan(P):
P.sort()
phU = [P[0], P[1]]
for p in P[2:]:
phU.append(p)
while True:
if isCLKWISE(phU):
break
else:
del phU[-2]
if len(phU) == 2:
break
phL = [P[-1], P[-2]]
for p in P[-3::-1]:
phL.append(p)
while True:
if isCLKWISE(phL):
break
else:
del phL[-2]
if len(phL) == 2:
break
ph = phU + phL[1:-1]
return ph
n = list(range(int(eval(input()))))
P = []
for i in n:
P.append([int(x) for x in input().split()])
Q = ConvexHullScan(P)
Q.reverse()
print((len(Q)))
idx = min([[x[1][1], x[1][0], x[0]] for x in enumerate(Q)])[2]
R = Q[idx:] + Q[:idx]
for r in R:
print((r[0], r[1]))
| def isCLKWISE(ph):
return not (
(ph[-1][0] - ph[-3][0]) * (-ph[-3][1] + ph[-2][1])
- (ph[-2][0] - ph[-3][0]) * (-ph[-3][1] + ph[-1][1])
< 0
)
def ConvexHullScan(P):
P = sorted(P)
phU = [P[0], P[1]]
for p in P[2:]:
phU.append(p)
while True:
if isCLKWISE(phU):
break
else:
del phU[-2]
if len(phU) == 2:
break
phL = [P[-1], P[-2]]
for p in P[-3::-1]:
phL.append(p)
while True:
if isCLKWISE(phL):
break
else:
del phL[-2]
if len(phL) == 2:
break
ph = phU + phL[1:-1]
return ph
n = list(range(int(eval(input()))))
P = []
for i in n:
P.append([int(x) for x in input().split()])
Q = ConvexHullScan(P)
Q.reverse()
print((len(Q)))
idx = min([[x[1][1], x[1][0], x[0]] for x in enumerate(Q)])[2]
R = Q[idx:] + Q[:idx]
for r in R:
print((r[0], r[1]))
| false | 0 | [
"- P.sort()",
"+ P = sorted(P)"
] | false | 0.077666 | 0.0764 | 1.016567 | [
"s408406402",
"s666726353"
] |
u426108351 | p03168 | python | s741810408 | s321259474 | 1,267 | 353 | 354,824 | 224,188 | Accepted | Accepted | 72.14 | N = int(eval(input()))
p = list(map(float, input().split()))
dp = [[0 for i in range(N+1)] for j in range(N+1)]
dp[1][1] = p[0]
dp[1][0] = 1 - p[0]
for i in range(1, N):
dp[i+1][0] = dp[i][0] * (1 - p[i])
#i枚中j枚が表
for i in range(1, N):
for j in range(1, N+1):
dp[i+1][j] = dp[i][j] * (1 - p[i]) + dp[i][j-1] * p[i]
ans = 0
for i in range(N//2+1, N+1):
ans += dp[N][i]
print(ans)
| n = int(eval(input()))
p = list(map(float, input().split()))
dp = [[0 for i in range(n+1)] for j in range(n+1)]
dp[0][0] = 1
for i in range(n):
for j in range(n):
dp[i+1][j+1] += dp[i][j]*p[i]
dp[i+1][j] += dp[i][j]*(1-p[i])
ans = 0
for i in range(n+1):
if i > n-i:
ans += dp[n][i]
print(ans)
| 17 | 17 | 411 | 339 | N = int(eval(input()))
p = list(map(float, input().split()))
dp = [[0 for i in range(N + 1)] for j in range(N + 1)]
dp[1][1] = p[0]
dp[1][0] = 1 - p[0]
for i in range(1, N):
dp[i + 1][0] = dp[i][0] * (1 - p[i])
# i枚中j枚が表
for i in range(1, N):
for j in range(1, N + 1):
dp[i + 1][j] = dp[i][j] * (1 - p[i]) + dp[i][j - 1] * p[i]
ans = 0
for i in range(N // 2 + 1, N + 1):
ans += dp[N][i]
print(ans)
| n = int(eval(input()))
p = list(map(float, input().split()))
dp = [[0 for i in range(n + 1)] for j in range(n + 1)]
dp[0][0] = 1
for i in range(n):
for j in range(n):
dp[i + 1][j + 1] += dp[i][j] * p[i]
dp[i + 1][j] += dp[i][j] * (1 - p[i])
ans = 0
for i in range(n + 1):
if i > n - i:
ans += dp[n][i]
print(ans)
| false | 0 | [
"-N = int(eval(input()))",
"+n = int(eval(input()))",
"-dp = [[0 for i in range(N + 1)] for j in range(N + 1)]",
"-dp[1][1] = p[0]",
"-dp[1][0] = 1 - p[0]",
"-for i in range(1, N):",
"- dp[i + 1][0] = dp[i][0] * (1 - p[i])",
"-# i枚中j枚が表",
"-for i in range(1, N):",
"- for j in range(1, N + 1):",
"- dp[i + 1][j] = dp[i][j] * (1 - p[i]) + dp[i][j - 1] * p[i]",
"+dp = [[0 for i in range(n + 1)] for j in range(n + 1)]",
"+dp[0][0] = 1",
"+for i in range(n):",
"+ for j in range(n):",
"+ dp[i + 1][j + 1] += dp[i][j] * p[i]",
"+ dp[i + 1][j] += dp[i][j] * (1 - p[i])",
"-for i in range(N // 2 + 1, N + 1):",
"- ans += dp[N][i]",
"+for i in range(n + 1):",
"+ if i > n - i:",
"+ ans += dp[n][i]"
] | false | 0.046835 | 0.046643 | 1.004102 | [
"s741810408",
"s321259474"
] |
u150984829 | p02239 | python | s677294964 | s609147594 | 50 | 40 | 6,868 | 7,004 | Accepted | Accepted | 20 | import queue,sys
N=int(eval(input()))
M=[list(map(int,e.split()[2:]))for e in sys.stdin]
q=queue.Queue();q.put(0)
d=[-1]*N;d[0]=0
while q.qsize()>0:
u=q.get()
for v in M[u]:
v-=1
if d[v]<0:d[v]=d[u]+1;q.put(v)
for i in range(N):print((i+1,d[i]))
| import queue
N=int(eval(input()))
M=[input().split()[2:]for _ in[0]*N]
q=queue.Queue();q.put(0)
d=[-1]*N;d[0]=0
while not q.empty():
u=q.get()
for v in M[u]:
v=int(v)-1
if d[v]<0:d[v]=d[u]+1;q.put(v)
for i in range(N):print((i+1,d[i]))
| 11 | 11 | 254 | 244 | import queue, sys
N = int(eval(input()))
M = [list(map(int, e.split()[2:])) for e in sys.stdin]
q = queue.Queue()
q.put(0)
d = [-1] * N
d[0] = 0
while q.qsize() > 0:
u = q.get()
for v in M[u]:
v -= 1
if d[v] < 0:
d[v] = d[u] + 1
q.put(v)
for i in range(N):
print((i + 1, d[i]))
| import queue
N = int(eval(input()))
M = [input().split()[2:] for _ in [0] * N]
q = queue.Queue()
q.put(0)
d = [-1] * N
d[0] = 0
while not q.empty():
u = q.get()
for v in M[u]:
v = int(v) - 1
if d[v] < 0:
d[v] = d[u] + 1
q.put(v)
for i in range(N):
print((i + 1, d[i]))
| false | 0 | [
"-import queue, sys",
"+import queue",
"-M = [list(map(int, e.split()[2:])) for e in sys.stdin]",
"+M = [input().split()[2:] for _ in [0] * N]",
"-while q.qsize() > 0:",
"+while not q.empty():",
"- v -= 1",
"+ v = int(v) - 1"
] | false | 0.044309 | 0.045494 | 0.973948 | [
"s677294964",
"s609147594"
] |
u077291787 | p03069 | python | s376551013 | s733005447 | 55 | 37 | 3,500 | 3,376 | Accepted | Accepted | 32.73 | # TPBC201C - Stones
import sys
input = sys.stdin.readline
n = int(eval(input()))
s = input().rstrip()
ans = 0
blk = 0
for i in s:
if i == "#":
blk += 1
else:
if blk > 0:
ans += 1
blk -= 1
print(ans)
| # tenka1-2019-beginnerC - Stones
def main():
N, S = open(0).read().split()
ans, blk = 0, 0
for i in S:
if i == "#":
blk += 1
else:
if blk:
ans += 1
blk -= 1
print(ans)
if __name__ == "__main__":
main() | 16 | 16 | 257 | 310 | # TPBC201C - Stones
import sys
input = sys.stdin.readline
n = int(eval(input()))
s = input().rstrip()
ans = 0
blk = 0
for i in s:
if i == "#":
blk += 1
else:
if blk > 0:
ans += 1
blk -= 1
print(ans)
| # tenka1-2019-beginnerC - Stones
def main():
N, S = open(0).read().split()
ans, blk = 0, 0
for i in S:
if i == "#":
blk += 1
else:
if blk:
ans += 1
blk -= 1
print(ans)
if __name__ == "__main__":
main()
| false | 0 | [
"-# TPBC201C - Stones",
"-import sys",
"+# tenka1-2019-beginnerC - Stones",
"+def main():",
"+ N, S = open(0).read().split()",
"+ ans, blk = 0, 0",
"+ for i in S:",
"+ if i == \"#\":",
"+ blk += 1",
"+ else:",
"+ if blk:",
"+ ans += 1",
"+ blk -= 1",
"+ print(ans)",
"-input = sys.stdin.readline",
"-n = int(eval(input()))",
"-s = input().rstrip()",
"-ans = 0",
"-blk = 0",
"-for i in s:",
"- if i == \"#\":",
"- blk += 1",
"- else:",
"- if blk > 0:",
"- ans += 1",
"- blk -= 1",
"-print(ans)",
"+",
"+if __name__ == \"__main__\":",
"+ main()"
] | false | 0.107968 | 0.036475 | 2.960097 | [
"s376551013",
"s733005447"
] |
u537976628 | p02717 | python | s154874851 | s937414672 | 23 | 20 | 8,972 | 9,008 | Accepted | Accepted | 13.04 | X, Y, Z = input().split()
print((Z, X, Y)) | x, y, z = input().split()
print((z, x, y)) | 2 | 2 | 41 | 41 | X, Y, Z = input().split()
print((Z, X, Y))
| x, y, z = input().split()
print((z, x, y))
| false | 0 | [
"-X, Y, Z = input().split()",
"-print((Z, X, Y))",
"+x, y, z = input().split()",
"+print((z, x, y))"
] | false | 0.036443 | 0.117385 | 0.310457 | [
"s154874851",
"s937414672"
] |
u972605362 | p02570 | python | s359295978 | s577217664 | 30 | 25 | 9,152 | 9,144 | Accepted | Accepted | 16.67 | d, t, s = list(map(int, input().split()))
if (t * s >= d):
print("Yes")
else:
print("No") | D, T, S = list(map(int, input().split()))
if (T * S >= D):
print("Yes")
else:
print("No") | 6 | 5 | 97 | 95 | d, t, s = list(map(int, input().split()))
if t * s >= d:
print("Yes")
else:
print("No")
| D, T, S = list(map(int, input().split()))
if T * S >= D:
print("Yes")
else:
print("No")
| false | 16.666667 | [
"-d, t, s = list(map(int, input().split()))",
"-if t * s >= d:",
"+D, T, S = list(map(int, input().split()))",
"+if T * S >= D:"
] | false | 0.047308 | 0.105958 | 0.446474 | [
"s359295978",
"s577217664"
] |
u706929073 | p03475 | python | s128020228 | s207093303 | 99 | 75 | 3,188 | 3,188 | Accepted | Accepted | 24.24 | n = int(eval(input()))
setting = []
for _ in range(n-1):
setting.append(list(map(int, input().split())))
results = []
for i in range(n-1):
cur = 0
for j in range(i, n-1):
if cur < setting[j][1]:
cur = setting[j][0] + setting[j][1]
elif 0 == cur % setting[j][2]:
cur += setting[j][0]
else:
cur += setting[j][0] + setting[j][2] - cur % setting[j][2]
results.append(cur)
results.append(0)
for result in results:
print(result)
| """
シミュレーション問題
- 数式にこだわりすぎた
- WAになって何が間違っているかはわからなかった
- Nの範囲を確認すればO(N^2)でも十分問題なかったことが分かったので素直に実装すればよかった
"""
n = int(eval(input()))
setting = []
for _ in range(n-1):
setting.append(tuple(map(int, input().split())))
results = []
for i in range(n-1):
cur = 0
for c, s, f in setting[i:]:
if cur < s:
cur = c + s
elif 0 == cur % f:
cur += c
else:
cur += c + f - cur % f
results.append(cur)
results.append(0)
for result in results:
print(result)
| 19 | 25 | 516 | 539 | n = int(eval(input()))
setting = []
for _ in range(n - 1):
setting.append(list(map(int, input().split())))
results = []
for i in range(n - 1):
cur = 0
for j in range(i, n - 1):
if cur < setting[j][1]:
cur = setting[j][0] + setting[j][1]
elif 0 == cur % setting[j][2]:
cur += setting[j][0]
else:
cur += setting[j][0] + setting[j][2] - cur % setting[j][2]
results.append(cur)
results.append(0)
for result in results:
print(result)
| """
シミュレーション問題
- 数式にこだわりすぎた
- WAになって何が間違っているかはわからなかった
- Nの範囲を確認すればO(N^2)でも十分問題なかったことが分かったので素直に実装すればよかった
"""
n = int(eval(input()))
setting = []
for _ in range(n - 1):
setting.append(tuple(map(int, input().split())))
results = []
for i in range(n - 1):
cur = 0
for c, s, f in setting[i:]:
if cur < s:
cur = c + s
elif 0 == cur % f:
cur += c
else:
cur += c + f - cur % f
results.append(cur)
results.append(0)
for result in results:
print(result)
| false | 24 | [
"+\"\"\"",
"+シミュレーション問題",
"+- 数式にこだわりすぎた",
"+- WAになって何が間違っているかはわからなかった",
"+- Nの範囲を確認すればO(N^2)でも十分問題なかったことが分かったので素直に実装すればよかった",
"+\"\"\"",
"- setting.append(list(map(int, input().split())))",
"+ setting.append(tuple(map(int, input().split())))",
"- for j in range(i, n - 1):",
"- if cur < setting[j][1]:",
"- cur = setting[j][0] + setting[j][1]",
"- elif 0 == cur % setting[j][2]:",
"- cur += setting[j][0]",
"+ for c, s, f in setting[i:]:",
"+ if cur < s:",
"+ cur = c + s",
"+ elif 0 == cur % f:",
"+ cur += c",
"- cur += setting[j][0] + setting[j][2] - cur % setting[j][2]",
"+ cur += c + f - cur % f"
] | false | 0.092595 | 0.182209 | 0.508177 | [
"s128020228",
"s207093303"
] |
u241159583 | p03497 | python | s392259253 | s284749151 | 205 | 102 | 50,068 | 35,252 | Accepted | Accepted | 50.24 | from collections import Counter
N, K = list(map(int, input().split()))
A = Counter(list(map(int, input().split())))
A = sorted(list(dict(A).items()), key=lambda x:x[1])
ans = 0
if not len(A) <= K:
n = len(A) - K
ans = 0
for i in range(n):
ans += A[i][1]
print(ans) | from collections import Counter
n,k = list(map(int, input().split()))
a = Counter(list(map(int, input().split())))
ans = 0
a = sorted([i for i in list(a.values())], reverse=True)
if len(a) > k: ans = sum(a[k:])
print(ans) | 12 | 7 | 274 | 215 | from collections import Counter
N, K = list(map(int, input().split()))
A = Counter(list(map(int, input().split())))
A = sorted(list(dict(A).items()), key=lambda x: x[1])
ans = 0
if not len(A) <= K:
n = len(A) - K
ans = 0
for i in range(n):
ans += A[i][1]
print(ans)
| from collections import Counter
n, k = list(map(int, input().split()))
a = Counter(list(map(int, input().split())))
ans = 0
a = sorted([i for i in list(a.values())], reverse=True)
if len(a) > k:
ans = sum(a[k:])
print(ans)
| false | 41.666667 | [
"-N, K = list(map(int, input().split()))",
"-A = Counter(list(map(int, input().split())))",
"-A = sorted(list(dict(A).items()), key=lambda x: x[1])",
"+n, k = list(map(int, input().split()))",
"+a = Counter(list(map(int, input().split())))",
"-if not len(A) <= K:",
"- n = len(A) - K",
"- ans = 0",
"- for i in range(n):",
"- ans += A[i][1]",
"+a = sorted([i for i in list(a.values())], reverse=True)",
"+if len(a) > k:",
"+ ans = sum(a[k:])"
] | false | 0.110989 | 0.045284 | 2.450932 | [
"s392259253",
"s284749151"
] |
u456353530 | p02901 | python | s739841277 | s046708521 | 359 | 325 | 48,856 | 45,928 | Accepted | Accepted | 9.47 | N, M = list(map(int, input().split()))
abc = []
for i in range(M):
t = list(map(int, input().split()))
k = list(map(int, input().split()))
x = 0
for j in k:
x += (1 << (j - 1))
abc.append(t + [x])
def nasu(n):
ans = inf
for i in range(1, n - 1):
if ~n & i == 0:
ans = min(ans, L[i] + L[n ^ i])
return ans
inf = 10 ** 10
L = [inf] * (1 << N)
for i in range(1, N + 1):
n = (1 << i) - 1
while n < (1 << N):
for j in range(M):
if ~abc[j][2] & n == 0:
L[n] = min(L[n], abc[j][0])
L[n] = min(L[n], nasu(n))
x = n & -n
y = n + x
n = ((n & ~y) // x >> 1) | y
if L[-1] == inf:
print((-1))
else:
print((L[-1]))
| N, M = list(map(int, input().split()))
ab = []
c = []
for i in range(M):
ab.append(list(map(int, input().split())))
c.append(list(map(int, input().split())))
A = [10 ** 10] * (1 << N)
C = []
for i in range(M):
t = 0
cc = c[i]
a, b = ab[i]
for j in cc:
t |= 1 << (j - 1)
C.append([t, a])
A[t] = min(A[t], a)
for i in range(1, N + 1):
n = (1 << i) - 1
while n < (1 << N):
for j in range(M):
k, a = n | C[j][0], C[j][1]
A[k] = min(A[k], A[n] + a)
x = n & -n
y = n + x
n = ((n & ~y) // x >> 1) | y
if A[-1] == 10 ** 10:
print((-1))
else:
print((A[-1]))
| 37 | 33 | 711 | 637 | N, M = list(map(int, input().split()))
abc = []
for i in range(M):
t = list(map(int, input().split()))
k = list(map(int, input().split()))
x = 0
for j in k:
x += 1 << (j - 1)
abc.append(t + [x])
def nasu(n):
ans = inf
for i in range(1, n - 1):
if ~n & i == 0:
ans = min(ans, L[i] + L[n ^ i])
return ans
inf = 10**10
L = [inf] * (1 << N)
for i in range(1, N + 1):
n = (1 << i) - 1
while n < (1 << N):
for j in range(M):
if ~abc[j][2] & n == 0:
L[n] = min(L[n], abc[j][0])
L[n] = min(L[n], nasu(n))
x = n & -n
y = n + x
n = ((n & ~y) // x >> 1) | y
if L[-1] == inf:
print((-1))
else:
print((L[-1]))
| N, M = list(map(int, input().split()))
ab = []
c = []
for i in range(M):
ab.append(list(map(int, input().split())))
c.append(list(map(int, input().split())))
A = [10**10] * (1 << N)
C = []
for i in range(M):
t = 0
cc = c[i]
a, b = ab[i]
for j in cc:
t |= 1 << (j - 1)
C.append([t, a])
A[t] = min(A[t], a)
for i in range(1, N + 1):
n = (1 << i) - 1
while n < (1 << N):
for j in range(M):
k, a = n | C[j][0], C[j][1]
A[k] = min(A[k], A[n] + a)
x = n & -n
y = n + x
n = ((n & ~y) // x >> 1) | y
if A[-1] == 10**10:
print((-1))
else:
print((A[-1]))
| false | 10.810811 | [
"-abc = []",
"+ab = []",
"+c = []",
"- t = list(map(int, input().split()))",
"- k = list(map(int, input().split()))",
"- x = 0",
"- for j in k:",
"- x += 1 << (j - 1)",
"- abc.append(t + [x])",
"-",
"-",
"-def nasu(n):",
"- ans = inf",
"- for i in range(1, n - 1):",
"- if ~n & i == 0:",
"- ans = min(ans, L[i] + L[n ^ i])",
"- return ans",
"-",
"-",
"-inf = 10**10",
"-L = [inf] * (1 << N)",
"+ ab.append(list(map(int, input().split())))",
"+ c.append(list(map(int, input().split())))",
"+A = [10**10] * (1 << N)",
"+C = []",
"+for i in range(M):",
"+ t = 0",
"+ cc = c[i]",
"+ a, b = ab[i]",
"+ for j in cc:",
"+ t |= 1 << (j - 1)",
"+ C.append([t, a])",
"+ A[t] = min(A[t], a)",
"- if ~abc[j][2] & n == 0:",
"- L[n] = min(L[n], abc[j][0])",
"- L[n] = min(L[n], nasu(n))",
"+ k, a = n | C[j][0], C[j][1]",
"+ A[k] = min(A[k], A[n] + a)",
"-if L[-1] == inf:",
"+if A[-1] == 10**10:",
"- print((L[-1]))",
"+ print((A[-1]))"
] | false | 0.288175 | 0.043018 | 6.69887 | [
"s739841277",
"s046708521"
] |
u368780724 | p03169 | python | s522296917 | s387748441 | 1,959 | 899 | 604,040 | 257,032 | Accepted | Accepted | 54.11 | from collections import Counter
N = int(eval(input()))
A = list(map(int, input().split()))
dp = [[[0]*(N+2) for _ in range(N+2)] for _ in range(N+2)]
CA = Counter(A)
SA = CA[1]
SB = CA[2]
SC = CA[3]
for c in range(SC+1):
for b in range(SB+SC+1):
if b + c > N:
break
for a in range(N+1):
if a + b + c > N:
break
S = a + b + c
if S == 0:
continue
dp[a][b][c] = N/S + a/S*dp[a-1][b][c]\
+b/S*dp[a+1][b-1][c]\
+c/S*dp[a][b+1][c - 1]
print((dp[SA][SB][SC]))
| from collections import Counter
N = int(eval(input()))
A = list(map(int, input().split()))
dp = [[[0.0]*(N+2) for _ in range(N+2)] for _ in range(N+2)]
CA = Counter(A)
SA = CA[1]
SB = CA[2]
SC = CA[3]
for c in range(SC+1):
for b in range(SB+SC+1):
if b + c > N:
break
for a in range(N+1):
if a + b + c > N:
break
S = a + b + c
if S == 0:
continue
dp[a][b][c] = N/S + a/S*dp[a-1][b][c]\
+b/S*dp[a+1][b-1][c]\
+c/S*dp[a][b+1][c - 1]
print((dp[SA][SB][SC])) | 24 | 24 | 606 | 607 | from collections import Counter
N = int(eval(input()))
A = list(map(int, input().split()))
dp = [[[0] * (N + 2) for _ in range(N + 2)] for _ in range(N + 2)]
CA = Counter(A)
SA = CA[1]
SB = CA[2]
SC = CA[3]
for c in range(SC + 1):
for b in range(SB + SC + 1):
if b + c > N:
break
for a in range(N + 1):
if a + b + c > N:
break
S = a + b + c
if S == 0:
continue
dp[a][b][c] = (
N / S
+ a / S * dp[a - 1][b][c]
+ b / S * dp[a + 1][b - 1][c]
+ c / S * dp[a][b + 1][c - 1]
)
print((dp[SA][SB][SC]))
| from collections import Counter
N = int(eval(input()))
A = list(map(int, input().split()))
dp = [[[0.0] * (N + 2) for _ in range(N + 2)] for _ in range(N + 2)]
CA = Counter(A)
SA = CA[1]
SB = CA[2]
SC = CA[3]
for c in range(SC + 1):
for b in range(SB + SC + 1):
if b + c > N:
break
for a in range(N + 1):
if a + b + c > N:
break
S = a + b + c
if S == 0:
continue
dp[a][b][c] = (
N / S
+ a / S * dp[a - 1][b][c]
+ b / S * dp[a + 1][b - 1][c]
+ c / S * dp[a][b + 1][c - 1]
)
print((dp[SA][SB][SC]))
| false | 0 | [
"-dp = [[[0] * (N + 2) for _ in range(N + 2)] for _ in range(N + 2)]",
"+dp = [[[0.0] * (N + 2) for _ in range(N + 2)] for _ in range(N + 2)]"
] | false | 0.04368 | 0.043901 | 0.994967 | [
"s522296917",
"s387748441"
] |
u803617136 | p02837 | python | s156134564 | s670171834 | 233 | 143 | 44,140 | 3,064 | Accepted | Accepted | 38.63 | N = int(eval(input()))
msg = [[] for _ in range(N)]
for i in range(N):
ai = int(eval(input()))
for _ in range(ai):
x, y = list(map(int, input().split()))
msg[i].append([x - 1, y])
ans = 0
for i in range(1, 2 ** N):
is_ok = True
for j in range(N):
if (i >> j) & 1 == 1:
for x, y in msg[j]:
if (i >> x) & 1 != y:
is_ok = False
break
if is_ok:
ans = max(ans, bin(i)[2:].count('1'))
print(ans) | n = int(eval(input()))
t = [[] for _ in range(n)]
for i in range(n):
a = int(eval(input()))
for _ in range(a):
x, y = list(map(int, input().split()))
x -= 1
t[i].append([x, y])
ans = 0
for p in range(1 << n):
cnt = 0
is_not = False
for i in range(n):
if p >> i & 1:
cnt += 1
for ti in t[i]:
x, y = ti
if (p >> x & 1) != y:
is_not = True
cnt = 0
break
if is_not:
break
ans = max(ans, cnt)
print(ans)
| 20 | 27 | 511 | 601 | N = int(eval(input()))
msg = [[] for _ in range(N)]
for i in range(N):
ai = int(eval(input()))
for _ in range(ai):
x, y = list(map(int, input().split()))
msg[i].append([x - 1, y])
ans = 0
for i in range(1, 2**N):
is_ok = True
for j in range(N):
if (i >> j) & 1 == 1:
for x, y in msg[j]:
if (i >> x) & 1 != y:
is_ok = False
break
if is_ok:
ans = max(ans, bin(i)[2:].count("1"))
print(ans)
| n = int(eval(input()))
t = [[] for _ in range(n)]
for i in range(n):
a = int(eval(input()))
for _ in range(a):
x, y = list(map(int, input().split()))
x -= 1
t[i].append([x, y])
ans = 0
for p in range(1 << n):
cnt = 0
is_not = False
for i in range(n):
if p >> i & 1:
cnt += 1
for ti in t[i]:
x, y = ti
if (p >> x & 1) != y:
is_not = True
cnt = 0
break
if is_not:
break
ans = max(ans, cnt)
print(ans)
| false | 25.925926 | [
"-N = int(eval(input()))",
"-msg = [[] for _ in range(N)]",
"-for i in range(N):",
"- ai = int(eval(input()))",
"- for _ in range(ai):",
"+n = int(eval(input()))",
"+t = [[] for _ in range(n)]",
"+for i in range(n):",
"+ a = int(eval(input()))",
"+ for _ in range(a):",
"- msg[i].append([x - 1, y])",
"+ x -= 1",
"+ t[i].append([x, y])",
"-for i in range(1, 2**N):",
"- is_ok = True",
"- for j in range(N):",
"- if (i >> j) & 1 == 1:",
"- for x, y in msg[j]:",
"- if (i >> x) & 1 != y:",
"- is_ok = False",
"+for p in range(1 << n):",
"+ cnt = 0",
"+ is_not = False",
"+ for i in range(n):",
"+ if p >> i & 1:",
"+ cnt += 1",
"+ for ti in t[i]:",
"+ x, y = ti",
"+ if (p >> x & 1) != y:",
"+ is_not = True",
"+ cnt = 0",
"- if is_ok:",
"- ans = max(ans, bin(i)[2:].count(\"1\"))",
"+ if is_not:",
"+ break",
"+ ans = max(ans, cnt)"
] | false | 0.064038 | 0.088417 | 0.724274 | [
"s156134564",
"s670171834"
] |
u729133443 | p03359 | python | s945194460 | s914491485 | 168 | 17 | 38,256 | 2,940 | Accepted | Accepted | 89.88 | a,b=list(map(int,input().split()));print((a-(a>b))) | a,b=input().split();print((int(a)-(a>b))) | 1 | 1 | 43 | 39 | a, b = list(map(int, input().split()))
print((a - (a > b)))
| a, b = input().split()
print((int(a) - (a > b)))
| false | 0 | [
"-a, b = list(map(int, input().split()))",
"-print((a - (a > b)))",
"+a, b = input().split()",
"+print((int(a) - (a > b)))"
] | false | 0.045358 | 0.043034 | 1.054016 | [
"s945194460",
"s914491485"
] |
u309141201 | p03254 | python | s904833817 | s613156843 | 180 | 30 | 38,288 | 9,120 | Accepted | Accepted | 83.33 | N, x = list(map(int, input().split()))
a = sorted(map(int, input().split()))
ans = 0
for i in range(N):
if x >= a[i]:
ans += 1
x -= a[i]
else:
break
if i == N - 1:
if x != 0:
ans -= 1
print(ans) | n, x = list(map(int, input().split()))
a = sorted(map(int, input().split()))
ans = 0
for i in range(n):
x -= a[i]
if x < 0:
break
if i == n-1:
if x > 0:
break
ans += 1
print(ans) | 13 | 13 | 256 | 229 | N, x = list(map(int, input().split()))
a = sorted(map(int, input().split()))
ans = 0
for i in range(N):
if x >= a[i]:
ans += 1
x -= a[i]
else:
break
if i == N - 1:
if x != 0:
ans -= 1
print(ans)
| n, x = list(map(int, input().split()))
a = sorted(map(int, input().split()))
ans = 0
for i in range(n):
x -= a[i]
if x < 0:
break
if i == n - 1:
if x > 0:
break
ans += 1
print(ans)
| false | 0 | [
"-N, x = list(map(int, input().split()))",
"+n, x = list(map(int, input().split()))",
"-for i in range(N):",
"- if x >= a[i]:",
"- ans += 1",
"- x -= a[i]",
"- else:",
"+for i in range(n):",
"+ x -= a[i]",
"+ if x < 0:",
"- if i == N - 1:",
"- if x != 0:",
"- ans -= 1",
"+ if i == n - 1:",
"+ if x > 0:",
"+ break",
"+ ans += 1"
] | false | 0.091594 | 0.037577 | 2.437518 | [
"s904833817",
"s613156843"
] |
u910756197 | p03408 | python | s379210681 | s550796619 | 21 | 18 | 3,316 | 3,060 | Accepted | Accepted | 14.29 | from collections import defaultdict
n = int(eval(input()))
s = [eval(input()) for _ in range(n)]
m = int(eval(input()))
t = [eval(input()) for _ in range(m)]
d = defaultdict(int)
for x in s:
d[x] += 1
for x in t:
d[x] -= 1
print((max(0, max(d.values())))) | n = int(eval(input()))
s = []
for _ in range(n):
s.append(eval(input()))
m = int(eval(input()))
t = []
for _ in range(m):
t.append(eval(input()))
a = 0
for x in list(set(s)):
a = max(a, s.count(x) - t.count(x))
print(a) | 13 | 14 | 251 | 224 | from collections import defaultdict
n = int(eval(input()))
s = [eval(input()) for _ in range(n)]
m = int(eval(input()))
t = [eval(input()) for _ in range(m)]
d = defaultdict(int)
for x in s:
d[x] += 1
for x in t:
d[x] -= 1
print((max(0, max(d.values()))))
| n = int(eval(input()))
s = []
for _ in range(n):
s.append(eval(input()))
m = int(eval(input()))
t = []
for _ in range(m):
t.append(eval(input()))
a = 0
for x in list(set(s)):
a = max(a, s.count(x) - t.count(x))
print(a)
| false | 7.142857 | [
"-from collections import defaultdict",
"-",
"-s = [eval(input()) for _ in range(n)]",
"+s = []",
"+for _ in range(n):",
"+ s.append(eval(input()))",
"-t = [eval(input()) for _ in range(m)]",
"-d = defaultdict(int)",
"-for x in s:",
"- d[x] += 1",
"-for x in t:",
"- d[x] -= 1",
"-print((max(0, max(d.values()))))",
"+t = []",
"+for _ in range(m):",
"+ t.append(eval(input()))",
"+a = 0",
"+for x in list(set(s)):",
"+ a = max(a, s.count(x) - t.count(x))",
"+print(a)"
] | false | 0.038661 | 0.040124 | 0.963554 | [
"s379210681",
"s550796619"
] |
u250583425 | p02780 | python | s144052291 | s064351148 | 262 | 113 | 26,068 | 25,408 | Accepted | Accepted | 56.87 | import sys
from functools import lru_cache
def input(): return sys.stdin.readline().rstrip()
sys.setrecursionlimit(10 ** 9)
@lru_cache(maxsize=None)
def calc(n):
if n == 1:
return 1
else:
return n + calc(n - 1)
def main():
N, K = list(map(int, input().split()))
P = tuple(map(int, input().split()))
l = 0
sum_v = 0
max_v = 0
max_i = 0
ind = 0
for i in range(N-K+1):
while l < K:
sum_v += P[ind]
ind += 1
l += 1
if sum_v > max_v:
max_v = sum_v
max_i = i
l -= 1
sum_v -= P[i]
print((sum([calc(p) / p for p in P[max_i:max_i+K]])))
if __name__ == '__main__':
main()
| import sys
from itertools import accumulate
def input(): return sys.stdin.readline().rstrip()
def main():
N, K = list(map(int, input().split()))
P = tuple(map(int, input().split()))
sum_ls = tuple(accumulate(list(range(max(P) + 1))))
acc_P = [0] + list(accumulate([sum_ls[p] / p for p in P]))
ans = 0
for i in range(N - K + 1):
v = acc_P[i+K] - acc_P[i]
if v > ans:
ans = v
print(ans)
if __name__ == '__main__':
main()
| 36 | 20 | 750 | 490 | import sys
from functools import lru_cache
def input():
return sys.stdin.readline().rstrip()
sys.setrecursionlimit(10**9)
@lru_cache(maxsize=None)
def calc(n):
if n == 1:
return 1
else:
return n + calc(n - 1)
def main():
N, K = list(map(int, input().split()))
P = tuple(map(int, input().split()))
l = 0
sum_v = 0
max_v = 0
max_i = 0
ind = 0
for i in range(N - K + 1):
while l < K:
sum_v += P[ind]
ind += 1
l += 1
if sum_v > max_v:
max_v = sum_v
max_i = i
l -= 1
sum_v -= P[i]
print((sum([calc(p) / p for p in P[max_i : max_i + K]])))
if __name__ == "__main__":
main()
| import sys
from itertools import accumulate
def input():
return sys.stdin.readline().rstrip()
def main():
N, K = list(map(int, input().split()))
P = tuple(map(int, input().split()))
sum_ls = tuple(accumulate(list(range(max(P) + 1))))
acc_P = [0] + list(accumulate([sum_ls[p] / p for p in P]))
ans = 0
for i in range(N - K + 1):
v = acc_P[i + K] - acc_P[i]
if v > ans:
ans = v
print(ans)
if __name__ == "__main__":
main()
| false | 44.444444 | [
"-from functools import lru_cache",
"+from itertools import accumulate",
"-sys.setrecursionlimit(10**9)",
"-",
"-",
"-@lru_cache(maxsize=None)",
"-def calc(n):",
"- if n == 1:",
"- return 1",
"- else:",
"- return n + calc(n - 1)",
"-",
"-",
"- l = 0",
"- sum_v = 0",
"- max_v = 0",
"- max_i = 0",
"- ind = 0",
"+ sum_ls = tuple(accumulate(list(range(max(P) + 1))))",
"+ acc_P = [0] + list(accumulate([sum_ls[p] / p for p in P]))",
"+ ans = 0",
"- while l < K:",
"- sum_v += P[ind]",
"- ind += 1",
"- l += 1",
"- if sum_v > max_v:",
"- max_v = sum_v",
"- max_i = i",
"- l -= 1",
"- sum_v -= P[i]",
"- print((sum([calc(p) / p for p in P[max_i : max_i + K]])))",
"+ v = acc_P[i + K] - acc_P[i]",
"+ if v > ans:",
"+ ans = v",
"+ print(ans)"
] | false | 0.036788 | 0.036441 | 1.009516 | [
"s144052291",
"s064351148"
] |
u721316601 | p03634 | python | s620321291 | s547390159 | 677 | 607 | 47,032 | 47,980 | Accepted | Accepted | 10.34 | import sys
from heapq import heappush, heappop, heapify
input = sys.stdin.readline
def main():
N = int(eval(input()))
g = [[] for i in range(N)]
for i in range(N-1):
a, b, c = list(map(int, input().split()))
a -= 1; b -= 1
g[a].append((c, b))
g[b].append((c, a))
Q, K = list(map(int, input().split()))
K -= 1
dist = [0] * N
visited = [False] * N
q = [(c, v) for c, v in g[K]]
heapify(q)
dist[K], visited[K] = 0, True
while q:
c, v = heappop(q)
if visited[v]: continue
dist[v], visited[v] = c, True
for d, u in g[v]:
if visited[u]: continue
heappush(q, (c+d, u))
for i in range(Q):
x, y = list(map(int, input().split()))
print((dist[x-1]+dist[y-1]))
if __name__ == '__main__':
main() | import sys
from collections import deque
input = sys.stdin.readline
def main():
for i in range(N-1):
a, b, c = list(map(int, input().split()))
a -= 1; b -= 1
g[a].append((b, c))
g[b].append((a, c))
Q, K = list(map(int, input().split()))
K -= 1
q = deque([(K, 0, -1)])
while q:
v, c, p = q.popleft()
dist[v] = c
for u, d in g[v]:
if u == p: continue
q.append((u, c+d, v))
for i in range(Q):
x, y = list(map(int, input().split()))
print((dist[x-1]+dist[y-1]))
if __name__ == '__main__':
N = int(eval(input()))
g = [[] for i in range(N)]
dist = [0] * N
main() | 41 | 34 | 927 | 740 | import sys
from heapq import heappush, heappop, heapify
input = sys.stdin.readline
def main():
N = int(eval(input()))
g = [[] for i in range(N)]
for i in range(N - 1):
a, b, c = list(map(int, input().split()))
a -= 1
b -= 1
g[a].append((c, b))
g[b].append((c, a))
Q, K = list(map(int, input().split()))
K -= 1
dist = [0] * N
visited = [False] * N
q = [(c, v) for c, v in g[K]]
heapify(q)
dist[K], visited[K] = 0, True
while q:
c, v = heappop(q)
if visited[v]:
continue
dist[v], visited[v] = c, True
for d, u in g[v]:
if visited[u]:
continue
heappush(q, (c + d, u))
for i in range(Q):
x, y = list(map(int, input().split()))
print((dist[x - 1] + dist[y - 1]))
if __name__ == "__main__":
main()
| import sys
from collections import deque
input = sys.stdin.readline
def main():
for i in range(N - 1):
a, b, c = list(map(int, input().split()))
a -= 1
b -= 1
g[a].append((b, c))
g[b].append((a, c))
Q, K = list(map(int, input().split()))
K -= 1
q = deque([(K, 0, -1)])
while q:
v, c, p = q.popleft()
dist[v] = c
for u, d in g[v]:
if u == p:
continue
q.append((u, c + d, v))
for i in range(Q):
x, y = list(map(int, input().split()))
print((dist[x - 1] + dist[y - 1]))
if __name__ == "__main__":
N = int(eval(input()))
g = [[] for i in range(N)]
dist = [0] * N
main()
| false | 17.073171 | [
"-from heapq import heappush, heappop, heapify",
"+from collections import deque",
"- N = int(eval(input()))",
"- g = [[] for i in range(N)]",
"- g[a].append((c, b))",
"- g[b].append((c, a))",
"+ g[a].append((b, c))",
"+ g[b].append((a, c))",
"- dist = [0] * N",
"- visited = [False] * N",
"- q = [(c, v) for c, v in g[K]]",
"- heapify(q)",
"- dist[K], visited[K] = 0, True",
"+ q = deque([(K, 0, -1)])",
"- c, v = heappop(q)",
"- if visited[v]:",
"- continue",
"- dist[v], visited[v] = c, True",
"- for d, u in g[v]:",
"- if visited[u]:",
"+ v, c, p = q.popleft()",
"+ dist[v] = c",
"+ for u, d in g[v]:",
"+ if u == p:",
"- heappush(q, (c + d, u))",
"+ q.append((u, c + d, v))",
"+ N = int(eval(input()))",
"+ g = [[] for i in range(N)]",
"+ dist = [0] * N"
] | false | 0.038594 | 0.036859 | 1.04707 | [
"s620321291",
"s547390159"
] |
u371467115 | p03469 | python | s018271621 | s428101448 | 20 | 18 | 2,940 | 2,940 | Accepted | Accepted | 10 | s=list(eval(input()))
s[3]="8"
S="".join(s)
print(S) | s=eval(input())
print(("2018"+s[4:])) | 4 | 2 | 49 | 30 | s = list(eval(input()))
s[3] = "8"
S = "".join(s)
print(S)
| s = eval(input())
print(("2018" + s[4:]))
| false | 50 | [
"-s = list(eval(input()))",
"-s[3] = \"8\"",
"-S = \"\".join(s)",
"-print(S)",
"+s = eval(input())",
"+print((\"2018\" + s[4:]))"
] | false | 0.034963 | 0.034627 | 1.009714 | [
"s018271621",
"s428101448"
] |
u813098295 | p03352 | python | s162134697 | s493329459 | 25 | 17 | 2,940 | 2,940 | Accepted | Accepted | 32 | def judge(x):
for i in range(2, x):
t = x
while t != 1:
if t % i == 0:
t //= i
else:
break
if t == 1:
return True
return False
x = int(eval(input()))
ans = 1
for i in range(x, 1, -1):
if judge(i):
ans = i
break
print(ans)
| x = int(eval(input()))
ans = 1
for base in range(1, 101):
for p in range(2, 10):
if base**p > x:
break
ans = max(ans, base**p)
print(ans) | 23 | 9 | 371 | 172 | def judge(x):
for i in range(2, x):
t = x
while t != 1:
if t % i == 0:
t //= i
else:
break
if t == 1:
return True
return False
x = int(eval(input()))
ans = 1
for i in range(x, 1, -1):
if judge(i):
ans = i
break
print(ans)
| x = int(eval(input()))
ans = 1
for base in range(1, 101):
for p in range(2, 10):
if base**p > x:
break
ans = max(ans, base**p)
print(ans)
| false | 60.869565 | [
"-def judge(x):",
"- for i in range(2, x):",
"- t = x",
"- while t != 1:",
"- if t % i == 0:",
"- t //= i",
"- else:",
"- break",
"- if t == 1:",
"- return True",
"- return False",
"-",
"-",
"-for i in range(x, 1, -1):",
"- if judge(i):",
"- ans = i",
"- break",
"+for base in range(1, 101):",
"+ for p in range(2, 10):",
"+ if base**p > x:",
"+ break",
"+ ans = max(ans, base**p)"
] | false | 0.035606 | 0.034379 | 1.03568 | [
"s162134697",
"s493329459"
] |
u185464141 | p02935 | python | s207144805 | s046617134 | 56 | 36 | 5,776 | 5,144 | Accepted | Accepted | 35.71 | # coding: utf-8
# submission # - User: herp_sy
# https://atcoder.jp/contests/
import math
import statistics
# fact(int)
def fact(n):
if(n == 1):
return 1
else:
return (n * fact(n - 1))
# gcd(int,int)
def gcd(a,b):
if a == 0:
return b
elif b == 0:
return a
else:
return gcd(b,a % b)
# lcm(int,int)
def lcm(a,b):
return (a * b / gcd(a,b))
# qsort(array[])
def qsort(seq):
if len(seq) < 1:
return seq
pivot = seq[0]
left = []
right = []
for x in range(1, len(seq)):
if seq[x] <= pivot:
left.append(seq[x])
else:
right.append(seq[x])
left = qsort(left)
right = qsort(right)
foo = [pivot]
return (left + foo + right)
# = map(int, input().split())
n = int(eval(input()))
# = raw_input().split()
v = list(int(i) for i in input().split())
lastguzai = 0.00
for i in range(n):
vs = sorted(v)
if len(v) == 2:
lastguzai = (v[0] + v[1]) / 2.00
break
# print(vs)
v = vs
lastguzai = (v[0] + v[1]) / 2.00
del v[0]
del v[0]
v.append(lastguzai)
# print(v)
print(('{:.6f}'.format(lastguzai)))
| # coding: utf-8
# submission # - User: herp_sy
# https://atcoder.jp/contests/
import math
import statistics
def qsort(seq):
if len(seq) < 1:
return seq
pivot = seq[0]
left = []
right = []
for x in range(1, len(seq)):
if seq[x] <= pivot:
left.append(seq[x])
else:
right.append(seq[x])
left = qsort(left)
right = qsort(right)
foo = [pivot]
return (left + foo + right)
n = int(eval(input()))
v = list(int(i) for i in input().split())
lastguzai = 0.00
for i in range(n):
vs = sorted(v)
if len(v) == 2:
lastguzai = (v[0] + v[1]) / 2.00
break
v = vs
lastguzai = (v[0] + v[1]) / 2.00
del v[0:2]
v.append(lastguzai)
print(('{:.6f}'.format(lastguzai)))
| 65 | 38 | 1,152 | 750 | # coding: utf-8
# submission # - User: herp_sy
# https://atcoder.jp/contests/
import math
import statistics
# fact(int)
def fact(n):
if n == 1:
return 1
else:
return n * fact(n - 1)
# gcd(int,int)
def gcd(a, b):
if a == 0:
return b
elif b == 0:
return a
else:
return gcd(b, a % b)
# lcm(int,int)
def lcm(a, b):
return a * b / gcd(a, b)
# qsort(array[])
def qsort(seq):
if len(seq) < 1:
return seq
pivot = seq[0]
left = []
right = []
for x in range(1, len(seq)):
if seq[x] <= pivot:
left.append(seq[x])
else:
right.append(seq[x])
left = qsort(left)
right = qsort(right)
foo = [pivot]
return left + foo + right
# = map(int, input().split())
n = int(eval(input()))
# = raw_input().split()
v = list(int(i) for i in input().split())
lastguzai = 0.00
for i in range(n):
vs = sorted(v)
if len(v) == 2:
lastguzai = (v[0] + v[1]) / 2.00
break
# print(vs)
v = vs
lastguzai = (v[0] + v[1]) / 2.00
del v[0]
del v[0]
v.append(lastguzai)
# print(v)
print(("{:.6f}".format(lastguzai)))
| # coding: utf-8
# submission # - User: herp_sy
# https://atcoder.jp/contests/
import math
import statistics
def qsort(seq):
if len(seq) < 1:
return seq
pivot = seq[0]
left = []
right = []
for x in range(1, len(seq)):
if seq[x] <= pivot:
left.append(seq[x])
else:
right.append(seq[x])
left = qsort(left)
right = qsort(right)
foo = [pivot]
return left + foo + right
n = int(eval(input()))
v = list(int(i) for i in input().split())
lastguzai = 0.00
for i in range(n):
vs = sorted(v)
if len(v) == 2:
lastguzai = (v[0] + v[1]) / 2.00
break
v = vs
lastguzai = (v[0] + v[1]) / 2.00
del v[0:2]
v.append(lastguzai)
print(("{:.6f}".format(lastguzai)))
| false | 41.538462 | [
"-# fact(int)",
"-def fact(n):",
"- if n == 1:",
"- return 1",
"- else:",
"- return n * fact(n - 1)",
"-",
"-# gcd(int,int)",
"-def gcd(a, b):",
"- if a == 0:",
"- return b",
"- elif b == 0:",
"- return a",
"- else:",
"- return gcd(b, a % b)",
"-",
"-",
"-# lcm(int,int)",
"-def lcm(a, b):",
"- return a * b / gcd(a, b)",
"-",
"-",
"-# qsort(array[])",
"-# = map(int, input().split())",
"-# = raw_input().split()",
"- # print(vs)",
"- del v[0]",
"- del v[0]",
"+ del v[0:2]",
"- # print(v)"
] | false | 0.037127 | 0.037675 | 0.985463 | [
"s207144805",
"s046617134"
] |
u537976628 | p03457 | python | s821191428 | s888975167 | 333 | 292 | 27,280 | 27,312 | Accepted | Accepted | 12.31 | n = int(eval(input()))
plcs = [list(map(int,input().split())) for _ in range(n)]
A = [0, 0, 0]
for i in range(n):
A = [plcs[i][j] - A[j] for j in range(3)]
if A[0] >= abs(A[1]) + abs(A[2]) and plcs[i][0] % 2 == (abs(plcs[i][1]) + abs(plcs[i][2])) % 2:
continue
else:
print('No')
exit()
print('Yes') | n = int(eval(input()))
TP = [[0, 0, 0]]
for _ in range(n):
TP.append(list(map(int, input().split())))
for i in range(1, n + 1):
td = TP[i][0] - TP[i-1][0]
pd = abs(TP[i][1] - TP[i-1][1]) + abs(TP[i][2] - TP[i-1][2])
if td >= pd and td % 2 == pd % 2:
continue
else:
print('No')
exit()
print('Yes') | 11 | 13 | 338 | 346 | n = int(eval(input()))
plcs = [list(map(int, input().split())) for _ in range(n)]
A = [0, 0, 0]
for i in range(n):
A = [plcs[i][j] - A[j] for j in range(3)]
if (
A[0] >= abs(A[1]) + abs(A[2])
and plcs[i][0] % 2 == (abs(plcs[i][1]) + abs(plcs[i][2])) % 2
):
continue
else:
print("No")
exit()
print("Yes")
| n = int(eval(input()))
TP = [[0, 0, 0]]
for _ in range(n):
TP.append(list(map(int, input().split())))
for i in range(1, n + 1):
td = TP[i][0] - TP[i - 1][0]
pd = abs(TP[i][1] - TP[i - 1][1]) + abs(TP[i][2] - TP[i - 1][2])
if td >= pd and td % 2 == pd % 2:
continue
else:
print("No")
exit()
print("Yes")
| false | 15.384615 | [
"-plcs = [list(map(int, input().split())) for _ in range(n)]",
"-A = [0, 0, 0]",
"-for i in range(n):",
"- A = [plcs[i][j] - A[j] for j in range(3)]",
"- if (",
"- A[0] >= abs(A[1]) + abs(A[2])",
"- and plcs[i][0] % 2 == (abs(plcs[i][1]) + abs(plcs[i][2])) % 2",
"- ):",
"+TP = [[0, 0, 0]]",
"+for _ in range(n):",
"+ TP.append(list(map(int, input().split())))",
"+for i in range(1, n + 1):",
"+ td = TP[i][0] - TP[i - 1][0]",
"+ pd = abs(TP[i][1] - TP[i - 1][1]) + abs(TP[i][2] - TP[i - 1][2])",
"+ if td >= pd and td % 2 == pd % 2:"
] | false | 0.044464 | 0.046827 | 0.949535 | [
"s821191428",
"s888975167"
] |
u414458988 | p03635 | python | s852443336 | s559465455 | 163 | 73 | 38,256 | 61,824 | Accepted | Accepted | 55.21 | a, b = list(map(int, input().split()))
print(((a-1)*(b-1))) | def main():
n,m = list(map(int,input().split()))
print(((n-1)*(m-1)))
if __name__ == '__main__':
main()
| 2 | 6 | 52 | 114 | a, b = list(map(int, input().split()))
print(((a - 1) * (b - 1)))
| def main():
n, m = list(map(int, input().split()))
print(((n - 1) * (m - 1)))
if __name__ == "__main__":
main()
| false | 66.666667 | [
"-a, b = list(map(int, input().split()))",
"-print(((a - 1) * (b - 1)))",
"+def main():",
"+ n, m = list(map(int, input().split()))",
"+ print(((n - 1) * (m - 1)))",
"+",
"+",
"+if __name__ == \"__main__\":",
"+ main()"
] | false | 0.085394 | 0.07919 | 1.078347 | [
"s852443336",
"s559465455"
] |
u102461423 | p02793 | python | s310256624 | s651445029 | 1,890 | 1,507 | 6,008 | 6,008 | Accepted | Accepted | 20.26 | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
from fractions import gcd
from functools import reduce
N,*A = list(map(int,read().split()))
MOD = 10 ** 9 + 7
lcm = reduce(lambda x,y: x*y//gcd(x,y), A)
answer = sum(lcm//x for x in A)
answer %= MOD
print(answer)
| import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
from fractions import gcd
from functools import reduce
N,*A = list(map(int,read().split()))
MOD = 10 ** 9 + 7
lcm = reduce(lambda x,y: x*(y//gcd(x,y)), A)
answer = sum(lcm//x for x in A)
answer %= MOD
print(answer)
| 17 | 17 | 344 | 346 | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
from fractions import gcd
from functools import reduce
N, *A = list(map(int, read().split()))
MOD = 10**9 + 7
lcm = reduce(lambda x, y: x * y // gcd(x, y), A)
answer = sum(lcm // x for x in A)
answer %= MOD
print(answer)
| import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
from fractions import gcd
from functools import reduce
N, *A = list(map(int, read().split()))
MOD = 10**9 + 7
lcm = reduce(lambda x, y: x * (y // gcd(x, y)), A)
answer = sum(lcm // x for x in A)
answer %= MOD
print(answer)
| false | 0 | [
"-lcm = reduce(lambda x, y: x * y // gcd(x, y), A)",
"+lcm = reduce(lambda x, y: x * (y // gcd(x, y)), A)"
] | false | 0.083563 | 0.048996 | 1.705518 | [
"s310256624",
"s651445029"
] |
u268698968 | p03478 | python | s196167173 | s552142981 | 31 | 27 | 3,296 | 3,296 | Accepted | Accepted | 12.9 | N, A, B = list(map(int, input().split()))
numlist = []
for i in range(N+1):
num = list(map(int, str(i)))
if (A<=sum(num)<=B):
list.append(numlist,i)
print((sum(numlist))) | N, A, B = list(map(int, input().split()))
numlist = [i for i in range(N+1) if A<=sum(map(int, str(i)))<=B]
print((sum(numlist))) | 8 | 3 | 177 | 122 | N, A, B = list(map(int, input().split()))
numlist = []
for i in range(N + 1):
num = list(map(int, str(i)))
if A <= sum(num) <= B:
list.append(numlist, i)
print((sum(numlist)))
| N, A, B = list(map(int, input().split()))
numlist = [i for i in range(N + 1) if A <= sum(map(int, str(i))) <= B]
print((sum(numlist)))
| false | 62.5 | [
"-numlist = []",
"-for i in range(N + 1):",
"- num = list(map(int, str(i)))",
"- if A <= sum(num) <= B:",
"- list.append(numlist, i)",
"+numlist = [i for i in range(N + 1) if A <= sum(map(int, str(i))) <= B]"
] | false | 0.036297 | 0.03545 | 1.023886 | [
"s196167173",
"s552142981"
] |
u022407960 | p02370 | python | s853148844 | s563729736 | 130 | 120 | 14,684 | 14,520 | Accepted | Accepted | 7.69 | #!/usr/bin/env python
# -*- coding: utf-8 -*-
from sys import stdin
from collections import deque
UNVISITED, VISITED_IN_QUEUE, POPPED_OUT = 0, 1, 2
def generate_adj_matrix(_v_info):
for v_detail in _v_info:
v_from, v_to = list(map(int, v_detail))
init_adj_table[v_from].append(v_to)
init_in_deg_list[v_to] += 1
return init_adj_table, init_in_deg_list
def topological_sort():
for v in range(vertices):
if not in_deg_list[v] and status[v] is UNVISITED:
bfs(v)
return ans
def bfs(v):
v_queue.append(v)
status[v] = VISITED_IN_QUEUE
while v_queue:
current = v_queue.popleft()
ans.append(current)
for v_adj in adj_table[current]:
in_deg_list[v_adj] -= 1
if not in_deg_list[v_adj] and status[v_adj] is UNVISITED:
status[v_adj] = VISITED_IN_QUEUE
v_queue.appendleft(v_adj)
status[current] = POPPED_OUT
return None
if __name__ == '__main__':
_input = stdin.readlines()
vertices, edges = list(map(int, _input[0].split()))
v_info = [x.split() for x in _input[1:]]
status = [UNVISITED] * vertices
v_queue = deque()
init_adj_table = tuple([] for _ in range(vertices))
init_in_deg_list = [0] * vertices
ans = []
adj_table, in_deg_list = generate_adj_matrix(v_info)
print((*topological_sort())) | #!/usr/bin/env python
# -*- coding: utf-8 -*-
from sys import stdin
from collections import deque
UNVISITED, VISITED_IN_QUEUE, POPPED_OUT = 0, 1, 2
def generate_adj_matrix(_v_info):
for v_detail in _v_info:
v_from, v_to = map(int, v_detail)
init_adj_table[v_from].append(v_to)
init_in_deg_list[v_to] += 1
return init_adj_table, init_in_deg_list
def topological_sort():
for v in range(vertices):
if not in_deg_list[v] and status[v] is UNVISITED:
bfs(v)
return ans
def bfs(v):
v_queue.append(v)
status[v] = VISITED_IN_QUEUE
while v_queue:
current = v_queue.popleft()
ans.append(current)
for v_adj in adj_table[current]:
in_deg_list[v_adj] -= 1
if not in_deg_list[v_adj] and status[v_adj] is UNVISITED:
status[v_adj] = VISITED_IN_QUEUE
v_queue.appendleft(v_adj)
status[current] = POPPED_OUT
return None
if __name__ == '__main__':
_input = stdin.readlines()
vertices, edges = map(int, _input[0].split())
v_info = map(lambda x: x.split(), _input[1:])
status = [UNVISITED] * vertices
v_queue = deque()
init_adj_table = tuple([] for _ in range(vertices))
init_in_deg_list = [0] * vertices
ans = []
adj_table, in_deg_list = generate_adj_matrix(v_info)
print(*topological_sort(), sep='\n')
| 58 | 58 | 1,449 | 1,459 | #!/usr/bin/env python
# -*- coding: utf-8 -*-
from sys import stdin
from collections import deque
UNVISITED, VISITED_IN_QUEUE, POPPED_OUT = 0, 1, 2
def generate_adj_matrix(_v_info):
for v_detail in _v_info:
v_from, v_to = list(map(int, v_detail))
init_adj_table[v_from].append(v_to)
init_in_deg_list[v_to] += 1
return init_adj_table, init_in_deg_list
def topological_sort():
for v in range(vertices):
if not in_deg_list[v] and status[v] is UNVISITED:
bfs(v)
return ans
def bfs(v):
v_queue.append(v)
status[v] = VISITED_IN_QUEUE
while v_queue:
current = v_queue.popleft()
ans.append(current)
for v_adj in adj_table[current]:
in_deg_list[v_adj] -= 1
if not in_deg_list[v_adj] and status[v_adj] is UNVISITED:
status[v_adj] = VISITED_IN_QUEUE
v_queue.appendleft(v_adj)
status[current] = POPPED_OUT
return None
if __name__ == "__main__":
_input = stdin.readlines()
vertices, edges = list(map(int, _input[0].split()))
v_info = [x.split() for x in _input[1:]]
status = [UNVISITED] * vertices
v_queue = deque()
init_adj_table = tuple([] for _ in range(vertices))
init_in_deg_list = [0] * vertices
ans = []
adj_table, in_deg_list = generate_adj_matrix(v_info)
print((*topological_sort()))
| #!/usr/bin/env python
# -*- coding: utf-8 -*-
from sys import stdin
from collections import deque
UNVISITED, VISITED_IN_QUEUE, POPPED_OUT = 0, 1, 2
def generate_adj_matrix(_v_info):
for v_detail in _v_info:
v_from, v_to = map(int, v_detail)
init_adj_table[v_from].append(v_to)
init_in_deg_list[v_to] += 1
return init_adj_table, init_in_deg_list
def topological_sort():
for v in range(vertices):
if not in_deg_list[v] and status[v] is UNVISITED:
bfs(v)
return ans
def bfs(v):
v_queue.append(v)
status[v] = VISITED_IN_QUEUE
while v_queue:
current = v_queue.popleft()
ans.append(current)
for v_adj in adj_table[current]:
in_deg_list[v_adj] -= 1
if not in_deg_list[v_adj] and status[v_adj] is UNVISITED:
status[v_adj] = VISITED_IN_QUEUE
v_queue.appendleft(v_adj)
status[current] = POPPED_OUT
return None
if __name__ == "__main__":
_input = stdin.readlines()
vertices, edges = map(int, _input[0].split())
v_info = map(lambda x: x.split(), _input[1:])
status = [UNVISITED] * vertices
v_queue = deque()
init_adj_table = tuple([] for _ in range(vertices))
init_in_deg_list = [0] * vertices
ans = []
adj_table, in_deg_list = generate_adj_matrix(v_info)
print(*topological_sort(), sep="\n")
| false | 0 | [
"- v_from, v_to = list(map(int, v_detail))",
"+ v_from, v_to = map(int, v_detail)",
"- vertices, edges = list(map(int, _input[0].split()))",
"- v_info = [x.split() for x in _input[1:]]",
"+ vertices, edges = map(int, _input[0].split())",
"+ v_info = map(lambda x: x.split(), _input[1:])",
"- print((*topological_sort()))",
"+ print(*topological_sort(), sep=\"\\n\")"
] | false | 0.049584 | 0.04911 | 1.009665 | [
"s853148844",
"s563729736"
] |
u471797506 | p03776 | python | s060676297 | s924651319 | 33 | 15 | 4,368 | 2,812 | Accepted | Accepted | 54.55 | # -*- coding: utf-8 -*-
import sys,copy,math,heapq,itertools as it,fractions,re,bisect,collections
def combinations(n, r):
res = 1
for i in range(n - r + 1, n + 1):
res *= i
for i in range(2, r + 1):
res /= i
return res
N, A, B = list(map(int, input().split()))
v = list(map(int, input().split()))
v.sort(reverse = True)
cnt = collections.Counter(v)
mx = sum(v[:A])
comb = 0
for n in range(A, B + 1):
tmp_cnt = collections.Counter(v[:n])
tmp = 1
for key, val in list(tmp_cnt.items()):
tmp *= combinations(cnt[key], val)
if A*sum(v[:n]) == n*mx:
comb += tmp
print("%.10f" % (mx*1.0/A))
print(comb)
| # -*- coding: utf-8 -*-
from collections import Counter
def combinations(n, r):
res = 1
for i in range(n - r + 1, n + 1):
res *= i
for i in range(2, r + 1):
res /= i
return res
N, A, B = list(map(int, input().split()))
v = list(map(int, input().split()))
v.sort(reverse = True)
cnt = Counter(v)
mx = sum(v[:A])
comb = 0
for n in range(A, B + 1):
tmp = 1
for key, val in list(Counter(v[:n]).items()):
tmp *= combinations(cnt[key], val)
if A*sum(v[:n]) == n*mx:
comb += tmp
print("%.10f" % (mx*1.0/A))
print(comb)
| 31 | 28 | 692 | 598 | # -*- coding: utf-8 -*-
import sys, copy, math, heapq, itertools as it, fractions, re, bisect, collections
def combinations(n, r):
res = 1
for i in range(n - r + 1, n + 1):
res *= i
for i in range(2, r + 1):
res /= i
return res
N, A, B = list(map(int, input().split()))
v = list(map(int, input().split()))
v.sort(reverse=True)
cnt = collections.Counter(v)
mx = sum(v[:A])
comb = 0
for n in range(A, B + 1):
tmp_cnt = collections.Counter(v[:n])
tmp = 1
for key, val in list(tmp_cnt.items()):
tmp *= combinations(cnt[key], val)
if A * sum(v[:n]) == n * mx:
comb += tmp
print("%.10f" % (mx * 1.0 / A))
print(comb)
| # -*- coding: utf-8 -*-
from collections import Counter
def combinations(n, r):
res = 1
for i in range(n - r + 1, n + 1):
res *= i
for i in range(2, r + 1):
res /= i
return res
N, A, B = list(map(int, input().split()))
v = list(map(int, input().split()))
v.sort(reverse=True)
cnt = Counter(v)
mx = sum(v[:A])
comb = 0
for n in range(A, B + 1):
tmp = 1
for key, val in list(Counter(v[:n]).items()):
tmp *= combinations(cnt[key], val)
if A * sum(v[:n]) == n * mx:
comb += tmp
print("%.10f" % (mx * 1.0 / A))
print(comb)
| false | 9.677419 | [
"-import sys, copy, math, heapq, itertools as it, fractions, re, bisect, collections",
"+from collections import Counter",
"-cnt = collections.Counter(v)",
"+cnt = Counter(v)",
"- tmp_cnt = collections.Counter(v[:n])",
"- for key, val in list(tmp_cnt.items()):",
"+ for key, val in list(Counter(v[:n]).items()):"
] | false | 0.052479 | 0.060025 | 0.874285 | [
"s060676297",
"s924651319"
] |
u761320129 | p03682 | python | s569925101 | s882446657 | 1,400 | 1,111 | 61,120 | 53,524 | Accepted | Accepted | 20.64 | N = int(eval(input()))
src = [tuple(map(int,input().split())) for i in range(N)]
xs = []
ys = []
for i,(x,y) in enumerate(src):
xs.append((x,i))
ys.append((y,i))
xs.sort()
ys.sort()
es = []
for (x1,i1),(x2,i2) in zip(xs,xs[1:]):
es.append((x2-x1, i1, i2))
for (y1,i1),(y2,i2) in zip(ys,ys[1:]):
es.append((y2-y1, i1, i2))
es.sort()
class UnionFind:
def __init__(self,N):
self.parent = [i for i in range(N)]
self.rank = [0] * N
self.count = 0
def root(self,a):
if self.parent[a] == a:
return a
else:
self.parent[a] = self.root(self.parent[a])
return self.parent[a]
def is_same(self,a,b):
return self.root(a) == self.root(b)
def unite(self,a,b):
ra = self.root(a)
rb = self.root(b)
if ra == rb: return
if self.rank[ra] < self.rank[rb]:
self.parent[ra] = rb
else:
self.parent[rb] = ra
if self.rank[ra] == self.rank[rb]: self.rank[ra] += 1
self.count += 1
ans = 0
uf = UnionFind(N)
for d,a,b in es:
if uf.is_same(a,b): continue
uf.unite(a,b)
ans += d
print(ans) | import sys
input = sys.stdin.readline
N = int(eval(input()))
XY = [tuple(map(int,input().split() + [i])) for i in range(N)]
class UnionFind:
def __init__(self,N):
self.parent = [i for i in range(N)]
self._size = [1] * N
self.count = 0
def root(self,a):
if self.parent[a] == a:
return a
else:
self.parent[a] = self.root(self.parent[a])
return self.parent[a]
def is_same(self,a,b):
return self.root(a) == self.root(b)
def unite(self,a,b):
ra = self.root(a)
rb = self.root(b)
if ra == rb: return
if self._size[ra] < self._size[rb]: ra,rb = rb,ra
self._size[ra] += self._size[rb]
self.parent[rb] = ra
self.count += 1
def size(self,a):
return self._size[self.root(a)]
uf = UnionFind(N)
sx = sorted(XY, key=lambda x:x[0])
sy = sorted(XY, key=lambda x:x[1])
es = []
for (x1,_,i),(x2,_,j) in zip(sx,sx[1:]):
es.append((x2-x1, i, j))
for (_,y1,i),(_,y2,j) in zip(sy,sy[1:]):
es.append((y2-y1, i, j))
es.sort(key=lambda x:x[0])
ans = 0
for d,i,j in es:
if uf.is_same(i,j): continue
uf.unite(i,j)
ans += d
print(ans) | 49 | 46 | 1,215 | 1,236 | N = int(eval(input()))
src = [tuple(map(int, input().split())) for i in range(N)]
xs = []
ys = []
for i, (x, y) in enumerate(src):
xs.append((x, i))
ys.append((y, i))
xs.sort()
ys.sort()
es = []
for (x1, i1), (x2, i2) in zip(xs, xs[1:]):
es.append((x2 - x1, i1, i2))
for (y1, i1), (y2, i2) in zip(ys, ys[1:]):
es.append((y2 - y1, i1, i2))
es.sort()
class UnionFind:
def __init__(self, N):
self.parent = [i for i in range(N)]
self.rank = [0] * N
self.count = 0
def root(self, a):
if self.parent[a] == a:
return a
else:
self.parent[a] = self.root(self.parent[a])
return self.parent[a]
def is_same(self, a, b):
return self.root(a) == self.root(b)
def unite(self, a, b):
ra = self.root(a)
rb = self.root(b)
if ra == rb:
return
if self.rank[ra] < self.rank[rb]:
self.parent[ra] = rb
else:
self.parent[rb] = ra
if self.rank[ra] == self.rank[rb]:
self.rank[ra] += 1
self.count += 1
ans = 0
uf = UnionFind(N)
for d, a, b in es:
if uf.is_same(a, b):
continue
uf.unite(a, b)
ans += d
print(ans)
| import sys
input = sys.stdin.readline
N = int(eval(input()))
XY = [tuple(map(int, input().split() + [i])) for i in range(N)]
class UnionFind:
def __init__(self, N):
self.parent = [i for i in range(N)]
self._size = [1] * N
self.count = 0
def root(self, a):
if self.parent[a] == a:
return a
else:
self.parent[a] = self.root(self.parent[a])
return self.parent[a]
def is_same(self, a, b):
return self.root(a) == self.root(b)
def unite(self, a, b):
ra = self.root(a)
rb = self.root(b)
if ra == rb:
return
if self._size[ra] < self._size[rb]:
ra, rb = rb, ra
self._size[ra] += self._size[rb]
self.parent[rb] = ra
self.count += 1
def size(self, a):
return self._size[self.root(a)]
uf = UnionFind(N)
sx = sorted(XY, key=lambda x: x[0])
sy = sorted(XY, key=lambda x: x[1])
es = []
for (x1, _, i), (x2, _, j) in zip(sx, sx[1:]):
es.append((x2 - x1, i, j))
for (_, y1, i), (_, y2, j) in zip(sy, sy[1:]):
es.append((y2 - y1, i, j))
es.sort(key=lambda x: x[0])
ans = 0
for d, i, j in es:
if uf.is_same(i, j):
continue
uf.unite(i, j)
ans += d
print(ans)
| false | 6.122449 | [
"+import sys",
"+",
"+input = sys.stdin.readline",
"-src = [tuple(map(int, input().split())) for i in range(N)]",
"-xs = []",
"-ys = []",
"-for i, (x, y) in enumerate(src):",
"- xs.append((x, i))",
"- ys.append((y, i))",
"-xs.sort()",
"-ys.sort()",
"-es = []",
"-for (x1, i1), (x2, i2) in zip(xs, xs[1:]):",
"- es.append((x2 - x1, i1, i2))",
"-for (y1, i1), (y2, i2) in zip(ys, ys[1:]):",
"- es.append((y2 - y1, i1, i2))",
"-es.sort()",
"+XY = [tuple(map(int, input().split() + [i])) for i in range(N)]",
"- self.rank = [0] * N",
"+ self._size = [1] * N",
"- if self.rank[ra] < self.rank[rb]:",
"- self.parent[ra] = rb",
"- else:",
"- self.parent[rb] = ra",
"- if self.rank[ra] == self.rank[rb]:",
"- self.rank[ra] += 1",
"+ if self._size[ra] < self._size[rb]:",
"+ ra, rb = rb, ra",
"+ self._size[ra] += self._size[rb]",
"+ self.parent[rb] = ra",
"+ def size(self, a):",
"+ return self._size[self.root(a)]",
"+",
"+uf = UnionFind(N)",
"+sx = sorted(XY, key=lambda x: x[0])",
"+sy = sorted(XY, key=lambda x: x[1])",
"+es = []",
"+for (x1, _, i), (x2, _, j) in zip(sx, sx[1:]):",
"+ es.append((x2 - x1, i, j))",
"+for (_, y1, i), (_, y2, j) in zip(sy, sy[1:]):",
"+ es.append((y2 - y1, i, j))",
"+es.sort(key=lambda x: x[0])",
"-uf = UnionFind(N)",
"-for d, a, b in es:",
"- if uf.is_same(a, b):",
"+for d, i, j in es:",
"+ if uf.is_same(i, j):",
"- uf.unite(a, b)",
"+ uf.unite(i, j)"
] | false | 0.045931 | 0.045559 | 1.00816 | [
"s569925101",
"s882446657"
] |
u515207244 | p02964 | python | s330213044 | s744213156 | 393 | 363 | 122,816 | 122,816 | Accepted | Accepted | 7.63 | N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
table = {}
init_table = {}
move = {}
for i in range(N):
if A[i] in table:
move[table[A[i]]], move[i] = i+1, init_table[A[i]]+1
else:
if A[i] not in init_table:
init_table[A[i]] = i
table[A[i]] = i
T = K
idx = 0
remain = [0]
for i in range(1, K+1):
while idx in move and idx < move[idx]:
idx = move[idx]
remain.append(idx)
if(idx == N and i != K):
T = K % i
break
if idx in move:
idx = move[idx]
else:
idx += 1
if(T == 0):
print()
exit()
idx = remain[T]
ret = []
while idx < len(A):
while idx in move and idx < move[idx]:
idx = move[idx]
if(idx < len(A)):
ret.append(A[idx])
idx += 1
print((*ret))
| N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
table = {}
init_table = {}
move = {}
for i in range(N):
if A[i] in table:
move[table[A[i]]], move[i] = i+1, init_table[A[i]]+1
else:
if A[i] not in init_table:
init_table[A[i]] = i
table[A[i]] = i
T = K
idx = 0
remain = [0]
for i in range(1, K+1):
while idx in move and idx < move[idx]:
idx = move[idx]
remain.append(idx)
if(idx == N and i != K):
T = K % i
break
if idx in move:
idx = move[idx]
else:
idx += 1
if(T == 0):
print()
exit()
idx = remain[T]
ret = []
while idx < len(A):
while idx in move and idx < move[idx]:
idx = move[idx]
if(idx >= len(A)):
break
ret.append(A[idx])
idx += 1
print((*ret))
| 44 | 45 | 849 | 861 | N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
table = {}
init_table = {}
move = {}
for i in range(N):
if A[i] in table:
move[table[A[i]]], move[i] = i + 1, init_table[A[i]] + 1
else:
if A[i] not in init_table:
init_table[A[i]] = i
table[A[i]] = i
T = K
idx = 0
remain = [0]
for i in range(1, K + 1):
while idx in move and idx < move[idx]:
idx = move[idx]
remain.append(idx)
if idx == N and i != K:
T = K % i
break
if idx in move:
idx = move[idx]
else:
idx += 1
if T == 0:
print()
exit()
idx = remain[T]
ret = []
while idx < len(A):
while idx in move and idx < move[idx]:
idx = move[idx]
if idx < len(A):
ret.append(A[idx])
idx += 1
print((*ret))
| N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
table = {}
init_table = {}
move = {}
for i in range(N):
if A[i] in table:
move[table[A[i]]], move[i] = i + 1, init_table[A[i]] + 1
else:
if A[i] not in init_table:
init_table[A[i]] = i
table[A[i]] = i
T = K
idx = 0
remain = [0]
for i in range(1, K + 1):
while idx in move and idx < move[idx]:
idx = move[idx]
remain.append(idx)
if idx == N and i != K:
T = K % i
break
if idx in move:
idx = move[idx]
else:
idx += 1
if T == 0:
print()
exit()
idx = remain[T]
ret = []
while idx < len(A):
while idx in move and idx < move[idx]:
idx = move[idx]
if idx >= len(A):
break
ret.append(A[idx])
idx += 1
print((*ret))
| false | 2.222222 | [
"- if idx < len(A):",
"- ret.append(A[idx])",
"+ if idx >= len(A):",
"+ break",
"+ ret.append(A[idx])"
] | false | 0.042948 | 0.115785 | 0.370929 | [
"s330213044",
"s744213156"
] |
u912237403 | p00112 | python | s367454504 | s049062626 | 40 | 30 | 4,536 | 4,712 | Accepted | Accepted | 25 | while 1:
n=int(input())
if n==0: break
x=sorted([int(input()) for _ in [0]*n])
s=0
a=0
for e in x[:-1]: a+=e; s+=a
print(s) | while 1:
n=int(input())
if n==0: break
x=sorted(map(int,[input() for _ in [0]*n]))
s=a=0
for e in x[:-1]: a+=e; s+=a
print(s) | 8 | 7 | 151 | 150 | while 1:
n = int(input())
if n == 0:
break
x = sorted([int(input()) for _ in [0] * n])
s = 0
a = 0
for e in x[:-1]:
a += e
s += a
print(s)
| while 1:
n = int(input())
if n == 0:
break
x = sorted(map(int, [input() for _ in [0] * n]))
s = a = 0
for e in x[:-1]:
a += e
s += a
print(s)
| false | 12.5 | [
"- x = sorted([int(input()) for _ in [0] * n])",
"- s = 0",
"- a = 0",
"+ x = sorted(map(int, [input() for _ in [0] * n]))",
"+ s = a = 0"
] | false | 0.042853 | 0.04373 | 0.979946 | [
"s367454504",
"s049062626"
] |
u874059570 | p02888 | python | s543653468 | s459568731 | 1,464 | 1,257 | 3,184 | 3,188 | Accepted | Accepted | 14.14 | import time
from bisect import bisect_left
n = int(eval(input()))
l = list(map(int, input().split()))
l = sorted(l)
start = time.time()
res = 0
for i in range(n):
for j in range(i+1,n):
ab = l[i] + l[j]
c_index = bisect_left(l, ab)
res += c_index - j - 1
print(res)
| from bisect import bisect_left
N = int(eval(input()))
Lmat = [int(n) for n in input().split()]
Lmat.sort()
sum = 0
for i in range(N):
for j in range(i+1,N):
sum+= bisect_left(Lmat, Lmat[i]+Lmat[j]) - j - 1
print(sum) | 14 | 11 | 302 | 234 | import time
from bisect import bisect_left
n = int(eval(input()))
l = list(map(int, input().split()))
l = sorted(l)
start = time.time()
res = 0
for i in range(n):
for j in range(i + 1, n):
ab = l[i] + l[j]
c_index = bisect_left(l, ab)
res += c_index - j - 1
print(res)
| from bisect import bisect_left
N = int(eval(input()))
Lmat = [int(n) for n in input().split()]
Lmat.sort()
sum = 0
for i in range(N):
for j in range(i + 1, N):
sum += bisect_left(Lmat, Lmat[i] + Lmat[j]) - j - 1
print(sum)
| false | 21.428571 | [
"-import time",
"-n = int(eval(input()))",
"-l = list(map(int, input().split()))",
"-l = sorted(l)",
"-start = time.time()",
"-res = 0",
"-for i in range(n):",
"- for j in range(i + 1, n):",
"- ab = l[i] + l[j]",
"- c_index = bisect_left(l, ab)",
"- res += c_index - j - 1",
"-print(res)",
"+N = int(eval(input()))",
"+Lmat = [int(n) for n in input().split()]",
"+Lmat.sort()",
"+sum = 0",
"+for i in range(N):",
"+ for j in range(i + 1, N):",
"+ sum += bisect_left(Lmat, Lmat[i] + Lmat[j]) - j - 1",
"+print(sum)"
] | false | 0.041072 | 0.043847 | 0.936714 | [
"s543653468",
"s459568731"
] |
u150984829 | p02258 | python | s854904382 | s468558884 | 130 | 100 | 5,632 | 5,636 | Accepted | Accepted | 23.08 | import sys
s=1e10;b=-s
eval(input())
for r in map(int,sys.stdin):
if b<r-s:b=r-s
if s>r:s=r
print(b)
| import sys
def f():
s=1e10;b=-s
eval(input())
for r in map(int,sys.stdin):
if b<r-s:b=r-s
if s>r:s=r
print(b)
f()
| 7 | 9 | 103 | 124 | import sys
s = 1e10
b = -s
eval(input())
for r in map(int, sys.stdin):
if b < r - s:
b = r - s
if s > r:
s = r
print(b)
| import sys
def f():
s = 1e10
b = -s
eval(input())
for r in map(int, sys.stdin):
if b < r - s:
b = r - s
if s > r:
s = r
print(b)
f()
| false | 22.222222 | [
"-s = 1e10",
"-b = -s",
"-eval(input())",
"-for r in map(int, sys.stdin):",
"- if b < r - s:",
"- b = r - s",
"- if s > r:",
"- s = r",
"-print(b)",
"+",
"+def f():",
"+ s = 1e10",
"+ b = -s",
"+ eval(input())",
"+ for r in map(int, sys.stdin):",
"+ if b < r - s:",
"+ b = r - s",
"+ if s > r:",
"+ s = r",
"+ print(b)",
"+",
"+",
"+f()"
] | false | 0.098298 | 0.084131 | 1.168388 | [
"s854904382",
"s468558884"
] |
u021019433 | p02757 | python | s142986422 | s391945440 | 153 | 130 | 5,092 | 5,096 | Accepted | Accepted | 15.03 | p = int(input().split()[1])
a = list(map(int, eval(input())))
if 10 % p == 0:
r = sum(i for i, x in enumerate(a, 1) if x % p == 0)
else:
d = [1] + [0] * (p - 1)
t, y = 0, 1
for i, x in enumerate(reversed(a), 1):
t = (t + x * y) % p
d[t] += 1
y = y * 10 % p;
r = sum(i * (i - 1) // 2 for i in d)
print(r)
| p = int(input().split()[1])
a = list(map(int, eval(input())))
if 10 % p == 0:
r = sum(i for i, x in enumerate(a, 1) if x % p == 0)
else:
d = [1] + [0] * (p - 1)
s, y = 0, 1
for x in reversed(a):
s = (s + x * y) % p
d[s] += 1
y = y * 10 % p;
r = sum(i * (i - 1) // 2 for i in d)
print(r) | 13 | 13 | 332 | 314 | p = int(input().split()[1])
a = list(map(int, eval(input())))
if 10 % p == 0:
r = sum(i for i, x in enumerate(a, 1) if x % p == 0)
else:
d = [1] + [0] * (p - 1)
t, y = 0, 1
for i, x in enumerate(reversed(a), 1):
t = (t + x * y) % p
d[t] += 1
y = y * 10 % p
r = sum(i * (i - 1) // 2 for i in d)
print(r)
| p = int(input().split()[1])
a = list(map(int, eval(input())))
if 10 % p == 0:
r = sum(i for i, x in enumerate(a, 1) if x % p == 0)
else:
d = [1] + [0] * (p - 1)
s, y = 0, 1
for x in reversed(a):
s = (s + x * y) % p
d[s] += 1
y = y * 10 % p
r = sum(i * (i - 1) // 2 for i in d)
print(r)
| false | 0 | [
"- t, y = 0, 1",
"- for i, x in enumerate(reversed(a), 1):",
"- t = (t + x * y) % p",
"- d[t] += 1",
"+ s, y = 0, 1",
"+ for x in reversed(a):",
"+ s = (s + x * y) % p",
"+ d[s] += 1"
] | false | 0.047095 | 0.049334 | 0.954608 | [
"s142986422",
"s391945440"
] |
u724428568 | p02911 | python | s885232750 | s624458191 | 378 | 195 | 26,596 | 11,796 | Accepted | Accepted | 48.41 | N, K, Q = list(map(int, input().split()))
score = {str(i): 0 for i in range(1, N+1)}
for _ in range(Q):
answerer = eval(input())
score[answerer] += 1
for k, v in sorted(list(score.items()), key=lambda x:int(x[0])):
if K - (Q - v) > 0:
print("Yes")
else:
print("No") | N, K, Q = map(int, input().split())
points = [K for _ in range(N)]
for _ in range(Q):
a = int(input())
points[a-1] += 1
for p in points:
print("Yes") if p - Q >= 1 else print("No")
| 11 | 8 | 274 | 196 | N, K, Q = list(map(int, input().split()))
score = {str(i): 0 for i in range(1, N + 1)}
for _ in range(Q):
answerer = eval(input())
score[answerer] += 1
for k, v in sorted(list(score.items()), key=lambda x: int(x[0])):
if K - (Q - v) > 0:
print("Yes")
else:
print("No")
| N, K, Q = map(int, input().split())
points = [K for _ in range(N)]
for _ in range(Q):
a = int(input())
points[a - 1] += 1
for p in points:
print("Yes") if p - Q >= 1 else print("No")
| false | 27.272727 | [
"-N, K, Q = list(map(int, input().split()))",
"-score = {str(i): 0 for i in range(1, N + 1)}",
"+N, K, Q = map(int, input().split())",
"+points = [K for _ in range(N)]",
"- answerer = eval(input())",
"- score[answerer] += 1",
"-for k, v in sorted(list(score.items()), key=lambda x: int(x[0])):",
"- if K - (Q - v) > 0:",
"- print(\"Yes\")",
"- else:",
"- print(\"No\")",
"+ a = int(input())",
"+ points[a - 1] += 1",
"+for p in points:",
"+ print(\"Yes\") if p - Q >= 1 else print(\"No\")"
] | false | 0.04611 | 0.084463 | 0.545917 | [
"s885232750",
"s624458191"
] |
u170183831 | p02837 | python | s924518919 | s956059829 | 749 | 91 | 9,032 | 9,164 | Accepted | Accepted | 87.85 | from itertools import product
n = int(eval(input()))
d = {}
for i in range(n):
a = int(eval(input()))
for _ in range(a):
x, y = list(map(int, input().split()))
if i + 1 not in d:
d[i + 1] = []
d[i + 1].append((x, y))
ret = 0
for x in product((0, 1), repeat=n):
tmp = [-1] * n
ok = True
for i in range(n):
if x[i] == 1 and i + 1 in d:
for y in d[i + 1]:
if tmp[y[0] - 1] == -1:
tmp[y[0] - 1] = y[1]
elif tmp[y[0] - 1] != y[1]:
ok = False
break
if not ok:
break
if ok and all(a == b or b == -1 for a, b in zip(x, tmp)):
ret = max(ret, sum(x))
print(ret) | from itertools import product
n = int(eval(input()))
d = {}
for i in range(n):
a = int(eval(input()))
for _ in range(a):
x, y = list(map(int, input().split()))
if i + 1 not in d:
d[i + 1] = []
d[i + 1].append((x, y))
ret = 0
for x in product((0, 1), repeat=n):
ok = True
for i in range(n):
if x[i] == 0 or i + 1 not in d:
continue
for p, tf in d[i + 1]:
if x[p - 1] != tf:
ok = False
break
if not ok:
break
if ok:
ret = max(ret, sum(x))
print(ret) | 31 | 29 | 667 | 539 | from itertools import product
n = int(eval(input()))
d = {}
for i in range(n):
a = int(eval(input()))
for _ in range(a):
x, y = list(map(int, input().split()))
if i + 1 not in d:
d[i + 1] = []
d[i + 1].append((x, y))
ret = 0
for x in product((0, 1), repeat=n):
tmp = [-1] * n
ok = True
for i in range(n):
if x[i] == 1 and i + 1 in d:
for y in d[i + 1]:
if tmp[y[0] - 1] == -1:
tmp[y[0] - 1] = y[1]
elif tmp[y[0] - 1] != y[1]:
ok = False
break
if not ok:
break
if ok and all(a == b or b == -1 for a, b in zip(x, tmp)):
ret = max(ret, sum(x))
print(ret)
| from itertools import product
n = int(eval(input()))
d = {}
for i in range(n):
a = int(eval(input()))
for _ in range(a):
x, y = list(map(int, input().split()))
if i + 1 not in d:
d[i + 1] = []
d[i + 1].append((x, y))
ret = 0
for x in product((0, 1), repeat=n):
ok = True
for i in range(n):
if x[i] == 0 or i + 1 not in d:
continue
for p, tf in d[i + 1]:
if x[p - 1] != tf:
ok = False
break
if not ok:
break
if ok:
ret = max(ret, sum(x))
print(ret)
| false | 6.451613 | [
"- tmp = [-1] * n",
"- if x[i] == 1 and i + 1 in d:",
"- for y in d[i + 1]:",
"- if tmp[y[0] - 1] == -1:",
"- tmp[y[0] - 1] = y[1]",
"- elif tmp[y[0] - 1] != y[1]:",
"- ok = False",
"- break",
"+ if x[i] == 0 or i + 1 not in d:",
"+ continue",
"+ for p, tf in d[i + 1]:",
"+ if x[p - 1] != tf:",
"+ ok = False",
"+ break",
"- if ok and all(a == b or b == -1 for a, b in zip(x, tmp)):",
"+ if ok:"
] | false | 0.045415 | 0.084618 | 0.536701 | [
"s924518919",
"s956059829"
] |
u802963389 | p02720 | python | s739534413 | s513812184 | 1,327 | 164 | 146,728 | 16,628 | Accepted | Accepted | 87.64 | k = int(eval(input()))
li = [str(i) for i in range(1, 10)]
n = 0
while n < 9:
rep = li[:]
for r in rep:
if r[-1] == "0":
li.append(r+"0")
li.append(r+"1")
elif r[-1] == "9":
li.append(r+"8")
li.append(r+"9")
else:
x = int(r[-1])
li.append(r+str(x-1))
li.append(r+str(x))
li.append(r+str(x+1))
n += 1
setli = set(li)
li = list(setli)
#print(li)
intli = [int(i) for i in li]
intli.sort()
#print(intli)
#intli.sort
#print(len(intli))
#print(intli)
print((intli[k-1]))
| from collections import deque
k = int(eval(input()))
def dfs(k):
cnt = 0
stack = deque()
for i in range(1, 10):
stack.append(i)
while cnt <= k:
q = stack.popleft()
ans.append(q)
cnt += 1
l = q % 10
for x in range(max(0, l - 1), min(10, l + 2)):
stack.append(q * 10 + x)
ans = []
dfs(k)
print((ans[k-1])) | 29 | 19 | 552 | 363 | k = int(eval(input()))
li = [str(i) for i in range(1, 10)]
n = 0
while n < 9:
rep = li[:]
for r in rep:
if r[-1] == "0":
li.append(r + "0")
li.append(r + "1")
elif r[-1] == "9":
li.append(r + "8")
li.append(r + "9")
else:
x = int(r[-1])
li.append(r + str(x - 1))
li.append(r + str(x))
li.append(r + str(x + 1))
n += 1
setli = set(li)
li = list(setli)
# print(li)
intli = [int(i) for i in li]
intli.sort()
# print(intli)
# intli.sort
# print(len(intli))
# print(intli)
print((intli[k - 1]))
| from collections import deque
k = int(eval(input()))
def dfs(k):
cnt = 0
stack = deque()
for i in range(1, 10):
stack.append(i)
while cnt <= k:
q = stack.popleft()
ans.append(q)
cnt += 1
l = q % 10
for x in range(max(0, l - 1), min(10, l + 2)):
stack.append(q * 10 + x)
ans = []
dfs(k)
print((ans[k - 1]))
| false | 34.482759 | [
"+from collections import deque",
"+",
"-li = [str(i) for i in range(1, 10)]",
"-n = 0",
"-while n < 9:",
"- rep = li[:]",
"- for r in rep:",
"- if r[-1] == \"0\":",
"- li.append(r + \"0\")",
"- li.append(r + \"1\")",
"- elif r[-1] == \"9\":",
"- li.append(r + \"8\")",
"- li.append(r + \"9\")",
"- else:",
"- x = int(r[-1])",
"- li.append(r + str(x - 1))",
"- li.append(r + str(x))",
"- li.append(r + str(x + 1))",
"- n += 1",
"-setli = set(li)",
"-li = list(setli)",
"-# print(li)",
"-intli = [int(i) for i in li]",
"-intli.sort()",
"-# print(intli)",
"-# intli.sort",
"-# print(len(intli))",
"-# print(intli)",
"-print((intli[k - 1]))",
"+",
"+",
"+def dfs(k):",
"+ cnt = 0",
"+ stack = deque()",
"+ for i in range(1, 10):",
"+ stack.append(i)",
"+ while cnt <= k:",
"+ q = stack.popleft()",
"+ ans.append(q)",
"+ cnt += 1",
"+ l = q % 10",
"+ for x in range(max(0, l - 1), min(10, l + 2)):",
"+ stack.append(q * 10 + x)",
"+",
"+",
"+ans = []",
"+dfs(k)",
"+print((ans[k - 1]))"
] | false | 1.957817 | 0.051902 | 37.721513 | [
"s739534413",
"s513812184"
] |
u648212584 | p02781 | python | s555306399 | s646371238 | 23 | 18 | 3,444 | 3,064 | Accepted | Accepted | 21.74 | import sys
#input = sys.stdin.buffer.readline
import copy
def main():
N = str(eval(input()))
K = int(eval(input()))
l = len(N)
dpa = [[0 for _ in range(K+1)] for _ in range(l)]
dpb = copy.deepcopy(dpa)
dpa[0][0],dpa[0][1],dpb[0][1] = 1,int(N[0])-1,1
for i in range(1,l):
dpa[i][0] = 1
num = int(N[i])
if num == 0:
for j in range(K):
j += 1
dpa[i][j] = dpa[i-1][j-1]*9 + dpa[i-1][j]
dpb[i][j] = dpb[i-1][j]
else:
for j in range(K):
j += 1
dpa[i][j] = dpa[i-1][j-1]*9 + dpa[i-1][j] + dpb[i-1][j-1]*(num-1) + dpb[i-1][j]
dpb[i][j] = dpb[i-1][j-1]
print((dpa[l-1][K]+dpb[l-1][K]))
if __name__ == "__main__":
main()
| import sys
#input = sys.stdin.buffer.readline
def main():
N = str(eval(input()))
K = int(eval(input()))
l = len(N)
dpa = [[0 for _ in range(K+1)] for _ in range(l)]
dpb = [[0 for _ in range(K+1)] for _ in range(l)]
dpa[0][0],dpa[0][1],dpb[0][1] = 1,int(N[0])-1,1
for i in range(1,l):
dpa[i][0] = 1
num = int(N[i])
if num == 0:
for j in range(K):
j += 1
dpa[i][j] = dpa[i-1][j-1]*9 + dpa[i-1][j]
dpb[i][j] = dpb[i-1][j]
else:
for j in range(K):
j += 1
dpa[i][j] = dpa[i-1][j-1]*9 + dpa[i-1][j] + dpb[i-1][j-1]*(num-1) + dpb[i-1][j]
dpb[i][j] = dpb[i-1][j-1]
print((dpa[l-1][K]+dpb[l-1][K]))
if __name__ == "__main__":
main()
| 31 | 30 | 828 | 840 | import sys
# input = sys.stdin.buffer.readline
import copy
def main():
N = str(eval(input()))
K = int(eval(input()))
l = len(N)
dpa = [[0 for _ in range(K + 1)] for _ in range(l)]
dpb = copy.deepcopy(dpa)
dpa[0][0], dpa[0][1], dpb[0][1] = 1, int(N[0]) - 1, 1
for i in range(1, l):
dpa[i][0] = 1
num = int(N[i])
if num == 0:
for j in range(K):
j += 1
dpa[i][j] = dpa[i - 1][j - 1] * 9 + dpa[i - 1][j]
dpb[i][j] = dpb[i - 1][j]
else:
for j in range(K):
j += 1
dpa[i][j] = (
dpa[i - 1][j - 1] * 9
+ dpa[i - 1][j]
+ dpb[i - 1][j - 1] * (num - 1)
+ dpb[i - 1][j]
)
dpb[i][j] = dpb[i - 1][j - 1]
print((dpa[l - 1][K] + dpb[l - 1][K]))
if __name__ == "__main__":
main()
| import sys
# input = sys.stdin.buffer.readline
def main():
N = str(eval(input()))
K = int(eval(input()))
l = len(N)
dpa = [[0 for _ in range(K + 1)] for _ in range(l)]
dpb = [[0 for _ in range(K + 1)] for _ in range(l)]
dpa[0][0], dpa[0][1], dpb[0][1] = 1, int(N[0]) - 1, 1
for i in range(1, l):
dpa[i][0] = 1
num = int(N[i])
if num == 0:
for j in range(K):
j += 1
dpa[i][j] = dpa[i - 1][j - 1] * 9 + dpa[i - 1][j]
dpb[i][j] = dpb[i - 1][j]
else:
for j in range(K):
j += 1
dpa[i][j] = (
dpa[i - 1][j - 1] * 9
+ dpa[i - 1][j]
+ dpb[i - 1][j - 1] * (num - 1)
+ dpb[i - 1][j]
)
dpb[i][j] = dpb[i - 1][j - 1]
print((dpa[l - 1][K] + dpb[l - 1][K]))
if __name__ == "__main__":
main()
| false | 3.225806 | [
"-import copy",
"-",
"-",
"- dpb = copy.deepcopy(dpa)",
"+ dpb = [[0 for _ in range(K + 1)] for _ in range(l)]"
] | false | 0.034884 | 0.033304 | 1.047439 | [
"s555306399",
"s646371238"
] |
u691018832 | p03545 | python | s709485465 | s421022057 | 19 | 17 | 3,316 | 3,064 | Accepted | Accepted | 10.53 | import math
import sys
input = sys.stdin.readline
abcd = int(eval(input()))
for i in range(int(4-math.log10(abcd))):
abcd = '0'+str(abcd)
a, b, c, d = str(abcd)
a = int(a);b = int(b);c = int(c);d = int(d)
if a+b+c+d == 7:
a = str(a);b = str(b);c = str(c);d = str(d)
ans = a+'+'+b+'+'+c+'+'+d+'=7'
elif a+b+c-d == 7:
a = str(a);b = str(b);c = str(c);d = str(d)
ans = a+'+'+b+'+'+c+'-'+d+'=7'
elif a+b-c-d == 7:
a = str(a);b = str(b);c = str(c);d = str(d)
ans = a+'+'+b+'-'+c+'-'+d+'=7'
elif a+b-c+d == 7:
a = str(a);b = str(b);c = str(c);d = str(d)
ans = a+'+'+b+'-'+c+'+'+d+'=7'
elif a-b+c+d == 7:
a = str(a);b = str(b);c = str(c);d = str(d)
ans = a+'-'+b+'+'+c+'+'+d+'=7'
elif a-b+c-d == 7:
a = str(a);b = str(b);c = str(c);d = str(d)
ans = a+'-'+b+'+'+c+'-'+d+'=7'
elif a-b-c+d == 7:
a = str(a);b = str(b);c = str(c);d = str(d)
ans = a+'-'+b+'-'+c+'+'+d+'=7'
else:
a = str(a);b = str(b);c = str(c);d = str(d)
ans = a+'-'+b+'-'+c+'-'+d+'=7'
print(ans) | import itertools
abcd = eval(input())
memo = list(itertools.product(['+', '-'], repeat=3))
for i in range(2 ** 3):
cnt = int(abcd[0])
for j in range(3):
if memo[i][j] == '+':
cnt += int(abcd[j + 1])
else:
cnt -= int(abcd[j + 1])
if cnt == 7:
print((abcd[0] + memo[i][0] + abcd[1] + memo[i][1] + abcd[2] + memo[i][2] + abcd[3] + '=7'))
break
| 34 | 15 | 1,048 | 417 | import math
import sys
input = sys.stdin.readline
abcd = int(eval(input()))
for i in range(int(4 - math.log10(abcd))):
abcd = "0" + str(abcd)
a, b, c, d = str(abcd)
a = int(a)
b = int(b)
c = int(c)
d = int(d)
if a + b + c + d == 7:
a = str(a)
b = str(b)
c = str(c)
d = str(d)
ans = a + "+" + b + "+" + c + "+" + d + "=7"
elif a + b + c - d == 7:
a = str(a)
b = str(b)
c = str(c)
d = str(d)
ans = a + "+" + b + "+" + c + "-" + d + "=7"
elif a + b - c - d == 7:
a = str(a)
b = str(b)
c = str(c)
d = str(d)
ans = a + "+" + b + "-" + c + "-" + d + "=7"
elif a + b - c + d == 7:
a = str(a)
b = str(b)
c = str(c)
d = str(d)
ans = a + "+" + b + "-" + c + "+" + d + "=7"
elif a - b + c + d == 7:
a = str(a)
b = str(b)
c = str(c)
d = str(d)
ans = a + "-" + b + "+" + c + "+" + d + "=7"
elif a - b + c - d == 7:
a = str(a)
b = str(b)
c = str(c)
d = str(d)
ans = a + "-" + b + "+" + c + "-" + d + "=7"
elif a - b - c + d == 7:
a = str(a)
b = str(b)
c = str(c)
d = str(d)
ans = a + "-" + b + "-" + c + "+" + d + "=7"
else:
a = str(a)
b = str(b)
c = str(c)
d = str(d)
ans = a + "-" + b + "-" + c + "-" + d + "=7"
print(ans)
| import itertools
abcd = eval(input())
memo = list(itertools.product(["+", "-"], repeat=3))
for i in range(2**3):
cnt = int(abcd[0])
for j in range(3):
if memo[i][j] == "+":
cnt += int(abcd[j + 1])
else:
cnt -= int(abcd[j + 1])
if cnt == 7:
print(
(
abcd[0]
+ memo[i][0]
+ abcd[1]
+ memo[i][1]
+ abcd[2]
+ memo[i][2]
+ abcd[3]
+ "=7"
)
)
break
| false | 55.882353 | [
"-import math",
"-import sys",
"+import itertools",
"-input = sys.stdin.readline",
"-abcd = int(eval(input()))",
"-for i in range(int(4 - math.log10(abcd))):",
"- abcd = \"0\" + str(abcd)",
"-a, b, c, d = str(abcd)",
"-a = int(a)",
"-b = int(b)",
"-c = int(c)",
"-d = int(d)",
"-if a + b + c + d == 7:",
"- a = str(a)",
"- b = str(b)",
"- c = str(c)",
"- d = str(d)",
"- ans = a + \"+\" + b + \"+\" + c + \"+\" + d + \"=7\"",
"-elif a + b + c - d == 7:",
"- a = str(a)",
"- b = str(b)",
"- c = str(c)",
"- d = str(d)",
"- ans = a + \"+\" + b + \"+\" + c + \"-\" + d + \"=7\"",
"-elif a + b - c - d == 7:",
"- a = str(a)",
"- b = str(b)",
"- c = str(c)",
"- d = str(d)",
"- ans = a + \"+\" + b + \"-\" + c + \"-\" + d + \"=7\"",
"-elif a + b - c + d == 7:",
"- a = str(a)",
"- b = str(b)",
"- c = str(c)",
"- d = str(d)",
"- ans = a + \"+\" + b + \"-\" + c + \"+\" + d + \"=7\"",
"-elif a - b + c + d == 7:",
"- a = str(a)",
"- b = str(b)",
"- c = str(c)",
"- d = str(d)",
"- ans = a + \"-\" + b + \"+\" + c + \"+\" + d + \"=7\"",
"-elif a - b + c - d == 7:",
"- a = str(a)",
"- b = str(b)",
"- c = str(c)",
"- d = str(d)",
"- ans = a + \"-\" + b + \"+\" + c + \"-\" + d + \"=7\"",
"-elif a - b - c + d == 7:",
"- a = str(a)",
"- b = str(b)",
"- c = str(c)",
"- d = str(d)",
"- ans = a + \"-\" + b + \"-\" + c + \"+\" + d + \"=7\"",
"-else:",
"- a = str(a)",
"- b = str(b)",
"- c = str(c)",
"- d = str(d)",
"- ans = a + \"-\" + b + \"-\" + c + \"-\" + d + \"=7\"",
"-print(ans)",
"+abcd = eval(input())",
"+memo = list(itertools.product([\"+\", \"-\"], repeat=3))",
"+for i in range(2**3):",
"+ cnt = int(abcd[0])",
"+ for j in range(3):",
"+ if memo[i][j] == \"+\":",
"+ cnt += int(abcd[j + 1])",
"+ else:",
"+ cnt -= int(abcd[j + 1])",
"+ if cnt == 7:",
"+ print(",
"+ (",
"+ abcd[0]",
"+ + memo[i][0]",
"+ + abcd[1]",
"+ + memo[i][1]",
"+ + abcd[2]",
"+ + memo[i][2]",
"+ + abcd[3]",
"+ + \"=7\"",
"+ )",
"+ )",
"+ break"
] | false | 0.077576 | 0.079209 | 0.979383 | [
"s709485465",
"s421022057"
] |
u606045429 | p02936 | python | s374071589 | s969182266 | 1,421 | 886 | 269,708 | 96,524 | Accepted | Accepted | 37.65 | import sys
sys.setrecursionlimit(2 * 10 ** 5 + 10)
N, Q, *ABPX = list(map(int, open(0).read().split()))
AB, PX = ABPX[:2 * (N - 1)], ABPX[2 * (N - 1):]
E = [[] for _ in range(N + 1)]
for a, b in zip(*[iter(AB)] * 2):
E[a].append(b)
E[b].append(a)
C = [0] * (N + 1)
for p, x in zip(*[iter(PX)] * 2):
C[p] += x
ans = [0] * (N + 1)
def dfs(v, p, acc):
ans[v] = acc + C[v]
for c in E[v]:
if p != c:
dfs(c, v, acc + C[v])
dfs(1, 0, 0)
print((*ans[1:])) | from collections import deque
N, Q, *ABPX = list(map(int, open(0).read().split()))
AB, PX = ABPX[:2 * (N - 1)], ABPX[2 * (N - 1):]
E = [[] for _ in range(N + 1)]
for a, b in zip(*[iter(AB)] * 2):
E[a].append(b)
E[b].append(a)
C = [0] * (N + 1)
for p, x in zip(*[iter(PX)] * 2):
C[p] += x
ans = [0] * (N + 1)
visited = [False] * (N + 1)
Q = deque([(1, 0)])
while Q:
v, c = Q.popleft()
visited[v] = True
ans[v] = c + C[v]
for u in E[v]:
if visited[u]:
continue
Q.append((u, c + C[v]))
print((*ans[1:])) | 26 | 30 | 511 | 585 | import sys
sys.setrecursionlimit(2 * 10**5 + 10)
N, Q, *ABPX = list(map(int, open(0).read().split()))
AB, PX = ABPX[: 2 * (N - 1)], ABPX[2 * (N - 1) :]
E = [[] for _ in range(N + 1)]
for a, b in zip(*[iter(AB)] * 2):
E[a].append(b)
E[b].append(a)
C = [0] * (N + 1)
for p, x in zip(*[iter(PX)] * 2):
C[p] += x
ans = [0] * (N + 1)
def dfs(v, p, acc):
ans[v] = acc + C[v]
for c in E[v]:
if p != c:
dfs(c, v, acc + C[v])
dfs(1, 0, 0)
print((*ans[1:]))
| from collections import deque
N, Q, *ABPX = list(map(int, open(0).read().split()))
AB, PX = ABPX[: 2 * (N - 1)], ABPX[2 * (N - 1) :]
E = [[] for _ in range(N + 1)]
for a, b in zip(*[iter(AB)] * 2):
E[a].append(b)
E[b].append(a)
C = [0] * (N + 1)
for p, x in zip(*[iter(PX)] * 2):
C[p] += x
ans = [0] * (N + 1)
visited = [False] * (N + 1)
Q = deque([(1, 0)])
while Q:
v, c = Q.popleft()
visited[v] = True
ans[v] = c + C[v]
for u in E[v]:
if visited[u]:
continue
Q.append((u, c + C[v]))
print((*ans[1:]))
| false | 13.333333 | [
"-import sys",
"+from collections import deque",
"-sys.setrecursionlimit(2 * 10**5 + 10)",
"-",
"-",
"-def dfs(v, p, acc):",
"- ans[v] = acc + C[v]",
"- for c in E[v]:",
"- if p != c:",
"- dfs(c, v, acc + C[v])",
"-",
"-",
"-dfs(1, 0, 0)",
"+visited = [False] * (N + 1)",
"+Q = deque([(1, 0)])",
"+while Q:",
"+ v, c = Q.popleft()",
"+ visited[v] = True",
"+ ans[v] = c + C[v]",
"+ for u in E[v]:",
"+ if visited[u]:",
"+ continue",
"+ Q.append((u, c + C[v]))"
] | false | 0.039935 | 0.043274 | 0.922843 | [
"s374071589",
"s969182266"
] |
u077291787 | p03103 | python | s975630727 | s862885250 | 321 | 194 | 27,812 | 25,828 | Accepted | Accepted | 39.56 | # ABC121C - Energy Drink Collector
import sys
input = sys.stdin.readline
def main():
n, m = list(map(int, input().rstrip().split()))
lst = sorted(list(map(int, input().split())) for _ in range(n))
ans = 0
for i in lst:
while i[1] > 0 and m > 0:
ans += i[0]
i[1] -= 1
m -= 1
print(ans)
if __name__ == "__main__":
main() | # ABC121C - Energy Drink Collector
def main():
N, M, *AB = list(map(int, open(0).read().split()))
AB = list(zip(*[iter(AB)] * 2))
AB.sort()
ans = 0
for a, b in AB:
while b > 0 and M > 0:
ans += a
b -= 1
M -= 1
print(ans)
if __name__ == "__main__":
main()
| 18 | 16 | 406 | 338 | # ABC121C - Energy Drink Collector
import sys
input = sys.stdin.readline
def main():
n, m = list(map(int, input().rstrip().split()))
lst = sorted(list(map(int, input().split())) for _ in range(n))
ans = 0
for i in lst:
while i[1] > 0 and m > 0:
ans += i[0]
i[1] -= 1
m -= 1
print(ans)
if __name__ == "__main__":
main()
| # ABC121C - Energy Drink Collector
def main():
N, M, *AB = list(map(int, open(0).read().split()))
AB = list(zip(*[iter(AB)] * 2))
AB.sort()
ans = 0
for a, b in AB:
while b > 0 and M > 0:
ans += a
b -= 1
M -= 1
print(ans)
if __name__ == "__main__":
main()
| false | 11.111111 | [
"-import sys",
"-",
"-input = sys.stdin.readline",
"-",
"-",
"- n, m = list(map(int, input().rstrip().split()))",
"- lst = sorted(list(map(int, input().split())) for _ in range(n))",
"+ N, M, *AB = list(map(int, open(0).read().split()))",
"+ AB = list(zip(*[iter(AB)] * 2))",
"+ AB.sort()",
"- for i in lst:",
"- while i[1] > 0 and m > 0:",
"- ans += i[0]",
"- i[1] -= 1",
"- m -= 1",
"+ for a, b in AB:",
"+ while b > 0 and M > 0:",
"+ ans += a",
"+ b -= 1",
"+ M -= 1"
] | false | 0.053421 | 0.045981 | 1.161806 | [
"s975630727",
"s862885250"
] |
u197300260 | p03644 | python | s451942994 | s256935123 | 20 | 17 | 3,188 | 3,064 | Accepted | Accepted | 15 | # _*_ coding:utf-8 _*_
# Atcoder_Beginners_Contest068-B
# https://beta.atcoder.jp/contests/abc068/tasks/abc068_b
def breakNumber(pint):
numArray = [i for i in range(1,pint+1)]
i = 0
while i < pint :
devCount=0
while numArray[i] % 2 == 0:
devCount = devCount+1
numArray[i] = numArray[i] // 2
numArray[i] = devCount
i=i+1
maxDevLabel = -1
maxDevNumber = -1
i = 0
while i < pint :
if maxDevNumber < numArray[i] :
maxDevNumber = numArray[i]
maxDevLabel = i
i = i + 1
answer = maxDevLabel+1
return answer
if __name__ == '__main__':
inputNum = int(eval(input()))
ans=breakNumber(inputNum)
print(ans)
| # Problem https://atcoder.jp/contests/abc068/tasks/abc068_b
# Python 1st Try
def solver(givenNum):
answer = 1
counter = 0
rangeNum = list(range(0, givenNum))
eachCount = [0] * givenNum
for j in rangeNum:
oneCount = 0
nowNumber = j + 1
while True:
if nowNumber % 2 == 0:
oneCount = oneCount + 1
nowNumber = nowNumber / 2
else:
break
eachCount[j] = oneCount
# print(eachCount)
for j in rangeNum:
if counter <= eachCount[j]:
counter = eachCount[j]
answer = j + 1
return answer
if __name__ == "__main__":
print((solver(int(eval(input())))))
| 36 | 30 | 670 | 728 | # _*_ coding:utf-8 _*_
# Atcoder_Beginners_Contest068-B
# https://beta.atcoder.jp/contests/abc068/tasks/abc068_b
def breakNumber(pint):
numArray = [i for i in range(1, pint + 1)]
i = 0
while i < pint:
devCount = 0
while numArray[i] % 2 == 0:
devCount = devCount + 1
numArray[i] = numArray[i] // 2
numArray[i] = devCount
i = i + 1
maxDevLabel = -1
maxDevNumber = -1
i = 0
while i < pint:
if maxDevNumber < numArray[i]:
maxDevNumber = numArray[i]
maxDevLabel = i
i = i + 1
answer = maxDevLabel + 1
return answer
if __name__ == "__main__":
inputNum = int(eval(input()))
ans = breakNumber(inputNum)
print(ans)
| # Problem https://atcoder.jp/contests/abc068/tasks/abc068_b
# Python 1st Try
def solver(givenNum):
answer = 1
counter = 0
rangeNum = list(range(0, givenNum))
eachCount = [0] * givenNum
for j in rangeNum:
oneCount = 0
nowNumber = j + 1
while True:
if nowNumber % 2 == 0:
oneCount = oneCount + 1
nowNumber = nowNumber / 2
else:
break
eachCount[j] = oneCount
# print(eachCount)
for j in rangeNum:
if counter <= eachCount[j]:
counter = eachCount[j]
answer = j + 1
return answer
if __name__ == "__main__":
print((solver(int(eval(input())))))
| false | 16.666667 | [
"-# _*_ coding:utf-8 _*_",
"-# Atcoder_Beginners_Contest068-B",
"-# https://beta.atcoder.jp/contests/abc068/tasks/abc068_b",
"-def breakNumber(pint):",
"- numArray = [i for i in range(1, pint + 1)]",
"- i = 0",
"- while i < pint:",
"- devCount = 0",
"- while numArray[i] % 2 == 0:",
"- devCount = devCount + 1",
"- numArray[i] = numArray[i] // 2",
"- numArray[i] = devCount",
"- i = i + 1",
"- maxDevLabel = -1",
"- maxDevNumber = -1",
"- i = 0",
"- while i < pint:",
"- if maxDevNumber < numArray[i]:",
"- maxDevNumber = numArray[i]",
"- maxDevLabel = i",
"- i = i + 1",
"- answer = maxDevLabel + 1",
"+# Problem https://atcoder.jp/contests/abc068/tasks/abc068_b",
"+# Python 1st Try",
"+def solver(givenNum):",
"+ answer = 1",
"+ counter = 0",
"+ rangeNum = list(range(0, givenNum))",
"+ eachCount = [0] * givenNum",
"+ for j in rangeNum:",
"+ oneCount = 0",
"+ nowNumber = j + 1",
"+ while True:",
"+ if nowNumber % 2 == 0:",
"+ oneCount = oneCount + 1",
"+ nowNumber = nowNumber / 2",
"+ else:",
"+ break",
"+ eachCount[j] = oneCount",
"+ # print(eachCount)",
"+ for j in rangeNum:",
"+ if counter <= eachCount[j]:",
"+ counter = eachCount[j]",
"+ answer = j + 1",
"- inputNum = int(eval(input()))",
"- ans = breakNumber(inputNum)",
"- print(ans)",
"+ print((solver(int(eval(input())))))"
] | false | 0.051404 | 0.055125 | 0.932505 | [
"s451942994",
"s256935123"
] |
u037430802 | p02803 | python | s630378521 | s064765175 | 1,763 | 292 | 133,636 | 48,220 | Accepted | Accepted | 83.44 | import sys
sys.setrecursionlimit(10**6)
def main():
H,W = list(map(int, input().split()))
S = ["" for _ in range(H)]
for i in range(H):
S[i] = eval(input())
INF = float("inf")
N = H*W
dp = [[INF for _ in range(N)] for _ in range(N)]
for i in range(H):
for j in range(W):
if j != W-1 and S[i][j] == "." and S[i][j+1] == ".":
dp[(W*i)+j][(W*i)+j+1] = 1
dp[(W*i)+j+1][(W*i)+j] = 1
if i != H-1 and S[i][j] == "." and S[i+1][j] == ".":
dp[(W*i)+j][(W*(i+1))+j] = 1
dp[(W*(i+1))+j][(W*i)+j] = 1
dp[(W*i)+j][(W*i)+j] = 0
N = H*W
for k in range(N):
for i in range(N):
for j in range(N):
dp[i][j] = min(dp[i][j], dp[i][k] + dp[k][j])
ans = 0
for i in range(N):
for j in range(N):
if dp[i][j] != INF:
ans = max(ans, dp[i][j])
print(ans)
if __name__ == "__main__":
main() | from collections import deque
H,W = list(map(int, input().split()))
S = [eval(input()) for _ in range(H)]
ans = 0
dyx = [(1,0), (0,1),(-1,0), (0,-1)]
for i in range(H):
for j in range(W):
if S[i][j] == "#": continue
dist = [[0 for _ in range(W)] for _ in range(H)]
visited = [[False for _ in range(W)] for _ in range(H)]
visited[i][j] = True
q = deque()
q.append((i,j))
while q:
y,x = q.popleft()
for dy,dx in dyx:
ny, nx = y+dy, x+dx
if not 0 <= ny <= H-1 or not 0 <= nx <= W-1 or visited[ny][nx] == True or S[ny][nx] == "#":
continue
q.append((ny, nx))
dist[ny][nx] = dist[y][x] + 1
visited[ny][nx] = True
ans = max(ans, max(max(row) for row in dist))
print(ans) | 45 | 34 | 1,069 | 900 | import sys
sys.setrecursionlimit(10**6)
def main():
H, W = list(map(int, input().split()))
S = ["" for _ in range(H)]
for i in range(H):
S[i] = eval(input())
INF = float("inf")
N = H * W
dp = [[INF for _ in range(N)] for _ in range(N)]
for i in range(H):
for j in range(W):
if j != W - 1 and S[i][j] == "." and S[i][j + 1] == ".":
dp[(W * i) + j][(W * i) + j + 1] = 1
dp[(W * i) + j + 1][(W * i) + j] = 1
if i != H - 1 and S[i][j] == "." and S[i + 1][j] == ".":
dp[(W * i) + j][(W * (i + 1)) + j] = 1
dp[(W * (i + 1)) + j][(W * i) + j] = 1
dp[(W * i) + j][(W * i) + j] = 0
N = H * W
for k in range(N):
for i in range(N):
for j in range(N):
dp[i][j] = min(dp[i][j], dp[i][k] + dp[k][j])
ans = 0
for i in range(N):
for j in range(N):
if dp[i][j] != INF:
ans = max(ans, dp[i][j])
print(ans)
if __name__ == "__main__":
main()
| from collections import deque
H, W = list(map(int, input().split()))
S = [eval(input()) for _ in range(H)]
ans = 0
dyx = [(1, 0), (0, 1), (-1, 0), (0, -1)]
for i in range(H):
for j in range(W):
if S[i][j] == "#":
continue
dist = [[0 for _ in range(W)] for _ in range(H)]
visited = [[False for _ in range(W)] for _ in range(H)]
visited[i][j] = True
q = deque()
q.append((i, j))
while q:
y, x = q.popleft()
for dy, dx in dyx:
ny, nx = y + dy, x + dx
if (
not 0 <= ny <= H - 1
or not 0 <= nx <= W - 1
or visited[ny][nx] == True
or S[ny][nx] == "#"
):
continue
q.append((ny, nx))
dist[ny][nx] = dist[y][x] + 1
visited[ny][nx] = True
ans = max(ans, max(max(row) for row in dist))
print(ans)
| false | 24.444444 | [
"-import sys",
"+from collections import deque",
"-sys.setrecursionlimit(10**6)",
"-",
"-",
"-def main():",
"- H, W = list(map(int, input().split()))",
"- S = [\"\" for _ in range(H)]",
"- for i in range(H):",
"- S[i] = eval(input())",
"- INF = float(\"inf\")",
"- N = H * W",
"- dp = [[INF for _ in range(N)] for _ in range(N)]",
"- for i in range(H):",
"- for j in range(W):",
"- if j != W - 1 and S[i][j] == \".\" and S[i][j + 1] == \".\":",
"- dp[(W * i) + j][(W * i) + j + 1] = 1",
"- dp[(W * i) + j + 1][(W * i) + j] = 1",
"- if i != H - 1 and S[i][j] == \".\" and S[i + 1][j] == \".\":",
"- dp[(W * i) + j][(W * (i + 1)) + j] = 1",
"- dp[(W * (i + 1)) + j][(W * i) + j] = 1",
"- dp[(W * i) + j][(W * i) + j] = 0",
"- N = H * W",
"- for k in range(N):",
"- for i in range(N):",
"- for j in range(N):",
"- dp[i][j] = min(dp[i][j], dp[i][k] + dp[k][j])",
"- ans = 0",
"- for i in range(N):",
"- for j in range(N):",
"- if dp[i][j] != INF:",
"- ans = max(ans, dp[i][j])",
"- print(ans)",
"-",
"-",
"-if __name__ == \"__main__\":",
"- main()",
"+H, W = list(map(int, input().split()))",
"+S = [eval(input()) for _ in range(H)]",
"+ans = 0",
"+dyx = [(1, 0), (0, 1), (-1, 0), (0, -1)]",
"+for i in range(H):",
"+ for j in range(W):",
"+ if S[i][j] == \"#\":",
"+ continue",
"+ dist = [[0 for _ in range(W)] for _ in range(H)]",
"+ visited = [[False for _ in range(W)] for _ in range(H)]",
"+ visited[i][j] = True",
"+ q = deque()",
"+ q.append((i, j))",
"+ while q:",
"+ y, x = q.popleft()",
"+ for dy, dx in dyx:",
"+ ny, nx = y + dy, x + dx",
"+ if (",
"+ not 0 <= ny <= H - 1",
"+ or not 0 <= nx <= W - 1",
"+ or visited[ny][nx] == True",
"+ or S[ny][nx] == \"#\"",
"+ ):",
"+ continue",
"+ q.append((ny, nx))",
"+ dist[ny][nx] = dist[y][x] + 1",
"+ visited[ny][nx] = True",
"+ ans = max(ans, max(max(row) for row in dist))",
"+print(ans)"
] | false | 0.083092 | 0.077314 | 1.074738 | [
"s630378521",
"s064765175"
] |
u888092736 | p03575 | python | s294432245 | s951839879 | 47 | 33 | 9,680 | 9,136 | Accepted | Accepted | 29.79 | from collections import defaultdict
from copy import deepcopy
def dfs(graph, v, visited):
visited.add(v)
for nv in graph[v]:
if nv not in visited:
dfs(graph, nv, visited)
return visited
def is_connected(graph, nodes_cnt):
visited = dfs(graph, 1, set())
if len(visited) == nodes_cnt:
return True
else:
return False
N, M = list(map(int, input().split()))
edges = [list(map(int, input().split())) for _ in range(M)]
G = defaultdict(set)
for u, v in edges:
G[u].add(v)
G[v].add(u)
ans = 0
for u, v in edges:
H = deepcopy(G)
H[u] -= {v}
H[v] -= {u}
if not is_connected(H, N):
ans += 1
print(ans)
| class DisjointSet:
def __init__(self, n):
self.n = n
self.parents = [-1] * n
def find(self, x):
if self.parents[x] < 0:
return x
else:
self.parents[x] = self.find(self.parents[x])
return self.parents[x]
def union(self, x, y):
x = self.find(x)
y = self.find(y)
if x == y:
return
if self.parents[x] > self.parents[y]:
x, y = y, x
self.parents[x] += self.parents[y]
self.parents[y] = x
def same(self, x, y):
return self.find(x) == self.find(y)
def size(self, x):
return -self.parents[self.find(x)]
N, M, *ab = list(map(int, open(0).read().split()))
edges = [(a - 1, b - 1) for a, b in zip(*[iter(ab)] * 2)]
ans = 0
for i in range(M):
ds = DisjointSet(N)
for j in range(M):
if i == j:
continue
ds.union(*edges[j])
if len([-p for p in ds.parents if p < 0]) > 1:
ans += 1
print(ans)
| 34 | 42 | 716 | 1,043 | from collections import defaultdict
from copy import deepcopy
def dfs(graph, v, visited):
visited.add(v)
for nv in graph[v]:
if nv not in visited:
dfs(graph, nv, visited)
return visited
def is_connected(graph, nodes_cnt):
visited = dfs(graph, 1, set())
if len(visited) == nodes_cnt:
return True
else:
return False
N, M = list(map(int, input().split()))
edges = [list(map(int, input().split())) for _ in range(M)]
G = defaultdict(set)
for u, v in edges:
G[u].add(v)
G[v].add(u)
ans = 0
for u, v in edges:
H = deepcopy(G)
H[u] -= {v}
H[v] -= {u}
if not is_connected(H, N):
ans += 1
print(ans)
| class DisjointSet:
def __init__(self, n):
self.n = n
self.parents = [-1] * n
def find(self, x):
if self.parents[x] < 0:
return x
else:
self.parents[x] = self.find(self.parents[x])
return self.parents[x]
def union(self, x, y):
x = self.find(x)
y = self.find(y)
if x == y:
return
if self.parents[x] > self.parents[y]:
x, y = y, x
self.parents[x] += self.parents[y]
self.parents[y] = x
def same(self, x, y):
return self.find(x) == self.find(y)
def size(self, x):
return -self.parents[self.find(x)]
N, M, *ab = list(map(int, open(0).read().split()))
edges = [(a - 1, b - 1) for a, b in zip(*[iter(ab)] * 2)]
ans = 0
for i in range(M):
ds = DisjointSet(N)
for j in range(M):
if i == j:
continue
ds.union(*edges[j])
if len([-p for p in ds.parents if p < 0]) > 1:
ans += 1
print(ans)
| false | 19.047619 | [
"-from collections import defaultdict",
"-from copy import deepcopy",
"+class DisjointSet:",
"+ def __init__(self, n):",
"+ self.n = n",
"+ self.parents = [-1] * n",
"+",
"+ def find(self, x):",
"+ if self.parents[x] < 0:",
"+ return x",
"+ else:",
"+ self.parents[x] = self.find(self.parents[x])",
"+ return self.parents[x]",
"+",
"+ def union(self, x, y):",
"+ x = self.find(x)",
"+ y = self.find(y)",
"+ if x == y:",
"+ return",
"+ if self.parents[x] > self.parents[y]:",
"+ x, y = y, x",
"+ self.parents[x] += self.parents[y]",
"+ self.parents[y] = x",
"+",
"+ def same(self, x, y):",
"+ return self.find(x) == self.find(y)",
"+",
"+ def size(self, x):",
"+ return -self.parents[self.find(x)]",
"-def dfs(graph, v, visited):",
"- visited.add(v)",
"- for nv in graph[v]:",
"- if nv not in visited:",
"- dfs(graph, nv, visited)",
"- return visited",
"-",
"-",
"-def is_connected(graph, nodes_cnt):",
"- visited = dfs(graph, 1, set())",
"- if len(visited) == nodes_cnt:",
"- return True",
"- else:",
"- return False",
"-",
"-",
"-N, M = list(map(int, input().split()))",
"-edges = [list(map(int, input().split())) for _ in range(M)]",
"-G = defaultdict(set)",
"-for u, v in edges:",
"- G[u].add(v)",
"- G[v].add(u)",
"+N, M, *ab = list(map(int, open(0).read().split()))",
"+edges = [(a - 1, b - 1) for a, b in zip(*[iter(ab)] * 2)]",
"-for u, v in edges:",
"- H = deepcopy(G)",
"- H[u] -= {v}",
"- H[v] -= {u}",
"- if not is_connected(H, N):",
"+for i in range(M):",
"+ ds = DisjointSet(N)",
"+ for j in range(M):",
"+ if i == j:",
"+ continue",
"+ ds.union(*edges[j])",
"+ if len([-p for p in ds.parents if p < 0]) > 1:"
] | false | 0.039024 | 0.037078 | 1.052486 | [
"s294432245",
"s951839879"
] |
u001024152 | p02726 | python | s172586602 | s788767025 | 1,332 | 981 | 102,748 | 66,652 | Accepted | Accepted | 26.35 | import heapq
def dijkstra(start: int, edges: list):
"""print the shortet path O(|E|log|V|)
maybe verified
"""
dist = [float('inf') for _ in range(N)] # list dist[|V|]
dist[start] = 0
prev_v = [-1]*(len(dist)) # 最短経路でのひとつ前の頂点
q = [(0, start)] # （暫定的な距離，頂点）
while q:
d_cur, cur = heapq.heappop(q)
if dist[cur] < d_cur: # すでに探索済み
continue
for nex, cost in edges[cur]:
if dist[nex] > dist[cur]+cost:
dist[nex] = dist[cur]+cost
heapq.heappush(q, (dist[nex], nex))
prev_v[nex] = cur
return dist
# # 以下 path の復元
# path = []
# v = goal
# while v != -1:
# path.append(v)
# v = prev_v[v]
# path = path[::-1] # reverse
# print("Shortest path: ", path)
if __name__ == "__main__":
N, X, Y = map(int, input().split())
X, Y = X-1, Y-1
edges = [[] for _ in range(N)]
for i in range(1, N):
edges[i].append((i-1, 1))
for i in range(N-1):
edges[i].append((i+1, 1))
edges[X].append((Y, 1))
edges[Y].append((X, 1))
# print(edges)
cnt = [0]*N
for i in range(N):
d = dijkstra(i, edges)
for di in d:
cnt[di] += 1
cnt = [ci//2 for ci in cnt]
print(*cnt[1:], sep="\n")
| from collections import deque
def dijkstra(start: int, edges: list):
"""print the shortet path O(|E|log|V|)
maybe verified
"""
dist = [float('inf') for _ in range(N)] # list dist[|V|]
dist[start] = 0
prev_v = [-1]*(len(dist)) # 最短経路でのひとつ前の頂点
q = deque([(0, start)]) # （暫定的な距離，頂点）
while q:
d_cur, cur = q.pop()
if dist[cur] < d_cur: # すでに探索済み
continue
for nex, cost in edges[cur]:
if dist[nex] > dist[cur]+cost:
dist[nex] = dist[cur]+cost
q.append((dist[nex], nex))
prev_v[nex] = cur
return dist
# # 以下 path の復元
# path = []
# v = goal
# while v != -1:
# path.append(v)
# v = prev_v[v]
# path = path[::-1] # reverse
# print("Shortest path: ", path)
if __name__ == "__main__":
N, X, Y = map(int, input().split())
X, Y = X-1, Y-1
edges = [[] for _ in range(N)]
for i in range(1, N):
edges[i].append((i-1, 1))
for i in range(N-1):
edges[i].append((i+1, 1))
edges[X].append((Y, 1))
edges[Y].append((X, 1))
# print(edges)
cnt = [0]*N
for i in range(N):
d = dijkstra(i, edges)
for di in d:
cnt[di] += 1
cnt = [ci//2 for ci in cnt]
print(*cnt[1:], sep="\n")
| 51 | 51 | 1,369 | 1,375 | import heapq
def dijkstra(start: int, edges: list):
"""print the shortet path O(|E|log|V|)
maybe verified
"""
dist = [float("inf") for _ in range(N)] # list dist[|V|]
dist[start] = 0
prev_v = [-1] * (len(dist)) # 最短経路でのひとつ前の頂点
q = [(0, start)] # （暫定的な距離，頂点）
while q:
d_cur, cur = heapq.heappop(q)
if dist[cur] < d_cur: # すでに探索済み
continue
for nex, cost in edges[cur]:
if dist[nex] > dist[cur] + cost:
dist[nex] = dist[cur] + cost
heapq.heappush(q, (dist[nex], nex))
prev_v[nex] = cur
return dist
# # 以下 path の復元
# path = []
# v = goal
# while v != -1:
# path.append(v)
# v = prev_v[v]
# path = path[::-1] # reverse
# print("Shortest path: ", path)
if __name__ == "__main__":
N, X, Y = map(int, input().split())
X, Y = X - 1, Y - 1
edges = [[] for _ in range(N)]
for i in range(1, N):
edges[i].append((i - 1, 1))
for i in range(N - 1):
edges[i].append((i + 1, 1))
edges[X].append((Y, 1))
edges[Y].append((X, 1))
# print(edges)
cnt = [0] * N
for i in range(N):
d = dijkstra(i, edges)
for di in d:
cnt[di] += 1
cnt = [ci // 2 for ci in cnt]
print(*cnt[1:], sep="\n")
| from collections import deque
def dijkstra(start: int, edges: list):
"""print the shortet path O(|E|log|V|)
maybe verified
"""
dist = [float("inf") for _ in range(N)] # list dist[|V|]
dist[start] = 0
prev_v = [-1] * (len(dist)) # 最短経路でのひとつ前の頂点
q = deque([(0, start)]) # （暫定的な距離，頂点）
while q:
d_cur, cur = q.pop()
if dist[cur] < d_cur: # すでに探索済み
continue
for nex, cost in edges[cur]:
if dist[nex] > dist[cur] + cost:
dist[nex] = dist[cur] + cost
q.append((dist[nex], nex))
prev_v[nex] = cur
return dist
# # 以下 path の復元
# path = []
# v = goal
# while v != -1:
# path.append(v)
# v = prev_v[v]
# path = path[::-1] # reverse
# print("Shortest path: ", path)
if __name__ == "__main__":
N, X, Y = map(int, input().split())
X, Y = X - 1, Y - 1
edges = [[] for _ in range(N)]
for i in range(1, N):
edges[i].append((i - 1, 1))
for i in range(N - 1):
edges[i].append((i + 1, 1))
edges[X].append((Y, 1))
edges[Y].append((X, 1))
# print(edges)
cnt = [0] * N
for i in range(N):
d = dijkstra(i, edges)
for di in d:
cnt[di] += 1
cnt = [ci // 2 for ci in cnt]
print(*cnt[1:], sep="\n")
| false | 0 | [
"-import heapq",
"+from collections import deque",
"- q = [(0, start)] # （暫定的な距離，頂点）",
"+ q = deque([(0, start)]) # （暫定的な距離，頂点）",
"- d_cur, cur = heapq.heappop(q)",
"+ d_cur, cur = q.pop()",
"- heapq.heappush(q, (dist[nex], nex))",
"+ q.append((dist[nex], nex))"
] | false | 0.052241 | 0.03731 | 1.400182 | [
"s172586602",
"s788767025"
] |
u785578220 | p02803 | python | s649962717 | s509926018 | 487 | 339 | 3,316 | 3,316 | Accepted | Accepted | 30.39 | from collections import deque
'''
INF = float('inf')
MOD = 10 ** 9 + 7
'''
## ここは１つにまとめれる
# dy = (0, -1, 0, 1)
# dx = (1, 0, -1, 0)
d=[(1,0),(0,1),(-1,0),(0,-1)]
H,W=list(map(int,input().split()))
M = []
Max_list = []
for i in range(H):
t = eval(input())
M.append(t)
dist = [[-1]*W for _ in range(H)]
q = deque()
for i in range(H):
for j in range(W):
dist = [[-1]*W for _ in range(H)]
if M[i][j] == '.':
Ma = 0
q.append((i, j))
dist[i][j] = 0
while q:
cx,cy = q.popleft()
for nx,ny in d:
x ,y= cx+nx,cy+ny
''' ここの処理がをnotにしてわかりやすく
if x<0 or y<0 or x>=H or y>=W or dist[x][y]>0:
continue
'''
'''
if 0<= x < H and 0<= y < W and dist[x][y]<=0:
'''
if 0<= x < H and 0<= y < W and M[x][y] == "." and dist[x][y]==-1:
dist[x][y]=dist[cx][cy]+1
Ma = max(Ma,dist[x][y])
q.append((x,y))
Max_list.append(Ma)
print((max(Max_list))) | from collections import deque
d=[(1,0),(0,1),(-1,0),(0,-1)]
H,W=list(map(int,input().split()))
M = []
Max_list = []
for i in range(H):
t = eval(input())
M.append(t)
dist = [[-1]*W for _ in range(H)]
def BFS(i,j):
q = deque()
dist = [[-1]*W for _ in range(H)]
if M[i][j] == '.':
#前処理
Ma = 0
q.append((i, j))#スタート地点挿入
dist[i][j] = 0
while q:
cx,cy = q.popleft()
for nx,ny in d:
x ,y= cx+nx,cy+ny
if 0<= x < H and 0<= y < W and M[x][y] == "." and dist[x][y]==-1:
dist[x][y]=dist[cx][cy]+1
Ma = max(Ma,dist[x][y])
q.append((x,y))
return Ma
return 0
for i in range(H):#全部の地点でBFSをためす
for j in range(W):
Max_list.append(BFS(i,j))
print((max(Max_list)))
| 44 | 34 | 1,232 | 869 | from collections import deque
"""
INF = float('inf')
MOD = 10 ** 9 + 7
"""
## ここは１つにまとめれる
# dy = (0, -1, 0, 1)
# dx = (1, 0, -1, 0)
d = [(1, 0), (0, 1), (-1, 0), (0, -1)]
H, W = list(map(int, input().split()))
M = []
Max_list = []
for i in range(H):
t = eval(input())
M.append(t)
dist = [[-1] * W for _ in range(H)]
q = deque()
for i in range(H):
for j in range(W):
dist = [[-1] * W for _ in range(H)]
if M[i][j] == ".":
Ma = 0
q.append((i, j))
dist[i][j] = 0
while q:
cx, cy = q.popleft()
for nx, ny in d:
x, y = cx + nx, cy + ny
""" ここの処理がをnotにしてわかりやすく
if x<0 or y<0 or x>=H or y>=W or dist[x][y]>0:
continue
"""
"""
if 0<= x < H and 0<= y < W and dist[x][y]<=0:
"""
if (
0 <= x < H
and 0 <= y < W
and M[x][y] == "."
and dist[x][y] == -1
):
dist[x][y] = dist[cx][cy] + 1
Ma = max(Ma, dist[x][y])
q.append((x, y))
Max_list.append(Ma)
print((max(Max_list)))
| from collections import deque
d = [(1, 0), (0, 1), (-1, 0), (0, -1)]
H, W = list(map(int, input().split()))
M = []
Max_list = []
for i in range(H):
t = eval(input())
M.append(t)
dist = [[-1] * W for _ in range(H)]
def BFS(i, j):
q = deque()
dist = [[-1] * W for _ in range(H)]
if M[i][j] == ".":
# 前処理
Ma = 0
q.append((i, j)) # スタート地点挿入
dist[i][j] = 0
while q:
cx, cy = q.popleft()
for nx, ny in d:
x, y = cx + nx, cy + ny
if 0 <= x < H and 0 <= y < W and M[x][y] == "." and dist[x][y] == -1:
dist[x][y] = dist[cx][cy] + 1
Ma = max(Ma, dist[x][y])
q.append((x, y))
return Ma
return 0
for i in range(H): # 全部の地点でBFSをためす
for j in range(W):
Max_list.append(BFS(i, j))
print((max(Max_list)))
| false | 22.727273 | [
"-\"\"\"",
"-INF = float('inf')",
"-MOD = 10 ** 9 + 7",
"-\"\"\"",
"-## ここは１つにまとめれる",
"-# dy = (0, -1, 0, 1)",
"-# dx = (1, 0, -1, 0)",
"-q = deque()",
"-for i in range(H):",
"+",
"+",
"+def BFS(i, j):",
"+ q = deque()",
"+ dist = [[-1] * W for _ in range(H)]",
"+ if M[i][j] == \".\":",
"+ # 前処理",
"+ Ma = 0",
"+ q.append((i, j)) # スタート地点挿入",
"+ dist[i][j] = 0",
"+ while q:",
"+ cx, cy = q.popleft()",
"+ for nx, ny in d:",
"+ x, y = cx + nx, cy + ny",
"+ if 0 <= x < H and 0 <= y < W and M[x][y] == \".\" and dist[x][y] == -1:",
"+ dist[x][y] = dist[cx][cy] + 1",
"+ Ma = max(Ma, dist[x][y])",
"+ q.append((x, y))",
"+ return Ma",
"+ return 0",
"+",
"+",
"+for i in range(H): # 全部の地点でBFSをためす",
"- dist = [[-1] * W for _ in range(H)]",
"- if M[i][j] == \".\":",
"- Ma = 0",
"- q.append((i, j))",
"- dist[i][j] = 0",
"- while q:",
"- cx, cy = q.popleft()",
"- for nx, ny in d:",
"- x, y = cx + nx, cy + ny",
"- \"\"\" ここの処理がをnotにしてわかりやすく",
"- if x<0 or y<0 or x>=H or y>=W or dist[x][y]>0:",
"- continue",
"- \"\"\"",
"- \"\"\"",
"- if 0<= x < H and 0<= y < W and dist[x][y]<=0:",
"- \"\"\"",
"- if (",
"- 0 <= x < H",
"- and 0 <= y < W",
"- and M[x][y] == \".\"",
"- and dist[x][y] == -1",
"- ):",
"- dist[x][y] = dist[cx][cy] + 1",
"- Ma = max(Ma, dist[x][y])",
"- q.append((x, y))",
"- Max_list.append(Ma)",
"+ Max_list.append(BFS(i, j))"
] | false | 0.046408 | 0.047514 | 0.976714 | [
"s649962717",
"s509926018"
] |
u531482846 | p00002 | python | s140324145 | s143860167 | 50 | 20 | 7,708 | 7,708 | Accepted | Accepted | 60 | import sys
for line in sys.stdin:
x, y = list(map(int, line.split()))
print((len(str(x+y)))) | import sys
[print(len(str(sum(map(int, line.split()))))) for line in sys.stdin]
| 5 | 2 | 93 | 80 | import sys
for line in sys.stdin:
x, y = list(map(int, line.split()))
print((len(str(x + y))))
| import sys
[print(len(str(sum(map(int, line.split()))))) for line in sys.stdin]
| false | 60 | [
"-for line in sys.stdin:",
"- x, y = list(map(int, line.split()))",
"- print((len(str(x + y))))",
"+[print(len(str(sum(map(int, line.split()))))) for line in sys.stdin]"
] | false | 0.04507 | 0.045185 | 0.997458 | [
"s140324145",
"s143860167"
] |
u477977638 | p02823 | python | s074133007 | s423016074 | 167 | 31 | 38,384 | 9,276 | Accepted | Accepted | 81.44 | import sys
read = sys.stdin.buffer.read
input = sys.stdin.buffer.readline
inputs = sys.stdin.buffer.readlines
# mod=10**9+7
# rstrip().decode('utf-8')
# map(int,input().split())
#import numpy as np
def main():
n,a,b=list(map(int,input().split()))
if (b-a)%2==0:
print(((b-a)//2))
else:
ma=max(a,b)
mi=min(a,b)
ko1=min(n-mi,ma-1)
ko2=n-ma+1+(n-(mi+(n-ma+1)))//2
ko3=mi-1+1+((ma-(mi-1+1))-1)//2
print((min(ko1,ko2,ko3)))
if __name__ == "__main__":
main()
| import sys
input = sys.stdin.buffer.readline
#sys.setrecursionlimit(10**9)
#from functools import lru_cache
def RD(): return input().rstrip().decode()
def II(): return int(eval(input()))
def FI(): return int(eval(input()))
def MI(): return list(map(int,input().split()))
def MF(): return list(map(float,input().split()))
def LI(): return list(map(int,input().split()))
def LF(): return list(map(float,input().split()))
def TI(): return tuple(map(int,input().split()))
# rstrip().decode()
import bisect
def main():
n,a,b=MI()
if abs(b-a)%2==0:
ans=abs(b-a)//2
else:
if b<a:
a,b=b,a
ans=min(a-1,n-b)+1+(b-a-1)//2
print(ans)
if __name__ == "__main__":
main()
| 37 | 49 | 529 | 718 | import sys
read = sys.stdin.buffer.read
input = sys.stdin.buffer.readline
inputs = sys.stdin.buffer.readlines
# mod=10**9+7
# rstrip().decode('utf-8')
# map(int,input().split())
# import numpy as np
def main():
n, a, b = list(map(int, input().split()))
if (b - a) % 2 == 0:
print(((b - a) // 2))
else:
ma = max(a, b)
mi = min(a, b)
ko1 = min(n - mi, ma - 1)
ko2 = n - ma + 1 + (n - (mi + (n - ma + 1))) // 2
ko3 = mi - 1 + 1 + ((ma - (mi - 1 + 1)) - 1) // 2
print((min(ko1, ko2, ko3)))
if __name__ == "__main__":
main()
| import sys
input = sys.stdin.buffer.readline
# sys.setrecursionlimit(10**9)
# from functools import lru_cache
def RD():
return input().rstrip().decode()
def II():
return int(eval(input()))
def FI():
return int(eval(input()))
def MI():
return list(map(int, input().split()))
def MF():
return list(map(float, input().split()))
def LI():
return list(map(int, input().split()))
def LF():
return list(map(float, input().split()))
def TI():
return tuple(map(int, input().split()))
# rstrip().decode()
import bisect
def main():
n, a, b = MI()
if abs(b - a) % 2 == 0:
ans = abs(b - a) // 2
else:
if b < a:
a, b = b, a
ans = min(a - 1, n - b) + 1 + (b - a - 1) // 2
print(ans)
if __name__ == "__main__":
main()
| false | 24.489796 | [
"-read = sys.stdin.buffer.read",
"-inputs = sys.stdin.buffer.readlines",
"-# mod=10**9+7",
"-# rstrip().decode('utf-8')",
"-# map(int,input().split())",
"-# import numpy as np",
"+# sys.setrecursionlimit(10**9)",
"+# from functools import lru_cache",
"+def RD():",
"+ return input().rstrip().decode()",
"+",
"+",
"+def II():",
"+ return int(eval(input()))",
"+",
"+",
"+def FI():",
"+ return int(eval(input()))",
"+",
"+",
"+def MI():",
"+ return list(map(int, input().split()))",
"+",
"+",
"+def MF():",
"+ return list(map(float, input().split()))",
"+",
"+",
"+def LI():",
"+ return list(map(int, input().split()))",
"+",
"+",
"+def LF():",
"+ return list(map(float, input().split()))",
"+",
"+",
"+def TI():",
"+ return tuple(map(int, input().split()))",
"+",
"+",
"+# rstrip().decode()",
"+import bisect",
"+",
"+",
"- n, a, b = list(map(int, input().split()))",
"- if (b - a) % 2 == 0:",
"- print(((b - a) // 2))",
"+ n, a, b = MI()",
"+ if abs(b - a) % 2 == 0:",
"+ ans = abs(b - a) // 2",
"- ma = max(a, b)",
"- mi = min(a, b)",
"- ko1 = min(n - mi, ma - 1)",
"- ko2 = n - ma + 1 + (n - (mi + (n - ma + 1))) // 2",
"- ko3 = mi - 1 + 1 + ((ma - (mi - 1 + 1)) - 1) // 2",
"- print((min(ko1, ko2, ko3)))",
"+ if b < a:",
"+ a, b = b, a",
"+ ans = min(a - 1, n - b) + 1 + (b - a - 1) // 2",
"+ print(ans)"
] | false | 0.045848 | 0.046143 | 0.993599 | [
"s074133007",
"s423016074"
] |
u753803401 | p03363 | python | s334660060 | s434719768 | 383 | 318 | 110,160 | 110,160 | Accepted | Accepted | 16.97 | def slove():
import sys
import collections
input = sys.stdin.readline
n = int(input().rstrip('\n'))
a = list(map(int, input().rstrip('\n').split()))
t = 0
tl = [0]
for v in a:
t += v
tl.append(t)
tl = collections.Counter(tl)
s = 0
for k, v in list(tl.items()):
s += (v * (v - 1) // 2)
print(s)
if __name__ == '__main__':
slove()
| def slove():
import sys
import collections
input = sys.stdin.readline
n = int(input().rstrip('\n'))
a = list(map(int, input().rstrip('\n').split()))
ans = [0]
t = 0
for i in range(n):
t += a[i]
ans.append(t)
ans = collections.Counter(ans)
t = 0
for k, v in list(ans.items()):
t += (v * (v - 1) // 2)
print(t)
if __name__ == '__main__':
slove()
| 20 | 20 | 420 | 435 | def slove():
import sys
import collections
input = sys.stdin.readline
n = int(input().rstrip("\n"))
a = list(map(int, input().rstrip("\n").split()))
t = 0
tl = [0]
for v in a:
t += v
tl.append(t)
tl = collections.Counter(tl)
s = 0
for k, v in list(tl.items()):
s += v * (v - 1) // 2
print(s)
if __name__ == "__main__":
slove()
| def slove():
import sys
import collections
input = sys.stdin.readline
n = int(input().rstrip("\n"))
a = list(map(int, input().rstrip("\n").split()))
ans = [0]
t = 0
for i in range(n):
t += a[i]
ans.append(t)
ans = collections.Counter(ans)
t = 0
for k, v in list(ans.items()):
t += v * (v - 1) // 2
print(t)
if __name__ == "__main__":
slove()
| false | 0 | [
"+ ans = [0]",
"- tl = [0]",
"- for v in a:",
"- t += v",
"- tl.append(t)",
"- tl = collections.Counter(tl)",
"- s = 0",
"- for k, v in list(tl.items()):",
"- s += v * (v - 1) // 2",
"- print(s)",
"+ for i in range(n):",
"+ t += a[i]",
"+ ans.append(t)",
"+ ans = collections.Counter(ans)",
"+ t = 0",
"+ for k, v in list(ans.items()):",
"+ t += v * (v - 1) // 2",
"+ print(t)"
] | false | 0.086829 | 0.036393 | 2.385882 | [
"s334660060",
"s434719768"
] |
u818349438 | p02744 | python | s230564076 | s756538111 | 267 | 153 | 62,300 | 4,340 | Accepted | Accepted | 42.7 | n = int(eval(input()))
strings = [[] for _ in range(n)]
for i in range(n):
if not i:
strings[i].append("a")
continue
for s in strings[i-1]:
for j in range(ord("a"),ord(max(s))+2):
c = chr(j)
strings[i].append(s+c)
print((*strings[-1]))
| import sys
sys.setrecursionlimit(10**6)#再帰を使うときはこれをする（今回はN=10で深さ110000程度なので10**6)
def dfs(s,mx):
if len(s) == n:
print(s)
return
for i in range(ord("a"),ord(mx)+1):
c = chr(i)
if c == mx:dfs(s+c,chr(ord(mx)+1))#aから一番遠いアルファベットを語尾につけたら、その次までok
else:dfs(s+c,mx)
n = int(eval(input()))
dfs("","a")
| 12 | 12 | 303 | 347 | n = int(eval(input()))
strings = [[] for _ in range(n)]
for i in range(n):
if not i:
strings[i].append("a")
continue
for s in strings[i - 1]:
for j in range(ord("a"), ord(max(s)) + 2):
c = chr(j)
strings[i].append(s + c)
print((*strings[-1]))
| import sys
sys.setrecursionlimit(10**6) # 再帰を使うときはこれをする（今回はN=10で深さ110000程度なので10**6)
def dfs(s, mx):
if len(s) == n:
print(s)
return
for i in range(ord("a"), ord(mx) + 1):
c = chr(i)
if c == mx:
dfs(s + c, chr(ord(mx) + 1)) # aから一番遠いアルファベットを語尾につけたら、その次までok
else:
dfs(s + c, mx)
n = int(eval(input()))
dfs("", "a")
| false | 0 | [
"+import sys",
"+",
"+sys.setrecursionlimit(10**6) # 再帰を使うときはこれをする（今回はN=10で深さ110000程度なので10**6)",
"+",
"+",
"+def dfs(s, mx):",
"+ if len(s) == n:",
"+ print(s)",
"+ return",
"+ for i in range(ord(\"a\"), ord(mx) + 1):",
"+ c = chr(i)",
"+ if c == mx:",
"+ dfs(s + c, chr(ord(mx) + 1)) # aから一番遠いアルファベットを語尾につけたら、その次までok",
"+ else:",
"+ dfs(s + c, mx)",
"+",
"+",
"-strings = [[] for _ in range(n)]",
"-for i in range(n):",
"- if not i:",
"- strings[i].append(\"a\")",
"- continue",
"- for s in strings[i - 1]:",
"- for j in range(ord(\"a\"), ord(max(s)) + 2):",
"- c = chr(j)",
"- strings[i].append(s + c)",
"-print((*strings[-1]))",
"+dfs(\"\", \"a\")"
] | false | 0.054909 | 0.038126 | 1.440219 | [
"s230564076",
"s756538111"
] |
u131984977 | p02392 | python | s421725295 | s243982900 | 30 | 20 | 6,724 | 7,668 | Accepted | Accepted | 33.33 | (a, b, c) = input().rstrip().split()
a = int(a)
b = int(b)
c = int(c)
if a < b < c:
print('Yes')
else:
print('No') | a, b, c = [int(i) for i in input().split()]
if a < b < c:
print("Yes")
else:
print("No") | 9 | 7 | 131 | 104 | (a, b, c) = input().rstrip().split()
a = int(a)
b = int(b)
c = int(c)
if a < b < c:
print("Yes")
else:
print("No")
| a, b, c = [int(i) for i in input().split()]
if a < b < c:
print("Yes")
else:
print("No")
| false | 22.222222 | [
"-(a, b, c) = input().rstrip().split()",
"-a = int(a)",
"-b = int(b)",
"-c = int(c)",
"+a, b, c = [int(i) for i in input().split()]"
] | false | 0.042875 | 0.040513 | 1.058282 | [
"s421725295",
"s243982900"
] |
u580697892 | p03633 | python | s067333432 | s602192342 | 54 | 36 | 5,560 | 5,048 | Accepted | Accepted | 33.33 | # coding: utf-8
try:
from fractions import gcd
except:
from math import gcd
N = int(eval(input()))
T = []
for i in range(N):
t = int(eval(input()))
T.append(t)
ans = T[0]
for i in range(1, N):
ans = (ans * T[i]) // gcd(ans, T[i])
print(ans) | # coding: utf-8
from fractions import gcd
N = int(eval(input()))
def lcm(a, b):
return a * b // gcd(a, b)
ans = 1
for i in range(N):
t = int(eval(input()))
ans = lcm(ans, t)
print(ans) | 14 | 10 | 261 | 193 | # coding: utf-8
try:
from fractions import gcd
except:
from math import gcd
N = int(eval(input()))
T = []
for i in range(N):
t = int(eval(input()))
T.append(t)
ans = T[0]
for i in range(1, N):
ans = (ans * T[i]) // gcd(ans, T[i])
print(ans)
| # coding: utf-8
from fractions import gcd
N = int(eval(input()))
def lcm(a, b):
return a * b // gcd(a, b)
ans = 1
for i in range(N):
t = int(eval(input()))
ans = lcm(ans, t)
print(ans)
| false | 28.571429 | [
"-try:",
"- from fractions import gcd",
"-except:",
"- from math import gcd",
"+from fractions import gcd",
"+",
"-T = []",
"+",
"+",
"+def lcm(a, b):",
"+ return a * b // gcd(a, b)",
"+",
"+",
"+ans = 1",
"- T.append(t)",
"-ans = T[0]",
"-for i in range(1, N):",
"- ans = (ans * T[i]) // gcd(ans, T[i])",
"+ ans = lcm(ans, t)"
] | false | 0.059647 | 0.060781 | 0.981348 | [
"s067333432",
"s602192342"
] |
u102461423 | p02632 | python | s815414142 | s330919102 | 446 | 344 | 97,332 | 73,288 | Accepted | Accepted | 22.87 | import sys
import numpy as np
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
MOD = 10**9 + 7
def main(K, N, MOD):
def fact_table(N, MOD):
inv = np.empty(N, np.int64)
inv[0] = 0
inv[1] = 1
for n in range(2, N):
q, r = divmod(MOD, n)
inv[n] = inv[r] * (-q) % MOD
fact = np.empty(N, np.int64)
fact[0] = 1
for n in range(1, N):
fact[n] = n * fact[n - 1] % MOD
fact_inv = np.empty(N, np.int64)
fact_inv[0] = 1
for n in range(1, N):
fact_inv[n] = fact_inv[n - 1] * inv[n] % MOD
return fact, fact_inv, inv
fact, fact_inv, inv = fact_table(3_000_000, MOD)
f = np.zeros(K + 1, np.int64)
f = fact[N - 1:K + N] * fact_inv[N - 1] % MOD * fact_inv[0:K + 1] % MOD
x = 1
for i in range(1, K + 1):
x = (x * 25) % MOD
f[i] = f[i] * x % MOD
for i in range(1, K + 1):
f[i] += f[i - 1] * 26
f[i] %= MOD
return f[-1]
if sys.argv[-1] == 'ONLINE_JUDGE':
import numba
from numba.pycc import CC
i8 = numba.from_dtype(np.int64)
signature = (i8, i8, i8)
cc = CC('my_module')
cc.export('main', signature)(main)
cc.compile()
from my_module import main
K = int(readline())
N = len(read().rstrip())
print((main(K, N, MOD))) | import sys
import numpy as np
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
MOD = 10**9 + 7
def main(K, N, MOD):
def fact_table(N, MOD):
inv = np.empty(N, np.int64)
inv[0] = 0
inv[1] = 1
for n in range(2, N):
q, r = divmod(MOD, n)
inv[n] = inv[r] * (-q) % MOD
fact = np.empty(N, np.int64)
fact[0] = 1
for n in range(1, N):
fact[n] = n * fact[n - 1] % MOD
fact_inv = np.empty(N, np.int64)
fact_inv[0] = 1
for n in range(1, N):
fact_inv[n] = fact_inv[n - 1] * inv[n] % MOD
return fact, fact_inv, inv
fact, fact_inv, inv = fact_table(2_000_010, MOD)
f = np.zeros(K + 1, np.int64)
f = fact[N - 1:K + N] * fact_inv[N - 1] % MOD * fact_inv[0:K + 1] % MOD
x = 1
for i in range(1, K + 1):
x = (x * 25) % MOD
f[i] = f[i] * x % MOD
for i in range(1, K + 1):
f[i] += f[i - 1] * 26
f[i] %= MOD
return f[-1]
if sys.argv[-1] == 'ONLINE_JUDGE':
import numba
from numba.pycc import CC
i8 = numba.from_dtype(np.int64)
signature = (i8, i8, i8)
cc = CC('my_module')
cc.export('main', signature)(main)
cc.compile()
from my_module import main
K = int(readline())
N = len(read().rstrip())
print((main(K, N, MOD)))
| 55 | 55 | 1,439 | 1,440 | import sys
import numpy as np
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
MOD = 10**9 + 7
def main(K, N, MOD):
def fact_table(N, MOD):
inv = np.empty(N, np.int64)
inv[0] = 0
inv[1] = 1
for n in range(2, N):
q, r = divmod(MOD, n)
inv[n] = inv[r] * (-q) % MOD
fact = np.empty(N, np.int64)
fact[0] = 1
for n in range(1, N):
fact[n] = n * fact[n - 1] % MOD
fact_inv = np.empty(N, np.int64)
fact_inv[0] = 1
for n in range(1, N):
fact_inv[n] = fact_inv[n - 1] * inv[n] % MOD
return fact, fact_inv, inv
fact, fact_inv, inv = fact_table(3_000_000, MOD)
f = np.zeros(K + 1, np.int64)
f = fact[N - 1 : K + N] * fact_inv[N - 1] % MOD * fact_inv[0 : K + 1] % MOD
x = 1
for i in range(1, K + 1):
x = (x * 25) % MOD
f[i] = f[i] * x % MOD
for i in range(1, K + 1):
f[i] += f[i - 1] * 26
f[i] %= MOD
return f[-1]
if sys.argv[-1] == "ONLINE_JUDGE":
import numba
from numba.pycc import CC
i8 = numba.from_dtype(np.int64)
signature = (i8, i8, i8)
cc = CC("my_module")
cc.export("main", signature)(main)
cc.compile()
from my_module import main
K = int(readline())
N = len(read().rstrip())
print((main(K, N, MOD)))
| import sys
import numpy as np
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
MOD = 10**9 + 7
def main(K, N, MOD):
def fact_table(N, MOD):
inv = np.empty(N, np.int64)
inv[0] = 0
inv[1] = 1
for n in range(2, N):
q, r = divmod(MOD, n)
inv[n] = inv[r] * (-q) % MOD
fact = np.empty(N, np.int64)
fact[0] = 1
for n in range(1, N):
fact[n] = n * fact[n - 1] % MOD
fact_inv = np.empty(N, np.int64)
fact_inv[0] = 1
for n in range(1, N):
fact_inv[n] = fact_inv[n - 1] * inv[n] % MOD
return fact, fact_inv, inv
fact, fact_inv, inv = fact_table(2_000_010, MOD)
f = np.zeros(K + 1, np.int64)
f = fact[N - 1 : K + N] * fact_inv[N - 1] % MOD * fact_inv[0 : K + 1] % MOD
x = 1
for i in range(1, K + 1):
x = (x * 25) % MOD
f[i] = f[i] * x % MOD
for i in range(1, K + 1):
f[i] += f[i - 1] * 26
f[i] %= MOD
return f[-1]
if sys.argv[-1] == "ONLINE_JUDGE":
import numba
from numba.pycc import CC
i8 = numba.from_dtype(np.int64)
signature = (i8, i8, i8)
cc = CC("my_module")
cc.export("main", signature)(main)
cc.compile()
from my_module import main
K = int(readline())
N = len(read().rstrip())
print((main(K, N, MOD)))
| false | 0 | [
"- fact, fact_inv, inv = fact_table(3_000_000, MOD)",
"+ fact, fact_inv, inv = fact_table(2_000_010, MOD)"
] | false | 0.471528 | 0.282302 | 1.670296 | [
"s815414142",
"s330919102"
] |
u077291787 | p02726 | python | s749828636 | s109033352 | 1,631 | 274 | 3,188 | 44,144 | Accepted | Accepted | 83.2 | # D - Line++
def main():
N, X, Y = list(map(int, input().split()))
dist = [0] * N
calc_min_dist = lambda x, y: min(
y - x, abs(X - x) + abs(y - Y) + 1, abs(Y - x) + abs(y - X) + 1
)
for i in range(1, N + 1):
for j in range(i + 1, N + 1):
dist[calc_min_dist(i, j)] += 1
print(("\n".join(map(str, dist[1:]))))
if __name__ == "__main__":
main()
| # D - Line++
def main():
N, X, Y = list(map(int, input().split()))
dist = [0] * N
calc_min_dist = lambda x, y: min(
y - x, abs(X - x) + abs(y - Y) + 1, abs(Y - x) + abs(y - X) + 1
) # assume x < y
for i in range(1, N + 1):
for j in range(i + 1, N + 1):
dist[calc_min_dist(i, j)] += 1
print(("\n".join(map(str, dist[1:]))))
if __name__ == "__main__":
main()
| 15 | 15 | 406 | 422 | # D - Line++
def main():
N, X, Y = list(map(int, input().split()))
dist = [0] * N
calc_min_dist = lambda x, y: min(
y - x, abs(X - x) + abs(y - Y) + 1, abs(Y - x) + abs(y - X) + 1
)
for i in range(1, N + 1):
for j in range(i + 1, N + 1):
dist[calc_min_dist(i, j)] += 1
print(("\n".join(map(str, dist[1:]))))
if __name__ == "__main__":
main()
| # D - Line++
def main():
N, X, Y = list(map(int, input().split()))
dist = [0] * N
calc_min_dist = lambda x, y: min(
y - x, abs(X - x) + abs(y - Y) + 1, abs(Y - x) + abs(y - X) + 1
) # assume x < y
for i in range(1, N + 1):
for j in range(i + 1, N + 1):
dist[calc_min_dist(i, j)] += 1
print(("\n".join(map(str, dist[1:]))))
if __name__ == "__main__":
main()
| false | 0 | [
"- )",
"+ ) # assume x < y"
] | false | 0.065744 | 0.036969 | 1.77836 | [
"s749828636",
"s109033352"
] |
u627803856 | p03323 | python | s264308295 | s845959028 | 165 | 65 | 38,384 | 61,788 | Accepted | Accepted | 60.61 | a,b = list(map(int, input().split()))
if a>=9 or b>=9: print(':(')
else: print('Yay!') | a, b = list(map(int, input().split()))
if a <= 8 and b <= 8:
print('Yay!')
else:
print(':(') | 3 | 5 | 82 | 94 | a, b = list(map(int, input().split()))
if a >= 9 or b >= 9:
print(":(")
else:
print("Yay!")
| a, b = list(map(int, input().split()))
if a <= 8 and b <= 8:
print("Yay!")
else:
print(":(")
| false | 40 | [
"-if a >= 9 or b >= 9:",
"+if a <= 8 and b <= 8:",
"+ print(\"Yay!\")",
"+else:",
"-else:",
"- print(\"Yay!\")"
] | false | 0.036942 | 0.036894 | 1.001303 | [
"s264308295",
"s845959028"
] |
u347600233 | p02818 | python | s053528806 | s849729394 | 30 | 26 | 9,040 | 9,104 | Accepted | Accepted | 13.33 | a, b, k = list(map(int, input().split()))
print((a - min(a, k), b - min(b, k - min(a, k)))) | a, b, k = list(map(int, input().split()))
print((max(0, a - k), max(0, b - max(0, k - a)))) | 2 | 2 | 84 | 84 | a, b, k = list(map(int, input().split()))
print((a - min(a, k), b - min(b, k - min(a, k))))
| a, b, k = list(map(int, input().split()))
print((max(0, a - k), max(0, b - max(0, k - a))))
| false | 0 | [
"-print((a - min(a, k), b - min(b, k - min(a, k))))",
"+print((max(0, a - k), max(0, b - max(0, k - a))))"
] | false | 0.067592 | 0.067111 | 1.007175 | [
"s053528806",
"s849729394"
] |
u714878632 | p02937 | python | s061045293 | s991053976 | 571 | 107 | 14,260 | 7,668 | Accepted | Accepted | 81.26 | import copy
def main():
s = eval(input())
ss = s + s
t = eval(input())
if not set(sorted(t)) <= set(sorted(s)):
print((-1))
return
cnt_s = {}
cnt_t = {}
pos = {} # [({}) for x in range(len(s))]
for i in range(len(ss)):
c = ss[i]
if c not in cnt_s:
cnt_s[c] = 0
pos[c] = []
cnt_s[c] += 1
pos[c].append(i)
# for k in pos.keys():
# pos[k].reverse()
# org_pos = copy.deepcopy(pos)
ret = 0
tmp = -1
for i in range(len(t)):
c = t[i]
if pos[c][0] > tmp:
tmp = pos[c][0]
continue
l = 1
r = len(pos[c]) - 1
while not l == r:
p = (l + r) // 2
if pos[c][p] > tmp:
r = p
if pos[c][p] <= tmp:
l = p + 1
tmp = pos[c][l]
if tmp >= len(s):
ret += len(s)
tmp -= len(s)
ret += tmp + 1
print(ret)
return
if __name__ == "__main__":
main()
| from bisect import bisect
def main():
S = eval(input())
T = eval(input())
pos = {}
for i, c in enumerate(S):
if c not in list(pos.keys()):
pos[c] = []
pos[c].append(i)
ret = 0
tmp = -1
for c in T:
if c not in list(pos.keys()):
print((-1))
return
idx = bisect(pos[c], tmp)
if idx == len(pos[c]):
ret += len(S)
tmp = pos[c][0]
else:
tmp = pos[c][idx]
ret += tmp + 1
print(ret)
return
if __name__ == "__main__":
main()
| 49 | 33 | 1,078 | 593 | import copy
def main():
s = eval(input())
ss = s + s
t = eval(input())
if not set(sorted(t)) <= set(sorted(s)):
print((-1))
return
cnt_s = {}
cnt_t = {}
pos = {} # [({}) for x in range(len(s))]
for i in range(len(ss)):
c = ss[i]
if c not in cnt_s:
cnt_s[c] = 0
pos[c] = []
cnt_s[c] += 1
pos[c].append(i)
# for k in pos.keys():
# pos[k].reverse()
# org_pos = copy.deepcopy(pos)
ret = 0
tmp = -1
for i in range(len(t)):
c = t[i]
if pos[c][0] > tmp:
tmp = pos[c][0]
continue
l = 1
r = len(pos[c]) - 1
while not l == r:
p = (l + r) // 2
if pos[c][p] > tmp:
r = p
if pos[c][p] <= tmp:
l = p + 1
tmp = pos[c][l]
if tmp >= len(s):
ret += len(s)
tmp -= len(s)
ret += tmp + 1
print(ret)
return
if __name__ == "__main__":
main()
| from bisect import bisect
def main():
S = eval(input())
T = eval(input())
pos = {}
for i, c in enumerate(S):
if c not in list(pos.keys()):
pos[c] = []
pos[c].append(i)
ret = 0
tmp = -1
for c in T:
if c not in list(pos.keys()):
print((-1))
return
idx = bisect(pos[c], tmp)
if idx == len(pos[c]):
ret += len(S)
tmp = pos[c][0]
else:
tmp = pos[c][idx]
ret += tmp + 1
print(ret)
return
if __name__ == "__main__":
main()
| false | 32.653061 | [
"-import copy",
"+from bisect import bisect",
"- s = eval(input())",
"- ss = s + s",
"- t = eval(input())",
"- if not set(sorted(t)) <= set(sorted(s)):",
"- print((-1))",
"- return",
"- cnt_s = {}",
"- cnt_t = {}",
"- pos = {} # [({}) for x in range(len(s))]",
"- for i in range(len(ss)):",
"- c = ss[i]",
"- if c not in cnt_s:",
"- cnt_s[c] = 0",
"+ S = eval(input())",
"+ T = eval(input())",
"+ pos = {}",
"+ for i, c in enumerate(S):",
"+ if c not in list(pos.keys()):",
"- cnt_s[c] += 1",
"- # for k in pos.keys():",
"- # pos[k].reverse()",
"- # org_pos = copy.deepcopy(pos)",
"- for i in range(len(t)):",
"- c = t[i]",
"- if pos[c][0] > tmp:",
"+ for c in T:",
"+ if c not in list(pos.keys()):",
"+ print((-1))",
"+ return",
"+ idx = bisect(pos[c], tmp)",
"+ if idx == len(pos[c]):",
"+ ret += len(S)",
"- continue",
"- l = 1",
"- r = len(pos[c]) - 1",
"- while not l == r:",
"- p = (l + r) // 2",
"- if pos[c][p] > tmp:",
"- r = p",
"- if pos[c][p] <= tmp:",
"- l = p + 1",
"- tmp = pos[c][l]",
"- if tmp >= len(s):",
"- ret += len(s)",
"- tmp -= len(s)",
"+ else:",
"+ tmp = pos[c][idx]"
] | false | 0.063353 | 0.054005 | 1.1731 | [
"s061045293",
"s991053976"
] |
u300968187 | p03221 | python | s161795744 | s782322108 | 842 | 723 | 41,912 | 33,924 | Accepted | Accepted | 14.13 | N, M = list(map(int, input().split()))
pyi = []
exists = [0] * N
for i in range(M):
p, y = list(map(int, input().split()))
pyi.append([p, y, i])
pyi.sort(key = lambda x: x[1])
iid = []
for i in range(M):
p = pyi[i][0]
div = pyi[i][2]
exists[p - 1] += 1
iid.append([div, str(p).zfill(6)+str(exists[p - 1]).zfill(6)])
iid.sort()
for i in range(M):
print((iid[i][1])) | N, M = list(map(int, input().split()))
PY = [tuple(map(int, input().split())) for _ in range(M)]
sPY = sorted(PY, key=lambda py: (py[0],py[1]))
i = 1
bp = 1
d = {}
for p, y in sPY:
if p != bp:
i = 1
bp = p
d[y] = i
i += 1
for p, y in PY:
print(("{0:06}{1:06}".format(p, d[y]))) | 16 | 16 | 393 | 318 | N, M = list(map(int, input().split()))
pyi = []
exists = [0] * N
for i in range(M):
p, y = list(map(int, input().split()))
pyi.append([p, y, i])
pyi.sort(key=lambda x: x[1])
iid = []
for i in range(M):
p = pyi[i][0]
div = pyi[i][2]
exists[p - 1] += 1
iid.append([div, str(p).zfill(6) + str(exists[p - 1]).zfill(6)])
iid.sort()
for i in range(M):
print((iid[i][1]))
| N, M = list(map(int, input().split()))
PY = [tuple(map(int, input().split())) for _ in range(M)]
sPY = sorted(PY, key=lambda py: (py[0], py[1]))
i = 1
bp = 1
d = {}
for p, y in sPY:
if p != bp:
i = 1
bp = p
d[y] = i
i += 1
for p, y in PY:
print(("{0:06}{1:06}".format(p, d[y])))
| false | 0 | [
"-pyi = []",
"-exists = [0] * N",
"-for i in range(M):",
"- p, y = list(map(int, input().split()))",
"- pyi.append([p, y, i])",
"-pyi.sort(key=lambda x: x[1])",
"-iid = []",
"-for i in range(M):",
"- p = pyi[i][0]",
"- div = pyi[i][2]",
"- exists[p - 1] += 1",
"- iid.append([div, str(p).zfill(6) + str(exists[p - 1]).zfill(6)])",
"-iid.sort()",
"-for i in range(M):",
"- print((iid[i][1]))",
"+PY = [tuple(map(int, input().split())) for _ in range(M)]",
"+sPY = sorted(PY, key=lambda py: (py[0], py[1]))",
"+i = 1",
"+bp = 1",
"+d = {}",
"+for p, y in sPY:",
"+ if p != bp:",
"+ i = 1",
"+ bp = p",
"+ d[y] = i",
"+ i += 1",
"+for p, y in PY:",
"+ print((\"{0:06}{1:06}\".format(p, d[y])))"
] | false | 0.042932 | 0.040685 | 1.055241 | [
"s161795744",
"s782322108"
] |
u643495354 | p03244 | python | s839689369 | s788591301 | 127 | 83 | 20,692 | 20,692 | Accepted | Accepted | 34.65 | import collections
def main():
n = int(eval(input()))
*v, = list(map(int, input().split()))
v0 = count(v[::2])
v1 = count(v[1::2])
if len(v0) == 1 and len(v1) == 1:
if v0[0][0] == v1[0][0]:
print((n // 2))
else:
print((0))
return
l0 = min(2, len(v0))
l1 = min(2, len(v1))
INF = 10 ** 9
score = [[0] * l1 for _ in range(l0)]
for i in range(l0):
for j in range(l1):
score[i][j] = sum_v(v0, i) + sum_v(v1, j)
if i >= l0 or j >= l1 or v0[i][0] == v1[j][0]:
score[i][j] = INF
print((min([min(s) for s in score])))
def count(v):
return collections.Counter(v).most_common()
def sum_v(v, ii):
return sum([vv[1] for i, vv in enumerate(v) if i != ii])
main()
| from collections import Counter
def main():
n = int(eval(input()))
*v, = list(map(int, input().split()))
v0 = Counter(v[::2]).most_common()
v1 = Counter(v[1::2]).most_common()
if len(v0) == 1 and len(v1) == 1:
if v0[0][0] == v1[0][0]:
print((n // 2))
else:
print((0))
return
l0 = min(2, len(v0))
l1 = min(2, len(v1))
INF = 10 ** 9
score = [[n - v0[i][1] - v1[j][1] if v0[i][0] != v1[j][0]
else INF for j in range(l1)] for i in range(l0)]
print((min([min(s) for s in score])))
main()
| 39 | 26 | 829 | 599 | import collections
def main():
n = int(eval(input()))
(*v,) = list(map(int, input().split()))
v0 = count(v[::2])
v1 = count(v[1::2])
if len(v0) == 1 and len(v1) == 1:
if v0[0][0] == v1[0][0]:
print((n // 2))
else:
print((0))
return
l0 = min(2, len(v0))
l1 = min(2, len(v1))
INF = 10**9
score = [[0] * l1 for _ in range(l0)]
for i in range(l0):
for j in range(l1):
score[i][j] = sum_v(v0, i) + sum_v(v1, j)
if i >= l0 or j >= l1 or v0[i][0] == v1[j][0]:
score[i][j] = INF
print((min([min(s) for s in score])))
def count(v):
return collections.Counter(v).most_common()
def sum_v(v, ii):
return sum([vv[1] for i, vv in enumerate(v) if i != ii])
main()
| from collections import Counter
def main():
n = int(eval(input()))
(*v,) = list(map(int, input().split()))
v0 = Counter(v[::2]).most_common()
v1 = Counter(v[1::2]).most_common()
if len(v0) == 1 and len(v1) == 1:
if v0[0][0] == v1[0][0]:
print((n // 2))
else:
print((0))
return
l0 = min(2, len(v0))
l1 = min(2, len(v1))
INF = 10**9
score = [
[n - v0[i][1] - v1[j][1] if v0[i][0] != v1[j][0] else INF for j in range(l1)]
for i in range(l0)
]
print((min([min(s) for s in score])))
main()
| false | 33.333333 | [
"-import collections",
"+from collections import Counter",
"- v0 = count(v[::2])",
"- v1 = count(v[1::2])",
"+ v0 = Counter(v[::2]).most_common()",
"+ v1 = Counter(v[1::2]).most_common()",
"- score = [[0] * l1 for _ in range(l0)]",
"- for i in range(l0):",
"- for j in range(l1):",
"- score[i][j] = sum_v(v0, i) + sum_v(v1, j)",
"- if i >= l0 or j >= l1 or v0[i][0] == v1[j][0]:",
"- score[i][j] = INF",
"+ score = [",
"+ [n - v0[i][1] - v1[j][1] if v0[i][0] != v1[j][0] else INF for j in range(l1)]",
"+ for i in range(l0)",
"+ ]",
"-def count(v):",
"- return collections.Counter(v).most_common()",
"-",
"-",
"-def sum_v(v, ii):",
"- return sum([vv[1] for i, vv in enumerate(v) if i != ii])",
"-",
"-"
] | false | 0.04597 | 0.0428 | 1.074046 | [
"s839689369",
"s788591301"
] |
u142415823 | p02842 | python | s835251166 | s182183648 | 29 | 18 | 2,940 | 2,940 | Accepted | Accepted | 37.93 | from math import floor
def main(N, rate=1.08):
ans = -1
for x in range(1, N+1):
if floor(x * 1.08) == N:
ans = x
return ans
if __name__ == "__main__":
N = int(eval(input()))
ans = main(N)
print((ans if ans > 0 else ':('))
| def main(N, rate=1.08):
X = int(-(-N // 1.08))
return X if int(X * rate) == N else -1
if __name__ == "__main__":
N = int(eval(input()))
ans = main(N)
print((ans if ans > 0 else ':('))
| 14 | 9 | 274 | 206 | from math import floor
def main(N, rate=1.08):
ans = -1
for x in range(1, N + 1):
if floor(x * 1.08) == N:
ans = x
return ans
if __name__ == "__main__":
N = int(eval(input()))
ans = main(N)
print((ans if ans > 0 else ":("))
| def main(N, rate=1.08):
X = int(-(-N // 1.08))
return X if int(X * rate) == N else -1
if __name__ == "__main__":
N = int(eval(input()))
ans = main(N)
print((ans if ans > 0 else ":("))
| false | 35.714286 | [
"-from math import floor",
"-",
"-",
"- ans = -1",
"- for x in range(1, N + 1):",
"- if floor(x * 1.08) == N:",
"- ans = x",
"- return ans",
"+ X = int(-(-N // 1.08))",
"+ return X if int(X * rate) == N else -1"
] | false | 0.036227 | 0.034456 | 1.051385 | [
"s835251166",
"s182183648"
] |
u588341295 | p03329 | python | s027520611 | s012618789 | 1,338 | 639 | 3,956 | 3,828 | Accepted | Accepted | 52.24 | # -*- 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 list4d(a, b, c, d, e): return [[[[e] * d for j in range(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(N=None): return list(MAP()) if N is None else [INT() for i in range(N)]
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
sys.setrecursionlimit(10 ** 9)
INF = 10 ** 18
MOD = 10 ** 9 + 7
N = INT()
# dp[i] := i円引き出すのに必要な最小回数
dp = [INF] * (N+1)
dp[0] = 0
for i in range(N):
# 3種類の引き出し方に対応する遷移をする
dp[i+1] = min(dp[i+1], dp[i] + 1)
j = 1
while i+6**j <= N:
dp[i+6**j] = min(dp[i+6**j], dp[i] + 1)
j += 1
j = 1
while i+9**j <= N:
dp[i+9**j] = min(dp[i+9**j], dp[i] + 1)
j += 1
print((dp[N]))
| # -*- 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 list4d(a, b, c, d, e): return [[[[e] * d for j in range(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(N=None): return list(MAP()) if N is None else [INT() for i in range(N)]
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
sys.setrecursionlimit(10 ** 9)
INF = 10 ** 18
MOD = 10 ** 9 + 7
N = INT()
# dp[i] := i円引き出すのに必要な最小回数
dp = [INF] * (N+1)
dp[0] = 0
for i in range(N):
# 3種類の引き出し方に対応する遷移をする
dp[i+1] = min(dp[i+1], dp[i] + 1)
j = 6
while i+j <= N:
dp[i+j] = min(dp[i+j], dp[i] + 1)
j *= 6
j = 9
while i+j <= N:
dp[i+j] = min(dp[i+j], dp[i] + 1)
j *= 9
print((dp[N]))
| 37 | 37 | 1,068 | 1,050 | # -*- 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 list4d(a, b, c, d, e):
return [[[[e] * d for j in range(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(N=None):
return list(MAP()) if N is None else [INT() for i in range(N)]
def Yes():
print("Yes")
def No():
print("No")
def YES():
print("YES")
def NO():
print("NO")
sys.setrecursionlimit(10**9)
INF = 10**18
MOD = 10**9 + 7
N = INT()
# dp[i] := i円引き出すのに必要な最小回数
dp = [INF] * (N + 1)
dp[0] = 0
for i in range(N):
# 3種類の引き出し方に対応する遷移をする
dp[i + 1] = min(dp[i + 1], dp[i] + 1)
j = 1
while i + 6**j <= N:
dp[i + 6**j] = min(dp[i + 6**j], dp[i] + 1)
j += 1
j = 1
while i + 9**j <= N:
dp[i + 9**j] = min(dp[i + 9**j], dp[i] + 1)
j += 1
print((dp[N]))
| # -*- 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 list4d(a, b, c, d, e):
return [[[[e] * d for j in range(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(N=None):
return list(MAP()) if N is None else [INT() for i in range(N)]
def Yes():
print("Yes")
def No():
print("No")
def YES():
print("YES")
def NO():
print("NO")
sys.setrecursionlimit(10**9)
INF = 10**18
MOD = 10**9 + 7
N = INT()
# dp[i] := i円引き出すのに必要な最小回数
dp = [INF] * (N + 1)
dp[0] = 0
for i in range(N):
# 3種類の引き出し方に対応する遷移をする
dp[i + 1] = min(dp[i + 1], dp[i] + 1)
j = 6
while i + j <= N:
dp[i + j] = min(dp[i + j], dp[i] + 1)
j *= 6
j = 9
while i + j <= N:
dp[i + j] = min(dp[i + j], dp[i] + 1)
j *= 9
print((dp[N]))
| false | 0 | [
"- j = 1",
"- while i + 6**j <= N:",
"- dp[i + 6**j] = min(dp[i + 6**j], dp[i] + 1)",
"- j += 1",
"- j = 1",
"- while i + 9**j <= N:",
"- dp[i + 9**j] = min(dp[i + 9**j], dp[i] + 1)",
"- j += 1",
"+ j = 6",
"+ while i + j <= N:",
"+ dp[i + j] = min(dp[i + j], dp[i] + 1)",
"+ j *= 6",
"+ j = 9",
"+ while i + j <= N:",
"+ dp[i + j] = min(dp[i + j], dp[i] + 1)",
"+ j *= 9"
] | false | 0.257708 | 0.120779 | 2.133718 | [
"s027520611",
"s012618789"
] |
u150984829 | p02257 | python | s731894858 | s117664790 | 320 | 70 | 5,668 | 5,608 | Accepted | Accepted | 78.12 | c=0
n=int(eval(input()))
for _ in range(n):
x=int(eval(input()))
if x!=2 and x%2==0:c+=1;continue
for i in range(3,int(x**.5+1),2):
if x%i==0:c+=1;break
print((n-c))
| n=int(eval(input()))
c=0
for _ in range(n):
x=int(eval(input()))
if 2 in [x,pow(2,x,x)]:c+=1
print(c)
| 8 | 6 | 164 | 97 | c = 0
n = int(eval(input()))
for _ in range(n):
x = int(eval(input()))
if x != 2 and x % 2 == 0:
c += 1
continue
for i in range(3, int(x**0.5 + 1), 2):
if x % i == 0:
c += 1
break
print((n - c))
| n = int(eval(input()))
c = 0
for _ in range(n):
x = int(eval(input()))
if 2 in [x, pow(2, x, x)]:
c += 1
print(c)
| false | 25 | [
"+n = int(eval(input()))",
"-n = int(eval(input()))",
"- if x != 2 and x % 2 == 0:",
"+ if 2 in [x, pow(2, x, x)]:",
"- continue",
"- for i in range(3, int(x**0.5 + 1), 2):",
"- if x % i == 0:",
"- c += 1",
"- break",
"-print((n - c))",
"+print(c)"
] | false | 0.033548 | 0.035946 | 0.933281 | [
"s731894858",
"s117664790"
] |
u843175622 | p02836 | python | s312747896 | s678341210 | 31 | 28 | 9,040 | 9,092 | Accepted | Accepted | 9.68 | s = eval(input())
n = len(s)
ans = 0
for i in range(n // 2):
ans += s[i] != s[n - i - 1]
print(ans)
| s = eval(input())
n = len(s)
print((len([i for i in range(n // 2) if s[i] != s[n - 1 - i]]))) | 6 | 3 | 103 | 87 | s = eval(input())
n = len(s)
ans = 0
for i in range(n // 2):
ans += s[i] != s[n - i - 1]
print(ans)
| s = eval(input())
n = len(s)
print((len([i for i in range(n // 2) if s[i] != s[n - 1 - i]])))
| false | 50 | [
"-ans = 0",
"-for i in range(n // 2):",
"- ans += s[i] != s[n - i - 1]",
"-print(ans)",
"+print((len([i for i in range(n // 2) if s[i] != s[n - 1 - i]])))"
] | false | 0.046536 | 0.04727 | 0.984473 | [
"s312747896",
"s678341210"
] |
u254871849 | p03379 | python | s068671035 | s379855961 | 310 | 245 | 25,052 | 25,052 | Accepted | Accepted | 20.97 | # author: kagemeka
# created: 2019-11-07 11:52:43(JST)
import sys
# import collections
# import math
# import string
# import bisect
# import re
# import itertools
# import statistics
# import functools
# import operator
def main():
n, *x = (int(i) for i in sys.stdin.read().split())
s_x = list(sorted(x))
half = n // 2
m_s, m_l = s_x[half - 1], s_x[half]
for i in x:
print((m_l if i < m_l else m_s))
if __name__ == "__main__":
# execute only if run as a script
main()
| import sys
n, *x = map(int, sys.stdin.read().split())
def main():
y = sorted(x)
r = y[n // 2]
l = y[n // 2 - 1]
for i in range(n):
if x[i] <= l:
yield r
else:
yield l
if __name__ == '__main__':
ans = main()
print(*ans, sep='\n')
| 24 | 18 | 578 | 317 | # author: kagemeka
# created: 2019-11-07 11:52:43(JST)
import sys
# import collections
# import math
# import string
# import bisect
# import re
# import itertools
# import statistics
# import functools
# import operator
def main():
n, *x = (int(i) for i in sys.stdin.read().split())
s_x = list(sorted(x))
half = n // 2
m_s, m_l = s_x[half - 1], s_x[half]
for i in x:
print((m_l if i < m_l else m_s))
if __name__ == "__main__":
# execute only if run as a script
main()
| import sys
n, *x = map(int, sys.stdin.read().split())
def main():
y = sorted(x)
r = y[n // 2]
l = y[n // 2 - 1]
for i in range(n):
if x[i] <= l:
yield r
else:
yield l
if __name__ == "__main__":
ans = main()
print(*ans, sep="\n")
| false | 25 | [
"-# author: kagemeka",
"-# created: 2019-11-07 11:52:43(JST)",
"-# import collections",
"-# import math",
"-# import string",
"-# import bisect",
"-# import re",
"-# import itertools",
"-# import statistics",
"-# import functools",
"-# import operator",
"+n, *x = map(int, sys.stdin.read().split())",
"+",
"+",
"- n, *x = (int(i) for i in sys.stdin.read().split())",
"- s_x = list(sorted(x))",
"- half = n // 2",
"- m_s, m_l = s_x[half - 1], s_x[half]",
"- for i in x:",
"- print((m_l if i < m_l else m_s))",
"+ y = sorted(x)",
"+ r = y[n // 2]",
"+ l = y[n // 2 - 1]",
"+ for i in range(n):",
"+ if x[i] <= l:",
"+ yield r",
"+ else:",
"+ yield l",
"- # execute only if run as a script",
"- main()",
"+ ans = main()",
"+ print(*ans, sep=\"\\n\")"
] | false | 0.04638 | 0.038752 | 1.196838 | [
"s068671035",
"s379855961"
] |
u222668979 | p03096 | python | s803875565 | s095809628 | 964 | 260 | 789,820 | 90,728 | Accepted | Accepted | 73.03 | n = int(eval(input()))
c = [int(eval(input())) for _ in range(n)]
mod = 10 ** 9 + 7
# 解説AC
dp = [1] * n
color = [-1] * max(c)
for i, ci in enumerate(c):
dp[i] = dp[i - 1]
if 0 <= color[ci - 1] < i - 1:
dp[i] += dp[color[ci - 1]]
color[ci - 1] = i
print((dp[-1] % mod))
| n = int(eval(input()))
c = [int(eval(input())) for _ in range(n)]
mod = 10 ** 9 + 7
# 解説AC
dp = [1] * n
color = [-1] * max(c)
for i, ci in enumerate(c):
dp[i] = dp[i - 1]
if 0 <= color[ci - 1] < i - 1:
dp[i] += dp[color[ci - 1]]
dp[i] %= mod
color[ci - 1] = i
print((dp[-1] % mod))
| 13 | 14 | 288 | 310 | n = int(eval(input()))
c = [int(eval(input())) for _ in range(n)]
mod = 10**9 + 7
# 解説AC
dp = [1] * n
color = [-1] * max(c)
for i, ci in enumerate(c):
dp[i] = dp[i - 1]
if 0 <= color[ci - 1] < i - 1:
dp[i] += dp[color[ci - 1]]
color[ci - 1] = i
print((dp[-1] % mod))
| n = int(eval(input()))
c = [int(eval(input())) for _ in range(n)]
mod = 10**9 + 7
# 解説AC
dp = [1] * n
color = [-1] * max(c)
for i, ci in enumerate(c):
dp[i] = dp[i - 1]
if 0 <= color[ci - 1] < i - 1:
dp[i] += dp[color[ci - 1]]
dp[i] %= mod
color[ci - 1] = i
print((dp[-1] % mod))
| false | 7.142857 | [
"+ dp[i] %= mod"
] | false | 0.037376 | 0.036431 | 1.025946 | [
"s803875565",
"s095809628"
] |
u535171899 | p02624 | python | s328758739 | s524021832 | 1,677 | 1,503 | 183,148 | 105,196 | Accepted | Accepted | 10.38 | import numpy as np
def solve(stdin):
n = stdin[0]
dp = np.zeros(n+1,dtype=np.int64)
for i in range(1,n+1):
for j in range(i,n+1,i):
dp[j]+=1
dp*=np.arange(n+1)
return dp.sum()
def main():
stdin = np.fromstring(open(0).read(), dtype=np.int64, sep=' ')
print((solve(stdin)))
def cc_export():
from numba.pycc import CC
cc = CC('my_module')
cc.export('solve', '(i8[:],)')(solve)
cc.compile()
if __name__ == '__main__':
import sys
if sys.argv[-1] == 'ONLINE_JUDGE':
cc_export()
exit(0)
from my_module import solve
main() | import sys
import numpy as np
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
def main(N):
div = np.zeros(N+1, np.int64)
for n in range(1, N+1):
for m in range(n, N+1, n):
div[m] += m
return div.sum()
if sys.argv[-1] == 'ONLINE_JUDGE':
import numba
from numba.pycc import CC
i8 = numba.int64
cc = CC('my_module')
def cc_export(f, signature):
cc.export(f.__name__, signature)(f)
return numba.njit(f)
main = cc_export(main, (i8, ))
cc.compile()
from my_module import main
N = int(read())
print((main(N)))
| 28 | 31 | 640 | 665 | import numpy as np
def solve(stdin):
n = stdin[0]
dp = np.zeros(n + 1, dtype=np.int64)
for i in range(1, n + 1):
for j in range(i, n + 1, i):
dp[j] += 1
dp *= np.arange(n + 1)
return dp.sum()
def main():
stdin = np.fromstring(open(0).read(), dtype=np.int64, sep=" ")
print((solve(stdin)))
def cc_export():
from numba.pycc import CC
cc = CC("my_module")
cc.export("solve", "(i8[:],)")(solve)
cc.compile()
if __name__ == "__main__":
import sys
if sys.argv[-1] == "ONLINE_JUDGE":
cc_export()
exit(0)
from my_module import solve
main()
| import sys
import numpy as np
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
def main(N):
div = np.zeros(N + 1, np.int64)
for n in range(1, N + 1):
for m in range(n, N + 1, n):
div[m] += m
return div.sum()
if sys.argv[-1] == "ONLINE_JUDGE":
import numba
from numba.pycc import CC
i8 = numba.int64
cc = CC("my_module")
def cc_export(f, signature):
cc.export(f.__name__, signature)(f)
return numba.njit(f)
main = cc_export(main, (i8,))
cc.compile()
from my_module import main
N = int(read())
print((main(N)))
| false | 9.677419 | [
"+import sys",
"-",
"-def solve(stdin):",
"- n = stdin[0]",
"- dp = np.zeros(n + 1, dtype=np.int64)",
"- for i in range(1, n + 1):",
"- for j in range(i, n + 1, i):",
"- dp[j] += 1",
"- dp *= np.arange(n + 1)",
"- return dp.sum()",
"+read = sys.stdin.buffer.read",
"+readline = sys.stdin.buffer.readline",
"+readlines = sys.stdin.buffer.readlines",
"-def main():",
"- stdin = np.fromstring(open(0).read(), dtype=np.int64, sep=\" \")",
"- print((solve(stdin)))",
"+def main(N):",
"+ div = np.zeros(N + 1, np.int64)",
"+ for n in range(1, N + 1):",
"+ for m in range(n, N + 1, n):",
"+ div[m] += m",
"+ return div.sum()",
"-def cc_export():",
"+if sys.argv[-1] == \"ONLINE_JUDGE\":",
"+ import numba",
"+ i8 = numba.int64",
"- cc.export(\"solve\", \"(i8[:],)\")(solve)",
"+",
"+ def cc_export(f, signature):",
"+ cc.export(f.__name__, signature)(f)",
"+ return numba.njit(f)",
"+",
"+ main = cc_export(main, (i8,))",
"+from my_module import main",
"-",
"-if __name__ == \"__main__\":",
"- import sys",
"-",
"- if sys.argv[-1] == \"ONLINE_JUDGE\":",
"- cc_export()",
"- exit(0)",
"- from my_module import solve",
"-",
"- main()",
"+N = int(read())",
"+print((main(N)))"
] | false | 0.281755 | 0.356903 | 0.789444 | [
"s328758739",
"s524021832"
] |
u579699847 | p03329 | python | s526758304 | s159761707 | 687 | 634 | 3,828 | 3,828 | Accepted | Accepted | 7.71 | import sys
def I(): return int(sys.stdin.readline().rstrip())
N = I()
dp = [float('INF')]*(N+1) #1_indexed
dp[0] = 0
for i in range(N+1):
if i+1<=N:
dp[i+1] = min(dp[i+1],dp[i+1],dp[i]+1)
num6,num9 = 6,9
while i+num6<=N:
dp[i+num6] = min(dp[i+num6],dp[i]+1)
num6 *= 6
while i+num9<=N:
dp[i+num9] = min(dp[i+num9],dp[i]+1)
num9 *= 9
print((dp[-1]))
| import sys
def I(): return int(sys.stdin.readline().rstrip())
N = I()
dp = [float('INF')]*(N+1) #1_indexed
dp[0] = 0
for i in range(N+1):
if i-1>=0:
dp[i] = min(dp[i],dp[i-1]+1)
num6,num9 = 6,9
while i-num6>=0:
dp[i] = min(dp[i],dp[i-num6]+1)
num6 *= 6
while i-num9>=0:
dp[i] = min(dp[i],dp[i-num9]+1)
num9 *= 9
print((dp[-1]))
| 16 | 16 | 417 | 397 | import sys
def I():
return int(sys.stdin.readline().rstrip())
N = I()
dp = [float("INF")] * (N + 1) # 1_indexed
dp[0] = 0
for i in range(N + 1):
if i + 1 <= N:
dp[i + 1] = min(dp[i + 1], dp[i + 1], dp[i] + 1)
num6, num9 = 6, 9
while i + num6 <= N:
dp[i + num6] = min(dp[i + num6], dp[i] + 1)
num6 *= 6
while i + num9 <= N:
dp[i + num9] = min(dp[i + num9], dp[i] + 1)
num9 *= 9
print((dp[-1]))
| import sys
def I():
return int(sys.stdin.readline().rstrip())
N = I()
dp = [float("INF")] * (N + 1) # 1_indexed
dp[0] = 0
for i in range(N + 1):
if i - 1 >= 0:
dp[i] = min(dp[i], dp[i - 1] + 1)
num6, num9 = 6, 9
while i - num6 >= 0:
dp[i] = min(dp[i], dp[i - num6] + 1)
num6 *= 6
while i - num9 >= 0:
dp[i] = min(dp[i], dp[i - num9] + 1)
num9 *= 9
print((dp[-1]))
| false | 0 | [
"- if i + 1 <= N:",
"- dp[i + 1] = min(dp[i + 1], dp[i + 1], dp[i] + 1)",
"+ if i - 1 >= 0:",
"+ dp[i] = min(dp[i], dp[i - 1] + 1)",
"- while i + num6 <= N:",
"- dp[i + num6] = min(dp[i + num6], dp[i] + 1)",
"+ while i - num6 >= 0:",
"+ dp[i] = min(dp[i], dp[i - num6] + 1)",
"- while i + num9 <= N:",
"- dp[i + num9] = min(dp[i + num9], dp[i] + 1)",
"+ while i - num9 >= 0:",
"+ dp[i] = min(dp[i], dp[i - num9] + 1)"
] | false | 0.536674 | 0.464169 | 1.156204 | [
"s526758304",
"s159761707"
] |
u671060652 | p02934 | python | s188797997 | s331616550 | 178 | 163 | 38,256 | 38,256 | Accepted | Accepted | 8.43 | n = int(eval(input()))
a_list = list(map(int, input().split()))
sum = 0
for i in a_list:
sum += 1/i
print((1/sum)) | n = int(eval(input()))
a = list(map(int, input().split()))
sum = 0
for i in range(n):
sum += 1/a[i]
print((1/sum)) | 8 | 7 | 119 | 117 | n = int(eval(input()))
a_list = list(map(int, input().split()))
sum = 0
for i in a_list:
sum += 1 / i
print((1 / sum))
| n = int(eval(input()))
a = list(map(int, input().split()))
sum = 0
for i in range(n):
sum += 1 / a[i]
print((1 / sum))
| false | 12.5 | [
"-a_list = list(map(int, input().split()))",
"+a = list(map(int, input().split()))",
"-for i in a_list:",
"- sum += 1 / i",
"+for i in range(n):",
"+ sum += 1 / a[i]"
] | false | 0.006568 | 0.036349 | 0.180681 | [
"s188797997",
"s331616550"
] |
u225388820 | p04045 | python | s138839675 | s165358186 | 153 | 68 | 2,940 | 3,060 | Accepted | Accepted | 55.56 | n,k= list(map(int, input().split()))
d= list(input().split())
for i in range(n,10*n+1):
x=str(i)
ans=True
for j in range(len(x)):
if x[j] in d:
ans=False
if ans:
print(i)
break
| n,k=list(map(int,input().split()))
d=list(input().split())
for i in range(n,10*n):
a=str(i)
b=len(a)
ans=True
for j in a:
if j in d:
ans=False
break
if ans:
print(i)
exit() | 11 | 13 | 233 | 247 | n, k = list(map(int, input().split()))
d = list(input().split())
for i in range(n, 10 * n + 1):
x = str(i)
ans = True
for j in range(len(x)):
if x[j] in d:
ans = False
if ans:
print(i)
break
| n, k = list(map(int, input().split()))
d = list(input().split())
for i in range(n, 10 * n):
a = str(i)
b = len(a)
ans = True
for j in a:
if j in d:
ans = False
break
if ans:
print(i)
exit()
| false | 15.384615 | [
"-for i in range(n, 10 * n + 1):",
"- x = str(i)",
"+for i in range(n, 10 * n):",
"+ a = str(i)",
"+ b = len(a)",
"- for j in range(len(x)):",
"- if x[j] in d:",
"+ for j in a:",
"+ if j in d:",
"+ break",
"- break",
"+ exit()"
] | false | 0.046819 | 0.083758 | 0.558975 | [
"s138839675",
"s165358186"
] |
u263737105 | p02583 | python | s936525808 | s066014764 | 154 | 113 | 9,108 | 9,084 | Accepted | Accepted | 26.62 | import itertools as it
N = int(eval(input())) - 1
s = list(map(int, input().split()))
count = 0
c = it.combinations(s, 3)
for i in c:
listed = list(i)
if listed[0] == listed[1] or listed[1] == listed[2] or listed[2] == listed[0]:
continue
maximum = max(listed)
listed.remove(maximum)
if (listed[0] + listed[1]) > maximum:
count += 1
print(count) | import itertools as it
N = int(eval(input()))
s = list(map(int, input().split()))
s.sort()
count = 0
c = it.combinations(s, 3)
for i in c:
listed = list(i)
if listed[0] == listed[1] or listed[1] == listed[2] or listed[2] == listed[0]:
continue
if (listed[0] + listed[1]) > listed[2]:
count += 1
print(count) | 19 | 19 | 398 | 353 | import itertools as it
N = int(eval(input())) - 1
s = list(map(int, input().split()))
count = 0
c = it.combinations(s, 3)
for i in c:
listed = list(i)
if listed[0] == listed[1] or listed[1] == listed[2] or listed[2] == listed[0]:
continue
maximum = max(listed)
listed.remove(maximum)
if (listed[0] + listed[1]) > maximum:
count += 1
print(count)
| import itertools as it
N = int(eval(input()))
s = list(map(int, input().split()))
s.sort()
count = 0
c = it.combinations(s, 3)
for i in c:
listed = list(i)
if listed[0] == listed[1] or listed[1] == listed[2] or listed[2] == listed[0]:
continue
if (listed[0] + listed[1]) > listed[2]:
count += 1
print(count)
| false | 0 | [
"-N = int(eval(input())) - 1",
"+N = int(eval(input()))",
"+s.sort()",
"- maximum = max(listed)",
"- listed.remove(maximum)",
"- if (listed[0] + listed[1]) > maximum:",
"+ if (listed[0] + listed[1]) > listed[2]:"
] | false | 0.007003 | 0.135586 | 0.051651 | [
"s936525808",
"s066014764"
] |
u259738923 | p03796 | python | s302384206 | s630948343 | 52 | 35 | 2,940 | 2,940 | Accepted | Accepted | 32.69 | n = int(eval(input()))
ans = 1
i = 1
while i < n+1:
ans *= i
i += 1
ans %= 10 ** 9 +7
print(ans) | N=int(eval(input()))
power=1
i=1
div_num = 10**9 + 7
for i in range(1,N+1):
power = (power*i) % div_num
print(power) | 8 | 7 | 100 | 126 | n = int(eval(input()))
ans = 1
i = 1
while i < n + 1:
ans *= i
i += 1
ans %= 10**9 + 7
print(ans)
| N = int(eval(input()))
power = 1
i = 1
div_num = 10**9 + 7
for i in range(1, N + 1):
power = (power * i) % div_num
print(power)
| false | 12.5 | [
"-n = int(eval(input()))",
"-ans = 1",
"+N = int(eval(input()))",
"+power = 1",
"-while i < n + 1:",
"- ans *= i",
"- i += 1",
"- ans %= 10**9 + 7",
"-print(ans)",
"+div_num = 10**9 + 7",
"+for i in range(1, N + 1):",
"+ power = (power * i) % div_num",
"+print(power)"
] | false | 0.22908 | 0.050523 | 4.534191 | [
"s302384206",
"s630948343"
] |
u970308980 | p04011 | python | s556076021 | s386281760 | 19 | 17 | 3,060 | 2,940 | Accepted | Accepted | 10.53 | def abc():
n = int(eval(input()))
k = int(eval(input()))
x = int(eval(input()))
y = int(eval(input()))
fee = 0
if n <= k:
fee += n * x
else:
fee += k * x
fee += (n - k) * y
print(fee)
abc()
| def abc():
n = int(eval(input()))
k = int(eval(input()))
x = int(eval(input()))
y = int(eval(input()))
if n <= k:
print((n * x))
return
print((k * x + (n - k) * y))
abc()
| 16 | 12 | 240 | 196 | def abc():
n = int(eval(input()))
k = int(eval(input()))
x = int(eval(input()))
y = int(eval(input()))
fee = 0
if n <= k:
fee += n * x
else:
fee += k * x
fee += (n - k) * y
print(fee)
abc()
| def abc():
n = int(eval(input()))
k = int(eval(input()))
x = int(eval(input()))
y = int(eval(input()))
if n <= k:
print((n * x))
return
print((k * x + (n - k) * y))
abc()
| false | 25 | [
"- fee = 0",
"- fee += n * x",
"- else:",
"- fee += k * x",
"- fee += (n - k) * y",
"- print(fee)",
"+ print((n * x))",
"+ return",
"+ print((k * x + (n - k) * y))"
] | false | 0.065573 | 0.075679 | 0.866464 | [
"s556076021",
"s386281760"
] |
u572012241 | p02724 | python | s064359758 | s087140839 | 192 | 169 | 38,412 | 38,384 | Accepted | Accepted | 11.98 | x = int(eval(input()))
# a,b = map(int, input().split())
# l = list(map(int, input().split()))
ans = 0
r5 = int(x/500)
x= x- 500*r5
r1 = int(x/5)
print((r5*1000 + r1*5))
| from collections import deque
s = int(eval(input()))
big = int(s/500)
s = s- big*500
print((big*1000 +int(s/5)*5))
| 10 | 7 | 173 | 115 | x = int(eval(input()))
# a,b = map(int, input().split())
# l = list(map(int, input().split()))
ans = 0
r5 = int(x / 500)
x = x - 500 * r5
r1 = int(x / 5)
print((r5 * 1000 + r1 * 5))
| from collections import deque
s = int(eval(input()))
big = int(s / 500)
s = s - big * 500
print((big * 1000 + int(s / 5) * 5))
| false | 30 | [
"-x = int(eval(input()))",
"-# a,b = map(int, input().split())",
"-# l = list(map(int, input().split()))",
"-ans = 0",
"-r5 = int(x / 500)",
"-x = x - 500 * r5",
"-r1 = int(x / 5)",
"-print((r5 * 1000 + r1 * 5))",
"+from collections import deque",
"+",
"+s = int(eval(input()))",
"+big = int(s / 500)",
"+s = s - big * 500",
"+print((big * 1000 + int(s / 5) * 5))"
] | false | 0.038306 | 0.041306 | 0.927372 | [
"s064359758",
"s087140839"
] |
u994988729 | p03325 | python | s956929174 | s108410046 | 110 | 93 | 4,152 | 4,148 | Accepted | Accepted | 15.45 | n=int(eval(input()))
a=list(map(int,input().split()))
ans=0
for i in a:
while True:
if i%2!=0:
break
ans+=1
i/=2
print(ans)
| N = int(eval(input()))
A = list(map(int, input().split()))
ans = 0
for a in A:
while a % 2 == 0:
if not a:
break
ans += 1
a //= 2
print(ans)
| 10 | 12 | 167 | 188 | n = int(eval(input()))
a = list(map(int, input().split()))
ans = 0
for i in a:
while True:
if i % 2 != 0:
break
ans += 1
i /= 2
print(ans)
| N = int(eval(input()))
A = list(map(int, input().split()))
ans = 0
for a in A:
while a % 2 == 0:
if not a:
break
ans += 1
a //= 2
print(ans)
| false | 16.666667 | [
"-n = int(eval(input()))",
"-a = list(map(int, input().split()))",
"+N = int(eval(input()))",
"+A = list(map(int, input().split()))",
"-for i in a:",
"- while True:",
"- if i % 2 != 0:",
"+for a in A:",
"+ while a % 2 == 0:",
"+ if not a:",
"- i /= 2",
"+ a //= 2"
] | false | 0.038713 | 0.040979 | 0.944704 | [
"s956929174",
"s108410046"
] |
u465699806 | p03212 | python | s706093636 | s499105672 | 261 | 217 | 43,376 | 83,204 | Accepted | Accepted | 16.86 | import random as rng
import itertools as it
import collections as col
import heapq as hq
import sys
import copy as cp
sys.setrecursionlimit(10**9)
def dump_impl(*objects):
print(*objects, file=sys.stderr)
def dump_dummy(*objects):
pass
dump = dump_impl if "DEBUG" in sys.argv else dump_dummy
N = int(input())
ans = 0
for m in range(10):
for s in it.product("753", repeat=m):
dump(s)
if '3' in s and '5' in s and '7' in s and int("".join(s)) <= N:
ans += 1
print(ans)
| import random as rng
import itertools as it
import collections as col
import heapq as hq
import sys
import copy as cp
sys.setrecursionlimit(10**9)
def dump_impl(*objects):
print(*objects, file=sys.stderr)
def dump_dummy(*objects):
pass
dump = dump_impl if "DEBUG" in sys.argv else dump_dummy
N = int(input())
ans = 0
for n in range(3, 10):
for l in it.product(["7", "5", "3"], repeat=n):
if "7" not in l or "5" not in l or "3" not in l:
continue
M = int("".join(l))
if M <= N:
dump(M, ans)
ans += 1
dump(N)
print(ans)
| 27 | 32 | 540 | 629 | import random as rng
import itertools as it
import collections as col
import heapq as hq
import sys
import copy as cp
sys.setrecursionlimit(10**9)
def dump_impl(*objects):
print(*objects, file=sys.stderr)
def dump_dummy(*objects):
pass
dump = dump_impl if "DEBUG" in sys.argv else dump_dummy
N = int(input())
ans = 0
for m in range(10):
for s in it.product("753", repeat=m):
dump(s)
if "3" in s and "5" in s and "7" in s and int("".join(s)) <= N:
ans += 1
print(ans)
| import random as rng
import itertools as it
import collections as col
import heapq as hq
import sys
import copy as cp
sys.setrecursionlimit(10**9)
def dump_impl(*objects):
print(*objects, file=sys.stderr)
def dump_dummy(*objects):
pass
dump = dump_impl if "DEBUG" in sys.argv else dump_dummy
N = int(input())
ans = 0
for n in range(3, 10):
for l in it.product(["7", "5", "3"], repeat=n):
if "7" not in l or "5" not in l or "3" not in l:
continue
M = int("".join(l))
if M <= N:
dump(M, ans)
ans += 1
dump(N)
print(ans)
| false | 15.625 | [
"-for m in range(10):",
"- for s in it.product(\"753\", repeat=m):",
"- dump(s)",
"- if \"3\" in s and \"5\" in s and \"7\" in s and int(\"\".join(s)) <= N:",
"+for n in range(3, 10):",
"+ for l in it.product([\"7\", \"5\", \"3\"], repeat=n):",
"+ if \"7\" not in l or \"5\" not in l or \"3\" not in l:",
"+ continue",
"+ M = int(\"\".join(l))",
"+ if M <= N:",
"+ dump(M, ans)",
"+dump(N)"
] | false | 0.079886 | 0.056197 | 1.421537 | [
"s706093636",
"s499105672"
] |
u919730120 | p02695 | python | s245483435 | s668192955 | 1,279 | 581 | 9,120 | 9,136 | Accepted | Accepted | 54.57 | from itertools import combinations_with_replacement
n,m,q=list(map(int,input().split()))
abcd=[list(map(int,input().split())) for _ in range(q)]
s=0
for p in combinations_with_replacement(list(range(1,m+1)),n):
t=0
for a,b,c,d in abcd:
t+=d*(p[b-1]-p[a-1]==c)
s=max(s,t)
print(s) | n,m,q=list(map(int,input().split()))
abcd=[list(map(int,input().split())) for _ in range(q)]
ans,now=0,0
def chk(x):
global ans
if len(x)>=n+1:
now=0
for a,b,c,d in abcd:
if x[b-1]-x[a-1]==c:
now+=d
ans=max(ans,now)
return
for i in range(x[-1],m+1):
chk(x+[i])
chk([1])
print(ans) | 10 | 16 | 296 | 369 | from itertools import combinations_with_replacement
n, m, q = list(map(int, input().split()))
abcd = [list(map(int, input().split())) for _ in range(q)]
s = 0
for p in combinations_with_replacement(list(range(1, m + 1)), n):
t = 0
for a, b, c, d in abcd:
t += d * (p[b - 1] - p[a - 1] == c)
s = max(s, t)
print(s)
| n, m, q = list(map(int, input().split()))
abcd = [list(map(int, input().split())) for _ in range(q)]
ans, now = 0, 0
def chk(x):
global ans
if len(x) >= n + 1:
now = 0
for a, b, c, d in abcd:
if x[b - 1] - x[a - 1] == c:
now += d
ans = max(ans, now)
return
for i in range(x[-1], m + 1):
chk(x + [i])
chk([1])
print(ans)
| false | 37.5 | [
"-from itertools import combinations_with_replacement",
"-",
"-s = 0",
"-for p in combinations_with_replacement(list(range(1, m + 1)), n):",
"- t = 0",
"- for a, b, c, d in abcd:",
"- t += d * (p[b - 1] - p[a - 1] == c)",
"- s = max(s, t)",
"-print(s)",
"+ans, now = 0, 0",
"+",
"+",
"+def chk(x):",
"+ global ans",
"+ if len(x) >= n + 1:",
"+ now = 0",
"+ for a, b, c, d in abcd:",
"+ if x[b - 1] - x[a - 1] == c:",
"+ now += d",
"+ ans = max(ans, now)",
"+ return",
"+ for i in range(x[-1], m + 1):",
"+ chk(x + [i])",
"+",
"+",
"+chk([1])",
"+print(ans)"
] | false | 0.05584 | 0.113538 | 0.491817 | [
"s245483435",
"s668192955"
] |
u014333473 | p03502 | python | s644904965 | s194838988 | 32 | 29 | 9,168 | 9,168 | Accepted | Accepted | 9.38 | a=eval(input());print(('YNeos'[int(a)%sum([int(i) for i in a])!=0::2])) | a=eval(input());print(('YNeos'[int(a)%sum(map(int,a))!=0::2])) | 1 | 1 | 63 | 54 | a = eval(input())
print(("YNeos"[int(a) % sum([int(i) for i in a]) != 0 :: 2]))
| a = eval(input())
print(("YNeos"[int(a) % sum(map(int, a)) != 0 :: 2]))
| false | 0 | [
"-print((\"YNeos\"[int(a) % sum([int(i) for i in a]) != 0 :: 2]))",
"+print((\"YNeos\"[int(a) % sum(map(int, a)) != 0 :: 2]))"
] | false | 0.040411 | 0.040706 | 0.992742 | [
"s644904965",
"s194838988"
] |
u634677999 | p03073 | python | s583593115 | s920254704 | 121 | 64 | 10,156 | 7,468 | Accepted | Accepted | 47.11 | s=list(eval(input()))
if(len(s)==1):
print((0))
else:
a=s[:]
fir,sec=0,0
for i in range(len(s)-1):
if(s[i]==s[i+1]):
s[i+1] = str(1 - (ord(s[i])-48))
fir+=1
for i in range(len(s)-1,0,-1):
if(a[i]==a[i-1]):
a[i-1] = str(1 - (ord(a[i])-48))
sec+=1
print((min(fir,sec)))
| s=list(eval(input()))
if(len(s)==1):
print((0))
else:
a=s[:]
fir,sec=0,0
for i in range(len(s)-1):
if(s[i]==s[i+1]):
s[i+1] = str(1 - (ord(s[i])-48))
fir+=1
print(fir)
| 17 | 13 | 372 | 234 | s = list(eval(input()))
if len(s) == 1:
print((0))
else:
a = s[:]
fir, sec = 0, 0
for i in range(len(s) - 1):
if s[i] == s[i + 1]:
s[i + 1] = str(1 - (ord(s[i]) - 48))
fir += 1
for i in range(len(s) - 1, 0, -1):
if a[i] == a[i - 1]:
a[i - 1] = str(1 - (ord(a[i]) - 48))
sec += 1
print((min(fir, sec)))
| s = list(eval(input()))
if len(s) == 1:
print((0))
else:
a = s[:]
fir, sec = 0, 0
for i in range(len(s) - 1):
if s[i] == s[i + 1]:
s[i + 1] = str(1 - (ord(s[i]) - 48))
fir += 1
print(fir)
| false | 23.529412 | [
"- for i in range(len(s) - 1, 0, -1):",
"- if a[i] == a[i - 1]:",
"- a[i - 1] = str(1 - (ord(a[i]) - 48))",
"- sec += 1",
"- print((min(fir, sec)))",
"+ print(fir)"
] | false | 0.056961 | 0.120024 | 0.474582 | [
"s583593115",
"s920254704"
] |
u036104576 | p04015 | python | s372065274 | s729466733 | 782 | 91 | 10,932 | 9,228 | Accepted | Accepted | 88.36 | import sys
import itertools
# import numpy as np
import time
import math
import heapq
from collections import defaultdict
sys.setrecursionlimit(10 ** 7)
INF = 10 ** 18
MOD = 10 ** 9 + 7
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
# map(int, input().split())
N, A = list(map(int, input().split()))
X = list(map(int, input().split()))
dp = [[0] * 2501 for _ in range(51)]
dp[0][0] = 1
for i in range(N):
x = X[i]
for j in range(i, -1, -1):
for k in range(2501):
if k < x:
continue
dp[j + 1][k] += dp[j][k - x]
ans = 0
for i in range(1, 51):
ans += dp[i][i * A]
print(ans)
| N, A = list(map(int, input().split()))
X = list(map(int, input().split()))
Y = [x - A for x in X]
dp = [0] * 5010
dp[2500] = 1
for y in Y:
r = []
if y >= 0:
r = list(range(5009, -1, -1))
else:
r = list(range(5010))
for i in r:
if i - y < 0 or i - y >= 5010:
continue
dp[i] += dp[i - y]
print((dp[2500] - 1))
| 35 | 18 | 726 | 367 | import sys
import itertools
# import numpy as np
import time
import math
import heapq
from collections import defaultdict
sys.setrecursionlimit(10**7)
INF = 10**18
MOD = 10**9 + 7
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
# map(int, input().split())
N, A = list(map(int, input().split()))
X = list(map(int, input().split()))
dp = [[0] * 2501 for _ in range(51)]
dp[0][0] = 1
for i in range(N):
x = X[i]
for j in range(i, -1, -1):
for k in range(2501):
if k < x:
continue
dp[j + 1][k] += dp[j][k - x]
ans = 0
for i in range(1, 51):
ans += dp[i][i * A]
print(ans)
| N, A = list(map(int, input().split()))
X = list(map(int, input().split()))
Y = [x - A for x in X]
dp = [0] * 5010
dp[2500] = 1
for y in Y:
r = []
if y >= 0:
r = list(range(5009, -1, -1))
else:
r = list(range(5010))
for i in r:
if i - y < 0 or i - y >= 5010:
continue
dp[i] += dp[i - y]
print((dp[2500] - 1))
| false | 48.571429 | [
"-import sys",
"-import itertools",
"-",
"-# import numpy as np",
"-import time",
"-import math",
"-import heapq",
"-from collections import defaultdict",
"-",
"-sys.setrecursionlimit(10**7)",
"-INF = 10**18",
"-MOD = 10**9 + 7",
"-read = sys.stdin.buffer.read",
"-readline = sys.stdin.buffer.readline",
"-readlines = sys.stdin.buffer.readlines",
"-# map(int, input().split())",
"-dp = [[0] * 2501 for _ in range(51)]",
"-dp[0][0] = 1",
"-for i in range(N):",
"- x = X[i]",
"- for j in range(i, -1, -1):",
"- for k in range(2501):",
"- if k < x:",
"- continue",
"- dp[j + 1][k] += dp[j][k - x]",
"-ans = 0",
"-for i in range(1, 51):",
"- ans += dp[i][i * A]",
"-print(ans)",
"+Y = [x - A for x in X]",
"+dp = [0] * 5010",
"+dp[2500] = 1",
"+for y in Y:",
"+ r = []",
"+ if y >= 0:",
"+ r = list(range(5009, -1, -1))",
"+ else:",
"+ r = list(range(5010))",
"+ for i in r:",
"+ if i - y < 0 or i - y >= 5010:",
"+ continue",
"+ dp[i] += dp[i - y]",
"+print((dp[2500] - 1))"
] | false | 0.354529 | 0.084963 | 4.17276 | [
"s372065274",
"s729466733"
] |
u753803401 | p03796 | python | s209713473 | s217675409 | 39 | 34 | 2,940 | 2,940 | Accepted | Accepted | 12.82 | n = int(eval(input()))
p = 1
for i in range(n):
p = (p * (i + 1)) % (10 ** 9 + 7)
print(p)
| n = int(eval(input()))
p = 1
for i in range(1, n + 1):
p = (p * i) % (10 ** 9 + 7)
print(p)
| 5 | 5 | 93 | 94 | n = int(eval(input()))
p = 1
for i in range(n):
p = (p * (i + 1)) % (10**9 + 7)
print(p)
| n = int(eval(input()))
p = 1
for i in range(1, n + 1):
p = (p * i) % (10**9 + 7)
print(p)
| false | 0 | [
"-for i in range(n):",
"- p = (p * (i + 1)) % (10**9 + 7)",
"+for i in range(1, n + 1):",
"+ p = (p * i) % (10**9 + 7)"
] | false | 0.047908 | 0.050958 | 0.940147 | [
"s209713473",
"s217675409"
] |
u075012704 | p03959 | python | s917058388 | s489169460 | 167 | 136 | 18,756 | 18,884 | Accepted | Accepted | 18.56 | N = int(eval(input()))
T = list(map(int, input().split()))
A = list(map(int, input().split()))
T = [T[0]] + T + [T[-1]]
A = [A[0]] + A + [A[-1]]
ans = 1
mod = 10**9 + 7
for i in range(1, N+1):
if T[i-1] < T[i] and A[i + 1] < A[i]:
if T[i] != A[i]:
ans *= 0
continue
if T[i-1] < T[i]:
if A[i] < T[i]:
ans *= 0
continue
if A[i] > A[i+1]:
if T[i] < A[i]:
ans *= 0
continue
if i == 1 or i == N:
if T[N] != A[1]:
ans *= 0
else:
ans *= 1
continue
ans = (ans * min(T[i], A[i])) % mod
print((ans % mod))
| N = int(eval(input()))
T = list(map(int, input().split()))
A = list(map(int, input().split()))
not_fixed = [True] * N
# 矛盾のチェック
MAX = 0
for i in range(N):
if T[i] > MAX:
MAX = T[i]
not_fixed[i] = False
if T[i] > A[i]:
print((0))
exit()
MAX = 0
for i in reversed(list(range(N))):
if A[i] > MAX:
MAX = A[i]
not_fixed[i] = False
if A[i] > T[i]:
print((0))
exit()
MIN = [min(t, a) for t, a in zip(T, A)]
ans = 1
mod = 10 ** 9 + 7
for i in range(N):
if not_fixed[i]:
ans *= MIN[i]
ans %= mod
print(ans)
| 35 | 36 | 681 | 648 | N = int(eval(input()))
T = list(map(int, input().split()))
A = list(map(int, input().split()))
T = [T[0]] + T + [T[-1]]
A = [A[0]] + A + [A[-1]]
ans = 1
mod = 10**9 + 7
for i in range(1, N + 1):
if T[i - 1] < T[i] and A[i + 1] < A[i]:
if T[i] != A[i]:
ans *= 0
continue
if T[i - 1] < T[i]:
if A[i] < T[i]:
ans *= 0
continue
if A[i] > A[i + 1]:
if T[i] < A[i]:
ans *= 0
continue
if i == 1 or i == N:
if T[N] != A[1]:
ans *= 0
else:
ans *= 1
continue
ans = (ans * min(T[i], A[i])) % mod
print((ans % mod))
| N = int(eval(input()))
T = list(map(int, input().split()))
A = list(map(int, input().split()))
not_fixed = [True] * N
# 矛盾のチェック
MAX = 0
for i in range(N):
if T[i] > MAX:
MAX = T[i]
not_fixed[i] = False
if T[i] > A[i]:
print((0))
exit()
MAX = 0
for i in reversed(list(range(N))):
if A[i] > MAX:
MAX = A[i]
not_fixed[i] = False
if A[i] > T[i]:
print((0))
exit()
MIN = [min(t, a) for t, a in zip(T, A)]
ans = 1
mod = 10**9 + 7
for i in range(N):
if not_fixed[i]:
ans *= MIN[i]
ans %= mod
print(ans)
| false | 2.777778 | [
"-T = [T[0]] + T + [T[-1]]",
"-A = [A[0]] + A + [A[-1]]",
"+not_fixed = [True] * N",
"+# 矛盾のチェック",
"+MAX = 0",
"+for i in range(N):",
"+ if T[i] > MAX:",
"+ MAX = T[i]",
"+ not_fixed[i] = False",
"+ if T[i] > A[i]:",
"+ print((0))",
"+ exit()",
"+MAX = 0",
"+for i in reversed(list(range(N))):",
"+ if A[i] > MAX:",
"+ MAX = A[i]",
"+ not_fixed[i] = False",
"+ if A[i] > T[i]:",
"+ print((0))",
"+ exit()",
"+MIN = [min(t, a) for t, a in zip(T, A)]",
"-for i in range(1, N + 1):",
"- if T[i - 1] < T[i] and A[i + 1] < A[i]:",
"- if T[i] != A[i]:",
"- ans *= 0",
"- continue",
"- if T[i - 1] < T[i]:",
"- if A[i] < T[i]:",
"- ans *= 0",
"- continue",
"- if A[i] > A[i + 1]:",
"- if T[i] < A[i]:",
"- ans *= 0",
"- continue",
"- if i == 1 or i == N:",
"- if T[N] != A[1]:",
"- ans *= 0",
"- else:",
"- ans *= 1",
"- continue",
"- ans = (ans * min(T[i], A[i])) % mod",
"-print((ans % mod))",
"+for i in range(N):",
"+ if not_fixed[i]:",
"+ ans *= MIN[i]",
"+ ans %= mod",
"+print(ans)"
] | false | 0.04674 | 0.049052 | 0.952875 | [
"s917058388",
"s489169460"
] |
u898109279 | p02603 | python | s955182090 | s044390993 | 31 | 27 | 9,064 | 9,128 | Accepted | Accepted | 12.9 | N = int(eval(input()))
A = list(map(int, input().split()))
money = 1000
stock = 0
for i in range(N):
if i == N - 1:
money += stock * A[i]
break
if A[i] < A[i + 1]:
buy_stock = money // A[i]
money -= A[i] * buy_stock
stock += buy_stock
elif A[i] > A[i + 1]:
money += A[i] * stock
stock = 0
print(money)
| N = int(eval(input()))
A = list(map(int, input().split()))
money = 1000
stock = 0
for i in range(N):
if i == N - 1:
money += stock * A[i]
break
if A[i] < A[i + 1]:
stock += money // A[i]
money %= A[i]
elif A[i] > A[i + 1]:
money += A[i] * stock
stock = 0
print(money)
| 19 | 18 | 385 | 342 | N = int(eval(input()))
A = list(map(int, input().split()))
money = 1000
stock = 0
for i in range(N):
if i == N - 1:
money += stock * A[i]
break
if A[i] < A[i + 1]:
buy_stock = money // A[i]
money -= A[i] * buy_stock
stock += buy_stock
elif A[i] > A[i + 1]:
money += A[i] * stock
stock = 0
print(money)
| N = int(eval(input()))
A = list(map(int, input().split()))
money = 1000
stock = 0
for i in range(N):
if i == N - 1:
money += stock * A[i]
break
if A[i] < A[i + 1]:
stock += money // A[i]
money %= A[i]
elif A[i] > A[i + 1]:
money += A[i] * stock
stock = 0
print(money)
| false | 5.263158 | [
"- buy_stock = money // A[i]",
"- money -= A[i] * buy_stock",
"- stock += buy_stock",
"+ stock += money // A[i]",
"+ money %= A[i]"
] | false | 0.03805 | 0.089733 | 0.424033 | [
"s955182090",
"s044390993"
] |
u078181689 | p02928 | python | s346889885 | s045875353 | 962 | 788 | 3,188 | 3,188 | Accepted | Accepted | 18.09 | n,k = list(map(int,input().split()))
arr = list(map(int,input().split()))
leftCount = 0
rightCount = 0
mod = 10**9 + 7
for i in range(n):
for j in range(n):
if arr[i] > arr[j]:
if i < j:
rightCount +=1
else:
leftCount +=1
leftCount = leftCount*k*(k-1)//2
rightCount = rightCount*k*(k+1)//2
count = (leftCount % mod) + (rightCount % mod)
count %= mod
print(count) | n, k = input().split()
l = list(map(int,input().split()))
n = int(n)
k = int(k)
rn_0 , rn_2 = 0, 0
for i in range(n-1):
for j in range(i+1, n):
if l[i] > l[j]:
rn_0 += 1
for i in range(n):
for j in range(0, i):
if l[i] > l[j]:
rn_2 += 1
rn_0 *= k*(k+1)//2
rn_2 *= k*(k-1)//2
rn = (rn_0 % (10**9+7)) + (rn_2 % (10**9+7))
print((rn%(10**9+7)))
| 19 | 22 | 444 | 390 | n, k = list(map(int, input().split()))
arr = list(map(int, input().split()))
leftCount = 0
rightCount = 0
mod = 10**9 + 7
for i in range(n):
for j in range(n):
if arr[i] > arr[j]:
if i < j:
rightCount += 1
else:
leftCount += 1
leftCount = leftCount * k * (k - 1) // 2
rightCount = rightCount * k * (k + 1) // 2
count = (leftCount % mod) + (rightCount % mod)
count %= mod
print(count)
| n, k = input().split()
l = list(map(int, input().split()))
n = int(n)
k = int(k)
rn_0, rn_2 = 0, 0
for i in range(n - 1):
for j in range(i + 1, n):
if l[i] > l[j]:
rn_0 += 1
for i in range(n):
for j in range(0, i):
if l[i] > l[j]:
rn_2 += 1
rn_0 *= k * (k + 1) // 2
rn_2 *= k * (k - 1) // 2
rn = (rn_0 % (10**9 + 7)) + (rn_2 % (10**9 + 7))
print((rn % (10**9 + 7)))
| false | 13.636364 | [
"-n, k = list(map(int, input().split()))",
"-arr = list(map(int, input().split()))",
"-leftCount = 0",
"-rightCount = 0",
"-mod = 10**9 + 7",
"+n, k = input().split()",
"+l = list(map(int, input().split()))",
"+n = int(n)",
"+k = int(k)",
"+rn_0, rn_2 = 0, 0",
"+for i in range(n - 1):",
"+ for j in range(i + 1, n):",
"+ if l[i] > l[j]:",
"+ rn_0 += 1",
"- for j in range(n):",
"- if arr[i] > arr[j]:",
"- if i < j:",
"- rightCount += 1",
"- else:",
"- leftCount += 1",
"-leftCount = leftCount * k * (k - 1) // 2",
"-rightCount = rightCount * k * (k + 1) // 2",
"-count = (leftCount % mod) + (rightCount % mod)",
"-count %= mod",
"-print(count)",
"+ for j in range(0, i):",
"+ if l[i] > l[j]:",
"+ rn_2 += 1",
"+rn_0 *= k * (k + 1) // 2",
"+rn_2 *= k * (k - 1) // 2",
"+rn = (rn_0 % (10**9 + 7)) + (rn_2 % (10**9 + 7))",
"+print((rn % (10**9 + 7)))"
] | false | 0.075162 | 0.129425 | 0.580737 | [
"s346889885",
"s045875353"
] |
u131464432 | p02947 | python | s816127682 | s843955174 | 308 | 222 | 28,664 | 23,940 | Accepted | Accepted | 27.92 | import collections
N = int(eval(input()))
A = []
for i in range(N):
s = sorted(eval(input()))
A.append(str(s))
B = collections.Counter(A)
print((sum(i*(i-1)//2 for i in list(B.values())))) | import collections
N = int(eval(input()))
s = ["".join(sorted(eval(input()))) for _ in range(N)]
B = collections.Counter(s)
print((sum(i*(i-1)//2 for i in list(B.values())))) | 8 | 5 | 183 | 158 | import collections
N = int(eval(input()))
A = []
for i in range(N):
s = sorted(eval(input()))
A.append(str(s))
B = collections.Counter(A)
print((sum(i * (i - 1) // 2 for i in list(B.values()))))
| import collections
N = int(eval(input()))
s = ["".join(sorted(eval(input()))) for _ in range(N)]
B = collections.Counter(s)
print((sum(i * (i - 1) // 2 for i in list(B.values()))))
| false | 37.5 | [
"-A = []",
"-for i in range(N):",
"- s = sorted(eval(input()))",
"- A.append(str(s))",
"-B = collections.Counter(A)",
"+s = [\"\".join(sorted(eval(input()))) for _ in range(N)]",
"+B = collections.Counter(s)"
] | false | 0.035472 | 0.038874 | 0.912497 | [
"s816127682",
"s843955174"
] |
u967835038 | p03107 | python | s643021550 | s189654964 | 21 | 18 | 3,188 | 3,188 | Accepted | Accepted | 14.29 | s = str(eval(input()))
figure1 = s.count('0')
figure2 = s.count('1')
print((min(figure1, figure2)*2))
| s=str(eval(input()))
print((min(s.count('0'),s.count('1'))*2))
| 4 | 2 | 97 | 56 | s = str(eval(input()))
figure1 = s.count("0")
figure2 = s.count("1")
print((min(figure1, figure2) * 2))
| s = str(eval(input()))
print((min(s.count("0"), s.count("1")) * 2))
| false | 50 | [
"-figure1 = s.count(\"0\")",
"-figure2 = s.count(\"1\")",
"-print((min(figure1, figure2) * 2))",
"+print((min(s.count(\"0\"), s.count(\"1\")) * 2))"
] | false | 0.15732 | 0.04843 | 3.248413 | [
"s643021550",
"s189654964"
] |
u210827208 | p03503 | python | s605699397 | s492733734 | 286 | 84 | 3,064 | 3,188 | Accepted | Accepted | 70.63 | n=int(eval(input()))
S=[list(map(str,input().split())) for _ in range(n)]
C=[list(map(int,input().split())) for _ in range(n)]
A=[]
for i in range(1,2**10):
ans=0
X=format(i,'b').zfill(10)
for j in range(n):
cnt=0
for k in range(10):
if S[j][k]=='1' and X[k]=='1':
cnt+=1
ans+=C[j][cnt]
A.append(ans)
print((max(A))) | n=int(eval(input()))
S=[int(input().replace(' ',''),2) for _ in range(n)]
C=[list(map(int,input().split())) for _ in range(n)]
A=[]
for i in range(1,2**10):
ans=0
for j in range(n):
cnt=bin(S[j]&i).count('1')
ans+=C[j][cnt]
A.append(ans)
print((max(A))) | 15 | 11 | 393 | 290 | n = int(eval(input()))
S = [list(map(str, input().split())) for _ in range(n)]
C = [list(map(int, input().split())) for _ in range(n)]
A = []
for i in range(1, 2**10):
ans = 0
X = format(i, "b").zfill(10)
for j in range(n):
cnt = 0
for k in range(10):
if S[j][k] == "1" and X[k] == "1":
cnt += 1
ans += C[j][cnt]
A.append(ans)
print((max(A)))
| n = int(eval(input()))
S = [int(input().replace(" ", ""), 2) for _ in range(n)]
C = [list(map(int, input().split())) for _ in range(n)]
A = []
for i in range(1, 2**10):
ans = 0
for j in range(n):
cnt = bin(S[j] & i).count("1")
ans += C[j][cnt]
A.append(ans)
print((max(A)))
| false | 26.666667 | [
"-S = [list(map(str, input().split())) for _ in range(n)]",
"+S = [int(input().replace(\" \", \"\"), 2) for _ in range(n)]",
"- X = format(i, \"b\").zfill(10)",
"- cnt = 0",
"- for k in range(10):",
"- if S[j][k] == \"1\" and X[k] == \"1\":",
"- cnt += 1",
"+ cnt = bin(S[j] & i).count(\"1\")"
] | false | 0.077027 | 0.093319 | 0.825418 | [
"s605699397",
"s492733734"
] |
u347640436 | p02696 | python | s517931954 | s260367309 | 1,441 | 20 | 9,228 | 8,972 | Accepted | Accepted | 98.61 | from math import floor
A, B, N = list(map(int, input().split()))
def f(x):
return floor(A * x / B) - A * floor(x / B)
result = 0
for x in range(min(A + 1, N + 1)):
result = max(result, f(x))
if B > A:
for i in range(10 ** 20):
x = (i * B + A - 1) // A
if x > N:
break
result = max(result, f(x))
print(result)
| from math import floor
A, B, N = list(map(int, input().split()))
x = min(B - 1, N)
print((floor(A * x / B) - A * floor(x / B)))
| 19 | 6 | 374 | 127 | from math import floor
A, B, N = list(map(int, input().split()))
def f(x):
return floor(A * x / B) - A * floor(x / B)
result = 0
for x in range(min(A + 1, N + 1)):
result = max(result, f(x))
if B > A:
for i in range(10**20):
x = (i * B + A - 1) // A
if x > N:
break
result = max(result, f(x))
print(result)
| from math import floor
A, B, N = list(map(int, input().split()))
x = min(B - 1, N)
print((floor(A * x / B) - A * floor(x / B)))
| false | 68.421053 | [
"-",
"-",
"-def f(x):",
"- return floor(A * x / B) - A * floor(x / B)",
"-",
"-",
"-result = 0",
"-for x in range(min(A + 1, N + 1)):",
"- result = max(result, f(x))",
"-if B > A:",
"- for i in range(10**20):",
"- x = (i * B + A - 1) // A",
"- if x > N:",
"- break",
"- result = max(result, f(x))",
"-print(result)",
"+x = min(B - 1, N)",
"+print((floor(A * x / B) - A * floor(x / B)))"
] | false | 0.04607 | 0.041605 | 1.107308 | [
"s517931954",
"s260367309"
] |
u352394527 | p00120 | python | s634157503 | s667115800 | 900 | 560 | 8,872 | 7,108 | Accepted | Accepted | 37.78 | INF = 10 ** 20
def get_dist(r1, r2):
c = r1 + r2
b = abs(r1 - r2)
return (c ** 2 - b ** 2) ** (1 / 2)
def minimum_width(rest, r, dic):
if (rest, r) in dic:
return dic[(rest, r)]
if rest == ():
return r
ret = INF
lenr = len(rest)
for i, c in enumerate(rest):
ret = min(ret, minimum_width(tuple(rest[j] for j in range(lenr) if i != j), rest[i], dic) + get_dist(r, rest[i]))
dic[(rest, r)] = ret
return ret
while True:
try:
lst = list(map(int, input().split()))
w = lst[0]
cakes = lst[1:]
cakes.sort()
lenc = len(cakes)
dic = {}
ans = INF
for i in range(lenc):
ans = min(ans, minimum_width(tuple(cakes[j] for j in range(lenc) if i != j), cakes[i], dic) + cakes[i])
if w >= ans:
print("OK")
else:
print("NA")
except EOFError:
break
| INF = 10 ** 20
def get_dist(r1, r2):
return ((r1 + r2) ** 2 - (r1 - r2) ** 2) ** (1 / 2)
def minimum_width(rest, r, dic):
if (rest, r) in dic:
return dic[(rest, r)]
if rest == ():
return r
ret = INF
lenr = len(rest)
for c in rest:
next_rest = list(rest)
next_rest.remove(c)
ret = min(ret, minimum_width(tuple(next_rest), c, dic) + get_dist(r, c))
dic[(rest, r)] = ret
return ret
while True:
try:
lst = list(map(int, input().split()))
w = lst[0]
cakes = lst[1:]
cakes.sort()
lenc = len(cakes)
dic = {}
ans = INF
for i in range(lenc):
ans = min(ans, minimum_width(tuple(cakes[j] for j in range(lenc) if i != j), cakes[i], dic) + cakes[i])
if w >= ans:
print("OK")
else:
print("NA")
except EOFError:
break
| 37 | 37 | 866 | 845 | INF = 10**20
def get_dist(r1, r2):
c = r1 + r2
b = abs(r1 - r2)
return (c**2 - b**2) ** (1 / 2)
def minimum_width(rest, r, dic):
if (rest, r) in dic:
return dic[(rest, r)]
if rest == ():
return r
ret = INF
lenr = len(rest)
for i, c in enumerate(rest):
ret = min(
ret,
minimum_width(tuple(rest[j] for j in range(lenr) if i != j), rest[i], dic)
+ get_dist(r, rest[i]),
)
dic[(rest, r)] = ret
return ret
while True:
try:
lst = list(map(int, input().split()))
w = lst[0]
cakes = lst[1:]
cakes.sort()
lenc = len(cakes)
dic = {}
ans = INF
for i in range(lenc):
ans = min(
ans,
minimum_width(
tuple(cakes[j] for j in range(lenc) if i != j), cakes[i], dic
)
+ cakes[i],
)
if w >= ans:
print("OK")
else:
print("NA")
except EOFError:
break
| INF = 10**20
def get_dist(r1, r2):
return ((r1 + r2) ** 2 - (r1 - r2) ** 2) ** (1 / 2)
def minimum_width(rest, r, dic):
if (rest, r) in dic:
return dic[(rest, r)]
if rest == ():
return r
ret = INF
lenr = len(rest)
for c in rest:
next_rest = list(rest)
next_rest.remove(c)
ret = min(ret, minimum_width(tuple(next_rest), c, dic) + get_dist(r, c))
dic[(rest, r)] = ret
return ret
while True:
try:
lst = list(map(int, input().split()))
w = lst[0]
cakes = lst[1:]
cakes.sort()
lenc = len(cakes)
dic = {}
ans = INF
for i in range(lenc):
ans = min(
ans,
minimum_width(
tuple(cakes[j] for j in range(lenc) if i != j), cakes[i], dic
)
+ cakes[i],
)
if w >= ans:
print("OK")
else:
print("NA")
except EOFError:
break
| false | 0 | [
"- c = r1 + r2",
"- b = abs(r1 - r2)",
"- return (c**2 - b**2) ** (1 / 2)",
"+ return ((r1 + r2) ** 2 - (r1 - r2) ** 2) ** (1 / 2)",
"- for i, c in enumerate(rest):",
"- ret = min(",
"- ret,",
"- minimum_width(tuple(rest[j] for j in range(lenr) if i != j), rest[i], dic)",
"- + get_dist(r, rest[i]),",
"- )",
"+ for c in rest:",
"+ next_rest = list(rest)",
"+ next_rest.remove(c)",
"+ ret = min(ret, minimum_width(tuple(next_rest), c, dic) + get_dist(r, c))"
] | false | 0.047518 | 0.038662 | 1.229054 | [
"s634157503",
"s667115800"
] |
u021019433 | p02996 | python | s938939520 | s287658912 | 1,119 | 992 | 46,132 | 45,980 | Accepted | Accepted | 11.35 | from itertools import accumulate
n = int(eval(input()))
a = sorted(tuple(map(int, input().split()))[::-1] for _ in range(n))
c, d = list(zip(*a))
print(('YNeos'[any(x < y for x, y in zip(c, accumulate(d)))::2]))
| from operator import itemgetter
from itertools import accumulate
n = int(eval(input()))
a = sorted((tuple(map(int, input().split())) for _ in range(n)),
key=itemgetter(1))
c, d = list(zip(*a))
print(('YNeos'[any(x > y for x, y in zip(accumulate(c), d))::2])) | 6 | 8 | 204 | 264 | from itertools import accumulate
n = int(eval(input()))
a = sorted(tuple(map(int, input().split()))[::-1] for _ in range(n))
c, d = list(zip(*a))
print(("YNeos"[any(x < y for x, y in zip(c, accumulate(d))) :: 2]))
| from operator import itemgetter
from itertools import accumulate
n = int(eval(input()))
a = sorted((tuple(map(int, input().split())) for _ in range(n)), key=itemgetter(1))
c, d = list(zip(*a))
print(("YNeos"[any(x > y for x, y in zip(accumulate(c), d)) :: 2]))
| false | 25 | [
"+from operator import itemgetter",
"-a = sorted(tuple(map(int, input().split()))[::-1] for _ in range(n))",
"+a = sorted((tuple(map(int, input().split())) for _ in range(n)), key=itemgetter(1))",
"-print((\"YNeos\"[any(x < y for x, y in zip(c, accumulate(d))) :: 2]))",
"+print((\"YNeos\"[any(x > y for x, y in zip(accumulate(c), d)) :: 2]))"
] | false | 0.041154 | 0.103989 | 0.395747 | [
"s938939520",
"s287658912"
] |
u281303342 | p03316 | python | s997406622 | s164015865 | 20 | 18 | 2,940 | 2,940 | Accepted | Accepted | 10 | N = int(eval(input()))
S = str(N)
total = 0
for s in S:
total += int(s)
print(("Yes" if N%total==0 else "No")) | N = int(eval(input()))
S,N2 = 0,N
while N2 >= 1:
S += N2%10
N2 //= 10
print(("Yes" if N%S==0 else "No")) | 8 | 8 | 115 | 113 | N = int(eval(input()))
S = str(N)
total = 0
for s in S:
total += int(s)
print(("Yes" if N % total == 0 else "No"))
| N = int(eval(input()))
S, N2 = 0, N
while N2 >= 1:
S += N2 % 10
N2 //= 10
print(("Yes" if N % S == 0 else "No"))
| false | 0 | [
"-S = str(N)",
"-total = 0",
"-for s in S:",
"- total += int(s)",
"-print((\"Yes\" if N % total == 0 else \"No\"))",
"+S, N2 = 0, N",
"+while N2 >= 1:",
"+ S += N2 % 10",
"+ N2 //= 10",
"+print((\"Yes\" if N % S == 0 else \"No\"))"
] | false | 0.16203 | 0.043883 | 3.692284 | [
"s997406622",
"s164015865"
] |
u141786930 | p03078 | python | s666091381 | s736071005 | 740 | 46 | 8,508 | 5,500 | Accepted | Accepted | 93.78 | # D - Cake 123
import heapq
import itertools
x, y, z, k = list(map(int, input().split()))
A = list(int(a) for a in input().split())
B = list(int(b) for b in input().split())
C = list(int(c) for c in input().split())
A.sort(reverse=True)
B.sort(reverse=True)
C.sort(reverse=True)
hq = []
for i in range(x):
for j in range(y):
for l in range(z):
if (i+1)*(j+1)*(l+1)<=k:
heapq.heappush(hq, (A[i]+B[j]+C[l])*-1)
else:
break
'''
hq = []
for i, j in itertools.product(A, B):
heapq.heappush(hq, (i+j)*-1)
AB = []
while len(hq)>0 and len(AB)<=k:
AB.append(heapq.heappop(hq)*-1)
hq = []
for i, j in itertools.product(AB, C):
heapq.heappush(hq, (i+j)*-1)
'''
for _ in range(k):
print((heapq.heappop(hq)*-1))
| # D - Cake 123
import heapq
import itertools
from collections import defaultdict
x, y, z, k = list(map(int, input().split()))
A = list(int(a) for a in input().split())
B = list(int(b) for b in input().split())
C = list(int(c) for c in input().split())
A.sort(reverse=True)
B.sort(reverse=True)
C.sort(reverse=True)
hq = []
hqAns = []
d = defaultdict(int)
heapq.heappush(hq, ((A[0]+B[0]+C[0])*-1,(0,0,0)))
d[(0,0,0)] = 1
while len(hqAns)<k :
val, key = heapq.heappop(hq)
heapq.heappush(hqAns, val)
if d[(key[0]+1, key[1], key[2])]==0 and key[0]+1 < x:
heapq.heappush(hq, ((A[key[0]+1]+B[key[1]]+C[key[2]])*-1, ((key[0]+1, key[1], key[2]))))
d[(key[0]+1, key[1], key[2])] = 1
if d[(key[0], key[1]+1, key[2])]==0 and key[1]+1 < y:
heapq.heappush(hq, ((A[key[0]]+B[key[1]+1]+C[key[2]])*-1, ((key[0], key[1]+1, key[2]))))
d[(key[0], key[1]+1, key[2])] = 1
if d[(key[0], key[1], key[2]+1)]==0 and key[2]+1 < z:
heapq.heappush(hq, ((A[key[0]]+B[key[1]]+C[key[2]+1])*-1, ((key[0], key[1], key[2]+1))))
d[(key[0], key[1], key[2]+1)] = 1
for i in range(k):
print((heapq.heappop(hqAns)*-1))
'''
# ans.2 #
A.sort(reverse=True)
B.sort(reverse=True)
C.sort(reverse=True)
hq = []
for i in range(x):
for j in range(y):
for l in range(z):
if (i+1)*(j+1)*(l+1)<=k:
heapq.heappush(hq, (A[i]+B[j]+C[l])*-1)
else:
break
for _ in range(k):
print(heapq.heappop(hq)*-1)
'''
'''
# ans.1 #
hq = []
for i, j in itertools.product(A, B):
heapq.heappush(hq, (i+j)*-1)
AB = []
while len(hq)>0 and len(AB)<=k:
AB.append(heapq.heappop(hq)*-1)
hq = []
for i, j in itertools.product(AB, C):
heapq.heappush(hq, (i+j)*-1)
for _ in range(k):
print(heapq.heappop(hq)*-1)
'''
| 41 | 83 | 825 | 1,895 | # D - Cake 123
import heapq
import itertools
x, y, z, k = list(map(int, input().split()))
A = list(int(a) for a in input().split())
B = list(int(b) for b in input().split())
C = list(int(c) for c in input().split())
A.sort(reverse=True)
B.sort(reverse=True)
C.sort(reverse=True)
hq = []
for i in range(x):
for j in range(y):
for l in range(z):
if (i + 1) * (j + 1) * (l + 1) <= k:
heapq.heappush(hq, (A[i] + B[j] + C[l]) * -1)
else:
break
"""
hq = []
for i, j in itertools.product(A, B):
heapq.heappush(hq, (i+j)*-1)
AB = []
while len(hq)>0 and len(AB)<=k:
AB.append(heapq.heappop(hq)*-1)
hq = []
for i, j in itertools.product(AB, C):
heapq.heappush(hq, (i+j)*-1)
"""
for _ in range(k):
print((heapq.heappop(hq) * -1))
| # D - Cake 123
import heapq
import itertools
from collections import defaultdict
x, y, z, k = list(map(int, input().split()))
A = list(int(a) for a in input().split())
B = list(int(b) for b in input().split())
C = list(int(c) for c in input().split())
A.sort(reverse=True)
B.sort(reverse=True)
C.sort(reverse=True)
hq = []
hqAns = []
d = defaultdict(int)
heapq.heappush(hq, ((A[0] + B[0] + C[0]) * -1, (0, 0, 0)))
d[(0, 0, 0)] = 1
while len(hqAns) < k:
val, key = heapq.heappop(hq)
heapq.heappush(hqAns, val)
if d[(key[0] + 1, key[1], key[2])] == 0 and key[0] + 1 < x:
heapq.heappush(
hq,
(
(A[key[0] + 1] + B[key[1]] + C[key[2]]) * -1,
((key[0] + 1, key[1], key[2])),
),
)
d[(key[0] + 1, key[1], key[2])] = 1
if d[(key[0], key[1] + 1, key[2])] == 0 and key[1] + 1 < y:
heapq.heappush(
hq,
(
(A[key[0]] + B[key[1] + 1] + C[key[2]]) * -1,
((key[0], key[1] + 1, key[2])),
),
)
d[(key[0], key[1] + 1, key[2])] = 1
if d[(key[0], key[1], key[2] + 1)] == 0 and key[2] + 1 < z:
heapq.heappush(
hq,
(
(A[key[0]] + B[key[1]] + C[key[2] + 1]) * -1,
((key[0], key[1], key[2] + 1)),
),
)
d[(key[0], key[1], key[2] + 1)] = 1
for i in range(k):
print((heapq.heappop(hqAns) * -1))
"""
# ans.2 #
A.sort(reverse=True)
B.sort(reverse=True)
C.sort(reverse=True)
hq = []
for i in range(x):
for j in range(y):
for l in range(z):
if (i+1)*(j+1)*(l+1)<=k:
heapq.heappush(hq, (A[i]+B[j]+C[l])*-1)
else:
break
for _ in range(k):
print(heapq.heappop(hq)*-1)
"""
"""
# ans.1 #
hq = []
for i, j in itertools.product(A, B):
heapq.heappush(hq, (i+j)*-1)
AB = []
while len(hq)>0 and len(AB)<=k:
AB.append(heapq.heappop(hq)*-1)
hq = []
for i, j in itertools.product(AB, C):
heapq.heappush(hq, (i+j)*-1)
for _ in range(k):
print(heapq.heappop(hq)*-1)
"""
| false | 50.60241 | [
"+from collections import defaultdict",
"+hqAns = []",
"+d = defaultdict(int)",
"+heapq.heappush(hq, ((A[0] + B[0] + C[0]) * -1, (0, 0, 0)))",
"+d[(0, 0, 0)] = 1",
"+while len(hqAns) < k:",
"+ val, key = heapq.heappop(hq)",
"+ heapq.heappush(hqAns, val)",
"+ if d[(key[0] + 1, key[1], key[2])] == 0 and key[0] + 1 < x:",
"+ heapq.heappush(",
"+ hq,",
"+ (",
"+ (A[key[0] + 1] + B[key[1]] + C[key[2]]) * -1,",
"+ ((key[0] + 1, key[1], key[2])),",
"+ ),",
"+ )",
"+ d[(key[0] + 1, key[1], key[2])] = 1",
"+ if d[(key[0], key[1] + 1, key[2])] == 0 and key[1] + 1 < y:",
"+ heapq.heappush(",
"+ hq,",
"+ (",
"+ (A[key[0]] + B[key[1] + 1] + C[key[2]]) * -1,",
"+ ((key[0], key[1] + 1, key[2])),",
"+ ),",
"+ )",
"+ d[(key[0], key[1] + 1, key[2])] = 1",
"+ if d[(key[0], key[1], key[2] + 1)] == 0 and key[2] + 1 < z:",
"+ heapq.heappush(",
"+ hq,",
"+ (",
"+ (A[key[0]] + B[key[1]] + C[key[2] + 1]) * -1,",
"+ ((key[0], key[1], key[2] + 1)),",
"+ ),",
"+ )",
"+ d[(key[0], key[1], key[2] + 1)] = 1",
"+for i in range(k):",
"+ print((heapq.heappop(hqAns) * -1))",
"+\"\"\"",
"+# ans.2 #",
"+A.sort(reverse=True)",
"+B.sort(reverse=True)",
"+C.sort(reverse=True)",
"+hq = []",
"- if (i + 1) * (j + 1) * (l + 1) <= k:",
"- heapq.heappush(hq, (A[i] + B[j] + C[l]) * -1)",
"+ if (i+1)*(j+1)*(l+1)<=k:",
"+ heapq.heappush(hq, (A[i]+B[j]+C[l])*-1)",
"+for _ in range(k):",
"+ print(heapq.heappop(hq)*-1)",
"+\"\"\"",
"+# ans.1 #",
"+for _ in range(k):",
"+ print(heapq.heappop(hq)*-1)",
"-for _ in range(k):",
"- print((heapq.heappop(hq) * -1))"
] | false | 0.057182 | 0.037958 | 1.506439 | [
"s666091381",
"s736071005"
] |
u910632349 | p02724 | python | s331514386 | s347422539 | 29 | 25 | 9,092 | 9,092 | Accepted | Accepted | 13.79 | x=int(eval(input()))
c=x//500
d=x%500
e=d//5
print((1000*c+e*5)) | x=int(eval(input()))
a=x//500
b=x%500
c=b//5
print((1000*a+5*c)) | 5 | 5 | 60 | 60 | x = int(eval(input()))
c = x // 500
d = x % 500
e = d // 5
print((1000 * c + e * 5))
| x = int(eval(input()))
a = x // 500
b = x % 500
c = b // 5
print((1000 * a + 5 * c))
| false | 0 | [
"-c = x // 500",
"-d = x % 500",
"-e = d // 5",
"-print((1000 * c + e * 5))",
"+a = x // 500",
"+b = x % 500",
"+c = b // 5",
"+print((1000 * a + 5 * c))"
] | false | 0.038479 | 0.038636 | 0.995952 | [
"s331514386",
"s347422539"
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.