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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
u391875425 | p03112 | python | s859201964 | s022597560 | 1,144 | 938 | 77,016 | 16,144 | Accepted | Accepted | 18.01 | import bisect
import sys
A, B, Q = list(map(int, input().split()))
INF = 10 ** 13
s = [-INF] + [int(eval(input())) for i in range(A)] + [INF]
t = [-INF] + [int(eval(input())) for i in range(B)] + [INF]
xs = [int(sys.stdin.readline()) for i in range(Q)]
for x in xs:
b, d = bisect.bisect_right(s, x), bisect.b... | def solve():
import bisect
import sys
A, B, Q = list(map(int, input().split()))
INF = 10 ** 13
s = [-INF] + [int(eval(input())) for i in range(A)] + [INF]
t = [-INF] + [int(eval(input())) for i in range(B)] + [INF]
xs = [int(sys.stdin.readline()) for i in range(Q)]
for x in xs:
... | 15 | 18 | 525 | 640 | import bisect
import sys
A, B, Q = list(map(int, input().split()))
INF = 10**13
s = [-INF] + [int(eval(input())) for i in range(A)] + [INF]
t = [-INF] + [int(eval(input())) for i in range(B)] + [INF]
xs = [int(sys.stdin.readline()) for i in range(Q)]
for x in xs:
b, d = bisect.bisect_right(s, x), bisect.bisect_rig... | def solve():
import bisect
import sys
A, B, Q = list(map(int, input().split()))
INF = 10**13
s = [-INF] + [int(eval(input())) for i in range(A)] + [INF]
t = [-INF] + [int(eval(input())) for i in range(B)] + [INF]
xs = [int(sys.stdin.readline()) for i in range(Q)]
for x in xs:
b,... | false | 16.666667 | [
"-import bisect",
"-import sys",
"+def solve():",
"+ import bisect",
"+ import sys",
"-A, B, Q = list(map(int, input().split()))",
"-INF = 10**13",
"-s = [-INF] + [int(eval(input())) for i in range(A)] + [INF]",
"-t = [-INF] + [int(eval(input())) for i in range(B)] + [INF]",
"-xs = [int(sys.... | false | 0.047218 | 0.050521 | 0.934625 | [
"s859201964",
"s022597560"
] |
u629540524 | p03371 | python | s905377977 | s155932038 | 74 | 62 | 61,808 | 61,904 | Accepted | Accepted | 16.22 | a,b,c,x,y=list(map(int,input().split()))
if a+b<=2*c:
print((a*x+b*y))
else:
print((c*2*min(x,y)+min(max(a*(x-y),b*(y-x)),c*2*abs(x-y)))) | a,b,c,x,y=list(map(int,input().split()))
print((min(c*2*min(x,y)+min(max(a*(x-y),b*(y-x)),c*2*abs(x-y)),a*x+b*y))) | 5 | 2 | 139 | 107 | a, b, c, x, y = list(map(int, input().split()))
if a + b <= 2 * c:
print((a * x + b * y))
else:
print((c * 2 * min(x, y) + min(max(a * (x - y), b * (y - x)), c * 2 * abs(x - y))))
| a, b, c, x, y = list(map(int, input().split()))
print(
(
min(
c * 2 * min(x, y) + min(max(a * (x - y), b * (y - x)), c * 2 * abs(x - y)),
a * x + b * y,
)
)
)
| false | 60 | [
"-if a + b <= 2 * c:",
"- print((a * x + b * y))",
"-else:",
"- print((c * 2 * min(x, y) + min(max(a * (x - y), b * (y - x)), c * 2 * abs(x - y))))",
"+print(",
"+ (",
"+ min(",
"+ c * 2 * min(x, y) + min(max(a * (x - y), b * (y - x)), c * 2 * abs(x - y)),",
"+ ... | false | 0.093328 | 0.093255 | 1.000774 | [
"s905377977",
"s155932038"
] |
u638456847 | p02642 | python | s310856864 | s966321935 | 339 | 204 | 50,808 | 32,344 | Accepted | Accepted | 39.82 | from collections import Counter
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
def main():
N, *A = list(map(int, read().split()))
t = Counter(A)
A.sort()
table = [True] * (A[-1] + 1)
n = len(table)
seen = set()
for a in A:
... | import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
def main():
N,*A = list(map(int, read().split()))
A.sort()
table = [0] * (A[-1] + 1)
n = len(table)
for a in A:
if table[a] > 1:
continue
if table[a] == 0:
... | 36 | 32 | 658 | 559 | from collections import Counter
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
def main():
N, *A = list(map(int, read().split()))
t = Counter(A)
A.sort()
table = [True] * (A[-1] + 1)
n = len(table)
seen = set()
for a in A:
if a in se... | import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
def main():
N, *A = list(map(int, read().split()))
A.sort()
table = [0] * (A[-1] + 1)
n = len(table)
for a in A:
if table[a] > 1:
continue
if table[a] == 0:
for i... | false | 11.111111 | [
"-from collections import Counter",
"- t = Counter(A)",
"- table = [True] * (A[-1] + 1)",
"+ table = [0] * (A[-1] + 1)",
"- seen = set()",
"- if a in seen:",
"+ if table[a] > 1:",
"- for i in range(2 * a, n, a):",
"- table[i] = False",
"- seen.add... | false | 0.041936 | 0.041544 | 1.009431 | [
"s310856864",
"s966321935"
] |
u802963389 | p03032 | python | s642611371 | s673581004 | 105 | 35 | 3,188 | 9,208 | Accepted | Accepted | 66.67 | from bisect import bisect_left
N, K = list(map(int, input().split()))
V = list(map(int, input().split()))
act = min(N, K)
ans = - 10 ** 19
for i in range(act + 1):
for a in range(i + 1):
for b in range(i - a + 1):
itm = []
itm += V[:a]
itm += V[N-b:]
itm.sort()
idx = ... | n, k = list(map(int, input().split()))
V = list(map(int, input().split()))
ans = - 10 ** 19
# i: Dから取り出す宝石の個数
for i in range(min(k + 1, n + 1)):
# j: 左からとる個数(i-jが右からとる個数)
for j in range(i + 1):
inhands = V[:j] + V[n - i + j:]
inhands.sort()
remnum = k - i
val = 0
for h in inhands:
... | 18 | 19 | 420 | 433 | from bisect import bisect_left
N, K = list(map(int, input().split()))
V = list(map(int, input().split()))
act = min(N, K)
ans = -(10**19)
for i in range(act + 1):
for a in range(i + 1):
for b in range(i - a + 1):
itm = []
itm += V[:a]
itm += V[N - b :]
itm.so... | n, k = list(map(int, input().split()))
V = list(map(int, input().split()))
ans = -(10**19)
# i: Dから取り出す宝石の個数
for i in range(min(k + 1, n + 1)):
# j: 左からとる個数(i-jが右からとる個数)
for j in range(i + 1):
inhands = V[:j] + V[n - i + j :]
inhands.sort()
remnum = k - i
val = 0
for h in... | false | 5.263158 | [
"-from bisect import bisect_left",
"-",
"-N, K = list(map(int, input().split()))",
"+n, k = list(map(int, input().split()))",
"-act = min(N, K)",
"-for i in range(act + 1):",
"- for a in range(i + 1):",
"- for b in range(i - a + 1):",
"- itm = []",
"- itm += V[:a]",... | false | 0.063603 | 0.043471 | 1.463113 | [
"s642611371",
"s673581004"
] |
u806976856 | p02995 | python | s594533381 | s793123254 | 63 | 35 | 6,584 | 5,048 | Accepted | Accepted | 44.44 | import fractions
a,b,c,d=list(map(int,input().split()))
g=int(fractions.gcd(c,d))
l=int((c*d)/g)
print((b-a+1-int(b//c)+int((a-1)//c)-int(b//d)+int((a-1)//d)+int(b//l)-int((a-1)//l)))
| import fractions
a,b,c,d=list(map(int,input().split()))
g=(fractions.gcd(c,d))
l=int((c*d)/g)
print((b-a+1-int(b//c)+int((a-1)//c)-int(b//d)+int((a-1)//d)+int(b//l)-int((a-1)//l)))
| 7 | 7 | 184 | 181 | import fractions
a, b, c, d = list(map(int, input().split()))
g = int(fractions.gcd(c, d))
l = int((c * d) / g)
print(
(
b
- a
+ 1
- int(b // c)
+ int((a - 1) // c)
- int(b // d)
+ int((a - 1) // d)
+ int(b // l)
- int((a - 1) // l)
)
)
| import fractions
a, b, c, d = list(map(int, input().split()))
g = fractions.gcd(c, d)
l = int((c * d) / g)
print(
(
b
- a
+ 1
- int(b // c)
+ int((a - 1) // c)
- int(b // d)
+ int((a - 1) // d)
+ int(b // l)
- int((a - 1) // l)
)
)
| false | 0 | [
"-g = int(fractions.gcd(c, d))",
"+g = fractions.gcd(c, d)"
] | false | 0.198511 | 0.076341 | 2.600315 | [
"s594533381",
"s793123254"
] |
u976225138 | p03625 | python | s469428888 | s443395701 | 88 | 79 | 22,084 | 22,204 | Accepted | Accepted | 10.23 | from collections import Counter as C
_ = eval(input())
a = C([int(x) for x in input().split()])
b = []
for k, v in list(a.items()):
for _ in range(v // 2):
b.append(k)
else:
if 2 <= len(b):
b.sort()
print((b[-1] * b[-2]))
else:
print((0)) | from collections import Counter as C
_ = eval(input())
b = []
for k, v in list(C([int(x) for x in input().split()]).items()):
b.extend([k] * (v // 2))
else:
if 2 <= len(b):
b.sort()
print((b[-1] * b[-2]))
else:
print((0)) | 15 | 13 | 282 | 255 | from collections import Counter as C
_ = eval(input())
a = C([int(x) for x in input().split()])
b = []
for k, v in list(a.items()):
for _ in range(v // 2):
b.append(k)
else:
if 2 <= len(b):
b.sort()
print((b[-1] * b[-2]))
else:
print((0))
| from collections import Counter as C
_ = eval(input())
b = []
for k, v in list(C([int(x) for x in input().split()]).items()):
b.extend([k] * (v // 2))
else:
if 2 <= len(b):
b.sort()
print((b[-1] * b[-2]))
else:
print((0))
| false | 13.333333 | [
"-a = C([int(x) for x in input().split()])",
"-for k, v in list(a.items()):",
"- for _ in range(v // 2):",
"- b.append(k)",
"+for k, v in list(C([int(x) for x in input().split()]).items()):",
"+ b.extend([k] * (v // 2))"
] | false | 0.034836 | 0.042046 | 0.828505 | [
"s469428888",
"s443395701"
] |
u017415492 | p03659 | python | s893507276 | s283828823 | 160 | 134 | 24,820 | 23,796 | Accepted | Accepted | 16.25 | n=int(eval(input()))
a=list(map(int,input().split()))
sa=sum(a)
hantei=2*(10**9)+1
sx=0
for i in range(len(a)-1):
sx+=a[i]
if abs(sa-2*sx)<hantei:
hantei=abs(sa-2*sx)
print(hantei) | n=int(eval(input()))
#a,b=map(int,input().split())
a=list(map(int,input().split()))
#n=int(input())
#s=input()
sa=sum(a)
ans=10**10+1
x=0
for i in range(0,n-1):
x+=a[i]
if abs(2*x-sa)<ans:
ans=abs(2*x-sa)
print(ans) | 10 | 14 | 191 | 231 | n = int(eval(input()))
a = list(map(int, input().split()))
sa = sum(a)
hantei = 2 * (10**9) + 1
sx = 0
for i in range(len(a) - 1):
sx += a[i]
if abs(sa - 2 * sx) < hantei:
hantei = abs(sa - 2 * sx)
print(hantei)
| n = int(eval(input()))
# a,b=map(int,input().split())
a = list(map(int, input().split()))
# n=int(input())
# s=input()
sa = sum(a)
ans = 10**10 + 1
x = 0
for i in range(0, n - 1):
x += a[i]
if abs(2 * x - sa) < ans:
ans = abs(2 * x - sa)
print(ans)
| false | 28.571429 | [
"+# a,b=map(int,input().split())",
"+# n=int(input())",
"+# s=input()",
"-hantei = 2 * (10**9) + 1",
"-sx = 0",
"-for i in range(len(a) - 1):",
"- sx += a[i]",
"- if abs(sa - 2 * sx) < hantei:",
"- hantei = abs(sa - 2 * sx)",
"-print(hantei)",
"+ans = 10**10 + 1",
"+x = 0",
"+fo... | false | 0.087215 | 0.036724 | 2.374906 | [
"s893507276",
"s283828823"
] |
u222668979 | p03089 | python | s535375384 | s798498475 | 138 | 97 | 63,184 | 63,796 | Accepted | Accepted | 29.71 | n = int(input())
b = list(map(int, input().split()))
ans = []
for _ in range(n):
for i, bi in enumerate(b[::-1]):
if len(b) == bi + i:
ans.append(b.pop(len(b) - i - 1))
break
print(*(ans[::-1] if len(ans) == n else [-1]), sep='\n')
| n = int(input())
b = list(map(int, input().split()))
ans = []
for _ in range(n):
for i, bi in enumerate(b[::-1]):
i = len(b) - i
if i == bi:
ans.append(b.pop(i-1))
break
print(*(ans[::-1] if len(ans) == n else[-1]), sep='\n')
| 10 | 11 | 278 | 281 | n = int(input())
b = list(map(int, input().split()))
ans = []
for _ in range(n):
for i, bi in enumerate(b[::-1]):
if len(b) == bi + i:
ans.append(b.pop(len(b) - i - 1))
break
print(*(ans[::-1] if len(ans) == n else [-1]), sep="\n")
| n = int(input())
b = list(map(int, input().split()))
ans = []
for _ in range(n):
for i, bi in enumerate(b[::-1]):
i = len(b) - i
if i == bi:
ans.append(b.pop(i - 1))
break
print(*(ans[::-1] if len(ans) == n else [-1]), sep="\n")
| false | 9.090909 | [
"- if len(b) == bi + i:",
"- ans.append(b.pop(len(b) - i - 1))",
"+ i = len(b) - i",
"+ if i == bi:",
"+ ans.append(b.pop(i - 1))"
] | false | 0.10806 | 0.043479 | 2.485321 | [
"s535375384",
"s798498475"
] |
u089116225 | p02239 | python | s766684516 | s864633135 | 30 | 20 | 5,724 | 5,736 | Accepted | Accepted | 33.33 | n = int(eval(input()))
m = [[0 for _ in range(n+1)] for _ in range(n+1)]
#mm = [[] for _ in range(n+1)]
for _ in range(n):
tmp = [int(x) for x in input().split()]
u,k,l = tmp[0],tmp[1],tmp[2:]
#mm[u] += tmp[2:]
for x in l:
m[u][x] = 1
dp = [float('inf') for _ in range(n+1)]
dp[1] = 0
queue = [1... | n = int(eval(input()))
m = [[0 for _ in range(n+1)] for _ in range(n+1)]
mm = [[] for _ in range(n+1)]
for _ in range(n):
tmp = [int(x) for x in input().split()]
u,k,l = tmp[0],tmp[1],tmp[2:]
mm[u] += tmp[2:]
for x in l:
m[u][x] = 1
dp = [float('inf') for _ in range(n+1)]
dp[1] = 0
queue = [1]
... | 39 | 48 | 641 | 769 | n = int(eval(input()))
m = [[0 for _ in range(n + 1)] for _ in range(n + 1)]
# mm = [[] for _ in range(n+1)]
for _ in range(n):
tmp = [int(x) for x in input().split()]
u, k, l = tmp[0], tmp[1], tmp[2:]
# mm[u] += tmp[2:]
for x in l:
m[u][x] = 1
dp = [float("inf") for _ in range(n + 1)]
dp[1] = 0... | n = int(eval(input()))
m = [[0 for _ in range(n + 1)] for _ in range(n + 1)]
mm = [[] for _ in range(n + 1)]
for _ in range(n):
tmp = [int(x) for x in input().split()]
u, k, l = tmp[0], tmp[1], tmp[2:]
mm[u] += tmp[2:]
for x in l:
m[u][x] = 1
dp = [float("inf") for _ in range(n + 1)]
dp[1] = 0
q... | false | 18.75 | [
"-# mm = [[] for _ in range(n+1)]",
"+mm = [[] for _ in range(n + 1)]",
"- # mm[u] += tmp[2:]",
"+ mm[u] += tmp[2:]",
"+\"\"\"",
"+while queue:",
"+\tt = queue.pop(0)",
"+\tfor i,x in enumerate(m[t]):",
"+\t\tif x == 1:",
"+\t\t\tif dp[i] > dp[t] + 1:",
"+\t\t\t\tdp[i] = dp[t] + 1",
"+\t... | false | 0.078856 | 0.040943 | 1.926027 | [
"s766684516",
"s864633135"
] |
u170201762 | p03287 | python | s528720098 | s370566366 | 236 | 115 | 62,576 | 14,224 | Accepted | Accepted | 51.27 | from collections import defaultdict
N,M = list(map(int,input().split()))
A = list(map(int,input().split()))
A[0] %= M
for i in range(N-1):
A[i+1] += A[i]
A[i+1] %= M
d = defaultdict(lambda:0)
d[0] = 1
ans = 0
for i in range(N):
ans += d[A[i]]
d[A[i]] += 1
print(ans) | N,M = list(map(int,input().split()))
A = list(map(int,input().split()))
from collections import defaultdict
r = defaultdict(lambda:0)
s = 0
for i in range(N):
s += A[i]
s %= M
r[s] += 1
ans = r[0]
for s in r:
ans += (r[s]*(r[s]-1))//2
print(ans) | 14 | 16 | 289 | 273 | from collections import defaultdict
N, M = list(map(int, input().split()))
A = list(map(int, input().split()))
A[0] %= M
for i in range(N - 1):
A[i + 1] += A[i]
A[i + 1] %= M
d = defaultdict(lambda: 0)
d[0] = 1
ans = 0
for i in range(N):
ans += d[A[i]]
d[A[i]] += 1
print(ans)
| N, M = list(map(int, input().split()))
A = list(map(int, input().split()))
from collections import defaultdict
r = defaultdict(lambda: 0)
s = 0
for i in range(N):
s += A[i]
s %= M
r[s] += 1
ans = r[0]
for s in r:
ans += (r[s] * (r[s] - 1)) // 2
print(ans)
| false | 12.5 | [
"+N, M = list(map(int, input().split()))",
"+A = list(map(int, input().split()))",
"-N, M = list(map(int, input().split()))",
"-A = list(map(int, input().split()))",
"-A[0] %= M",
"-for i in range(N - 1):",
"- A[i + 1] += A[i]",
"- A[i + 1] %= M",
"-d = defaultdict(lambda: 0)",
"-d[0] = 1",
... | false | 0.048634 | 0.122927 | 0.395635 | [
"s528720098",
"s370566366"
] |
u673361376 | p02823 | python | s860452193 | s817783924 | 167 | 17 | 38,384 | 2,940 | Accepted | Accepted | 89.82 | N,A,B = list(map(int,input().split()))
if abs(B-A)%2==0 :
print((abs(B-A)//2))
else:
x1 = N-max(A,B)
ans1 = N- max(A,B) + 1 + (-min(A,B)+max(A,B)-1)//2
ans2 = min(A,B)+(max(A,B)-min(A,B)-1)//2
print((min(ans1,ans2))) | N, A, B = list(map(int, input().split()))
if (B - A) % 2 == 0:
print(((B - A) // 2))
else:
print((min(A + (B - A - 1) // 2, N - B + 1 + (B - A - 1) // 2)))
| 9 | 6 | 225 | 160 | N, A, B = list(map(int, input().split()))
if abs(B - A) % 2 == 0:
print((abs(B - A) // 2))
else:
x1 = N - max(A, B)
ans1 = N - max(A, B) + 1 + (-min(A, B) + max(A, B) - 1) // 2
ans2 = min(A, B) + (max(A, B) - min(A, B) - 1) // 2
print((min(ans1, ans2)))
| N, A, B = list(map(int, input().split()))
if (B - A) % 2 == 0:
print(((B - A) // 2))
else:
print((min(A + (B - A - 1) // 2, N - B + 1 + (B - A - 1) // 2)))
| false | 33.333333 | [
"-if abs(B - A) % 2 == 0:",
"- print((abs(B - A) // 2))",
"+if (B - A) % 2 == 0:",
"+ print(((B - A) // 2))",
"- x1 = N - max(A, B)",
"- ans1 = N - max(A, B) + 1 + (-min(A, B) + max(A, B) - 1) // 2",
"- ans2 = min(A, B) + (max(A, B) - min(A, B) - 1) // 2",
"- print((min(ans1, ans2)))... | false | 0.119694 | 0.043192 | 2.771212 | [
"s860452193",
"s817783924"
] |
u795245552 | p02900 | python | s186643161 | s055523869 | 350 | 166 | 3,064 | 3,064 | Accepted | Accepted | 52.57 | def gcd(a, b):
if a % b == 0:
return b
else:
return gcd(b, a % b)
def factorize(n):
result = []
dev = 2
while dev ** 2 <= n:
if n % dev == 0:
n //= dev
result.append(dev)
else:
dev += 1
if n > 1:
result.... | def gcd(a, b):
if a % b == 0:
return b
else:
return gcd(b, a % b)
def factorize(n):
result = []
dev = 2
while dev * dev <= n:
if n % dev == 0:
n //= dev
result.append(dev)
else:
dev += 1
if n > 1:
result... | 22 | 22 | 446 | 447 | def gcd(a, b):
if a % b == 0:
return b
else:
return gcd(b, a % b)
def factorize(n):
result = []
dev = 2
while dev**2 <= n:
if n % dev == 0:
n //= dev
result.append(dev)
else:
dev += 1
if n > 1:
result.append(n)
ret... | def gcd(a, b):
if a % b == 0:
return b
else:
return gcd(b, a % b)
def factorize(n):
result = []
dev = 2
while dev * dev <= n:
if n % dev == 0:
n //= dev
result.append(dev)
else:
dev += 1
if n > 1:
result.append(n)
... | false | 0 | [
"- while dev**2 <= n:",
"+ while dev * dev <= n:"
] | false | 0.046038 | 0.036349 | 1.266554 | [
"s186643161",
"s055523869"
] |
u360116509 | p03854 | python | s660111211 | s416939472 | 42 | 19 | 3,188 | 3,188 | Accepted | Accepted | 54.76 | S = eval(input())
targets = ['dream', 'dreamer', 'erase', 'eraser']
i = len(S)
while True:
if i == 0:
print('YES')
exit()
for tg in targets:
if S[i - len(tg):i][::-1] == tg[::-1]:
i -= len(tg)
break
else:
print('NO')
exit()
| S = eval(input())
targets = ['eraser', 'erase', 'dreamer', 'dream']
for tg in targets:
S = S.replace(tg, '')
if len(S) == 0:
print('YES')
else:
print('NO')
| 15 | 10 | 309 | 173 | S = eval(input())
targets = ["dream", "dreamer", "erase", "eraser"]
i = len(S)
while True:
if i == 0:
print("YES")
exit()
for tg in targets:
if S[i - len(tg) : i][::-1] == tg[::-1]:
i -= len(tg)
break
else:
print("NO")
exit()
| S = eval(input())
targets = ["eraser", "erase", "dreamer", "dream"]
for tg in targets:
S = S.replace(tg, "")
if len(S) == 0:
print("YES")
else:
print("NO")
| false | 33.333333 | [
"-targets = [\"dream\", \"dreamer\", \"erase\", \"eraser\"]",
"-i = len(S)",
"-while True:",
"- if i == 0:",
"- print(\"YES\")",
"- exit()",
"- for tg in targets:",
"- if S[i - len(tg) : i][::-1] == tg[::-1]:",
"- i -= len(tg)",
"- break",
"- e... | false | 0.039028 | 0.063784 | 0.611869 | [
"s660111211",
"s416939472"
] |
u687053495 | p02793 | python | s933213146 | s597927077 | 698 | 418 | 14,476 | 15,664 | Accepted | Accepted | 40.11 | # エラトステネスを素因数分解とlcm
N = int(eval(input()))
A = list(map(int, input().split()))
mod = 10 ** 9 + 7
def inverse(a): #aに対し、a**(mod-2)、つまり逆元を返す
T=[a]
while 2**(len(T))<mod: #a**1,a**2.a**4,a**8,...を計算しておく
T.append(T[-1]**2%mod)
b=bin(mod-2) #mod-2を2進数表記にする
ans=1
for i in range(len(b)-2):
... | # エラトステネスを素因数分解とlcm
N = int(eval(input()))
A = list(map(int, input().split()))
mod = 10 ** 9 + 7
def inverse(a): #aに対し、a**(mod-2)、つまり逆元を返す
return pow(a, mod-2, mod)
def eratosthenes(n): #エラストテネスの篩(最大の素因数を格納した配列)
A = [0] * n
A[0], A[1] = -1, -1
for i in range(2, n):
if A[i] == 0:
... | 61 | 53 | 1,141 | 928 | # エラトステネスを素因数分解とlcm
N = int(eval(input()))
A = list(map(int, input().split()))
mod = 10**9 + 7
def inverse(a): # aに対し、a**(mod-2)、つまり逆元を返す
T = [a]
while 2 ** (len(T)) < mod: # a**1,a**2.a**4,a**8,...を計算しておく
T.append(T[-1] ** 2 % mod)
b = bin(mod - 2) # mod-2を2進数表記にする
ans = 1
for i in ran... | # エラトステネスを素因数分解とlcm
N = int(eval(input()))
A = list(map(int, input().split()))
mod = 10**9 + 7
def inverse(a): # aに対し、a**(mod-2)、つまり逆元を返す
return pow(a, mod - 2, mod)
def eratosthenes(n): # エラストテネスの篩(最大の素因数を格納した配列)
A = [0] * n
A[0], A[1] = -1, -1
for i in range(2, n):
if A[i] == 0:
... | false | 13.114754 | [
"- T = [a]",
"- while 2 ** (len(T)) < mod: # a**1,a**2.a**4,a**8,...を計算しておく",
"- T.append(T[-1] ** 2 % mod)",
"- b = bin(mod - 2) # mod-2を2進数表記にする",
"- ans = 1",
"- for i in range(len(b) - 2):",
"- if int(b[-i - 1]) == 1:",
"- ans = ans * T[i] % mod",
"- ... | false | 1.106247 | 0.619581 | 1.785477 | [
"s933213146",
"s597927077"
] |
u119148115 | p02684 | python | s851947456 | s912727034 | 123 | 106 | 126,536 | 101,300 | Accepted | Accepted | 13.82 | N,K = list(map(int,input().split()))
A = [0] + list(map(int,input().split()))
B = [1] + [A[1]]
S = set(B)
i = 1
while i+1 == len(S):
B.append(A[B[i]])
S.add(A[B[i]])
i += 1
for i in range(len(B)-1):
if B[i] == B[-1]:
a = i
break
if K <= a:
print((B[K]))
else:
... | import sys
sys.setrecursionlimit(10**7)
def I(): return int(sys.stdin.readline().rstrip())
def MI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LI(): return list(map(int,sys.stdin.readline().rstrip().split())) #空白あり
def LI2(): return list(map(int,sys.stdin.readline().rstrip())) #空白なし
def ... | 20 | 37 | 349 | 868 | N, K = list(map(int, input().split()))
A = [0] + list(map(int, input().split()))
B = [1] + [A[1]]
S = set(B)
i = 1
while i + 1 == len(S):
B.append(A[B[i]])
S.add(A[B[i]])
i += 1
for i in range(len(B) - 1):
if B[i] == B[-1]:
a = i
break
if K <= a:
print((B[K]))
else:
print((B[a + ... | import sys
sys.setrecursionlimit(10**7)
def I():
return int(sys.stdin.readline().rstrip())
def MI():
return list(map(int, sys.stdin.readline().rstrip().split()))
def LI():
return list(map(int, sys.stdin.readline().rstrip().split())) # 空白あり
def LI2():
return list(map(int, sys.stdin.readline().r... | false | 45.945946 | [
"-N, K = list(map(int, input().split()))",
"-A = [0] + list(map(int, input().split()))",
"-B = [1] + [A[1]]",
"-S = set(B)",
"+import sys",
"+",
"+sys.setrecursionlimit(10**7)",
"+",
"+",
"+def I():",
"+ return int(sys.stdin.readline().rstrip())",
"+",
"+",
"+def MI():",
"+ return ... | false | 0.05905 | 0.064793 | 0.91137 | [
"s851947456",
"s912727034"
] |
u779805689 | p03137 | python | s540330156 | s287434295 | 107 | 97 | 85,408 | 86,300 | Accepted | Accepted | 9.35 | import sys
N,M=list(map(int,input().split()))
X=list(map(int,input().split()))
if N>=M:
print((0))
sys.exit()
X.sort()
Y=[0]*(M-1)
for i in range(M-1):
Y[i]=X[i+1]-X[i]
Y=sorted(Y)[:-(N-M)]
print((sum(Y))) | import sys
N,M=list(map(int,input().split()))
X=list(map(int,input().split()))
X.sort()
Y=[0]*(M-1)
for i in range(M-1):
Y[i]=X[i+1]-X[i]
Y=sorted(Y)[:max(0,M-N)]
print((sum(Y))) | 17 | 13 | 228 | 190 | import sys
N, M = list(map(int, input().split()))
X = list(map(int, input().split()))
if N >= M:
print((0))
sys.exit()
X.sort()
Y = [0] * (M - 1)
for i in range(M - 1):
Y[i] = X[i + 1] - X[i]
Y = sorted(Y)[: -(N - M)]
print((sum(Y)))
| import sys
N, M = list(map(int, input().split()))
X = list(map(int, input().split()))
X.sort()
Y = [0] * (M - 1)
for i in range(M - 1):
Y[i] = X[i + 1] - X[i]
Y = sorted(Y)[: max(0, M - N)]
print((sum(Y)))
| false | 23.529412 | [
"-if N >= M:",
"- print((0))",
"- sys.exit()",
"-Y = sorted(Y)[: -(N - M)]",
"+Y = sorted(Y)[: max(0, M - N)]"
] | false | 0.043329 | 0.040184 | 1.07828 | [
"s540330156",
"s287434295"
] |
u596276291 | p04011 | python | s339462419 | s094579695 | 24 | 21 | 3,064 | 3,316 | Accepted | Accepted | 12.5 | def main():
n = int(eval(input()))
k = int(eval(input()))
x = int(eval(input()))
y = int(eval(input()))
ans = 0
for i in range(n):
if i < k:
ans += x
else:
ans += y
print(ans)
if __name__ == '__main__':
main()
| from collections import defaultdict
def main():
N, K, X, Y = int(eval(input())), int(eval(input())), int(eval(input())), int(eval(input()))
ans = 0
for i in range(N):
ans += X if i < K else Y
print(ans)
if __name__ == '__main__':
main()
| 16 | 12 | 275 | 255 | def main():
n = int(eval(input()))
k = int(eval(input()))
x = int(eval(input()))
y = int(eval(input()))
ans = 0
for i in range(n):
if i < k:
ans += x
else:
ans += y
print(ans)
if __name__ == "__main__":
main()
| from collections import defaultdict
def main():
N, K, X, Y = (
int(eval(input())),
int(eval(input())),
int(eval(input())),
int(eval(input())),
)
ans = 0
for i in range(N):
ans += X if i < K else Y
print(ans)
if __name__ == "__main__":
main()
| false | 25 | [
"+from collections import defaultdict",
"+",
"+",
"- n = int(eval(input()))",
"- k = int(eval(input()))",
"- x = int(eval(input()))",
"- y = int(eval(input()))",
"+ N, K, X, Y = (",
"+ int(eval(input())),",
"+ int(eval(input())),",
"+ int(eval(input())),",
"... | false | 0.109257 | 0.007932 | 13.774269 | [
"s339462419",
"s094579695"
] |
u763280125 | p03487 | python | s183356509 | s140132166 | 91 | 83 | 21,884 | 22,568 | Accepted | Accepted | 8.79 | N = int(eval(input()))
A = input().split()
A = [int(a) for a in A]
D = {}
for a in A:
D[a] = D.get(a, 0) + 1
cnt = 0
for k, v in list(D.items()):
if k < v:
cnt += v - k
elif v < k:
cnt += v
print(cnt)
| from collections import Counter
N = int(eval(input()))
D = Counter([int(a) for a in input().split()])
cnt = 0
for k, v in list(D.items()):
if k < v:
cnt += v - k
elif v < k:
cnt += v
print(cnt)
| 16 | 11 | 235 | 217 | N = int(eval(input()))
A = input().split()
A = [int(a) for a in A]
D = {}
for a in A:
D[a] = D.get(a, 0) + 1
cnt = 0
for k, v in list(D.items()):
if k < v:
cnt += v - k
elif v < k:
cnt += v
print(cnt)
| from collections import Counter
N = int(eval(input()))
D = Counter([int(a) for a in input().split()])
cnt = 0
for k, v in list(D.items()):
if k < v:
cnt += v - k
elif v < k:
cnt += v
print(cnt)
| false | 31.25 | [
"+from collections import Counter",
"+",
"-A = input().split()",
"-A = [int(a) for a in A]",
"-D = {}",
"-for a in A:",
"- D[a] = D.get(a, 0) + 1",
"+D = Counter([int(a) for a in input().split()])"
] | false | 0.039211 | 0.081084 | 0.483587 | [
"s183356509",
"s140132166"
] |
u340781749 | p03460 | python | s094870733 | s788510008 | 1,545 | 994 | 91,508 | 101,976 | Accepted | Accepted | 35.66 | from itertools import accumulate
n, k = list(map(int, input().split()))
k2 = k * 2
req_b = [[0] * k for _ in range(k)]
req_w = [[0] * k for _ in range(k)]
bc, wc = 0, 0
for i in range(n):
x, y, c = input().split()
x, y = int(x), int(y)
rx, ry = x % k2, y % k2
b = c == 'B'
if rx >= k:
... | from itertools import accumulate
n, k = list(map(int, input().split()))
k2 = k * 2
req_b = [[0] * k for _ in range(k)]
req_w = [[0] * k for _ in range(k)]
bc, wc = 0, 0
for i in range(n):
x, y, c = input().split()
x, y = int(x), int(y)
rx, ry = x % k2, y % k2
b = c == 'B'
if rx >= k:
... | 44 | 44 | 1,133 | 1,116 | from itertools import accumulate
n, k = list(map(int, input().split()))
k2 = k * 2
req_b = [[0] * k for _ in range(k)]
req_w = [[0] * k for _ in range(k)]
bc, wc = 0, 0
for i in range(n):
x, y, c = input().split()
x, y = int(x), int(y)
rx, ry = x % k2, y % k2
b = c == "B"
if rx >= k:
rx -= ... | from itertools import accumulate
n, k = list(map(int, input().split()))
k2 = k * 2
req_b = [[0] * k for _ in range(k)]
req_w = [[0] * k for _ in range(k)]
bc, wc = 0, 0
for i in range(n):
x, y, c = input().split()
x, y = int(x), int(y)
rx, ry = x % k2, y % k2
b = c == "B"
if rx >= k:
rx -= ... | false | 0 | [
"-for dx, (dx_b, dx_w) in enumerate(zip(req_b, req_w)):",
"+for dx_b, dx_w in zip(req_b, req_w):"
] | false | 0.044352 | 0.045448 | 0.975901 | [
"s094870733",
"s788510008"
] |
u981931040 | p03325 | python | s407903965 | s826952117 | 140 | 80 | 4,148 | 4,212 | Accepted | Accepted | 42.86 | N = int(eval(input()))
A = list(map(int,input().split()))
ans = 0
for a in A:
cnt = 0
for i in range(1,a + 1):
if a % 2**i == 0:
cnt += 1
else:
break
ans += cnt
print(ans) | N = int(eval(input()))
A = list(map(int, input().split()))
ans = 0
for a in A:
while a % 2 == 0:
a //= 2
ans += 1
print(ans) | 12 | 8 | 228 | 145 | N = int(eval(input()))
A = list(map(int, input().split()))
ans = 0
for a in A:
cnt = 0
for i in range(1, a + 1):
if a % 2**i == 0:
cnt += 1
else:
break
ans += cnt
print(ans)
| N = int(eval(input()))
A = list(map(int, input().split()))
ans = 0
for a in A:
while a % 2 == 0:
a //= 2
ans += 1
print(ans)
| false | 33.333333 | [
"- cnt = 0",
"- for i in range(1, a + 1):",
"- if a % 2**i == 0:",
"- cnt += 1",
"- else:",
"- break",
"- ans += cnt",
"+ while a % 2 == 0:",
"+ a //= 2",
"+ ans += 1"
] | false | 0.034383 | 0.096564 | 0.356066 | [
"s407903965",
"s826952117"
] |
u744920373 | p03476 | python | s191098063 | s999835628 | 532 | 354 | 33,584 | 32,840 | Accepted | Accepted | 33.46 | import sys
sys.setrecursionlimit(10**8)
def ii(): return int(sys.stdin.readline())
def mi(): return list(map(int, sys.stdin.readline().split()))
def li(): return list(map(int, sys.stdin.readline().split()))
def li2(N): return [list(map(int, sys.stdin.readline().split())) for _ in range(N)]
def dp2(ini, i, j): ret... | import sys
sys.setrecursionlimit(10**8)
def ii(): return int(sys.stdin.readline())
def mi(): return list(map(int, sys.stdin.readline().split()))
def li(): return list(map(int, sys.stdin.readline().split()))
def li2(N): return [list(map(int, sys.stdin.readline().split())) for _ in range(N)]
def dp2(ini, i, j): ret... | 41 | 58 | 1,158 | 1,622 | import sys
sys.setrecursionlimit(10**8)
def ii():
return int(sys.stdin.readline())
def mi():
return list(map(int, sys.stdin.readline().split()))
def li():
return list(map(int, sys.stdin.readline().split()))
def li2(N):
return [list(map(int, sys.stdin.readline().split())) for _ in range(N)]
de... | import sys
sys.setrecursionlimit(10**8)
def ii():
return int(sys.stdin.readline())
def mi():
return list(map(int, sys.stdin.readline().split()))
def li():
return list(map(int, sys.stdin.readline().split()))
def li2(N):
return [list(map(int, sys.stdin.readline().split())) for _ in range(N)]
de... | false | 29.310345 | [
"+\"\"\"",
"+def sieve(n):",
"+ is_prime = [True for _ in range(n+1)]",
"+ is_prime[0] = False",
"+ for i in range(2, n+1):",
"+ if is_prime[i-1]:",
"+ j = 2 * i",
"+ while j <= n:",
"+ is_prime[j-1] = False",
"+ j += i",
"+ ... | false | 0.419103 | 0.098612 | 4.25001 | [
"s191098063",
"s999835628"
] |
u252663009 | p03162 | python | s144785030 | s672379692 | 620 | 268 | 72,408 | 102,748 | Accepted | Accepted | 56.77 | n=int(eval(input()))
l1=[]
l2=[]
l3=[]
for i in range(n):
l=input().split()
u=int(l[0])
v=int(l[1])
w=int(l[2])
l1.append(u)
l2.append(v)
l3.append(w)
dpu=[0 for i in range(n)]
dpv=[0 for i in range(n)]
dpw=[0 for i in range(n)]
dpu[0]=l1[0]
dpv[0]=l2[0]
dpw[0]=l3[0]
for i in range(1,n):
dpu[... | n=int(eval(input()))
l=[]
for i in range(n):
lo=input().split()
l.append((int(lo[0]),int(lo[1]),int(lo[2])))
dp=[[0 for i in range(3)]for i in range(n)]
dp[0][0]=l[0][0]
dp[0][1]=l[0][1]
dp[0][2]=l[0][2]
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][2],... | 23 | 14 | 459 | 429 | n = int(eval(input()))
l1 = []
l2 = []
l3 = []
for i in range(n):
l = input().split()
u = int(l[0])
v = int(l[1])
w = int(l[2])
l1.append(u)
l2.append(v)
l3.append(w)
dpu = [0 for i in range(n)]
dpv = [0 for i in range(n)]
dpw = [0 for i in range(n)]
dpu[0] = l1[0]
dpv[0] = l2[0]
dpw[0] = l3... | n = int(eval(input()))
l = []
for i in range(n):
lo = input().split()
l.append((int(lo[0]), int(lo[1]), int(lo[2])))
dp = [[0 for i in range(3)] for i in range(n)]
dp[0][0] = l[0][0]
dp[0][1] = l[0][1]
dp[0][2] = l[0][2]
for i in range(1, n):
dp[i][0] = max(dp[i - 1][1], dp[i - 1][2]) + l[i][0]
dp[i][1]... | false | 39.130435 | [
"-l1 = []",
"-l2 = []",
"-l3 = []",
"+l = []",
"- l = input().split()",
"- u = int(l[0])",
"- v = int(l[1])",
"- w = int(l[2])",
"- l1.append(u)",
"- l2.append(v)",
"- l3.append(w)",
"-dpu = [0 for i in range(n)]",
"-dpv = [0 for i in range(n)]",
"-dpw = [0 for i in ra... | false | 0.035904 | 0.03556 | 1.009654 | [
"s144785030",
"s672379692"
] |
u714642969 | p03127 | python | s520413079 | s800374283 | 321 | 101 | 88,428 | 86,372 | Accepted | Accepted | 68.54 | import sys
from fractions import gcd
sys.setrecursionlimit(10**9)
INF=10**18
MOD=10**9+7
def input():
return sys.stdin.readline().rstrip()
def main():
N=int(eval(input()))
A=list(map(int,input().split()))
ans=A[0]
for x in A[1:]:
ans=gcd(ans,x)
print(ans)
if... | # -*- coding: utf-8 -*-
import sys
from math import gcd
sys.setrecursionlimit(10**9)
INF=10**18
MOD=10**9+7
input=lambda: sys.stdin.readline().rstrip()
YesNo=lambda b: bool([print('Yes')] if b else print('No'))
YESNO=lambda b: bool([print('YES')] if b else print('NO'))
int1=lambda x:int(x)-1
N=int(input())
... | 20 | 17 | 351 | 412 | import sys
from fractions import gcd
sys.setrecursionlimit(10**9)
INF = 10**18
MOD = 10**9 + 7
def input():
return sys.stdin.readline().rstrip()
def main():
N = int(eval(input()))
A = list(map(int, input().split()))
ans = A[0]
for x in A[1:]:
ans = gcd(ans, x)
print(ans)
if __name... | # -*- coding: utf-8 -*-
import sys
from math import gcd
sys.setrecursionlimit(10**9)
INF = 10**18
MOD = 10**9 + 7
input = lambda: sys.stdin.readline().rstrip()
YesNo = lambda b: bool([print("Yes")] if b else print("No"))
YESNO = lambda b: bool([print("YES")] if b else print("NO"))
int1 = lambda x: int(x) - 1
N = int(i... | false | 15 | [
"+# -*- coding: utf-8 -*-",
"-from fractions import gcd",
"+from math import gcd",
"-",
"-",
"-def input():",
"- return sys.stdin.readline().rstrip()",
"-",
"-",
"-def main():",
"- N = int(eval(input()))",
"- A = list(map(int, input().split()))",
"- ans = A[0]",
"- for x in ... | false | 0.045353 | 0.06731 | 0.673791 | [
"s520413079",
"s800374283"
] |
u729133443 | p02616 | python | s026249828 | s678494480 | 190 | 166 | 31,576 | 31,588 | Accepted | Accepted | 12.63 | M=10**9+7
n,k,*a=list(map(int,open(y:=0).read().split()))
a.sort()
s=1
a=a[-k*(a[-1]<0<k%2):]
while k-y>1:
if(t:=a[y]*a[y+1])>a[-1]*a[-2]:s=s*t%M;y+=2
else:s=s*a.pop()%M;k-=1
if k-y:s*=a[-1]
print((s%M)) | n,k,*a=list(map(int,open(i:=0).read().split()))
a.sort()
p=a.pop
s=b=~k%2or p()
for _ in k//2*'_':
x=a[i]*a[i+1]
if x*b>a[-1]*a[-2]*b:s*=x;i+=2
else:s*=p()*p()
s%=10**9+7
print(s) | 10 | 10 | 206 | 186 | M = 10**9 + 7
n, k, *a = list(map(int, open(y := 0).read().split()))
a.sort()
s = 1
a = a[-k * (a[-1] < 0 < k % 2) :]
while k - y > 1:
if (t := a[y] * a[y + 1]) > a[-1] * a[-2]:
s = s * t % M
y += 2
else:
s = s * a.pop() % M
k -= 1
if k - y:
s *= a[-1]
print((s % M))
| n, k, *a = list(map(int, open(i := 0).read().split()))
a.sort()
p = a.pop
s = b = ~k % 2 or p()
for _ in k // 2 * "_":
x = a[i] * a[i + 1]
if x * b > a[-1] * a[-2] * b:
s *= x
i += 2
else:
s *= p() * p()
s %= 10**9 + 7
print(s)
| false | 0 | [
"-M = 10**9 + 7",
"-n, k, *a = list(map(int, open(y := 0).read().split()))",
"+n, k, *a = list(map(int, open(i := 0).read().split()))",
"-s = 1",
"-a = a[-k * (a[-1] < 0 < k % 2) :]",
"-while k - y > 1:",
"- if (t := a[y] * a[y + 1]) > a[-1] * a[-2]:",
"- s = s * t % M",
"- y += 2",... | false | 0.037063 | 0.066611 | 0.556412 | [
"s026249828",
"s678494480"
] |
u630467326 | p02695 | python | s451774768 | s260838010 | 1,124 | 645 | 9,088 | 23,068 | Accepted | Accepted | 42.62 | from itertools import combinations_with_replacement as comb_rplc
n, m ,q = list(map(int, input().split()))
req = [list(map(int, input().split())) for _ in range(q)]
ans = 0
for seq in comb_rplc(list(range(1 , (m + 1))), n):
score = 0
for a, b, c, d in req:
if seq[b - 1] - seq[a - 1] == c:
... | from collections import deque
def calc(seq):
score = 0
for a, b, c, d in req:
if seq[b - 1] - seq[a - 1] == c:
score += d
return score
n, m, q = list(map(int, input().split()))
req = [list(map(int, input().split())) for _ in range(q)]
ans = 0
que = deque()
for i in range(1, m + 1):
q... | 18 | 29 | 367 | 564 | from itertools import combinations_with_replacement as comb_rplc
n, m, q = list(map(int, input().split()))
req = [list(map(int, input().split())) for _ in range(q)]
ans = 0
for seq in comb_rplc(list(range(1, (m + 1))), n):
score = 0
for a, b, c, d in req:
if seq[b - 1] - seq[a - 1] == c:
sc... | from collections import deque
def calc(seq):
score = 0
for a, b, c, d in req:
if seq[b - 1] - seq[a - 1] == c:
score += d
return score
n, m, q = list(map(int, input().split()))
req = [list(map(int, input().split())) for _ in range(q)]
ans = 0
que = deque()
for i in range(1, m + 1):
... | false | 37.931034 | [
"-from itertools import combinations_with_replacement as comb_rplc",
"+from collections import deque",
"+",
"+",
"+def calc(seq):",
"+ score = 0",
"+ for a, b, c, d in req:",
"+ if seq[b - 1] - seq[a - 1] == c:",
"+ score += d",
"+ return score",
"+",
"-for seq in co... | false | 0.101809 | 0.097022 | 1.049341 | [
"s451774768",
"s260838010"
] |
u095756391 | p02614 | python | s545071354 | s445220855 | 83 | 56 | 8,988 | 9,108 | Accepted | Accepted | 32.53 | import sys
input = sys.stdin.readline
def main():
H, W, K = list(map(int, input().split()))
c = [eval(input()) for i in range(H)]
ans = 0
for maskR in range(2 ** H):
for maskC in range(2 ** W):
black = 0
for i in range(H):
for j in range(W):
... | import sys
input = sys.stdin.readline
def main():
H, W, K = list(map(int, input().split()))
c = [eval(input()) for i in range(H)]
ans = 0
for maskR in range(2 ** H):
for maskC in range(2 ** W):
black = 0
for i in range(H):
for j in range(W):
... | 22 | 22 | 546 | 546 | import sys
input = sys.stdin.readline
def main():
H, W, K = list(map(int, input().split()))
c = [eval(input()) for i in range(H)]
ans = 0
for maskR in range(2**H):
for maskC in range(2**W):
black = 0
for i in range(H):
for j in range(W):
... | import sys
input = sys.stdin.readline
def main():
H, W, K = list(map(int, input().split()))
c = [eval(input()) for i in range(H)]
ans = 0
for maskR in range(2**H):
for maskC in range(2**W):
black = 0
for i in range(H):
for j in range(W):
... | false | 0 | [
"- if 2**i & maskR > 0 and 2**j & maskC > 0 and c[i][j] == \"#\":",
"+ if ((maskR >> i) & 1) and ((maskC >> j) & 1) and c[i][j] == \"#\":"
] | false | 0.040492 | 0.047528 | 0.851956 | [
"s545071354",
"s445220855"
] |
u926412290 | p03031 | python | s145305213 | s072054764 | 122 | 85 | 75,152 | 68,088 | Accepted | Accepted | 30.33 | N, M = list(map(int, input().split()))
lights = [list(map(int, input().split())) for _ in range(M)]
p = list(map(int, input().split()))
ans = 0
for i in range(1<<N):
on = 0
onoff = bin(i)[2:].zfill(N)
for j, switches in enumerate(lights):
if sum(onoff[s-1] == '1' for s in switches[1:]) % 2... | N, M = list(map(int, input().split()))
connected = [list(map(int,input().split())) for _ in range(M)]
p = list(map(int, input().split()))
ans = 0
for i in range(1<<N):
for j,lst in enumerate(connected):
count = 0
for s in lst[1:]:
if (i>>(s-1)) & 1:
count += 1
... | 15 | 17 | 393 | 407 | N, M = list(map(int, input().split()))
lights = [list(map(int, input().split())) for _ in range(M)]
p = list(map(int, input().split()))
ans = 0
for i in range(1 << N):
on = 0
onoff = bin(i)[2:].zfill(N)
for j, switches in enumerate(lights):
if sum(onoff[s - 1] == "1" for s in switches[1:]) % 2 == p[... | N, M = list(map(int, input().split()))
connected = [list(map(int, input().split())) for _ in range(M)]
p = list(map(int, input().split()))
ans = 0
for i in range(1 << N):
for j, lst in enumerate(connected):
count = 0
for s in lst[1:]:
if (i >> (s - 1)) & 1:
count += 1
... | false | 11.764706 | [
"-lights = [list(map(int, input().split())) for _ in range(M)]",
"+connected = [list(map(int, input().split())) for _ in range(M)]",
"- on = 0",
"- onoff = bin(i)[2:].zfill(N)",
"- for j, switches in enumerate(lights):",
"- if sum(onoff[s - 1] == \"1\" for s in switches[1:]) % 2 == p[j]:",... | false | 0.036765 | 0.035621 | 1.032092 | [
"s145305213",
"s072054764"
] |
u831294922 | p02727 | python | s388140232 | s969106943 | 344 | 239 | 114,412 | 23,312 | Accepted | Accepted | 30.52 | import sys
#input = sys.stdin.readline
rl = lambda: list(map(int, input().split()))
x, y, a, b, c = rl()
p = rl()
q = rl()
r = rl()
p.sort(reverse=True)
q.sort(reverse=True)
r.sort(reverse=True)
res = sum(sorted(p[:x] + q[:y] + r, reverse=True)[:x+y])
print(res)
| import sys
input = sys.stdin.readline
rl = lambda: list(map(int, input().split()))
x, y, a, b, c = rl()
p = rl()
q = rl()
r = rl()
p.sort(reverse=True)
q.sort(reverse=True)
r.sort(reverse=True)
res = sum(sorted(p[:x] + q[:y] + r, reverse=True)[:x+y])
print(res)
| 14 | 14 | 278 | 277 | import sys
# input = sys.stdin.readline
rl = lambda: list(map(int, input().split()))
x, y, a, b, c = rl()
p = rl()
q = rl()
r = rl()
p.sort(reverse=True)
q.sort(reverse=True)
r.sort(reverse=True)
res = sum(sorted(p[:x] + q[:y] + r, reverse=True)[: x + y])
print(res)
| import sys
input = sys.stdin.readline
rl = lambda: list(map(int, input().split()))
x, y, a, b, c = rl()
p = rl()
q = rl()
r = rl()
p.sort(reverse=True)
q.sort(reverse=True)
r.sort(reverse=True)
res = sum(sorted(p[:x] + q[:y] + r, reverse=True)[: x + y])
print(res)
| false | 0 | [
"-# input = sys.stdin.readline",
"+input = sys.stdin.readline"
] | false | 0.074074 | 0.063356 | 1.16917 | [
"s388140232",
"s969106943"
] |
u352394527 | p00179 | python | s713107276 | s934816997 | 1,500 | 760 | 7,820 | 7,824 | Accepted | Accepted | 49.33 | from collections import deque
def only_color(s):
temp = s[0]
for i in range(1, len(s)):
c = s[i]
if temp != c:
return False
temp = c
return True
def new_color(s, i):
color = [c for c in ("r", "g", "b") if c not in (s[i], s[i + 1])][0]
return s[:i] + color * 2 + s[i + 2:]
... | from collections import deque
def only_color(s, monos):
if s in monos:
return True
else:
return False
def new_color(s, i, rgb):
for color in rgb:
if color != s[i] and color != s[i + 1]:
break
return s[:i] + color * 2 + s[i + 2:]
def solve(s):
length = len(s)
monos = ["r"... | 51 | 54 | 964 | 984 | from collections import deque
def only_color(s):
temp = s[0]
for i in range(1, len(s)):
c = s[i]
if temp != c:
return False
temp = c
return True
def new_color(s, i):
color = [c for c in ("r", "g", "b") if c not in (s[i], s[i + 1])][0]
return s[:i] + color * 2 ... | from collections import deque
def only_color(s, monos):
if s in monos:
return True
else:
return False
def new_color(s, i, rgb):
for color in rgb:
if color != s[i] and color != s[i + 1]:
break
return s[:i] + color * 2 + s[i + 2 :]
def solve(s):
length = len(s... | false | 5.555556 | [
"-def only_color(s):",
"- temp = s[0]",
"- for i in range(1, len(s)):",
"- c = s[i]",
"- if temp != c:",
"- return False",
"- temp = c",
"- return True",
"+def only_color(s, monos):",
"+ if s in monos:",
"+ return True",
"+ else:",
"+ ... | false | 0.049532 | 0.047801 | 1.036208 | [
"s713107276",
"s934816997"
] |
u440161695 | p02947 | python | s229709236 | s966606239 | 480 | 440 | 23,648 | 17,852 | Accepted | Accepted | 8.33 | N=int(eval(input()))
d=dict()
ans=0
for _ in range(N):
s=eval(input())
s=tuple(sorted(s))
if s in d:
d[s]+=1
else:
d[s]=0
for i in list(d.values()):
ans+=(int(i)**2+int(i))/2
print((int(ans))) | def f(n):
return (n**2-n)//2
ans=0
N=int(eval(input()))
d=dict()
for i in range(N):
s="".join(sorted(eval(input())))
if s not in d:
d[s]=0
d[s]+=1
for i in d:
ans+=f(d[i])
print(ans)
| 13 | 13 | 202 | 197 | N = int(eval(input()))
d = dict()
ans = 0
for _ in range(N):
s = eval(input())
s = tuple(sorted(s))
if s in d:
d[s] += 1
else:
d[s] = 0
for i in list(d.values()):
ans += (int(i) ** 2 + int(i)) / 2
print((int(ans)))
| def f(n):
return (n**2 - n) // 2
ans = 0
N = int(eval(input()))
d = dict()
for i in range(N):
s = "".join(sorted(eval(input())))
if s not in d:
d[s] = 0
d[s] += 1
for i in d:
ans += f(d[i])
print(ans)
| false | 0 | [
"+def f(n):",
"+ return (n**2 - n) // 2",
"+",
"+",
"+ans = 0",
"-ans = 0",
"-for _ in range(N):",
"- s = eval(input())",
"- s = tuple(sorted(s))",
"- if s in d:",
"- d[s] += 1",
"- else:",
"+for i in range(N):",
"+ s = \"\".join(sorted(eval(input())))",
"+ if... | false | 0.055081 | 0.036216 | 1.52089 | [
"s229709236",
"s966606239"
] |
u485319545 | p03639 | python | s527598573 | s676740477 | 84 | 70 | 14,252 | 14,252 | Accepted | Accepted | 16.67 | n=int(eval(input()))
a=list(map(int,input().split()))
border_4 = n//2
border_2 = n
cnt_4=0
cnt_2=0
for i in range(n):
if a[i]%4==0:
cnt_4+=1
elif a[i]%4!=0 and a[i]%2==0:
cnt_2+=1
else:
continue
if cnt_4>=border_4:
print('Yes')
elif n-cnt_4*2<=cnt_2:
... | n=int(eval(input()))
a=list(map(int,input().split()))
border_4 = n//2
border_2 = n
cnt_4=0
cnt_2=0
for i in range(n):
if a[i]%4==0:
cnt_4+=1
cnt_2+=1
elif a[i]%2==0:
cnt_2+=1
else:
continue
if cnt_4>=border_4:
print('Yes')
elif n-cnt_4*2<=(cnt_2-... | 24 | 25 | 351 | 364 | n = int(eval(input()))
a = list(map(int, input().split()))
border_4 = n // 2
border_2 = n
cnt_4 = 0
cnt_2 = 0
for i in range(n):
if a[i] % 4 == 0:
cnt_4 += 1
elif a[i] % 4 != 0 and a[i] % 2 == 0:
cnt_2 += 1
else:
continue
if cnt_4 >= border_4:
print("Yes")
elif n - cnt_4 * 2 <= c... | n = int(eval(input()))
a = list(map(int, input().split()))
border_4 = n // 2
border_2 = n
cnt_4 = 0
cnt_2 = 0
for i in range(n):
if a[i] % 4 == 0:
cnt_4 += 1
cnt_2 += 1
elif a[i] % 2 == 0:
cnt_2 += 1
else:
continue
if cnt_4 >= border_4:
print("Yes")
elif n - cnt_4 * 2 <= ... | false | 4 | [
"- elif a[i] % 4 != 0 and a[i] % 2 == 0:",
"+ cnt_2 += 1",
"+ elif a[i] % 2 == 0:",
"-elif n - cnt_4 * 2 <= cnt_2:",
"+elif n - cnt_4 * 2 <= (cnt_2 - cnt_4):"
] | false | 0.050531 | 0.050881 | 0.993134 | [
"s527598573",
"s676740477"
] |
u659159398 | p02714 | python | s407539702 | s310210921 | 164 | 120 | 68,972 | 68,348 | Accepted | Accepted | 26.83 | n = int(eval(input()))
s = eval(input())
rinds, ginds, binds = [], [], set()
for i in range(n):
if s[i] == 'R': rinds.append(i)
elif s[i] == 'G': ginds.append(i)
else: binds.add(i)
rlen, glen, blen = len(rinds), len(ginds), len(binds)
ans = 0
for i in rinds:
for j in ginds:
... | def solution1():
# https://www.youtube.com/watch?v=aRdGRrsRo7I
n = int(eval(input()))
s = eval(input())
r, g, b = 0, 0, 0
for i in s:
if i == 'R': r += 1
elif i == 'G': g += 1
else: b += 1
total = r*g*b
# all permutations of rgb are valid, to check if... | 79 | 25 | 1,415 | 799 | n = int(eval(input()))
s = eval(input())
rinds, ginds, binds = [], [], set()
for i in range(n):
if s[i] == "R":
rinds.append(i)
elif s[i] == "G":
ginds.append(i)
else:
binds.add(i)
rlen, glen, blen = len(rinds), len(ginds), len(binds)
ans = 0
for i in rinds:
for j in ginds:
... | def solution1():
# https://www.youtube.com/watch?v=aRdGRrsRo7I
n = int(eval(input()))
s = eval(input())
r, g, b = 0, 0, 0
for i in s:
if i == "R":
r += 1
elif i == "G":
g += 1
else:
b += 1
total = r * g * b
# all permutations of rgb... | false | 68.35443 | [
"-n = int(eval(input()))",
"-s = eval(input())",
"-rinds, ginds, binds = [], [], set()",
"-for i in range(n):",
"- if s[i] == \"R\":",
"- rinds.append(i)",
"- elif s[i] == \"G\":",
"- ginds.append(i)",
"- else:",
"- binds.add(i)",
"-rlen, glen, blen = len(rinds), le... | false | 0.036433 | 0.041434 | 0.879313 | [
"s407539702",
"s310210921"
] |
u293198424 | p02922 | python | s729655426 | s996594621 | 184 | 167 | 38,384 | 38,384 | Accepted | Accepted | 9.24 | a,b = list(map(int,input().split()))
ans = 1
count = 0
while ans < b:
ans = (ans-1)+a
count += 1
print(count) | a,b = list(map(int,input().split()))
ans = 1
count = 0
while ans<b:
ans += (a-1)
count += 1
print(count) | 7 | 7 | 117 | 112 | a, b = list(map(int, input().split()))
ans = 1
count = 0
while ans < b:
ans = (ans - 1) + a
count += 1
print(count)
| a, b = list(map(int, input().split()))
ans = 1
count = 0
while ans < b:
ans += a - 1
count += 1
print(count)
| false | 0 | [
"- ans = (ans - 1) + a",
"+ ans += a - 1"
] | false | 0.036459 | 0.035281 | 1.033413 | [
"s729655426",
"s996594621"
] |
u706929073 | p02899 | python | s116199380 | s129258785 | 215 | 190 | 19,708 | 26,084 | Accepted | Accepted | 11.63 | n = int(eval(input()))
a = list(map(int, input().split()))
indices = [i + 1 for i in range(n)]
result = sorted(zip(a, indices))
ans = "{}".format(result[0][1])
for i in range(n)[1::]:
ans += " {}".format(result[i][1])
print(ans)
| n = int(eval(input()))
a = list(map(int, input().split()))
indices = [i + 1 for i in range(n)]
ans = list([str(x[1]) for x in sorted(zip(a, indices))])
print((" ".join(ans)))
| 8 | 5 | 234 | 176 | n = int(eval(input()))
a = list(map(int, input().split()))
indices = [i + 1 for i in range(n)]
result = sorted(zip(a, indices))
ans = "{}".format(result[0][1])
for i in range(n)[1::]:
ans += " {}".format(result[i][1])
print(ans)
| n = int(eval(input()))
a = list(map(int, input().split()))
indices = [i + 1 for i in range(n)]
ans = list([str(x[1]) for x in sorted(zip(a, indices))])
print((" ".join(ans)))
| false | 37.5 | [
"-result = sorted(zip(a, indices))",
"-ans = \"{}\".format(result[0][1])",
"-for i in range(n)[1::]:",
"- ans += \" {}\".format(result[i][1])",
"-print(ans)",
"+ans = list([str(x[1]) for x in sorted(zip(a, indices))])",
"+print((\" \".join(ans)))"
] | false | 0.127031 | 0.291277 | 0.436118 | [
"s116199380",
"s129258785"
] |
u952164537 | p02887 | python | s590877144 | s931288866 | 37 | 33 | 3,956 | 3,956 | Accepted | Accepted | 10.81 | N = int(eval(input()))
r = 0
S = ''
for s in list(eval(input())):
if S != s:
r += 1
S = s
print(r) | N = int(eval(input()))
r = 0
S = ''
for s in list(eval(input())):
if S != s:
r += 1
S = s
print(r) | 8 | 8 | 109 | 113 | N = int(eval(input()))
r = 0
S = ""
for s in list(eval(input())):
if S != s:
r += 1
S = s
print(r)
| N = int(eval(input()))
r = 0
S = ""
for s in list(eval(input())):
if S != s:
r += 1
S = s
print(r)
| false | 0 | [
"- S = s",
"+ S = s"
] | false | 0.059821 | 0.070919 | 0.843522 | [
"s590877144",
"s931288866"
] |
u952708174 | p03807 | python | s224908774 | s504662784 | 56 | 47 | 14,108 | 14,112 | Accepted | Accepted | 16.07 | def a_addition(N, A):
count_odd = 0 # 数列の要素のうち奇数のものの個数
for a in A:
if a % 2 == 1:
count_odd += 1
# 偶数のペアからは1個の偶数が生成される
# 奇数が偶数個あれば、余ることなく奇数をペアにして偶数を生成できる
# 奇数が奇数個あれば、ペアにできない奇数が余ってしまう
if count_odd % 2 == 0:
ans = 'YES'
else:
ans = 'NO'
retu... | N = int(input())
A = [int(i) for i in input().split()]
print('YES') if sum(A) % 2 == 0 else print('NO')
| 17 | 4 | 410 | 107 | def a_addition(N, A):
count_odd = 0 # 数列の要素のうち奇数のものの個数
for a in A:
if a % 2 == 1:
count_odd += 1
# 偶数のペアからは1個の偶数が生成される
# 奇数が偶数個あれば、余ることなく奇数をペアにして偶数を生成できる
# 奇数が奇数個あれば、ペアにできない奇数が余ってしまう
if count_odd % 2 == 0:
ans = "YES"
else:
ans = "NO"
return ans
N =... | N = int(input())
A = [int(i) for i in input().split()]
print("YES") if sum(A) % 2 == 0 else print("NO")
| false | 76.470588 | [
"-def a_addition(N, A):",
"- count_odd = 0 # 数列の要素のうち奇数のものの個数",
"- for a in A:",
"- if a % 2 == 1:",
"- count_odd += 1",
"- # 偶数のペアからは1個の偶数が生成される",
"- # 奇数が偶数個あれば、余ることなく奇数をペアにして偶数を生成できる",
"- # 奇数が奇数個あれば、ペアにできない奇数が余ってしまう",
"- if count_odd % 2 == 0:",
"- a... | false | 0.038948 | 0.038362 | 1.015279 | [
"s224908774",
"s504662784"
] |
u606045429 | p02689 | python | s648328109 | s615711319 | 167 | 119 | 44,004 | 43,952 | Accepted | Accepted | 28.74 | N, M, *I = list(map(int, open(0).read().split()))
H, AB = [0] + I[:N], I[N:]
memo = [0] * (N + 1)
for a, b in zip(*[iter(AB)] * 2):
memo[a] = max(memo[a], H[b])
memo[b] = max(memo[b], H[a])
print((sum(h > ma for h, ma in zip(H[1:], memo[1:])))) | N, M, *I = list(map(int, open(0).read().split()))
H, AB = [0] + I[:N], I[N:]
memo = [False] + [True] * N
for a, b in zip(*[iter(AB)] * 2):
if H[a] < H[b]:
memo[a] = False
elif H[b] < H[a]:
memo[b] = False
else:
memo[a] = memo[b] = False
print((sum(memo))) | 9 | 13 | 254 | 297 | N, M, *I = list(map(int, open(0).read().split()))
H, AB = [0] + I[:N], I[N:]
memo = [0] * (N + 1)
for a, b in zip(*[iter(AB)] * 2):
memo[a] = max(memo[a], H[b])
memo[b] = max(memo[b], H[a])
print((sum(h > ma for h, ma in zip(H[1:], memo[1:]))))
| N, M, *I = list(map(int, open(0).read().split()))
H, AB = [0] + I[:N], I[N:]
memo = [False] + [True] * N
for a, b in zip(*[iter(AB)] * 2):
if H[a] < H[b]:
memo[a] = False
elif H[b] < H[a]:
memo[b] = False
else:
memo[a] = memo[b] = False
print((sum(memo)))
| false | 30.769231 | [
"-memo = [0] * (N + 1)",
"+memo = [False] + [True] * N",
"- memo[a] = max(memo[a], H[b])",
"- memo[b] = max(memo[b], H[a])",
"-print((sum(h > ma for h, ma in zip(H[1:], memo[1:]))))",
"+ if H[a] < H[b]:",
"+ memo[a] = False",
"+ elif H[b] < H[a]:",
"+ memo[b] = False",
"+... | false | 0.108949 | 0.035685 | 3.053077 | [
"s648328109",
"s615711319"
] |
u952708174 | p03044 | python | s202779213 | s216556236 | 795 | 698 | 104,920 | 69,364 | Accepted | Accepted | 12.2 | def d_even_relation(N, Nodes):
from collections import deque
graph = [{} for _ in range(N)]
for u, v, w in Nodes:
graph[u - 1][v - 1] = w
graph[v - 1][u - 1] = w
ans = [0] * N
queue = deque([(-1, -1, 0)])
while queue:
previous, parent, child = queue.pop()
... | def d_even_relation(N, Nodes):
from collections import deque
graph = [{} for _ in range(N)]
for u, v, w in Nodes:
graph[u - 1][v - 1] = w
graph[v - 1][u - 1] = w
distance_from_root = [0] * N # 頂点1を根としたときの、各頂点への距離
queue = deque([(-1, 0, 0)]) # 親の頂点番号、子の頂点番号、根から親までの距離
w... | 27 | 23 | 877 | 904 | def d_even_relation(N, Nodes):
from collections import deque
graph = [{} for _ in range(N)]
for u, v, w in Nodes:
graph[u - 1][v - 1] = w
graph[v - 1][u - 1] = w
ans = [0] * N
queue = deque([(-1, -1, 0)])
while queue:
previous, parent, child = queue.pop()
if pare... | def d_even_relation(N, Nodes):
from collections import deque
graph = [{} for _ in range(N)]
for u, v, w in Nodes:
graph[u - 1][v - 1] = w
graph[v - 1][u - 1] = w
distance_from_root = [0] * N # 頂点1を根としたときの、各頂点への距離
queue = deque([(-1, 0, 0)]) # 親の頂点番号、子の頂点番号、根から親までの距離
while queu... | false | 14.814815 | [
"- ans = [0] * N",
"- queue = deque([(-1, -1, 0)])",
"+ distance_from_root = [0] * N # 頂点1を根としたときの、各頂点への距離",
"+ queue = deque([(-1, 0, 0)]) # 親の頂点番号、子の頂点番号、根から親までの距離",
"- previous, parent, child = queue.pop()",
"- if parent == -1:",
"- ans[child] = 0",
"- ... | false | 0.045352 | 0.065622 | 0.691118 | [
"s202779213",
"s216556236"
] |
u445624660 | p02959 | python | s099382669 | s186063050 | 194 | 148 | 18,624 | 24,080 | Accepted | Accepted | 23.71 | # 頭から倒せるだけ倒していく
n = int(eval(input()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
count = 0
for i in range(n):
if a[i] <= b[i]:
count += a[i]
b[i] -= a[i]
count += min(a[i+1], b[i])
a[i+1] = max(0, a[i+1] - b[i])
else:
count += b[i]
print(count) | n = int(eval(input()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
ans = 0
for i in range(n):
if a[i] <= b[i]:
ans += a[i]
b[i] -= a[i]
a[i] = 0
else:
ans += b[i]
a[i] -= b[i]
b[i] = 0
if b[i] > 0:
tmp = max(0,... | 17 | 21 | 311 | 458 | # 頭から倒せるだけ倒していく
n = int(eval(input()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
count = 0
for i in range(n):
if a[i] <= b[i]:
count += a[i]
b[i] -= a[i]
count += min(a[i + 1], b[i])
a[i + 1] = max(0, a[i + 1] - b[i])
else:
count += b[i]
prin... | n = int(eval(input()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
ans = 0
for i in range(n):
if a[i] <= b[i]:
ans += a[i]
b[i] -= a[i]
a[i] = 0
else:
ans += b[i]
a[i] -= b[i]
b[i] = 0
if b[i] > 0:
tmp = max(0, a[i + 1] - b[... | false | 19.047619 | [
"-# 頭から倒せるだけ倒していく",
"-count = 0",
"+ans = 0",
"- count += a[i]",
"+ ans += a[i]",
"- count += min(a[i + 1], b[i])",
"- a[i + 1] = max(0, a[i + 1] - b[i])",
"+ a[i] = 0",
"- count += b[i]",
"-print(count)",
"+ ans += b[i]",
"+ a[i] -= b[i]... | false | 0.036613 | 0.03889 | 0.941463 | [
"s099382669",
"s186063050"
] |
u100927237 | p02642 | python | s190962120 | s283665517 | 729 | 309 | 32,232 | 32,176 | Accepted | Accepted | 57.61 | N = int(eval(input()))
A = sorted((list(map(int,input().split()))))
a_Max = A[-1]
B = [0]*a_Max
for a in A:
if B[a-1] == 0:
B[a-1] = 1
for j in range(2,a_Max+1):
if a*j > a_Max:
break
B[a*j-1] = 2
elif B[a-1] == 1:
B[a-1] = 2
... | N = int(eval(input()))
A = sorted((list(map(int,input().split()))))
a_Max = A[-1]
B = [0]*a_Max
ans =0
for a in A:
if B[a-1] == 0:
B[a-1] = 1
ans += 1
for j in range(a*2-1,a_Max,a):
B[j] = 2
elif B[a-1] == 1:
B[a-1] = 2
ans -= 1
print(ans)
| 22 | 15 | 386 | 302 | N = int(eval(input()))
A = sorted((list(map(int, input().split()))))
a_Max = A[-1]
B = [0] * a_Max
for a in A:
if B[a - 1] == 0:
B[a - 1] = 1
for j in range(2, a_Max + 1):
if a * j > a_Max:
break
B[a * j - 1] = 2
elif B[a - 1] == 1:
B[a - 1] = 2
an... | N = int(eval(input()))
A = sorted((list(map(int, input().split()))))
a_Max = A[-1]
B = [0] * a_Max
ans = 0
for a in A:
if B[a - 1] == 0:
B[a - 1] = 1
ans += 1
for j in range(a * 2 - 1, a_Max, a):
B[j] = 2
elif B[a - 1] == 1:
B[a - 1] = 2
ans -= 1
print(ans)
| false | 31.818182 | [
"+ans = 0",
"- for j in range(2, a_Max + 1):",
"- if a * j > a_Max:",
"- break",
"- B[a * j - 1] = 2",
"+ ans += 1",
"+ for j in range(a * 2 - 1, a_Max, a):",
"+ B[j] = 2",
"-ans = 0",
"-for b in B:",
"- if b == 1:",
"- ... | false | 0.035575 | 0.053736 | 0.662037 | [
"s190962120",
"s283665517"
] |
u025501820 | p03078 | python | s047037184 | s166297673 | 807 | 690 | 291,820 | 148,736 | Accepted | Accepted | 14.5 | X, Y, Z, K = list(map(int, input().split()))
A = sorted(list(map(int, input().split())))
B = sorted(list(map(int, input().split())))
C = sorted(list(map(int, input().split())))[::-1]
A_B = []
for a in A:
for b in B:
A_B.append(a + b)
A_B = sorted(A_B)
def bin_search(mid):
res = 0
... | X, Y, Z, K = list(map(int, input().split()))
A = sorted(list(map(int, input().split())))
B = sorted(list(map(int, input().split())))
C = sorted(list(map(int, input().split())))[::-1]
A_B = []
for a in A:
for b in B:
A_B.append(a + b)
A_B = sorted(A_B)[::-1][:K]
ans = []
for a_b in A_B:
... | 47 | 20 | 962 | 405 | X, Y, Z, K = list(map(int, input().split()))
A = sorted(list(map(int, input().split())))
B = sorted(list(map(int, input().split())))
C = sorted(list(map(int, input().split())))[::-1]
A_B = []
for a in A:
for b in B:
A_B.append(a + b)
A_B = sorted(A_B)
def bin_search(mid):
res = 0
idx = 0
ans =... | X, Y, Z, K = list(map(int, input().split()))
A = sorted(list(map(int, input().split())))
B = sorted(list(map(int, input().split())))
C = sorted(list(map(int, input().split())))[::-1]
A_B = []
for a in A:
for b in B:
A_B.append(a + b)
A_B = sorted(A_B)[::-1][:K]
ans = []
for a_b in A_B:
for c in C:
... | false | 57.446809 | [
"-A_B = sorted(A_B)",
"-",
"-",
"-def bin_search(mid):",
"- res = 0",
"- idx = 0",
"- ans = []",
"+A_B = sorted(A_B)[::-1][:K]",
"+ans = []",
"+for a_b in A_B:",
"- while idx < len(A_B):",
"- if c + A_B[idx] >= mid:",
"- res += len(A_B) - idx",
"- ... | false | 0.05062 | 0.045938 | 1.101921 | [
"s047037184",
"s166297673"
] |
u200785298 | p03660 | python | s076986169 | s056626579 | 1,058 | 703 | 224,860 | 144,064 | Accepted | Accepted | 33.55 | #!/usr/bin/env python3
import sys
sys.setrecursionlimit(300000)
def solve(N: int, a: "List[int]", b: "List[int]"):
conn = [[] for _ in range(N)]
for i in range(N - 1):
conn[a[i] - 1].append(b[i] - 1)
conn[b[i] - 1].append(a[i] - 1)
def dfs(idx, cur, conn, dis):
dis[idx... | #!/usr/bin/env python3
import sys
sys.setrecursionlimit(300000)
def solve(N: int, a: "List[int]", b: "List[int]"):
conn = [[] for _ in range(N)]
for i in range(N - 1):
conn[a[i] - 1].append(b[i] - 1)
conn[b[i] - 1].append(a[i] - 1)
def dfs(idx, cur, conn, dis):
dis[idx... | 55 | 107 | 1,284 | 2,687 | #!/usr/bin/env python3
import sys
sys.setrecursionlimit(300000)
def solve(N: int, a: "List[int]", b: "List[int]"):
conn = [[] for _ in range(N)]
for i in range(N - 1):
conn[a[i] - 1].append(b[i] - 1)
conn[b[i] - 1].append(a[i] - 1)
def dfs(idx, cur, conn, dis):
dis[idx] = cur
... | #!/usr/bin/env python3
import sys
sys.setrecursionlimit(300000)
def solve(N: int, a: "List[int]", b: "List[int]"):
conn = [[] for _ in range(N)]
for i in range(N - 1):
conn[a[i] - 1].append(b[i] - 1)
conn[b[i] - 1].append(a[i] - 1)
def dfs(idx, cur, conn, dis):
dis[idx] = cur
... | false | 48.598131 | [
"+def _solve(N: int, a: \"List[int]\", b: \"List[int]\"):",
"+ conn = [[] for _ in range(N)]",
"+ for i in range(N - 1):",
"+ conn[a[i] - 1].append(b[i] - 1)",
"+ conn[b[i] - 1].append(a[i] - 1)",
"+",
"+ def find_path(idx, target, conn, visited):",
"+ visited[idx] = True... | false | 0.038735 | 0.122766 | 0.315518 | [
"s076986169",
"s056626579"
] |
u534223360 | p03160 | python | s486417112 | s965298058 | 230 | 143 | 13,908 | 13,928 | Accepted | Accepted | 37.83 | # 入力
# 足場の高さ
eval(input())
h = list(map(int, input().split()))
# 方針
# i番目の足場にいるという状態に対して
# その足場に最も少ないコストを記録する．
# 初期化は大きは数で
dp = [1e20 for i in range(len(h))]
# スタートはコスト0
dp[0] = 0
# i番目の足場でのコストを利用して
# i+1, i+2番目のコストを計算する
for i in range(len(h) - 1):
dp[i + 1] = (
dp[i + 1]
... | # 入力
# 足場の高さ
eval(input())
h = list(map(int, input().split()))
# 方針
# i番目の足場にいるという状態に対して
# その足場に最も少ないコストを記録する．
# スタートはコスト0
dp = [0]
# i番目の足場でのコストを
# i-1, i-2番目のコストを利用して計算する
# 1番目は手動で更新した方がコードが簡単になる．
dp.append(dp[0] + abs(h[1] - h[0]))
for i in range(2, len(h)):
dp.append(min(dp[i - ... | 31 | 22 | 624 | 401 | # 入力
# 足場の高さ
eval(input())
h = list(map(int, input().split()))
# 方針
# i番目の足場にいるという状態に対して
# その足場に最も少ないコストを記録する．
# 初期化は大きは数で
dp = [1e20 for i in range(len(h))]
# スタートはコスト0
dp[0] = 0
# i番目の足場でのコストを利用して
# i+1, i+2番目のコストを計算する
for i in range(len(h) - 1):
dp[i + 1] = (
dp[i + 1]
if dp[i + 1] < dp[... | # 入力
# 足場の高さ
eval(input())
h = list(map(int, input().split()))
# 方針
# i番目の足場にいるという状態に対して
# その足場に最も少ないコストを記録する．
# スタートはコスト0
dp = [0]
# i番目の足場でのコストを
# i-1, i-2番目のコストを利用して計算する
# 1番目は手動で更新した方がコードが簡単になる．
dp.append(dp[0] + abs(h[1] - h[0]))
for i in range(2, len(h)):
dp.append(min(dp[i - 1] + abs(h[i] - h[i - 1]... | false | 29.032258 | [
"-# 初期化は大きは数で",
"-dp = [1e20 for i in range(len(h))]",
"-dp[0] = 0",
"-# i番目の足場でのコストを利用して",
"-# i+1, i+2番目のコストを計算する",
"-for i in range(len(h) - 1):",
"- dp[i + 1] = (",
"- dp[i + 1]",
"- if dp[i + 1] < dp[i] + abs(h[i + 1] - h[i])",
"- else dp[i] + abs(h[i + 1] - h[i])",... | false | 0.0371 | 0.033509 | 1.107174 | [
"s486417112",
"s965298058"
] |
u189487046 | p02947 | python | s300856738 | s177929942 | 262 | 232 | 17,928 | 22,012 | Accepted | Accepted | 11.45 | import sys
def input():
return sys.stdin.readline()[:-1]
N = int(eval(input()))
s_dic = {}
for _ in range(N):
s_list = list(eval(input()))
s_list.sort()
s = ''.join(s_list)
if s in s_dic:
s_dic[s] += 1
else:
s_dic[s] = 1
ans = 0
for v in list(s_dic.value... | N = int(eval(input()))
dic = {}
for _ in range(N):
s = ''.join(sorted(eval(input())))
if s in dic:
dic[s] += 1
else:
dic[s] = 1
ans = 0
for v in list(dic.values()):
if v >= 2:
ans += (v*(v-1))//2
print(ans)
| 24 | 16 | 363 | 247 | import sys
def input():
return sys.stdin.readline()[:-1]
N = int(eval(input()))
s_dic = {}
for _ in range(N):
s_list = list(eval(input()))
s_list.sort()
s = "".join(s_list)
if s in s_dic:
s_dic[s] += 1
else:
s_dic[s] = 1
ans = 0
for v in list(s_dic.values()):
if v >= 2:
... | N = int(eval(input()))
dic = {}
for _ in range(N):
s = "".join(sorted(eval(input())))
if s in dic:
dic[s] += 1
else:
dic[s] = 1
ans = 0
for v in list(dic.values()):
if v >= 2:
ans += (v * (v - 1)) // 2
print(ans)
| false | 33.333333 | [
"-import sys",
"-",
"-",
"-def input():",
"- return sys.stdin.readline()[:-1]",
"-",
"-",
"-s_dic = {}",
"+dic = {}",
"- s_list = list(eval(input()))",
"- s_list.sort()",
"- s = \"\".join(s_list)",
"- if s in s_dic:",
"- s_dic[s] += 1",
"+ s = \"\".join(sorted(ev... | false | 0.038976 | 0.037645 | 1.035352 | [
"s300856738",
"s177929942"
] |
u970899068 | p03682 | python | s932205532 | s629313103 | 1,946 | 1,485 | 131,364 | 126,888 | Accepted | Accepted | 23.69 | # ユニオンファインド
class UnionFind():
def __init__(self, n):
self.n = n
self.parents = [-1] * n
def find(self, x):
if self.parents[x] < 0:
return x
else:
self.parents[x] = self.find(self.parents[x])
return self.parents[x]
def union(... | import sys
input = sys.stdin.readline
# ユニオンファインド
class UnionFind():
def __init__(self, n):
self.n = n
self.parents = [-1] * n
def find(self, x):
if self.parents[x] < 0:
return x
else:
self.parents[x] = self.find(self.parents[x])
... | 80 | 67 | 1,814 | 1,308 | # ユニオンファインド
class UnionFind:
def __init__(self, n):
self.n = n
self.parents = [-1] * n
def find(self, x):
if self.parents[x] < 0:
return x
else:
self.parents[x] = self.find(self.parents[x])
return self.parents[x]
def union(self, x, y):
... | import sys
input = sys.stdin.readline
# ユニオンファインド
class UnionFind:
def __init__(self, n):
self.n = n
self.parents = [-1] * n
def find(self, x):
if self.parents[x] < 0:
return x
else:
self.parents[x] = self.find(self.parents[x])
return self.pa... | false | 16.25 | [
"+import sys",
"+",
"+input = sys.stdin.readline",
"- def size(self, x):",
"- return -self.parents[self.find(x)]",
"-",
"-",
"- def members(self, x):",
"- root = self.find(x)",
"- return [i for i in range(self.n) if self.find(i) == root]",
"-",
"- def roots(self):... | false | 0.040883 | 0.045584 | 0.896879 | [
"s932205532",
"s629313103"
] |
u645250356 | p02862 | python | s997497691 | s126406434 | 897 | 469 | 102,028 | 138,388 | Accepted | Accepted | 47.71 | from collections import Counter,defaultdict,deque
from heapq import heappop,heappush,heapify
import sys,bisect,math,itertools
sys.setrecursionlimit(10**8)
mod = 10**9+7
mod2 = 998244353
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))... | from collections import Counter,defaultdict,deque
from heapq import heappop,heappush,heapify
import sys,bisect,math,itertools,fractions,pprint
sys.setrecursionlimit(10**8)
mod = 10**9+7
mod2 = 998244353
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.rea... | 48 | 52 | 1,227 | 1,689 | from collections import Counter, defaultdict, deque
from heapq import heappop, heappush, heapify
import sys, bisect, math, itertools
sys.setrecursionlimit(10**8)
mod = 10**9 + 7
mod2 = 998244353
INF = float("inf")
def inp():
return int(sys.stdin.readline())
def inpl():
return list(map(int, sys.stdin.readli... | from collections import Counter, defaultdict, deque
from heapq import heappop, heappush, heapify
import sys, bisect, math, itertools, fractions, pprint
sys.setrecursionlimit(10**8)
mod = 10**9 + 7
mod2 = 998244353
INF = float("inf")
def inp():
return int(sys.stdin.readline())
def inpl():
return list(map(in... | false | 7.692308 | [
"-import sys, bisect, math, itertools",
"+import sys, bisect, math, itertools, fractions, pprint",
"-# def conb(n,r):",
"-# return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))",
"+class Combination:",
"+ \"\"\"",
"+ O(n)の前計算を1回行うことで，O(1)でnCr mod mを求められる",
"+ n_max = 10... | false | 0.313749 | 1.841409 | 0.170385 | [
"s997497691",
"s126406434"
] |
u518085378 | p02642 | python | s350415171 | s270012296 | 693 | 622 | 35,192 | 32,212 | Accepted | Accepted | 10.25 | n = int(eval(input()))
A = list(map(int, input().split()))
nux = max(A)
B = set(A)
A.sort()
ans = 0
table = [True]*(nux+1)
for ii, s in enumerate(A):
if table[s] == False:
continue
if ii == n-1:
ans += 1
elif A[ii+1] != s:
ans += 1
i = 1
while i*s <= nux:
... | n = int(eval(input()))
A = sorted(map(int, input().split()))
nux = A[-1]+1
ans = 0
table = [True]*nux
for i, s in enumerate(A):
if table[s] == False:
continue
if i == n-1:
ans += 1
elif A[i+1] != s:
ans += 1
b = 1
while b*s < nux:
table[b*s] = False
... | 20 | 17 | 367 | 338 | n = int(eval(input()))
A = list(map(int, input().split()))
nux = max(A)
B = set(A)
A.sort()
ans = 0
table = [True] * (nux + 1)
for ii, s in enumerate(A):
if table[s] == False:
continue
if ii == n - 1:
ans += 1
elif A[ii + 1] != s:
ans += 1
i = 1
while i * s <= nux:
ta... | n = int(eval(input()))
A = sorted(map(int, input().split()))
nux = A[-1] + 1
ans = 0
table = [True] * nux
for i, s in enumerate(A):
if table[s] == False:
continue
if i == n - 1:
ans += 1
elif A[i + 1] != s:
ans += 1
b = 1
while b * s < nux:
table[b * s] = False
... | false | 15 | [
"-A = list(map(int, input().split()))",
"-nux = max(A)",
"-B = set(A)",
"-A.sort()",
"+A = sorted(map(int, input().split()))",
"+nux = A[-1] + 1",
"-table = [True] * (nux + 1)",
"-for ii, s in enumerate(A):",
"+table = [True] * nux",
"+for i, s in enumerate(A):",
"- if ii == n - 1:",
"+ ... | false | 0.045267 | 0.046064 | 0.9827 | [
"s350415171",
"s270012296"
] |
u994988729 | p03215 | python | s957912496 | s219111627 | 323 | 211 | 36,168 | 36,876 | Accepted | Accepted | 34.67 | import numpy as np
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
Acum = [0]
for a in A:
Acum.append(Acum[-1] + a)
Apair = []
for i, al in enumerate(Acum):
for ar in Acum[i + 1:]:
Apair.append(ar - al)
Apair = np.asarray(Apair, dtype=np.int64)
d = 45 # 10*9*10... | import numpy as np
N, K = list(map(int, input().split()))
A = np.array(input().split(), dtype=np.int64)
Acum = A.cumsum()
Apair = np.subtract.outer(Acum, Acum) + A
Apair = np.tril(Apair).ravel()
Apair = Apair[Apair > 0]
d = 45 # 10*9*1000 = 1<<40ぐらい
ans = 0
while d >= 0:
Atmp = np.bitwise_and(np.ri... | 23 | 20 | 535 | 465 | import numpy as np
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
Acum = [0]
for a in A:
Acum.append(Acum[-1] + a)
Apair = []
for i, al in enumerate(Acum):
for ar in Acum[i + 1 :]:
Apair.append(ar - al)
Apair = np.asarray(Apair, dtype=np.int64)
d = 45 # 10*9*1000 = 1<<40ぐらい... | import numpy as np
N, K = list(map(int, input().split()))
A = np.array(input().split(), dtype=np.int64)
Acum = A.cumsum()
Apair = np.subtract.outer(Acum, Acum) + A
Apair = np.tril(Apair).ravel()
Apair = Apair[Apair > 0]
d = 45 # 10*9*1000 = 1<<40ぐらい
ans = 0
while d >= 0:
Atmp = np.bitwise_and(np.right_shift(Apair... | false | 13.043478 | [
"-A = list(map(int, input().split()))",
"-Acum = [0]",
"-for a in A:",
"- Acum.append(Acum[-1] + a)",
"-Apair = []",
"-for i, al in enumerate(Acum):",
"- for ar in Acum[i + 1 :]:",
"- Apair.append(ar - al)",
"-Apair = np.asarray(Apair, dtype=np.int64)",
"+A = np.array(input().split(),... | false | 0.238919 | 0.204978 | 1.165582 | [
"s957912496",
"s219111627"
] |
u600402037 | p03525 | python | s900660164 | s681025345 | 275 | 18 | 13,516 | 3,060 | Accepted | Accepted | 93.45 | import numpy as np
N = int(eval(input()))
D = list(map(int, input().split()))
if N > 23:
print((0))
exit()
if D.count(0) >= 2:
print((0))
exit()
for i in range(1, 13):
if D.count(i) >= 3:
print((0))
exit()
for i in range(13):
if (D.count(i) + D.count(i+1)) == 4:
... | N = int(eval(input())) + 1
D = list(map(int, input().split())) + [0] + [24]
D.sort()
for i in range(1, N, 2):
D[i] = 24 - D[i]
D.sort()
ans = 24
for i in range(N):
ans = min(ans, abs(D[i+1]-D[i]))
print(ans)
| 36 | 10 | 739 | 219 | import numpy as np
N = int(eval(input()))
D = list(map(int, input().split()))
if N > 23:
print((0))
exit()
if D.count(0) >= 2:
print((0))
exit()
for i in range(1, 13):
if D.count(i) >= 3:
print((0))
exit()
for i in range(13):
if (D.count(i) + D.count(i + 1)) == 4:
print(... | N = int(eval(input())) + 1
D = list(map(int, input().split())) + [0] + [24]
D.sort()
for i in range(1, N, 2):
D[i] = 24 - D[i]
D.sort()
ans = 24
for i in range(N):
ans = min(ans, abs(D[i + 1] - D[i]))
print(ans)
| false | 72.222222 | [
"-import numpy as np",
"-",
"-N = int(eval(input()))",
"-D = list(map(int, input().split()))",
"-if N > 23:",
"- print((0))",
"- exit()",
"-if D.count(0) >= 2:",
"- print((0))",
"- exit()",
"-for i in range(1, 13):",
"- if D.count(i) >= 3:",
"- print((0))",
"- ... | false | 0.284456 | 0.039057 | 7.283173 | [
"s900660164",
"s681025345"
] |
u325282913 | p03107 | python | s848746641 | s843016804 | 36 | 18 | 3,964 | 3,188 | Accepted | Accepted | 50 | S = eval(input())
array = []
for i in range(len(S)):
array.append(S[i])
print((len(S)-abs(array.count('0')-array.count('1')))) | S = eval(input())
print((len(S)-abs(S.count('0')-S.count('1')))) | 5 | 2 | 126 | 57 | S = eval(input())
array = []
for i in range(len(S)):
array.append(S[i])
print((len(S) - abs(array.count("0") - array.count("1"))))
| S = eval(input())
print((len(S) - abs(S.count("0") - S.count("1"))))
| false | 60 | [
"-array = []",
"-for i in range(len(S)):",
"- array.append(S[i])",
"-print((len(S) - abs(array.count(\"0\") - array.count(\"1\"))))",
"+print((len(S) - abs(S.count(\"0\") - S.count(\"1\"))))"
] | false | 0.034074 | 0.039481 | 0.863041 | [
"s848746641",
"s843016804"
] |
u667949809 | p02684 | python | s819760522 | s568543953 | 211 | 141 | 40,404 | 32,348 | Accepted | Accepted | 33.18 | n,k = list(map(int,input().split()))
a = list(map(int,input().split()))
dic = {}
for key, a in zip(list(range(1, n+1)), a):
dic[key] = a
log = [-1]*(n+1)
next = dic[1]
step = 1
log[next] = step
k -= 1
while k:
next = dic[next]
step += 1
k -= 1
if log[next] != -1:
k %= log[n... | n,k = list(map(int,input().split()))
a = [0]
a.extend(list(map(int,input().split())))
l = [None]*(n+1)
now = 1
step = 0
l[now] = 0
while k:
now = a[now]
step += 1
k -= 1
if l[now] is not None:
looplen = (step - l[now])
k = k%looplen
else:
l[now] = step
pri... | 20 | 19 | 369 | 321 | n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
dic = {}
for key, a in zip(list(range(1, n + 1)), a):
dic[key] = a
log = [-1] * (n + 1)
next = dic[1]
step = 1
log[next] = step
k -= 1
while k:
next = dic[next]
step += 1
k -= 1
if log[next] != -1:
k %= log[next] - st... | n, k = list(map(int, input().split()))
a = [0]
a.extend(list(map(int, input().split())))
l = [None] * (n + 1)
now = 1
step = 0
l[now] = 0
while k:
now = a[now]
step += 1
k -= 1
if l[now] is not None:
looplen = step - l[now]
k = k % looplen
else:
l[now] = step
print(now)
| false | 5 | [
"-a = list(map(int, input().split()))",
"-dic = {}",
"-for key, a in zip(list(range(1, n + 1)), a):",
"- dic[key] = a",
"-log = [-1] * (n + 1)",
"-next = dic[1]",
"-step = 1",
"-log[next] = step",
"-k -= 1",
"+a = [0]",
"+a.extend(list(map(int, input().split())))",
"+l = [None] * (n + 1)",
... | false | 0.047166 | 0.047638 | 0.990102 | [
"s819760522",
"s568543953"
] |
u928254435 | p02689 | python | s931588618 | s714009264 | 358 | 304 | 39,948 | 40,140 | Accepted | Accepted | 15.08 | #!/usr/bin/env python3
import sys
def solve(N: int, M: int, H: "List[int]", A: "List[int]", B: "List[int]"):
l = [[] for i in range(N)]
for i in range(M):
l[A[i] - 1].append(B[i])
l[B[i] - 1].append(A[i])
nl = [list(set(x)) for x in l]
cnt = 0
for i, v in enumerate(nl):
... | #!/usr/bin/env python3
import sys
def solve(N: int, M: int, H: "List[int]", A: "List[int]", B: "List[int]"):
l = [[] for i in range(N)]
for i in range(M):
l[A[i] - 1].append(B[i])
l[B[i] - 1].append(A[i])
nl = [list(set(x)) for x in l]
cnt = 0
for i, v in enumerate(nl):
... | 42 | 38 | 1,251 | 1,178 | #!/usr/bin/env python3
import sys
def solve(N: int, M: int, H: "List[int]", A: "List[int]", B: "List[int]"):
l = [[] for i in range(N)]
for i in range(M):
l[A[i] - 1].append(B[i])
l[B[i] - 1].append(A[i])
nl = [list(set(x)) for x in l]
cnt = 0
for i, v in enumerate(nl):
flg... | #!/usr/bin/env python3
import sys
def solve(N: int, M: int, H: "List[int]", A: "List[int]", B: "List[int]"):
l = [[] for i in range(N)]
for i in range(M):
l[A[i] - 1].append(B[i])
l[B[i] - 1].append(A[i])
nl = [list(set(x)) for x in l]
cnt = 0
for i, v in enumerate(nl):
h =... | false | 9.52381 | [
"- flg = True",
"- for j in v:",
"- if H[i] <= H[j - 1]:",
"- flg = False",
"- break",
"- if flg:",
"+ h = [H[j - 1] for j in v]",
"+ if not h or H[i] > max(h):"
] | false | 0.041482 | 0.036188 | 1.1463 | [
"s931588618",
"s714009264"
] |
u867069435 | p03495 | python | s089660768 | s562149034 | 142 | 100 | 26,812 | 32,540 | Accepted | Accepted | 29.58 | n, k = list(map(int, input().split()))
b = list(map(int, input().split()))
a = [0 for i in range(n)]
m = set(b)
ans = 0
for l in range(n):
a[b[l]-1] += 1
c = [item for item in a if item != 0]
c.sort(reverse=True)
balls = sum(c[0:k])
print((n-balls)) | from collections import Counter
n, k = list(map(int, input().split()))
a = Counter(list(map(int, input().split())))
b = sum(sorted(list(a.values()), reverse=True)[:k])
print((n-b)) | 11 | 5 | 261 | 176 | n, k = list(map(int, input().split()))
b = list(map(int, input().split()))
a = [0 for i in range(n)]
m = set(b)
ans = 0
for l in range(n):
a[b[l] - 1] += 1
c = [item for item in a if item != 0]
c.sort(reverse=True)
balls = sum(c[0:k])
print((n - balls))
| from collections import Counter
n, k = list(map(int, input().split()))
a = Counter(list(map(int, input().split())))
b = sum(sorted(list(a.values()), reverse=True)[:k])
print((n - b))
| false | 54.545455 | [
"+from collections import Counter",
"+",
"-b = list(map(int, input().split()))",
"-a = [0 for i in range(n)]",
"-m = set(b)",
"-ans = 0",
"-for l in range(n):",
"- a[b[l] - 1] += 1",
"-c = [item for item in a if item != 0]",
"-c.sort(reverse=True)",
"-balls = sum(c[0:k])",
"-print((n - ball... | false | 0.03884 | 0.039493 | 0.983469 | [
"s089660768",
"s562149034"
] |
u261103969 | p02577 | python | s946240033 | s323540292 | 96 | 72 | 68,124 | 9,212 | Accepted | Accepted | 25 | import sys
readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)
def main():
n = eval(input())
cur = 0
for x in n:
cur += int(x)
if cur % 9 == 0:
print("Yes")
else:
print("No")
if __name__ == '__main__':
... | n = eval(input())
cur = 0
for x in n:
cur += int(x)
if cur % 9 == 0:
print("Yes")
else:
print("No")
| 23 | 10 | 326 | 117 | import sys
readline = sys.stdin.readline
MOD = 10**9 + 7
INF = float("INF")
sys.setrecursionlimit(10**5)
def main():
n = eval(input())
cur = 0
for x in n:
cur += int(x)
if cur % 9 == 0:
print("Yes")
else:
print("No")
if __name__ == "__main__":
main()
| n = eval(input())
cur = 0
for x in n:
cur += int(x)
if cur % 9 == 0:
print("Yes")
else:
print("No")
| false | 56.521739 | [
"-import sys",
"-",
"-readline = sys.stdin.readline",
"-MOD = 10**9 + 7",
"-INF = float(\"INF\")",
"-sys.setrecursionlimit(10**5)",
"-",
"-",
"-def main():",
"- n = eval(input())",
"- cur = 0",
"- for x in n:",
"- cur += int(x)",
"- if cur % 9 == 0:",
"- print(\... | false | 0.045835 | 0.046325 | 0.989422 | [
"s946240033",
"s323540292"
] |
u280258474 | p02615 | python | s388412136 | s751545290 | 270 | 214 | 52,612 | 52,584 | Accepted | Accepted | 20.74 | #!/usr/bin/env python3
import sys
from collections import deque
class MM:
def __init__(self, c_max, c_cnt):
self.c_max = c_max
self.c_cnt = c_cnt
def solve(N: int, A: "List[int]"):
sl = list(reversed(sorted(A)))
score = 0
c_max = sl[0]
h = {sl[0]: 1}
queue = deque... | #!/usr/bin/env python3
import sys
from collections import deque
def solve(N: int, A: "List[int]"):
sorted_list = list(reversed(sorted(A)))
score = 0
queue = deque()
queue.append(sorted_list[0])
cnt_map = {sorted_list[0]: 1}
for i in range(1, len(sorted_list)):
current_max = q... | 46 | 39 | 1,059 | 999 | #!/usr/bin/env python3
import sys
from collections import deque
class MM:
def __init__(self, c_max, c_cnt):
self.c_max = c_max
self.c_cnt = c_cnt
def solve(N: int, A: "List[int]"):
sl = list(reversed(sorted(A)))
score = 0
c_max = sl[0]
h = {sl[0]: 1}
queue = deque()
queue... | #!/usr/bin/env python3
import sys
from collections import deque
def solve(N: int, A: "List[int]"):
sorted_list = list(reversed(sorted(A)))
score = 0
queue = deque()
queue.append(sorted_list[0])
cnt_map = {sorted_list[0]: 1}
for i in range(1, len(sorted_list)):
current_max = queue[0]
... | false | 15.217391 | [
"-class MM:",
"- def __init__(self, c_max, c_cnt):",
"- self.c_max = c_max",
"- self.c_cnt = c_cnt",
"-",
"-",
"- sl = list(reversed(sorted(A)))",
"+ sorted_list = list(reversed(sorted(A)))",
"- c_max = sl[0]",
"- h = {sl[0]: 1}",
"- queue.append(c_max)",
"- ... | false | 0.07089 | 0.035496 | 1.997114 | [
"s388412136",
"s751545290"
] |
u933722792 | p03013 | python | s460053354 | s037599361 | 175 | 149 | 13,544 | 13,536 | Accepted | Accepted | 14.86 | n, m = list(map(int, input().split()))
broken = [False] * (n + 1)
for _ in range(m):
broken[int(eval(input()))] = True
dp = [0] * (n + 1)
dp[0] = 1
dp[1] = 1 if not broken[1] else 0
MOD = 10 ** 9 + 7
for i in range(2, n + 1):
if not broken[i - 1]:
dp[i] += (dp[i - 1])
if not broken[i ... | n, m = list(map(int, input().split()))
broken = [False] * (n + 1)
for _ in range(m):
broken[int(eval(input()))] = True
dp = [0] * (n + 1)
dp[0] = 1
dp[1] = 1 if not broken[1] else 0
MOD = 10 ** 9 + 7
for i in range(2, n + 1):
if broken[i]:
continue
dp[i] = (dp[i - 1] + dp[i - 2]) % MO... | 18 | 16 | 384 | 332 | n, m = list(map(int, input().split()))
broken = [False] * (n + 1)
for _ in range(m):
broken[int(eval(input()))] = True
dp = [0] * (n + 1)
dp[0] = 1
dp[1] = 1 if not broken[1] else 0
MOD = 10**9 + 7
for i in range(2, n + 1):
if not broken[i - 1]:
dp[i] += dp[i - 1]
if not broken[i - 2]:
dp[i]... | n, m = list(map(int, input().split()))
broken = [False] * (n + 1)
for _ in range(m):
broken[int(eval(input()))] = True
dp = [0] * (n + 1)
dp[0] = 1
dp[1] = 1 if not broken[1] else 0
MOD = 10**9 + 7
for i in range(2, n + 1):
if broken[i]:
continue
dp[i] = (dp[i - 1] + dp[i - 2]) % MOD
print((dp[n]))
| false | 11.111111 | [
"- if not broken[i - 1]:",
"- dp[i] += dp[i - 1]",
"- if not broken[i - 2]:",
"- dp[i] += dp[i - 2]",
"- dp[i] %= MOD",
"+ if broken[i]:",
"+ continue",
"+ dp[i] = (dp[i - 1] + dp[i - 2]) % MOD"
] | false | 0.070139 | 0.091214 | 0.768951 | [
"s460053354",
"s037599361"
] |
u954774382 | p03160 | python | s665940651 | s204491642 | 170 | 137 | 15,768 | 22,220 | Accepted | Accepted | 19.41 | import math
import operator as op
from functools import reduce
from fractions import Fraction as frac
def ncr(n, r):
r = min(r, n-r)
numer = reduce(op.mul, list(range(n, n-r, -1)), 1)
denom = reduce(op.mul, list(range(1, r+1)), 1)
return numer / denom
"""
int(input())
map(int,input().split(... | import sys
from functools import lru_cache, cmp_to_key
from heapq import merge, heapify, heappop, heappush
from math import *
from collections import defaultdict as dd, deque, Counter as C
from itertools import combinations as comb, permutations as perm
from bisect import bisect_left as bl, bisect_right as br, bi... | 25 | 45 | 617 | 1,328 | import math
import operator as op
from functools import reduce
from fractions import Fraction as frac
def ncr(n, r):
r = min(r, n - r)
numer = reduce(op.mul, list(range(n, n - r, -1)), 1)
denom = reduce(op.mul, list(range(1, r + 1)), 1)
return numer / denom
"""
int(input())
map(int,input().split())
... | import sys
from functools import lru_cache, cmp_to_key
from heapq import merge, heapify, heappop, heappush
from math import *
from collections import defaultdict as dd, deque, Counter as C
from itertools import combinations as comb, permutations as perm
from bisect import bisect_left as bl, bisect_right as br, bisect
f... | false | 44.444444 | [
"-import math",
"-import operator as op",
"-from functools import reduce",
"-from fractions import Fraction as frac",
"+import sys",
"+from functools import lru_cache, cmp_to_key",
"+from heapq import merge, heapify, heappop, heappush",
"+from math import *",
"+from collections import defaultdict as... | false | 0.037194 | 0.04449 | 0.836017 | [
"s665940651",
"s204491642"
] |
u706330549 | p02888 | python | s706101190 | s230764784 | 1,167 | 816 | 110,348 | 110,492 | Accepted | Accepted | 30.08 | import numpy as np
from numba import njit
@njit
def f(A):
N = len(A)
cnt = 0
for i in range(N):
for j in range(i + 1, N):
for k in range(j + 1, N):
cnt += (A[k] < A[i] + A[j])
return cnt
N = int(eval(input()))
A = np.int32(input().split())
... | import numpy as np
from numba import njit
@njit
def f(A):
n = len(a)
cnt = 0
for i in range(n):
for j in range(i + 1, n):
for k in range(j + 1, n):
cnt += (A[k] < A[i] + A[j])
return cnt
n = int(eval(input()))
a = np.array(input().split(), d... | 20 | 20 | 336 | 352 | import numpy as np
from numba import njit
@njit
def f(A):
N = len(A)
cnt = 0
for i in range(N):
for j in range(i + 1, N):
for k in range(j + 1, N):
cnt += A[k] < A[i] + A[j]
return cnt
N = int(eval(input()))
A = np.int32(input().split())
A.sort()
print((f(A)))
| import numpy as np
from numba import njit
@njit
def f(A):
n = len(a)
cnt = 0
for i in range(n):
for j in range(i + 1, n):
for k in range(j + 1, n):
cnt += A[k] < A[i] + A[j]
return cnt
n = int(eval(input()))
a = np.array(input().split(), dtype=np.int32)
a.sort()
p... | false | 0 | [
"- N = len(A)",
"+ n = len(a)",
"- for i in range(N):",
"- for j in range(i + 1, N):",
"- for k in range(j + 1, N):",
"+ for i in range(n):",
"+ for j in range(i + 1, n):",
"+ for k in range(j + 1, n):",
"-N = int(eval(input()))",
"-A = np.int32(inpu... | false | 0.338707 | 0.43134 | 0.785244 | [
"s706101190",
"s230764784"
] |
u995004106 | p02936 | python | s604075824 | s533680496 | 1,956 | 547 | 123,084 | 133,152 | Accepted | Accepted | 72.03 | from collections import deque
N,Q=map(int,input().split())
nondirtree=[[] for _ in range(N)]
dirtree=[[] for _ in range(N)]
for i in range(N-1):
a,b=map(int,input().split())
nondirtree[a-1].append(b-1)
nondirtree[b - 1].append(a - 1)
#points=[tuple(map(int,input().split())) for _ in range(Q)]
score... | import sys
input=sys.stdin.readline
from collections import deque
N,Q=map(int,input().split())
nondirtree=[[] for _ in range(N)]
dirtree=[[] for _ in range(N)]
for i in range(N-1):
a,b=map(int,input().split())
nondirtree[a-1].append(b-1)
nondirtree[b - 1].append(a - 1)
#points=[tuple(map(int,input... | 42 | 44 | 947 | 985 | from collections import deque
N, Q = map(int, input().split())
nondirtree = [[] for _ in range(N)]
dirtree = [[] for _ in range(N)]
for i in range(N - 1):
a, b = map(int, input().split())
nondirtree[a - 1].append(b - 1)
nondirtree[b - 1].append(a - 1)
# points=[tuple(map(int,input().split())) for _ in rang... | import sys
input = sys.stdin.readline
from collections import deque
N, Q = map(int, input().split())
nondirtree = [[] for _ in range(N)]
dirtree = [[] for _ in range(N)]
for i in range(N - 1):
a, b = map(int, input().split())
nondirtree[a - 1].append(b - 1)
nondirtree[b - 1].append(a - 1)
# points=[tuple(... | false | 4.545455 | [
"+import sys",
"+",
"+input = sys.stdin.readline"
] | false | 0.041027 | 0.037232 | 1.10192 | [
"s604075824",
"s533680496"
] |
u063052907 | p03038 | python | s867375126 | s868924008 | 548 | 503 | 33,732 | 22,756 | Accepted | Accepted | 8.21 | N, M = list(map(int, input().split()))
lst_A = list(map(int, input().split()))
lst_BC = [list(map(int, input().split())) for _ in range(M)]
lst_A.sort()
# lst_BC.sort(key=lambda x:-x[1])
lst_BC.sort(key=lambda x:x[1], reverse=True)
# print(lst_A)
# print(lst_BC)
lst_D = []
for b, c in lst_BC:
lst_... | N, M = list(map(int, input().split()))
lst_A = list(map(int, input().split()))
lst_BC = [tuple(map(int, input().split())) for _ in range(M)]
lst_A.sort()
lst_BC.sort(key=lambda x:x[1], reverse=True)
lst_D = []
for b, c in lst_BC:
lst_D += [c] * min(b, N - len(lst_D))
lst_D = lst_D + [0] * (N - len(l... | 27 | 22 | 536 | 437 | N, M = list(map(int, input().split()))
lst_A = list(map(int, input().split()))
lst_BC = [list(map(int, input().split())) for _ in range(M)]
lst_A.sort()
# lst_BC.sort(key=lambda x:-x[1])
lst_BC.sort(key=lambda x: x[1], reverse=True)
# print(lst_A)
# print(lst_BC)
lst_D = []
for b, c in lst_BC:
lst_D += [c] * min(b,... | N, M = list(map(int, input().split()))
lst_A = list(map(int, input().split()))
lst_BC = [tuple(map(int, input().split())) for _ in range(M)]
lst_A.sort()
lst_BC.sort(key=lambda x: x[1], reverse=True)
lst_D = []
for b, c in lst_BC:
lst_D += [c] * min(b, N - len(lst_D))
lst_D = lst_D + [0] * (N - len(lst_D))
for i in... | false | 18.518519 | [
"-lst_BC = [list(map(int, input().split())) for _ in range(M)]",
"+lst_BC = [tuple(map(int, input().split())) for _ in range(M)]",
"-# lst_BC.sort(key=lambda x:-x[1])",
"-# print(lst_A)",
"-# print(lst_BC)",
"-# print(lst_D)",
"-# print(lst_A)"
] | false | 0.112404 | 0.09833 | 1.143129 | [
"s867375126",
"s868924008"
] |
u855866205 | p02701 | python | s400316118 | s151211273 | 368 | 273 | 125,752 | 107,664 | Accepted | Accepted | 25.82 | n = int(eval(input()))
d = {}
for i in range(n):
s = eval(input())
try:d[s]+=1
except:d[s]=1
print((len(d))) | n = int(eval(input()))
print((len(set([eval(input()) for i in range(n)]))))
| 7 | 2 | 112 | 63 | n = int(eval(input()))
d = {}
for i in range(n):
s = eval(input())
try:
d[s] += 1
except:
d[s] = 1
print((len(d)))
| n = int(eval(input()))
print((len(set([eval(input()) for i in range(n)]))))
| false | 71.428571 | [
"-d = {}",
"-for i in range(n):",
"- s = eval(input())",
"- try:",
"- d[s] += 1",
"- except:",
"- d[s] = 1",
"-print((len(d)))",
"+print((len(set([eval(input()) for i in range(n)]))))"
] | false | 0.036677 | 0.037481 | 0.978553 | [
"s400316118",
"s151211273"
] |
u411203878 | p02836 | python | s950832720 | s773107864 | 168 | 77 | 38,256 | 68,472 | Accepted | Accepted | 54.17 | s=eval(input())
half = len(s)//2
res = 0
for i in range(half):
if s[i] != s[-(i+1)]:
res += 1
print(res) | import copy
s=list(eval(input()))
s2 = copy.copy(s)
s2.reverse()
ans = 0
for i in range(len(s)//2):
if s[i] != s2[i]:
ans += 1
print(ans) | 10 | 14 | 122 | 161 | s = eval(input())
half = len(s) // 2
res = 0
for i in range(half):
if s[i] != s[-(i + 1)]:
res += 1
print(res)
| import copy
s = list(eval(input()))
s2 = copy.copy(s)
s2.reverse()
ans = 0
for i in range(len(s) // 2):
if s[i] != s2[i]:
ans += 1
print(ans)
| false | 28.571429 | [
"-s = eval(input())",
"-half = len(s) // 2",
"-res = 0",
"-for i in range(half):",
"- if s[i] != s[-(i + 1)]:",
"- res += 1",
"-print(res)",
"+import copy",
"+",
"+s = list(eval(input()))",
"+s2 = copy.copy(s)",
"+s2.reverse()",
"+ans = 0",
"+for i in range(len(s) // 2):",
"+ ... | false | 0.041471 | 0.038421 | 1.079382 | [
"s950832720",
"s773107864"
] |
u312025627 | p03449 | python | s031218145 | s670191048 | 197 | 169 | 40,432 | 38,512 | Accepted | Accepted | 14.21 | def main():
N = int(eval(input()))
A = [[int(i) for i in input().split()] for j in range(2)]
ans = 0
for i in range(N):
cur = 0
for j in range(i, N):
cur = sum(A[0][:i+1]) + sum(A[1][i:])
ans = max(ans, cur)
print(ans)
if __name__ == '__main__':
... | def main():
N = int(eval(input()))
A = [[int(i) for i in input().split()] for j in range(2)]
ans = 0
for i in range(N):
cur = sum(A[0][:i+1]) + sum(A[1][i:])
ans = max(ans, cur)
print(ans)
if __name__ == '__main__':
main()
| 14 | 12 | 322 | 270 | def main():
N = int(eval(input()))
A = [[int(i) for i in input().split()] for j in range(2)]
ans = 0
for i in range(N):
cur = 0
for j in range(i, N):
cur = sum(A[0][: i + 1]) + sum(A[1][i:])
ans = max(ans, cur)
print(ans)
if __name__ == "__main__":
main()
| def main():
N = int(eval(input()))
A = [[int(i) for i in input().split()] for j in range(2)]
ans = 0
for i in range(N):
cur = sum(A[0][: i + 1]) + sum(A[1][i:])
ans = max(ans, cur)
print(ans)
if __name__ == "__main__":
main()
| false | 14.285714 | [
"- cur = 0",
"- for j in range(i, N):",
"- cur = sum(A[0][: i + 1]) + sum(A[1][i:])",
"+ cur = sum(A[0][: i + 1]) + sum(A[1][i:])"
] | false | 0.043671 | 0.037427 | 1.166848 | [
"s031218145",
"s670191048"
] |
u191874006 | p02669 | python | s877653361 | s290708914 | 667 | 536 | 92,728 | 91,164 | Accepted | Accepted | 19.64 | #!/usr/bin/env python3
import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from... | #!/usr/bin/env python3
import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from... | 43 | 36 | 1,236 | 1,086 | #!/usr/bin/env python3
import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop, heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collectio... | #!/usr/bin/env python3
import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop, heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collectio... | false | 16.27907 | [
"- if (x % 3) < (-x % 3):",
"- ret = min(ret, b + dfs(x // 3) + d * (x % 3))",
"- else:",
"- ret = min(ret, b + dfs((x - 1) // 3 + 1) + d * (-x % 3))",
"- if (x % 5) < (-x % 5):",
"- ret = min(ret, c + dfs(x // 5) + d * (x % 5))",
"- else:",
... | false | 0.256555 | 0.326518 | 0.78573 | [
"s877653361",
"s290708914"
] |
u707808519 | p02627 | python | s497641115 | s190276904 | 31 | 26 | 9,020 | 9,072 | Accepted | Accepted | 16.13 | s = eval(input())
if s == s.upper():
print('A')
else:
print('a') | s = eval(input())
if s.islower():
print('a')
else:
print('A') | 6 | 5 | 72 | 67 | s = eval(input())
if s == s.upper():
print("A")
else:
print("a")
| s = eval(input())
if s.islower():
print("a")
else:
print("A")
| false | 16.666667 | [
"-if s == s.upper():",
"+if s.islower():",
"+ print(\"a\")",
"+else:",
"-else:",
"- print(\"a\")"
] | false | 0.042886 | 0.042623 | 1.006167 | [
"s497641115",
"s190276904"
] |
u314050667 | p03476 | python | s550371625 | s239843121 | 876 | 414 | 20,932 | 9,332 | Accepted | Accepted | 52.74 | import numpy as np
limit = 10**5
def Eratosthenes(limit):
is_prime = np.full(limit+1, True)
is_prime[:2] = False
for p in range(2,limit+1):
if p**2 > limit:
break
if is_prime[p]:
is_prime[p**2::p] = False
return is_prime
is_prime = Eratosthenes(limit)
fullfill = np.zeros(limit+1,np.int32... | flg = [1] * (10**5+1)
flg[0], flg[1] = 0, 0
for i in range(2,10**5+1):
if flg[i] == 1:
for j in range(2*i, 10**5+1, i):
flg[j] = 0
cnt = [0,0]
tmp = 0
for i in range(2,10**5+1):
if flg[i] == 1:
if flg[(i+1)//2] == 1:
tmp += 1
cnt.append(tmp)
else:
cnt.append(tmp)
else:
cnt.appen... | 32 | 28 | 593 | 476 | import numpy as np
limit = 10**5
def Eratosthenes(limit):
is_prime = np.full(limit + 1, True)
is_prime[:2] = False
for p in range(2, limit + 1):
if p**2 > limit:
break
if is_prime[p]:
is_prime[p**2 :: p] = False
return is_prime
is_prime = Eratosthenes(limit)
... | flg = [1] * (10**5 + 1)
flg[0], flg[1] = 0, 0
for i in range(2, 10**5 + 1):
if flg[i] == 1:
for j in range(2 * i, 10**5 + 1, i):
flg[j] = 0
cnt = [0, 0]
tmp = 0
for i in range(2, 10**5 + 1):
if flg[i] == 1:
if flg[(i + 1) // 2] == 1:
tmp += 1
cnt.append(tmp)
... | false | 12.5 | [
"-import numpy as np",
"-",
"-limit = 10**5",
"-",
"-",
"-def Eratosthenes(limit):",
"- is_prime = np.full(limit + 1, True)",
"- is_prime[:2] = False",
"- for p in range(2, limit + 1):",
"- if p**2 > limit:",
"- break",
"- if is_prime[p]:",
"- is_... | false | 0.284788 | 0.195039 | 1.460162 | [
"s550371625",
"s239843121"
] |
u098012509 | p02900 | python | s137065918 | s820702078 | 272 | 147 | 9,164 | 9,136 | Accepted | Accepted | 45.96 | A, B = [int(x) for x in input().split()]
def prime_factorization(n):
i = 2
factors = []
while i * i <= n:
if n % i:
i += 1
else:
n //= i
factors.append(i)
if n > 1:
factors.append(n)
return factors
Aprimes = prime_factoriza... | import math
A, B = [int(x) for x in input().split()]
def prime_factorization(n):
i = 2
factors = []
while i * i <= n:
if n % i:
i += 1
else:
n //= i
factors.append(i)
if n > 1:
factors.append(n)
return factors
C = mat... | 29 | 25 | 531 | 387 | A, B = [int(x) for x in input().split()]
def prime_factorization(n):
i = 2
factors = []
while i * i <= n:
if n % i:
i += 1
else:
n //= i
factors.append(i)
if n > 1:
factors.append(n)
return factors
Aprimes = prime_factorization(A)
Bprim... | import math
A, B = [int(x) for x in input().split()]
def prime_factorization(n):
i = 2
factors = []
while i * i <= n:
if n % i:
i += 1
else:
n //= i
factors.append(i)
if n > 1:
factors.append(n)
return factors
C = math.gcd(A, B)
print(... | false | 13.793103 | [
"+import math",
"+",
"-Aprimes = prime_factorization(A)",
"-Bprimes = set(prime_factorization(B))",
"-ans = 1",
"-ansset = set()",
"-for a in Aprimes:",
"- if a in ansset:",
"- continue",
"- if a in Bprimes:",
"- ansset.add(a)",
"- ans += 1",
"-print(ans)",
"+C =... | false | 0.037898 | 0.047062 | 0.805291 | [
"s137065918",
"s820702078"
] |
u906428167 | p02822 | python | s702833418 | s157909778 | 1,584 | 748 | 184,256 | 90,712 | Accepted | Accepted | 52.78 | import sys
sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline
mod = 10**9+7
n = int(eval(input()))
g = [[] for _ in range(n)]
pow2 = [0 for _ in range(n+1)]
pow2[0] = 1
for i in range(n):
pow2[i+1] = pow2[i]*2 %mod
for _ in range(n-1):
a,b = list(map(int, input().split()))
g[a-1].... | import sys
sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline
mod = 10**9+7
n = int(eval(input()))
g = [[] for _ in range(n)]
pow2 = [0 for _ in range(n+1)]
pow2[0] = 1
for i in range(n):
pow2[i+1] = pow2[i]*2 % mod
for _ in range(n-1):
a, b = list(map(int, input().split()))
g[a-1... | 53 | 61 | 1,062 | 1,255 | import sys
sys.setrecursionlimit(10**7)
input = sys.stdin.readline
mod = 10**9 + 7
n = int(eval(input()))
g = [[] for _ in range(n)]
pow2 = [0 for _ in range(n + 1)]
pow2[0] = 1
for i in range(n):
pow2[i + 1] = pow2[i] * 2 % mod
for _ in range(n - 1):
a, b = list(map(int, input().split()))
g[a - 1].append(... | import sys
sys.setrecursionlimit(10**7)
input = sys.stdin.readline
mod = 10**9 + 7
n = int(eval(input()))
g = [[] for _ in range(n)]
pow2 = [0 for _ in range(n + 1)]
pow2[0] = 1
for i in range(n):
pow2[i + 1] = pow2[i] * 2 % mod
for _ in range(n - 1):
a, b = list(map(int, input().split()))
g[a - 1].append(... | false | 13.114754 | [
"-",
"-",
"-def dfs(v, d):",
"- depth[v] = d",
"+depth[0] = 0",
"+stack = [0]",
"+while stack:",
"+ v = stack.pop()",
"+ if any(depth[w] == -1 for w in g[v]):",
"+ stack.append(v)",
"- dfs(w, d + 1)",
"+ depth[w] = depth[v] + 1",
"+ stack.appe... | false | 0.041011 | 0.087805 | 0.467071 | [
"s702833418",
"s157909778"
] |
u729133443 | p03568 | python | s941498235 | s413416731 | 162 | 17 | 38,256 | 2,940 | Accepted | Accepted | 89.51 | print((3**int(eval(input()))-2**sum([(int(x)+1)%2 for x in input().split()]))) | print((3**int(eval(input()))-2**sum(~int(s)%2for s in input().split()))) | 1 | 1 | 73 | 64 | print((3 ** int(eval(input())) - 2 ** sum([(int(x) + 1) % 2 for x in input().split()])))
| print((3 ** int(eval(input())) - 2 ** sum(~int(s) % 2 for s in input().split())))
| false | 0 | [
"-print((3 ** int(eval(input())) - 2 ** sum([(int(x) + 1) % 2 for x in input().split()])))",
"+print((3 ** int(eval(input())) - 2 ** sum(~int(s) % 2 for s in input().split())))"
] | false | 0.077389 | 0.033619 | 2.301928 | [
"s941498235",
"s413416731"
] |
u298297089 | p03854 | python | s338710753 | s936202319 | 42 | 27 | 3,188 | 3,188 | Accepted | Accepted | 35.71 | S = input()[::-1]
words = {w[-1]:w[::-1] for w in ['dream', 'erase', 'er']}
i = 0
flag = True
#print(words)
while i < len(S):
c = S[i]
if c in words:
if S[i:i+len(words[c])] == words[c]:
i += len(words[c])
else :
flag = False
break
if c == 'r':
if S[i:i+len(words['... | s = eval(input())
pos = len(s)
while pos > 0:
# print(s[pos-6:pos])
if s[pos-1] == 'e':
if s[pos-5:pos] == 'erase':
# print(s[pos-5:pos])
pos -= 5
else:
break
elif s[pos-1] == 'm':
if s[pos-5:pos] == 'dream':
# print(s[pos... | 26 | 27 | 595 | 614 | S = input()[::-1]
words = {w[-1]: w[::-1] for w in ["dream", "erase", "er"]}
i = 0
flag = True
# print(words)
while i < len(S):
c = S[i]
if c in words:
if S[i : i + len(words[c])] == words[c]:
i += len(words[c])
else:
flag = False
break
if c == "r":
... | s = eval(input())
pos = len(s)
while pos > 0:
# print(s[pos-6:pos])
if s[pos - 1] == "e":
if s[pos - 5 : pos] == "erase":
# print(s[pos-5:pos])
pos -= 5
else:
break
elif s[pos - 1] == "m":
if s[pos - 5 : pos] == "dream":
# print(s[pos-5... | false | 3.703704 | [
"-S = input()[::-1]",
"-words = {w[-1]: w[::-1] for w in [\"dream\", \"erase\", \"er\"]}",
"-i = 0",
"-flag = True",
"-# print(words)",
"-while i < len(S):",
"- c = S[i]",
"- if c in words:",
"- if S[i : i + len(words[c])] == words[c]:",
"- i += len(words[c])",
"+s = eval... | false | 0.037397 | 0.04094 | 0.913451 | [
"s338710753",
"s936202319"
] |
u131984977 | p02412 | python | s397569667 | s044370265 | 870 | 330 | 6,724 | 6,724 | Accepted | Accepted | 62.07 | while True:
(n, x) = [int(i) for i in input().split()]
if n == x == 0:
break
count = 0
for a in range(1, n + 1):
if a >= x:
break
for b in range(a + 1, n + 1):
if sum([a,b]) >= x:
break
for c in range(b + 1, n + 1):... | while True:
(n, x) = [int(i) for i in input().split()]
if n == x == 0:
break
count = 0
start = n if n < x else x
for a in range(start, 0, -1):
if a >= x:
continue
for b in range(a - 1, 0, -1):
if a + b >= x:
continue
... | 17 | 17 | 411 | 442 | while True:
(n, x) = [int(i) for i in input().split()]
if n == x == 0:
break
count = 0
for a in range(1, n + 1):
if a >= x:
break
for b in range(a + 1, n + 1):
if sum([a, b]) >= x:
break
for c in range(b + 1, n + 1):
... | while True:
(n, x) = [int(i) for i in input().split()]
if n == x == 0:
break
count = 0
start = n if n < x else x
for a in range(start, 0, -1):
if a >= x:
continue
for b in range(a - 1, 0, -1):
if a + b >= x:
continue
for c i... | false | 0 | [
"- for a in range(1, n + 1):",
"+ start = n if n < x else x",
"+ for a in range(start, 0, -1):",
"- break",
"- for b in range(a + 1, n + 1):",
"- if sum([a, b]) >= x:",
"- break",
"- for c in range(b + 1, n + 1):",
"- if ... | false | 0.034397 | 0.036786 | 0.935049 | [
"s397569667",
"s044370265"
] |
u029169777 | p03200 | python | s026762024 | s929403228 | 90 | 55 | 3,500 | 3,500 | Accepted | Accepted | 38.89 | S=eval(input())
Bcount=0
answer=0
for i in range(len(S)):
if S[i]=='B':
Bcount+=1
if S[i]=='W':
answer+=Bcount
print(answer) | S=eval(input())
Bcount=0
ans=0
for i in S:
if i=='B':
Bcount+=1
if i=='W':
ans+=Bcount
print(ans) | 11 | 9 | 142 | 111 | S = eval(input())
Bcount = 0
answer = 0
for i in range(len(S)):
if S[i] == "B":
Bcount += 1
if S[i] == "W":
answer += Bcount
print(answer)
| S = eval(input())
Bcount = 0
ans = 0
for i in S:
if i == "B":
Bcount += 1
if i == "W":
ans += Bcount
print(ans)
| false | 18.181818 | [
"-answer = 0",
"-for i in range(len(S)):",
"- if S[i] == \"B\":",
"+ans = 0",
"+for i in S:",
"+ if i == \"B\":",
"- if S[i] == \"W\":",
"- answer += Bcount",
"-print(answer)",
"+ if i == \"W\":",
"+ ans += Bcount",
"+print(ans)"
] | false | 0.048168 | 0.131885 | 0.365228 | [
"s026762024",
"s929403228"
] |
u123756661 | p02881 | python | s088381172 | s988320551 | 199 | 182 | 40,172 | 40,044 | Accepted | Accepted | 8.54 | n=int(eval(input()))
x=int(n**0.5)+1
for i in range(x,0,-1):
if n%i==0:
print((-2+i+(n//i)))
exit()
| n=int(eval(input()))
x=int(n**0.5)
for i in range(x,0,-1):
if n%i==0:
print((-2+i+(n//i)))
exit() | 6 | 6 | 117 | 114 | n = int(eval(input()))
x = int(n**0.5) + 1
for i in range(x, 0, -1):
if n % i == 0:
print((-2 + i + (n // i)))
exit()
| n = int(eval(input()))
x = int(n**0.5)
for i in range(x, 0, -1):
if n % i == 0:
print((-2 + i + (n // i)))
exit()
| false | 0 | [
"-x = int(n**0.5) + 1",
"+x = int(n**0.5)"
] | false | 0.037541 | 0.076877 | 0.488325 | [
"s088381172",
"s988320551"
] |
u941407962 | p02761 | python | s817417433 | s850294273 | 192 | 162 | 38,384 | 38,256 | Accepted | Accepted | 15.62 | def f(i, qs):
ss = str(i)
for s, c in qs:
if ss[s-1] != c:
return False
return True
def main():
N, M = list(map(int, input().split()))
qs = []
for _ in range(M):
s, c = input().split()
qs.append((int(s), c))
if N == 1:
if f(0, qs):... | def check(i):
for s, c in qs:
if i[s-1] != str(c):
return False
return True
N, M = list(map(int, input().split()))
qs = []
for _ in range(M):
s, c = list(map(int, input().split()))
qs.append((s,c))
for i in range(0 if N==1 else 10**(N-1), 10**N):
i = str(i)
if... | 23 | 19 | 452 | 374 | def f(i, qs):
ss = str(i)
for s, c in qs:
if ss[s - 1] != c:
return False
return True
def main():
N, M = list(map(int, input().split()))
qs = []
for _ in range(M):
s, c = input().split()
qs.append((int(s), c))
if N == 1:
if f(0, qs):
... | def check(i):
for s, c in qs:
if i[s - 1] != str(c):
return False
return True
N, M = list(map(int, input().split()))
qs = []
for _ in range(M):
s, c = list(map(int, input().split()))
qs.append((s, c))
for i in range(0 if N == 1 else 10 ** (N - 1), 10**N):
i = str(i)
if chec... | false | 17.391304 | [
"-def f(i, qs):",
"- ss = str(i)",
"+def check(i):",
"- if ss[s - 1] != c:",
"+ if i[s - 1] != str(c):",
"-def main():",
"- N, M = list(map(int, input().split()))",
"- qs = []",
"- for _ in range(M):",
"- s, c = input().split()",
"- qs.append((int(s), c))"... | false | 0.037361 | 0.174049 | 0.214655 | [
"s817417433",
"s850294273"
] |
u392319141 | p03213 | python | s403409070 | s538156780 | 94 | 23 | 4,468 | 3,444 | Accepted | Accepted | 75.53 | from collections import Counter, defaultdict
N = int(eval(input()))
# 素数のリスト
def createPrimeList(N, isTable=True):
isPrime = [True] * N
isPrime[0] = False
isPrime[1] = False
for i in range(2, N):
if not isPrime[i]:
continue
for p in range(i * 2, N, i):
... | from collections import Counter, defaultdict
N = int(eval(input()))
def primeFactorization(N):
primes = Counter()
R = int(N**(0.5)) + 1
for num in range(2, R):
while N % num == 0:
N //= num
primes[num] += 1
if N > 1 :
primes[N] = 1
return primes... | 43 | 32 | 1,020 | 696 | from collections import Counter, defaultdict
N = int(eval(input()))
# 素数のリスト
def createPrimeList(N, isTable=True):
isPrime = [True] * N
isPrime[0] = False
isPrime[1] = False
for i in range(2, N):
if not isPrime[i]:
continue
for p in range(i * 2, N, i):
isPrime[p]... | from collections import Counter, defaultdict
N = int(eval(input()))
def primeFactorization(N):
primes = Counter()
R = int(N ** (0.5)) + 1
for num in range(2, R):
while N % num == 0:
N //= num
primes[num] += 1
if N > 1:
primes[N] = 1
return primes
primes =... | false | 25.581395 | [
"-# 素数のリスト",
"-def createPrimeList(N, isTable=True):",
"- isPrime = [True] * N",
"- isPrime[0] = False",
"- isPrime[1] = False",
"- for i in range(2, N):",
"- if not isPrime[i]:",
"- continue",
"- for p in range(i * 2, N, i):",
"- isPrime[p] = False"... | false | 0.094909 | 0.085973 | 1.103931 | [
"s403409070",
"s538156780"
] |
u759412327 | p03816 | python | s752234718 | s202113689 | 73 | 48 | 20,792 | 23,016 | Accepted | Accepted | 34.25 | N = int(eval(input()))
A = sorted(list(map(int,input().split())))
B = set(A)
if len(B)%2==0:
print((len(B)-1))
else:
print((len(B))) | N = int(eval(input()))
K = len(set(input().split()))
print((K+K%2-1)) | 8 | 3 | 134 | 63 | N = int(eval(input()))
A = sorted(list(map(int, input().split())))
B = set(A)
if len(B) % 2 == 0:
print((len(B) - 1))
else:
print((len(B)))
| N = int(eval(input()))
K = len(set(input().split()))
print((K + K % 2 - 1))
| false | 62.5 | [
"-A = sorted(list(map(int, input().split())))",
"-B = set(A)",
"-if len(B) % 2 == 0:",
"- print((len(B) - 1))",
"-else:",
"- print((len(B)))",
"+K = len(set(input().split()))",
"+print((K + K % 2 - 1))"
] | false | 0.084552 | 0.043774 | 1.931582 | [
"s752234718",
"s202113689"
] |
u416758623 | p03037 | python | s488133723 | s871720697 | 324 | 276 | 3,188 | 3,060 | Accepted | Accepted | 14.81 | n,m = list(map(int, input().split()))
ans = 0
L = 1
R = n
for i in range(m):
l,r = list(map(int, input().split()))
L = max(l,L)
R = min(r,R)
if L <= R:
print((R-L+1))
else:
print((0)) | N, M = list(map(int, input().split()))
left=0
right=N
for i in range(M):
L, R = list(map(int, input().split()))
if L > left:
left = L
if R < right:
right = R
if left <= right:
print((right-left+1))
else:
print((0)) | 13 | 15 | 204 | 250 | n, m = list(map(int, input().split()))
ans = 0
L = 1
R = n
for i in range(m):
l, r = list(map(int, input().split()))
L = max(l, L)
R = min(r, R)
if L <= R:
print((R - L + 1))
else:
print((0))
| N, M = list(map(int, input().split()))
left = 0
right = N
for i in range(M):
L, R = list(map(int, input().split()))
if L > left:
left = L
if R < right:
right = R
if left <= right:
print((right - left + 1))
else:
print((0))
| false | 13.333333 | [
"-n, m = list(map(int, input().split()))",
"-ans = 0",
"-L = 1",
"-R = n",
"-for i in range(m):",
"- l, r = list(map(int, input().split()))",
"- L = max(l, L)",
"- R = min(r, R)",
"-if L <= R:",
"- print((R - L + 1))",
"+N, M = list(map(int, input().split()))",
"+left = 0",
"+rig... | false | 0.049341 | 0.049374 | 0.999324 | [
"s488133723",
"s871720697"
] |
u371990949 | p03457 | python | s285402288 | s287478553 | 431 | 398 | 11,768 | 11,796 | Accepted | Accepted | 7.66 | n = int(eval(input()))
t = [0]
x = [0]
y = [0]
for i in range(n):
t_tmp, x_tmp, y_tmp = list(map(int, input().split()))
t.append(t_tmp)
x.append(x_tmp)
y.append(y_tmp)
r_init = [0, 0]
parity = 0 # 偶数
for i in range(1, n+1):
t_diff = t[i] - t[i-1]
x_diff = abs(x[i] - x[i-1])
y... | n = int(eval(input()))
t = [0]
x = [0]
y = [0]
for i in range(n):
t_tmp, x_tmp, y_tmp = list(map(int, input().split()))
t.append(t_tmp)
x.append(x_tmp)
y.append(y_tmp)
r_init = [0, 0]
parity = 0 # 偶数
for i in range(1, n+1):
dt = t[i] - t[i-1]
dx = abs(x[i] - x[i-1])
dy = abs(... | 43 | 27 | 832 | 487 | n = int(eval(input()))
t = [0]
x = [0]
y = [0]
for i in range(n):
t_tmp, x_tmp, y_tmp = list(map(int, input().split()))
t.append(t_tmp)
x.append(x_tmp)
y.append(y_tmp)
r_init = [0, 0]
parity = 0 # 偶数
for i in range(1, n + 1):
t_diff = t[i] - t[i - 1]
x_diff = abs(x[i] - x[i - 1])
y_diff = a... | n = int(eval(input()))
t = [0]
x = [0]
y = [0]
for i in range(n):
t_tmp, x_tmp, y_tmp = list(map(int, input().split()))
t.append(t_tmp)
x.append(x_tmp)
y.append(y_tmp)
r_init = [0, 0]
parity = 0 # 偶数
for i in range(1, n + 1):
dt = t[i] - t[i - 1]
dx = abs(x[i] - x[i - 1])
dy = abs(y[i] - y[... | false | 37.209302 | [
"- t_diff = t[i] - t[i - 1]",
"- x_diff = abs(x[i] - x[i - 1])",
"- y_diff = abs(y[i] - y[i - 1])",
"- d_diff = x_diff + y_diff",
"- if d_diff > t_diff:",
"+ dt = t[i] - t[i - 1]",
"+ dx = abs(x[i] - x[i - 1])",
"+ dy = abs(y[i] - y[i - 1])",
"+ dist = dx + dy",
"+ if... | false | 0.046646 | 0.044606 | 1.045732 | [
"s285402288",
"s287478553"
] |
u294385082 | p02820 | python | s476152342 | s555953557 | 86 | 66 | 4,212 | 4,084 | Accepted | Accepted | 23.26 | n,k = list(map(int,input().split()))
r,s,p = list(map(int,input().split()))
t = eval(input())
lis = ['' for _ in range(len(t))]
ans = 0
for i in range(k):
if t[i] == 'r':
ans += p
lis[i] = 'p'
elif t[i] == 'p':
ans += s
lis[i] = 's'
else:
ans += r
lis[i] ='r'
for j i... | N, K = list(map(int, input().split(' ')))
R, S, P = list(map(int, input().split(' ')))
T = eval(input())
flags = [0] * len(T)
point_map = {'r': P, 's': R, 'p': S}
point_sum = 0
for i, t in enumerate(T):
if i < K:
point_sum += point_map[t]
continue
if t == T[i-K] and not fla... | 42 | 20 | 768 | 425 | n, k = list(map(int, input().split()))
r, s, p = list(map(int, input().split()))
t = eval(input())
lis = ["" for _ in range(len(t))]
ans = 0
for i in range(k):
if t[i] == "r":
ans += p
lis[i] = "p"
elif t[i] == "p":
ans += s
lis[i] = "s"
else:
ans += r
lis[i] ... | N, K = list(map(int, input().split(" ")))
R, S, P = list(map(int, input().split(" ")))
T = eval(input())
flags = [0] * len(T)
point_map = {"r": P, "s": R, "p": S}
point_sum = 0
for i, t in enumerate(T):
if i < K:
point_sum += point_map[t]
continue
if t == T[i - K] and not flags[i - K]:
f... | false | 52.380952 | [
"-n, k = list(map(int, input().split()))",
"-r, s, p = list(map(int, input().split()))",
"-t = eval(input())",
"-lis = [\"\" for _ in range(len(t))]",
"-ans = 0",
"-for i in range(k):",
"- if t[i] == \"r\":",
"- ans += p",
"- lis[i] = \"p\"",
"- elif t[i] == \"p\":",
"- ... | false | 0.039389 | 0.03736 | 1.054308 | [
"s476152342",
"s555953557"
] |
u077291787 | p02899 | python | s952226111 | s407331733 | 93 | 68 | 13,940 | 18,020 | Accepted | Accepted | 26.88 | # ABC142C - Go to School
def main():
N, *A = list(map(int, open(0).read().split()))
ans = [0] * (N + 1)
for i, j in enumerate(A, 1):
ans[j] = i
print((*ans[1:]))
if __name__ == "__main__":
main() | # ABC142C - Go to School
def main():
N, *A = list(map(int, open(0).read().split()))
ans = [0] * (N + 1)
for i, j in enumerate(A, 1):
ans[j] = i
print((" ".join(map(str, ans[1:]))))
if __name__ == "__main__":
main() | 11 | 11 | 227 | 246 | # ABC142C - Go to School
def main():
N, *A = list(map(int, open(0).read().split()))
ans = [0] * (N + 1)
for i, j in enumerate(A, 1):
ans[j] = i
print((*ans[1:]))
if __name__ == "__main__":
main()
| # ABC142C - Go to School
def main():
N, *A = list(map(int, open(0).read().split()))
ans = [0] * (N + 1)
for i, j in enumerate(A, 1):
ans[j] = i
print((" ".join(map(str, ans[1:]))))
if __name__ == "__main__":
main()
| false | 0 | [
"- print((*ans[1:]))",
"+ print((\" \".join(map(str, ans[1:]))))"
] | false | 0.098947 | 0.036554 | 2.706875 | [
"s952226111",
"s407331733"
] |
u088553842 | p03109 | python | s888863725 | s755380205 | 26 | 22 | 9,072 | 9,060 | Accepted | Accepted | 15.38 | s=eval(input())
print(('Heisei' if int(s[5:7]) <= 4 else 'TBD')) | print(('Heisei'if int(input()[5:7])<=4else'TBD')) | 2 | 1 | 57 | 47 | s = eval(input())
print(("Heisei" if int(s[5:7]) <= 4 else "TBD"))
| print(("Heisei" if int(input()[5:7]) <= 4 else "TBD"))
| false | 50 | [
"-s = eval(input())",
"-print((\"Heisei\" if int(s[5:7]) <= 4 else \"TBD\"))",
"+print((\"Heisei\" if int(input()[5:7]) <= 4 else \"TBD\"))"
] | false | 0.007705 | 0.032597 | 0.236378 | [
"s888863725",
"s755380205"
] |
u319725914 | p00223 | python | s334462811 | s427028249 | 5,450 | 4,450 | 35,200 | 35,192 | Accepted | Accepted | 18.35 | # from line_profiler import LineProfiler
from collections import deque
from sys import stdin
def main():
while(True):
W, H = list(map(int, stdin.readline().split()))
if not W: break
tx,ty = list(map(int, stdin.readline().split()))
kx,ky = list(map(int, stdin.readline().spli... | # from line_profiler import LineProfiler
from collections import deque
from sys import stdin
def main():
while(True):
W, H = list(map(int, stdin.readline().split()))
if not W: break
tx,ty = list(map(int, stdin.readline().split()))
kx,ky = list(map(int, stdin.readline().spli... | 36 | 36 | 1,301 | 1,306 | # from line_profiler import LineProfiler
from collections import deque
from sys import stdin
def main():
while True:
W, H = list(map(int, stdin.readline().split()))
if not W:
break
tx, ty = list(map(int, stdin.readline().split()))
kx, ky = list(map(int, stdin.readline()... | # from line_profiler import LineProfiler
from collections import deque
from sys import stdin
def main():
while True:
W, H = list(map(int, stdin.readline().split()))
if not W:
break
tx, ty = list(map(int, stdin.readline().split()))
kx, ky = list(map(int, stdin.readline()... | false | 0 | [
"- [0] + [abs(1 - int(a)) for a in stdin.readline().split()] + [0]",
"+ [False] + [bool(1 - int(a)) for a in stdin.readline().split()] + [False]",
"- ma = [[0] * (W + 2)] + ma + [[0] * (W + 2)]",
"+ ma = [[False] * (W + 2)] + ma + [[False] * (W + 2)]",
"- t... | false | 0.073213 | 0.075208 | 0.973482 | [
"s334462811",
"s427028249"
] |
u181526702 | p03240 | python | s720299150 | s234650072 | 392 | 35 | 3,064 | 3,064 | Accepted | Accepted | 91.07 | from sys import stdin
from itertools import product
N, *xyh = list(map(int, stdin.read().split()))
xyh = list(zip(*[iter(xyh)] * 3))
xyh.sort(key=lambda x: x[2], reverse=True)
x1, y1, h1 = xyh[0]
for X, Y in product(list(range(101)), list(range(101))):
H = h1 + abs(x1-X) + abs(y1-Y)
if all([max(H-... | from sys import stdin
from itertools import product
N, *xyh = list(map(int, stdin.read().split()))
xyh = list(zip(*[iter(xyh)] * 3))
xyh.sort(key=lambda x: x[2], reverse=True)
x1, y1, h1 = xyh[0]
for X, Y in product(list(range(101)), list(range(101))):
H = h1 + abs(x1-X) + abs(y1-Y)
if all(max(H-a... | 14 | 14 | 393 | 391 | from sys import stdin
from itertools import product
N, *xyh = list(map(int, stdin.read().split()))
xyh = list(zip(*[iter(xyh)] * 3))
xyh.sort(key=lambda x: x[2], reverse=True)
x1, y1, h1 = xyh[0]
for X, Y in product(list(range(101)), list(range(101))):
H = h1 + abs(x1 - X) + abs(y1 - Y)
if all([max(H - abs(x -... | from sys import stdin
from itertools import product
N, *xyh = list(map(int, stdin.read().split()))
xyh = list(zip(*[iter(xyh)] * 3))
xyh.sort(key=lambda x: x[2], reverse=True)
x1, y1, h1 = xyh[0]
for X, Y in product(list(range(101)), list(range(101))):
H = h1 + abs(x1 - X) + abs(y1 - Y)
if all(max(H - abs(x - ... | false | 0 | [
"- if all([max(H - abs(x - X) - abs(y - Y), 0) == h for x, y, h in xyh[1:]]):",
"+ if all(max(H - abs(x - X) - abs(y - Y), 0) == h for x, y, h in xyh[1:]):"
] | false | 0.106785 | 0.039858 | 2.679093 | [
"s720299150",
"s234650072"
] |
u201928947 | p02564 | python | s600732958 | s701813082 | 1,006 | 875 | 214,520 | 212,964 | Accepted | Accepted | 13.02 | from collections import deque
class csr:
def __init__(self,N,edges):
self.start = [0]*(N+1)
self.elist = [0]*len(edges)
for e in edges:
self.start[e[0]+1] += 1
for i in range(1,N+1):
self.start[i] += self.start[i-1]
counter = self.start[:]
... | class csr:
def __init__(self,N,edges):
self.start = [0]*(N+1)
self.elist = [0]*len(edges)
for e in edges:
self.start[e[0]+1] += 1
for i in range(1,N+1):
self.start[i] += self.start[i-1]
counter = self.start[:]
for e in edges:
... | 88 | 87 | 2,784 | 2,743 | from collections import deque
class csr:
def __init__(self, N, edges):
self.start = [0] * (N + 1)
self.elist = [0] * len(edges)
for e in edges:
self.start[e[0] + 1] += 1
for i in range(1, N + 1):
self.start[i] += self.start[i - 1]
counter = self.star... | class csr:
def __init__(self, N, edges):
self.start = [0] * (N + 1)
self.elist = [0] * len(edges)
for e in edges:
self.start[e[0] + 1] += 1
for i in range(1, N + 1):
self.start[i] += self.start[i - 1]
counter = self.start[:]
for e in edges:
... | false | 1.136364 | [
"-from collections import deque",
"-",
"-",
"- visited = deque()",
"+ visited = []",
"- stack = deque()",
"+ stack = []"
] | false | 0.0946 | 0.080674 | 1.172627 | [
"s600732958",
"s701813082"
] |
u844646164 | p03565 | python | s476457099 | s251631206 | 167 | 66 | 38,512 | 63,496 | Accepted | Accepted | 60.48 |
s = list(eval(input()))
t = list(eval(input()))
sn = len(s)
tn = len(t)
bag = []
for i in range(sn-tn+1):
flag = True
for j in range(tn):
if s[i+j] == '?' or s[i+j] == t[j]:
pass
else:
flag = False
if flag:
bag += [i]
if len(bag) == 0:
print('UNRESTORABLE')
... | S = list(eval(input()))
T = list(eval(input()))
ans_list = []
for i in range(len(S)):
flag = True
if S[i] == "?" or S[i] == T[0]:
tmp = S[i:i+len(T)]
if len(tmp) != len(T):
continue
for j in range(len(T)):
if tmp[j] != '?' and T[j] != tmp[j]:
flag = False
break
... | 40 | 26 | 585 | 589 | s = list(eval(input()))
t = list(eval(input()))
sn = len(s)
tn = len(t)
bag = []
for i in range(sn - tn + 1):
flag = True
for j in range(tn):
if s[i + j] == "?" or s[i + j] == t[j]:
pass
else:
flag = False
if flag:
bag += [i]
if len(bag) == 0:
print("UNRES... | S = list(eval(input()))
T = list(eval(input()))
ans_list = []
for i in range(len(S)):
flag = True
if S[i] == "?" or S[i] == T[0]:
tmp = S[i : i + len(T)]
if len(tmp) != len(T):
continue
for j in range(len(T)):
if tmp[j] != "?" and T[j] != tmp[j]:
f... | false | 35 | [
"-s = list(eval(input()))",
"-t = list(eval(input()))",
"-sn = len(s)",
"-tn = len(t)",
"-bag = []",
"-for i in range(sn - tn + 1):",
"+S = list(eval(input()))",
"+T = list(eval(input()))",
"+ans_list = []",
"+for i in range(len(S)):",
"- for j in range(tn):",
"- if s[i + j] == \"?\"... | false | 0.035977 | 0.035863 | 1.003167 | [
"s476457099",
"s251631206"
] |
u143509139 | p02892 | python | s928215406 | s919426961 | 670 | 281 | 44,764 | 42,732 | Accepted | Accepted | 58.06 | from collections import deque
n = int(eval(input()))
s = [eval(input()) for i in range(n)]
ans = -2
for k in range(n):
q = deque([k])
d = [float('inf')] * n
d[k] = 0
while q:
flg = 0
p = q.popleft()
for i, c in enumerate(s[p]):
if c == '1':
... | def warshall_floyd(v_count: int, matrix: list) -> list:
""" ワーシャルフロイド
v_count: 頂点数
matrix: 隣接行列(到達不能はfloat("inf"))
"""
for i in range(v_count):
for j, c2 in enumerate(row[i] for row in matrix):
for k, (c1, c3) in enumerate(zip(matrix[j], matrix[i])):
if c1... | 26 | 39 | 659 | 994 | from collections import deque
n = int(eval(input()))
s = [eval(input()) for i in range(n)]
ans = -2
for k in range(n):
q = deque([k])
d = [float("inf")] * n
d[k] = 0
while q:
flg = 0
p = q.popleft()
for i, c in enumerate(s[p]):
if c == "1":
if d[i] ==... | def warshall_floyd(v_count: int, matrix: list) -> list:
"""ワーシャルフロイド
v_count: 頂点数
matrix: 隣接行列(到達不能はfloat("inf"))
"""
for i in range(v_count):
for j, c2 in enumerate(row[i] for row in matrix):
for k, (c1, c3) in enumerate(zip(matrix[j], matrix[i])):
if c1 > c2 + c... | false | 33.333333 | [
"-from collections import deque",
"+def warshall_floyd(v_count: int, matrix: list) -> list:",
"+ \"\"\"ワーシャルフロイド",
"+ v_count: 頂点数",
"+ matrix: 隣接行列(到達不能はfloat(\"inf\"))",
"+ \"\"\"",
"+ for i in range(v_count):",
"+ for j, c2 in enumerate(row[i] for row in matrix):",
"+ ... | false | 0.035959 | 0.036334 | 0.989701 | [
"s928215406",
"s919426961"
] |
u312025627 | p04033 | python | s188039503 | s900785367 | 168 | 17 | 38,256 | 2,940 | Accepted | Accepted | 89.88 | def main():
a, b = (int(i) for i in input().split())
if a <= 0 and 0 <= b:
print("Zero")
elif a > 0:
print("Positive")
elif b < 0:
if (b - a) % 2 == 0:
print("Negative")
else:
print("Positive")
if __name__ == "__main__":
main() | def main():
a, b = (int(i) for i in input().split())
if a*b <= 0:
print("Zero")
elif 0 < a:
print("Positive")
else:
if (b-a+1) % 2 == 0:
print("Positive")
else:
print("Negative")
if __name__ == '__main__':
main()
| 13 | 15 | 315 | 305 | def main():
a, b = (int(i) for i in input().split())
if a <= 0 and 0 <= b:
print("Zero")
elif a > 0:
print("Positive")
elif b < 0:
if (b - a) % 2 == 0:
print("Negative")
else:
print("Positive")
if __name__ == "__main__":
main()
| def main():
a, b = (int(i) for i in input().split())
if a * b <= 0:
print("Zero")
elif 0 < a:
print("Positive")
else:
if (b - a + 1) % 2 == 0:
print("Positive")
else:
print("Negative")
if __name__ == "__main__":
main()
| false | 13.333333 | [
"- if a <= 0 and 0 <= b:",
"+ if a * b <= 0:",
"- elif a > 0:",
"+ elif 0 < a:",
"- elif b < 0:",
"- if (b - a) % 2 == 0:",
"+ else:",
"+ if (b - a + 1) % 2 == 0:",
"+ print(\"Positive\")",
"+ else:",
"- else:",
"- print(\"Pos... | false | 0.047451 | 0.04573 | 1.037637 | [
"s188039503",
"s900785367"
] |
u729133443 | p03730 | python | s045195140 | s406167811 | 150 | 22 | 12,484 | 9,168 | Accepted | Accepted | 85.33 | from numpy import*;a,b,c=int_(input().split());print(('YNEOS'[all(a*list(range(b))%b-c)::2])) | import math
a,b,c=list(map(int,input().split()))
print(('YNEOS'[c%math.gcd(a,b)>0::2])) | 1 | 3 | 85 | 81 | from numpy import *
a, b, c = int_(input().split())
print(("YNEOS"[all(a * list(range(b)) % b - c) :: 2]))
| import math
a, b, c = list(map(int, input().split()))
print(("YNEOS"[c % math.gcd(a, b) > 0 :: 2]))
| false | 66.666667 | [
"-from numpy import *",
"+import math",
"-a, b, c = int_(input().split())",
"-print((\"YNEOS\"[all(a * list(range(b)) % b - c) :: 2]))",
"+a, b, c = list(map(int, input().split()))",
"+print((\"YNEOS\"[c % math.gcd(a, b) > 0 :: 2]))"
] | false | 0.580515 | 0.038474 | 15.088621 | [
"s045195140",
"s406167811"
] |
u576432509 | p02574 | python | s398147807 | s947937885 | 676 | 618 | 219,348 | 219,236 | Accepted | Accepted | 8.58 |
import sys
def enum_div(n):
ir=int(n**(0.5))+1
ret=[]
for i in range(1,ir):
if n%i == 0:
ret.append(i)
if (i!= 1) & (i*i != n):
ret.append(n//i)
return ret
import math
def get_primenumber(number):#エラトステネスの篩
prime_list = []
se... |
import sys
def enum_div(n):
ir=int(n**(0.5))+1
ret=[]
for i in range(1,ir):
if n%i == 0:
ret.append(i)
if (i!= 1) & (i*i != n):
ret.append(n//i)
return ret
import math
def get_primenumber(number):#エラトステネスの篩
prime_list = []
se... | 78 | 78 | 1,717 | 1,717 | import sys
def enum_div(n):
ir = int(n ** (0.5)) + 1
ret = []
for i in range(1, ir):
if n % i == 0:
ret.append(i)
if (i != 1) & (i * i != n):
ret.append(n // i)
return ret
import math
def get_primenumber(number): # エラトステネスの篩
prime_list = []
... | import sys
def enum_div(n):
ir = int(n ** (0.5)) + 1
ret = []
for i in range(1, ir):
if n % i == 0:
ret.append(i)
if (i != 1) & (i * i != n):
ret.append(n // i)
return ret
import math
def get_primenumber(number): # エラトステネスの篩
prime_list = []
... | false | 0 | [
"-for pp in range(2, amax + 1):",
"- # for pp in p:",
"+# for pp in range(2,amax+1):",
"+for pp in p:"
] | false | 0.072881 | 0.039333 | 1.852925 | [
"s398147807",
"s947937885"
] |
u633068244 | p00179 | python | s810798003 | s985628288 | 19,480 | 2,830 | 5,556 | 4,976 | Accepted | Accepted | 85.47 | rgb = set(["r","g","b"])
while 1:
worm = input()
if worm == "0": break
n = len(worm)
que = [worm]
ref = set(worm)
L = 1
cnt = flag = 0
while 1:
for r in range(L):
Worm = que.pop(0)
if Worm in ref: continue
else: ref.add(Worm)
if len(set(Worm)) == 1:
flag = 1
break
for i... | rgb = set(["r","g","b"])
while 1:
worm = input()
if worm == "0": break
n = len(worm)
L = 1
cnt = flag = 0
queset = set([worm])
while 1:
que = list(queset)
queset = set()
for r in range(L):
Worm = que.pop(0)
if len(set(Worm)) == 1:
flag = 1
break
for i in range(n-1):
if... | 28 | 26 | 634 | 563 | rgb = set(["r", "g", "b"])
while 1:
worm = input()
if worm == "0":
break
n = len(worm)
que = [worm]
ref = set(worm)
L = 1
cnt = flag = 0
while 1:
for r in range(L):
Worm = que.pop(0)
if Worm in ref:
continue
else:
... | rgb = set(["r", "g", "b"])
while 1:
worm = input()
if worm == "0":
break
n = len(worm)
L = 1
cnt = flag = 0
queset = set([worm])
while 1:
que = list(queset)
queset = set()
for r in range(L):
Worm = que.pop(0)
if len(set(Worm)) == 1:
... | false | 7.142857 | [
"- que = [worm]",
"- ref = set(worm)",
"+ queset = set([worm])",
"+ que = list(queset)",
"+ queset = set()",
"- if Worm in ref:",
"- continue",
"- else:",
"- ref.add(Worm)",
"- worm = Worm[:]",
"- ... | false | 0.007728 | 0.306181 | 0.02524 | [
"s810798003",
"s985628288"
] |
u855831834 | p03565 | python | s559656015 | s067891013 | 27 | 24 | 9,088 | 9,088 | Accepted | Accepted | 11.11 | s = eval(input())
t = eval(input())
ans = "UNRESTORABLE"
for begin in range(len(s)):#塗り替えるとこの始点
if begin+len(t) > len(s):
break
tmp = list(s)
ti = 0
for i in range(begin,begin+len(t)):
tmp[i] = t[ti]
ti += 1
for i in range(len(s)):
if s[i] != '?':
... | S = eval(input())
T = eval(input())
if len(S) < len(T):
print('UNRESTORABLE')
exit()
ind = None
for i in range(len(S)-len(T)+1):
for j in range(len(T)):
if S[i+j] == "?":
continue
elif S[i+j] == T[j]:
continue
else:
break
... | 21 | 30 | 499 | 577 | s = eval(input())
t = eval(input())
ans = "UNRESTORABLE"
for begin in range(len(s)): # 塗り替えるとこの始点
if begin + len(t) > len(s):
break
tmp = list(s)
ti = 0
for i in range(begin, begin + len(t)):
tmp[i] = t[ti]
ti += 1
for i in range(len(s)):
if s[i] != "?":
... | S = eval(input())
T = eval(input())
if len(S) < len(T):
print("UNRESTORABLE")
exit()
ind = None
for i in range(len(S) - len(T) + 1):
for j in range(len(T)):
if S[i + j] == "?":
continue
elif S[i + j] == T[j]:
continue
else:
break
else:
... | false | 30 | [
"-s = eval(input())",
"-t = eval(input())",
"-ans = \"UNRESTORABLE\"",
"-for begin in range(len(s)): # 塗り替えるとこの始点",
"- if begin + len(t) > len(s):",
"- break",
"- tmp = list(s)",
"- ti = 0",
"- for i in range(begin, begin + len(t)):",
"- tmp[i] = t[ti]",
"- ti +... | false | 0.04783 | 0.152076 | 0.314513 | [
"s559656015",
"s067891013"
] |
u945199633 | p02595 | python | s480019615 | s631142615 | 443 | 256 | 9,156 | 9,200 | Accepted | Accepted | 42.21 | N, D = list(map(int, input().split()))
ct = 0
D2 = D * D
for i in range(N):
X, Y = list(map(int, input().split()))
if (X**2 + Y**2) <= D2:
ct += 1
print(ct) | from sys import stdin
N, D = list(map(int, stdin.readline().split()))
ct = 0
D2 = D * D
for i in range(N):
X, Y = list(map(int, stdin.readline().split()))
if (X**2 + Y**2) <= D2:
ct += 1
print(ct) | 10 | 12 | 171 | 214 | N, D = list(map(int, input().split()))
ct = 0
D2 = D * D
for i in range(N):
X, Y = list(map(int, input().split()))
if (X**2 + Y**2) <= D2:
ct += 1
print(ct)
| from sys import stdin
N, D = list(map(int, stdin.readline().split()))
ct = 0
D2 = D * D
for i in range(N):
X, Y = list(map(int, stdin.readline().split()))
if (X**2 + Y**2) <= D2:
ct += 1
print(ct)
| false | 16.666667 | [
"-N, D = list(map(int, input().split()))",
"+from sys import stdin",
"+",
"+N, D = list(map(int, stdin.readline().split()))",
"- X, Y = list(map(int, input().split()))",
"+ X, Y = list(map(int, stdin.readline().split()))"
] | false | 0.061624 | 0.037127 | 1.659803 | [
"s480019615",
"s631142615"
] |
u786020649 | p03660 | python | s012490412 | s175246663 | 545 | 393 | 43,956 | 44,952 | Accepted | Accepted | 27.89 | import sys
from collections import defaultdict
from collections import deque
n=int(eval(input()))
edges=[tuple(map(int,input().split())) for _ in range(n-1)]
d=defaultdict(list)
for e in edges:
d[e[0]].append(e[1])
d[e[1]].append(e[0])
fnc=[-1]*(n+1)
snk=[-1]*(n+1)
fnc[1]=0
snk[n]=0
cv=deque([1])
nv... | from collections import deque, defaultdict
def main():
n=int(eval(input()))
edges=[tuple(map(int,input().split())) for _ in range(n-1)]
d=defaultdict(list)
for e in edges:
d[e[0]].append(e[1])
d[e[1]].append(e[0])
def dist(m):
c=-1
dl=[-1]*(n+1)
cv=deque([m])
nv=deque([1]... | 46 | 35 | 798 | 723 | import sys
from collections import defaultdict
from collections import deque
n = int(eval(input()))
edges = [tuple(map(int, input().split())) for _ in range(n - 1)]
d = defaultdict(list)
for e in edges:
d[e[0]].append(e[1])
d[e[1]].append(e[0])
fnc = [-1] * (n + 1)
snk = [-1] * (n + 1)
fnc[1] = 0
snk[n] = 0
cv... | from collections import deque, defaultdict
def main():
n = int(eval(input()))
edges = [tuple(map(int, input().split())) for _ in range(n - 1)]
d = defaultdict(list)
for e in edges:
d[e[0]].append(e[1])
d[e[1]].append(e[0])
def dist(m):
c = -1
dl = [-1] * (n + 1)
... | false | 23.913043 | [
"-import sys",
"-from collections import defaultdict",
"-from collections import deque",
"+from collections import deque, defaultdict",
"-n = int(eval(input()))",
"-edges = [tuple(map(int, input().split())) for _ in range(n - 1)]",
"-d = defaultdict(list)",
"-for e in edges:",
"- d[e[0]].append(e... | false | 0.040438 | 0.049811 | 0.811843 | [
"s012490412",
"s175246663"
] |
u248670337 | p03476 | python | s611973147 | s318055505 | 809 | 593 | 20,292 | 13,400 | Accepted | Accepted | 26.7 | n=8**6;P=[0,0]+[1]*n;S=[0]*n
for i in range(2,n):
for j in range(2*i,n,i):P[j]=0
for i in range(1,n):S[i]+=(P[i]==P[(i+1)//2]==1)+S[i-1]
for _ in "_"*int(eval(input())):l,r=list(map(int,input().split()));print((S[r]-S[l-1])) | n=7**6;P=[0,0]+[1]*n;S=[0]*n
for i in range(2,n):
for j in range(2*i,n,i):P[j]=0
for i in range(1,n):S[i]+=(P[i]==P[(i+1)//2]==1)+S[i-1]
for _ in "_"*int(eval(input())):l,r=list(map(int,input().split()));print((S[r]-S[l-1])) | 5 | 5 | 216 | 216 | n = 8**6
P = [0, 0] + [1] * n
S = [0] * n
for i in range(2, n):
for j in range(2 * i, n, i):
P[j] = 0
for i in range(1, n):
S[i] += (P[i] == P[(i + 1) // 2] == 1) + S[i - 1]
for _ in "_" * int(eval(input())):
l, r = list(map(int, input().split()))
print((S[r] - S[l - 1]))
| n = 7**6
P = [0, 0] + [1] * n
S = [0] * n
for i in range(2, n):
for j in range(2 * i, n, i):
P[j] = 0
for i in range(1, n):
S[i] += (P[i] == P[(i + 1) // 2] == 1) + S[i - 1]
for _ in "_" * int(eval(input())):
l, r = list(map(int, input().split()))
print((S[r] - S[l - 1]))
| false | 0 | [
"-n = 8**6",
"+n = 7**6"
] | false | 1.113081 | 0.808682 | 1.376415 | [
"s611973147",
"s318055505"
] |
u796942881 | p03425 | python | s940183271 | s294300510 | 75 | 47 | 16,572 | 10,864 | Accepted | Accepted | 37.33 | input = open(0).read
N, *Sn = list(map(str, input().split()))
N = int(N)
def main():
M = {j for j in Sn if j[0] in "M"}
A = {j for j in Sn if j[0] in "A"}
R = {j for j in Sn if j[0] in "R"}
C = {j for j in Sn if j[0] in "C"}
H = {j for j in Sn if j[0] in "H"}
m = len(M)
a =... | from itertools import combinations
input = open(0).read
Sn = [i[0] for i in input().split() if i[0] in "MARCH"]
def main():
print((
sum(x * y * z for x, y, z
in combinations([Sn.count(s) for s in "MARCH"], 3))))
return
main()
| 35 | 17 | 619 | 276 | input = open(0).read
N, *Sn = list(map(str, input().split()))
N = int(N)
def main():
M = {j for j in Sn if j[0] in "M"}
A = {j for j in Sn if j[0] in "A"}
R = {j for j in Sn if j[0] in "R"}
C = {j for j in Sn if j[0] in "C"}
H = {j for j in Sn if j[0] in "H"}
m = len(M)
a = len(A)
r = ... | from itertools import combinations
input = open(0).read
Sn = [i[0] for i in input().split() if i[0] in "MARCH"]
def main():
print(
(sum(x * y * z for x, y, z in combinations([Sn.count(s) for s in "MARCH"], 3)))
)
return
main()
| false | 51.428571 | [
"+from itertools import combinations",
"+",
"-N, *Sn = list(map(str, input().split()))",
"-N = int(N)",
"+Sn = [i[0] for i in input().split() if i[0] in \"MARCH\"]",
"- M = {j for j in Sn if j[0] in \"M\"}",
"- A = {j for j in Sn if j[0] in \"A\"}",
"- R = {j for j in Sn if j[0] in \"R\"}",
... | false | 0.063495 | 0.15149 | 0.419132 | [
"s940183271",
"s294300510"
] |
u401686269 | p03168 | python | s292341787 | s125199703 | 338 | 216 | 223,816 | 203,540 | Accepted | Accepted | 36.09 | N = int(eval(input()))
p = list(map(float, input().split()))
dp = [[0 for i in range(N+1)] for j in range(N+1)]
dp[0][0] = 1
for i in range(1,N+1):
for j in range(i+1):
if j == 0:
dp[j][i] = (1-p[i-1])*dp[j][i-1]
else:
dp[j][i] = (1-p[i-1])*dp[j][i-1] + p[i-1]*dp[j-1][i-1]
sum_ = 0... | N=int(eval(input()))
*p, = list(map(float,input().split()))
dp = [[0]*(N+1) for _ in range(N+1)]
for i in range(1,N+1):
if i == 1:
dp[i][0] = 1-p[0]
dp[i][1] = p[0]
continue
for j in range(i+1):
if j == 0:
dp[i][j] = dp[i-1][j]*(1-p[i-1])
continue
dp[i][j] = dp[i-1][j... | 18 | 21 | 380 | 420 | N = int(eval(input()))
p = list(map(float, input().split()))
dp = [[0 for i in range(N + 1)] for j in range(N + 1)]
dp[0][0] = 1
for i in range(1, N + 1):
for j in range(i + 1):
if j == 0:
dp[j][i] = (1 - p[i - 1]) * dp[j][i - 1]
else:
dp[j][i] = (1 - p[i - 1]) * dp[j][i - 1]... | N = int(eval(input()))
(*p,) = list(map(float, input().split()))
dp = [[0] * (N + 1) for _ in range(N + 1)]
for i in range(1, N + 1):
if i == 1:
dp[i][0] = 1 - p[0]
dp[i][1] = p[0]
continue
for j in range(i + 1):
if j == 0:
dp[i][j] = dp[i - 1][j] * (1 - p[i - 1])
... | false | 14.285714 | [
"-p = list(map(float, input().split()))",
"-dp = [[0 for i in range(N + 1)] for j in range(N + 1)]",
"-dp[0][0] = 1",
"+(*p,) = list(map(float, input().split()))",
"+dp = [[0] * (N + 1) for _ in range(N + 1)]",
"+ if i == 1:",
"+ dp[i][0] = 1 - p[0]",
"+ dp[i][1] = p[0]",
"+ ... | false | 0.036239 | 0.078931 | 0.459119 | [
"s292341787",
"s125199703"
] |
u509739538 | p02708 | python | s474446254 | s044034059 | 102 | 60 | 9,200 | 9,168 | Accepted | Accepted | 41.18 | n,k=list(map(int,input().split()))
s=0
for i in range(k,n+2):
s+=i*(2*n-i+1)//2+1-(i*(i-1))//2
print((s%(1000000007))) | n,k=list(map(int,input().split()))
s=0
for i in range(k,n+2):
s+=i*(n-i+1)+1
print((s%(1000000007))) | 5 | 5 | 121 | 103 | n, k = list(map(int, input().split()))
s = 0
for i in range(k, n + 2):
s += i * (2 * n - i + 1) // 2 + 1 - (i * (i - 1)) // 2
print((s % (1000000007)))
| n, k = list(map(int, input().split()))
s = 0
for i in range(k, n + 2):
s += i * (n - i + 1) + 1
print((s % (1000000007)))
| false | 0 | [
"- s += i * (2 * n - i + 1) // 2 + 1 - (i * (i - 1)) // 2",
"+ s += i * (n - i + 1) + 1"
] | false | 0.106689 | 0.051937 | 2.054195 | [
"s474446254",
"s044034059"
] |
u257162238 | p02793 | python | s984339758 | s880874644 | 1,958 | 719 | 6,100 | 24,768 | Accepted | Accepted | 63.28 | import fractions
def modinv(a, MOD=1000000007):
b = MOD
u = 1
v = 0
while b > 0:
t = a // b
a -= (t * b)
tmp = a
a = b
b = tmp
u -= (t * v)
tmp = u
u = v
v = tmp
u %= MOD
if u < 0:
u += MOD
re... | import collections
def modinv(n, p):
"""
逆元のmod pを求める
"""
if n >= p:
raise ValueError('p must be larger than n')
return pow(n, p-2, p)
def prime_sieve(n):
"""
n以下の素数を昇順に列挙する
エラトステネスの篩 計算量O(Nlog(log(N)))
"""
is_prime = [True for i in range(n+1)]
i... | 47 | 94 | 918 | 2,307 | import fractions
def modinv(a, MOD=1000000007):
b = MOD
u = 1
v = 0
while b > 0:
t = a // b
a -= t * b
tmp = a
a = b
b = tmp
u -= t * v
tmp = u
u = v
v = tmp
u %= MOD
if u < 0:
u += MOD
return u
def lcm(a, b,... | import collections
def modinv(n, p):
"""
逆元のmod pを求める
"""
if n >= p:
raise ValueError("p must be larger than n")
return pow(n, p - 2, p)
def prime_sieve(n):
"""
n以下の素数を昇順に列挙する
エラトステネスの篩 計算量O(Nlog(log(N)))
"""
is_prime = [True for i in range(n + 1)]
is_prime[0] = F... | false | 50 | [
"-import fractions",
"+import collections",
"-def modinv(a, MOD=1000000007):",
"- b = MOD",
"- u = 1",
"- v = 0",
"- while b > 0:",
"- t = a // b",
"- a -= t * b",
"- tmp = a",
"- a = b",
"- b = tmp",
"- u -= t * v",
"- tmp = u",... | false | 0.05658 | 1.171342 | 0.048304 | [
"s984339758",
"s880874644"
] |
u785578220 | p02548 | python | s051214550 | s621268370 | 1,755 | 134 | 9,176 | 9,080 | Accepted | Accepted | 92.36 | n = int(eval(input()))
ans = 0
t = 0
J = 0
for i in range(1,n):
for j in range(i,n):
if i*j >= n:break
if i == j : t+=1
ans +=1
J = j
print((2*ans -t))
| n = int(eval(input()))-1
ans = 0
t = 0
J = 0
for i in range(1,n+1): ans += n//(i)
print(ans) | 13 | 6 | 194 | 92 | n = int(eval(input()))
ans = 0
t = 0
J = 0
for i in range(1, n):
for j in range(i, n):
if i * j >= n:
break
if i == j:
t += 1
ans += 1
J = j
print((2 * ans - t))
| n = int(eval(input())) - 1
ans = 0
t = 0
J = 0
for i in range(1, n + 1):
ans += n // (i)
print(ans)
| false | 53.846154 | [
"-n = int(eval(input()))",
"+n = int(eval(input())) - 1",
"-for i in range(1, n):",
"- for j in range(i, n):",
"- if i * j >= n:",
"- break",
"- if i == j:",
"- t += 1",
"- ans += 1",
"- J = j",
"-print((2 * ans - t))",
"+for i in range(1, n... | false | 0.357726 | 0.05472 | 6.53741 | [
"s051214550",
"s621268370"
] |
u298297089 | p03241 | python | s255690954 | s137893582 | 557 | 176 | 40,044 | 38,768 | Accepted | Accepted | 68.4 | N, M = list(map(int, input().split()))
ceil = M // N
for i in range(1,ceil+1)[::-1]:
tmp = M - i * (N - 1)
if tmp > 0 and tmp % i == 0:
print(i)
break
| def make_divisors(n):
divisors = []
for i in range(1, int(n**0.5)+1):
if n % i == 0:
divisors.append([i,n//i])
if i != n // i:
divisors.append([n//i, i])
# divisors.sort()
return divisors
N, M = list(map(int, input().split()))
ceil = M // N
... | 7 | 19 | 175 | 442 | N, M = list(map(int, input().split()))
ceil = M // N
for i in range(1, ceil + 1)[::-1]:
tmp = M - i * (N - 1)
if tmp > 0 and tmp % i == 0:
print(i)
break
| def make_divisors(n):
divisors = []
for i in range(1, int(n**0.5) + 1):
if n % i == 0:
divisors.append([i, n // i])
if i != n // i:
divisors.append([n // i, i])
# divisors.sort()
return divisors
N, M = list(map(int, input().split()))
ceil = M // N
diviso... | false | 63.157895 | [
"+def make_divisors(n):",
"+ divisors = []",
"+ for i in range(1, int(n**0.5) + 1):",
"+ if n % i == 0:",
"+ divisors.append([i, n // i])",
"+ if i != n // i:",
"+ divisors.append([n // i, i])",
"+ # divisors.sort()",
"+ return divisors",
"+"... | false | 0.041221 | 0.037136 | 1.110025 | [
"s255690954",
"s137893582"
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.