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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
u088553842 | p02899 | python | s399756611 | s452496417 | 1,099 | 124 | 25,084 | 24,356 | Accepted | Accepted | 88.72 | from operator import itemgetter
n = int(eval(input()))
lst = list(map(int, input().split()))
lst2 = []
for i in range(n):
lst2.append((i + 1, lst[i]))
lst2.sort(key=itemgetter(1))
s = ''
for i in lst2:
s = s + str(i[0]) + ' '
print((s[:-1])) | n = int(eval(input()))
lst = list(map(int, input().split()))
dic = {}
for i in range(n):
dic[lst[i]] = i + 1
s = ''
for i in range(n):
s += str(dic[i + 1]) + ' '
print((s[:-1])) | 11 | 9 | 247 | 181 | from operator import itemgetter
n = int(eval(input()))
lst = list(map(int, input().split()))
lst2 = []
for i in range(n):
lst2.append((i + 1, lst[i]))
lst2.sort(key=itemgetter(1))
s = ""
for i in lst2:
s = s + str(i[0]) + " "
print((s[:-1]))
| n = int(eval(input()))
lst = list(map(int, input().split()))
dic = {}
for i in range(n):
dic[lst[i]] = i + 1
s = ""
for i in range(n):
s += str(dic[i + 1]) + " "
print((s[:-1]))
| false | 18.181818 | [
"-from operator import itemgetter",
"-",
"-lst2 = []",
"+dic = {}",
"- lst2.append((i + 1, lst[i]))",
"-lst2.sort(key=itemgetter(1))",
"+ dic[lst[i]] = i + 1",
"-for i in lst2:",
"- s = s + str(i[0]) + \" \"",
"+for i in range(n):",
"+ s += str(dic[i + 1]) + \" \""
] | false | 0.036093 | 0.036586 | 0.986523 | [
"s399756611",
"s452496417"
] |
u417096287 | p02911 | python | s928532869 | s355481998 | 549 | 198 | 55,896 | 76,492 | Accepted | Accepted | 63.93 | N, K, Q = list(map(int, input().split()))
A = [int(eval(input())) for _ in range(Q)]
points = [K - Q] * N
for i in A:
points[i - 1] += 1
for p in points:
if p > 0:
print("Yes")
else:
print("No") | def INT():
return int(eval(input()))
def MI():
return list(map(int, input().split()))
def LI():
return list(map(int, input().split()))
N, K, Q = MI()
A = [K - Q] * N
for i in range(Q):
A_i = INT()
A[A_i - 1] += 1
for a in A:
print(("Yes" if a > 0 else "No")) | 12 | 18 | 223 | 294 | N, K, Q = list(map(int, input().split()))
A = [int(eval(input())) for _ in range(Q)]
points = [K - Q] * N
for i in A:
points[i - 1] += 1
for p in points:
if p > 0:
print("Yes")
else:
print("No")
| def INT():
return int(eval(input()))
def MI():
return list(map(int, input().split()))
def LI():
return list(map(int, input().split()))
N, K, Q = MI()
A = [K - Q] * N
for i in range(Q):
A_i = INT()
A[A_i - 1] += 1
for a in A:
print(("Yes" if a > 0 else "No"))
| false | 33.333333 | [
"-N, K, Q = list(map(int, input().split()))",
"-A = [int(eval(input())) for _ in range(Q)]",
"-points = [K - Q] * N",
"-for i in A:",
"- points[i - 1] += 1",
"-for p in points:",
"- if p > 0:",
"- print(\"Yes\")",
"- else:",
"- print(\"No\")",
"+def INT():",
"+ return... | false | 0.053765 | 0.04159 | 1.29272 | [
"s928532869",
"s355481998"
] |
u332906195 | p02702 | python | s477317582 | s765214295 | 158 | 73 | 81,060 | 77,336 | Accepted | Accepted | 53.8 | def modpow(d, b, p, mod=2019):
ret = 1
while p > 0:
if p % 2 == 1:
ret = ret * b % mod
b = b * b % mod
p //= 2
return (d * ret) % mod
S = eval(input())
C = [0]
for i in range(len(S)):
C.append((C[-1] + modpow(int(S[-(i + 1)]), 10, i)) % 2019)
Cd = {}
... | S = eval(input())
mS, m10, mSd = [0], 1, {}
for i in range(len(S)):
mS.append((mS[-1] + int(S[-(i + 1)]) * m10) % 2019)
m10 = (m10 * 10) % 2019
for s in mS[1:]:
mSd[s] = mSd.get(s, 0) + 1
print((mSd.get(0, 0) + sum([v * (v - 1) // 2 for v in list(mSd.values())])))
| 18 | 8 | 428 | 270 | def modpow(d, b, p, mod=2019):
ret = 1
while p > 0:
if p % 2 == 1:
ret = ret * b % mod
b = b * b % mod
p //= 2
return (d * ret) % mod
S = eval(input())
C = [0]
for i in range(len(S)):
C.append((C[-1] + modpow(int(S[-(i + 1)]), 10, i)) % 2019)
Cd = {}
for c in C[1:]:... | S = eval(input())
mS, m10, mSd = [0], 1, {}
for i in range(len(S)):
mS.append((mS[-1] + int(S[-(i + 1)]) * m10) % 2019)
m10 = (m10 * 10) % 2019
for s in mS[1:]:
mSd[s] = mSd.get(s, 0) + 1
print((mSd.get(0, 0) + sum([v * (v - 1) // 2 for v in list(mSd.values())])))
| false | 55.555556 | [
"-def modpow(d, b, p, mod=2019):",
"- ret = 1",
"- while p > 0:",
"- if p % 2 == 1:",
"- ret = ret * b % mod",
"- b = b * b % mod",
"- p //= 2",
"- return (d * ret) % mod",
"-",
"-",
"-C = [0]",
"+mS, m10, mSd = [0], 1, {}",
"- C.append((C[-1] + mo... | false | 0.038242 | 0.047083 | 0.812228 | [
"s477317582",
"s765214295"
] |
u969190727 | p03108 | python | s653531190 | s855345616 | 705 | 579 | 28,636 | 22,948 | Accepted | Accepted | 17.87 |
n,m=map(int,input().split())
A=[]
par=[-1]*n
def find(x):
if par[x]<0:
return x
else:
par[x]=find(par[x])
return par[x]
def unite(x,y):
x=find(x)
y=find(y)
if x==y:
return False
else:
if par[x]>par[y]:
x,y=y,x
par[x]+=par[y]
par[y]=x
return True
de... | import sys
input=lambda: sys.stdin.readline().rstrip()
n,m=list(map(int,input().split()))
par=[-1]*n
def find(x):
if par[x]<0:
return x
else:
par[x]=find(par[x])
return par[x]
def unite(x,y):
x=find(x)
y=find(y)
if x==y:
return False
else:
if par[x]>par[y]:
x,y=y... | 39 | 43 | 674 | 747 | n, m = map(int, input().split())
A = []
par = [-1] * n
def find(x):
if par[x] < 0:
return x
else:
par[x] = find(par[x])
return par[x]
def unite(x, y):
x = find(x)
y = find(y)
if x == y:
return False
else:
if par[x] > par[y]:
x, y = y, x
... | import sys
input = lambda: sys.stdin.readline().rstrip()
n, m = list(map(int, input().split()))
par = [-1] * n
def find(x):
if par[x] < 0:
return x
else:
par[x] = find(par[x])
return par[x]
def unite(x, y):
x = find(x)
y = find(y)
if x == y:
return False
else... | false | 9.302326 | [
"-n, m = map(int, input().split())",
"-A = []",
"+import sys",
"+",
"+input = lambda: sys.stdin.readline().rstrip()",
"+n, m = list(map(int, input().split()))",
"+AB = []",
"- a, b = map(int, input().split())",
"- A.append([a, b])",
"-A = A[::-1]",
"-ans = n * (n - 1) // 2",
"-Ans = [ans... | false | 0.118831 | 0.070485 | 1.685904 | [
"s653531190",
"s855345616"
] |
u290563917 | p02880 | python | s015078642 | s075768858 | 172 | 58 | 38,384 | 61,844 | Accepted | Accepted | 66.28 | import sys
n = int(eval(input()))
for i in range(1, 10):
for j in range(1, 10):
if i * j == n:
print('Yes')
sys.exit(0)
print('No') | n = int(eval(input()))
for i in range(1, 10):
for j in range(1, 10):
if n == (i * j):
print('Yes')
exit(0)
print('No') | 9 | 9 | 152 | 140 | import sys
n = int(eval(input()))
for i in range(1, 10):
for j in range(1, 10):
if i * j == n:
print("Yes")
sys.exit(0)
print("No")
| n = int(eval(input()))
for i in range(1, 10):
for j in range(1, 10):
if n == (i * j):
print("Yes")
exit(0)
print("No")
| false | 0 | [
"-import sys",
"-",
"- if i * j == n:",
"+ if n == (i * j):",
"- sys.exit(0)",
"+ exit(0)"
] | false | 0.036873 | 0.036933 | 0.998383 | [
"s015078642",
"s075768858"
] |
u936985471 | p03645 | python | s133686230 | s208978127 | 928 | 601 | 47,932 | 19,024 | Accepted | Accepted | 35.24 | N,M=list(map(int,input().split()))
E=[[] for i in range(N)]
for i in range(M):
a,b=list(map(int,input().split()))
a,b=a-1,b-1
E[a].append(b)
E[b].append(a)
if N==1:
print("POSSIBLE")
exit(0)
stack=[]
stack.append([0,2,-1])
while stack:
node=stack.pop()
v=node[0]
ship=node[1]
pa... | N,M=list(map(int,input().split()))
from1=set()
toN=set()
for i in range(M):
a,b=list(map(int,input().split()))
if a==1:
from1.add(b)
elif b==N:
toN.add(a)
print((("","IM")[len(from1&toN)==0]+"POSSIBLE"))
| 31 | 11 | 554 | 216 | N, M = list(map(int, input().split()))
E = [[] for i in range(N)]
for i in range(M):
a, b = list(map(int, input().split()))
a, b = a - 1, b - 1
E[a].append(b)
E[b].append(a)
if N == 1:
print("POSSIBLE")
exit(0)
stack = []
stack.append([0, 2, -1])
while stack:
node = stack.pop()
v = node[... | N, M = list(map(int, input().split()))
from1 = set()
toN = set()
for i in range(M):
a, b = list(map(int, input().split()))
if a == 1:
from1.add(b)
elif b == N:
toN.add(a)
print((("", "IM")[len(from1 & toN) == 0] + "POSSIBLE"))
| false | 64.516129 | [
"-E = [[] for i in range(N)]",
"+from1 = set()",
"+toN = set()",
"- a, b = a - 1, b - 1",
"- E[a].append(b)",
"- E[b].append(a)",
"-if N == 1:",
"- print(\"POSSIBLE\")",
"- exit(0)",
"-stack = []",
"-stack.append([0, 2, -1])",
"-while stack:",
"- node = stack.pop()",
"- ... | false | 0.047416 | 0.088349 | 0.536697 | [
"s133686230",
"s208978127"
] |
u155024797 | p03608 | python | s385217337 | s308335618 | 801 | 494 | 99,416 | 61,016 | Accepted | Accepted | 38.33 | def warshall_floyd(paths, N):
for k in range(N):
for i in range(N):
for j in range(N):
paths[i][j] = min(paths[i][j], paths[i][k] + paths[k][j])
def iter_patterns(l):
if len(l) == 1:
return [l]
patterns = []
for i in range(len(l)):
patter... | import itertools
INF = float("inf")
def main():
N, M, R = list(map(int, input().split()))
r = list(map(int, input().split()))
path = [[INF]*(N+1) for _ in range(N+1)]
for _ in range(M):
A, B, C = list(map(int, input().split()))
path[A][B] = C
path[B][A] = C
fo... | 38 | 30 | 1,008 | 758 | def warshall_floyd(paths, N):
for k in range(N):
for i in range(N):
for j in range(N):
paths[i][j] = min(paths[i][j], paths[i][k] + paths[k][j])
def iter_patterns(l):
if len(l) == 1:
return [l]
patterns = []
for i in range(len(l)):
patterns += [[l[i]... | import itertools
INF = float("inf")
def main():
N, M, R = list(map(int, input().split()))
r = list(map(int, input().split()))
path = [[INF] * (N + 1) for _ in range(N + 1)]
for _ in range(M):
A, B, C = list(map(int, input().split()))
path[A][B] = C
path[B][A] = C
for i in ... | false | 21.052632 | [
"-def warshall_floyd(paths, N):",
"- for k in range(N):",
"- for i in range(N):",
"- for j in range(N):",
"- paths[i][j] = min(paths[i][j], paths[i][k] + paths[k][j])",
"+import itertools",
"-",
"-def iter_patterns(l):",
"- if len(l) == 1:",
"- return ... | false | 0.042252 | 0.036053 | 1.171957 | [
"s385217337",
"s308335618"
] |
u401487574 | p03111 | python | s914970100 | s006406128 | 1,556 | 282 | 3,064 | 3,064 | Accepted | Accepted | 81.88 | n,a,b,c = list(map(int,input().split()))
L = []
for i in range(n):
L.append(int(eval(input())))
import itertools
ans = 10**9
tmp = 0
for perm in itertools.permutations(list(range(n)),3):
ua,ub,uc = perm
la,lb,lc = L[ua],L[ub],L[uc]
for use in itertools.product([0,1,2,-1] ,repeat=n-3):
... | n,a,b,c = list(map(int,input().split()))
L = []
for i in range(n):
L.append(int(eval(input())))
import itertools
ans = 10**9
tmp = 0
for use in itertools.product([0,1,2,-1] ,repeat=n):
tmp = 0
ls = [0,0,0]
for idx,u in enumerate(use):
if u>-1:
if ls[u] >0:
... | 25 | 20 | 699 | 496 | n, a, b, c = list(map(int, input().split()))
L = []
for i in range(n):
L.append(int(eval(input())))
import itertools
ans = 10**9
tmp = 0
for perm in itertools.permutations(list(range(n)), 3):
ua, ub, uc = perm
la, lb, lc = L[ua], L[ub], L[uc]
for use in itertools.product([0, 1, 2, -1], repeat=n - 3):
... | n, a, b, c = list(map(int, input().split()))
L = []
for i in range(n):
L.append(int(eval(input())))
import itertools
ans = 10**9
tmp = 0
for use in itertools.product([0, 1, 2, -1], repeat=n):
tmp = 0
ls = [0, 0, 0]
for idx, u in enumerate(use):
if u > -1:
if ls[u] > 0:
... | false | 20 | [
"-for perm in itertools.permutations(list(range(n)), 3):",
"- ua, ub, uc = perm",
"- la, lb, lc = L[ua], L[ub], L[uc]",
"- for use in itertools.product([0, 1, 2, -1], repeat=n - 3):",
"- idx = 0",
"- tmp = 0",
"- ls = [la, lb, lc]",
"- for i, l in enumerate(L):",
... | false | 1.38729 | 0.283382 | 4.89547 | [
"s914970100",
"s006406128"
] |
u077291787 | p03475 | python | s248544657 | s371081459 | 48 | 42 | 3,188 | 3,188 | Accepted | Accepted | 12.5 | # ABC084C - Special Trains
import sys
input = sys.stdin.readline
def main():
n = int(eval(input()))
arr = tuple(tuple(map(int, input().split())) for _ in range(n - 1))
for i in range(n):
cur = 0
for c, s, f in arr[i:]:
if cur <= s:
cur = s + c
... | # ABC084C - Special Trains
import sys
input = sys.stdin.readline
def main():
N = int(eval(input()))
A = tuple(tuple(map(int, input().split())) for _ in range(N - 1))
for i in range(N):
cur = 0
for c, s, f in A[i:]:
if cur <= s:
cur = s + c
... | 21 | 19 | 486 | 448 | # ABC084C - Special Trains
import sys
input = sys.stdin.readline
def main():
n = int(eval(input()))
arr = tuple(tuple(map(int, input().split())) for _ in range(n - 1))
for i in range(n):
cur = 0
for c, s, f in arr[i:]:
if cur <= s:
cur = s + c
elif ... | # ABC084C - Special Trains
import sys
input = sys.stdin.readline
def main():
N = int(eval(input()))
A = tuple(tuple(map(int, input().split())) for _ in range(N - 1))
for i in range(N):
cur = 0
for c, s, f in A[i:]:
if cur <= s:
cur = s + c
else:
... | false | 9.52381 | [
"- n = int(eval(input()))",
"- arr = tuple(tuple(map(int, input().split())) for _ in range(n - 1))",
"- for i in range(n):",
"+ N = int(eval(input()))",
"+ A = tuple(tuple(map(int, input().split())) for _ in range(N - 1))",
"+ for i in range(N):",
"- for c, s, f in arr[i:]:",
... | false | 0.045393 | 0.048419 | 0.937492 | [
"s248544657",
"s371081459"
] |
u991567869 | p03013 | python | s373814046 | s349562662 | 482 | 189 | 460,020 | 7,848 | Accepted | Accepted | 60.79 | n, m = list(map(int, input().split()))
a = [int(eval(input())) for _ in range(m)]
b = [1]*(n + 1)
for i in a:
b[i] = 0
for i in range(2, n + 1):
if b[i] != 0:
b[i] = b[i - 2] + b[i - 1]
print((b[-1]%(10**9 + 7))) | n, m = list(map(int, input().split()))
a = [int(eval(input())) for _ in range(m)]
b = [1]*(n + 1)
for i in a:
b[i] = 0
for i in range(2, n + 1):
if b[i] != 0:
b[i] = (b[i - 2] + b[i - 1])%(10**9 + 7)
print((b[-1])) | 12 | 12 | 228 | 230 | n, m = list(map(int, input().split()))
a = [int(eval(input())) for _ in range(m)]
b = [1] * (n + 1)
for i in a:
b[i] = 0
for i in range(2, n + 1):
if b[i] != 0:
b[i] = b[i - 2] + b[i - 1]
print((b[-1] % (10**9 + 7)))
| n, m = list(map(int, input().split()))
a = [int(eval(input())) for _ in range(m)]
b = [1] * (n + 1)
for i in a:
b[i] = 0
for i in range(2, n + 1):
if b[i] != 0:
b[i] = (b[i - 2] + b[i - 1]) % (10**9 + 7)
print((b[-1]))
| false | 0 | [
"- b[i] = b[i - 2] + b[i - 1]",
"-print((b[-1] % (10**9 + 7)))",
"+ b[i] = (b[i - 2] + b[i - 1]) % (10**9 + 7)",
"+print((b[-1]))"
] | false | 0.075755 | 0.080656 | 0.939236 | [
"s373814046",
"s349562662"
] |
u600402037 | p02721 | python | s011309883 | s703317902 | 320 | 201 | 26,824 | 41,388 | Accepted | Accepted | 37.19 | import sys
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
# 前からと後ろからでgreedyにcandに入れて両方の一致したところ
N, K, C = lr()
S = sr()
def choose(S):
cand = []
count = 0
cur = 0
while cur < len(S):
if S[cur] == 'o':
coun... | # coding: utf-8
import sys
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
N, K, C = lr()
S = sr()
# 左からと右からでそれぞれ貪欲、重なったところが必須
left = []; right = []
def work(S):
ret = []
cur = 0
count = 0
while count < K:
if S[cur] ... | 32 | 34 | 644 | 669 | import sys
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
# 前からと後ろからでgreedyにcandに入れて両方の一致したところ
N, K, C = lr()
S = sr()
def choose(S):
cand = []
count = 0
cur = 0
while cur < len(S):
if S[cur] == "o":
count += 1
... | # coding: utf-8
import sys
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
N, K, C = lr()
S = sr()
# 左からと右からでそれぞれ貪欲、重なったところが必須
left = []
right = []
def work(S):
ret = []
cur = 0
count = 0
while count < K:
if S[cur] == "o":
... | false | 5.882353 | [
"+# coding: utf-8",
"-# 前からと後ろからでgreedyにcandに入れて両方の一致したところ",
"+# 左からと右からでそれぞれ貪欲、重なったところが必須",
"+left = []",
"+right = []",
"-def choose(S):",
"- cand = []",
"+def work(S):",
"+ ret = []",
"+ cur = 0",
"- cur = 0",
"- while cur < len(S):",
"+ while count < K:",
"- ... | false | 0.075793 | 0.036337 | 2.085824 | [
"s011309883",
"s703317902"
] |
u052499405 | p02962 | python | s586357552 | s669102048 | 893 | 724 | 231,472 | 188,400 | Accepted | Accepted | 18.92 | class RollingHash():
def __init__(self, s):
self.length = len(s)
self.base1 = 1009
self.base2 = 1000
self.mod1 = 10**9 + 7
self.mod2 = 10**9 + 9
self.hash1 = [0] * (self.length + 1)
self.hash2 = [0] * (self.length + 1)
self.pow1 = [1] * (self.... | class RollingHash():
def __init__(self, s):
self.length = len(s)
self.base1 = 1009
self.base2 = 1013
self.mod1 = 10**9 + 7
self.mod2 = 10**9 + 9
self.hash1 = [0] * (self.length + 1)
self.hash2 = [0] * (self.length + 1)
self.pow1 = [1] * (self.... | 57 | 57 | 1,737 | 1,737 | class RollingHash:
def __init__(self, s):
self.length = len(s)
self.base1 = 1009
self.base2 = 1000
self.mod1 = 10**9 + 7
self.mod2 = 10**9 + 9
self.hash1 = [0] * (self.length + 1)
self.hash2 = [0] * (self.length + 1)
self.pow1 = [1] * (self.length + 1)... | class RollingHash:
def __init__(self, s):
self.length = len(s)
self.base1 = 1009
self.base2 = 1013
self.mod1 = 10**9 + 7
self.mod2 = 10**9 + 9
self.hash1 = [0] * (self.length + 1)
self.hash2 = [0] * (self.length + 1)
self.pow1 = [1] * (self.length + 1)... | false | 0 | [
"- self.base2 = 1000",
"+ self.base2 = 1013",
"-max_ans = (len(t) * 3) // len(s)",
"-t = t * 4",
"+max_ans = (len(t) * 2) // len(s)",
"+t = t * 3"
] | false | 0.046698 | 0.099199 | 0.470747 | [
"s586357552",
"s669102048"
] |
u690536347 | p02904 | python | s488903913 | s072350142 | 650 | 312 | 97,604 | 104,872 | Accepted | Accepted | 52 | from operator import add
import sys
input=sys.stdin.readline
class SegTree():
def __init__(self, N, e, operator_func=add):
self.e = e # 単位元
self.size = N
self.node = [self.e] * (2*N)
self.operator_func = operator_func # 処理(add or xor max minなど)
def set_list(self, l... | from operator import add
import sys
input=sys.stdin.readline
class SegTree():
def __init__(self, N, e, operator_func=add):
self.e = e # 単位元
self.size = N
self.node = [self.e] * (2*N)
self.operator_func = operator_func # 処理(add or xor max minなど)
def set_list(self, l... | 77 | 69 | 2,009 | 1,774 | from operator import add
import sys
input = sys.stdin.readline
class SegTree:
def __init__(self, N, e, operator_func=add):
self.e = e # 単位元
self.size = N
self.node = [self.e] * (2 * N)
self.operator_func = operator_func # 処理(add or xor max minなど)
def set_list(self, l):
... | from operator import add
import sys
input = sys.stdin.readline
class SegTree:
def __init__(self, N, e, operator_func=add):
self.e = e # 単位元
self.size = N
self.node = [self.e] * (2 * N)
self.operator_func = operator_func # 処理(add or xor max minなど)
def set_list(self, l):
... | false | 10.38961 | [
"-def solve():",
"- N, K = list(map(int, input().split()))",
"- (*P,) = list(map(int, input().split()))",
"- INF = 10**12",
"- tree_max = SegTree(N, -INF, operator_func=max)",
"- tree_max.set_list(P)",
"- tree_min = SegTree(N, INF, operator_func=min)",
"- tree_min.set_list(P)",
... | false | 0.042495 | 0.036225 | 1.173099 | [
"s488903913",
"s072350142"
] |
u440566786 | p02816 | python | s961059361 | s488140058 | 614 | 563 | 120,276 | 120,276 | Accepted | Accepted | 8.31 | import sys
sys.setrecursionlimit(2147483647)
INF = 1 << 60
MOD = 10**9 + 7 # 998244353
input = lambda:sys.stdin.readline().rstrip()
def Z(S):
n = len(S)
res = [0] * n
res[0] = n
l = r = 0
for i in range(1, n):
if res[i - l] < r - i: # 過去の結果が全て使える
res[i] = res[i - l]... | import sys
sys.setrecursionlimit(2147483647)
INF = 1 << 60
MOD = 10**9 + 7 # 998244353
input = lambda:sys.stdin.readline().rstrip()
def Z(S):
n = len(S)
res = [0] * n
res[0] = n
l = r = 0
for i in range(1, n):
if res[i - l] < r - i: # 過去の結果が全て使える
res[i] = res[i - l]... | 37 | 34 | 948 | 886 | import sys
sys.setrecursionlimit(2147483647)
INF = 1 << 60
MOD = 10**9 + 7 # 998244353
input = lambda: sys.stdin.readline().rstrip()
def Z(S):
n = len(S)
res = [0] * n
res[0] = n
l = r = 0
for i in range(1, n):
if res[i - l] < r - i: # 過去の結果が全て使える
res[i] = res[i - l]
... | import sys
sys.setrecursionlimit(2147483647)
INF = 1 << 60
MOD = 10**9 + 7 # 998244353
input = lambda: sys.stdin.readline().rstrip()
def Z(S):
n = len(S)
res = [0] * n
res[0] = n
l = r = 0
for i in range(1, n):
if res[i - l] < r - i: # 過去の結果が全て使える
res[i] = res[i - l]
... | false | 8.108108 | [
"- for k in range(n):",
"+ for k in range(n, 0, -1):",
"- res.append(((n - k) % n, A[0] ^ B[k]))",
"- res.sort()",
"- for pair in res:",
"- print((*pair))",
"+ print((n - k, A[n - k] ^ B[0]))"
] | false | 0.038994 | 0.037679 | 1.034888 | [
"s961059361",
"s488140058"
] |
u768993705 | p02881 | python | s468435303 | s171936177 | 498 | 385 | 12,392 | 3,060 | Accepted | Accepted | 22.69 | import sys
import numpy as np
N = int(eval(input()))
for i in range(int(np.sqrt(N)), 0, -1):
if N / i == int(N / i):
print((int(N / i + i - 2)))
sys.exit()
print((N - 1)) | import math
N = int(eval(input()))
for i in range(int(math.sqrt(N)), 0, -1):
if N / i == int(N / i):
print((int(N / i + i - 2)))
exit() | 8 | 6 | 181 | 146 | import sys
import numpy as np
N = int(eval(input()))
for i in range(int(np.sqrt(N)), 0, -1):
if N / i == int(N / i):
print((int(N / i + i - 2)))
sys.exit()
print((N - 1))
| import math
N = int(eval(input()))
for i in range(int(math.sqrt(N)), 0, -1):
if N / i == int(N / i):
print((int(N / i + i - 2)))
exit()
| false | 25 | [
"-import sys",
"-import numpy as np",
"+import math",
"-for i in range(int(np.sqrt(N)), 0, -1):",
"+for i in range(int(math.sqrt(N)), 0, -1):",
"- sys.exit()",
"-print((N - 1))",
"+ exit()"
] | false | 0.281048 | 0.044646 | 6.294991 | [
"s468435303",
"s171936177"
] |
u797673668 | p02471 | python | s071661028 | s548924530 | 40 | 20 | 7,768 | 7,760 | Accepted | Accepted | 50 | def gcd(a, b):
global queue
r = a % b
if r:
d = a // b
sb = queue.pop()
sa = queue.pop()
sc = tuple(map(lambda x, y: x - d * y, sa, sb))
queue.append(sb)
queue.append(sc)
return gcd(b, r)
else:
return b
a, b = list(map(int,... | def gcd(a, b):
global queue
r = a % b
if r:
d = a // b
sb = queue.pop()
sa = queue.pop()
queue.append(sb)
queue.append(tuple(map(lambda x, y: x - d * y, sa, sb)))
return gcd(b, r)
else:
return b
a, b = list(map(int, input().split())... | 20 | 18 | 415 | 377 | def gcd(a, b):
global queue
r = a % b
if r:
d = a // b
sb = queue.pop()
sa = queue.pop()
sc = tuple(map(lambda x, y: x - d * y, sa, sb))
queue.append(sb)
queue.append(sc)
return gcd(b, r)
else:
return b
a, b = list(map(int, input().split(... | def gcd(a, b):
global queue
r = a % b
if r:
d = a // b
sb = queue.pop()
sa = queue.pop()
queue.append(sb)
queue.append(tuple(map(lambda x, y: x - d * y, sa, sb)))
return gcd(b, r)
else:
return b
a, b = list(map(int, input().split()))
queue = [(1,... | false | 10 | [
"- sc = tuple(map(lambda x, y: x - d * y, sa, sb))",
"- queue.append(sc)",
"+ queue.append(tuple(map(lambda x, y: x - d * y, sa, sb)))",
"-queue = [(1, 0, a), (0, 1, b)]",
"+queue = [(1, 0), (0, 1)]",
"-x, y, r = queue.pop()",
"-print((x, y))",
"+print((*queue.pop()))"
] | false | 0.047722 | 0.110154 | 0.433228 | [
"s071661028",
"s548924530"
] |
u654661069 | p02379 | python | s708852948 | s326707084 | 20 | 10 | 5,652 | 4,700 | Accepted | Accepted | 50 | import math
x1,y1,x2,y2=list(map(float, input().split()))
p=math.sqrt((x1-x2)**2+(y1-y2)**2)
print(p)
| (n,m,o,p) = list(map(float, input().split()))
print(((n-o)**2 + (m-p)**2)**0.5)
| 4 | 2 | 99 | 78 | import math
x1, y1, x2, y2 = list(map(float, input().split()))
p = math.sqrt((x1 - x2) ** 2 + (y1 - y2) ** 2)
print(p)
| (n, m, o, p) = list(map(float, input().split()))
print(((n - o) ** 2 + (m - p) ** 2) ** 0.5)
| false | 50 | [
"-import math",
"-",
"-x1, y1, x2, y2 = list(map(float, input().split()))",
"-p = math.sqrt((x1 - x2) ** 2 + (y1 - y2) ** 2)",
"-print(p)",
"+(n, m, o, p) = list(map(float, input().split()))",
"+print(((n - o) ** 2 + (m - p) ** 2) ** 0.5)"
] | false | 0.05162 | 0.07431 | 0.694661 | [
"s708852948",
"s326707084"
] |
u733814820 | p03796 | python | s947961159 | s366129258 | 44 | 38 | 2,940 | 9,152 | Accepted | Accepted | 13.64 | import sys
def dfs():
return
def resolve():
N = int(eval(input()))
power = 1
for i in range(N):
power *= (i+1)
power %= int((1e+9 + 7))
print(power)
if __name__ == "__main__":
resolve()
| def resolve():
n = int(eval(input()))
ans = 1
for i in range(1, n+1):
ans *= i
ans %= 1000000007
print(ans)
return
if __name__ == "__main__":
resolve()
| 18 | 11 | 243 | 177 | import sys
def dfs():
return
def resolve():
N = int(eval(input()))
power = 1
for i in range(N):
power *= i + 1
power %= int((1e9 + 7))
print(power)
if __name__ == "__main__":
resolve()
| def resolve():
n = int(eval(input()))
ans = 1
for i in range(1, n + 1):
ans *= i
ans %= 1000000007
print(ans)
return
if __name__ == "__main__":
resolve()
| false | 38.888889 | [
"-import sys",
"-",
"-",
"-def dfs():",
"+def resolve():",
"+ n = int(eval(input()))",
"+ ans = 1",
"+ for i in range(1, n + 1):",
"+ ans *= i",
"+ ans %= 1000000007",
"+ print(ans)",
"-",
"-",
"-def resolve():",
"- N = int(eval(input()))",
"- power = 1"... | false | 0.049054 | 0.071175 | 0.689205 | [
"s947961159",
"s366129258"
] |
u668503853 | p03425 | python | s665116916 | s149248595 | 153 | 137 | 3,864 | 3,864 | Accepted | Accepted | 10.46 | N=int(eval(input()))
name=[input()[0] for _ in range(N)]
m,a,r,c,h=name.count("M"),name.count("A"),name.count("R"),name.count("C"),name.count("H")
print((m*a*(r+c+h)+m*r*(c+h)+m*c*h+a*r*(c+h)+a*c*h+r*c*h)) | N=int(eval(input()))
n=[input()[0] for _ in range(N)]
m,a,r,c,h=n.count("M"),n.count("A"),n.count("R"),n.count("C"),n.count("H")
print((m*a*(r+c+h)+m*r*(c+h)+m*c*h+a*r*(c+h)+a*c*h+r*c*h)) | 4 | 4 | 200 | 182 | N = int(eval(input()))
name = [input()[0] for _ in range(N)]
m, a, r, c, h = (
name.count("M"),
name.count("A"),
name.count("R"),
name.count("C"),
name.count("H"),
)
print(
(
m * a * (r + c + h)
+ m * r * (c + h)
+ m * c * h
+ a * r * (c + h)
+ a * c * h
... | N = int(eval(input()))
n = [input()[0] for _ in range(N)]
m, a, r, c, h = n.count("M"), n.count("A"), n.count("R"), n.count("C"), n.count("H")
print(
(
m * a * (r + c + h)
+ m * r * (c + h)
+ m * c * h
+ a * r * (c + h)
+ a * c * h
+ r * c * h
)
)
| false | 0 | [
"-name = [input()[0] for _ in range(N)]",
"-m, a, r, c, h = (",
"- name.count(\"M\"),",
"- name.count(\"A\"),",
"- name.count(\"R\"),",
"- name.count(\"C\"),",
"- name.count(\"H\"),",
"-)",
"+n = [input()[0] for _ in range(N)]",
"+m, a, r, c, h = n.count(\"M\"), n.count(\"A\"), n.co... | false | 0.063167 | 0.064809 | 0.974655 | [
"s665116916",
"s149248595"
] |
u222668979 | p02550 | python | s547155960 | s999614193 | 763 | 74 | 80,444 | 77,344 | Accepted | Accepted | 90.3 | n, x, m = list(map(int, input().split()))
num, lst = set(), []
for i in range(n):
num.add(x), lst.append(x)
x = x ** 2 % m
if x in lst:
cnt, idx = i + 1, lst.index(x)
break
ans = sum(num)
if x in lst:
div, mod = divmod(n - cnt, len(lst) - idx)
ans += sum(lst[idx:]) * d... | n, x, m = list(map(int, input().split()))
num, lst = set(), []
for i in range(n):
num.add(x), lst.append(x)
x = x ** 2 % m
if x in num:
cnt, idx = i + 1, lst.index(x)
break
ans = sum(num)
if x in num:
div, mod = divmod(n - cnt, len(lst) - idx)
ans += sum(lst[idx:]) * d... | 16 | 16 | 365 | 365 | n, x, m = list(map(int, input().split()))
num, lst = set(), []
for i in range(n):
num.add(x), lst.append(x)
x = x**2 % m
if x in lst:
cnt, idx = i + 1, lst.index(x)
break
ans = sum(num)
if x in lst:
div, mod = divmod(n - cnt, len(lst) - idx)
ans += sum(lst[idx:]) * div
ans += sum... | n, x, m = list(map(int, input().split()))
num, lst = set(), []
for i in range(n):
num.add(x), lst.append(x)
x = x**2 % m
if x in num:
cnt, idx = i + 1, lst.index(x)
break
ans = sum(num)
if x in num:
div, mod = divmod(n - cnt, len(lst) - idx)
ans += sum(lst[idx:]) * div
ans += sum... | false | 0 | [
"- if x in lst:",
"+ if x in num:",
"-if x in lst:",
"+if x in num:"
] | false | 0.054647 | 0.04448 | 1.228568 | [
"s547155960",
"s999614193"
] |
u117327911 | p02647 | python | s930497298 | s869859862 | 525 | 309 | 170,692 | 149,636 | Accepted | Accepted | 41.14 | import math
from sys import stdin,stdout
#% 998244353
from heapq import heapify,heappop,heappush
import collections
n,k=list(map(int,stdin.readline().split()))
a=list(map(int,stdin.readline().split()))
for i in range(min(k,100)):
#nw=[0]*n
pr=[0]*n
for x,d in enumerate(a):
if d==0:
... | import math
from sys import stdin,stdout
#% 998244353
from heapq import heapify,heappop,heappush
import collections
n,k=list(map(int,stdin.readline().split()))
a=list(map(int,stdin.readline().split()))
for i in range(min(k,42)):
#nw=[0]*n
pr=[0]*n
for x,d in enumerate(a):
if d==0:
... | 37 | 37 | 699 | 698 | import math
from sys import stdin, stdout
#% 998244353
from heapq import heapify, heappop, heappush
import collections
n, k = list(map(int, stdin.readline().split()))
a = list(map(int, stdin.readline().split()))
for i in range(min(k, 100)):
# nw=[0]*n
pr = [0] * n
for x, d in enumerate(a):
if d ==... | import math
from sys import stdin, stdout
#% 998244353
from heapq import heapify, heappop, heappush
import collections
n, k = list(map(int, stdin.readline().split()))
a = list(map(int, stdin.readline().split()))
for i in range(min(k, 42)):
# nw=[0]*n
pr = [0] * n
for x, d in enumerate(a):
if d == ... | false | 0 | [
"-for i in range(min(k, 100)):",
"+for i in range(min(k, 42)):"
] | false | 0.044336 | 0.100949 | 0.439198 | [
"s930497298",
"s869859862"
] |
u222668979 | p03031 | python | s358736814 | s888386181 | 39 | 35 | 9,156 | 9,196 | Accepted | Accepted | 10.26 | from itertools import product
n, m = list(map(int, input().split()))
ks = [list(map(int, input().split())) for _ in range(m)]
p = list(map(int, input().split()))
cnt = 0
for pat in product([0, 1], repeat=n):
for i, ksi in enumerate(ks):
tmp = sum(pat[ksi[j + 1] - 1] for j in range(ksi[0]))
... | from itertools import product
n, m = list(map(int, input().split()))
ks = [list(map(int, input().split())) for _ in range(m)]
p = list(map(int, input().split()))
cnt = 0
for pat in product([0, 1], repeat=n):
for ksi, pi in zip(ks, p):
tmp = sum(pat[ksij - 1] for ksij in ksi[1:])
if tmp ... | 15 | 15 | 398 | 385 | from itertools import product
n, m = list(map(int, input().split()))
ks = [list(map(int, input().split())) for _ in range(m)]
p = list(map(int, input().split()))
cnt = 0
for pat in product([0, 1], repeat=n):
for i, ksi in enumerate(ks):
tmp = sum(pat[ksi[j + 1] - 1] for j in range(ksi[0]))
if tmp %... | from itertools import product
n, m = list(map(int, input().split()))
ks = [list(map(int, input().split())) for _ in range(m)]
p = list(map(int, input().split()))
cnt = 0
for pat in product([0, 1], repeat=n):
for ksi, pi in zip(ks, p):
tmp = sum(pat[ksij - 1] for ksij in ksi[1:])
if tmp % 2 != pi:
... | false | 0 | [
"- for i, ksi in enumerate(ks):",
"- tmp = sum(pat[ksi[j + 1] - 1] for j in range(ksi[0]))",
"- if tmp % 2 != p[i]:",
"+ for ksi, pi in zip(ks, p):",
"+ tmp = sum(pat[ksij - 1] for ksij in ksi[1:])",
"+ if tmp % 2 != pi:"
] | false | 0.050215 | 0.05076 | 0.989273 | [
"s358736814",
"s888386181"
] |
u298297089 | p03162 | python | s101266760 | s330207632 | 539 | 465 | 22,752 | 3,060 | Accepted | Accepted | 13.73 | n = int(eval(input()))
dp = [[0 for i in range(3)]]
for i in range(1,n+1):
a,b,c = list(map(int, input().split()))
x = max(dp[i-1][1] + a, dp[i-1][2] + a)
y = max(dp[i-1][2] + b, dp[i-1][0] + b)
z = max(dp[i-1][0] + c, dp[i-1][1] + c)
dp.append([x,y,z])
print((max(dp[n])))
| n = int(eval(input()))
dp = [0 for i in range(3)]
for i in range(1,n+1):
a,b,c = list(map(int, input().split()))
x = max(dp[1] + a, dp[2] + a)
y = max(dp[2] + b, dp[0] + b)
z = max(dp[0] + c, dp[1] + c)
dp = [x,y,z]
print((max(dp)))
| 10 | 10 | 290 | 249 | n = int(eval(input()))
dp = [[0 for i in range(3)]]
for i in range(1, n + 1):
a, b, c = list(map(int, input().split()))
x = max(dp[i - 1][1] + a, dp[i - 1][2] + a)
y = max(dp[i - 1][2] + b, dp[i - 1][0] + b)
z = max(dp[i - 1][0] + c, dp[i - 1][1] + c)
dp.append([x, y, z])
print((max(dp[n])))
| n = int(eval(input()))
dp = [0 for i in range(3)]
for i in range(1, n + 1):
a, b, c = list(map(int, input().split()))
x = max(dp[1] + a, dp[2] + a)
y = max(dp[2] + b, dp[0] + b)
z = max(dp[0] + c, dp[1] + c)
dp = [x, y, z]
print((max(dp)))
| false | 0 | [
"-dp = [[0 for i in range(3)]]",
"+dp = [0 for i in range(3)]",
"- x = max(dp[i - 1][1] + a, dp[i - 1][2] + a)",
"- y = max(dp[i - 1][2] + b, dp[i - 1][0] + b)",
"- z = max(dp[i - 1][0] + c, dp[i - 1][1] + c)",
"- dp.append([x, y, z])",
"-print((max(dp[n])))",
"+ x = max(dp[1] + a, dp[2... | false | 0.044032 | 0.106215 | 0.414558 | [
"s101266760",
"s330207632"
] |
u843175622 | p02768 | python | s997913792 | s685303639 | 1,292 | 126 | 9,132 | 9,172 | Accepted | Accepted | 90.25 | n, a, b = list(map(int, input().split()))
# 全通り - nCa - nCb
mod = 10 ** 9 + 7
def inv(x):
return pow(x, mod - 2, mod)
# n ~ n - k + 1
def c(n, k):
res = 1
for i in range(0, k):
res = res * (n - i) * inv(i + 1) % mod
return res
print((((pow(2, n, mod) - c(n, a) - c(n, b) ... | n, a, b = list(map(int, input().split()))
mod = 10 ** 9 + 7
def inv(x):
return pow(x, mod - 2, mod)
def c(n, k):
ue, sita = 1, 1
for i in range(0, k):
ue = ue * (n - i) % mod
sita = sita * (i + 1) % mod
return ue * inv(sita) % mod
print((((pow(2, n, mod) - c(n, a) - c(n... | 19 | 15 | 338 | 343 | n, a, b = list(map(int, input().split()))
# 全通り - nCa - nCb
mod = 10**9 + 7
def inv(x):
return pow(x, mod - 2, mod)
# n ~ n - k + 1
def c(n, k):
res = 1
for i in range(0, k):
res = res * (n - i) * inv(i + 1) % mod
return res
print((((pow(2, n, mod) - c(n, a) - c(n, b) - 1) % mod + mod) % m... | n, a, b = list(map(int, input().split()))
mod = 10**9 + 7
def inv(x):
return pow(x, mod - 2, mod)
def c(n, k):
ue, sita = 1, 1
for i in range(0, k):
ue = ue * (n - i) % mod
sita = sita * (i + 1) % mod
return ue * inv(sita) % mod
print((((pow(2, n, mod) - c(n, a) - c(n, b) - 1) % mo... | false | 21.052632 | [
"-# 全通り - nCa - nCb",
"-# n ~ n - k + 1",
"- res = 1",
"+ ue, sita = 1, 1",
"- res = res * (n - i) * inv(i + 1) % mod",
"- return res",
"+ ue = ue * (n - i) % mod",
"+ sita = sita * (i + 1) % mod",
"+ return ue * inv(sita) % mod"
] | false | 0.459504 | 0.119444 | 3.847041 | [
"s997913792",
"s685303639"
] |
u021019433 | p02873 | python | s948891577 | s397233671 | 247 | 218 | 4,468 | 4,468 | Accepted | Accepted | 11.74 | from itertools import groupby
r = p = 0
for k, g in groupby(eval(input())):
for i, _ in enumerate(g, 1):
r += i
if k == '>':
r -= min(i, p)
p = i
print(r) | from itertools import groupby
r = p = 0
for k, g in groupby(eval(input())):
i = 0
for _ in g:
i += 1
r += i
if k == '>':
r -= min(i, p)
p = i
print(r)
| 10 | 12 | 187 | 198 | from itertools import groupby
r = p = 0
for k, g in groupby(eval(input())):
for i, _ in enumerate(g, 1):
r += i
if k == ">":
r -= min(i, p)
p = i
print(r)
| from itertools import groupby
r = p = 0
for k, g in groupby(eval(input())):
i = 0
for _ in g:
i += 1
r += i
if k == ">":
r -= min(i, p)
p = i
print(r)
| false | 16.666667 | [
"- for i, _ in enumerate(g, 1):",
"+ i = 0",
"+ for _ in g:",
"+ i += 1"
] | false | 0.035621 | 0.034162 | 1.042708 | [
"s948891577",
"s397233671"
] |
u679245300 | p02659 | python | s852377407 | s505640293 | 26 | 23 | 10,076 | 9,168 | Accepted | Accepted | 11.54 | import math
import decimal
if __name__ == "__main__":
a, b = input().split()
a = decimal.Decimal(a)
b = decimal.Decimal(b)
ans = (a * b)
ans = int(ans)
print(ans) | import math
if __name__ == "__main__":
a, b = input().split()
a = int(a)
b = float(b)
b = int(100 * b + 0.4)
print(((a*b)//100)) | 10 | 9 | 196 | 156 | import math
import decimal
if __name__ == "__main__":
a, b = input().split()
a = decimal.Decimal(a)
b = decimal.Decimal(b)
ans = a * b
ans = int(ans)
print(ans)
| import math
if __name__ == "__main__":
a, b = input().split()
a = int(a)
b = float(b)
b = int(100 * b + 0.4)
print(((a * b) // 100))
| false | 10 | [
"-import decimal",
"- a = decimal.Decimal(a)",
"- b = decimal.Decimal(b)",
"- ans = a * b",
"- ans = int(ans)",
"- print(ans)",
"+ a = int(a)",
"+ b = float(b)",
"+ b = int(100 * b + 0.4)",
"+ print(((a * b) // 100))"
] | false | 0.041838 | 0.039468 | 1.060063 | [
"s852377407",
"s505640293"
] |
u622045059 | p03329 | python | s391267850 | s053835400 | 878 | 419 | 6,060 | 6,656 | Accepted | Accepted | 52.28 | import math
import fractions
import bisect
import collections
import itertools
import heapq
import string
import sys
import copy
from decimal import *
from collections import deque
sys.setrecursionlimit(10**7)
MOD = 10**9+7
INF = float('inf') #無限大
def gcd(a,b):return fractions.gcd(a,b) #最大公約数
def lcm(a,b... | import math
import fractions
import bisect
import collections
import itertools
import heapq
import string
import sys
import copy
from decimal import *
from collections import deque
sys.setrecursionlimit(10**7)
MOD = 10**9+7
INF = float('inf') #無限大
def gcd(a,b):return fractions.gcd(a,b) #最大公約数
def lcm(a,b... | 63 | 73 | 2,181 | 2,419 | import math
import fractions
import bisect
import collections
import itertools
import heapq
import string
import sys
import copy
from decimal import *
from collections import deque
sys.setrecursionlimit(10**7)
MOD = 10**9 + 7
INF = float("inf") # 無限大
def gcd(a, b):
return fractions.gcd(a, b) # 最大公約数
def lcm(... | import math
import fractions
import bisect
import collections
import itertools
import heapq
import string
import sys
import copy
from decimal import *
from collections import deque
sys.setrecursionlimit(10**7)
MOD = 10**9 + 7
INF = float("inf") # 無限大
def gcd(a, b):
return fractions.gcd(a, b) # 最大公約数
def lcm(... | false | 13.69863 | [
"-dp = [INF for _ in range(N + 1)]",
"+dp = [-1 for _ in range(N + 1)]",
"-for i in range(N):",
"+queue = deque([0])",
"+while len(queue) > 0:",
"+ current = queue.popleft()",
"- while i + pow6 < N + 1:",
"- dp[i + pow6] = min(dp[i + pow6], dp[i] + 1)",
"+ while current + pow6 <= N:"... | false | 0.142543 | 0.11791 | 1.208919 | [
"s391267850",
"s053835400"
] |
u796942881 | p02848 | python | s276260228 | s021915535 | 20 | 17 | 3,188 | 3,060 | Accepted | Accepted | 15 | def main():
N = int(eval(input()))
S = list(eval(input()))
ans = []
a = ord("A")
z = ord("Z")
for s in S:
if ord(s) + N <= z:
ans.append(chr(ord(s) + N))
else:
ans.append(chr(ord(s) + N - z + a - 1))
print(("".join(ans)))
return
ma... | def main():
N = int(eval(input()))
S = eval(input())
alp = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
print((S.translate(str.maketrans(alp, alp[N:] + alp[:N]))))
return
main()
| 16 | 9 | 311 | 178 | def main():
N = int(eval(input()))
S = list(eval(input()))
ans = []
a = ord("A")
z = ord("Z")
for s in S:
if ord(s) + N <= z:
ans.append(chr(ord(s) + N))
else:
ans.append(chr(ord(s) + N - z + a - 1))
print(("".join(ans)))
return
main()
| def main():
N = int(eval(input()))
S = eval(input())
alp = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
print((S.translate(str.maketrans(alp, alp[N:] + alp[:N]))))
return
main()
| false | 43.75 | [
"- S = list(eval(input()))",
"- ans = []",
"- a = ord(\"A\")",
"- z = ord(\"Z\")",
"- for s in S:",
"- if ord(s) + N <= z:",
"- ans.append(chr(ord(s) + N))",
"- else:",
"- ans.append(chr(ord(s) + N - z + a - 1))",
"- print((\"\".join(ans)))",
... | false | 0.047966 | 0.048667 | 0.98558 | [
"s276260228",
"s021915535"
] |
u350997995 | p02886 | python | s082509956 | s819122147 | 43 | 18 | 3,060 | 2,940 | Accepted | Accepted | 58.14 | N = int(eval(input()))
d = list(map(int,input().split()))
ans = 0
for i in range(N-1):
for j in range(i+1,N):
ans+=d[i]*d[j]
print(ans) | N = int(eval(input()))
D = list(map(int,input().split()))
ans = 0
for i in range(N-1):
for j in range(i+1,N):
ans += D[i]*D[j]
print(ans) | 7 | 7 | 147 | 149 | N = int(eval(input()))
d = list(map(int, input().split()))
ans = 0
for i in range(N - 1):
for j in range(i + 1, N):
ans += d[i] * d[j]
print(ans)
| N = int(eval(input()))
D = list(map(int, input().split()))
ans = 0
for i in range(N - 1):
for j in range(i + 1, N):
ans += D[i] * D[j]
print(ans)
| false | 0 | [
"-d = list(map(int, input().split()))",
"+D = list(map(int, input().split()))",
"- ans += d[i] * d[j]",
"+ ans += D[i] * D[j]"
] | false | 0.065534 | 0.036298 | 1.805453 | [
"s082509956",
"s819122147"
] |
u127499732 | p02947 | python | s600606520 | s122736481 | 767 | 640 | 19,756 | 19,760 | Accepted | Accepted | 16.56 | def main():
import sys
import math
import collections
n=int(eval(input()))
word=["".join(sorted(str(eval(input())))) for _ in range(n) ]
dic=collections.Counter(word)
ans=0
for k in list(dic.values()):
if k>1:
ans+=math.factorial(k)//math.factorial(k-2)//2
print(ans)
if __nam... | def main():
import sys
import math
import collections
n=int(eval(input()))
word=["".join(sorted(str(sys.stdin.readline().rstrip()))) for _ in range(n) ]
dic=collections.Counter(word)
ans=0
for k in list(dic.values()):
if k>1:
ans+=math.factorial(k)//math.factorial(k-2)//2
print(an... | 16 | 16 | 332 | 354 | def main():
import sys
import math
import collections
n = int(eval(input()))
word = ["".join(sorted(str(eval(input())))) for _ in range(n)]
dic = collections.Counter(word)
ans = 0
for k in list(dic.values()):
if k > 1:
ans += math.factorial(k) // math.factorial(k - 2... | def main():
import sys
import math
import collections
n = int(eval(input()))
word = ["".join(sorted(str(sys.stdin.readline().rstrip()))) for _ in range(n)]
dic = collections.Counter(word)
ans = 0
for k in list(dic.values()):
if k > 1:
ans += math.factorial(k) // math... | false | 0 | [
"- word = [\"\".join(sorted(str(eval(input())))) for _ in range(n)]",
"+ word = [\"\".join(sorted(str(sys.stdin.readline().rstrip()))) for _ in range(n)]"
] | false | 0.051144 | 0.050862 | 1.005532 | [
"s600606520",
"s122736481"
] |
u729133443 | p02897 | python | s674109255 | s121546117 | 165 | 28 | 38,256 | 9,052 | Accepted | Accepted | 83.03 | n=int(eval(input()));print((1-n//2/n)) | n=int(eval(input()))
print((-~n//2/n)) | 1 | 2 | 30 | 31 | n = int(eval(input()))
print((1 - n // 2 / n))
| n = int(eval(input()))
print((-~n // 2 / n))
| false | 50 | [
"-print((1 - n // 2 / n))",
"+print((-~n // 2 / n))"
] | false | 0.069916 | 0.082171 | 0.850864 | [
"s674109255",
"s121546117"
] |
u597455618 | p02560 | python | s297394303 | s637664144 | 231 | 212 | 78,184 | 79,356 | Accepted | Accepted | 8.23 | import sys
def floor_sum(n, m, a, b):
ans = n*(b//m)
b %= m
while True:
ans += (n-1)*n*(a//m)//2
a %= m
if a*n+b < m:
return ans
y_max = (a*n + b)//m
b -= y_max*m # now we have x_max = -(b//a)
ans += (n + b//a)*y_max
b %= a... | import sys
def floor_sum(n, m, a, b):
ans = n*(b//m)
b %= m
while True:
ans += (n-1)*n*(a//m)//2
a %= m
if a*n+b < m:
return ans
y_max = (a*n + b)//m
b -= y_max*m # now we have x_max = -(b//a)
ans += (n + b//a)*y_max
b %= a... | 28 | 29 | 598 | 639 | import sys
def floor_sum(n, m, a, b):
ans = n * (b // m)
b %= m
while True:
ans += (n - 1) * n * (a // m) // 2
a %= m
if a * n + b < m:
return ans
y_max = (a * n + b) // m
b -= y_max * m # now we have x_max = -(b//a)
ans += (n + b // a) * y_max
... | import sys
def floor_sum(n, m, a, b):
ans = n * (b // m)
b %= m
while True:
ans += (n - 1) * n * (a // m) // 2
a %= m
if a * n + b < m:
return ans
y_max = (a * n + b) // m
b -= y_max * m # now we have x_max = -(b//a)
ans += (n + b // a) * y_max
... | false | 3.448276 | [
"- for x in sys.stdin.buffer.readlines():",
"- n, m, a, b = list(map(int, x.split()))",
"- res = floor_sum(n, m, a, b)",
"- print(res)",
"+ ans = [0] * t",
"+ for i, x in enumerate(sys.stdin.buffer.readlines()):",
"+ n, m, a, b = map(int, x.split())",
"+ ans... | false | 0.035983 | 0.037775 | 0.952554 | [
"s297394303",
"s637664144"
] |
u216015528 | p02695 | python | s515910086 | s846526664 | 569 | 522 | 9,132 | 9,024 | Accepted | Accepted | 8.26 | #!/usr/bin/env python3
def main():
import sys
def calc(A: list):
score = 0
for a, b, c, d in lst:
if A[b - 1] - A[a - 1] == c:
score += d
return score
def dfs(A: list):
nonlocal ans
if len(A) == N:
ans = max(an... | #!/usr/bin/env python3
def main():
import sys
from itertools import combinations_with_replacement
input = sys.stdin.readline
N, M, Q = list(map(int, input().split()))
lst = [list(map(int, input().split())) for _ in range(Q)]
ans = 0
for pattern in combinations_with_replacement(... | 33 | 23 | 714 | 556 | #!/usr/bin/env python3
def main():
import sys
def calc(A: list):
score = 0
for a, b, c, d in lst:
if A[b - 1] - A[a - 1] == c:
score += d
return score
def dfs(A: list):
nonlocal ans
if len(A) == N:
ans = max(ans, calc(A))
... | #!/usr/bin/env python3
def main():
import sys
from itertools import combinations_with_replacement
input = sys.stdin.readline
N, M, Q = list(map(int, input().split()))
lst = [list(map(int, input().split())) for _ in range(Q)]
ans = 0
for pattern in combinations_with_replacement(list(range(1,... | false | 30.30303 | [
"-",
"- def calc(A: list):",
"- score = 0",
"- for a, b, c, d in lst:",
"- if A[b - 1] - A[a - 1] == c:",
"- score += d",
"- return score",
"-",
"- def dfs(A: list):",
"- nonlocal ans",
"- if len(A) == N:",
"- ans = ... | false | 0.057679 | 0.046541 | 1.239317 | [
"s515910086",
"s846526664"
] |
u102461423 | p03182 | python | s379214682 | s070890331 | 1,887 | 1,337 | 123,740 | 126,356 | Accepted | Accepted | 29.15 | import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
N,M = list(map(int,input().split()))
LRA = [[int(x) for x in row.split()] for row in sys.stdin.readlines()]
R_to_LA = [[] for _ in range(N+1)]
for L,R,A in LRA:
R_to_LA[R].append((L,A))
INF = 10 ** 18
size = 1<<18
data = [0] * (2... | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
class LazySegmentTree:
""" range add and range max"""
def __init__(self, A):
INF = 10 ** 18
self.unit = -INF
self.N = len(A)
self.H = (self.N - 1).b... | 66 | 98 | 1,559 | 2,529 | import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
N, M = list(map(int, input().split()))
LRA = [[int(x) for x in row.split()] for row in sys.stdin.readlines()]
R_to_LA = [[] for _ in range(N + 1)]
for L, R, A in LRA:
R_to_LA[R].append((L, A))
INF = 10**18
size = 1 << 18
data = [0] * (2 * size)
laz... | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
class LazySegmentTree:
"""range add and range max"""
def __init__(self, A):
INF = 10**18
self.unit = -INF
self.N = len(A)
self.H = (self.N - 1).bit_length()
... | false | 32.653061 | [
"-input = sys.stdin.readline",
"-sys.setrecursionlimit(10**7)",
"-N, M = list(map(int, input().split()))",
"-LRA = [[int(x) for x in row.split()] for row in sys.stdin.readlines()]",
"-R_to_LA = [[] for _ in range(N + 1)]",
"-for L, R, A in LRA:",
"- R_to_LA[R].append((L, A))",
"-INF = 10**18",
"-... | false | 0.423848 | 0.039001 | 10.867573 | [
"s379214682",
"s070890331"
] |
u156815136 | p04005 | python | s142471844 | s790405203 | 40 | 36 | 10,352 | 10,396 | Accepted | Accepted | 10 | #from statistics import median
#import collections
#aa = collections.Counter(a) # list to list || .most_common(2)で最大の2個とりだせるお a[0][0]
from fractions import gcd
from itertools import combinations,permutations,accumulate, product # (string,3) 3回
#from collections import deque
from collections import deque,defaultdi... | #from statistics import median
#import collections
#aa = collections.Counter(a) # list to list || .most_common(2)で最大の2個とりだせるお a[0][0]
from fractions import gcd
from itertools import combinations,permutations,accumulate, product # (string,3) 3回
#from collections import deque
from collections import deque,defaultdi... | 31 | 64 | 862 | 1,670 | # from statistics import median
# import collections
# aa = collections.Counter(a) # list to list || .most_common(2)で最大の2個とりだせるお a[0][0]
from fractions import gcd
from itertools import combinations, permutations, accumulate, product # (string,3) 3回
# from collections import deque
from collections import deque, defaul... | # from statistics import median
# import collections
# aa = collections.Counter(a) # list to list || .most_common(2)で最大の2個とりだせるお a[0][0]
from fractions import gcd
from itertools import combinations, permutations, accumulate, product # (string,3) 3回
# from collections import deque
from collections import deque, defaul... | false | 51.5625 | [
"+import math",
"-mod = 10**9 + 7",
"+# mod = 10**9 + 7",
"+mod = 998244353",
"+",
"+",
"+def readInts():",
"+ return list(map(int, input().split()))",
"+",
"+",
"+def I():",
"+ return int(eval(input()))",
"+",
"+",
"+# from statistics import median",
"+# import collections",
"... | false | 0.089445 | 0.03783 | 2.364365 | [
"s142471844",
"s790405203"
] |
u882323840 | p02684 | python | s506540920 | s663225108 | 231 | 156 | 199,080 | 134,216 | Accepted | Accepted | 32.47 | from collections import Counter
N, K = list(map(int,input().split()))
A = list(map(int,input().split()))
i = k = 0
B = [1]
while k <= 10 ** 6:
i = A[i] - 1
B.append(i + 1)
k += 1
S = Counter(B)
idx = S.most_common(1)[0][0]
i = k = cnt = 0
k_s = None
while k < 10 ** 6:
if B[k] == idx and cn... | from collections import Counter
N, K = list(map(int,input().split()))
A = list(map(int,input().split()))
i = k = 0
B = [1]
while k <= N:
i = A[i] - 1
B.append(i + 1)
k += 1
S = Counter(B)
idx = S.most_common(1)[0][0]
i = k = cnt = 0
k_s = None
while k < N:
if B[k] == idx and cnt == 1:
... | 30 | 30 | 601 | 589 | from collections import Counter
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
i = k = 0
B = [1]
while k <= 10**6:
i = A[i] - 1
B.append(i + 1)
k += 1
S = Counter(B)
idx = S.most_common(1)[0][0]
i = k = cnt = 0
k_s = None
while k < 10**6:
if B[k] == idx and cnt == 1:
... | from collections import Counter
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
i = k = 0
B = [1]
while k <= N:
i = A[i] - 1
B.append(i + 1)
k += 1
S = Counter(B)
idx = S.most_common(1)[0][0]
i = k = cnt = 0
k_s = None
while k < N:
if B[k] == idx and cnt == 1:
k_s = k... | false | 0 | [
"-while k <= 10**6:",
"+while k <= N:",
"-while k < 10**6:",
"+while k < N:"
] | false | 0.489543 | 0.032342 | 15.136235 | [
"s506540920",
"s663225108"
] |
u634046173 | p03611 | python | s160666311 | s751752828 | 181 | 156 | 84,216 | 84,640 | Accepted | Accepted | 13.81 | N = int(eval(input()))
As = list(map(int,input().split()))
c = 0
nums = [0]*(10**5+1)
for a in As:
nums[a]+=1
for i in range(1,len(nums)):
if i == len(nums)-1:
t = nums[i - 1] + nums[i]
else:
t = nums[i-1]+nums[i]+nums[i+1]
c = max(c,t)
print(c)
| N = int(eval(input()))
As = list(map(int,input().split()))
c = 0
nums = [0]*(10**5+2)
for a in As:
nums[a]+=1
for i in range(1,len(nums)-1):
t = nums[i-1]+nums[i]+nums[i+1]
c = max(c,t)
print(c)
| 16 | 13 | 290 | 216 | N = int(eval(input()))
As = list(map(int, input().split()))
c = 0
nums = [0] * (10**5 + 1)
for a in As:
nums[a] += 1
for i in range(1, len(nums)):
if i == len(nums) - 1:
t = nums[i - 1] + nums[i]
else:
t = nums[i - 1] + nums[i] + nums[i + 1]
c = max(c, t)
print(c)
| N = int(eval(input()))
As = list(map(int, input().split()))
c = 0
nums = [0] * (10**5 + 2)
for a in As:
nums[a] += 1
for i in range(1, len(nums) - 1):
t = nums[i - 1] + nums[i] + nums[i + 1]
c = max(c, t)
print(c)
| false | 18.75 | [
"-nums = [0] * (10**5 + 1)",
"+nums = [0] * (10**5 + 2)",
"-for i in range(1, len(nums)):",
"- if i == len(nums) - 1:",
"- t = nums[i - 1] + nums[i]",
"- else:",
"- t = nums[i - 1] + nums[i] + nums[i + 1]",
"+for i in range(1, len(nums) - 1):",
"+ t = nums[i - 1] + nums[i] + n... | false | 0.215679 | 0.352677 | 0.611547 | [
"s160666311",
"s751752828"
] |
u562935282 | p02897 | python | s980419837 | s364203000 | 175 | 17 | 38,740 | 2,940 | Accepted | Accepted | 90.29 | n = int(eval(input()))
q, r = divmod(n, 2)
if r == 0:
print((0.5))
else:
print(((q + 1) / n))
| n = int(eval(input()))
evens = n // 2
odds = n - evens
print((odds / n))
| 7 | 6 | 99 | 72 | n = int(eval(input()))
q, r = divmod(n, 2)
if r == 0:
print((0.5))
else:
print(((q + 1) / n))
| n = int(eval(input()))
evens = n // 2
odds = n - evens
print((odds / n))
| false | 14.285714 | [
"-q, r = divmod(n, 2)",
"-if r == 0:",
"- print((0.5))",
"-else:",
"- print(((q + 1) / n))",
"+evens = n // 2",
"+odds = n - evens",
"+print((odds / n))"
] | false | 0.036731 | 0.03588 | 1.023729 | [
"s980419837",
"s364203000"
] |
u346395915 | p03371 | python | s603003962 | s168887488 | 76 | 17 | 3,064 | 3,064 | Accepted | Accepted | 77.63 | a, b, c, x, y = list(map(int,input().split()))
ans = max(x,y)*2*c
s = max(x,y)
while s:
tmp = 0
tmp -= c*2
s -= 1
if x > s:
tmp += a
if y > s:
tmp += b
if tmp > 0:
print(ans)
exit()
else:
ans += tmp
print(ans) | a, b, c, x, y = list(map(int,input().split()))
if a+b <= c * 2:
print((x*a + y*b))
exit()
ans = 0
ans += min(x,y) * c * 2
if x >= y:
ans += min((x-y)*a, (x-y)*2*c)
else:
ans += min((y-x)*b, (y-x)*2*c)
print(ans) | 20 | 16 | 301 | 250 | a, b, c, x, y = list(map(int, input().split()))
ans = max(x, y) * 2 * c
s = max(x, y)
while s:
tmp = 0
tmp -= c * 2
s -= 1
if x > s:
tmp += a
if y > s:
tmp += b
if tmp > 0:
print(ans)
exit()
else:
ans += tmp
print(ans)
| a, b, c, x, y = list(map(int, input().split()))
if a + b <= c * 2:
print((x * a + y * b))
exit()
ans = 0
ans += min(x, y) * c * 2
if x >= y:
ans += min((x - y) * a, (x - y) * 2 * c)
else:
ans += min((y - x) * b, (y - x) * 2 * c)
print(ans)
| false | 20 | [
"-ans = max(x, y) * 2 * c",
"-s = max(x, y)",
"-while s:",
"- tmp = 0",
"- tmp -= c * 2",
"- s -= 1",
"- if x > s:",
"- tmp += a",
"- if y > s:",
"- tmp += b",
"- if tmp > 0:",
"- print(ans)",
"- exit()",
"- else:",
"- ans += tmp",
... | false | 0.055409 | 0.035782 | 1.548501 | [
"s603003962",
"s168887488"
] |
u631914718 | p03283 | python | s794812125 | s226909261 | 499 | 420 | 32,888 | 38,468 | Accepted | Accepted | 15.83 | from itertools import accumulate as acc
import sys
if __name__ == "__main__":
s = sys.stdin.readlines()
N, M, Q = list(map(int, s[0].split()))
LR = [[0]*N for _ in range(N)]
for l, r in (list(map(int, e.split())) for e in s[1:M + 1]):
LR[l - 1][r - 1] += 1
S = [tuple(acc(reversed... | from itertools import accumulate as acc
import sys
if __name__ == "__main__":
s = sys.stdin.readlines()
N, M, Q = list(map(int, s[0].split()))
LR = [[0]*N for _ in range(N)]
for l, r in (list(map(int, e.split())) for e in s[1:M + 1]):
LR[l - 1][r - 1] += 1
S = [tuple(acc(reversed... | 13 | 12 | 436 | 454 | from itertools import accumulate as acc
import sys
if __name__ == "__main__":
s = sys.stdin.readlines()
N, M, Q = list(map(int, s[0].split()))
LR = [[0] * N for _ in range(N)]
for l, r in (list(map(int, e.split())) for e in s[1 : M + 1]):
LR[l - 1][r - 1] += 1
S = [tuple(acc(reversed(s))) f... | from itertools import accumulate as acc
import sys
if __name__ == "__main__":
s = sys.stdin.readlines()
N, M, Q = list(map(int, s[0].split()))
LR = [[0] * N for _ in range(N)]
for l, r in (list(map(int, e.split())) for e in s[1 : M + 1]):
LR[l - 1][r - 1] += 1
S = [tuple(acc(reversed(s))) f... | false | 7.692308 | [
"- for p, q in (list(map(int, e.split())) for e in s[M + 1 :]):",
"- print((S[q - 1][N - p]))",
"+ print(",
"+ (",
"+ \"\\n\".join(",
"+ map(",
"+ str,",
"+ (",
"+ S[q - 1][N - p]",
"+ ... | false | 0.057558 | 0.098619 | 0.583641 | [
"s794812125",
"s226909261"
] |
u072053884 | p00296 | python | s424434546 | s457898128 | 3,770 | 160 | 28,820 | 29,296 | Accepted | Accepted | 95.76 | def solve():
import sys
file_input = sys.stdin
N, M, Q = map(int, file_input.readline().split())
student = list(range(N))
exemption = [1] * N
pos = 0
for a in map(int, file_input.readline().split()):
if a % 2:
pos = (pos - a) % len(student)
e... | def solve():
import sys
file_input = sys.stdin
N, M, Q = map(int, file_input.readline().split())
from collections import deque
student = deque(range(N))
exemption = [1] * N
for a in map(int, file_input.readline().split()):
if a % 2:
student.rotate(a)
... | 22 | 21 | 582 | 560 | def solve():
import sys
file_input = sys.stdin
N, M, Q = map(int, file_input.readline().split())
student = list(range(N))
exemption = [1] * N
pos = 0
for a in map(int, file_input.readline().split()):
if a % 2:
pos = (pos - a) % len(student)
else:
pos ... | def solve():
import sys
file_input = sys.stdin
N, M, Q = map(int, file_input.readline().split())
from collections import deque
student = deque(range(N))
exemption = [1] * N
for a in map(int, file_input.readline().split()):
if a % 2:
student.rotate(a)
else:
... | false | 4.545455 | [
"- student = list(range(N))",
"+ from collections import deque",
"+",
"+ student = deque(range(N))",
"- pos = 0",
"- pos = (pos - a) % len(student)",
"+ student.rotate(a)",
"- pos = (pos + a) % len(student)",
"- s = student[pos]",
"+ s... | false | 0.086604 | 0.045397 | 1.907728 | [
"s424434546",
"s457898128"
] |
u729133443 | p03477 | python | s833706242 | s946654811 | 165 | 17 | 38,384 | 2,940 | Accepted | Accepted | 89.7 | a,b,c,d=list(map(int,input().split()));e=a+b;f=c+d;print((['RLiegfhtt'[e>f::2],'Balanced'][e==f])) | a,b,c,d=list(map(int,input().split()));print((['RLiegfhtt'[a+b>c+d::2],'Balanced'][a+b==c+d])) | 1 | 1 | 90 | 86 | a, b, c, d = list(map(int, input().split()))
e = a + b
f = c + d
print((["RLiegfhtt"[e > f :: 2], "Balanced"][e == f]))
| a, b, c, d = list(map(int, input().split()))
print((["RLiegfhtt"[a + b > c + d :: 2], "Balanced"][a + b == c + d]))
| false | 0 | [
"-e = a + b",
"-f = c + d",
"-print(([\"RLiegfhtt\"[e > f :: 2], \"Balanced\"][e == f]))",
"+print(([\"RLiegfhtt\"[a + b > c + d :: 2], \"Balanced\"][a + b == c + d]))"
] | false | 0.046254 | 0.04143 | 1.116444 | [
"s833706242",
"s946654811"
] |
u994988729 | p03209 | python | s582498635 | s490904578 | 157 | 17 | 12,488 | 3,064 | Accepted | Accepted | 89.17 | import numpy as np
n, x = list(map(int, input().split()))
l = np.zeros(51, dtype=np.int64)
p = np.zeros(51, dtype=np.int64)
for i in range(n + 1):
if i == 0:
l[i] = 1
p[i] = 1
continue
l[i] = 3 + 2 * l[i - 1]
p[i] = 1 + 2 * p[i - 1]
ans = 0
for i in range(n, -1, -1)... | n, x = list(map(int, input().split()))
l = [0] * (n + 1)
p = [0] * (n + 1)
l[0] = 1
p[0] = 1
for i in range(n):
l[i+1] = l[i]*2+3
p[i+1] = p[i]*2+1
ans = 0
for i in range(n, -1, -1):
layer = l[i]
if x >= layer:
ans += p[i]
break
elif x <= 1:
break
ha... | 33 | 29 | 597 | 479 | import numpy as np
n, x = list(map(int, input().split()))
l = np.zeros(51, dtype=np.int64)
p = np.zeros(51, dtype=np.int64)
for i in range(n + 1):
if i == 0:
l[i] = 1
p[i] = 1
continue
l[i] = 3 + 2 * l[i - 1]
p[i] = 1 + 2 * p[i - 1]
ans = 0
for i in range(n, -1, -1):
layer = l[i... | n, x = list(map(int, input().split()))
l = [0] * (n + 1)
p = [0] * (n + 1)
l[0] = 1
p[0] = 1
for i in range(n):
l[i + 1] = l[i] * 2 + 3
p[i + 1] = p[i] * 2 + 1
ans = 0
for i in range(n, -1, -1):
layer = l[i]
if x >= layer:
ans += p[i]
break
elif x <= 1:
break
half = l[i -... | false | 12.121212 | [
"-import numpy as np",
"-",
"-l = np.zeros(51, dtype=np.int64)",
"-p = np.zeros(51, dtype=np.int64)",
"-for i in range(n + 1):",
"- if i == 0:",
"- l[i] = 1",
"- p[i] = 1",
"- continue",
"- l[i] = 3 + 2 * l[i - 1]",
"- p[i] = 1 + 2 * p[i - 1]",
"+l = [0] * (n + 1)... | false | 0.499795 | 0.093481 | 5.34651 | [
"s582498635",
"s490904578"
] |
u131273629 | p03448 | python | s008652484 | s742073880 | 49 | 42 | 3,060 | 3,064 | Accepted | Accepted | 14.29 | a = int(eval(input()))
b = int(eval(input()))
c = int(eval(input()))
x = int(eval(input()))
count = 0
for i in range(a+1):
for j in range(b+1):
for k in range(c+1):
if 500*i+100*j+50*k == x:
count += 1
print(count) | a = int(eval(input()))
b = int(eval(input()))
c = int(eval(input()))
x = int(eval(input()))
count = 0
for i in range(a+1):
if 500*i>x: break
for j in range(b+1):
if 500*i+100*j>x: break
for k in range(c+1):
if 500*i+100*j+50*k == x:
count += 1
print(count) | 13 | 15 | 214 | 261 | a = int(eval(input()))
b = int(eval(input()))
c = int(eval(input()))
x = int(eval(input()))
count = 0
for i in range(a + 1):
for j in range(b + 1):
for k in range(c + 1):
if 500 * i + 100 * j + 50 * k == x:
count += 1
print(count)
| a = int(eval(input()))
b = int(eval(input()))
c = int(eval(input()))
x = int(eval(input()))
count = 0
for i in range(a + 1):
if 500 * i > x:
break
for j in range(b + 1):
if 500 * i + 100 * j > x:
break
for k in range(c + 1):
if 500 * i + 100 * j + 50 * k == x:
... | false | 13.333333 | [
"+ if 500 * i > x:",
"+ break",
"+ if 500 * i + 100 * j > x:",
"+ break"
] | false | 0.109894 | 0.047846 | 2.296813 | [
"s008652484",
"s742073880"
] |
u644907318 | p03050 | python | s808666099 | s250278837 | 141 | 74 | 3,060 | 64,480 | Accepted | Accepted | 47.52 | N = int(eval(input()))
cnt = 0
for i in range(1,int(N**0.5)+1):
if N%i==0:
q = N//i
m = i-1
if q<m:
cnt += m
m = N//i-1
q = i
if q<m:
cnt += m
print(cnt) | N = int(eval(input()))
A = []
for i in range(1,int(N**0.5)+1):
if N%i==0:
a = i
b = N//i
if a>b:
a,b = b,a
if 0<a<b-1:
A.append(b-1)
print((sum(A))) | 13 | 11 | 235 | 210 | N = int(eval(input()))
cnt = 0
for i in range(1, int(N**0.5) + 1):
if N % i == 0:
q = N // i
m = i - 1
if q < m:
cnt += m
m = N // i - 1
q = i
if q < m:
cnt += m
print(cnt)
| N = int(eval(input()))
A = []
for i in range(1, int(N**0.5) + 1):
if N % i == 0:
a = i
b = N // i
if a > b:
a, b = b, a
if 0 < a < b - 1:
A.append(b - 1)
print((sum(A)))
| false | 15.384615 | [
"-cnt = 0",
"+A = []",
"- q = N // i",
"- m = i - 1",
"- if q < m:",
"- cnt += m",
"- m = N // i - 1",
"- q = i",
"- if q < m:",
"- cnt += m",
"-print(cnt)",
"+ a = i",
"+ b = N // i",
"+ if a > b:",
"+ ... | false | 0.232739 | 0.206871 | 1.125045 | [
"s808666099",
"s250278837"
] |
u847467233 | p02446 | python | s732310924 | s193575068 | 190 | 120 | 16,648 | 16,628 | Accepted | Accepted | 36.84 | # AOJ ITP2_4_D: Unique
# Python3 2018.6.24 bal4u
n = int(eval(input()))
a = list(map(int, input().split()))
ans = []
ans.append(a[0])
for i in range(1, n):
if a[i] != a[i-1]: ans.append(a[i])
print((*ans))
| # AOJ ITP2_4_D: Unique
# Python3 2018.6.24 bal4u
n = int(eval(input()))
a = list(map(int, input().split()))
print((*sorted(list(set(a)))))
| 10 | 6 | 209 | 137 | # AOJ ITP2_4_D: Unique
# Python3 2018.6.24 bal4u
n = int(eval(input()))
a = list(map(int, input().split()))
ans = []
ans.append(a[0])
for i in range(1, n):
if a[i] != a[i - 1]:
ans.append(a[i])
print((*ans))
| # AOJ ITP2_4_D: Unique
# Python3 2018.6.24 bal4u
n = int(eval(input()))
a = list(map(int, input().split()))
print((*sorted(list(set(a)))))
| false | 40 | [
"-ans = []",
"-ans.append(a[0])",
"-for i in range(1, n):",
"- if a[i] != a[i - 1]:",
"- ans.append(a[i])",
"-print((*ans))",
"+print((*sorted(list(set(a)))))"
] | false | 0.035037 | 0.03648 | 0.960445 | [
"s732310924",
"s193575068"
] |
u506910932 | p03017 | python | s488778788 | s505553753 | 64 | 59 | 13,528 | 9,424 | Accepted | Accepted | 7.81 | def iwa_check(start, end):
for i in range(start, end):
if s[i] == '#' and s[i + 1] == '#':
return False
return True
n, a, b, c, d = list(map(int, input().split()))
s = list(eval(input()))
s = ['#'] + s + ['#']
# 岩が2個並ぶ
if not iwa_check(a, c) or not iwa_check(b, d):
print(... | def check(start, end):
for i in range(start, end - 1):
if s[i] == '#' and s[i + 1] == '#':
return False
return True
n, a, b, c, d = list(map(int, input().split()))
s = eval(input())
s = '#' + s + '#'
# a~c,b~d間で岩2連続は無理
if not check(a, c) or not check(b, d):
print('No')
... | 29 | 25 | 582 | 547 | def iwa_check(start, end):
for i in range(start, end):
if s[i] == "#" and s[i + 1] == "#":
return False
return True
n, a, b, c, d = list(map(int, input().split()))
s = list(eval(input()))
s = ["#"] + s + ["#"]
# 岩が2個並ぶ
if not iwa_check(a, c) or not iwa_check(b, d):
print("No")
exit... | def check(start, end):
for i in range(start, end - 1):
if s[i] == "#" and s[i + 1] == "#":
return False
return True
n, a, b, c, d = list(map(int, input().split()))
s = eval(input())
s = "#" + s + "#"
# a~c,b~d間で岩2連続は無理
if not check(a, c) or not check(b, d):
print("No")
exit()
# d<c... | false | 13.793103 | [
"-def iwa_check(start, end):",
"- for i in range(start, end):",
"+def check(start, end):",
"+ for i in range(start, end - 1):",
"-s = list(eval(input()))",
"-s = [\"#\"] + s + [\"#\"]",
"-# 岩が2個並ぶ",
"-if not iwa_check(a, c) or not iwa_check(b, d):",
"+s = eval(input())",
"+s = \"#\" + s + \"... | false | 0.046818 | 0.047033 | 0.995429 | [
"s488778788",
"s505553753"
] |
u945181840 | p02920 | python | s842366567 | s271156981 | 1,122 | 464 | 34,676 | 33,968 | Accepted | Accepted | 58.65 | def main():
N = int(eval(input()))
S = list(map(int, input().split()))
INF = float('inf')
S.sort()
parents = [S[-1]]
S[-1] = INF
for _ in range(N):
checking = 2
parents.sort()
tmp = parents[::-1]
for i in tmp:
while True:
... | def main():
N = int(eval(input()))
S = list(map(int, input().split()))
INF = float('inf')
n = 2 ** N + 1
S.sort()
parents = [S[-1]]
S[-1] = INF
for _ in range(N):
checking = 2
parents.sort()
tmp = parents[::-1]
for i in tmp:
... | 31 | 32 | 700 | 711 | def main():
N = int(eval(input()))
S = list(map(int, input().split()))
INF = float("inf")
S.sort()
parents = [S[-1]]
S[-1] = INF
for _ in range(N):
checking = 2
parents.sort()
tmp = parents[::-1]
for i in tmp:
while True:
if S[-chec... | def main():
N = int(eval(input()))
S = list(map(int, input().split()))
INF = float("inf")
n = 2**N + 1
S.sort()
parents = [S[-1]]
S[-1] = INF
for _ in range(N):
checking = 2
parents.sort()
tmp = parents[::-1]
for i in tmp:
while True:
... | false | 3.125 | [
"+ n = 2**N + 1",
"- if checking == 2**N + 1:",
"+ if checking == n:"
] | false | 0.073078 | 0.036364 | 2.009649 | [
"s842366567",
"s271156981"
] |
u170201762 | p03722 | python | s532228973 | s166295916 | 1,845 | 992 | 3,380 | 3,316 | Accepted | Accepted | 46.23 | N,M = list(map(int,input().split()))
edge = [0]*M
for i in range(M):
a,b,c=list(map(int,input().split()))
a -= 1
b -= 1
c *= -1
edge[i] = (a,b,c)
inf = float('inf')
V = N
E = M
d = [inf]*V
d[0] = 0
for i in range(V):
for j in range(E):
From,To,cost = edge[j]
if ... | N,M = list(map(int,input().split()))
edge = [0]*M
for i in range(M):
a,b,c=list(map(int,input().split()))
a -= 1
b -= 1
c *= -1
edge[i] = (a,b,c)
inf = float('inf')
V = N
E = M
d = [inf]*V
d[0] = 0
for i in range(V):
update = False
for j in range(E):
From,To,cost = ... | 30 | 33 | 612 | 658 | N, M = list(map(int, input().split()))
edge = [0] * M
for i in range(M):
a, b, c = list(map(int, input().split()))
a -= 1
b -= 1
c *= -1
edge[i] = (a, b, c)
inf = float("inf")
V = N
E = M
d = [inf] * V
d[0] = 0
for i in range(V):
for j in range(E):
From, To, cost = edge[j]
if d[F... | N, M = list(map(int, input().split()))
edge = [0] * M
for i in range(M):
a, b, c = list(map(int, input().split()))
a -= 1
b -= 1
c *= -1
edge[i] = (a, b, c)
inf = float("inf")
V = N
E = M
d = [inf] * V
d[0] = 0
for i in range(V):
update = False
for j in range(E):
From, To, cost = edg... | false | 9.090909 | [
"+ update = False",
"+ update = True",
"+ if not update:",
"+ break",
"-for i in range(V):",
"- for j in range(E):",
"- From, To, cost = edge[j]",
"- if d[From] != inf and d[To] > d[From] + cost:",
"- d[To] = d[From] + cost",
"+for j in range(E):... | false | 0.043605 | 0.044359 | 0.982993 | [
"s532228973",
"s166295916"
] |
u261103969 | p03053 | python | s977290549 | s899978790 | 721 | 429 | 113,004 | 198,264 | Accepted | Accepted | 40.5 | import sys
readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)
def main():
from collections import deque, defaultdict
h, w = list(map(int, readline().split()))
que = deque()
grid = [["#"] * (w + 2)]
for row in range(1, h + 1):
... | import sys
readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)
def main():
from collections import deque
h, w = list(map(int, readline().split()))
que = deque()
grid = [[] for _ in range(h + 2)]
grid[0] = ["#"] * (w + 2)
grid[-1] =... | 39 | 45 | 894 | 1,151 | import sys
readline = sys.stdin.readline
MOD = 10**9 + 7
INF = float("INF")
sys.setrecursionlimit(10**5)
def main():
from collections import deque, defaultdict
h, w = list(map(int, readline().split()))
que = deque()
grid = [["#"] * (w + 2)]
for row in range(1, h + 1):
s = eval(input())
... | import sys
readline = sys.stdin.readline
MOD = 10**9 + 7
INF = float("INF")
sys.setrecursionlimit(10**5)
def main():
from collections import deque
h, w = list(map(int, readline().split()))
que = deque()
grid = [[] for _ in range(h + 2)]
grid[0] = ["#"] * (w + 2)
grid[-1] = ["#"] * (w + 2)
... | false | 13.333333 | [
"- from collections import deque, defaultdict",
"+ from collections import deque",
"- grid = [[\"#\"] * (w + 2)]",
"+ grid = [[] for _ in range(h + 2)]",
"+ grid[0] = [\"#\"] * (w + 2)",
"+ grid[-1] = [\"#\"] * (w + 2)",
"- grid.append([\"#\"] + list(s) + [\"#\"])",
"- grid... | false | 0.035968 | 0.041784 | 0.860802 | [
"s977290549",
"s899978790"
] |
u121192152 | p02659 | python | s287336643 | s875587843 | 60 | 22 | 61,672 | 9,160 | Accepted | Accepted | 63.33 | A, B = input().strip().split()
a = int(A)
b = int(float(B) * 1000)
ans = (a * b) // 1000
print(ans)
| A, B = input().strip().split()
a = int(A)
b = int(B.replace(".", ""))
ans = (a * b) // 100
print(ans)
| 6 | 5 | 106 | 106 | A, B = input().strip().split()
a = int(A)
b = int(float(B) * 1000)
ans = (a * b) // 1000
print(ans)
| A, B = input().strip().split()
a = int(A)
b = int(B.replace(".", ""))
ans = (a * b) // 100
print(ans)
| false | 16.666667 | [
"-b = int(float(B) * 1000)",
"-ans = (a * b) // 1000",
"+b = int(B.replace(\".\", \"\"))",
"+ans = (a * b) // 100"
] | false | 0.036105 | 0.044976 | 0.80276 | [
"s287336643",
"s875587843"
] |
u025501820 | p02990 | python | s584905046 | s508537795 | 29 | 23 | 3,572 | 3,572 | Accepted | Accepted | 20.69 | N, K = list(map(int, input().split()))
mod = 10 ** 9 + 7
inv = [pow(i, mod - 2, mod) for i in range(1, N + 1)]
table = []
inv_table = []
tmp = 1
inv_tmp = 1
for i in range(N):
tmp *= (i + 1)
tmp %= mod
table.append(tmp)
inv_tmp *= inv[i]
inv_tmp %= mod
inv_table.append(inv_tmp)
... | #!/usr/bin/env python3
# from itertools import combinations_with_replacement
N, K = list(map(int, input().split()))
def cmb(n, r, p):
if (r < 0) or (n < r):
return 0
r = min(r, n - r)
return fact[n] * factinv[r] * factinv[n-r] % p
p = 10 ** 9 + 7
tmp_N = N + 2 # N は必要分だけ用意する
fact = [1... | 42 | 24 | 855 | 693 | N, K = list(map(int, input().split()))
mod = 10**9 + 7
inv = [pow(i, mod - 2, mod) for i in range(1, N + 1)]
table = []
inv_table = []
tmp = 1
inv_tmp = 1
for i in range(N):
tmp *= i + 1
tmp %= mod
table.append(tmp)
inv_tmp *= inv[i]
inv_tmp %= mod
inv_table.append(inv_tmp)
def cmb(n, k):
... | #!/usr/bin/env python3
# from itertools import combinations_with_replacement
N, K = list(map(int, input().split()))
def cmb(n, r, p):
if (r < 0) or (n < r):
return 0
r = min(r, n - r)
return fact[n] * factinv[r] * factinv[n - r] % p
p = 10**9 + 7
tmp_N = N + 2 # N は必要分だけ用意する
fact = [1, 1] # fa... | false | 42.857143 | [
"+#!/usr/bin/env python3",
"+# from itertools import combinations_with_replacement",
"-mod = 10**9 + 7",
"-inv = [pow(i, mod - 2, mod) for i in range(1, N + 1)]",
"-table = []",
"-inv_table = []",
"-tmp = 1",
"-inv_tmp = 1",
"-for i in range(N):",
"- tmp *= i + 1",
"- tmp %= mod",
"- ... | false | 0.037604 | 0.038496 | 0.976839 | [
"s584905046",
"s508537795"
] |
u616085665 | p02271 | python | s258547001 | s083582652 | 4,140 | 1,120 | 45,104 | 8,120 | Accepted | Accepted | 72.95 | from itertools import chain, combinations
def power_set(x):
return chain.from_iterable(combinations(x, r) for r in range(len(x)+1))
def main():
n = int(eval(input()))
A = eval(input())
#print(n)
A = list(map(int, A.split()))
q = int(eval(input()))
m = eval(input())
ms = list(map(int, m.split()))
... | def power_set(A, s):
if len(A) == 0:
return {s}
else:
return power_set(A[1:], s) | power_set(A[1:], s+A[0])
def main():
n = int(eval(input()))
A = eval(input())
#print(n)
A = list(map(int, A.split()))
q = int(eval(input()))
m = eval(input())
ms = list(map(int, m.split()))
powerset = power_s... | 24 | 24 | 491 | 424 | from itertools import chain, combinations
def power_set(x):
return chain.from_iterable(combinations(x, r) for r in range(len(x) + 1))
def main():
n = int(eval(input()))
A = eval(input())
# print(n)
A = list(map(int, A.split()))
q = int(eval(input()))
m = eval(input())
ms = list(map(i... | def power_set(A, s):
if len(A) == 0:
return {s}
else:
return power_set(A[1:], s) | power_set(A[1:], s + A[0])
def main():
n = int(eval(input()))
A = eval(input())
# print(n)
A = list(map(int, A.split()))
q = int(eval(input()))
m = eval(input())
ms = list(map(int, m.... | false | 0 | [
"-from itertools import chain, combinations",
"-",
"-",
"-def power_set(x):",
"- return chain.from_iterable(combinations(x, r) for r in range(len(x) + 1))",
"+def power_set(A, s):",
"+ if len(A) == 0:",
"+ return {s}",
"+ else:",
"+ return power_set(A[1:], s) | power_set(A[1... | false | 0.040876 | 0.036132 | 1.131285 | [
"s258547001",
"s083582652"
] |
u945181840 | p03364 | python | s131817207 | s285522437 | 1,819 | 574 | 16,148 | 20,672 | Accepted | Accepted | 68.44 | import sys
import numpy as np
read = sys.stdin.read
readline = sys.stdin.readline
N, *S = list(map(str, read().split()))
S = np.array(list(map(list, S)), np.str)
S = np.hstack((S, S))
S = np.vstack((S, S))
N = int(N)
answer = 0
for y in range(N):
for i in range(N):
a = S[i, y:y + N]
... | import sys
import numpy as np
read = sys.stdin.read
readline = sys.stdin.readline
N, *S = list(map(str, read().split()))
S = np.array(list(map(list, S)), np.str)
S = np.hstack((S, S))
S = np.vstack((S, S))
N = int(N)
answer = 0
for y in range(N):
a = S[:N, y:y + N]
if np.all(a == a.T):
... | 22 | 18 | 428 | 343 | import sys
import numpy as np
read = sys.stdin.read
readline = sys.stdin.readline
N, *S = list(map(str, read().split()))
S = np.array(list(map(list, S)), np.str)
S = np.hstack((S, S))
S = np.vstack((S, S))
N = int(N)
answer = 0
for y in range(N):
for i in range(N):
a = S[i, y : y + N]
b = S[:N, i +... | import sys
import numpy as np
read = sys.stdin.read
readline = sys.stdin.readline
N, *S = list(map(str, read().split()))
S = np.array(list(map(list, S)), np.str)
S = np.hstack((S, S))
S = np.vstack((S, S))
N = int(N)
answer = 0
for y in range(N):
a = S[:N, y : y + N]
if np.all(a == a.T):
answer += N
pr... | false | 18.181818 | [
"- for i in range(N):",
"- a = S[i, y : y + N]",
"- b = S[:N, i + y]",
"- if np.any(a != b):",
"- break",
"- else:",
"+ a = S[:N, y : y + N]",
"+ if np.all(a == a.T):"
] | false | 0.25322 | 0.192977 | 1.312178 | [
"s131817207",
"s285522437"
] |
u764215612 | p02691 | python | s560506063 | s120349657 | 127 | 115 | 32,248 | 32,240 | Accepted | Accepted | 9.45 | def main():
n = int(eval(input()))
a = list(map(int, input().split()))
d = [0]*n
for i in range(n):
if i+a[i] < n: d[i+a[i]] += 1
ans = 0
for i in range(n):
if i-a[i] >= 0: ans += d[i-a[i]]
print(ans)
main() | def main():
n = int(eval(input()))
a = list(map(int, input().split()))
d = [0]*n
for i, x in enumerate(a):
if i+x < n: d[i+x] += 1
ans = 0
for i, x in enumerate(a):
if i-x >= 0: ans += d[i-x]
print(ans)
main() | 11 | 11 | 233 | 235 | def main():
n = int(eval(input()))
a = list(map(int, input().split()))
d = [0] * n
for i in range(n):
if i + a[i] < n:
d[i + a[i]] += 1
ans = 0
for i in range(n):
if i - a[i] >= 0:
ans += d[i - a[i]]
print(ans)
main()
| def main():
n = int(eval(input()))
a = list(map(int, input().split()))
d = [0] * n
for i, x in enumerate(a):
if i + x < n:
d[i + x] += 1
ans = 0
for i, x in enumerate(a):
if i - x >= 0:
ans += d[i - x]
print(ans)
main()
| false | 0 | [
"- for i in range(n):",
"- if i + a[i] < n:",
"- d[i + a[i]] += 1",
"+ for i, x in enumerate(a):",
"+ if i + x < n:",
"+ d[i + x] += 1",
"- for i in range(n):",
"- if i - a[i] >= 0:",
"- ans += d[i - a[i]]",
"+ for i, x in enumerate... | false | 0.097186 | 0.040288 | 2.412293 | [
"s560506063",
"s120349657"
] |
u354638986 | p03338 | python | s771685103 | s886635164 | 21 | 17 | 3,064 | 2,940 | Accepted | Accepted | 19.05 | def main():
n, s = int(eval(input())), eval(input())
c_lst = []
for i in range(1, n):
s1, s2 = s[:i], s[i:]
s1_dic = {chr(j):0 for j in range(ord('a'), ord('a')+26)}
for j in range(len(s1)):
s1_dic[s1[j]] = s1_dic.get(s1[j], 0) + 1
s2_dic = {chr(j): ... | def main():
n, s = int(eval(input())), eval(input())
c_lst = []
for i in range(n):
s1, s2 = set(s[:i]), set(s[i:])
c_lst.append(len(s1&s2))
print((max(c_lst)))
if __name__ == '__main__':
main()
| 27 | 13 | 659 | 232 | def main():
n, s = int(eval(input())), eval(input())
c_lst = []
for i in range(1, n):
s1, s2 = s[:i], s[i:]
s1_dic = {chr(j): 0 for j in range(ord("a"), ord("a") + 26)}
for j in range(len(s1)):
s1_dic[s1[j]] = s1_dic.get(s1[j], 0) + 1
s2_dic = {chr(j): 0 for j in ... | def main():
n, s = int(eval(input())), eval(input())
c_lst = []
for i in range(n):
s1, s2 = set(s[:i]), set(s[i:])
c_lst.append(len(s1 & s2))
print((max(c_lst)))
if __name__ == "__main__":
main()
| false | 51.851852 | [
"- for i in range(1, n):",
"- s1, s2 = s[:i], s[i:]",
"- s1_dic = {chr(j): 0 for j in range(ord(\"a\"), ord(\"a\") + 26)}",
"- for j in range(len(s1)):",
"- s1_dic[s1[j]] = s1_dic.get(s1[j], 0) + 1",
"- s2_dic = {chr(j): 0 for j in range(ord(\"a\"), ord(\"a\") + 2... | false | 0.050945 | 0.048324 | 1.054234 | [
"s771685103",
"s886635164"
] |
u640319601 | p02996 | python | s170650855 | s674357874 | 1,256 | 810 | 83,672 | 31,876 | Accepted | Accepted | 35.51 | N = int(eval(input()))
tasks = sorted([tuple(map(int, input().split())) for _ in range(N)], key=lambda x: x[1])
tmp = 0
for c, t in tasks:
tmp += c
if tmp > t:
print('No')
exit()
print('Yes')
| N = int(eval(input()))
tasks = sorted((tuple(map(int, input().split())) for _ in range(N)), key=lambda x: x[1])
tmp = 0
for c, t in tasks:
tmp += c
if tmp > t:
print('No')
exit()
print('Yes')
| 10 | 10 | 220 | 220 | N = int(eval(input()))
tasks = sorted([tuple(map(int, input().split())) for _ in range(N)], key=lambda x: x[1])
tmp = 0
for c, t in tasks:
tmp += c
if tmp > t:
print("No")
exit()
print("Yes")
| N = int(eval(input()))
tasks = sorted((tuple(map(int, input().split())) for _ in range(N)), key=lambda x: x[1])
tmp = 0
for c, t in tasks:
tmp += c
if tmp > t:
print("No")
exit()
print("Yes")
| false | 0 | [
"-tasks = sorted([tuple(map(int, input().split())) for _ in range(N)], key=lambda x: x[1])",
"+tasks = sorted((tuple(map(int, input().split())) for _ in range(N)), key=lambda x: x[1])"
] | false | 0.042624 | 0.035926 | 1.186429 | [
"s170650855",
"s674357874"
] |
u073729602 | p02627 | python | s197525554 | s695702109 | 31 | 26 | 9,024 | 8,988 | Accepted | Accepted | 16.13 | a = eval(input())
if 'A' <= a <= 'Z':
print('A')
else:
print('a') | a = eval(input())
if 'A' <= a <= 'Z':
print('A')
elif 'a' <= a <= 'z':
print('a') | 5 | 5 | 71 | 87 | a = eval(input())
if "A" <= a <= "Z":
print("A")
else:
print("a")
| a = eval(input())
if "A" <= a <= "Z":
print("A")
elif "a" <= a <= "z":
print("a")
| false | 0 | [
"-else:",
"+elif \"a\" <= a <= \"z\":"
] | false | 0.042357 | 0.043119 | 0.982322 | [
"s197525554",
"s695702109"
] |
u976256337 | p03475 | python | s944776755 | s467277367 | 725 | 114 | 26,344 | 3,188 | Accepted | Accepted | 84.28 | from functools import lru_cache
def main():
N = int(eval(input()))
infos = []
for i in range(1,N):
infos.append(tuple(map(int, input().split())))
for i in range(1,N):
current_time = 0
for station_number in range(i,N):
current_time = next_arrival_time(curr... |
N = int(eval(input()))
info = []
for i in range(1,N):
info.append(tuple(map(int, input().split())))
for i in range(N):
t = 0
for j in range(i,N-1):
if t < info[j][1]:
t = info[j][1]
elif t % info[j][2] == 0:
pass
else:
t = t + info[... | 31 | 17 | 806 | 375 | from functools import lru_cache
def main():
N = int(eval(input()))
infos = []
for i in range(1, N):
infos.append(tuple(map(int, input().split())))
for i in range(1, N):
current_time = 0
for station_number in range(i, N):
current_time = next_arrival_time(current_time... | N = int(eval(input()))
info = []
for i in range(1, N):
info.append(tuple(map(int, input().split())))
for i in range(N):
t = 0
for j in range(i, N - 1):
if t < info[j][1]:
t = info[j][1]
elif t % info[j][2] == 0:
pass
else:
t = t + info[j][2] - t % ... | false | 45.16129 | [
"-from functools import lru_cache",
"-",
"-",
"-def main():",
"- N = int(eval(input()))",
"- infos = []",
"- for i in range(1, N):",
"- infos.append(tuple(map(int, input().split())))",
"- for i in range(1, N):",
"- current_time = 0",
"- for station_number in rang... | false | 0.035811 | 0.087204 | 0.410657 | [
"s944776755",
"s467277367"
] |
u515740713 | p02596 | python | s050781584 | s875181383 | 605 | 71 | 158,600 | 66,160 | Accepted | Accepted | 88.26 | import sys
from collections import defaultdict
sys.setrecursionlimit(10**6)
MOD = 10**9+7
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
K = int(readline())
a = defaultdict(int)
cnt = 0
N = 7
while True:
cnt += 1
s = N % K
if s == 0:
... | # -*- coding: utf-8 -*-
import sys
from collections import defaultdict
sys.setrecursionlimit(10**6)
MOD = 10**9+7
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
K = int(readline())
cnt = 0
N = 7
for i in range(K+1):
if N % K == 0:
prin... | 23 | 17 | 467 | 379 | import sys
from collections import defaultdict
sys.setrecursionlimit(10**6)
MOD = 10**9 + 7
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
K = int(readline())
a = defaultdict(int)
cnt = 0
N = 7
while True:
cnt += 1
s = N % K
if s == 0:
print... | # -*- coding: utf-8 -*-
import sys
from collections import defaultdict
sys.setrecursionlimit(10**6)
MOD = 10**9 + 7
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
K = int(readline())
cnt = 0
N = 7
for i in range(K + 1):
if N % K == 0:
print((i + 1))... | false | 26.086957 | [
"+# -*- coding: utf-8 -*-",
"-a = defaultdict(int)",
"-while True:",
"- cnt += 1",
"- s = N % K",
"- if s == 0:",
"- print(cnt)",
"+for i in range(K + 1):",
"+ if N % K == 0:",
"+ print((i + 1))",
"- if s in a:",
"- print((-1))",
"- sys.exit()",
"... | false | 1.174051 | 0.373307 | 3.145005 | [
"s050781584",
"s875181383"
] |
u678167152 | p03721 | python | s848884056 | s822804821 | 374 | 331 | 27,640 | 27,512 | Accepted | Accepted | 11.5 | N, K = list(map(int, input().split()))
A = [list(map(int, input().split())) for _ in range(N)]
A.sort()
for i in range(N):
if K>A[i][1]:
K -= A[i][1]
else:
ans = A[i][0]
break
print(ans) | def solve():
ans = 0
cnt = 0
N, K = list(map(int, input().split()))
A = [list(map(int, input().split())) for _ in range(N)]
A.sort()
for a,b in A:
cnt += b
if cnt>=K:
ans = a
break
return ans
print((solve())) | 10 | 13 | 215 | 246 | N, K = list(map(int, input().split()))
A = [list(map(int, input().split())) for _ in range(N)]
A.sort()
for i in range(N):
if K > A[i][1]:
K -= A[i][1]
else:
ans = A[i][0]
break
print(ans)
| def solve():
ans = 0
cnt = 0
N, K = list(map(int, input().split()))
A = [list(map(int, input().split())) for _ in range(N)]
A.sort()
for a, b in A:
cnt += b
if cnt >= K:
ans = a
break
return ans
print((solve()))
| false | 23.076923 | [
"-N, K = list(map(int, input().split()))",
"-A = [list(map(int, input().split())) for _ in range(N)]",
"-A.sort()",
"-for i in range(N):",
"- if K > A[i][1]:",
"- K -= A[i][1]",
"- else:",
"- ans = A[i][0]",
"- break",
"-print(ans)",
"+def solve():",
"+ ans = 0",
... | false | 0.044517 | 0.043613 | 1.020727 | [
"s848884056",
"s822804821"
] |
u821624310 | p02393 | python | s321560045 | s012639691 | 30 | 20 | 7,644 | 7,696 | Accepted | Accepted | 33.33 | a = list(map(int, input().split()))
for i in range(len(a)):
j = len(a) - 1
while i < j:
if a[j] < a[j-1]:
t = a[j]
a[j] = a[j-1]
a[j-1] = t
j -= 1
for i in range(len(a)):
if i == len(a) - 1:
print(a[i])
else:
print(a[i], ... | n = [int(i) for i in input().split()]
n = sorted(n)
for i in range(3):
if i == 2:
print(n[i])
else:
print(n[i], end = " ")
| 16 | 7 | 338 | 152 | a = list(map(int, input().split()))
for i in range(len(a)):
j = len(a) - 1
while i < j:
if a[j] < a[j - 1]:
t = a[j]
a[j] = a[j - 1]
a[j - 1] = t
j -= 1
for i in range(len(a)):
if i == len(a) - 1:
print(a[i])
else:
print(a[i], end=" ")
| n = [int(i) for i in input().split()]
n = sorted(n)
for i in range(3):
if i == 2:
print(n[i])
else:
print(n[i], end=" ")
| false | 56.25 | [
"-a = list(map(int, input().split()))",
"-for i in range(len(a)):",
"- j = len(a) - 1",
"- while i < j:",
"- if a[j] < a[j - 1]:",
"- t = a[j]",
"- a[j] = a[j - 1]",
"- a[j - 1] = t",
"- j -= 1",
"-for i in range(len(a)):",
"- if i == len(a... | false | 0.038884 | 0.039216 | 0.991521 | [
"s321560045",
"s012639691"
] |
u971811058 | p02631 | python | s044482329 | s330245887 | 188 | 156 | 31,556 | 31,388 | Accepted | Accepted | 17.02 | n = int(input())
a = list(map(int, input().split()))
S=0
for x in a:
S = S^x
for x in a:
print(S^x, "", end="")
| n = int(eval(input()))
a = list(map(int, input().split()))
S=0
for x in a:
S = S^x
for x in a:
print((S^x)) | 7 | 7 | 125 | 113 | n = int(input())
a = list(map(int, input().split()))
S = 0
for x in a:
S = S ^ x
for x in a:
print(S ^ x, "", end="")
| n = int(eval(input()))
a = list(map(int, input().split()))
S = 0
for x in a:
S = S ^ x
for x in a:
print((S ^ x))
| false | 0 | [
"-n = int(input())",
"+n = int(eval(input()))",
"- print(S ^ x, \"\", end=\"\")",
"+ print((S ^ x))"
] | false | 0.032005 | 0.100318 | 0.319032 | [
"s044482329",
"s330245887"
] |
u133936772 | p02947 | python | s671000097 | s872524464 | 396 | 260 | 17,852 | 27,860 | Accepted | Accepted | 34.34 | d,a={},0
for i in range(int(eval(input()))):
k=''.join(sorted(eval(input())))
d[k]=d.get(k,-1)+1
a+=d[k]
print(a) | c={}
for _ in range(int(eval(input()))):
s=tuple(sorted(eval(input())))
c[s]=c.get(s,0)+1
print((sum(v*(v-1)//2 for v in list(c.values())))) | 6 | 5 | 112 | 129 | d, a = {}, 0
for i in range(int(eval(input()))):
k = "".join(sorted(eval(input())))
d[k] = d.get(k, -1) + 1
a += d[k]
print(a)
| c = {}
for _ in range(int(eval(input()))):
s = tuple(sorted(eval(input())))
c[s] = c.get(s, 0) + 1
print((sum(v * (v - 1) // 2 for v in list(c.values()))))
| false | 16.666667 | [
"-d, a = {}, 0",
"-for i in range(int(eval(input()))):",
"- k = \"\".join(sorted(eval(input())))",
"- d[k] = d.get(k, -1) + 1",
"- a += d[k]",
"-print(a)",
"+c = {}",
"+for _ in range(int(eval(input()))):",
"+ s = tuple(sorted(eval(input())))",
"+ c[s] = c.get(s, 0) + 1",
"+print(... | false | 0.044475 | 0.041278 | 1.077468 | [
"s671000097",
"s872524464"
] |
u098012509 | p03032 | python | s092065307 | s228881591 | 1,964 | 84 | 3,064 | 3,064 | Accepted | Accepted | 95.72 | import sys
input = sys.stdin.readline
N, K = [int(x) for x in input().split()]
V = [int(x) for x in input().split()]
ans = 0
for i in range(K + 1):
for j in range(K + 1 - i):
for k in range(K + 1 - i - j):
tmp = list()
tmp.extend(V[:min(i, N)])
tmp.extend(V[ma... | import sys
input = sys.stdin.readline
N, K = [int(x) for x in input().split()]
V = [int(x) for x in input().split()]
ans = 0
for i in range(K + 1):
for j in range(K + 1 - i):
k = K - i - j
tmp = list()
tmp.extend(V[:min(i, N)])
tmp.extend(V[max(i, N - j):N])
tmp.... | 21 | 21 | 541 | 492 | import sys
input = sys.stdin.readline
N, K = [int(x) for x in input().split()]
V = [int(x) for x in input().split()]
ans = 0
for i in range(K + 1):
for j in range(K + 1 - i):
for k in range(K + 1 - i - j):
tmp = list()
tmp.extend(V[: min(i, N)])
tmp.extend(V[max(i, N - j... | import sys
input = sys.stdin.readline
N, K = [int(x) for x in input().split()]
V = [int(x) for x in input().split()]
ans = 0
for i in range(K + 1):
for j in range(K + 1 - i):
k = K - i - j
tmp = list()
tmp.extend(V[: min(i, N)])
tmp.extend(V[max(i, N - j) : N])
tmp.sort(reve... | false | 0 | [
"- for k in range(K + 1 - i - j):",
"- tmp = list()",
"- tmp.extend(V[: min(i, N)])",
"- tmp.extend(V[max(i, N - j) : N])",
"- tmp.sort(reverse=True)",
"- for _ in range(k):",
"- if len(tmp) > 0 and tmp[-1] < 0:",
"- ... | false | 0.037091 | 0.036212 | 1.024284 | [
"s092065307",
"s228881591"
] |
u488401358 | p03973 | python | s837440590 | s412547548 | 542 | 237 | 48,488 | 40,684 | Accepted | Accepted | 56.27 | N=int(eval(input()))
ans=0
val=2
for i in range(N):
a=int(eval(input()))
if i==0:
ans+=a-1
val=2
else:
if a!=val:
ans+=(a-1)//val
else:
val+=1
print(ans)
| import sys
input=sys.stdin.readline
N=int(eval(input()))
ans=0
val=2
for i in range(N):
a=int(eval(input()))
if i==0:
ans+=a-1
val=2
else:
if a!=val:
ans+=(a-1)//val
else:
val+=1
print(ans)
| 15 | 19 | 225 | 267 | N = int(eval(input()))
ans = 0
val = 2
for i in range(N):
a = int(eval(input()))
if i == 0:
ans += a - 1
val = 2
else:
if a != val:
ans += (a - 1) // val
else:
val += 1
print(ans)
| import sys
input = sys.stdin.readline
N = int(eval(input()))
ans = 0
val = 2
for i in range(N):
a = int(eval(input()))
if i == 0:
ans += a - 1
val = 2
else:
if a != val:
ans += (a - 1) // val
else:
val += 1
print(ans)
| false | 21.052632 | [
"+import sys",
"+",
"+input = sys.stdin.readline"
] | false | 0.038706 | 0.068281 | 0.566874 | [
"s837440590",
"s412547548"
] |
u018679195 | p03338 | python | s514995545 | s263457453 | 186 | 18 | 38,384 | 3,060 | Accepted | Accepted | 90.32 | n = int(eval(input()))
s = eval(input())
ans = 0
for i in range(n):
a = list(set(s[:i]))
b = list(set(s[i:]))
l_a = len(a)
l_b = len(b)
c = list(set(a+b))
l_c = len(c)
ans = max(ans,l_a+l_b-l_c)
print(ans) | n = int(eval(input())) - 1
s = eval(input())
result_list = list()
for i in range(n):
x = s[:i+1]
y = s[i+1:]
comon_set_len = len(set(ii for ii in x) & set(iii for iii in y))
result_list.append(comon_set_len)
result_list.sort(reverse = True)
print((result_list[0])) | 12 | 10 | 232 | 275 | n = int(eval(input()))
s = eval(input())
ans = 0
for i in range(n):
a = list(set(s[:i]))
b = list(set(s[i:]))
l_a = len(a)
l_b = len(b)
c = list(set(a + b))
l_c = len(c)
ans = max(ans, l_a + l_b - l_c)
print(ans)
| n = int(eval(input())) - 1
s = eval(input())
result_list = list()
for i in range(n):
x = s[: i + 1]
y = s[i + 1 :]
comon_set_len = len(set(ii for ii in x) & set(iii for iii in y))
result_list.append(comon_set_len)
result_list.sort(reverse=True)
print((result_list[0]))
| false | 16.666667 | [
"-n = int(eval(input()))",
"+n = int(eval(input())) - 1",
"-ans = 0",
"+result_list = list()",
"- a = list(set(s[:i]))",
"- b = list(set(s[i:]))",
"- l_a = len(a)",
"- l_b = len(b)",
"- c = list(set(a + b))",
"- l_c = len(c)",
"- ans = max(ans, l_a + l_b - l_c)",
"-print(a... | false | 0.081756 | 0.036561 | 2.236131 | [
"s514995545",
"s263457453"
] |
u133936772 | p02803 | python | s321271794 | s352233177 | 459 | 333 | 3,424 | 9,404 | Accepted | Accepted | 27.45 | h,w = list(map(int,input().split()))
ls = [eval(input()) for _ in range(h)]
from collections import deque
a = 0
for i in range(h):
for j in range(w):
if ls[i][j]=='#': continue
d = [[-1]*w for _ in range(h)]
d[i][j] = 0
q = deque([(i,j)])
while q:
x,y = q.popleft()
for dx,d... | h,w=list(map(int,input().split()))
g=[[*eval(input())] for _ in range(h)]
from collections import *
a=0
for sx in range(h):
for sy in range(w):
if g[sx][sy]=='#': continue
d=[[-1]*w for _ in range(h)]
d[sx][sy]=0
q=deque([(sx,sy)])
while q:
x,y=q.popleft()
for dx,dy in [(1,... | 20 | 19 | 585 | 543 | h, w = list(map(int, input().split()))
ls = [eval(input()) for _ in range(h)]
from collections import deque
a = 0
for i in range(h):
for j in range(w):
if ls[i][j] == "#":
continue
d = [[-1] * w for _ in range(h)]
d[i][j] = 0
q = deque([(i, j)])
while q:
... | h, w = list(map(int, input().split()))
g = [[*eval(input())] for _ in range(h)]
from collections import *
a = 0
for sx in range(h):
for sy in range(w):
if g[sx][sy] == "#":
continue
d = [[-1] * w for _ in range(h)]
d[sx][sy] = 0
q = deque([(sx, sy)])
while q:
... | false | 5 | [
"-ls = [eval(input()) for _ in range(h)]",
"-from collections import deque",
"+g = [[*eval(input())] for _ in range(h)]",
"+from collections import *",
"-for i in range(h):",
"- for j in range(w):",
"- if ls[i][j] == \"#\":",
"+for sx in range(h):",
"+ for sy in range(w):",
"+ ... | false | 0.035888 | 0.037726 | 0.951301 | [
"s321271794",
"s352233177"
] |
u201387466 | p03163 | python | s643161574 | s434804517 | 268 | 173 | 41,324 | 14,560 | Accepted | Accepted | 35.45 | N,W = list(map(int,input().split()))
dp = [0]*(W+1)
for _ in range(N):
w,v = list(map(int,input().split()))
if w > W:
continue
else:
for j in range(w,W+1)[::-1]:
if dp[j] < dp[j-w]+v:
dp[j] = dp[j-w]+v
print((dp[W])) | import numpy as np
N,W = list(map(int,input().split()))
dp = np.zeros(W+1,dtype = np.int64)
for _ in range(N):
w,v = list(map(int,input().split()))
if w > W:
continue
else:
np.maximum(dp[w:],dp[:-w]+v,out = dp[w:])
print((dp[W])) | 11 | 10 | 268 | 252 | N, W = list(map(int, input().split()))
dp = [0] * (W + 1)
for _ in range(N):
w, v = list(map(int, input().split()))
if w > W:
continue
else:
for j in range(w, W + 1)[::-1]:
if dp[j] < dp[j - w] + v:
dp[j] = dp[j - w] + v
print((dp[W]))
| import numpy as np
N, W = list(map(int, input().split()))
dp = np.zeros(W + 1, dtype=np.int64)
for _ in range(N):
w, v = list(map(int, input().split()))
if w > W:
continue
else:
np.maximum(dp[w:], dp[:-w] + v, out=dp[w:])
print((dp[W]))
| false | 9.090909 | [
"+import numpy as np",
"+",
"-dp = [0] * (W + 1)",
"+dp = np.zeros(W + 1, dtype=np.int64)",
"- for j in range(w, W + 1)[::-1]:",
"- if dp[j] < dp[j - w] + v:",
"- dp[j] = dp[j - w] + v",
"+ np.maximum(dp[w:], dp[:-w] + v, out=dp[w:])"
] | false | 0.04002 | 0.596532 | 0.067088 | [
"s643161574",
"s434804517"
] |
u413019025 | p03624 | python | s022220719 | s162573313 | 34 | 17 | 3,188 | 3,188 | Accepted | Accepted | 50 | #!/usr/bin/env python3
def read_h(typ=int):
return list(map(typ, input().split()))
def read_v(n, typ=int):
return [typ(eval(input())) for _ in range(n)]
def main():
S, = read_h(str)
flag = [False] * 26
for c in S:
i = ord(c) - ord('a')
if not flag[i]:
... | #!/usr/bin/env python3
def read_h(typ=int):
return list(map(typ, input().split()))
def read_v(n, typ=int):
return [typ(eval(input())) for _ in range(n)]
def main():
S = eval(input())
for i in range(26):
c = chr(ord('a') + i)
if c not in S:
print(c)
... | 30 | 25 | 528 | 388 | #!/usr/bin/env python3
def read_h(typ=int):
return list(map(typ, input().split()))
def read_v(n, typ=int):
return [typ(eval(input())) for _ in range(n)]
def main():
(S,) = read_h(str)
flag = [False] * 26
for c in S:
i = ord(c) - ord("a")
if not flag[i]:
flag[i] = True... | #!/usr/bin/env python3
def read_h(typ=int):
return list(map(typ, input().split()))
def read_v(n, typ=int):
return [typ(eval(input())) for _ in range(n)]
def main():
S = eval(input())
for i in range(26):
c = chr(ord("a") + i)
if c not in S:
print(c)
return
... | false | 16.666667 | [
"- (S,) = read_h(str)",
"- flag = [False] * 26",
"- for c in S:",
"- i = ord(c) - ord(\"a\")",
"- if not flag[i]:",
"- flag[i] = True",
"- ans = None",
"- for i, f in enumerate(flag):",
"- if not f:",
"- print((chr(i + ord(\"a\"))))",
"+ ... | false | 0.169023 | 0.129474 | 1.305458 | [
"s022220719",
"s162573313"
] |
u700805562 | p03030 | python | s077092734 | s633574809 | 167 | 18 | 38,384 | 3,060 | Accepted | Accepted | 89.22 | n = int(eval(input()))
sp = [[input().split(), i+1] for i in range(n)]
sp = sorted(sp, key=lambda x:(x[0][0], -int(x[0][1])))
for i in range(n):
print((sp[i][1])) | n = int(eval(input()))
sp = []
for i in range(n):
sp.append(list(map(str, input().split())))
sp[i].append(i+1)
sp = sorted(sp, key=lambda x:int(x[1]), reverse=True)
sp = sorted(sp, key=lambda x:x[0])
for i in range(n):
print((sp[i][2])) | 5 | 9 | 162 | 248 | n = int(eval(input()))
sp = [[input().split(), i + 1] for i in range(n)]
sp = sorted(sp, key=lambda x: (x[0][0], -int(x[0][1])))
for i in range(n):
print((sp[i][1]))
| n = int(eval(input()))
sp = []
for i in range(n):
sp.append(list(map(str, input().split())))
sp[i].append(i + 1)
sp = sorted(sp, key=lambda x: int(x[1]), reverse=True)
sp = sorted(sp, key=lambda x: x[0])
for i in range(n):
print((sp[i][2]))
| false | 44.444444 | [
"-sp = [[input().split(), i + 1] for i in range(n)]",
"-sp = sorted(sp, key=lambda x: (x[0][0], -int(x[0][1])))",
"+sp = []",
"- print((sp[i][1]))",
"+ sp.append(list(map(str, input().split())))",
"+ sp[i].append(i + 1)",
"+sp = sorted(sp, key=lambda x: int(x[1]), reverse=True)",
"+sp = sorte... | false | 0.036467 | 0.035616 | 1.023872 | [
"s077092734",
"s633574809"
] |
u270681687 | p03786 | python | s199810995 | s863209376 | 168 | 145 | 14,320 | 14,320 | Accepted | Accepted | 13.69 | n = int(eval(input()))
a = list(map(int, input().split()))
a.sort()
acum = [0] * (n+1)
for i in range(n):
acum[i+1] += acum[i] + a[i]
ans = 1
for i in reversed(list(range(1, n))):
if a[i] <= 2 * acum[i]:
ans += 1
else:
break
print(ans) | n = int(eval(input()))
a = list(map(int, input().split()))
a.sort()
acum = [0] * (n+1)
# 累積和は0を含んだ0-basedの半開区間でかく(1-indexed)
for i in range(n):
acum[i+1] += acum[i] + a[i]
ans = 1 # i = n-1 の時は必ず全て取り込めるので省いておく
for i in reversed(list(range(n-1))):
if a[i+1] <= 2 * acum[i+1]:
ans += 1
... | 17 | 19 | 271 | 347 | n = int(eval(input()))
a = list(map(int, input().split()))
a.sort()
acum = [0] * (n + 1)
for i in range(n):
acum[i + 1] += acum[i] + a[i]
ans = 1
for i in reversed(list(range(1, n))):
if a[i] <= 2 * acum[i]:
ans += 1
else:
break
print(ans)
| n = int(eval(input()))
a = list(map(int, input().split()))
a.sort()
acum = [0] * (n + 1)
# 累積和は0を含んだ0-basedの半開区間でかく(1-indexed)
for i in range(n):
acum[i + 1] += acum[i] + a[i]
ans = 1 # i = n-1 の時は必ず全て取り込めるので省いておく
for i in reversed(list(range(n - 1))):
if a[i + 1] <= 2 * acum[i + 1]:
ans += 1
else:... | false | 10.526316 | [
"+# 累積和は0を含んだ0-basedの半開区間でかく(1-indexed)",
"-ans = 1",
"-for i in reversed(list(range(1, n))):",
"- if a[i] <= 2 * acum[i]:",
"+ans = 1 # i = n-1 の時は必ず全て取り込めるので省いておく",
"+for i in reversed(list(range(n - 1))):",
"+ if a[i + 1] <= 2 * acum[i + 1]:"
] | false | 0.043218 | 0.046402 | 0.931375 | [
"s199810995",
"s863209376"
] |
u619144316 | p02803 | python | s370178335 | s641934359 | 1,231 | 643 | 3,316 | 3,444 | Accepted | Accepted | 47.77 | from collections import defaultdict,deque
H, W = list(map(int,input().split()))
MAP = []
for _ in range(H):
MAP.append(tuple(map(str,eval(input()))))
move = [[0,1],[0,-1],[1,0],[-1,0]]
MAX = 0
def bfs(s):
global MAX
stack = deque([])
stack.append(tuple(s))
depth =dict()
depth[tu... | from collections import defaultdict,deque
H, W = list(map(int,input().split()))
MAP = []
for _ in range(H):
MAP.append(tuple(map(str,eval(input()))))
move = [[0,1],[0,-1],[1,0],[-1,0]]
MAX = 0
def bfs(s):
global MAX
stack = deque([])
stack.append(tuple(s))
depth =dict()
depth[tu... | 39 | 33 | 948 | 835 | from collections import defaultdict, deque
H, W = list(map(int, input().split()))
MAP = []
for _ in range(H):
MAP.append(tuple(map(str, eval(input()))))
move = [[0, 1], [0, -1], [1, 0], [-1, 0]]
MAX = 0
def bfs(s):
global MAX
stack = deque([])
stack.append(tuple(s))
depth = dict()
depth[tuple... | from collections import defaultdict, deque
H, W = list(map(int, input().split()))
MAP = []
for _ in range(H):
MAP.append(tuple(map(str, eval(input()))))
move = [[0, 1], [0, -1], [1, 0], [-1, 0]]
MAX = 0
def bfs(s):
global MAX
stack = deque([])
stack.append(tuple(s))
depth = dict()
depth[tuple... | false | 15.384615 | [
"-for i in range(0, W):",
"- for j in range(0, H):",
"- if MAP[j][i] == \".\":",
"- bfs(tuple([j, i]))"
] | false | 0.035219 | 0.122699 | 0.287037 | [
"s370178335",
"s641934359"
] |
u017810624 | p03152 | python | s270597541 | s526447308 | 603 | 271 | 3,316 | 41,580 | Accepted | Accepted | 55.06 | s,a,b=[set(map(int,input().split()))for j in[0]*3];c=1;N=M=0;x=max(a)
for k in range(x,0,-1):
A=k in a;B=k in b
if A and B:M+=1;N+=1
elif A:c*=M;N+=1
elif B:c*=N;M+=1
else:c*=M*N-x+k
c%=10**9+7
print(c) | s,a,b=[set(map(int,input().split()))for j in[0]*3];c=1;N=M=0;k=x=max(a)
while k:A=k in a;B=k in b;N+=A;M+=B;c*=[M*N-x+k,N,M,1][A*2+B];c%=10**9+7;k-=1
print(c) | 9 | 3 | 216 | 160 | s, a, b = [set(map(int, input().split())) for j in [0] * 3]
c = 1
N = M = 0
x = max(a)
for k in range(x, 0, -1):
A = k in a
B = k in b
if A and B:
M += 1
N += 1
elif A:
c *= M
N += 1
elif B:
c *= N
M += 1
else:
c *= M * N - x + k
c %= 1... | s, a, b = [set(map(int, input().split())) for j in [0] * 3]
c = 1
N = M = 0
k = x = max(a)
while k:
A = k in a
B = k in b
N += A
M += B
c *= [M * N - x + k, N, M, 1][A * 2 + B]
c %= 10**9 + 7
k -= 1
print(c)
| false | 66.666667 | [
"-x = max(a)",
"-for k in range(x, 0, -1):",
"+k = x = max(a)",
"+while k:",
"- if A and B:",
"- M += 1",
"- N += 1",
"- elif A:",
"- c *= M",
"- N += 1",
"- elif B:",
"- c *= N",
"- M += 1",
"- else:",
"- c *= M * N - x + k",
... | false | 0.035697 | 0.034774 | 1.026533 | [
"s270597541",
"s526447308"
] |
u755363325 | p03006 | python | s387443845 | s503646795 | 918 | 519 | 42,428 | 40,976 | Accepted | Accepted | 43.46 | n = int(eval(input()))
x = []
y = []
for _ in range(n):
line = list(map(int, input().split()))
x.append(line[0])
y.append(line[1])
if n >= 2:
slope = []
for i in range(n):
for j in range(n):
if i != j:
X = x[j] - x[i]
Y = y[j] - y[i]
... | n = int(eval(input()))
x = []
y = []
for _ in range(n):
line = list(map(int, input().split()))
x.append(line[0])
y.append(line[1])
if n >= 2:
slope = []
for i in range(n):
for j in range(i+1, n):
X = x[j] - x[i]
Y = y[j] - y[i]
if X != 0:
... | 21 | 26 | 467 | 606 | n = int(eval(input()))
x = []
y = []
for _ in range(n):
line = list(map(int, input().split()))
x.append(line[0])
y.append(line[1])
if n >= 2:
slope = []
for i in range(n):
for j in range(n):
if i != j:
X = x[j] - x[i]
Y = y[j] - y[i]
... | n = int(eval(input()))
x = []
y = []
for _ in range(n):
line = list(map(int, input().split()))
x.append(line[0])
y.append(line[1])
if n >= 2:
slope = []
for i in range(n):
for j in range(i + 1, n):
X = x[j] - x[i]
Y = y[j] - y[i]
if X != 0:
... | false | 19.230769 | [
"- for j in range(n):",
"- if i != j:",
"- X = x[j] - x[i]",
"- Y = y[j] - y[i]",
"- slope.append([X, Y])",
"+ for j in range(i + 1, n):",
"+ X = x[j] - x[i]",
"+ Y = y[j] - y[i]",
"+ if X != 0:",
... | false | 0.03661 | 0.03574 | 1.02436 | [
"s387443845",
"s503646795"
] |
u629454253 | p02757 | python | s665216971 | s141866545 | 426 | 391 | 17,396 | 17,168 | Accepted | Accepted | 8.22 | N, P = list(map(int, input().split()))
S = eval(input())
mods = [0] * (N+1)
for i in range(N-1, -1, -1):
mods[i] = (int(S[i])*pow(10, N-i-1, P)+mods[i+1]) % P
c = dict()
for m in mods:
c[m] = c.get(m, 0)+1
ans = 0
if P == 2 or P == 5:
for i, s in enumerate(S):
s = int(s)
if s % P == 0:
... | N, P = list(map(int, input().split()))
S = eval(input())
mods = [0] * (N+1)
for i in range(N-1, -1, -1):
mods[i] = (int(S[i])*pow(10, N-i-1, P)+mods[i+1]) % P
c = dict()
for m in mods:
c[m] = c.get(m, 0)+1
ans = 0
if P == 2 or P == 5:
for i, s in enumerate(S):
s = int(s)
if s % P == 0:
... | 22 | 21 | 409 | 393 | N, P = list(map(int, input().split()))
S = eval(input())
mods = [0] * (N + 1)
for i in range(N - 1, -1, -1):
mods[i] = (int(S[i]) * pow(10, N - i - 1, P) + mods[i + 1]) % P
c = dict()
for m in mods:
c[m] = c.get(m, 0) + 1
ans = 0
if P == 2 or P == 5:
for i, s in enumerate(S):
s = int(s)
if s... | N, P = list(map(int, input().split()))
S = eval(input())
mods = [0] * (N + 1)
for i in range(N - 1, -1, -1):
mods[i] = (int(S[i]) * pow(10, N - i - 1, P) + mods[i + 1]) % P
c = dict()
for m in mods:
c[m] = c.get(m, 0) + 1
ans = 0
if P == 2 or P == 5:
for i, s in enumerate(S):
s = int(s)
if s... | false | 4.545455 | [
"- for i in range(N):",
"- c[mods[i]] -= 1",
"- ans += c[mods[i]]",
"+ for key in c:",
"+ ans += c[key] * (c[key] - 1) // 2"
] | false | 0.036419 | 0.038613 | 0.94317 | [
"s665216971",
"s141866545"
] |
u969850098 | p02959 | python | s055327829 | s157658129 | 156 | 140 | 18,624 | 19,156 | Accepted | Accepted | 10.26 | N = int(eval(input()))
mosters = list(map(int, input().split()))
heros = list(map(int, input().split()))
cnt = 0
for i in range(N):
if heros[i] <= mosters[i]:
cnt += heros[i]
else:
cnt += mosters[i]
if (heros[i] - mosters[i]) >= mosters[i+1]:
cnt += mosters[i+1]
... | def main():
N = int(eval(input()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
ans = 0
for i in range(N):
b = B[i]
if A[i] >= b:
ans += b
else:
b -= A[i]
ans += (A[i] + min(b, A[i+1]))
A... | 18 | 20 | 466 | 402 | N = int(eval(input()))
mosters = list(map(int, input().split()))
heros = list(map(int, input().split()))
cnt = 0
for i in range(N):
if heros[i] <= mosters[i]:
cnt += heros[i]
else:
cnt += mosters[i]
if (heros[i] - mosters[i]) >= mosters[i + 1]:
cnt += mosters[i + 1]
... | def main():
N = int(eval(input()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
ans = 0
for i in range(N):
b = B[i]
if A[i] >= b:
ans += b
else:
b -= A[i]
ans += A[i] + min(b, A[i + 1])
A[i + 1] = max(... | false | 10 | [
"-N = int(eval(input()))",
"-mosters = list(map(int, input().split()))",
"-heros = list(map(int, input().split()))",
"-cnt = 0",
"-for i in range(N):",
"- if heros[i] <= mosters[i]:",
"- cnt += heros[i]",
"- else:",
"- cnt += mosters[i]",
"- if (heros[i] - mosters[i]) >=... | false | 0.049453 | 0.046284 | 1.068481 | [
"s055327829",
"s157658129"
] |
u109272021 | p02688 | python | s537775075 | s145602860 | 33 | 28 | 9,304 | 9,276 | Accepted | Accepted | 15.15 | n,k = list(map(int,input().split()))
people = list(range(1,n+1))
li = []
for i in range(k) :
gomi = eval(input())
[li.append(int(j)) for j in input().split()]
st = set(li)
ans = 0
for i in people :
if not i in st :
ans += 1
print(ans) | n,k = list(map(int,input().split()))
li = []
for i in range(k) :
gomi = eval(input())
[li.append(int(j)) for j in input().split()]
st = set(li)
print((n - len(st))) | 14 | 9 | 249 | 166 | n, k = list(map(int, input().split()))
people = list(range(1, n + 1))
li = []
for i in range(k):
gomi = eval(input())
[li.append(int(j)) for j in input().split()]
st = set(li)
ans = 0
for i in people:
if not i in st:
ans += 1
print(ans)
| n, k = list(map(int, input().split()))
li = []
for i in range(k):
gomi = eval(input())
[li.append(int(j)) for j in input().split()]
st = set(li)
print((n - len(st)))
| false | 35.714286 | [
"-people = list(range(1, n + 1))",
"-ans = 0",
"-for i in people:",
"- if not i in st:",
"- ans += 1",
"-print(ans)",
"+print((n - len(st)))"
] | false | 0.037421 | 0.072357 | 0.517176 | [
"s537775075",
"s145602860"
] |
u257442624 | p02706 | python | s363792422 | s847623846 | 22 | 20 | 10,124 | 10,048 | Accepted | Accepted | 9.09 | NM = list(map(int, input().split()))
N, M = NM[0],NM[1]
a = list(map(int, input().split()))
if sum(a)> N:
print((-1))
else:
print((N - sum(a))) | NM = list(map(int, input().split()))
N, M = NM[0],NM[1]
a = list(map(int, input().split()))
A = sum(a)
if A> N:
print((-1))
else:
print((N - A)) | 8 | 8 | 156 | 156 | NM = list(map(int, input().split()))
N, M = NM[0], NM[1]
a = list(map(int, input().split()))
if sum(a) > N:
print((-1))
else:
print((N - sum(a)))
| NM = list(map(int, input().split()))
N, M = NM[0], NM[1]
a = list(map(int, input().split()))
A = sum(a)
if A > N:
print((-1))
else:
print((N - A))
| false | 0 | [
"-if sum(a) > N:",
"+A = sum(a)",
"+if A > N:",
"- print((N - sum(a)))",
"+ print((N - A))"
] | false | 0.036233 | 0.042613 | 0.850282 | [
"s363792422",
"s847623846"
] |
u392319141 | p02757 | python | s207495711 | s708520336 | 530 | 474 | 42,932 | 3,500 | Accepted | Accepted | 10.57 | from collections import defaultdict
N, P = list(map(int, input().split()))
S = eval(input())
def solMin():
dp = [[0] * P for _ in range(N + 1)]
for i, s in enumerate(map(int, S), start=1):
dp[i][s % P] += 1
for p in range(P):
dp[i][(p * 10 + s) % P] += dp[i - 1][p]
... | N, P = list(map(int, input().split()))
S = eval(input())
def smallSol():
dp = [0] * P
ans = 0
for s in map(int, S):
newDp = [0] * P
newDp[s % P] += 1
for p in range(P):
newDp[(p * 10 + s) % P] += dp[p]
dp = newDp
ans += dp[0]
return ans
... | 31 | 27 | 702 | 604 | from collections import defaultdict
N, P = list(map(int, input().split()))
S = eval(input())
def solMin():
dp = [[0] * P for _ in range(N + 1)]
for i, s in enumerate(map(int, S), start=1):
dp[i][s % P] += 1
for p in range(P):
dp[i][(p * 10 + s) % P] += dp[i - 1][p]
return sum(... | N, P = list(map(int, input().split()))
S = eval(input())
def smallSol():
dp = [0] * P
ans = 0
for s in map(int, S):
newDp = [0] * P
newDp[s % P] += 1
for p in range(P):
newDp[(p * 10 + s) % P] += dp[p]
dp = newDp
ans += dp[0]
return ans
def largeSo... | false | 12.903226 | [
"-from collections import defaultdict",
"-",
"-def solMin():",
"- dp = [[0] * P for _ in range(N + 1)]",
"- for i, s in enumerate(map(int, S), start=1):",
"- dp[i][s % P] += 1",
"+def smallSol():",
"+ dp = [0] * P",
"+ ans = 0",
"+ for s in map(int, S):",
"+ newDp = ... | false | 0.041569 | 0.046409 | 0.895724 | [
"s207495711",
"s708520336"
] |
u073852194 | p03422 | python | s625230989 | s521999308 | 193 | 171 | 73,216 | 69,924 | Accepted | Accepted | 11.4 | N = int(eval(input()))
def grundy(x, k):
while x % k != 0:
p = max(1, (x - x // k * k) // (x // k + 1))
x = x - (x // k + 1) * p
return x // k
g = 0
for _ in range(N):
a, k = list(map(int, input().split()))
g ^= grundy(a, k)
print(('Takahashi' if g != 0 else 'Aoki')) | N = int(eval(input()))
g = 0
for _ in range(N):
x, k = list(map(int, input().split()))
while x % k != 0:
x = x - (x // k + 1) * max(1, (x - x // k * k) // (x // k + 1))
g ^= x // k
print(('Takahashi' if g != 0 else 'Aoki')) | 15 | 8 | 303 | 236 | N = int(eval(input()))
def grundy(x, k):
while x % k != 0:
p = max(1, (x - x // k * k) // (x // k + 1))
x = x - (x // k + 1) * p
return x // k
g = 0
for _ in range(N):
a, k = list(map(int, input().split()))
g ^= grundy(a, k)
print(("Takahashi" if g != 0 else "Aoki"))
| N = int(eval(input()))
g = 0
for _ in range(N):
x, k = list(map(int, input().split()))
while x % k != 0:
x = x - (x // k + 1) * max(1, (x - x // k * k) // (x // k + 1))
g ^= x // k
print(("Takahashi" if g != 0 else "Aoki"))
| false | 46.666667 | [
"-",
"-",
"-def grundy(x, k):",
"- while x % k != 0:",
"- p = max(1, (x - x // k * k) // (x // k + 1))",
"- x = x - (x // k + 1) * p",
"- return x // k",
"-",
"-",
"- a, k = list(map(int, input().split()))",
"- g ^= grundy(a, k)",
"+ x, k = list(map(int, input().sp... | false | 0.034033 | 0.041932 | 0.81163 | [
"s625230989",
"s521999308"
] |
u397638621 | p02712 | python | s422289655 | s630612128 | 121 | 22 | 29,896 | 9,188 | Accepted | Accepted | 81.82 | N = int(eval(input()))
print((sum([i for i in range(1, N+1) if i%5!=0 and i%3!=0]))) | k = int(eval(input()))
a = (1 + k) * k // 2
three = (3+3*(k//3)) * (k // 3) // 2
five = (5+5*(k//5)) * (k // 5) // 2
fifteen = (15+15*(k//15)) * (k // 15) // 2
print((a-three-five+fifteen)) | 2 | 6 | 77 | 186 | N = int(eval(input()))
print((sum([i for i in range(1, N + 1) if i % 5 != 0 and i % 3 != 0])))
| k = int(eval(input()))
a = (1 + k) * k // 2
three = (3 + 3 * (k // 3)) * (k // 3) // 2
five = (5 + 5 * (k // 5)) * (k // 5) // 2
fifteen = (15 + 15 * (k // 15)) * (k // 15) // 2
print((a - three - five + fifteen))
| false | 66.666667 | [
"-N = int(eval(input()))",
"-print((sum([i for i in range(1, N + 1) if i % 5 != 0 and i % 3 != 0])))",
"+k = int(eval(input()))",
"+a = (1 + k) * k // 2",
"+three = (3 + 3 * (k // 3)) * (k // 3) // 2",
"+five = (5 + 5 * (k // 5)) * (k // 5) // 2",
"+fifteen = (15 + 15 * (k // 15)) * (k // 15) // 2",
"... | false | 0.099278 | 0.10994 | 0.903017 | [
"s422289655",
"s630612128"
] |
u327466606 | p03160 | python | s598476478 | s364719778 | 242 | 127 | 55,144 | 13,980 | Accepted | Accepted | 47.52 | N = int(eval(input()))
H = list(map(int,input().split()))
dp = [0,abs(H[1]-H[0])]
for i in range(2,N):
h = H[i]
dp.append(min(dp[-2]+abs(H[i-2]-h), dp[-1]+abs(H[i-1]-h)))
print((dp[-1])) | N = int(eval(input()))
H = list(map(int,input().split()))
dp = [0]*N
dp[1] = abs(H[0]-H[1])
for i in range(2,N):
dp[i] = min(abs(H[i]-H[i-1]) + dp[i-1], abs(H[i]-H[i-2]) + dp[i-2])
print((dp[-1])) | 10 | 9 | 194 | 202 | N = int(eval(input()))
H = list(map(int, input().split()))
dp = [0, abs(H[1] - H[0])]
for i in range(2, N):
h = H[i]
dp.append(min(dp[-2] + abs(H[i - 2] - h), dp[-1] + abs(H[i - 1] - h)))
print((dp[-1]))
| N = int(eval(input()))
H = list(map(int, input().split()))
dp = [0] * N
dp[1] = abs(H[0] - H[1])
for i in range(2, N):
dp[i] = min(abs(H[i] - H[i - 1]) + dp[i - 1], abs(H[i] - H[i - 2]) + dp[i - 2])
print((dp[-1]))
| false | 10 | [
"-dp = [0, abs(H[1] - H[0])]",
"+dp = [0] * N",
"+dp[1] = abs(H[0] - H[1])",
"- h = H[i]",
"- dp.append(min(dp[-2] + abs(H[i - 2] - h), dp[-1] + abs(H[i - 1] - h)))",
"+ dp[i] = min(abs(H[i] - H[i - 1]) + dp[i - 1], abs(H[i] - H[i - 2]) + dp[i - 2])"
] | false | 0.082352 | 0.090118 | 0.913826 | [
"s598476478",
"s364719778"
] |
u160041984 | p00424 | python | s956269402 | s814849738 | 260 | 140 | 7,748 | 7,900 | Accepted | Accepted | 46.15 | while True:
n = int(eval(input()))
if n == 0:break
c = {}
for _ in range(n):
a,b = input().split()
c[a] = b
m = int(eval(input()))
ans = ''
for _ in range(m):
a = input()[0]
ans+=c[a] if a in c else a
print(ans) | import sys
cin = sys.stdin
while True:
n = int(cin.readline())
if n == 0:break
c = {}
for _ in range(n):
a,b = cin.readline().strip().split()
c[a] = b
m = int(cin.readline())
ans = ''
for _ in range(m):
a = cin.readline().strip()
ans+=c[a] if a in... | 13 | 15 | 275 | 345 | while True:
n = int(eval(input()))
if n == 0:
break
c = {}
for _ in range(n):
a, b = input().split()
c[a] = b
m = int(eval(input()))
ans = ""
for _ in range(m):
a = input()[0]
ans += c[a] if a in c else a
print(ans)
| import sys
cin = sys.stdin
while True:
n = int(cin.readline())
if n == 0:
break
c = {}
for _ in range(n):
a, b = cin.readline().strip().split()
c[a] = b
m = int(cin.readline())
ans = ""
for _ in range(m):
a = cin.readline().strip()
ans += c[a] if a in... | false | 13.333333 | [
"+import sys",
"+",
"+cin = sys.stdin",
"- n = int(eval(input()))",
"+ n = int(cin.readline())",
"- a, b = input().split()",
"+ a, b = cin.readline().strip().split()",
"- m = int(eval(input()))",
"+ m = int(cin.readline())",
"- a = input()[0]",
"+ a = cin.... | false | 0.040688 | 0.040059 | 1.015701 | [
"s956269402",
"s814849738"
] |
u487861672 | p02343 | python | s085203682 | s662544351 | 3,930 | 910 | 7,360 | 7,612 | Accepted | Accepted | 76.84 | class DisjointSetElement():
def __init__(self):
self.parent = None
self.anc = self
def ancestor(self):
s = self.anc
while s.parent is not None:
s = s.parent
self.anc = s
return s
def unite(self, y):
ax = self.ancestor()
... | class DisjointSetElement():
def __init__(self, x):
self.parent = x
self.rank = 0
class DisjointSet():
def __init__(self, n):
self.elems = [DisjointSetElement(n) for n in range(n)]
def _find_set(self, x):
if x != self.elems[x].parent:
self.elems[x].p... | 38 | 45 | 874 | 1,173 | class DisjointSetElement:
def __init__(self):
self.parent = None
self.anc = self
def ancestor(self):
s = self.anc
while s.parent is not None:
s = s.parent
self.anc = s
return s
def unite(self, y):
ax = self.ancestor()
ay = y.ances... | class DisjointSetElement:
def __init__(self, x):
self.parent = x
self.rank = 0
class DisjointSet:
def __init__(self, n):
self.elems = [DisjointSetElement(n) for n in range(n)]
def _find_set(self, x):
if x != self.elems[x].parent:
self.elems[x].parent = self._fi... | false | 15.555556 | [
"- def __init__(self):",
"- self.parent = None",
"- self.anc = self",
"+ def __init__(self, x):",
"+ self.parent = x",
"+ self.rank = 0",
"- def ancestor(self):",
"- s = self.anc",
"- while s.parent is not None:",
"- s = s.parent",
"-... | false | 0.136645 | 0.053066 | 2.574988 | [
"s085203682",
"s662544351"
] |
u349449706 | p02954 | python | s200560434 | s005570027 | 358 | 101 | 84,300 | 78,988 | Accepted | Accepted | 71.79 | S = eval(input())
n = len(S)
A = [0] * n
p = -1
for i in range(n-1):
if S[i] == 'R' and S[i+1] == 'L':
for j in range(p+1, i+1):
if S[j] == 'R':
if (i+1-j)%2==0:
A[i+1]+=1
else:
A[i]+=1
p = i
p = n
for ... | S = eval(input())
n = len(S)
A = [0] * n
p = 0
for i in range(n-1):
if S[i] == 'R' and S[i+1] == 'L':
for j in range(p, i+1):
if S[j] == 'R':
if (i+1-j)%2==0:
A[i+1]+=1
else:
A[i]+=1
p = i + 1
p = n - 1
... | 24 | 24 | 613 | 595 | S = eval(input())
n = len(S)
A = [0] * n
p = -1
for i in range(n - 1):
if S[i] == "R" and S[i + 1] == "L":
for j in range(p + 1, i + 1):
if S[j] == "R":
if (i + 1 - j) % 2 == 0:
A[i + 1] += 1
else:
A[i] += 1
p = i
p ... | S = eval(input())
n = len(S)
A = [0] * n
p = 0
for i in range(n - 1):
if S[i] == "R" and S[i + 1] == "L":
for j in range(p, i + 1):
if S[j] == "R":
if (i + 1 - j) % 2 == 0:
A[i + 1] += 1
else:
A[i] += 1
p = i + 1
p =... | false | 0 | [
"-p = -1",
"+p = 0",
"- for j in range(p + 1, i + 1):",
"+ for j in range(p, i + 1):",
"- p = i",
"-p = n",
"+ p = i + 1",
"+p = n - 1",
"- for j in range(p - 1, i - 1, -1):",
"+ for j in range(p, i - 1, -1):",
"- p = i",
"-print((\" \".join(str... | false | 0.084142 | 0.034411 | 2.445187 | [
"s200560434",
"s005570027"
] |
u794173881 | p02768 | python | s535567403 | s922936984 | 197 | 68 | 54,256 | 63,232 | Accepted | Accepted | 65.48 | class Combination:
"""階乗とその逆元のテーブルをO(N)で事前作成し、組み合わせの計算をO(1)で行う"""
def __init__(self, n, MOD):
self.fact = [1]
for i in range(1, n + 1):
self.fact.append(self.fact[-1] * i % MOD)
self.inv_fact = [0] * (n + 1)
self.inv_fact[n] = pow(self.fact[n], MOD - 2, MOD)
... | import sys
input = sys.stdin.buffer.readline
def combination(k, r, MOD):
"""kCrを求める"""
if k < r:
return 0
r = min(r, k - r)
numer, denom = 1, 1
for l in range(r):
numer *= (k - l)
numer %= MOD
denom *= l + 1
denom %= MOD
return numer * pow... | 53 | 28 | 1,537 | 560 | class Combination:
"""階乗とその逆元のテーブルをO(N)で事前作成し、組み合わせの計算をO(1)で行う"""
def __init__(self, n, MOD):
self.fact = [1]
for i in range(1, n + 1):
self.fact.append(self.fact[-1] * i % MOD)
self.inv_fact = [0] * (n + 1)
self.inv_fact[n] = pow(self.fact[n], MOD - 2, MOD)
... | import sys
input = sys.stdin.buffer.readline
def combination(k, r, MOD):
"""kCrを求める"""
if k < r:
return 0
r = min(r, k - r)
numer, denom = 1, 1
for l in range(r):
numer *= k - l
numer %= MOD
denom *= l + 1
denom %= MOD
return numer * pow(denom, MOD - 2,... | false | 47.169811 | [
"-class Combination:",
"- \"\"\"階乗とその逆元のテーブルをO(N)で事前作成し、組み合わせの計算をO(1)で行う\"\"\"",
"+import sys",
"- def __init__(self, n, MOD):",
"- self.fact = [1]",
"- for i in range(1, n + 1):",
"- self.fact.append(self.fact[-1] * i % MOD)",
"- self.inv_fact = [0] * (n + 1)",
... | false | 0.263942 | 0.27322 | 0.966042 | [
"s535567403",
"s922936984"
] |
u499381410 | p03805 | python | s527305718 | s019519761 | 234 | 213 | 47,216 | 40,688 | Accepted | Accepted | 8.97 | from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
import math
import bisect
import random
from itertools import permutations, accumulate, combinations
import sys
import string
from bisect import bisect_left, bisect_right
from math import factorial, ceil, floor
fr... | from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
import math
import bisect
import random
from itertools import permutations, accumulate, combinations, product
import sys
from pprint import pprint
from copy import deepcopy
import string
from bisect import bisect_... | 51 | 48 | 1,232 | 1,439 | from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
import math
import bisect
import random
from itertools import permutations, accumulate, combinations
import sys
import string
from bisect import bisect_left, bisect_right
from math import factorial, ceil, floor
from functoo... | from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
import math
import bisect
import random
from itertools import permutations, accumulate, combinations, product
import sys
from pprint import pprint
from copy import deepcopy
import string
from bisect import bisect_left, bise... | false | 5.882353 | [
"-from itertools import permutations, accumulate, combinations",
"+from itertools import permutations, accumulate, combinations, product",
"+from pprint import pprint",
"+from copy import deepcopy",
"+from operator import mul",
"+from pprint import pprint",
"-INF = float(\"inf\")",
"+sys.setrecursionl... | false | 0.055358 | 0.043739 | 1.265656 | [
"s527305718",
"s019519761"
] |
u926393759 | p03855 | python | s283408236 | s641605083 | 1,523 | 1,038 | 56,312 | 36,204 | Accepted | Accepted | 31.85 | # -*- coding: utf-8 -*-
"""
Created on Wed Sep 11 11:26:39 2019
D - 連結 / Connectivity
実行時間制限: 2 sec / メモリ制限: 256 MB
配点 :
400 点
@author: justwah
"""
from collections import Counter
class UnionFind:
def __init__(self, N):
self.rank = [0]*N
self.parent = [i for i in range(N)]
... | def Find(x, par):
if par[x] < 0:
return x
else:
par[x] = Find(par[x], par)
return par[x]
def Unite(x, y, par, rank):
x = Find(x, par)
y = Find(y, par)
if x != y:
if rank[x] < rank[y]:
par[x] = y
else:
par[y] = x
if rank[x] == rank[y]:
rank[x] ... | 66 | 52 | 1,629 | 931 | # -*- coding: utf-8 -*-
"""
Created on Wed Sep 11 11:26:39 2019
D - 連結 / Connectivity
実行時間制限: 2 sec / メモリ制限: 256 MB
配点 :
400 点
@author: justwah
"""
from collections import Counter
class UnionFind:
def __init__(self, N):
self.rank = [0] * N
self.parent = [i for i in range(N)]
self.n = N
... | def Find(x, par):
if par[x] < 0:
return x
else:
par[x] = Find(par[x], par)
return par[x]
def Unite(x, y, par, rank):
x = Find(x, par)
y = Find(y, par)
if x != y:
if rank[x] < rank[y]:
par[x] = y
else:
par[y] = x
if rank[x]... | false | 21.212121 | [
"-# -*- coding: utf-8 -*-",
"-\"\"\"",
"-Created on Wed Sep 11 11:26:39 2019",
"-D - 連結 / Connectivity",
"-実行時間制限: 2 sec / メモリ制限: 256 MB",
"-配点 :",
"-400 点",
"-@author: justwah",
"-\"\"\"",
"-from collections import Counter",
"+def Find(x, par):",
"+ if par[x] < 0:",
"+ return x",
... | false | 0.045772 | 0.046043 | 0.994106 | [
"s283408236",
"s641605083"
] |
u206570055 | p03200 | python | s335434198 | s268272095 | 106 | 82 | 3,500 | 3,500 | Accepted | Accepted | 22.64 | S = eval(input())
length = len(S)
countB = 0
for c in S:
if c == 'B':
countB += 1
soko = 1
ans = 0
for i in range(length):
if S[-i-1] == 'B':
ans += i + 1 - soko
soko += 1
print(ans) | S = eval(input())
length = len(S)
soko = 1
ans = 0
for i in range(length):
if S[-i-1] == 'B':
ans += i + 1 - soko
soko += 1
print(ans) | 13 | 9 | 221 | 157 | S = eval(input())
length = len(S)
countB = 0
for c in S:
if c == "B":
countB += 1
soko = 1
ans = 0
for i in range(length):
if S[-i - 1] == "B":
ans += i + 1 - soko
soko += 1
print(ans)
| S = eval(input())
length = len(S)
soko = 1
ans = 0
for i in range(length):
if S[-i - 1] == "B":
ans += i + 1 - soko
soko += 1
print(ans)
| false | 30.769231 | [
"-countB = 0",
"-for c in S:",
"- if c == \"B\":",
"- countB += 1"
] | false | 0.044088 | 0.045658 | 0.965625 | [
"s335434198",
"s268272095"
] |
u033183216 | p02727 | python | s870980854 | s646010311 | 359 | 170 | 112,236 | 102,800 | Accepted | Accepted | 52.65 | def red_and_green_apples(X, Y, A, B, C, P, Q, R):
P.sort(reverse=True)
Q.sort(reverse=True)
R.sort(reverse=True)
P = P[:X]
Q = Q[:Y]
q = P + Q + R
q.sort(reverse=True)
return sum(q[:X + Y])
X, Y, A, B, C = list(map(int, input().split()))
P = list(map(int, input().split(... | X, Y, A, B, C = list(map(int, input().split()))
P = list(map(int, input().split()))
Q = list(map(int, input().split()))
R = list(map(int, input().split()))
P.sort(reverse=True)
Q.sort(reverse=True)
R.sort(reverse=True)
a = P[:X] + Q[:Y] + R
a.sort(reverse=True)
print((sum(a[:X + Y])))
| 33 | 13 | 643 | 293 | def red_and_green_apples(X, Y, A, B, C, P, Q, R):
P.sort(reverse=True)
Q.sort(reverse=True)
R.sort(reverse=True)
P = P[:X]
Q = Q[:Y]
q = P + Q + R
q.sort(reverse=True)
return sum(q[: X + Y])
X, Y, A, B, C = list(map(int, input().split()))
P = list(map(int, input().split()))
Q = list(ma... | X, Y, A, B, C = list(map(int, input().split()))
P = list(map(int, input().split()))
Q = list(map(int, input().split()))
R = list(map(int, input().split()))
P.sort(reverse=True)
Q.sort(reverse=True)
R.sort(reverse=True)
a = P[:X] + Q[:Y] + R
a.sort(reverse=True)
print((sum(a[: X + Y])))
| false | 60.606061 | [
"-def red_and_green_apples(X, Y, A, B, C, P, Q, R):",
"- P.sort(reverse=True)",
"- Q.sort(reverse=True)",
"- R.sort(reverse=True)",
"- P = P[:X]",
"- Q = Q[:Y]",
"- q = P + Q + R",
"- q.sort(reverse=True)",
"- return sum(q[: X + Y])",
"-",
"-",
"-print((red_and_green_ap... | false | 0.035579 | 0.04162 | 0.854849 | [
"s870980854",
"s646010311"
] |
u670180528 | p04002 | python | s555928579 | s691592137 | 1,031 | 865 | 210,424 | 124,424 | Accepted | Accepted | 16.1 | from collections import Counter as C;r=list(range(3));H,W,N,*L=list(map(int,open(0).read().split()));K=[];M=[0]*10;M[0]=(H-2)*(W-2)
for a,b in zip(*[iter(L)]*2):
for x in r:
for y in r:
if H-1>a-y>0<b-x<W-1:K+=[(a-y,b-x)]
for k,v in list(C(list(C(K).values())).items()):M[0]-=v;M[k]+=v
print((*M)) | from collections import Counter as C;r=list(range(3))
def s():
H,W,N,*L=list(map(int,open(0).read().split()));K=[];M=[(H-2)*(W-2)]+[0]*9
for a,b in zip(*[iter(L)]*2):
for x in r:
for y in r:
if H-1>a-y>0<b-x<W-1:K+=[(a-y)*W+b-x]
for k,v in list(C(list(C(K).values())).items()):M[0]-=v;M[k]+=v
print(... | 7 | 10 | 283 | 328 | from collections import Counter as C
r = list(range(3))
H, W, N, *L = list(map(int, open(0).read().split()))
K = []
M = [0] * 10
M[0] = (H - 2) * (W - 2)
for a, b in zip(*[iter(L)] * 2):
for x in r:
for y in r:
if H - 1 > a - y > 0 < b - x < W - 1:
K += [(a - y, b - x)]
for k, v... | from collections import Counter as C
r = list(range(3))
def s():
H, W, N, *L = list(map(int, open(0).read().split()))
K = []
M = [(H - 2) * (W - 2)] + [0] * 9
for a, b in zip(*[iter(L)] * 2):
for x in r:
for y in r:
if H - 1 > a - y > 0 < b - x < W - 1:
... | false | 30 | [
"-H, W, N, *L = list(map(int, open(0).read().split()))",
"-K = []",
"-M = [0] * 10",
"-M[0] = (H - 2) * (W - 2)",
"-for a, b in zip(*[iter(L)] * 2):",
"- for x in r:",
"- for y in r:",
"- if H - 1 > a - y > 0 < b - x < W - 1:",
"- K += [(a - y, b - x)]",
"-for k... | false | 0.123331 | 0.207068 | 0.595605 | [
"s555928579",
"s691592137"
] |
u790710233 | p02658 | python | s610177858 | s228352633 | 94 | 53 | 21,592 | 21,732 | Accepted | Accepted | 43.62 | n = int(eval(input()))
A = sorted(map(int, input().split()))
ans = 1
for a in A:
ans *= a
if 10**18 < ans:
print((-1))
break
else:
print(ans) | n = int(eval(input()))
A = list(map(int, input().split()))
if 0 in A:
print((0))
else:
ans = 1
for a in A:
ans *= a
if 10**18 < ans:
print((-1))
break
else:
print(ans) | 11 | 13 | 172 | 233 | n = int(eval(input()))
A = sorted(map(int, input().split()))
ans = 1
for a in A:
ans *= a
if 10**18 < ans:
print((-1))
break
else:
print(ans)
| n = int(eval(input()))
A = list(map(int, input().split()))
if 0 in A:
print((0))
else:
ans = 1
for a in A:
ans *= a
if 10**18 < ans:
print((-1))
break
else:
print(ans)
| false | 15.384615 | [
"-A = sorted(map(int, input().split()))",
"-ans = 1",
"-for a in A:",
"- ans *= a",
"- if 10**18 < ans:",
"- print((-1))",
"- break",
"+A = list(map(int, input().split()))",
"+if 0 in A:",
"+ print((0))",
"- print(ans)",
"+ ans = 1",
"+ for a in A:",
"+ ... | false | 0.007311 | 0.04132 | 0.176933 | [
"s610177858",
"s228352633"
] |
u864197622 | p03288 | python | s184151702 | s419750207 | 19 | 17 | 2,940 | 2,940 | Accepted | Accepted | 10.53 | print(("A"+"BRG"[(int(eval(input()))+400)//1600]+"C"))
| print(("A"+"BRG"[int(eval(input()))//50+8>>5]+"C")) | 1 | 1 | 47 | 43 | print(("A" + "BRG"[(int(eval(input())) + 400) // 1600] + "C"))
| print(("A" + "BRG"[int(eval(input())) // 50 + 8 >> 5] + "C"))
| false | 0 | [
"-print((\"A\" + \"BRG\"[(int(eval(input())) + 400) // 1600] + \"C\"))",
"+print((\"A\" + \"BRG\"[int(eval(input())) // 50 + 8 >> 5] + \"C\"))"
] | false | 0.068308 | 0.067688 | 1.009146 | [
"s184151702",
"s419750207"
] |
u644907318 | p03000 | python | s296323186 | s970176404 | 179 | 63 | 38,256 | 61,684 | Accepted | Accepted | 64.8 | N,X = list(map(int,input().split()))
L = list(map(int,input().split()))
L.insert(0,0)
D = [0 for _ in range(N+2)]
cnt = 1
for i in range(2,N+2):
D[i] = D[i-1]+L[i-1]
if D[i]<=X:
cnt += 1
else:
break
print(cnt) | N,X = list(map(int,input().split()))
L = list(map(int,input().split()))
L.insert(0,0)
D = 0
cnt = N+1
for i in range(1,N+1):
D += L[i]
if D>X:
cnt = i
break
print(cnt) | 12 | 11 | 242 | 195 | N, X = list(map(int, input().split()))
L = list(map(int, input().split()))
L.insert(0, 0)
D = [0 for _ in range(N + 2)]
cnt = 1
for i in range(2, N + 2):
D[i] = D[i - 1] + L[i - 1]
if D[i] <= X:
cnt += 1
else:
break
print(cnt)
| N, X = list(map(int, input().split()))
L = list(map(int, input().split()))
L.insert(0, 0)
D = 0
cnt = N + 1
for i in range(1, N + 1):
D += L[i]
if D > X:
cnt = i
break
print(cnt)
| false | 8.333333 | [
"-D = [0 for _ in range(N + 2)]",
"-cnt = 1",
"-for i in range(2, N + 2):",
"- D[i] = D[i - 1] + L[i - 1]",
"- if D[i] <= X:",
"- cnt += 1",
"- else:",
"+D = 0",
"+cnt = N + 1",
"+for i in range(1, N + 1):",
"+ D += L[i]",
"+ if D > X:",
"+ cnt = i"
] | false | 0.041365 | 0.044521 | 0.929115 | [
"s296323186",
"s970176404"
] |
u903005414 | p03612 | python | s612085551 | s817069851 | 289 | 227 | 25,436 | 23,416 | Accepted | Accepted | 21.45 | import numpy as np
N = int(eval(input()))
p = np.array(list(map(int, input().split())))
v = np.arange(1, N + 1)
# print('p v --', p, v, p == v, np.count_nonzero(p == v))
count = 0
ans = 0
for i in p == v:
if i:
count += 1
else:
ans += (count + 1) // 2
count = 0
else:
an... | import numpy as np
N = int(eval(input()))
p = np.array(list(map(int, input().split())))
v = p == np.arange(1, N + 1)
# print('v', v)
ans = 0
for i in range(N):
if i == N - 1 and v[i]:
ans += 1
continue
if v[i]:
v[i], v[i + 1] = False, False
ans += 1
print(ans)
| 17 | 14 | 350 | 308 | import numpy as np
N = int(eval(input()))
p = np.array(list(map(int, input().split())))
v = np.arange(1, N + 1)
# print('p v --', p, v, p == v, np.count_nonzero(p == v))
count = 0
ans = 0
for i in p == v:
if i:
count += 1
else:
ans += (count + 1) // 2
count = 0
else:
ans += (count +... | import numpy as np
N = int(eval(input()))
p = np.array(list(map(int, input().split())))
v = p == np.arange(1, N + 1)
# print('v', v)
ans = 0
for i in range(N):
if i == N - 1 and v[i]:
ans += 1
continue
if v[i]:
v[i], v[i + 1] = False, False
ans += 1
print(ans)
| false | 17.647059 | [
"-v = np.arange(1, N + 1)",
"-# print('p v --', p, v, p == v, np.count_nonzero(p == v))",
"-count = 0",
"+v = p == np.arange(1, N + 1)",
"+# print('v', v)",
"-for i in p == v:",
"- if i:",
"- count += 1",
"- else:",
"- ans += (count + 1) // 2",
"- count = 0",
"-else:... | false | 0.221501 | 0.21084 | 1.050566 | [
"s612085551",
"s817069851"
] |
u633068244 | p00429 | python | s671278811 | s343602787 | 90 | 60 | 4,988 | 4,996 | Accepted | Accepted | 33.33 | while 1:
n=eval(input())
if n==0:break
a=input()
for r in range(n):
aa=""
s=a[0]
count=1
for i in range(len(a)-1):
if a[i]==a[i+1]:
count+=1
else:
aa+=str(count)+s
count=1
s=a[i+1]
aa+=str(count)+s
a=aa
print(a) | def f(a):
ans = ""
s = a[0]
c = 1
for i in range(1,len(a)):
if a[i] == s:
c += 1
else:
ans += str(c) + s
s = a[i]
c = 1
ans += str(c) + s
return ans
while 1:
n = eval(input())
if n == 0: break
a = input()
for i in range(n):
a = f(a)
print(a) | 18 | 21 | 264 | 289 | while 1:
n = eval(input())
if n == 0:
break
a = input()
for r in range(n):
aa = ""
s = a[0]
count = 1
for i in range(len(a) - 1):
if a[i] == a[i + 1]:
count += 1
else:
aa += str(count) + s
cou... | def f(a):
ans = ""
s = a[0]
c = 1
for i in range(1, len(a)):
if a[i] == s:
c += 1
else:
ans += str(c) + s
s = a[i]
c = 1
ans += str(c) + s
return ans
while 1:
n = eval(input())
if n == 0:
break
a = input()
... | false | 14.285714 | [
"+def f(a):",
"+ ans = \"\"",
"+ s = a[0]",
"+ c = 1",
"+ for i in range(1, len(a)):",
"+ if a[i] == s:",
"+ c += 1",
"+ else:",
"+ ans += str(c) + s",
"+ s = a[i]",
"+ c = 1",
"+ ans += str(c) + s",
"+ return ans",
... | false | 0.051931 | 0.052574 | 0.987772 | [
"s671278811",
"s343602787"
] |
u871352270 | p03559 | python | s463706343 | s259982082 | 504 | 365 | 54,256 | 28,636 | Accepted | Accepted | 27.58 | from collections import defaultdict
N = int(eval(input()))
A = sorted(list(map(int, input().split())))
B = sorted(list(map(int, input().split())))
C = sorted(list(map(int, input().split())))
ad = defaultdict(lambda: -1)
i, j = 0, 0
while i < N and j < N:
if A[i] < B[j]:
ad[i] = j
i += 1
... | import bisect
N = int(eval(input()))
A = sorted(list(map(int, input().split())))
B = sorted(list(map(int, input().split())))
C = sorted(list(map(int, input().split())))
ali = [0] * (N+1)
bli = [N - bisect.bisect_left(C,B[i]+1) for i in range(N)]
for i in range(N):
ali[i+1] = ali[i] + bli[i]
print((sum([ali... | 35 | 10 | 751 | 371 | from collections import defaultdict
N = int(eval(input()))
A = sorted(list(map(int, input().split())))
B = sorted(list(map(int, input().split())))
C = sorted(list(map(int, input().split())))
ad = defaultdict(lambda: -1)
i, j = 0, 0
while i < N and j < N:
if A[i] < B[j]:
ad[i] = j
i += 1
else:
... | import bisect
N = int(eval(input()))
A = sorted(list(map(int, input().split())))
B = sorted(list(map(int, input().split())))
C = sorted(list(map(int, input().split())))
ali = [0] * (N + 1)
bli = [N - bisect.bisect_left(C, B[i] + 1) for i in range(N)]
for i in range(N):
ali[i + 1] = ali[i] + bli[i]
print((sum([ali[... | false | 71.428571 | [
"-from collections import defaultdict",
"+import bisect",
"-ad = defaultdict(lambda: -1)",
"-i, j = 0, 0",
"-while i < N and j < N:",
"- if A[i] < B[j]:",
"- ad[i] = j",
"- i += 1",
"- else:",
"- j += 1",
"-bd = defaultdict(lambda: -1)",
"-i, j = 0, 0",
"-while i <... | false | 0.040155 | 0.040137 | 1.000439 | [
"s463706343",
"s259982082"
] |
u875291233 | p03716 | python | s294381717 | s535044248 | 381 | 233 | 39,124 | 42,152 | Accepted | Accepted | 38.85 | # coding: utf-8
# Your code here!
n = int(eval(input()))
a = [int(i) for i in input().split()]
from heapq import *
pq1 = a[:n]
heapify(pq1)
s = sum(pq1)
score1 = [s]
for i in range(n):
c=heappushpop(pq1, a[n+i])
s += a[n+i] - c
score1.append(s)
pq2 = [-i for i in a[2*n:]]
heapify(pq2)
s... | # coding: utf-8
# Your code here!
import sys
read = sys.stdin.read
readline = sys.stdin.readline
n,*a = list(map(int,read().split()))
from heapq import *
def get(q,a):
v = sum(q)
res = [v]
for i in a[n:2*n]:
x = heappushpop(q,i)
v += i-x
res.append(v)
return r... | 33 | 39 | 581 | 523 | # coding: utf-8
# Your code here!
n = int(eval(input()))
a = [int(i) for i in input().split()]
from heapq import *
pq1 = a[:n]
heapify(pq1)
s = sum(pq1)
score1 = [s]
for i in range(n):
c = heappushpop(pq1, a[n + i])
s += a[n + i] - c
score1.append(s)
pq2 = [-i for i in a[2 * n :]]
heapify(pq2)
s = sum(pq2)... | # coding: utf-8
# Your code here!
import sys
read = sys.stdin.read
readline = sys.stdin.readline
n, *a = list(map(int, read().split()))
from heapq import *
def get(q, a):
v = sum(q)
res = [v]
for i in a[n : 2 * n]:
x = heappushpop(q, i)
v += i - x
res.append(v)
return res
q ... | false | 15.384615 | [
"-n = int(eval(input()))",
"-a = [int(i) for i in input().split()]",
"+import sys",
"+",
"+read = sys.stdin.read",
"+readline = sys.stdin.readline",
"+n, *a = list(map(int, read().split()))",
"-pq1 = a[:n]",
"-heapify(pq1)",
"-s = sum(pq1)",
"-score1 = [s]",
"-for i in range(n):",
"- c = ... | false | 0.038703 | 0.033566 | 1.153054 | [
"s294381717",
"s535044248"
] |
u839188633 | p03064 | python | s456766999 | s516844792 | 995 | 823 | 14,568 | 14,556 | Accepted | Accepted | 17.29 | import numpy as np
from math import ceil
n = int(eval(input()))
a = [int(eval(input())) for _ in range(n)]
modulo = 998244353
s = sum(a)
dp = np.zeros(s + 1, dtype=np.int)
dp[0] = 1
for ai in a:
dp[ai:] = 2 * dp[ai:] + dp[:-ai]
dp[:ai] = 2 * dp[:ai]
dp %= modulo
sol = 3 ** n % modulo
sol ... | import numpy as np
from math import ceil
n = int(eval(input()))
a = [int(eval(input())) for _ in range(n)]
modulo = 998244353
s = sum(a)
dp = np.zeros(s + 1, dtype=np.int)
dp[0] = 1
for ai in a:
dp[ai:] = 2 * dp[ai:] + dp[:-ai]
dp[:ai] = 2 * dp[:ai]
dp %= modulo
sol = 3 ** n % modulo
so... | 31 | 30 | 552 | 546 | import numpy as np
from math import ceil
n = int(eval(input()))
a = [int(eval(input())) for _ in range(n)]
modulo = 998244353
s = sum(a)
dp = np.zeros(s + 1, dtype=np.int)
dp[0] = 1
for ai in a:
dp[ai:] = 2 * dp[ai:] + dp[:-ai]
dp[:ai] = 2 * dp[:ai]
dp %= modulo
sol = 3**n % modulo
sol -= 3 * dp[ceil(s / 2... | import numpy as np
from math import ceil
n = int(eval(input()))
a = [int(eval(input())) for _ in range(n)]
modulo = 998244353
s = sum(a)
dp = np.zeros(s + 1, dtype=np.int)
dp[0] = 1
for ai in a:
dp[ai:] = 2 * dp[ai:] + dp[:-ai]
dp[:ai] = 2 * dp[:ai]
dp %= modulo
sol = 3**n % modulo
sol -= 3 * dp[ceil(s / 2... | false | 3.225806 | [
"- dp = np.zeros(s + 1, dtype=np.int)",
"+ dp = np.zeros(s // 2 + 1, dtype=np.int)",
"- dp[ai:] = dp[ai:] + dp[:-ai]",
"- dp %= modulo",
"+ dp[ai:] = (dp[ai:] + dp[:-ai]) % modulo"
] | false | 0.247133 | 0.284025 | 0.870111 | [
"s456766999",
"s516844792"
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.