user_id
stringlengths 10
10
| problem_id
stringlengths 6
6
| language
stringclasses 1
value | submission_id_v0
stringlengths 10
10
| submission_id_v1
stringlengths 10
10
| cpu_time_v0
int64 10
38.3k
| cpu_time_v1
int64 0
24.7k
| memory_v0
int64 2.57k
1.02M
| memory_v1
int64 2.57k
869k
| status_v0
stringclasses 1
value | status_v1
stringclasses 1
value | improvement_frac
float64 7.51
100
| input
stringlengths 20
4.55k
| target
stringlengths 17
3.34k
| code_v0_loc
int64 1
148
| code_v1_loc
int64 1
184
| code_v0_num_chars
int64 13
4.55k
| code_v1_num_chars
int64 14
3.34k
| code_v0_no_empty_lines
stringlengths 21
6.88k
| code_v1_no_empty_lines
stringlengths 20
4.93k
| code_same
bool 1
class | relative_loc_diff_percent
float64 0
79.8
| diff
list | diff_only_import_comment
bool 1
class | measured_runtime_v0
float64 0.01
4.45
| measured_runtime_v1
float64 0.01
4.31
| runtime_lift
float64 0
359
| key
list |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
u394721319 | p03072 | python | s613941562 | s691375108 | 170 | 19 | 38,384 | 2,940 | Accepted | Accepted | 88.82 | N = int(eval(input()))
H = [int(i) for i in input().split()]
ans = 1
p = H[0]
for i in range(1,N):
if p <= H[i]:
ans += 1
p = H[i]
print(ans)
| N = int(eval(input()))
H = [int(i) for i in input().split()]
ans = 1
m = H[0]
for i in range(1,N):
if H[i] >= m:
ans += 1
m = H[i]
print(ans)
| 11 | 12 | 168 | 170 | N = int(eval(input()))
H = [int(i) for i in input().split()]
ans = 1
p = H[0]
for i in range(1, N):
if p <= H[i]:
ans += 1
p = H[i]
print(ans)
| N = int(eval(input()))
H = [int(i) for i in input().split()]
ans = 1
m = H[0]
for i in range(1, N):
if H[i] >= m:
ans += 1
m = H[i]
print(ans)
| false | 8.333333 | [
"-p = H[0]",
"+m = H[0]",
"- if p <= H[i]:",
"+ if H[i] >= m:",
"- p = H[i]",
"+ m = H[i]"
]
| false | 0.041831 | 0.037667 | 1.110537 | [
"s613941562",
"s691375108"
]
|
u732870425 | p02848 | python | s677792886 | s994130982 | 23 | 21 | 3,060 | 3,060 | Accepted | Accepted | 8.7 | N = int(eval(input()))
S = list(eval(input()))
ans = ""
for a in S:
ans += chr((ord(a) + N - ord("A")) % 26 + ord("A"))
print(ans) | N = int(eval(input()))
S = list(eval(input()))
"""
ans = ""
for a in S:
ans += chr((ord(a) + N - ord("A")) % 26 + ord("A"))
"""
ans = ""
alpha = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
for a in S:
ans += alpha[(alpha.index(a) + N) % 26]
print(ans) | 8 | 14 | 131 | 247 | N = int(eval(input()))
S = list(eval(input()))
ans = ""
for a in S:
ans += chr((ord(a) + N - ord("A")) % 26 + ord("A"))
print(ans)
| N = int(eval(input()))
S = list(eval(input()))
"""
ans = ""
for a in S:
ans += chr((ord(a) + N - ord("A")) % 26 + ord("A"))
"""
ans = ""
alpha = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
for a in S:
ans += alpha[(alpha.index(a) + N) % 26]
print(ans)
| false | 42.857143 | [
"+\"\"\"",
"+\"\"\"",
"+ans = \"\"",
"+alpha = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"",
"+for a in S:",
"+ ans += alpha[(alpha.index(a) + N) % 26]"
]
| false | 0.035599 | 0.066473 | 0.535533 | [
"s677792886",
"s994130982"
]
|
u414980766 | p02901 | python | s346752615 | s324708235 | 1,925 | 1,477 | 3,188 | 3,188 | Accepted | Accepted | 23.27 | N, M = list(map(int, input().split()))
INF = 10**7
dp = [INF]*2**N
dp[0] = 0
for i in range(M):
a, b = list(map(int, input().split()))
c_ls = list(map(int, input().split()))
#d = sum((1<< (i - 1)) for i in map(int, input().split()))
d = 0
for c in c_ls:
d += 2**(c - 1)
for j in range(2**N):
jord = j | d
dp[jord] = min(dp[j] + a, dp[jord])
if dp[- 1] == INF:
print((- 1))
else:
print((dp[- 1])) | N, M = list(map(int, input().split()))
INF = 10**7
dp = [INF]*2**N
dp[0] = 0
for i in range(M):
a, b = list(map(int, input().split()))
d = sum((1<< (i - 1)) for i in map(int, input().split()))
for j in range(2**N):
if dp[j] == INF:
continue
jord = j | d
dp[jord] = min(dp[j] + a, dp[jord])
if dp[- 1] == INF:
print((- 1))
else:
print((dp[- 1])) | 21 | 19 | 463 | 416 | N, M = list(map(int, input().split()))
INF = 10**7
dp = [INF] * 2**N
dp[0] = 0
for i in range(M):
a, b = list(map(int, input().split()))
c_ls = list(map(int, input().split()))
# d = sum((1<< (i - 1)) for i in map(int, input().split()))
d = 0
for c in c_ls:
d += 2 ** (c - 1)
for j in range(2**N):
jord = j | d
dp[jord] = min(dp[j] + a, dp[jord])
if dp[-1] == INF:
print((-1))
else:
print((dp[-1]))
| N, M = list(map(int, input().split()))
INF = 10**7
dp = [INF] * 2**N
dp[0] = 0
for i in range(M):
a, b = list(map(int, input().split()))
d = sum((1 << (i - 1)) for i in map(int, input().split()))
for j in range(2**N):
if dp[j] == INF:
continue
jord = j | d
dp[jord] = min(dp[j] + a, dp[jord])
if dp[-1] == INF:
print((-1))
else:
print((dp[-1]))
| false | 9.52381 | [
"- c_ls = list(map(int, input().split()))",
"- # d = sum((1<< (i - 1)) for i in map(int, input().split()))",
"- d = 0",
"- for c in c_ls:",
"- d += 2 ** (c - 1)",
"+ d = sum((1 << (i - 1)) for i in map(int, input().split()))",
"+ if dp[j] == INF:",
"+ continue"
]
| false | 0.036978 | 0.042891 | 0.862135 | [
"s346752615",
"s324708235"
]
|
u788068140 | p02948 | python | s746313735 | s887009500 | 437 | 341 | 26,072 | 32,736 | Accepted | Accepted | 21.97 | from heapq import heappush, heappop
n, m = list(map(int, input().split()))
jobs = {}
for _ in range(n):
a, b = list(map(int, input().split()))
if a > m:
continue
if a in jobs:
jobs[a].append(b)
else:
jobs[a] = [b]
result = 0
candidates = []
for a in range(1, m + 1):
if a in jobs:
for b in jobs[a]:
heappush(candidates, -b)
else:
if len(candidates) == 0:
continue
result += -heappop(candidates)
print(result) | from heapq import heappop, heappush
import sys
input = sys.stdin.readline
def calculate(N,M,arr):
ret = 0
j = 0
res = []
# 1,2,3,4,5
# ↑
# 4,3,2,1
# M = 4
# range(1,5) => 1,2,3,4
for i in range(1,M+1):
# i = 1,2,3
# 比如M=4的话，第三天(最多1天),第二天(最多2天),第一天(最多3天)
# 记下来循环打工信息资源,以j为标记
# j为资源编号
# arr[j][0]为该编号资源的天数
# 候补的资源，满足所有天数，因为是满足后续的天数来算的
while (j < N) and (arr[j][0] <= i):
heappush(res, -arr[j][1])
j = j + 1 #j找到的话就往上顶一格，一共这一天，或者前一天寻找的时候以下一个资源天为开始
if len(res) > 0:
ret -= heappop(res)
return ret
N,M = list(map(int,input().split()))
# 后面的逻辑是基于前面的从小到大的排序的
list = [list(map(int,input().split())) for i in range(N)]
arr = sorted(list,key=lambda x:x[0])
result = calculate(N,M,arr)
print(result)
| 22 | 52 | 463 | 911 | from heapq import heappush, heappop
n, m = list(map(int, input().split()))
jobs = {}
for _ in range(n):
a, b = list(map(int, input().split()))
if a > m:
continue
if a in jobs:
jobs[a].append(b)
else:
jobs[a] = [b]
result = 0
candidates = []
for a in range(1, m + 1):
if a in jobs:
for b in jobs[a]:
heappush(candidates, -b)
else:
if len(candidates) == 0:
continue
result += -heappop(candidates)
print(result)
| from heapq import heappop, heappush
import sys
input = sys.stdin.readline
def calculate(N, M, arr):
ret = 0
j = 0
res = []
# 1,2,3,4,5
# ↑
# 4,3,2,1
# M = 4
# range(1,5) => 1,2,3,4
for i in range(1, M + 1):
# i = 1,2,3
# 比如M=4的话，第三天(最多1天),第二天(最多2天),第一天(最多3天)
# 记下来循环打工信息资源,以j为标记
# j为资源编号
# arr[j][0]为该编号资源的天数
# 候补的资源，满足所有天数，因为是满足后续的天数来算的
while (j < N) and (arr[j][0] <= i):
heappush(res, -arr[j][1])
j = j + 1 # j找到的话就往上顶一格，一共这一天，或者前一天寻找的时候以下一个资源天为开始
if len(res) > 0:
ret -= heappop(res)
return ret
N, M = list(map(int, input().split()))
# 后面的逻辑是基于前面的从小到大的排序的
list = [list(map(int, input().split())) for i in range(N)]
arr = sorted(list, key=lambda x: x[0])
result = calculate(N, M, arr)
print(result)
| false | 57.692308 | [
"-from heapq import heappush, heappop",
"+from heapq import heappop, heappush",
"+import sys",
"-n, m = list(map(int, input().split()))",
"-jobs = {}",
"-for _ in range(n):",
"- a, b = list(map(int, input().split()))",
"- if a > m:",
"- continue",
"- if a in jobs:",
"- jobs[a].append(b)",
"- else:",
"- jobs[a] = [b]",
"-result = 0",
"-candidates = []",
"-for a in range(1, m + 1):",
"- if a in jobs:",
"- for b in jobs[a]:",
"- heappush(candidates, -b)",
"- else:",
"- if len(candidates) == 0:",
"- continue",
"- result += -heappop(candidates)",
"+input = sys.stdin.readline",
"+",
"+",
"+def calculate(N, M, arr):",
"+ ret = 0",
"+ j = 0",
"+ res = []",
"+ # 1,2,3,4,5",
"+ # ↑",
"+ # 4,3,2,1",
"+ # M = 4",
"+ # range(1,5) => 1,2,3,4",
"+ for i in range(1, M + 1):",
"+ # i = 1,2,3",
"+ # 比如M=4的话，第三天(最多1天),第二天(最多2天),第一天(最多3天)",
"+ # 记下来循环打工信息资源,以j为标记",
"+ # j为资源编号",
"+ # arr[j][0]为该编号资源的天数",
"+ # 候补的资源，满足所有天数，因为是满足后续的天数来算的",
"+ while (j < N) and (arr[j][0] <= i):",
"+ heappush(res, -arr[j][1])",
"+ j = j + 1 # j找到的话就往上顶一格，一共这一天，或者前一天寻找的时候以下一个资源天为开始",
"+ if len(res) > 0:",
"+ ret -= heappop(res)",
"+ return ret",
"+",
"+",
"+N, M = list(map(int, input().split()))",
"+# 后面的逻辑是基于前面的从小到大的排序的",
"+list = [list(map(int, input().split())) for i in range(N)]",
"+arr = sorted(list, key=lambda x: x[0])",
"+result = calculate(N, M, arr)"
]
| false | 0.07921 | 0.03917 | 2.022195 | [
"s746313735",
"s887009500"
]
|
u054514819 | p02661 | python | s274225305 | s801792519 | 543 | 201 | 25,412 | 97,044 | Accepted | Accepted | 62.98 | N = int(eval(input()))
left = []
right = []
for _ in range(N):
l, r = list(map(int, input().split()))
left.append(l)
right.append(r)
left.sort()
right.sort()
if N%2==0:
for i, (l, r) in enumerate(zip(left, right), 1):
if i==N//2:
L = l
R = r
if i==N//2+1:
R +=r
L += l
print(((R-L)+1))
else:
for i, (l, r) in enumerate(zip(left, right), 1):
if i==N//2+1:
print((r-l+1)) | import sys
def input(): return sys.stdin.readline().strip()
def mapint(): return list(map(int, input().split()))
sys.setrecursionlimit(10**9)
N = int(eval(input()))
As = []
Bs = []
for _ in range(N):
A, B = mapint()
As.append(A)
Bs.append(B)
As.sort()
Bs.sort()
if N%2==1:
left = As[N//2]
right = Bs[N//2]
else:
left = (As[N//2]+As[N//2-1])
right = (Bs[N//2]+Bs[N//2-1])
print((right-left+1)) | 22 | 23 | 490 | 431 | N = int(eval(input()))
left = []
right = []
for _ in range(N):
l, r = list(map(int, input().split()))
left.append(l)
right.append(r)
left.sort()
right.sort()
if N % 2 == 0:
for i, (l, r) in enumerate(zip(left, right), 1):
if i == N // 2:
L = l
R = r
if i == N // 2 + 1:
R += r
L += l
print(((R - L) + 1))
else:
for i, (l, r) in enumerate(zip(left, right), 1):
if i == N // 2 + 1:
print((r - l + 1))
| import sys
def input():
return sys.stdin.readline().strip()
def mapint():
return list(map(int, input().split()))
sys.setrecursionlimit(10**9)
N = int(eval(input()))
As = []
Bs = []
for _ in range(N):
A, B = mapint()
As.append(A)
Bs.append(B)
As.sort()
Bs.sort()
if N % 2 == 1:
left = As[N // 2]
right = Bs[N // 2]
else:
left = As[N // 2] + As[N // 2 - 1]
right = Bs[N // 2] + Bs[N // 2 - 1]
print((right - left + 1))
| false | 4.347826 | [
"+import sys",
"+",
"+",
"+def input():",
"+ return sys.stdin.readline().strip()",
"+",
"+",
"+def mapint():",
"+ return list(map(int, input().split()))",
"+",
"+",
"+sys.setrecursionlimit(10**9)",
"-left = []",
"-right = []",
"+As = []",
"+Bs = []",
"- l, r = list(map(int, input().split()))",
"- left.append(l)",
"- right.append(r)",
"-left.sort()",
"-right.sort()",
"-if N % 2 == 0:",
"- for i, (l, r) in enumerate(zip(left, right), 1):",
"- if i == N // 2:",
"- L = l",
"- R = r",
"- if i == N // 2 + 1:",
"- R += r",
"- L += l",
"- print(((R - L) + 1))",
"+ A, B = mapint()",
"+ As.append(A)",
"+ Bs.append(B)",
"+As.sort()",
"+Bs.sort()",
"+if N % 2 == 1:",
"+ left = As[N // 2]",
"+ right = Bs[N // 2]",
"- for i, (l, r) in enumerate(zip(left, right), 1):",
"- if i == N // 2 + 1:",
"- print((r - l + 1))",
"+ left = As[N // 2] + As[N // 2 - 1]",
"+ right = Bs[N // 2] + Bs[N // 2 - 1]",
"+print((right - left + 1))"
]
| false | 0.045017 | 0.042924 | 1.04876 | [
"s274225305",
"s801792519"
]
|
u110943895 | p03478 | python | s959858180 | s755441162 | 30 | 27 | 2,940 | 2,940 | Accepted | Accepted | 10 | N, A, B = list(map(int, input().split()))
result = 0
for i in range(N+1):
if A<=sum((list(map(int, str(i)))))<=B:
result += i
print(result) | N, A, B = list(map(int, input().split()))
print((sum(i for i in range(1,N+1) if A<=sum(map(int, str(i)))<=B))) | 6 | 2 | 144 | 103 | N, A, B = list(map(int, input().split()))
result = 0
for i in range(N + 1):
if A <= sum((list(map(int, str(i))))) <= B:
result += i
print(result)
| N, A, B = list(map(int, input().split()))
print((sum(i for i in range(1, N + 1) if A <= sum(map(int, str(i))) <= B)))
| false | 66.666667 | [
"-result = 0",
"-for i in range(N + 1):",
"- if A <= sum((list(map(int, str(i))))) <= B:",
"- result += i",
"-print(result)",
"+print((sum(i for i in range(1, N + 1) if A <= sum(map(int, str(i))) <= B)))"
]
| false | 0.038124 | 0.094045 | 0.40538 | [
"s959858180",
"s755441162"
]
|
u860829879 | p02845 | python | s049448188 | s161597135 | 229 | 103 | 53,996 | 87,876 | Accepted | Accepted | 55.02 | n=int(eval(input()))
a=list(map(int,input().split()))
col=[0,0,0]
res=1
for ai in a:
cnt=0
for i in range(3):
if col[i]==ai:
if cnt==0:
col[i]=col[i]+1
cnt+=1
res=(res*cnt)%1000000007
print(res)
| n=int(eval(input()))
*a,=list(map(int,input().split()))
cnt=[0,0,0]
ans=1
mod=10**9+7
for aa in a:
tmp=0
for c in cnt:
if aa==c:
tmp+=1
if tmp>0:
for i in range(3):
if cnt[i]==aa:
cnt[i]+=1
break
ans*=tmp
ans%=mod
print(ans) | 20 | 23 | 303 | 339 | n = int(eval(input()))
a = list(map(int, input().split()))
col = [0, 0, 0]
res = 1
for ai in a:
cnt = 0
for i in range(3):
if col[i] == ai:
if cnt == 0:
col[i] = col[i] + 1
cnt += 1
res = (res * cnt) % 1000000007
print(res)
| n = int(eval(input()))
(*a,) = list(map(int, input().split()))
cnt = [0, 0, 0]
ans = 1
mod = 10**9 + 7
for aa in a:
tmp = 0
for c in cnt:
if aa == c:
tmp += 1
if tmp > 0:
for i in range(3):
if cnt[i] == aa:
cnt[i] += 1
break
ans *= tmp
ans %= mod
print(ans)
| false | 13.043478 | [
"-a = list(map(int, input().split()))",
"-col = [0, 0, 0]",
"-res = 1",
"-for ai in a:",
"- cnt = 0",
"- for i in range(3):",
"- if col[i] == ai:",
"- if cnt == 0:",
"- col[i] = col[i] + 1",
"- cnt += 1",
"- res = (res * cnt) % 1000000007",
"-print(res)",
"+(*a,) = list(map(int, input().split()))",
"+cnt = [0, 0, 0]",
"+ans = 1",
"+mod = 10**9 + 7",
"+for aa in a:",
"+ tmp = 0",
"+ for c in cnt:",
"+ if aa == c:",
"+ tmp += 1",
"+ if tmp > 0:",
"+ for i in range(3):",
"+ if cnt[i] == aa:",
"+ cnt[i] += 1",
"+ break",
"+ ans *= tmp",
"+ ans %= mod",
"+print(ans)"
]
| false | 0.132139 | 0.069853 | 1.891672 | [
"s049448188",
"s161597135"
]
|
u525065967 | p02694 | python | s004444156 | s754318675 | 23 | 21 | 9,140 | 9,120 | Accepted | Accepted | 8.7 | x = int(eval(input()))
yen = 100
rate = 101 # 1.01*100
year = 0
while yen < x:
yen *= rate
yen //= 100
year += 1
print(year)
| x = int(eval(input()))
yen, year = 100, 0
while yen < x:
yen += yen//100
year += 1
print(year)
| 9 | 6 | 139 | 102 | x = int(eval(input()))
yen = 100
rate = 101 # 1.01*100
year = 0
while yen < x:
yen *= rate
yen //= 100
year += 1
print(year)
| x = int(eval(input()))
yen, year = 100, 0
while yen < x:
yen += yen // 100
year += 1
print(year)
| false | 33.333333 | [
"-yen = 100",
"-rate = 101 # 1.01*100",
"-year = 0",
"+yen, year = 100, 0",
"- yen *= rate",
"- yen //= 100",
"+ yen += yen // 100"
]
| false | 0.072745 | 0.073923 | 0.984068 | [
"s004444156",
"s754318675"
]
|
u879870653 | p03151 | python | s106223352 | s940089009 | 505 | 438 | 19,024 | 18,620 | Accepted | Accepted | 13.27 | N = int(eval(input()))
A = list(map(int,input().split()))
B = list(map(int,input().split()))
L = [A[i] - B[i] for i in range(N)]
ans = 0
if sum(A) < sum(B) :
ans = -1
else :
debt = []
deposit = []
for i in range(N) :
if L[i] < 0 :
debt.append(-L[i])
elif L[i] > 0 :
deposit.append(L[i])
debt = sorted(debt)
deposit = sorted(deposit,reverse=True)
debt_duplicated = debt.copy()
deposit_duplicated = deposit.copy()
deposit_trash = []
#print(debt)
#print(deposit)
for i in range(len(debt)) :
while True :
if debt[i] == 0 :
break
else :
if debt[i] <= deposit[0] :
deposit[0] -= debt[i]
debt[i] = 0
else :
debt[i] -= deposit[0]
deposit[0] = 0
deposit_trash.append(deposit.pop(0))
# for j in range(len(deposit)) :
# if debt[i] <= deposit[j] :
# deposit[j] -= debt[i]
# debt[i] = 0
# break
# else :
# debt[i] -= deposit[j]
# deposit[j] = 0
deposit = deposit_trash + deposit
for i in range(len(debt)) :
if debt[i] != debt_duplicated[i] :
ans += 1
for i in range(len(deposit)) :
if deposit[i] != deposit_duplicated[i] :
ans += 1
print(ans)
#print(debt)
#print(deposit)
| N = int(eval(input()))
A = list(map(int,input().split()))
B = list(map(int,input().split()))
L = [A[i] - B[i] for i in range(N)]
ans = 0
if sum(A) < sum(B) :
ans = -1
else :
debt = []
deposit = []
for i in range(N) :
if L[i] < 0 :
debt.append(-L[i])
elif L[i] > 0 :
deposit.append(L[i])
deposit = sorted(deposit,reverse=True)
debt_sum = sum(debt)
ans += len(debt)
while debt_sum > 0 :
if debt_sum <= deposit[0] :
deposit[0] = 0
debt_sum = 0
else :
debt_sum -= deposit.pop(0)
ans += 1
print(ans)
#print(debt)
#print(deposit)
| 64 | 36 | 1,612 | 717 | N = int(eval(input()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
L = [A[i] - B[i] for i in range(N)]
ans = 0
if sum(A) < sum(B):
ans = -1
else:
debt = []
deposit = []
for i in range(N):
if L[i] < 0:
debt.append(-L[i])
elif L[i] > 0:
deposit.append(L[i])
debt = sorted(debt)
deposit = sorted(deposit, reverse=True)
debt_duplicated = debt.copy()
deposit_duplicated = deposit.copy()
deposit_trash = []
# print(debt)
# print(deposit)
for i in range(len(debt)):
while True:
if debt[i] == 0:
break
else:
if debt[i] <= deposit[0]:
deposit[0] -= debt[i]
debt[i] = 0
else:
debt[i] -= deposit[0]
deposit[0] = 0
deposit_trash.append(deposit.pop(0))
# for j in range(len(deposit)) :
# if debt[i] <= deposit[j] :
# deposit[j] -= debt[i]
# debt[i] = 0
# break
# else :
# debt[i] -= deposit[j]
# deposit[j] = 0
deposit = deposit_trash + deposit
for i in range(len(debt)):
if debt[i] != debt_duplicated[i]:
ans += 1
for i in range(len(deposit)):
if deposit[i] != deposit_duplicated[i]:
ans += 1
print(ans)
# print(debt)
# print(deposit)
| N = int(eval(input()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
L = [A[i] - B[i] for i in range(N)]
ans = 0
if sum(A) < sum(B):
ans = -1
else:
debt = []
deposit = []
for i in range(N):
if L[i] < 0:
debt.append(-L[i])
elif L[i] > 0:
deposit.append(L[i])
deposit = sorted(deposit, reverse=True)
debt_sum = sum(debt)
ans += len(debt)
while debt_sum > 0:
if debt_sum <= deposit[0]:
deposit[0] = 0
debt_sum = 0
else:
debt_sum -= deposit.pop(0)
ans += 1
print(ans)
# print(debt)
# print(deposit)
| false | 43.75 | [
"- debt = sorted(debt)",
"- debt_duplicated = debt.copy()",
"- deposit_duplicated = deposit.copy()",
"- deposit_trash = []",
"- # print(debt)",
"- # print(deposit)",
"- for i in range(len(debt)):",
"- while True:",
"- if debt[i] == 0:",
"- break",
"- else:",
"- if debt[i] <= deposit[0]:",
"- deposit[0] -= debt[i]",
"- debt[i] = 0",
"- else:",
"- debt[i] -= deposit[0]",
"- deposit[0] = 0",
"- deposit_trash.append(deposit.pop(0))",
"- # for j in range(len(deposit)) :",
"- # if debt[i] <= deposit[j] :",
"- # deposit[j] -= debt[i]",
"- # debt[i] = 0",
"- # break",
"- # else :",
"- # debt[i] -= deposit[j]",
"- # deposit[j] = 0",
"- deposit = deposit_trash + deposit",
"- for i in range(len(debt)):",
"- if debt[i] != debt_duplicated[i]:",
"- ans += 1",
"- for i in range(len(deposit)):",
"- if deposit[i] != deposit_duplicated[i]:",
"- ans += 1",
"+ debt_sum = sum(debt)",
"+ ans += len(debt)",
"+ while debt_sum > 0:",
"+ if debt_sum <= deposit[0]:",
"+ deposit[0] = 0",
"+ debt_sum = 0",
"+ else:",
"+ debt_sum -= deposit.pop(0)",
"+ ans += 1"
]
| false | 0.036441 | 0.036695 | 0.993082 | [
"s106223352",
"s940089009"
]
|
u074220993 | p03805 | python | s820029550 | s002111697 | 42 | 35 | 9,096 | 9,156 | Accepted | Accepted | 16.67 | def dfs(parent, connect, passed, N):
cnt = 0
passed.append(parent)
if len(passed) == N:
cnt = 1
for next_ in connect[parent]:
if next_ in passed:
continue
cnt += dfs(next_, connect, passed, N)
passed.pop()
return cnt
N, M = list(map(int, input().split()))
connect = [[] for _ in range(N)]
for _ in range(M):
a, b = list(map(int, input().split()))
connect[a-1].append(b-1)
connect[b-1].append(a-1)
ans = dfs(0, connect, [], N)
print(ans) | def dfs(parent, connect, passed, N): #深さ優先探索
cnt = 0
passed.append(parent) #通った点をメモ
if len(passed) == N: #全ての点を通過したかの判定
cnt = 1
for next_ in connect[parent]:
if next_ in passed:
continue
cnt += dfs(next_, connect, passed, N) #全ての点を通るまで再帰. 戻り値の和で何通りかカウント
passed.pop() #分岐点に戻る前にメモを1段だけ破棄
return cnt
N, M = list(map(int, input().split()))
connect = [[] for _ in range(N)]
for _ in range(M):
a, b = list(map(int, input().split()))
connect[a-1].append(b-1)
connect[b-1].append(a-1)
ans = dfs(0, connect, [], N) #点0からのdfs
print(ans) | 20 | 20 | 520 | 610 | def dfs(parent, connect, passed, N):
cnt = 0
passed.append(parent)
if len(passed) == N:
cnt = 1
for next_ in connect[parent]:
if next_ in passed:
continue
cnt += dfs(next_, connect, passed, N)
passed.pop()
return cnt
N, M = list(map(int, input().split()))
connect = [[] for _ in range(N)]
for _ in range(M):
a, b = list(map(int, input().split()))
connect[a - 1].append(b - 1)
connect[b - 1].append(a - 1)
ans = dfs(0, connect, [], N)
print(ans)
| def dfs(parent, connect, passed, N): # 深さ優先探索
cnt = 0
passed.append(parent) # 通った点をメモ
if len(passed) == N: # 全ての点を通過したかの判定
cnt = 1
for next_ in connect[parent]:
if next_ in passed:
continue
cnt += dfs(next_, connect, passed, N) # 全ての点を通るまで再帰. 戻り値の和で何通りかカウント
passed.pop() # 分岐点に戻る前にメモを1段だけ破棄
return cnt
N, M = list(map(int, input().split()))
connect = [[] for _ in range(N)]
for _ in range(M):
a, b = list(map(int, input().split()))
connect[a - 1].append(b - 1)
connect[b - 1].append(a - 1)
ans = dfs(0, connect, [], N) # 点0からのdfs
print(ans)
| false | 0 | [
"-def dfs(parent, connect, passed, N):",
"+def dfs(parent, connect, passed, N): # 深さ優先探索",
"- passed.append(parent)",
"- if len(passed) == N:",
"+ passed.append(parent) # 通った点をメモ",
"+ if len(passed) == N: # 全ての点を通過したかの判定",
"- cnt += dfs(next_, connect, passed, N)",
"- passed.pop()",
"+ cnt += dfs(next_, connect, passed, N) # 全ての点を通るまで再帰. 戻り値の和で何通りかカウント",
"+ passed.pop() # 分岐点に戻る前にメモを1段だけ破棄",
"-ans = dfs(0, connect, [], N)",
"+ans = dfs(0, connect, [], N) # 点0からのdfs"
]
| false | 0.137706 | 0.049168 | 2.800736 | [
"s820029550",
"s002111697"
]
|
u047796752 | p02821 | python | s010746568 | s499025953 | 1,655 | 1,007 | 58,204 | 54,432 | Accepted | Accepted | 39.15 | import sys
input = sys.stdin.readline
from bisect import *
def judge(x):
cnt = 0
for i in range(N):
idx = bisect_left(A, x-A[i])
cnt += N-idx
return cnt>=M
def binary_search():
l, r = 0, 10**11
while l<=r:
mid = (l+r)//2
if judge(mid):
l = mid+1
else:
r = mid-1
return r
N, M = list(map(int, input().split()))
A = list(map(int, input().split()))
A.sort()
border = binary_search()
acc = [0]
for Ai in A:
acc.append(acc[-1]+Ai)
ans = 0
cnt = 0
for i in range(N):
idx = bisect_left(A, border-A[i]+1)
ans += A[i]*(N-idx)+acc[N]-acc[idx]
cnt += N-idx
ans += (M-cnt)*border
print(ans) | import sys
input = sys.stdin.readline
from bisect import *
def judge(x):
cnt = 0
for Ai in A:
cnt += N-bisect_left(A, x-Ai+1)
return cnt<M
def binary_search():
l, r = 0, 2*max(A)
while l<=r:
m = (l+r)//2
if judge(m):
r = m-1
else:
l = m+1
return l
N, M = list(map(int, input().split()))
A = list(map(int, input().split()))
A.sort()
border = binary_search()
acc = [0]*(N+1)
for i in range(N):
acc[i+1] = acc[i]+A[i]
cnt = 0
ans = 0
for Ai in A:
j = bisect_left(A, border-Ai+1)
cnt += N-j
ans += (N-j)*Ai+acc[N]-acc[j]
ans += (M-cnt)*border
print(ans) | 46 | 44 | 762 | 722 | import sys
input = sys.stdin.readline
from bisect import *
def judge(x):
cnt = 0
for i in range(N):
idx = bisect_left(A, x - A[i])
cnt += N - idx
return cnt >= M
def binary_search():
l, r = 0, 10**11
while l <= r:
mid = (l + r) // 2
if judge(mid):
l = mid + 1
else:
r = mid - 1
return r
N, M = list(map(int, input().split()))
A = list(map(int, input().split()))
A.sort()
border = binary_search()
acc = [0]
for Ai in A:
acc.append(acc[-1] + Ai)
ans = 0
cnt = 0
for i in range(N):
idx = bisect_left(A, border - A[i] + 1)
ans += A[i] * (N - idx) + acc[N] - acc[idx]
cnt += N - idx
ans += (M - cnt) * border
print(ans)
| import sys
input = sys.stdin.readline
from bisect import *
def judge(x):
cnt = 0
for Ai in A:
cnt += N - bisect_left(A, x - Ai + 1)
return cnt < M
def binary_search():
l, r = 0, 2 * max(A)
while l <= r:
m = (l + r) // 2
if judge(m):
r = m - 1
else:
l = m + 1
return l
N, M = list(map(int, input().split()))
A = list(map(int, input().split()))
A.sort()
border = binary_search()
acc = [0] * (N + 1)
for i in range(N):
acc[i + 1] = acc[i] + A[i]
cnt = 0
ans = 0
for Ai in A:
j = bisect_left(A, border - Ai + 1)
cnt += N - j
ans += (N - j) * Ai + acc[N] - acc[j]
ans += (M - cnt) * border
print(ans)
| false | 4.347826 | [
"- for i in range(N):",
"- idx = bisect_left(A, x - A[i])",
"- cnt += N - idx",
"- return cnt >= M",
"+ for Ai in A:",
"+ cnt += N - bisect_left(A, x - Ai + 1)",
"+ return cnt < M",
"- l, r = 0, 10**11",
"+ l, r = 0, 2 * max(A)",
"- mid = (l + r) // 2",
"- if judge(mid):",
"- l = mid + 1",
"+ m = (l + r) // 2",
"+ if judge(m):",
"+ r = m - 1",
"- r = mid - 1",
"- return r",
"+ l = m + 1",
"+ return l",
"-acc = [0]",
"+acc = [0] * (N + 1)",
"+for i in range(N):",
"+ acc[i + 1] = acc[i] + A[i]",
"+cnt = 0",
"+ans = 0",
"- acc.append(acc[-1] + Ai)",
"-ans = 0",
"-cnt = 0",
"-for i in range(N):",
"- idx = bisect_left(A, border - A[i] + 1)",
"- ans += A[i] * (N - idx) + acc[N] - acc[idx]",
"- cnt += N - idx",
"+ j = bisect_left(A, border - Ai + 1)",
"+ cnt += N - j",
"+ ans += (N - j) * Ai + acc[N] - acc[j]"
]
| false | 0.042161 | 0.042136 | 1.000587 | [
"s010746568",
"s499025953"
]
|
u446371873 | p02572 | python | s315153623 | s066861096 | 234 | 131 | 31,628 | 31,532 | Accepted | Accepted | 44.02 | N = int(eval(input()))
MOD = 1000000007
A = list(map(int,input().split()))
cum = [0]*(N+1)
for i in range(N):
cum[i+1] = cum[i] + A[i]
cum[i+1] %= MOD
ans = 0
for i in range(N-1):
ans += A[i] * (cum[N] - cum[i+1])
ans %= MOD
print(ans) | N = int(eval(input()))
A = list(map(int,input().split()))
S = 0
S2 = 0
MOD = 1000000007
for i in range(N):
S += A[i]
S2 += A[i]*A[i]
print(((S*S-S2)//2%MOD)) | 15 | 9 | 263 | 161 | N = int(eval(input()))
MOD = 1000000007
A = list(map(int, input().split()))
cum = [0] * (N + 1)
for i in range(N):
cum[i + 1] = cum[i] + A[i]
cum[i + 1] %= MOD
ans = 0
for i in range(N - 1):
ans += A[i] * (cum[N] - cum[i + 1])
ans %= MOD
print(ans)
| N = int(eval(input()))
A = list(map(int, input().split()))
S = 0
S2 = 0
MOD = 1000000007
for i in range(N):
S += A[i]
S2 += A[i] * A[i]
print(((S * S - S2) // 2 % MOD))
| false | 40 | [
"+A = list(map(int, input().split()))",
"+S = 0",
"+S2 = 0",
"-A = list(map(int, input().split()))",
"-cum = [0] * (N + 1)",
"- cum[i + 1] = cum[i] + A[i]",
"- cum[i + 1] %= MOD",
"-ans = 0",
"-for i in range(N - 1):",
"- ans += A[i] * (cum[N] - cum[i + 1])",
"- ans %= MOD",
"-print(ans)",
"+ S += A[i]",
"+ S2 += A[i] * A[i]",
"+print(((S * S - S2) // 2 % MOD))"
]
| false | 0.039482 | 0.047414 | 0.832721 | [
"s315153623",
"s066861096"
]
|
u970197315 | p02585 | python | s638889220 | s750168452 | 391 | 361 | 74,412 | 74,320 | Accepted | Accepted | 7.67 | n, k = list(map(int, input().split()))
p = list(map(int, input().split()))
c = list(map(int, input().split()))
ans = -10**18
for i in range(n):
tmp_score = 0
pos = i
# cycle = 0
for l in range(k):
pos = p[pos]-1
tmp_score += c[pos]
ans = max(ans,tmp_score)
# cycle += 1
if pos == i: break
q,r = divmod(k,l+1)
if r == 0 and q > 1:
r = l+1
q -= 1
tmp_score *= q
ans = max(ans,tmp_score)
for _ in range(r):
pos = p[pos]-1
tmp_score += c[pos]
ans = max(ans,tmp_score)
print(ans)
| n, k = list(map(int, input().split()))
p = list(map(int, input().split()))
c = list(map(int, input().split()))
ans = -10**18
for i in range(n):
tmp_score = 0
pos = i
cycle = 0
for l in range(k):
pos = p[pos]-1
tmp_score += c[pos]
ans = max(ans,tmp_score)
cycle += 1
if pos == i: break
q,r = divmod(k,cycle)
if r == 0 and q > 1:
r = cycle
q -= 1
tmp_score *= q
ans = max(ans,tmp_score)
for _ in range(r):
pos = p[pos]-1
tmp_score += c[pos]
ans = max(ans,tmp_score)
print(ans)
| 27 | 27 | 621 | 621 | n, k = list(map(int, input().split()))
p = list(map(int, input().split()))
c = list(map(int, input().split()))
ans = -(10**18)
for i in range(n):
tmp_score = 0
pos = i
# cycle = 0
for l in range(k):
pos = p[pos] - 1
tmp_score += c[pos]
ans = max(ans, tmp_score)
# cycle += 1
if pos == i:
break
q, r = divmod(k, l + 1)
if r == 0 and q > 1:
r = l + 1
q -= 1
tmp_score *= q
ans = max(ans, tmp_score)
for _ in range(r):
pos = p[pos] - 1
tmp_score += c[pos]
ans = max(ans, tmp_score)
print(ans)
| n, k = list(map(int, input().split()))
p = list(map(int, input().split()))
c = list(map(int, input().split()))
ans = -(10**18)
for i in range(n):
tmp_score = 0
pos = i
cycle = 0
for l in range(k):
pos = p[pos] - 1
tmp_score += c[pos]
ans = max(ans, tmp_score)
cycle += 1
if pos == i:
break
q, r = divmod(k, cycle)
if r == 0 and q > 1:
r = cycle
q -= 1
tmp_score *= q
ans = max(ans, tmp_score)
for _ in range(r):
pos = p[pos] - 1
tmp_score += c[pos]
ans = max(ans, tmp_score)
print(ans)
| false | 0 | [
"- # cycle = 0",
"+ cycle = 0",
"- # cycle += 1",
"+ cycle += 1",
"- q, r = divmod(k, l + 1)",
"+ q, r = divmod(k, cycle)",
"- r = l + 1",
"+ r = cycle"
]
| false | 0.046274 | 0.060579 | 0.763856 | [
"s638889220",
"s750168452"
]
|
u481250941 | p02695 | python | s044718372 | s353698144 | 617 | 374 | 23,536 | 23,536 | Accepted | Accepted | 39.38 | #
# abc165 c
#
from itertools import combinations_with_replacement as cwr
import sys
from io import StringIO
import unittest
sys.setrecursionlimit(100000)
class TestClass(unittest.TestCase):
def assertIO(self, input, output):
stdout, stdin = sys.stdout, sys.stdin
sys.stdout, sys.stdin = StringIO(), StringIO(input)
resolve()
sys.stdout.seek(0)
out = sys.stdout.read()[:-1]
sys.stdout, sys.stdin = stdout, stdin
self.assertEqual(out, output)
def test_入力例_1(self):
input = """3 4 3
1 3 3 100
1 2 2 10
2 3 2 10"""
output = """110"""
self.assertIO(input, output)
def test_入力例_2(self):
input = """4 6 10
2 4 1 86568
1 4 0 90629
2 3 0 90310
3 4 1 29211
3 4 3 78537
3 4 2 8580
1 2 1 96263
1 4 2 2156
1 2 0 94325
1 4 3 94328"""
output = """357500"""
self.assertIO(input, output)
def test_入力例_3(self):
input = """10 10 1
1 10 9 1"""
output = """1"""
self.assertIO(input, output)
def resolve():
global N, M
N, M, Q = list(map(int, input().split()))
ABCD = [list(map(int, input().split())) for _ in range(Q)]
T = []
func([1], T)
ans = 0
for t in cwr(list(range(1, M+1)), N):
score = 0
for abcd in ABCD:
a, b, c, d = abcd
if t[b-1] - t[a-1] == c:
score += d
ans = max(ans, score)
print(ans)
def func(L, T):
if len(L) == N:
T.append(L)
return
for i in range(L[-1], M+1):
NL = L + [i]
func(NL, T)
if __name__ == "__main__":
# unittest.main()
resolve()
| #
# abc165 c
#
import sys
from io import StringIO
import unittest
sys.setrecursionlimit(100000)
class TestClass(unittest.TestCase):
def assertIO(self, input, output):
stdout, stdin = sys.stdout, sys.stdin
sys.stdout, sys.stdin = StringIO(), StringIO(input)
resolve()
sys.stdout.seek(0)
out = sys.stdout.read()[:-1]
sys.stdout, sys.stdin = stdout, stdin
self.assertEqual(out, output)
def test_入力例_1(self):
input = """3 4 3
1 3 3 100
1 2 2 10
2 3 2 10"""
output = """110"""
self.assertIO(input, output)
def test_入力例_2(self):
input = """4 6 10
2 4 1 86568
1 4 0 90629
2 3 0 90310
3 4 1 29211
3 4 3 78537
3 4 2 8580
1 2 1 96263
1 4 2 2156
1 2 0 94325
1 4 3 94328"""
output = """357500"""
self.assertIO(input, output)
def test_入力例_3(self):
input = """10 10 1
1 10 9 1"""
output = """1"""
self.assertIO(input, output)
def resolve():
global N, M
N, M, Q = list(map(int, input().split()))
ABCD = [list(map(int, input().split())) for _ in range(Q)]
T = []
func([1], T)
ans = 0
for t in T:
score = 0
for abcd in ABCD:
a, b, c, d = abcd
if t[b-1] - t[a-1] == c:
score += d
ans = max(ans, score)
print(ans)
def func(L, T):
if len(L) == N:
T.append(L)
return
for i in range(L[-1], M+1):
NL = L + [i]
func(NL, T)
if __name__ == "__main__":
# unittest.main()
resolve()
| 82 | 81 | 1,710 | 1,630 | #
# abc165 c
#
from itertools import combinations_with_replacement as cwr
import sys
from io import StringIO
import unittest
sys.setrecursionlimit(100000)
class TestClass(unittest.TestCase):
def assertIO(self, input, output):
stdout, stdin = sys.stdout, sys.stdin
sys.stdout, sys.stdin = StringIO(), StringIO(input)
resolve()
sys.stdout.seek(0)
out = sys.stdout.read()[:-1]
sys.stdout, sys.stdin = stdout, stdin
self.assertEqual(out, output)
def test_入力例_1(self):
input = """3 4 3
1 3 3 100
1 2 2 10
2 3 2 10"""
output = """110"""
self.assertIO(input, output)
def test_入力例_2(self):
input = """4 6 10
2 4 1 86568
1 4 0 90629
2 3 0 90310
3 4 1 29211
3 4 3 78537
3 4 2 8580
1 2 1 96263
1 4 2 2156
1 2 0 94325
1 4 3 94328"""
output = """357500"""
self.assertIO(input, output)
def test_入力例_3(self):
input = """10 10 1
1 10 9 1"""
output = """1"""
self.assertIO(input, output)
def resolve():
global N, M
N, M, Q = list(map(int, input().split()))
ABCD = [list(map(int, input().split())) for _ in range(Q)]
T = []
func([1], T)
ans = 0
for t in cwr(list(range(1, M + 1)), N):
score = 0
for abcd in ABCD:
a, b, c, d = abcd
if t[b - 1] - t[a - 1] == c:
score += d
ans = max(ans, score)
print(ans)
def func(L, T):
if len(L) == N:
T.append(L)
return
for i in range(L[-1], M + 1):
NL = L + [i]
func(NL, T)
if __name__ == "__main__":
# unittest.main()
resolve()
| #
# abc165 c
#
import sys
from io import StringIO
import unittest
sys.setrecursionlimit(100000)
class TestClass(unittest.TestCase):
def assertIO(self, input, output):
stdout, stdin = sys.stdout, sys.stdin
sys.stdout, sys.stdin = StringIO(), StringIO(input)
resolve()
sys.stdout.seek(0)
out = sys.stdout.read()[:-1]
sys.stdout, sys.stdin = stdout, stdin
self.assertEqual(out, output)
def test_入力例_1(self):
input = """3 4 3
1 3 3 100
1 2 2 10
2 3 2 10"""
output = """110"""
self.assertIO(input, output)
def test_入力例_2(self):
input = """4 6 10
2 4 1 86568
1 4 0 90629
2 3 0 90310
3 4 1 29211
3 4 3 78537
3 4 2 8580
1 2 1 96263
1 4 2 2156
1 2 0 94325
1 4 3 94328"""
output = """357500"""
self.assertIO(input, output)
def test_入力例_3(self):
input = """10 10 1
1 10 9 1"""
output = """1"""
self.assertIO(input, output)
def resolve():
global N, M
N, M, Q = list(map(int, input().split()))
ABCD = [list(map(int, input().split())) for _ in range(Q)]
T = []
func([1], T)
ans = 0
for t in T:
score = 0
for abcd in ABCD:
a, b, c, d = abcd
if t[b - 1] - t[a - 1] == c:
score += d
ans = max(ans, score)
print(ans)
def func(L, T):
if len(L) == N:
T.append(L)
return
for i in range(L[-1], M + 1):
NL = L + [i]
func(NL, T)
if __name__ == "__main__":
# unittest.main()
resolve()
| false | 1.219512 | [
"-from itertools import combinations_with_replacement as cwr",
"- for t in cwr(list(range(1, M + 1)), N):",
"+ for t in T:"
]
| false | 0.340735 | 0.154506 | 2.205317 | [
"s044718372",
"s353698144"
]
|
u634046173 | p02706 | python | s866050896 | s355862288 | 25 | 22 | 9,812 | 9,868 | Accepted | Accepted | 12 | N, M = list(map(int, input().split()))
A = list(map(int, input().split()))
d = sum(A)
if N < d:
print((-1))
else:
print((N-d)) | N, M = list(map(int, input().split()))
As = list(map(int, input().split()))
d = sum(As)
if N < d:
print((-1))
else:
print((N-d))
| 9 | 7 | 130 | 133 | N, M = list(map(int, input().split()))
A = list(map(int, input().split()))
d = sum(A)
if N < d:
print((-1))
else:
print((N - d))
| N, M = list(map(int, input().split()))
As = list(map(int, input().split()))
d = sum(As)
if N < d:
print((-1))
else:
print((N - d))
| false | 22.222222 | [
"-A = list(map(int, input().split()))",
"-d = sum(A)",
"+As = list(map(int, input().split()))",
"+d = sum(As)"
]
| false | 0.088022 | 0.047068 | 1.870126 | [
"s866050896",
"s355862288"
]
|
u562935282 | p03073 | python | s977244611 | s217383828 | 52 | 19 | 3,188 | 3,572 | Accepted | Accepted | 63.46 | s = eval(input())
ans = float('inf')
for init in '01':
t = 0
x = init
for ss in s:
# print(ss, x)
if ss != x:
t += 1
if x == '0':
x = '1'
else:
x = '0'
ans = min(ans, t)
print(ans)
| s = eval(input())
N = len(s)
t_01 = '01' * (N // 2) + ('0' if N % 2 == 1 else '')
t_10 = '10' * (N // 2) + ('1' if N % 2 == 1 else '')
# print(s)
# print(t_01)
# print(t_10)
s_n = int(s, 2)
t_01_n = int(t_01, 2)
t_10_n = int(t_10, 2)
# print(s_n)
# print(t_01_n)
# print(t_10_n)
ans = N
for x in s_n ^ t_01_n, s_n ^ t_10_n:
ans = min(ans, bin(x)[2:].count('1'))
print(ans)
| 16 | 23 | 275 | 399 | s = eval(input())
ans = float("inf")
for init in "01":
t = 0
x = init
for ss in s:
# print(ss, x)
if ss != x:
t += 1
if x == "0":
x = "1"
else:
x = "0"
ans = min(ans, t)
print(ans)
| s = eval(input())
N = len(s)
t_01 = "01" * (N // 2) + ("0" if N % 2 == 1 else "")
t_10 = "10" * (N // 2) + ("1" if N % 2 == 1 else "")
# print(s)
# print(t_01)
# print(t_10)
s_n = int(s, 2)
t_01_n = int(t_01, 2)
t_10_n = int(t_10, 2)
# print(s_n)
# print(t_01_n)
# print(t_10_n)
ans = N
for x in s_n ^ t_01_n, s_n ^ t_10_n:
ans = min(ans, bin(x)[2:].count("1"))
print(ans)
| false | 30.434783 | [
"-ans = float(\"inf\")",
"-for init in \"01\":",
"- t = 0",
"- x = init",
"- for ss in s:",
"- # print(ss, x)",
"- if ss != x:",
"- t += 1",
"- if x == \"0\":",
"- x = \"1\"",
"- else:",
"- x = \"0\"",
"- ans = min(ans, t)",
"+N = len(s)",
"+t_01 = \"01\" * (N // 2) + (\"0\" if N % 2 == 1 else \"\")",
"+t_10 = \"10\" * (N // 2) + (\"1\" if N % 2 == 1 else \"\")",
"+# print(s)",
"+# print(t_01)",
"+# print(t_10)",
"+s_n = int(s, 2)",
"+t_01_n = int(t_01, 2)",
"+t_10_n = int(t_10, 2)",
"+# print(s_n)",
"+# print(t_01_n)",
"+# print(t_10_n)",
"+ans = N",
"+for x in s_n ^ t_01_n, s_n ^ t_10_n:",
"+ ans = min(ans, bin(x)[2:].count(\"1\"))"
]
| false | 0.036468 | 0.037709 | 0.967096 | [
"s977244611",
"s217383828"
]
|
u701644092 | p02819 | python | s977364849 | s503395171 | 51 | 18 | 3,828 | 3,060 | Accepted | Accepted | 64.71 | X = int(eval(input()))
fact = [True] * (10 ** 5 + 1000)
fact[0],fact[1] = False,False
for i in range(2,len(fact)):
if fact[i]:
for j in range(i * 2, len(fact), i):
fact[j] = False
for i in range(X,len(fact)):
if fact[i]:
print(i)
break | X = int(eval(input()))
def checkfact(x):
for i in range(2,int(x ** 0.5) + 1):
if x % i == 0:
return False
return True
while True:
if checkfact(X):
print(X)
break
X += 1 | 13 | 13 | 271 | 202 | X = int(eval(input()))
fact = [True] * (10**5 + 1000)
fact[0], fact[1] = False, False
for i in range(2, len(fact)):
if fact[i]:
for j in range(i * 2, len(fact), i):
fact[j] = False
for i in range(X, len(fact)):
if fact[i]:
print(i)
break
| X = int(eval(input()))
def checkfact(x):
for i in range(2, int(x**0.5) + 1):
if x % i == 0:
return False
return True
while True:
if checkfact(X):
print(X)
break
X += 1
| false | 0 | [
"-fact = [True] * (10**5 + 1000)",
"-fact[0], fact[1] = False, False",
"-for i in range(2, len(fact)):",
"- if fact[i]:",
"- for j in range(i * 2, len(fact), i):",
"- fact[j] = False",
"-for i in range(X, len(fact)):",
"- if fact[i]:",
"- print(i)",
"+",
"+",
"+def checkfact(x):",
"+ for i in range(2, int(x**0.5) + 1):",
"+ if x % i == 0:",
"+ return False",
"+ return True",
"+",
"+",
"+while True:",
"+ if checkfact(X):",
"+ print(X)",
"+ X += 1"
]
| false | 0.293023 | 0.077912 | 3.760949 | [
"s977364849",
"s503395171"
]
|
u764215612 | p02690 | python | s471661437 | s888382608 | 34 | 27 | 9,040 | 9,052 | Accepted | Accepted | 20.59 | x = int(eval(input()))
for i in range(120):
for j in range(-119,129):
if i**5 - j**5 == x:
print((i, j))
exit() | x = int(eval(input()))
for i in range(120):
for j in range(-119, i):
if i**5 - j**5 == x:
print((i, j))
exit() | 6 | 6 | 126 | 125 | x = int(eval(input()))
for i in range(120):
for j in range(-119, 129):
if i**5 - j**5 == x:
print((i, j))
exit()
| x = int(eval(input()))
for i in range(120):
for j in range(-119, i):
if i**5 - j**5 == x:
print((i, j))
exit()
| false | 0 | [
"- for j in range(-119, 129):",
"+ for j in range(-119, i):"
]
| false | 0.036603 | 0.033992 | 1.076819 | [
"s471661437",
"s888382608"
]
|
u923279197 | p02918 | python | s517430506 | s651198917 | 198 | 177 | 39,792 | 39,408 | Accepted | Accepted | 10.61 | n,k = list(map(int,input().split()))
s = eval(input())
if len(s) == 1:
print((0))
exit()
ans = 0
c = 0
for i in range(1,n):
if s[i] == s[i-1]:
ans += 1
else:
c += 1
if c == 1:
print((n-1))
exit()
t = -1
left = s[0]
q = -1
for i in range(1,n):
if s[i] != left:
t += 1
left = s[i]
if t == 1 and k > 0:
k -= 1
ans += 2
t = -1
if t == 0 and k > 0:
ans += 1
print(ans)
| n,k = list(map(int,input().split()))
s = eval(input())
ans = 0
for i in range(1,n):
if s[i] == s[i-1]:
ans += 1
print((min(ans + 2*k,n-1))) | 34 | 8 | 478 | 145 | n, k = list(map(int, input().split()))
s = eval(input())
if len(s) == 1:
print((0))
exit()
ans = 0
c = 0
for i in range(1, n):
if s[i] == s[i - 1]:
ans += 1
else:
c += 1
if c == 1:
print((n - 1))
exit()
t = -1
left = s[0]
q = -1
for i in range(1, n):
if s[i] != left:
t += 1
left = s[i]
if t == 1 and k > 0:
k -= 1
ans += 2
t = -1
if t == 0 and k > 0:
ans += 1
print(ans)
| n, k = list(map(int, input().split()))
s = eval(input())
ans = 0
for i in range(1, n):
if s[i] == s[i - 1]:
ans += 1
print((min(ans + 2 * k, n - 1)))
| false | 76.470588 | [
"-if len(s) == 1:",
"- print((0))",
"- exit()",
"-c = 0",
"- else:",
"- c += 1",
"-if c == 1:",
"- print((n - 1))",
"- exit()",
"-t = -1",
"-left = s[0]",
"-q = -1",
"-for i in range(1, n):",
"- if s[i] != left:",
"- t += 1",
"- left = s[i]",
"- if t == 1 and k > 0:",
"- k -= 1",
"- ans += 2",
"- t = -1",
"-if t == 0 and k > 0:",
"- ans += 1",
"-print(ans)",
"+print((min(ans + 2 * k, n - 1)))"
]
| false | 0.111975 | 0.111976 | 0.999996 | [
"s517430506",
"s651198917"
]
|
u669360983 | p02390 | python | s880377299 | s075920501 | 30 | 20 | 6,736 | 4,192 | Accepted | Accepted | 33.33 | s=int(eval(input()))
h=int(s/3600)
m=int(s/60-60*h)
s=int(s-3600*h-60*m)
h,m,s=list(map(str,(h,m,s)))
print((h+':'+m+':'+s)) | s=int(input())
h=s/3600
m=(s-3600*h)/60
print("%d:%d:%d"%(h,m,s-3600*h-60*m)) | 6 | 4 | 115 | 83 | s = int(eval(input()))
h = int(s / 3600)
m = int(s / 60 - 60 * h)
s = int(s - 3600 * h - 60 * m)
h, m, s = list(map(str, (h, m, s)))
print((h + ":" + m + ":" + s))
| s = int(input())
h = s / 3600
m = (s - 3600 * h) / 60
print("%d:%d:%d" % (h, m, s - 3600 * h - 60 * m))
| false | 33.333333 | [
"-s = int(eval(input()))",
"-h = int(s / 3600)",
"-m = int(s / 60 - 60 * h)",
"-s = int(s - 3600 * h - 60 * m)",
"-h, m, s = list(map(str, (h, m, s)))",
"-print((h + \":\" + m + \":\" + s))",
"+s = int(input())",
"+h = s / 3600",
"+m = (s - 3600 * h) / 60",
"+print(\"%d:%d:%d\" % (h, m, s - 3600 * h - 60 * m))"
]
| false | 0.068457 | 0.066903 | 1.023223 | [
"s880377299",
"s075920501"
]
|
u241190159 | p02996 | python | s196809254 | s649906611 | 648 | 476 | 28,764 | 29,468 | Accepted | Accepted | 26.54 | # import bisect
import heapq
# import math
# import queue
import sys
def main():
# 読み込み回数が多い場合
input = sys.stdin.readline
N = int(eval(input()))
# heap queue
h = []
for i in range(N):
A, B = list(map(int, input().split()))
heapq.heappush(h, (B, A))
time = 0
while len(h) > 0:
B, A = heapq.heappop(h)
time += A
if B < time:
print("No")
sys.exit()
print("Yes")
if __name__ == "__main__":
main() | # import bisect
# import heapq
# import math
# import queue
import sys
def main():
# 読み込み回数が多い場合
input = sys.stdin.readline
N = int(eval(input()))
# heap queue
h = []
for i in range(N):
A, B = list(map(int, input().split()))
h.append((B, A))
h.sort()
time = 0
for B, A in h:
time += A
if B < time:
print("No")
sys.exit()
print("Yes")
if __name__ == "__main__":
main() | 31 | 31 | 530 | 501 | # import bisect
import heapq
# import math
# import queue
import sys
def main():
# 読み込み回数が多い場合
input = sys.stdin.readline
N = int(eval(input()))
# heap queue
h = []
for i in range(N):
A, B = list(map(int, input().split()))
heapq.heappush(h, (B, A))
time = 0
while len(h) > 0:
B, A = heapq.heappop(h)
time += A
if B < time:
print("No")
sys.exit()
print("Yes")
if __name__ == "__main__":
main()
| # import bisect
# import heapq
# import math
# import queue
import sys
def main():
# 読み込み回数が多い場合
input = sys.stdin.readline
N = int(eval(input()))
# heap queue
h = []
for i in range(N):
A, B = list(map(int, input().split()))
h.append((B, A))
h.sort()
time = 0
for B, A in h:
time += A
if B < time:
print("No")
sys.exit()
print("Yes")
if __name__ == "__main__":
main()
| false | 0 | [
"-import heapq",
"-",
"+# import heapq",
"- heapq.heappush(h, (B, A))",
"+ h.append((B, A))",
"+ h.sort()",
"- while len(h) > 0:",
"- B, A = heapq.heappop(h)",
"+ for B, A in h:"
]
| false | 0.084069 | 0.063758 | 1.318568 | [
"s196809254",
"s649906611"
]
|
u512007680 | p03295 | python | s140133093 | s872093979 | 458 | 381 | 22,108 | 20,388 | Accepted | Accepted | 16.81 | N,M = list(map(int,input().split()))
info = []
for i in range(M):
a,b = list(map(int,input().split()))
info.append([a,b])
info = sorted(info,key = lambda x:x[1])
ok = 0
count = 0
for i in range(M):
if info[i][0] > ok:
count += 1
ok = info[i][1] - 1
print(count) | N,M = list(map(int,input().split()))
info = []
maxa = [0] * (N+1)
for i in range(M):
a,b = list(map(int,input().split()))
info.append([a,b])
if maxa[b] < a:
maxa[b] = a
ok = 0
count = 0
for j in range(1,N+1):
if ok < maxa[j]:
count += 1
ok = j-1
print(count) | 18 | 19 | 299 | 309 | N, M = list(map(int, input().split()))
info = []
for i in range(M):
a, b = list(map(int, input().split()))
info.append([a, b])
info = sorted(info, key=lambda x: x[1])
ok = 0
count = 0
for i in range(M):
if info[i][0] > ok:
count += 1
ok = info[i][1] - 1
print(count)
| N, M = list(map(int, input().split()))
info = []
maxa = [0] * (N + 1)
for i in range(M):
a, b = list(map(int, input().split()))
info.append([a, b])
if maxa[b] < a:
maxa[b] = a
ok = 0
count = 0
for j in range(1, N + 1):
if ok < maxa[j]:
count += 1
ok = j - 1
print(count)
| false | 5.263158 | [
"+maxa = [0] * (N + 1)",
"-info = sorted(info, key=lambda x: x[1])",
"+ if maxa[b] < a:",
"+ maxa[b] = a",
"-for i in range(M):",
"- if info[i][0] > ok:",
"+for j in range(1, N + 1):",
"+ if ok < maxa[j]:",
"- ok = info[i][1] - 1",
"+ ok = j - 1"
]
| false | 0.036869 | 0.037113 | 0.99344 | [
"s140133093",
"s872093979"
]
|
u652057333 | p03805 | python | s126767887 | s303956188 | 179 | 31 | 40,048 | 3,572 | Accepted | Accepted | 82.68 | from collections import defaultdict
import itertools
n, m = list(map(int, input().split()))
connected_dict = defaultdict(lambda: [])
for i in range(m):
a, b = list(map(int, input().split()))
connected_dict[a].append(b)
connected_dict[b].append(a)
count = 0
for permutation in list(itertools.permutations(list(range(2, n + 1)))):
flag = True
pre_num = 1
for num in permutation:
if num not in connected_dict[pre_num]:
flag = False
break
pre_num = num
if flag:
count += 1
print(count)
| # One-stroke Path
import itertools
n, m = list(map(int, input().split()))
ab = {}
for i in range(n+1):
ab[i] = []
for i in range(m):
a, b = list(map(int, input().split()))
ab[a].append(b)
ab[b].append(a)
count = 0
for values in list(itertools.permutations(list(range(2, n+1)))):
pre = 1
for i, v in enumerate(values):
if(v not in ab[pre]):
break
if i == n-2:
count += 1
pre = v
print(count) | 23 | 22 | 565 | 467 | from collections import defaultdict
import itertools
n, m = list(map(int, input().split()))
connected_dict = defaultdict(lambda: [])
for i in range(m):
a, b = list(map(int, input().split()))
connected_dict[a].append(b)
connected_dict[b].append(a)
count = 0
for permutation in list(itertools.permutations(list(range(2, n + 1)))):
flag = True
pre_num = 1
for num in permutation:
if num not in connected_dict[pre_num]:
flag = False
break
pre_num = num
if flag:
count += 1
print(count)
| # One-stroke Path
import itertools
n, m = list(map(int, input().split()))
ab = {}
for i in range(n + 1):
ab[i] = []
for i in range(m):
a, b = list(map(int, input().split()))
ab[a].append(b)
ab[b].append(a)
count = 0
for values in list(itertools.permutations(list(range(2, n + 1)))):
pre = 1
for i, v in enumerate(values):
if v not in ab[pre]:
break
if i == n - 2:
count += 1
pre = v
print(count)
| false | 4.347826 | [
"-from collections import defaultdict",
"+# One-stroke Path",
"-connected_dict = defaultdict(lambda: [])",
"+ab = {}",
"+for i in range(n + 1):",
"+ ab[i] = []",
"- connected_dict[a].append(b)",
"- connected_dict[b].append(a)",
"+ ab[a].append(b)",
"+ ab[b].append(a)",
"-for permutation in list(itertools.permutations(list(range(2, n + 1)))):",
"- flag = True",
"- pre_num = 1",
"- for num in permutation:",
"- if num not in connected_dict[pre_num]:",
"- flag = False",
"+for values in list(itertools.permutations(list(range(2, n + 1)))):",
"+ pre = 1",
"+ for i, v in enumerate(values):",
"+ if v not in ab[pre]:",
"- pre_num = num",
"- if flag:",
"- count += 1",
"+ if i == n - 2:",
"+ count += 1",
"+ pre = v"
]
| false | 0.03941 | 0.068739 | 0.573336 | [
"s126767887",
"s303956188"
]
|
u912237403 | p00008 | python | s322132670 | s853831170 | 30 | 20 | 4,212 | 4,204 | Accepted | Accepted | 33.33 | import sys
def f(a,b):
c=b*9-9
A=list(range(10))
if b==1:x=1 if a in A else 0
else:x=sum([f(a-e,b-1)for e in A if 0<=a-e<=c])
return x
for n in map(int,sys.stdin):print(f(n,4)) | import sys
def f(a,b,c):
if b==1:x=1 if 0<=a<=9 else 0
else:x=sum([f(a-e,b-1,c-9)for e in range(10) if 0<=a-e<=c])
return x
for n in map(int,sys.stdin):print(f(n,4,3*9)) | 8 | 6 | 186 | 179 | import sys
def f(a, b):
c = b * 9 - 9
A = list(range(10))
if b == 1:
x = 1 if a in A else 0
else:
x = sum([f(a - e, b - 1) for e in A if 0 <= a - e <= c])
return x
for n in map(int, sys.stdin):
print(f(n, 4))
| import sys
def f(a, b, c):
if b == 1:
x = 1 if 0 <= a <= 9 else 0
else:
x = sum([f(a - e, b - 1, c - 9) for e in range(10) if 0 <= a - e <= c])
return x
for n in map(int, sys.stdin):
print(f(n, 4, 3 * 9))
| false | 25 | [
"-def f(a, b):",
"- c = b * 9 - 9",
"- A = list(range(10))",
"+def f(a, b, c):",
"- x = 1 if a in A else 0",
"+ x = 1 if 0 <= a <= 9 else 0",
"- x = sum([f(a - e, b - 1) for e in A if 0 <= a - e <= c])",
"+ x = sum([f(a - e, b - 1, c - 9) for e in range(10) if 0 <= a - e <= c])",
"- print(f(n, 4))",
"+ print(f(n, 4, 3 * 9))"
]
| false | 0.054837 | 0.049959 | 1.097641 | [
"s322132670",
"s853831170"
]
|
u636845339 | p02578 | python | s820848553 | s754561965 | 169 | 102 | 32,124 | 32,176 | Accepted | Accepted | 39.64 | n=int(eval(input()))
A = list(map(int, input().split()))
l = [0] * len(A)
ans=0
for i in range(n-1):
if A[i]>=A[i+1]:
l[i+1]=A[i]-A[i+1]
A[i+1]=A[i]
else:
l[i+1]=0
ans=ans+l[i+1]
print(ans)
| n=int(eval(input()))
A = list(map(int, input().split()))
l = [0] * len(A)
ans=0
m=A[0]
for i in A:
if m>i:
ans = ans +(m-i)
else:
m=i
print(ans)
| 15 | 16 | 223 | 177 | n = int(eval(input()))
A = list(map(int, input().split()))
l = [0] * len(A)
ans = 0
for i in range(n - 1):
if A[i] >= A[i + 1]:
l[i + 1] = A[i] - A[i + 1]
A[i + 1] = A[i]
else:
l[i + 1] = 0
ans = ans + l[i + 1]
print(ans)
| n = int(eval(input()))
A = list(map(int, input().split()))
l = [0] * len(A)
ans = 0
m = A[0]
for i in A:
if m > i:
ans = ans + (m - i)
else:
m = i
print(ans)
| false | 6.25 | [
"-for i in range(n - 1):",
"- if A[i] >= A[i + 1]:",
"- l[i + 1] = A[i] - A[i + 1]",
"- A[i + 1] = A[i]",
"+m = A[0]",
"+for i in A:",
"+ if m > i:",
"+ ans = ans + (m - i)",
"- l[i + 1] = 0",
"- ans = ans + l[i + 1]",
"+ m = i"
]
| false | 0.041287 | 0.036036 | 1.145727 | [
"s820848553",
"s754561965"
]
|
u350064373 | p00064 | python | s347126016 | s300037302 | 30 | 20 | 7,832 | 7,832 | Accepted | Accepted | 33.33 | import re
try:
ls = []
result = 0
while True:
ls.append(eval(input()))
except:
for i in ls:
for s in re.findall(r'\d+', i):
result += int(s)
print(result) | import re
try:
ls = []
while True:
ls.append(eval(input()))
except:
result = 0
for i in ls:
for s in re.findall(r'\d+', i):
result += int(s)
print(result) | 11 | 11 | 206 | 206 | import re
try:
ls = []
result = 0
while True:
ls.append(eval(input()))
except:
for i in ls:
for s in re.findall(r"\d+", i):
result += int(s)
print(result)
| import re
try:
ls = []
while True:
ls.append(eval(input()))
except:
result = 0
for i in ls:
for s in re.findall(r"\d+", i):
result += int(s)
print(result)
| false | 0 | [
"- result = 0",
"+ result = 0"
]
| false | 0.048863 | 0.048641 | 1.00456 | [
"s347126016",
"s300037302"
]
|
u472065247 | p03244 | python | s563619049 | s578872502 | 100 | 88 | 19,040 | 20,524 | Accepted | Accepted | 12 | from collections import Counter
n=int(eval(input()))
l = list(map(int, input().split()))
l0 = l[::2]
l1 = l[1::2]
c0 = Counter(l0)
c1 = Counter(l1)
ll0 = len(l0)
ll1 = len(l1)
c0m = c0.most_common()[:2] + [(0, 0)]
c1m = c1.most_common()[:2] + [(0, 0)]
if c0m[0][0] != c1m[0][0]:
print((ll0 - c0m[0][1] + ll1 - c1m[0][1]))
else:
print((min(ll0 - c0m[1][1] + ll1 - c1m[0][1], ll0 - c0m[0][1] + ll1 - c1m[1][1]))) | from collections import Counter
n,*l = list(map(int, open(0).read().split()))
c0 = Counter(l[::2]).most_common() + [(0, 0)]
c1 = Counter(l[1::2]).most_common() + [(0, 0)]
if c0[0][0] != c1[0][0]:
print((n - c0[0][1] - c1[0][1]))
else:
print((n - max(c0[1][1] + c1[0][1], c0[0][1] + c1[1][1]))) | 19 | 11 | 426 | 300 | from collections import Counter
n = int(eval(input()))
l = list(map(int, input().split()))
l0 = l[::2]
l1 = l[1::2]
c0 = Counter(l0)
c1 = Counter(l1)
ll0 = len(l0)
ll1 = len(l1)
c0m = c0.most_common()[:2] + [(0, 0)]
c1m = c1.most_common()[:2] + [(0, 0)]
if c0m[0][0] != c1m[0][0]:
print((ll0 - c0m[0][1] + ll1 - c1m[0][1]))
else:
print((min(ll0 - c0m[1][1] + ll1 - c1m[0][1], ll0 - c0m[0][1] + ll1 - c1m[1][1])))
| from collections import Counter
n, *l = list(map(int, open(0).read().split()))
c0 = Counter(l[::2]).most_common() + [(0, 0)]
c1 = Counter(l[1::2]).most_common() + [(0, 0)]
if c0[0][0] != c1[0][0]:
print((n - c0[0][1] - c1[0][1]))
else:
print((n - max(c0[1][1] + c1[0][1], c0[0][1] + c1[1][1])))
| false | 42.105263 | [
"-n = int(eval(input()))",
"-l = list(map(int, input().split()))",
"-l0 = l[::2]",
"-l1 = l[1::2]",
"-c0 = Counter(l0)",
"-c1 = Counter(l1)",
"-ll0 = len(l0)",
"-ll1 = len(l1)",
"-c0m = c0.most_common()[:2] + [(0, 0)]",
"-c1m = c1.most_common()[:2] + [(0, 0)]",
"-if c0m[0][0] != c1m[0][0]:",
"- print((ll0 - c0m[0][1] + ll1 - c1m[0][1]))",
"+n, *l = list(map(int, open(0).read().split()))",
"+c0 = Counter(l[::2]).most_common() + [(0, 0)]",
"+c1 = Counter(l[1::2]).most_common() + [(0, 0)]",
"+if c0[0][0] != c1[0][0]:",
"+ print((n - c0[0][1] - c1[0][1]))",
"- print((min(ll0 - c0m[1][1] + ll1 - c1m[0][1], ll0 - c0m[0][1] + ll1 - c1m[1][1])))",
"+ print((n - max(c0[1][1] + c1[0][1], c0[0][1] + c1[1][1])))"
]
| false | 0.048761 | 0.150948 | 0.323035 | [
"s563619049",
"s578872502"
]
|
u073852194 | p03714 | python | s807743741 | s645115350 | 1,033 | 689 | 122,256 | 122,512 | Accepted | Accepted | 33.3 | import heapq
class Heapq:
def __init__(self, arr, desc=False):
if desc:
arr = [-a for a in arr]
self.sign = -1 if desc else 1
self.hq = arr
heapq.heapify(self.hq)
def pop(self):
return heapq.heappop(self.hq) * self.sign
def push(self, a):
heapq.heappush(self.hq, a * self.sign)
def top(self):
return self.hq[0] * self.sign
n = int(eval(input()))
A = list(map(int,input().split()))
heap_l = Heapq(A[:n])
heap_r = Heapq(A[2*n:],desc=True)
max_l = [0]*(n+1)
min_r = [0]*(n+1)
max_l[0] = sum(A[:n])
min_r[0] = sum(A[2*n:])
for i in range(n):
p = heap_l.pop()
heap_l.push(max(A[n+i],p))
max_l[i+1] = max_l[i]+max(0,A[n+i]-p)
q = heap_r.pop()
heap_r.push(min(A[-1-i-n],q))
min_r[i+1] = min_r[i]+min(0,A[-1-i-n]-q)
ans = -float('inf')
for i in range(n+1):
ans = max(ans,max_l[i]-min_r[-1-i])
print(ans) | from heapq import heappop, heappush, heapify
N = int(eval(input()))
A = list(map(int, input().split()))
L = A[:N]
heapify(L)
sumL = [sum(A[:N])]
for i in range(N):
x = heappop(L)
if x < A[N + i]:
sumL.append(sumL[-1] - x + A[N + i])
heappush(L, A[N + i])
else:
sumL.append(sumL[-1])
heappush(L, x)
R = list([-x for x in A[2 * N:]])
heapify(R)
sumR = [sum(A[2 * N:])]
for i in range(N):
x = -heappop(R)
if x > A[2 * N - 1 - i]:
sumR.append(sumR[-1] - x + A[2 * N - 1 - i])
heappush(R, -A[2 * N - 1 - i])
else:
sumR.append(sumR[-1])
heappush(R, -x)
res = -10**18
for i in range(N + 1):
res = max(res, sumL[i] - sumR[-1 - i])
print(res) | 46 | 37 | 959 | 768 | import heapq
class Heapq:
def __init__(self, arr, desc=False):
if desc:
arr = [-a for a in arr]
self.sign = -1 if desc else 1
self.hq = arr
heapq.heapify(self.hq)
def pop(self):
return heapq.heappop(self.hq) * self.sign
def push(self, a):
heapq.heappush(self.hq, a * self.sign)
def top(self):
return self.hq[0] * self.sign
n = int(eval(input()))
A = list(map(int, input().split()))
heap_l = Heapq(A[:n])
heap_r = Heapq(A[2 * n :], desc=True)
max_l = [0] * (n + 1)
min_r = [0] * (n + 1)
max_l[0] = sum(A[:n])
min_r[0] = sum(A[2 * n :])
for i in range(n):
p = heap_l.pop()
heap_l.push(max(A[n + i], p))
max_l[i + 1] = max_l[i] + max(0, A[n + i] - p)
q = heap_r.pop()
heap_r.push(min(A[-1 - i - n], q))
min_r[i + 1] = min_r[i] + min(0, A[-1 - i - n] - q)
ans = -float("inf")
for i in range(n + 1):
ans = max(ans, max_l[i] - min_r[-1 - i])
print(ans)
| from heapq import heappop, heappush, heapify
N = int(eval(input()))
A = list(map(int, input().split()))
L = A[:N]
heapify(L)
sumL = [sum(A[:N])]
for i in range(N):
x = heappop(L)
if x < A[N + i]:
sumL.append(sumL[-1] - x + A[N + i])
heappush(L, A[N + i])
else:
sumL.append(sumL[-1])
heappush(L, x)
R = list([-x for x in A[2 * N :]])
heapify(R)
sumR = [sum(A[2 * N :])]
for i in range(N):
x = -heappop(R)
if x > A[2 * N - 1 - i]:
sumR.append(sumR[-1] - x + A[2 * N - 1 - i])
heappush(R, -A[2 * N - 1 - i])
else:
sumR.append(sumR[-1])
heappush(R, -x)
res = -(10**18)
for i in range(N + 1):
res = max(res, sumL[i] - sumR[-1 - i])
print(res)
| false | 19.565217 | [
"-import heapq",
"+from heapq import heappop, heappush, heapify",
"-",
"-class Heapq:",
"- def __init__(self, arr, desc=False):",
"- if desc:",
"- arr = [-a for a in arr]",
"- self.sign = -1 if desc else 1",
"- self.hq = arr",
"- heapq.heapify(self.hq)",
"-",
"- def pop(self):",
"- return heapq.heappop(self.hq) * self.sign",
"-",
"- def push(self, a):",
"- heapq.heappush(self.hq, a * self.sign)",
"-",
"- def top(self):",
"- return self.hq[0] * self.sign",
"-",
"-",
"-n = int(eval(input()))",
"+N = int(eval(input()))",
"-heap_l = Heapq(A[:n])",
"-heap_r = Heapq(A[2 * n :], desc=True)",
"-max_l = [0] * (n + 1)",
"-min_r = [0] * (n + 1)",
"-max_l[0] = sum(A[:n])",
"-min_r[0] = sum(A[2 * n :])",
"-for i in range(n):",
"- p = heap_l.pop()",
"- heap_l.push(max(A[n + i], p))",
"- max_l[i + 1] = max_l[i] + max(0, A[n + i] - p)",
"- q = heap_r.pop()",
"- heap_r.push(min(A[-1 - i - n], q))",
"- min_r[i + 1] = min_r[i] + min(0, A[-1 - i - n] - q)",
"-ans = -float(\"inf\")",
"-for i in range(n + 1):",
"- ans = max(ans, max_l[i] - min_r[-1 - i])",
"-print(ans)",
"+L = A[:N]",
"+heapify(L)",
"+sumL = [sum(A[:N])]",
"+for i in range(N):",
"+ x = heappop(L)",
"+ if x < A[N + i]:",
"+ sumL.append(sumL[-1] - x + A[N + i])",
"+ heappush(L, A[N + i])",
"+ else:",
"+ sumL.append(sumL[-1])",
"+ heappush(L, x)",
"+R = list([-x for x in A[2 * N :]])",
"+heapify(R)",
"+sumR = [sum(A[2 * N :])]",
"+for i in range(N):",
"+ x = -heappop(R)",
"+ if x > A[2 * N - 1 - i]:",
"+ sumR.append(sumR[-1] - x + A[2 * N - 1 - i])",
"+ heappush(R, -A[2 * N - 1 - i])",
"+ else:",
"+ sumR.append(sumR[-1])",
"+ heappush(R, -x)",
"+res = -(10**18)",
"+for i in range(N + 1):",
"+ res = max(res, sumL[i] - sumR[-1 - i])",
"+print(res)"
]
| false | 0.067814 | 0.060549 | 1.119983 | [
"s807743741",
"s645115350"
]
|
u802963389 | p03241 | python | s928395238 | s424887679 | 25 | 20 | 3,060 | 3,188 | Accepted | Accepted | 20 | N,M = list(map(int, input().split()))
li = []
for i in range(1, M + 1):
if i * i > M:
break
if M % i == 0:
li.append(i)
li.append(M // i)
ans = 1
li.sort(reverse=True)
for i in li:
if N * i <= M:
ans = i
break
print(ans)
| # D. Partition
# https://atcoder.jp/contests/abc112/tasks/abc112_d
# 約数列挙
def make_divisors(n):
lower_divisors = []
upper_divisors = []
for i in range(1, int(n**0.5)+1):
if n % i == 0:
lower_divisors.append(i)
if i != n // i:
upper_divisors.append(n//i)
upper_divisors.reverse()
return lower_divisors + upper_divisors
n, m = list(map(int, input().split()))
box = make_divisors(m)
for i in range(len(box)):
if box[i] >= n:
print((m // box[i]))
exit()
| 20 | 25 | 291 | 550 | N, M = list(map(int, input().split()))
li = []
for i in range(1, M + 1):
if i * i > M:
break
if M % i == 0:
li.append(i)
li.append(M // i)
ans = 1
li.sort(reverse=True)
for i in li:
if N * i <= M:
ans = i
break
print(ans)
| # D. Partition
# https://atcoder.jp/contests/abc112/tasks/abc112_d
# 約数列挙
def make_divisors(n):
lower_divisors = []
upper_divisors = []
for i in range(1, int(n**0.5) + 1):
if n % i == 0:
lower_divisors.append(i)
if i != n // i:
upper_divisors.append(n // i)
upper_divisors.reverse()
return lower_divisors + upper_divisors
n, m = list(map(int, input().split()))
box = make_divisors(m)
for i in range(len(box)):
if box[i] >= n:
print((m // box[i]))
exit()
| false | 20 | [
"-N, M = list(map(int, input().split()))",
"-li = []",
"-for i in range(1, M + 1):",
"- if i * i > M:",
"- break",
"- if M % i == 0:",
"- li.append(i)",
"- li.append(M // i)",
"-ans = 1",
"-li.sort(reverse=True)",
"-for i in li:",
"- if N * i <= M:",
"- ans = i",
"- break",
"-print(ans)",
"+# D. Partition",
"+# https://atcoder.jp/contests/abc112/tasks/abc112_d",
"+# 約数列挙",
"+def make_divisors(n):",
"+ lower_divisors = []",
"+ upper_divisors = []",
"+ for i in range(1, int(n**0.5) + 1):",
"+ if n % i == 0:",
"+ lower_divisors.append(i)",
"+ if i != n // i:",
"+ upper_divisors.append(n // i)",
"+ upper_divisors.reverse()",
"+ return lower_divisors + upper_divisors",
"+",
"+",
"+n, m = list(map(int, input().split()))",
"+box = make_divisors(m)",
"+for i in range(len(box)):",
"+ if box[i] >= n:",
"+ print((m // box[i]))",
"+ exit()"
]
| false | 0.042448 | 0.038991 | 1.088675 | [
"s928395238",
"s424887679"
]
|
u664373116 | p02820 | python | s352511232 | s538474787 | 876 | 99 | 3,636 | 3,444 | Accepted | Accepted | 88.7 | n,k=list(map(int,input().split()))
r,s,p=list(map(int,input().split()))
t=eval(input())
vic=""
ans=0
for i in t:
if i=="r":
vic+="p"
if i=="p":
vic+="s"
if i=="s":
vic+="r"
#print(vic[:k])
for i in vic[:k]:
if i=="r":
ans+=r
elif i=="p":
ans+=p
elif i=="s":
ans+=s
#print(vic)
#print(ans)
for i in range(k,n):
#print(i,":",vic[i])
if vic[i]==vic[i-k]:
#print("lose")
if not i==n-1:
vic=vic[:i]+'n'+vic[i+1:]
else:
#print("win")
if vic[i]=="r":
ans+=r
elif vic[i]=="p":
ans+=p
elif vic[i]=="s":
ans+=s
else:
pass
#print("wrong input")
#print()
print(ans) | def sol(score,hand):
if hand=="r":
return score["p"]
elif hand=="p":
return score["s"]
elif hand=="s":
return score["r"]
return 0
n,k=list(map(int,input().split()))
r,s,p=list(map(int,input().split()))
t=eval(input())
win=""
for num,val in enumerate(t):
if num<k or win[num-k]!=val:
win+=val
else:
win+="n"
score={"r":r,"p":p,"s":s}
ans=0
for val in win:
ans+=sol(score,val)
print(ans)
| 43 | 23 | 807 | 459 | n, k = list(map(int, input().split()))
r, s, p = list(map(int, input().split()))
t = eval(input())
vic = ""
ans = 0
for i in t:
if i == "r":
vic += "p"
if i == "p":
vic += "s"
if i == "s":
vic += "r"
# print(vic[:k])
for i in vic[:k]:
if i == "r":
ans += r
elif i == "p":
ans += p
elif i == "s":
ans += s
# print(vic)
# print(ans)
for i in range(k, n):
# print(i,":",vic[i])
if vic[i] == vic[i - k]:
# print("lose")
if not i == n - 1:
vic = vic[:i] + "n" + vic[i + 1 :]
else:
# print("win")
if vic[i] == "r":
ans += r
elif vic[i] == "p":
ans += p
elif vic[i] == "s":
ans += s
else:
pass
# print("wrong input")
# print()
print(ans)
| def sol(score, hand):
if hand == "r":
return score["p"]
elif hand == "p":
return score["s"]
elif hand == "s":
return score["r"]
return 0
n, k = list(map(int, input().split()))
r, s, p = list(map(int, input().split()))
t = eval(input())
win = ""
for num, val in enumerate(t):
if num < k or win[num - k] != val:
win += val
else:
win += "n"
score = {"r": r, "p": p, "s": s}
ans = 0
for val in win:
ans += sol(score, val)
print(ans)
| false | 46.511628 | [
"+def sol(score, hand):",
"+ if hand == \"r\":",
"+ return score[\"p\"]",
"+ elif hand == \"p\":",
"+ return score[\"s\"]",
"+ elif hand == \"s\":",
"+ return score[\"r\"]",
"+ return 0",
"+",
"+",
"-vic = \"\"",
"+win = \"\"",
"+for num, val in enumerate(t):",
"+ if num < k or win[num - k] != val:",
"+ win += val",
"+ else:",
"+ win += \"n\"",
"+score = {\"r\": r, \"p\": p, \"s\": s}",
"-for i in t:",
"- if i == \"r\":",
"- vic += \"p\"",
"- if i == \"p\":",
"- vic += \"s\"",
"- if i == \"s\":",
"- vic += \"r\"",
"-# print(vic[:k])",
"-for i in vic[:k]:",
"- if i == \"r\":",
"- ans += r",
"- elif i == \"p\":",
"- ans += p",
"- elif i == \"s\":",
"- ans += s",
"-# print(vic)",
"-# print(ans)",
"-for i in range(k, n):",
"- # print(i,\":\",vic[i])",
"- if vic[i] == vic[i - k]:",
"- # print(\"lose\")",
"- if not i == n - 1:",
"- vic = vic[:i] + \"n\" + vic[i + 1 :]",
"- else:",
"- # print(\"win\")",
"- if vic[i] == \"r\":",
"- ans += r",
"- elif vic[i] == \"p\":",
"- ans += p",
"- elif vic[i] == \"s\":",
"- ans += s",
"- else:",
"- pass",
"- # print(\"wrong input\")",
"- # print()",
"+for val in win:",
"+ ans += sol(score, val)"
]
| false | 0.045096 | 0.037954 | 1.18818 | [
"s352511232",
"s538474787"
]
|
u810735437 | p02789 | python | s931155289 | s579719384 | 86 | 17 | 8,008 | 2,940 | Accepted | Accepted | 80.23 | #!/usr/bin/env python3
# -*- coding: utf-8 -*-
import array
from bisect import *
from collections import *
import fractions
import heapq
from itertools import *
import math
import random
import re
import string
import sys
N, M = list(map(int, input().split()))
if N == M:
print("Yes")
else:
print("No")
| n, m = list(map(int, input().split()))
if n == m:
print ('Yes')
else:
print ('No') | 21 | 5 | 328 | 84 | #!/usr/bin/env python3
# -*- coding: utf-8 -*-
import array
from bisect import *
from collections import *
import fractions
import heapq
from itertools import *
import math
import random
import re
import string
import sys
N, M = list(map(int, input().split()))
if N == M:
print("Yes")
else:
print("No")
| n, m = list(map(int, input().split()))
if n == m:
print("Yes")
else:
print("No")
| false | 76.190476 | [
"-#!/usr/bin/env python3",
"-# -*- coding: utf-8 -*-",
"-import array",
"-from bisect import *",
"-from collections import *",
"-import fractions",
"-import heapq",
"-from itertools import *",
"-import math",
"-import random",
"-import re",
"-import string",
"-import sys",
"-",
"-N, M = list(map(int, input().split()))",
"-if N == M:",
"+n, m = list(map(int, input().split()))",
"+if n == m:"
]
| false | 0.040011 | 0.040312 | 0.992549 | [
"s931155289",
"s579719384"
]
|
u254871849 | p04031 | python | s540408192 | s066143347 | 150 | 20 | 12,480 | 2,940 | Accepted | Accepted | 86.67 | import sys
import numpy as np
I = np.array(sys.stdin.read().split(), dtype=np.int64)
a = I[1:]
def main():
m = int(np.around(np.mean(a)))
ans = np.sum((a - m) ** 2)
return ans
if __name__ == '__main__':
ans = main()
print(ans) | import sys
n, *a = list(map(int, sys.stdin.read().split()))
def main():
x = round(sum(a) / n)
s = 0
for i in range(n):
s += pow(x - a[i], 2)
print(s)
if __name__ == '__main__':
main() | 14 | 13 | 262 | 208 | import sys
import numpy as np
I = np.array(sys.stdin.read().split(), dtype=np.int64)
a = I[1:]
def main():
m = int(np.around(np.mean(a)))
ans = np.sum((a - m) ** 2)
return ans
if __name__ == "__main__":
ans = main()
print(ans)
| import sys
n, *a = list(map(int, sys.stdin.read().split()))
def main():
x = round(sum(a) / n)
s = 0
for i in range(n):
s += pow(x - a[i], 2)
print(s)
if __name__ == "__main__":
main()
| false | 7.142857 | [
"-import numpy as np",
"-I = np.array(sys.stdin.read().split(), dtype=np.int64)",
"-a = I[1:]",
"+n, *a = list(map(int, sys.stdin.read().split()))",
"- m = int(np.around(np.mean(a)))",
"- ans = np.sum((a - m) ** 2)",
"- return ans",
"+ x = round(sum(a) / n)",
"+ s = 0",
"+ for i in range(n):",
"+ s += pow(x - a[i], 2)",
"+ print(s)",
"- ans = main()",
"- print(ans)",
"+ main()"
]
| false | 0.426036 | 0.036632 | 11.630259 | [
"s540408192",
"s066143347"
]
|
u848874534 | p03041 | python | s653667602 | s812873152 | 19 | 17 | 3,188 | 2,940 | Accepted | Accepted | 10.53 | import re
pat = r'[0-9]+'
Input_num = eval(input())
Input_cou = eval(input())
num_list = re.findall(pat, Input_num)
num = int(num_list[1])
print((Input_cou[:num-1] + Input_cou[num-1].lower() + Input_cou[num:])) | Input_num = input().split()
Input_cou = eval(input())
num = int(Input_num[1])
print((Input_cou[:num-1] + Input_cou[num-1].lower() + Input_cou[num:])) | 10 | 6 | 208 | 148 | import re
pat = r"[0-9]+"
Input_num = eval(input())
Input_cou = eval(input())
num_list = re.findall(pat, Input_num)
num = int(num_list[1])
print((Input_cou[: num - 1] + Input_cou[num - 1].lower() + Input_cou[num:]))
| Input_num = input().split()
Input_cou = eval(input())
num = int(Input_num[1])
print((Input_cou[: num - 1] + Input_cou[num - 1].lower() + Input_cou[num:]))
| false | 40 | [
"-import re",
"-",
"-pat = r\"[0-9]+\"",
"-Input_num = eval(input())",
"+Input_num = input().split()",
"-num_list = re.findall(pat, Input_num)",
"-num = int(num_list[1])",
"+num = int(Input_num[1])"
]
| false | 0.046909 | 0.045533 | 1.030235 | [
"s653667602",
"s812873152"
]
|
u831081653 | p03478 | python | s166183943 | s513522317 | 34 | 29 | 3,060 | 3,060 | Accepted | Accepted | 14.71 | n, a, b = list(map(int, input().split()))
ans = 0
for i in range(1, n+1):
num_str = str(i)
sum = 0
for j in num_str:
sum += int(j)
if a <= sum and sum <= b:
ans += i
print(ans) | n,a,b = list(map(int, input().split()))
# n = int(input())
def get_sum(i):
sum = 0
while i > 0:
sum += (i%10)
i = int(i/10)
return sum
cnt = 0
for i in range(1,n+1):
sum = get_sum(i)
if sum >= a and sum <= b:
cnt += i
print(cnt) | 12 | 17 | 215 | 285 | n, a, b = list(map(int, input().split()))
ans = 0
for i in range(1, n + 1):
num_str = str(i)
sum = 0
for j in num_str:
sum += int(j)
if a <= sum and sum <= b:
ans += i
print(ans)
| n, a, b = list(map(int, input().split()))
# n = int(input())
def get_sum(i):
sum = 0
while i > 0:
sum += i % 10
i = int(i / 10)
return sum
cnt = 0
for i in range(1, n + 1):
sum = get_sum(i)
if sum >= a and sum <= b:
cnt += i
print(cnt)
| false | 29.411765 | [
"-ans = 0",
"+# n = int(input())",
"+def get_sum(i):",
"+ sum = 0",
"+ while i > 0:",
"+ sum += i % 10",
"+ i = int(i / 10)",
"+ return sum",
"+",
"+",
"+cnt = 0",
"- num_str = str(i)",
"- sum = 0",
"- for j in num_str:",
"- sum += int(j)",
"- if a <= sum and sum <= b:",
"- ans += i",
"-print(ans)",
"+ sum = get_sum(i)",
"+ if sum >= a and sum <= b:",
"+ cnt += i",
"+print(cnt)"
]
| false | 0.086606 | 0.037886 | 2.285953 | [
"s166183943",
"s513522317"
]
|
u063596417 | p03494 | python | s064937297 | s992395863 | 73 | 67 | 63,828 | 63,912 | Accepted | Accepted | 8.22 | n = int(eval(input()))
a = list(map(int, input().split()))
ans = -1
isEven = True
while isEven:
list_tmp = []
for an in a:
if an % 2 ==0:
list_tmp.append(an / 2)
else:
isEven = False
break;
a = list_tmp
ans += 1
print(ans)
| n = int(eval(input()))
a = list(map(int, input().split()))
ans = 0
isEven = True
while isEven:
list_tmp = []
for an in a:
if an % 2 ==0:
list_tmp.append(an / 2)
else:
isEven = False
break;
a = list_tmp
ans += 1
print((ans - 1))
| 18 | 18 | 265 | 268 | n = int(eval(input()))
a = list(map(int, input().split()))
ans = -1
isEven = True
while isEven:
list_tmp = []
for an in a:
if an % 2 == 0:
list_tmp.append(an / 2)
else:
isEven = False
break
a = list_tmp
ans += 1
print(ans)
| n = int(eval(input()))
a = list(map(int, input().split()))
ans = 0
isEven = True
while isEven:
list_tmp = []
for an in a:
if an % 2 == 0:
list_tmp.append(an / 2)
else:
isEven = False
break
a = list_tmp
ans += 1
print((ans - 1))
| false | 0 | [
"-ans = -1",
"+ans = 0",
"-print(ans)",
"+print((ans - 1))"
]
| false | 0.047921 | 0.048229 | 0.993604 | [
"s064937297",
"s992395863"
]
|
u609061751 | p03163 | python | s521668197 | s868038177 | 583 | 459 | 120,044 | 119,916 | Accepted | Accepted | 21.27 | import sys
input = sys.stdin.readline
N, W = [int(x) for x in input().split()]
wv = []
for _ in range(N):
wv.append([int(x) for x in input().split()])
dp = [[0] * (W + 1) for _ in range(N + 1)]
for i in range(N):
for j in range(W + 1):
w, v = wv[i]
if j >= w:
dp[i + 1][j] = max(dp[i][j], dp[i][j - w] + v)
else:
dp[i + 1][j] = dp[i][j]
print((dp[N][W])) | import sys
input = sys.stdin.readline
n, W = [int(x) for x in input().split()]
wv = [[int(x) for x in input().split()] for _ in range(n)]
dp = [[0] * (W + 1) for _ in range(n + 1)]
for i in range(1, n + 1):
w, v = wv[i - 1]
for j in range(W + 1):
if j - w >= 0:
dp[i][j] = max(dp[i - 1][j], dp[i - 1][j - w] + v)
else:
dp[i][j] = dp[i - 1][j]
print((dp[-1][-1])) | 19 | 17 | 430 | 428 | import sys
input = sys.stdin.readline
N, W = [int(x) for x in input().split()]
wv = []
for _ in range(N):
wv.append([int(x) for x in input().split()])
dp = [[0] * (W + 1) for _ in range(N + 1)]
for i in range(N):
for j in range(W + 1):
w, v = wv[i]
if j >= w:
dp[i + 1][j] = max(dp[i][j], dp[i][j - w] + v)
else:
dp[i + 1][j] = dp[i][j]
print((dp[N][W]))
| import sys
input = sys.stdin.readline
n, W = [int(x) for x in input().split()]
wv = [[int(x) for x in input().split()] for _ in range(n)]
dp = [[0] * (W + 1) for _ in range(n + 1)]
for i in range(1, n + 1):
w, v = wv[i - 1]
for j in range(W + 1):
if j - w >= 0:
dp[i][j] = max(dp[i - 1][j], dp[i - 1][j - w] + v)
else:
dp[i][j] = dp[i - 1][j]
print((dp[-1][-1]))
| false | 10.526316 | [
"-N, W = [int(x) for x in input().split()]",
"-wv = []",
"-for _ in range(N):",
"- wv.append([int(x) for x in input().split()])",
"-dp = [[0] * (W + 1) for _ in range(N + 1)]",
"-for i in range(N):",
"+n, W = [int(x) for x in input().split()]",
"+wv = [[int(x) for x in input().split()] for _ in range(n)]",
"+dp = [[0] * (W + 1) for _ in range(n + 1)]",
"+for i in range(1, n + 1):",
"+ w, v = wv[i - 1]",
"- w, v = wv[i]",
"- if j >= w:",
"- dp[i + 1][j] = max(dp[i][j], dp[i][j - w] + v)",
"+ if j - w >= 0:",
"+ dp[i][j] = max(dp[i - 1][j], dp[i - 1][j - w] + v)",
"- dp[i + 1][j] = dp[i][j]",
"-print((dp[N][W]))",
"+ dp[i][j] = dp[i - 1][j]",
"+print((dp[-1][-1]))"
]
| false | 0.047029 | 0.125129 | 0.375846 | [
"s521668197",
"s868038177"
]
|
u678167152 | p02685 | python | s348431708 | s044937807 | 1,296 | 292 | 24,324 | 94,152 | Accepted | Accepted | 77.47 | def combs_mod(n,k,mod):
#nC0からnCkまで
inv = [1]*(k+1)
for i in range(1,k+1):
inv[i] = pow(i,mod-2,mod)
ans = [1]*(k+1)
for i in range(1,k+1):
ans[i] = ans[i-1]*(n+1-i)*inv[i]%mod
return ans
def solve():
ans = 0
mod = 998244353
N, M, K = list(map(int, input().split()))
top = min(K,N-1)
combs = combs_mod(N-1,top,mod)
for k in range(top+1):
ans += M*combs[k]*pow(M-1,N-1-k,mod)
ans %= mod
return ans
print((solve())) | def combs_mod(n,k,mod):
#nC0からnCkまで
inv = [1]*(k+1)
for i in range(1,k+1):
inv[i] = pow(i,mod-2,mod)
ans = [1]*(k+1)
for i in range(1,k+1):
ans[i] = ans[i-1]*(n+1-i)*inv[i]%mod
return ans
def solve():
ans = 0
mod = 998244353
N, M, K = list(map(int, input().split()))
lis = combs_mod(N-1,K,mod)
for i in range(K+1):
ans += M*lis[i]*pow(M-1,N-1-i,mod)
ans %= mod
return ans
print((solve())) | 21 | 20 | 468 | 440 | def combs_mod(n, k, mod):
# nC0からnCkまで
inv = [1] * (k + 1)
for i in range(1, k + 1):
inv[i] = pow(i, mod - 2, mod)
ans = [1] * (k + 1)
for i in range(1, k + 1):
ans[i] = ans[i - 1] * (n + 1 - i) * inv[i] % mod
return ans
def solve():
ans = 0
mod = 998244353
N, M, K = list(map(int, input().split()))
top = min(K, N - 1)
combs = combs_mod(N - 1, top, mod)
for k in range(top + 1):
ans += M * combs[k] * pow(M - 1, N - 1 - k, mod)
ans %= mod
return ans
print((solve()))
| def combs_mod(n, k, mod):
# nC0からnCkまで
inv = [1] * (k + 1)
for i in range(1, k + 1):
inv[i] = pow(i, mod - 2, mod)
ans = [1] * (k + 1)
for i in range(1, k + 1):
ans[i] = ans[i - 1] * (n + 1 - i) * inv[i] % mod
return ans
def solve():
ans = 0
mod = 998244353
N, M, K = list(map(int, input().split()))
lis = combs_mod(N - 1, K, mod)
for i in range(K + 1):
ans += M * lis[i] * pow(M - 1, N - 1 - i, mod)
ans %= mod
return ans
print((solve()))
| false | 4.761905 | [
"- top = min(K, N - 1)",
"- combs = combs_mod(N - 1, top, mod)",
"- for k in range(top + 1):",
"- ans += M * combs[k] * pow(M - 1, N - 1 - k, mod)",
"+ lis = combs_mod(N - 1, K, mod)",
"+ for i in range(K + 1):",
"+ ans += M * lis[i] * pow(M - 1, N - 1 - i, mod)"
]
| false | 0.074426 | 0.115393 | 0.64498 | [
"s348431708",
"s044937807"
]
|
u312025627 | p03965 | python | s667549620 | s882694577 | 171 | 32 | 39,536 | 3,188 | Accepted | Accepted | 81.29 | def main():
S = eval(input())
ans = 0
g_st = 0
for s in S:
if g_st == 0:
g_st += 1
if s == "p":
ans -= 1
else:
g_st -= 1
if s == "g":
ans += 1
print(ans)
if __name__ == '__main__':
main()
| def main():
S = eval(input())
ans = 0
for i, s in enumerate(S):
if i & 1:
if s == "g": # パー
ans += 1
else:
if s == "p":
ans -= 1
print(ans)
if __name__ == '__main__':
main()
| 18 | 15 | 321 | 277 | def main():
S = eval(input())
ans = 0
g_st = 0
for s in S:
if g_st == 0:
g_st += 1
if s == "p":
ans -= 1
else:
g_st -= 1
if s == "g":
ans += 1
print(ans)
if __name__ == "__main__":
main()
| def main():
S = eval(input())
ans = 0
for i, s in enumerate(S):
if i & 1:
if s == "g": # パー
ans += 1
else:
if s == "p":
ans -= 1
print(ans)
if __name__ == "__main__":
main()
| false | 16.666667 | [
"- g_st = 0",
"- for s in S:",
"- if g_st == 0:",
"- g_st += 1",
"+ for i, s in enumerate(S):",
"+ if i & 1:",
"+ if s == \"g\": # パー",
"+ ans += 1",
"+ else:",
"- else:",
"- g_st -= 1",
"- if s == \"g\":",
"- ans += 1"
]
| false | 0.087382 | 0.035909 | 2.433402 | [
"s667549620",
"s882694577"
]
|
u197615397 | p02363 | python | s943930322 | s119063034 | 170 | 150 | 6,220 | 6,236 | Accepted | Accepted | 11.76 | import sys
def warshall_floyd(v_count, matrix):
for i in range(v_count):
for j, c2 in enumerate(matrix[j][i] for j in range(v_count)):
for k, c1, c3 in zip(list(range(v_count)), matrix[j], matrix[i]):
if c1 > c2+c3:
matrix[j][k] = c2+c3
return matrix
def has_negative_cycle(a) -> bool:
return any(row[i] < 0 for i, row in enumerate(a))
V, E = list(map(int, input().split()))
inf = float("inf")
matrix = [[inf]*V for _ in [0]*V]
for i in range(V):
matrix[i][i] = 0
for s, t, d in (list(map(int, l.split())) for l in sys.stdin):
matrix[s][t] = d
warshall_floyd(V, matrix)
if has_negative_cycle(matrix):
print("NEGATIVE CYCLE")
else:
for row in matrix:
print((" ".join([str(n) if n!=inf else "INF" for n in row])))
| import sys
def warshall_floyd(v_count: int, matrix: list) -> list:
""" ワーシャルフロイド
:param v_count: 頂点数
:param matrix: 隣接行列
"""
for i in range(v_count):
for j, c2 in enumerate(row[i] for row in matrix):
for k, (c1, c3) in enumerate(zip(matrix[j], matrix[i])):
if c1 > c2+c3:
matrix[j][k] = c2+c3
return matrix
def has_negative_cycle(matrix: list) -> bool:
""" 負閉路チェック
:param matrix: 隣接行列(ワーシャルフロイドの結果)
"""
return any(row[i] < 0 for i, row in enumerate(matrix))
V, E = list(map(int, input().split()))
inf = float("inf")
matrix = [[inf]*V for _ in [0]*V]
for i in range(V):
matrix[i][i] = 0
for s, t, d in (list(map(int, l.split())) for l in sys.stdin):
matrix[s][t] = d
warshall_floyd(V, matrix)
if has_negative_cycle(matrix):
print("NEGATIVE CYCLE")
else:
for row in matrix:
print((" ".join([str(n) if n!=inf else "INF" for n in row])))
| 28 | 35 | 821 | 984 | import sys
def warshall_floyd(v_count, matrix):
for i in range(v_count):
for j, c2 in enumerate(matrix[j][i] for j in range(v_count)):
for k, c1, c3 in zip(list(range(v_count)), matrix[j], matrix[i]):
if c1 > c2 + c3:
matrix[j][k] = c2 + c3
return matrix
def has_negative_cycle(a) -> bool:
return any(row[i] < 0 for i, row in enumerate(a))
V, E = list(map(int, input().split()))
inf = float("inf")
matrix = [[inf] * V for _ in [0] * V]
for i in range(V):
matrix[i][i] = 0
for s, t, d in (list(map(int, l.split())) for l in sys.stdin):
matrix[s][t] = d
warshall_floyd(V, matrix)
if has_negative_cycle(matrix):
print("NEGATIVE CYCLE")
else:
for row in matrix:
print((" ".join([str(n) if n != inf else "INF" for n in row])))
| import sys
def warshall_floyd(v_count: int, matrix: list) -> list:
"""ワーシャルフロイド
:param v_count: 頂点数
:param matrix: 隣接行列
"""
for i in range(v_count):
for j, c2 in enumerate(row[i] for row in matrix):
for k, (c1, c3) in enumerate(zip(matrix[j], matrix[i])):
if c1 > c2 + c3:
matrix[j][k] = c2 + c3
return matrix
def has_negative_cycle(matrix: list) -> bool:
"""負閉路チェック
:param matrix: 隣接行列(ワーシャルフロイドの結果)
"""
return any(row[i] < 0 for i, row in enumerate(matrix))
V, E = list(map(int, input().split()))
inf = float("inf")
matrix = [[inf] * V for _ in [0] * V]
for i in range(V):
matrix[i][i] = 0
for s, t, d in (list(map(int, l.split())) for l in sys.stdin):
matrix[s][t] = d
warshall_floyd(V, matrix)
if has_negative_cycle(matrix):
print("NEGATIVE CYCLE")
else:
for row in matrix:
print((" ".join([str(n) if n != inf else "INF" for n in row])))
| false | 20 | [
"-def warshall_floyd(v_count, matrix):",
"+def warshall_floyd(v_count: int, matrix: list) -> list:",
"+ \"\"\"ワーシャルフロイド",
"+ :param v_count: 頂点数",
"+ :param matrix: 隣接行列",
"+ \"\"\"",
"- for j, c2 in enumerate(matrix[j][i] for j in range(v_count)):",
"- for k, c1, c3 in zip(list(range(v_count)), matrix[j], matrix[i]):",
"+ for j, c2 in enumerate(row[i] for row in matrix):",
"+ for k, (c1, c3) in enumerate(zip(matrix[j], matrix[i])):",
"-def has_negative_cycle(a) -> bool:",
"- return any(row[i] < 0 for i, row in enumerate(a))",
"+def has_negative_cycle(matrix: list) -> bool:",
"+ \"\"\"負閉路チェック",
"+ :param matrix: 隣接行列(ワーシャルフロイドの結果)",
"+ \"\"\"",
"+ return any(row[i] < 0 for i, row in enumerate(matrix))"
]
| false | 0.036176 | 0.039033 | 0.926811 | [
"s943930322",
"s119063034"
]
|
u312025627 | p03567 | python | s628776805 | s540184203 | 166 | 17 | 38,256 | 2,940 | Accepted | Accepted | 89.76 | def main():
S = eval(input())
print(("Yes" if 'AC' in S else 'No'))
if __name__ == '__main__':
main() | def main():
S = eval(input())
if S.count("AC"):
print("Yes")
else:
print("No")
if __name__ == '__main__':
main()
| 6 | 10 | 112 | 150 | def main():
S = eval(input())
print(("Yes" if "AC" in S else "No"))
if __name__ == "__main__":
main()
| def main():
S = eval(input())
if S.count("AC"):
print("Yes")
else:
print("No")
if __name__ == "__main__":
main()
| false | 40 | [
"- print((\"Yes\" if \"AC\" in S else \"No\"))",
"+ if S.count(\"AC\"):",
"+ print(\"Yes\")",
"+ else:",
"+ print(\"No\")"
]
| false | 0.034868 | 0.035152 | 0.991902 | [
"s628776805",
"s540184203"
]
|
u934442292 | p03379 | python | s157570172 | s052491435 | 273 | 231 | 25,220 | 25,572 | Accepted | Accepted | 15.38 | import sys
input = sys.stdin.readline
def main():
N = int(eval(input()))
X = list(map(int, input().split()))
A, B = sorted(X)[N // 2 - 1: N // 2 + 1]
for x in X:
if x <= A:
print(B)
else:
print(A)
if __name__ == "__main__":
main()
| import sys
input = sys.stdin.readline
def main():
N = int(input())
X = list(map(int, input().split()))
A, B = sorted(X)[N // 2 - 1: N // 2 + 1]
ans = [B if x <= A else A for x in X]
print(*ans, sep="\n")
if __name__ == "__main__":
main()
| 19 | 16 | 309 | 283 | import sys
input = sys.stdin.readline
def main():
N = int(eval(input()))
X = list(map(int, input().split()))
A, B = sorted(X)[N // 2 - 1 : N // 2 + 1]
for x in X:
if x <= A:
print(B)
else:
print(A)
if __name__ == "__main__":
main()
| import sys
input = sys.stdin.readline
def main():
N = int(input())
X = list(map(int, input().split()))
A, B = sorted(X)[N // 2 - 1 : N // 2 + 1]
ans = [B if x <= A else A for x in X]
print(*ans, sep="\n")
if __name__ == "__main__":
main()
| false | 15.789474 | [
"- N = int(eval(input()))",
"+ N = int(input())",
"- for x in X:",
"- if x <= A:",
"- print(B)",
"- else:",
"- print(A)",
"+ ans = [B if x <= A else A for x in X]",
"+ print(*ans, sep=\"\\n\")"
]
| false | 0.045533 | 0.123392 | 0.369011 | [
"s157570172",
"s052491435"
]
|
u729133443 | p02735 | python | s031867888 | s383934055 | 298 | 43 | 53,084 | 3,064 | Accepted | Accepted | 85.57 | from heapq import*
def main():
h,w=list(map(int,input().split()))
s=[eval(input())for _ in range(h)]
g=h*w+1
e=[[]for _ in range(g)]
for i in range(h):
for j in range(w):
for y,x in((i+1,j),(i,j+1)):
if y<h and x<w:
if s[i][j]=='.'and s[y][x]!='.':
e[i*w+j]+=(1,y*w+x),
else:
e[i*w+j]+=(0,y*w+x),
e[g-1]+=(s[0][0]!='.',0),
q=[g-1]
d=[10**12]*g
while q:
c=heappop(q)
c,v=c//g,c%g
if c>d[v]:continue
d[v]=c
for x,w in e[v]:
x+=c
if d[w]>x:
d[w]=x
heappush(q,x*g+w)
print((d[g-2]))
main() | h,*s=open(0)
h,w=list(map(int,h.split()))
dp=[[9e9]*w for _ in s]
dp[0][0]=s[0][0]<'.'
for i in range(h*w):
i,j=i//w,i%w
for y,x in((i+1,j),(i,j+1)):
if y<h and x<w:dp[y][x]=min(dp[y][x],dp[i][j]+(s[i][j]=='.'>s[y][x]))
print((dp[-1][-1])) | 29 | 9 | 629 | 247 | from heapq import *
def main():
h, w = list(map(int, input().split()))
s = [eval(input()) for _ in range(h)]
g = h * w + 1
e = [[] for _ in range(g)]
for i in range(h):
for j in range(w):
for y, x in ((i + 1, j), (i, j + 1)):
if y < h and x < w:
if s[i][j] == "." and s[y][x] != ".":
e[i * w + j] += ((1, y * w + x),)
else:
e[i * w + j] += ((0, y * w + x),)
e[g - 1] += ((s[0][0] != ".", 0),)
q = [g - 1]
d = [10**12] * g
while q:
c = heappop(q)
c, v = c // g, c % g
if c > d[v]:
continue
d[v] = c
for x, w in e[v]:
x += c
if d[w] > x:
d[w] = x
heappush(q, x * g + w)
print((d[g - 2]))
main()
| h, *s = open(0)
h, w = list(map(int, h.split()))
dp = [[9e9] * w for _ in s]
dp[0][0] = s[0][0] < "."
for i in range(h * w):
i, j = i // w, i % w
for y, x in ((i + 1, j), (i, j + 1)):
if y < h and x < w:
dp[y][x] = min(dp[y][x], dp[i][j] + (s[i][j] == "." > s[y][x]))
print((dp[-1][-1]))
| false | 68.965517 | [
"-from heapq import *",
"-",
"-",
"-def main():",
"- h, w = list(map(int, input().split()))",
"- s = [eval(input()) for _ in range(h)]",
"- g = h * w + 1",
"- e = [[] for _ in range(g)]",
"- for i in range(h):",
"- for j in range(w):",
"- for y, x in ((i + 1, j), (i, j + 1)):",
"- if y < h and x < w:",
"- if s[i][j] == \".\" and s[y][x] != \".\":",
"- e[i * w + j] += ((1, y * w + x),)",
"- else:",
"- e[i * w + j] += ((0, y * w + x),)",
"- e[g - 1] += ((s[0][0] != \".\", 0),)",
"- q = [g - 1]",
"- d = [10**12] * g",
"- while q:",
"- c = heappop(q)",
"- c, v = c // g, c % g",
"- if c > d[v]:",
"- continue",
"- d[v] = c",
"- for x, w in e[v]:",
"- x += c",
"- if d[w] > x:",
"- d[w] = x",
"- heappush(q, x * g + w)",
"- print((d[g - 2]))",
"-",
"-",
"-main()",
"+h, *s = open(0)",
"+h, w = list(map(int, h.split()))",
"+dp = [[9e9] * w for _ in s]",
"+dp[0][0] = s[0][0] < \".\"",
"+for i in range(h * w):",
"+ i, j = i // w, i % w",
"+ for y, x in ((i + 1, j), (i, j + 1)):",
"+ if y < h and x < w:",
"+ dp[y][x] = min(dp[y][x], dp[i][j] + (s[i][j] == \".\" > s[y][x]))",
"+print((dp[-1][-1]))"
]
| false | 0.034911 | 0.054806 | 0.636996 | [
"s031867888",
"s383934055"
]
|
u644907318 | p03779 | python | s702311019 | s411476756 | 184 | 162 | 38,640 | 38,640 | Accepted | Accepted | 11.96 | X = int(eval(input()))
t = 1
while True:
if X<=((t+1)*t)//2:
break
t += 1
print(t)
| X = int(eval(input()))
k = 1
while (k*(k+1))//2<X:
k += 1
print(k) | 7 | 5 | 99 | 68 | X = int(eval(input()))
t = 1
while True:
if X <= ((t + 1) * t) // 2:
break
t += 1
print(t)
| X = int(eval(input()))
k = 1
while (k * (k + 1)) // 2 < X:
k += 1
print(k)
| false | 28.571429 | [
"-t = 1",
"-while True:",
"- if X <= ((t + 1) * t) // 2:",
"- break",
"- t += 1",
"-print(t)",
"+k = 1",
"+while (k * (k + 1)) // 2 < X:",
"+ k += 1",
"+print(k)"
]
| false | 0.045395 | 0.035144 | 1.291686 | [
"s702311019",
"s411476756"
]
|
u368796742 | p03169 | python | s015083368 | s614828373 | 856 | 594 | 254,600 | 254,344 | Accepted | Accepted | 30.61 |
n = int(eval(input()))
l1 = l2 = l3 = 0
l = [int(i) for i in input().split()]
for i in l:
if i == 1:
l1 += 1
elif i == 2:
l2 += 1
else:
l3 += 1
a = l2+l3
dp = [[[0.0]*(l3+1) for i in range(a+1)] for j in range(n+1)]
for i in range(1,n+1):
for j in range(min(i,a)+1):
for k in range(min(j,l3)+1):
s = i-j
t = j-k
count = n/(s+t+k)
if s > 0:
count += dp[s-1][t][k]*(s/(s+t+k))
if t > 0 :
count += dp[s+1][t-1][k]*(t/(s+t+k))
if k > 0 :
count += dp[s][t+1][k-1]*(k/(s+t+k))
dp[s][t][k] = count
print((dp[l1][l2][l3]))
| def main():
import sys
input = sys.stdin.readline
n = int(eval(input()))
l1 = l2 = l3 = 0
for i in map(int,input().split()):
if i == 1:
l1 += 1
elif i == 2:
l2 += 1
else:
l3 += 1
a = l2+l3
dp = [[[0.0]*(l3+1) for i in range(a+1)] for j in range(n+1)]
for i in range(1,n+1):
for j in range(min(i,a)+1):
for k in range(min(j,l3)+1):
s = i-j
t = j-k
count = n/(s+t+k)
if s > 0:
count += dp[s-1][t][k]*(s/(s+t+k))
if t > 0 :
count += dp[s+1][t-1][k]*(t/(s+t+k))
if k > 0 :
count += dp[s][t+1][k-1]*(k/(s+t+k))
dp[s][t][k] = count
print((dp[l1][l2][l3]))
if __name__ == "__main__":
main()
| 32 | 37 | 729 | 916 | n = int(eval(input()))
l1 = l2 = l3 = 0
l = [int(i) for i in input().split()]
for i in l:
if i == 1:
l1 += 1
elif i == 2:
l2 += 1
else:
l3 += 1
a = l2 + l3
dp = [[[0.0] * (l3 + 1) for i in range(a + 1)] for j in range(n + 1)]
for i in range(1, n + 1):
for j in range(min(i, a) + 1):
for k in range(min(j, l3) + 1):
s = i - j
t = j - k
count = n / (s + t + k)
if s > 0:
count += dp[s - 1][t][k] * (s / (s + t + k))
if t > 0:
count += dp[s + 1][t - 1][k] * (t / (s + t + k))
if k > 0:
count += dp[s][t + 1][k - 1] * (k / (s + t + k))
dp[s][t][k] = count
print((dp[l1][l2][l3]))
| def main():
import sys
input = sys.stdin.readline
n = int(eval(input()))
l1 = l2 = l3 = 0
for i in map(int, input().split()):
if i == 1:
l1 += 1
elif i == 2:
l2 += 1
else:
l3 += 1
a = l2 + l3
dp = [[[0.0] * (l3 + 1) for i in range(a + 1)] for j in range(n + 1)]
for i in range(1, n + 1):
for j in range(min(i, a) + 1):
for k in range(min(j, l3) + 1):
s = i - j
t = j - k
count = n / (s + t + k)
if s > 0:
count += dp[s - 1][t][k] * (s / (s + t + k))
if t > 0:
count += dp[s + 1][t - 1][k] * (t / (s + t + k))
if k > 0:
count += dp[s][t + 1][k - 1] * (k / (s + t + k))
dp[s][t][k] = count
print((dp[l1][l2][l3]))
if __name__ == "__main__":
main()
| false | 13.513514 | [
"-n = int(eval(input()))",
"-l1 = l2 = l3 = 0",
"-l = [int(i) for i in input().split()]",
"-for i in l:",
"- if i == 1:",
"- l1 += 1",
"- elif i == 2:",
"- l2 += 1",
"- else:",
"- l3 += 1",
"-a = l2 + l3",
"-dp = [[[0.0] * (l3 + 1) for i in range(a + 1)] for j in range(n + 1)]",
"-for i in range(1, n + 1):",
"- for j in range(min(i, a) + 1):",
"- for k in range(min(j, l3) + 1):",
"- s = i - j",
"- t = j - k",
"- count = n / (s + t + k)",
"- if s > 0:",
"- count += dp[s - 1][t][k] * (s / (s + t + k))",
"- if t > 0:",
"- count += dp[s + 1][t - 1][k] * (t / (s + t + k))",
"- if k > 0:",
"- count += dp[s][t + 1][k - 1] * (k / (s + t + k))",
"- dp[s][t][k] = count",
"-print((dp[l1][l2][l3]))",
"+def main():",
"+ import sys",
"+",
"+ input = sys.stdin.readline",
"+ n = int(eval(input()))",
"+ l1 = l2 = l3 = 0",
"+ for i in map(int, input().split()):",
"+ if i == 1:",
"+ l1 += 1",
"+ elif i == 2:",
"+ l2 += 1",
"+ else:",
"+ l3 += 1",
"+ a = l2 + l3",
"+ dp = [[[0.0] * (l3 + 1) for i in range(a + 1)] for j in range(n + 1)]",
"+ for i in range(1, n + 1):",
"+ for j in range(min(i, a) + 1):",
"+ for k in range(min(j, l3) + 1):",
"+ s = i - j",
"+ t = j - k",
"+ count = n / (s + t + k)",
"+ if s > 0:",
"+ count += dp[s - 1][t][k] * (s / (s + t + k))",
"+ if t > 0:",
"+ count += dp[s + 1][t - 1][k] * (t / (s + t + k))",
"+ if k > 0:",
"+ count += dp[s][t + 1][k - 1] * (k / (s + t + k))",
"+ dp[s][t][k] = count",
"+ print((dp[l1][l2][l3]))",
"+",
"+",
"+if __name__ == \"__main__\":",
"+ main()"
]
| false | 0.006955 | 0.039976 | 0.173983 | [
"s015083368",
"s614828373"
]
|
u562935282 | p03163 | python | s036020913 | s298103466 | 391 | 357 | 122,444 | 119,152 | Accepted | Accepted | 8.7 | n, w = list(map(int, input().split()))
e = tuple(list(map(int, input().split())) for _ in range(n))
wt, vt = list(zip(*e))
dp = tuple([0] * (w + 1) for _ in range(n + 1))
for i in range(n):
dp[i + 1][:wt[i]] = dp[i][:wt[i]]
for j in range(wt[i], w + 1):
dp[i + 1][j] = max(dp[i][j], dp[i][j - wt[i]] + vt[i])
print((dp[n][w]))
| def main():
import sys
readline = sys.stdin.readline
n, w = list(map(int, readline().split()))
dp = [[0] * (w + 1) for _ in range(n + 1)]
for i in range(1, n + 1): # i個目の品物を選ぶかどうか決めた後の価値の総和の最大値,1-indexed
wi, vi = list(map(int, readline().split()))
for j in range(wi):
dp[i][j] = dp[i - 1][j]
for j in range(wi, w + 1):
dp[i][j] = max(
dp[i - 1][j], # i-1にすることにdebugで気づいた
dp[i - 1][j - wi] + vi
)
print((max(dp[n])))
if __name__ == '__main__':
main()
| 11 | 23 | 335 | 586 | n, w = list(map(int, input().split()))
e = tuple(list(map(int, input().split())) for _ in range(n))
wt, vt = list(zip(*e))
dp = tuple([0] * (w + 1) for _ in range(n + 1))
for i in range(n):
dp[i + 1][: wt[i]] = dp[i][: wt[i]]
for j in range(wt[i], w + 1):
dp[i + 1][j] = max(dp[i][j], dp[i][j - wt[i]] + vt[i])
print((dp[n][w]))
| def main():
import sys
readline = sys.stdin.readline
n, w = list(map(int, readline().split()))
dp = [[0] * (w + 1) for _ in range(n + 1)]
for i in range(1, n + 1): # i個目の品物を選ぶかどうか決めた後の価値の総和の最大値,1-indexed
wi, vi = list(map(int, readline().split()))
for j in range(wi):
dp[i][j] = dp[i - 1][j]
for j in range(wi, w + 1):
dp[i][j] = max(dp[i - 1][j], dp[i - 1][j - wi] + vi) # i-1にすることにdebugで気づいた
print((max(dp[n])))
if __name__ == "__main__":
main()
| false | 52.173913 | [
"-n, w = list(map(int, input().split()))",
"-e = tuple(list(map(int, input().split())) for _ in range(n))",
"-wt, vt = list(zip(*e))",
"-dp = tuple([0] * (w + 1) for _ in range(n + 1))",
"-for i in range(n):",
"- dp[i + 1][: wt[i]] = dp[i][: wt[i]]",
"- for j in range(wt[i], w + 1):",
"- dp[i + 1][j] = max(dp[i][j], dp[i][j - wt[i]] + vt[i])",
"-print((dp[n][w]))",
"+def main():",
"+ import sys",
"+",
"+ readline = sys.stdin.readline",
"+ n, w = list(map(int, readline().split()))",
"+ dp = [[0] * (w + 1) for _ in range(n + 1)]",
"+ for i in range(1, n + 1): # i個目の品物を選ぶかどうか決めた後の価値の総和の最大値,1-indexed",
"+ wi, vi = list(map(int, readline().split()))",
"+ for j in range(wi):",
"+ dp[i][j] = dp[i - 1][j]",
"+ for j in range(wi, w + 1):",
"+ dp[i][j] = max(dp[i - 1][j], dp[i - 1][j - wi] + vi) # i-1にすることにdebugで気づいた",
"+ print((max(dp[n])))",
"+",
"+",
"+if __name__ == \"__main__\":",
"+ main()"
]
| false | 0.039329 | 0.041063 | 0.957757 | [
"s036020913",
"s298103466"
]
|
u130900604 | p02718 | python | s983917182 | s016435021 | 181 | 17 | 38,492 | 2,940 | Accepted | Accepted | 90.61 | def MI():return list(map(int,input().split()))
def LI():return list(MI())
n,m=MI()
a=LI()
sou=sum(a)
if sum([i*4*m>=sou for i in a])>=m:
print("Yes")
else:
print("No") | n,m=list(map(int,input().split()))
a=list(map(int,input().split()))
s=sum(a)
print(("Yes" if (sum([i*4*m>=s for i in a])>=m) else "No")) | 12 | 4 | 183 | 131 | def MI():
return list(map(int, input().split()))
def LI():
return list(MI())
n, m = MI()
a = LI()
sou = sum(a)
if sum([i * 4 * m >= sou for i in a]) >= m:
print("Yes")
else:
print("No")
| n, m = list(map(int, input().split()))
a = list(map(int, input().split()))
s = sum(a)
print(("Yes" if (sum([i * 4 * m >= s for i in a]) >= m) else "No"))
| false | 66.666667 | [
"-def MI():",
"- return list(map(int, input().split()))",
"-",
"-",
"-def LI():",
"- return list(MI())",
"-",
"-",
"-n, m = MI()",
"-a = LI()",
"-sou = sum(a)",
"-if sum([i * 4 * m >= sou for i in a]) >= m:",
"- print(\"Yes\")",
"-else:",
"- print(\"No\")",
"+n, m = list(map(int, input().split()))",
"+a = list(map(int, input().split()))",
"+s = sum(a)",
"+print((\"Yes\" if (sum([i * 4 * m >= s for i in a]) >= m) else \"No\"))"
]
| false | 0.036396 | 0.035291 | 1.031325 | [
"s983917182",
"s016435021"
]
|
u323680411 | p03814 | python | s026175623 | s610954171 | 103 | 49 | 3,444 | 3,516 | Accepted | Accepted | 52.43 | from sys import stdin
def main():
s = next_str()
best = 0
cnt = 0
flg = False
for v in s:
if v == 'A':
flg = True
if flg:
cnt += 1
if flg and v == 'Z':
best = cnt
print(best)
def next_int() -> int:
return int(next_str())
def next_str() -> str:
result = ""
while True:
tmp = stdin.read(1)
if tmp.strip() != "":
result += tmp
elif tmp != '\r':
break
return result
if __name__ == '__main__':
main() | from sys import stdin
def main():
s = eval(input())
best = 0
cnt = 0
flg = False
for v in s:
if v == 'A':
flg = True
if flg:
cnt += 1
if flg and v == 'Z':
best = cnt
print(best)
def next_int() -> int:
return int(next_str())
def next_str() -> str:
result = ""
while True:
tmp = stdin.read(1)
if tmp.strip() != "":
result += tmp
elif tmp != '\r':
break
return result
if __name__ == '__main__':
main() | 38 | 38 | 595 | 592 | from sys import stdin
def main():
s = next_str()
best = 0
cnt = 0
flg = False
for v in s:
if v == "A":
flg = True
if flg:
cnt += 1
if flg and v == "Z":
best = cnt
print(best)
def next_int() -> int:
return int(next_str())
def next_str() -> str:
result = ""
while True:
tmp = stdin.read(1)
if tmp.strip() != "":
result += tmp
elif tmp != "\r":
break
return result
if __name__ == "__main__":
main()
| from sys import stdin
def main():
s = eval(input())
best = 0
cnt = 0
flg = False
for v in s:
if v == "A":
flg = True
if flg:
cnt += 1
if flg and v == "Z":
best = cnt
print(best)
def next_int() -> int:
return int(next_str())
def next_str() -> str:
result = ""
while True:
tmp = stdin.read(1)
if tmp.strip() != "":
result += tmp
elif tmp != "\r":
break
return result
if __name__ == "__main__":
main()
| false | 0 | [
"- s = next_str()",
"+ s = eval(input())"
]
| false | 0.037075 | 0.067267 | 0.551156 | [
"s026175623",
"s610954171"
]
|
u906501980 | p02553 | python | s688956261 | s352984752 | 32 | 27 | 9,180 | 9,152 | Accepted | Accepted | 15.62 | def main():
a, b, c, d = list(map(int, input().split()))
if (a <= 0 and b >= 0) or (c <=0 and d >= 0):
print((max(a*c, b*d, 0)))
else:
print((max(a*c, b*d, a*d, b*c)))
if __name__ == "__main__":
main() | def main():
a, b, c, d = list(map(int, input().split()))
if a*b > 0 and c*d > 0 and a*c < 0:
print((max(a*d, b*c)))
else:
print((max(a*c, b*d, 0)))
if __name__ == "__main__":
main() | 9 | 9 | 232 | 212 | def main():
a, b, c, d = list(map(int, input().split()))
if (a <= 0 and b >= 0) or (c <= 0 and d >= 0):
print((max(a * c, b * d, 0)))
else:
print((max(a * c, b * d, a * d, b * c)))
if __name__ == "__main__":
main()
| def main():
a, b, c, d = list(map(int, input().split()))
if a * b > 0 and c * d > 0 and a * c < 0:
print((max(a * d, b * c)))
else:
print((max(a * c, b * d, 0)))
if __name__ == "__main__":
main()
| false | 0 | [
"- if (a <= 0 and b >= 0) or (c <= 0 and d >= 0):",
"+ if a * b > 0 and c * d > 0 and a * c < 0:",
"+ print((max(a * d, b * c)))",
"+ else:",
"- else:",
"- print((max(a * c, b * d, a * d, b * c)))"
]
| false | 0.125646 | 0.094447 | 1.330341 | [
"s688956261",
"s352984752"
]
|
u281610856 | p03329 | python | s257551121 | s627331932 | 635 | 217 | 7,064 | 44,912 | Accepted | Accepted | 65.83 | n = int(eval(input()))
dp = [i for i in range(n+1)] # dp table 最初は全て1円で払う
for j in range(1, n+1):
power = 1
while power <= j:
dp[j] = min(dp[j], dp[j - power] + 1)
power *= 6
power = 1
while power <= j:
dp[j] = min(dp[j], dp[j - power] + 1)
power *= 9
print((dp[n]))
| n = int(eval(input()))
dp = [i for i in range(n + 1)]
for i in range(1, n+1):
pow = 6
while i - pow > -1:
dp[i] = min(dp[i], dp[i - pow] + 1)
pow *= 6
pow = 9
while i - pow > -1:
dp[i] = min(dp[i], dp[i - pow] + 1)
pow *= 9
# print(dp)
print((dp[n])) | 12 | 13 | 319 | 302 | n = int(eval(input()))
dp = [i for i in range(n + 1)] # dp table 最初は全て1円で払う
for j in range(1, n + 1):
power = 1
while power <= j:
dp[j] = min(dp[j], dp[j - power] + 1)
power *= 6
power = 1
while power <= j:
dp[j] = min(dp[j], dp[j - power] + 1)
power *= 9
print((dp[n]))
| n = int(eval(input()))
dp = [i for i in range(n + 1)]
for i in range(1, n + 1):
pow = 6
while i - pow > -1:
dp[i] = min(dp[i], dp[i - pow] + 1)
pow *= 6
pow = 9
while i - pow > -1:
dp[i] = min(dp[i], dp[i - pow] + 1)
pow *= 9
# print(dp)
print((dp[n]))
| false | 7.692308 | [
"-dp = [i for i in range(n + 1)] # dp table 最初は全て1円で払う",
"-for j in range(1, n + 1):",
"- power = 1",
"- while power <= j:",
"- dp[j] = min(dp[j], dp[j - power] + 1)",
"- power *= 6",
"- power = 1",
"- while power <= j:",
"- dp[j] = min(dp[j], dp[j - power] + 1)",
"- power *= 9",
"+dp = [i for i in range(n + 1)]",
"+for i in range(1, n + 1):",
"+ pow = 6",
"+ while i - pow > -1:",
"+ dp[i] = min(dp[i], dp[i - pow] + 1)",
"+ pow *= 6",
"+ pow = 9",
"+ while i - pow > -1:",
"+ dp[i] = min(dp[i], dp[i - pow] + 1)",
"+ pow *= 9",
"+# print(dp)"
]
| false | 0.118034 | 0.104602 | 1.12841 | [
"s257551121",
"s627331932"
]
|
u814265211 | p03073 | python | s087901088 | s763699326 | 52 | 23 | 9,580 | 4,268 | Accepted | Accepted | 55.77 | raw = eval(input())
s = bin(int(raw, 2))
n = len(raw)
m = bin(int(''.join([str(i%2) for i in range(n)]),2))
a = bin((int(s,2))^int(m,2)).count("1")
b = n-a
print((a if a < b else b)) | s = list(eval(input()))
print((min(s[::2].count('0')+s[1::2].count('1'), s[::2].count('1')+s[1::2].count('0'))))
| 9 | 3 | 186 | 108 | raw = eval(input())
s = bin(int(raw, 2))
n = len(raw)
m = bin(int("".join([str(i % 2) for i in range(n)]), 2))
a = bin((int(s, 2)) ^ int(m, 2)).count("1")
b = n - a
print((a if a < b else b))
| s = list(eval(input()))
print(
(
min(
s[::2].count("0") + s[1::2].count("1"),
s[::2].count("1") + s[1::2].count("0"),
)
)
)
| false | 66.666667 | [
"-raw = eval(input())",
"-s = bin(int(raw, 2))",
"-n = len(raw)",
"-m = bin(int(\"\".join([str(i % 2) for i in range(n)]), 2))",
"-a = bin((int(s, 2)) ^ int(m, 2)).count(\"1\")",
"-b = n - a",
"-print((a if a < b else b))",
"+s = list(eval(input()))",
"+print(",
"+ (",
"+ min(",
"+ s[::2].count(\"0\") + s[1::2].count(\"1\"),",
"+ s[::2].count(\"1\") + s[1::2].count(\"0\"),",
"+ )",
"+ )",
"+)"
]
| false | 0.044549 | 0.084924 | 0.524575 | [
"s087901088",
"s763699326"
]
|
u352394527 | p00151 | python | s195071909 | s142473957 | 470 | 430 | 19,292 | 19,296 | Accepted | Accepted | 8.51 | def main():
while True:
n = int(eval(input()))
if n == 0:
break
mp = ["0" + eval(input()) + "0" for _ in range(n)]
mp.insert(0, "0" * (n + 2))
mp.append("0" * (n + 2))
score = [[[0] * 4 for _ in range(n + 2)] for _ in range(n + 2)]
max_score = 0
for i in range(1, n + 1):
for j in range(1, n + 1):
if mp[i][j] == "1":
score[i][j][0] = score[i - 1][j][0] + 1
score[i][j][1] = score[i][j - 1][1] + 1
score[i][j][2] = score[i - 1][j - 1][2] + 1
score[i][j][3] = score[i - 1][j + 1][3] + 1
max_score = max(max_score, score[i][j][0], score[i][j][1], score[i][j][2], score[i][j][3])
else:
for k in range(4):
score[i][j][k] = 0
print(max_score)
main()
| def main():
while True:
n = int(eval(input()))
if n == 0:
break
mp = ["0" + eval(input()) + "0" for _ in range(n)]
mp.insert(0, "0" * (n + 2))
mp.append("0" * (n + 2))
score = [[[0] * 4 for _ in range(n + 2)] for _ in range(n + 2)]
max_score = 0
for i in range(1, n + 1):
for j in range(1, n + 1):
if mp[i][j] == "1":
score[i][j][0] = score[i - 1][j][0] + 1
score[i][j][1] = score[i][j - 1][1] + 1
score[i][j][2] = score[i - 1][j - 1][2] + 1
score[i][j][3] = score[i - 1][j + 1][3] + 1
max_score = max(max_score, score[i][j][0], score[i][j][1], score[i][j][2], score[i][j][3])
print(max_score)
main()
| 24 | 24 | 795 | 736 | def main():
while True:
n = int(eval(input()))
if n == 0:
break
mp = ["0" + eval(input()) + "0" for _ in range(n)]
mp.insert(0, "0" * (n + 2))
mp.append("0" * (n + 2))
score = [[[0] * 4 for _ in range(n + 2)] for _ in range(n + 2)]
max_score = 0
for i in range(1, n + 1):
for j in range(1, n + 1):
if mp[i][j] == "1":
score[i][j][0] = score[i - 1][j][0] + 1
score[i][j][1] = score[i][j - 1][1] + 1
score[i][j][2] = score[i - 1][j - 1][2] + 1
score[i][j][3] = score[i - 1][j + 1][3] + 1
max_score = max(
max_score,
score[i][j][0],
score[i][j][1],
score[i][j][2],
score[i][j][3],
)
else:
for k in range(4):
score[i][j][k] = 0
print(max_score)
main()
| def main():
while True:
n = int(eval(input()))
if n == 0:
break
mp = ["0" + eval(input()) + "0" for _ in range(n)]
mp.insert(0, "0" * (n + 2))
mp.append("0" * (n + 2))
score = [[[0] * 4 for _ in range(n + 2)] for _ in range(n + 2)]
max_score = 0
for i in range(1, n + 1):
for j in range(1, n + 1):
if mp[i][j] == "1":
score[i][j][0] = score[i - 1][j][0] + 1
score[i][j][1] = score[i][j - 1][1] + 1
score[i][j][2] = score[i - 1][j - 1][2] + 1
score[i][j][3] = score[i - 1][j + 1][3] + 1
max_score = max(
max_score,
score[i][j][0],
score[i][j][1],
score[i][j][2],
score[i][j][3],
)
print(max_score)
main()
| false | 0 | [
"- else:",
"- for k in range(4):",
"- score[i][j][k] = 0"
]
| false | 0.035246 | 0.036932 | 0.954331 | [
"s195071909",
"s142473957"
]
|
u562016607 | p03557 | python | s190756841 | s413472101 | 455 | 366 | 104,804 | 23,232 | Accepted | Accepted | 19.56 | N = int(eval(input()))
A = [int(i) for i in input().split()]
B = [int(i) for i in input().split()]
C = [int(i) for i in input().split()]
A.sort();C.sort()
M = 0
for i in range(N):
low = 0
high = N - 1
t = (low + high) // 2
if A[N-1] < B[i]:
t = N-1
elif A[0] >= B[i]:
t = -1
else:
while (low <= high):
if A[t] < B[i] <= A[t+1]:
break
elif B[i] <= A[t]:
high = t
elif A[t+1] < B[i]:
low = t+1
t = (low + high) // 2
low = 0
high = N - 1
s = (low + high) // 2
if C[N-1] <= B[i]:
s = N-1
elif B[i] < C[0]:
s = -1
else:
while (low <= high):
if C[s] <= B[i] < C[s+1]:
break
elif B[i] < C[s]:
high = s
elif C[s+1] <= B[i]:
low = s + 1
s = (low + high) // 2
M += (t+1)*(N-s-1)
print(M)
| from bisect import bisect_left,bisect_right
N=int(eval(input()))
A=[int(i) for i in input().split()]
B=[int(i) for i in input().split()]
C=[int(i) for i in input().split()]
A.sort()
C.sort()
ans=0
for i in range(N):
ans+=bisect_left(A,B[i])*(N-bisect_right(C,B[i]))
print(ans)
| 41 | 11 | 1,004 | 285 | N = int(eval(input()))
A = [int(i) for i in input().split()]
B = [int(i) for i in input().split()]
C = [int(i) for i in input().split()]
A.sort()
C.sort()
M = 0
for i in range(N):
low = 0
high = N - 1
t = (low + high) // 2
if A[N - 1] < B[i]:
t = N - 1
elif A[0] >= B[i]:
t = -1
else:
while low <= high:
if A[t] < B[i] <= A[t + 1]:
break
elif B[i] <= A[t]:
high = t
elif A[t + 1] < B[i]:
low = t + 1
t = (low + high) // 2
low = 0
high = N - 1
s = (low + high) // 2
if C[N - 1] <= B[i]:
s = N - 1
elif B[i] < C[0]:
s = -1
else:
while low <= high:
if C[s] <= B[i] < C[s + 1]:
break
elif B[i] < C[s]:
high = s
elif C[s + 1] <= B[i]:
low = s + 1
s = (low + high) // 2
M += (t + 1) * (N - s - 1)
print(M)
| from bisect import bisect_left, bisect_right
N = int(eval(input()))
A = [int(i) for i in input().split()]
B = [int(i) for i in input().split()]
C = [int(i) for i in input().split()]
A.sort()
C.sort()
ans = 0
for i in range(N):
ans += bisect_left(A, B[i]) * (N - bisect_right(C, B[i]))
print(ans)
| false | 73.170732 | [
"+from bisect import bisect_left, bisect_right",
"+",
"-M = 0",
"+ans = 0",
"- low = 0",
"- high = N - 1",
"- t = (low + high) // 2",
"- if A[N - 1] < B[i]:",
"- t = N - 1",
"- elif A[0] >= B[i]:",
"- t = -1",
"- else:",
"- while low <= high:",
"- if A[t] < B[i] <= A[t + 1]:",
"- break",
"- elif B[i] <= A[t]:",
"- high = t",
"- elif A[t + 1] < B[i]:",
"- low = t + 1",
"- t = (low + high) // 2",
"- low = 0",
"- high = N - 1",
"- s = (low + high) // 2",
"- if C[N - 1] <= B[i]:",
"- s = N - 1",
"- elif B[i] < C[0]:",
"- s = -1",
"- else:",
"- while low <= high:",
"- if C[s] <= B[i] < C[s + 1]:",
"- break",
"- elif B[i] < C[s]:",
"- high = s",
"- elif C[s + 1] <= B[i]:",
"- low = s + 1",
"- s = (low + high) // 2",
"- M += (t + 1) * (N - s - 1)",
"-print(M)",
"+ ans += bisect_left(A, B[i]) * (N - bisect_right(C, B[i]))",
"+print(ans)"
]
| false | 0.101601 | 0.115685 | 0.878254 | [
"s190756841",
"s413472101"
]
|
u744920373 | p03212 | python | s109243565 | s100386212 | 55 | 42 | 4,464 | 4,332 | Accepted | Accepted | 23.64 | import sys
sys.setrecursionlimit(10**8)
def ii(): return int(sys.stdin.readline())
def mi(): return list(map(int, sys.stdin.readline().split()))
def li(): return list(map(int, sys.stdin.readline().split()))
def li2(N): return [list(map(int, sys.stdin.readline().split())) for _ in range(N)]
def dp2(ini, i, j): return [[ini]*i for _ in range(j)]
def dp3(ini, i, j, k): return [[[ini]*i for _ in range(j)] for _ in range(k)]
import bisect #bisect.bisect_left(B, a)
#from collections import defaultdict #d = defaultdict(int) d[key] += value
import itertools #list(accumulate(A))
from collections import deque
N = ii()
que = deque([33, 35, 37, 53, 55, 57, 73, 75, 77])
ele = ['3', '5', '7']
ind = 0
while True:
num = que[ind] * 10
que.append(num + 3)
que.append(num + 5)
que.append(num + 7)
if len(str(num)) >= 10:
break
ind += 1
ind = bisect.bisect_right(que, N)
ele = ['3', '5', '7']
cnt = 0
for i in range(ind):
tmp = str(que[i])
for e in ele:
if e not in tmp:
cnt += 1
break
print((ind - cnt)) | import sys
sys.setrecursionlimit(10**8)
def ii(): return int(sys.stdin.readline())
def mi(): return list(map(int, sys.stdin.readline().split()))
def li(): return list(map(int, sys.stdin.readline().split()))
def li2(N): return [list(map(int, sys.stdin.readline().split())) for _ in range(N)]
def dp2(ini, i, j): return [[ini]*i for _ in range(j)]
def dp3(ini, i, j, k): return [[[ini]*i for _ in range(j)] for _ in range(k)]
import bisect #bisect.bisect_left(B, a)
#from collections import defaultdict #d = defaultdict(int) d[key] += value
import itertools #list(accumulate(A))
from collections import deque
N = ii()
ele = [3, 5, 7]
l = []
def dfs(num, flag3, flag5, flag7):
#print(num, flag3, flag5, flag7)
if num > N:
return
if flag3 is flag5 is flag7 is True:
l.append(num)
num *= 10
dfs(num+3, True, flag5, flag7)
dfs(num+5, flag3, True, flag7)
dfs(num+7, flag3, flag5, True)
dfs(0, False, False, False)
print((len(l)))
| 39 | 30 | 1,101 | 992 | import sys
sys.setrecursionlimit(10**8)
def ii():
return int(sys.stdin.readline())
def mi():
return list(map(int, sys.stdin.readline().split()))
def li():
return list(map(int, sys.stdin.readline().split()))
def li2(N):
return [list(map(int, sys.stdin.readline().split())) for _ in range(N)]
def dp2(ini, i, j):
return [[ini] * i for _ in range(j)]
def dp3(ini, i, j, k):
return [[[ini] * i for _ in range(j)] for _ in range(k)]
import bisect # bisect.bisect_left(B, a)
# from collections import defaultdict #d = defaultdict(int) d[key] += value
import itertools # list(accumulate(A))
from collections import deque
N = ii()
que = deque([33, 35, 37, 53, 55, 57, 73, 75, 77])
ele = ["3", "5", "7"]
ind = 0
while True:
num = que[ind] * 10
que.append(num + 3)
que.append(num + 5)
que.append(num + 7)
if len(str(num)) >= 10:
break
ind += 1
ind = bisect.bisect_right(que, N)
ele = ["3", "5", "7"]
cnt = 0
for i in range(ind):
tmp = str(que[i])
for e in ele:
if e not in tmp:
cnt += 1
break
print((ind - cnt))
| import sys
sys.setrecursionlimit(10**8)
def ii():
return int(sys.stdin.readline())
def mi():
return list(map(int, sys.stdin.readline().split()))
def li():
return list(map(int, sys.stdin.readline().split()))
def li2(N):
return [list(map(int, sys.stdin.readline().split())) for _ in range(N)]
def dp2(ini, i, j):
return [[ini] * i for _ in range(j)]
def dp3(ini, i, j, k):
return [[[ini] * i for _ in range(j)] for _ in range(k)]
import bisect # bisect.bisect_left(B, a)
# from collections import defaultdict #d = defaultdict(int) d[key] += value
import itertools # list(accumulate(A))
from collections import deque
N = ii()
ele = [3, 5, 7]
l = []
def dfs(num, flag3, flag5, flag7):
# print(num, flag3, flag5, flag7)
if num > N:
return
if flag3 is flag5 is flag7 is True:
l.append(num)
num *= 10
dfs(num + 3, True, flag5, flag7)
dfs(num + 5, flag3, True, flag7)
dfs(num + 7, flag3, flag5, True)
dfs(0, False, False, False)
print((len(l)))
| false | 23.076923 | [
"-que = deque([33, 35, 37, 53, 55, 57, 73, 75, 77])",
"-ele = [\"3\", \"5\", \"7\"]",
"-ind = 0",
"-while True:",
"- num = que[ind] * 10",
"- que.append(num + 3)",
"- que.append(num + 5)",
"- que.append(num + 7)",
"- if len(str(num)) >= 10:",
"- break",
"- ind += 1",
"-ind = bisect.bisect_right(que, N)",
"-ele = [\"3\", \"5\", \"7\"]",
"-cnt = 0",
"-for i in range(ind):",
"- tmp = str(que[i])",
"- for e in ele:",
"- if e not in tmp:",
"- cnt += 1",
"- break",
"-print((ind - cnt))",
"+ele = [3, 5, 7]",
"+l = []",
"+",
"+",
"+def dfs(num, flag3, flag5, flag7):",
"+ # print(num, flag3, flag5, flag7)",
"+ if num > N:",
"+ return",
"+ if flag3 is flag5 is flag7 is True:",
"+ l.append(num)",
"+ num *= 10",
"+ dfs(num + 3, True, flag5, flag7)",
"+ dfs(num + 5, flag3, True, flag7)",
"+ dfs(num + 7, flag3, flag5, True)",
"+",
"+",
"+dfs(0, False, False, False)",
"+print((len(l)))"
]
| false | 0.07855 | 0.053495 | 1.468368 | [
"s109243565",
"s100386212"
]
|
u608088992 | p03112 | python | s620321109 | s373206817 | 1,490 | 681 | 12,048 | 12,180 | Accepted | Accepted | 54.3 | from bisect import bisect
A, B, Q = list(map(int, input().split()))
S, T =[None] * (A+2), [None] * (B+2)
S[0], T[0] = -10**20, -10**20
for i in range(A):
S[i+1] = int(eval(input()))
for i in range(B):
T[i+1] = int(eval(input()))
S[A+1] = 10**20
T[B+1] = 10**20
lenS, lenT = len(S), len(T)
for _ in range(Q):
x = int(eval(input()))
si, ti = bisect(S, x, 0, lenS), bisect(T, x, 0, lenT)
sLength0, sLength1 = x - S[si-1], S[si] - x
tLength0, tLength1 = x - T[ti-1], T[ti] - x
Ans = (max(sLength0, tLength0), max(sLength1, tLength1), sLength0 + tLength1 + min(sLength0, tLength1), sLength1 + tLength0 + min(sLength1, tLength0))
print((min(Ans))) | import sys
from bisect import bisect
F = sys.stdin
A, B, Q = list(map(int, F.readline().strip("\n").split(" ")))
S, T =[None] * (A+2), [None] * (B+2)
S[0], T[0] = -10**20, -10**20
for i in range(A):
S[i+1] = int(F.readline().strip("\n"))
for i in range(B):
T[i+1] = int(F.readline().strip("\n"))
S[A+1] = 10**20
T[B+1] = 10**20
lenS, lenT = len(S), len(T)
for _ in range(Q):
x = int(F.readline().strip("\n"))
si, ti = bisect(S, x, 0, lenS), bisect(T, x, 0, lenT)
sLength0, sLength1 = x - S[si-1], S[si] - x
tLength0, tLength1 = x - T[ti-1], T[ti] - x
Ans = (max(sLength0, tLength0), max(sLength1, tLength1), sLength0 + tLength1 + min(sLength0, tLength1), sLength1 + tLength0 + min(sLength1, tLength0))
print((min(Ans))) | 19 | 21 | 666 | 764 | from bisect import bisect
A, B, Q = list(map(int, input().split()))
S, T = [None] * (A + 2), [None] * (B + 2)
S[0], T[0] = -(10**20), -(10**20)
for i in range(A):
S[i + 1] = int(eval(input()))
for i in range(B):
T[i + 1] = int(eval(input()))
S[A + 1] = 10**20
T[B + 1] = 10**20
lenS, lenT = len(S), len(T)
for _ in range(Q):
x = int(eval(input()))
si, ti = bisect(S, x, 0, lenS), bisect(T, x, 0, lenT)
sLength0, sLength1 = x - S[si - 1], S[si] - x
tLength0, tLength1 = x - T[ti - 1], T[ti] - x
Ans = (
max(sLength0, tLength0),
max(sLength1, tLength1),
sLength0 + tLength1 + min(sLength0, tLength1),
sLength1 + tLength0 + min(sLength1, tLength0),
)
print((min(Ans)))
| import sys
from bisect import bisect
F = sys.stdin
A, B, Q = list(map(int, F.readline().strip("\n").split(" ")))
S, T = [None] * (A + 2), [None] * (B + 2)
S[0], T[0] = -(10**20), -(10**20)
for i in range(A):
S[i + 1] = int(F.readline().strip("\n"))
for i in range(B):
T[i + 1] = int(F.readline().strip("\n"))
S[A + 1] = 10**20
T[B + 1] = 10**20
lenS, lenT = len(S), len(T)
for _ in range(Q):
x = int(F.readline().strip("\n"))
si, ti = bisect(S, x, 0, lenS), bisect(T, x, 0, lenT)
sLength0, sLength1 = x - S[si - 1], S[si] - x
tLength0, tLength1 = x - T[ti - 1], T[ti] - x
Ans = (
max(sLength0, tLength0),
max(sLength1, tLength1),
sLength0 + tLength1 + min(sLength0, tLength1),
sLength1 + tLength0 + min(sLength1, tLength0),
)
print((min(Ans)))
| false | 9.52381 | [
"+import sys",
"-A, B, Q = list(map(int, input().split()))",
"+F = sys.stdin",
"+A, B, Q = list(map(int, F.readline().strip(\"\\n\").split(\" \")))",
"- S[i + 1] = int(eval(input()))",
"+ S[i + 1] = int(F.readline().strip(\"\\n\"))",
"- T[i + 1] = int(eval(input()))",
"+ T[i + 1] = int(F.readline().strip(\"\\n\"))",
"- x = int(eval(input()))",
"+ x = int(F.readline().strip(\"\\n\"))"
]
| false | 0.061653 | 0.094565 | 0.651965 | [
"s620321109",
"s373206817"
]
|
u348805958 | p02763 | python | s008665707 | s042300757 | 875 | 374 | 29,320 | 31,624 | Accepted | Accepted | 57.26 | #!python3
import sys
from bisect import bisect, insort_left
iim = lambda: map(int, input().rstrip().split())
def resolve():
N = int(input())
S = list(input())
Q = int(input())
c0 = ord('a')
S1 = [[] for i in range(26)]
for i, c1 in enumerate(S):
ci = ord(c1) - c0
S1[ci].append(i)
ans = []
for cmd, i, j in (line.split() for line in sys.stdin):
i = int(i) - 1
if cmd == "1":
if S[i] == j:
continue
c1 = ord(S[i]) - c0
s1 = S1[c1]
s1.pop(bisect(s1, i)-1)
S[i] = j
c1 = ord(j) - c0
insort_left(S1[c1], i)
elif cmd == "2":
j = int(j) - 1
num = 0
for s1 in S1:
ls = len(s1)
k = bisect(s1, i-1, 0, ls)
if k == ls:
continue
if i <= s1[k] <= j:
num += 1
ans.append(num)
print(*ans, sep="\n")
if __name__ == "__main__":
resolve()
| #!python3
import sys
iim = lambda: map(int, input().rstrip().split())
def popcnt2(n):
a = (
0, 1, 1, 2, 1, 2, 2, 3, 1, 2, 2, 3, 2, 3, 3, 4,
1, 2, 2, 3, 2, 3, 3, 4, 2, 3, 3, 4, 3, 4, 4, 5,
1, 2, 2, 3, 2, 3, 3, 4, 2, 3, 3, 4, 3, 4, 4, 5,
2, 3, 3, 4, 3, 4, 4, 5, 3, 4, 4, 5, 4, 5, 5, 6,
1, 2, 2, 3, 2, 3, 3, 4, 2, 3, 3, 4, 3, 4, 4, 5,
2, 3, 3, 4, 3, 4, 4, 5, 3, 4, 4, 5, 4, 5, 5, 6,
2, 3, 3, 4, 3, 4, 4, 5, 3, 4, 4, 5, 4, 5, 5, 6,
3, 4, 4, 5, 4, 5, 5, 6, 4, 5, 5, 6, 5, 6, 6, 7,
1, 2, 2, 3, 2, 3, 3, 4, 2, 3, 3, 4, 3, 4, 4, 5,
2, 3, 3, 4, 3, 4, 4, 5, 3, 4, 4, 5, 4, 5, 5, 6,
2, 3, 3, 4, 3, 4, 4, 5, 3, 4, 4, 5, 4, 5, 5, 6,
3, 4, 4, 5, 4, 5, 5, 6, 4, 5, 5, 6, 5, 6, 6, 7,
2, 3, 3, 4, 3, 4, 4, 5, 3, 4, 4, 5, 4, 5, 5, 6,
3, 4, 4, 5, 4, 5, 5, 6, 4, 5, 5, 6, 5, 6, 6, 7,
3, 4, 4, 5, 4, 5, 5, 6, 4, 5, 5, 6, 5, 6, 6, 7,
4, 5, 5, 6, 5, 6, 6, 7, 5, 6, 6, 7, 6, 7, 7, 8,
)
ans = 0
while n:
ans += a[n&0xff]
n >>= 8
return ans
def resolve():
N = int(input())
S = list(input())
Q = int(input())
ln = N.bit_length() + 1
c0 = ord('a')
smap = [1<<(i-c0) for i in range(c0, ord('z')+1)]
T = [None] * ln
T[0] = [smap[ord(S[i])-c0] for i in range(N)]
if N&1:
T[0].append(0)
N += 1
t0, n2 = T[0], N
for i in range(1, ln):
n1 = n2 = n2 >> 1
if n2 & 1:
n2 += 1
ti = T[i] = [0] * n2
for j in range(n1):
j2 = j << 1
d1, d2 = t0[j2], t0[j2+1]
ti[j] = d1 | d2
t0 = ti
#for ti in T:
# print(len(ti), ti)
ans = []
for cmd, i, j in (line.split() for line in sys.stdin):
i = int(i) - 1
if cmd == "1":
if S[i] == j:
continue
S[i] = j
t0 = T[0]
t0[i] = smap[ord(j)-c0]
for i1 in range(1, ln):
ti = T[i1]
j1 = i >> 1
ti[j1] = t0[i] | t0[i^1]
i, t0 = j1, ti
#for ti in T:
# print(len(ti), ti)
elif cmd == "2":
j = int(j) - 1
d1 = 0
for i1 in range(ln):
ti = T[i1]
if not i < j :
if i == j:
d1 |= ti[i]
break
if i & 1:
d1 |= ti[i]
i += 1
if j & 1 == 0:
d1 |= ti[j]
j -= 1
i >>= 1; j >>=1
ans.append(popcnt2(d1))
print(*ans, sep="\n")
if __name__ == "__main__":
resolve()
| 51 | 104 | 1,116 | 2,857 | #!python3
import sys
from bisect import bisect, insort_left
iim = lambda: map(int, input().rstrip().split())
def resolve():
N = int(input())
S = list(input())
Q = int(input())
c0 = ord("a")
S1 = [[] for i in range(26)]
for i, c1 in enumerate(S):
ci = ord(c1) - c0
S1[ci].append(i)
ans = []
for cmd, i, j in (line.split() for line in sys.stdin):
i = int(i) - 1
if cmd == "1":
if S[i] == j:
continue
c1 = ord(S[i]) - c0
s1 = S1[c1]
s1.pop(bisect(s1, i) - 1)
S[i] = j
c1 = ord(j) - c0
insort_left(S1[c1], i)
elif cmd == "2":
j = int(j) - 1
num = 0
for s1 in S1:
ls = len(s1)
k = bisect(s1, i - 1, 0, ls)
if k == ls:
continue
if i <= s1[k] <= j:
num += 1
ans.append(num)
print(*ans, sep="\n")
if __name__ == "__main__":
resolve()
| #!python3
import sys
iim = lambda: map(int, input().rstrip().split())
def popcnt2(n):
a = (
0,
1,
1,
2,
1,
2,
2,
3,
1,
2,
2,
3,
2,
3,
3,
4,
1,
2,
2,
3,
2,
3,
3,
4,
2,
3,
3,
4,
3,
4,
4,
5,
1,
2,
2,
3,
2,
3,
3,
4,
2,
3,
3,
4,
3,
4,
4,
5,
2,
3,
3,
4,
3,
4,
4,
5,
3,
4,
4,
5,
4,
5,
5,
6,
1,
2,
2,
3,
2,
3,
3,
4,
2,
3,
3,
4,
3,
4,
4,
5,
2,
3,
3,
4,
3,
4,
4,
5,
3,
4,
4,
5,
4,
5,
5,
6,
2,
3,
3,
4,
3,
4,
4,
5,
3,
4,
4,
5,
4,
5,
5,
6,
3,
4,
4,
5,
4,
5,
5,
6,
4,
5,
5,
6,
5,
6,
6,
7,
1,
2,
2,
3,
2,
3,
3,
4,
2,
3,
3,
4,
3,
4,
4,
5,
2,
3,
3,
4,
3,
4,
4,
5,
3,
4,
4,
5,
4,
5,
5,
6,
2,
3,
3,
4,
3,
4,
4,
5,
3,
4,
4,
5,
4,
5,
5,
6,
3,
4,
4,
5,
4,
5,
5,
6,
4,
5,
5,
6,
5,
6,
6,
7,
2,
3,
3,
4,
3,
4,
4,
5,
3,
4,
4,
5,
4,
5,
5,
6,
3,
4,
4,
5,
4,
5,
5,
6,
4,
5,
5,
6,
5,
6,
6,
7,
3,
4,
4,
5,
4,
5,
5,
6,
4,
5,
5,
6,
5,
6,
6,
7,
4,
5,
5,
6,
5,
6,
6,
7,
5,
6,
6,
7,
6,
7,
7,
8,
)
ans = 0
while n:
ans += a[n & 0xFF]
n >>= 8
return ans
def resolve():
N = int(input())
S = list(input())
Q = int(input())
ln = N.bit_length() + 1
c0 = ord("a")
smap = [1 << (i - c0) for i in range(c0, ord("z") + 1)]
T = [None] * ln
T[0] = [smap[ord(S[i]) - c0] for i in range(N)]
if N & 1:
T[0].append(0)
N += 1
t0, n2 = T[0], N
for i in range(1, ln):
n1 = n2 = n2 >> 1
if n2 & 1:
n2 += 1
ti = T[i] = [0] * n2
for j in range(n1):
j2 = j << 1
d1, d2 = t0[j2], t0[j2 + 1]
ti[j] = d1 | d2
t0 = ti
# for ti in T:
# print(len(ti), ti)
ans = []
for cmd, i, j in (line.split() for line in sys.stdin):
i = int(i) - 1
if cmd == "1":
if S[i] == j:
continue
S[i] = j
t0 = T[0]
t0[i] = smap[ord(j) - c0]
for i1 in range(1, ln):
ti = T[i1]
j1 = i >> 1
ti[j1] = t0[i] | t0[i ^ 1]
i, t0 = j1, ti
# for ti in T:
# print(len(ti), ti)
elif cmd == "2":
j = int(j) - 1
d1 = 0
for i1 in range(ln):
ti = T[i1]
if not i < j:
if i == j:
d1 |= ti[i]
break
if i & 1:
d1 |= ti[i]
i += 1
if j & 1 == 0:
d1 |= ti[j]
j -= 1
i >>= 1
j >>= 1
ans.append(popcnt2(d1))
print(*ans, sep="\n")
if __name__ == "__main__":
resolve()
| false | 50.961538 | [
"-from bisect import bisect, insort_left",
"+",
"+",
"+def popcnt2(n):",
"+ a = (",
"+ 0,",
"+ 1,",
"+ 1,",
"+ 2,",
"+ 1,",
"+ 2,",
"+ 2,",
"+ 3,",
"+ 1,",
"+ 2,",
"+ 2,",
"+ 3,",
"+ 2,",
"+ 3,",
"+ 3,",
"+ 4,",
"+ 1,",
"+ 2,",
"+ 2,",
"+ 3,",
"+ 2,",
"+ 3,",
"+ 3,",
"+ 4,",
"+ 2,",
"+ 3,",
"+ 3,",
"+ 4,",
"+ 3,",
"+ 4,",
"+ 4,",
"+ 5,",
"+ 1,",
"+ 2,",
"+ 2,",
"+ 3,",
"+ 2,",
"+ 3,",
"+ 3,",
"+ 4,",
"+ 2,",
"+ 3,",
"+ 3,",
"+ 4,",
"+ 3,",
"+ 4,",
"+ 4,",
"+ 5,",
"+ 2,",
"+ 3,",
"+ 3,",
"+ 4,",
"+ 3,",
"+ 4,",
"+ 4,",
"+ 5,",
"+ 3,",
"+ 4,",
"+ 4,",
"+ 5,",
"+ 4,",
"+ 5,",
"+ 5,",
"+ 6,",
"+ 1,",
"+ 2,",
"+ 2,",
"+ 3,",
"+ 2,",
"+ 3,",
"+ 3,",
"+ 4,",
"+ 2,",
"+ 3,",
"+ 3,",
"+ 4,",
"+ 3,",
"+ 4,",
"+ 4,",
"+ 5,",
"+ 2,",
"+ 3,",
"+ 3,",
"+ 4,",
"+ 3,",
"+ 4,",
"+ 4,",
"+ 5,",
"+ 3,",
"+ 4,",
"+ 4,",
"+ 5,",
"+ 4,",
"+ 5,",
"+ 5,",
"+ 6,",
"+ 2,",
"+ 3,",
"+ 3,",
"+ 4,",
"+ 3,",
"+ 4,",
"+ 4,",
"+ 5,",
"+ 3,",
"+ 4,",
"+ 4,",
"+ 5,",
"+ 4,",
"+ 5,",
"+ 5,",
"+ 6,",
"+ 3,",
"+ 4,",
"+ 4,",
"+ 5,",
"+ 4,",
"+ 5,",
"+ 5,",
"+ 6,",
"+ 4,",
"+ 5,",
"+ 5,",
"+ 6,",
"+ 5,",
"+ 6,",
"+ 6,",
"+ 7,",
"+ 1,",
"+ 2,",
"+ 2,",
"+ 3,",
"+ 2,",
"+ 3,",
"+ 3,",
"+ 4,",
"+ 2,",
"+ 3,",
"+ 3,",
"+ 4,",
"+ 3,",
"+ 4,",
"+ 4,",
"+ 5,",
"+ 2,",
"+ 3,",
"+ 3,",
"+ 4,",
"+ 3,",
"+ 4,",
"+ 4,",
"+ 5,",
"+ 3,",
"+ 4,",
"+ 4,",
"+ 5,",
"+ 4,",
"+ 5,",
"+ 5,",
"+ 6,",
"+ 2,",
"+ 3,",
"+ 3,",
"+ 4,",
"+ 3,",
"+ 4,",
"+ 4,",
"+ 5,",
"+ 3,",
"+ 4,",
"+ 4,",
"+ 5,",
"+ 4,",
"+ 5,",
"+ 5,",
"+ 6,",
"+ 3,",
"+ 4,",
"+ 4,",
"+ 5,",
"+ 4,",
"+ 5,",
"+ 5,",
"+ 6,",
"+ 4,",
"+ 5,",
"+ 5,",
"+ 6,",
"+ 5,",
"+ 6,",
"+ 6,",
"+ 7,",
"+ 2,",
"+ 3,",
"+ 3,",
"+ 4,",
"+ 3,",
"+ 4,",
"+ 4,",
"+ 5,",
"+ 3,",
"+ 4,",
"+ 4,",
"+ 5,",
"+ 4,",
"+ 5,",
"+ 5,",
"+ 6,",
"+ 3,",
"+ 4,",
"+ 4,",
"+ 5,",
"+ 4,",
"+ 5,",
"+ 5,",
"+ 6,",
"+ 4,",
"+ 5,",
"+ 5,",
"+ 6,",
"+ 5,",
"+ 6,",
"+ 6,",
"+ 7,",
"+ 3,",
"+ 4,",
"+ 4,",
"+ 5,",
"+ 4,",
"+ 5,",
"+ 5,",
"+ 6,",
"+ 4,",
"+ 5,",
"+ 5,",
"+ 6,",
"+ 5,",
"+ 6,",
"+ 6,",
"+ 7,",
"+ 4,",
"+ 5,",
"+ 5,",
"+ 6,",
"+ 5,",
"+ 6,",
"+ 6,",
"+ 7,",
"+ 5,",
"+ 6,",
"+ 6,",
"+ 7,",
"+ 6,",
"+ 7,",
"+ 7,",
"+ 8,",
"+ )",
"+ ans = 0",
"+ while n:",
"+ ans += a[n & 0xFF]",
"+ n >>= 8",
"+ return ans",
"+ ln = N.bit_length() + 1",
"- S1 = [[] for i in range(26)]",
"- for i, c1 in enumerate(S):",
"- ci = ord(c1) - c0",
"- S1[ci].append(i)",
"+ smap = [1 << (i - c0) for i in range(c0, ord(\"z\") + 1)]",
"+ T = [None] * ln",
"+ T[0] = [smap[ord(S[i]) - c0] for i in range(N)]",
"+ if N & 1:",
"+ T[0].append(0)",
"+ N += 1",
"+ t0, n2 = T[0], N",
"+ for i in range(1, ln):",
"+ n1 = n2 = n2 >> 1",
"+ if n2 & 1:",
"+ n2 += 1",
"+ ti = T[i] = [0] * n2",
"+ for j in range(n1):",
"+ j2 = j << 1",
"+ d1, d2 = t0[j2], t0[j2 + 1]",
"+ ti[j] = d1 | d2",
"+ t0 = ti",
"+ # for ti in T:",
"+ # print(len(ti), ti)",
"- c1 = ord(S[i]) - c0",
"- s1 = S1[c1]",
"- s1.pop(bisect(s1, i) - 1)",
"- c1 = ord(j) - c0",
"- insort_left(S1[c1], i)",
"+ t0 = T[0]",
"+ t0[i] = smap[ord(j) - c0]",
"+ for i1 in range(1, ln):",
"+ ti = T[i1]",
"+ j1 = i >> 1",
"+ ti[j1] = t0[i] | t0[i ^ 1]",
"+ i, t0 = j1, ti",
"+ # for ti in T:",
"+ # print(len(ti), ti)",
"- num = 0",
"- for s1 in S1:",
"- ls = len(s1)",
"- k = bisect(s1, i - 1, 0, ls)",
"- if k == ls:",
"- continue",
"- if i <= s1[k] <= j:",
"- num += 1",
"- ans.append(num)",
"+ d1 = 0",
"+ for i1 in range(ln):",
"+ ti = T[i1]",
"+ if not i < j:",
"+ if i == j:",
"+ d1 |= ti[i]",
"+ break",
"+ if i & 1:",
"+ d1 |= ti[i]",
"+ i += 1",
"+ if j & 1 == 0:",
"+ d1 |= ti[j]",
"+ j -= 1",
"+ i >>= 1",
"+ j >>= 1",
"+ ans.append(popcnt2(d1))"
]
| false | 0.046409 | 0.042448 | 1.0933 | [
"s008665707",
"s042300757"
]
|
u074220993 | p03495 | python | s140078811 | s601628599 | 312 | 101 | 32,244 | 34,964 | Accepted | Accepted | 67.63 | import bisect as bs
N, K = (int(x) for x in input().split())
A = sorted([int(x) for x in input().split()])
f = lambda X, x: bs.bisect_right(X,x)-bs.bisect_left(X,x)
cnt = sorted([f(A,a) for a in set(A)],reverse=True)
vrt = len(cnt)
print((sum(cnt[K:]) if vrt > K else 0)) | from collections import Counter
def main():
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
unchange = sum(tuple[1] for tuple in Counter(A).most_common(K))
print((N-unchange))
main() | 7 | 10 | 275 | 229 | import bisect as bs
N, K = (int(x) for x in input().split())
A = sorted([int(x) for x in input().split()])
f = lambda X, x: bs.bisect_right(X, x) - bs.bisect_left(X, x)
cnt = sorted([f(A, a) for a in set(A)], reverse=True)
vrt = len(cnt)
print((sum(cnt[K:]) if vrt > K else 0))
| from collections import Counter
def main():
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
unchange = sum(tuple[1] for tuple in Counter(A).most_common(K))
print((N - unchange))
main()
| false | 30 | [
"-import bisect as bs",
"+from collections import Counter",
"-N, K = (int(x) for x in input().split())",
"-A = sorted([int(x) for x in input().split()])",
"-f = lambda X, x: bs.bisect_right(X, x) - bs.bisect_left(X, x)",
"-cnt = sorted([f(A, a) for a in set(A)], reverse=True)",
"-vrt = len(cnt)",
"-print((sum(cnt[K:]) if vrt > K else 0))",
"+",
"+def main():",
"+ N, K = list(map(int, input().split()))",
"+ A = list(map(int, input().split()))",
"+ unchange = sum(tuple[1] for tuple in Counter(A).most_common(K))",
"+ print((N - unchange))",
"+",
"+",
"+main()"
]
| false | 0.137677 | 0.086378 | 1.593899 | [
"s140078811",
"s601628599"
]
|
u678167152 | p02630 | python | s913364648 | s360404653 | 340 | 263 | 97,728 | 96,828 | Accepted | Accepted | 22.65 | N = int(input())
A = list(map(int, input().split()))
total = sum(A)
from collections import defaultdict
d = defaultdict(lambda: 0)
for a in A:
d[a] += 1
Q = int(input())
ans = []
for i in range(Q):
x,y = map(int, input().split())
total += y*d[x]-x*d[x]
d[y] += d[x]
d[x] = 0
ans.append(total)
print(*ans, sep='\n')
| from collections import Counter
def solve():
N = int(input())
A = list(map(int, input().split()))
c = Counter(A)
Q = int(input())
ans = [0]*Q
total = sum(A)
for i in range(Q):
x,y = map(int, input().split())
total += c[x]*(y-x)
c[y] += c[x]
c[x] = 0
ans[i] = total
return ans
print(*solve(),sep='\n')
| 17 | 16 | 356 | 351 | N = int(input())
A = list(map(int, input().split()))
total = sum(A)
from collections import defaultdict
d = defaultdict(lambda: 0)
for a in A:
d[a] += 1
Q = int(input())
ans = []
for i in range(Q):
x, y = map(int, input().split())
total += y * d[x] - x * d[x]
d[y] += d[x]
d[x] = 0
ans.append(total)
print(*ans, sep="\n")
| from collections import Counter
def solve():
N = int(input())
A = list(map(int, input().split()))
c = Counter(A)
Q = int(input())
ans = [0] * Q
total = sum(A)
for i in range(Q):
x, y = map(int, input().split())
total += c[x] * (y - x)
c[y] += c[x]
c[x] = 0
ans[i] = total
return ans
print(*solve(), sep="\n")
| false | 5.882353 | [
"-N = int(input())",
"-A = list(map(int, input().split()))",
"-total = sum(A)",
"-from collections import defaultdict",
"+from collections import Counter",
"-d = defaultdict(lambda: 0)",
"-for a in A:",
"- d[a] += 1",
"-Q = int(input())",
"-ans = []",
"-for i in range(Q):",
"- x, y = map(int, input().split())",
"- total += y * d[x] - x * d[x]",
"- d[y] += d[x]",
"- d[x] = 0",
"- ans.append(total)",
"-print(*ans, sep=\"\\n\")",
"+",
"+def solve():",
"+ N = int(input())",
"+ A = list(map(int, input().split()))",
"+ c = Counter(A)",
"+ Q = int(input())",
"+ ans = [0] * Q",
"+ total = sum(A)",
"+ for i in range(Q):",
"+ x, y = map(int, input().split())",
"+ total += c[x] * (y - x)",
"+ c[y] += c[x]",
"+ c[x] = 0",
"+ ans[i] = total",
"+ return ans",
"+",
"+",
"+print(*solve(), sep=\"\\n\")"
]
| false | 0.042525 | 0.042386 | 1.00329 | [
"s913364648",
"s360404653"
]
|
u363421241 | p02838 | python | s512946403 | s443325023 | 1,650 | 184 | 51,040 | 124,484 | Accepted | Accepted | 88.85 | def main():
n = int(eval(input()))
A = list(map(int, input().split()))
mod = 10**9+7
ans = 0
for k in range(60):
x, y = 0, 0
for a in A:
x += 1 & a>>k
tmp = x*(n-x)%mod
tmp *= pow(2, k, mod)
ans += tmp
ans %= mod
print(ans)
if __name__ =='__main__':
main() | n = int(eval(input()))
A = list(map(int, input().split()))
mod = 10 ** 9 + 7
ans = 0
for k in range(60):
x, y = 0, 0
for a in A:
x += 1 & a >> k
tmp = x * (n - x) % mod
tmp *= 2**k%mod
ans += tmp
ans %= mod
print(ans)
| 20 | 15 | 361 | 260 | def main():
n = int(eval(input()))
A = list(map(int, input().split()))
mod = 10**9 + 7
ans = 0
for k in range(60):
x, y = 0, 0
for a in A:
x += 1 & a >> k
tmp = x * (n - x) % mod
tmp *= pow(2, k, mod)
ans += tmp
ans %= mod
print(ans)
if __name__ == "__main__":
main()
| n = int(eval(input()))
A = list(map(int, input().split()))
mod = 10**9 + 7
ans = 0
for k in range(60):
x, y = 0, 0
for a in A:
x += 1 & a >> k
tmp = x * (n - x) % mod
tmp *= 2**k % mod
ans += tmp
ans %= mod
print(ans)
| false | 25 | [
"-def main():",
"- n = int(eval(input()))",
"- A = list(map(int, input().split()))",
"- mod = 10**9 + 7",
"- ans = 0",
"- for k in range(60):",
"- x, y = 0, 0",
"- for a in A:",
"- x += 1 & a >> k",
"- tmp = x * (n - x) % mod",
"- tmp *= pow(2, k, mod)",
"- ans += tmp",
"- ans %= mod",
"- print(ans)",
"-",
"-",
"-if __name__ == \"__main__\":",
"- main()",
"+n = int(eval(input()))",
"+A = list(map(int, input().split()))",
"+mod = 10**9 + 7",
"+ans = 0",
"+for k in range(60):",
"+ x, y = 0, 0",
"+ for a in A:",
"+ x += 1 & a >> k",
"+ tmp = x * (n - x) % mod",
"+ tmp *= 2**k % mod",
"+ ans += tmp",
"+ ans %= mod",
"+print(ans)"
]
| false | 0.135856 | 0.036578 | 3.714133 | [
"s512946403",
"s443325023"
]
|
u989306199 | p04013 | python | s101348073 | s666707994 | 1,251 | 86 | 103,308 | 11,600 | Accepted | Accepted | 93.13 |
NMAX = 55
N, A = list(map(int, input().split()))
X = list(map(int, input().split()))
dp = [[[0] * NMAX for s in range(3000)] for i in range(NMAX)]
dp[0][0][0] = 1 # dp[i][s][k]: i個からk個選ぶとき、総和がsのものの個数
for i in range(N): # N-1時点でNが更新されるのでここまでで十分
for s in range(3000):
for k in range(N+1):
if dp[i][s][k] == 0:
continue
dp[i+1][s][k] += dp[i][s][k]
dp[i+1][s+X[i]][k+1] += dp[i][s][k]
ans = 0
for k in range(1, N+1):
ans += dp[N][A*k][k]
print(ans)
|
NMAX = 55
T = 2500
N, A = list(map(int, input().split()))
X = list([int(x) - A for x in input().split()])
dp = [[0]*5001 for i in range(NMAX)] # i時点で総和がSになるものの個数
dp[0][T] = 1
for i in range(N):
for s in range(5001):
if s+X[i] > 5001 or dp[i][s] == 0:
continue
dp[i+1][s] += dp[i][s]
dp[i+1][s+X[i]] += dp[i][s]
print((dp[N][T]-1))
| 22 | 19 | 535 | 393 | NMAX = 55
N, A = list(map(int, input().split()))
X = list(map(int, input().split()))
dp = [[[0] * NMAX for s in range(3000)] for i in range(NMAX)]
dp[0][0][0] = 1 # dp[i][s][k]: i個からk個選ぶとき、総和がsのものの個数
for i in range(N): # N-1時点でNが更新されるのでここまでで十分
for s in range(3000):
for k in range(N + 1):
if dp[i][s][k] == 0:
continue
dp[i + 1][s][k] += dp[i][s][k]
dp[i + 1][s + X[i]][k + 1] += dp[i][s][k]
ans = 0
for k in range(1, N + 1):
ans += dp[N][A * k][k]
print(ans)
| NMAX = 55
T = 2500
N, A = list(map(int, input().split()))
X = list([int(x) - A for x in input().split()])
dp = [[0] * 5001 for i in range(NMAX)] # i時点で総和がSになるものの個数
dp[0][T] = 1
for i in range(N):
for s in range(5001):
if s + X[i] > 5001 or dp[i][s] == 0:
continue
dp[i + 1][s] += dp[i][s]
dp[i + 1][s + X[i]] += dp[i][s]
print((dp[N][T] - 1))
| false | 13.636364 | [
"+T = 2500",
"-X = list(map(int, input().split()))",
"-dp = [[[0] * NMAX for s in range(3000)] for i in range(NMAX)]",
"-dp[0][0][0] = 1 # dp[i][s][k]: i個からk個選ぶとき、総和がsのものの個数",
"-for i in range(N): # N-1時点でNが更新されるのでここまでで十分",
"- for s in range(3000):",
"- for k in range(N + 1):",
"- if dp[i][s][k] == 0:",
"- continue",
"- dp[i + 1][s][k] += dp[i][s][k]",
"- dp[i + 1][s + X[i]][k + 1] += dp[i][s][k]",
"-ans = 0",
"-for k in range(1, N + 1):",
"- ans += dp[N][A * k][k]",
"-print(ans)",
"+X = list([int(x) - A for x in input().split()])",
"+dp = [[0] * 5001 for i in range(NMAX)] # i時点で総和がSになるものの個数",
"+dp[0][T] = 1",
"+for i in range(N):",
"+ for s in range(5001):",
"+ if s + X[i] > 5001 or dp[i][s] == 0:",
"+ continue",
"+ dp[i + 1][s] += dp[i][s]",
"+ dp[i + 1][s + X[i]] += dp[i][s]",
"+print((dp[N][T] - 1))"
]
| false | 0.374145 | 0.048797 | 7.667394 | [
"s101348073",
"s666707994"
]
|
u815763296 | p02844 | python | s212069032 | s477005157 | 841 | 652 | 84,748 | 9,720 | Accepted | Accepted | 22.47 | N = int(eval(input()))
S = eval(input())
ans = 0
for x in range(10):
for y in range(10):
for z in range(10):
for i in range(N):
if x != int(S[i]):
continue
for j in range(i+1, N):
if y != int(S[j]):
continue
for k in range(j+1, N):
if z != int(S[k]):
continue
ans += z == int(S[k])
break
break
break
print(ans)
| from collections import Counter
N = int(eval(input()))
S = eval(input())
ans = 0
for x in range(10):
for y in range(10):
hantei = []
for i in range(N):
if x != int(S[i]):
continue
for j in range(i+1, N):
if y != int(S[j]):
continue
for k in range(j+1, N):
hantei.append(S[k])
ans += len(Counter(hantei))
break
break
print(ans)
| 20 | 20 | 594 | 511 | N = int(eval(input()))
S = eval(input())
ans = 0
for x in range(10):
for y in range(10):
for z in range(10):
for i in range(N):
if x != int(S[i]):
continue
for j in range(i + 1, N):
if y != int(S[j]):
continue
for k in range(j + 1, N):
if z != int(S[k]):
continue
ans += z == int(S[k])
break
break
break
print(ans)
| from collections import Counter
N = int(eval(input()))
S = eval(input())
ans = 0
for x in range(10):
for y in range(10):
hantei = []
for i in range(N):
if x != int(S[i]):
continue
for j in range(i + 1, N):
if y != int(S[j]):
continue
for k in range(j + 1, N):
hantei.append(S[k])
ans += len(Counter(hantei))
break
break
print(ans)
| false | 0 | [
"+from collections import Counter",
"+",
"- for z in range(10):",
"- for i in range(N):",
"- if x != int(S[i]):",
"+ hantei = []",
"+ for i in range(N):",
"+ if x != int(S[i]):",
"+ continue",
"+ for j in range(i + 1, N):",
"+ if y != int(S[j]):",
"- for j in range(i + 1, N):",
"- if y != int(S[j]):",
"- continue",
"- for k in range(j + 1, N):",
"- if z != int(S[k]):",
"- continue",
"- ans += z == int(S[k])",
"- break",
"- break",
"+ for k in range(j + 1, N):",
"+ hantei.append(S[k])",
"+ ans += len(Counter(hantei))",
"+ break"
]
| false | 0.047965 | 0.045466 | 1.054967 | [
"s212069032",
"s477005157"
]
|
u489959379 | p03835 | python | s541623733 | s093624743 | 1,465 | 279 | 3,060 | 40,940 | Accepted | Accepted | 80.96 | k, s = list(map(int, input().split()))
ans = 0
for x in range(k + 1):
for y in range(k + 1):
z = s - x - y
if 0 <= z <= k:
ans += 1
print(ans) | import sys
sys.setrecursionlimit(10 ** 7)
f_inf = float('inf')
mod = 10 ** 9 + 7
def resolve():
k, s = list(map(int, input().split()))
res = 0
for x in range(k + 1):
for y in range(k + 1):
z = s - x - y
if x + y + z == s and k >= z >= 0:
res += 1
print(res)
if __name__ == '__main__':
resolve()
| 8 | 22 | 175 | 385 | k, s = list(map(int, input().split()))
ans = 0
for x in range(k + 1):
for y in range(k + 1):
z = s - x - y
if 0 <= z <= k:
ans += 1
print(ans)
| import sys
sys.setrecursionlimit(10**7)
f_inf = float("inf")
mod = 10**9 + 7
def resolve():
k, s = list(map(int, input().split()))
res = 0
for x in range(k + 1):
for y in range(k + 1):
z = s - x - y
if x + y + z == s and k >= z >= 0:
res += 1
print(res)
if __name__ == "__main__":
resolve()
| false | 63.636364 | [
"-k, s = list(map(int, input().split()))",
"-ans = 0",
"-for x in range(k + 1):",
"- for y in range(k + 1):",
"- z = s - x - y",
"- if 0 <= z <= k:",
"- ans += 1",
"-print(ans)",
"+import sys",
"+",
"+sys.setrecursionlimit(10**7)",
"+f_inf = float(\"inf\")",
"+mod = 10**9 + 7",
"+",
"+",
"+def resolve():",
"+ k, s = list(map(int, input().split()))",
"+ res = 0",
"+ for x in range(k + 1):",
"+ for y in range(k + 1):",
"+ z = s - x - y",
"+ if x + y + z == s and k >= z >= 0:",
"+ res += 1",
"+ print(res)",
"+",
"+",
"+if __name__ == \"__main__\":",
"+ resolve()"
]
| false | 0.041268 | 0.052096 | 0.792159 | [
"s541623733",
"s093624743"
]
|
u241159583 | p04033 | python | s972718095 | s110529125 | 19 | 17 | 3,060 | 2,940 | Accepted | Accepted | 10.53 | a, b = list(map(int, input().split()))
if a > 0 and b > 0: ans = "Positive"
elif a < 0 and b < 0:
if (abs(a-b) + 1) % 2 == 0:
ans = "Positive"
else:
ans = "Negative"
else:
ans = "Zero"
print(ans) | a, b = list(map(int, input().split()))
if a > 0 and b > 0: ans = "Positive"
elif a < 0 and b > 0: ans = "Zero"
else:
if abs(a-b+1) % 2 == 0: ans = "Positive"
else: ans = "Negative"
print(ans) | 10 | 7 | 212 | 195 | a, b = list(map(int, input().split()))
if a > 0 and b > 0:
ans = "Positive"
elif a < 0 and b < 0:
if (abs(a - b) + 1) % 2 == 0:
ans = "Positive"
else:
ans = "Negative"
else:
ans = "Zero"
print(ans)
| a, b = list(map(int, input().split()))
if a > 0 and b > 0:
ans = "Positive"
elif a < 0 and b > 0:
ans = "Zero"
else:
if abs(a - b + 1) % 2 == 0:
ans = "Positive"
else:
ans = "Negative"
print(ans)
| false | 30 | [
"-elif a < 0 and b < 0:",
"- if (abs(a - b) + 1) % 2 == 0:",
"+elif a < 0 and b > 0:",
"+ ans = \"Zero\"",
"+else:",
"+ if abs(a - b + 1) % 2 == 0:",
"-else:",
"- ans = \"Zero\""
]
| false | 0.051039 | 0.080495 | 0.634064 | [
"s972718095",
"s110529125"
]
|
u691018832 | p02678 | python | s699180353 | s489689567 | 494 | 355 | 34,436 | 40,592 | Accepted | Accepted | 28.14 | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)
def bfs(s):
from collections import deque
check = [-1] * (n + 1)
check[s] = 0
q = deque([s])
while q:
now = q.popleft()
for next in graph[now]:
if check[next] == -1:
check[next] = now
q.append(next)
return check
n, m = list(map(int, readline().split()))
graph = [[] for _ in range(n + 1)]
for i in range(m):
a, b = list(map(int, readline().split()))
graph[a].append(b)
graph[b].append(a)
print('Yes')
for v in bfs(1)[2:]:
print(v)
| import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)
def bfs(s):
from collections import deque
check = [0] * (n + 1)
check[s] = 1
q = deque([s])
while q:
now = q.popleft()
for next in graph[now]:
if check[next] == 0:
check[next] = str(now)
q.append(next)
return check
n, m = list(map(int, readline().split()))
graph = [[] for _ in range(n + 1)]
for i in range(m):
a, b = list(map(int, readline().split()))
graph[a].append(b)
graph[b].append(a)
print('Yes')
print(('\n'.join(bfs(1)[2:])))
| 30 | 29 | 699 | 696 | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10**7)
def bfs(s):
from collections import deque
check = [-1] * (n + 1)
check[s] = 0
q = deque([s])
while q:
now = q.popleft()
for next in graph[now]:
if check[next] == -1:
check[next] = now
q.append(next)
return check
n, m = list(map(int, readline().split()))
graph = [[] for _ in range(n + 1)]
for i in range(m):
a, b = list(map(int, readline().split()))
graph[a].append(b)
graph[b].append(a)
print("Yes")
for v in bfs(1)[2:]:
print(v)
| import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10**7)
def bfs(s):
from collections import deque
check = [0] * (n + 1)
check[s] = 1
q = deque([s])
while q:
now = q.popleft()
for next in graph[now]:
if check[next] == 0:
check[next] = str(now)
q.append(next)
return check
n, m = list(map(int, readline().split()))
graph = [[] for _ in range(n + 1)]
for i in range(m):
a, b = list(map(int, readline().split()))
graph[a].append(b)
graph[b].append(a)
print("Yes")
print(("\n".join(bfs(1)[2:])))
| false | 3.333333 | [
"- check = [-1] * (n + 1)",
"- check[s] = 0",
"+ check = [0] * (n + 1)",
"+ check[s] = 1",
"- if check[next] == -1:",
"- check[next] = now",
"+ if check[next] == 0:",
"+ check[next] = str(now)",
"-for v in bfs(1)[2:]:",
"- print(v)",
"+print((\"\\n\".join(bfs(1)[2:])))"
]
| false | 0.048671 | 0.044741 | 1.087844 | [
"s699180353",
"s489689567"
]
|
u102461423 | p03283 | python | s059578595 | s394327794 | 2,936 | 2,507 | 18,352 | 18,280 | Accepted | Accepted | 14.61 | # count p<=x<=q and p<=y <=q
# 長方形に含まれる格子点の数
import numpy as np
N,M,Q = list(map(int,input().split()))
cnt = np.zeros((N+1,N+1),dtype=np.int64)
for _ in range(M):
x,y = list(map(int,input().split()))
cnt[x,y] += 1
cnt = cnt.cumsum(axis=0).cumsum(axis=1)
for _ in range(Q):
p,q = list(map(int,input().split()))
p -= 1
x = cnt[q,q]
x -= cnt[q,p]
x -= cnt[p,q]
x += cnt[p,p]
print(x) | # count p<=x<=q and p<=y <=q
# 長方形に含まれる格子点の数
import numpy as np
N,M,Q = list(map(int,input().split()))
cnt = [[0]*(N+1) for _ in range(N+1)]
for _ in range(M):
x,y = list(map(int,input().split()))
cnt[x][y] += 1
cnt = np.cumsum(cnt,axis=0).cumsum(axis=1)
for _ in range(Q):
p,q = list(map(int,input().split()))
p -= 1
x = cnt[q,q]
x -= cnt[q,p]
x -= cnt[p,q]
x += cnt[p,p]
print(x) | 20 | 20 | 402 | 403 | # count p<=x<=q and p<=y <=q
# 長方形に含まれる格子点の数
import numpy as np
N, M, Q = list(map(int, input().split()))
cnt = np.zeros((N + 1, N + 1), dtype=np.int64)
for _ in range(M):
x, y = list(map(int, input().split()))
cnt[x, y] += 1
cnt = cnt.cumsum(axis=0).cumsum(axis=1)
for _ in range(Q):
p, q = list(map(int, input().split()))
p -= 1
x = cnt[q, q]
x -= cnt[q, p]
x -= cnt[p, q]
x += cnt[p, p]
print(x)
| # count p<=x<=q and p<=y <=q
# 長方形に含まれる格子点の数
import numpy as np
N, M, Q = list(map(int, input().split()))
cnt = [[0] * (N + 1) for _ in range(N + 1)]
for _ in range(M):
x, y = list(map(int, input().split()))
cnt[x][y] += 1
cnt = np.cumsum(cnt, axis=0).cumsum(axis=1)
for _ in range(Q):
p, q = list(map(int, input().split()))
p -= 1
x = cnt[q, q]
x -= cnt[q, p]
x -= cnt[p, q]
x += cnt[p, p]
print(x)
| false | 0 | [
"-cnt = np.zeros((N + 1, N + 1), dtype=np.int64)",
"+cnt = [[0] * (N + 1) for _ in range(N + 1)]",
"- cnt[x, y] += 1",
"-cnt = cnt.cumsum(axis=0).cumsum(axis=1)",
"+ cnt[x][y] += 1",
"+cnt = np.cumsum(cnt, axis=0).cumsum(axis=1)"
]
| false | 0.331507 | 0.769247 | 0.43095 | [
"s059578595",
"s394327794"
]
|
u945181840 | p03588 | python | s011281918 | s139220401 | 180 | 71 | 25,940 | 25,940 | Accepted | Accepted | 60.56 | import sys
read = sys.stdin.read
N, *AB = list(map(int, read().split()))
AB = list(sorted(zip(*[iter(AB)] * 2)))
print((sum(AB[-1]))) | import sys
read = sys.stdin.read
N, *AB = list(map(int, read().split()))
AB = max(list(zip(*[iter(AB)] * 2)))
print((sum(AB))) | 6 | 6 | 131 | 118 | import sys
read = sys.stdin.read
N, *AB = list(map(int, read().split()))
AB = list(sorted(zip(*[iter(AB)] * 2)))
print((sum(AB[-1])))
| import sys
read = sys.stdin.read
N, *AB = list(map(int, read().split()))
AB = max(list(zip(*[iter(AB)] * 2)))
print((sum(AB)))
| false | 0 | [
"-AB = list(sorted(zip(*[iter(AB)] * 2)))",
"-print((sum(AB[-1])))",
"+AB = max(list(zip(*[iter(AB)] * 2)))",
"+print((sum(AB)))"
]
| false | 0.080953 | 0.043753 | 1.850235 | [
"s011281918",
"s139220401"
]
|
u094191970 | p02707 | python | s090782744 | s226802298 | 178 | 157 | 34,040 | 31,096 | Accepted | Accepted | 11.8 | from collections import Counter
n=int(eval(input()))
a=list(map(int,input().split()))
c=Counter(a)
for i in range(1,n+1):
print((c[i])) | from sys import stdin
nii=lambda:list(map(int,stdin.readline().split()))
lnii=lambda:list(map(int,stdin.readline().split()))
n=int(eval(input()))
a=lnii()
ans=[0 for i in range(n)]
for i in a:
i-=1
ans[i]+=1
for i in ans:
print(i) | 9 | 15 | 140 | 242 | from collections import Counter
n = int(eval(input()))
a = list(map(int, input().split()))
c = Counter(a)
for i in range(1, n + 1):
print((c[i]))
| from sys import stdin
nii = lambda: list(map(int, stdin.readline().split()))
lnii = lambda: list(map(int, stdin.readline().split()))
n = int(eval(input()))
a = lnii()
ans = [0 for i in range(n)]
for i in a:
i -= 1
ans[i] += 1
for i in ans:
print(i)
| false | 40 | [
"-from collections import Counter",
"+from sys import stdin",
"+nii = lambda: list(map(int, stdin.readline().split()))",
"+lnii = lambda: list(map(int, stdin.readline().split()))",
"-a = list(map(int, input().split()))",
"-c = Counter(a)",
"-for i in range(1, n + 1):",
"- print((c[i]))",
"+a = lnii()",
"+ans = [0 for i in range(n)]",
"+for i in a:",
"+ i -= 1",
"+ ans[i] += 1",
"+for i in ans:",
"+ print(i)"
]
| false | 0.094286 | 0.044878 | 2.100922 | [
"s090782744",
"s226802298"
]
|
u888965338 | p02984 | python | s915742070 | s846845677 | 140 | 126 | 19,144 | 19,644 | Accepted | Accepted | 10 | def mul(inp):
return int(inp * 2)
if __name__ == '__main__':
n = int(eval(input()))
a = list(map(mul, list(map(int, input().split()))))
res = [0] * n
for x in range(0, 1):
res[x] = a[x]
count = 1
for i in range(x + 1, n + x, 2):
mod_i = i % n
res[x] = res[x] - a[mod_i]
for i in range(x + 2, n + x, 2):
mod_i = i % n
res[x] = res[x] + a[mod_i]
res[x] = int(res[x] / 2)
for x in range(1, n):
res[x] = a[x - 1] - res[x - 1]
print((' '.join(map(str, res))))
| from functools import reduce
from operator import add
def mul(inp):
return int(inp * 2)
if __name__ == '__main__':
n = int(eval(input()))
a = list(map(mul, list(map(int, input().split()))))
res = [0] * n
minus = reduce(add, [a[i] for i in range(1, n, 2)])
plus = reduce(add, [a[i] for i in range(2, n, 2)])
res[0] = int((a[0] + plus - minus) / 2)
for x in range(1, n):
res[x] = a[x - 1] - res[x - 1]
print((' '.join(map(str, res))))
| 21 | 18 | 587 | 484 | def mul(inp):
return int(inp * 2)
if __name__ == "__main__":
n = int(eval(input()))
a = list(map(mul, list(map(int, input().split()))))
res = [0] * n
for x in range(0, 1):
res[x] = a[x]
count = 1
for i in range(x + 1, n + x, 2):
mod_i = i % n
res[x] = res[x] - a[mod_i]
for i in range(x + 2, n + x, 2):
mod_i = i % n
res[x] = res[x] + a[mod_i]
res[x] = int(res[x] / 2)
for x in range(1, n):
res[x] = a[x - 1] - res[x - 1]
print((" ".join(map(str, res))))
| from functools import reduce
from operator import add
def mul(inp):
return int(inp * 2)
if __name__ == "__main__":
n = int(eval(input()))
a = list(map(mul, list(map(int, input().split()))))
res = [0] * n
minus = reduce(add, [a[i] for i in range(1, n, 2)])
plus = reduce(add, [a[i] for i in range(2, n, 2)])
res[0] = int((a[0] + plus - minus) / 2)
for x in range(1, n):
res[x] = a[x - 1] - res[x - 1]
print((" ".join(map(str, res))))
| false | 14.285714 | [
"+from functools import reduce",
"+from operator import add",
"+",
"+",
"- for x in range(0, 1):",
"- res[x] = a[x]",
"- count = 1",
"- for i in range(x + 1, n + x, 2):",
"- mod_i = i % n",
"- res[x] = res[x] - a[mod_i]",
"- for i in range(x + 2, n + x, 2):",
"- mod_i = i % n",
"- res[x] = res[x] + a[mod_i]",
"- res[x] = int(res[x] / 2)",
"+ minus = reduce(add, [a[i] for i in range(1, n, 2)])",
"+ plus = reduce(add, [a[i] for i in range(2, n, 2)])",
"+ res[0] = int((a[0] + plus - minus) / 2)"
]
| false | 0.034979 | 0.035826 | 0.976352 | [
"s915742070",
"s846845677"
]
|
u606045429 | p03018 | python | s852280901 | s171725572 | 49 | 35 | 3,500 | 3,500 | Accepted | Accepted | 28.57 | S = input().replace("BC", "D")
ans = a = 0
for s in S:
if s == "A":
a += 1
elif s == "D":
ans += a
else:
a = 0
print(ans) | def main():
S = input().replace("BC", "D")
ans = a = 0
for s in S:
if s == "A":
a += 1
elif s == "D":
ans += a
else:
a = 0
print(ans)
main() | 12 | 15 | 170 | 233 | S = input().replace("BC", "D")
ans = a = 0
for s in S:
if s == "A":
a += 1
elif s == "D":
ans += a
else:
a = 0
print(ans)
| def main():
S = input().replace("BC", "D")
ans = a = 0
for s in S:
if s == "A":
a += 1
elif s == "D":
ans += a
else:
a = 0
print(ans)
main()
| false | 20 | [
"-S = input().replace(\"BC\", \"D\")",
"-ans = a = 0",
"-for s in S:",
"- if s == \"A\":",
"- a += 1",
"- elif s == \"D\":",
"- ans += a",
"- else:",
"- a = 0",
"-print(ans)",
"+def main():",
"+ S = input().replace(\"BC\", \"D\")",
"+ ans = a = 0",
"+ for s in S:",
"+ if s == \"A\":",
"+ a += 1",
"+ elif s == \"D\":",
"+ ans += a",
"+ else:",
"+ a = 0",
"+ print(ans)",
"+",
"+",
"+main()"
]
| false | 0.076351 | 0.076965 | 0.992026 | [
"s852280901",
"s171725572"
]
|
u896741788 | p03087 | python | s844708148 | s648923219 | 535 | 479 | 18,936 | 11,628 | Accepted | Accepted | 10.47 | n,q=list(map(int,input().split()))
t=eval(input())
a=[0]*n
from collections import defaultdict
tail=defaultdict(int)
for i in range(n-1):
if t[i]=="A"and t[i+1]=="C":
a[i+1]+=1
tail[i]+=1
from itertools import accumulate
a=list(accumulate(a))
for _ in range(q):
l,r=list(map(int,input().split()))
l,r=l-1,r-1
if l==0:print((a[r]))
else:
print((a[r]-a[l-1]-tail[l-1])) | n,q=list(map(int,input().split()))
t=eval(input())
a=[0]*n
for i in range(n-1):
if t[i]=="A"and t[i+1]=="C":
a[i]=a[i-1]+1
else:a[i]=a[i-1]
for _ in range(q):
l,r=list(map(int,input().split()))
l,r=l-1,r-2
print((a[r]-a[l-1])) | 18 | 11 | 407 | 244 | n, q = list(map(int, input().split()))
t = eval(input())
a = [0] * n
from collections import defaultdict
tail = defaultdict(int)
for i in range(n - 1):
if t[i] == "A" and t[i + 1] == "C":
a[i + 1] += 1
tail[i] += 1
from itertools import accumulate
a = list(accumulate(a))
for _ in range(q):
l, r = list(map(int, input().split()))
l, r = l - 1, r - 1
if l == 0:
print((a[r]))
else:
print((a[r] - a[l - 1] - tail[l - 1]))
| n, q = list(map(int, input().split()))
t = eval(input())
a = [0] * n
for i in range(n - 1):
if t[i] == "A" and t[i + 1] == "C":
a[i] = a[i - 1] + 1
else:
a[i] = a[i - 1]
for _ in range(q):
l, r = list(map(int, input().split()))
l, r = l - 1, r - 2
print((a[r] - a[l - 1]))
| false | 38.888889 | [
"-from collections import defaultdict",
"-",
"-tail = defaultdict(int)",
"- a[i + 1] += 1",
"- tail[i] += 1",
"-from itertools import accumulate",
"-",
"-a = list(accumulate(a))",
"+ a[i] = a[i - 1] + 1",
"+ else:",
"+ a[i] = a[i - 1]",
"- l, r = l - 1, r - 1",
"- if l == 0:",
"- print((a[r]))",
"- else:",
"- print((a[r] - a[l - 1] - tail[l - 1]))",
"+ l, r = l - 1, r - 2",
"+ print((a[r] - a[l - 1]))"
]
| false | 0.036364 | 0.037647 | 0.965903 | [
"s844708148",
"s648923219"
]
|
u620084012 | p03733 | python | s074464206 | s783202661 | 114 | 78 | 26,836 | 25,196 | Accepted | Accepted | 31.58 | N, T = list(map(int,input().split()))
t = list(map(int,input().split()))
ans = 0
s, e = 0, T
for k in range(1,N):
if e < t[k]:
ans += e-s
s = t[k]
e = t[k] + T
else:
e = t[k] + T
ans += e-s
print(ans)
| import sys
def input():
return sys.stdin.readline()[:-1]
def main():
N, T = list(map(int,input().split()))
t = list(map(int,input().split()))
prev = 0
end = 0
ans = 0
for e in t:
if end < e:
ans += end-prev
prev = e
end = e + T
else:
end = e + T
ans += end - prev
print(ans)
if __name__ == '__main__':
main()
| 13 | 20 | 247 | 426 | N, T = list(map(int, input().split()))
t = list(map(int, input().split()))
ans = 0
s, e = 0, T
for k in range(1, N):
if e < t[k]:
ans += e - s
s = t[k]
e = t[k] + T
else:
e = t[k] + T
ans += e - s
print(ans)
| import sys
def input():
return sys.stdin.readline()[:-1]
def main():
N, T = list(map(int, input().split()))
t = list(map(int, input().split()))
prev = 0
end = 0
ans = 0
for e in t:
if end < e:
ans += end - prev
prev = e
end = e + T
else:
end = e + T
ans += end - prev
print(ans)
if __name__ == "__main__":
main()
| false | 35 | [
"-N, T = list(map(int, input().split()))",
"-t = list(map(int, input().split()))",
"-ans = 0",
"-s, e = 0, T",
"-for k in range(1, N):",
"- if e < t[k]:",
"- ans += e - s",
"- s = t[k]",
"- e = t[k] + T",
"- else:",
"- e = t[k] + T",
"-ans += e - s",
"-print(ans)",
"+import sys",
"+",
"+",
"+def input():",
"+ return sys.stdin.readline()[:-1]",
"+",
"+",
"+def main():",
"+ N, T = list(map(int, input().split()))",
"+ t = list(map(int, input().split()))",
"+ prev = 0",
"+ end = 0",
"+ ans = 0",
"+ for e in t:",
"+ if end < e:",
"+ ans += end - prev",
"+ prev = e",
"+ end = e + T",
"+ else:",
"+ end = e + T",
"+ ans += end - prev",
"+ print(ans)",
"+",
"+",
"+if __name__ == \"__main__\":",
"+ main()"
]
| false | 0.046499 | 0.03898 | 1.192891 | [
"s074464206",
"s783202661"
]
|
u694649864 | p03160 | python | s068677361 | s968686701 | 271 | 122 | 53,320 | 20,652 | Accepted | Accepted | 54.98 | N = int(eval(input()))
A = list(map(int, input().split()))
#コストの配列 全部無限にしておく
cost = [float("inf") for _ in range(N)]
cost[0] = 0
for i in range(N-1):
cost[i + 1] = min(cost[i + 1], cost[i] + abs(A[i+1] - A[i]))
if(i + 2 < N):
cost[i + 2] = min(cost[i+2], cost[i] + abs(A[i+2] - A[i]))
print((cost[N-1])) | N = int(eval(input()))
h = list(map(int, input().split()))
dp = [0] * N
dp[0] = 0;
dp[1] = abs(h[1] - h[0])
for i in range(2, N):
dp[i] = min(abs(h[i]-h[i-1]) + dp[i-1], abs(h[i] - h[i-2]) + dp[i-2])
print((dp[N-1])) | 10 | 8 | 320 | 219 | N = int(eval(input()))
A = list(map(int, input().split()))
# コストの配列 全部無限にしておく
cost = [float("inf") for _ in range(N)]
cost[0] = 0
for i in range(N - 1):
cost[i + 1] = min(cost[i + 1], cost[i] + abs(A[i + 1] - A[i]))
if i + 2 < N:
cost[i + 2] = min(cost[i + 2], cost[i] + abs(A[i + 2] - A[i]))
print((cost[N - 1]))
| N = int(eval(input()))
h = list(map(int, input().split()))
dp = [0] * N
dp[0] = 0
dp[1] = abs(h[1] - h[0])
for i in range(2, N):
dp[i] = min(abs(h[i] - h[i - 1]) + dp[i - 1], abs(h[i] - h[i - 2]) + dp[i - 2])
print((dp[N - 1]))
| false | 20 | [
"-A = list(map(int, input().split()))",
"-# コストの配列 全部無限にしておく",
"-cost = [float(\"inf\") for _ in range(N)]",
"-cost[0] = 0",
"-for i in range(N - 1):",
"- cost[i + 1] = min(cost[i + 1], cost[i] + abs(A[i + 1] - A[i]))",
"- if i + 2 < N:",
"- cost[i + 2] = min(cost[i + 2], cost[i] + abs(A[i + 2] - A[i]))",
"-print((cost[N - 1]))",
"+h = list(map(int, input().split()))",
"+dp = [0] * N",
"+dp[0] = 0",
"+dp[1] = abs(h[1] - h[0])",
"+for i in range(2, N):",
"+ dp[i] = min(abs(h[i] - h[i - 1]) + dp[i - 1], abs(h[i] - h[i - 2]) + dp[i - 2])",
"+print((dp[N - 1]))"
]
| false | 0.03295 | 0.036532 | 0.901933 | [
"s068677361",
"s968686701"
]
|
u391731808 | p02972 | python | s882842292 | s103134154 | 1,035 | 879 | 75,356 | 73,832 | Accepted | Accepted | 15.07 | N = int(eval(input()))
*A, = list(map(int,input().split()))
D = [0]*(N+1)
ans = []
for i in range(N,0,-1):
if D[i]%2 != A[i-1]:
ans.append(i)
for j in range(1,int(i**0.5)+1):
if i%j==0:
D[j] += 1
if i//j != j:D[i//j] += 1
print((len(ans)))
print((*ans)) | def get_divisor(n):
if n==1:return [1]
a = [1]
b = [n]
for i in range(2,int(n**0.5)+1):
if n%i==0:
a.append(i)
b.append(n//i)
if a[-1]==b[-1]:b.pop()
a.extend(b[::-1])
return a
N = int(eval(input()))
*A, = list(map(int,input().split()))
D = [0]*(N+1)
ans = []
for i in range(N,0,-1):
if D[i]%2 != A[i-1]:
ans.append(i)
for j in get_divisor(i):
D[j]+=1
print((len(ans)))
print((*ans)) | 13 | 23 | 313 | 482 | N = int(eval(input()))
(*A,) = list(map(int, input().split()))
D = [0] * (N + 1)
ans = []
for i in range(N, 0, -1):
if D[i] % 2 != A[i - 1]:
ans.append(i)
for j in range(1, int(i**0.5) + 1):
if i % j == 0:
D[j] += 1
if i // j != j:
D[i // j] += 1
print((len(ans)))
print((*ans))
| def get_divisor(n):
if n == 1:
return [1]
a = [1]
b = [n]
for i in range(2, int(n**0.5) + 1):
if n % i == 0:
a.append(i)
b.append(n // i)
if a[-1] == b[-1]:
b.pop()
a.extend(b[::-1])
return a
N = int(eval(input()))
(*A,) = list(map(int, input().split()))
D = [0] * (N + 1)
ans = []
for i in range(N, 0, -1):
if D[i] % 2 != A[i - 1]:
ans.append(i)
for j in get_divisor(i):
D[j] += 1
print((len(ans)))
print((*ans))
| false | 43.478261 | [
"+def get_divisor(n):",
"+ if n == 1:",
"+ return [1]",
"+ a = [1]",
"+ b = [n]",
"+ for i in range(2, int(n**0.5) + 1):",
"+ if n % i == 0:",
"+ a.append(i)",
"+ b.append(n // i)",
"+ if a[-1] == b[-1]:",
"+ b.pop()",
"+ a.extend(b[::-1])",
"+ return a",
"+",
"+",
"- for j in range(1, int(i**0.5) + 1):",
"- if i % j == 0:",
"- D[j] += 1",
"- if i // j != j:",
"- D[i // j] += 1",
"+ for j in get_divisor(i):",
"+ D[j] += 1"
]
| false | 0.038083 | 0.042489 | 0.896291 | [
"s882842292",
"s103134154"
]
|
u389910364 | p03491 | python | s536109238 | s862939324 | 260 | 217 | 37,376 | 34,932 | Accepted | Accepted | 16.54 | import sys
from collections import deque
sys.setrecursionlimit(10000)
INF = float('inf')
N, L = list(map(int, input().split()))
S = set()
for _ in range(N):
S.add(eval(input()))
# 追加できるのが 01... だけで
# L が 4 とすると
# 01: 次はない
# 010: 011 がある
# 011: 010 がある
# 0100: 011, 0101 がある
# 0101: 011, 0100
# 0110: 010, 0111
# 0111: 010, 0110
# 候補の長さと L だけによって次の候補の長さと数が決まる
def grundy(size):
"""
:param int size: 候補の長さ
:return:
"""
# gs = {0}
# g = 0
# for sz in range(size + 1, L + 1):
# g ^= grundy(sz)
# gs.add(g)
#
# i = 0
# while i in gs:
# i += 1
# return i
i = 1
while (L - size + 1) % i == 0:
i *= 2
return i // 2
# S の各要素からトライ木つくる
trie = {}
for s in S:
t = trie
for c in s:
if c not in t:
t[c] = {}
t = t[c]
# 候補文字列の長さのリスト
ok_size_list = []
children = deque()
children.append((trie, 0))
while len(children) > 0:
node, size = children.popleft()
# 0 か 1 か片方しか行けなかったら、行けない方は S の prefix にならない
# 両方行けない場合はどう追加しても S のいずれかが prefix になってしまうからダメ
if len(node) == 1:
ok_size_list.append(size + 1)
for c, child in list(node.items()):
children.append((child, size + 1))
g = 0
for size in ok_size_list:
g ^= grundy(size)
if g != 0:
print('Alice')
else:
print('Bob') | import os
import sys
if os.getenv("LOCAL"):
sys.stdin = open("_in.txt", "r")
sys.setrecursionlimit(10 ** 9)
INF = float("inf")
IINF = 10 ** 18
MOD = 10 ** 9 + 7
# MOD = 998244353
def make_trie(str_set):
"""
:param collections.Iterable[str] str_set:
:rtype: dict of dict
"""
trie = {}
for s in str_set:
node = trie
for c in s:
if c not in node:
node[c] = {}
node = node[c]
return trie
N, L = list(map(int, sys.stdin.buffer.readline().split()))
S = [sys.stdin.buffer.readline().decode().rstrip() for _ in range(N)]
trie = make_trie(S)
# # grundy[i]: 深さ L - i の grundy 数
# grundy = [0] * L
# grundy[0] = 1
# for i in range(1, L):
# gs = [0]
# for j in range(i):
# g = 0
# for k in range(j, i):
# g ^= grundy[k]
# gs.append(g)
# g = 0
# while g in gs:
# g += 1
# grundy[i] = g
# print(grundy) # lsb
# [1, 2, 1, 4, 1, 2, 1, 8, 1, 2, 1, 4, 1, 2, 1, 16, 1, 2, 1, 4, 1, 2, 1, 8, 1, 2, 1, 4, 1, 2, 1, 32]
# @debug
def grundy(i):
# 深さ i の grundy 数
# L - i の最下位ビット
ret = 1
while (L - i + 1) & ret == 0:
ret <<= 1
return ret
g = 0
stack = [(trie, 0)]
while stack:
nodes, depth = stack.pop()
if depth < L and len(nodes) == 1:
g ^= grundy(depth + 1)
for children in list(nodes.values()):
stack.append((children, depth + 1))
if g == 0:
print('Bob')
else:
print('Alice')
| 72 | 74 | 1,387 | 1,551 | import sys
from collections import deque
sys.setrecursionlimit(10000)
INF = float("inf")
N, L = list(map(int, input().split()))
S = set()
for _ in range(N):
S.add(eval(input()))
# 追加できるのが 01... だけで
# L が 4 とすると
# 01: 次はない
# 010: 011 がある
# 011: 010 がある
# 0100: 011, 0101 がある
# 0101: 011, 0100
# 0110: 010, 0111
# 0111: 010, 0110
# 候補の長さと L だけによって次の候補の長さと数が決まる
def grundy(size):
"""
:param int size: 候補の長さ
:return:
"""
# gs = {0}
# g = 0
# for sz in range(size + 1, L + 1):
# g ^= grundy(sz)
# gs.add(g)
#
# i = 0
# while i in gs:
# i += 1
# return i
i = 1
while (L - size + 1) % i == 0:
i *= 2
return i // 2
# S の各要素からトライ木つくる
trie = {}
for s in S:
t = trie
for c in s:
if c not in t:
t[c] = {}
t = t[c]
# 候補文字列の長さのリスト
ok_size_list = []
children = deque()
children.append((trie, 0))
while len(children) > 0:
node, size = children.popleft()
# 0 か 1 か片方しか行けなかったら、行けない方は S の prefix にならない
# 両方行けない場合はどう追加しても S のいずれかが prefix になってしまうからダメ
if len(node) == 1:
ok_size_list.append(size + 1)
for c, child in list(node.items()):
children.append((child, size + 1))
g = 0
for size in ok_size_list:
g ^= grundy(size)
if g != 0:
print("Alice")
else:
print("Bob")
| import os
import sys
if os.getenv("LOCAL"):
sys.stdin = open("_in.txt", "r")
sys.setrecursionlimit(10**9)
INF = float("inf")
IINF = 10**18
MOD = 10**9 + 7
# MOD = 998244353
def make_trie(str_set):
"""
:param collections.Iterable[str] str_set:
:rtype: dict of dict
"""
trie = {}
for s in str_set:
node = trie
for c in s:
if c not in node:
node[c] = {}
node = node[c]
return trie
N, L = list(map(int, sys.stdin.buffer.readline().split()))
S = [sys.stdin.buffer.readline().decode().rstrip() for _ in range(N)]
trie = make_trie(S)
# # grundy[i]: 深さ L - i の grundy 数
# grundy = [0] * L
# grundy[0] = 1
# for i in range(1, L):
# gs = [0]
# for j in range(i):
# g = 0
# for k in range(j, i):
# g ^= grundy[k]
# gs.append(g)
# g = 0
# while g in gs:
# g += 1
# grundy[i] = g
# print(grundy) # lsb
# [1, 2, 1, 4, 1, 2, 1, 8, 1, 2, 1, 4, 1, 2, 1, 16, 1, 2, 1, 4, 1, 2, 1, 8, 1, 2, 1, 4, 1, 2, 1, 32]
# @debug
def grundy(i):
# 深さ i の grundy 数
# L - i の最下位ビット
ret = 1
while (L - i + 1) & ret == 0:
ret <<= 1
return ret
g = 0
stack = [(trie, 0)]
while stack:
nodes, depth = stack.pop()
if depth < L and len(nodes) == 1:
g ^= grundy(depth + 1)
for children in list(nodes.values()):
stack.append((children, depth + 1))
if g == 0:
print("Bob")
else:
print("Alice")
| false | 2.702703 | [
"+import os",
"-from collections import deque",
"-sys.setrecursionlimit(10000)",
"+if os.getenv(\"LOCAL\"):",
"+ sys.stdin = open(\"_in.txt\", \"r\")",
"+sys.setrecursionlimit(10**9)",
"-N, L = list(map(int, input().split()))",
"-S = set()",
"-for _ in range(N):",
"- S.add(eval(input()))",
"-# 追加できるのが 01... だけで",
"-# L が 4 とすると",
"-# 01: 次はない",
"-# 010: 011 がある",
"-# 011: 010 がある",
"-# 0100: 011, 0101 がある",
"-# 0101: 011, 0100",
"-# 0110: 010, 0111",
"-# 0111: 010, 0110",
"-# 候補の長さと L だけによって次の候補の長さと数が決まる",
"-def grundy(size):",
"+IINF = 10**18",
"+MOD = 10**9 + 7",
"+# MOD = 998244353",
"+def make_trie(str_set):",
"- :param int size: 候補の長さ",
"- :return:",
"+ :param collections.Iterable[str] str_set:",
"+ :rtype: dict of dict",
"- # gs = {0}",
"- # g = 0",
"- # for sz in range(size + 1, L + 1):",
"- # g ^= grundy(sz)",
"- # gs.add(g)",
"- #",
"- # i = 0",
"- # while i in gs:",
"- # i += 1",
"- # return i",
"- i = 1",
"- while (L - size + 1) % i == 0:",
"- i *= 2",
"- return i // 2",
"+ trie = {}",
"+ for s in str_set:",
"+ node = trie",
"+ for c in s:",
"+ if c not in node:",
"+ node[c] = {}",
"+ node = node[c]",
"+ return trie",
"-# S の各要素からトライ木つくる",
"-trie = {}",
"-for s in S:",
"- t = trie",
"- for c in s:",
"- if c not in t:",
"- t[c] = {}",
"- t = t[c]",
"-# 候補文字列の長さのリスト",
"-ok_size_list = []",
"-children = deque()",
"-children.append((trie, 0))",
"-while len(children) > 0:",
"- node, size = children.popleft()",
"- # 0 か 1 か片方しか行けなかったら、行けない方は S の prefix にならない",
"- # 両方行けない場合はどう追加しても S のいずれかが prefix になってしまうからダメ",
"- if len(node) == 1:",
"- ok_size_list.append(size + 1)",
"- for c, child in list(node.items()):",
"- children.append((child, size + 1))",
"+N, L = list(map(int, sys.stdin.buffer.readline().split()))",
"+S = [sys.stdin.buffer.readline().decode().rstrip() for _ in range(N)]",
"+trie = make_trie(S)",
"+# # grundy[i]: 深さ L - i の grundy 数",
"+# grundy = [0] * L",
"+# grundy[0] = 1",
"+# for i in range(1, L):",
"+# gs = [0]",
"+# for j in range(i):",
"+# g = 0",
"+# for k in range(j, i):",
"+# g ^= grundy[k]",
"+# gs.append(g)",
"+# g = 0",
"+# while g in gs:",
"+# g += 1",
"+# grundy[i] = g",
"+# print(grundy) # lsb",
"+# [1, 2, 1, 4, 1, 2, 1, 8, 1, 2, 1, 4, 1, 2, 1, 16, 1, 2, 1, 4, 1, 2, 1, 8, 1, 2, 1, 4, 1, 2, 1, 32]",
"+# @debug",
"+def grundy(i):",
"+ # 深さ i の grundy 数",
"+ # L - i の最下位ビット",
"+ ret = 1",
"+ while (L - i + 1) & ret == 0:",
"+ ret <<= 1",
"+ return ret",
"+",
"+",
"-for size in ok_size_list:",
"- g ^= grundy(size)",
"-if g != 0:",
"+stack = [(trie, 0)]",
"+while stack:",
"+ nodes, depth = stack.pop()",
"+ if depth < L and len(nodes) == 1:",
"+ g ^= grundy(depth + 1)",
"+ for children in list(nodes.values()):",
"+ stack.append((children, depth + 1))",
"+if g == 0:",
"+ print(\"Bob\")",
"+else:",
"-else:",
"- print(\"Bob\")"
]
| false | 0.062949 | 0.041265 | 1.525488 | [
"s536109238",
"s862939324"
]
|
u077291787 | p03673 | python | s742039415 | s708700793 | 169 | 141 | 25,180 | 24,412 | Accepted | Accepted | 16.57 | # ABC066C - pushpush (ARC077)
def main():
N, *A = list(map(int, open(0).read().split()))
if int(N) & 1:
B = A[::2][::-1] + A[1::2]
else:
B = A[1::2][::-1] + A[::2]
print((*B))
if __name__ == "__main__":
main() | # ABC066C - pushpush (ARC077)
from collections import deque
def main():
N, *A = open(0).read().split()
B, x = deque(), int(N) & 1
for i, a in enumerate(A, start=x):
if i & 1:
B.appendleft(a)
else:
B.append(a)
print((*B))
if __name__ == "__main__":
main() | 12 | 17 | 250 | 332 | # ABC066C - pushpush (ARC077)
def main():
N, *A = list(map(int, open(0).read().split()))
if int(N) & 1:
B = A[::2][::-1] + A[1::2]
else:
B = A[1::2][::-1] + A[::2]
print((*B))
if __name__ == "__main__":
main()
| # ABC066C - pushpush (ARC077)
from collections import deque
def main():
N, *A = open(0).read().split()
B, x = deque(), int(N) & 1
for i, a in enumerate(A, start=x):
if i & 1:
B.appendleft(a)
else:
B.append(a)
print((*B))
if __name__ == "__main__":
main()
| false | 29.411765 | [
"+from collections import deque",
"+",
"+",
"- N, *A = list(map(int, open(0).read().split()))",
"- if int(N) & 1:",
"- B = A[::2][::-1] + A[1::2]",
"- else:",
"- B = A[1::2][::-1] + A[::2]",
"+ N, *A = open(0).read().split()",
"+ B, x = deque(), int(N) & 1",
"+ for i, a in enumerate(A, start=x):",
"+ if i & 1:",
"+ B.appendleft(a)",
"+ else:",
"+ B.append(a)"
]
| false | 0.04859 | 0.033131 | 1.466623 | [
"s742039415",
"s708700793"
]
|
u123756661 | p02781 | python | s671986059 | s080442769 | 201 | 181 | 38,384 | 38,384 | Accepted | Accepted | 9.95 | n=int(eval(input()))
k=int(eval(input()))
l=[int(i) for i in "0"+str(n)]
# [0]=n [1]<n
dp=[[[0]*5,[0]*5] for i in "ww"]
dp[0][0][0]=1
for i,j in enumerate(str(n)):
i+=1
for p in range(k+1):
if dp[i%2-1][0][p]:
dp[i%2][0][p+[0,1][l[i]>0]]=1
for q in range(l[i]):
dp[i%2][1][p+[0,1][q>0]]+=1
if dp[i%2-1][1][p]:
dp[i%2][1][p]+=dp[i%2-1][1][p]
dp[i%2][1][p+1]+=dp[i%2-1][1][p]*9
for p in range(10): dp[i%2-1][p//5][p%5]=0
print((dp[0][0][k]+dp[1][0][k]+dp[0][1][k]+dp[1][1][k]))
| n=int(eval(input()))
k=int(eval(input()))
l=[int(i) for i in "0"+str(n)]
# [0]=n [1]<n
dp=[[[0]*5,[0]*5] for i in "ww"]
dp[0][0][0]=1
for i,j in enumerate(str(n),start=1):
for p in range(k+1):
if dp[i%2-1][0][p]:
dp[i%2][0][p+[0,1][l[i]>0]]=1
for q in range(l[i]):
dp[i%2][1][p+[0,1][q>0]]+=1
if dp[i%2-1][1][p]:
dp[i%2][1][p]+=dp[i%2-1][1][p]
dp[i%2][1][p+1]+=dp[i%2-1][1][p]*9
for p in range(10): dp[i%2-1][p//5][p%5]=0
print((dp[0][0][k]+dp[1][0][k]+dp[0][1][k]+dp[1][1][k])) | 18 | 17 | 571 | 568 | n = int(eval(input()))
k = int(eval(input()))
l = [int(i) for i in "0" + str(n)]
# [0]=n [1]<n
dp = [[[0] * 5, [0] * 5] for i in "ww"]
dp[0][0][0] = 1
for i, j in enumerate(str(n)):
i += 1
for p in range(k + 1):
if dp[i % 2 - 1][0][p]:
dp[i % 2][0][p + [0, 1][l[i] > 0]] = 1
for q in range(l[i]):
dp[i % 2][1][p + [0, 1][q > 0]] += 1
if dp[i % 2 - 1][1][p]:
dp[i % 2][1][p] += dp[i % 2 - 1][1][p]
dp[i % 2][1][p + 1] += dp[i % 2 - 1][1][p] * 9
for p in range(10):
dp[i % 2 - 1][p // 5][p % 5] = 0
print((dp[0][0][k] + dp[1][0][k] + dp[0][1][k] + dp[1][1][k]))
| n = int(eval(input()))
k = int(eval(input()))
l = [int(i) for i in "0" + str(n)]
# [0]=n [1]<n
dp = [[[0] * 5, [0] * 5] for i in "ww"]
dp[0][0][0] = 1
for i, j in enumerate(str(n), start=1):
for p in range(k + 1):
if dp[i % 2 - 1][0][p]:
dp[i % 2][0][p + [0, 1][l[i] > 0]] = 1
for q in range(l[i]):
dp[i % 2][1][p + [0, 1][q > 0]] += 1
if dp[i % 2 - 1][1][p]:
dp[i % 2][1][p] += dp[i % 2 - 1][1][p]
dp[i % 2][1][p + 1] += dp[i % 2 - 1][1][p] * 9
for p in range(10):
dp[i % 2 - 1][p // 5][p % 5] = 0
print((dp[0][0][k] + dp[1][0][k] + dp[0][1][k] + dp[1][1][k]))
| false | 5.555556 | [
"-for i, j in enumerate(str(n)):",
"- i += 1",
"+for i, j in enumerate(str(n), start=1):"
]
| false | 0.047397 | 0.04178 | 1.134433 | [
"s671986059",
"s080442769"
]
|
u724687935 | p02839 | python | s825056304 | s261848644 | 1,968 | 675 | 678,024 | 55,516 | Accepted | Accepted | 65.7 | def main():
# import sys
# readline = sys.stdin.readline
# readlines = sys.stdin.readlines
H, W = list(map(int, input().split()))
A = [list(map(int, input().split())) for _ in range(H)]
B = [list(map(int, input().split())) for _ in range(H)]
M = 0
grid = [[0] * W for _ in range(H)]
for i in range(H):
for j in range(W):
m = abs(A[i][j] - B[i][j])
grid[i][j] = m
M = max(M, m)
L = (H + W) * M
dp = [[[0] * (L + 1) for _ in range(W)] for _ in range(H)]
dp[0][0][grid[0][0]] = 1
for i in range(H):
for j in range(W):
for k in range(L + 1):
if dp[i][j][k] == 1:
if i < H - 1:
nk = grid[i + 1][j]
dp[i + 1][j][k + nk] |= 1
dp[i + 1][j][abs(k - nk)] |= 1
if j < W - 1:
nk = grid[i][j + 1]
dp[i][j + 1][k + nk] |= 1
dp[i][j + 1][abs(k - nk)] |= 1
for k in range(L + 1):
if dp[-1][-1][k] == 1:
print(k)
break
if __name__ == "__main__":
main()
| def main():
# import sys
# readline = sys.stdin.readline
# readlines = sys.stdin.readlines
H, W = list(map(int, input().split()))
A = [list(map(int, input().split())) for _ in range(H)]
B = [list(map(int, input().split())) for _ in range(H)]
M = 0
grid = [[0] * W for _ in range(H)]
for i in range(H):
for j in range(W):
m = abs(A[i][j] - B[i][j])
grid[i][j] = m
M = max(M, m)
dp = [[0] * W for _ in range(H)]
dp[0][0] = (1 << grid[0][0])
for i in range(H):
for j in range(W):
here = dp[i][j]
if i < H - 1:
nk = grid[i + 1][j]
dp[i + 1][j] |= (here << nk) | (here >> nk)
for k in range(1, nk + 1):
if (here >> k) & 1:
dp[i + 1][j] |= (1 << (nk - k))
if j < W - 1:
nk = grid[i][j + 1]
dp[i][j + 1] |= (here << nk) | (here >> nk)
for k in range(1, nk + 1):
if (here >> k) & 1:
dp[i][j + 1] |= (1 << (nk - k))
k = dp[-1][-1]
ans = 0
while k > 0:
if k & 1:
print(ans)
break
k >>= 1
ans += 1
if __name__ == "__main__":
main()
| 40 | 46 | 1,230 | 1,349 | def main():
# import sys
# readline = sys.stdin.readline
# readlines = sys.stdin.readlines
H, W = list(map(int, input().split()))
A = [list(map(int, input().split())) for _ in range(H)]
B = [list(map(int, input().split())) for _ in range(H)]
M = 0
grid = [[0] * W for _ in range(H)]
for i in range(H):
for j in range(W):
m = abs(A[i][j] - B[i][j])
grid[i][j] = m
M = max(M, m)
L = (H + W) * M
dp = [[[0] * (L + 1) for _ in range(W)] for _ in range(H)]
dp[0][0][grid[0][0]] = 1
for i in range(H):
for j in range(W):
for k in range(L + 1):
if dp[i][j][k] == 1:
if i < H - 1:
nk = grid[i + 1][j]
dp[i + 1][j][k + nk] |= 1
dp[i + 1][j][abs(k - nk)] |= 1
if j < W - 1:
nk = grid[i][j + 1]
dp[i][j + 1][k + nk] |= 1
dp[i][j + 1][abs(k - nk)] |= 1
for k in range(L + 1):
if dp[-1][-1][k] == 1:
print(k)
break
if __name__ == "__main__":
main()
| def main():
# import sys
# readline = sys.stdin.readline
# readlines = sys.stdin.readlines
H, W = list(map(int, input().split()))
A = [list(map(int, input().split())) for _ in range(H)]
B = [list(map(int, input().split())) for _ in range(H)]
M = 0
grid = [[0] * W for _ in range(H)]
for i in range(H):
for j in range(W):
m = abs(A[i][j] - B[i][j])
grid[i][j] = m
M = max(M, m)
dp = [[0] * W for _ in range(H)]
dp[0][0] = 1 << grid[0][0]
for i in range(H):
for j in range(W):
here = dp[i][j]
if i < H - 1:
nk = grid[i + 1][j]
dp[i + 1][j] |= (here << nk) | (here >> nk)
for k in range(1, nk + 1):
if (here >> k) & 1:
dp[i + 1][j] |= 1 << (nk - k)
if j < W - 1:
nk = grid[i][j + 1]
dp[i][j + 1] |= (here << nk) | (here >> nk)
for k in range(1, nk + 1):
if (here >> k) & 1:
dp[i][j + 1] |= 1 << (nk - k)
k = dp[-1][-1]
ans = 0
while k > 0:
if k & 1:
print(ans)
break
k >>= 1
ans += 1
if __name__ == "__main__":
main()
| false | 13.043478 | [
"- L = (H + W) * M",
"- dp = [[[0] * (L + 1) for _ in range(W)] for _ in range(H)]",
"- dp[0][0][grid[0][0]] = 1",
"+ dp = [[0] * W for _ in range(H)]",
"+ dp[0][0] = 1 << grid[0][0]",
"- for k in range(L + 1):",
"- if dp[i][j][k] == 1:",
"- if i < H - 1:",
"- nk = grid[i + 1][j]",
"- dp[i + 1][j][k + nk] |= 1",
"- dp[i + 1][j][abs(k - nk)] |= 1",
"- if j < W - 1:",
"- nk = grid[i][j + 1]",
"- dp[i][j + 1][k + nk] |= 1",
"- dp[i][j + 1][abs(k - nk)] |= 1",
"- for k in range(L + 1):",
"- if dp[-1][-1][k] == 1:",
"- print(k)",
"+ here = dp[i][j]",
"+ if i < H - 1:",
"+ nk = grid[i + 1][j]",
"+ dp[i + 1][j] |= (here << nk) | (here >> nk)",
"+ for k in range(1, nk + 1):",
"+ if (here >> k) & 1:",
"+ dp[i + 1][j] |= 1 << (nk - k)",
"+ if j < W - 1:",
"+ nk = grid[i][j + 1]",
"+ dp[i][j + 1] |= (here << nk) | (here >> nk)",
"+ for k in range(1, nk + 1):",
"+ if (here >> k) & 1:",
"+ dp[i][j + 1] |= 1 << (nk - k)",
"+ k = dp[-1][-1]",
"+ ans = 0",
"+ while k > 0:",
"+ if k & 1:",
"+ print(ans)",
"+ k >>= 1",
"+ ans += 1"
]
| false | 0.038801 | 0.038811 | 0.999734 | [
"s825056304",
"s261848644"
]
|
u623231048 | p02679 | python | s057435089 | s788544956 | 498 | 355 | 118,700 | 108,028 | Accepted | Accepted | 28.71 | """
n = int(input())
ab = [list(map(int,input().split())) for _ in range(n)]
mod = 1000000007
ab1 = []
ab2 = []
ab3 = []
ab4 = []
count00 = 0
count01 = 0
count10 = 0
for i in range(n):
if ab[i][0] != 0 and ab[i][1] != 0:
ab1.append(ab[i][0]/ab[i][1])
ab2.append(-ab[i][1]/ab[i][0])
if ab[i][0]/ab[i][1] > 0:
ab3.append((ab[i][0]/ab[i][1],-ab[i][1]/ab[i][0]))
else:
ab4.append((ab[i][0]/ab[i][1],-ab[i][1]/ab[i][0]))
elif ab[i][0] == 0 and ab[i][1] == 0:
count00 += 1
elif ab[i][0] == 0 and ab[i][1] == 1:
count01 += 1
else:
count10 += 1
dict1 = {}
dict2 = {}
ab3.sort()
ab4.sort(reverse = True)
print(ab3)
print(ab4)
for i in ab1:
if i in dict1:
dict1[i] += 1
else:
dict1[i] = 1
for i in ab2:
if i in dict2:
dict2[i] += 1
else:
dict2[i] = 1
sorted1 = sorted(dict1.items(), key = lambda x: x[0])
sorted2 = sorted(dict2.items(), key = lambda x: x[0])
print(sorted1)
print(sorted2)
cnt = 0
num1 = n - count00 - count01 - count10
ans = 0
for i in range(len(ab3)):
a,b = ab3[i]
num1 -= 1
if cnt < len(sorted2):
while cnt < len(sorted2):
if sorted2[cnt][0] == a:
ans += pow(2, num1+count01+count10-sorted2[cnt][1], mod)
ans %= mod
break
elif sorted2[cnt][0] < a:
cnt += 1
else:
ans += pow(2, num1+count01+count10, mod)
ans %= mod
break
else:
ans += pow(2, num1+count01+count10, mod) - pow(2, )
ans %= mod
print(ans)
for i in range(len(ab4)):
num1 -= 1
ans += pow(2, num1+count01+count10, mod)
ans %= mod
print(ans)
ans += pow(2, count01, mod) -1
print(ans)
ans += pow(2, count10, mod) -1
print(ans)
ans += count00
print(ans)
print(ans % mod)
"""
from math import gcd
n = int(eval(input()))
dict1 = {}
mod = 1000000007
cnt00 = 0
cnt01 = 0
cnt10 = 0
for _ in range(n):
a,b = list(map(int,input().split()))
if a == 0 and b == 0:
cnt00 += 1
elif a == 0:
cnt01 += 1
elif b == 0:
cnt10 += 1
else:
c = gcd(a,b)
if b < 0:
a *= -1
b *= -1
set1 = (a//c, b//c)
if set1 in dict1:
dict1[set1] += 1
else:
dict1[set1] = 1
ans = 1
for k,v in list(dict1.items()):
a,b = k
if dict1[(a,b)] == -1:
continue
if a > 0:
if (-b,a) in dict1:
ans *= 2**v + 2**dict1[(-b,a)] - 1
dict1[(-b,a)] = -1
else:
ans *= 2**v
else:
if (b,-a) in dict1:
ans *= 2**v + 2**dict1[(b,-a)] - 1
dict1[(b,-a)] = -1
else:
ans *= 2**v
ans %= mod
ans *= 2 ** cnt01 + 2 ** cnt10 - 1
ans += cnt00 - 1
print((ans%mod))
| from math import gcd
import sys
input = sys.stdin.readline
def main():
n = int(eval(input()))
dict1 = {}
mod = 1000000007
cnt00 = 0
cnt01 = 0
cnt10 = 0
for _ in range(n):
a,b = list(map(int,input().split()))
if a == 0 and b == 0:
cnt00 += 1
elif a == 0:
cnt01 += 1
elif b == 0:
cnt10 += 1
else:
c = gcd(a,b)
if b < 0:
a *= -1
b *= -1
set1 = (a//c, b//c)
if set1 in dict1:
dict1[set1] += 1
else:
dict1[set1] = 1
ans = 1
for k,v in list(dict1.items()):
a,b = k
if dict1[(a,b)] == -1:
continue
if a > 0:
if (-b,a) in dict1:
ans *= 2**v + 2**dict1[(-b,a)] - 1
dict1[(-b,a)] = -1
else:
ans *= 2**v
else:
if (b,-a) in dict1:
ans *= 2**v + 2**dict1[(b,-a)] - 1
dict1[(b,-a)] = -1
else:
ans *= 2**v
ans %= mod
ans *= 2 ** cnt01 + 2 ** cnt10 - 1
ans += cnt00 - 1
print((ans%mod))
if __name__ == '__main__':
main()
| 147 | 59 | 3,036 | 1,299 | """
n = int(input())
ab = [list(map(int,input().split())) for _ in range(n)]
mod = 1000000007
ab1 = []
ab2 = []
ab3 = []
ab4 = []
count00 = 0
count01 = 0
count10 = 0
for i in range(n):
if ab[i][0] != 0 and ab[i][1] != 0:
ab1.append(ab[i][0]/ab[i][1])
ab2.append(-ab[i][1]/ab[i][0])
if ab[i][0]/ab[i][1] > 0:
ab3.append((ab[i][0]/ab[i][1],-ab[i][1]/ab[i][0]))
else:
ab4.append((ab[i][0]/ab[i][1],-ab[i][1]/ab[i][0]))
elif ab[i][0] == 0 and ab[i][1] == 0:
count00 += 1
elif ab[i][0] == 0 and ab[i][1] == 1:
count01 += 1
else:
count10 += 1
dict1 = {}
dict2 = {}
ab3.sort()
ab4.sort(reverse = True)
print(ab3)
print(ab4)
for i in ab1:
if i in dict1:
dict1[i] += 1
else:
dict1[i] = 1
for i in ab2:
if i in dict2:
dict2[i] += 1
else:
dict2[i] = 1
sorted1 = sorted(dict1.items(), key = lambda x: x[0])
sorted2 = sorted(dict2.items(), key = lambda x: x[0])
print(sorted1)
print(sorted2)
cnt = 0
num1 = n - count00 - count01 - count10
ans = 0
for i in range(len(ab3)):
a,b = ab3[i]
num1 -= 1
if cnt < len(sorted2):
while cnt < len(sorted2):
if sorted2[cnt][0] == a:
ans += pow(2, num1+count01+count10-sorted2[cnt][1], mod)
ans %= mod
break
elif sorted2[cnt][0] < a:
cnt += 1
else:
ans += pow(2, num1+count01+count10, mod)
ans %= mod
break
else:
ans += pow(2, num1+count01+count10, mod) - pow(2, )
ans %= mod
print(ans)
for i in range(len(ab4)):
num1 -= 1
ans += pow(2, num1+count01+count10, mod)
ans %= mod
print(ans)
ans += pow(2, count01, mod) -1
print(ans)
ans += pow(2, count10, mod) -1
print(ans)
ans += count00
print(ans)
print(ans % mod)
"""
from math import gcd
n = int(eval(input()))
dict1 = {}
mod = 1000000007
cnt00 = 0
cnt01 = 0
cnt10 = 0
for _ in range(n):
a, b = list(map(int, input().split()))
if a == 0 and b == 0:
cnt00 += 1
elif a == 0:
cnt01 += 1
elif b == 0:
cnt10 += 1
else:
c = gcd(a, b)
if b < 0:
a *= -1
b *= -1
set1 = (a // c, b // c)
if set1 in dict1:
dict1[set1] += 1
else:
dict1[set1] = 1
ans = 1
for k, v in list(dict1.items()):
a, b = k
if dict1[(a, b)] == -1:
continue
if a > 0:
if (-b, a) in dict1:
ans *= 2**v + 2 ** dict1[(-b, a)] - 1
dict1[(-b, a)] = -1
else:
ans *= 2**v
else:
if (b, -a) in dict1:
ans *= 2**v + 2 ** dict1[(b, -a)] - 1
dict1[(b, -a)] = -1
else:
ans *= 2**v
ans %= mod
ans *= 2**cnt01 + 2**cnt10 - 1
ans += cnt00 - 1
print((ans % mod))
| from math import gcd
import sys
input = sys.stdin.readline
def main():
n = int(eval(input()))
dict1 = {}
mod = 1000000007
cnt00 = 0
cnt01 = 0
cnt10 = 0
for _ in range(n):
a, b = list(map(int, input().split()))
if a == 0 and b == 0:
cnt00 += 1
elif a == 0:
cnt01 += 1
elif b == 0:
cnt10 += 1
else:
c = gcd(a, b)
if b < 0:
a *= -1
b *= -1
set1 = (a // c, b // c)
if set1 in dict1:
dict1[set1] += 1
else:
dict1[set1] = 1
ans = 1
for k, v in list(dict1.items()):
a, b = k
if dict1[(a, b)] == -1:
continue
if a > 0:
if (-b, a) in dict1:
ans *= 2**v + 2 ** dict1[(-b, a)] - 1
dict1[(-b, a)] = -1
else:
ans *= 2**v
else:
if (b, -a) in dict1:
ans *= 2**v + 2 ** dict1[(b, -a)] - 1
dict1[(b, -a)] = -1
else:
ans *= 2**v
ans %= mod
ans *= 2**cnt01 + 2**cnt10 - 1
ans += cnt00 - 1
print((ans % mod))
if __name__ == "__main__":
main()
| false | 59.863946 | [
"-\"\"\"",
"-n = int(input())",
"-ab = [list(map(int,input().split())) for _ in range(n)]",
"-mod = 1000000007",
"-ab1 = []",
"-ab2 = []",
"-ab3 = []",
"-ab4 = []",
"-count00 = 0",
"-count01 = 0",
"-count10 = 0",
"-for i in range(n):",
"- if ab[i][0] != 0 and ab[i][1] != 0:",
"- ab1.append(ab[i][0]/ab[i][1])",
"- ab2.append(-ab[i][1]/ab[i][0])",
"- if ab[i][0]/ab[i][1] > 0:",
"- ab3.append((ab[i][0]/ab[i][1],-ab[i][1]/ab[i][0]))",
"+from math import gcd",
"+import sys",
"+",
"+input = sys.stdin.readline",
"+",
"+",
"+def main():",
"+ n = int(eval(input()))",
"+ dict1 = {}",
"+ mod = 1000000007",
"+ cnt00 = 0",
"+ cnt01 = 0",
"+ cnt10 = 0",
"+ for _ in range(n):",
"+ a, b = list(map(int, input().split()))",
"+ if a == 0 and b == 0:",
"+ cnt00 += 1",
"+ elif a == 0:",
"+ cnt01 += 1",
"+ elif b == 0:",
"+ cnt10 += 1",
"- ab4.append((ab[i][0]/ab[i][1],-ab[i][1]/ab[i][0]))",
"- elif ab[i][0] == 0 and ab[i][1] == 0:",
"- count00 += 1",
"- elif ab[i][0] == 0 and ab[i][1] == 1:",
"- count01 += 1",
"- else:",
"- count10 += 1",
"-dict1 = {}",
"-dict2 = {}",
"-ab3.sort()",
"-ab4.sort(reverse = True)",
"-print(ab3)",
"-print(ab4)",
"-for i in ab1:",
"- if i in dict1:",
"- dict1[i] += 1",
"- else:",
"- dict1[i] = 1",
"-for i in ab2:",
"- if i in dict2:",
"- dict2[i] += 1",
"- else:",
"- dict2[i] = 1",
"-sorted1 = sorted(dict1.items(), key = lambda x: x[0])",
"-sorted2 = sorted(dict2.items(), key = lambda x: x[0])",
"-print(sorted1)",
"-print(sorted2)",
"-cnt = 0",
"-num1 = n - count00 - count01 - count10",
"-ans = 0",
"-for i in range(len(ab3)):",
"- a,b = ab3[i]",
"- num1 -= 1",
"- if cnt < len(sorted2):",
"- while cnt < len(sorted2):",
"- if sorted2[cnt][0] == a:",
"- ans += pow(2, num1+count01+count10-sorted2[cnt][1], mod)",
"- ans %= mod",
"- break",
"- elif sorted2[cnt][0] < a:",
"- cnt += 1",
"+ c = gcd(a, b)",
"+ if b < 0:",
"+ a *= -1",
"+ b *= -1",
"+ set1 = (a // c, b // c)",
"+ if set1 in dict1:",
"+ dict1[set1] += 1",
"- ans += pow(2, num1+count01+count10, mod)",
"- ans %= mod",
"- break",
"+ dict1[set1] = 1",
"+ ans = 1",
"+ for k, v in list(dict1.items()):",
"+ a, b = k",
"+ if dict1[(a, b)] == -1:",
"+ continue",
"+ if a > 0:",
"+ if (-b, a) in dict1:",
"+ ans *= 2**v + 2 ** dict1[(-b, a)] - 1",
"+ dict1[(-b, a)] = -1",
"+ else:",
"+ ans *= 2**v",
"- ans += pow(2, num1+count01+count10, mod) - pow(2, )",
"- ans %= mod",
"- print(ans)",
"-for i in range(len(ab4)):",
"- num1 -= 1",
"- ans += pow(2, num1+count01+count10, mod)",
"- ans %= mod",
"- print(ans)",
"-ans += pow(2, count01, mod) -1",
"-print(ans)",
"-ans += pow(2, count10, mod) -1",
"-print(ans)",
"-ans += count00",
"-print(ans)",
"-print(ans % mod)",
"-\"\"\"",
"-from math import gcd",
"+ if (b, -a) in dict1:",
"+ ans *= 2**v + 2 ** dict1[(b, -a)] - 1",
"+ dict1[(b, -a)] = -1",
"+ else:",
"+ ans *= 2**v",
"+ ans %= mod",
"+ ans *= 2**cnt01 + 2**cnt10 - 1",
"+ ans += cnt00 - 1",
"+ print((ans % mod))",
"-n = int(eval(input()))",
"-dict1 = {}",
"-mod = 1000000007",
"-cnt00 = 0",
"-cnt01 = 0",
"-cnt10 = 0",
"-for _ in range(n):",
"- a, b = list(map(int, input().split()))",
"- if a == 0 and b == 0:",
"- cnt00 += 1",
"- elif a == 0:",
"- cnt01 += 1",
"- elif b == 0:",
"- cnt10 += 1",
"- else:",
"- c = gcd(a, b)",
"- if b < 0:",
"- a *= -1",
"- b *= -1",
"- set1 = (a // c, b // c)",
"- if set1 in dict1:",
"- dict1[set1] += 1",
"- else:",
"- dict1[set1] = 1",
"-ans = 1",
"-for k, v in list(dict1.items()):",
"- a, b = k",
"- if dict1[(a, b)] == -1:",
"- continue",
"- if a > 0:",
"- if (-b, a) in dict1:",
"- ans *= 2**v + 2 ** dict1[(-b, a)] - 1",
"- dict1[(-b, a)] = -1",
"- else:",
"- ans *= 2**v",
"- else:",
"- if (b, -a) in dict1:",
"- ans *= 2**v + 2 ** dict1[(b, -a)] - 1",
"- dict1[(b, -a)] = -1",
"- else:",
"- ans *= 2**v",
"- ans %= mod",
"-ans *= 2**cnt01 + 2**cnt10 - 1",
"-ans += cnt00 - 1",
"-print((ans % mod))",
"+",
"+if __name__ == \"__main__\":",
"+ main()"
]
| false | 0.142921 | 0.078428 | 1.82232 | [
"s057435089",
"s788544956"
]
|
u861141787 | p02683 | python | s550719988 | s209308871 | 88 | 81 | 9,208 | 9,132 | Accepted | Accepted | 7.95 | n, m, x = list(map(int, input().split()))
A = []
for i in range(n):
A.append(list(map(int, input().split())))
# print(A)
ans = float("inf")
for i in range(2 ** n):
skill = [0] * (m+1)
for j in range(n):
if ((i >> j) & 1):
for k in range(m+1):
skill[k] += A[j][k]
# print(ans, skill)
if skill:
for i in range(1, m+1):
if x > skill[i]:
break
else:
ans = min(ans, skill[0])
if ans == float("inf"):
print((-1))
else:
print(ans)
| n, m, x = list(map(int, input().split()))
A = [[] for _ in range(n)]
C = [0] * n
for i in range(n):
c_as = list(map(int, input().split()))
C[i], A[i] = c_as[0], c_as[1:]
INF = 10 ** 9
ans = INF
for s in range(1<<n):
smart = [0] * m
cost_sum = 0
for i in range(n):
if (s >> i) % 2 == 0: continue
cost_sum += C[i]
for j in range(m):
smart[j] += A[i][j]
ok = True
for i in range(m):
if x > smart[i]:
ok = False
if ok:
ans = min(ans, cost_sum)
if ans == INF:
print((-1))
else:
print(ans)
| 30 | 33 | 572 | 623 | n, m, x = list(map(int, input().split()))
A = []
for i in range(n):
A.append(list(map(int, input().split())))
# print(A)
ans = float("inf")
for i in range(2**n):
skill = [0] * (m + 1)
for j in range(n):
if (i >> j) & 1:
for k in range(m + 1):
skill[k] += A[j][k]
# print(ans, skill)
if skill:
for i in range(1, m + 1):
if x > skill[i]:
break
else:
ans = min(ans, skill[0])
if ans == float("inf"):
print((-1))
else:
print(ans)
| n, m, x = list(map(int, input().split()))
A = [[] for _ in range(n)]
C = [0] * n
for i in range(n):
c_as = list(map(int, input().split()))
C[i], A[i] = c_as[0], c_as[1:]
INF = 10**9
ans = INF
for s in range(1 << n):
smart = [0] * m
cost_sum = 0
for i in range(n):
if (s >> i) % 2 == 0:
continue
cost_sum += C[i]
for j in range(m):
smart[j] += A[i][j]
ok = True
for i in range(m):
if x > smart[i]:
ok = False
if ok:
ans = min(ans, cost_sum)
if ans == INF:
print((-1))
else:
print(ans)
| false | 9.090909 | [
"-A = []",
"+A = [[] for _ in range(n)]",
"+C = [0] * n",
"- A.append(list(map(int, input().split())))",
"-# print(A)",
"-ans = float(\"inf\")",
"-for i in range(2**n):",
"- skill = [0] * (m + 1)",
"- for j in range(n):",
"- if (i >> j) & 1:",
"- for k in range(m + 1):",
"- skill[k] += A[j][k]",
"- # print(ans, skill)",
"- if skill:",
"- for i in range(1, m + 1):",
"- if x > skill[i]:",
"- break",
"- else:",
"- ans = min(ans, skill[0])",
"-if ans == float(\"inf\"):",
"+ c_as = list(map(int, input().split()))",
"+ C[i], A[i] = c_as[0], c_as[1:]",
"+INF = 10**9",
"+ans = INF",
"+for s in range(1 << n):",
"+ smart = [0] * m",
"+ cost_sum = 0",
"+ for i in range(n):",
"+ if (s >> i) % 2 == 0:",
"+ continue",
"+ cost_sum += C[i]",
"+ for j in range(m):",
"+ smart[j] += A[i][j]",
"+ ok = True",
"+ for i in range(m):",
"+ if x > smart[i]:",
"+ ok = False",
"+ if ok:",
"+ ans = min(ans, cost_sum)",
"+if ans == INF:"
]
| false | 0.049122 | 0.048472 | 1.013427 | [
"s550719988",
"s209308871"
]
|
u802234509 | p02792 | python | s920694030 | s862458268 | 565 | 231 | 44,908 | 40,684 | Accepted | Accepted | 59.12 | n = int(eval(input()))
ans=0
for i in range(1,n+1):
a=str(i)[0]
b=str(i)[-1]
for digit in range(1,7):
if digit == 1:
if a==b:
ans+=1
elif b!='0':
mn = int(b+'0'*(digit-2)+a)
mx = int(b+'9'*(digit-2)+a)
if mn>n:
break
if mx<=n:
ans+=10**(digit-2)
else:
ns=str(n)
for j in range(1,len(ns)-1):
ans+=int(ns[j])*10**(max(digit-2-j,0))
if ns[-1]>=a:
ans+=1
break
print(ans)
| n = int(eval(input()))
ans=0
mp=[[0]*10 for _ in range(10)]
for i in range(1,n+1):
a=int(str(i)[0])
b=int(str(i)[-1])
mp[a][b]+=1
for i in range(10):
for j in range(10):
ans+=mp[i][j]*mp[j][i]
print(ans)
| 29 | 18 | 647 | 250 | n = int(eval(input()))
ans = 0
for i in range(1, n + 1):
a = str(i)[0]
b = str(i)[-1]
for digit in range(1, 7):
if digit == 1:
if a == b:
ans += 1
elif b != "0":
mn = int(b + "0" * (digit - 2) + a)
mx = int(b + "9" * (digit - 2) + a)
if mn > n:
break
if mx <= n:
ans += 10 ** (digit - 2)
else:
ns = str(n)
for j in range(1, len(ns) - 1):
ans += int(ns[j]) * 10 ** (max(digit - 2 - j, 0))
if ns[-1] >= a:
ans += 1
break
print(ans)
| n = int(eval(input()))
ans = 0
mp = [[0] * 10 for _ in range(10)]
for i in range(1, n + 1):
a = int(str(i)[0])
b = int(str(i)[-1])
mp[a][b] += 1
for i in range(10):
for j in range(10):
ans += mp[i][j] * mp[j][i]
print(ans)
| false | 37.931034 | [
"+mp = [[0] * 10 for _ in range(10)]",
"- a = str(i)[0]",
"- b = str(i)[-1]",
"- for digit in range(1, 7):",
"- if digit == 1:",
"- if a == b:",
"- ans += 1",
"- elif b != \"0\":",
"- mn = int(b + \"0\" * (digit - 2) + a)",
"- mx = int(b + \"9\" * (digit - 2) + a)",
"- if mn > n:",
"- break",
"- if mx <= n:",
"- ans += 10 ** (digit - 2)",
"- else:",
"- ns = str(n)",
"- for j in range(1, len(ns) - 1):",
"- ans += int(ns[j]) * 10 ** (max(digit - 2 - j, 0))",
"- if ns[-1] >= a:",
"- ans += 1",
"- break",
"+ a = int(str(i)[0])",
"+ b = int(str(i)[-1])",
"+ mp[a][b] += 1",
"+for i in range(10):",
"+ for j in range(10):",
"+ ans += mp[i][j] * mp[j][i]"
]
| false | 0.236963 | 0.156947 | 1.509828 | [
"s920694030",
"s862458268"
]
|
u002459665 | p02727 | python | s465047671 | s610547495 | 312 | 243 | 23,328 | 23,328 | Accepted | Accepted | 22.12 | X, Y, A, B, C = list(map(int, input().split()))
P = list(map(int, input().split()))
Q = list(map(int, input().split()))
R = list(map(int, input().split()))
P.sort(reverse=True)
Q.sort(reverse=True)
P = P[:X]
Q = Q[:Y]
P.sort()
Q.sort()
R.sort(reverse=True)
p_i = 0
q_i = 0
for ri in R:
if p_i >= len(P) and q_i >= len(Q):
break
if p_i >= len(P):
if ri >= Q[q_i]:
Q[q_i] = ri
q_i += 1
elif q_i >= len(Q):
if ri >= P[p_i]:
P[p_i] = ri
p_i += 1
elif ri < P[p_i] and ri < Q[q_i]:
break
elif ri > P[p_i] and ri > Q[q_i]:
d1 = ri - P[p_i]
d2 = ri - Q[q_i]
if d1 > d2:
P[p_i] = ri
p_i += 1
else:
Q[q_i] = ri
q_i += 1
elif ri > P[p_i] and ri < Q[q_i]:
P[p_i] = ri
p_i += 1
else:
Q[q_i] = ri
q_i += 1
# print(P, Q)
ans = sum(P) + sum(Q)
print(ans)
| X, Y, A, B, C = list(map(int, input().split()))
P = list(map(int, input().split()))
Q = list(map(int, input().split()))
R = list(map(int, input().split()))
P.sort(reverse=True)
Q.sort(reverse=True)
P = P[:X]
Q = Q[:Y]
# P.sort()
# Q.sort()
# R.sort(reverse=True)
S = []
S = P + Q + R
S.sort(reverse=True)
# print(S)
S2 = S[:X+Y]
ans = sum(S2)
print(ans) | 52 | 22 | 1,018 | 378 | X, Y, A, B, C = list(map(int, input().split()))
P = list(map(int, input().split()))
Q = list(map(int, input().split()))
R = list(map(int, input().split()))
P.sort(reverse=True)
Q.sort(reverse=True)
P = P[:X]
Q = Q[:Y]
P.sort()
Q.sort()
R.sort(reverse=True)
p_i = 0
q_i = 0
for ri in R:
if p_i >= len(P) and q_i >= len(Q):
break
if p_i >= len(P):
if ri >= Q[q_i]:
Q[q_i] = ri
q_i += 1
elif q_i >= len(Q):
if ri >= P[p_i]:
P[p_i] = ri
p_i += 1
elif ri < P[p_i] and ri < Q[q_i]:
break
elif ri > P[p_i] and ri > Q[q_i]:
d1 = ri - P[p_i]
d2 = ri - Q[q_i]
if d1 > d2:
P[p_i] = ri
p_i += 1
else:
Q[q_i] = ri
q_i += 1
elif ri > P[p_i] and ri < Q[q_i]:
P[p_i] = ri
p_i += 1
else:
Q[q_i] = ri
q_i += 1
# print(P, Q)
ans = sum(P) + sum(Q)
print(ans)
| X, Y, A, B, C = list(map(int, input().split()))
P = list(map(int, input().split()))
Q = list(map(int, input().split()))
R = list(map(int, input().split()))
P.sort(reverse=True)
Q.sort(reverse=True)
P = P[:X]
Q = Q[:Y]
# P.sort()
# Q.sort()
# R.sort(reverse=True)
S = []
S = P + Q + R
S.sort(reverse=True)
# print(S)
S2 = S[: X + Y]
ans = sum(S2)
print(ans)
| false | 57.692308 | [
"-P.sort()",
"-Q.sort()",
"-R.sort(reverse=True)",
"-p_i = 0",
"-q_i = 0",
"-for ri in R:",
"- if p_i >= len(P) and q_i >= len(Q):",
"- break",
"- if p_i >= len(P):",
"- if ri >= Q[q_i]:",
"- Q[q_i] = ri",
"- q_i += 1",
"- elif q_i >= len(Q):",
"- if ri >= P[p_i]:",
"- P[p_i] = ri",
"- p_i += 1",
"- elif ri < P[p_i] and ri < Q[q_i]:",
"- break",
"- elif ri > P[p_i] and ri > Q[q_i]:",
"- d1 = ri - P[p_i]",
"- d2 = ri - Q[q_i]",
"- if d1 > d2:",
"- P[p_i] = ri",
"- p_i += 1",
"- else:",
"- Q[q_i] = ri",
"- q_i += 1",
"- elif ri > P[p_i] and ri < Q[q_i]:",
"- P[p_i] = ri",
"- p_i += 1",
"- else:",
"- Q[q_i] = ri",
"- q_i += 1",
"-# print(P, Q)",
"-ans = sum(P) + sum(Q)",
"+# P.sort()",
"+# Q.sort()",
"+# R.sort(reverse=True)",
"+S = []",
"+S = P + Q + R",
"+S.sort(reverse=True)",
"+# print(S)",
"+S2 = S[: X + Y]",
"+ans = sum(S2)"
]
| false | 0.034496 | 0.036452 | 0.946326 | [
"s465047671",
"s610547495"
]
|
u747602774 | p03828 | python | s167424619 | s963322170 | 68 | 28 | 3,064 | 3,316 | Accepted | Accepted | 58.82 | N = int(eval(input()))
if N == 1:
print((1))
exit()
P = 10**9+7
d = {}
for i in range(2,N+1):
k = i
for j in range(2,i):
while i%j == 0:
i = i//j
if j in list(d.keys()):
d[j] += 1
else:
d[j] = 1
if k == i:
d[i] = 1
ans = 1
for v in list(d.values()):
ans = ans*(v+1)%P
print(ans)
| def prime_factor(n):
ass = []
for i in range(2,int(n**0.5)+1):
while n%i == 0:
ass.append(i)
n = n//i
if n != 1:
ass.append(n)
return ass
n = int(eval(input()))
prime = []
for i in range(2, n+1):
prime = prime + prime_factor(i)
from collections import Counter
primec = Counter(prime)
ans = 1
primec_list = primec.most_common()
mod = 10**9+7
for p in primec_list:
ans = ans * (p[1]+1) % mod
print(ans) | 21 | 31 | 387 | 498 | N = int(eval(input()))
if N == 1:
print((1))
exit()
P = 10**9 + 7
d = {}
for i in range(2, N + 1):
k = i
for j in range(2, i):
while i % j == 0:
i = i // j
if j in list(d.keys()):
d[j] += 1
else:
d[j] = 1
if k == i:
d[i] = 1
ans = 1
for v in list(d.values()):
ans = ans * (v + 1) % P
print(ans)
| def prime_factor(n):
ass = []
for i in range(2, int(n**0.5) + 1):
while n % i == 0:
ass.append(i)
n = n // i
if n != 1:
ass.append(n)
return ass
n = int(eval(input()))
prime = []
for i in range(2, n + 1):
prime = prime + prime_factor(i)
from collections import Counter
primec = Counter(prime)
ans = 1
primec_list = primec.most_common()
mod = 10**9 + 7
for p in primec_list:
ans = ans * (p[1] + 1) % mod
print(ans)
| false | 32.258065 | [
"-N = int(eval(input()))",
"-if N == 1:",
"- print((1))",
"- exit()",
"-P = 10**9 + 7",
"-d = {}",
"-for i in range(2, N + 1):",
"- k = i",
"- for j in range(2, i):",
"- while i % j == 0:",
"- i = i // j",
"- if j in list(d.keys()):",
"- d[j] += 1",
"- else:",
"- d[j] = 1",
"- if k == i:",
"- d[i] = 1",
"+def prime_factor(n):",
"+ ass = []",
"+ for i in range(2, int(n**0.5) + 1):",
"+ while n % i == 0:",
"+ ass.append(i)",
"+ n = n // i",
"+ if n != 1:",
"+ ass.append(n)",
"+ return ass",
"+",
"+",
"+n = int(eval(input()))",
"+prime = []",
"+for i in range(2, n + 1):",
"+ prime = prime + prime_factor(i)",
"+from collections import Counter",
"+",
"+primec = Counter(prime)",
"-for v in list(d.values()):",
"- ans = ans * (v + 1) % P",
"+primec_list = primec.most_common()",
"+mod = 10**9 + 7",
"+for p in primec_list:",
"+ ans = ans * (p[1] + 1) % mod"
]
| false | 0.055032 | 0.044292 | 1.242488 | [
"s167424619",
"s963322170"
]
|
u906428167 | p02750 | python | s049947099 | s527802427 | 1,389 | 1,164 | 141,652 | 92,544 | Accepted | Accepted | 16.2 | from bisect import bisect_right
import sys
sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline
n, t = list(map(int, input().split()))
shop = []
shop_a0 = []
for i in range(n):
a, b = list(map(int, input().split()))
if a != 0:
shop.append([a, b, a/(b+1)])
else:
shop_a0.append(b)
shop = sorted(shop, key=lambda x: -x[2])
shop_a0 = sorted(shop_a0)
n = len(shop)
INF = 10**10
dp = [[INF for _ in range(30)] for __ in range(n+1)]
dp[0][0] = 0
m = min(n+1, 30)
for i in range(n):
for j in range(m):
dp[i+1][j] = min(dp[i][j], dp[i][j-1] + 1 +
shop[i][0]*(dp[i][j-1]+1) + shop[i][1])
dp[i+1][j-1] = min(dp[i+1][j-1], dp[i][j-1])
ss = []
if shop_a0:
ss.append(1+shop_a0[0])
for i in range(1, len(shop_a0)):
ss.append(ss[-1]+1+shop_a0[i])
ans = 0
for i in range(m):
if t - dp[n][i] >= 0:
ans = max(ans, bisect_right(ss, t-dp[n][i]) + i)
print(ans)
| from bisect import bisect_right
import sys
sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline
n, t = list(map(int, input().split()))
shop = []
shop_a0 = []
for i in range(n):
a, b = list(map(int, input().split()))
if a != 0:
shop.append([a, b, a/(b+1)])
else:
shop_a0.append(b)
shop = sorted(shop, key=lambda x: -x[2])
shop_a0 = sorted(shop_a0)
n = len(shop)
INF = 10**10
dp = [INF for _ in range(30)]
dp[0] = 0
m = min(n+1, 30)
for i in range(n):
for j in range(m)[::-1]:
dp[j] = min(dp[j], dp[j-1] + 1 +
shop[i][0]*(dp[j-1]+1) + shop[i][1])
ss = []
if shop_a0:
ss.append(1+shop_a0[0])
for i in range(1, len(shop_a0)):
ss.append(ss[-1]+1+shop_a0[i])
ans = 0
for i in range(m):
if t - dp[i] >= 0:
ans = max(ans, bisect_right(ss, t-dp[i]) + i)
print(ans)
| 48 | 47 | 995 | 901 | from bisect import bisect_right
import sys
sys.setrecursionlimit(10**7)
input = sys.stdin.readline
n, t = list(map(int, input().split()))
shop = []
shop_a0 = []
for i in range(n):
a, b = list(map(int, input().split()))
if a != 0:
shop.append([a, b, a / (b + 1)])
else:
shop_a0.append(b)
shop = sorted(shop, key=lambda x: -x[2])
shop_a0 = sorted(shop_a0)
n = len(shop)
INF = 10**10
dp = [[INF for _ in range(30)] for __ in range(n + 1)]
dp[0][0] = 0
m = min(n + 1, 30)
for i in range(n):
for j in range(m):
dp[i + 1][j] = min(
dp[i][j], dp[i][j - 1] + 1 + shop[i][0] * (dp[i][j - 1] + 1) + shop[i][1]
)
dp[i + 1][j - 1] = min(dp[i + 1][j - 1], dp[i][j - 1])
ss = []
if shop_a0:
ss.append(1 + shop_a0[0])
for i in range(1, len(shop_a0)):
ss.append(ss[-1] + 1 + shop_a0[i])
ans = 0
for i in range(m):
if t - dp[n][i] >= 0:
ans = max(ans, bisect_right(ss, t - dp[n][i]) + i)
print(ans)
| from bisect import bisect_right
import sys
sys.setrecursionlimit(10**7)
input = sys.stdin.readline
n, t = list(map(int, input().split()))
shop = []
shop_a0 = []
for i in range(n):
a, b = list(map(int, input().split()))
if a != 0:
shop.append([a, b, a / (b + 1)])
else:
shop_a0.append(b)
shop = sorted(shop, key=lambda x: -x[2])
shop_a0 = sorted(shop_a0)
n = len(shop)
INF = 10**10
dp = [INF for _ in range(30)]
dp[0] = 0
m = min(n + 1, 30)
for i in range(n):
for j in range(m)[::-1]:
dp[j] = min(dp[j], dp[j - 1] + 1 + shop[i][0] * (dp[j - 1] + 1) + shop[i][1])
ss = []
if shop_a0:
ss.append(1 + shop_a0[0])
for i in range(1, len(shop_a0)):
ss.append(ss[-1] + 1 + shop_a0[i])
ans = 0
for i in range(m):
if t - dp[i] >= 0:
ans = max(ans, bisect_right(ss, t - dp[i]) + i)
print(ans)
| false | 2.083333 | [
"-dp = [[INF for _ in range(30)] for __ in range(n + 1)]",
"-dp[0][0] = 0",
"+dp = [INF for _ in range(30)]",
"+dp[0] = 0",
"- for j in range(m):",
"- dp[i + 1][j] = min(",
"- dp[i][j], dp[i][j - 1] + 1 + shop[i][0] * (dp[i][j - 1] + 1) + shop[i][1]",
"- )",
"- dp[i + 1][j - 1] = min(dp[i + 1][j - 1], dp[i][j - 1])",
"+ for j in range(m)[::-1]:",
"+ dp[j] = min(dp[j], dp[j - 1] + 1 + shop[i][0] * (dp[j - 1] + 1) + shop[i][1])",
"- if t - dp[n][i] >= 0:",
"- ans = max(ans, bisect_right(ss, t - dp[n][i]) + i)",
"+ if t - dp[i] >= 0:",
"+ ans = max(ans, bisect_right(ss, t - dp[i]) + i)"
]
| false | 0.05116 | 0.050697 | 1.009131 | [
"s049947099",
"s527802427"
]
|
u327532412 | p02659 | python | s634582660 | s395839106 | 22 | 20 | 9,092 | 9,176 | Accepted | Accepted | 9.09 | A, B = input().split()
A = int(A)
B = round(float(B) * 100)
print((A * B // 100))
| A, B = input().split()
A = int(A)
B_int, B_frac = B.split('.')
new_b = int(B_int) * 100 + int(B_frac)
print((A * new_b // 100)) | 4 | 5 | 83 | 129 | A, B = input().split()
A = int(A)
B = round(float(B) * 100)
print((A * B // 100))
| A, B = input().split()
A = int(A)
B_int, B_frac = B.split(".")
new_b = int(B_int) * 100 + int(B_frac)
print((A * new_b // 100))
| false | 20 | [
"-B = round(float(B) * 100)",
"-print((A * B // 100))",
"+B_int, B_frac = B.split(\".\")",
"+new_b = int(B_int) * 100 + int(B_frac)",
"+print((A * new_b // 100))"
]
| false | 0.037693 | 0.047707 | 0.790078 | [
"s634582660",
"s395839106"
]
|
u723345499 | p02813 | python | s316705130 | s505299590 | 49 | 43 | 3,064 | 3,064 | Accepted | Accepted | 12.24 | import itertools
n = int(eval(input()))
p = list(map(int, input().split()))
q = list(map(int, input().split()))
list_ = list(range(1, n + 1))
for num ,v in enumerate(itertools.permutations(list_, n)):
if p == list(v):
res_p = num + 1
for num ,v in enumerate(itertools.permutations(list_, n)):
if q == list(v):
res_q = num + 1
ans = abs(res_p - res_q)
print(ans) | import itertools
n = int(eval(input()))
p = list(map(int, input().split()))
q = list(map(int, input().split()))
list_ = list(range(1, n + 1))
for num ,v in enumerate(itertools.permutations(list_, n)):
if p == list(v):
res_p = num + 1
break
for num ,v in enumerate(itertools.permutations(list_, n)):
if q == list(v):
res_q = num + 1
break
ans = abs(res_p - res_q)
print(ans) | 19 | 19 | 411 | 429 | import itertools
n = int(eval(input()))
p = list(map(int, input().split()))
q = list(map(int, input().split()))
list_ = list(range(1, n + 1))
for num, v in enumerate(itertools.permutations(list_, n)):
if p == list(v):
res_p = num + 1
for num, v in enumerate(itertools.permutations(list_, n)):
if q == list(v):
res_q = num + 1
ans = abs(res_p - res_q)
print(ans)
| import itertools
n = int(eval(input()))
p = list(map(int, input().split()))
q = list(map(int, input().split()))
list_ = list(range(1, n + 1))
for num, v in enumerate(itertools.permutations(list_, n)):
if p == list(v):
res_p = num + 1
break
for num, v in enumerate(itertools.permutations(list_, n)):
if q == list(v):
res_q = num + 1
break
ans = abs(res_p - res_q)
print(ans)
| false | 0 | [
"+ break",
"+ break"
]
| false | 0.112811 | 0.043891 | 2.570239 | [
"s316705130",
"s505299590"
]
|
u597455618 | p02971 | python | s563109849 | s343725432 | 869 | 538 | 70,360 | 14,112 | Accepted | Accepted | 38.09 | n = int(eval(input()))
a = [int(eval(input())) for _ in range(n)]
b = a[:]
b.sort(reverse=True)
for i in range(n):
if a[i] == b[0]:
print((b[1]))
else:
print((b[0])) | def main():
n = int(eval(input()))
a = [int(eval(input())) for _ in range(n)]
b = sorted(a)
for i in range(n):
if a[i] == b[-1]:
print((b[-2]))
else:
print((b[-1]))
main() | 9 | 11 | 169 | 211 | n = int(eval(input()))
a = [int(eval(input())) for _ in range(n)]
b = a[:]
b.sort(reverse=True)
for i in range(n):
if a[i] == b[0]:
print((b[1]))
else:
print((b[0]))
| def main():
n = int(eval(input()))
a = [int(eval(input())) for _ in range(n)]
b = sorted(a)
for i in range(n):
if a[i] == b[-1]:
print((b[-2]))
else:
print((b[-1]))
main()
| false | 18.181818 | [
"-n = int(eval(input()))",
"-a = [int(eval(input())) for _ in range(n)]",
"-b = a[:]",
"-b.sort(reverse=True)",
"-for i in range(n):",
"- if a[i] == b[0]:",
"- print((b[1]))",
"- else:",
"- print((b[0]))",
"+def main():",
"+ n = int(eval(input()))",
"+ a = [int(eval(input())) for _ in range(n)]",
"+ b = sorted(a)",
"+ for i in range(n):",
"+ if a[i] == b[-1]:",
"+ print((b[-2]))",
"+ else:",
"+ print((b[-1]))",
"+",
"+",
"+main()"
]
| false | 0.038759 | 0.069017 | 0.561588 | [
"s563109849",
"s343725432"
]
|
u001024152 | p03111 | python | s281434037 | s917470551 | 324 | 77 | 3,064 | 3,064 | Accepted | Accepted | 76.23 | # 8重for
# N,A,B,C = 5,100,90,80
# L = [98,40,30,21,80]
N,A,B,C = list(map(int, input().split()))
L = [int(eval(input())) for _ in range(N)]
ans = float('inf')
for i1 in range(4):
for i2 in range(4):
for i3 in range(4):
for i4 in range(4):
for i5 in range(4):
for i6 in range(4):
for i7 in range(4):
for i8 in range(4):
p = [i1,i2,i3,i4,i5,i6,i7,i8]
take = [[] for _ in range(4)] # [A,B,C,使わない]
for i in range(N):
take[p[i]].append(L[i])
a,b,c = take[0],take[1],take[2]
if len(a)*len(b)*len(c)==0:
continue
cost = (len(a)+len(b)+len(c)-3)*10
cost += abs(sum(a)-A)+abs(sum(b)-B)+abs(sum(c)-C)
ans = min(ans, cost)
print(ans) | # DFS
# N,A,B,C = 5,100,90,80
# L = [98,40,30,21,80]
N,A,B,C = list(map(int, input().split()))
L = [int(eval(input())) for _ in range(N)]
ans = float('inf')
def dfs(cur,a,b,c)->int:
if cur==N:
if min(a,b,c)>0: return abs(a-A)+abs(b-B)+abs(c-C)-30
else: return float('inf')
ret0 = dfs(cur+1, a, b, c)
ret1 = dfs(cur+1, a+L[cur],b, c) + 10
ret2 = dfs(cur+1, a, b+L[cur],c) + 10
ret3 = dfs(cur+1, a, b, c+L[cur]) + 10
return min(ret0, ret1, ret2, ret3)
print((dfs(0,0,0,0))) | 25 | 19 | 1,075 | 573 | # 8重for
# N,A,B,C = 5,100,90,80
# L = [98,40,30,21,80]
N, A, B, C = list(map(int, input().split()))
L = [int(eval(input())) for _ in range(N)]
ans = float("inf")
for i1 in range(4):
for i2 in range(4):
for i3 in range(4):
for i4 in range(4):
for i5 in range(4):
for i6 in range(4):
for i7 in range(4):
for i8 in range(4):
p = [i1, i2, i3, i4, i5, i6, i7, i8]
take = [[] for _ in range(4)] # [A,B,C,使わない]
for i in range(N):
take[p[i]].append(L[i])
a, b, c = take[0], take[1], take[2]
if len(a) * len(b) * len(c) == 0:
continue
cost = (len(a) + len(b) + len(c) - 3) * 10
cost += (
abs(sum(a) - A) + abs(sum(b) - B) + abs(sum(c) - C)
)
ans = min(ans, cost)
print(ans)
| # DFS
# N,A,B,C = 5,100,90,80
# L = [98,40,30,21,80]
N, A, B, C = list(map(int, input().split()))
L = [int(eval(input())) for _ in range(N)]
ans = float("inf")
def dfs(cur, a, b, c) -> int:
if cur == N:
if min(a, b, c) > 0:
return abs(a - A) + abs(b - B) + abs(c - C) - 30
else:
return float("inf")
ret0 = dfs(cur + 1, a, b, c)
ret1 = dfs(cur + 1, a + L[cur], b, c) + 10
ret2 = dfs(cur + 1, a, b + L[cur], c) + 10
ret3 = dfs(cur + 1, a, b, c + L[cur]) + 10
return min(ret0, ret1, ret2, ret3)
print((dfs(0, 0, 0, 0)))
| false | 24 | [
"-# 8重for",
"+# DFS",
"-for i1 in range(4):",
"- for i2 in range(4):",
"- for i3 in range(4):",
"- for i4 in range(4):",
"- for i5 in range(4):",
"- for i6 in range(4):",
"- for i7 in range(4):",
"- for i8 in range(4):",
"- p = [i1, i2, i3, i4, i5, i6, i7, i8]",
"- take = [[] for _ in range(4)] # [A,B,C,使わない]",
"- for i in range(N):",
"- take[p[i]].append(L[i])",
"- a, b, c = take[0], take[1], take[2]",
"- if len(a) * len(b) * len(c) == 0:",
"- continue",
"- cost = (len(a) + len(b) + len(c) - 3) * 10",
"- cost += (",
"- abs(sum(a) - A) + abs(sum(b) - B) + abs(sum(c) - C)",
"- )",
"- ans = min(ans, cost)",
"-print(ans)",
"+",
"+",
"+def dfs(cur, a, b, c) -> int:",
"+ if cur == N:",
"+ if min(a, b, c) > 0:",
"+ return abs(a - A) + abs(b - B) + abs(c - C) - 30",
"+ else:",
"+ return float(\"inf\")",
"+ ret0 = dfs(cur + 1, a, b, c)",
"+ ret1 = dfs(cur + 1, a + L[cur], b, c) + 10",
"+ ret2 = dfs(cur + 1, a, b + L[cur], c) + 10",
"+ ret3 = dfs(cur + 1, a, b, c + L[cur]) + 10",
"+ return min(ret0, ret1, ret2, ret3)",
"+",
"+",
"+print((dfs(0, 0, 0, 0)))"
]
| false | 0.416535 | 0.067178 | 6.2005 | [
"s281434037",
"s917470551"
]
|
u831244171 | p02269 | python | s503175907 | s368159715 | 4,230 | 1,160 | 37,316 | 112,344 | Accepted | Accepted | 72.58 | n = int(eval(input()))
dictionary = {}
for i in range(n):
a = input().split()
if a[0] == "insert":
dictionary[a[1]] = 0
if a[0] == "find":
if a[1] in dictionary:
print("yes")
else:
print("no") | import sys
n = int(eval(input()))
dictionary = {}
k = sys.stdin.readlines()
for j in k:
i = j.split()
if i[0] == "insert":
dictionary[i[1]] = 0
else:
if i[1] in dictionary:
print("yes")
else:
print("no")
| 11 | 17 | 257 | 286 | n = int(eval(input()))
dictionary = {}
for i in range(n):
a = input().split()
if a[0] == "insert":
dictionary[a[1]] = 0
if a[0] == "find":
if a[1] in dictionary:
print("yes")
else:
print("no")
| import sys
n = int(eval(input()))
dictionary = {}
k = sys.stdin.readlines()
for j in k:
i = j.split()
if i[0] == "insert":
dictionary[i[1]] = 0
else:
if i[1] in dictionary:
print("yes")
else:
print("no")
| false | 35.294118 | [
"+import sys",
"+",
"-for i in range(n):",
"- a = input().split()",
"- if a[0] == \"insert\":",
"- dictionary[a[1]] = 0",
"- if a[0] == \"find\":",
"- if a[1] in dictionary:",
"+k = sys.stdin.readlines()",
"+for j in k:",
"+ i = j.split()",
"+ if i[0] == \"insert\":",
"+ dictionary[i[1]] = 0",
"+ else:",
"+ if i[1] in dictionary:"
]
| false | 0.038024 | 0.037942 | 1.002143 | [
"s503175907",
"s368159715"
]
|
u391875425 | p03425 | python | s905503578 | s595002479 | 198 | 180 | 3,884 | 9,776 | Accepted | Accepted | 9.09 | n=int(eval(input()))
s=[]
m=0
a=0
r=0
c=0
h=0
for i in range(n):
b=str(eval(input()))[0]
if b=="M":m+=1
elif b=="A":a+=1
elif b=="R":r+=1
elif b=="C":c+=1
elif b=="H":h+=1
s.append(b)
ans=0
ans+=m*a*r
ans+=m*a*c
ans+=m*a*h
ans+=m*r*c
ans+=m*r*h
ans+=m*c*h
ans+=a*r*c
ans+=a*r*h
ans+=a*c*h
ans+=r*c*h
print(ans) | import itertools
N = int(eval(input()))
S = [eval(input()) for _ in range(N)]
caps = ['M', 'A', 'R', 'C', 'H']
a = [0] * 5
ans = 0
for s in S:
if s[0] in caps:
a[caps.index(s[0])] += 1
c = list(itertools.combinations((0, 1, 2, 3, 4), 3))
for i in range(len(c)):
ans += a[c[i][0]] * a[c[i][1]] * a[c[i][2]]
print(ans) | 29 | 13 | 347 | 332 | n = int(eval(input()))
s = []
m = 0
a = 0
r = 0
c = 0
h = 0
for i in range(n):
b = str(eval(input()))[0]
if b == "M":
m += 1
elif b == "A":
a += 1
elif b == "R":
r += 1
elif b == "C":
c += 1
elif b == "H":
h += 1
s.append(b)
ans = 0
ans += m * a * r
ans += m * a * c
ans += m * a * h
ans += m * r * c
ans += m * r * h
ans += m * c * h
ans += a * r * c
ans += a * r * h
ans += a * c * h
ans += r * c * h
print(ans)
| import itertools
N = int(eval(input()))
S = [eval(input()) for _ in range(N)]
caps = ["M", "A", "R", "C", "H"]
a = [0] * 5
ans = 0
for s in S:
if s[0] in caps:
a[caps.index(s[0])] += 1
c = list(itertools.combinations((0, 1, 2, 3, 4), 3))
for i in range(len(c)):
ans += a[c[i][0]] * a[c[i][1]] * a[c[i][2]]
print(ans)
| false | 55.172414 | [
"-n = int(eval(input()))",
"-s = []",
"-m = 0",
"-a = 0",
"-r = 0",
"-c = 0",
"-h = 0",
"-for i in range(n):",
"- b = str(eval(input()))[0]",
"- if b == \"M\":",
"- m += 1",
"- elif b == \"A\":",
"- a += 1",
"- elif b == \"R\":",
"- r += 1",
"- elif b == \"C\":",
"- c += 1",
"- elif b == \"H\":",
"- h += 1",
"- s.append(b)",
"+import itertools",
"+",
"+N = int(eval(input()))",
"+S = [eval(input()) for _ in range(N)]",
"+caps = [\"M\", \"A\", \"R\", \"C\", \"H\"]",
"+a = [0] * 5",
"-ans += m * a * r",
"-ans += m * a * c",
"-ans += m * a * h",
"-ans += m * r * c",
"-ans += m * r * h",
"-ans += m * c * h",
"-ans += a * r * c",
"-ans += a * r * h",
"-ans += a * c * h",
"-ans += r * c * h",
"+for s in S:",
"+ if s[0] in caps:",
"+ a[caps.index(s[0])] += 1",
"+c = list(itertools.combinations((0, 1, 2, 3, 4), 3))",
"+for i in range(len(c)):",
"+ ans += a[c[i][0]] * a[c[i][1]] * a[c[i][2]]"
]
| false | 0.047174 | 0.036358 | 1.297485 | [
"s905503578",
"s595002479"
]
|
u573970531 | p03078 | python | s260924858 | s280084791 | 1,102 | 759 | 272,408 | 143,844 | Accepted | Accepted | 31.13 | import itertools
x,y,z,k = list(map(int, input().split()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
c = list(map(int, input().split()))
a.sort(reverse=True)
b.sort(reverse=True)
c.sort(reverse=True)
del a[min(k,x):]
del b[min(k,y):]
del c[min(k,z):]
ab = [i + j for (i, j) in list(itertools.product(a, b))]
ab.sort(reverse=True)
del ab[min(k,x*y):]
abc = [ij + h for (ij, h) in list(itertools.product(ab, c))]
abc.sort(reverse=True)
for g in range(k):
print((abc[g])) | x,y,z,k=list(map(int,input().split()))
a=list(map(int,input().split()))
b=list(map(int,input().split()))
c=list(map(int,input().split()))
li=[]
for i in a:
for j in b:
li.append(i+j)
li.sort(reverse=True)
ansli=[]
for i in c:
for j in range(min(k,len(li))):
ansli.append(i+li[j])
ansli.sort(reverse=True)
for i in range(k):
print((ansli[i])) | 24 | 19 | 534 | 376 | import itertools
x, y, z, k = list(map(int, input().split()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
c = list(map(int, input().split()))
a.sort(reverse=True)
b.sort(reverse=True)
c.sort(reverse=True)
del a[min(k, x) :]
del b[min(k, y) :]
del c[min(k, z) :]
ab = [i + j for (i, j) in list(itertools.product(a, b))]
ab.sort(reverse=True)
del ab[min(k, x * y) :]
abc = [ij + h for (ij, h) in list(itertools.product(ab, c))]
abc.sort(reverse=True)
for g in range(k):
print((abc[g]))
| x, y, z, k = list(map(int, input().split()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
c = list(map(int, input().split()))
li = []
for i in a:
for j in b:
li.append(i + j)
li.sort(reverse=True)
ansli = []
for i in c:
for j in range(min(k, len(li))):
ansli.append(i + li[j])
ansli.sort(reverse=True)
for i in range(k):
print((ansli[i]))
| false | 20.833333 | [
"-import itertools",
"-",
"-a.sort(reverse=True)",
"-b.sort(reverse=True)",
"-c.sort(reverse=True)",
"-del a[min(k, x) :]",
"-del b[min(k, y) :]",
"-del c[min(k, z) :]",
"-ab = [i + j for (i, j) in list(itertools.product(a, b))]",
"-ab.sort(reverse=True)",
"-del ab[min(k, x * y) :]",
"-abc = [ij + h for (ij, h) in list(itertools.product(ab, c))]",
"-abc.sort(reverse=True)",
"-for g in range(k):",
"- print((abc[g]))",
"+li = []",
"+for i in a:",
"+ for j in b:",
"+ li.append(i + j)",
"+li.sort(reverse=True)",
"+ansli = []",
"+for i in c:",
"+ for j in range(min(k, len(li))):",
"+ ansli.append(i + li[j])",
"+ansli.sort(reverse=True)",
"+for i in range(k):",
"+ print((ansli[i]))"
]
| false | 0.044359 | 0.094606 | 0.468878 | [
"s260924858",
"s280084791"
]
|
u120691615 | p03264 | python | s442808553 | s638574498 | 19 | 17 | 2,940 | 2,940 | Accepted | Accepted | 10.53 | n = int(eval(input()))
if n % 2 == 0:
ans = int((n // 2) ** 2)
else:
ans = int(n // 2) * (n // 2 + 1)
print(ans) | n = int(eval(input()))
a = (n + 1) // 2
b = n // 2
print((a * b))
| 6 | 4 | 119 | 61 | n = int(eval(input()))
if n % 2 == 0:
ans = int((n // 2) ** 2)
else:
ans = int(n // 2) * (n // 2 + 1)
print(ans)
| n = int(eval(input()))
a = (n + 1) // 2
b = n // 2
print((a * b))
| false | 33.333333 | [
"-if n % 2 == 0:",
"- ans = int((n // 2) ** 2)",
"-else:",
"- ans = int(n // 2) * (n // 2 + 1)",
"-print(ans)",
"+a = (n + 1) // 2",
"+b = n // 2",
"+print((a * b))"
]
| false | 0.045157 | 0.043463 | 1.038975 | [
"s442808553",
"s638574498"
]
|
u150984829 | p00040 | python | s645177884 | s159316042 | 240 | 30 | 5,600 | 5,600 | Accepted | Accepted | 87.5 | z='abcdefghijklmnopqrstuvwxyz'
e=lambda x,i,j:z[(z.index(x)*i+j)%26]
def f():
for i in range(1,26,2):
for j in range(26):
if''.join(e(c,i,j)for c in'that')in s or''.join(e(c,i,j)for c in'this')in s:return(i,j)
for _ in[0]*int(eval(input())):
s=eval(input())
a=''.join(e(c,*f())for c in z)
t=str.maketrans(a,z)
print((s.translate(t)))
| z='abcdefghijklmnopqrstuvwxyz'
e=lambda x,i,j:z[(z.index(x)*i+j)%26]
def f():
for i in range(1,26,2):
for j in range(26):
if''.join(e(c,i,j)for c in'that')in s or''.join(e(c,i,j)for c in'this')in s:return(i,j)
for _ in[0]*int(eval(input())):
s=eval(input())
k=f()
a=''.join(e(c,*k)for c in z)
t=str.maketrans(a,z)
print((s.translate(t)))
| 11 | 12 | 340 | 346 | z = "abcdefghijklmnopqrstuvwxyz"
e = lambda x, i, j: z[(z.index(x) * i + j) % 26]
def f():
for i in range(1, 26, 2):
for j in range(26):
if (
"".join(e(c, i, j) for c in "that") in s
or "".join(e(c, i, j) for c in "this") in s
):
return (i, j)
for _ in [0] * int(eval(input())):
s = eval(input())
a = "".join(e(c, *f()) for c in z)
t = str.maketrans(a, z)
print((s.translate(t)))
| z = "abcdefghijklmnopqrstuvwxyz"
e = lambda x, i, j: z[(z.index(x) * i + j) % 26]
def f():
for i in range(1, 26, 2):
for j in range(26):
if (
"".join(e(c, i, j) for c in "that") in s
or "".join(e(c, i, j) for c in "this") in s
):
return (i, j)
for _ in [0] * int(eval(input())):
s = eval(input())
k = f()
a = "".join(e(c, *k) for c in z)
t = str.maketrans(a, z)
print((s.translate(t)))
| false | 8.333333 | [
"- a = \"\".join(e(c, *f()) for c in z)",
"+ k = f()",
"+ a = \"\".join(e(c, *k) for c in z)"
]
| false | 0.042524 | 0.070809 | 0.600541 | [
"s645177884",
"s159316042"
]
|
u970197315 | p03457 | python | s281353701 | s335116642 | 580 | 428 | 38,344 | 19,572 | Accepted | Accepted | 26.21 | # ABC086 C - Traveling
import numpy as np
n = int(eval(input()))
l = [list(map(int,input().split())) for _ in range(n)]
if n == 1:
if l[0][0] >= l[0][1]+l[0][2]:
if l[0][0]%2 == (l[0][1]+l[0][2])%2:
pass
else:
print('No')
exit()
else:
print('No')
exit()
for i in range(n-1):
t = l[i+1][0]-l[i][0]
x = abs(l[i+1][1]-l[i][1])
y = abs(l[i+1][2]-l[i][2])
if t >= x+y:
if t%2 == (x+y)%2:
pass
else:
print('No')
exit()
else:
print('No')
exit()
print('Yes') | n=int(eval(input()))
l=[]
for i in range(n):
t,x,y=list(map(int,input().split()))
l.append([t,x,y])
if n==1:
d=l[0][1]+l[0][2]
tt=l[0][0]
if tt%2==1:
if d<=tt and d%2==1:
print('Yes')
exit()
else:
print('No')
exit()
elif tt%2==0:
if d<=tt and d%2==0:
print('Yes')
exit()
else:
print('No')
exit()
for i in range(n-1):
d=abs(l[i+1][1]-l[i][1])+abs(l[i+1][2]-l[i][2])
tt=l[i+1][0]-l[i][0]
if tt%2==1:
if d<=tt and d%2==1:
continue
else:
print('No')
exit()
elif tt%2==0:
if d<=tt and d%2==0:
continue
else:
print('No')
exit()
print('Yes') | 29 | 40 | 645 | 835 | # ABC086 C - Traveling
import numpy as np
n = int(eval(input()))
l = [list(map(int, input().split())) for _ in range(n)]
if n == 1:
if l[0][0] >= l[0][1] + l[0][2]:
if l[0][0] % 2 == (l[0][1] + l[0][2]) % 2:
pass
else:
print("No")
exit()
else:
print("No")
exit()
for i in range(n - 1):
t = l[i + 1][0] - l[i][0]
x = abs(l[i + 1][1] - l[i][1])
y = abs(l[i + 1][2] - l[i][2])
if t >= x + y:
if t % 2 == (x + y) % 2:
pass
else:
print("No")
exit()
else:
print("No")
exit()
print("Yes")
| n = int(eval(input()))
l = []
for i in range(n):
t, x, y = list(map(int, input().split()))
l.append([t, x, y])
if n == 1:
d = l[0][1] + l[0][2]
tt = l[0][0]
if tt % 2 == 1:
if d <= tt and d % 2 == 1:
print("Yes")
exit()
else:
print("No")
exit()
elif tt % 2 == 0:
if d <= tt and d % 2 == 0:
print("Yes")
exit()
else:
print("No")
exit()
for i in range(n - 1):
d = abs(l[i + 1][1] - l[i][1]) + abs(l[i + 1][2] - l[i][2])
tt = l[i + 1][0] - l[i][0]
if tt % 2 == 1:
if d <= tt and d % 2 == 1:
continue
else:
print("No")
exit()
elif tt % 2 == 0:
if d <= tt and d % 2 == 0:
continue
else:
print("No")
exit()
print("Yes")
| false | 27.5 | [
"-# ABC086 C - Traveling",
"-import numpy as np",
"-",
"-l = [list(map(int, input().split())) for _ in range(n)]",
"+l = []",
"+for i in range(n):",
"+ t, x, y = list(map(int, input().split()))",
"+ l.append([t, x, y])",
"- if l[0][0] >= l[0][1] + l[0][2]:",
"- if l[0][0] % 2 == (l[0][1] + l[0][2]) % 2:",
"- pass",
"+ d = l[0][1] + l[0][2]",
"+ tt = l[0][0]",
"+ if tt % 2 == 1:",
"+ if d <= tt and d % 2 == 1:",
"+ print(\"Yes\")",
"+ exit()",
"- else:",
"- print(\"No\")",
"- exit()",
"-for i in range(n - 1):",
"- t = l[i + 1][0] - l[i][0]",
"- x = abs(l[i + 1][1] - l[i][1])",
"- y = abs(l[i + 1][2] - l[i][2])",
"- if t >= x + y:",
"- if t % 2 == (x + y) % 2:",
"- pass",
"+ elif tt % 2 == 0:",
"+ if d <= tt and d % 2 == 0:",
"+ print(\"Yes\")",
"+ exit()",
"- else:",
"- print(\"No\")",
"- exit()",
"+for i in range(n - 1):",
"+ d = abs(l[i + 1][1] - l[i][1]) + abs(l[i + 1][2] - l[i][2])",
"+ tt = l[i + 1][0] - l[i][0]",
"+ if tt % 2 == 1:",
"+ if d <= tt and d % 2 == 1:",
"+ continue",
"+ else:",
"+ print(\"No\")",
"+ exit()",
"+ elif tt % 2 == 0:",
"+ if d <= tt and d % 2 == 0:",
"+ continue",
"+ else:",
"+ print(\"No\")",
"+ exit()"
]
| false | 0.038576 | 0.043998 | 0.876766 | [
"s281353701",
"s335116642"
]
|
u493520238 | p02873 | python | s019719731 | s794598658 | 267 | 92 | 23,836 | 85,392 | Accepted | Accepted | 65.54 |
import math
def main():
s = str(eval(input()))
first = s[0]
cnt_l = []
tmp_cnt = 1
prev_s = first
for curr_s in s[1:]:
if prev_s != curr_s:
cnt_l.append(tmp_cnt)
tmp_cnt = 1
else:
tmp_cnt+=1
prev_s = curr_s
cnt_l.append(tmp_cnt)
ans_l = []
last_num = 0
if first == '>':
down_cnt = cnt_l[0]
for d in range(down_cnt):
ans_l.append(down_cnt-d)
cnt_l = cnt_l[1:]
# if first == '<':
# print(cnt_l)
ans_l.append(0)
last_num = 0
for i in range(math.ceil(len(cnt_l)/2)):
# print('i',i)
up_cnt = cnt_l[i*2]
if i*2+1 >= len(cnt_l):
down_cnt = 0
else:
down_cnt = cnt_l[i*2+1]
# print(up_cnt,down_cnt)
# print()
for u in range(up_cnt):
if u != up_cnt-1:
last_num+=1
ans_l.append(last_num)
else:
last_num = max(last_num+1, down_cnt)
ans_l.append(last_num)
for d in range(down_cnt):
if d==0:
if last_num > down_cnt:
last_num = down_cnt-1
else:
last_num-=1
ans_l.append(last_num)
else:
last_num-=1
ans_l.append(last_num)
# print(ans_l)
print((sum(ans_l)))
if __name__ == "__main__":
main() | s = eval(input())
s += 'a'
cnts = []
prev = s[0]
cnt = 1
for i,si in enumerate(s[1:]):
if prev == si:
cnt += 1
else:
cnts.append(cnt)
cnt = 1
prev = si
ans = 0
c_num = 0
if s[0] == '<':
for i,c in enumerate(cnts):
if i%2 == 0:
ans += c*(c-1)//2
c_num = c-1
else:
ans += c*(c-1)//2
ans += max(c,c_num+1)
if s[-2] == '<':
ans += cnts[-1]
# print(cnts[-1])
print(ans)
if s[0] == '>':
ans = cnts[0]*(cnts[0]+1)//2
for i,c in enumerate(cnts[1:]):
if i%2 == 0:
ans += c*(c-1)//2
c_num = c-1
else:
ans += c*(c-1)//2
ans += max(c,c_num+1)
if s[-2] == '<':
ans += cnts[-1]
print(ans)
# print(cnts) | 62 | 44 | 1,521 | 854 | import math
def main():
s = str(eval(input()))
first = s[0]
cnt_l = []
tmp_cnt = 1
prev_s = first
for curr_s in s[1:]:
if prev_s != curr_s:
cnt_l.append(tmp_cnt)
tmp_cnt = 1
else:
tmp_cnt += 1
prev_s = curr_s
cnt_l.append(tmp_cnt)
ans_l = []
last_num = 0
if first == ">":
down_cnt = cnt_l[0]
for d in range(down_cnt):
ans_l.append(down_cnt - d)
cnt_l = cnt_l[1:]
# if first == '<':
# print(cnt_l)
ans_l.append(0)
last_num = 0
for i in range(math.ceil(len(cnt_l) / 2)):
# print('i',i)
up_cnt = cnt_l[i * 2]
if i * 2 + 1 >= len(cnt_l):
down_cnt = 0
else:
down_cnt = cnt_l[i * 2 + 1]
# print(up_cnt,down_cnt)
# print()
for u in range(up_cnt):
if u != up_cnt - 1:
last_num += 1
ans_l.append(last_num)
else:
last_num = max(last_num + 1, down_cnt)
ans_l.append(last_num)
for d in range(down_cnt):
if d == 0:
if last_num > down_cnt:
last_num = down_cnt - 1
else:
last_num -= 1
ans_l.append(last_num)
else:
last_num -= 1
ans_l.append(last_num)
# print(ans_l)
print((sum(ans_l)))
if __name__ == "__main__":
main()
| s = eval(input())
s += "a"
cnts = []
prev = s[0]
cnt = 1
for i, si in enumerate(s[1:]):
if prev == si:
cnt += 1
else:
cnts.append(cnt)
cnt = 1
prev = si
ans = 0
c_num = 0
if s[0] == "<":
for i, c in enumerate(cnts):
if i % 2 == 0:
ans += c * (c - 1) // 2
c_num = c - 1
else:
ans += c * (c - 1) // 2
ans += max(c, c_num + 1)
if s[-2] == "<":
ans += cnts[-1]
# print(cnts[-1])
print(ans)
if s[0] == ">":
ans = cnts[0] * (cnts[0] + 1) // 2
for i, c in enumerate(cnts[1:]):
if i % 2 == 0:
ans += c * (c - 1) // 2
c_num = c - 1
else:
ans += c * (c - 1) // 2
ans += max(c, c_num + 1)
if s[-2] == "<":
ans += cnts[-1]
print(ans)
# print(cnts)
| false | 29.032258 | [
"-import math",
"-",
"-",
"-def main():",
"- s = str(eval(input()))",
"- first = s[0]",
"- cnt_l = []",
"- tmp_cnt = 1",
"- prev_s = first",
"- for curr_s in s[1:]:",
"- if prev_s != curr_s:",
"- cnt_l.append(tmp_cnt)",
"- tmp_cnt = 1",
"+s = eval(input())",
"+s += \"a\"",
"+cnts = []",
"+prev = s[0]",
"+cnt = 1",
"+for i, si in enumerate(s[1:]):",
"+ if prev == si:",
"+ cnt += 1",
"+ else:",
"+ cnts.append(cnt)",
"+ cnt = 1",
"+ prev = si",
"+ans = 0",
"+c_num = 0",
"+if s[0] == \"<\":",
"+ for i, c in enumerate(cnts):",
"+ if i % 2 == 0:",
"+ ans += c * (c - 1) // 2",
"+ c_num = c - 1",
"- tmp_cnt += 1",
"- prev_s = curr_s",
"- cnt_l.append(tmp_cnt)",
"- ans_l = []",
"- last_num = 0",
"- if first == \">\":",
"- down_cnt = cnt_l[0]",
"- for d in range(down_cnt):",
"- ans_l.append(down_cnt - d)",
"- cnt_l = cnt_l[1:]",
"- # if first == '<':",
"- # print(cnt_l)",
"- ans_l.append(0)",
"- last_num = 0",
"- for i in range(math.ceil(len(cnt_l) / 2)):",
"- # print('i',i)",
"- up_cnt = cnt_l[i * 2]",
"- if i * 2 + 1 >= len(cnt_l):",
"- down_cnt = 0",
"+ ans += c * (c - 1) // 2",
"+ ans += max(c, c_num + 1)",
"+ if s[-2] == \"<\":",
"+ ans += cnts[-1]",
"+ # print(cnts[-1])",
"+ print(ans)",
"+if s[0] == \">\":",
"+ ans = cnts[0] * (cnts[0] + 1) // 2",
"+ for i, c in enumerate(cnts[1:]):",
"+ if i % 2 == 0:",
"+ ans += c * (c - 1) // 2",
"+ c_num = c - 1",
"- down_cnt = cnt_l[i * 2 + 1]",
"- # print(up_cnt,down_cnt)",
"- # print()",
"- for u in range(up_cnt):",
"- if u != up_cnt - 1:",
"- last_num += 1",
"- ans_l.append(last_num)",
"- else:",
"- last_num = max(last_num + 1, down_cnt)",
"- ans_l.append(last_num)",
"- for d in range(down_cnt):",
"- if d == 0:",
"- if last_num > down_cnt:",
"- last_num = down_cnt - 1",
"- else:",
"- last_num -= 1",
"- ans_l.append(last_num)",
"- else:",
"- last_num -= 1",
"- ans_l.append(last_num)",
"- # print(ans_l)",
"- print((sum(ans_l)))",
"-",
"-",
"-if __name__ == \"__main__\":",
"- main()",
"+ ans += c * (c - 1) // 2",
"+ ans += max(c, c_num + 1)",
"+ if s[-2] == \"<\":",
"+ ans += cnts[-1]",
"+ print(ans)",
"+# print(cnts)"
]
| false | 0.046342 | 0.037808 | 1.225725 | [
"s019719731",
"s794598658"
]
|
u189023301 | p02954 | python | s303195291 | s328095245 | 188 | 133 | 31,328 | 6,400 | Accepted | Accepted | 29.26 | s = eval(input())
n = len(s)
tp = []
rl = [1]
for i in range(1, n):
if s[i] == s[i - 1]:
rl[-1] += 1
elif s[i - 1] == "R" and s[i] == "L":
tp.append((i - 1, i))
rl.append(1)
else:
rl.append(1)
rll = tuple(zip(rl[::2], rl[1::2]))
#print(rll,tp)
inl = []
for i, j in rll:
if (i%2 == 0 and j%2 == 0) or (i%2 == 1 and j%2 == 1):
x, y = (i+j)//2, (i+j)//2
inl.append((x,y))
elif i % 2 == 1 and j % 2 == 0:
x, y = (i+j)//2+1, (i+j)//2
inl.append((x,y))
else:
x, y = (i+j)//2, (i+j)//2+1
inl.append((x,y))
#print(inl)
inpt = dict()
for i, k in enumerate(tp):
inpt[k[0]] = inl[i][0]
inpt[k[1]] = inl[i][1]
#print(inpt)
res = []
for i in range(n):
res.append(inpt.get(i, 0))
print((" ".join([str(i) for i in res])))
| s = eval(input())
n = len(s)
chd = [0] * n
cnt = 0
for i in range(n - 1):
if s[i] == "R":
cnt += 1
if s[i + 1] == "L":
chd[i] += (cnt+1)//2
chd[i + 1] += cnt//2
cnt = 0
for i in range(n - 1, 0, -1):
if s[i] == "L":
cnt += 1
if s[i - 1] == "R":
chd[i] += (cnt+1)//2
chd[i - 1] += cnt//2
cnt = 0
print((*chd))
| 37 | 22 | 853 | 436 | s = eval(input())
n = len(s)
tp = []
rl = [1]
for i in range(1, n):
if s[i] == s[i - 1]:
rl[-1] += 1
elif s[i - 1] == "R" and s[i] == "L":
tp.append((i - 1, i))
rl.append(1)
else:
rl.append(1)
rll = tuple(zip(rl[::2], rl[1::2]))
# print(rll,tp)
inl = []
for i, j in rll:
if (i % 2 == 0 and j % 2 == 0) or (i % 2 == 1 and j % 2 == 1):
x, y = (i + j) // 2, (i + j) // 2
inl.append((x, y))
elif i % 2 == 1 and j % 2 == 0:
x, y = (i + j) // 2 + 1, (i + j) // 2
inl.append((x, y))
else:
x, y = (i + j) // 2, (i + j) // 2 + 1
inl.append((x, y))
# print(inl)
inpt = dict()
for i, k in enumerate(tp):
inpt[k[0]] = inl[i][0]
inpt[k[1]] = inl[i][1]
# print(inpt)
res = []
for i in range(n):
res.append(inpt.get(i, 0))
print((" ".join([str(i) for i in res])))
| s = eval(input())
n = len(s)
chd = [0] * n
cnt = 0
for i in range(n - 1):
if s[i] == "R":
cnt += 1
if s[i + 1] == "L":
chd[i] += (cnt + 1) // 2
chd[i + 1] += cnt // 2
cnt = 0
for i in range(n - 1, 0, -1):
if s[i] == "L":
cnt += 1
if s[i - 1] == "R":
chd[i] += (cnt + 1) // 2
chd[i - 1] += cnt // 2
cnt = 0
print((*chd))
| false | 40.540541 | [
"-tp = []",
"-rl = [1]",
"-for i in range(1, n):",
"- if s[i] == s[i - 1]:",
"- rl[-1] += 1",
"- elif s[i - 1] == \"R\" and s[i] == \"L\":",
"- tp.append((i - 1, i))",
"- rl.append(1)",
"- else:",
"- rl.append(1)",
"-rll = tuple(zip(rl[::2], rl[1::2]))",
"-# print(rll,tp)",
"-inl = []",
"-for i, j in rll:",
"- if (i % 2 == 0 and j % 2 == 0) or (i % 2 == 1 and j % 2 == 1):",
"- x, y = (i + j) // 2, (i + j) // 2",
"- inl.append((x, y))",
"- elif i % 2 == 1 and j % 2 == 0:",
"- x, y = (i + j) // 2 + 1, (i + j) // 2",
"- inl.append((x, y))",
"- else:",
"- x, y = (i + j) // 2, (i + j) // 2 + 1",
"- inl.append((x, y))",
"-# print(inl)",
"-inpt = dict()",
"-for i, k in enumerate(tp):",
"- inpt[k[0]] = inl[i][0]",
"- inpt[k[1]] = inl[i][1]",
"-# print(inpt)",
"-res = []",
"-for i in range(n):",
"- res.append(inpt.get(i, 0))",
"-print((\" \".join([str(i) for i in res])))",
"+chd = [0] * n",
"+cnt = 0",
"+for i in range(n - 1):",
"+ if s[i] == \"R\":",
"+ cnt += 1",
"+ if s[i + 1] == \"L\":",
"+ chd[i] += (cnt + 1) // 2",
"+ chd[i + 1] += cnt // 2",
"+ cnt = 0",
"+for i in range(n - 1, 0, -1):",
"+ if s[i] == \"L\":",
"+ cnt += 1",
"+ if s[i - 1] == \"R\":",
"+ chd[i] += (cnt + 1) // 2",
"+ chd[i - 1] += cnt // 2",
"+ cnt = 0",
"+print((*chd))"
]
| false | 0.036089 | 0.036737 | 0.982364 | [
"s303195291",
"s328095245"
]
|
u219417113 | p03546 | python | s521811573 | s571586987 | 198 | 37 | 40,284 | 3,316 | Accepted | Accepted | 81.31 | H, W = list(map(int, input().split()))
C = [list(map(int, input().split())) for _ in range(10)]
wall = [list(map(int, input().split())) for _ in range(H)]
for k in range(10):
for i in range(10):
for j in range(10):
C[i][j] = min(C[i][j], C[i][k] + C[k][j])
ans = 0
for i in range(H):
for j in range(W):
if wall[i][j] != -1:
ans += C[wall[i][j]][1]
print(ans)
| H, W = list(map(int, input().split()))
C = [list(map(int, input().split())) for _ in range(10)]
A = [list(map(int, input().split())) for _ in range(H)]
for k in range(10):
for i in range(10):
for j in range(10):
C[i][j] = min(C[i][j], C[i][k] + C[k][j])
ans = 0
for h in range(H):
for w in range(W):
a = A[h][w]
if a != -1:
ans += C[a][1]
print(ans)
| 14 | 16 | 415 | 417 | H, W = list(map(int, input().split()))
C = [list(map(int, input().split())) for _ in range(10)]
wall = [list(map(int, input().split())) for _ in range(H)]
for k in range(10):
for i in range(10):
for j in range(10):
C[i][j] = min(C[i][j], C[i][k] + C[k][j])
ans = 0
for i in range(H):
for j in range(W):
if wall[i][j] != -1:
ans += C[wall[i][j]][1]
print(ans)
| H, W = list(map(int, input().split()))
C = [list(map(int, input().split())) for _ in range(10)]
A = [list(map(int, input().split())) for _ in range(H)]
for k in range(10):
for i in range(10):
for j in range(10):
C[i][j] = min(C[i][j], C[i][k] + C[k][j])
ans = 0
for h in range(H):
for w in range(W):
a = A[h][w]
if a != -1:
ans += C[a][1]
print(ans)
| false | 12.5 | [
"-wall = [list(map(int, input().split())) for _ in range(H)]",
"+A = [list(map(int, input().split())) for _ in range(H)]",
"-for i in range(H):",
"- for j in range(W):",
"- if wall[i][j] != -1:",
"- ans += C[wall[i][j]][1]",
"+for h in range(H):",
"+ for w in range(W):",
"+ a = A[h][w]",
"+ if a != -1:",
"+ ans += C[a][1]"
]
| false | 0.06766 | 0.054041 | 1.252017 | [
"s521811573",
"s571586987"
]
|
u698176039 | p03107 | python | s471731518 | s504482146 | 196 | 55 | 3,396 | 3,956 | Accepted | Accepted | 71.94 | S = eval(input())
N=len(S)
S2 = S[0]
count = 0
for i in range(1,N):
S2 += S[i]
while len(S2) > 1 and S2[len(S2)-1] != S2[len(S2)-2] :
S2 = S2[:len(S2)-2]
count += 2
print(count) |
S = list(eval(input()))
N = len(S)
num = [0,0]
for s in S:
num[int(s)] += 1
print((N-(max(num)-min(num)))) | 12 | 8 | 216 | 115 | S = eval(input())
N = len(S)
S2 = S[0]
count = 0
for i in range(1, N):
S2 += S[i]
while len(S2) > 1 and S2[len(S2) - 1] != S2[len(S2) - 2]:
S2 = S2[: len(S2) - 2]
count += 2
print(count)
| S = list(eval(input()))
N = len(S)
num = [0, 0]
for s in S:
num[int(s)] += 1
print((N - (max(num) - min(num))))
| false | 33.333333 | [
"-S = eval(input())",
"+S = list(eval(input()))",
"-S2 = S[0]",
"-count = 0",
"-for i in range(1, N):",
"- S2 += S[i]",
"- while len(S2) > 1 and S2[len(S2) - 1] != S2[len(S2) - 2]:",
"- S2 = S2[: len(S2) - 2]",
"- count += 2",
"-print(count)",
"+num = [0, 0]",
"+for s in S:",
"+ num[int(s)] += 1",
"+print((N - (max(num) - min(num))))"
]
| false | 0.052856 | 0.033418 | 1.581658 | [
"s471731518",
"s504482146"
]
|
u697696097 | p03964 | python | s907166507 | s606078676 | 46 | 20 | 5,628 | 3,064 | Accepted | Accepted | 56.52 | ### ----------------
### ここから
### ----------------
import sys
from io import StringIO
import unittest
def yn(b):
print(("Yes" if b==1 else "No"))
return
def resolve():
readline=sys.stdin.readline
#a,b,c=map(int, readline().rstrip().split())
#arr=list(map(int, readline().rstrip().split()))
n=int(readline())
for i in range(n):
x,y=list(map(int, readline().rstrip().split()))
if i==0:
a,b=x,y
continue
start=max(a//x,b//y)
zz=start-1
for z in range(start,start+1000):
if x*z>=a and y*z>=b:
zz=z
break
a,b=x*z,y*z
print((a+b))
#ss=readline().rstrip()
#yn(1)
return
if 'doTest' not in globals():
resolve()
sys.exit()
### ----------------
### ここまで
### ----------------
| import sys
def resolve():
readline=sys.stdin.readline
n=int(readline())
a,b=list(map(int, readline().rstrip().split()))
for _ in range(n-1):
x,y=list(map(int, readline().rstrip().split()))
start=max(a//x,b//y)
for z in range(start,start+1000):
if x*z>=a and y*z>=b:
a,b=x*z,y*z
break
print((a+b))
return
if 'doTest' not in globals():
resolve()
sys.exit() | 43 | 21 | 873 | 464 | ### ----------------
### ここから
### ----------------
import sys
from io import StringIO
import unittest
def yn(b):
print(("Yes" if b == 1 else "No"))
return
def resolve():
readline = sys.stdin.readline
# a,b,c=map(int, readline().rstrip().split())
# arr=list(map(int, readline().rstrip().split()))
n = int(readline())
for i in range(n):
x, y = list(map(int, readline().rstrip().split()))
if i == 0:
a, b = x, y
continue
start = max(a // x, b // y)
zz = start - 1
for z in range(start, start + 1000):
if x * z >= a and y * z >= b:
zz = z
break
a, b = x * z, y * z
print((a + b))
# ss=readline().rstrip()
# yn(1)
return
if "doTest" not in globals():
resolve()
sys.exit()
### ----------------
### ここまで
### ----------------
| import sys
def resolve():
readline = sys.stdin.readline
n = int(readline())
a, b = list(map(int, readline().rstrip().split()))
for _ in range(n - 1):
x, y = list(map(int, readline().rstrip().split()))
start = max(a // x, b // y)
for z in range(start, start + 1000):
if x * z >= a and y * z >= b:
a, b = x * z, y * z
break
print((a + b))
return
if "doTest" not in globals():
resolve()
sys.exit()
| false | 51.162791 | [
"-### ここから",
"-from io import StringIO",
"-import unittest",
"-",
"-",
"-def yn(b):",
"- print((\"Yes\" if b == 1 else \"No\"))",
"- return",
"- # a,b,c=map(int, readline().rstrip().split())",
"- # arr=list(map(int, readline().rstrip().split()))",
"- for i in range(n):",
"+ a, b = list(map(int, readline().rstrip().split()))",
"+ for _ in range(n - 1):",
"- if i == 0:",
"- a, b = x, y",
"- continue",
"- zz = start - 1",
"- zz = z",
"+ a, b = x * z, y * z",
"- a, b = x * z, y * z",
"- # ss=readline().rstrip()",
"- # yn(1)",
"-### ここまで"
]
| false | 0.053341 | 0.036767 | 1.450781 | [
"s907166507",
"s606078676"
]
|
u326609687 | p03096 | python | s914136971 | s255820377 | 614 | 290 | 31,200 | 29,804 | Accepted | Accepted | 52.77 | import sys
from collections import defaultdict
N = int(eval(input()))
C = [0]
for _ in range(N):
c = int(sys.stdin.readline())
if C[-1] == c:
continue
else:
C.append(c)
ans = 1
dic = defaultdict(lambda: 0)
for c in C:
a = dic[c]
dic[c] += ans
ans += a
print((ans % (10 ** 9 + 7))) | import sys
from collections import defaultdict
N = int(eval(input()))
C = [0]
for _ in range(N):
c = int(sys.stdin.readline())
if C[-1] == c:
continue
else:
C.append(c)
ans = 1
dic = defaultdict(lambda: 0)
mod = 10 ** 9 + 7
for c in C:
a = dic[c]
dic[c] += ans
ans = (ans + a) % mod
print((ans % mod))
| 20 | 21 | 334 | 357 | import sys
from collections import defaultdict
N = int(eval(input()))
C = [0]
for _ in range(N):
c = int(sys.stdin.readline())
if C[-1] == c:
continue
else:
C.append(c)
ans = 1
dic = defaultdict(lambda: 0)
for c in C:
a = dic[c]
dic[c] += ans
ans += a
print((ans % (10**9 + 7)))
| import sys
from collections import defaultdict
N = int(eval(input()))
C = [0]
for _ in range(N):
c = int(sys.stdin.readline())
if C[-1] == c:
continue
else:
C.append(c)
ans = 1
dic = defaultdict(lambda: 0)
mod = 10**9 + 7
for c in C:
a = dic[c]
dic[c] += ans
ans = (ans + a) % mod
print((ans % mod))
| false | 4.761905 | [
"+mod = 10**9 + 7",
"- ans += a",
"-print((ans % (10**9 + 7)))",
"+ ans = (ans + a) % mod",
"+print((ans % mod))"
]
| false | 0.077981 | 0.045458 | 1.715464 | [
"s914136971",
"s255820377"
]
|
u186838327 | p03951 | python | s809673649 | s763721445 | 64 | 28 | 61,800 | 9,128 | Accepted | Accepted | 56.25 | n = int(eval(input()))
s = str(eval(input()))
t = str(eval(input()))
if s == t:
print(n)
exit()
for i in range(n):
#print(s[i:], t[:n-1-i+1])
if s[i:] == t[:n-1-i+1]:
break
else:
i = n
#pass
ans = i*2+(n-i)
print(ans)
| n = int(eval(input()))
s = str(eval(input()))
t = str(eval(input()))
if s == t:
print(n)
exit()
for i in range(1, n):
s_ = s[i:n]
t_ = t[0:n-i]
if s_ == t_:
ans = s[:i]+t
print((len(ans)))
exit()
else:
print((2*n))
| 17 | 17 | 250 | 259 | n = int(eval(input()))
s = str(eval(input()))
t = str(eval(input()))
if s == t:
print(n)
exit()
for i in range(n):
# print(s[i:], t[:n-1-i+1])
if s[i:] == t[: n - 1 - i + 1]:
break
else:
i = n
# pass
ans = i * 2 + (n - i)
print(ans)
| n = int(eval(input()))
s = str(eval(input()))
t = str(eval(input()))
if s == t:
print(n)
exit()
for i in range(1, n):
s_ = s[i:n]
t_ = t[0 : n - i]
if s_ == t_:
ans = s[:i] + t
print((len(ans)))
exit()
else:
print((2 * n))
| false | 0 | [
"-for i in range(n):",
"- # print(s[i:], t[:n-1-i+1])",
"- if s[i:] == t[: n - 1 - i + 1]:",
"- break",
"+for i in range(1, n):",
"+ s_ = s[i:n]",
"+ t_ = t[0 : n - i]",
"+ if s_ == t_:",
"+ ans = s[:i] + t",
"+ print((len(ans)))",
"+ exit()",
"- i = n",
"- # pass",
"-ans = i * 2 + (n - i)",
"-print(ans)",
"+ print((2 * n))"
]
| false | 0.073778 | 0.036512 | 2.02066 | [
"s809673649",
"s763721445"
]
|
u671446913 | p02696 | python | s792841162 | s186695788 | 21 | 18 | 9,160 | 9,128 | Accepted | Accepted | 14.29 | a, b, n = list(map(int, input().split()))
x = min(b - 1, n)
ans = int(a * x / b)
#if a == 1 or b == 1 or b == n:
# print(0)
#else:
print(ans)
| a, b, n = list(map(int, input().split()))
x = min(b - 1, n)
print((int(a * x / b)))
| 9 | 4 | 149 | 80 | a, b, n = list(map(int, input().split()))
x = min(b - 1, n)
ans = int(a * x / b)
# if a == 1 or b == 1 or b == n:
# print(0)
# else:
print(ans)
| a, b, n = list(map(int, input().split()))
x = min(b - 1, n)
print((int(a * x / b)))
| false | 55.555556 | [
"-ans = int(a * x / b)",
"-# if a == 1 or b == 1 or b == n:",
"-# print(0)",
"-# else:",
"-print(ans)",
"+print((int(a * x / b)))"
]
| false | 0.008538 | 0.035451 | 0.240838 | [
"s792841162",
"s186695788"
]
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.