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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
u077337864 | p03700 | python | s644261342 | s323051450 | 1,270 | 1,090 | 7,072 | 7,072 | Accepted | Accepted | 14.17 | n, a, b = list(map(int, input().split()))
hlist = [int(eval(input())) for _ in range(n)]
maxn = (max(hlist) + b - 1) // b
def enough(t):
c = 0
for h in hlist:
if h - b * t > 0:
c += (h - b * t + a - b - 1) // (a - b)
return c <= t
l, r = 0, maxn
while l != r:
mid = (l + r) // 2
if en... | def main():
n, a, b = list(map(int, input().split()))
h = [int(eval(input())) for _ in range(n)]
low, high = 0, 1000000000000000000
while low < high:
mid = (low + high) // 2
tmp = 0
for _h in h:
if _h > mid * b:
tmp += (_h - mid * b + a - b - ... | 19 | 19 | 368 | 471 | n, a, b = list(map(int, input().split()))
hlist = [int(eval(input())) for _ in range(n)]
maxn = (max(hlist) + b - 1) // b
def enough(t):
c = 0
for h in hlist:
if h - b * t > 0:
c += (h - b * t + a - b - 1) // (a - b)
return c <= t
l, r = 0, maxn
while l != r:
mid = (l + r) // 2
... | def main():
n, a, b = list(map(int, input().split()))
h = [int(eval(input())) for _ in range(n)]
low, high = 0, 1000000000000000000
while low < high:
mid = (low + high) // 2
tmp = 0
for _h in h:
if _h > mid * b:
tmp += (_h - mid * b + a - b - 1) // (a ... | false | 0 | [
"-n, a, b = list(map(int, input().split()))",
"-hlist = [int(eval(input())) for _ in range(n)]",
"-maxn = (max(hlist) + b - 1) // b",
"+def main():",
"+ n, a, b = list(map(int, input().split()))",
"+ h = [int(eval(input())) for _ in range(n)]",
"+ low, high = 0, 1000000000000000000",
"+ wh... | false | 0.041253 | 0.043037 | 0.95854 | [
"s644261342",
"s323051450"
] |
u687044304 | p03069 | python | s469753244 | s628193368 | 119 | 94 | 3,500 | 3,500 | Accepted | Accepted | 21.01 | # -*- coding:utf-8 -*-
def solve():
N = int(eval(input()))
S = eval(input())
kuro_num = 0
siro_num = 0
for moji in S:
if moji == "#":
kuro_num += 1
else:
siro_num += 1
if siro_num == N:
print((0))
exit()
# ........... | # -*- coding:utf-8 -*-
def solve():
N = int(eval(input()))
S = eval(input())
kuro_num = 0
siro_num = 0
for moji in S:
if moji == "#":
kuro_num += 1
else:
siro_num += 1
if siro_num == N:
print((0))
exit()
# ........... | 41 | 38 | 821 | 726 | # -*- coding:utf-8 -*-
def solve():
N = int(eval(input()))
S = eval(input())
kuro_num = 0
siro_num = 0
for moji in S:
if moji == "#":
kuro_num += 1
else:
siro_num += 1
if siro_num == N:
print((0))
exit()
# ..........############ のパターン
... | # -*- coding:utf-8 -*-
def solve():
N = int(eval(input()))
S = eval(input())
kuro_num = 0
siro_num = 0
for moji in S:
if moji == "#":
kuro_num += 1
else:
siro_num += 1
if siro_num == N:
print((0))
exit()
# ..........############ のパターン
... | false | 7.317073 | [
"- rest_kuro_num = kuro_num",
"- rest_siro_num = siro_num",
"+ right_kuro_num = kuro_num",
"+ right_siro_num = siro_num",
"- for i in range(0, len(S)):",
"- num = rest_siro_num",
"- if S[i] == \"#\":",
"- num += 1 + (kuro_num - rest_kuro_num)",
"- r... | false | 0.035641 | 0.036036 | 0.989049 | [
"s469753244",
"s628193368"
] |
u340781749 | p04051 | python | s860871725 | s948075523 | 1,410 | 1,160 | 149,584 | 91,356 | Accepted | Accepted | 17.73 | import sys
from collections import defaultdict
import numpy as np
def prepare(n, MOD):
f = 1
factorials = [1]
for m in range(1, n + 1):
f *= m
f %= MOD
factorials.append(f)
inv = pow(f, MOD - 2, MOD)
invs = [1] * (n + 1)
invs[n] = inv
for m in range(n... | import sys
from collections import defaultdict
import numpy as np
def prepare(n, MOD):
f = 1
factorials = [1]
for m in range(1, n + 1):
f *= m
f %= MOD
factorials.append(f)
inv = pow(f, MOD - 2, MOD)
invs = [1] * (n + 1)
invs[n] = inv
for m in range(n... | 50 | 48 | 1,277 | 1,214 | import sys
from collections import defaultdict
import numpy as np
def prepare(n, MOD):
f = 1
factorials = [1]
for m in range(1, n + 1):
f *= m
f %= MOD
factorials.append(f)
inv = pow(f, MOD - 2, MOD)
invs = [1] * (n + 1)
invs[n] = inv
for m in range(n, 1, -1):
... | import sys
from collections import defaultdict
import numpy as np
def prepare(n, MOD):
f = 1
factorials = [1]
for m in range(1, n + 1):
f *= m
f %= MOD
factorials.append(f)
inv = pow(f, MOD - 2, MOD)
invs = [1] * (n + 1)
invs[n] = inv
for m in range(n, 1, -1):
... | false | 4 | [
"-put_ab = defaultdict(dd_create_func)",
"- put_ab[-a][-b + max_b] += 1",
"- if i < 0 and i in put_ab:",
"- dp += put_ab[i]",
"+ if i < 0 and -i in get_ab:",
"+ dp += get_ab[-i][::-1]"
] | false | 0.239278 | 0.21948 | 1.090203 | [
"s860871725",
"s948075523"
] |
u687574784 | p02572 | python | s950013391 | s884792632 | 159 | 93 | 31,636 | 31,392 | Accepted | Accepted | 41.51 | n = int(eval(input()))
a = list(map(int, input().split()))
from itertools import accumulate
cumsum = list(accumulate(a[::-1]))[::-1]
MOD = 10**9+7
ans = 0
for i,A in enumerate(a[:-1]):
ans += A * cumsum[i+1]
ans = ans % MOD
print(ans) | n = int(eval(input()))
x = list(map(int, input().split()))
edge = sum(x)
print(((edge**2 - sum([X*X for X in x]))//2 % (10**9+7))) | 12 | 5 | 249 | 127 | n = int(eval(input()))
a = list(map(int, input().split()))
from itertools import accumulate
cumsum = list(accumulate(a[::-1]))[::-1]
MOD = 10**9 + 7
ans = 0
for i, A in enumerate(a[:-1]):
ans += A * cumsum[i + 1]
ans = ans % MOD
print(ans)
| n = int(eval(input()))
x = list(map(int, input().split()))
edge = sum(x)
print(((edge**2 - sum([X * X for X in x])) // 2 % (10**9 + 7)))
| false | 58.333333 | [
"-a = list(map(int, input().split()))",
"-from itertools import accumulate",
"-",
"-cumsum = list(accumulate(a[::-1]))[::-1]",
"-MOD = 10**9 + 7",
"-ans = 0",
"-for i, A in enumerate(a[:-1]):",
"- ans += A * cumsum[i + 1]",
"- ans = ans % MOD",
"-print(ans)",
"+x = list(map(int, input().sp... | false | 0.071537 | 0.041021 | 1.74389 | [
"s950013391",
"s884792632"
] |
u739360929 | p03854 | python | s967042428 | s185444262 | 70 | 20 | 3,188 | 3,188 | Accepted | Accepted | 71.43 | S = eval(input())
while len(S) > 0:
if S[-5::1] == 'dream' or S[-5::1] == 'erase':
S = S[:-5:1]
elif S[-6::1] == 'eraser':
S = S[:-6:1]
elif S[-7::1] == 'dreamer':
S = S[:-7:1]
else:
print('NO')
break
if len(S) == 0:
print('YES')
| S = input().replace('eraser', '!').replace('erase', '!').replace('dreamer', '!').replace('dream', '!').replace('!', '')
if len(S) == 0:
print('YES')
else:
print('NO') | 16 | 5 | 302 | 178 | S = eval(input())
while len(S) > 0:
if S[-5::1] == "dream" or S[-5::1] == "erase":
S = S[:-5:1]
elif S[-6::1] == "eraser":
S = S[:-6:1]
elif S[-7::1] == "dreamer":
S = S[:-7:1]
else:
print("NO")
break
if len(S) == 0:
print("YES")
| S = (
input()
.replace("eraser", "!")
.replace("erase", "!")
.replace("dreamer", "!")
.replace("dream", "!")
.replace("!", "")
)
if len(S) == 0:
print("YES")
else:
print("NO")
| false | 68.75 | [
"-S = eval(input())",
"-while len(S) > 0:",
"- if S[-5::1] == \"dream\" or S[-5::1] == \"erase\":",
"- S = S[:-5:1]",
"- elif S[-6::1] == \"eraser\":",
"- S = S[:-6:1]",
"- elif S[-7::1] == \"dreamer\":",
"- S = S[:-7:1]",
"- else:",
"- print(\"NO\")",
"- ... | false | 0.042182 | 0.099229 | 0.425093 | [
"s967042428",
"s185444262"
] |
u803617136 | p03030 | python | s805918973 | s570198386 | 177 | 21 | 39,152 | 3,316 | Accepted | Accepted | 88.14 | N = int(eval(input()))
city = dict()
restaurants = []
for _ in range(N):
s, p = input().split()
restaurants.append([s, int(p)])
if s in list(city.keys()):
city[s].append(int(p))
else:
city[s] = [int(p)]
city = sorted(list(city.items()), key=lambda x:x[0])
for c in city:
... | from collections import defaultdict
n = int(eval(input()))
restaurants = defaultdict(list)
for i in range(n):
s, p = input().split()
p = int(p)
restaurants[s].append([p, i])
cnt = 0
for k, v in sorted(list(restaurants.items()), key=lambda x: x[0]):
for p, i in sorted(v, key=lambda x: -x[0]):
... | 22 | 12 | 524 | 330 | N = int(eval(input()))
city = dict()
restaurants = []
for _ in range(N):
s, p = input().split()
restaurants.append([s, int(p)])
if s in list(city.keys()):
city[s].append(int(p))
else:
city[s] = [int(p)]
city = sorted(list(city.items()), key=lambda x: x[0])
for c in city:
points = c[1... | from collections import defaultdict
n = int(eval(input()))
restaurants = defaultdict(list)
for i in range(n):
s, p = input().split()
p = int(p)
restaurants[s].append([p, i])
cnt = 0
for k, v in sorted(list(restaurants.items()), key=lambda x: x[0]):
for p, i in sorted(v, key=lambda x: -x[0]):
pr... | false | 45.454545 | [
"-N = int(eval(input()))",
"-city = dict()",
"-restaurants = []",
"-for _ in range(N):",
"+from collections import defaultdict",
"+",
"+n = int(eval(input()))",
"+restaurants = defaultdict(list)",
"+for i in range(n):",
"- restaurants.append([s, int(p)])",
"- if s in list(city.keys()):",
... | false | 0.038187 | 0.075632 | 0.504907 | [
"s805918973",
"s570198386"
] |
u505564549 | p02761 | python | s127167098 | s616623888 | 88 | 63 | 61,268 | 62,820 | Accepted | Accepted | 28.41 | import sys
input = sys.stdin.readline
n,m = map(int,input().split())
L=[-1]*n
if n==1 and m==0:
print(0)
sys.exit()
for i in range(m):
s,c=map(int,input().split())
s-=1
if L[s]==-1 or L[s]==c:
L[s] = c
else:
print(-1)
sys.exit()
if L[0]==0 and n>1:
p... | import sys
input = sys.stdin.readline
n,m=list(map(int,input().split()))
C = [list(map(int,input().split())) for _ in range(m)]
for i in range(1000):
S = str(i)
if len(S)==n:
for s,c in C:
s-=1
if S[s]==str(c):
True
else:
... | 27 | 20 | 480 | 396 | import sys
input = sys.stdin.readline
n, m = map(int, input().split())
L = [-1] * n
if n == 1 and m == 0:
print(0)
sys.exit()
for i in range(m):
s, c = map(int, input().split())
s -= 1
if L[s] == -1 or L[s] == c:
L[s] = c
else:
print(-1)
sys.exit()
if L[0] == 0 and n > 1... | import sys
input = sys.stdin.readline
n, m = list(map(int, input().split()))
C = [list(map(int, input().split())) for _ in range(m)]
for i in range(1000):
S = str(i)
if len(S) == n:
for s, c in C:
s -= 1
if S[s] == str(c):
True
else:
b... | false | 25.925926 | [
"-n, m = map(int, input().split())",
"-L = [-1] * n",
"-if n == 1 and m == 0:",
"- print(0)",
"- sys.exit()",
"-for i in range(m):",
"- s, c = map(int, input().split())",
"- s -= 1",
"- if L[s] == -1 or L[s] == c:",
"- L[s] = c",
"- else:",
"- print(-1)",
"- ... | false | 0.046818 | 0.036155 | 1.294911 | [
"s127167098",
"s616623888"
] |
u729133443 | p03593 | python | s822866298 | s275929039 | 22 | 18 | 3,188 | 3,064 | Accepted | Accepted | 18.18 | t,_,s=open(0).read().partition('\n')
h,w=list(map(int,t.split()))
a=h//2*(w//2)
c=h%2and w%2
b=(h*w-a*4-c)//2
l=[]
for i in set(s.replace('\n','')):
l.append(s.count(i))
for i in l:
if i>3:
while i>3and a:
i-=4
a-=1
if i>1:
while i>1and b:
i... | t,_,s=open(0).read().partition('\n')
h,w=list(map(int,t.split()))
a=h//2*(w//2)
c=h%2and w%2
b=(h*w-a*4-c)//2
for i in set(s.replace('\n','')):
i=s.count(i)
while i>3and a:
i-=4
a-=1
while i>1and b:
i-=2
b-=1
if i and c:
i-=1
c-=1
print(('YNeos'[any(t for t in(a,b,c))::2]... | 24 | 17 | 454 | 314 | t, _, s = open(0).read().partition("\n")
h, w = list(map(int, t.split()))
a = h // 2 * (w // 2)
c = h % 2 and w % 2
b = (h * w - a * 4 - c) // 2
l = []
for i in set(s.replace("\n", "")):
l.append(s.count(i))
for i in l:
if i > 3:
while i > 3 and a:
i -= 4
a -= 1
if i > 1:
... | t, _, s = open(0).read().partition("\n")
h, w = list(map(int, t.split()))
a = h // 2 * (w // 2)
c = h % 2 and w % 2
b = (h * w - a * 4 - c) // 2
for i in set(s.replace("\n", "")):
i = s.count(i)
while i > 3 and a:
i -= 4
a -= 1
while i > 1 and b:
i -= 2
b -= 1
if i and c:... | false | 29.166667 | [
"-l = []",
"- l.append(s.count(i))",
"-for i in l:",
"- if i > 3:",
"- while i > 3 and a:",
"- i -= 4",
"- a -= 1",
"- if i > 1:",
"- while i > 1 and b:",
"- i -= 2",
"- b -= 1",
"+ i = s.count(i)",
"+ while i > 3 and a... | false | 0.034727 | 0.032782 | 1.059334 | [
"s822866298",
"s275929039"
] |
u745514010 | p02540 | python | s819355263 | s785492800 | 1,467 | 1,294 | 52,228 | 115,492 | Accepted | Accepted | 11.79 | import heapq
class UnionFind():
def __init__(self, n):
self.n = n
self.parents = [-1] * n
def find(self, x):
if self.parents[x] < 0:
return x
else:
self.parents[x] = self.find(self.parents[x])
return self.parents[x]
def uni... | import heapq
import sys
input = sys.stdin.readline
class UnionFind():
def __init__(self, n):
self.n = n
self.parents = [-1] * n
def find(self, x):
if self.parents[x] < 0:
return x
else:
self.parents[x] = self.find(self.parents[x])
... | 72 | 74 | 1,696 | 1,829 | import heapq
class UnionFind:
def __init__(self, n):
self.n = n
self.parents = [-1] * n
def find(self, x):
if self.parents[x] < 0:
return x
else:
self.parents[x] = self.find(self.parents[x])
return self.parents[x]
def union(self, x, y):... | import heapq
import sys
input = sys.stdin.readline
class UnionFind:
def __init__(self, n):
self.n = n
self.parents = [-1] * n
def find(self, x):
if self.parents[x] < 0:
return x
else:
self.parents[x] = self.find(self.parents[x])
return self... | false | 2.702703 | [
"+import sys",
"+",
"+input = sys.stdin.readline",
"-n = int(eval(input()))",
"-xy = [list(map(int, input().split())) + [i] for i in range(n)]",
"-xy.sort()",
"-UF = UnionFind(n)",
"-lst = [[xy[0][1], xy[0][2]]]",
"-for _, y, i in xy[1:]:",
"- flg = False",
"- tmp = lst[0]",
"- while ... | false | 0.103252 | 0.145838 | 0.707989 | [
"s819355263",
"s785492800"
] |
u372144784 | p03208 | python | s793944671 | s951557653 | 545 | 217 | 50,392 | 44,508 | Accepted | Accepted | 60.18 | n,k = list(map(int,input().split()))
list1 = [int(eval(input())) for i in range(n) ]
list1.sort()
treemin = 10**9
for i in range(len(list1)-k+1):
treemin = min(treemin,list1[i+k-1]-list1[i])
print(treemin) | import sys
readline = sys.stdin.buffer.readline
def even(n): return 1 if n%2==0 else 0
n,k = list(map(int,readline().split()))
lst1 = []
for i in range(n):
lst1.append( int(readline()))
lst1.sort()
ans = 10**9
for i in range(n-k+1):
ans = min(ans,abs(lst1[i+k-1]-lst1[i]))
print(ans)
| 7 | 15 | 200 | 303 | n, k = list(map(int, input().split()))
list1 = [int(eval(input())) for i in range(n)]
list1.sort()
treemin = 10**9
for i in range(len(list1) - k + 1):
treemin = min(treemin, list1[i + k - 1] - list1[i])
print(treemin)
| import sys
readline = sys.stdin.buffer.readline
def even(n):
return 1 if n % 2 == 0 else 0
n, k = list(map(int, readline().split()))
lst1 = []
for i in range(n):
lst1.append(int(readline()))
lst1.sort()
ans = 10**9
for i in range(n - k + 1):
ans = min(ans, abs(lst1[i + k - 1] - lst1[i]))
print(ans)
| false | 53.333333 | [
"-n, k = list(map(int, input().split()))",
"-list1 = [int(eval(input())) for i in range(n)]",
"-list1.sort()",
"-treemin = 10**9",
"-for i in range(len(list1) - k + 1):",
"- treemin = min(treemin, list1[i + k - 1] - list1[i])",
"-print(treemin)",
"+import sys",
"+",
"+readline = sys.stdin.buffe... | false | 0.037812 | 0.161706 | 0.233832 | [
"s793944671",
"s951557653"
] |
u476604182 | p03716 | python | s428163603 | s921544504 | 1,016 | 784 | 48,372 | 39,828 | Accepted | Accepted | 22.83 | from heapq import heappush, heappop
N,*A = list(map(int, open(0).read().split()))
F = []
fs = 0
S = []
ss = 0
P = []
state = [0]*(3*N)
for i in range(N):
heappush(F,A[i])
fs += A[i]
for i in range(N,3*N):
heappush(S,(-A[i],i))
ss += A[i]
state[i] = 1
for i in range(N):
m,j = heappop(S)
st... | from heapq import heappush, heappop
N,*A = list(map(int, open(0).read().split()))
F = []
fs = 0
ss = 0
P = []
state = [0]*(3*N)
for i in range(N):
heappush(F,A[i])
fs += A[i]
ls = sorted(list(range(N,3*N)),key=lambda x:A[x])
for i in range(N):
state[ls[i]] = 1
ss += A[ls[i]]
for i in range(N,2*N):... | 34 | 31 | 628 | 631 | from heapq import heappush, heappop
N, *A = list(map(int, open(0).read().split()))
F = []
fs = 0
S = []
ss = 0
P = []
state = [0] * (3 * N)
for i in range(N):
heappush(F, A[i])
fs += A[i]
for i in range(N, 3 * N):
heappush(S, (-A[i], i))
ss += A[i]
state[i] = 1
for i in range(N):
m, j = heappop... | from heapq import heappush, heappop
N, *A = list(map(int, open(0).read().split()))
F = []
fs = 0
ss = 0
P = []
state = [0] * (3 * N)
for i in range(N):
heappush(F, A[i])
fs += A[i]
ls = sorted(list(range(N, 3 * N)), key=lambda x: A[x])
for i in range(N):
state[ls[i]] = 1
ss += A[ls[i]]
for i in range(N... | false | 8.823529 | [
"-S = []",
"-for i in range(N, 3 * N):",
"- heappush(S, (-A[i], i))",
"- ss += A[i]",
"- state[i] = 1",
"+ls = sorted(list(range(N, 3 * N)), key=lambda x: A[x])",
"- m, j = heappop(S)",
"- state[j] = 2",
"- ss += m",
"- heappush(P, (-m, j))",
"+ state[ls[i]] = 1",
"+ ... | false | 0.043867 | 0.044225 | 0.991913 | [
"s428163603",
"s921544504"
] |
u102461423 | p03653 | python | s362043633 | s138773718 | 488 | 191 | 110,540 | 47,760 | Accepted | Accepted | 60.86 | import sys
import numpy as np
import heapq as hp
from numba import njit
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
def compute(A, B, X):
"""左からn番の人まで。AからX人とる。ときの最大スコアを返す。"""
result = np.zeros(len(A), np.int64)
result[X - 1] = A[:X].... | import sys
import numpy as np
import heapq as hp
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
def compute(A, B, X):
"""左からn番の人まで。AからX人とる。ときの最大スコアを返す。"""
result = np.zeros(len(A), np.int64)
result[X - 1] = A[:X].sum()
q = []
f... | 57 | 49 | 1,464 | 1,260 | import sys
import numpy as np
import heapq as hp
from numba import njit
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
def compute(A, B, X):
"""左からn番の人まで。AからX人とる。ときの最大スコアを返す。"""
result = np.zeros(len(A), np.int64)
result[X - 1] = A[:X].sum()
q... | import sys
import numpy as np
import heapq as hp
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
def compute(A, B, X):
"""左からn番の人まで。AからX人とる。ときの最大スコアを返す。"""
result = np.zeros(len(A), np.int64)
result[X - 1] = A[:X].sum()
q = []
for i in rang... | false | 14.035088 | [
"-from numba import njit",
"+if sys.argv[-1] == \"ONLINE_JUDGE\":",
"+ import numba",
"+ from numba.pycc import CC",
"+",
"+ i8 = numba.from_dtype(np.int64)",
"+ sig = (i8[:], i8[:], i8)",
"+ cc = CC(\"my_module\")",
"+ cc.export(\"compute\", sig)(compute)",
"+ cc.compile()",
... | false | 0.272199 | 0.204214 | 1.332911 | [
"s362043633",
"s138773718"
] |
u287500079 | p03612 | python | s753199270 | s530596880 | 93 | 85 | 13,880 | 13,880 | Accepted | Accepted | 8.6 | n = int(eval(input()))
p = [int(i) for i in input().split()]
i = 0
ans = 0
while i < n:
if i < n - 1:
if p[i] == i + 1:
p[i], p[i+1] = p[i+1], p[i]
ans += 1
elif p[i] == i + 1:
ans += 1
i += 1
print(ans)
| n = int(eval(input()))
p = [int(i) for i in input().split()]
ans = 0
for i in range(n):
if i < n - 1:
if p[i] == i + 1:
p[i], p[i+1] = p[i+1], p[i]
ans += 1
elif p[i] == i + 1:
ans += 1
print(ans)
| 13 | 11 | 262 | 249 | n = int(eval(input()))
p = [int(i) for i in input().split()]
i = 0
ans = 0
while i < n:
if i < n - 1:
if p[i] == i + 1:
p[i], p[i + 1] = p[i + 1], p[i]
ans += 1
elif p[i] == i + 1:
ans += 1
i += 1
print(ans)
| n = int(eval(input()))
p = [int(i) for i in input().split()]
ans = 0
for i in range(n):
if i < n - 1:
if p[i] == i + 1:
p[i], p[i + 1] = p[i + 1], p[i]
ans += 1
elif p[i] == i + 1:
ans += 1
print(ans)
| false | 15.384615 | [
"-i = 0",
"-while i < n:",
"+for i in range(n):",
"- i += 1"
] | false | 0.045884 | 0.04879 | 0.940449 | [
"s753199270",
"s530596880"
] |
u958506960 | p02958 | python | s484132769 | s673835801 | 33 | 30 | 9,176 | 9,172 | Accepted | Accepted | 9.09 | n = int(eval(input()))
p = list(map(int, input().split()))
s = sorted(p)
c = 0
for i in range(len(p)):
if p[i] == s[i]:
c += 1
if c >= len(p)-2:
print('YES')
else:
print('NO') | n = int(eval(input()))
p = list(map(int, input().split()))
l = [i+1 for i in range(n)]
c = 0
for i in range(n):
if p[i] == l[i]:
c += 1
print(('YES' if c >= n-2 else 'NO')) | 11 | 8 | 199 | 183 | n = int(eval(input()))
p = list(map(int, input().split()))
s = sorted(p)
c = 0
for i in range(len(p)):
if p[i] == s[i]:
c += 1
if c >= len(p) - 2:
print("YES")
else:
print("NO")
| n = int(eval(input()))
p = list(map(int, input().split()))
l = [i + 1 for i in range(n)]
c = 0
for i in range(n):
if p[i] == l[i]:
c += 1
print(("YES" if c >= n - 2 else "NO"))
| false | 27.272727 | [
"-s = sorted(p)",
"+l = [i + 1 for i in range(n)]",
"-for i in range(len(p)):",
"- if p[i] == s[i]:",
"+for i in range(n):",
"+ if p[i] == l[i]:",
"-if c >= len(p) - 2:",
"- print(\"YES\")",
"-else:",
"- print(\"NO\")",
"+print((\"YES\" if c >= n - 2 else \"NO\"))"
] | false | 0.06355 | 0.036551 | 1.738671 | [
"s484132769",
"s673835801"
] |
u761320129 | p03612 | python | s323194556 | s510824704 | 83 | 57 | 14,008 | 14,004 | Accepted | Accepted | 31.33 | N = int(eval(input()))
src = list([int(x)-1 for x in input().split()])
mem = []
seq = 0
for i,a in enumerate(src):
if i == a:
seq += 1
else:
if seq > 0:
mem.append(seq)
seq = 0
if seq:
mem.append(seq)
ans = 0
for a in mem:
ans += (a+1)//2
print... | N = int(eval(input()))
src = list(map(int,input().split()))
ans = 0
skip = False
for i,a in enumerate(src):
if skip:
skip = False
continue
if a == (i+1):
ans += 1
skip = True
print(ans) | 19 | 13 | 323 | 232 | N = int(eval(input()))
src = list([int(x) - 1 for x in input().split()])
mem = []
seq = 0
for i, a in enumerate(src):
if i == a:
seq += 1
else:
if seq > 0:
mem.append(seq)
seq = 0
if seq:
mem.append(seq)
ans = 0
for a in mem:
ans += (a + 1) // 2
print(ans)
| N = int(eval(input()))
src = list(map(int, input().split()))
ans = 0
skip = False
for i, a in enumerate(src):
if skip:
skip = False
continue
if a == (i + 1):
ans += 1
skip = True
print(ans)
| false | 31.578947 | [
"-src = list([int(x) - 1 for x in input().split()])",
"-mem = []",
"-seq = 0",
"+src = list(map(int, input().split()))",
"+ans = 0",
"+skip = False",
"- if i == a:",
"- seq += 1",
"- else:",
"- if seq > 0:",
"- mem.append(seq)",
"- seq = 0",
"-if seq... | false | 0.113916 | 0.042437 | 2.68433 | [
"s323194556",
"s510824704"
] |
u475065881 | p03283 | python | s698825334 | s841761067 | 528 | 488 | 8,668 | 35,504 | Accepted | Accepted | 7.58 | import sys
from itertools import accumulate
N, M, Q = list(map(int, sys.stdin.readline().split()))
LR = [[0 for _ in range(N-i)] for i in range(N)]
for i in range(M):
L, R = list(map(int, sys.stdin.readline().split()))
LR[L-1][R-L] += 1
for i in range(N-2,-1,-1):
acc = accumulate(LR[i])
next(acc)... | import sys
from itertools import accumulate
stdin = sys.stdin.readlines()
N, M, Q = list(map(int, stdin[0].split()))
LR = [[0 for _ in range(N-i)] for i in range(N)]
for line in stdin[1:M+1]:
L, R = list(map(int, line.split()))
LR[L-1][R-L] += 1
for i in range(N-2,-1,-1):
acc = accumulate(LR[i])
next(... | 18 | 17 | 492 | 504 | import sys
from itertools import accumulate
N, M, Q = list(map(int, sys.stdin.readline().split()))
LR = [[0 for _ in range(N - i)] for i in range(N)]
for i in range(M):
L, R = list(map(int, sys.stdin.readline().split()))
LR[L - 1][R - L] += 1
for i in range(N - 2, -1, -1):
acc = accumulate(LR[i])
next(... | import sys
from itertools import accumulate
stdin = sys.stdin.readlines()
N, M, Q = list(map(int, stdin[0].split()))
LR = [[0 for _ in range(N - i)] for i in range(N)]
for line in stdin[1 : M + 1]:
L, R = list(map(int, line.split()))
LR[L - 1][R - L] += 1
for i in range(N - 2, -1, -1):
acc = accumulate(LR[... | false | 5.555556 | [
"-N, M, Q = list(map(int, sys.stdin.readline().split()))",
"+stdin = sys.stdin.readlines()",
"+N, M, Q = list(map(int, stdin[0].split()))",
"-for i in range(M):",
"- L, R = list(map(int, sys.stdin.readline().split()))",
"+for line in stdin[1 : M + 1]:",
"+ L, R = list(map(int, line.split()))",
"... | false | 0.04835 | 0.108974 | 0.443686 | [
"s698825334",
"s841761067"
] |
u287132915 | p02744 | python | s507524854 | s930016764 | 360 | 273 | 4,420 | 56,412 | Accepted | Accepted | 24.17 | n = int(eval(input()))
alphabet = 'abcdefghij'
s = [-1 for i in range(n)]
lst = [[] for i in range(n)]
lst[0].append(0)
ind = 0
while lst[ind] != [] or ind > 0:
if ind < n-1 and lst[ind] != []:
s[ind] = lst[ind].pop()
for i in range(max(s)+1, -1, -1):
lst[ind+1].append(i)
... | n = int(eval(input()))
if n == 1:
print('a')
exit()
lst = ['a']
for i in range(n-1):
new_lst = []
for string in lst:
num = ord(sorted(string)[-1])
for j in range(ord('a'), num+2):
new_lst.append(string+chr(j))
lst = new_lst
for string in lst:
print(... | 20 | 17 | 523 | 321 | n = int(eval(input()))
alphabet = "abcdefghij"
s = [-1 for i in range(n)]
lst = [[] for i in range(n)]
lst[0].append(0)
ind = 0
while lst[ind] != [] or ind > 0:
if ind < n - 1 and lst[ind] != []:
s[ind] = lst[ind].pop()
for i in range(max(s) + 1, -1, -1):
lst[ind + 1].append(i)
i... | n = int(eval(input()))
if n == 1:
print("a")
exit()
lst = ["a"]
for i in range(n - 1):
new_lst = []
for string in lst:
num = ord(sorted(string)[-1])
for j in range(ord("a"), num + 2):
new_lst.append(string + chr(j))
lst = new_lst
for string in lst:
print(string)
| false | 15 | [
"-alphabet = \"abcdefghij\"",
"-s = [-1 for i in range(n)]",
"-lst = [[] for i in range(n)]",
"-lst[0].append(0)",
"-ind = 0",
"-while lst[ind] != [] or ind > 0:",
"- if ind < n - 1 and lst[ind] != []:",
"- s[ind] = lst[ind].pop()",
"- for i in range(max(s) + 1, -1, -1):",
"- ... | false | 0.05146 | 0.047132 | 1.091814 | [
"s507524854",
"s930016764"
] |
u677121387 | p03038 | python | s398921197 | s067524702 | 652 | 504 | 45,624 | 27,836 | Accepted | Accepted | 22.7 | n,m = list(map(int,input().split()))
a = [int(i) for i in input().split()]
bc = [[int(i) for i in input().split()] for i in range(m)]
ans = 0
cnt = 0
d = {}
for i in range(n):
d[a[i]] = d.get(a[i],0)+1
for k in d:
bc.append([d[k],k])
bc.sort(key= lambda x:x[1],reverse=True)
for i in range(len(b... | n,m = list(map(int,input().split()))
a = [int(i) for i in input().split()]
bc = [[int(i) for i in input().split()] for i in range(m)]
a.sort()
bc.sort(key=lambda x:x[1],reverse=True)
d = []
cnt1 = 0
cnt2 = 0
x = 0
for lst in bc:
cnt2 = 0
while cnt1 < n and cnt2 < lst[0]:
d.append(lst[1])
... | 24 | 25 | 506 | 480 | n, m = list(map(int, input().split()))
a = [int(i) for i in input().split()]
bc = [[int(i) for i in input().split()] for i in range(m)]
ans = 0
cnt = 0
d = {}
for i in range(n):
d[a[i]] = d.get(a[i], 0) + 1
for k in d:
bc.append([d[k], k])
bc.sort(key=lambda x: x[1], reverse=True)
for i in range(len(bc)):
i... | n, m = list(map(int, input().split()))
a = [int(i) for i in input().split()]
bc = [[int(i) for i in input().split()] for i in range(m)]
a.sort()
bc.sort(key=lambda x: x[1], reverse=True)
d = []
cnt1 = 0
cnt2 = 0
x = 0
for lst in bc:
cnt2 = 0
while cnt1 < n and cnt2 < lst[0]:
d.append(lst[1])
cnt... | false | 4 | [
"-ans = 0",
"-cnt = 0",
"-d = {}",
"-for i in range(n):",
"- d[a[i]] = d.get(a[i], 0) + 1",
"-for k in d:",
"- bc.append([d[k], k])",
"+a.sort()",
"-for i in range(len(bc)):",
"- if cnt < n:",
"- ans += bc[i][1] * bc[i][0]",
"- cnt += bc[i][0]",
"- else:",
"- ... | false | 0.047244 | 0.047305 | 0.998713 | [
"s398921197",
"s067524702"
] |
u363768711 | p03611 | python | s854132273 | s496504963 | 90 | 70 | 14,336 | 13,964 | Accepted | Accepted | 22.22 | from collections import defaultdict
n = int(eval(input()))
ans = 0
a_lis = list(map(int,input().split()))
A_dict = [0]*(10**5+1)
for i in a_lis:
A_dict[i] += 1
for j in range(1,10**5):
tmp = A_dict[j-1]+A_dict[j]+A_dict[j+1]
if tmp > ans:
ans = tmp
print(ans) | def main():
n = int(eval(input()))
ans = 0
a_lis = list(map(int,input().split()))
A_dict = [0]*(10**5+1)
for i in a_lis:
A_dict[i] += 1
for j in range(1,10**5):
tmp = A_dict[j-1]+A_dict[j]+A_dict[j+1]
if tmp > ans:
ans = tmp
print(ans)
if __name__=='__main__':
main() | 16 | 15 | 282 | 310 | from collections import defaultdict
n = int(eval(input()))
ans = 0
a_lis = list(map(int, input().split()))
A_dict = [0] * (10**5 + 1)
for i in a_lis:
A_dict[i] += 1
for j in range(1, 10**5):
tmp = A_dict[j - 1] + A_dict[j] + A_dict[j + 1]
if tmp > ans:
ans = tmp
print(ans)
| def main():
n = int(eval(input()))
ans = 0
a_lis = list(map(int, input().split()))
A_dict = [0] * (10**5 + 1)
for i in a_lis:
A_dict[i] += 1
for j in range(1, 10**5):
tmp = A_dict[j - 1] + A_dict[j] + A_dict[j + 1]
if tmp > ans:
ans = tmp
print(ans)
if _... | false | 6.25 | [
"-from collections import defaultdict",
"+def main():",
"+ n = int(eval(input()))",
"+ ans = 0",
"+ a_lis = list(map(int, input().split()))",
"+ A_dict = [0] * (10**5 + 1)",
"+ for i in a_lis:",
"+ A_dict[i] += 1",
"+ for j in range(1, 10**5):",
"+ tmp = A_dict[j - ... | false | 0.108903 | 0.074784 | 1.456232 | [
"s854132273",
"s496504963"
] |
u852690916 | p03971 | python | s260033027 | s594662022 | 294 | 117 | 53,080 | 4,016 | Accepted | Accepted | 60.2 | N,A,B = list(map(int, input().split()))
S = eval(input())
a = b = 0
for s in S:
if s == 'a':
if a + b < A + B:
print('Yes')
a += 1
continue
elif s == 'b':
if a + b < A + B and b < B:
print('Yes')
b += 1
cont... | N,A,B=list(map(int, input().split()))
S=eval(input())
a,b,c=0,0,0
for s in S:
if s=='a':
a+=1
if c < A+B:
print('Yes')
c+=1
else:
print('No')
elif s=='b':
b+=1
if (c < A+B) and b <= B:
print('Yes')
... | 17 | 20 | 330 | 385 | N, A, B = list(map(int, input().split()))
S = eval(input())
a = b = 0
for s in S:
if s == "a":
if a + b < A + B:
print("Yes")
a += 1
continue
elif s == "b":
if a + b < A + B and b < B:
print("Yes")
b += 1
continue
print(... | N, A, B = list(map(int, input().split()))
S = eval(input())
a, b, c = 0, 0, 0
for s in S:
if s == "a":
a += 1
if c < A + B:
print("Yes")
c += 1
else:
print("No")
elif s == "b":
b += 1
if (c < A + B) and b <= B:
print("Yes")
... | false | 15 | [
"-a = b = 0",
"+a, b, c = 0, 0, 0",
"- if a + b < A + B:",
"+ a += 1",
"+ if c < A + B:",
"- a += 1",
"- continue",
"+ c += 1",
"+ else:",
"+ print(\"No\")",
"- if a + b < A + B and b < B:",
"+ b += 1",
"+ ... | false | 0.035994 | 0.040833 | 0.881485 | [
"s260033027",
"s594662022"
] |
u761320129 | p03420 | python | s616086847 | s550090728 | 126 | 91 | 3,060 | 3,060 | Accepted | Accepted | 27.78 | N,K = list(map(int,input().split()))
if K == 0:
print((N*N))
exit()
ans = 0
for b in range(1,N+1):
cycle,rem = divmod(N,b)
ans += cycle * max(0, b-K)
ans += max(0, rem+1 - K)
print(ans) | N,K = list(map(int,input().split()))
if K == 0:
print((N*N))
exit()
ans = 0
for b in range(K+1,N+1):
d,m = divmod(N,b)
ans += d*(b-K) + max(0,m+1-K)
print(ans) | 11 | 10 | 208 | 177 | N, K = list(map(int, input().split()))
if K == 0:
print((N * N))
exit()
ans = 0
for b in range(1, N + 1):
cycle, rem = divmod(N, b)
ans += cycle * max(0, b - K)
ans += max(0, rem + 1 - K)
print(ans)
| N, K = list(map(int, input().split()))
if K == 0:
print((N * N))
exit()
ans = 0
for b in range(K + 1, N + 1):
d, m = divmod(N, b)
ans += d * (b - K) + max(0, m + 1 - K)
print(ans)
| false | 9.090909 | [
"-for b in range(1, N + 1):",
"- cycle, rem = divmod(N, b)",
"- ans += cycle * max(0, b - K)",
"- ans += max(0, rem + 1 - K)",
"+for b in range(K + 1, N + 1):",
"+ d, m = divmod(N, b)",
"+ ans += d * (b - K) + max(0, m + 1 - K)"
] | false | 0.157661 | 0.071954 | 2.191144 | [
"s616086847",
"s550090728"
] |
u298297089 | p02984 | python | s472853368 | s392565029 | 178 | 117 | 14,028 | 15,432 | Accepted | Accepted | 34.27 | N = int(input())
A = list(map(int,input().split()))
x1 = sum(A) - 2 * sum(A[1::2])
print(x1, end=' ')
for i in range(N-1):
x1 = 2 * A[i] - x1
print(x1, end=' ')
| N = int(eval(input()))
A = list(map(int,input().split()))
x1 = sum(A) - 2 * sum(A[1::2])
ans = []
ans.append(x1)
for i in range(N-1):
x1 = 2 * A[i] - x1
ans.append(x1)
print((*ans)) | 8 | 10 | 177 | 191 | N = int(input())
A = list(map(int, input().split()))
x1 = sum(A) - 2 * sum(A[1::2])
print(x1, end=" ")
for i in range(N - 1):
x1 = 2 * A[i] - x1
print(x1, end=" ")
| N = int(eval(input()))
A = list(map(int, input().split()))
x1 = sum(A) - 2 * sum(A[1::2])
ans = []
ans.append(x1)
for i in range(N - 1):
x1 = 2 * A[i] - x1
ans.append(x1)
print((*ans))
| false | 20 | [
"-N = int(input())",
"+N = int(eval(input()))",
"-print(x1, end=\" \")",
"+ans = []",
"+ans.append(x1)",
"- print(x1, end=\" \")",
"+ ans.append(x1)",
"+print((*ans))"
] | false | 0.095678 | 0.035927 | 2.66309 | [
"s472853368",
"s392565029"
] |
u127499732 | p02996 | python | s107555230 | s648405469 | 646 | 457 | 50,080 | 49,308 | Accepted | Accepted | 29.26 | def main():
from itertools import accumulate
n, *ab = list(map(int, open(0).read().split()))
c = list(zip(*[iter(ab)] * 2))
c.sort(key=lambda x: (x[1], x[0]))
d, f = list(zip(*c))
for i, j in zip(accumulate(d), f):
if i > j:
print('No')
break
else:
... | def main():
from itertools import accumulate
n, *ab = list(map(int, open(0).read().split()))
c = list(zip(*[iter(ab)] * 2))
c.sort(key=lambda x: (x[1], x[0]))
t = 0
for i, j in c:
t += i
if t > j:
print('No')
break
else:
print('Yes'... | 16 | 17 | 373 | 360 | def main():
from itertools import accumulate
n, *ab = list(map(int, open(0).read().split()))
c = list(zip(*[iter(ab)] * 2))
c.sort(key=lambda x: (x[1], x[0]))
d, f = list(zip(*c))
for i, j in zip(accumulate(d), f):
if i > j:
print("No")
break
else:
pr... | def main():
from itertools import accumulate
n, *ab = list(map(int, open(0).read().split()))
c = list(zip(*[iter(ab)] * 2))
c.sort(key=lambda x: (x[1], x[0]))
t = 0
for i, j in c:
t += i
if t > j:
print("No")
break
else:
print("Yes")
if __na... | false | 5.882353 | [
"- d, f = list(zip(*c))",
"- for i, j in zip(accumulate(d), f):",
"- if i > j:",
"+ t = 0",
"+ for i, j in c:",
"+ t += i",
"+ if t > j:"
] | false | 0.036861 | 0.036388 | 1.012998 | [
"s107555230",
"s648405469"
] |
u838644735 | p03329 | python | s823344460 | s600154200 | 316 | 142 | 12,688 | 8,964 | Accepted | Accepted | 55.06 | def main():
N = int(eval(input()))
dp = [-1]*(N + 1)
dp[0] = 0
multiples = [1]
n = 9
while n <= N:
multiples.append(n)
n *= 9
n = 6
while n <= N:
multiples.append(n)
n *= 6
multiples.sort(reverse=True)
# print(multiples)
for rati... | def main():
N = int(eval(input()))
ans = N
for i in range(N + 1):
cc = 0
t = i
while t > 0:
cc += t % 6
t //= 6
t = N - i
while t > 0:
cc += t % 9
t //= 9
ans = min(ans, cc)
print(ans)
if __n... | 29 | 18 | 682 | 347 | def main():
N = int(eval(input()))
dp = [-1] * (N + 1)
dp[0] = 0
multiples = [1]
n = 9
while n <= N:
multiples.append(n)
n *= 9
n = 6
while n <= N:
multiples.append(n)
n *= 6
multiples.sort(reverse=True)
# print(multiples)
for ratio in reversed... | def main():
N = int(eval(input()))
ans = N
for i in range(N + 1):
cc = 0
t = i
while t > 0:
cc += t % 6
t //= 6
t = N - i
while t > 0:
cc += t % 9
t //= 9
ans = min(ans, cc)
print(ans)
if __name__ == "__mai... | false | 37.931034 | [
"- dp = [-1] * (N + 1)",
"- dp[0] = 0",
"- multiples = [1]",
"- n = 9",
"- while n <= N:",
"- multiples.append(n)",
"- n *= 9",
"- n = 6",
"- while n <= N:",
"- multiples.append(n)",
"- n *= 6",
"- multiples.sort(reverse=True)",
"- # pri... | false | 0.073743 | 0.051604 | 1.429022 | [
"s823344460",
"s600154200"
] |
u806976856 | p02711 | python | s412678695 | s612917508 | 23 | 20 | 9,100 | 9,076 | Accepted | Accepted | 13.04 | n=eval(input())
a=int(n)%10
b=((int(n)-a)/10)%10
f="No"
if a==7:
f="Yes"
if b==7:
f="Yes"
if 700<=int(n)<800:
f="Yes"
print(f)
| n=eval(input())
f="No"
if "7"in n:
f="Yes"
print(f) | 11 | 5 | 143 | 53 | n = eval(input())
a = int(n) % 10
b = ((int(n) - a) / 10) % 10
f = "No"
if a == 7:
f = "Yes"
if b == 7:
f = "Yes"
if 700 <= int(n) < 800:
f = "Yes"
print(f)
| n = eval(input())
f = "No"
if "7" in n:
f = "Yes"
print(f)
| false | 54.545455 | [
"-a = int(n) % 10",
"-b = ((int(n) - a) / 10) % 10",
"-if a == 7:",
"- f = \"Yes\"",
"-if b == 7:",
"- f = \"Yes\"",
"-if 700 <= int(n) < 800:",
"+if \"7\" in n:"
] | false | 0.047636 | 0.047558 | 1.001653 | [
"s412678695",
"s612917508"
] |
u793868662 | p02803 | python | s668686682 | s497041965 | 447 | 255 | 59,356 | 43,740 | Accepted | Accepted | 42.95 | def resolve():
h, w = list(map(int, input().split()))
maze = [eval(input()) for _ in range(h)]
from collections import deque
def slv(maze, startx, starty):
if maze[startx][starty] == "#":
return 0
else:
visited = [[-1] * w for _ in range(h)]
v... | def resolve():
h, w = list(map(int, input().split()))
maze = [eval(input()) for _ in range(h)]
from collections import deque
def slv(maze, startx, starty):
if maze[startx][starty] == "#":
return 0
else:
visited = [[-1] * w for _ in range(h)]
v... | 42 | 31 | 1,715 | 1,068 | def resolve():
h, w = list(map(int, input().split()))
maze = [eval(input()) for _ in range(h)]
from collections import deque
def slv(maze, startx, starty):
if maze[startx][starty] == "#":
return 0
else:
visited = [[-1] * w for _ in range(h)]
visited[s... | def resolve():
h, w = list(map(int, input().split()))
maze = [eval(input()) for _ in range(h)]
from collections import deque
def slv(maze, startx, starty):
if maze[startx][starty] == "#":
return 0
else:
visited = [[-1] * w for _ in range(h)]
visited[s... | false | 26.190476 | [
"- if 0 <= (x + 1) < h and 0 <= y < w:",
"- if maze[x + 1][y] == \".\" and visited[x + 1][y] == -1:",
"- visited[x + 1][y] = visited[x][y] + 1",
"- nxt.append([x + 1, y])",
"- if 0 <= x < h and 0 <= y - 1 < w:",
... | false | 0.044761 | 0.098249 | 0.455585 | [
"s668686682",
"s497041965"
] |
u316401642 | p02802 | python | s383191784 | s591892249 | 684 | 281 | 15,400 | 5,528 | Accepted | Accepted | 58.92 | import numpy as np
n, m = list(map(int, input().split()))
ac = np.zeros(n)
wa = np.zeros(n)
for _ in range(m):
p, s = input().split()
p = int(p) - 1
if s == "AC":
ac[p] = 1
elif not ac[p]:
wa[p] += 1
print(("{} {}".format(np.sum(ac, dtype=np.int64), np.sum(ac * wa, dtype=np.in... | n, m = list(map(int, input().split()))
ac = [0] * n
wa = [0] * n
for _ in range(m):
p, s = input().split()
p = int(p) - 1
if s == "AC":
ac[p] = 1
elif not ac[p]:
wa[p] += 1
ans = [sum(ac), sum([i * j for i, j in zip(ac, wa)])]
print(("{} {}".format(ans[0], ans[1]))) | 12 | 12 | 325 | 307 | import numpy as np
n, m = list(map(int, input().split()))
ac = np.zeros(n)
wa = np.zeros(n)
for _ in range(m):
p, s = input().split()
p = int(p) - 1
if s == "AC":
ac[p] = 1
elif not ac[p]:
wa[p] += 1
print(("{} {}".format(np.sum(ac, dtype=np.int64), np.sum(ac * wa, dtype=np.int64))))
| n, m = list(map(int, input().split()))
ac = [0] * n
wa = [0] * n
for _ in range(m):
p, s = input().split()
p = int(p) - 1
if s == "AC":
ac[p] = 1
elif not ac[p]:
wa[p] += 1
ans = [sum(ac), sum([i * j for i, j in zip(ac, wa)])]
print(("{} {}".format(ans[0], ans[1])))
| false | 0 | [
"-import numpy as np",
"-",
"-ac = np.zeros(n)",
"-wa = np.zeros(n)",
"+ac = [0] * n",
"+wa = [0] * n",
"-print((\"{} {}\".format(np.sum(ac, dtype=np.int64), np.sum(ac * wa, dtype=np.int64))))",
"+ans = [sum(ac), sum([i * j for i, j in zip(ac, wa)])]",
"+print((\"{} {}\".format(ans[0], ans[1])))"
] | false | 0.879716 | 0.133831 | 6.573359 | [
"s383191784",
"s591892249"
] |
u729939940 | p02802 | python | s329256865 | s354892946 | 100 | 92 | 17,992 | 17,992 | Accepted | Accepted | 8 | import sys
N, M, *PS = sys.stdin.read().strip().split()
N = int(N)
ac = [0] * N
wa = [0] * N
for p, s in zip(*[iter(PS)] * 2):
p = int(p) -1
if s == "AC":
ac[p] = 1
elif ac[p] == 0:
wa[p] += 1
penalties = sum([w * a for a, w in zip(ac, wa)])
print(("{} {}".format(sum(ac), penalties))) | import sys
N, M, *PS = sys.stdin.read().strip().split()
N = int(N)
ac = [0] * N
wa = [0] * N
for p, s in zip(*[iter(PS)] * 2):
p = int(p) -1
if s == "AC":
ac[p] = 1
elif ac[p] == 0:
wa[p] += 1
penalties = sum([w if a > 0 else 0 for a, w in zip(ac, wa)])
print(("{} {}".format(sum(ac), penalties... | 13 | 13 | 309 | 321 | import sys
N, M, *PS = sys.stdin.read().strip().split()
N = int(N)
ac = [0] * N
wa = [0] * N
for p, s in zip(*[iter(PS)] * 2):
p = int(p) - 1
if s == "AC":
ac[p] = 1
elif ac[p] == 0:
wa[p] += 1
penalties = sum([w * a for a, w in zip(ac, wa)])
print(("{} {}".format(sum(ac), penalties)))
| import sys
N, M, *PS = sys.stdin.read().strip().split()
N = int(N)
ac = [0] * N
wa = [0] * N
for p, s in zip(*[iter(PS)] * 2):
p = int(p) - 1
if s == "AC":
ac[p] = 1
elif ac[p] == 0:
wa[p] += 1
penalties = sum([w if a > 0 else 0 for a, w in zip(ac, wa)])
print(("{} {}".format(sum(ac), penal... | false | 0 | [
"-penalties = sum([w * a for a, w in zip(ac, wa)])",
"+penalties = sum([w if a > 0 else 0 for a, w in zip(ac, wa)])"
] | false | 0.007808 | 0.116503 | 0.067019 | [
"s329256865",
"s354892946"
] |
u511401499 | p03128 | python | s660723185 | s198805308 | 176 | 151 | 17,116 | 17,116 | Accepted | Accepted | 14.2 | import sys
sys.setrecursionlimit(1000000)
ma_map = [ -1, 2, 5, 5, 4, 5, 6, 3, 7, 6 ]
N, M = (int(i) for i in input().split())
ma = list(int(i) for i in input().split())
memo = [-1] * 100000
def dfs(num):
if memo[num] != -1: return memo[num]
if num == 0: return 0
ret = -1
for p in ma:
if 0 <= num ... | import sys
sys.setrecursionlimit(1000000)
ma_map = [ -1, 2, 5, 5, 4, 5, 6, 3, 7, 6 ]
N, M = (int(i) for i in input().split())
ma = list(int(i) for i in input().split())
memo = [-1] * 100000
def dfs(num):
if memo[num] != -1: return memo[num]
if num == 0: return 0
ret = -1
for p in ma:
if 0 <= num ... | 24 | 22 | 510 | 443 | import sys
sys.setrecursionlimit(1000000)
ma_map = [-1, 2, 5, 5, 4, 5, 6, 3, 7, 6]
N, M = (int(i) for i in input().split())
ma = list(int(i) for i in input().split())
memo = [-1] * 100000
def dfs(num):
if memo[num] != -1:
return memo[num]
if num == 0:
return 0
ret = -1
for p in ma:
... | import sys
sys.setrecursionlimit(1000000)
ma_map = [-1, 2, 5, 5, 4, 5, 6, 3, 7, 6]
N, M = (int(i) for i in input().split())
ma = list(int(i) for i in input().split())
memo = [-1] * 100000
def dfs(num):
if memo[num] != -1:
return memo[num]
if num == 0:
return 0
ret = -1
for p in ma:
... | false | 8.333333 | [
"- d = dfs(num - ma_map[p])",
"- if d == -1:",
"- continue",
"-print((\"{}\".format(dfs(N))))",
"+print((dfs(N)))"
] | false | 0.045743 | 0.134816 | 0.3393 | [
"s660723185",
"s198805308"
] |
u759412327 | p03625 | python | s916299917 | s973035719 | 108 | 78 | 14,224 | 24,104 | Accepted | Accepted | 27.78 | N = int(eval(input()))
A = sorted(list(map(int,input().split())),reverse=True)
for i in range(N-1):
if A[i]==A[i+1]:
A[i+1]=0
else:
A[i]=0
A.sort(reverse=True)
print((A[0]*A[1])) | from collections import *
N = int(eval(input()))
C = Counter(list(map(int,input().split())))
A = [0,0]
B = [0]
for k,v in list(C.items()):
if 2<=v:
A+=[k]
if 4<=v:
B+=[k]
A.sort()
B.sort()
print((max(A[-1]*A[-2],B[-1]**2))) | 11 | 15 | 206 | 231 | N = int(eval(input()))
A = sorted(list(map(int, input().split())), reverse=True)
for i in range(N - 1):
if A[i] == A[i + 1]:
A[i + 1] = 0
else:
A[i] = 0
A.sort(reverse=True)
print((A[0] * A[1]))
| from collections import *
N = int(eval(input()))
C = Counter(list(map(int, input().split())))
A = [0, 0]
B = [0]
for k, v in list(C.items()):
if 2 <= v:
A += [k]
if 4 <= v:
B += [k]
A.sort()
B.sort()
print((max(A[-1] * A[-2], B[-1] ** 2)))
| false | 26.666667 | [
"+from collections import *",
"+",
"-A = sorted(list(map(int, input().split())), reverse=True)",
"-for i in range(N - 1):",
"- if A[i] == A[i + 1]:",
"- A[i + 1] = 0",
"- else:",
"- A[i] = 0",
"-A.sort(reverse=True)",
"-print((A[0] * A[1]))",
"+C = Counter(list(map(int, input... | false | 0.051739 | 0.046303 | 1.117403 | [
"s916299917",
"s973035719"
] |
u133936772 | p02911 | python | s201081321 | s778899793 | 267 | 97 | 6,580 | 20,492 | Accepted | Accepted | 63.67 | n,k,q = list(map(int,input().split()))
l = [k-q]*n
for _ in range(q): l[int(eval(input()))-1]+=1
for i in l: print(('YNeos'[i<1::2])) | n,k,q,*l=list(map(int,open(0).read().split()))
s=[k-q]*n
for i in l: s[i-1]+=1
for i in s: print((['No','Yes'][i>0])) | 4 | 4 | 122 | 112 | n, k, q = list(map(int, input().split()))
l = [k - q] * n
for _ in range(q):
l[int(eval(input())) - 1] += 1
for i in l:
print(("YNeos"[i < 1 :: 2]))
| n, k, q, *l = list(map(int, open(0).read().split()))
s = [k - q] * n
for i in l:
s[i - 1] += 1
for i in s:
print((["No", "Yes"][i > 0]))
| false | 0 | [
"-n, k, q = list(map(int, input().split()))",
"-l = [k - q] * n",
"-for _ in range(q):",
"- l[int(eval(input())) - 1] += 1",
"+n, k, q, *l = list(map(int, open(0).read().split()))",
"+s = [k - q] * n",
"- print((\"YNeos\"[i < 1 :: 2]))",
"+ s[i - 1] += 1",
"+for i in s:",
"+ print(([\"... | false | 0.070428 | 0.095384 | 0.73836 | [
"s201081321",
"s778899793"
] |
u584174687 | p03634 | python | s341701849 | s928303965 | 1,749 | 734 | 114,648 | 104,540 | Accepted | Accepted | 58.03 |
from collections import defaultdict
def main():
num = int(eval(input()))
link = defaultdict(set)
weight = defaultdict(int)
for i in range(num - 1):
a, b, c = list(map(int, input().split()))
link[a].add(b)
link[b].add(a)
weight[(min(a, b), max(a, b))] = c
... |
from collections import defaultdict
import sys
input = sys.stdin.readline
def main():
num = int(eval(input()))
link = defaultdict(set)
weight = defaultdict(int)
for i in range(num - 1):
a, b, c = list(map(int, input().split()))
link[a].add(b)
link[b].add(a)
... | 43 | 45 | 1,070 | 1,110 | from collections import defaultdict
def main():
num = int(eval(input()))
link = defaultdict(set)
weight = defaultdict(int)
for i in range(num - 1):
a, b, c = list(map(int, input().split()))
link[a].add(b)
link[b].add(a)
weight[(min(a, b), max(a, b))] = c
q_num, k = ... | from collections import defaultdict
import sys
input = sys.stdin.readline
def main():
num = int(eval(input()))
link = defaultdict(set)
weight = defaultdict(int)
for i in range(num - 1):
a, b, c = list(map(int, input().split()))
link[a].add(b)
link[b].add(a)
weight[(min... | false | 4.444444 | [
"+import sys",
"+",
"+input = sys.stdin.readline"
] | false | 0.109335 | 0.099797 | 1.095577 | [
"s341701849",
"s928303965"
] |
u088552457 | p03659 | python | s448630711 | s552483479 | 352 | 274 | 103,756 | 86,864 | Accepted | Accepted | 22.16 | def main():
n = int(eval(input()))
a = list(input_list())
sa = sum(a)
ans = 10**10
r = 0
for v in list(a)[:-1]:
r += v
ans = min(ans, abs(sa - (2*r)))
print(ans)
def input_list():
return list(map(int, input().split()))
def input_list_str():
return list(map(str, input().split()... | import collections
def main():
n = int(eval(input()))
a = input_list()
sum_a = sum(a)
wa = []
for i, v in enumerate(a):
if i == 0:
wa.append(v)
else:
wa.append(v+wa[i-1])
ans = float('inf')
for i in range(n-1):
ans = min(ans, a... | 33 | 25 | 642 | 462 | def main():
n = int(eval(input()))
a = list(input_list())
sa = sum(a)
ans = 10**10
r = 0
for v in list(a)[:-1]:
r += v
ans = min(ans, abs(sa - (2 * r)))
print(ans)
def input_list():
return list(map(int, input().split()))
def input_list_str():
return list(map(str, ... | import collections
def main():
n = int(eval(input()))
a = input_list()
sum_a = sum(a)
wa = []
for i, v in enumerate(a):
if i == 0:
wa.append(v)
else:
wa.append(v + wa[i - 1])
ans = float("inf")
for i in range(n - 1):
ans = min(ans, abs(sum_a ... | false | 24.242424 | [
"+import collections",
"+",
"+",
"- a = list(input_list())",
"- sa = sum(a)",
"- ans = 10**10",
"- r = 0",
"- for v in list(a)[:-1]:",
"- r += v",
"- ans = min(ans, abs(sa - (2 * r)))",
"+ a = input_list()",
"+ sum_a = sum(a)",
"+ wa = []",
"+ for i... | false | 0.043558 | 0.035627 | 1.222606 | [
"s448630711",
"s552483479"
] |
u644907318 | p03268 | python | s288597176 | s607327041 | 181 | 165 | 38,384 | 38,384 | Accepted | Accepted | 8.84 | N,K = list(map(int,input().split()))
if K%2==0:
k = K//2
o = (N+k)//K
e = N//K
ans = e**3+o**3
else:
ans = (N//K)**3
print(ans) | N,K = list(map(int,input().split()))
if K%2==1:
n = N//K
ans = n**3
else:
n1 = N//K
n2 = 1+(N-K//2)//K
ans = n1**3+n2**3
print(ans) | 9 | 9 | 153 | 153 | N, K = list(map(int, input().split()))
if K % 2 == 0:
k = K // 2
o = (N + k) // K
e = N // K
ans = e**3 + o**3
else:
ans = (N // K) ** 3
print(ans)
| N, K = list(map(int, input().split()))
if K % 2 == 1:
n = N // K
ans = n**3
else:
n1 = N // K
n2 = 1 + (N - K // 2) // K
ans = n1**3 + n2**3
print(ans)
| false | 0 | [
"-if K % 2 == 0:",
"- k = K // 2",
"- o = (N + k) // K",
"- e = N // K",
"- ans = e**3 + o**3",
"+if K % 2 == 1:",
"+ n = N // K",
"+ ans = n**3",
"- ans = (N // K) ** 3",
"+ n1 = N // K",
"+ n2 = 1 + (N - K // 2) // K",
"+ ans = n1**3 + n2**3"
] | false | 0.036738 | 0.177527 | 0.206945 | [
"s288597176",
"s607327041"
] |
u347600233 | p02802 | python | s425731544 | s609383383 | 289 | 256 | 25,620 | 25,544 | Accepted | Accepted | 11.42 | n, m = map(int, input().split())
s = [[] for i in range(n)]
for i in range(m):
p, S = input().split()
s[int(p) - 1] += [S]
print(sum('AC' in si for si in s), end=' ')
print(sum(si[:si.index('AC')].count('WA') if 'AC' in si else 0 for si in s))
| n, m = list(map(int, input().split()))
s = [[] for i in range(n)]
for i in range(m):
p, S = input().split()
s[int(p) - 1] += [S]
print((sum('AC' in si for si in s), sum(si[:si.index('AC')].count('WA') if 'AC' in si else 0 for si in s))) | 7 | 6 | 257 | 241 | n, m = map(int, input().split())
s = [[] for i in range(n)]
for i in range(m):
p, S = input().split()
s[int(p) - 1] += [S]
print(sum("AC" in si for si in s), end=" ")
print(sum(si[: si.index("AC")].count("WA") if "AC" in si else 0 for si in s))
| n, m = list(map(int, input().split()))
s = [[] for i in range(n)]
for i in range(m):
p, S = input().split()
s[int(p) - 1] += [S]
print(
(
sum("AC" in si for si in s),
sum(si[: si.index("AC")].count("WA") if "AC" in si else 0 for si in s),
)
)
| false | 14.285714 | [
"-n, m = map(int, input().split())",
"+n, m = list(map(int, input().split()))",
"-print(sum(\"AC\" in si for si in s), end=\" \")",
"-print(sum(si[: si.index(\"AC\")].count(\"WA\") if \"AC\" in si else 0 for si in s))",
"+print(",
"+ (",
"+ sum(\"AC\" in si for si in s),",
"+ sum(si[:... | false | 0.052091 | 0.090007 | 0.578745 | [
"s425731544",
"s609383383"
] |
u844789719 | p02585 | python | s837105998 | s673997140 | 111 | 82 | 11,276 | 11,540 | Accepted | Accepted | 26.13 | import itertools
N, K = [int(_) for _ in input().split()]
P = [int(_) - 1 for _ in input().split()]
C = [int(_) for _ in input().split()]
class SegmentTree():
def __init__(self, array, f, ti):
"""
Parameters
----------
array : list
to construct segment tree ... | import itertools
N, K = [int(_) for _ in input().split()]
P = [int(_) - 1 for _ in input().split()]
C = [int(_) for _ in input().split()]
class SegmentTree():
def __init__(self, array, f, ti):
"""
Parameters
----------
array : list
to construct segment tree ... | 96 | 93 | 2,900 | 2,742 | import itertools
N, K = [int(_) for _ in input().split()]
P = [int(_) - 1 for _ in input().split()]
C = [int(_) for _ in input().split()]
class SegmentTree:
def __init__(self, array, f, ti):
"""
Parameters
----------
array : list
to construct segment tree from
... | import itertools
N, K = [int(_) for _ in input().split()]
P = [int(_) - 1 for _ in input().split()]
C = [int(_) for _ in input().split()]
class SegmentTree:
def __init__(self, array, f, ti):
"""
Parameters
----------
array : list
to construct segment tree from
... | false | 3.125 | [
"- cum = list(itertools.accumulate(scores * 2))",
"+ cum = list(itertools.accumulate(scores * 3))",
"- v1 = cum[-1] * (cycle - 1) // 2 + max(",
"- st.query(start2, start2 + cyclelen + 1) - cum[start2]",
"- for start2 in range(cyclelen)",
"+ v = cum[-1] * cycle // ... | false | 0.044467 | 0.035517 | 1.251997 | [
"s837105998",
"s673997140"
] |
u844005364 | p03457 | python | s183199913 | s000289382 | 389 | 352 | 27,380 | 27,300 | Accepted | Accepted | 9.51 | N=int(eval(input()))
txy=[list(map(int,input().split())) for i in range(N)]
ans=0
for i in range(N):
t,x,y=txy[i][0],txy[i][1],txy[i][2]
if x+y<=t and t%2==(x+y)%2:ans+=1
print(("Yes" if ans==N else "No")) | n = int(eval(input()))
txy = [list(map(int, input().split())) for _ in range(n)]
for i in range(n):
t, x, y = txy[i]
if x + y > t or (t - x - y) % 2:
print("No")
exit()
print("Yes")
| 7 | 10 | 211 | 212 | N = int(eval(input()))
txy = [list(map(int, input().split())) for i in range(N)]
ans = 0
for i in range(N):
t, x, y = txy[i][0], txy[i][1], txy[i][2]
if x + y <= t and t % 2 == (x + y) % 2:
ans += 1
print(("Yes" if ans == N else "No"))
| n = int(eval(input()))
txy = [list(map(int, input().split())) for _ in range(n)]
for i in range(n):
t, x, y = txy[i]
if x + y > t or (t - x - y) % 2:
print("No")
exit()
print("Yes")
| false | 30 | [
"-N = int(eval(input()))",
"-txy = [list(map(int, input().split())) for i in range(N)]",
"-ans = 0",
"-for i in range(N):",
"- t, x, y = txy[i][0], txy[i][1], txy[i][2]",
"- if x + y <= t and t % 2 == (x + y) % 2:",
"- ans += 1",
"-print((\"Yes\" if ans == N else \"No\"))",
"+n = int(ev... | false | 0.072701 | 0.095131 | 0.764226 | [
"s183199913",
"s000289382"
] |
u116002573 | p02765 | python | s233569484 | s676758478 | 178 | 164 | 38,384 | 38,384 | Accepted | Accepted | 7.87 | def main():
N, R = list(map(int, input().split()))
if N >= 10:
return R
else:
return R + 100 * (10-N)
if __name__ == '__main__':
print((main()))
| def main():
N, R = list(map(int, input().split()))
if N >= 10: return R
return R + 100 * (10 - N)
if __name__ == '__main__':
print((main()))
| 10 | 8 | 180 | 158 | def main():
N, R = list(map(int, input().split()))
if N >= 10:
return R
else:
return R + 100 * (10 - N)
if __name__ == "__main__":
print((main()))
| def main():
N, R = list(map(int, input().split()))
if N >= 10:
return R
return R + 100 * (10 - N)
if __name__ == "__main__":
print((main()))
| false | 20 | [
"- else:",
"- return R + 100 * (10 - N)",
"+ return R + 100 * (10 - N)"
] | false | 0.046292 | 0.041399 | 1.118203 | [
"s233569484",
"s676758478"
] |
u133936772 | p03487 | python | s087068465 | s189262427 | 88 | 73 | 23,684 | 23,684 | Accepted | Accepted | 17.05 | eval(input())
from collections import *
c=Counter(list(map(int,input().split())))
a=0
for k,v in list(c.items()):
if k<v: a+=v-k
if k>v: a+=v
print(a) | eval(input())
from collections import *
c=Counter(list(map(int,input().split())))
print((sum(v-k*(k<=v) for k,v in list(c.items())))) | 8 | 4 | 143 | 116 | eval(input())
from collections import *
c = Counter(list(map(int, input().split())))
a = 0
for k, v in list(c.items()):
if k < v:
a += v - k
if k > v:
a += v
print(a)
| eval(input())
from collections import *
c = Counter(list(map(int, input().split())))
print((sum(v - k * (k <= v) for k, v in list(c.items()))))
| false | 50 | [
"-a = 0",
"-for k, v in list(c.items()):",
"- if k < v:",
"- a += v - k",
"- if k > v:",
"- a += v",
"-print(a)",
"+print((sum(v - k * (k <= v) for k, v in list(c.items()))))"
] | false | 0.043678 | 0.075351 | 0.579654 | [
"s087068465",
"s189262427"
] |
u831244171 | p02260 | python | s137166349 | s228657476 | 50 | 20 | 7,644 | 7,672 | Accepted | Accepted | 60 | n = int(eval(input()))
A = list(map(int,input().split()))
c = 0
for i in range(n):
minj = i
for j in range(i,n):
if A[j] < A[minj]:
minj = j
if minj != i:
t = A[i]
A[i] = A[minj]
A[minj] = t
c += 1
print((" ".join(map(str,A))))
print(c) | def selectionSort(a):
count = 0
for i in range(len(a)):
mini = i
for j in range(i,len(a)):
if a[j] < a[mini]:
mini = j
if i != mini:
ret = a[i]
a[i] = a[mini]
a[mini] = ret
count += 1
print((" ".j... | 16 | 17 | 309 | 425 | n = int(eval(input()))
A = list(map(int, input().split()))
c = 0
for i in range(n):
minj = i
for j in range(i, n):
if A[j] < A[minj]:
minj = j
if minj != i:
t = A[i]
A[i] = A[minj]
A[minj] = t
c += 1
print((" ".join(map(str, A))))
print(c)
| def selectionSort(a):
count = 0
for i in range(len(a)):
mini = i
for j in range(i, len(a)):
if a[j] < a[mini]:
mini = j
if i != mini:
ret = a[i]
a[i] = a[mini]
a[mini] = ret
count += 1
print((" ".join(map(str... | false | 5.882353 | [
"+def selectionSort(a):",
"+ count = 0",
"+ for i in range(len(a)):",
"+ mini = i",
"+ for j in range(i, len(a)):",
"+ if a[j] < a[mini]:",
"+ mini = j",
"+ if i != mini:",
"+ ret = a[i]",
"+ a[i] = a[mini]",
"+ ... | false | 0.007157 | 0.034798 | 0.205685 | [
"s137166349",
"s228657476"
] |
u489959379 | p03986 | python | s260881020 | s713931316 | 187 | 44 | 40,672 | 3,500 | Accepted | Accepted | 76.47 | import sys
sys.setrecursionlimit(10 ** 7)
f_inf = float('inf')
mod = 10 ** 9 + 7
def resolve():
x = eval(input())
cnt_S = 0
cnt_T = 0
res = 0
i = 0
while i < len(x):
if x[i] == "S":
cnt_S += 1
i += 1
elif x[i] == "T" and cnt_S != 0:... | import sys
sys.setrecursionlimit(10 ** 7)
f_inf = float('inf')
mod = 10 ** 9 + 7
def resolve1():
x = eval(input())
cnt_S = 0
cnt_T = 0
res = 0
i = 0
while i < len(x):
if x[i] == "S":
cnt_S += 1
i += 1
elif x[i] == "T" and cnt_S != 0... | 34 | 50 | 628 | 884 | import sys
sys.setrecursionlimit(10**7)
f_inf = float("inf")
mod = 10**9 + 7
def resolve():
x = eval(input())
cnt_S = 0
cnt_T = 0
res = 0
i = 0
while i < len(x):
if x[i] == "S":
cnt_S += 1
i += 1
elif x[i] == "T" and cnt_S != 0:
while i < le... | import sys
sys.setrecursionlimit(10**7)
f_inf = float("inf")
mod = 10**9 + 7
def resolve1():
x = eval(input())
cnt_S = 0
cnt_T = 0
res = 0
i = 0
while i < len(x):
if x[i] == "S":
cnt_S += 1
i += 1
elif x[i] == "T" and cnt_S != 0:
while i < l... | false | 32 | [
"-def resolve():",
"+def resolve1():",
"+def resolve2():",
"+ x = eval(input())",
"+ n = len(x)",
"+ stack = 0",
"+ res = 0",
"+ for i in range(n):",
"+ if x[i] == \"S\":",
"+ stack += 1",
"+ elif stack > 0:",
"+ stack -= 1",
"+ r... | false | 0.12356 | 0.047306 | 2.611912 | [
"s260881020",
"s713931316"
] |
u600880955 | p03631 | python | s059432673 | s389633936 | 21 | 17 | 3,060 | 2,940 | Accepted | Accepted | 19.05 | n1, n2, n3 = eval(input())
print(('Yes' if n1 == n3 else 'No'))
| N = eval(input())
if N[0] == N[2]:
print('Yes')
else:
print('No')
| 2 | 5 | 57 | 68 | n1, n2, n3 = eval(input())
print(("Yes" if n1 == n3 else "No"))
| N = eval(input())
if N[0] == N[2]:
print("Yes")
else:
print("No")
| false | 60 | [
"-n1, n2, n3 = eval(input())",
"-print((\"Yes\" if n1 == n3 else \"No\"))",
"+N = eval(input())",
"+if N[0] == N[2]:",
"+ print(\"Yes\")",
"+else:",
"+ print(\"No\")"
] | false | 0.040099 | 0.04049 | 0.99034 | [
"s059432673",
"s389633936"
] |
u312025627 | p02837 | python | s527030868 | s111368662 | 320 | 250 | 49,244 | 43,756 | Accepted | Accepted | 21.88 | def main():
N = int(eval(input()))
G = [[] for _ in range(N)]
for i in range(N):
a = int(eval(input()))
for j in range(a):
x, y = (int(i) for i in input().split())
G[i].append((x-1, y))
# 人iは人xのことをyと言っている
ans = 0
for bit in range(1 << N... | def main():
N = int(eval(input()))
G = [[] for _ in range(N)]
for i in range(N):
a = int(eval(input()))
for j in range(a):
x, y = (int(i) for i in input().split())
G[i].append((x-1, y))
# 人iは人xのことをyと言っている
ans = 0
for bit in range(1 << N):... | 50 | 30 | 1,590 | 834 | def main():
N = int(eval(input()))
G = [[] for _ in range(N)]
for i in range(N):
a = int(eval(input()))
for j in range(a):
x, y = (int(i) for i in input().split())
G[i].append((x - 1, y))
# 人iは人xのことをyと言っている
ans = 0
for bit in range(1 << N):
... | def main():
N = int(eval(input()))
G = [[] for _ in range(N)]
for i in range(N):
a = int(eval(input()))
for j in range(a):
x, y = (int(i) for i in input().split())
G[i].append((x - 1, y))
# 人iは人xのことをyと言っている
ans = 0
for bit in range(1 << N):
... | false | 40 | [
"- if (bit & (1 << j)) and y == 1:",
"- continue",
"- elif not (bit & (1 << j)) and y == 0:",
"- continue",
"- elif (bit & (1 << j)) and y == 0:",
"+ if (bit & (1 << j)) and y == 0:",
... | false | 0.080551 | 0.03429 | 2.349099 | [
"s527030868",
"s111368662"
] |
u073852194 | p02560 | python | s391927959 | s645417391 | 227 | 208 | 78,176 | 78,056 | Accepted | Accepted | 8.37 | def floor_sum(n, m, a, b):
res = 0
while True:
res += (n - 1) * n * (a // m) // 2
a %= m
res += n * (b // m)
b %= m
y_max = (a * n + b) // m
if y_max == 0: break
x_max = y_max * m - b
res += (n - (x_max + a - 1) // a) * y_max
n, ... | def floor_sum(n, m, a, b):
res = 0
while True:
if a >= m:
res += (n - 1) * n * (a // m) // 2
a %= m
if b >= m:
res += n * (b // m)
b %= m
y_max = (a * n + b) // m
if y_max == 0: break
x_max = b - y_max * m
... | 25 | 27 | 588 | 633 | def floor_sum(n, m, a, b):
res = 0
while True:
res += (n - 1) * n * (a // m) // 2
a %= m
res += n * (b // m)
b %= m
y_max = (a * n + b) // m
if y_max == 0:
break
x_max = y_max * m - b
res += (n - (x_max + a - 1) // a) * y_max
n,... | def floor_sum(n, m, a, b):
res = 0
while True:
if a >= m:
res += (n - 1) * n * (a // m) // 2
a %= m
if b >= m:
res += n * (b // m)
b %= m
y_max = (a * n + b) // m
if y_max == 0:
break
x_max = b - y_max * m
... | false | 7.407407 | [
"- res += (n - 1) * n * (a // m) // 2",
"- a %= m",
"- res += n * (b // m)",
"- b %= m",
"+ if a >= m:",
"+ res += (n - 1) * n * (a // m) // 2",
"+ a %= m",
"+ if b >= m:",
"+ res += n * (b // m)",
"+ b %= m",
... | false | 0.039128 | 0.039877 | 0.981205 | [
"s391927959",
"s645417391"
] |
u127499732 | p02720 | python | s963071302 | s507214555 | 52 | 47 | 18,124 | 18,300 | Accepted | Accepted | 9.62 | def LunLun(k, count, base):
nx = []
n = len(base)
if count + n >= k:
ans = base[k - count - 1]
return ans
for x in base:
count += 1
p = x % 10
x *= 10
a = x + p - 1
b = a + 1
c = b + 1
n = 3
if p == 0:
... | def LunLun(k, count, base):
nx = []
n = len(base)
if count + n >= k:
ans = base[k - count - 1]
print(ans)
exit()
for x in base:
count += 1
p = x % 10
x *= 10
a = x + p - 1
b = a + 1
c = b + 1
n = 3
i... | 35 | 36 | 674 | 674 | def LunLun(k, count, base):
nx = []
n = len(base)
if count + n >= k:
ans = base[k - count - 1]
return ans
for x in base:
count += 1
p = x % 10
x *= 10
a = x + p - 1
b = a + 1
c = b + 1
n = 3
if p == 0:
n -= 1
... | def LunLun(k, count, base):
nx = []
n = len(base)
if count + n >= k:
ans = base[k - count - 1]
print(ans)
exit()
for x in base:
count += 1
p = x % 10
x *= 10
a = x + p - 1
b = a + 1
c = b + 1
n = 3
if p == 0:
... | false | 2.777778 | [
"- return ans",
"+ print(ans)",
"+ exit()",
"- ans = LunLun(k, 0, base)",
"- print(ans)",
"+ LunLun(k, 0, base)"
] | false | 0.133664 | 0.080408 | 1.662321 | [
"s963071302",
"s507214555"
] |
u254871849 | p03637 | python | s909759864 | s858677670 | 181 | 58 | 23,836 | 14,052 | Accepted | Accepted | 67.96 | import sys
import numpy as np
n = int(sys.stdin.readline().rstrip())
a = np.array(sys.stdin.read().split(), dtype=np.int64)
def main():
mul_4 = n - np.count_nonzero(a % 4)
mul_2 = n - np.count_nonzero(a % 2)
if mul_4 >= n // 2:
return 'Yes'
if mul_4 * 2 + (mul_2 - mul_4) >= n:
... | import sys
n, *a = list(map(int, sys.stdin.read().split()))
def main():
c4 = c2 = 0
for x in a:
if not x % 4: c4 += 1
elif not x % 2: c2 += 1
ans = 'Yes' if c4 >= n // 2 or c4 * 2 + c2 >= n else 'No'
print(ans)
if __name__ == '__main__':
main() | 20 | 14 | 434 | 291 | import sys
import numpy as np
n = int(sys.stdin.readline().rstrip())
a = np.array(sys.stdin.read().split(), dtype=np.int64)
def main():
mul_4 = n - np.count_nonzero(a % 4)
mul_2 = n - np.count_nonzero(a % 2)
if mul_4 >= n // 2:
return "Yes"
if mul_4 * 2 + (mul_2 - mul_4) >= n:
return ... | import sys
n, *a = list(map(int, sys.stdin.read().split()))
def main():
c4 = c2 = 0
for x in a:
if not x % 4:
c4 += 1
elif not x % 2:
c2 += 1
ans = "Yes" if c4 >= n // 2 or c4 * 2 + c2 >= n else "No"
print(ans)
if __name__ == "__main__":
main()
| false | 30 | [
"-import numpy as np",
"-n = int(sys.stdin.readline().rstrip())",
"-a = np.array(sys.stdin.read().split(), dtype=np.int64)",
"+n, *a = list(map(int, sys.stdin.read().split()))",
"- mul_4 = n - np.count_nonzero(a % 4)",
"- mul_2 = n - np.count_nonzero(a % 2)",
"- if mul_4 >= n // 2:",
"- ... | false | 0.508014 | 0.04708 | 10.790436 | [
"s909759864",
"s858677670"
] |
u144913062 | p02728 | python | s650563234 | s467220062 | 2,302 | 901 | 86,856 | 116,784 | Accepted | Accepted | 60.86 | import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)
N = int(input())
G = [[] for _ in range(N)]
for _ in range(N-1):
a, b = map(lambda x : int(x)-1, input().split())
G[a].append(b)
G[b].append(a)
mod = 10**9+7
fact = [1] * N
fact_inv = [1] * N
for i in range(1, N):
fact[i... | import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)
N = int(input())
G = [[] for _ in range(N)]
for _ in range(N-1):
a, b = map(lambda x : int(x)-1, input().split())
G[a].append(b)
G[b].append(a)
mod = 10**9+7
fact = [1] * N
fact_inv = [1] * N
for i in range(1, N):
fact[i... | 46 | 49 | 1,165 | 1,068 | import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)
N = int(input())
G = [[] for _ in range(N)]
for _ in range(N - 1):
a, b = map(lambda x: int(x) - 1, input().split())
G[a].append(b)
G[b].append(a)
mod = 10**9 + 7
fact = [1] * N
fact_inv = [1] * N
for i in range(1, N):
fact[i] = i * fac... | import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)
N = int(input())
G = [[] for _ in range(N)]
for _ in range(N - 1):
a, b = map(lambda x: int(x) - 1, input().split())
G[a].append(b)
G[b].append(a)
mod = 10**9 + 7
fact = [1] * N
fact_inv = [1] * N
for i in range(1, N):
fact[i] = i * fac... | false | 6.122449 | [
"-comb = lambda n, k: fact[n] * fact_inv[k] * fact_inv[n - k] % mod",
"+stack = [0]",
"+parent = [-1] * N",
"+order = []",
"+while stack:",
"+ v = stack.pop()",
"+ order.append(v)",
"+ for c in G[v]:",
"+ if c != parent[v]:",
"+ stack.append(c)",
"+ parent[c... | false | 0.038256 | 0.037458 | 1.02129 | [
"s650563234",
"s467220062"
] |
u449473917 | p04001 | python | s899408014 | s351367831 | 27 | 18 | 3,060 | 3,060 | Accepted | Accepted | 33.33 | n=list(eval(input()))
k=len(n)-1
x=0
for i in range(2**k):
v=[""]*k
for j in range(k):
if ((i>>j)&1):
v[j]="+"
ans=""
for a,b in zip(n,v+[""]):
ans+=(a+b)
x+=eval(ans)
print(x) | s=list(eval(input()))
n=len(s)
def dfs(i,f):
if i==n-1:
return sum(list(map(int,f.split("+"))))
return dfs(i+1,f+s[i+1]) + dfs(i+1, f + "+" + s[i+1])
print((dfs(0,s[0]))) | 14 | 11 | 232 | 196 | n = list(eval(input()))
k = len(n) - 1
x = 0
for i in range(2**k):
v = [""] * k
for j in range(k):
if (i >> j) & 1:
v[j] = "+"
ans = ""
for a, b in zip(n, v + [""]):
ans += a + b
x += eval(ans)
print(x)
| s = list(eval(input()))
n = len(s)
def dfs(i, f):
if i == n - 1:
return sum(list(map(int, f.split("+"))))
return dfs(i + 1, f + s[i + 1]) + dfs(i + 1, f + "+" + s[i + 1])
print((dfs(0, s[0])))
| false | 21.428571 | [
"-n = list(eval(input()))",
"-k = len(n) - 1",
"-x = 0",
"-for i in range(2**k):",
"- v = [\"\"] * k",
"- for j in range(k):",
"- if (i >> j) & 1:",
"- v[j] = \"+\"",
"- ans = \"\"",
"- for a, b in zip(n, v + [\"\"]):",
"- ans += a + b",
"- x += eval(ans... | false | 0.047962 | 0.047081 | 1.018711 | [
"s899408014",
"s351367831"
] |
u644907318 | p03986 | python | s132176993 | s330329285 | 76 | 66 | 3,500 | 65,592 | Accepted | Accepted | 13.16 | X = input().strip()
cnt = 0
cntmax = 0
for i in range(len(X)):
if X[i]=="T":
cnt += 1
cntmax = max(cntmax,cnt)
else:
cnt -= 1
print((cntmax*2)) | X = input().strip()
N = len(X)
cnt = 0
tot = 0
for i in range(N):
if X[i]=="T":
cnt += 1
else:
if cnt>0:
tot += cnt
cnt = -1
else:
cnt -= 1
print((2*tot)) | 10 | 14 | 182 | 233 | X = input().strip()
cnt = 0
cntmax = 0
for i in range(len(X)):
if X[i] == "T":
cnt += 1
cntmax = max(cntmax, cnt)
else:
cnt -= 1
print((cntmax * 2))
| X = input().strip()
N = len(X)
cnt = 0
tot = 0
for i in range(N):
if X[i] == "T":
cnt += 1
else:
if cnt > 0:
tot += cnt
cnt = -1
else:
cnt -= 1
print((2 * tot))
| false | 28.571429 | [
"+N = len(X)",
"-cntmax = 0",
"-for i in range(len(X)):",
"+tot = 0",
"+for i in range(N):",
"- cntmax = max(cntmax, cnt)",
"- cnt -= 1",
"-print((cntmax * 2))",
"+ if cnt > 0:",
"+ tot += cnt",
"+ cnt = -1",
"+ else:",
"+ cnt -= 1... | false | 0.044204 | 0.037404 | 1.181786 | [
"s132176993",
"s330329285"
] |
u921615009 | p03240 | python | s178724804 | s173497244 | 39 | 31 | 3,064 | 3,064 | Accepted | Accepted | 20.51 | N = int(eval(input()))
Xs = [list(map(int, input().split(" "))) for _ in range(N)]
"""
input = ["2 3 5","2 1 5","1 2 5","3 2 5"]
input = ["0 0 100", "1 1 98"]
input = ["99 1 191", "100 1 192", "99 0 192"]
Xs = [list(map(int, x.split(" "))) for x in input]
"""
Xs.sort(key=lambda x:x[2], reverse=True)
def ... | N = int(eval(input()))
Xs = [list(map(int, input().split(" "))) for _ in range(N)]
"""
input = ["2 3 5","2 1 5","1 2 5","3 2 5"]
input = ["0 0 100", "1 1 98"]
input = ["99 1 191", "100 1 192", "99 0 192"]
Xs = [list(map(int, x.split(" "))) for x in input]
"""
Xs.sort(key=lambda x:x[2], reverse=True)
def ... | 29 | 25 | 807 | 677 | N = int(eval(input()))
Xs = [list(map(int, input().split(" "))) for _ in range(N)]
"""
input = ["2 3 5","2 1 5","1 2 5","3 2 5"]
input = ["0 0 100", "1 1 98"]
input = ["99 1 191", "100 1 192", "99 0 192"]
Xs = [list(map(int, x.split(" "))) for x in input]
"""
Xs.sort(key=lambda x: x[2], reverse=True)
def solv(Xs):
... | N = int(eval(input()))
Xs = [list(map(int, input().split(" "))) for _ in range(N)]
"""
input = ["2 3 5","2 1 5","1 2 5","3 2 5"]
input = ["0 0 100", "1 1 98"]
input = ["99 1 191", "100 1 192", "99 0 192"]
Xs = [list(map(int, x.split(" "))) for x in input]
"""
Xs.sort(key=lambda x: x[2], reverse=True)
def solv(Xs):
... | false | 13.793103 | [
"- h = Xs[0][2]",
"- Cx = Xs[0][0]",
"- Cy = Xs[0][1]",
"+ Cx, Cy, h = tuple(Xs[0])",
"- for i in range(len(Xs)):",
"- h = max(H - abs(x - Xs[i][0]) - abs(y - Xs[i][1]), 0)",
"- if h != Xs[i][2]:",
"+ for C... | false | 0.041693 | 0.038518 | 1.082433 | [
"s178724804",
"s173497244"
] |
u811841526 | p02414 | python | s683366916 | s529196695 | 410 | 370 | 8,640 | 6,908 | Accepted | Accepted | 9.76 | n, m, l = map(int, input().split())
A = []
B = []
for _ in range(n):
A.append(list(map(int, input().split())))
for _ in range(m):
B.append(list(map(int, input().split())))
for i in range(n):
for j in range(l):
s = 0
for k in range(m):
s += A[i][k] * B[k][j]
... | n, m, l = list(map(int, input().split()))
A = []
for i in range(n):
row = list(map(int, input().split()))
A.append(row)
B = []
for i in range(m):
row = list(map(int, input().split()))
B.append(row)
C = []
for i in range(n):
row = []
for j in range(l):
sum = 0
... | 17 | 25 | 403 | 476 | n, m, l = map(int, input().split())
A = []
B = []
for _ in range(n):
A.append(list(map(int, input().split())))
for _ in range(m):
B.append(list(map(int, input().split())))
for i in range(n):
for j in range(l):
s = 0
for k in range(m):
s += A[i][k] * B[k][j]
print(s, end="... | n, m, l = list(map(int, input().split()))
A = []
for i in range(n):
row = list(map(int, input().split()))
A.append(row)
B = []
for i in range(m):
row = list(map(int, input().split()))
B.append(row)
C = []
for i in range(n):
row = []
for j in range(l):
sum = 0
for k in range(m):
... | false | 32 | [
"-n, m, l = map(int, input().split())",
"+n, m, l = list(map(int, input().split()))",
"+for i in range(n):",
"+ row = list(map(int, input().split()))",
"+ A.append(row)",
"-for _ in range(n):",
"- A.append(list(map(int, input().split())))",
"-for _ in range(m):",
"- B.append(list(map(int... | false | 0.041258 | 0.037508 | 1.099998 | [
"s683366916",
"s529196695"
] |
u884087839 | p02714 | python | s931538615 | s724732821 | 1,266 | 1,015 | 9,296 | 9,252 | Accepted | Accepted | 19.83 | #!/usr/bin/env python3
import sys
def solve(N: int, S: str):
r = 0
g = 0
b = 0
sub = 0
for i in range(N):
if S[i] == "R":
r += 1
for j in range(i + 1, N):
if S[j] == "G":
if j * 2 - i < N and S[j * 2 - i] == "B":
... | #!/usr/bin/env python3
import sys
def solve(N: int, S: str):
r = 0
g = 0
b = 0
sub = 0
for i in range(N):
# RGBそれぞれの個数をカウント
if S[i] == "R":
r += 1
elif S[i] == "G":
g += 1
else:
b += 1
# 条件2に一致... | 55 | 43 | 1,684 | 1,045 | #!/usr/bin/env python3
import sys
def solve(N: int, S: str):
r = 0
g = 0
b = 0
sub = 0
for i in range(N):
if S[i] == "R":
r += 1
for j in range(i + 1, N):
if S[j] == "G":
if j * 2 - i < N and S[j * 2 - i] == "B":
... | #!/usr/bin/env python3
import sys
def solve(N: int, S: str):
r = 0
g = 0
b = 0
sub = 0
for i in range(N):
# RGBそれぞれの個数をカウント
if S[i] == "R":
r += 1
elif S[i] == "G":
g += 1
else:
b += 1
# 条件2に一致しないケースをカウント
for j in ... | false | 21.818182 | [
"+ # RGBそれぞれの個数をカウント",
"- for j in range(i + 1, N):",
"- if S[j] == \"G\":",
"- if j * 2 - i < N and S[j * 2 - i] == \"B\":",
"- sub += 1",
"- elif S[j] == \"B\":",
"- if j * 2 - i < N and S[j * ... | false | 0.042801 | 0.042557 | 1.005731 | [
"s931538615",
"s724732821"
] |
u945181840 | p03448 | python | s047615510 | s160773489 | 61 | 18 | 8,276 | 3,064 | Accepted | Accepted | 70.49 | A = int(eval(input()))
B = int(eval(input()))
C = int(eval(input()))
X = int(eval(input()))
ans = []
for i in range(A + 1):
for j in range(B + 1):
for k in range(C + 1):
ans.append(500 * i + 100 * j + 50 * k)
print((ans.count(X))) | A = int(eval(input()))
B = int(eval(input()))
C = int(eval(input()))
X = int(eval(input()))
ans = 0
for i in range(A + 1):
for j in range(B + 1):
temp = X - (500 * i + 100 * j)
if temp // 50 > C or temp < 0:
continue
else:
ans += 1
print(ans) | 13 | 16 | 243 | 288 | A = int(eval(input()))
B = int(eval(input()))
C = int(eval(input()))
X = int(eval(input()))
ans = []
for i in range(A + 1):
for j in range(B + 1):
for k in range(C + 1):
ans.append(500 * i + 100 * j + 50 * k)
print((ans.count(X)))
| A = int(eval(input()))
B = int(eval(input()))
C = int(eval(input()))
X = int(eval(input()))
ans = 0
for i in range(A + 1):
for j in range(B + 1):
temp = X - (500 * i + 100 * j)
if temp // 50 > C or temp < 0:
continue
else:
ans += 1
print(ans)
| false | 18.75 | [
"-ans = []",
"+ans = 0",
"- for k in range(C + 1):",
"- ans.append(500 * i + 100 * j + 50 * k)",
"-print((ans.count(X)))",
"+ temp = X - (500 * i + 100 * j)",
"+ if temp // 50 > C or temp < 0:",
"+ continue",
"+ else:",
"+ ans += 1",
"... | false | 0.067207 | 0.036153 | 1.858958 | [
"s047615510",
"s160773489"
] |
u699296734 | p02596 | python | s270142711 | s698192044 | 208 | 68 | 156,932 | 63,144 | Accepted | Accepted | 67.31 | k = int(eval(input()))
mod = 7 % k
counter = 1
memo = 1
mod_map = set()
mod_map.add(mod)
while mod != 0:
mod = ((mod * 10) % k + 7) % k
if mod not in mod_map:
mod_map.add(mod)
else:
counter = -1
break
counter += 1
if mod == 0:
break
print(counter)
| k = int(eval(input()))
mod = 0
for i in range(1, k + 1):
mod = ((mod * 10) % k + 7) % k
if mod == 0:
print(i)
break
else:
print((-1))
| 17 | 10 | 310 | 164 | k = int(eval(input()))
mod = 7 % k
counter = 1
memo = 1
mod_map = set()
mod_map.add(mod)
while mod != 0:
mod = ((mod * 10) % k + 7) % k
if mod not in mod_map:
mod_map.add(mod)
else:
counter = -1
break
counter += 1
if mod == 0:
break
print(counter)
| k = int(eval(input()))
mod = 0
for i in range(1, k + 1):
mod = ((mod * 10) % k + 7) % k
if mod == 0:
print(i)
break
else:
print((-1))
| false | 41.176471 | [
"-mod = 7 % k",
"-counter = 1",
"-memo = 1",
"-mod_map = set()",
"-mod_map.add(mod)",
"-while mod != 0:",
"+mod = 0",
"+for i in range(1, k + 1):",
"- if mod not in mod_map:",
"- mod_map.add(mod)",
"- else:",
"- counter = -1",
"+ if mod == 0:",
"+ print(i)",
... | false | 0.237361 | 0.333398 | 0.711944 | [
"s270142711",
"s698192044"
] |
u703196441 | p00592 | python | s117293797 | s794153671 | 20 | 10 | 4,276 | 4,276 | Accepted | Accepted | 50 | def cv(t):
return t/100*60+t%100
while 1:
n,p,q = list(map(int,input().split()))
if n==0: break
v=[0]*1440
for i in range(n):
k = int(input())
a = list(map(int,input().split()))
for j in range(k):
for l in range(cv(a[::2][j]),cv(a[1::2][j])):
v[l]+=1
m=c=0
for i in range(cv(p),cv(q)):... | def get():
return list(map(int,input().split()))
def cv(t):
return t/100*60+t%100
while 1:
n,p,q=get()
if n==0: break
v=[0]*1440
for i in range(n):
k=get()[0]; a=get()
for j in range(k):
for l in range(cv(a[::2][j]),cv(a[1::2][j])):
v[l]+=1
m=c=0
for i in range(cv(p),cv(q)):
c=(c+1)*... | 18 | 18 | 370 | 350 | def cv(t):
return t / 100 * 60 + t % 100
while 1:
n, p, q = list(map(int, input().split()))
if n == 0:
break
v = [0] * 1440
for i in range(n):
k = int(input())
a = list(map(int, input().split()))
for j in range(k):
for l in range(cv(a[::2][j]), cv(a[1::2... | def get():
return list(map(int, input().split()))
def cv(t):
return t / 100 * 60 + t % 100
while 1:
n, p, q = get()
if n == 0:
break
v = [0] * 1440
for i in range(n):
k = get()[0]
a = get()
for j in range(k):
for l in range(cv(a[::2][j]), cv(a[1::2... | false | 0 | [
"+def get():",
"+ return list(map(int, input().split()))",
"+",
"+",
"- n, p, q = list(map(int, input().split()))",
"+ n, p, q = get()",
"- k = int(input())",
"- a = list(map(int, input().split()))",
"+ k = get()[0]",
"+ a = get()",
"- c = c + 1 if v[i... | false | 0.038274 | 0.038248 | 1.000697 | [
"s117293797",
"s794153671"
] |
u692453235 | p03128 | python | s751780439 | s274662133 | 64 | 51 | 9,624 | 9,560 | Accepted | Accepted | 20.31 | from collections import defaultdict
N, M = list(map(int, input().split()))
A = list(map(int, input().split()))
L = {1: 2, 2: 5, 3: 5, 4: 4, 5: 5, 6: 6, 7: 3, 8: 7, 9: 6}
D = defaultdict(int)
for i in A:
if D[L[i]] < i:
D[L[i]] = i
INF = float("inf")
dp = [-INF]*(N+1)
dp[0] = 0
for i in range(1,... | from collections import defaultdict
N, M = list(map(int, input().split()))
A = list(map(int, input().split()))
L = {1: 2, 2: 5, 3: 5, 4: 4, 5: 5, 6: 6, 7: 3, 8: 7, 9: 6}
D = defaultdict(int)
for i in A:
if D[L[i]] < i:
D[L[i]] = i
INF = float("inf")
dp = [-INF]*(N+1)
dp[0] = 0
for i in range(1,... | 33 | 32 | 670 | 651 | from collections import defaultdict
N, M = list(map(int, input().split()))
A = list(map(int, input().split()))
L = {1: 2, 2: 5, 3: 5, 4: 4, 5: 5, 6: 6, 7: 3, 8: 7, 9: 6}
D = defaultdict(int)
for i in A:
if D[L[i]] < i:
D[L[i]] = i
INF = float("inf")
dp = [-INF] * (N + 1)
dp[0] = 0
for i in range(1, N + 1):... | from collections import defaultdict
N, M = list(map(int, input().split()))
A = list(map(int, input().split()))
L = {1: 2, 2: 5, 3: 5, 4: 4, 5: 5, 6: 6, 7: 3, 8: 7, 9: 6}
D = defaultdict(int)
for i in A:
if D[L[i]] < i:
D[L[i]] = i
INF = float("inf")
dp = [-INF] * (N + 1)
dp[0] = 0
for i in range(1, N + 1):... | false | 3.030303 | [
"-while temp > 0:",
"- for i, x in sorted(list(D.items()), key=lambda x: x[1], reverse=True):",
"- if temp - i >= 0 and dp[temp - i] == dp[temp] - 1:",
"- ans += str(x)",
"- temp -= i",
"- break",
"+# なるべく大きい数字から使う",
"+for i, x in sorted(list(D.items()), key=... | false | 0.047914 | 0.048985 | 0.978147 | [
"s751780439",
"s274662133"
] |
u434872492 | p02556 | python | s543529027 | s555337763 | 331 | 301 | 102,636 | 100,600 | Accepted | Accepted | 9.06 | N = int(eval(input()))
G = []
for i in range(N):
x,y = list(map(int,input().split()))
G.append([x,y])
a = -10**10
b = 10**10
c = -10**10
d = 10**10
for i in range(N):
x = G[i][0]
y = G[i][1]
t = x+y
u = x-y
a = max(a,t)
b = min(b,t)
c = max(c,u)
d = min(d,u)
... | N = int(eval(input()))
A = []
B = []
for i in range(N):
x,y = list(map(int,input().split()))
A.append(x+y)
B.append(x-y)
a = max(A)
b = min(A)
c = max(B)
d = min(B)
ans = max(a-b,c-d)
print(ans) | 24 | 15 | 359 | 210 | N = int(eval(input()))
G = []
for i in range(N):
x, y = list(map(int, input().split()))
G.append([x, y])
a = -(10**10)
b = 10**10
c = -(10**10)
d = 10**10
for i in range(N):
x = G[i][0]
y = G[i][1]
t = x + y
u = x - y
a = max(a, t)
b = min(b, t)
c = max(c, u)
d = min(d, u)
# prin... | N = int(eval(input()))
A = []
B = []
for i in range(N):
x, y = list(map(int, input().split()))
A.append(x + y)
B.append(x - y)
a = max(A)
b = min(A)
c = max(B)
d = min(B)
ans = max(a - b, c - d)
print(ans)
| false | 37.5 | [
"-G = []",
"+A = []",
"+B = []",
"- G.append([x, y])",
"-a = -(10**10)",
"-b = 10**10",
"-c = -(10**10)",
"-d = 10**10",
"-for i in range(N):",
"- x = G[i][0]",
"- y = G[i][1]",
"- t = x + y",
"- u = x - y",
"- a = max(a, t)",
"- b = min(b, t)",
"- c = max(c, u)... | false | 0.148912 | 0.04862 | 3.06277 | [
"s543529027",
"s555337763"
] |
u309141201 | p02983 | python | s761832808 | s245091664 | 1,452 | 659 | 81,404 | 75,436 | Accepted | Accepted | 54.61 | l, r = list(map(int, input().split()))
mod = 2019
frem = []
srem = []
if r - l + 1 >= 2019:
ans = 0
else:
for i in range(l, r+1):
frem.append(i % mod)
for i in range(len(frem)):
for j in range(i+1, len(frem)):
# print(frem[i], frem[j])
srem.append(frem[i]*... | l, r = list(map(int, input().split()))
mod = 2019
frem = []
srem = []
if r - l + 1 >= 2019:
ans = 0
else:
for i in range(l, r+1):
frem.append(i % mod)
for i in range(len(frem)):
for j in range(i+1, len(frem)):
# print(frem[i], frem[j])
srem.append(frem[i]*... | 17 | 17 | 378 | 382 | l, r = list(map(int, input().split()))
mod = 2019
frem = []
srem = []
if r - l + 1 >= 2019:
ans = 0
else:
for i in range(l, r + 1):
frem.append(i % mod)
for i in range(len(frem)):
for j in range(i + 1, len(frem)):
# print(frem[i], frem[j])
srem.append(frem[i] * frem[j... | l, r = list(map(int, input().split()))
mod = 2019
frem = []
srem = []
if r - l + 1 >= 2019:
ans = 0
else:
for i in range(l, r + 1):
frem.append(i % mod)
for i in range(len(frem)):
for j in range(i + 1, len(frem)):
# print(frem[i], frem[j])
srem.append(frem[i] * frem[j... | false | 0 | [
"- srem.sort()",
"- ans = srem[0]",
"+ # srem.sort()",
"+ ans = min(srem)"
] | false | 0.050475 | 0.042445 | 1.189179 | [
"s761832808",
"s245091664"
] |
u189516107 | p02719 | python | s577677687 | s811081354 | 23 | 20 | 9,096 | 9,080 | Accepted | Accepted | 13.04 | N, K = list(map(int, input().split()))
"""
while N > K:
N = abs(N - K)
#print(N)
print(min(N, abs(N-K)))
"""
"""
m = -(-N//K)
print(abs(N - m*K))
"""
print((min(N%K, abs(N%K - K)))) | N, K = list(map(int, input().split()))
"""
while N > K:
N = abs(N - K)
#print(N)
print(min(N, abs(N-K)))
"""
m = N//K
print((min(N - m*K, -(N - (m+1)*K))))
"""
print(min(N%K, abs(N%K - K)))
""" | 15 | 16 | 194 | 208 | N, K = list(map(int, input().split()))
"""
while N > K:
N = abs(N - K)
#print(N)
print(min(N, abs(N-K)))
"""
"""
m = -(-N//K)
print(abs(N - m*K))
"""
print((min(N % K, abs(N % K - K))))
| N, K = list(map(int, input().split()))
"""
while N > K:
N = abs(N - K)
#print(N)
print(min(N, abs(N-K)))
"""
m = N // K
print((min(N - m * K, -(N - (m + 1) * K))))
"""
print(min(N%K, abs(N%K - K)))
"""
| false | 6.25 | [
"+m = N // K",
"+print((min(N - m * K, -(N - (m + 1) * K))))",
"-m = -(-N//K)",
"-print(abs(N - m*K))",
"+print(min(N%K, abs(N%K - K)))",
"-print((min(N % K, abs(N % K - K))))"
] | false | 0.036815 | 0.03621 | 1.016706 | [
"s577677687",
"s811081354"
] |
u151005508 | p03724 | python | s395397808 | s333909393 | 753 | 644 | 67,288 | 65,752 | Accepted | Accepted | 14.48 | N, M = list(map(int, input().split()))
ab = []
for _ in range(M):
ab.append(tuple(map(int, input().split())))
edges = [0] * N
for el in ab:
a = min(el)
b = max(el)
edges[a - 1] += 1
edges[b - 1] -= 1
# print(edges)
for i in range(1, N):
edges[i] = edges[i] + edges[i - 1]
# print... | N, M = list(map(int, input().split()))
ab = []
for _ in range(M):
ab.append(tuple(map(int, input().split())))
bucket = [0] * N
for el in ab:
a, b = el
bucket[a - 1] += 1
bucket[b - 1] += 1
if all([x % 2 == 0 for x in bucket]):
print('YES')
else:
print('NO') | 20 | 14 | 401 | 289 | N, M = list(map(int, input().split()))
ab = []
for _ in range(M):
ab.append(tuple(map(int, input().split())))
edges = [0] * N
for el in ab:
a = min(el)
b = max(el)
edges[a - 1] += 1
edges[b - 1] -= 1
# print(edges)
for i in range(1, N):
edges[i] = edges[i] + edges[i - 1]
# print(edges)
if all([x... | N, M = list(map(int, input().split()))
ab = []
for _ in range(M):
ab.append(tuple(map(int, input().split())))
bucket = [0] * N
for el in ab:
a, b = el
bucket[a - 1] += 1
bucket[b - 1] += 1
if all([x % 2 == 0 for x in bucket]):
print("YES")
else:
print("NO")
| false | 30 | [
"-edges = [0] * N",
"+bucket = [0] * N",
"- a = min(el)",
"- b = max(el)",
"- edges[a - 1] += 1",
"- edges[b - 1] -= 1",
"-# print(edges)",
"-for i in range(1, N):",
"- edges[i] = edges[i] + edges[i - 1]",
"-# print(edges)",
"-if all([x % 2 == 0 for x in edges]):",
"+ a, b = ... | false | 0.032105 | 0.033258 | 0.965333 | [
"s395397808",
"s333909393"
] |
u312025627 | p02947 | python | s624602066 | s741564718 | 419 | 267 | 17,848 | 17,808 | Accepted | Accepted | 36.28 | n = int(eval(input()))
ans = 0
used_s = {}
for _ in range(n):
s = "".join(sorted(eval(input())))
if not s in list(used_s.keys()):
used_s[s] = 0
else:
used_s[s] += 1
ans += 1 * used_s[s]
print(ans) | import sys
input = sys.stdin.readline
n = int(eval(input()))
ans = 0
used_s = {}
for _ in range(n):
s = "".join(sorted(eval(input())))
if not s in list(used_s.keys()):
used_s[s] = 0
else:
used_s[s] += 1
ans += 1 * used_s[s]
print(ans) | 12 | 15 | 226 | 268 | n = int(eval(input()))
ans = 0
used_s = {}
for _ in range(n):
s = "".join(sorted(eval(input())))
if not s in list(used_s.keys()):
used_s[s] = 0
else:
used_s[s] += 1
ans += 1 * used_s[s]
print(ans)
| import sys
input = sys.stdin.readline
n = int(eval(input()))
ans = 0
used_s = {}
for _ in range(n):
s = "".join(sorted(eval(input())))
if not s in list(used_s.keys()):
used_s[s] = 0
else:
used_s[s] += 1
ans += 1 * used_s[s]
print(ans)
| false | 20 | [
"+import sys",
"+",
"+input = sys.stdin.readline"
] | false | 0.10842 | 0.041734 | 2.597859 | [
"s624602066",
"s741564718"
] |
u281610856 | p03599 | python | s067335479 | s256600662 | 266 | 239 | 31,700 | 21,736 | Accepted | Accepted | 10.15 | from heapq import heappush, heappop
from itertools import permutations, accumulate, combinations
from math import pi, ceil, floor
import numpy as np
from collections import defaultdict, deque
from operator import itemgetter
from bisect import bisect_left, bisect_right, insort_left, insort_right
import sys
input... | from heapq import heappush, heappop
from itertools import permutations, accumulate, combinations
from math import pi, ceil, floor
import numpy as np
from collections import defaultdict, deque
from operator import itemgetter
from bisect import bisect_left, bisect_right, insort_left, insort_right
import sys
input... | 55 | 60 | 1,591 | 1,700 | from heapq import heappush, heappop
from itertools import permutations, accumulate, combinations
from math import pi, ceil, floor
import numpy as np
from collections import defaultdict, deque
from operator import itemgetter
from bisect import bisect_left, bisect_right, insort_left, insort_right
import sys
input = sys.... | from heapq import heappush, heappop
from itertools import permutations, accumulate, combinations
from math import pi, ceil, floor
import numpy as np
from collections import defaultdict, deque
from operator import itemgetter
from bisect import bisect_left, bisect_right, insort_left, insort_right
import sys
input = sys.... | false | 8.333333 | [
"- water_list.append(100 * i * a + 100 * j * b)",
"+ if i == 0 and j == 0:",
"+ continue",
"+ w = 100 * i * a + 100 * j * b",
"+ if w > lim:",
"+ continue",
"+ water_list.append(w)",
"- sugar_list.append(i ... | false | 0.060364 | 0.056893 | 1.061017 | [
"s067335479",
"s256600662"
] |
u759412327 | p02676 | python | s971384567 | s076451289 | 33 | 25 | 9,012 | 9,080 | Accepted | Accepted | 24.24 | K = int(eval(input()))
S = eval(input())
if len(S)<=K:
print(S)
else:
print((S[:K]+"...")) | K = int(eval(input()))
S = eval(input())
print((S[:K]+(K<len(S))*"...")) | 7 | 3 | 87 | 60 | K = int(eval(input()))
S = eval(input())
if len(S) <= K:
print(S)
else:
print((S[:K] + "..."))
| K = int(eval(input()))
S = eval(input())
print((S[:K] + (K < len(S)) * "..."))
| false | 57.142857 | [
"-if len(S) <= K:",
"- print(S)",
"-else:",
"- print((S[:K] + \"...\"))",
"+print((S[:K] + (K < len(S)) * \"...\"))"
] | false | 0.034947 | 0.036851 | 0.948326 | [
"s971384567",
"s076451289"
] |
u864197622 | p02690 | python | s299934344 | s715582882 | 24 | 22 | 9,192 | 9,204 | Accepted | Accepted | 8.33 | def f(n):
l, r = 0, 1 << 20
while r - l > 1:
m = (l + r) // 2
if m ** 5 <= n:
l = m
else:
r = m
return l if l ** 5 == n else 0
X = int(eval(input()))
for i in range(1 << 20):
a = f(X + i ** 5)
if a:
print((a, i))
break
... | def f(n):
l, r = 0, 1 << 10
while r - l > 1:
m = (l + r) // 2
if m ** 5 <= n:
l = m
else:
r = m
return l if l ** 5 == n else 0
X = int(eval(input()))
for i in range(1 << 10):
a = f(X + i ** 5)
if a:
print((a, i))
break
... | 20 | 20 | 382 | 381 | def f(n):
l, r = 0, 1 << 20
while r - l > 1:
m = (l + r) // 2
if m**5 <= n:
l = m
else:
r = m
return l if l**5 == n else 0
X = int(eval(input()))
for i in range(1 << 20):
a = f(X + i**5)
if a:
print((a, i))
break
a = f(X - i**5)
... | def f(n):
l, r = 0, 1 << 10
while r - l > 1:
m = (l + r) // 2
if m**5 <= n:
l = m
else:
r = m
return l if l**5 == n else 0
X = int(eval(input()))
for i in range(1 << 10):
a = f(X + i**5)
if a:
print((a, i))
break
a = f(X - i**5)
... | false | 0 | [
"- l, r = 0, 1 << 20",
"+ l, r = 0, 1 << 10",
"-for i in range(1 << 20):",
"+for i in range(1 << 10):"
] | false | 0.12519 | 0.0499 | 2.508815 | [
"s299934344",
"s715582882"
] |
u852690916 | p02596 | python | s170671138 | s531538533 | 76 | 67 | 62,900 | 63,200 | Accepted | Accepted | 11.84 | # でつoO(YOU PLAY WITH THE CARDS YOU'RE DEALT..)
import sys
def main(K):
m = 0
for i in range(1, 10**6):
m = (m * 10 + 7) % K
if m == 0:
print(i)
return
print((-1))
if __name__ == '__main__':
input = sys.stdin.readline
K = int(eval(input()))
m... | K = int(eval(input()))
mod = 0
for i in range(K):
mod = (10 * mod + 7) % K
if mod == 0:
print((i + 1))
exit()
print((-1))
| 15 | 8 | 319 | 143 | # でつoO(YOU PLAY WITH THE CARDS YOU'RE DEALT..)
import sys
def main(K):
m = 0
for i in range(1, 10**6):
m = (m * 10 + 7) % K
if m == 0:
print(i)
return
print((-1))
if __name__ == "__main__":
input = sys.stdin.readline
K = int(eval(input()))
main(K)
| K = int(eval(input()))
mod = 0
for i in range(K):
mod = (10 * mod + 7) % K
if mod == 0:
print((i + 1))
exit()
print((-1))
| false | 46.666667 | [
"-# でつoO(YOU PLAY WITH THE CARDS YOU'RE DEALT..)",
"-import sys",
"-",
"-",
"-def main(K):",
"- m = 0",
"- for i in range(1, 10**6):",
"- m = (m * 10 + 7) % K",
"- if m == 0:",
"- print(i)",
"- return",
"- print((-1))",
"-",
"-",
"-if __name__... | false | 0.077946 | 0.008148 | 9.566614 | [
"s170671138",
"s531538533"
] |
u380524497 | p03660 | python | s285308334 | s654047546 | 349 | 184 | 23,444 | 30,968 | Accepted | Accepted | 47.28 | from collections import deque
import sys
input = sys.stdin.readline
n = int(eval(input()))
edges = [[] for i in range(n)]
for _ in range(n-1):
a, b = list(map(int, input().split()))
edges[a-1].append(b-1)
edges[b-1].append(a-1)
todo = deque([(0, 1), (n-1, 2)])
colors = [0] * n
colors[0]... | def main():
from collections import deque
import sys
buf = sys.stdin.buffer
n = int(buf.readline())
E = list(map(int, (buf.read().split())))
edges = [[] for i in range(n)]
for a, b in zip(E, E):
edges[a-1].append(b-1)
edges[b-1].append(a-1)
tod... | 34 | 40 | 650 | 849 | from collections import deque
import sys
input = sys.stdin.readline
n = int(eval(input()))
edges = [[] for i in range(n)]
for _ in range(n - 1):
a, b = list(map(int, input().split()))
edges[a - 1].append(b - 1)
edges[b - 1].append(a - 1)
todo = deque([(0, 1), (n - 1, 2)])
colors = [0] * n
colors[0] = 1
col... | def main():
from collections import deque
import sys
buf = sys.stdin.buffer
n = int(buf.readline())
E = list(map(int, (buf.read().split())))
edges = [[] for i in range(n)]
for a, b in zip(E, E):
edges[a - 1].append(b - 1)
edges[b - 1].append(a - 1)
todo = deque([0, n - 1... | false | 15 | [
"-from collections import deque",
"-import sys",
"+def main():",
"+ from collections import deque",
"+ import sys",
"-input = sys.stdin.readline",
"-n = int(eval(input()))",
"-edges = [[] for i in range(n)]",
"-for _ in range(n - 1):",
"- a, b = list(map(int, input().split()))",
"- e... | false | 0.038359 | 0.041435 | 0.925769 | [
"s285308334",
"s654047546"
] |
u392319141 | p04045 | python | s370417127 | s898279903 | 102 | 90 | 2,940 | 2,940 | Accepted | Accepted | 11.76 | N, K = list(map(int, input().split()))
D = set(list(eval(input())))
for k in range(N, 20 * N):
if len(set(list(str(k))) & D) == 0:
print(k)
exit()
| N, K = list(map(int, input().split()))
D = set(map(str, list(range(10)))) - set(list(input().split()))
for i in range(N, 100 * N):
if set(list(str(i))) <= D:
print(i)
exit()
| 7 | 8 | 162 | 191 | N, K = list(map(int, input().split()))
D = set(list(eval(input())))
for k in range(N, 20 * N):
if len(set(list(str(k))) & D) == 0:
print(k)
exit()
| N, K = list(map(int, input().split()))
D = set(map(str, list(range(10)))) - set(list(input().split()))
for i in range(N, 100 * N):
if set(list(str(i))) <= D:
print(i)
exit()
| false | 12.5 | [
"-D = set(list(eval(input())))",
"-for k in range(N, 20 * N):",
"- if len(set(list(str(k))) & D) == 0:",
"- print(k)",
"+D = set(map(str, list(range(10)))) - set(list(input().split()))",
"+for i in range(N, 100 * N):",
"+ if set(list(str(i))) <= D:",
"+ print(i)"
] | false | 0.063793 | 0.046258 | 1.379068 | [
"s370417127",
"s898279903"
] |
u580093517 | p03777 | python | s614794629 | s461468716 | 20 | 17 | 2,940 | 2,940 | Accepted | Accepted | 15 | #abc056 A HonestOrDishonest
a,_,b=eval(input())
print(("DH"[a==b])) | a,b = input().split()
print(("DH"[a==b])) | 3 | 2 | 61 | 40 | # abc056 A HonestOrDishonest
a, _, b = eval(input())
print(("DH"[a == b]))
| a, b = input().split()
print(("DH"[a == b]))
| false | 33.333333 | [
"-# abc056 A HonestOrDishonest",
"-a, _, b = eval(input())",
"+a, b = input().split()"
] | false | 0.040437 | 0.041013 | 0.985975 | [
"s614794629",
"s461468716"
] |
u600402037 | p03400 | python | s044378444 | s248773674 | 152 | 30 | 12,468 | 9,208 | Accepted | Accepted | 80.26 | import numpy as np
N = int(eval(input()))
D, X = list(map(int, input().split()))
A = np.array([int(eval(input())) for _ in range(N)])
print((((D-1) // A).sum() + N + X)) | # coding: utf-8
import sys
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
N = ir()
D, X = lr()
choco = 0
for _ in range(N):
a = ir()
choco += 1 + (D-1) // a
answer = X + choco
print(answer)
| 7 | 16 | 157 | 277 | import numpy as np
N = int(eval(input()))
D, X = list(map(int, input().split()))
A = np.array([int(eval(input())) for _ in range(N)])
print((((D - 1) // A).sum() + N + X))
| # coding: utf-8
import sys
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
N = ir()
D, X = lr()
choco = 0
for _ in range(N):
a = ir()
choco += 1 + (D - 1) // a
answer = X + choco
print(answer)
| false | 56.25 | [
"-import numpy as np",
"+# coding: utf-8",
"+import sys",
"-N = int(eval(input()))",
"-D, X = list(map(int, input().split()))",
"-A = np.array([int(eval(input())) for _ in range(N)])",
"-print((((D - 1) // A).sum() + N + X))",
"+sr = lambda: sys.stdin.readline().rstrip()",
"+ir = lambda: int(sr())",... | false | 0.795627 | 0.043852 | 18.143306 | [
"s044378444",
"s248773674"
] |
u489959379 | p03786 | python | s789511525 | s188449377 | 231 | 88 | 63,856 | 20,448 | Accepted | Accepted | 61.9 | import sys
sys.setrecursionlimit(10 ** 7)
f_inf = float('inf')
mod = 10 ** 9 + 7
def resolve():
n = int(eval(input()))
A = sorted(list(map(int, input().split())))
ruiseki = [0] * n
ruiseki[0] = A[0]
for i in range(1, n):
ruiseki[i] = ruiseki[i - 1] + A[i]
idx = 0
... | import sys
from itertools import accumulate
sys.setrecursionlimit(10 ** 7)
f_inf = float('inf')
def resolve():
n = int(eval(input()))
A = sorted(list(map(int, input().split())))
R = [0] + list(accumulate(A))
left = 0
for i in range(n):
if R[i] * 2 < A[i]:
left ... | 25 | 21 | 470 | 386 | import sys
sys.setrecursionlimit(10**7)
f_inf = float("inf")
mod = 10**9 + 7
def resolve():
n = int(eval(input()))
A = sorted(list(map(int, input().split())))
ruiseki = [0] * n
ruiseki[0] = A[0]
for i in range(1, n):
ruiseki[i] = ruiseki[i - 1] + A[i]
idx = 0
for i in range(n - 1)... | import sys
from itertools import accumulate
sys.setrecursionlimit(10**7)
f_inf = float("inf")
def resolve():
n = int(eval(input()))
A = sorted(list(map(int, input().split())))
R = [0] + list(accumulate(A))
left = 0
for i in range(n):
if R[i] * 2 < A[i]:
left = i
print((n -... | false | 16 | [
"+from itertools import accumulate",
"-mod = 10**9 + 7",
"- ruiseki = [0] * n",
"- ruiseki[0] = A[0]",
"- for i in range(1, n):",
"- ruiseki[i] = ruiseki[i - 1] + A[i]",
"- idx = 0",
"- for i in range(n - 1):",
"- if ruiseki[i] * 2 < A[i + 1]:",
"- idx = i +... | false | 0.060188 | 0.038578 | 1.560178 | [
"s789511525",
"s188449377"
] |
u497952650 | p02714 | python | s133829357 | s407840142 | 1,922 | 359 | 9,204 | 68,228 | Accepted | Accepted | 81.32 | N = int(eval(input()))
S = eval(input())
R = S.count("R")
G = S.count("G")
ans = R*G*(N-R-G)
for i in range(N-2):
for j in range(i,N-1):
k = 2*j - i
if k < N:
if S[i] != S[j] and S[j] != S[k] and S[k] != S[i]:
ans -= 1
print(ans) | N = int(eval(input()))
S = eval(input())
R = S.count("R")
G = S.count("G")
B = S.count("B")
ans = R*G*B
for i in range(N-2):
for j in range(i,N-1):
k = 2*j - i
if k < N:
tmp = []
tmp.append(S[i])
tmp.append(S[j])
tmp.append(S[k])
... | 15 | 19 | 294 | 378 | N = int(eval(input()))
S = eval(input())
R = S.count("R")
G = S.count("G")
ans = R * G * (N - R - G)
for i in range(N - 2):
for j in range(i, N - 1):
k = 2 * j - i
if k < N:
if S[i] != S[j] and S[j] != S[k] and S[k] != S[i]:
ans -= 1
print(ans)
| N = int(eval(input()))
S = eval(input())
R = S.count("R")
G = S.count("G")
B = S.count("B")
ans = R * G * B
for i in range(N - 2):
for j in range(i, N - 1):
k = 2 * j - i
if k < N:
tmp = []
tmp.append(S[i])
tmp.append(S[j])
tmp.append(S[k])
... | false | 21.052632 | [
"-ans = R * G * (N - R - G)",
"+B = S.count(\"B\")",
"+ans = R * G * B",
"- if S[i] != S[j] and S[j] != S[k] and S[k] != S[i]:",
"+ tmp = []",
"+ tmp.append(S[i])",
"+ tmp.append(S[j])",
"+ tmp.append(S[k])",
"+ if len(set(tmp)) == 3:... | false | 0.06224 | 0.0385 | 1.616637 | [
"s133829357",
"s407840142"
] |
u797016134 | p03061 | python | s484537579 | s946191164 | 401 | 205 | 97,000 | 14,076 | Accepted | Accepted | 48.88 | import fractions
def gcd(x,y):
if x < y:
x, y = y, x
if y == 0:
return x
return fractions.gcd(x%y, y)
n = int(eval(input()))
a = list(map(int, input().split()))
L = [0]
R = [0]
now1 = 0
now2 = 0
ans = 0
for i in range(n-1):
now1 = gcd(now1,a[i])
L.append(now1)
... | N = int(eval(input()))
A = list(map(int, input().split()))
def gcd(a, b):
if b == 0:
return a
else:
return gcd(b, a%b)
L = [0] * (N+1)
R = [0] * (N+1)
for i in range(1, N+1):
L[i] = gcd(L[i-1], A[i-1])
for i in range(N)[::-1]:
R[i] = gcd(R[i+1], A[i])
M = [gcd(L[i], R[... | 28 | 19 | 441 | 355 | import fractions
def gcd(x, y):
if x < y:
x, y = y, x
if y == 0:
return x
return fractions.gcd(x % y, y)
n = int(eval(input()))
a = list(map(int, input().split()))
L = [0]
R = [0]
now1 = 0
now2 = 0
ans = 0
for i in range(n - 1):
now1 = gcd(now1, a[i])
L.append(now1)
now2 = gc... | N = int(eval(input()))
A = list(map(int, input().split()))
def gcd(a, b):
if b == 0:
return a
else:
return gcd(b, a % b)
L = [0] * (N + 1)
R = [0] * (N + 1)
for i in range(1, N + 1):
L[i] = gcd(L[i - 1], A[i - 1])
for i in range(N)[::-1]:
R[i] = gcd(R[i + 1], A[i])
M = [gcd(L[i], R[i... | false | 32.142857 | [
"-import fractions",
"+N = int(eval(input()))",
"+A = list(map(int, input().split()))",
"-def gcd(x, y):",
"- if x < y:",
"- x, y = y, x",
"- if y == 0:",
"- return x",
"- return fractions.gcd(x % y, y)",
"+def gcd(a, b):",
"+ if b == 0:",
"+ return a",
"+ ... | false | 0.085088 | 0.037956 | 2.241785 | [
"s484537579",
"s946191164"
] |
u223663729 | p03600 | python | s267799900 | s120780955 | 931 | 437 | 66,828 | 42,504 | Accepted | Accepted | 53.06 |
def warshall_floyd(cost):
ret = [[1]*N for _ in [0]*N]
for k in range(N):
for i, c_left in enumerate(cost[i][k] for i in range(N)):
for j, (c_now, c_right) in enumerate(zip(cost[i], cost[k])):
if c_left + c_right < c_now:
print((-1))
... | from scipy.sparse.csgraph import csgraph_from_dense, floyd_warshall
import numpy as np
N = int(eval(input()))
A = np.array([list(map(int, input().split())) for _ in [0]*N], dtype=np.int)
D = csgraph_from_dense(A)
D = floyd_warshall(D, directed=False)
if (A == D).all():
ans = 0
D += np.identity(N, int)... | 35 | 18 | 843 | 523 | def warshall_floyd(cost):
ret = [[1] * N for _ in [0] * N]
for k in range(N):
for i, c_left in enumerate(cost[i][k] for i in range(N)):
for j, (c_now, c_right) in enumerate(zip(cost[i], cost[k])):
if c_left + c_right < c_now:
print((-1))
... | from scipy.sparse.csgraph import csgraph_from_dense, floyd_warshall
import numpy as np
N = int(eval(input()))
A = np.array([list(map(int, input().split())) for _ in [0] * N], dtype=np.int)
D = csgraph_from_dense(A)
D = floyd_warshall(D, directed=False)
if (A == D).all():
ans = 0
D += np.identity(N, int) * (1 <... | false | 48.571429 | [
"-def warshall_floyd(cost):",
"- ret = [[1] * N for _ in [0] * N]",
"- for k in range(N):",
"- for i, c_left in enumerate(cost[i][k] for i in range(N)):",
"- for j, (c_now, c_right) in enumerate(zip(cost[i], cost[k])):",
"- if c_left + c_right < c_now:",
"- ... | false | 0.045459 | 0.877925 | 0.05178 | [
"s267799900",
"s120780955"
] |
u562935282 | p03044 | python | s645282274 | s441499939 | 755 | 679 | 90,740 | 52,228 | Accepted | Accepted | 10.07 | import sys
sys.setrecursionlimit(10 ** 7)
def dfs(v):
for u, w in e[v]:
if c[u] != -1:
continue
c[u] = (c[v] + w) % 2
dfs(u)
n = int(input())
e = tuple(set() for _ in range(n))
for _ in range(n - 1):
u, v, w = map(int, input().split())
u -= 1
v ... | from collections import deque
n = int(input())
g = tuple(set() for _ in range(n))
for _ in range(n - 1):
u, v, w = map(int, input().split())
u -= 1
v -= 1
g[u].add((v, w))
g[v].add((u, w))
d = [-1] * n
d[0] = 0
q = deque()
q.append(0)
while q:
v = q.popleft()
for u, w ... | 28 | 26 | 428 | 450 | import sys
sys.setrecursionlimit(10**7)
def dfs(v):
for u, w in e[v]:
if c[u] != -1:
continue
c[u] = (c[v] + w) % 2
dfs(u)
n = int(input())
e = tuple(set() for _ in range(n))
for _ in range(n - 1):
u, v, w = map(int, input().split())
u -= 1
v -= 1
e[u].add((v... | from collections import deque
n = int(input())
g = tuple(set() for _ in range(n))
for _ in range(n - 1):
u, v, w = map(int, input().split())
u -= 1
v -= 1
g[u].add((v, w))
g[v].add((u, w))
d = [-1] * n
d[0] = 0
q = deque()
q.append(0)
while q:
v = q.popleft()
for u, w in g[v]:
if d[... | false | 7.142857 | [
"-import sys",
"-",
"-sys.setrecursionlimit(10**7)",
"-",
"-",
"-def dfs(v):",
"- for u, w in e[v]:",
"- if c[u] != -1:",
"- continue",
"- c[u] = (c[v] + w) % 2",
"- dfs(u)",
"-",
"+from collections import deque",
"-e = tuple(set() for _ in range(n))",
... | false | 0.037303 | 0.064754 | 0.57607 | [
"s645282274",
"s441499939"
] |
u179019249 | p03373 | python | s760240713 | s504777308 | 127 | 89 | 3,060 | 3,060 | Accepted | Accepted | 29.92 | a, b, c, x, y = list(map(int, input().split()))
res = a*x + b*y # 条件を満たす買い方のうちABピザの枚数(*2)を全探索する。ABピザを一切買わない場合を一旦答えにする（これを大きい値にして、for ループを0からにしてもよい）
for i in range(1, max(x, y)+1): # 全部ABピザでまかなう時は x,yの内多い方分買うことになる
ab = i*2 # ABピザを買う枚数奇数枚買うことはないので2倍
cand = ab*c + a*max(0, x-i) + b*max(0, y-i) # i枚分はABピザになるの... | A, B, C, X, Y = list(map(int, input().split()))
min_sum = A*X + B*Y
for c in range(0, 100000+1):
sum = 2*C*c
if X - c > 0:
sum += A * (X - c)
if Y - c > 0:
sum += B * (Y - c)
if sum < min_sum:
min_sum = sum
print(min_sum) | 10 | 12 | 401 | 267 | a, b, c, x, y = list(map(int, input().split()))
res = (
a * x + b * y
) # 条件を満たす買い方のうちABピザの枚数(*2)を全探索する。ABピザを一切買わない場合を一旦答えにする（これを大きい値にして、for ループを0からにしてもよい）
for i in range(1, max(x, y) + 1): # 全部ABピザでまかなう時は x,yの内多い方分買うことになる
ab = i * 2 # ABピザを買う枚数奇数枚買うことはないので2倍
cand = (
ab * c + a * max(0, x - i) +... | A, B, C, X, Y = list(map(int, input().split()))
min_sum = A * X + B * Y
for c in range(0, 100000 + 1):
sum = 2 * C * c
if X - c > 0:
sum += A * (X - c)
if Y - c > 0:
sum += B * (Y - c)
if sum < min_sum:
min_sum = sum
print(min_sum)
| false | 16.666667 | [
"-a, b, c, x, y = list(map(int, input().split()))",
"-res = (",
"- a * x + b * y",
"-) # 条件を満たす買い方のうちABピザの枚数(*2)を全探索する。ABピザを一切買わない場合を一旦答えにする（これを大きい値にして、for ループを0からにしてもよい）",
"-for i in range(1, max(x, y) + 1): # 全部ABピザでまかなう時は x,yの内多い方分買うことになる",
"- ab = i * 2 # ABピザを買う枚数奇数枚買うことはないので2倍",
"- can... | false | 0.040722 | 0.091221 | 0.44641 | [
"s760240713",
"s504777308"
] |
u606045429 | p03878 | python | s690606520 | s290782237 | 582 | 384 | 25,820 | 26,588 | Accepted | Accepted | 34.02 | from heapq import heappush, heappop
mod = 10 ** 9 + 7
N, *E = list(map(int, open(0).read().split()))
Q = []
for i, e in enumerate(E):
heappush(Q, (e, 1 if i < N else -1))
res = 1
cnt = 0
while Q:
_, delta = heappop(Q)
if cnt * delta < 0:
res *= abs(cnt)
res %= mod
cnt ... | from heapq import heappush, heappop
mod = 10 ** 9 + 7
N, *E = list(map(int, open(0).read().split()))
E = sorted((e, 1 if i < N else -1) for i, e in enumerate(E))
res = 1
cnt = 0
for _, delta in E:
if cnt * delta < 0:
res *= abs(cnt)
res %= mod
cnt += delta
print(res) | 19 | 16 | 336 | 304 | from heapq import heappush, heappop
mod = 10**9 + 7
N, *E = list(map(int, open(0).read().split()))
Q = []
for i, e in enumerate(E):
heappush(Q, (e, 1 if i < N else -1))
res = 1
cnt = 0
while Q:
_, delta = heappop(Q)
if cnt * delta < 0:
res *= abs(cnt)
res %= mod
cnt += delta
print(res)
| from heapq import heappush, heappop
mod = 10**9 + 7
N, *E = list(map(int, open(0).read().split()))
E = sorted((e, 1 if i < N else -1) for i, e in enumerate(E))
res = 1
cnt = 0
for _, delta in E:
if cnt * delta < 0:
res *= abs(cnt)
res %= mod
cnt += delta
print(res)
| false | 15.789474 | [
"-Q = []",
"-for i, e in enumerate(E):",
"- heappush(Q, (e, 1 if i < N else -1))",
"+E = sorted((e, 1 if i < N else -1) for i, e in enumerate(E))",
"-while Q:",
"- _, delta = heappop(Q)",
"+for _, delta in E:"
] | false | 0.049296 | 0.096013 | 0.513427 | [
"s690606520",
"s290782237"
] |
u814986259 | p03716 | python | s148457014 | s566983805 | 488 | 448 | 41,516 | 37,212 | Accepted | Accepted | 8.2 | import sys
import heapq
input=sys.stdin.readline
N=int(eval(input()))
A=tuple(map(int,input().split()))
hq=list(A[:N])
heapq.heapify(hq)
s=[0]*(N+1)
s[0]=sum(hq)
for i in range(N):
x=heapq.heappop(hq)
if x >= A[N+i]:
s[i+1]=s[i]
heapq.heappush(hq,x)
else:
s[i+1]=s[i]+A[N+i]-x
heapq... | import heapq
import bisect
N = int(eval(input()))
a = list(map(int, input().split()))
b = a[:N]
c = a[-N:]
L = [0]*(N+1)
R = [0]*(N+1)
L[0] = sum(b)
heapq.heapify(b)
R[-1] = sum(c)
c = list([-x for x in c])
heapq.heapify(c)
for i in range(N):
k = a[i+N]
x = heapq.heappop(b)
if x ... | 35 | 43 | 680 | 759 | import sys
import heapq
input = sys.stdin.readline
N = int(eval(input()))
A = tuple(map(int, input().split()))
hq = list(A[:N])
heapq.heapify(hq)
s = [0] * (N + 1)
s[0] = sum(hq)
for i in range(N):
x = heapq.heappop(hq)
if x >= A[N + i]:
s[i + 1] = s[i]
heapq.heappush(hq, x)
else:
s... | import heapq
import bisect
N = int(eval(input()))
a = list(map(int, input().split()))
b = a[:N]
c = a[-N:]
L = [0] * (N + 1)
R = [0] * (N + 1)
L[0] = sum(b)
heapq.heapify(b)
R[-1] = sum(c)
c = list([-x for x in c])
heapq.heapify(c)
for i in range(N):
k = a[i + N]
x = heapq.heappop(b)
if x < k:
L[i ... | false | 18.604651 | [
"-import sys",
"+import bisect",
"-input = sys.stdin.readline",
"-A = tuple(map(int, input().split()))",
"-hq = list(A[:N])",
"-heapq.heapify(hq)",
"-s = [0] * (N + 1)",
"-s[0] = sum(hq)",
"+a = list(map(int, input().split()))",
"+b = a[:N]",
"+c = a[-N:]",
"+L = [0] * (N + 1)",
"+R = [0] * ... | false | 0.048224 | 0.083452 | 0.577866 | [
"s148457014",
"s566983805"
] |
u260980560 | p00099 | python | s539084248 | s440305969 | 1,560 | 890 | 31,700 | 37,896 | Accepted | Accepted | 42.95 | inputs = lambda: list(map(int, input().split()))
n_, q = inputs()
n = 1
while n<=n_: n *= 2
data = [(0, -n)] * (2*n+1)
for t in range(q):
a, v = inputs()
i = a + (n-1)
data[i] = (data[i][0]+v, -a)
while i:
i = (i - 1) / 2
data[i] = max(data[2*i+1], data[2*i+2])
p, q = dat... | from heapq import heappush, heappop
inputs = lambda: list(map(int, input().split()))
n, q = inputs()
n += 1
que = [(0, 1, -1)]
data = [0] * n
T = [-1] * n
for t in range(q):
a, v = inputs()
data[a] += v
T[a] = t
heappush(que, (-data[a], a, t))
while 1:
v, k, p = heappop(que)
... | 14 | 19 | 340 | 422 | inputs = lambda: list(map(int, input().split()))
n_, q = inputs()
n = 1
while n <= n_:
n *= 2
data = [(0, -n)] * (2 * n + 1)
for t in range(q):
a, v = inputs()
i = a + (n - 1)
data[i] = (data[i][0] + v, -a)
while i:
i = (i - 1) / 2
data[i] = max(data[2 * i + 1], data[2 * i + 2])
... | from heapq import heappush, heappop
inputs = lambda: list(map(int, input().split()))
n, q = inputs()
n += 1
que = [(0, 1, -1)]
data = [0] * n
T = [-1] * n
for t in range(q):
a, v = inputs()
data[a] += v
T[a] = t
heappush(que, (-data[a], a, t))
while 1:
v, k, p = heappop(que)
if T[k]... | false | 26.315789 | [
"+from heapq import heappush, heappop",
"+",
"-n_, q = inputs()",
"-n = 1",
"-while n <= n_:",
"- n *= 2",
"-data = [(0, -n)] * (2 * n + 1)",
"+n, q = inputs()",
"+n += 1",
"+que = [(0, 1, -1)]",
"+data = [0] * n",
"+T = [-1] * n",
"- i = a + (n - 1)",
"- data[i] = (data[i][0] + v... | false | 0.043742 | 0.063927 | 0.684257 | [
"s539084248",
"s440305969"
] |
u063896676 | p03221 | python | s995900486 | s825553507 | 1,044 | 855 | 53,152 | 50,128 | Accepted | Accepted | 18.1 | # -*- coding: utf-8 -*-
# from time import time
#
# start = time()
def six(n):
n_str = str(n)
while len(n_str) < 6:
n_str = "0" + n_str
return n_str
N, M = list(map(int, input().split()))
id_list = [None] * M
dic_P = {}
info = []
info_idx = 0
for i in range(M):
P,... | # -*- coding: utf-8 -*-
# from time import time
#
# start = time()
def six(n):
n_str = str(n)
while len(n_str) < 6:
n_str = "0" + n_str
return n_str
N, M = list(map(int, input().split()))
id_list = [None] * M
dic_P = {}
info = []
info_idx = 0
for i in range(M):
P,... | 42 | 41 | 788 | 759 | # -*- coding: utf-8 -*-
# from time import time
#
# start = time()
def six(n):
n_str = str(n)
while len(n_str) < 6:
n_str = "0" + n_str
return n_str
N, M = list(map(int, input().split()))
id_list = [None] * M
dic_P = {}
info = []
info_idx = 0
for i in range(M):
P, Y = list(map(int, input().spl... | # -*- coding: utf-8 -*-
# from time import time
#
# start = time()
def six(n):
n_str = str(n)
while len(n_str) < 6:
n_str = "0" + n_str
return n_str
N, M = list(map(int, input().split()))
id_list = [None] * M
dic_P = {}
info = []
info_idx = 0
for i in range(M):
P, Y = list(map(int, input().spl... | false | 2.380952 | [
"- id_list[i] = [P, Y, \"\"]"
] | false | 0.037326 | 0.037402 | 0.997985 | [
"s995900486",
"s825553507"
] |
u626468554 | p02813 | python | s946399303 | s849220657 | 47 | 43 | 3,064 | 3,060 | Accepted | Accepted | 8.51 | import itertools
n = int(eval(input()))
p = list(map(int,input().split()))
q = list(map(int,input().split()))
li = [i+1 for i in range(n)]
# print(p)
# print(q)
i = 0
for elm in itertools.permutations(li):
#print(list(elm))
if list(elm) == p:
mm1 = i
if list(elm) == q:
mm2 = i... | #n = int(input())
#n,k = map(int,input().split())
#x = list(map(int,input().split()))
import itertools
N = int(eval(input()))
P = list(map(int,input().split()))
Q = list(map(int,input().split()))
li = [i+1 for i in range(N)]
cnt = 0
for i in itertools.permutations(li):
if list(i) == P:
a ... | 17 | 27 | 345 | 404 | import itertools
n = int(eval(input()))
p = list(map(int, input().split()))
q = list(map(int, input().split()))
li = [i + 1 for i in range(n)]
# print(p)
# print(q)
i = 0
for elm in itertools.permutations(li):
# print(list(elm))
if list(elm) == p:
mm1 = i
if list(elm) == q:
mm2 = i
i +=... | # n = int(input())
# n,k = map(int,input().split())
# x = list(map(int,input().split()))
import itertools
N = int(eval(input()))
P = list(map(int, input().split()))
Q = list(map(int, input().split()))
li = [i + 1 for i in range(N)]
cnt = 0
for i in itertools.permutations(li):
if list(i) == P:
a = cnt
i... | false | 37.037037 | [
"+# n = int(input())",
"+# n,k = map(int,input().split())",
"+# x = list(map(int,input().split()))",
"-n = int(eval(input()))",
"-p = list(map(int, input().split()))",
"-q = list(map(int, input().split()))",
"-li = [i + 1 for i in range(n)]",
"-# print(p)",
"-# print(q)",
"-i = 0",
"-for elm in ... | false | 0.040555 | 0.046802 | 0.866527 | [
"s946399303",
"s849220657"
] |
u905203728 | p03380 | python | s145535795 | s824062927 | 255 | 109 | 62,704 | 14,428 | Accepted | Accepted | 57.25 | n=int(eval(input()))
box=sorted(list(map(int,input().split())))
if len(box)==2:print((max(box),min(box)));exit()
max_box=max(box)
target=max_box//2
if max_box%2==0:
if target not in box:
box.append(target)
box=sorted(box)
add=box.index(target)
if abs(target-box[add-1])>abs(... | n=int(eval(input()))
box=sorted(list(map(int,input().split())))
right=box.pop()
point=right//2
ans=0
left=10**9
for i in box:
if abs(i-point)<=left:
left=abs(i-point)
ans=i
if ans==point or ans==point+1:
print((right,ans))
exit()
print((right,ans)) | 26 | 15 | 839 | 305 | n = int(eval(input()))
box = sorted(list(map(int, input().split())))
if len(box) == 2:
print((max(box), min(box)))
exit()
max_box = max(box)
target = max_box // 2
if max_box % 2 == 0:
if target not in box:
box.append(target)
box = sorted(box)
add = box.index(target)
if abs(ta... | n = int(eval(input()))
box = sorted(list(map(int, input().split())))
right = box.pop()
point = right // 2
ans = 0
left = 10**9
for i in box:
if abs(i - point) <= left:
left = abs(i - point)
ans = i
if ans == point or ans == point + 1:
print((right, ans))
exit()
print(... | false | 42.307692 | [
"-if len(box) == 2:",
"- print((max(box), min(box)))",
"- exit()",
"-max_box = max(box)",
"-target = max_box // 2",
"-if max_box % 2 == 0:",
"- if target not in box:",
"- box.append(target)",
"- box = sorted(box)",
"- add = box.index(target)",
"- if abs(targe... | false | 0.047698 | 0.036224 | 1.316763 | [
"s145535795",
"s824062927"
] |
u766684188 | p02862 | python | s494946033 | s038365074 | 285 | 227 | 115,440 | 91,504 | Accepted | Accepted | 20.35 | #D
def main():
mod=1000000007
x,y=list(map(int,input().split()))
k=min(x,y//2)
l=min(x//2,y)
n=k+l
Fact=[1]
for i in range(1,n+1):
Fact.append(Fact[i-1]*i%mod)
Finv=[0]*(n+1) #階乗の逆元
Finv[-1]=pow(Fact[-1],mod-2,mod)
for i in range(n-1,-1,-1):
Fin... | def main():
mod=1000000007
x,y=list(map(int,input().split()))
if (x+y)%3:
return 0
n=(x+y)//3
Fact=[1]
for i in range(1,n+1):
Fact.append(Fact[i-1]*i%mod)
Finv=[0]*(n+1)
Finv[-1]=pow(Fact[-1],mod-2,mod)
for i in range(n-1,-1,-1):
Finv[i]=Finv... | 32 | 27 | 697 | 590 | # D
def main():
mod = 1000000007
x, y = list(map(int, input().split()))
k = min(x, y // 2)
l = min(x // 2, y)
n = k + l
Fact = [1]
for i in range(1, n + 1):
Fact.append(Fact[i - 1] * i % mod)
Finv = [0] * (n + 1) # 階乗の逆元
Finv[-1] = pow(Fact[-1], mod - 2, mod)
for i in ra... | def main():
mod = 1000000007
x, y = list(map(int, input().split()))
if (x + y) % 3:
return 0
n = (x + y) // 3
Fact = [1]
for i in range(1, n + 1):
Fact.append(Fact[i - 1] * i % mod)
Finv = [0] * (n + 1)
Finv[-1] = pow(Fact[-1], mod - 2, mod)
for i in range(n - 1, -1, ... | false | 15.625 | [
"-# D",
"- k = min(x, y // 2)",
"- l = min(x // 2, y)",
"- n = k + l",
"+ if (x + y) % 3:",
"+ return 0",
"+ n = (x + y) // 3",
"- Finv = [0] * (n + 1) # 階乗の逆元",
"+ Finv = [0] * (n + 1)",
"- ans = 0",
"- for a in range(k + 1):",
"- if (x - a) % 2 != 0:... | false | 0.377212 | 0.184121 | 2.048719 | [
"s494946033",
"s038365074"
] |
u608088992 | p02994 | python | s299555681 | s004120494 | 20 | 18 | 3,060 | 3,064 | Accepted | Accepted | 10 | N, L = list(map(int, input().split()))
total = 0
for i in range(N):
total += (L + i)
if L > 0: print((total - L))
elif L + N - 1 < 0: print((total - (L + N - 1)))
else: print(total)
| import sys
def solve():
input = sys.stdin.readline
N, L = list(map(int, input().split()))
sumT, minT = 0, 100000000000
pm = 0
for i in range(N):
sumT += L + i
if abs(L + i) < minT:
minT = abs(L + i)
if L + i < 0: pm = 1
print((sumT - minT * (-... | 8 | 19 | 184 | 391 | N, L = list(map(int, input().split()))
total = 0
for i in range(N):
total += L + i
if L > 0:
print((total - L))
elif L + N - 1 < 0:
print((total - (L + N - 1)))
else:
print(total)
| import sys
def solve():
input = sys.stdin.readline
N, L = list(map(int, input().split()))
sumT, minT = 0, 100000000000
pm = 0
for i in range(N):
sumT += L + i
if abs(L + i) < minT:
minT = abs(L + i)
if L + i < 0:
pm = 1
print((sumT - minT... | false | 57.894737 | [
"-N, L = list(map(int, input().split()))",
"-total = 0",
"-for i in range(N):",
"- total += L + i",
"-if L > 0:",
"- print((total - L))",
"-elif L + N - 1 < 0:",
"- print((total - (L + N - 1)))",
"-else:",
"- print(total)",
"+import sys",
"+",
"+",
"+def solve():",
"+ inpu... | false | 0.044026 | 0.040069 | 1.09875 | [
"s299555681",
"s004120494"
] |
u906501980 | p03361 | python | s826798305 | s966563344 | 182 | 21 | 13,352 | 3,316 | Accepted | Accepted | 88.46 | import numpy as np
h, w = list(map(int, input().split()))
s = np.array([list(eval(input())) for _ in range(h)])
w1, w2 = np.array(["."]*h), np.array(["."]*(w+2))
s = np.hstack((w1.reshape(len(w1),1), s))
s = np.hstack((s, w1.reshape(len(w1),1)))
s = np.vstack((w2, s))
s = np.vstack((s, w2))
dx, dy = [1, 0, -1, ... | def main():
h, w = list(map(int, input().split()))
k = [["."]+list(eval(input()))+["."] for _ in range(h)]
s = [[None]*(w+2) for _ in range(h+2)]
s[0] = ["."]*(w+2)
s[-1] = ["."]*(w+2)
s[1:h+1] = k
d = [[0, 1], [0, -1], [1, 0], [-1, 0]]
for i in range(1, h+1):
for j in r... | 24 | 24 | 686 | 674 | import numpy as np
h, w = list(map(int, input().split()))
s = np.array([list(eval(input())) for _ in range(h)])
w1, w2 = np.array(["."] * h), np.array(["."] * (w + 2))
s = np.hstack((w1.reshape(len(w1), 1), s))
s = np.hstack((s, w1.reshape(len(w1), 1)))
s = np.vstack((w2, s))
s = np.vstack((s, w2))
dx, dy = [1, 0, -1,... | def main():
h, w = list(map(int, input().split()))
k = [["."] + list(eval(input())) + ["."] for _ in range(h)]
s = [[None] * (w + 2) for _ in range(h + 2)]
s[0] = ["."] * (w + 2)
s[-1] = ["."] * (w + 2)
s[1 : h + 1] = k
d = [[0, 1], [0, -1], [1, 0], [-1, 0]]
for i in range(1, h + 1):
... | false | 0 | [
"-import numpy as np",
"+def main():",
"+ h, w = list(map(int, input().split()))",
"+ k = [[\".\"] + list(eval(input())) + [\".\"] for _ in range(h)]",
"+ s = [[None] * (w + 2) for _ in range(h + 2)]",
"+ s[0] = [\".\"] * (w + 2)",
"+ s[-1] = [\".\"] * (w + 2)",
"+ s[1 : h + 1] = k",... | false | 0.232604 | 0.109659 | 2.121155 | [
"s826798305",
"s966563344"
] |
u144304718 | p02707 | python | s838043504 | s911273696 | 137 | 112 | 25,960 | 25,868 | Accepted | Accepted | 18.25 | 社員数 = int(input())
部下数 = [0] * 社員数
for 上司 in map(int, input().split(' ')):
部下数[上司-1] += 1
[print(部下) for 部下 in 部下数]
| 社員数 = int(eval(input()))
部下数 = [0] * 社員数
for 上司 in input().split(' '):
部下数[int(上司)-1] += 1
print(('\n'.join(map(str, 部下数))))
| 7 | 7 | 128 | 129 | 社員数 = int(input())
部下数 = [0] * 社員数
for 上司 in map(int, input().split(" ")):
部下数[上司 - 1] += 1
[print(部下) for 部下 in 部下数]
| 社員数 = int(eval(input()))
部下数 = [0] * 社員数
for 上司 in input().split(" "):
部下数[int(上司) - 1] += 1
print(("\n".join(map(str, 部下数))))
| false | 0 | [
"-社員数 = int(input())",
"+社員数 = int(eval(input()))",
"-for 上司 in map(int, input().split(\" \")):",
"- 部下数[上司 - 1] += 1",
"-[print(部下) for 部下 in 部下数]",
"+for 上司 in input().split(\" \"):",
"+ 部下数[int(上司) - 1] += 1",
"+print((\"\\n\".join(map(str, 部下数))))"
] | false | 0.00753 | 0.036252 | 0.207702 | [
"s838043504",
"s911273696"
] |
u947883560 | p03222 | python | s960074404 | s999819655 | 47 | 28 | 3,188 | 3,572 | Accepted | Accepted | 40.43 | H, W, K = [int(x) for x in input().split()]
div = 1000000007
def baai(L):
if L == []:
return 1
elif L == [0]:
return 2
elif L == [1]:
return 1
elif L == [0, 0]:
return 3
elif len(L) == 2:
return 1
if L[0:2] == [1, 0]:
return baa... | #!/usr/bin/env python3
import sys
import functools
INF = float("inf")
MOD = 1000000007 # type: int
@functools.lru_cache(maxsize=None)
def f(x):
if x <= 0:
return 1
elif x == 1:
return 2
else:
return f(x-1) + f(x-2)
def solve(H: int, W: int, K: int):
dp ... | 60 | 56 | 1,372 | 1,196 | H, W, K = [int(x) for x in input().split()]
div = 1000000007
def baai(L):
if L == []:
return 1
elif L == [0]:
return 2
elif L == [1]:
return 1
elif L == [0, 0]:
return 3
elif len(L) == 2:
return 1
if L[0:2] == [1, 0]:
return baai(L[2:])
elif ... | #!/usr/bin/env python3
import sys
import functools
INF = float("inf")
MOD = 1000000007 # type: int
@functools.lru_cache(maxsize=None)
def f(x):
if x <= 0:
return 1
elif x == 1:
return 2
else:
return f(x - 1) + f(x - 2)
def solve(H: int, W: int, K: int):
dp = [0] * (W + 2)
... | false | 6.666667 | [
"-H, W, K = [int(x) for x in input().split()]",
"-div = 1000000007",
"+#!/usr/bin/env python3",
"+import sys",
"+import functools",
"+",
"+INF = float(\"inf\")",
"+MOD = 1000000007 # type: int",
"-def baai(L):",
"- if L == []:",
"+@functools.lru_cache(maxsize=None)",
"+def f(x):",
"+ ... | false | 0.03932 | 0.042775 | 0.919229 | [
"s960074404",
"s999819655"
] |
u585482323 | p03504 | python | s134266594 | s937193291 | 619 | 462 | 134,832 | 118,216 | Accepted | Accepted | 25.36 | #!usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS():return list(map(list, ... | #!usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS():return list(map(list, ... | 80 | 101 | 1,489 | 1,972 | #!usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI():
return list(map(int, sys.stdin.readline().split()))
def I():
return int(sys.stdin.readline())
def LS():
return list(m... | #!usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI():
return list(map(int, sys.stdin.readline().split()))
def I():
return int(sys.stdin.readline())
def LS():
return list(m... | false | 20.792079 | [
"- return",
"+ n = I()",
"+ f = LIR(n)",
"+ po = [1] * 11",
"+ for i in range(n):",
"+ k = 0",
"+ p = 1",
"+ for j in range(10):",
"+ k += p * f[i][j]",
"+ p *= 2",
"+ po[j + 1] = p",
"+ f[i] = k",
"+ p = LIR(n)",... | false | 0.573082 | 0.542818 | 1.055754 | [
"s134266594",
"s937193291"
] |
u729133443 | p03386 | python | s103773790 | s372255410 | 186 | 17 | 38,384 | 3,064 | Accepted | Accepted | 90.86 | a,b,k=map(int,input().split());r=range(a,b+1);print(*sorted(set(r[:k])|set(r[-k:])),sep='\n')
| a,b,k=list(map(int,input().split()));r=list(range(a,b+1));print((*sorted(set(r[:k])|set(r[-k:])))) | 1 | 1 | 93 | 84 | a, b, k = map(int, input().split())
r = range(a, b + 1)
print(*sorted(set(r[:k]) | set(r[-k:])), sep="\n")
| a, b, k = list(map(int, input().split()))
r = list(range(a, b + 1))
print((*sorted(set(r[:k]) | set(r[-k:]))))
| false | 0 | [
"-a, b, k = map(int, input().split())",
"-r = range(a, b + 1)",
"-print(*sorted(set(r[:k]) | set(r[-k:])), sep=\"\\n\")",
"+a, b, k = list(map(int, input().split()))",
"+r = list(range(a, b + 1))",
"+print((*sorted(set(r[:k]) | set(r[-k:]))))"
] | false | 0.152159 | 0.038772 | 3.924487 | [
"s103773790",
"s372255410"
] |
u244742296 | p02386 | python | s229015159 | s469081526 | 430 | 260 | 6,820 | 6,824 | Accepted | Accepted | 39.53 | class Dice(object):
def __init__(self, s1, s2, s3, s4, s5, s6):
self.s1 = s1
self.s2 = s2
self.s3 = s3
self.s4 = s4
self.s5 = s5
self.s6 = s6
def east(self):
prev_s6 = self.s6
self.s6 = self.s3
self.s3 = self.s1
self.s1 ... | class Dice(object):
def __init__(self, s1, s2, s3, s4, s5, s6):
self.s1 = s1
self.s2 = s2
self.s3 = s3
self.s4 = s4
self.s5 = s5
self.s6 = s6
def east(self):
prev_s6 = self.s6
self.s6 = self.s3
self.s3 = self.s1
self.s1 ... | 90 | 89 | 2,244 | 2,196 | class Dice(object):
def __init__(self, s1, s2, s3, s4, s5, s6):
self.s1 = s1
self.s2 = s2
self.s3 = s3
self.s4 = s4
self.s5 = s5
self.s6 = s6
def east(self):
prev_s6 = self.s6
self.s6 = self.s3
self.s3 = self.s1
self.s1 = self.s4
... | class Dice(object):
def __init__(self, s1, s2, s3, s4, s5, s6):
self.s1 = s1
self.s2 = s2
self.s3 = s3
self.s4 = s4
self.s5 = s5
self.s6 = s6
def east(self):
prev_s6 = self.s6
self.s6 = self.s3
self.s3 = self.s1
self.s1 = self.s4
... | false | 1.111111 | [
"-for idx1, dice1 in enumerate(dices):",
"- for idx2, dice2 in enumerate(dices):",
"- if idx1 == idx2:",
"- continue",
"- for i in range(6):",
"- if i % 2 == 0:",
"- dice2.north()",
"+for i in range(n):",
"+ j = i + 1",
"+ while j < n:",
... | false | 0.035266 | 0.042091 | 0.837845 | [
"s229015159",
"s469081526"
] |
u790922244 | p02954 | python | s294055525 | s246367629 | 145 | 121 | 6,400 | 6,400 | Accepted | Accepted | 16.55 | R="R"
L="L"
def f(r, l):
ans_r = (r // 2) + (l // 2) + (r % 2)
ans_l = (r // 2) + (l // 2) + (l % 2)
return (ans_r, ans_l)
S=eval(input())
N=len(S)
ans=[0]*N
r_begin = 0
r_end = 0
l_begin = 0
l_end = 0
for i in range(N-1):
if S[i:i+2] == R+L:
r_end = i
l_begin = i+... | R="R"
L="L"
def f(r, l):
ans_r = (r // 2) + (r % 2) + (l // 2)
ans_l = (r // 2) + (l // 2) + (l % 2)
return (ans_r, ans_l)
S=eval(input())
N=len(S)
ans=[0]*N
r_begin = 0
r_end = -1
l_begin = 0
l_end = 0
for i in range(N):
if S[i] == R:
if r_end == -1:
continue
... | 37 | 43 | 709 | 847 | R = "R"
L = "L"
def f(r, l):
ans_r = (r // 2) + (l // 2) + (r % 2)
ans_l = (r // 2) + (l // 2) + (l % 2)
return (ans_r, ans_l)
S = eval(input())
N = len(S)
ans = [0] * N
r_begin = 0
r_end = 0
l_begin = 0
l_end = 0
for i in range(N - 1):
if S[i : i + 2] == R + L:
r_end = i
l_begin = i... | R = "R"
L = "L"
def f(r, l):
ans_r = (r // 2) + (r % 2) + (l // 2)
ans_l = (r // 2) + (l // 2) + (l % 2)
return (ans_r, ans_l)
S = eval(input())
N = len(S)
ans = [0] * N
r_begin = 0
r_end = -1
l_begin = 0
l_end = 0
for i in range(N):
if S[i] == R:
if r_end == -1:
continue
... | false | 13.953488 | [
"- ans_r = (r // 2) + (l // 2) + (r % 2)",
"+ ans_r = (r // 2) + (r % 2) + (l // 2)",
"-r_end = 0",
"+r_end = -1",
"-for i in range(N - 1):",
"- if S[i : i + 2] == R + L:",
"- r_end = i",
"- l_begin = i + 1",
"- elif S[i : i + 2] == L + R:",
"- l_end = i",
"- ... | false | 0.00742 | 0.038411 | 0.193185 | [
"s294055525",
"s246367629"
] |
u188827677 | p03625 | python | s965317192 | s487384205 | 144 | 113 | 25,636 | 26,520 | Accepted | Accepted | 21.53 | from collections import Counter
n = int(eval(input()))
a = list(map(int, input().split()))
count = Counter(a)
ans = [0]*2
t = 0
for i in sorted(list(count.items()), reverse=True):
if i[1] >= 4:
if t == 0:
ans[0],ans[1] = i[0],i[0]
t = 2
elif t == 1:
ans[t] = i[0]
t += 1
... | n = int(eval(input()))
a = list(map(int, input().split()))
d = {}
for i in a:
if i in d: d[i] += 1
else: d[i] = 1
t = 0
ans = []
for k,v in sorted(list(d.items()), key=lambda x: x[0], reverse=True):
if v >= 4 and t == 0:
print((k*k))
exit()
elif v >= 2:
ans.append(k)
t += 1
... | 20 | 21 | 399 | 364 | from collections import Counter
n = int(eval(input()))
a = list(map(int, input().split()))
count = Counter(a)
ans = [0] * 2
t = 0
for i in sorted(list(count.items()), reverse=True):
if i[1] >= 4:
if t == 0:
ans[0], ans[1] = i[0], i[0]
t = 2
elif t == 1:
ans[t] = ... | n = int(eval(input()))
a = list(map(int, input().split()))
d = {}
for i in a:
if i in d:
d[i] += 1
else:
d[i] = 1
t = 0
ans = []
for k, v in sorted(list(d.items()), key=lambda x: x[0], reverse=True):
if v >= 4 and t == 0:
print((k * k))
exit()
elif v >= 2:
ans.app... | false | 4.761905 | [
"-from collections import Counter",
"-",
"-count = Counter(a)",
"-ans = [0] * 2",
"+d = {}",
"+for i in a:",
"+ if i in d:",
"+ d[i] += 1",
"+ else:",
"+ d[i] = 1",
"-for i in sorted(list(count.items()), reverse=True):",
"- if i[1] >= 4:",
"- if t == 0:",
"- ... | false | 0.049581 | 0.050839 | 0.97526 | [
"s965317192",
"s487384205"
] |
u185249212 | p03457 | python | s274614265 | s676145679 | 832 | 307 | 100,824 | 56,796 | Accepted | Accepted | 63.1 |
import sys
sys.setrecursionlimit(500000)
import re
import array
import copy
import functools
import operator
import math
import string
import fractions
from fractions import Fraction
import collections
import itertools
import bisect
import random
import time
import heapq
from heapq import... |
import sys
sys.setrecursionlimit(500000)
input = sys.stdin.readline
def judge(s, g):
t = g[0] - s[0]
x = g[1] - s[1]
y = g[2] - s[2]
if (abs(x)+abs(y)) % 2 == t % 2 and (abs(x)+abs(y)) <= t:
return True
else:
return False
def main():
# inputs
n = ... | 105 | 39 | 1,942 | 766 | import sys
sys.setrecursionlimit(500000)
import re
import array
import copy
import functools
import operator
import math
import string
import fractions
from fractions import Fraction
import collections
import itertools
import bisect
import random
import time
import heapq
from heapq import heappush
from heapq import he... | import sys
sys.setrecursionlimit(500000)
input = sys.stdin.readline
def judge(s, g):
t = g[0] - s[0]
x = g[1] - s[1]
y = g[2] - s[2]
if (abs(x) + abs(y)) % 2 == t % 2 and (abs(x) + abs(y)) <= t:
return True
else:
return False
def main():
# inputs
n = int(input().strip())... | false | 62.857143 | [
"-import re",
"-import array",
"-import copy",
"-import functools",
"-import operator",
"-import math",
"-import string",
"-import fractions",
"-from fractions import Fraction",
"-import collections",
"-import itertools",
"-import bisect",
"-import random",
"-import time",
"-import heapq... | false | 0.116292 | 0.077524 | 1.500076 | [
"s274614265",
"s676145679"
] |
u353919145 | p03160 | python | s573319219 | s469975455 | 159 | 145 | 13,980 | 13,928 | Accepted | Accepted | 8.81 | N = int(eval(input()))
h = list(map(int, input().split()))
mincost = [float("inf") for _ in range(N)]
mincost[0] = 0
mincost[1] = abs(h[1] - h[0])
for i in range(2, N):
mincost[i] = min(mincost[i - 2] + abs(h[i] - h[i - 2]), mincost[i - 1] + abs(h[i] - h[i - 1]))
print((mincost[N - 1])) | n = int(eval(input()))
h = list(map(int, input().split()))
dp = [float("inf") for i in range(n)]
dp[0] = 0
dp[1] = dp[0] + (h[1] - h[0])
for i in range(1, n):
dp[i] = min(dp[i - 2] + (abs(h[i] - h[i - 2])), dp[i - 1] + (abs(h[i] - h[i - 1])))
print((dp[n - 1])) | 11 | 8 | 296 | 264 | N = int(eval(input()))
h = list(map(int, input().split()))
mincost = [float("inf") for _ in range(N)]
mincost[0] = 0
mincost[1] = abs(h[1] - h[0])
for i in range(2, N):
mincost[i] = min(
mincost[i - 2] + abs(h[i] - h[i - 2]), mincost[i - 1] + abs(h[i] - h[i - 1])
)
print((mincost[N - 1]))
| n = int(eval(input()))
h = list(map(int, input().split()))
dp = [float("inf") for i in range(n)]
dp[0] = 0
dp[1] = dp[0] + (h[1] - h[0])
for i in range(1, n):
dp[i] = min(dp[i - 2] + (abs(h[i] - h[i - 2])), dp[i - 1] + (abs(h[i] - h[i - 1])))
print((dp[n - 1]))
| false | 27.272727 | [
"-N = int(eval(input()))",
"+n = int(eval(input()))",
"-mincost = [float(\"inf\") for _ in range(N)]",
"-mincost[0] = 0",
"-mincost[1] = abs(h[1] - h[0])",
"-for i in range(2, N):",
"- mincost[i] = min(",
"- mincost[i - 2] + abs(h[i] - h[i - 2]), mincost[i - 1] + abs(h[i] - h[i - 1])",
"- ... | false | 0.038361 | 0.06976 | 0.549899 | [
"s573319219",
"s469975455"
] |
u044097841 | p02898 | python | s450529375 | s637526527 | 53 | 48 | 11,912 | 11,916 | Accepted | Accepted | 9.43 | N, K = list(map(int, input().split()))
heights = [int(x) for x in input().split()]
ans = 0
for i in heights:
if i >= K:
ans += 1
print(ans) | N, K = list(map(int, input().split()))
heights = [int(x) for x in input().split()]
print((len([i for i in heights if i >= K]))) | 8 | 3 | 153 | 121 | N, K = list(map(int, input().split()))
heights = [int(x) for x in input().split()]
ans = 0
for i in heights:
if i >= K:
ans += 1
print(ans)
| N, K = list(map(int, input().split()))
heights = [int(x) for x in input().split()]
print((len([i for i in heights if i >= K])))
| false | 62.5 | [
"-ans = 0",
"-for i in heights:",
"- if i >= K:",
"- ans += 1",
"-print(ans)",
"+print((len([i for i in heights if i >= K])))"
] | false | 0.084794 | 0.1143 | 0.741856 | [
"s450529375",
"s637526527"
] |
u218843509 | p02803 | python | s666924753 | s420091027 | 514 | 322 | 63,728 | 3,316 | Accepted | Accepted | 37.35 | from collections import deque
H, W = list(map(int, input().split()))
c = ["#"*(W+2)] + ["#" + eval(input()) + "#" for _ in range(H)] + ["#"*(W+2)]
def bfs(start):
queue = deque([start])
#visited = [[False for _ in range(W+2)] for _ in range(H+2)]
tekazu = [[-1 for _ in range(W+2)] for _ in range(H+2)]
te... | from collections import deque
H, W = list(map(int, input().split()))
s = ["#"*(W+2)] + ["#" + eval(input()) + "#" for _ in range(H)] + ["#"*(W+2)]
DH, DW = [0, 0, 1, -1], [1, -1, 0, 0]
def bfs(start):
que = deque([start])
dist = [[-1 for _ in range(W+2)] for _ in range(H+2)]
dist[start[0]][start[1]] = 0
n... | 44 | 31 | 1,539 | 727 | from collections import deque
H, W = list(map(int, input().split()))
c = ["#" * (W + 2)] + ["#" + eval(input()) + "#" for _ in range(H)] + ["#" * (W + 2)]
def bfs(start):
queue = deque([start])
# visited = [[False for _ in range(W+2)] for _ in range(H+2)]
tekazu = [[-1 for _ in range(W + 2)] for _ in ran... | from collections import deque
H, W = list(map(int, input().split()))
s = ["#" * (W + 2)] + ["#" + eval(input()) + "#" for _ in range(H)] + ["#" * (W + 2)]
DH, DW = [0, 0, 1, -1], [1, -1, 0, 0]
def bfs(start):
que = deque([start])
dist = [[-1 for _ in range(W + 2)] for _ in range(H + 2)]
dist[start[0]][st... | false | 29.545455 | [
"-c = [\"#\" * (W + 2)] + [\"#\" + eval(input()) + \"#\" for _ in range(H)] + [\"#\" * (W + 2)]",
"+s = [\"#\" * (W + 2)] + [\"#\" + eval(input()) + \"#\" for _ in range(H)] + [\"#\" * (W + 2)]",
"+DH, DW = [0, 0, 1, -1], [1, -1, 0, 0]",
"- queue = deque([start])",
"- # visited = [[False for _ in rang... | false | 0.041 | 0.077161 | 0.531348 | [
"s666924753",
"s420091027"
] |
u693953100 | p03262 | python | s184540887 | s007083417 | 100 | 86 | 14,252 | 14,252 | Accepted | Accepted | 14 | def gcd(a, b):
if b == 0:
return a
return gcd(b, a % b)
n, x = list(map(int, input().split(' ')))
p = list(map(int, input().split(' ')))
for i in range(n):
p[i] = abs(p[i] - x)
ans = p[0]
for i in range(n):
ans = gcd(p[i], ans)
print(ans)
| def gcd(a,b):
if b==0:
return a
else:
return gcd(b,a%b)
def solve():
n,x = list(map(int,input().split()))
l = list(map(int,input().split()))
d = abs(x-l[0])
for i in range(1,n):
d = gcd(d,abs(x-l[i]))
print(d)
if __name__=='__main__':
solve() | 14 | 14 | 272 | 305 | def gcd(a, b):
if b == 0:
return a
return gcd(b, a % b)
n, x = list(map(int, input().split(" ")))
p = list(map(int, input().split(" ")))
for i in range(n):
p[i] = abs(p[i] - x)
ans = p[0]
for i in range(n):
ans = gcd(p[i], ans)
print(ans)
| def gcd(a, b):
if b == 0:
return a
else:
return gcd(b, a % b)
def solve():
n, x = list(map(int, input().split()))
l = list(map(int, input().split()))
d = abs(x - l[0])
for i in range(1, n):
d = gcd(d, abs(x - l[i]))
print(d)
if __name__ == "__main__":
solve()
| false | 0 | [
"- return gcd(b, a % b)",
"+ else:",
"+ return gcd(b, a % b)",
"-n, x = list(map(int, input().split(\" \")))",
"-p = list(map(int, input().split(\" \")))",
"-for i in range(n):",
"- p[i] = abs(p[i] - x)",
"-ans = p[0]",
"-for i in range(n):",
"- ans = gcd(p[i], ans)",
"-print(... | false | 0.045957 | 0.038164 | 1.204188 | [
"s184540887",
"s007083417"
] |
u814781830 | p02712 | python | s360414593 | s677216702 | 154 | 59 | 9,180 | 61,608 | Accepted | Accepted | 61.69 | n = int(eval(input()))
ans = 0
for i in range(1,n+1):
if i % 3 == 0 or i % 5 == 0:
continue
ans += i
print(ans)
| N = int(eval(input()))
#A = list(map(int, input().split()))
amount = (N+1) * N // 2
three = N // 3
three = (three + 1) * 3 * three // 2 if three > 0 else 0
five = N // 5
five = (five + 1) * 5 * five // 2 if five > 0 else 0
fifteen = N // 15
fifteen = (fifteen + 1) * 15 * fifteen // 2 if fifteen > 0 else 0
prin... | 7 | 10 | 128 | 343 | n = int(eval(input()))
ans = 0
for i in range(1, n + 1):
if i % 3 == 0 or i % 5 == 0:
continue
ans += i
print(ans)
| N = int(eval(input()))
# A = list(map(int, input().split()))
amount = (N + 1) * N // 2
three = N // 3
three = (three + 1) * 3 * three // 2 if three > 0 else 0
five = N // 5
five = (five + 1) * 5 * five // 2 if five > 0 else 0
fifteen = N // 15
fifteen = (fifteen + 1) * 15 * fifteen // 2 if fifteen > 0 else 0
print((amo... | false | 30 | [
"-n = int(eval(input()))",
"-ans = 0",
"-for i in range(1, n + 1):",
"- if i % 3 == 0 or i % 5 == 0:",
"- continue",
"- ans += i",
"-print(ans)",
"+N = int(eval(input()))",
"+# A = list(map(int, input().split()))",
"+amount = (N + 1) * N // 2",
"+three = N // 3",
"+three = (three ... | false | 0.1299 | 0.036903 | 3.520008 | [
"s360414593",
"s677216702"
] |
u652498023 | p03343 | python | s605550940 | s025195202 | 972 | 867 | 3,316 | 3,316 | Accepted | Accepted | 10.8 | n, k, q = list(map(int, input().split()))
a = list(map(int, input().split()))
d = [a]
a = sorted(a)
ans = a[q - 1] - a[0]
while True:
newd = list()
li = list()
for sub in d:
for c in sub:
if c != a[0]:
li.append(c)
else:
newd... | N, K, Q = list(map(int, input().split()))
a = list(map(int, input().split()))
d=[a]
a = sorted(a)
ans = a[Q-1] - a[0]
while True:
d_temp = list()
sub_temp = list()
for sub in d:
for c in sub:
if c != a[0]:
sub_temp.append(c)
else:
d_temp.append(sub_temp)
... | 37 | 40 | 739 | 674 | n, k, q = list(map(int, input().split()))
a = list(map(int, input().split()))
d = [a]
a = sorted(a)
ans = a[q - 1] - a[0]
while True:
newd = list()
li = list()
for sub in d:
for c in sub:
if c != a[0]:
li.append(c)
else:
newd.append(li)
... | N, K, Q = list(map(int, input().split()))
a = list(map(int, input().split()))
d = [a]
a = sorted(a)
ans = a[Q - 1] - a[0]
while True:
d_temp = list()
sub_temp = list()
for sub in d:
for c in sub:
if c != a[0]:
sub_temp.append(c)
else:
d_temp.ap... | false | 7.5 | [
"-n, k, q = list(map(int, input().split()))",
"+N, K, Q = list(map(int, input().split()))",
"-ans = a[q - 1] - a[0]",
"+ans = a[Q - 1] - a[0]",
"- newd = list()",
"- li = list()",
"+ d_temp = list()",
"+ sub_temp = list()",
"- li.append(c)",
"+ sub_temp.ap... | false | 0.037628 | 0.107089 | 0.351369 | [
"s605550940",
"s025195202"
] |
u150984829 | p02397 | python | s722694584 | s897123753 | 60 | 40 | 5,596 | 5,984 | Accepted | Accepted | 33.33 | while 1:
n = eval(input())
if n=='0 0':break
print((*sorted(map(int,n.split())))) | a=[]
while 1:
n=eval(input())
if n=='0 0':break
a.append(n)
for s in a:
print((*sorted(map(int,s.split())))) | 4 | 7 | 79 | 110 | while 1:
n = eval(input())
if n == "0 0":
break
print((*sorted(map(int, n.split()))))
| a = []
while 1:
n = eval(input())
if n == "0 0":
break
a.append(n)
for s in a:
print((*sorted(map(int, s.split()))))
| false | 42.857143 | [
"+a = []",
"- print((*sorted(map(int, n.split()))))",
"+ a.append(n)",
"+for s in a:",
"+ print((*sorted(map(int, s.split()))))"
] | false | 0.040091 | 0.040595 | 0.987592 | [
"s722694584",
"s897123753"
] |
u735175408 | p02829 | python | s988359058 | s858255493 | 19 | 17 | 2,940 | 2,940 | Accepted | Accepted | 10.53 | A=int(eval(input()))
B=int(eval(input()))
if A!=1 and B!=1:
print("1")
if A!=2 and B!=2:
print("2")
if A!=3 and B!=3:
print("3") | A=int(eval(input()))
B=int(eval(input()))
for x in range(1,4):
if A!=x and B!=x:
print(x) | 8 | 5 | 135 | 93 | A = int(eval(input()))
B = int(eval(input()))
if A != 1 and B != 1:
print("1")
if A != 2 and B != 2:
print("2")
if A != 3 and B != 3:
print("3")
| A = int(eval(input()))
B = int(eval(input()))
for x in range(1, 4):
if A != x and B != x:
print(x)
| false | 37.5 | [
"-if A != 1 and B != 1:",
"- print(\"1\")",
"-if A != 2 and B != 2:",
"- print(\"2\")",
"-if A != 3 and B != 3:",
"- print(\"3\")",
"+for x in range(1, 4):",
"+ if A != x and B != x:",
"+ print(x)"
] | false | 0.083713 | 0.073822 | 1.133976 | [
"s988359058",
"s858255493"
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.