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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
u016302627 | p03162 | python | s043424275 | s777510176 | 683 | 347 | 72,556 | 32,364 | Accepted | Accepted | 49.19 | n = int(eval(input()))
DP = [[0] * 3 for _ in range(n+1)]
A = []
for i in range(n):
A.append(list(map(int, input().split())))
for i in range(1, n+1):
for j in range(0, 3):
for k in range(0, 3):
if j != k:
DP[i][j] = max(DP[i][j], DP[i-1][k] + A[i-1][j])
print((max(D... | n = int(eval(input()))
A, B, C = [], [], []
for i in range(n):
a, b, c = list(map(int, input().split()))
A.append(a)
B.append(b)
C.append(c)
dp_a, dp_b, dp_c = [0] * n, [0] * n, [0] * n
dp_a[0] = A[0]
dp_b[0] = B[0]
dp_c[0] = C[0]
for i in range(1, n):
dp_a[i] = max(dp_b[i-1], dp_c[i-1]) + A... | 11 | 19 | 320 | 445 | n = int(eval(input()))
DP = [[0] * 3 for _ in range(n + 1)]
A = []
for i in range(n):
A.append(list(map(int, input().split())))
for i in range(1, n + 1):
for j in range(0, 3):
for k in range(0, 3):
if j != k:
DP[i][j] = max(DP[i][j], DP[i - 1][k] + A[i - 1][j])
print((max(DP[... | n = int(eval(input()))
A, B, C = [], [], []
for i in range(n):
a, b, c = list(map(int, input().split()))
A.append(a)
B.append(b)
C.append(c)
dp_a, dp_b, dp_c = [0] * n, [0] * n, [0] * n
dp_a[0] = A[0]
dp_b[0] = B[0]
dp_c[0] = C[0]
for i in range(1, n):
dp_a[i] = max(dp_b[i - 1], dp_c[i - 1]) + A[i]
... | false | 42.105263 | [
"-DP = [[0] * 3 for _ in range(n + 1)]",
"-A = []",
"+A, B, C = [], [], []",
"- A.append(list(map(int, input().split())))",
"-for i in range(1, n + 1):",
"- for j in range(0, 3):",
"- for k in range(0, 3):",
"- if j != k:",
"- DP[i][j] = max(DP[i][j], DP[i - 1]... | false | 0.036404 | 0.076411 | 0.476423 | [
"s043424275",
"s777510176"
] |
u977349332 | p03416 | python | s840264236 | s572980286 | 51 | 46 | 2,940 | 2,940 | Accepted | Accepted | 9.8 | a, b = list(map(int, input().split()))
count = 0
for i in range(a, b+1):
i = str(i)
if i[0] == i[-1] and i[1] == i[-2]:
count +=1
print(count) | A, B = list(map(int, input().split()))
count = 0
for i in range(A, B+1):
s = str(i)
if s[0] == s[4] and s[1] == s[3]:
count += 1
print(count)
| 7 | 8 | 150 | 148 | a, b = list(map(int, input().split()))
count = 0
for i in range(a, b + 1):
i = str(i)
if i[0] == i[-1] and i[1] == i[-2]:
count += 1
print(count)
| A, B = list(map(int, input().split()))
count = 0
for i in range(A, B + 1):
s = str(i)
if s[0] == s[4] and s[1] == s[3]:
count += 1
print(count)
| false | 12.5 | [
"-a, b = list(map(int, input().split()))",
"+A, B = list(map(int, input().split()))",
"-for i in range(a, b + 1):",
"- i = str(i)",
"- if i[0] == i[-1] and i[1] == i[-2]:",
"+for i in range(A, B + 1):",
"+ s = str(i)",
"+ if s[0] == s[4] and s[1] == s[3]:"
] | false | 0.049814 | 0.097966 | 0.508482 | [
"s840264236",
"s572980286"
] |
u612975321 | p03053 | python | s529099764 | s896013148 | 738 | 664 | 20,724 | 20,276 | Accepted | Accepted | 10.03 | import numpy as np
H,W = list(map(int,input().split()))
use = np.zeros((H,W),dtype=int)
for i in range(H):
s = eval(input())
for j,st in enumerate(s):
if st == ".":
use[i][j] = 10**9
for i in range(1,H):
use[i,:] = np.minimum(use[i,:],use[i-1,:]+1)
for i in reversed(list(ra... | import numpy as np
h , w = list(map(int, input().split()))
visited = np.zeros((h,w),dtype=int)
for y in range(h):
_in = eval(input())
for x, value in enumerate(_in):
if value == '.':
visited[y][x] = 10**9
for i in range(1,h):
visited[i,:] = np.minimum(visited[i... | 20 | 20 | 539 | 625 | import numpy as np
H, W = list(map(int, input().split()))
use = np.zeros((H, W), dtype=int)
for i in range(H):
s = eval(input())
for j, st in enumerate(s):
if st == ".":
use[i][j] = 10**9
for i in range(1, H):
use[i, :] = np.minimum(use[i, :], use[i - 1, :] + 1)
for i in reversed(list(r... | import numpy as np
h, w = list(map(int, input().split()))
visited = np.zeros((h, w), dtype=int)
for y in range(h):
_in = eval(input())
for x, value in enumerate(_in):
if value == ".":
visited[y][x] = 10**9
for i in range(1, h):
visited[i, :] = np.minimum(visited[i, :], visited[i - 1, :]... | false | 0 | [
"-H, W = list(map(int, input().split()))",
"-use = np.zeros((H, W), dtype=int)",
"-for i in range(H):",
"- s = eval(input())",
"- for j, st in enumerate(s):",
"- if st == \".\":",
"- use[i][j] = 10**9",
"-for i in range(1, H):",
"- use[i, :] = np.minimum(use[i, :], use[i -... | false | 0.952733 | 0.326272 | 2.920055 | [
"s529099764",
"s896013148"
] |
u037430802 | p02845 | python | s135381820 | s897447702 | 309 | 246 | 18,656 | 53,132 | Accepted | Accepted | 20.39 | from collections import defaultdict
N = int(eval(input()))
A = list(map(int, input().split()))
ans = 1
d = defaultdict(int)
for i,n in enumerate(A):
if n == 0:
ans *= (3-d[n])
d[n] += 1
else:
ans *= (d[n-1] - d[n])
d[n] += 1
print((ans % (10**9+7))) |
N = int(eval(input()))
A = list(map(int, input().split()))
MOD = 10**9 + 7
if A[0] != 0:
print((0))
exit()
ans = 1
colors = [0] * 3
for n in A:
ans *= colors.count(n)
ans %= MOD
for i in range(3):
if colors[i] == n:
colors[i] += 1
break
prin... | 17 | 22 | 301 | 319 | from collections import defaultdict
N = int(eval(input()))
A = list(map(int, input().split()))
ans = 1
d = defaultdict(int)
for i, n in enumerate(A):
if n == 0:
ans *= 3 - d[n]
d[n] += 1
else:
ans *= d[n - 1] - d[n]
d[n] += 1
print((ans % (10**9 + 7)))
| N = int(eval(input()))
A = list(map(int, input().split()))
MOD = 10**9 + 7
if A[0] != 0:
print((0))
exit()
ans = 1
colors = [0] * 3
for n in A:
ans *= colors.count(n)
ans %= MOD
for i in range(3):
if colors[i] == n:
colors[i] += 1
break
print(ans)
| false | 22.727273 | [
"-from collections import defaultdict",
"-",
"+MOD = 10**9 + 7",
"+if A[0] != 0:",
"+ print((0))",
"+ exit()",
"-d = defaultdict(int)",
"-for i, n in enumerate(A):",
"- if n == 0:",
"- ans *= 3 - d[n]",
"- d[n] += 1",
"- else:",
"- ans *= d[n - 1] - d[n]",
... | false | 0.061457 | 0.064215 | 0.957047 | [
"s135381820",
"s897447702"
] |
u609061751 | p03013 | python | s432891673 | s965417663 | 218 | 121 | 41,692 | 13,216 | Accepted | Accepted | 44.5 | def main():
import sys
input = sys.stdin.readline
N,M = list(map(int,input().split()))
a = []
A = [0] * (1 + 10 ** 5)
for _ in range(M):
A[int(eval(input()))] = 1
dp = [0] * (N + 1)
dp[0] = 1
if A[1]:
dp[1] = 0
else:
dp[1] = 1
for i in ra... | import sys
input = lambda : sys.stdin.readline().rstrip()
mod = 10**9 + 7
n, m = list(map(int, input().split()))
a = []
for _ in range(m):
a.append(int(eval(input())))
a = set(a)
dp = [0]*(n + 1)
dp[0] = 1
for i in range(n):
if i + 2 not in a and i + 2 <= n:
dp[i + 2] += dp[i]
dp[... | 23 | 19 | 516 | 414 | def main():
import sys
input = sys.stdin.readline
N, M = list(map(int, input().split()))
a = []
A = [0] * (1 + 10**5)
for _ in range(M):
A[int(eval(input()))] = 1
dp = [0] * (N + 1)
dp[0] = 1
if A[1]:
dp[1] = 0
else:
dp[1] = 1
for i in range(2, N + 1)... | import sys
input = lambda: sys.stdin.readline().rstrip()
mod = 10**9 + 7
n, m = list(map(int, input().split()))
a = []
for _ in range(m):
a.append(int(eval(input())))
a = set(a)
dp = [0] * (n + 1)
dp[0] = 1
for i in range(n):
if i + 2 not in a and i + 2 <= n:
dp[i + 2] += dp[i]
dp[i + 2] %= mod... | false | 17.391304 | [
"-def main():",
"- import sys",
"+import sys",
"- input = sys.stdin.readline",
"- N, M = list(map(int, input().split()))",
"- a = []",
"- A = [0] * (1 + 10**5)",
"- for _ in range(M):",
"- A[int(eval(input()))] = 1",
"- dp = [0] * (N + 1)",
"- dp[0] = 1",
"- i... | false | 0.0361 | 0.071061 | 0.508007 | [
"s432891673",
"s965417663"
] |
u186838327 | p02702 | python | s245388993 | s027187377 | 428 | 241 | 88,228 | 87,756 | Accepted | Accepted | 43.69 | S = list(str(eval(input())))
S = [int(s) for s in S]
n = len(S)
S.reverse()
def power(a, n, mod):
bi=str(format(n,"b")) #2進数
res=1
for i in range(len(bi)):
res=(res*res) %mod
if bi[i]=="1":
res=(res*a) %mod
return res
cum1 = [-1]*(n+1)
cum1[0] = 0
for i in range(n):
temp =... | s =list(str(eval(input())))
s = [int(c) for c in s]
s.reverse()
n = len(s)
p = 2019
def power(a, n, mod):
bi=str(format(n,"b")) #2進数
res=1
for i in range(len(bi)):
res=(res*res) %mod
if bi[i]=="1":
res=(res*a) %mod
return res
temp = 0
cum = [0]*n
for i in range(n):
temp +... | 40 | 35 | 721 | 551 | S = list(str(eval(input())))
S = [int(s) for s in S]
n = len(S)
S.reverse()
def power(a, n, mod):
bi = str(format(n, "b")) # 2進数
res = 1
for i in range(len(bi)):
res = (res * res) % mod
if bi[i] == "1":
res = (res * a) % mod
return res
cum1 = [-1] * (n + 1)
cum1[0] = 0
f... | s = list(str(eval(input())))
s = [int(c) for c in s]
s.reverse()
n = len(s)
p = 2019
def power(a, n, mod):
bi = str(format(n, "b")) # 2進数
res = 1
for i in range(len(bi)):
res = (res * res) % mod
if bi[i] == "1":
res = (res * a) % mod
return res
temp = 0
cum = [0] * n
for... | false | 12.5 | [
"-S = list(str(eval(input())))",
"-S = [int(s) for s in S]",
"-n = len(S)",
"-S.reverse()",
"+s = list(str(eval(input())))",
"+s = [int(c) for c in s]",
"+s.reverse()",
"+n = len(s)",
"+p = 2019",
"-cum1 = [-1] * (n + 1)",
"-cum1[0] = 0",
"+temp = 0",
"+cum = [0] * n",
"- temp = cum1[i]... | false | 0.037685 | 0.05566 | 0.677053 | [
"s245388993",
"s027187377"
] |
u785578220 | p03775 | python | s126486015 | s463039141 | 56 | 44 | 3,060 | 9,180 | Accepted | Accepted | 21.43 | import math
b = eval(input())
a =int(b)
m = len(b)
for i in reversed(list(range(1,int(math.sqrt(a))+1))):
if a/i == int(a/i):
m = max(len(str(a//i)),len(str(i)))
break
print(m) | n = int(eval(input()))
def cal(a):
return len(str(a))
m = 11
for i in range(1,6):
for j in range(1,10**i+1):
if n%j==0:
m = min(m,max(cal(j),cal(n//j)))
# print(m)
print(m) | 9 | 11 | 192 | 197 | import math
b = eval(input())
a = int(b)
m = len(b)
for i in reversed(list(range(1, int(math.sqrt(a)) + 1))):
if a / i == int(a / i):
m = max(len(str(a // i)), len(str(i)))
break
print(m)
| n = int(eval(input()))
def cal(a):
return len(str(a))
m = 11
for i in range(1, 6):
for j in range(1, 10**i + 1):
if n % j == 0:
m = min(m, max(cal(j), cal(n // j)))
# print(m)
print(m)
| false | 18.181818 | [
"-import math",
"+n = int(eval(input()))",
"-b = eval(input())",
"-a = int(b)",
"-m = len(b)",
"-for i in reversed(list(range(1, int(math.sqrt(a)) + 1))):",
"- if a / i == int(a / i):",
"- m = max(len(str(a // i)), len(str(i)))",
"- break",
"+",
"+def cal(a):",
"+ return le... | false | 0.042713 | 0.049662 | 0.860067 | [
"s126486015",
"s463039141"
] |
u638282348 | p03835 | python | s215952582 | s123803939 | 1,021 | 212 | 2,940 | 110,280 | Accepted | Accepted | 79.24 | K, S = list(map(int, input().split()))
print((sum(0 <= S - (x + y) <= K for y in range(K + 1) for x in range(K + 1))))
| import numpy as np
K, S = list(map(int, input().split()))
arrange = np.arange(K + 1)
T = S - np.add.outer(arrange, arrange)
print((((T >= 0) & (T <= K)).sum())) | 2 | 5 | 112 | 156 | K, S = list(map(int, input().split()))
print((sum(0 <= S - (x + y) <= K for y in range(K + 1) for x in range(K + 1))))
| import numpy as np
K, S = list(map(int, input().split()))
arrange = np.arange(K + 1)
T = S - np.add.outer(arrange, arrange)
print((((T >= 0) & (T <= K)).sum()))
| false | 60 | [
"+import numpy as np",
"+",
"-print((sum(0 <= S - (x + y) <= K for y in range(K + 1) for x in range(K + 1))))",
"+arrange = np.arange(K + 1)",
"+T = S - np.add.outer(arrange, arrange)",
"+print((((T >= 0) & (T <= K)).sum()))"
] | false | 0.03663 | 0.410862 | 0.089155 | [
"s215952582",
"s123803939"
] |
u732061897 | p03262 | python | s263676992 | s729112729 | 166 | 101 | 15,376 | 20,020 | Accepted | Accepted | 39.16 | N, X = list(map(int, input().split()))
X_list = list(map(int, input().split()))
X_list.append(X)
X_list.sort()
kyori_list = []
for i, x in enumerate(X_list):
if i == len(X_list) - 1:
break
kyori_list.append(X_list[i + 1] - x)
import fractions
from functools import reduce
def gcd_list(*n... | N, X = list(map(int, input().split()))
X_list = list(map(int, input().split()))
kyori = [abs(X - x) for x in X_list]
def gcd(x, y):
if y == 0:
return x
return gcd(y, x % y)
ans = kyori[0]
for i in range(1, N):
ans = gcd(ans, kyori[i])
print(ans)
| 19 | 15 | 399 | 278 | N, X = list(map(int, input().split()))
X_list = list(map(int, input().split()))
X_list.append(X)
X_list.sort()
kyori_list = []
for i, x in enumerate(X_list):
if i == len(X_list) - 1:
break
kyori_list.append(X_list[i + 1] - x)
import fractions
from functools import reduce
def gcd_list(*numbers):
re... | N, X = list(map(int, input().split()))
X_list = list(map(int, input().split()))
kyori = [abs(X - x) for x in X_list]
def gcd(x, y):
if y == 0:
return x
return gcd(y, x % y)
ans = kyori[0]
for i in range(1, N):
ans = gcd(ans, kyori[i])
print(ans)
| false | 21.052632 | [
"-X_list.append(X)",
"-X_list.sort()",
"-kyori_list = []",
"-for i, x in enumerate(X_list):",
"- if i == len(X_list) - 1:",
"- break",
"- kyori_list.append(X_list[i + 1] - x)",
"-import fractions",
"-from functools import reduce",
"+kyori = [abs(X - x) for x in X_list]",
"-def gcd_l... | false | 0.121301 | 0.040868 | 2.968116 | [
"s263676992",
"s729112729"
] |
u347600233 | p02860 | python | s813270324 | s201672831 | 31 | 28 | 9,144 | 9,144 | Accepted | Accepted | 9.68 | n = int(eval(input()))
s = eval(input())
print(('Yes' if n % 2 == 0 and s[:n//2] == s[n//2:] else 'No')) | n = int(eval(input()))
s = eval(input())
print(('Yes' if s[:n//2] == s[n//2:] else 'No')) | 3 | 3 | 92 | 77 | n = int(eval(input()))
s = eval(input())
print(("Yes" if n % 2 == 0 and s[: n // 2] == s[n // 2 :] else "No"))
| n = int(eval(input()))
s = eval(input())
print(("Yes" if s[: n // 2] == s[n // 2 :] else "No"))
| false | 0 | [
"-print((\"Yes\" if n % 2 == 0 and s[: n // 2] == s[n // 2 :] else \"No\"))",
"+print((\"Yes\" if s[: n // 2] == s[n // 2 :] else \"No\"))"
] | false | 0.037638 | 0.03635 | 1.035422 | [
"s813270324",
"s201672831"
] |
u380524497 | p02698 | python | s284729749 | s060889257 | 1,224 | 1,037 | 82,012 | 82,012 | Accepted | Accepted | 15.28 | import bisect
n = int(eval(input()))
A = list(map(int, input().split()))
edges = [[] for _ in range(n+1)]
for _ in range(n-1):
from_, to = list(map(int, input().split()))
edges[from_].append(to)
edges[to].append(from_)
DP = [10**9+7] * (n+1)
limit = 10**9 + 1
DP[0] = 0
olds = [None] * (... | import bisect
import sys
input = sys.stdin.readline
n = int(eval(input()))
A = list(map(int, input().split()))
edges = [[] for _ in range(n+1)]
for _ in range(n-1):
from_, to = list(map(int, input().split()))
edges[from_].append(to)
edges[to].append(from_)
DP = [10**9+7] * (n+1)
limit =... | 44 | 46 | 929 | 969 | import bisect
n = int(eval(input()))
A = list(map(int, input().split()))
edges = [[] for _ in range(n + 1)]
for _ in range(n - 1):
from_, to = list(map(int, input().split()))
edges[from_].append(to)
edges[to].append(from_)
DP = [10**9 + 7] * (n + 1)
limit = 10**9 + 1
DP[0] = 0
olds = [None] * (n + 1)
ans =... | import bisect
import sys
input = sys.stdin.readline
n = int(eval(input()))
A = list(map(int, input().split()))
edges = [[] for _ in range(n + 1)]
for _ in range(n - 1):
from_, to = list(map(int, input().split()))
edges[from_].append(to)
edges[to].append(from_)
DP = [10**9 + 7] * (n + 1)
limit = 10**9 + 1
D... | false | 4.347826 | [
"+import sys",
"+input = sys.stdin.readline"
] | false | 0.057685 | 0.041143 | 1.40205 | [
"s284729749",
"s060889257"
] |
u353919145 | p03239 | python | s458767242 | s210784238 | 20 | 18 | 3,064 | 3,064 | Accepted | Accepted | 10 | a, b = list(map(int,input().split()))
list1=[]
list2=[]
for i in range (a):
x,y=list(map (int,input().split()))
list1.append(x)
list2.append(y)
mini= 0x3f3f3f3f
for i in range (a) :
if list1[i] < mini and list2[i] <= b :
mini=list1[i]
if (mini!= 0x3f3f3f3f):
print(mini)
els... | N,T= [int(x) for x in input().split()]
c=0
t=0
z=0
x=0
mini=0
lcost=[]
ltime=[]
cost=[]
time=[]
for i in range(N):
c,t=[int(x) for x in input().split()]
cost.append(c)
time.append(t)
for i in time:
z+=1
if i <= T:
ltime.append(i)
lcost.append(cost[z-1])
if ltime=... | 17 | 31 | 333 | 502 | a, b = list(map(int, input().split()))
list1 = []
list2 = []
for i in range(a):
x, y = list(map(int, input().split()))
list1.append(x)
list2.append(y)
mini = 0x3F3F3F3F
for i in range(a):
if list1[i] < mini and list2[i] <= b:
mini = list1[i]
if mini != 0x3F3F3F3F:
print(mini)
else:
print... | N, T = [int(x) for x in input().split()]
c = 0
t = 0
z = 0
x = 0
mini = 0
lcost = []
ltime = []
cost = []
time = []
for i in range(N):
c, t = [int(x) for x in input().split()]
cost.append(c)
time.append(t)
for i in time:
z += 1
if i <= T:
ltime.append(i)
lcost.append(cost[z - 1])
if ... | false | 45.16129 | [
"-a, b = list(map(int, input().split()))",
"-list1 = []",
"-list2 = []",
"-for i in range(a):",
"- x, y = list(map(int, input().split()))",
"- list1.append(x)",
"- list2.append(y)",
"-mini = 0x3F3F3F3F",
"-for i in range(a):",
"- if list1[i] < mini and list2[i] <= b:",
"- mini... | false | 0.046546 | 0.035156 | 1.323984 | [
"s458767242",
"s210784238"
] |
u360116509 | p03478 | python | s124504552 | s171915683 | 35 | 29 | 3,060 | 2,940 | Accepted | Accepted | 17.14 | def main():
N, A, B = list(map(int, input().split()))
ans = 0
for i in range(1, N + 1):
t = sum(list(map(int, list(str(i)))))
if A <= t <= B:
ans += i
print(ans)
main()
| def main():
N, A, B = list(map(int, input().split()))
ans = 0
for i in range(1, N + 1):
if A <= sum(map(int, str(i))) <= B:
ans += i
print(ans)
main()
| 11 | 10 | 219 | 192 | def main():
N, A, B = list(map(int, input().split()))
ans = 0
for i in range(1, N + 1):
t = sum(list(map(int, list(str(i)))))
if A <= t <= B:
ans += i
print(ans)
main()
| def main():
N, A, B = list(map(int, input().split()))
ans = 0
for i in range(1, N + 1):
if A <= sum(map(int, str(i))) <= B:
ans += i
print(ans)
main()
| false | 9.090909 | [
"- t = sum(list(map(int, list(str(i)))))",
"- if A <= t <= B:",
"+ if A <= sum(map(int, str(i))) <= B:"
] | false | 0.040137 | 0.06296 | 0.637491 | [
"s124504552",
"s171915683"
] |
u177481830 | p03393 | python | s570287892 | s885978053 | 33 | 24 | 3,828 | 3,768 | Accepted | Accepted | 27.27 | import string
S = eval(input())
if len(S) < 26:
for c in string.ascii_lowercase:
if c not in S:
break
print((S + c))
else:
ret = None
for i in range(26):
if max(S[25-i:]) != S[25-i]:
mc = 'z'
for c in S[25-i:]:
if c > S[... | import string
S = eval(input())
if len(S) < 26:
for c in string.ascii_lowercase:
if c not in S:
break
print((S + c))
else:
ret = None
for i in range(1, 26):
idx = 25 - i
if max(S[idx:]) != S[idx]:
mc = min([c for c in S[(idx+1):] if c > S[id... | 23 | 20 | 492 | 438 | import string
S = eval(input())
if len(S) < 26:
for c in string.ascii_lowercase:
if c not in S:
break
print((S + c))
else:
ret = None
for i in range(26):
if max(S[25 - i :]) != S[25 - i]:
mc = "z"
for c in S[25 - i :]:
if c > S[25 - i]... | import string
S = eval(input())
if len(S) < 26:
for c in string.ascii_lowercase:
if c not in S:
break
print((S + c))
else:
ret = None
for i in range(1, 26):
idx = 25 - i
if max(S[idx:]) != S[idx]:
mc = min([c for c in S[(idx + 1) :] if c > S[idx]])
... | false | 13.043478 | [
"- for i in range(26):",
"- if max(S[25 - i :]) != S[25 - i]:",
"- mc = \"z\"",
"- for c in S[25 - i :]:",
"- if c > S[25 - i]:",
"- mc = min(c, mc)",
"- ret = S[: 25 - i] + mc",
"+ for i in range(1, 26):",
"+ idx... | false | 0.047506 | 0.048137 | 0.986884 | [
"s570287892",
"s885978053"
] |
u810356688 | p03593 | python | s307490566 | s396983859 | 190 | 21 | 38,768 | 3,316 | Accepted | Accepted | 88.95 | import sys
def input(): return sys.stdin.readline().rstrip()
from collections import Counter
def main():
h,w=list(map(int,input().split()))
s=""
for _ in range(h):
s+=eval(input())
sc=list(Counter(s).values())
cunt_1=(h%2)*(w%2)
cunt_2=(h%2)*(w//2)+(w%2)*(h//2)
cunt_4=(h//... | import sys
def input(): return sys.stdin.readline().rstrip()
from collections import Counter
def main():
h,w=list(map(int,input().split()))
s=""
for _ in range(h):
s+=eval(input())
sc=list(Counter(s).values())
cunt_1=(h%2)*(w%2)
cunt_2=(h%2)*(w//2)+(w%2)*(h//2)
cunt_4=(h//... | 34 | 46 | 839 | 1,047 | import sys
def input():
return sys.stdin.readline().rstrip()
from collections import Counter
def main():
h, w = list(map(int, input().split()))
s = ""
for _ in range(h):
s += eval(input())
sc = list(Counter(s).values())
cunt_1 = (h % 2) * (w % 2)
cunt_2 = (h % 2) * (w // 2) + (... | import sys
def input():
return sys.stdin.readline().rstrip()
from collections import Counter
def main():
h, w = list(map(int, input().split()))
s = ""
for _ in range(h):
s += eval(input())
sc = list(Counter(s).values())
cunt_1 = (h % 2) * (w % 2)
cunt_2 = (h % 2) * (w // 2) + (... | false | 26.086957 | [
"+ if cunt_4 == 0:",
"+ break",
"+ else:",
"+ print(\"No\")",
"+ sys.exit()",
"+ if cunt_2 == 0:",
"+ break",
"+ else:",
"+ print(\"No\")",
"+ sys.exit()",
"- print((\"Yes\" if all(scc == 0 for scc in sc) else \"No\"))",
... | false | 0.083966 | 0.08769 | 0.957536 | [
"s307490566",
"s396983859"
] |
u754022296 | p02567 | python | s824986019 | s111672323 | 1,154 | 647 | 96,036 | 95,796 | Accepted | Accepted | 43.93 | class RMaxQ:
__slots__ = ["n", "data"]
def __init__(self, li):
self.n = len(li)
self.data = li*2
for i in range(self.n - 1, 0, -1):
self.data[i] = max(self.data[2*i], self.data[2*i+1])
def update(self, i, a):
i += self.n
self.dat... | class RMaxQ:
__slots__ = ["n", "data"]
def __init__(self, li):
self.n = len(li)
self.data = li*2
for i in range(self.n - 1, 0, -1):
self.data[i] = max(self.data[2*i], self.data[2*i+1])
def update(self, i, a):
i += self.n
self.dat... | 59 | 61 | 1,473 | 1,520 | class RMaxQ:
__slots__ = ["n", "data"]
def __init__(self, li):
self.n = len(li)
self.data = li * 2
for i in range(self.n - 1, 0, -1):
self.data[i] = max(self.data[2 * i], self.data[2 * i + 1])
def update(self, i, a):
i += self.n
self.data[i] = a
... | class RMaxQ:
__slots__ = ["n", "data"]
def __init__(self, li):
self.n = len(li)
self.data = li * 2
for i in range(self.n - 1, 0, -1):
self.data[i] = max(self.data[2 * i], self.data[2 * i + 1])
def update(self, i, a):
i += self.n
self.data[i] = a
... | false | 3.278689 | [
"+import sys",
"+",
"+input = sys.stdin.buffer.readline"
] | false | 0.008013 | 0.037051 | 0.216271 | [
"s824986019",
"s111672323"
] |
u488127128 | p03317 | python | s806082944 | s648118931 | 25 | 17 | 10,420 | 3,060 | Accepted | Accepted | 32 | def solve():
n,k = list(map(int, input().split()))
A = list(map(int, input().split()))
if (n-1)%(k-1) != 0:
return (n-1)//(k-1) + 1
else:
return (n-1)//(k-1)
if __name__ == '__main__':
print((solve())) | def solve():
n,k = list(map(int, input().split()))
if (n-1)%(k-1) != 0:
return (n-1)//(k-1) + 1
else:
return (n-1)//(k-1)
if __name__ == '__main__':
print((solve())) | 10 | 9 | 233 | 198 | def solve():
n, k = list(map(int, input().split()))
A = list(map(int, input().split()))
if (n - 1) % (k - 1) != 0:
return (n - 1) // (k - 1) + 1
else:
return (n - 1) // (k - 1)
if __name__ == "__main__":
print((solve()))
| def solve():
n, k = list(map(int, input().split()))
if (n - 1) % (k - 1) != 0:
return (n - 1) // (k - 1) + 1
else:
return (n - 1) // (k - 1)
if __name__ == "__main__":
print((solve()))
| false | 10 | [
"- A = list(map(int, input().split()))"
] | false | 0.044432 | 0.043109 | 1.030705 | [
"s806082944",
"s648118931"
] |
u935558307 | p03864 | python | s080405197 | s263308038 | 219 | 91 | 63,984 | 84,796 | Accepted | Accepted | 58.45 | N,x = list(map(int,input().split()))
A = list(map(int,input().split()))
cnt = 0
for i in range(1,N):
diff = A[i]+A[i-1]-x
if diff>0:
cnt += diff
A[i] -= min(A[i],diff)
print(cnt) | N,x = list(map(int,input().split()))
A = list(map(int,input().split()))
cnt = 0
if A[0] > x:
cnt += (A[0]-x)
A[0] = x
for i in range(1,N):
if A[i]+A[i-1] > x:
cnt += (A[i]+A[i-1]-x)
A[i] -= (A[i]+A[i-1]-x)
print(cnt) | 10 | 11 | 206 | 248 | N, x = list(map(int, input().split()))
A = list(map(int, input().split()))
cnt = 0
for i in range(1, N):
diff = A[i] + A[i - 1] - x
if diff > 0:
cnt += diff
A[i] -= min(A[i], diff)
print(cnt)
| N, x = list(map(int, input().split()))
A = list(map(int, input().split()))
cnt = 0
if A[0] > x:
cnt += A[0] - x
A[0] = x
for i in range(1, N):
if A[i] + A[i - 1] > x:
cnt += A[i] + A[i - 1] - x
A[i] -= A[i] + A[i - 1] - x
print(cnt)
| false | 9.090909 | [
"+if A[0] > x:",
"+ cnt += A[0] - x",
"+ A[0] = x",
"- diff = A[i] + A[i - 1] - x",
"- if diff > 0:",
"- cnt += diff",
"- A[i] -= min(A[i], diff)",
"+ if A[i] + A[i - 1] > x:",
"+ cnt += A[i] + A[i - 1] - x",
"+ A[i] -= A[i] + A[i - 1] - x"
] | false | 0.035003 | 0.038268 | 0.914686 | [
"s080405197",
"s263308038"
] |
u072053884 | p02412 | python | s061671743 | s342631121 | 380 | 350 | 7,564 | 7,668 | Accepted | Accepted | 7.89 | while True:
n, x = list(map(int, input().split()))
if n == x == 0:
break
cnt = 0
for i in range(1, min(n - 1, int(x / 3))):
for j in range(i + 1, n):
for k in range(j + 1, n + 1):
if (i + j + k) == x:
cnt += 1
print(cnt) | while True:
n, x = list(map(int, input().split()))
if n == x == 0:
break
cnt = 0
upper_max_value = min(x - 3, n)
lower_max_value = max(int(x / 3), 3)
for i in range(upper_max_value, lower_max_value - 1, -1):
for j in range(i - 1, 1, -1):
for k in range(j - 1,... | 11 | 13 | 308 | 406 | while True:
n, x = list(map(int, input().split()))
if n == x == 0:
break
cnt = 0
for i in range(1, min(n - 1, int(x / 3))):
for j in range(i + 1, n):
for k in range(j + 1, n + 1):
if (i + j + k) == x:
cnt += 1
print(cnt)
| while True:
n, x = list(map(int, input().split()))
if n == x == 0:
break
cnt = 0
upper_max_value = min(x - 3, n)
lower_max_value = max(int(x / 3), 3)
for i in range(upper_max_value, lower_max_value - 1, -1):
for j in range(i - 1, 1, -1):
for k in range(j - 1, 0, -1):
... | false | 15.384615 | [
"- for i in range(1, min(n - 1, int(x / 3))):",
"- for j in range(i + 1, n):",
"- for k in range(j + 1, n + 1):",
"+ upper_max_value = min(x - 3, n)",
"+ lower_max_value = max(int(x / 3), 3)",
"+ for i in range(upper_max_value, lower_max_value - 1, -1):",
"+ for j in... | false | 0.044441 | 0.081673 | 0.544134 | [
"s061671743",
"s342631121"
] |
u643495354 | p03088 | python | s434966641 | s841629877 | 140 | 17 | 3,812 | 3,064 | Accepted | Accepted | 87.86 | def main():
n = int(eval(input()))
MOD = 10 ** 9 + 7
note = [{} for _ in range(n+1)]
def ok(last4):
for i in range(4):
t = list(last4)
if i >= 1:
t[i-1], t[i] = t[i], t[i-1]
if ''.join(t).count('AGC') >= 1:
return Fa... | # from https://atcoder.jp/contests/abc122/submissions/4932940
def main():
n = int(eval(input()))
MOD = 10 ** 9 + 7
dpa = [0, 0, 1]
dpc = [0, 0, 1]
dpg = [0, 0, 1]
dpt = [0, 0, 1]
for i in range(2, n + 2):
total = dpa[i] + dpc[i] + dpg[i] + dpt[i]
if i == n + 1... | 31 | 23 | 726 | 538 | def main():
n = int(eval(input()))
MOD = 10**9 + 7
note = [{} for _ in range(n + 1)]
def ok(last4):
for i in range(4):
t = list(last4)
if i >= 1:
t[i - 1], t[i] = t[i], t[i - 1]
if "".join(t).count("AGC") >= 1:
return False
... | # from https://atcoder.jp/contests/abc122/submissions/4932940
def main():
n = int(eval(input()))
MOD = 10**9 + 7
dpa = [0, 0, 1]
dpc = [0, 0, 1]
dpg = [0, 0, 1]
dpt = [0, 0, 1]
for i in range(2, n + 2):
total = dpa[i] + dpc[i] + dpg[i] + dpt[i]
if i == n + 1:
brea... | false | 25.806452 | [
"+# from https://atcoder.jp/contests/abc122/submissions/4932940",
"- note = [{} for _ in range(n + 1)]",
"-",
"- def ok(last4):",
"- for i in range(4):",
"- t = list(last4)",
"- if i >= 1:",
"- t[i - 1], t[i] = t[i], t[i - 1]",
"- if \"\".... | false | 0.107992 | 0.045869 | 2.354382 | [
"s434966641",
"s841629877"
] |
u512212329 | p02574 | python | s428033834 | s592157441 | 795 | 643 | 133,200 | 133,416 | Accepted | Accepted | 19.12 | from math import gcd
def main():
eval(input()) # N
array = [int(x) for x in input().split()]
MAX_A = 10 ** 6 + 1
histogram = [0] * MAX_A
for x in array:
histogram[int(x)] += 1
for divider in range(2, MAX_A):
count = 0
for counted in histogram[divider::divid... | from math import gcd
from functools import reduce
def main():
eval(input()) # N
array = [int(x) for x in input().split()]
MAX_A = 10 ** 6 + 1
histogram = [0] * MAX_A
for x in array:
histogram[int(x)] += 1
for divider in range(2, MAX_A):
count = sum(histogram[divi... | 29 | 28 | 658 | 605 | from math import gcd
def main():
eval(input()) # N
array = [int(x) for x in input().split()]
MAX_A = 10**6 + 1
histogram = [0] * MAX_A
for x in array:
histogram[int(x)] += 1
for divider in range(2, MAX_A):
count = 0
for counted in histogram[divider::divider]:
... | from math import gcd
from functools import reduce
def main():
eval(input()) # N
array = [int(x) for x in input().split()]
MAX_A = 10**6 + 1
histogram = [0] * MAX_A
for x in array:
histogram[int(x)] += 1
for divider in range(2, MAX_A):
count = sum(histogram[divider::divider])
... | false | 3.448276 | [
"+from functools import reduce",
"- count = 0",
"- for counted in histogram[divider::divider]:",
"- count += counted",
"+ count = sum(histogram[divider::divider])",
"- gcd_now = 0",
"- for x in array:",
"- gcd_now = gcd(x, gcd_now)",
"- if gcd_now == 1... | false | 0.876381 | 0.465268 | 1.883603 | [
"s428033834",
"s592157441"
] |
u620868411 | p03325 | python | s857612828 | s920788518 | 87 | 75 | 3,828 | 4,148 | Accepted | Accepted | 13.79 | # -*- coding: utf-8 -*-
n = int(eval(input()))
def div2(x):
ret = 0
while x%2==0:
x /= 2
ret += 1
return ret
ret = 0
for a in input().split(" "):
a = int(a)
ret += div2(a)
print(ret)
| # -*- coding: utf-8 -*-
n = int(eval(input()))
al = list(map(int, input().split()))
res = 0
for a in al:
t = 0
while a%2==0:
a //= 2
t += 1
res += t
print(res)
| 16 | 11 | 231 | 192 | # -*- coding: utf-8 -*-
n = int(eval(input()))
def div2(x):
ret = 0
while x % 2 == 0:
x /= 2
ret += 1
return ret
ret = 0
for a in input().split(" "):
a = int(a)
ret += div2(a)
print(ret)
| # -*- coding: utf-8 -*-
n = int(eval(input()))
al = list(map(int, input().split()))
res = 0
for a in al:
t = 0
while a % 2 == 0:
a //= 2
t += 1
res += t
print(res)
| false | 31.25 | [
"-",
"-",
"-def div2(x):",
"- ret = 0",
"- while x % 2 == 0:",
"- x /= 2",
"- ret += 1",
"- return ret",
"-",
"-",
"-ret = 0",
"-for a in input().split(\" \"):",
"- a = int(a)",
"- ret += div2(a)",
"-print(ret)",
"+al = list(map(int, input().split()))",
"... | false | 0.058756 | 0.035616 | 1.649713 | [
"s857612828",
"s920788518"
] |
u923662841 | p02912 | python | s652766846 | s467148505 | 1,419 | 131 | 85,476 | 20,296 | Accepted | Accepted | 90.77 | import bisect
N,M = list(map(int, input().split()))
A = sorted(map(int, input().split()))
for i in range(M):
bisect.insort(A, A.pop()//2)
print((sum(A))) | import heapq
N,M = list(map(int, input().split()))
A = list([-int(x) for x in input().split()])
heapq.heapify(A)
for i in range(M):
a = heapq.heappop(A)
heapq.heappush(A,-(-a//2))
print((-sum(A))) | 6 | 8 | 154 | 207 | import bisect
N, M = list(map(int, input().split()))
A = sorted(map(int, input().split()))
for i in range(M):
bisect.insort(A, A.pop() // 2)
print((sum(A)))
| import heapq
N, M = list(map(int, input().split()))
A = list([-int(x) for x in input().split()])
heapq.heapify(A)
for i in range(M):
a = heapq.heappop(A)
heapq.heappush(A, -(-a // 2))
print((-sum(A)))
| false | 25 | [
"-import bisect",
"+import heapq",
"-A = sorted(map(int, input().split()))",
"+A = list([-int(x) for x in input().split()])",
"+heapq.heapify(A)",
"- bisect.insort(A, A.pop() // 2)",
"-print((sum(A)))",
"+ a = heapq.heappop(A)",
"+ heapq.heappush(A, -(-a // 2))",
"+print((-sum(A)))"
] | false | 0.136922 | 0.038834 | 3.525836 | [
"s652766846",
"s467148505"
] |
u268210555 | p03128 | python | s296587660 | s873089961 | 93 | 39 | 3,692 | 5,328 | Accepted | Accepted | 58.06 | n, m = list(map(int,input().split()))
a = sorted(map(int,input().split()))[::-1]
c = [0,2,5,5,4,5,6,3,7,6]
dp = [-float('inf')]*(n+1)
dp[0] = 0
for i in range(2, n+1):
for j in a:
if i >= c[j]:
dp[i] = max(dp[i], dp[i-c[j]]+1)
r = []
while n:
i = max((i for i in a if n>=c[i]), key... | from fractions import *
from collections import *
n, m = list(map(int,input().split()))
a = sorted(map(int,input().split()))[::-1]
c = [0,2,5,5,4,5,6,3,7,6]
mi = min(a, key=lambda x: c[x])
x = sum(c[i]*c[mi]//gcd(c[i],c[mi]) for i in a if i!=mi)
q, r = divmod(max(0, n-x), c[mi])
n = min(n, x+r)
dp = [-float('i... | 15 | 22 | 397 | 634 | n, m = list(map(int, input().split()))
a = sorted(map(int, input().split()))[::-1]
c = [0, 2, 5, 5, 4, 5, 6, 3, 7, 6]
dp = [-float("inf")] * (n + 1)
dp[0] = 0
for i in range(2, n + 1):
for j in a:
if i >= c[j]:
dp[i] = max(dp[i], dp[i - c[j]] + 1)
r = []
while n:
i = max((i for i in a if n >... | from fractions import *
from collections import *
n, m = list(map(int, input().split()))
a = sorted(map(int, input().split()))[::-1]
c = [0, 2, 5, 5, 4, 5, 6, 3, 7, 6]
mi = min(a, key=lambda x: c[x])
x = sum(c[i] * c[mi] // gcd(c[i], c[mi]) for i in a if i != mi)
q, r = divmod(max(0, n - x), c[mi])
n = min(n, x + r)
d... | false | 31.818182 | [
"+from fractions import *",
"+from collections import *",
"+",
"+mi = min(a, key=lambda x: c[x])",
"+x = sum(c[i] * c[mi] // gcd(c[i], c[mi]) for i in a if i != mi)",
"+q, r = divmod(max(0, n - x), c[mi])",
"+n = min(n, x + r)",
"-r = []",
"+d = Counter()",
"+d[mi] += q",
"- r.append(i)",
"... | false | 0.039269 | 0.052121 | 0.75342 | [
"s296587660",
"s873089961"
] |
u623231048 | p02691 | python | s794766444 | s152833897 | 561 | 186 | 168,464 | 165,844 | Accepted | Accepted | 66.84 | n = int(eval(input()))
a = list(map(int,input().split()))
add1 = []
sub1 = []
for i in range(n):
add1.append(a[i] + i)
sub1.append(i - a[i])
dict1 = {}
dict2 = {}
for i in add1:
if i in dict1:
dict1[i] += 1
else:
dict1[i] = 1
for i in sub1:
if i in dict2:
... | n = int(eval(input()))
a = list(map(int,input().split()))
add1 = []
sub1 = []
for i in range(n):
add1.append(a[i] + i)
sub1.append(i - a[i])
dict1 = {}
dict2 = {}
for i in add1:
if i in dict1:
dict1[i] += 1
else:
dict1[i] = 1
for i in sub1:
if i in dict2:
... | 39 | 28 | 802 | 462 | n = int(eval(input()))
a = list(map(int, input().split()))
add1 = []
sub1 = []
for i in range(n):
add1.append(a[i] + i)
sub1.append(i - a[i])
dict1 = {}
dict2 = {}
for i in add1:
if i in dict1:
dict1[i] += 1
else:
dict1[i] = 1
for i in sub1:
if i in dict2:
dict2[i] += 1
e... | n = int(eval(input()))
a = list(map(int, input().split()))
add1 = []
sub1 = []
for i in range(n):
add1.append(a[i] + i)
sub1.append(i - a[i])
dict1 = {}
dict2 = {}
for i in add1:
if i in dict1:
dict1[i] += 1
else:
dict1[i] = 1
for i in sub1:
if i in dict2:
dict2[i] += 1
e... | false | 28.205128 | [
"-sorted1 = sorted(list(dict1.items()), key=lambda x: x[0])",
"-sorted2 = sorted(list(dict2.items()), key=lambda x: x[0])",
"-cnt1 = 0",
"-cnt2 = 0",
"-while cnt1 < len(sorted1) and cnt2 < len(sorted2):",
"- if sorted1[cnt1][0] == sorted2[cnt2][0]:",
"- ans += sorted1[cnt1][1] * sorted2[cnt2][... | false | 0.038035 | 0.036889 | 1.031055 | [
"s794766444",
"s152833897"
] |
u761320129 | p03634 | python | s291341928 | s581025546 | 1,345 | 1,136 | 73,988 | 77,764 | Accepted | Accepted | 15.54 | import heapq
N = int(eval(input()))
src = [tuple(map(int,input().split())) for i in range(N-1)]
es = [[] for i in range(N)]
for a,b,c in src:
es[a-1].append((b-1,c))
es[b-1].append((a-1,c))
Q,K = list(map(int,input().split()))
qs = [tuple(map(int,input().split())) for i in range(Q)]
K -= 1
INF = f... | N = int(input())
ABC = [tuple(map(int,input().split())) for i in range(N-1)]
Q,K = map(int,input().split())
K -= 1
XY = [tuple(map(lambda x:int(x)-1,input().split())) for i in range(Q)]
es = [[] for i in range(N)]
for a,b,c in ABC:
a,b = a-1,b-1
es[a].append((b,c))
es[b].append((a,c))
INF = float(... | 27 | 26 | 606 | 649 | import heapq
N = int(eval(input()))
src = [tuple(map(int, input().split())) for i in range(N - 1)]
es = [[] for i in range(N)]
for a, b, c in src:
es[a - 1].append((b - 1, c))
es[b - 1].append((a - 1, c))
Q, K = list(map(int, input().split()))
qs = [tuple(map(int, input().split())) for i in range(Q)]
K -= 1
IN... | N = int(input())
ABC = [tuple(map(int, input().split())) for i in range(N - 1)]
Q, K = map(int, input().split())
K -= 1
XY = [tuple(map(lambda x: int(x) - 1, input().split())) for i in range(Q)]
es = [[] for i in range(N)]
for a, b, c in ABC:
a, b = a - 1, b - 1
es[a].append((b, c))
es[b].append((a, c))
INF... | false | 3.703704 | [
"+N = int(input())",
"+ABC = [tuple(map(int, input().split())) for i in range(N - 1)]",
"+Q, K = map(int, input().split())",
"+K -= 1",
"+XY = [tuple(map(lambda x: int(x) - 1, input().split())) for i in range(Q)]",
"+es = [[] for i in range(N)]",
"+for a, b, c in ABC:",
"+ a, b = a - 1, b - 1",
"... | false | 0.039689 | 0.034974 | 1.134818 | [
"s291341928",
"s581025546"
] |
u614314290 | p03013 | python | s996052028 | s299889808 | 187 | 171 | 13,208 | 11,884 | Accepted | Accepted | 8.56 | N, M = list(map(int, input().split()))
A = [int(eval(input())) for _ in range(M)]
MOD = 10 ** 9 + 7
am = set()
for a in A:
am |= {a}
dp = [1] + [0] * (N + 10)
for n in range(1, N + 1):
if n in am:
continue
dp[n] = (dp[n - 1] + (dp[n - 2] if 2 <= n else 0)) % MOD
#print(dp)
print((dp[N]))
| N, M = list(map(int, input().split()))
A = {int(eval(input())) for _ in range(M)}
MOD = 10 ** 9 + 7
dp = [1] + [0] * (N + 10)
for n in range(1, N + 1):
if n in A:
continue
dp[n] = (dp[n - 1] + (dp[n - 2] if 2 <= n else 0)) % MOD
print((dp[N]))
| 18 | 13 | 302 | 250 | N, M = list(map(int, input().split()))
A = [int(eval(input())) for _ in range(M)]
MOD = 10**9 + 7
am = set()
for a in A:
am |= {a}
dp = [1] + [0] * (N + 10)
for n in range(1, N + 1):
if n in am:
continue
dp[n] = (dp[n - 1] + (dp[n - 2] if 2 <= n else 0)) % MOD
# print(dp)
print((dp[N]))
| N, M = list(map(int, input().split()))
A = {int(eval(input())) for _ in range(M)}
MOD = 10**9 + 7
dp = [1] + [0] * (N + 10)
for n in range(1, N + 1):
if n in A:
continue
dp[n] = (dp[n - 1] + (dp[n - 2] if 2 <= n else 0)) % MOD
print((dp[N]))
| false | 27.777778 | [
"-A = [int(eval(input())) for _ in range(M)]",
"+A = {int(eval(input())) for _ in range(M)}",
"-am = set()",
"-for a in A:",
"- am |= {a}",
"- if n in am:",
"+ if n in A:",
"-# print(dp)"
] | false | 0.035057 | 0.03507 | 0.999653 | [
"s996052028",
"s299889808"
] |
u779137493 | p02270 | python | s082556985 | s818850347 | 510 | 450 | 15,824 | 15,828 | Accepted | Accepted | 11.76 | [n, k] = list(map(int, input().split(' ')))
wi = list(map(int, [eval(input()) for i in range(n)]))
def isAllocatable(p):
kw, ki = 0, 1
for w in wi:
if w > p: return False
kw += w
if kw <= p: continue
ki += 1
if k < ki: return False
kw = w
return True
l = 0
r = sum(wi)
whi... | n, k = list(map(int, input().split(' ')))
wi = list(map(int, [eval(input()) for i in range(n)]))
def isAllocatable(p):
kw, ki = 0, 1
for w in wi:
if w > p: return False
kw += w
if kw <= p: continue
kw = w
ki += 1
if k < ki: return False
return True
l, r = 0, sum(wi)
while ... | 22 | 22 | 403 | 402 | [n, k] = list(map(int, input().split(" ")))
wi = list(map(int, [eval(input()) for i in range(n)]))
def isAllocatable(p):
kw, ki = 0, 1
for w in wi:
if w > p:
return False
kw += w
if kw <= p:
continue
ki += 1
if k < ki:
return False
... | n, k = list(map(int, input().split(" ")))
wi = list(map(int, [eval(input()) for i in range(n)]))
def isAllocatable(p):
kw, ki = 0, 1
for w in wi:
if w > p:
return False
kw += w
if kw <= p:
continue
kw = w
ki += 1
if k < ki:
re... | false | 0 | [
"-[n, k] = list(map(int, input().split(\" \")))",
"+n, k = list(map(int, input().split(\" \")))",
"+ kw = w",
"- kw = w",
"-l = 0",
"-r = sum(wi)",
"+l, r = 0, sum(wi)"
] | false | 0.036122 | 0.040737 | 0.886718 | [
"s082556985",
"s818850347"
] |
u899866702 | p02990 | python | s790754864 | s765225888 | 203 | 20 | 3,316 | 3,316 | Accepted | Accepted | 90.15 | import math
N,K = (int(x) for x in input().split())
R = N - K
mod = 10**9 + 7
def fact(n, r):
return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))
for i in range(1,K+1):
if N - K + 1 < i:
ans = 0
else:
ans = fact(R+1, i)*fact(K-1,i-1)
print((int(ans)%mod))
| n,k = (int(x) for x in input().split())
mod = 10**9 + 7
ans = n - k + 1
print(ans)
for i in range(1,k):
ans = ans*(n-k+1-i)*(k-i)//(i*(i+1))
print((ans%mod))
| 16 | 8 | 313 | 170 | import math
N, K = (int(x) for x in input().split())
R = N - K
mod = 10**9 + 7
def fact(n, r):
return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))
for i in range(1, K + 1):
if N - K + 1 < i:
ans = 0
else:
ans = fact(R + 1, i) * fact(K - 1, i - 1)
print((int(ans) ... | n, k = (int(x) for x in input().split())
mod = 10**9 + 7
ans = n - k + 1
print(ans)
for i in range(1, k):
ans = ans * (n - k + 1 - i) * (k - i) // (i * (i + 1))
print((ans % mod))
| false | 50 | [
"-import math",
"-",
"-N, K = (int(x) for x in input().split())",
"-R = N - K",
"+n, k = (int(x) for x in input().split())",
"-",
"-",
"-def fact(n, r):",
"- return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))",
"-",
"-",
"-for i in range(1, K + 1):",
"- if N - K + ... | false | 0.12944 | 0.034336 | 3.769822 | [
"s790754864",
"s765225888"
] |
u124498235 | p03212 | python | s574357959 | s570777603 | 58 | 49 | 7,872 | 4,084 | Accepted | Accepted | 15.52 | from itertools import product
n = eval(input())
p = []
for i in range(len(n)):
p += list(product(["7","5","3"], repeat = i+1))
a = []
for i in p:
if ("7" not in i) or ("5" not in i) or ("3" not in i):
continue
else:
if int("".join(i)) <= int(n):
a.append(int("".join(i)))
print((len(a)))
| import bisect
n = int(eval(input()))
l = len(str(n))
ary = []
siti = ["3","5","7"]
def dfs (s,t):
if len(s) == t:
if s.count("3") > 0 and s.count("5") > 0 and s.count("7") > 0:
ary.append(int(s))
return
for j in siti:
dfs(s+j,t)
for i in range(3,l+1):
dfs("",i)
ary.sort()
print((bisec... | 13 | 20 | 303 | 336 | from itertools import product
n = eval(input())
p = []
for i in range(len(n)):
p += list(product(["7", "5", "3"], repeat=i + 1))
a = []
for i in p:
if ("7" not in i) or ("5" not in i) or ("3" not in i):
continue
else:
if int("".join(i)) <= int(n):
a.append(int("".join(i)))
print... | import bisect
n = int(eval(input()))
l = len(str(n))
ary = []
siti = ["3", "5", "7"]
def dfs(s, t):
if len(s) == t:
if s.count("3") > 0 and s.count("5") > 0 and s.count("7") > 0:
ary.append(int(s))
return
for j in siti:
dfs(s + j, t)
for i in range(3, l + 1):
dfs("",... | false | 35 | [
"-from itertools import product",
"+import bisect",
"-n = eval(input())",
"-p = []",
"-for i in range(len(n)):",
"- p += list(product([\"7\", \"5\", \"3\"], repeat=i + 1))",
"-a = []",
"-for i in p:",
"- if (\"7\" not in i) or (\"5\" not in i) or (\"3\" not in i):",
"- continue",
"-... | false | 0.076082 | 0.048436 | 1.570769 | [
"s574357959",
"s570777603"
] |
u358254559 | p03162 | python | s882550794 | s549146663 | 1,088 | 928 | 56,636 | 47,328 | Accepted | Accepted | 14.71 | N = int(eval(input()))
S = []
for _ in range(N):
D = list(map(int, input().split()))
S.append(D)
import numpy as np
#dp=np.zeros((N+1,3))
dp = [[0 for _ in range(3)] for _ in range(N+1)]
for i in range(1,N+1):
for j in range(3):
for k in range(3):
if j != k:
... | N = int(eval(input()))
S = []
for _ in range(N):
D = list(map(int, input().split()))
S.append(D)
dp = [[0 for _ in range(3)] for _ in range(N+1)]
for i in range(1,N+1):
for j in range(3):
for k in range(3):
if j != k:
happy = dp[i-1][k] + S[i-1][j]
... | 20 | 17 | 452 | 407 | N = int(eval(input()))
S = []
for _ in range(N):
D = list(map(int, input().split()))
S.append(D)
import numpy as np
# dp=np.zeros((N+1,3))
dp = [[0 for _ in range(3)] for _ in range(N + 1)]
for i in range(1, N + 1):
for j in range(3):
for k in range(3):
if j != k:
happy ... | N = int(eval(input()))
S = []
for _ in range(N):
D = list(map(int, input().split()))
S.append(D)
dp = [[0 for _ in range(3)] for _ in range(N + 1)]
for i in range(1, N + 1):
for j in range(3):
for k in range(3):
if j != k:
happy = dp[i - 1][k] + S[i - 1][j]
... | false | 15 | [
"-import numpy as np",
"-",
"-# dp=np.zeros((N+1,3))"
] | false | 0.041892 | 0.042021 | 0.996918 | [
"s882550794",
"s549146663"
] |
u794173881 | p03176 | python | s932735554 | s764460297 | 843 | 717 | 123,600 | 122,832 | Accepted | Accepted | 14.95 | class SegmentTree():
def __init__(self, n):
self.size = 1
while self.size < n:
self.size *= 2
self.node = [0] * (2*self.size - 1)
def update(self, i, val):
i += (self.size - 1)
self.node[i] = val
while i > 0:
i = (i - 1) // 2
... | class SegmentTree():
"""一点更新、区間取得クエリをそれぞれO(logN)で答えるデータ構造を構築する
update: i番目をvalに変更する
get_min: 区間[begin, end)の最小値を求める
"""
def __init__(self, n):
self.n = n
self.INF = 0
self.size = 1
while self.size < n:
self.size *= 2
self.node = [self.IN... | 47 | 51 | 1,176 | 1,350 | class SegmentTree:
def __init__(self, n):
self.size = 1
while self.size < n:
self.size *= 2
self.node = [0] * (2 * self.size - 1)
def update(self, i, val):
i += self.size - 1
self.node[i] = val
while i > 0:
i = (i - 1) // 2
sel... | class SegmentTree:
"""一点更新、区間取得クエリをそれぞれO(logN)で答えるデータ構造を構築する
update: i番目をvalに変更する
get_min: 区間[begin, end)の最小値を求める
"""
def __init__(self, n):
self.n = n
self.INF = 0
self.size = 1
while self.size < n:
self.size *= 2
self.node = [self.INF] * (2 * se... | false | 7.843137 | [
"+ \"\"\"一点更新、区間取得クエリをそれぞれO(logN)で答えるデータ構造を構築する",
"+ update: i番目をvalに変更する",
"+ get_min: 区間[begin, end)の最小値を求める",
"+ \"\"\"",
"+",
"+ self.n = n",
"+ self.INF = 0",
"- self.node = [0] * (2 * self.size - 1)",
"+ self.node = [self.INF] * (2 * self.size - 1)",
"... | false | 0.071455 | 0.074183 | 0.963226 | [
"s932735554",
"s764460297"
] |
u411203878 | p03486 | python | s948730742 | s926743659 | 170 | 150 | 38,384 | 61,308 | Accepted | Accepted | 11.76 | s1=eval(input())
s2=eval(input())
if s1 == s2:
print('No')
exit()
s1 = list(s1)
s1.sort()
s1 = ''.join(map(str,s1))
s2 = list(s2)
s2.sort(reverse=True)
s2 = ''.join(map(str,s2))
check = [s1,s2]
check.sort()
if check[0] == s1:
print('Yes')
else:
print('No')
| S = list(eval(input()))
T = list(eval(input()))
S.sort()
T.sort(reverse=True)
s = ''.join(map(str,S))
t = ''.join(map(str,T))
if t > s:
print('Yes')
else:
print('No') | 18 | 13 | 279 | 177 | s1 = eval(input())
s2 = eval(input())
if s1 == s2:
print("No")
exit()
s1 = list(s1)
s1.sort()
s1 = "".join(map(str, s1))
s2 = list(s2)
s2.sort(reverse=True)
s2 = "".join(map(str, s2))
check = [s1, s2]
check.sort()
if check[0] == s1:
print("Yes")
else:
print("No")
| S = list(eval(input()))
T = list(eval(input()))
S.sort()
T.sort(reverse=True)
s = "".join(map(str, S))
t = "".join(map(str, T))
if t > s:
print("Yes")
else:
print("No")
| false | 27.777778 | [
"-s1 = eval(input())",
"-s2 = eval(input())",
"-if s1 == s2:",
"- print(\"No\")",
"- exit()",
"-s1 = list(s1)",
"-s1.sort()",
"-s1 = \"\".join(map(str, s1))",
"-s2 = list(s2)",
"-s2.sort(reverse=True)",
"-s2 = \"\".join(map(str, s2))",
"-check = [s1, s2]",
"-check.sort()",
"-if check... | false | 0.052938 | 0.035162 | 1.505539 | [
"s948730742",
"s926743659"
] |
u007270338 | p02238 | python | s705130659 | s136410577 | 30 | 20 | 6,372 | 5,812 | Accepted | Accepted | 33.33 | #coding:utf-8
from copy import deepcopy
n = int(eval(input()))
c = ["white" for i in range(n)]
d = [0 for i in range(n)]
f = [0 for i in range(n)]
S = []
class DFS:
def __init__(self, key, color="white",nex=None):
self.color = color
self.nex = nex
self.key = key
objList = [DF... | #coding: utf-8
n = int(eval(input()))
color = ["white" for i in range(n)]
d = [[] for i in range(n)]
global t
t = 0
M = [[False for i in range(n)] for j in range(n)]
for i in range(n):
data = list(map(int,input().split()))
u = data[0]
k = data[1]
if i == 0:
start = u
for v in ... | 68 | 38 | 1,462 | 781 | # coding:utf-8
from copy import deepcopy
n = int(eval(input()))
c = ["white" for i in range(n)]
d = [0 for i in range(n)]
f = [0 for i in range(n)]
S = []
class DFS:
def __init__(self, key, color="white", nex=None):
self.color = color
self.nex = nex
self.key = key
objList = [DFS(i + 1) ... | # coding: utf-8
n = int(eval(input()))
color = ["white" for i in range(n)]
d = [[] for i in range(n)]
global t
t = 0
M = [[False for i in range(n)] for j in range(n)]
for i in range(n):
data = list(map(int, input().split()))
u = data[0]
k = data[1]
if i == 0:
start = u
for v in data[2 : 2 + ... | false | 44.117647 | [
"-# coding:utf-8",
"-from copy import deepcopy",
"-",
"+# coding: utf-8",
"-c = [\"white\" for i in range(n)]",
"-d = [0 for i in range(n)]",
"-f = [0 for i in range(n)]",
"-S = []",
"+color = [\"white\" for i in range(n)]",
"+d = [[] for i in range(n)]",
"+global t",
"+t = 0",
"+M = [[False... | false | 0.035498 | 0.037206 | 0.954088 | [
"s705130659",
"s136410577"
] |
u197300773 | p02844 | python | s251953407 | s588692486 | 1,815 | 26 | 3,188 | 3,188 | Accepted | Accepted | 98.57 | N=int(eval(input()))
s=eval(input())
first=[-1 for i in range(10)]
last=[-1 for i in range(10)]
for i in range(len(s)):
k=int(s[i])
if first[k]==-1: first[k]=i
last[k]=i
dic=set()
for i in range(10):
for j in range(10):
f=first[i]
l=last[j]
if f!=-1 and f+1<l:
... | def main():
N=int(eval(input()))
s=eval(input())
first=[-1 for i in range(10)]
last=[-1 for i in range(10)]
for i in range(len(s)):
k=int(s[i])
if first[k]==-1: first[k]=i
last[k]=i
ans=0
for i in range(10):
for j in range(10):
f=firs... | 19 | 24 | 403 | 551 | N = int(eval(input()))
s = eval(input())
first = [-1 for i in range(10)]
last = [-1 for i in range(10)]
for i in range(len(s)):
k = int(s[i])
if first[k] == -1:
first[k] = i
last[k] = i
dic = set()
for i in range(10):
for j in range(10):
f = first[i]
l = last[j]
if f != -... | def main():
N = int(eval(input()))
s = eval(input())
first = [-1 for i in range(10)]
last = [-1 for i in range(10)]
for i in range(len(s)):
k = int(s[i])
if first[k] == -1:
first[k] = i
last[k] = i
ans = 0
for i in range(10):
for j in range(10):
... | false | 20.833333 | [
"-N = int(eval(input()))",
"-s = eval(input())",
"-first = [-1 for i in range(10)]",
"-last = [-1 for i in range(10)]",
"-for i in range(len(s)):",
"- k = int(s[i])",
"- if first[k] == -1:",
"- first[k] = i",
"- last[k] = i",
"-dic = set()",
"-for i in range(10):",
"- for j ... | false | 0.067727 | 0.044875 | 1.509233 | [
"s251953407",
"s588692486"
] |
u378691508 | p03579 | python | s086097441 | s705593874 | 725 | 647 | 91,472 | 89,180 | Accepted | Accepted | 10.76 | #https://atcoder.jp/contests/code-festival-2017-qualb/tasks/code_festival_2017_qualb_c
from collections import deque
N,M=list(map(int,input().split()))
G=[[] for i in range(N)]
for i in range(M):
a,b = list(map(int,input().split()))
G[a-1].append(b-1)
G[b-1].append(a-1)
visit=[False]*N
color=[-1]*N
que=deq... | #https://atcoder.jp/contests/code-festival-2017-qualb/tasks/code_festival_2017_qualb_c
from collections import deque
N,M=list(map(int,input().split()))
G=[[] for i in range(N)]
for i in range(M):
a,b = list(map(int,input().split()))
G[a-1].append(b-1)
G[b-1].append(a-1)
visit=[False]*N
color=[-1]*N
que=deq... | 34 | 34 | 674 | 671 | # https://atcoder.jp/contests/code-festival-2017-qualb/tasks/code_festival_2017_qualb_c
from collections import deque
N, M = list(map(int, input().split()))
G = [[] for i in range(N)]
for i in range(M):
a, b = list(map(int, input().split()))
G[a - 1].append(b - 1)
G[b - 1].append(a - 1)
visit = [False] * N... | # https://atcoder.jp/contests/code-festival-2017-qualb/tasks/code_festival_2017_qualb_c
from collections import deque
N, M = list(map(int, input().split()))
G = [[] for i in range(N)]
for i in range(M):
a, b = list(map(int, input().split()))
G[a - 1].append(b - 1)
G[b - 1].append(a - 1)
visit = [False] * N... | false | 0 | [
"- color[0] = True",
"+ color[0] = 1"
] | false | 0.072911 | 0.067716 | 1.076714 | [
"s086097441",
"s705593874"
] |
u761320129 | p03637 | python | s236241738 | s088015848 | 65 | 57 | 14,252 | 14,252 | Accepted | Accepted | 12.31 | N = int(eval(input()))
src = list(map(int, input().split()))
x1 = x2 = x4 = 0
for a in src:
if a%2 == 1:
x1 += 1
elif a%4 == 0:
x4 += 1
else:
x2 += 1
def solve():
if x4 >= x1: return True
if x4 + 1 == x1:
return x2 == 0
else: return False
prin... | N = int(eval(input()))
src = list(map(int,input().split()))
one = sum([1 for a in src if a%2])
four = sum([1 for a in src if a%4==0])
two = N - one - four
print(('Yes' if one <= four or (one == four+1 and two==0) else 'No'))
| 19 | 8 | 344 | 226 | N = int(eval(input()))
src = list(map(int, input().split()))
x1 = x2 = x4 = 0
for a in src:
if a % 2 == 1:
x1 += 1
elif a % 4 == 0:
x4 += 1
else:
x2 += 1
def solve():
if x4 >= x1:
return True
if x4 + 1 == x1:
return x2 == 0
else:
return False
p... | N = int(eval(input()))
src = list(map(int, input().split()))
one = sum([1 for a in src if a % 2])
four = sum([1 for a in src if a % 4 == 0])
two = N - one - four
print(("Yes" if one <= four or (one == four + 1 and two == 0) else "No"))
| false | 57.894737 | [
"-x1 = x2 = x4 = 0",
"-for a in src:",
"- if a % 2 == 1:",
"- x1 += 1",
"- elif a % 4 == 0:",
"- x4 += 1",
"- else:",
"- x2 += 1",
"-",
"-",
"-def solve():",
"- if x4 >= x1:",
"- return True",
"- if x4 + 1 == x1:",
"- return x2 == 0",
"... | false | 0.108397 | 0.072732 | 1.490366 | [
"s236241738",
"s088015848"
] |
u864013199 | p03283 | python | s060377776 | s261678260 | 2,245 | 1,164 | 17,044 | 15,200 | Accepted | Accepted | 48.15 | import numpy as np
N,M,Q = list(map(int,input().split()))
lis = np.zeros((N,N))
for i in range(M):
L,R = list(map(int,input().split()))
lis[N-L,R-1] += 1
#二次元累積和
np.cumsum(lis,axis=0,out=lis)
np.cumsum(lis,axis=1,out=lis)
for _ in range(Q):
p,q = list(map(int,input().split()))
print((int(lis[... | import numpy as np
import sys
input = sys.stdin.readline
N,M,Q = list(map(int,input().split()))
lis = np.zeros((N,N))
for i in range(M):
L,R = list(map(int,input().split()))
lis[N-L,R-1] += 1
#二次元累積和
np.cumsum(lis,axis=0,out=lis)
np.cumsum(lis,axis=1,out=lis)
for _ in range(Q):
p,q = list(map(... | 12 | 15 | 312 | 354 | import numpy as np
N, M, Q = list(map(int, input().split()))
lis = np.zeros((N, N))
for i in range(M):
L, R = list(map(int, input().split()))
lis[N - L, R - 1] += 1
# 二次元累積和
np.cumsum(lis, axis=0, out=lis)
np.cumsum(lis, axis=1, out=lis)
for _ in range(Q):
p, q = list(map(int, input().split()))
print((... | import numpy as np
import sys
input = sys.stdin.readline
N, M, Q = list(map(int, input().split()))
lis = np.zeros((N, N))
for i in range(M):
L, R = list(map(int, input().split()))
lis[N - L, R - 1] += 1
# 二次元累積和
np.cumsum(lis, axis=0, out=lis)
np.cumsum(lis, axis=1, out=lis)
for _ in range(Q):
p, q = list(... | false | 20 | [
"+import sys",
"+input = sys.stdin.readline"
] | false | 0.227752 | 0.458295 | 0.496955 | [
"s060377776",
"s261678260"
] |
u038024401 | p02819 | python | s825746818 | s800287251 | 175 | 17 | 38,384 | 3,060 | Accepted | Accepted | 90.29 | X = int(eval(input()))
if X == 2:
print(X)
exit()
elif X %2 == 0:
X += 1
while True:
flag = 1
for i in range(3, round(X**(1/2)), 2):
if X % i == 0:
flag = 0
break
if flag == 1:
... | """2ずつインクリメントして素数か検証"""
def NextPrime(X):
while True:
flag = 1
for i in range(3, round(X**(1/2)), 2):
if X % i == 0:
flag = 0
break
if flag == 1:
... | 18 | 22 | 364 | 512 | X = int(eval(input()))
if X == 2:
print(X)
exit()
elif X % 2 == 0:
X += 1
while True:
flag = 1
for i in range(3, round(X ** (1 / 2)), 2):
if X % i == 0:
flag = 0
break
if flag == 1:
print(X)
exit()
X += 2
| """2ずつインクリメントして素数か検証"""
def NextPrime(X):
while True:
flag = 1
for i in range(3, round(X ** (1 / 2)), 2):
if X % i == 0:
flag = 0
break
if flag == 1:
return X
X += 2
X = int(eval(input()))
if X == 2:
print(X)
exit()
... | false | 18.181818 | [
"+\"\"\"2ずつインクリメントして素数か検証\"\"\"",
"+",
"+",
"+def NextPrime(X):",
"+ while True:",
"+ flag = 1",
"+ for i in range(3, round(X ** (1 / 2)), 2):",
"+ if X % i == 0:",
"+ flag = 0",
"+ break",
"+ if flag == 1:",
"+ return... | false | 0.102566 | 0.038056 | 2.695102 | [
"s825746818",
"s800287251"
] |
u571969099 | p03038 | python | s057064536 | s829216221 | 584 | 498 | 24,012 | 30,144 | Accepted | Accepted | 14.73 | n,m = [int(i) for i in input().split()]
a = [int(i) for i in input().split()]
a.sort()
cb = []
for _ in range(m):
b, c = [int(i) for i in input().split()]
cb.append([c, b])
cb.sort(reverse=1)
i = 0
j = 0
for k in range(n):
a[k] = max(a[k], cb[i][0])
j += 1
if j == cb[i][1]:
... | n, m = [int(i) for i in input().split()]
a = [int(i) for i in input().split()]
a.sort()
bc = [[int(i) for i in input().split()] for _ in range(m)]
bc.sort(key=lambda x: -x[1])
i = 0
for b, c in bc:
for _ in range(b):
a[i] = max(a[i], c)
i += 1
if i == n:
break
i... | 21 | 16 | 388 | 359 | n, m = [int(i) for i in input().split()]
a = [int(i) for i in input().split()]
a.sort()
cb = []
for _ in range(m):
b, c = [int(i) for i in input().split()]
cb.append([c, b])
cb.sort(reverse=1)
i = 0
j = 0
for k in range(n):
a[k] = max(a[k], cb[i][0])
j += 1
if j == cb[i][1]:
i += 1
j... | n, m = [int(i) for i in input().split()]
a = [int(i) for i in input().split()]
a.sort()
bc = [[int(i) for i in input().split()] for _ in range(m)]
bc.sort(key=lambda x: -x[1])
i = 0
for b, c in bc:
for _ in range(b):
a[i] = max(a[i], c)
i += 1
if i == n:
break
if i == n:
... | false | 23.809524 | [
"-cb = []",
"-for _ in range(m):",
"- b, c = [int(i) for i in input().split()]",
"- cb.append([c, b])",
"-cb.sort(reverse=1)",
"+bc = [[int(i) for i in input().split()] for _ in range(m)]",
"+bc.sort(key=lambda x: -x[1])",
"-j = 0",
"-for k in range(n):",
"- a[k] = max(a[k], cb[i][0])",
... | false | 0.084402 | 0.046885 | 1.800198 | [
"s057064536",
"s829216221"
] |
u327466606 | p03333 | python | s778950146 | s029414270 | 811 | 501 | 40,244 | 21,648 | Accepted | Accepted | 38.22 | N = int(eval(input()))
intervals = list(tuple(map(int,input().split())) for _ in range(N))
L = sorted(((l,i) for i,(l,r) in enumerate(intervals)))
R = sorted(((r,i) for i,(l,r) in enumerate(intervals)), reverse=True)
def helper(L,R,turn):
used = [False]*(N+1)
used[N] = True
x = 0
cost = 0
whi... | N = int(eval(input()))
intervals = tuple(tuple(map(int,input().split())) for _ in range(N))
L = sorted((l for l,r in intervals))
R = sorted((r for l,r in intervals), reverse=True)
def helper(L,R,turn):
x = 0
cost = 0
T = [L,None,R]
while True:
y = T[turn+1].pop()
if turn*(y-x) < 0:... | 30 | 24 | 601 | 485 | N = int(eval(input()))
intervals = list(tuple(map(int, input().split())) for _ in range(N))
L = sorted(((l, i) for i, (l, r) in enumerate(intervals)))
R = sorted(((r, i) for i, (l, r) in enumerate(intervals)), reverse=True)
def helper(L, R, turn):
used = [False] * (N + 1)
used[N] = True
x = 0
cost = 0... | N = int(eval(input()))
intervals = tuple(tuple(map(int, input().split())) for _ in range(N))
L = sorted((l for l, r in intervals))
R = sorted((r for l, r in intervals), reverse=True)
def helper(L, R, turn):
x = 0
cost = 0
T = [L, None, R]
while True:
y = T[turn + 1].pop()
if turn * (y ... | false | 20 | [
"-intervals = list(tuple(map(int, input().split())) for _ in range(N))",
"-L = sorted(((l, i) for i, (l, r) in enumerate(intervals)))",
"-R = sorted(((r, i) for i, (l, r) in enumerate(intervals)), reverse=True)",
"+intervals = tuple(tuple(map(int, input().split())) for _ in range(N))",
"+L = sorted((l for l... | false | 0.040937 | 0.040555 | 1.009417 | [
"s778950146",
"s029414270"
] |
u260216890 | p03048 | python | s052289024 | s834910075 | 1,502 | 219 | 3,060 | 40,668 | Accepted | Accepted | 85.42 | R, G, B, N=list(map(int, input().split()))
cnt=0
for r in range(int(N/R+1)):
for g in range(int((N-(r*R))/G+1)):
if (N-(r*R)-(g*G))%B==0:
cnt+=1
print(cnt) | r,g,b,n=list(map(int,input().split()))
ans=0
for i in range(n//r+1):
if r*i==n:
ans+=1
break
else:
for j in range((n-r*i)//g+1):
if r*i+g*j==n:
ans+=1
continue
else:
if n-(r*i+g*j)>0 and (n-(r*i+g*j))%b==... | 7 | 16 | 179 | 358 | R, G, B, N = list(map(int, input().split()))
cnt = 0
for r in range(int(N / R + 1)):
for g in range(int((N - (r * R)) / G + 1)):
if (N - (r * R) - (g * G)) % B == 0:
cnt += 1
print(cnt)
| r, g, b, n = list(map(int, input().split()))
ans = 0
for i in range(n // r + 1):
if r * i == n:
ans += 1
break
else:
for j in range((n - r * i) // g + 1):
if r * i + g * j == n:
ans += 1
continue
else:
if n - (r * i ... | false | 56.25 | [
"-R, G, B, N = list(map(int, input().split()))",
"-cnt = 0",
"-for r in range(int(N / R + 1)):",
"- for g in range(int((N - (r * R)) / G + 1)):",
"- if (N - (r * R) - (g * G)) % B == 0:",
"- cnt += 1",
"-print(cnt)",
"+r, g, b, n = list(map(int, input().split()))",
"+ans = 0",
... | false | 0.202962 | 0.310714 | 0.65321 | [
"s052289024",
"s834910075"
] |
u353519457 | p02713 | python | s857524325 | s619130461 | 1,041 | 523 | 69,496 | 68,560 | Accepted | Accepted | 49.76 | import math
from functools import reduce
k = int(eval(input()))
ans = 0
for i in range(1, k+1):
for j in range(1, k+1):
for l in range(1, k+1):
ans += reduce(math.gcd, [i, j, l])
print(ans) | import math
from functools import reduce
k = int(eval(input()))
ans = 0
for i in range(1, k+1):
for j in range(1, k+1):
for l in range(1, k+1):
#ans += reduce(math.gcd, [i, j, l])
ans += math.gcd(math.gcd(i, j), l)
print(ans) | 12 | 13 | 221 | 270 | import math
from functools import reduce
k = int(eval(input()))
ans = 0
for i in range(1, k + 1):
for j in range(1, k + 1):
for l in range(1, k + 1):
ans += reduce(math.gcd, [i, j, l])
print(ans)
| import math
from functools import reduce
k = int(eval(input()))
ans = 0
for i in range(1, k + 1):
for j in range(1, k + 1):
for l in range(1, k + 1):
# ans += reduce(math.gcd, [i, j, l])
ans += math.gcd(math.gcd(i, j), l)
print(ans)
| false | 7.692308 | [
"- ans += reduce(math.gcd, [i, j, l])",
"+ # ans += reduce(math.gcd, [i, j, l])",
"+ ans += math.gcd(math.gcd(i, j), l)"
] | false | 0.208596 | 0.181823 | 1.147251 | [
"s857524325",
"s619130461"
] |
u620084012 | p04012 | python | s889967637 | s158121434 | 165 | 21 | 38,384 | 3,316 | Accepted | Accepted | 87.27 | from collections import Counter
w = eval(input())
c = Counter(w)
s = "abcdefghijklmnopqrstuvwxyz"
for e in s:
if c[e]%2 != 0:
print("No")
exit(0)
print("Yes")
| from collections import Counter
w = eval(input())
C = Counter(w)
for e in C:
if C[e]%2 != 0:
print("No")
exit(0)
print("Yes")
| 9 | 8 | 181 | 147 | from collections import Counter
w = eval(input())
c = Counter(w)
s = "abcdefghijklmnopqrstuvwxyz"
for e in s:
if c[e] % 2 != 0:
print("No")
exit(0)
print("Yes")
| from collections import Counter
w = eval(input())
C = Counter(w)
for e in C:
if C[e] % 2 != 0:
print("No")
exit(0)
print("Yes")
| false | 11.111111 | [
"-c = Counter(w)",
"-s = \"abcdefghijklmnopqrstuvwxyz\"",
"-for e in s:",
"- if c[e] % 2 != 0:",
"+C = Counter(w)",
"+for e in C:",
"+ if C[e] % 2 != 0:"
] | false | 0.110177 | 0.046896 | 2.349399 | [
"s889967637",
"s158121434"
] |
u389910364 | p03261 | python | s239047325 | s279431204 | 332 | 159 | 20,860 | 13,544 | Accepted | Accepted | 52.11 | import bisect
import os
from collections import Counter, deque
from fractions import gcd
from functools import lru_cache
from functools import reduce
import functools
import heapq
import itertools
import math
import numpy as np
import re
import sys
if os.getenv("LOCAL"):
sys.stdin = open("_in.txt", ... | import bisect
import cmath
import heapq
import itertools
import math
import operator
import os
import re
import string
import sys
from collections import Counter, deque, defaultdict
from copy import deepcopy
from decimal import Decimal
from fractions import gcd
from functools import lru_cache, reduce
fro... | 32 | 40 | 633 | 807 | import bisect
import os
from collections import Counter, deque
from fractions import gcd
from functools import lru_cache
from functools import reduce
import functools
import heapq
import itertools
import math
import numpy as np
import re
import sys
if os.getenv("LOCAL"):
sys.stdin = open("_in.txt", "r")
sys.setrec... | import bisect
import cmath
import heapq
import itertools
import math
import operator
import os
import re
import string
import sys
from collections import Counter, deque, defaultdict
from copy import deepcopy
from decimal import Decimal
from fractions import gcd
from functools import lru_cache, reduce
from operator impo... | false | 20 | [
"-import os",
"-from collections import Counter, deque",
"-from fractions import gcd",
"-from functools import lru_cache",
"-from functools import reduce",
"-import functools",
"+import cmath",
"+import operator",
"+import os",
"+import re",
"+import string",
"+import sys",
"+from collection... | false | 0.036631 | 0.041203 | 0.889034 | [
"s239047325",
"s279431204"
] |
u086503932 | p02888 | python | s107133633 | s554507040 | 1,288 | 1,103 | 3,188 | 79,896 | Accepted | Accepted | 14.36 | #!/usr/bin/env python3
import sys
from bisect import bisect_left
def main():
N = int(eval(input()))
L = sorted(list(map(int, input().split())))
ans = 0
for i in range(N-1):
for j in range(i+1,N):
index = bisect_left(L,L[i]+L[j])
ans += max(0,index-j-1)
... | from bisect import bisect_right
N = int(eval(input()))
L = list(map(int, input().split()))
L.sort()
ans = 0
for i in range(N):
for j in range(i + 1, N):
b = L[i]
c = L[j]
M = L[i+1:j]
ans += bisect_right(M, b + c - 1) - bisect_right(M, c - b)
print(ans) | 17 | 13 | 367 | 296 | #!/usr/bin/env python3
import sys
from bisect import bisect_left
def main():
N = int(eval(input()))
L = sorted(list(map(int, input().split())))
ans = 0
for i in range(N - 1):
for j in range(i + 1, N):
index = bisect_left(L, L[i] + L[j])
ans += max(0, index - j - 1)
... | from bisect import bisect_right
N = int(eval(input()))
L = list(map(int, input().split()))
L.sort()
ans = 0
for i in range(N):
for j in range(i + 1, N):
b = L[i]
c = L[j]
M = L[i + 1 : j]
ans += bisect_right(M, b + c - 1) - bisect_right(M, c - b)
print(ans)
| false | 23.529412 | [
"-#!/usr/bin/env python3",
"-import sys",
"-from bisect import bisect_left",
"+from bisect import bisect_right",
"-",
"-def main():",
"- N = int(eval(input()))",
"- L = sorted(list(map(int, input().split())))",
"- ans = 0",
"- for i in range(N - 1):",
"- for j in range(i + 1, ... | false | 0.046385 | 0.034425 | 1.347432 | [
"s107133633",
"s554507040"
] |
u729133443 | p03821 | python | s048178859 | s739316627 | 605 | 155 | 80,472 | 11,756 | Accepted | Accepted | 74.38 | c=0
for a,b in[list(map(int,input().split()))for _ in[0]*int(eval(input()))][::-1]:c+=(b-a-c)%b
print(c) | c=0
for t in open(0).readlines()[:0:-1]:a,b=list(map(int,t.split()));c+=(-a-c)%b
print(c) | 3 | 3 | 94 | 85 | c = 0
for a, b in [list(map(int, input().split())) for _ in [0] * int(eval(input()))][::-1]:
c += (b - a - c) % b
print(c)
| c = 0
for t in open(0).readlines()[:0:-1]:
a, b = list(map(int, t.split()))
c += (-a - c) % b
print(c)
| false | 0 | [
"-for a, b in [list(map(int, input().split())) for _ in [0] * int(eval(input()))][::-1]:",
"- c += (b - a - c) % b",
"+for t in open(0).readlines()[:0:-1]:",
"+ a, b = list(map(int, t.split()))",
"+ c += (-a - c) % b"
] | false | 0.157867 | 0.114313 | 1.381007 | [
"s048178859",
"s739316627"
] |
u832526214 | p02658 | python | s342202089 | s039829494 | 61 | 49 | 21,652 | 21,560 | Accepted | Accepted | 19.67 | # -*- coding: utf-8 -*-
n = int(eval(input()))
a = list(map(int, input().split()))
res = 1
if 0 in a:
res = 0
else:
a.sort(reverse=True)
for num in a:
res *= num
if res > 10**18:
res = -1
break
print(res) | # -*- coding: utf-8 -*-
n = int(eval(input()))
a = list(map(int, input().split()))
res = 1
if 0 in a:
res = 0
else:
for num in a:
res *= num
if res > 10**18:
res = -1
break
print(res) | 14 | 13 | 238 | 214 | # -*- coding: utf-8 -*-
n = int(eval(input()))
a = list(map(int, input().split()))
res = 1
if 0 in a:
res = 0
else:
a.sort(reverse=True)
for num in a:
res *= num
if res > 10**18:
res = -1
break
print(res)
| # -*- coding: utf-8 -*-
n = int(eval(input()))
a = list(map(int, input().split()))
res = 1
if 0 in a:
res = 0
else:
for num in a:
res *= num
if res > 10**18:
res = -1
break
print(res)
| false | 7.142857 | [
"- a.sort(reverse=True)"
] | false | 0.044357 | 0.044533 | 0.996054 | [
"s342202089",
"s039829494"
] |
u780698286 | p02837 | python | s925050837 | s926444952 | 222 | 154 | 9,048 | 9,136 | Accepted | Accepted | 30.63 | n = int(eval(input()))
a = []
xy = []
for i in range(n):
a.append(int(eval(input())))
xy.append([list(map(int, input().split())) for i in range(a[-1])])
ans = 0
for i in range(2**n):
x = [1] * n
for j in range(n):
if (i>>j)&1:
x[j] = 0
flag = False
for j in range... | n = int(eval(input()))
a = [0] * n
xy = [[]] * n
for i in range(n):
a[i] = int(eval(input()))
xy[i] = [list(map(int, input().split())) for j in range(a[i])]
ans = 0
for i in range(2**n):
tf = [False] * n
for j in range(n):
if (i>>j) & 1:
tf[j] = True
flag = False
... | 25 | 24 | 596 | 567 | n = int(eval(input()))
a = []
xy = []
for i in range(n):
a.append(int(eval(input())))
xy.append([list(map(int, input().split())) for i in range(a[-1])])
ans = 0
for i in range(2**n):
x = [1] * n
for j in range(n):
if (i >> j) & 1:
x[j] = 0
flag = False
for j in range(n):
... | n = int(eval(input()))
a = [0] * n
xy = [[]] * n
for i in range(n):
a[i] = int(eval(input()))
xy[i] = [list(map(int, input().split())) for j in range(a[i])]
ans = 0
for i in range(2**n):
tf = [False] * n
for j in range(n):
if (i >> j) & 1:
tf[j] = True
flag = False
for j in r... | false | 4 | [
"-a = []",
"-xy = []",
"+a = [0] * n",
"+xy = [[]] * n",
"- a.append(int(eval(input())))",
"- xy.append([list(map(int, input().split())) for i in range(a[-1])])",
"+ a[i] = int(eval(input()))",
"+ xy[i] = [list(map(int, input().split())) for j in range(a[i])]",
"- x = [1] * n",
"+ ... | false | 0.035982 | 0.038258 | 0.940498 | [
"s925050837",
"s926444952"
] |
u433195318 | p02814 | python | s728668156 | s216479877 | 403 | 175 | 90,344 | 16,344 | Accepted | Accepted | 56.58 | import sys
import math
import fractions
import bisect
import queue
import heapq
from collections import deque
sys.setrecursionlimit(4100000)
MOD = int(1e9+7)
PI = 3.14159265358979323846264338327950288
INF = 1e18
'''
1行のint
N, K = map(int, input().split())
1行のstring
S, T = input().split()
1行の整数配列... | import sys
import math
import fractions
import bisect
import queue
import heapq
from collections import deque
sys.setrecursionlimit(4100000)
MOD = int(1e9+7)
PI = 3.14159265358979323846264338327950288
INF = 1e18
'''
1行のint
N, K = map(int, input().split())
1行のstring
S, T = input().split()
1行の整数配列... | 90 | 79 | 1,414 | 1,254 | import sys
import math
import fractions
import bisect
import queue
import heapq
from collections import deque
sys.setrecursionlimit(4100000)
MOD = int(1e9 + 7)
PI = 3.14159265358979323846264338327950288
INF = 1e18
"""
1行のint
N, K = map(int, input().split())
1行のstring
S, T = input().split()
1行の整数配列
P = list(map(int,inp... | import sys
import math
import fractions
import bisect
import queue
import heapq
from collections import deque
sys.setrecursionlimit(4100000)
MOD = int(1e9 + 7)
PI = 3.14159265358979323846264338327950288
INF = 1e18
"""
1行のint
N, K = map(int, input().split())
1行のstring
S, T = input().split()
1行の整数配列
P = list(map(int,inp... | false | 12.222222 | [
"-half = 1 # 最小公倍数の二分の一",
"-for i in range(N):",
"- A[i] //= 2",
"- half = lcm(half, A[i])",
"-ans = (M // half) // 2 + int((M // half) % 2 == 1)",
"+half = 1",
"+for a in A:",
"+ half = lcm(half, a // 2)",
"+ans = (M // half + 1) // 2",
"-\"\"\"",
"-ATTENTION: Pythonで間に合うか？？",
"- ... | false | 0.044026 | 0.08147 | 0.540403 | [
"s728668156",
"s216479877"
] |
u561231954 | p03487 | python | s612409201 | s409594532 | 117 | 87 | 14,692 | 18,676 | Accepted | Accepted | 25.64 | n=int(eval(input()))
num=list(map(int,input().split()))
num.sort()
i,cnt,ans=1,1,0
m=num[0]
while i<n:
if num[i]==m:
cnt+=1
else:
if cnt<m:
ans+=cnt
elif cnt>m:
ans+=cnt-m
m=num[i]
cnt=1
i+=1
if cnt<m:
ans+=cnt
elif cnt>m:... | from collections import Counter
n=int(eval(input()))
num=list(map(int,input().split()))
dic=Counter(num)
ans=0
for k,v in list(dic.items()):
if k<v:
ans+=v-k
elif v<k:
ans+=v
print(ans) | 22 | 12 | 340 | 197 | n = int(eval(input()))
num = list(map(int, input().split()))
num.sort()
i, cnt, ans = 1, 1, 0
m = num[0]
while i < n:
if num[i] == m:
cnt += 1
else:
if cnt < m:
ans += cnt
elif cnt > m:
ans += cnt - m
m = num[i]
cnt = 1
i += 1
if cnt < m:
a... | from collections import Counter
n = int(eval(input()))
num = list(map(int, input().split()))
dic = Counter(num)
ans = 0
for k, v in list(dic.items()):
if k < v:
ans += v - k
elif v < k:
ans += v
print(ans)
| false | 45.454545 | [
"+from collections import Counter",
"+",
"-num.sort()",
"-i, cnt, ans = 1, 1, 0",
"-m = num[0]",
"-while i < n:",
"- if num[i] == m:",
"- cnt += 1",
"- else:",
"- if cnt < m:",
"- ans += cnt",
"- elif cnt > m:",
"- ans += cnt - m",
"- ... | false | 0.114517 | 0.06369 | 1.798035 | [
"s612409201",
"s409594532"
] |
u310233294 | p03054 | python | s686865533 | s545019890 | 314 | 274 | 110,792 | 72,140 | Accepted | Accepted | 12.74 | h, w, n = list(map(int, input().split()))
sr, sc = list(map(int, input().split()))
s = list(eval(input()))
t = list(eval(input()))
sl_move, sr_move, su_move, sd_move = [], [], [], []
tl_move, tr_move, tu_move, td_move = [], [], [], []
for i in s:
if i == 'L':
sl_move += [-1]
sr_move += [0]
... | h, w, n = list(map(int, input().split()))
sr, sc = list(map(int, input().split()))
s = list(eval(input()))
t = list(eval(input()))
r, l, u, d = w, 1, 1, h
ns = list(range(n))
for i in ns[::-1]:
if t[i] == 'L' and r < w:
r += 1
elif t[i] == 'R' and l > 1:
l -= 1
elif t[i] == 'U' an... | 80 | 31 | 1,759 | 677 | h, w, n = list(map(int, input().split()))
sr, sc = list(map(int, input().split()))
s = list(eval(input()))
t = list(eval(input()))
sl_move, sr_move, su_move, sd_move = [], [], [], []
tl_move, tr_move, tu_move, td_move = [], [], [], []
for i in s:
if i == "L":
sl_move += [-1]
sr_move += [0]
s... | h, w, n = list(map(int, input().split()))
sr, sc = list(map(int, input().split()))
s = list(eval(input()))
t = list(eval(input()))
r, l, u, d = w, 1, 1, h
ns = list(range(n))
for i in ns[::-1]:
if t[i] == "L" and r < w:
r += 1
elif t[i] == "R" and l > 1:
l -= 1
elif t[i] == "U" and d < h:
... | false | 61.25 | [
"-sl_move, sr_move, su_move, sd_move = [], [], [], []",
"-tl_move, tr_move, tu_move, td_move = [], [], [], []",
"-for i in s:",
"- if i == \"L\":",
"- sl_move += [-1]",
"- sr_move += [0]",
"- su_move += [0]",
"- sd_move += [0]",
"- elif i == \"R\":",
"- sl_... | false | 0.035917 | 0.072471 | 0.495609 | [
"s686865533",
"s545019890"
] |
u363407238 | p03548 | python | s586810021 | s547155778 | 28 | 17 | 2,940 | 2,940 | Accepted | Accepted | 39.29 | x,y,z=list(map(int,input().split()))
x = x - z
sum = 0
cnt = 0
while sum <= x:
sum += y + z
cnt += 1
print((cnt - 1))
| x,y,z=list(map(int,input().split()))
print(((x-z)//(y+z))) | 9 | 2 | 127 | 51 | x, y, z = list(map(int, input().split()))
x = x - z
sum = 0
cnt = 0
while sum <= x:
sum += y + z
cnt += 1
print((cnt - 1))
| x, y, z = list(map(int, input().split()))
print(((x - z) // (y + z)))
| false | 77.777778 | [
"-x = x - z",
"-sum = 0",
"-cnt = 0",
"-while sum <= x:",
"- sum += y + z",
"- cnt += 1",
"-print((cnt - 1))",
"+print(((x - z) // (y + z)))"
] | false | 0.047355 | 0.060901 | 0.777578 | [
"s586810021",
"s547155778"
] |
u079901123 | p02675 | python | s471192697 | s791561777 | 23 | 21 | 9,008 | 9,036 | Accepted | Accepted | 8.7 | p = ['0','1','6','8']
n = eval(input())
if n[-1] == '3':
print('bon')
elif n[-1] in p:
print('pon')
else:
print('hon') | n = eval(input())
p = ['0','1','6','8']
last = n[-1]
if last == '3':
print('bon')
elif last in p:
print('pon')
else:
print('hon') | 8 | 9 | 122 | 137 | p = ["0", "1", "6", "8"]
n = eval(input())
if n[-1] == "3":
print("bon")
elif n[-1] in p:
print("pon")
else:
print("hon")
| n = eval(input())
p = ["0", "1", "6", "8"]
last = n[-1]
if last == "3":
print("bon")
elif last in p:
print("pon")
else:
print("hon")
| false | 11.111111 | [
"+n = eval(input())",
"-n = eval(input())",
"-if n[-1] == \"3\":",
"+last = n[-1]",
"+if last == \"3\":",
"-elif n[-1] in p:",
"+elif last in p:"
] | false | 0.036007 | 0.036136 | 0.996435 | [
"s471192697",
"s791561777"
] |
u977389981 | p03266 | python | s675980642 | s831867590 | 19 | 17 | 3,188 | 3,060 | Accepted | Accepted | 10.53 | n, k = list(map(int, input().split()))
if k % 2 == 1:
ans = (n // k) ** 3
else:
num = n // k
num2 = n // (k // 2) - num
ans = num ** 3 + num2 ** 3
print(ans) | n, k = list(map(int, input().split()))
ans = 0
if k % 2 == 1:
ans += (n // k) ** 3
else:
ans += (n // k) ** 3
ans += ((n // (k // 2)) - (n // k)) ** 3
print(ans) | 10 | 10 | 182 | 182 | n, k = list(map(int, input().split()))
if k % 2 == 1:
ans = (n // k) ** 3
else:
num = n // k
num2 = n // (k // 2) - num
ans = num**3 + num2**3
print(ans)
| n, k = list(map(int, input().split()))
ans = 0
if k % 2 == 1:
ans += (n // k) ** 3
else:
ans += (n // k) ** 3
ans += ((n // (k // 2)) - (n // k)) ** 3
print(ans)
| false | 0 | [
"+ans = 0",
"- ans = (n // k) ** 3",
"+ ans += (n // k) ** 3",
"- num = n // k",
"- num2 = n // (k // 2) - num",
"- ans = num**3 + num2**3",
"+ ans += (n // k) ** 3",
"+ ans += ((n // (k // 2)) - (n // k)) ** 3"
] | false | 0.082077 | 0.081402 | 1.008289 | [
"s675980642",
"s831867590"
] |
u760794812 | p03107 | python | s458793180 | s370763806 | 49 | 18 | 3,956 | 3,188 | Accepted | Accepted | 63.27 | S = eval(input())
List = list(S)
Length = len(List)
Sum = 0
for item in List:
Sum += int(item)
Answer = Length - abs(2*Sum - Length)
print(Answer) | s = eval(input())
Answer = min(s.count('0'),s.count('1'))*2
print(Answer) | 8 | 3 | 149 | 69 | S = eval(input())
List = list(S)
Length = len(List)
Sum = 0
for item in List:
Sum += int(item)
Answer = Length - abs(2 * Sum - Length)
print(Answer)
| s = eval(input())
Answer = min(s.count("0"), s.count("1")) * 2
print(Answer)
| false | 62.5 | [
"-S = eval(input())",
"-List = list(S)",
"-Length = len(List)",
"-Sum = 0",
"-for item in List:",
"- Sum += int(item)",
"-Answer = Length - abs(2 * Sum - Length)",
"+s = eval(input())",
"+Answer = min(s.count(\"0\"), s.count(\"1\")) * 2"
] | false | 0.037486 | 0.069368 | 0.5404 | [
"s458793180",
"s370763806"
] |
u380524497 | p03732 | python | s538609596 | s052270729 | 75 | 48 | 10,968 | 9,864 | Accepted | Accepted | 36 | from collections import defaultdict
def main():
n, w = list(map(int, input().split()))
items = [list(map(int, input().split())) for _ in range(n)]
DP = defaultdict(int)
DP[0] = 0
for weight, value in items:
exists = list(DP.items())
for key, total in exists:
... | from collections import defaultdict
def main():
n, w = list(map(int, input().split()))
items = [list(map(int, input().split())) for _ in range(n)]
DP = defaultdict(int)
DP[0] = 0
for weight, value in items:
exists = list(DP.items())
for key, total in exists:
... | 27 | 23 | 679 | 588 | from collections import defaultdict
def main():
n, w = list(map(int, input().split()))
items = [list(map(int, input().split())) for _ in range(n)]
DP = defaultdict(int)
DP[0] = 0
for weight, value in items:
exists = list(DP.items())
for key, total in exists:
new_key = k... | from collections import defaultdict
def main():
n, w = list(map(int, input().split()))
items = [list(map(int, input().split())) for _ in range(n)]
DP = defaultdict(int)
DP[0] = 0
for weight, value in items:
exists = list(DP.items())
for key, total in exists:
new_key = k... | false | 14.814815 | [
"+ if new_key > w:",
"+ continue",
"- candidates = [0]",
"- for weight, value in sorted(DP.items()):",
"- if weight > w:",
"- break",
"- candidates.append(value)",
"- print((max(candidates)))",
"+ print((max(DP.values())))"
] | false | 0.045362 | 0.04303 | 1.05419 | [
"s538609596",
"s052270729"
] |
u606045429 | p03487 | python | s951385916 | s444003017 | 78 | 69 | 18,676 | 23,668 | Accepted | Accepted | 11.54 | from collections import Counter
N = int(eval(input()))
A = [int(i) for i in input().split()]
ans = 0
for k, v in list(Counter(A).items()):
if k > v:
ans += v
else:
ans += v - k
print(ans) | from collections import *
eval(input())
print((sum(v if k>v else v-k for k,v in list(Counter(list(map(int,input().split()))).items())))) | 12 | 3 | 212 | 118 | from collections import Counter
N = int(eval(input()))
A = [int(i) for i in input().split()]
ans = 0
for k, v in list(Counter(A).items()):
if k > v:
ans += v
else:
ans += v - k
print(ans)
| from collections import *
eval(input())
print(
(
sum(
v if k > v else v - k
for k, v in list(Counter(list(map(int, input().split()))).items())
)
)
)
| false | 75 | [
"-from collections import Counter",
"+from collections import *",
"-N = int(eval(input()))",
"-A = [int(i) for i in input().split()]",
"-ans = 0",
"-for k, v in list(Counter(A).items()):",
"- if k > v:",
"- ans += v",
"- else:",
"- ans += v - k",
"-print(ans)",
"+eval(input... | false | 0.245314 | 0.04408 | 5.56525 | [
"s951385916",
"s444003017"
] |
u309120194 | p02819 | python | s301982532 | s648379174 | 206 | 32 | 9,108 | 9,164 | Accepted | Accepted | 84.47 | X = int(eval(input()))
while True:
flag = True
for i in range(2, X):
if X % i == 0:
flag = False
if flag: break
X += 1
print(X) | X = int(eval(input()))
# 順に素数判定を行えばよい
def is_prime(x):
if x <= 1:
return False
for i in range(2, x):
if x % i == 0:
return False
return True
p = X
while not is_prime(p):
p += 1
print(p) | 12 | 16 | 157 | 224 | X = int(eval(input()))
while True:
flag = True
for i in range(2, X):
if X % i == 0:
flag = False
if flag:
break
X += 1
print(X)
| X = int(eval(input()))
# 順に素数判定を行えばよい
def is_prime(x):
if x <= 1:
return False
for i in range(2, x):
if x % i == 0:
return False
return True
p = X
while not is_prime(p):
p += 1
print(p)
| false | 25 | [
"-while True:",
"- flag = True",
"- for i in range(2, X):",
"- if X % i == 0:",
"- flag = False",
"- if flag:",
"- break",
"- X += 1",
"-print(X)",
"+# 順に素数判定を行えばよい",
"+def is_prime(x):",
"+ if x <= 1:",
"+ return False",
"+ for i in range(... | false | 0.148721 | 0.046168 | 3.221294 | [
"s301982532",
"s648379174"
] |
u780342333 | p02390 | python | s011738840 | s551953715 | 30 | 20 | 7,604 | 5,584 | Accepted | Accepted | 33.33 | tmp = int(eval(input()))
hour = tmp // 3600
minute = (tmp - hour * 3600) // 60
second = (tmp - hour * 3600 - minute * 60)
print(("{}:{}:{}".format(hour, minute, second))) | n = int(eval(input()))
#hour
h = n // 3600
#minute
m = (n%3600)//60
#second
s = (n%60)
print(("{}:{}:{}".format(h, m, s)))
| 5 | 12 | 167 | 130 | tmp = int(eval(input()))
hour = tmp // 3600
minute = (tmp - hour * 3600) // 60
second = tmp - hour * 3600 - minute * 60
print(("{}:{}:{}".format(hour, minute, second)))
| n = int(eval(input()))
# hour
h = n // 3600
# minute
m = (n % 3600) // 60
# second
s = n % 60
print(("{}:{}:{}".format(h, m, s)))
| false | 58.333333 | [
"-tmp = int(eval(input()))",
"-hour = tmp // 3600",
"-minute = (tmp - hour * 3600) // 60",
"-second = tmp - hour * 3600 - minute * 60",
"-print((\"{}:{}:{}\".format(hour, minute, second)))",
"+n = int(eval(input()))",
"+# hour",
"+h = n // 3600",
"+# minute",
"+m = (n % 3600) // 60",
"+# second"... | false | 0.040055 | 0.046834 | 0.855251 | [
"s011738840",
"s551953715"
] |
u941438707 | p03162 | python | s540827149 | s439388428 | 548 | 390 | 22,772 | 3,188 | Accepted | Accepted | 28.83 | n=int(eval(input()))
dp=[[0]*3 for _ in range(n)]
dp[0]=list(map(int,input().split()))
for i in range(1,n):
l=list(map(int,input().split()))
dp[i][0]=l[0]+max(dp[i-1][1],dp[i-1][2])
dp[i][1]=l[1]+max(dp[i-1][0],dp[i-1][2])
dp[i][2]=l[2]+max(dp[i-1][0],dp[i-1][1])
print((max(dp[-1]))) | A=B=C=0;M=max
for i in range(int(eval(input()))):
a,b,c=list(map(int,input().split()))
A,B,C=a+M(B,C),b+M(C,A),c+M(A,B)
print((M(A,B,C))) | 9 | 5 | 300 | 135 | n = int(eval(input()))
dp = [[0] * 3 for _ in range(n)]
dp[0] = list(map(int, input().split()))
for i in range(1, n):
l = list(map(int, input().split()))
dp[i][0] = l[0] + max(dp[i - 1][1], dp[i - 1][2])
dp[i][1] = l[1] + max(dp[i - 1][0], dp[i - 1][2])
dp[i][2] = l[2] + max(dp[i - 1][0], dp[i - 1][1])
... | A = B = C = 0
M = max
for i in range(int(eval(input()))):
a, b, c = list(map(int, input().split()))
A, B, C = a + M(B, C), b + M(C, A), c + M(A, B)
print((M(A, B, C)))
| false | 44.444444 | [
"-n = int(eval(input()))",
"-dp = [[0] * 3 for _ in range(n)]",
"-dp[0] = list(map(int, input().split()))",
"-for i in range(1, n):",
"- l = list(map(int, input().split()))",
"- dp[i][0] = l[0] + max(dp[i - 1][1], dp[i - 1][2])",
"- dp[i][1] = l[1] + max(dp[i - 1][0], dp[i - 1][2])",
"- dp... | false | 0.056154 | 0.092644 | 0.606124 | [
"s540827149",
"s439388428"
] |
u631238602 | p03286 | python | s444415265 | s617537207 | 36 | 24 | 3,828 | 3,700 | Accepted | Accepted | 33.33 | from bisect import bisect_left, bisect_right
from collections import Counter, defaultdict, deque, OrderedDict
from copy import deepcopy
from functools import lru_cache, reduce
from math import ceil, floor
from sys import setrecursionlimit
import heapq
import itertools
import operator
inf = float('inf')
... | from bisect import bisect_left, bisect_right
from collections import Counter, defaultdict, deque, OrderedDict
from copy import deepcopy
from functools import lru_cache, reduce
from math import ceil, floor
from sys import setrecursionlimit
import heapq
import itertools
import operator
inf = float('inf')
... | 77 | 76 | 1,301 | 1,287 | from bisect import bisect_left, bisect_right
from collections import Counter, defaultdict, deque, OrderedDict
from copy import deepcopy
from functools import lru_cache, reduce
from math import ceil, floor
from sys import setrecursionlimit
import heapq
import itertools
import operator
inf = float("inf")
# globals
N = 0... | from bisect import bisect_left, bisect_right
from collections import Counter, defaultdict, deque, OrderedDict
from copy import deepcopy
from functools import lru_cache, reduce
from math import ceil, floor
from sys import setrecursionlimit
import heapq
import itertools
import operator
inf = float("inf")
# globals
N = 0... | false | 1.298701 | [
"+def base_10_to_n(x, n):",
"+ mod = x % n",
"+ mod = abs(mod)",
"+ div = (x - mod) // n",
"+ if div == 0:",
"+ return str(mod)",
"+ return base_10_to_n(div, n) + str(mod)",
"+",
"+",
"- if N == 0:",
"- print((0))",
"- return",
"- n = N",
"- ans... | false | 0.14121 | 0.088193 | 1.601148 | [
"s444415265",
"s617537207"
] |
u562935282 | p02744 | python | s013234717 | s415061450 | 154 | 131 | 22,504 | 15,060 | Accepted | Accepted | 14.94 | def main():
from collections import deque
from operator import itemgetter
from string import ascii_lowercase
N = int(input())
deq = deque(), deque()
curr = 0
deq[curr].append(('a', 0)) # (word,largest_char_index)
for _ in range(N - 1):
while deq[curr]:
... | def main():
from string import ascii_lowercase
N = int(input())
ans = []
def dfs(s='a', ma='a'):
if len(s) == N:
ans.append(s)
return
for c in ascii_lowercase:
dfs(s + c, max(c, ma))
if c > ma: break
dfs()
pr... | 24 | 23 | 735 | 384 | def main():
from collections import deque
from operator import itemgetter
from string import ascii_lowercase
N = int(input())
deq = deque(), deque()
curr = 0
deq[curr].append(("a", 0)) # (word,largest_char_index)
for _ in range(N - 1):
while deq[curr]:
word, largest... | def main():
from string import ascii_lowercase
N = int(input())
ans = []
def dfs(s="a", ma="a"):
if len(s) == N:
ans.append(s)
return
for c in ascii_lowercase:
dfs(s + c, max(c, ma))
if c > ma:
break
dfs()
print(*... | false | 4.166667 | [
"- from collections import deque",
"- from operator import itemgetter",
"- deq = deque(), deque()",
"- curr = 0",
"- deq[curr].append((\"a\", 0)) # (word,largest_char_index)",
"- for _ in range(N - 1):",
"- while deq[curr]:",
"- word, largest_char_index = deq[curr]... | false | 0.052322 | 0.103341 | 0.506308 | [
"s013234717",
"s415061450"
] |
u425762225 | p03325 | python | s685578275 | s551966519 | 82 | 54 | 4,148 | 10,400 | Accepted | Accepted | 34.15 | N = int(eval(input()))
a = list(map(int,input().split()))
def divide_two(x,c=0):
if x % 2 == 1:
return c
else:
return divide_two(x//2,c+1)
b = (divide_two(x) for x in a)
print((sum(list(b)))) | #!/usr/bin/env python3
# import sys
# sys.recursionlimit(10**7)
from functools import reduce
def divideCount(k):
cnt = 0
while k % 2 == 0:
k //= 2
cnt += 1
return cnt
def solve(a):
return sum(
map(
divideCount,a
)
)
def main():
... | 12 | 30 | 209 | 458 | N = int(eval(input()))
a = list(map(int, input().split()))
def divide_two(x, c=0):
if x % 2 == 1:
return c
else:
return divide_two(x // 2, c + 1)
b = (divide_two(x) for x in a)
print((sum(list(b))))
| #!/usr/bin/env python3
# import sys
# sys.recursionlimit(10**7)
from functools import reduce
def divideCount(k):
cnt = 0
while k % 2 == 0:
k //= 2
cnt += 1
return cnt
def solve(a):
return sum(map(divideCount, a))
def main():
_ = int(eval(input()))
a = list(map(int, input().... | false | 60 | [
"-N = int(eval(input()))",
"-a = list(map(int, input().split()))",
"+#!/usr/bin/env python3",
"+# import sys",
"+# sys.recursionlimit(10**7)",
"+from functools import reduce",
"-def divide_two(x, c=0):",
"- if x % 2 == 1:",
"- return c",
"- else:",
"- return divide_two(x // 2... | false | 0.045105 | 0.035258 | 1.279276 | [
"s685578275",
"s551966519"
] |
u312025627 | p03076 | python | s920808501 | s807568313 | 164 | 18 | 38,384 | 3,064 | Accepted | Accepted | 89.02 | from math import ceil
ord = [int(eval(input())) for _ in range(5)]
max_wait = 0
max_idx = 0
for i in range(5):
cur = ceil(ord[i] / 10) * 10 - ord[i]
if max_wait < cur:
max_wait = cur
max_idx = i
ans = 0
for i in range(5):
if i != max_idx:
ans += ceil(ord[i] / 10) * 10
an... | ant = [int(eval(input())) for _ in range(5)]
minidx = 0
minval = 124
i = 0
for a in ant:
while 10 < a:
a %= 10
if a == 0:
a = 10
if a < minval:
minidx = i
minval = a
i += 1
ans = 0
for i in range(5):
if i == minidx:
continue
fa... | 15 | 26 | 343 | 422 | from math import ceil
ord = [int(eval(input())) for _ in range(5)]
max_wait = 0
max_idx = 0
for i in range(5):
cur = ceil(ord[i] / 10) * 10 - ord[i]
if max_wait < cur:
max_wait = cur
max_idx = i
ans = 0
for i in range(5):
if i != max_idx:
ans += ceil(ord[i] / 10) * 10
ans += ord[max... | ant = [int(eval(input())) for _ in range(5)]
minidx = 0
minval = 124
i = 0
for a in ant:
while 10 < a:
a %= 10
if a == 0:
a = 10
if a < minval:
minidx = i
minval = a
i += 1
ans = 0
for i in range(5):
if i == minidx:
continue
fact = 10
while fac... | false | 42.307692 | [
"-from math import ceil",
"-",
"-ord = [int(eval(input())) for _ in range(5)]",
"-max_wait = 0",
"-max_idx = 0",
"-for i in range(5):",
"- cur = ceil(ord[i] / 10) * 10 - ord[i]",
"- if max_wait < cur:",
"- max_wait = cur",
"- max_idx = i",
"+ant = [int(eval(input())) for _ in... | false | 0.238432 | 0.03748 | 6.361498 | [
"s920808501",
"s807568313"
] |
u796942881 | p03673 | python | s889353486 | s170627561 | 157 | 97 | 29,660 | 26,588 | Accepted | Accepted | 38.22 | from collections import deque
def main():
n, *a = list(map(int, open(0).read().split()))
dq = deque()
n -= 1
for i, ai in enumerate(a):
if i % 2 == n % 2:
dq.appendleft(ai)
else:
dq.append(ai)
print((" ".join(map(str, dq))))
return
main... | from collections import deque
def main():
n, *a = open(0).read().split()
dq = deque()
n = int(n) - 1
for i, ai in enumerate(a):
if i % 2 == n % 2:
dq.appendleft(ai)
else:
dq.append(ai)
print((" ".join(dq)))
return
main()
| 17 | 17 | 315 | 303 | from collections import deque
def main():
n, *a = list(map(int, open(0).read().split()))
dq = deque()
n -= 1
for i, ai in enumerate(a):
if i % 2 == n % 2:
dq.appendleft(ai)
else:
dq.append(ai)
print((" ".join(map(str, dq))))
return
main()
| from collections import deque
def main():
n, *a = open(0).read().split()
dq = deque()
n = int(n) - 1
for i, ai in enumerate(a):
if i % 2 == n % 2:
dq.appendleft(ai)
else:
dq.append(ai)
print((" ".join(dq)))
return
main()
| false | 0 | [
"- n, *a = list(map(int, open(0).read().split()))",
"+ n, *a = open(0).read().split()",
"- n -= 1",
"+ n = int(n) - 1",
"- print((\" \".join(map(str, dq))))",
"+ print((\" \".join(dq)))"
] | false | 0.050295 | 0.040416 | 1.244433 | [
"s889353486",
"s170627561"
] |
u413165887 | p02793 | python | s325319712 | s829725943 | 1,224 | 665 | 4,972 | 4,852 | Accepted | Accepted | 45.67 | from collections import defaultdict
n = int(eval(input()))
a = list(map(int, input().split()))
mod = 10**9 + 7
memo = defaultdict(int)
base = 0
for i in a:
base = (base+pow(i, mod-2, mod))%mod
num = i
for j in range(2, int(i**.5)+1):
if num%j==0:
c = 0
while num... | from collections import defaultdict
n = int(eval(input()))
a = list(map(int, input().split()))
mod = 10**9 + 7
memo = defaultdict(int)
base = 0
for i in a:
base = (base+pow(i, mod-2, mod))%mod
num = i
c = 0
while num%2==0:
c += 1
num //= 2
memo[2] = max(memo[2], c)
... | 24 | 29 | 556 | 657 | from collections import defaultdict
n = int(eval(input()))
a = list(map(int, input().split()))
mod = 10**9 + 7
memo = defaultdict(int)
base = 0
for i in a:
base = (base + pow(i, mod - 2, mod)) % mod
num = i
for j in range(2, int(i**0.5) + 1):
if num % j == 0:
c = 0
while num... | from collections import defaultdict
n = int(eval(input()))
a = list(map(int, input().split()))
mod = 10**9 + 7
memo = defaultdict(int)
base = 0
for i in a:
base = (base + pow(i, mod - 2, mod)) % mod
num = i
c = 0
while num % 2 == 0:
c += 1
num //= 2
memo[2] = max(memo[2], c)
for... | false | 17.241379 | [
"- for j in range(2, int(i**0.5) + 1):",
"+ c = 0",
"+ while num % 2 == 0:",
"+ c += 1",
"+ num //= 2",
"+ memo[2] = max(memo[2], c)",
"+ for j in range(3, int(i**0.5) + 1, 2):"
] | false | 0.081651 | 0.039737 | 2.054793 | [
"s325319712",
"s829725943"
] |
u011062360 | p03487 | python | s877753368 | s249068150 | 196 | 78 | 26,356 | 18,672 | Accepted | Accepted | 60.2 | n = int(eval(input()))
list_A = list(map(int, input().split()))
set_a = list(set(list_A))
dic_A = dict()
for i in range(len(set_a)):
j = str(set_a[i])
dic_A[j] = 0
for i in list_A:
j = str(i)
dic_A[j] += 1
ans = 0
for s, i in list(dic_A.items()):
c = int(s)
if i >= c:
a... | from collections import Counter
n = int(eval(input()))
list_A = list(map(int, input().split()))
l = Counter(list_A)
ans = 0
for s, i in list(l.items()):
if i >= s:
ans += i - s
else:
ans += i
print(ans) | 21 | 12 | 362 | 226 | n = int(eval(input()))
list_A = list(map(int, input().split()))
set_a = list(set(list_A))
dic_A = dict()
for i in range(len(set_a)):
j = str(set_a[i])
dic_A[j] = 0
for i in list_A:
j = str(i)
dic_A[j] += 1
ans = 0
for s, i in list(dic_A.items()):
c = int(s)
if i >= c:
ans += i - c
el... | from collections import Counter
n = int(eval(input()))
list_A = list(map(int, input().split()))
l = Counter(list_A)
ans = 0
for s, i in list(l.items()):
if i >= s:
ans += i - s
else:
ans += i
print(ans)
| false | 42.857143 | [
"+from collections import Counter",
"+",
"-set_a = list(set(list_A))",
"-dic_A = dict()",
"-for i in range(len(set_a)):",
"- j = str(set_a[i])",
"- dic_A[j] = 0",
"-for i in list_A:",
"- j = str(i)",
"- dic_A[j] += 1",
"+l = Counter(list_A)",
"-for s, i in list(dic_A.items()):",
... | false | 0.039921 | 0.033902 | 1.177527 | [
"s877753368",
"s249068150"
] |
u201928947 | p02561 | python | s442533299 | s772519670 | 287 | 240 | 88,276 | 86,136 | Accepted | Accepted | 16.38 | # Dinic's algorithm
#https://tjkendev.github.io/procon-library/python/max_flow/dinic.htmlより
from collections import deque
class Dinic:
def __init__(self, N):
self.N = N
self.G = [[] for i in range(N)]
def add_edge(self, fr, to, cap):
forward = [to, cap, None]
forward[2... | from collections import deque
class mf_graph:
def __init__(self,N):
self.N = N
self.graph = [[] for _ in range(N)]
def add_edge(self,v,w,cap):
edge = [w,cap,None]
edge[2] = rev_edge = [v,0,edge]
self.graph[v].append(edge)
self.graph[w].append(rev_... | 107 | 109 | 3,074 | 3,128 | # Dinic's algorithm
# https://tjkendev.github.io/procon-library/python/max_flow/dinic.htmlより
from collections import deque
class Dinic:
def __init__(self, N):
self.N = N
self.G = [[] for i in range(N)]
def add_edge(self, fr, to, cap):
forward = [to, cap, None]
forward[2] = bac... | from collections import deque
class mf_graph:
def __init__(self, N):
self.N = N
self.graph = [[] for _ in range(N)]
def add_edge(self, v, w, cap):
edge = [w, cap, None]
edge[2] = rev_edge = [v, 0, edge]
self.graph[v].append(edge)
self.graph[w].append(rev_edge)
... | false | 1.834862 | [
"-# Dinic's algorithm",
"-# https://tjkendev.github.io/procon-library/python/max_flow/dinic.htmlより",
"-class Dinic:",
"+class mf_graph:",
"- self.G = [[] for i in range(N)]",
"+ self.graph = [[] for _ in range(N)]",
"- def add_edge(self, fr, to, cap):",
"- forward = [to, cap, N... | false | 0.064363 | 0.036899 | 1.744311 | [
"s442533299",
"s772519670"
] |
u368796742 | p03700 | python | s833722867 | s984684989 | 545 | 304 | 50,392 | 44,124 | Accepted | Accepted | 44.22 | n,a,b = list(map(int,input().split()))
h = [int(eval(input())) for i in range(n)]
t = a-b
r = (max(h)+b-1)//b
l = 0
while r-l > 1:
m = (r+l)//2
mi = m*b
count = 0
for i in h:
if i > mi:
count += (i-mi+t-1)//t
if count <= m:
r = m
else:
l = m
pr... | import sys
input = sys.stdin.readline
n,a,b = list(map(int,input().split()))
h = [int(eval(input())) for i in range(n)]
t = a-b
r = (max(h)+b-1)//b
l = 0
while r-l > 1:
m = (r+l)//2
mi = m*b
count = 0
for i in h:
if i > mi:
count += (i-mi+t-1)//t
if count <= m:
... | 17 | 19 | 314 | 354 | n, a, b = list(map(int, input().split()))
h = [int(eval(input())) for i in range(n)]
t = a - b
r = (max(h) + b - 1) // b
l = 0
while r - l > 1:
m = (r + l) // 2
mi = m * b
count = 0
for i in h:
if i > mi:
count += (i - mi + t - 1) // t
if count <= m:
r = m
else:
... | import sys
input = sys.stdin.readline
n, a, b = list(map(int, input().split()))
h = [int(eval(input())) for i in range(n)]
t = a - b
r = (max(h) + b - 1) // b
l = 0
while r - l > 1:
m = (r + l) // 2
mi = m * b
count = 0
for i in h:
if i > mi:
count += (i - mi + t - 1) // t
if co... | false | 10.526316 | [
"+import sys",
"+",
"+input = sys.stdin.readline"
] | false | 0.122231 | 0.036952 | 3.307816 | [
"s833722867",
"s984684989"
] |
u141610915 | p02863 | python | s480450967 | s465745622 | 817 | 508 | 115,804 | 114,780 | Accepted | Accepted | 37.82 | import sys
input = sys.stdin.readline
N, T = list(map(int, input().split()))
d = []
for _ in range(N):
d.append(list(map(int, input().split())))
d.sort(key = lambda x: x[0])
dp = [[0] * (T + 1) for _ in range(N + 1)]
res = 0
for i in range(N):
for j in range(T):
dp[i + 1][j] = max(dp[i + 1][j], dp[... | import sys
input = sys.stdin.readline
N, T = list(map(int, input().split()))
a = []
for _ in range(N):
w, v = list(map(int, input().split()))
a.append((w, v))
a.sort()
dp = [[0] * (T + 1) for _ in range(N + 1)]
for i in range(N):
w, v = a[i]
for j in range(T):
if j + w >= T:
dp[i + 1][T] ... | 19 | 19 | 566 | 528 | import sys
input = sys.stdin.readline
N, T = list(map(int, input().split()))
d = []
for _ in range(N):
d.append(list(map(int, input().split())))
d.sort(key=lambda x: x[0])
dp = [[0] * (T + 1) for _ in range(N + 1)]
res = 0
for i in range(N):
for j in range(T):
dp[i + 1][j] = max(dp[i + 1][j], dp[i][j])... | import sys
input = sys.stdin.readline
N, T = list(map(int, input().split()))
a = []
for _ in range(N):
w, v = list(map(int, input().split()))
a.append((w, v))
a.sort()
dp = [[0] * (T + 1) for _ in range(N + 1)]
for i in range(N):
w, v = a[i]
for j in range(T):
if j + w >= T:
dp[i + ... | false | 0 | [
"-d = []",
"+a = []",
"- d.append(list(map(int, input().split())))",
"-d.sort(key=lambda x: x[0])",
"+ w, v = list(map(int, input().split()))",
"+ a.append((w, v))",
"+a.sort()",
"-res = 0",
"+ w, v = a[i]",
"+ if j + w >= T:",
"+ dp[i + 1][T] = max(dp[i + 1][T], dp... | false | 0.043899 | 0.047831 | 0.917791 | [
"s480450967",
"s465745622"
] |
u197300260 | p03095 | python | s753965633 | s876250073 | 46 | 25 | 4,660 | 3,444 | Accepted | Accepted | 45.65 | # _*_ coding:utf-8 _*_
# Atcoder_Grand_Contest031-A
# TODO https://atcoder.jp/contests/agc031/tasks/agc031_a
from collections import Counter
def solveProblem(S):
# Sはサンプル3の[abcab]を取って説明
SSorted = sorted(S)
# SSorted = aabbc
stringCounterBox = Counter(SSorted)
# [(a,2),(b,2),(c,1)]
maxStrLength = len... | # _*_ coding:utf-8 _*_
# Atcoder_Grand_Contest031-A
# TODO https://atcoder.jp/contests/agc031/tasks/agc031_a
from collections import Counter
def solveProblem(S):
# Sはサンプル3の[abcab]を取って説明
# SSorted = sorted(S)
# SSorted = aabbc
# Counterクラスを使うと整列もしれくれるのでソートは不要と判断
stringCounterBox = Counter(S)
# [(a,2)... | 43 | 43 | 1,164 | 1,048 | # _*_ coding:utf-8 _*_
# Atcoder_Grand_Contest031-A
# TODO https://atcoder.jp/contests/agc031/tasks/agc031_a
from collections import Counter
def solveProblem(S):
# Sはサンプル3の[abcab]を取って説明
SSorted = sorted(S)
# SSorted = aabbc
stringCounterBox = Counter(SSorted)
# [(a,2),(b,2),(c,1)]
maxStrLeng... | # _*_ coding:utf-8 _*_
# Atcoder_Grand_Contest031-A
# TODO https://atcoder.jp/contests/agc031/tasks/agc031_a
from collections import Counter
def solveProblem(S):
# Sはサンプル3の[abcab]を取って説明
# SSorted = sorted(S)
# SSorted = aabbc
# Counterクラスを使うと整列もしれくれるのでソートは不要と判断
stringCounterBox = Counter(S)
... | false | 0 | [
"- SSorted = sorted(S)",
"+ # SSorted = sorted(S)",
"- stringCounterBox = Counter(SSorted)",
"+ # Counterクラスを使うと整列もしれくれるのでソートは不要と判断",
"+ stringCounterBox = Counter(S)",
"- # print(\"maxStringLength:{}\".format(maxStrLength))",
"- # print(\"countList:{}\".format(countList))",
"-\t1... | false | 0.046823 | 0.037817 | 1.238165 | [
"s753965633",
"s876250073"
] |
u698919163 | p03456 | python | s240892928 | s004616631 | 24 | 17 | 2,940 | 3,064 | Accepted | Accepted | 29.17 | a,b = list(map(str,input().split()))
for i in range(1,10001):
if i**2 == int(a+b):
print('Yes')
exit()
print('No') | a,b = list(map(str,input().split()))
N = int(a+b)
import sys
for i in range(1,int(N**0.5)+1):
if i**2 == N:
print('Yes')
sys.exit()
print('No') | 8 | 12 | 145 | 180 | a, b = list(map(str, input().split()))
for i in range(1, 10001):
if i**2 == int(a + b):
print("Yes")
exit()
print("No")
| a, b = list(map(str, input().split()))
N = int(a + b)
import sys
for i in range(1, int(N**0.5) + 1):
if i**2 == N:
print("Yes")
sys.exit()
print("No")
| false | 33.333333 | [
"-for i in range(1, 10001):",
"- if i**2 == int(a + b):",
"+N = int(a + b)",
"+import sys",
"+",
"+for i in range(1, int(N**0.5) + 1):",
"+ if i**2 == N:",
"- exit()",
"+ sys.exit()"
] | false | 0.048491 | 0.036445 | 1.330538 | [
"s240892928",
"s004616631"
] |
u063052907 | p03031 | python | s001110373 | s635382232 | 55 | 37 | 3,064 | 3,064 | Accepted | Accepted | 32.73 | n, m = list(map(int, input().split()))
lst_sw = []
for _ in range(m):
lst_sw.append(list(map(int, input().split())))
lst_p = list(map(int, input().split()))
ans = 0
for bits in range(2 ** n):
judge = True
for i in range(m):
cnt = 0
for j in range(1, len(lst_sw[i])):
... | n, m = list(map(int, input().split()))
lst_sw = []
for _ in range(m):
lst_sw.append(list(map(int, input().split())))
lst_p = list(map(int, input().split()))
ans = 0
for bits in range(2 ** n):
judge = True
for i in range(m):
cnt_sw_on = 0
for j in range(1, len(lst_sw[i])):
... | 26 | 26 | 566 | 550 | n, m = list(map(int, input().split()))
lst_sw = []
for _ in range(m):
lst_sw.append(list(map(int, input().split())))
lst_p = list(map(int, input().split()))
ans = 0
for bits in range(2**n):
judge = True
for i in range(m):
cnt = 0
for j in range(1, len(lst_sw[i])):
sw = lst_sw[i][... | n, m = list(map(int, input().split()))
lst_sw = []
for _ in range(m):
lst_sw.append(list(map(int, input().split())))
lst_p = list(map(int, input().split()))
ans = 0
for bits in range(2**n):
judge = True
for i in range(m):
cnt_sw_on = 0
for j in range(1, len(lst_sw[i])):
sw = lst_... | false | 0 | [
"- cnt = 0",
"+ cnt_sw_on = 0",
"- # if (1 << (sw - 1)) & bits: # こちらの判定でも良い",
"- cnt += 1",
"- if cnt % 2 != lst_p[i]:",
"+ cnt_sw_on += 1",
"+ if cnt_sw_on % 2 != lst_p[i]:",
"+ break"
] | false | 0.035881 | 0.046022 | 0.779658 | [
"s001110373",
"s635382232"
] |
u138486156 | p03112 | python | s073815398 | s125621238 | 1,844 | 1,069 | 12,060 | 12,204 | Accepted | Accepted | 42.03 | import bisect
a, b, q = list(map(int, input().split()))
s = [int(eval(input())) for _ in range(a)]
t = [int(eval(input())) for _ in range(b)]
for i in range(q):
x = int(eval(input()))
idx_s = bisect.bisect_left(s, x)
idx_t = bisect.bisect_left(t, x)
indices_s = []
indices_t = []
if... | import sys
import bisect
input = sys.stdin.readline
a, b, q = list(map(int, input().split()))
s = [int(eval(input())) for _ in range(a)]
t = [int(eval(input())) for _ in range(b)]
for i in range(q):
x = int(eval(input()))
idx_s = bisect.bisect_left(s, x)
idx_t = bisect.bisect_left(t, x)
indi... | 40 | 42 | 998 | 1,038 | import bisect
a, b, q = list(map(int, input().split()))
s = [int(eval(input())) for _ in range(a)]
t = [int(eval(input())) for _ in range(b)]
for i in range(q):
x = int(eval(input()))
idx_s = bisect.bisect_left(s, x)
idx_t = bisect.bisect_left(t, x)
indices_s = []
indices_t = []
if idx_s == 0:
... | import sys
import bisect
input = sys.stdin.readline
a, b, q = list(map(int, input().split()))
s = [int(eval(input())) for _ in range(a)]
t = [int(eval(input())) for _ in range(b)]
for i in range(q):
x = int(eval(input()))
idx_s = bisect.bisect_left(s, x)
idx_t = bisect.bisect_left(t, x)
indices_s = []
... | false | 4.761905 | [
"+import sys",
"+input = sys.stdin.readline"
] | false | 0.081009 | 0.061139 | 1.325001 | [
"s073815398",
"s125621238"
] |
u920103253 | p02629 | python | s147904405 | s440029750 | 35 | 30 | 9,180 | 9,248 | Accepted | Accepted | 14.29 |
def s0():return eval(input())
def s1():return input().split()
def s2(n):return [eval(input()) for x in range(n)]
def s3(n):return [input().split() for _ in range(n)]
def s4(n):return [[x for x in s] for s in s2(n)]
def n0():return int(eval(input()))
def n1():return [int(x) for x in input().split()]
def n2(n):r... |
def s0():return eval(input())
def s1():return input().split()
def s2(n):return [eval(input()) for x in range(n)]
def s3(n):return [input().split() for _ in range(n)]
def s4(n):return [[x for x in s] for s in s2(n)]
def n0():return int(eval(input()))
def n1():return [int(x) for x in input().split()]
def n2(n):r... | 31 | 31 | 1,070 | 1,063 | def s0():
return eval(input())
def s1():
return input().split()
def s2(n):
return [eval(input()) for x in range(n)]
def s3(n):
return [input().split() for _ in range(n)]
def s4(n):
return [[x for x in s] for s in s2(n)]
def n0():
return int(eval(input()))
def n1():
return [int(x)... | def s0():
return eval(input())
def s1():
return input().split()
def s2(n):
return [eval(input()) for x in range(n)]
def s3(n):
return [input().split() for _ in range(n)]
def s4(n):
return [[x for x in s] for s in s2(n)]
def n0():
return int(eval(input()))
def n1():
return [int(x)... | false | 0 | [
"- return chr(64 + num)",
"+ return chr(96 + num)",
"- return num2alpha(num // 26 - 1) + chr(90)",
"+ return num2alpha(num // 26 - 1) + chr(122)",
"- return num2alpha(num // 26) + chr(64 + num % 26)",
"+ return num2alpha(num // 26) + chr(96 + num % 26)",
"-print... | false | 0.039012 | 0.038325 | 1.017929 | [
"s147904405",
"s440029750"
] |
u604839890 | p02675 | python | s589865241 | s536336519 | 65 | 27 | 61,820 | 9,140 | Accepted | Accepted | 58.46 | n = int(eval(input()))
n %= 10
if n == 3:
print('bon')
elif n == 0 or n == 1 or n == 6 or n == 8:
print('pon')
else:
print('hon') | n = int(eval(input()))
n %= 10
if n == 3:
print('bon')
elif n in [0, 1, 6, 8]:
print('pon')
else:
print('hon') | 8 | 8 | 136 | 124 | n = int(eval(input()))
n %= 10
if n == 3:
print("bon")
elif n == 0 or n == 1 or n == 6 or n == 8:
print("pon")
else:
print("hon")
| n = int(eval(input()))
n %= 10
if n == 3:
print("bon")
elif n in [0, 1, 6, 8]:
print("pon")
else:
print("hon")
| false | 0 | [
"-elif n == 0 or n == 1 or n == 6 or n == 8:",
"+elif n in [0, 1, 6, 8]:"
] | false | 0.110593 | 0.039754 | 2.781934 | [
"s589865241",
"s536336519"
] |
u971091945 | p02785 | python | s503579217 | s849571307 | 174 | 157 | 26,180 | 26,180 | Accepted | Accepted | 9.77 | n, k = list(map(int, input().split()))
h = list(map(int, input().split()))
h.sort()
ans = 0
for i in range(n-k):
ans += h[i]
print(ans) | n,k = list(map(int,input().split()))
h = list(map(int,input().split()))
h_sort = sorted(h, reverse=True)
ans = sum(h_sort[k:])
print(ans) | 10 | 7 | 145 | 139 | n, k = list(map(int, input().split()))
h = list(map(int, input().split()))
h.sort()
ans = 0
for i in range(n - k):
ans += h[i]
print(ans)
| n, k = list(map(int, input().split()))
h = list(map(int, input().split()))
h_sort = sorted(h, reverse=True)
ans = sum(h_sort[k:])
print(ans)
| false | 30 | [
"-h.sort()",
"-ans = 0",
"-for i in range(n - k):",
"- ans += h[i]",
"+h_sort = sorted(h, reverse=True)",
"+ans = sum(h_sort[k:])"
] | false | 0.047551 | 0.047693 | 0.997014 | [
"s503579217",
"s849571307"
] |
u556589653 | p02935 | python | s819155240 | s194572600 | 174 | 17 | 38,512 | 3,060 | Accepted | Accepted | 90.23 | import math
N = int(eval(input()))
v = list(map(int,input().split()))
v_new = 0
#新しい具材の価値をv_newとした
a = 0
k = []
#kで
p = N
for i in range(N-1):
#全ての要素が同じ場合は終了する
if v.count(v[0]) == p:
break
else:
x = min(v)
v.remove(x)
#xをvのリストから除外
y = min(v)
v_new... | N = int(eval(input()))
v = list(map(int,input().split()))
v.sort()
for i in range(N-1):
S = (v[0]+v[1])/2
v.append(S)
v.remove(v[0])
v.remove(v[0])
v.sort()
print((*v)) | 31 | 10 | 544 | 189 | import math
N = int(eval(input()))
v = list(map(int, input().split()))
v_new = 0
# 新しい具材の価値をv_newとした
a = 0
k = []
# kで
p = N
for i in range(N - 1):
# 全ての要素が同じ場合は終了する
if v.count(v[0]) == p:
break
else:
x = min(v)
v.remove(x)
# xをvのリストから除外
y = min(v)
v_new = (x... | N = int(eval(input()))
v = list(map(int, input().split()))
v.sort()
for i in range(N - 1):
S = (v[0] + v[1]) / 2
v.append(S)
v.remove(v[0])
v.remove(v[0])
v.sort()
print((*v))
| false | 67.741935 | [
"-import math",
"-",
"-v_new = 0",
"-# 新しい具材の価値をv_newとした",
"-a = 0",
"-k = []",
"-# kで",
"-p = N",
"+v.sort()",
"- # 全ての要素が同じ場合は終了する",
"- if v.count(v[0]) == p:",
"- break",
"- else:",
"- x = min(v)",
"- v.remove(x)",
"- # xをvのリストから除外",
"- ... | false | 0.035523 | 0.035812 | 0.991952 | [
"s819155240",
"s194572600"
] |
u815797488 | p03814 | python | s565338707 | s712610864 | 35 | 17 | 3,516 | 3,500 | Accepted | Accepted | 51.43 | s = eval(input())
for i in range(len(s)):
if s[i] == 'A':
a = i
break
for k in range(len(s)-1, -1, -1):
if s[k] == 'Z':
b = k
break
print((b - a + 1 )) | s = eval(input())
a = s.find('A')
b = s.rfind('Z')
print((b-a+1)) | 12 | 4 | 176 | 60 | s = eval(input())
for i in range(len(s)):
if s[i] == "A":
a = i
break
for k in range(len(s) - 1, -1, -1):
if s[k] == "Z":
b = k
break
print((b - a + 1))
| s = eval(input())
a = s.find("A")
b = s.rfind("Z")
print((b - a + 1))
| false | 66.666667 | [
"-for i in range(len(s)):",
"- if s[i] == \"A\":",
"- a = i",
"- break",
"-for k in range(len(s) - 1, -1, -1):",
"- if s[k] == \"Z\":",
"- b = k",
"- break",
"+a = s.find(\"A\")",
"+b = s.rfind(\"Z\")"
] | false | 0.037876 | 0.092116 | 0.411174 | [
"s565338707",
"s712610864"
] |
u426534722 | p02296 | python | s233872979 | s496173175 | 50 | 40 | 8,288 | 8,188 | Accepted | Accepted | 20 | import sys
from collections import namedtuple
from itertools import starmap
readline = sys.stdin.readline
EPS = 1e-9
class Segment(object):
__slots__ = ('fi', 'se')
def __init__(self, fi, se):
self.fi = fi
self.se = se
def cross(a, b):
return a.real * b.imag - a.imag * b.real
def... | import sys
from collections import namedtuple
from itertools import starmap
readline = sys.stdin.readline
EPS = 1e-9
class Segment(namedtuple('Point', ('fi', 'se'))):
__slots__ = ()
def cross(a, b):
return a.real * b.imag - a.imag * b.real
def dot(a, b):
return a.real * b.real + a.imag * b.imag
d... | 53 | 49 | 1,804 | 1,706 | import sys
from collections import namedtuple
from itertools import starmap
readline = sys.stdin.readline
EPS = 1e-9
class Segment(object):
__slots__ = ("fi", "se")
def __init__(self, fi, se):
self.fi = fi
self.se = se
def cross(a, b):
return a.real * b.imag - a.imag * b.real
def dot... | import sys
from collections import namedtuple
from itertools import starmap
readline = sys.stdin.readline
EPS = 1e-9
class Segment(namedtuple("Point", ("fi", "se"))):
__slots__ = ()
def cross(a, b):
return a.real * b.imag - a.imag * b.real
def dot(a, b):
return a.real * b.real + a.imag * b.imag
def... | false | 7.54717 | [
"-class Segment(object):",
"- __slots__ = (\"fi\", \"se\")",
"-",
"- def __init__(self, fi, se):",
"- self.fi = fi",
"- self.se = se",
"+class Segment(namedtuple(\"Point\", (\"fi\", \"se\"))):",
"+ __slots__ = ()",
"- li = tuple(map(int, readline().split()))",
"- p0, p... | false | 0.051798 | 0.039977 | 1.295704 | [
"s233872979",
"s496173175"
] |
u401452016 | p03162 | python | s370256672 | s296394940 | 507 | 466 | 47,280 | 47,384 | Accepted | Accepted | 8.09 | import sys
n = int(sys.stdin.readline())
L = [list(map(int, sys.stdin.readline().split())) for _ in range(n)]
p = [[0 for _ in range(3)] for _ in range(n)]
p[0] = L[0].copy()
#print(p)
#print(L)
for d in range(1, n):
for i in range(3):
if i ==0:
p[d][0] = max(p[d-1][1], p[d-1][2]... | import sys
n = int(sys.stdin.readline())
L = [list(map(int, sys.stdin.readline().split())) for _ in range(n)]
#print(L)
dp = [[0 for _ in range(3)] for _ in range(n)]
dp[0] = L[0].copy()
for i in range(1,n):
dp[i][0] = max(dp[i-1][1], dp[i-1][2]) + L[i][0]
dp[i][1] = max(dp[i-1][0], dp[i-1][2]) + L[... | 20 | 14 | 511 | 401 | import sys
n = int(sys.stdin.readline())
L = [list(map(int, sys.stdin.readline().split())) for _ in range(n)]
p = [[0 for _ in range(3)] for _ in range(n)]
p[0] = L[0].copy()
# print(p)
# print(L)
for d in range(1, n):
for i in range(3):
if i == 0:
p[d][0] = max(p[d - 1][1], p[d - 1][2]) + L[d]... | import sys
n = int(sys.stdin.readline())
L = [list(map(int, sys.stdin.readline().split())) for _ in range(n)]
# print(L)
dp = [[0 for _ in range(3)] for _ in range(n)]
dp[0] = L[0].copy()
for i in range(1, n):
dp[i][0] = max(dp[i - 1][1], dp[i - 1][2]) + L[i][0]
dp[i][1] = max(dp[i - 1][0], dp[i - 1][2]) + L[i... | false | 30 | [
"-p = [[0 for _ in range(3)] for _ in range(n)]",
"-p[0] = L[0].copy()",
"-# print(p)",
"-for d in range(1, n):",
"- for i in range(3):",
"- if i == 0:",
"- p[d][0] = max(p[d - 1][1], p[d - 1][2]) + L[d][0]",
"- elif i == 1:",
"- p[d][1] = max(p[d - 1][0], p[d ... | false | 0.036621 | 0.036314 | 1.008451 | [
"s370256672",
"s296394940"
] |
u260216890 | p03818 | python | s200438669 | s359238863 | 449 | 212 | 73,580 | 58,924 | Accepted | Accepted | 52.78 | n=int(eval(input()))
a=list(map(int,input().split()))
from collections import Counter
import heapq
cou=Counter(a)
c=[]
for k in list(cou.keys()):
c.append((-cou[k], k))
heapq.heapify(c)
v1,k1=heapq.heappop(c)
while v1<-1:
if v1<-2:
v1+=2
heapq.heappush(c, (v1,k1))
else:
... | n=int(eval(input()))
a=list(map(int,input().split()))
x=len(set(a))
if x%2==1:
print(x)
else:
print((x-1))
| 29 | 8 | 601 | 115 | n = int(eval(input()))
a = list(map(int, input().split()))
from collections import Counter
import heapq
cou = Counter(a)
c = []
for k in list(cou.keys()):
c.append((-cou[k], k))
heapq.heapify(c)
v1, k1 = heapq.heappop(c)
while v1 < -1:
if v1 < -2:
v1 += 2
heapq.heappush(c, (v1, k1))
else:
... | n = int(eval(input()))
a = list(map(int, input().split()))
x = len(set(a))
if x % 2 == 1:
print(x)
else:
print((x - 1))
| false | 72.413793 | [
"-from collections import Counter",
"-import heapq",
"-",
"-cou = Counter(a)",
"-c = []",
"-for k in list(cou.keys()):",
"- c.append((-cou[k], k))",
"-heapq.heapify(c)",
"-v1, k1 = heapq.heappop(c)",
"-while v1 < -1:",
"- if v1 < -2:",
"- v1 += 2",
"- heapq.heappush(c, (v... | false | 0.129384 | 0.086285 | 1.499495 | [
"s200438669",
"s359238863"
] |
u588341295 | p02599 | python | s883621914 | s663008737 | 1,988 | 1,190 | 260,568 | 256,288 | Accepted | Accepted | 40.14 | import sys
from operator import itemgetter
def input(): return sys.stdin.buffer.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(... | import sys
from operator import itemgetter
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for... | 94 | 110 | 2,276 | 2,630 | import sys
from operator import itemgetter
def input():
return sys.stdin.buffer.readline().strip()
def list2d(a, b, c):
return [[c] * b for i in range(a)]
def list3d(a, b, c, d):
return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e):
return [[[[e] * d for j in range(c)... | import sys
from operator import itemgetter
def input():
return sys.stdin.readline().strip()
def list2d(a, b, c):
return [[c] * b for i in range(a)]
def list3d(a, b, c, d):
return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e):
return [[[[e] * d for j in range(c)] for j... | false | 14.545455 | [
"- return sys.stdin.buffer.readline().strip()",
"+ return sys.stdin.readline().strip()",
"+def bucket_sort(A, M, key):",
"+ from itertools import accumulate",
"+",
"+ N = len(A)",
"+ C = [0] * (M + 1)",
"+ res = [()] * N",
"+ for i in range(N):",
"+ C[A[i][key]] += 1",
... | false | 0.043034 | 0.037423 | 1.149938 | [
"s883621914",
"s663008737"
] |
u864197622 | p03585 | python | s022822736 | s578159698 | 4,934 | 2,723 | 131,284 | 130,708 | Accepted | Accepted | 44.81 | def addbit(i):
i += 1
while i <= N:
BIT[i] += 1
i += i & (-i)
def getsum(i):
ret = 0
i += 1
while i != 0:
ret += BIT[i]
i -= i&(-i)
return ret
def bit(L):
global BIT
BIT=[0] * (N+1)
re = 0
for l in L:
re += getsum(l)
... | def addbit(i):
i += 1
while i <= N:
BIT[i] += 1
i += i & (-i)
def getsum(i):
ret = 0
i += 1
while i != 0:
ret += BIT[i]
i -= i&(-i)
return ret
def bit(L):
global BIT
BIT=[0] * (N+1)
re = 0
for l in L:
re += getsum(l)
... | 46 | 45 | 1,136 | 1,056 | def addbit(i):
i += 1
while i <= N:
BIT[i] += 1
i += i & (-i)
def getsum(i):
ret = 0
i += 1
while i != 0:
ret += BIT[i]
i -= i & (-i)
return ret
def bit(L):
global BIT
BIT = [0] * (N + 1)
re = 0
for l in L:
re += getsum(l)
addbi... | def addbit(i):
i += 1
while i <= N:
BIT[i] += 1
i += i & (-i)
def getsum(i):
ret = 0
i += 1
while i != 0:
ret += BIT[i]
i -= i & (-i)
return ret
def bit(L):
global BIT
BIT = [0] * (N + 1)
re = 0
for l in L:
re += getsum(l)
addbi... | false | 2.173913 | [
"- A = [b for a, b in sorted([(s * m + t, i) for i, (s, t) in enumerate(Z)])]"
] | false | 0.007393 | 0.105535 | 0.070054 | [
"s022822736",
"s578159698"
] |
u279493135 | p02838 | python | s795803132 | s149407157 | 1,705 | 1,288 | 121,148 | 121,148 | Accepted | Accepted | 24.46 | import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, atan, degrees
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lower... | import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_upp... | 37 | 36 | 1,071 | 1,034 | import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, atan, degrees
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ... | import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase... | false | 2.702703 | [
"-from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, atan, degrees",
"-from itertools import permutations, combinations, product, accumulate",
"+from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians",
"+from itertools import accumulate, permutations, combinations, product",
... | false | 0.042316 | 0.036766 | 1.150951 | [
"s795803132",
"s149407157"
] |
u841568901 | p03673 | python | s286843800 | s404841233 | 158 | 144 | 30,868 | 32,472 | Accepted | Accepted | 8.86 | N = int(eval(input()))
A = list(map(int, input().split()))
if N%2==0:
B = [A[i] for i in range(N) if i%2==0]
C = [A[(N-i-1)] for i in range(N) if (N-i-1)%2==1]
print((*C+B))
else:
B = [A[i] for i in range(N) if i%2==1]
C = [A[(N-i-1)] for i in range(N) if (N-i-1)%2==0]
print((*C+B)) | from collections import deque
N = int(eval(input()))
A = list(map(int, input().split()))
B = deque([])
c = 1
for a in A:
if c:
B.append(a)
else:
B.appendleft(a)
c = 1-c
if N%2:
B.reverse()
print((*B)) | 10 | 14 | 294 | 221 | N = int(eval(input()))
A = list(map(int, input().split()))
if N % 2 == 0:
B = [A[i] for i in range(N) if i % 2 == 0]
C = [A[(N - i - 1)] for i in range(N) if (N - i - 1) % 2 == 1]
print((*C + B))
else:
B = [A[i] for i in range(N) if i % 2 == 1]
C = [A[(N - i - 1)] for i in range(N) if (N - i - 1) % ... | from collections import deque
N = int(eval(input()))
A = list(map(int, input().split()))
B = deque([])
c = 1
for a in A:
if c:
B.append(a)
else:
B.appendleft(a)
c = 1 - c
if N % 2:
B.reverse()
print((*B))
| false | 28.571429 | [
"+from collections import deque",
"+",
"-if N % 2 == 0:",
"- B = [A[i] for i in range(N) if i % 2 == 0]",
"- C = [A[(N - i - 1)] for i in range(N) if (N - i - 1) % 2 == 1]",
"- print((*C + B))",
"-else:",
"- B = [A[i] for i in range(N) if i % 2 == 1]",
"- C = [A[(N - i - 1)] for i in ... | false | 0.074069 | 0.043442 | 1.705009 | [
"s286843800",
"s404841233"
] |
u281303342 | p03814 | python | s229942737 | s307291251 | 42 | 17 | 3,512 | 3,512 | Accepted | Accepted | 59.52 | S = eval(input())
N = len(S)
a,z = 0,0
for i in range(N):
if S[i]=="A":
a = i
break
for i in range(N):
if S[N-1-i]=="Z":
z = N-1-i
break
print((z-a+1)) | # python3 (3.4.3)
import sys
input = sys.stdin.readline
# main
S = input().rstrip()
ai = S.find("A")
zi = S.rfind("Z")
print((zi-ai+1)) | 14 | 11 | 198 | 146 | S = eval(input())
N = len(S)
a, z = 0, 0
for i in range(N):
if S[i] == "A":
a = i
break
for i in range(N):
if S[N - 1 - i] == "Z":
z = N - 1 - i
break
print((z - a + 1))
| # python3 (3.4.3)
import sys
input = sys.stdin.readline
# main
S = input().rstrip()
ai = S.find("A")
zi = S.rfind("Z")
print((zi - ai + 1))
| false | 21.428571 | [
"-S = eval(input())",
"-N = len(S)",
"-a, z = 0, 0",
"-for i in range(N):",
"- if S[i] == \"A\":",
"- a = i",
"- break",
"-for i in range(N):",
"- if S[N - 1 - i] == \"Z\":",
"- z = N - 1 - i",
"- break",
"-print((z - a + 1))",
"+# python3 (3.4.3)",
"+impo... | false | 0.039032 | 0.037265 | 1.047417 | [
"s229942737",
"s307291251"
] |
u472065247 | p03576 | python | s592183280 | s225672333 | 1,995 | 34 | 48,756 | 3,064 | Accepted | Accepted | 98.3 | N, K = list(map(int, input().split()))
XY = [list(map(int, input().split())) for _ in range(N)]
X, Y = list(zip(*XY))
X_s = sorted(X)
Y_s = sorted(Y)
r = 10**20
for xi0 in range(N):
for xi1 in range(xi0, N):
for yi0 in range(N):
for yi1 in range(yi0, N):
x0 = X_s[xi0]
x1 = X_s[x... | N, K = list(map(int, input().split()))
XY = [list(map(int, input().split())) for _ in range(N)]
XY.sort()
r = 10**20
for xi0 in range(N - K + 1):
for xi1 in range(K + xi0 - 1, N):
x = XY[xi1][0] - XY[xi0][0]
XY_ys = sorted(XY[xi0:xi1 + 1], key=lambda a: a[1])
for yi0 in range(len(XY_ys) - K + 1):
... | 22 | 12 | 538 | 397 | N, K = list(map(int, input().split()))
XY = [list(map(int, input().split())) for _ in range(N)]
X, Y = list(zip(*XY))
X_s = sorted(X)
Y_s = sorted(Y)
r = 10**20
for xi0 in range(N):
for xi1 in range(xi0, N):
for yi0 in range(N):
for yi1 in range(yi0, N):
x0 = X_s[xi0]
... | N, K = list(map(int, input().split()))
XY = [list(map(int, input().split())) for _ in range(N)]
XY.sort()
r = 10**20
for xi0 in range(N - K + 1):
for xi1 in range(K + xi0 - 1, N):
x = XY[xi1][0] - XY[xi0][0]
XY_ys = sorted(XY[xi0 : xi1 + 1], key=lambda a: a[1])
for yi0 in range(len(XY_ys) - ... | false | 45.454545 | [
"-X, Y = list(zip(*XY))",
"-X_s = sorted(X)",
"-Y_s = sorted(Y)",
"+XY.sort()",
"-for xi0 in range(N):",
"- for xi1 in range(xi0, N):",
"- for yi0 in range(N):",
"- for yi1 in range(yi0, N):",
"- x0 = X_s[xi0]",
"- x1 = X_s[xi1]",
"- ... | false | 0.042215 | 0.039264 | 1.07515 | [
"s592183280",
"s225672333"
] |
u392319141 | p02955 | python | s504904823 | s572245689 | 286 | 211 | 3,188 | 3,064 | Accepted | Accepted | 26.22 | N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
S = sum(A)
def isOk(n):
B = [a % n for a in A]
B.sort()
now = 0
S = sum(B)
for i, b in enumerate(B[: -1]):
now += b
S -= b
if now == n * (N - i - 1) - S and now <= K:
return... | N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
S = sum(A)
def canMake(n):
B = [a % n for a in A]
B.sort()
left = 0
right = sum(B)
for i, b in enumerate(B, start=1):
left += b
right -= b
if left == n * (N - i) - right:
re... | 29 | 30 | 545 | 576 | N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
S = sum(A)
def isOk(n):
B = [a % n for a in A]
B.sort()
now = 0
S = sum(B)
for i, b in enumerate(B[:-1]):
now += b
S -= b
if now == n * (N - i - 1) - S and now <= K:
return True
retur... | N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
S = sum(A)
def canMake(n):
B = [a % n for a in A]
B.sort()
left = 0
right = sum(B)
for i, b in enumerate(B, start=1):
left += b
right -= b
if left == n * (N - i) - right:
return left <= K... | false | 3.333333 | [
"-def isOk(n):",
"+def canMake(n):",
"- now = 0",
"- S = sum(B)",
"- for i, b in enumerate(B[:-1]):",
"- now += b",
"- S -= b",
"- if now == n * (N - i - 1) - S and now <= K:",
"- return True",
"+ left = 0",
"+ right = sum(B)",
"+ for i, b in e... | false | 0.059621 | 0.123723 | 0.481892 | [
"s504904823",
"s572245689"
] |
u607155447 | p02580 | python | s707572221 | s895212059 | 1,042 | 712 | 98,232 | 79,140 | Accepted | Accepted | 31.67 | import sys
H, W, M = list(map(int, sys.stdin.readline().split()))
hlst = {}
wlst = {}
hwlst = []
for i in range(M):
h, w = sys.stdin.readline().split()
if h in hlst:
hlst[h] += 1
else:
hlst[h] = 1
if w in wlst:
wlst[w] += 1
else:
wlst[w] = 1
h... | import sys
H, W, M = list(map(int, sys.stdin.readline().split()))
hlst = {}
wlst = {}
hwlst = []
for i in range(M):
h, w = list(map(int, sys.stdin.readline().split()))
if h in hlst:
hlst[h] += 1
else:
hlst[h] = 1
if w in wlst:
wlst[w] += 1
else:
wlst... | 36 | 35 | 652 | 641 | import sys
H, W, M = list(map(int, sys.stdin.readline().split()))
hlst = {}
wlst = {}
hwlst = []
for i in range(M):
h, w = sys.stdin.readline().split()
if h in hlst:
hlst[h] += 1
else:
hlst[h] = 1
if w in wlst:
wlst[w] += 1
else:
wlst[w] = 1
hwlst.append([h, w])
... | import sys
H, W, M = list(map(int, sys.stdin.readline().split()))
hlst = {}
wlst = {}
hwlst = []
for i in range(M):
h, w = list(map(int, sys.stdin.readline().split()))
if h in hlst:
hlst[h] += 1
else:
hlst[h] = 1
if w in wlst:
wlst[w] += 1
else:
wlst[w] = 1
hwlst... | false | 2.777778 | [
"- h, w = sys.stdin.readline().split()",
"+ h, w = list(map(int, sys.stdin.readline().split()))",
"-ans = h + w - 1",
"-if num == 0:",
"- print(ans)",
"+if num:",
"+ print((h + w))",
"- print((ans + 1))",
"+ print((h + w - 1))"
] | false | 0.036565 | 0.082429 | 0.443591 | [
"s707572221",
"s895212059"
] |
u764600134 | p03240 | python | s556318179 | s156315156 | 38 | 29 | 3,064 | 3,064 | Accepted | Accepted | 23.68 | # -*- coding: utf-8 -*-
"""
C - Pyramid
https://atcoder.jp/contests/abc112/tasks/abc112_c
"""
import sys
def solve(N, positions):
if N == 1:
return positions[0]
for cy in range(101):
for cx in range(101):
is_valid = True
x, y, h = positions[0]
... | # -*- coding: utf-8 -*-
"""
C - Pyramid
https://atcoder.jp/contests/abc112/tasks/abc112_c
"""
import sys
def solve(N, positions):
if N == 1:
return positions[0]
positions.sort(key=lambda x:x[2])
for cy in range(101):
for cx in range(101):
is_valid = True
... | 47 | 35 | 1,255 | 868 | # -*- coding: utf-8 -*-
"""
C - Pyramid
https://atcoder.jp/contests/abc112/tasks/abc112_c
"""
import sys
def solve(N, positions):
if N == 1:
return positions[0]
for cy in range(101):
for cx in range(101):
is_valid = True
x, y, h = positions[0]
ph = h + abs(c... | # -*- coding: utf-8 -*-
"""
C - Pyramid
https://atcoder.jp/contests/abc112/tasks/abc112_c
"""
import sys
def solve(N, positions):
if N == 1:
return positions[0]
positions.sort(key=lambda x: x[2])
for cy in range(101):
for cx in range(101):
is_valid = True
x, y, h = ... | false | 25.531915 | [
"- for cy in range(101):",
"- for cx in range(101):",
"- is_valid = True",
"- x, y, h = positions[0]",
"- ph = h + abs(cy - y) + abs(cx - x)",
"- for x, y, h in positions[1:]:",
"- hh = max(ph - abs(cy - y) - abs(cx - x), 0)",
"- ... | false | 0.039927 | 0.036547 | 1.092477 | [
"s556318179",
"s156315156"
] |
u745561510 | p02768 | python | s597585386 | s203829585 | 206 | 174 | 38,640 | 38,512 | Accepted | Accepted | 15.53 | n, a, b = list(map(int, input().split()))
mod = 1000000007
def inv(y, mod):
return pow(y, mod - 2, mod)
def comb(n, a, mod):
x = 1
y = 1
for i in range(a):
x = x * (n - i) % mod
y = y * (i + 1) % mod
return (x * inv(y, mod)) % mod
print(((pow(2, n, mod) - 1 - comb... | n, a, b = list(map(int ,input().split()))
mod = 1000000007
def inv(k):
return pow(k, mod - 2, mod)
def comb(n, k):
bunshi = 1
bunbo = 1
for i in range(k):
bunshi = bunshi * (n - i) % mod
bunbo = bunbo * (i + 1) % mod
return bunshi * inv(bunbo) % mod
all_num = pow(2, ... | 14 | 18 | 350 | 386 | n, a, b = list(map(int, input().split()))
mod = 1000000007
def inv(y, mod):
return pow(y, mod - 2, mod)
def comb(n, a, mod):
x = 1
y = 1
for i in range(a):
x = x * (n - i) % mod
y = y * (i + 1) % mod
return (x * inv(y, mod)) % mod
print(((pow(2, n, mod) - 1 - comb(n, a, mod) - ... | n, a, b = list(map(int, input().split()))
mod = 1000000007
def inv(k):
return pow(k, mod - 2, mod)
def comb(n, k):
bunshi = 1
bunbo = 1
for i in range(k):
bunshi = bunshi * (n - i) % mod
bunbo = bunbo * (i + 1) % mod
return bunshi * inv(bunbo) % mod
all_num = pow(2, n, mod)
ans... | false | 22.222222 | [
"-def inv(y, mod):",
"- return pow(y, mod - 2, mod)",
"+def inv(k):",
"+ return pow(k, mod - 2, mod)",
"-def comb(n, a, mod):",
"- x = 1",
"- y = 1",
"- for i in range(a):",
"- x = x * (n - i) % mod",
"- y = y * (i + 1) % mod",
"- return (x * inv(y, mod)) % mod",
... | false | 0.127439 | 0.129632 | 0.983085 | [
"s597585386",
"s203829585"
] |
u226155577 | p03575 | python | s135229975 | s366825886 | 171 | 18 | 3,444 | 3,064 | Accepted | Accepted | 89.47 | n, m = list(map(int, input().split()))
G = [[] for i in range(n)]
E = []
for i in range(m):
a, b = list(map(int, input().split()))
G[a-1].append(b-1)
G[b-1].append(a-1)
E.append((a-1, b-1))
from collections import deque
def solve(s, t):
if len(G[s]) == 1 or len(G[t]) == 1:
return ... | n, m = list(map(int, input().split()))
G = [[] for i in range(n)]
for i in range(m):
a, b = list(map(int, input().split()))
G[a-1].append(b-1)
G[b-1].append(a-1)
def bridge(g, v, s=0):
bl = [False] * v
c_memo = [0] * v
c_used = [False] * v
b_g = [[] for i in range(v)]
def dfs(... | 31 | 49 | 714 | 1,297 | n, m = list(map(int, input().split()))
G = [[] for i in range(n)]
E = []
for i in range(m):
a, b = list(map(int, input().split()))
G[a - 1].append(b - 1)
G[b - 1].append(a - 1)
E.append((a - 1, b - 1))
from collections import deque
def solve(s, t):
if len(G[s]) == 1 or len(G[t]) == 1:
retu... | n, m = list(map(int, input().split()))
G = [[] for i in range(n)]
for i in range(m):
a, b = list(map(int, input().split()))
G[a - 1].append(b - 1)
G[b - 1].append(a - 1)
def bridge(g, v, s=0):
bl = [False] * v
c_memo = [0] * v
c_used = [False] * v
b_g = [[] for i in range(v)]
def dfs(... | false | 36.734694 | [
"-E = []",
"- E.append((a - 1, b - 1))",
"-from collections import deque",
"-def solve(s, t):",
"- if len(G[s]) == 1 or len(G[t]) == 1:",
"- return 1",
"- used = [0] * n",
"- que = deque()",
"- used[s] = 1",
"- for v in G[s]:",
"- if v == t:",
"- cont... | false | 0.041914 | 0.032924 | 1.273064 | [
"s135229975",
"s366825886"
] |
u721425712 | p02952 | python | s659553804 | s106965163 | 73 | 62 | 3,060 | 2,940 | Accepted | Accepted | 15.07 | N = int(eval(input()))
import math
ans = 0
for i in range(1, N+1, 1):
order = int(math.log10(i))+1
if order%2 == 1:
ans += 1
else:
continue
print(ans) | n = int(eval(input()))
ans = 0
for i in range(1, n+1):
x = len(str(i))
if x%2 == 1:
ans += 1
print(ans) | 12 | 9 | 185 | 120 | N = int(eval(input()))
import math
ans = 0
for i in range(1, N + 1, 1):
order = int(math.log10(i)) + 1
if order % 2 == 1:
ans += 1
else:
continue
print(ans)
| n = int(eval(input()))
ans = 0
for i in range(1, n + 1):
x = len(str(i))
if x % 2 == 1:
ans += 1
print(ans)
| false | 25 | [
"-N = int(eval(input()))",
"-import math",
"-",
"+n = int(eval(input()))",
"-for i in range(1, N + 1, 1):",
"- order = int(math.log10(i)) + 1",
"- if order % 2 == 1:",
"+for i in range(1, n + 1):",
"+ x = len(str(i))",
"+ if x % 2 == 1:",
"- else:",
"- continue"
] | false | 0.040424 | 0.043493 | 0.929439 | [
"s659553804",
"s106965163"
] |
u333945892 | p03076 | python | s248073593 | s587289781 | 49 | 29 | 5,728 | 4,212 | Accepted | Accepted | 40.82 | from collections import defaultdict,deque
import sys,heapq,bisect,math,itertools,string,queue,datetime,random
sys.setrecursionlimit(10**8)
INF = float('inf')
mod = 10**9+7
eps = 10**-7
def inpl(): return list(map(int, input().split()))
def inpls(): return list(input().split())
aa = [int(eval(input())) for _ i... | from collections import defaultdict
import sys,heapq,bisect,math,itertools,string,queue,datetime
sys.setrecursionlimit(10**8)
INF = float('inf')
mod = 10**9+7
eps = 10**-7
def inpl(): return list(map(int, input().split()))
def inpl_str(): return list(input().split())
order = [int(eval(input())) for _ in range... | 17 | 17 | 444 | 460 | from collections import defaultdict, deque
import sys, heapq, bisect, math, itertools, string, queue, datetime, random
sys.setrecursionlimit(10**8)
INF = float("inf")
mod = 10**9 + 7
eps = 10**-7
def inpl():
return list(map(int, input().split()))
def inpls():
return list(input().split())
aa = [int(eval(i... | from collections import defaultdict
import sys, heapq, bisect, math, itertools, string, queue, datetime
sys.setrecursionlimit(10**8)
INF = float("inf")
mod = 10**9 + 7
eps = 10**-7
def inpl():
return list(map(int, input().split()))
def inpl_str():
return list(input().split())
order = [int(eval(input())) ... | false | 0 | [
"-from collections import defaultdict, deque",
"-import sys, heapq, bisect, math, itertools, string, queue, datetime, random",
"+from collections import defaultdict",
"+import sys, heapq, bisect, math, itertools, string, queue, datetime",
"-def inpls():",
"+def inpl_str():",
"-aa = [int(eval(input())) f... | false | 0.041686 | 0.040422 | 1.031277 | [
"s248073593",
"s587289781"
] |
u729133443 | p02573 | python | s285453235 | s330103640 | 44 | 38 | 9,864 | 9,888 | Accepted | Accepted | 13.64 | import sys
if sys.argv[-1] == 'ONLINE_JUDGE':
import os, zlib, base64
open('tourist.pyx', 'wb').write(zlib.decompress(base64.b85decode("c${TY%Wi`(5WFMt58Fc(Xq*VD9x7D&BPj>l7_bTkIj*Ai>${5yulNExGoBr<UD>{aRttH)I;%|$Qg=gd9dxR@Di;P73FNP9dUGDQ<!!6lSu|K~YBh-_ms0mLUn?gYZW#)-aa9<|QdNMzm)C?=0Ye!0PSL>Nlrr!HyueleslJL(9LL... | import sys
if sys.argv[-1] == 'ONLINE_JUDGE':
import os, zlib, base64
open('solve.pyx', 'wb').write(zlib.decompress(base64.b85decode("c${TYO>cuR480@qAH2g<SksD5J4|Tok8~W85Fi=^lxC{7Uq74hU0=X{&(AMTO53&2Xd%xxXSJz7>bCE!gI2XS<-(vOg8X%LXU;vhylGT3lX}ZdrAE@IQs{2RE9GR(EkmL<t_%ZNs1oq^`kGMW(1(Ga6!i>F7X}`H7r5y^)s+#F<9Kdt... | 6 | 6 | 673 | 674 | import sys
if sys.argv[-1] == "ONLINE_JUDGE":
import os, zlib, base64
open("tourist.pyx", "wb").write(
zlib.decompress(
base64.b85decode(
"c${TY%Wi`(5WFMt58Fc(Xq*VD9x7D&BPj>l7_bTkIj*Ai>${5yulNExGoBr<UD>{aRttH)I;%|$Qg=gd9dxR@Di;P73FNP9dUGDQ<!!6lSu|K~YBh-_ms0mLUn?gYZW#)-aa9<|... | import sys
if sys.argv[-1] == "ONLINE_JUDGE":
import os, zlib, base64
open("solve.pyx", "wb").write(
zlib.decompress(
base64.b85decode(
"c${TYO>cuR480@qAH2g<SksD5J4|Tok8~W85Fi=^lxC{7Uq74hU0=X{&(AMTO53&2Xd%xxXSJz7>bCE!gI2XS<-(vOg8X%LXU;vhylGT3lX}ZdrAE@IQs{2RE9GR(EkmL<t_%ZNs1... | false | 0 | [
"- open(\"tourist.pyx\", \"wb\").write(",
"+ open(\"solve.pyx\", \"wb\").write(",
"- \"c${TY%Wi`(5WFMt58Fc(Xq*VD9x7D&BPj>l7_bTkIj*Ai>${5yulNExGoBr<UD>{aRttH)I;%|$Qg=gd9dxR@Di;P73FNP9dUGDQ<!!6lSu|K~YBh-_ms0mLUn?gYZW#)-aa9<|QdNMzm)C?=0Ye!0PSL>Nlrr!HyueleslJL(9LLK>v^G%;rmuCIg#qB2DZxNO4vB|vjcyg... | false | 0.084292 | 0.074574 | 1.13031 | [
"s285453235",
"s330103640"
] |
u698176039 | p03160 | python | s114516933 | s061614230 | 904 | 242 | 20,928 | 50,580 | Accepted | Accepted | 73.23 |
N = int(eval(input()))
H = list(map(int,input().split()))
inf = 10**9+7
dp = [inf] * (N+10)
dp[0] = 0
import numpy as np
for i,h in enumerate(H[:N-1]):
dp[i+1] = min(dp[i+1],dp[i] + np.abs(h-H[i+1]))
if i<N-2: dp[i+2] = min(dp[i+2],dp[i] + np.abs(h-H[i+2]))
print((dp[N-1])) |
import sys
sys.setrecursionlimit(10**8)
input = sys.stdin.readline
N = int(eval(input()))
h = list(map(int,input().split()))
INF = 10**20
dp = [INF]*(N+10)
dp[0] = 0
def distance(x,y):
return abs(h[x]-h[y])
dp[1] = distance(0,1)
for i in range(2,N):
dp[i] = min(dp[i], dp[i-1] + distance(i-1,i)... | 12 | 19 | 291 | 388 | N = int(eval(input()))
H = list(map(int, input().split()))
inf = 10**9 + 7
dp = [inf] * (N + 10)
dp[0] = 0
import numpy as np
for i, h in enumerate(H[: N - 1]):
dp[i + 1] = min(dp[i + 1], dp[i] + np.abs(h - H[i + 1]))
if i < N - 2:
dp[i + 2] = min(dp[i + 2], dp[i] + np.abs(h - H[i + 2]))
print((dp[N - ... | import sys
sys.setrecursionlimit(10**8)
input = sys.stdin.readline
N = int(eval(input()))
h = list(map(int, input().split()))
INF = 10**20
dp = [INF] * (N + 10)
dp[0] = 0
def distance(x, y):
return abs(h[x] - h[y])
dp[1] = distance(0, 1)
for i in range(2, N):
dp[i] = min(dp[i], dp[i - 1] + distance(i - 1, ... | false | 36.842105 | [
"+import sys",
"+",
"+sys.setrecursionlimit(10**8)",
"+input = sys.stdin.readline",
"-H = list(map(int, input().split()))",
"-inf = 10**9 + 7",
"-dp = [inf] * (N + 10)",
"+h = list(map(int, input().split()))",
"+INF = 10**20",
"+dp = [INF] * (N + 10)",
"-import numpy as np",
"-for i, h in enum... | false | 0.331976 | 0.037424 | 8.870628 | [
"s114516933",
"s061614230"
] |
u171366497 | p03600 | python | s019525487 | s457273266 | 1,832 | 818 | 6,772 | 21,804 | Accepted | Accepted | 55.35 | import sys
input=sys.stdin.readline
N=int(eval(input()))
dist=[list(map(int,input().split())) for i in range(N)]
ans=sum([sum(dist[i]) for i in range(N)])
for i in range(N):
dist[i][i]=float('inf')
ans//=2
def main(ans):
for i in range(N):
for j in range(i+1,N):
Min=min(list(map(s... | import numpy as np
N=int(eval(input()))
A=[np.array(list(map(int,input().split()))) for i in range(N)]
ans=sum([sum(A[i]) for i in range(N)])
ans//=2
for i in range(N):
A[i][i]=10**10
def main(ans):
for i in range(N):
for j in range(i+1,N):
Min=np.min(A[i]+A[j])
if Min... | 18 | 17 | 494 | 444 | import sys
input = sys.stdin.readline
N = int(eval(input()))
dist = [list(map(int, input().split())) for i in range(N)]
ans = sum([sum(dist[i]) for i in range(N)])
for i in range(N):
dist[i][i] = float("inf")
ans //= 2
def main(ans):
for i in range(N):
for j in range(i + 1, N):
Min = min(... | import numpy as np
N = int(eval(input()))
A = [np.array(list(map(int, input().split()))) for i in range(N)]
ans = sum([sum(A[i]) for i in range(N)])
ans //= 2
for i in range(N):
A[i][i] = 10**10
def main(ans):
for i in range(N):
for j in range(i + 1, N):
Min = np.min(A[i] + A[j])
... | false | 5.555556 | [
"-import sys",
"+import numpy as np",
"-input = sys.stdin.readline",
"-dist = [list(map(int, input().split())) for i in range(N)]",
"-ans = sum([sum(dist[i]) for i in range(N)])",
"+A = [np.array(list(map(int, input().split()))) for i in range(N)]",
"+ans = sum([sum(A[i]) for i in range(N)])",
"+ans /... | false | 0.036514 | 0.550013 | 0.066388 | [
"s019525487",
"s457273266"
] |
u505564549 | p02573 | python | s102139893 | s354244719 | 983 | 605 | 100,876 | 209,172 | Accepted | Accepted | 38.45 | n,m=list(map(int,input().split()))
d={i:set() for i in range(1,n+1)}
for i in range(m):
a,b=list(map(int,input().split()))
d[a].add(b)
d[b].add(a)
vis = set()
res = 0
for i in range(1,n+1):
if i not in vis:
stack=[i]
ans=1
vis.add(i)
while stack:
... | import sys
input = sys.stdin.readline
n,m=list(map(int,input().split()))
M=set(tuple(map(int,input().split())) for _ in range(m))
d={i:set() for i in range(1,n+1)}
for i,j in M:
d[i].add(j)
d[j].add(i)
vis=set()
res = 0
for i in range(1,n+1):
if i not in vis:
stack = [i]
ans... | 24 | 28 | 536 | 599 | n, m = list(map(int, input().split()))
d = {i: set() for i in range(1, n + 1)}
for i in range(m):
a, b = list(map(int, input().split()))
d[a].add(b)
d[b].add(a)
vis = set()
res = 0
for i in range(1, n + 1):
if i not in vis:
stack = [i]
ans = 1
vis.add(i)
while stack:
... | import sys
input = sys.stdin.readline
n, m = list(map(int, input().split()))
M = set(tuple(map(int, input().split())) for _ in range(m))
d = {i: set() for i in range(1, n + 1)}
for i, j in M:
d[i].add(j)
d[j].add(i)
vis = set()
res = 0
for i in range(1, n + 1):
if i not in vis:
stack = [i]
... | false | 14.285714 | [
"+import sys",
"+",
"+input = sys.stdin.readline",
"+M = set(tuple(map(int, input().split())) for _ in range(m))",
"-for i in range(m):",
"- a, b = list(map(int, input().split()))",
"- d[a].add(b)",
"- d[b].add(a)",
"+for i, j in M:",
"+ d[i].add(j)",
"+ d[j].add(i)",
"- ... | false | 0.038183 | 0.041684 | 0.916008 | [
"s102139893",
"s354244719"
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.