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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
u729133443 | p02538 | python | s586436923 | s612785031 | 506 | 321 | 23,540 | 23,484 | Accepted | Accepted | 36.56 | code = r"""
# distutils: language=c++
# distutils: include_dirs=/opt/ac-library
# cython: cdivision=True
from libcpp cimport bool
from libcpp.vector cimport vector
cdef extern from "<atcoder/lazysegtree>" namespace "atcoder" nogil:
cdef cppclass lazy_segtree[S, OP, E, F, mapping, composition, id]:
l... | code = r"""
# distutils: language=c++
# distutils: include_dirs=/opt/ac-library
# cython: cdivision=True
from libcpp cimport bool
from libcpp.vector cimport vector
cdef extern from "<atcoder/lazysegtree>" namespace "atcoder" nogil:
cdef cppclass lazy_segtree[S, OP, E, F, mapping, composition, id]:
l... | 79 | 78 | 2,316 | 2,310 | code = r"""
# distutils: language=c++
# distutils: include_dirs=/opt/ac-library
# cython: cdivision=True
from libcpp cimport bool
from libcpp.vector cimport vector
cdef extern from "<atcoder/lazysegtree>" namespace "atcoder" nogil:
cdef cppclass lazy_segtree[S, OP, E, F, mapping, composition, id]:
lazy_segt... | code = r"""
# distutils: language=c++
# distutils: include_dirs=/opt/ac-library
# cython: cdivision=True
from libcpp cimport bool
from libcpp.vector cimport vector
cdef extern from "<atcoder/lazysegtree>" namespace "atcoder" nogil:
cdef cppclass lazy_segtree[S, OP, E, F, mapping, composition, id]:
lazy_segt... | false | 1.265823 | [
"-cdef long mod = 998244353",
"- c.v = (a.v * b.s + b.v) % mod",
"- c.s = (a.s * b.s) % mod",
"+ c.v = (a.v * b.s + b.v) % 998244353",
"+ c.s = (a.s * b.s) % 998244353",
"- y.v = (x.s - 1) * 443664157 * f % mod",
"+ y.v = (x.s - 1) * 443664157 * f % 998244353",
"-cdef inline int read... | false | 0.047532 | 0.127388 | 0.373129 | [
"s586436923",
"s612785031"
] |
u368796742 | p02670 | python | s830466521 | s367806770 | 1,895 | 1,602 | 172,828 | 197,940 | Accepted | Accepted | 15.46 | def main():
from collections import deque
import sys
input = sys.stdin.readline
n = int(eval(input()))
l = list(map(int,input().split()))
check = [[1]*n for i in range(n)]
d = [[min(i, n-i-1, j, n-j-1) for j in range(n)] for i in range(n)]
ans = 0
for t in l:
... | def main():
import sys
input = sys.stdin.readline
n = int(eval(input()))
l = list(map(int,input().split()))
check = [[1]*n for i in range(n)]
d = [[min(i, n-i-1, j, n-j-1) for j in range(n)] for i in range(n)]
ans = 0
for t in l:
t -=1
x = t//n
y = t... | 40 | 39 | 1,208 | 1,158 | def main():
from collections import deque
import sys
input = sys.stdin.readline
n = int(eval(input()))
l = list(map(int, input().split()))
check = [[1] * n for i in range(n)]
d = [[min(i, n - i - 1, j, n - j - 1) for j in range(n)] for i in range(n)]
ans = 0
for t in l:
t -=... | def main():
import sys
input = sys.stdin.readline
n = int(eval(input()))
l = list(map(int, input().split()))
check = [[1] * n for i in range(n)]
d = [[min(i, n - i - 1, j, n - j - 1) for j in range(n)] for i in range(n)]
ans = 0
for t in l:
t -= 1
x = t // n
y = ... | false | 2.5 | [
"- from collections import deque",
"- q = deque([])",
"+ q = []",
"- bx, by, z = q.popleft()",
"+ bx, by, z = q.pop()"
] | false | 0.047818 | 0.047965 | 0.996933 | [
"s830466521",
"s367806770"
] |
u893063840 | p02844 | python | s463963896 | s450084952 | 563 | 18 | 41,052 | 3,060 | Accepted | Accepted | 96.8 | from itertools import product
n = int(eval(input()))
s = eval(input())
nums = [str(i) for i in range(10)]
ans = 0
for pat in product(nums, repeat=3):
i = 0
for e in s:
if e == pat[i]:
i += 1
if i == 3:
break
if i == 3:
ans += 1
print(... | n = int(eval(input()))
s = eval(input())
nums = tuple(str(i) for i in range(10))
ans = 0
for i in nums:
pi = s.find(i)
if pi == -1:
continue
for j in nums:
pj = s.find(j, pi + 1)
if pj == -1:
continue
for k in nums:
pk = s.find(k, ... | 21 | 24 | 313 | 406 | from itertools import product
n = int(eval(input()))
s = eval(input())
nums = [str(i) for i in range(10)]
ans = 0
for pat in product(nums, repeat=3):
i = 0
for e in s:
if e == pat[i]:
i += 1
if i == 3:
break
if i == 3:
ans += 1
print(ans)
| n = int(eval(input()))
s = eval(input())
nums = tuple(str(i) for i in range(10))
ans = 0
for i in nums:
pi = s.find(i)
if pi == -1:
continue
for j in nums:
pj = s.find(j, pi + 1)
if pj == -1:
continue
for k in nums:
pk = s.find(k, pj + 1)
i... | false | 12.5 | [
"-from itertools import product",
"-",
"-nums = [str(i) for i in range(10)]",
"+nums = tuple(str(i) for i in range(10))",
"-for pat in product(nums, repeat=3):",
"- i = 0",
"- for e in s:",
"- if e == pat[i]:",
"- i += 1",
"- if i == 3:",
"- break",
"-... | false | 0.060848 | 0.034632 | 1.756997 | [
"s463963896",
"s450084952"
] |
u860657719 | p02695 | python | s503642627 | s529003618 | 1,541 | 1,124 | 9,356 | 9,220 | Accepted | Accepted | 27.06 | import copy
n, m, q = list(map(int, input().split()))
a = [0]*q
b = [0]*q
c = [0]*q
d = [0]*q
for i in range(q):
a[i], b[i], c[i], d[i] = list(map(int, input().split()))
A = [1]
ans = 0
def dfs(lis):
if len(lis) == n+1:
now = 0
for i in range(q):
if lis[b[i]] - lis[a[i]... | import itertools
n, m, q = list(map(int, input().split()))
a = [0]*q
b = [0]*q
c = [0]*q
d = [0]*q
for i in range(q):
a[i], b[i], c[i], d[i] = list(map(int, input().split()))
ans = 0
for A in itertools.combinations_with_replacement(list(range(1, m+1)), n):
now = 0
for i in range(q):
if A... | 26 | 16 | 564 | 393 | import copy
n, m, q = list(map(int, input().split()))
a = [0] * q
b = [0] * q
c = [0] * q
d = [0] * q
for i in range(q):
a[i], b[i], c[i], d[i] = list(map(int, input().split()))
A = [1]
ans = 0
def dfs(lis):
if len(lis) == n + 1:
now = 0
for i in range(q):
if lis[b[i]] - lis[a[i]]... | import itertools
n, m, q = list(map(int, input().split()))
a = [0] * q
b = [0] * q
c = [0] * q
d = [0] * q
for i in range(q):
a[i], b[i], c[i], d[i] = list(map(int, input().split()))
ans = 0
for A in itertools.combinations_with_replacement(list(range(1, m + 1)), n):
now = 0
for i in range(q):
if A[... | false | 38.461538 | [
"-import copy",
"+import itertools",
"-A = [1]",
"-",
"-",
"-def dfs(lis):",
"- if len(lis) == n + 1:",
"- now = 0",
"- for i in range(q):",
"- if lis[b[i]] - lis[a[i]] == c[i]:",
"- now += d[i]",
"- global ans",
"- ans = max(now, ans)... | false | 0.185785 | 0.0604 | 3.07588 | [
"s503642627",
"s529003618"
] |
u831244171 | p02272 | python | s590347869 | s128178366 | 4,750 | 4,360 | 64,324 | 64,332 | Accepted | Accepted | 8.21 | from collections import deque
count = 0
def merge(A,left,mid,right):
L = deque(A[left:mid])
R = deque(A[mid:right])
L.append(float("inf"))
R.append(float("inf"))
global count
for k in range(left,right):
count +=1
if L[0] <= R[0]:
A[k] = L.popl... | from collections import deque
count = 0
def merge(A,left,mid,right):
L = deque(A[left:mid])
R = deque(A[mid:right])
L.append(10**9)
R.append(10**9)
global count
for k in range(left,right):
count +=1
if L[0] <= R[0]:
A[k] = L.popleft()
... | 33 | 33 | 714 | 700 | from collections import deque
count = 0
def merge(A, left, mid, right):
L = deque(A[left:mid])
R = deque(A[mid:right])
L.append(float("inf"))
R.append(float("inf"))
global count
for k in range(left, right):
count += 1
if L[0] <= R[0]:
A[k] = L.popleft()
els... | from collections import deque
count = 0
def merge(A, left, mid, right):
L = deque(A[left:mid])
R = deque(A[mid:right])
L.append(10**9)
R.append(10**9)
global count
for k in range(left, right):
count += 1
if L[0] <= R[0]:
A[k] = L.popleft()
else:
... | false | 0 | [
"- L.append(float(\"inf\"))",
"- R.append(float(\"inf\"))",
"+ L.append(10**9)",
"+ R.append(10**9)"
] | false | 0.03729 | 0.048947 | 0.761844 | [
"s590347869",
"s128178366"
] |
u948911484 | p02901 | python | s984547080 | s609521629 | 1,952 | 902 | 3,188 | 3,188 | Accepted | Accepted | 53.79 | n,m = list(map(int,input().split()))
dp = [0]+[10**8+10]*(2**n-1)
for i in range(m):
a,b = list(map(int,input().split()))
s = sum([2**(x-1) for x in list(map(int,input().split()))])
for j in range(2**n):
dp[j|s] = min(dp[j|s],dp[j]+a)
if dp[-1] <= 10**8:
print((dp[-1]))
else:
print((-1)) | n,m = list(map(int,input().split()))
dp = [0]+[10**8+10]*(2**n-1)
for i in range(m):
a,b = list(map(int,input().split()))
s = sum([2**(x-1) for x in list(map(int,input().split()))])
for j in range(2**n):
if dp[j|s] > dp[j]+a:
dp[j|s] = dp[j]+a
if dp[-1] <= 10**8:
print((dp[-1]))
else:
pri... | 11 | 12 | 296 | 312 | n, m = list(map(int, input().split()))
dp = [0] + [10**8 + 10] * (2**n - 1)
for i in range(m):
a, b = list(map(int, input().split()))
s = sum([2 ** (x - 1) for x in list(map(int, input().split()))])
for j in range(2**n):
dp[j | s] = min(dp[j | s], dp[j] + a)
if dp[-1] <= 10**8:
print((dp[-1]))
e... | n, m = list(map(int, input().split()))
dp = [0] + [10**8 + 10] * (2**n - 1)
for i in range(m):
a, b = list(map(int, input().split()))
s = sum([2 ** (x - 1) for x in list(map(int, input().split()))])
for j in range(2**n):
if dp[j | s] > dp[j] + a:
dp[j | s] = dp[j] + a
if dp[-1] <= 10**8:... | false | 8.333333 | [
"- dp[j | s] = min(dp[j | s], dp[j] + a)",
"+ if dp[j | s] > dp[j] + a:",
"+ dp[j | s] = dp[j] + a"
] | false | 0.046609 | 0.047897 | 0.973099 | [
"s984547080",
"s609521629"
] |
u366482170 | p03013 | python | s594782504 | s343242555 | 391 | 185 | 460,056 | 11,884 | Accepted | Accepted | 52.69 | n,m=list(map(int,input().split()))
a = set(int(eval(input())) for i in range(m))
#for i in range(m):
# a.append(int(input()))
b=[0 for x in range(n+1)]
b[0]=1
for i in range(1,n+1):
if i in a:
continue
x=b[i-1]
if i>1:x+=b[i-2]
b[i]=x
print((b[n]%(10**9+7))) | n,m=list(map(int,input().split()))
a = set(int(eval(input())) for i in range(m))
#for i in range(m):
# a.append(int(input()))
b=[0 for x in range(n+1)]
b[0]=1
for i in range(1,n+1):
if i in a:
continue
x=b[i-1]
if i>1:x+=b[i-2]
b[i]=x%(10**9+7)
print((b[n])) | 13 | 13 | 269 | 269 | n, m = list(map(int, input().split()))
a = set(int(eval(input())) for i in range(m))
# for i in range(m):
# a.append(int(input()))
b = [0 for x in range(n + 1)]
b[0] = 1
for i in range(1, n + 1):
if i in a:
continue
x = b[i - 1]
if i > 1:
x += b[i - 2]
b[i] = x
print((b[n] % (10**9 + 7)... | n, m = list(map(int, input().split()))
a = set(int(eval(input())) for i in range(m))
# for i in range(m):
# a.append(int(input()))
b = [0 for x in range(n + 1)]
b[0] = 1
for i in range(1, n + 1):
if i in a:
continue
x = b[i - 1]
if i > 1:
x += b[i - 2]
b[i] = x % (10**9 + 7)
print((b[n]... | false | 0 | [
"- b[i] = x",
"-print((b[n] % (10**9 + 7)))",
"+ b[i] = x % (10**9 + 7)",
"+print((b[n]))"
] | false | 0.041594 | 0.077358 | 0.537681 | [
"s594782504",
"s343242555"
] |
u285891772 | p03804 | python | s441601917 | s381252373 | 274 | 38 | 60,524 | 5,204 | Accepted | Accepted | 86.13 | import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, tan, asin, acos, atan, radians, degrees#, log2
from itertools import accumulate, permutations, combinations, combinations_with_replacement, product, groupby
from operator import itemgetter... | import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, tan, asin, acos, atan, radians, degrees#, log2
from itertools import accumulate, permutations, combinations, combinations_with_replacement, product, groupby
from operator import itemgetter... | 40 | 39 | 1,168 | 1,161 | import sys, re
from collections import deque, defaultdict, Counter
from math import (
ceil,
sqrt,
hypot,
factorial,
pi,
sin,
cos,
tan,
asin,
acos,
atan,
radians,
degrees,
) # , log2
from itertools import (
accumulate,
permutations,
combinations,
combi... | import sys, re
from collections import deque, defaultdict, Counter
from math import (
ceil,
sqrt,
hypot,
factorial,
pi,
sin,
cos,
tan,
asin,
acos,
atan,
radians,
degrees,
) # , log2
from itertools import (
accumulate,
permutations,
combinations,
combi... | false | 2.5 | [
"-flg = 1"
] | false | 0.04641 | 0.155629 | 0.298208 | [
"s441601917",
"s381252373"
] |
u188827677 | p02601 | python | s962765463 | s678254814 | 31 | 27 | 9,164 | 9,136 | Accepted | Accepted | 12.9 | a,b,c = list(map(int, input().split()))
k = int(eval(input()))
while a >= b:
b*= 2
k -= 1
while b >= c:
c*=2
k-=1
if a < b and b < c and k >= 0: print("Yes")
else: print("No") | a,b,c = list(map(int, input().split()))
k = int(eval(input()))
while b <= a:
b *= 2
k -= 1
while c <= b:
c *= 2
k -= 1
if k >= 0: print("Yes")
else: print("No") | 13 | 13 | 188 | 173 | a, b, c = list(map(int, input().split()))
k = int(eval(input()))
while a >= b:
b *= 2
k -= 1
while b >= c:
c *= 2
k -= 1
if a < b and b < c and k >= 0:
print("Yes")
else:
print("No")
| a, b, c = list(map(int, input().split()))
k = int(eval(input()))
while b <= a:
b *= 2
k -= 1
while c <= b:
c *= 2
k -= 1
if k >= 0:
print("Yes")
else:
print("No")
| false | 0 | [
"-while a >= b:",
"+while b <= a:",
"-while b >= c:",
"+while c <= b:",
"-if a < b and b < c and k >= 0:",
"+if k >= 0:"
] | false | 0.048607 | 0.044446 | 1.093623 | [
"s962765463",
"s678254814"
] |
u506132575 | p00055 | python | s342197697 | s096454820 | 20 | 10 | 4,240 | 4,232 | Accepted | Accepted | 50 | while True:
try:
n = float(input())
d = [0]*10
d[0] = n
for i in range(1,10):
if i%2 == 0: d[i] = d[i-1]/3
else: d[i] = d[i-1]*2
print(round(sum(d),8))
except:
break | while True:
try:
n = float(input())
d,c = n,n
for i in range(1,10):
if i%2 == 0: c = c/3
else: c = c*2
d += c
print(round(d,8))
except:
break | 11 | 11 | 259 | 239 | while True:
try:
n = float(input())
d = [0] * 10
d[0] = n
for i in range(1, 10):
if i % 2 == 0:
d[i] = d[i - 1] / 3
else:
d[i] = d[i - 1] * 2
print(round(sum(d), 8))
except:
break
| while True:
try:
n = float(input())
d, c = n, n
for i in range(1, 10):
if i % 2 == 0:
c = c / 3
else:
c = c * 2
d += c
print(round(d, 8))
except:
break
| false | 0 | [
"- d = [0] * 10",
"- d[0] = n",
"+ d, c = n, n",
"- d[i] = d[i - 1] / 3",
"+ c = c / 3",
"- d[i] = d[i - 1] * 2",
"- print(round(sum(d), 8))",
"+ c = c * 2",
"+ d += c",
"+ print(round(d, 8))"... | false | 0.032974 | 0.035467 | 0.92971 | [
"s342197697",
"s096454820"
] |
u143492911 | p03797 | python | s191518198 | s259743151 | 22 | 17 | 3,316 | 2,940 | Accepted | Accepted | 22.73 | n,m=list(map(int,input().split()))
if m<=2*n:
print((m//2))
else:
v=m-2*n
print((v//4+(n)))
| n,m=list(map(int,input().split()))
if m<=2*n:
print((m//2))
else:
res=m-2*n
print((n+res//4))
| 7 | 7 | 104 | 107 | n, m = list(map(int, input().split()))
if m <= 2 * n:
print((m // 2))
else:
v = m - 2 * n
print((v // 4 + (n)))
| n, m = list(map(int, input().split()))
if m <= 2 * n:
print((m // 2))
else:
res = m - 2 * n
print((n + res // 4))
| false | 0 | [
"- v = m - 2 * n",
"- print((v // 4 + (n)))",
"+ res = m - 2 * n",
"+ print((n + res // 4))"
] | false | 0.046822 | 0.124612 | 0.375746 | [
"s191518198",
"s259743151"
] |
u360116509 | p03285 | python | s542197046 | s890552925 | 224 | 18 | 2,940 | 2,940 | Accepted | Accepted | 91.96 | def check(n):
if n == 0:
return True
if 0 > n:
return False
return any([check(n - 4), check(n - 7)])
def main():
if check(int(eval(input()))) is True:
print('Yes')
else:
print('No')
main()
| def main():
N = int(eval(input()))
flg = False
for n in range(N // 7 + 1):
if (N - 7 * n) % 4 == 0:
flg = True
break
if flg is True:
print('Yes')
else:
print('No')
main()
| 16 | 14 | 254 | 248 | def check(n):
if n == 0:
return True
if 0 > n:
return False
return any([check(n - 4), check(n - 7)])
def main():
if check(int(eval(input()))) is True:
print("Yes")
else:
print("No")
main()
| def main():
N = int(eval(input()))
flg = False
for n in range(N // 7 + 1):
if (N - 7 * n) % 4 == 0:
flg = True
break
if flg is True:
print("Yes")
else:
print("No")
main()
| false | 12.5 | [
"-def check(n):",
"- if n == 0:",
"- return True",
"- if 0 > n:",
"- return False",
"- return any([check(n - 4), check(n - 7)])",
"-",
"-",
"- if check(int(eval(input()))) is True:",
"+ N = int(eval(input()))",
"+ flg = False",
"+ for n in range(N // 7 + 1):"... | false | 0.118782 | 0.037387 | 3.177082 | [
"s542197046",
"s890552925"
] |
u841568901 | p03076 | python | s482786441 | s410758998 | 28 | 25 | 9,016 | 9,108 | Accepted | Accepted | 10.71 | import math
X = [int(eval(input())) for _ in range(5)]
t = 0
m = 100
for x in X:
t += (math.ceil(x/10))*10
if x%10 != 0:
m = min(m, x%10)
print((t+m-10 if m!=100 else t)) | from itertools import permutations
import math
X = [int(eval(input())) for _ in range(5)]
Time = lambda X: sum(math.ceil(X[i]/10)*10 for i in range(4))+X[-1]
print((min(Time(x) for x in permutations(X)))) | 9 | 5 | 178 | 200 | import math
X = [int(eval(input())) for _ in range(5)]
t = 0
m = 100
for x in X:
t += (math.ceil(x / 10)) * 10
if x % 10 != 0:
m = min(m, x % 10)
print((t + m - 10 if m != 100 else t))
| from itertools import permutations
import math
X = [int(eval(input())) for _ in range(5)]
Time = lambda X: sum(math.ceil(X[i] / 10) * 10 for i in range(4)) + X[-1]
print((min(Time(x) for x in permutations(X))))
| false | 44.444444 | [
"+from itertools import permutations",
"-t = 0",
"-m = 100",
"-for x in X:",
"- t += (math.ceil(x / 10)) * 10",
"- if x % 10 != 0:",
"- m = min(m, x % 10)",
"-print((t + m - 10 if m != 100 else t))",
"+Time = lambda X: sum(math.ceil(X[i] / 10) * 10 for i in range(4)) + X[-1]",
"+print... | false | 0.03446 | 0.043788 | 0.786973 | [
"s482786441",
"s410758998"
] |
u970348538 | p02667 | python | s953488451 | s206160705 | 104 | 92 | 19,976 | 9,380 | Accepted | Accepted | 11.54 | t = eval(input())
before_is_zero = True
keeped_ones = 0
n0 = 0
ones = [0] * int(1e5+1) # (number of zeros before 1, is_odd)
ones_index = 0
for i, x in enumerate(t):
if x == '0':
n0 += 1
before_is_zero = True
elif x == '1':
if before_is_zero:
ones[ones_index] = (n0... | t = eval(input())
before_is_zero = True
n0 = 0
n1 = 0
keeped_1 = 0
ans = 0
for i, x in enumerate(t):
if x == '0':
n0 += 1
before_is_zero = True
elif x == '1':
if before_is_zero:
tmp_add = -(n0 - (i+1)%2)//2
ans += tmp_add
n1 += 1
... | 30 | 24 | 802 | 542 | t = eval(input())
before_is_zero = True
keeped_ones = 0
n0 = 0
ones = [0] * int(1e5 + 1) # (number of zeros before 1, is_odd)
ones_index = 0
for i, x in enumerate(t):
if x == "0":
n0 += 1
before_is_zero = True
elif x == "1":
if before_is_zero:
ones[ones_index] = (n0, (i + 1)... | t = eval(input())
before_is_zero = True
n0 = 0
n1 = 0
keeped_1 = 0
ans = 0
for i, x in enumerate(t):
if x == "0":
n0 += 1
before_is_zero = True
elif x == "1":
if before_is_zero:
tmp_add = -(n0 - (i + 1) % 2) // 2
ans += tmp_add
n1 += 1
befo... | false | 20 | [
"-keeped_ones = 0",
"-ones = [0] * int(1e5 + 1) # (number of zeros before 1, is_odd)",
"-ones_index = 0",
"+n1 = 0",
"+keeped_1 = 0",
"+ans = 0",
"- ones[ones_index] = (n0, (i + 1) % 2)",
"- ones_index += 1",
"+ tmp_add = -(n0 - (i + 1) % 2) // 2",
"+ a... | false | 0.071732 | 0.129368 | 0.554484 | [
"s953488451",
"s206160705"
] |
u144913062 | p02807 | python | s009669422 | s564738658 | 1,301 | 770 | 88,464 | 15,020 | Accepted | Accepted | 40.81 | import sys
sys.setrecursionlimit(10**6)
def mod_inverse(n, mod=10**9+7):
return pow(n, mod-2, mod)
def combination(n, k, mod=10**9+7):
numer = denom = 1
for i in range(k):
numer = (numer * (n-i)) % mod
denom = (denom * (i+1)) % mod
return (numer * mod_inverse(denom, mod)... | from math import factorial
mod = 10**9+7
N = int(eval(input()))
x = [0] + list(map(int, input().split()))
ans = 0
inv = [0] + [pow(i, mod-2, mod) for i in range(1, N)]
for k in range(2, N):
ans = (ans + x[k] * (1 - inv[k])) % mod
for k in range(1, N-1):
ans = (ans - x[k] * (1 - inv[N-k])) % mod
... | 39 | 20 | 817 | 438 | import sys
sys.setrecursionlimit(10**6)
def mod_inverse(n, mod=10**9 + 7):
return pow(n, mod - 2, mod)
def combination(n, k, mod=10**9 + 7):
numer = denom = 1
for i in range(k):
numer = (numer * (n - i)) % mod
denom = (denom * (i + 1)) % mod
return (numer * mod_inverse(denom, mod)) ... | from math import factorial
mod = 10**9 + 7
N = int(eval(input()))
x = [0] + list(map(int, input().split()))
ans = 0
inv = [0] + [pow(i, mod - 2, mod) for i in range(1, N)]
for k in range(2, N):
ans = (ans + x[k] * (1 - inv[k])) % mod
for k in range(1, N - 1):
ans = (ans - x[k] * (1 - inv[N - k])) % mod
for k i... | false | 48.717949 | [
"-import sys",
"-",
"-sys.setrecursionlimit(10**6)",
"-",
"-",
"-def mod_inverse(n, mod=10**9 + 7):",
"- return pow(n, mod - 2, mod)",
"-",
"-",
"-def combination(n, k, mod=10**9 + 7):",
"- numer = denom = 1",
"- for i in range(k):",
"- numer = (numer * (n - i)) % mod",
"- ... | false | 0.036508 | 0.03601 | 1.013824 | [
"s009669422",
"s564738658"
] |
u738898077 | p02912 | python | s126715152 | s077068137 | 192 | 160 | 14,480 | 14,180 | Accepted | Accepted | 16.67 | import sys
n,m = list(map(int,input().split()))
lst_a = list(map(int,input().split()))
temp = 0
cnt = 0
loop = 0
debug = 0
if n == 1:
for i in range(m):
lst_a[0] //= 2
print((lst_a[0]))
sys.exit()
while debug < 10:
loop = 0
temp = 0
lst_a.sort(reverse=True)
while loop... | import heapq
n,m = list(map(int,input().split()))
a = list(map(int,input().split()))
for i in range(n):
a[i] = -a[i]
heapq.heapify(a)
ans = 0
for i in range(m):
temp = (heapq.heappop(a)+1)//2
heapq.heappush(a,temp)
print((-sum(a))) | 29 | 11 | 637 | 245 | import sys
n, m = list(map(int, input().split()))
lst_a = list(map(int, input().split()))
temp = 0
cnt = 0
loop = 0
debug = 0
if n == 1:
for i in range(m):
lst_a[0] //= 2
print((lst_a[0]))
sys.exit()
while debug < 10:
loop = 0
temp = 0
lst_a.sort(reverse=True)
while loop < n - 1:
... | import heapq
n, m = list(map(int, input().split()))
a = list(map(int, input().split()))
for i in range(n):
a[i] = -a[i]
heapq.heapify(a)
ans = 0
for i in range(m):
temp = (heapq.heappop(a) + 1) // 2
heapq.heappush(a, temp)
print((-sum(a)))
| false | 62.068966 | [
"-import sys",
"+import heapq",
"-lst_a = list(map(int, input().split()))",
"-temp = 0",
"-cnt = 0",
"-loop = 0",
"-debug = 0",
"-if n == 1:",
"- for i in range(m):",
"- lst_a[0] //= 2",
"- print((lst_a[0]))",
"- sys.exit()",
"-while debug < 10:",
"- loop = 0",
"- t... | false | 0.039567 | 0.042502 | 0.930932 | [
"s126715152",
"s077068137"
] |
u226849101 | p02724 | python | s728141045 | s567507620 | 362 | 17 | 2,940 | 2,940 | Accepted | Accepted | 95.3 | n=int(eval(input()))
k = 0
l = 0
while n>=500:
n = n-500
k = k+1
while n>5:
n -= 5 #n=n-5
l += 1
print((k*1000+ l*5 )) | n=int(eval(input()))
k = n//500
l = (n-500*k)//5
print((k*1000+ l*5 )) | 15 | 6 | 142 | 70 | n = int(eval(input()))
k = 0
l = 0
while n >= 500:
n = n - 500
k = k + 1
while n > 5:
n -= 5 # n=n-5
l += 1
print((k * 1000 + l * 5))
| n = int(eval(input()))
k = n // 500
l = (n - 500 * k) // 5
print((k * 1000 + l * 5))
| false | 60 | [
"-k = 0",
"-l = 0",
"-while n >= 500:",
"- n = n - 500",
"- k = k + 1",
"-while n > 5:",
"- n -= 5 # n=n-5",
"- l += 1",
"+k = n // 500",
"+l = (n - 500 * k) // 5"
] | false | 0.215146 | 0.03597 | 5.981299 | [
"s728141045",
"s567507620"
] |
u226155577 | p03033 | python | s350303234 | s878836306 | 1,466 | 1,218 | 120,784 | 75,220 | Accepted | Accepted | 16.92 | from heapq import heappush, heappop
import sys, os
from __pypy__ import builders
readline = sys.stdin.readline
N, Q = list(map(int, readline().split()))
qs = [0]*N
for i in range(N):
s, t, x = list(map(int, readline().split()))
qs[i] = (s-x, t-x, x)
qs.sort()
b = builders.StringBuilder(Q*11)
que = ... | from heapq import heappush, heappop
import sys
readline = sys.stdin.readline
N, Q = list(map(int, readline().split()))
ans = [None]*Q
def solve(readline=readline):
qs = [0]*(N+1)
for i in range(N):
s, t, x = list(map(int, readline().split()))
qs[i] = (s-x, t-x, x)
qs[N] = (10**10... | 27 | 35 | 653 | 853 | from heapq import heappush, heappop
import sys, os
from __pypy__ import builders
readline = sys.stdin.readline
N, Q = list(map(int, readline().split()))
qs = [0] * N
for i in range(N):
s, t, x = list(map(int, readline().split()))
qs[i] = (s - x, t - x, x)
qs.sort()
b = builders.StringBuilder(Q * 11)
que = []
D... | from heapq import heappush, heappop
import sys
readline = sys.stdin.readline
N, Q = list(map(int, readline().split()))
ans = [None] * Q
def solve(readline=readline):
qs = [0] * (N + 1)
for i in range(N):
s, t, x = list(map(int, readline().split()))
qs[i] = (s - x, t - x, x)
qs[N] = (10**1... | false | 22.857143 | [
"-import sys, os",
"-from __pypy__ import builders",
"+import sys",
"-qs = [0] * N",
"-for i in range(N):",
"- s, t, x = list(map(int, readline().split()))",
"- qs[i] = (s - x, t - x, x)",
"-qs.sort()",
"-b = builders.StringBuilder(Q * 11)",
"-que = []",
"-D = [int(readline()) for i in ran... | false | 0.057027 | 0.055777 | 1.022413 | [
"s350303234",
"s878836306"
] |
u094999522 | p03836 | python | s633981436 | s058144293 | 34 | 30 | 9,332 | 9,044 | Accepted | Accepted | 11.76 | #!/usr/bin/env python3
sx, sy, tx, ty = map(int, input().split())
x = tx - sx
y = ty - sy
h = abs(sx - tx)
v = abs(sy - ty)
ans = [[1, 0]] * h + [[0, 1]] * v + [[-1, 0]] * h + [[0, -1]] * v
ans += [[0, -1]] + [[1, 0]] * -~h + [[0, 1]] * -~v + [[-1, 0]]
ans += [[0, 1]] + [[-1, 0]] * -~h + [[0, -1]] * -~v + [[1, ... | sx, sy, tx, ty = list(map(int, input().split()))
x = tx - sx
y = ty - sy
ans = ("R" * x + "U" * y + "L" * x + "D" * y + "D" + "R" * -~x + "U" * -~y +
"L" + "U" + "L" * -~x + "D" * -~y + "R")
print(ans)
| 19 | 6 | 541 | 208 | #!/usr/bin/env python3
sx, sy, tx, ty = map(int, input().split())
x = tx - sx
y = ty - sy
h = abs(sx - tx)
v = abs(sy - ty)
ans = [[1, 0]] * h + [[0, 1]] * v + [[-1, 0]] * h + [[0, -1]] * v
ans += [[0, -1]] + [[1, 0]] * -~h + [[0, 1]] * -~v + [[-1, 0]]
ans += [[0, 1]] + [[-1, 0]] * -~h + [[0, -1]] * -~v + [[1, 0]]
for ... | sx, sy, tx, ty = list(map(int, input().split()))
x = tx - sx
y = ty - sy
ans = (
"R" * x
+ "U" * y
+ "L" * x
+ "D" * y
+ "D"
+ "R" * -~x
+ "U" * -~y
+ "L"
+ "U"
+ "L" * -~x
+ "D" * -~y
+ "R"
)
print(ans)
| false | 68.421053 | [
"-#!/usr/bin/env python3",
"-sx, sy, tx, ty = map(int, input().split())",
"+sx, sy, tx, ty = list(map(int, input().split()))",
"-h = abs(sx - tx)",
"-v = abs(sy - ty)",
"-ans = [[1, 0]] * h + [[0, 1]] * v + [[-1, 0]] * h + [[0, -1]] * v",
"-ans += [[0, -1]] + [[1, 0]] * -~h + [[0, 1]] * -~v + [[-1, 0]]"... | false | 0.035885 | 0.042616 | 0.842067 | [
"s633981436",
"s058144293"
] |
u073549161 | p03407 | python | s020997927 | s769202975 | 173 | 17 | 38,384 | 3,064 | Accepted | Accepted | 90.17 | a,b,c = list(map(int, input().split()))
if (a+b) >= c:
print("Yes")
else:
print("No") | a,b,c = list(map(int, input().split()))
print(("Yes" if a+b >= c else "No")) | 5 | 2 | 91 | 69 | a, b, c = list(map(int, input().split()))
if (a + b) >= c:
print("Yes")
else:
print("No")
| a, b, c = list(map(int, input().split()))
print(("Yes" if a + b >= c else "No"))
| false | 60 | [
"-if (a + b) >= c:",
"- print(\"Yes\")",
"-else:",
"- print(\"No\")",
"+print((\"Yes\" if a + b >= c else \"No\"))"
] | false | 0.035889 | 0.035756 | 1.003712 | [
"s020997927",
"s769202975"
] |
u070201429 | p02574 | python | s633519938 | s199419353 | 580 | 273 | 126,916 | 189,020 | Accepted | Accepted | 52.93 | class Prime():
def __init__(self, n):
self.p = [] # self.p[i] = i番目の素数 < n
self.d = [0] * n # self.d[i] = iを割り切る最小の素数
# エラトステネスの篩
for i in range(2, n):
if self.d[i] == 0:
self.p.append(i)
for j in range(i, n, i):
... | class Prime():
def __init__(self, n):
self.p = [] # self.p[i] = i番目の素数 < n
self.d = [0] * n # self.d[i] = iを割り切る最小の素数
# エラトステネスの篩
for i in range(2, n):
if self.d[i] == 0:
self.p.append(i)
for j in range(i, n, i):
... | 66 | 66 | 1,596 | 1,621 | class Prime:
def __init__(self, n):
self.p = [] # self.p[i] = i番目の素数 < n
self.d = [0] * n # self.d[i] = iを割り切る最小の素数
# エラトステネスの篩
for i in range(2, n):
if self.d[i] == 0:
self.p.append(i)
for j in range(i, n, i):
if self... | class Prime:
def __init__(self, n):
self.p = [] # self.p[i] = i番目の素数 < n
self.d = [0] * n # self.d[i] = iを割り切る最小の素数
# エラトステネスの篩
for i in range(2, n):
if self.d[i] == 0:
self.p.append(i)
for j in range(i, n, i):
if self... | false | 0 | [
"- for i in range(1, n):",
"- g = gcd(g, a[i])",
"+ for i in a:",
"+ g = gcd(g, i)",
"- tf = [False] * p.num_prime()",
"+ tf = [False] * p.num_prime() # tf[i] == True: i番目の素数を素因数とするものが存在する"
] | false | 0.624238 | 1.489124 | 0.419198 | [
"s633519938",
"s199419353"
] |
u753803401 | p03805 | python | s102722674 | s327535383 | 430 | 392 | 58,584 | 75,860 | Accepted | Accepted | 8.84 | def slove():
import sys
import collections
import copy
input = sys.stdin.readline
n, m = list(map(int, input().rstrip('\n').split()))
ab = collections.defaultdict(list)
for i in range(m):
a, b = list(map(int, input().rstrip('\n').split()))
ab[a] += [b]
ab[b]... | def slove():
import sys
import bisect
import collections
import copy
import fractions
import heapq
input = sys.stdin.readline
n, m = list(map(int, input().rstrip('\n').split()))
d = collections.defaultdict(list)
for i in range(m):
a, b = list(map(int, input().r... | 33 | 36 | 862 | 921 | def slove():
import sys
import collections
import copy
input = sys.stdin.readline
n, m = list(map(int, input().rstrip("\n").split()))
ab = collections.defaultdict(list)
for i in range(m):
a, b = list(map(int, input().rstrip("\n").split()))
ab[a] += [b]
ab[b] += [a]
... | def slove():
import sys
import bisect
import collections
import copy
import fractions
import heapq
input = sys.stdin.readline
n, m = list(map(int, input().rstrip("\n").split()))
d = collections.defaultdict(list)
for i in range(m):
a, b = list(map(int, input().rstrip("\n"... | false | 8.333333 | [
"+ import bisect",
"+ import fractions",
"+ import heapq",
"- ab = collections.defaultdict(list)",
"+ d = collections.defaultdict(list)",
"- ab[a] += [b]",
"- ab[b] += [a]",
"- td = collections.defaultdict(list)",
"- td[1]",
"- q = [[1, td]]",
"- ans = []... | false | 0.038676 | 0.044524 | 0.868661 | [
"s102722674",
"s327535383"
] |
u759412327 | p03804 | python | s621965925 | s240540044 | 327 | 170 | 21,212 | 12,416 | Accepted | Accepted | 48.01 | import numpy as np
N,M = list(map(int,input().split()))
A = np.array([list(eval(input())) for _ in range(N)])
B = np.array([list(eval(input())) for _ in range(M)])
bl = False
for i in range(N-M+1):
for j in range(N-M+1):
if (A[i:i+M,j:j+M] == B).all():
bl = True
answer = 'Yes' if bl else 'No'... | import numpy as np
N,M = list(map(int,input().split()))
A = np.array([list(eval(input())) for i in range(N)])
B = np.array([list(eval(input())) for i in range(M)])
f = False
for i in range(N-M+1):
for j in range(N-M+1):
if (A[i:i+M,j:j+M]==B).all():
f = True
if f:
print("Yes")
else:
pr... | 14 | 16 | 318 | 312 | import numpy as np
N, M = list(map(int, input().split()))
A = np.array([list(eval(input())) for _ in range(N)])
B = np.array([list(eval(input())) for _ in range(M)])
bl = False
for i in range(N - M + 1):
for j in range(N - M + 1):
if (A[i : i + M, j : j + M] == B).all():
bl = True
answer = "Yes... | import numpy as np
N, M = list(map(int, input().split()))
A = np.array([list(eval(input())) for i in range(N)])
B = np.array([list(eval(input())) for i in range(M)])
f = False
for i in range(N - M + 1):
for j in range(N - M + 1):
if (A[i : i + M, j : j + M] == B).all():
f = True
if f:
print... | false | 12.5 | [
"-A = np.array([list(eval(input())) for _ in range(N)])",
"-B = np.array([list(eval(input())) for _ in range(M)])",
"-bl = False",
"+A = np.array([list(eval(input())) for i in range(N)])",
"+B = np.array([list(eval(input())) for i in range(M)])",
"+f = False",
"- bl = True",
"-answer = \"Ye... | false | 0.255644 | 0.251217 | 1.017619 | [
"s621965925",
"s240540044"
] |
u573754721 | p02934 | python | s530353553 | s313096685 | 164 | 19 | 38,256 | 3,064 | Accepted | Accepted | 88.41 | import sys
input = sys.stdin.readline
N = int(eval(input()))
lis_a = list(map(int, input().split()))
c = 0
for i in lis_a:
c += 1/i
print((1/c))
| n=int(eval(input()))
a=list(map(int,input().split()))
s=0
for i in range(n):
s+=1/a[i]
print((1/s)) | 11 | 6 | 154 | 102 | import sys
input = sys.stdin.readline
N = int(eval(input()))
lis_a = list(map(int, input().split()))
c = 0
for i in lis_a:
c += 1 / i
print((1 / c))
| n = int(eval(input()))
a = list(map(int, input().split()))
s = 0
for i in range(n):
s += 1 / a[i]
print((1 / s))
| false | 45.454545 | [
"-import sys",
"-",
"-input = sys.stdin.readline",
"-N = int(eval(input()))",
"-lis_a = list(map(int, input().split()))",
"-c = 0",
"-for i in lis_a:",
"- c += 1 / i",
"-print((1 / c))",
"+n = int(eval(input()))",
"+a = list(map(int, input().split()))",
"+s = 0",
"+for i in range(n):",
... | false | 0.038465 | 0.108032 | 0.356047 | [
"s530353553",
"s313096685"
] |
u893063840 | p03212 | python | s072580756 | s090984170 | 52 | 28 | 9,124 | 9,256 | Accepted | Accepted | 46.15 | from itertools import product
n = int(eval(input()))
ans = 0
for i in range(1, 10):
for pat in product("357", repeat=i):
num = "".join(pat)
st = set(num)
if int(num) <= n and st == {"3", "5", "7"}:
ans += 1
print(ans)
| n = eval(input())
d = {3: 0b001, 5: 0b010, 7: 0b100}
dp = [[[0] * 2 for _ in range(1 << 3)] for _ in range(len(n) + 1)]
dp[0][0][1] = 1
for i, e in enumerate(n):
e = int(e)
for num in [0, 3, 5, 7]:
if num == 0:
dp[i+1][0b000][0] += sum(dp[i][0b000])
continue
... | 13 | 24 | 267 | 597 | from itertools import product
n = int(eval(input()))
ans = 0
for i in range(1, 10):
for pat in product("357", repeat=i):
num = "".join(pat)
st = set(num)
if int(num) <= n and st == {"3", "5", "7"}:
ans += 1
print(ans)
| n = eval(input())
d = {3: 0b001, 5: 0b010, 7: 0b100}
dp = [[[0] * 2 for _ in range(1 << 3)] for _ in range(len(n) + 1)]
dp[0][0][1] = 1
for i, e in enumerate(n):
e = int(e)
for num in [0, 3, 5, 7]:
if num == 0:
dp[i + 1][0b000][0] += sum(dp[i][0b000])
continue
for j in ra... | false | 45.833333 | [
"-from itertools import product",
"-",
"-n = int(eval(input()))",
"-ans = 0",
"-for i in range(1, 10):",
"- for pat in product(\"357\", repeat=i):",
"- num = \"\".join(pat)",
"- st = set(num)",
"- if int(num) <= n and st == {\"3\", \"5\", \"7\"}:",
"- ans += 1",
... | false | 0.104121 | 0.053847 | 1.933633 | [
"s072580756",
"s090984170"
] |
u227082700 | p02744 | python | s259349183 | s892696963 | 238 | 149 | 4,412 | 12,704 | Accepted | Accepted | 37.39 | n=int(eval(input()))
def b(s):
if len(s)==n:
print(s)
return
for i in "abcdefghijklmnopqrstuvwxyz":
b(s+i)
if max(list(s))==chr(ord(i)-1):return
b("a") | t="abcdefghijklmnopqrstuvwxyz"
n=int(eval(input()))
ans=[]
def dfs(s):
global ans
if len(s)==n:
ans.append(s)
return
for i in range(len(set(s))+1):dfs(s+t[i])
return
dfs("")
ans.sort()
for i in ans:print(i) | 9 | 13 | 173 | 229 | n = int(eval(input()))
def b(s):
if len(s) == n:
print(s)
return
for i in "abcdefghijklmnopqrstuvwxyz":
b(s + i)
if max(list(s)) == chr(ord(i) - 1):
return
b("a")
| t = "abcdefghijklmnopqrstuvwxyz"
n = int(eval(input()))
ans = []
def dfs(s):
global ans
if len(s) == n:
ans.append(s)
return
for i in range(len(set(s)) + 1):
dfs(s + t[i])
return
dfs("")
ans.sort()
for i in ans:
print(i)
| false | 30.769231 | [
"+t = \"abcdefghijklmnopqrstuvwxyz\"",
"+ans = []",
"-def b(s):",
"+def dfs(s):",
"+ global ans",
"- print(s)",
"+ ans.append(s)",
"- for i in \"abcdefghijklmnopqrstuvwxyz\":",
"- b(s + i)",
"- if max(list(s)) == chr(ord(i) - 1):",
"- return",
"+ ... | false | 0.038047 | 0.045109 | 0.843447 | [
"s259349183",
"s892696963"
] |
u561231954 | p03557 | python | s116599355 | s906523908 | 430 | 360 | 31,464 | 31,476 | Accepted | Accepted | 16.28 | def main():
import numpy as np
n=int(eval(input()))
c=list(map(int,input().split()))
b=list(map(int,input().split()))
a=list(map(int,input().split()))
a.sort()
b.sort()
c.sort()
a=np.array(a)
b=np.array(b)
c=np.array(c)
cnt_a=np.searchsorted(b,a).tolist()
... | def main():
import numpy as np
n=int(eval(input()))
a=list(map(int,input().split()))
b=list(map(int,input().split()))
c=list(map(int,input().split()))
a.sort()
b.sort()
c.sort()
a=np.array(a)
b=np.array(b)
c=np.array(c)
cnt_a=np.searchsorted(a,b)
cnt_c=... | 23 | 18 | 510 | 419 | def main():
import numpy as np
n = int(eval(input()))
c = list(map(int, input().split()))
b = list(map(int, input().split()))
a = list(map(int, input().split()))
a.sort()
b.sort()
c.sort()
a = np.array(a)
b = np.array(b)
c = np.array(c)
cnt_a = np.searchsorted(b, a).toli... | def main():
import numpy as np
n = int(eval(input()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
c = list(map(int, input().split()))
a.sort()
b.sort()
c.sort()
a = np.array(a)
b = np.array(b)
c = np.array(c)
cnt_a = np.searchsorted(a, b)
... | false | 21.73913 | [
"+ a = list(map(int, input().split()))",
"+ b = list(map(int, input().split()))",
"- b = list(map(int, input().split()))",
"- a = list(map(int, input().split()))",
"- cnt_a = np.searchsorted(b, a).tolist()",
"- cnt_b = np.searchsorted(c, b).tolist()",
"- ans, j = 0, 0",
"- for ... | false | 0.161878 | 0.20045 | 0.807572 | [
"s116599355",
"s906523908"
] |
u633068244 | p00663 | python | s274591929 | s125961000 | 70 | 60 | 4,216 | 4,224 | Accepted | Accepted | 14.29 | while 1:
exps=input().split("|")
if exps[0]=="#":break
for i in range(len(exps)):
v=True
lits=exps[i][1:-1].split("&")
for lit1 in lits:
for lit2 in lits:
if (lit1=="~"+lit2) or ("~"+lit1==lit2):
v=False
if v:
print("yes")
break
else:
print("no")
| while 1:
exps=input().split("|")
if exps[0]=="#":break
for exp in exps:
v=1
lit=exp[1:-1].split("&")
for i in range(2):
for j in range(i+1,3):
if (lit[i]=="~"+lit[j]) or ("~"+lit[i]==lit[j]):
v=0
if v:
print("yes")
break
else:
print("no")
| 16 | 16 | 298 | 290 | while 1:
exps = input().split("|")
if exps[0] == "#":
break
for i in range(len(exps)):
v = True
lits = exps[i][1:-1].split("&")
for lit1 in lits:
for lit2 in lits:
if (lit1 == "~" + lit2) or ("~" + lit1 == lit2):
v = False
... | while 1:
exps = input().split("|")
if exps[0] == "#":
break
for exp in exps:
v = 1
lit = exp[1:-1].split("&")
for i in range(2):
for j in range(i + 1, 3):
if (lit[i] == "~" + lit[j]) or ("~" + lit[i] == lit[j]):
v = 0
if... | false | 0 | [
"- for i in range(len(exps)):",
"- v = True",
"- lits = exps[i][1:-1].split(\"&\")",
"- for lit1 in lits:",
"- for lit2 in lits:",
"- if (lit1 == \"~\" + lit2) or (\"~\" + lit1 == lit2):",
"- v = False",
"+ for exp in exps:",
"+... | false | 0.035336 | 0.105828 | 0.333904 | [
"s274591929",
"s125961000"
] |
u095021077 | p02988 | python | s525616447 | s787105595 | 189 | 17 | 38,384 | 3,060 | Accepted | Accepted | 91.01 | N=int(eval(input()))
temp=input().split()
p=[int(temp[i]) for i in range(N)]
counter=0
for i in range(1, N-1):
if (p[i]-p[i-1])*(p[i]-p[i+1])<0:
counter+=1
print(counter) | n=int(eval(input()))
p=list(map(int, input().split()))
counter=0
for i in range(1, n-1):
if (p[i]-p[i-1])*(p[i]-p[i+1])<0:
counter+=1
print((int(counter))) | 10 | 9 | 185 | 167 | N = int(eval(input()))
temp = input().split()
p = [int(temp[i]) for i in range(N)]
counter = 0
for i in range(1, N - 1):
if (p[i] - p[i - 1]) * (p[i] - p[i + 1]) < 0:
counter += 1
print(counter)
| n = int(eval(input()))
p = list(map(int, input().split()))
counter = 0
for i in range(1, n - 1):
if (p[i] - p[i - 1]) * (p[i] - p[i + 1]) < 0:
counter += 1
print((int(counter)))
| false | 10 | [
"-N = int(eval(input()))",
"-temp = input().split()",
"-p = [int(temp[i]) for i in range(N)]",
"+n = int(eval(input()))",
"+p = list(map(int, input().split()))",
"-for i in range(1, N - 1):",
"+for i in range(1, n - 1):",
"-print(counter)",
"+print((int(counter)))"
] | false | 0.125175 | 0.035725 | 3.503824 | [
"s525616447",
"s787105595"
] |
u226108478 | p03044 | python | s497471512 | s688103545 | 667 | 545 | 38,292 | 44,808 | Accepted | Accepted | 18.29 | # -*- coding: utf-8 -*-
def main():
from collections import deque
n = int(eval(input()))
to = [[] for _ in range(n)]
cost = [[] for _ in range(n)]
for i in range(n - 1):
ui, vi, wi = list(map(int, input().split()))
ui -= 1
vi -= 1
to[ui].append(vi)
... | # -*- coding: utf-8 -*-
def main():
from collections import deque
n = int(eval(input()))
graph = [[] for _ in range(n)]
# See:
# https://www.youtube.com/watch?v=26AWkQNRb-A
# https://atcoder.jp/contests/abc126/submissions/5456359
for i in range(n - 1):
ui, vi, wi = l... | 43 | 39 | 830 | 819 | # -*- coding: utf-8 -*-
def main():
from collections import deque
n = int(eval(input()))
to = [[] for _ in range(n)]
cost = [[] for _ in range(n)]
for i in range(n - 1):
ui, vi, wi = list(map(int, input().split()))
ui -= 1
vi -= 1
to[ui].append(vi)
to[vi].app... | # -*- coding: utf-8 -*-
def main():
from collections import deque
n = int(eval(input()))
graph = [[] for _ in range(n)]
# See:
# https://www.youtube.com/watch?v=26AWkQNRb-A
# https://atcoder.jp/contests/abc126/submissions/5456359
for i in range(n - 1):
ui, vi, wi = list(map(int, inp... | false | 9.302326 | [
"- to = [[] for _ in range(n)]",
"- cost = [[] for _ in range(n)]",
"+ graph = [[] for _ in range(n)]",
"+ # See:",
"+ # https://www.youtube.com/watch?v=26AWkQNRb-A",
"+ # https://atcoder.jp/contests/abc126/submissions/5456359",
"- to[ui].append(vi)",
"- to[vi].append(u... | false | 0.060763 | 0.037314 | 1.628422 | [
"s497471512",
"s688103545"
] |
u657361950 | p02274 | python | s534786001 | s555165178 | 1,530 | 1,390 | 27,480 | 27,476 | Accepted | Accepted | 9.15 | import sys
cnt = 0
def merge_sort(a, left, right):
if left + 1 < right:
mid = int(left + (right - left) / 2)
merge_sort(a, left, mid)
merge_sort(a, mid, right)
merge(a, left, mid, right)
def merge(a, left, mid, right):
n1 = mid - left
n2 = right - mid
L = a[left:left + n1]
R = a[mid:mid + n... | import sys
cnt = 0
def merge_sort(a, left, right):
if left + 1 < right:
mid = int(left + (right - left) / 2)
merge_sort(a, left, mid)
merge_sort(a, mid, right)
merge(a, left, mid, right)
def merge(a, left, mid, right):
n1 = mid - left
n2 = right - mid
L = a[left:left+n1]
R = a[mid:mid+n2]
... | 33 | 34 | 655 | 641 | import sys
cnt = 0
def merge_sort(a, left, right):
if left + 1 < right:
mid = int(left + (right - left) / 2)
merge_sort(a, left, mid)
merge_sort(a, mid, right)
merge(a, left, mid, right)
def merge(a, left, mid, right):
n1 = mid - left
n2 = right - mid
L = a[left : le... | import sys
cnt = 0
def merge_sort(a, left, right):
if left + 1 < right:
mid = int(left + (right - left) / 2)
merge_sort(a, left, mid)
merge_sort(a, mid, right)
merge(a, left, mid, right)
def merge(a, left, mid, right):
n1 = mid - left
n2 = right - mid
L = a[left : le... | false | 2.941176 | [
"- if L[i] != sys.maxsize:",
"+ if i < n1:"
] | false | 0.090173 | 0.037342 | 2.414767 | [
"s534786001",
"s555165178"
] |
u740284863 | p03341 | python | s661121018 | s723160708 | 267 | 231 | 20,248 | 20,376 | Accepted | Accepted | 13.48 | from itertools import accumulate
n = int(eval(input()))
s = str(eval(input()))
tt = [1 if i == "W" else 0 for i in s]
B = [0] + tt
B = list(accumulate(B))
#print(B)
ans = float('Inf')
for i in range(0,n+1):
#w = s[:i].count("W")
##W = sum(tt[:i])
w = B[i]
#print(W,w)
#e = s[i:].count("... | from itertools import accumulate
n = int(eval(input()))
s = str(eval(input()))
tt = [1 if i == "W" else 0 for i in s]
B = [0] + tt
B = list(accumulate(B))
ans = float('Inf')
#0とn+1にすることで一番左側と一番右側を選べる
for i in range(n+1):
#print(s[0:i],s[i:])
#ここをprintすればどこで文字列を分けているかわかる．
#左にいるWの数
w = B[i]
#... | 20 | 21 | 456 | 446 | from itertools import accumulate
n = int(eval(input()))
s = str(eval(input()))
tt = [1 if i == "W" else 0 for i in s]
B = [0] + tt
B = list(accumulate(B))
# print(B)
ans = float("Inf")
for i in range(0, n + 1):
# w = s[:i].count("W")
##W = sum(tt[:i])
w = B[i]
# print(W,w)
# e = s[i:].count("E")
... | from itertools import accumulate
n = int(eval(input()))
s = str(eval(input()))
tt = [1 if i == "W" else 0 for i in s]
B = [0] + tt
B = list(accumulate(B))
ans = float("Inf")
# 0とn+1にすることで一番左側と一番右側を選べる
for i in range(n + 1):
# print(s[0:i],s[i:])
# ここをprintすればどこで文字列を分けているかわかる．
# 左にいるWの数
w = B[i]
# 右... | false | 4.761905 | [
"-# print(B)",
"-for i in range(0, n + 1):",
"- # w = s[:i].count(\"W\")",
"- ##W = sum(tt[:i])",
"+# 0とn+1にすることで一番左側と一番右側を選べる",
"+for i in range(n + 1):",
"+ # print(s[0:i],s[i:])",
"+ # ここをprintすればどこで文字列を分けているかわかる．",
"+ # 左にいるWの数",
"- # print(W,w)",
"- # e = s[i:].count(\"... | false | 0.04524 | 0.095255 | 0.474942 | [
"s661121018",
"s723160708"
] |
u510829608 | p02314 | python | s819696856 | s792509342 | 970 | 760 | 45,440 | 9,636 | Accepted | Accepted | 21.65 | n, m = list(map(int, input().split()))
c = list(map(int, input().split()))
INF = 10**12
T = [[INF for i in range(n+1)] for j in range(m)]
for i in range(n+1):
T[0][i] = i
for i in range(m):
T[i][0] = 0
for i in range(m):
for j in range(1, n+1):
if j - c[i] >= 0:
T[i]... | n, m = list(map(int, input().split()))
c = list(map(int, input().split()))
INF = 10**12
T = [i for i in range(n+1)]
for i in range(m):
for j in range(1, n+1):
if j - c[i] >= 0:
T[j] = min(T[j], T[j - c[i]] + 1)
print((T[n])) | 21 | 13 | 422 | 256 | n, m = list(map(int, input().split()))
c = list(map(int, input().split()))
INF = 10**12
T = [[INF for i in range(n + 1)] for j in range(m)]
for i in range(n + 1):
T[0][i] = i
for i in range(m):
T[i][0] = 0
for i in range(m):
for j in range(1, n + 1):
if j - c[i] >= 0:
T[i][j] = min(T[i -... | n, m = list(map(int, input().split()))
c = list(map(int, input().split()))
INF = 10**12
T = [i for i in range(n + 1)]
for i in range(m):
for j in range(1, n + 1):
if j - c[i] >= 0:
T[j] = min(T[j], T[j - c[i]] + 1)
print((T[n]))
| false | 38.095238 | [
"-T = [[INF for i in range(n + 1)] for j in range(m)]",
"-for i in range(n + 1):",
"- T[0][i] = i",
"-for i in range(m):",
"- T[i][0] = 0",
"+T = [i for i in range(n + 1)]",
"- T[i][j] = min(T[i - 1][j], T[i][j - c[i]] + 1)",
"- else:",
"- T[i][j] = T[i - 1][j]",
... | false | 0.03931 | 0.039832 | 0.986895 | [
"s819696856",
"s792509342"
] |
u923668099 | p02257 | python | s734085193 | s676347505 | 410 | 260 | 7,608 | 7,764 | Accepted | Accepted | 36.59 | import sys
def solve():
n = int(sys.stdin.readline())
ans = sum(is_prime(int(sys.stdin.readline())) for i in range(n))
print(ans)
def is_prime(n):
if n < 2 or (n > 2 and not(n & 1)):
return False
for p in range(3, n, 2):
if p*p > n:
break
if n... | import sys
from math import sqrt
def solve():
n = int(sys.stdin.readline())
ans = sum(is_prime(int(sys.stdin.readline())) for i in range(n))
print(ans)
def is_prime(n):
if n < 2 or (n > 2 and not(n & 1)):
return False
lim = int(sqrt(n)) + 1
for p in range(3, lim, 2)... | 23 | 24 | 418 | 445 | import sys
def solve():
n = int(sys.stdin.readline())
ans = sum(is_prime(int(sys.stdin.readline())) for i in range(n))
print(ans)
def is_prime(n):
if n < 2 or (n > 2 and not (n & 1)):
return False
for p in range(3, n, 2):
if p * p > n:
break
if not (n % p):
... | import sys
from math import sqrt
def solve():
n = int(sys.stdin.readline())
ans = sum(is_prime(int(sys.stdin.readline())) for i in range(n))
print(ans)
def is_prime(n):
if n < 2 or (n > 2 and not (n & 1)):
return False
lim = int(sqrt(n)) + 1
for p in range(3, lim, 2):
if not ... | false | 4.166667 | [
"+from math import sqrt",
"- for p in range(3, n, 2):",
"- if p * p > n:",
"- break",
"+ lim = int(sqrt(n)) + 1",
"+ for p in range(3, lim, 2):"
] | false | 0.047175 | 0.038709 | 1.218717 | [
"s734085193",
"s676347505"
] |
u729133443 | p03272 | python | s665446467 | s992289392 | 173 | 24 | 38,512 | 8,904 | Accepted | Accepted | 86.13 | print((eval(input().replace(' ','-'))+1)) | print((eval(input().replace(*' -'))+1)) | 1 | 1 | 39 | 37 | print((eval(input().replace(" ", "-")) + 1))
| print((eval(input().replace(*" -")) + 1))
| false | 0 | [
"-print((eval(input().replace(\" \", \"-\")) + 1))",
"+print((eval(input().replace(*\" -\")) + 1))"
] | false | 0.037413 | 0.045617 | 0.820166 | [
"s665446467",
"s992289392"
] |
u150984829 | p02283 | python | s563011442 | s729305223 | 6,500 | 5,420 | 57,900 | 53,988 | Accepted | Accepted | 16.62 | class Node:
__slots__ = ['key', 'left', 'right']
def __init__(self, key):
self.key = key
self.left = None
self.right = None
class BST:
def __init__(self):
self.root = None
def insert(self, key):
x = self.root
y = None
z = Node(key)
... | import sys
class Node:
__slots__ = ['key', 'left', 'right']
def __init__(self, key):
self.key = key
self.left = None
self.right = None
class BST:
def __init__(self):
self.root = None
def insert(self, key):
x = self.root
y = None
z ... | 43 | 45 | 1,141 | 1,140 | class Node:
__slots__ = ["key", "left", "right"]
def __init__(self, key):
self.key = key
self.left = None
self.right = None
class BST:
def __init__(self):
self.root = None
def insert(self, key):
x = self.root
y = None
z = Node(key)
whil... | import sys
class Node:
__slots__ = ["key", "left", "right"]
def __init__(self, key):
self.key = key
self.left = None
self.right = None
class BST:
def __init__(self):
self.root = None
def insert(self, key):
x = self.root
y = None
z = Node(key)... | false | 4.444444 | [
"+import sys",
"+",
"+",
"-for e in [0] * int(input()):",
"- e = input()",
"+input()",
"+for e in sys.stdin:"
] | false | 0.050241 | 0.199924 | 0.251302 | [
"s563011442",
"s729305223"
] |
u189487046 | p03043 | python | s918252895 | s285682861 | 40 | 35 | 2,940 | 2,940 | Accepted | Accepted | 12.5 | N, K = list(map(int, input().split()))
ans = 0
for i in reversed(list(range(1, N+1))):
n = 1
# i番目のサイコロの目（=i）がKを超えるには何回コインで面を出す必要があるか
while i < K:
# 2倍にしている
n <<= 1
i <<= 1
# Kを超える確率（=超えるために必要なコインが連続で表になる確率をansに加算する）
ans += 1/n
# ansには各目が出る確率の合計が格納されているので値をN（サイ... | N, K = list(map(int, input().split()))
ans = 0
for i in reversed(list(range(1, N+1))):
n = 1
# i番目のサイコロの目（=i）がKを超えるには何回コインで面を出す必要があるか
while i < K:
# 2倍にしている
n = n*2
i = i*2
# Kを超える確率（=超えるために必要なコインが連続で表になる確率をansに加算する）
ans += 1/n
# ansには各目が出る確率の合計が格納されているので値をN（サイ... | 15 | 15 | 333 | 333 | N, K = list(map(int, input().split()))
ans = 0
for i in reversed(list(range(1, N + 1))):
n = 1
# i番目のサイコロの目（=i）がKを超えるには何回コインで面を出す必要があるか
while i < K:
# 2倍にしている
n <<= 1
i <<= 1
# Kを超える確率（=超えるために必要なコインが連続で表になる確率をansに加算する）
ans += 1 / n
# ansには各目が出る確率の合計が格納されているので値をN（サイコロの目の数）で割る
... | N, K = list(map(int, input().split()))
ans = 0
for i in reversed(list(range(1, N + 1))):
n = 1
# i番目のサイコロの目（=i）がKを超えるには何回コインで面を出す必要があるか
while i < K:
# 2倍にしている
n = n * 2
i = i * 2
# Kを超える確率（=超えるために必要なコインが連続で表になる確率をansに加算する）
ans += 1 / n
# ansには各目が出る確率の合計が格納されているので値をN（サイコロの目の数）... | false | 0 | [
"- n <<= 1",
"- i <<= 1",
"+ n = n * 2",
"+ i = i * 2"
] | false | 0.066967 | 0.066834 | 1.001984 | [
"s918252895",
"s285682861"
] |
u852690916 | p02806 | python | s826526451 | s164643497 | 182 | 164 | 38,256 | 38,384 | Accepted | Accepted | 9.89 | N=int(eval(input()))
S=[]
T=[]
for _ in range(N):
s,t=input().split()
S.append(s)
T.append(int(t))
X=eval(input())
ans=0
sleep=False
for s,t in zip(S,T):
ans+=t if sleep else 0
if s==X:
sleep=True
print(ans) | N = int(eval(input()))
st = [tuple(input().split()) for _ in range(N)]
X = eval(input())
ans = 0
for s, t in st:
ans += int(t)
for s, t in st:
ans -= int(t)
if s == X: break
print(ans) | 16 | 11 | 239 | 195 | N = int(eval(input()))
S = []
T = []
for _ in range(N):
s, t = input().split()
S.append(s)
T.append(int(t))
X = eval(input())
ans = 0
sleep = False
for s, t in zip(S, T):
ans += t if sleep else 0
if s == X:
sleep = True
print(ans)
| N = int(eval(input()))
st = [tuple(input().split()) for _ in range(N)]
X = eval(input())
ans = 0
for s, t in st:
ans += int(t)
for s, t in st:
ans -= int(t)
if s == X:
break
print(ans)
| false | 31.25 | [
"-S = []",
"-T = []",
"-for _ in range(N):",
"- s, t = input().split()",
"- S.append(s)",
"- T.append(int(t))",
"+st = [tuple(input().split()) for _ in range(N)]",
"-sleep = False",
"-for s, t in zip(S, T):",
"- ans += t if sleep else 0",
"+for s, t in st:",
"+ ans += int(t)",
... | false | 0.060232 | 0.03966 | 1.518685 | [
"s826526451",
"s164643497"
] |
u057109575 | p02843 | python | s556039721 | s345579495 | 206 | 64 | 40,304 | 61,528 | Accepted | Accepted | 68.93 | X = int(eval(input()))
dp = [-1] * (X + 1)
a = [100, 101, 102, 103, 104, 105]
m = [1000000] * 6
dp[0] = 0
for i in range(6):
for j in range(X + 1):
if dp[j] >= 0:
dp[j] = m[i]
elif j < a[i] or dp[j - a[i]] <= 0:
dp[j] = -1
else:
dp[j] = dp[j ... |
X = int(eval(input()))
n = X % 100
m = X // 100
cnt = 0
for a in reversed(list(range(1, 6))):
while n - a >= 0:
n -= a
cnt += 1
if cnt <= m:
print((1))
else:
print((0))
| 16 | 16 | 365 | 200 | X = int(eval(input()))
dp = [-1] * (X + 1)
a = [100, 101, 102, 103, 104, 105]
m = [1000000] * 6
dp[0] = 0
for i in range(6):
for j in range(X + 1):
if dp[j] >= 0:
dp[j] = m[i]
elif j < a[i] or dp[j - a[i]] <= 0:
dp[j] = -1
else:
dp[j] = dp[j - a[i]] - 1
pr... | X = int(eval(input()))
n = X % 100
m = X // 100
cnt = 0
for a in reversed(list(range(1, 6))):
while n - a >= 0:
n -= a
cnt += 1
if cnt <= m:
print((1))
else:
print((0))
| false | 0 | [
"-dp = [-1] * (X + 1)",
"-a = [100, 101, 102, 103, 104, 105]",
"-m = [1000000] * 6",
"-dp[0] = 0",
"-for i in range(6):",
"- for j in range(X + 1):",
"- if dp[j] >= 0:",
"- dp[j] = m[i]",
"- elif j < a[i] or dp[j - a[i]] <= 0:",
"- dp[j] = -1",
"- el... | false | 0.046205 | 0.044997 | 1.026857 | [
"s556039721",
"s345579495"
] |
u606045429 | p03946 | python | s896897484 | s356086978 | 141 | 112 | 20,448 | 20,448 | Accepted | Accepted | 20.57 | N, T, A0, *A = list(map(int, open(0).read().split()))
ma, mi = 0, A0
B = {}
for a in A:
b = a - mi
B[b] = B.get(b, 0) + 1
ma, mi = max(ma, b), min(mi, a)
print((B[ma])) | N, T, A0, *A = list(map(int, open(0).read().split()))
mi = A0
B = {}
for a in A:
b = a - mi
B[b] = B.get(b, 0) + 1
mi = min(mi, a)
print((B[max(B.keys())]))
| 10 | 10 | 183 | 172 | N, T, A0, *A = list(map(int, open(0).read().split()))
ma, mi = 0, A0
B = {}
for a in A:
b = a - mi
B[b] = B.get(b, 0) + 1
ma, mi = max(ma, b), min(mi, a)
print((B[ma]))
| N, T, A0, *A = list(map(int, open(0).read().split()))
mi = A0
B = {}
for a in A:
b = a - mi
B[b] = B.get(b, 0) + 1
mi = min(mi, a)
print((B[max(B.keys())]))
| false | 0 | [
"-ma, mi = 0, A0",
"+mi = A0",
"- ma, mi = max(ma, b), min(mi, a)",
"-print((B[ma]))",
"+ mi = min(mi, a)",
"+print((B[max(B.keys())]))"
] | false | 0.031191 | 0.04805 | 0.649131 | [
"s896897484",
"s356086978"
] |
u363610900 | p03624 | python | s416089349 | s755089011 | 21 | 17 | 3,956 | 3,188 | Accepted | Accepted | 19.05 | a = 'abcdefghijklmnopqrstuvwxyz'
s = list(eval(input()))
for i in a:
if i not in s:
print(i)
exit()
print('None')
| a = 'abcdefghijklnmopqrstuvwxyz'
S = eval(input())
for i in a:
if i not in S:
print(i)
exit(0)
print('None') | 7 | 8 | 134 | 130 | a = "abcdefghijklmnopqrstuvwxyz"
s = list(eval(input()))
for i in a:
if i not in s:
print(i)
exit()
print("None")
| a = "abcdefghijklnmopqrstuvwxyz"
S = eval(input())
for i in a:
if i not in S:
print(i)
exit(0)
print("None")
| false | 12.5 | [
"-a = \"abcdefghijklmnopqrstuvwxyz\"",
"-s = list(eval(input()))",
"+a = \"abcdefghijklnmopqrstuvwxyz\"",
"+S = eval(input())",
"- if i not in s:",
"+ if i not in S:",
"- exit()",
"+ exit(0)"
] | false | 0.049731 | 0.040045 | 1.241888 | [
"s416089349",
"s755089011"
] |
u247465867 | p03493 | python | s923754978 | s407334305 | 20 | 17 | 2,940 | 2,940 | Accepted | Accepted | 15 | # inputでコマンド入力の数字を取得し、listに渡して一文字ずつ配列に格納
# inputで取得された数字はすべて文字列型で格納されているので、intで数値に変換
binDigit = [int(num) for num in list(eval(input()))]
# 配列の合計を計算。各配列要素の１の個数＝各配列の合計値
sumNum = sum(binDigit)
print(sumNum) | #2019/09/25
s = eval(input())
print((s.count("1"))) | 8 | 3 | 207 | 45 | # inputでコマンド入力の数字を取得し、listに渡して一文字ずつ配列に格納
# inputで取得された数字はすべて文字列型で格納されているので、intで数値に変換
binDigit = [int(num) for num in list(eval(input()))]
# 配列の合計を計算。各配列要素の１の個数＝各配列の合計値
sumNum = sum(binDigit)
print(sumNum)
| # 2019/09/25
s = eval(input())
print((s.count("1")))
| false | 62.5 | [
"-# inputでコマンド入力の数字を取得し、listに渡して一文字ずつ配列に格納",
"-# inputで取得された数字はすべて文字列型で格納されているので、intで数値に変換",
"-binDigit = [int(num) for num in list(eval(input()))]",
"-# 配列の合計を計算。各配列要素の１の個数＝各配列の合計値",
"-sumNum = sum(binDigit)",
"-print(sumNum)",
"+# 2019/09/25",
"+s = eval(input())",
"+print((s.count(\"1\")))"
] | false | 0.044562 | 0.041971 | 1.061747 | [
"s923754978",
"s407334305"
] |
u998435601 | p02422 | python | s604748941 | s280607453 | 20 | 10 | 6,464 | 6,456 | Accepted | Accepted | 50 | # -*- coding: utf-8 -*-
str = input()
for _ in range(eval(input())):
ops = input().split()
na = int(ops[1])
nb = int(ops[2]) + 1
op = ops[0]
if op[0]=="p": print(str[na:nb])
elif op[2]=="v": str = str[:na] + "".join(reversed(str[na:nb])) + str[nb:]
else: str = str[:na] + ops[3] + str[nb:] | # -*- coding: utf-8 -*-
str = input()
for _ in range(eval(input())):
ops = input().split()
na = int(ops[1])
nb = int(ops[2]) + 1
op = ops[0]
if op[0]=="p": print(str[na:nb])
elif op[2]=="v":
t = str[na:nb]
str = str[:na] + t[::-1] + str[nb:]
else: str = str[:na] + ops[3] + str[nb:] | 10 | 12 | 307 | 306 | # -*- coding: utf-8 -*-
str = input()
for _ in range(eval(input())):
ops = input().split()
na = int(ops[1])
nb = int(ops[2]) + 1
op = ops[0]
if op[0] == "p":
print(str[na:nb])
elif op[2] == "v":
str = str[:na] + "".join(reversed(str[na:nb])) + str[nb:]
else:
str = str... | # -*- coding: utf-8 -*-
str = input()
for _ in range(eval(input())):
ops = input().split()
na = int(ops[1])
nb = int(ops[2]) + 1
op = ops[0]
if op[0] == "p":
print(str[na:nb])
elif op[2] == "v":
t = str[na:nb]
str = str[:na] + t[::-1] + str[nb:]
else:
str = st... | false | 16.666667 | [
"- str = str[:na] + \"\".join(reversed(str[na:nb])) + str[nb:]",
"+ t = str[na:nb]",
"+ str = str[:na] + t[::-1] + str[nb:]"
] | false | 0.037468 | 0.037677 | 0.994445 | [
"s604748941",
"s280607453"
] |
u496821919 | p02844 | python | s804943595 | s242696803 | 1,854 | 691 | 3,188 | 3,064 | Accepted | Accepted | 62.73 | n = int(eval(input()))
s = eval(input())
number = [n for n in range(10)]
ans = set([])
for i in number:
try:
j = s.index(str(i))
for k in number:
try:
l = s[j+1:].index(str(k))
for m in s[l+j+2:]:
ans.add(str(i)+str(k)+m)
... | n = int(eval(input()))
s = eval(input())
number = [n for n in range(10)]
ans = 0
for i in number:
try:
j = s.index(str(i))
for k in number:
try:
l = s[j+1:].index(str(k))
exist = [0]*10
for m in s[l+j+2:]:
ex... | 17 | 20 | 399 | 479 | n = int(eval(input()))
s = eval(input())
number = [n for n in range(10)]
ans = set([])
for i in number:
try:
j = s.index(str(i))
for k in number:
try:
l = s[j + 1 :].index(str(k))
for m in s[l + j + 2 :]:
ans.add(str(i) + str(k) + m)
... | n = int(eval(input()))
s = eval(input())
number = [n for n in range(10)]
ans = 0
for i in number:
try:
j = s.index(str(i))
for k in number:
try:
l = s[j + 1 :].index(str(k))
exist = [0] * 10
for m in s[l + j + 2 :]:
exis... | false | 15 | [
"-ans = set([])",
"+ans = 0",
"+ exist = [0] * 10",
"- ans.add(str(i) + str(k) + m)",
"+ exist[int(m)] = 1",
"+ # print(exist)",
"+ ans += sum(exist)",
"-print((len(ans)))",
"+print(ans)"
] | false | 0.171207 | 0.09539 | 1.794817 | [
"s804943595",
"s242696803"
] |
u875291233 | p02605 | python | s398710151 | s157282858 | 596 | 481 | 196,420 | 189,360 | Accepted | Accepted | 19.3 | # coding: utf-8
# Your code here!
import sys
read = sys.stdin.read
readline = sys.stdin.readline
n, = list(map(int, readline().split()))
M = 2*10**5+2
Uy = [[] for _ in range(M)]
Dy = [[] for _ in range(M)]
Rx = [[] for _ in range(M)]
Lx = [[] for _ in range(M)]
d1U = {} # 右上、x+y UR
d1R = {} # 右上、x+... | # coding: utf-8
# Your code here!
import sys
read = sys.stdin.read
readline = sys.stdin.readline
n, = list(map(int, readline().split()))
M = 2*10**5+2
Uy = {}
Dy = {}
Rx = {}
Lx = {}
d1U = {} # 右上、x+y UR
d1R = {} # 右上、x+y UR
d2U = {} # 左上、x-y UL
d2L = {} # 左上、x-y UL
d3L = {} # 左下、x+y LD
d3D = {} #... | 92 | 73 | 1,851 | 1,401 | # coding: utf-8
# Your code here!
import sys
read = sys.stdin.read
readline = sys.stdin.readline
(n,) = list(map(int, readline().split()))
M = 2 * 10**5 + 2
Uy = [[] for _ in range(M)]
Dy = [[] for _ in range(M)]
Rx = [[] for _ in range(M)]
Lx = [[] for _ in range(M)]
d1U = {} # 右上、x+y UR
d1R = {} # 右上、x+y UR
d2U = ... | # coding: utf-8
# Your code here!
import sys
read = sys.stdin.read
readline = sys.stdin.readline
(n,) = list(map(int, readline().split()))
M = 2 * 10**5 + 2
Uy = {}
Dy = {}
Rx = {}
Lx = {}
d1U = {} # 右上、x+y UR
d1R = {} # 右上、x+y UR
d2U = {} # 左上、x-y UL
d2L = {} # 左上、x-y UL
d3L = {} # 左下、x+y LD
d3D = {} # 左下、x+y L... | false | 20.652174 | [
"-Uy = [[] for _ in range(M)]",
"-Dy = [[] for _ in range(M)]",
"-Rx = [[] for _ in range(M)]",
"-Lx = [[] for _ in range(M)]",
"+Uy = {}",
"+Dy = {}",
"+Rx = {}",
"+Lx = {}",
"- Uy[x].append(y)",
"- dp, dn = d1U, d2U",
"+ ss, dp, dn = Uy, d1U, d2U",
"- Dy[x].append... | false | 1.322752 | 0.039208 | 33.736364 | [
"s398710151",
"s157282858"
] |
u596276291 | p03073 | python | s877769334 | s851024008 | 85 | 53 | 4,080 | 4,076 | Accepted | Accepted | 37.65 | from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt
from collections import deque
from bisect import bisect, bisect_left, bisect_right
from string import ascii_lowercase
from functools import lru_cache
import sys
sys.se... | #!/usr/bin/env python3
from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt
from collections import deque
from bisect import bisect, bisect_left, bisect_right
from string import ascii_lowercase
from functools import lru_c... | 58 | 59 | 1,134 | 1,275 | from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt
from collections import deque
from bisect import bisect, bisect_left, bisect_right
from string import ascii_lowercase
from functools import lru_cache
import sys
sys.setrecurs... | #!/usr/bin/env python3
from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt
from collections import deque
from bisect import bisect, bisect_left, bisect_right
from string import ascii_lowercase
from functools import lru_cache
im... | false | 1.694915 | [
"+#!/usr/bin/env python3",
"-# aとbの最大公約数",
"+def sum_of_arithmetic_progression(s, d, n):",
"+ return n * (2 * s + (n - 1) * d) // 2",
"+",
"+",
"-# aとbの最小公倍数",
"-def solve(S, n):",
"- ans = 0",
"- for i in range(len(S)):",
"- if int(S[i]) == n:",
"- pass",
"- ... | false | 0.035253 | 0.037538 | 0.93914 | [
"s877769334",
"s851024008"
] |
u613920660 | p03282 | python | s279734918 | s329519747 | 32 | 28 | 9,384 | 9,052 | Accepted | Accepted | 12.5 | from collections import deque
S=deque(list(map(int,list(eval(input())))))
K=int(eval(input()))
i=0
while S:
if S[0]==1:
S.popleft()
i+=1
else:
break
result=1 if K<=i else S[0]
print(result) | S=eval(input())
K=int(eval(input()))
for n in range(min(len(S),K)):
if S[n]!="1":
print((S[n]))
break
else:
print((1)) | 12 | 8 | 222 | 133 | from collections import deque
S = deque(list(map(int, list(eval(input())))))
K = int(eval(input()))
i = 0
while S:
if S[0] == 1:
S.popleft()
i += 1
else:
break
result = 1 if K <= i else S[0]
print(result)
| S = eval(input())
K = int(eval(input()))
for n in range(min(len(S), K)):
if S[n] != "1":
print((S[n]))
break
else:
print((1))
| false | 33.333333 | [
"-from collections import deque",
"-",
"-S = deque(list(map(int, list(eval(input())))))",
"+S = eval(input())",
"-i = 0",
"-while S:",
"- if S[0] == 1:",
"- S.popleft()",
"- i += 1",
"- else:",
"+for n in range(min(len(S), K)):",
"+ if S[n] != \"1\":",
"+ print(... | false | 0.038121 | 0.033009 | 1.154874 | [
"s279734918",
"s329519747"
] |
u925364229 | p03345 | python | s345937485 | s509201806 | 21 | 17 | 3,316 | 2,940 | Accepted | Accepted | 19.05 | inf = 10**18
A,B,C,K = list(map(int,input().split(" ")))
if K % 2 == 1:
if (B-A) > inf:
print("Unfair")
else:
print((B-A))
else:
if (A-B) > inf:
print("Unfair")
else:
print((A-B)) | A,B,C,K = list(map(int,input().split(" ")))
if K % 2 == 1:
print((B-A))
else:
print((A-B))
| 12 | 6 | 192 | 89 | inf = 10**18
A, B, C, K = list(map(int, input().split(" ")))
if K % 2 == 1:
if (B - A) > inf:
print("Unfair")
else:
print((B - A))
else:
if (A - B) > inf:
print("Unfair")
else:
print((A - B))
| A, B, C, K = list(map(int, input().split(" ")))
if K % 2 == 1:
print((B - A))
else:
print((A - B))
| false | 50 | [
"-inf = 10**18",
"- if (B - A) > inf:",
"- print(\"Unfair\")",
"- else:",
"- print((B - A))",
"+ print((B - A))",
"- if (A - B) > inf:",
"- print(\"Unfair\")",
"- else:",
"- print((A - B))",
"+ print((A - B))"
] | false | 0.04302 | 0.041371 | 1.039845 | [
"s345937485",
"s509201806"
] |
u150984829 | p02386 | python | s799834989 | s976578580 | 80 | 70 | 5,616 | 5,608 | Accepted | Accepted | 12.5 | import sys
n=int(eval(input()))
a=[list(map(int,input().split()))for _ in range(n)]
for i in range(n-1):
d=a[i][:];d[3],d[4]=d[4],d[3]
for j in range(i+1,n):
e=a[j][:];e[3],e[4]=e[4],e[3]
for p in('012345','152043','215304','302541','410352','514320'):
f=[d[int(k)]for k in p]
if f[0]==e[0]and f[5]=... | n=int(input())
a=[list(map(int,input().split()))for _ in range(n)]
def f():
for i in range(n-1):
d=a[i][:];d[3],d[4]=d[4],d[3]
for j in range(i+1,n):
e=a[j][:];e[3],e[4]=e[4],e[3]
for p in('012345','152043','215304','302541','410352','514320'):
f=[d[int(k)]for k in p]
if f[0]==e[0]and f[5]==... | 14 | 15 | 424 | 434 | import sys
n = int(eval(input()))
a = [list(map(int, input().split())) for _ in range(n)]
for i in range(n - 1):
d = a[i][:]
d[3], d[4] = d[4], d[3]
for j in range(i + 1, n):
e = a[j][:]
e[3], e[4] = e[4], e[3]
for p in ("012345", "152043", "215304", "302541", "410352", "514320"):
... | n = int(input())
a = [list(map(int, input().split())) for _ in range(n)]
def f():
for i in range(n - 1):
d = a[i][:]
d[3], d[4] = d[4], d[3]
for j in range(i + 1, n):
e = a[j][:]
e[3], e[4] = e[4], e[3]
for p in ("012345", "152043", "215304", "302541", "... | false | 6.666667 | [
"-import sys",
"+n = int(input())",
"+a = [list(map(int, input().split())) for _ in range(n)]",
"-n = int(eval(input()))",
"-a = [list(map(int, input().split())) for _ in range(n)]",
"-for i in range(n - 1):",
"- d = a[i][:]",
"- d[3], d[4] = d[4], d[3]",
"- for j in range(i + 1, n):",
"-... | false | 0.049832 | 0.03774 | 1.320386 | [
"s799834989",
"s976578580"
] |
u671060652 | p03243 | python | s023492504 | s671917295 | 167 | 68 | 38,416 | 61,612 | Accepted | Accepted | 59.28 | n = int(eval(input()))
if n % 111 == 0:
print(n)
quit()
print(((n//111+1)*111)) | def main():
n = int(eval(input()))
# h, w, k = map(int, input().split())
# a = list(map(int, input().split()))
# s = input()
while True:
s = str(n)
if s[0] == s[1] and s[1] == s[2]:
print((int(s)))
exit()
n += 1
if __name__ == '__main_... | 7 | 16 | 87 | 328 | n = int(eval(input()))
if n % 111 == 0:
print(n)
quit()
print(((n // 111 + 1) * 111))
| def main():
n = int(eval(input()))
# h, w, k = map(int, input().split())
# a = list(map(int, input().split()))
# s = input()
while True:
s = str(n)
if s[0] == s[1] and s[1] == s[2]:
print((int(s)))
exit()
n += 1
if __name__ == "__main__":
main()
| false | 56.25 | [
"-n = int(eval(input()))",
"-if n % 111 == 0:",
"- print(n)",
"- quit()",
"-print(((n // 111 + 1) * 111))",
"+def main():",
"+ n = int(eval(input()))",
"+ # h, w, k = map(int, input().split())",
"+ # a = list(map(int, input().split()))",
"+ # s = input()",
"+ while True:",
... | false | 0.033395 | 0.033282 | 1.003414 | [
"s023492504",
"s671917295"
] |
u379629675 | p02839 | python | s471870832 | s289717947 | 222 | 33 | 43,248 | 3,316 | Accepted | Accepted | 85.14 | # -*- coding: utf-8 -*-
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
write = sys.stdout.write
# template
def solve():
ofs = 6400
h, w = list(map(int, readline().split()))
A = [list(map(int, readline().split())) for i in range(h)]
B = [list(map(int, readline(... | # -*- coding: utf-8 -*-
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
write = sys.stdout.write
# template
def solve():
ofs = 1000
h, w = list(map(int, readline().split()))
A = [list(map(int, readline().split())) for i in range(h)]
B = [list(map(int, readline(... | 32 | 32 | 813 | 813 | # -*- coding: utf-8 -*-
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
write = sys.stdout.write
# template
def solve():
ofs = 6400
h, w = list(map(int, readline().split()))
A = [list(map(int, readline().split())) for i in range(h)]
B = [list(map(int, readline().split())) f... | # -*- coding: utf-8 -*-
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
write = sys.stdout.write
# template
def solve():
ofs = 1000
h, w = list(map(int, readline().split()))
A = [list(map(int, readline().split())) for i in range(h)]
B = [list(map(int, readline().split())) f... | false | 0 | [
"- ofs = 6400",
"+ ofs = 1000"
] | false | 0.069967 | 0.035606 | 1.965047 | [
"s471870832",
"s289717947"
] |
u188827677 | p03774 | python | s427513391 | s475498165 | 31 | 26 | 9,152 | 9,124 | Accepted | Accepted | 16.13 | n,m = list(map(int, input().split()))
ab = [list(map(int, input().split())) for _ in range(n)]
cd = [list(map(int, input().split())) for _ in range(m)]
for i in range(n):
s = 0
t = float('inf')
for j in range(m):
p = abs(ab[i][0] - cd[j][0]) + abs(ab[i][1] - cd[j][1])
if p < t:
s = j+1
... | n,m = list(map(int, input().split()))
ab = []
for _ in range(n):
a,b = list(map(int, input().split()))
ab.append((a,b))
cd = []
for _ in range(m):
c,d = list(map(int, input().split()))
cd.append((c,d))
for i in ab:
s = float("inf")
for j in range(m):
t = abs(i[0]-cd[j][0]) + abs(i[1]-cd[... | 13 | 18 | 337 | 367 | n, m = list(map(int, input().split()))
ab = [list(map(int, input().split())) for _ in range(n)]
cd = [list(map(int, input().split())) for _ in range(m)]
for i in range(n):
s = 0
t = float("inf")
for j in range(m):
p = abs(ab[i][0] - cd[j][0]) + abs(ab[i][1] - cd[j][1])
if p < t:
... | n, m = list(map(int, input().split()))
ab = []
for _ in range(n):
a, b = list(map(int, input().split()))
ab.append((a, b))
cd = []
for _ in range(m):
c, d = list(map(int, input().split()))
cd.append((c, d))
for i in ab:
s = float("inf")
for j in range(m):
t = abs(i[0] - cd[j][0]) + abs(i... | false | 27.777778 | [
"-ab = [list(map(int, input().split())) for _ in range(n)]",
"-cd = [list(map(int, input().split())) for _ in range(m)]",
"-for i in range(n):",
"- s = 0",
"- t = float(\"inf\")",
"+ab = []",
"+for _ in range(n):",
"+ a, b = list(map(int, input().split()))",
"+ ab.append((a, b))",
"+cd... | false | 0.04101 | 0.038176 | 1.074238 | [
"s427513391",
"s475498165"
] |
u844646164 | p03253 | python | s908153195 | s736635811 | 314 | 189 | 3,316 | 39,152 | Accepted | Accepted | 39.81 | import math
from collections import Counter
n, m =list(map(int, input().split()))
mod = 10**9+7
prime_count = Counter()
for i in range(2, math.ceil(math.sqrt(m))+1):
while m % i == 0:
m /= i
prime_count[i] += 1
if m > 1:
prime_count[int(m)] += 1
def ncr(n, r, p):
num = ... | import math
from collections import Counter
n, m = list(map(int, input().split()))
prime_count = Counter()
for i in range(2, math.ceil(math.sqrt(m))+1):
while m % i == 0:
m /= i
prime_count[i] += 1
if m > 1:
prime_count[int(m)] += 1
def ncr(n, r, p):
num = den = 1
for... | 26 | 25 | 564 | 557 | import math
from collections import Counter
n, m = list(map(int, input().split()))
mod = 10**9 + 7
prime_count = Counter()
for i in range(2, math.ceil(math.sqrt(m)) + 1):
while m % i == 0:
m /= i
prime_count[i] += 1
if m > 1:
prime_count[int(m)] += 1
def ncr(n, r, p):
num = den = 1
fo... | import math
from collections import Counter
n, m = list(map(int, input().split()))
prime_count = Counter()
for i in range(2, math.ceil(math.sqrt(m)) + 1):
while m % i == 0:
m /= i
prime_count[i] += 1
if m > 1:
prime_count[int(m)] += 1
def ncr(n, r, p):
num = den = 1
for i in range(r):... | false | 3.846154 | [
"-mod = 10**9 + 7",
"+p = 10**9 + 7",
"-for p, q in list(prime_count.items()):",
"- ans *= ncr(q + n - 1, n - 1, mod)",
"- ans %= mod",
"+for k, v in list(prime_count.items()):",
"+ ans *= ncr(n - 1 + v, n - 1, p)",
"+ ans %= p"
] | false | 0.12683 | 0.054043 | 2.346832 | [
"s908153195",
"s736635811"
] |
u340781749 | p03392 | python | s217639709 | s876207507 | 1,979 | 1,371 | 3,820 | 3,764 | Accepted | Accepted | 30.72 | def solve(s):
if len(s) == 2:
return 1 if s[0] == s[1] else 2
elif len(s) == 3:
if s[0] == s[1] == s[2]:
return 1
elif s[0] == s[1] or s[1] == s[2]:
return 6
elif s[0] == s[2]:
return 7
else:
return 3
if all(... | def solve(s):
if all(a == b for a, b in zip(s, s[1:])):
return 1
if len(s) == 2:
return 2
elif len(s) == 3:
if s[0] == s[1] or s[1] == s[2]:
return 6
elif s[0] == s[2]:
return 7
else:
return 3
# dp[has succession][mo... | 45 | 47 | 2,073 | 1,737 | def solve(s):
if len(s) == 2:
return 1 if s[0] == s[1] else 2
elif len(s) == 3:
if s[0] == s[1] == s[2]:
return 1
elif s[0] == s[1] or s[1] == s[2]:
return 6
elif s[0] == s[2]:
return 7
else:
return 3
if all(a == b for a... | def solve(s):
if all(a == b for a, b in zip(s, s[1:])):
return 1
if len(s) == 2:
return 2
elif len(s) == 3:
if s[0] == s[1] or s[1] == s[2]:
return 6
elif s[0] == s[2]:
return 7
else:
return 3
# dp[has succession][mod 3][last ch... | false | 4.255319 | [
"+ if all(a == b for a, b in zip(s, s[1:])):",
"+ return 1",
"- return 1 if s[0] == s[1] else 2",
"+ return 2",
"- if s[0] == s[1] == s[2]:",
"- return 1",
"- elif s[0] == s[1] or s[1] == s[2]:",
"+ if s[0] == s[1] or s[1] == s[2]:",
"- if a... | false | 0.059605 | 0.036867 | 1.616756 | [
"s217639709",
"s876207507"
] |
u190405389 | p02851 | python | s333114584 | s760950169 | 490 | 359 | 128,696 | 118,372 | Accepted | Accepted | 26.73 | from collections import defaultdict
from itertools import accumulate
import bisect
n,k = list(map(int, input().split()))
a = list(map(int,input().split()))
s = list(accumulate([0]+a))
b = [s[i]-i for i in range(n+1)]
d = defaultdict(list)
for i in range(n+1):
d[b[i]%k].append(i)
ans = 0
f... | from collections import defaultdict
from itertools import accumulate
n,k = list(map(int, input().split()))
a = list(map(int,input().split()))
s = list(accumulate([0]+a))
b = [(s[i]-i)%k for i in range(n+1)]
d = defaultdict(int)
# 初期化
for i in range(min(k-1,n+1)):
d[b[i]]+=1
ans = 0
for i in range... | 28 | 25 | 467 | 445 | from collections import defaultdict
from itertools import accumulate
import bisect
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
s = list(accumulate([0] + a))
b = [s[i] - i for i in range(n + 1)]
d = defaultdict(list)
for i in range(n + 1):
d[b[i] % k].append(i)
ans = 0
for x in list(d... | from collections import defaultdict
from itertools import accumulate
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
s = list(accumulate([0] + a))
b = [(s[i] - i) % k for i in range(n + 1)]
d = defaultdict(int)
# 初期化
for i in range(min(k - 1, n + 1)):
d[b[i]] += 1
ans = 0
for i in range(... | false | 10.714286 | [
"-import bisect",
"-b = [s[i] - i for i in range(n + 1)]",
"-d = defaultdict(list)",
"-for i in range(n + 1):",
"- d[b[i] % k].append(i)",
"+b = [(s[i] - i) % k for i in range(n + 1)]",
"+d = defaultdict(int)",
"+# 初期化",
"+for i in range(min(k - 1, n + 1)):",
"+ d[b[i]] += 1",
"-for x in l... | false | 0.033631 | 0.036769 | 0.914667 | [
"s333114584",
"s760950169"
] |
u297574184 | p02999 | python | s066643063 | s910496701 | 19 | 17 | 2,940 | 2,940 | Accepted | Accepted | 10.53 | X, A = list(map(int, input().split()))
if X < A:
print((0))
else:
print((10))
| X, A = list(map(int, input().split()))
if X < A:
print('0')
else:
print('10')
| 6 | 6 | 82 | 86 | X, A = list(map(int, input().split()))
if X < A:
print((0))
else:
print((10))
| X, A = list(map(int, input().split()))
if X < A:
print("0")
else:
print("10")
| false | 0 | [
"- print((0))",
"+ print(\"0\")",
"- print((10))",
"+ print(\"10\")"
] | false | 0.061639 | 0.037941 | 1.624614 | [
"s066643063",
"s910496701"
] |
u743272507 | p03478 | python | s152257761 | s999678679 | 37 | 24 | 3,060 | 2,940 | Accepted | Accepted | 35.14 | n,a,b = list(map(int,input().split()))
r = 0
for i in range(n+1):
if a <= sum(list(map(int,list(str(i))))) <= b: r += i
print(r) | n,a,b = list(map(int,input().split()))
def ketawa(i):
ret = 0
while(i):
ret += i % 10
i //= 10
return ret
ret = 0
for i in range(1,n+1):
if a <= ketawa(i) <= b: ret += i
print(ret)
| 5 | 12 | 130 | 203 | n, a, b = list(map(int, input().split()))
r = 0
for i in range(n + 1):
if a <= sum(list(map(int, list(str(i))))) <= b:
r += i
print(r)
| n, a, b = list(map(int, input().split()))
def ketawa(i):
ret = 0
while i:
ret += i % 10
i //= 10
return ret
ret = 0
for i in range(1, n + 1):
if a <= ketawa(i) <= b:
ret += i
print(ret)
| false | 58.333333 | [
"-r = 0",
"-for i in range(n + 1):",
"- if a <= sum(list(map(int, list(str(i))))) <= b:",
"- r += i",
"-print(r)",
"+",
"+",
"+def ketawa(i):",
"+ ret = 0",
"+ while i:",
"+ ret += i % 10",
"+ i //= 10",
"+ return ret",
"+",
"+",
"+ret = 0",
"+for i i... | false | 0.076044 | 0.084051 | 0.904735 | [
"s152257761",
"s999678679"
] |
u037430802 | p03162 | python | s716028372 | s097589708 | 741 | 548 | 76,632 | 24,308 | Accepted | Accepted | 26.05 | N = int(eval(input()))
abc = [tuple(map(int, input().split())) for _ in range(N)]
dp = [[0] * 3 for _ in range(N+1)] # どの行動を選んだか残しておくための３、
for i in range(N):
for j in range(3): # 昨日の行動
for k in range(3):
if j == k:
continue # 昨日と同じ行動はとれないので飛ばす
dp[i+1][k] = ... | N = int(eval(input()))
dp = [[0 for _ in range(3)] for _ in range(N+1)]
#dp[i][j]:i日目に活動a~cを行ったときに得られる最高の累積幸福度
for i in range(1, N+1):
a,b,c = list(map(int, input().split()))
dp[i][0] = a + max(dp[i-1][1], dp[i-1][2])
dp[i][1] = b + max(dp[i-1][0], dp[i-1][2])
dp[i][2] = c + max(dp[i-1][0], d... | 12 | 12 | 374 | 365 | N = int(eval(input()))
abc = [tuple(map(int, input().split())) for _ in range(N)]
dp = [[0] * 3 for _ in range(N + 1)] # どの行動を選んだか残しておくための３、
for i in range(N):
for j in range(3): # 昨日の行動
for k in range(3):
if j == k:
continue # 昨日と同じ行動はとれないので飛ばす
dp[i + 1][k] = max(... | N = int(eval(input()))
dp = [[0 for _ in range(3)] for _ in range(N + 1)]
# dp[i][j]:i日目に活動a~cを行ったときに得られる最高の累積幸福度
for i in range(1, N + 1):
a, b, c = list(map(int, input().split()))
dp[i][0] = a + max(dp[i - 1][1], dp[i - 1][2])
dp[i][1] = b + max(dp[i - 1][0], dp[i - 1][2])
dp[i][2] = c + max(dp[i - 1]... | false | 0 | [
"-abc = [tuple(map(int, input().split())) for _ in range(N)]",
"-dp = [[0] * 3 for _ in range(N + 1)] # どの行動を選んだか残しておくための３、",
"-for i in range(N):",
"- for j in range(3): # 昨日の行動",
"- for k in range(3):",
"- if j == k:",
"- continue # 昨日と同じ行動はとれないので飛ばす",
"- ... | false | 0.039946 | 0.036722 | 1.087787 | [
"s716028372",
"s097589708"
] |
u727025296 | p02837 | python | s763940055 | s804376911 | 203 | 127 | 3,064 | 3,064 | Accepted | Accepted | 37.44 | import itertools
N = int(eval(input()))
syougen_list = []
people = [-1] * N
for i in range(N):
a_i = int(eval(input()))
a_i_list = []
for j in range(a_i):
a_i_list.append(list(map(int, input().split())))
syougen_list.append(a_i_list)
output = 0
for i in itertools.product([1,0]... | import itertools
N = int(eval(input()))
syougen_list = []
for i in range(N):
a_i = int(eval(input()))
a_i_list = []
for j in range(a_i):
a_i_list.append(list(map(int, input().split())))
syougen_list.append(a_i_list)
output = 0
for i in itertools.product([1,0], repeat=N):
l... | 44 | 31 | 1,082 | 721 | import itertools
N = int(eval(input()))
syougen_list = []
people = [-1] * N
for i in range(N):
a_i = int(eval(input()))
a_i_list = []
for j in range(a_i):
a_i_list.append(list(map(int, input().split())))
syougen_list.append(a_i_list)
output = 0
for i in itertools.product([1, 0], repeat=N):
... | import itertools
N = int(eval(input()))
syougen_list = []
for i in range(N):
a_i = int(eval(input()))
a_i_list = []
for j in range(a_i):
a_i_list.append(list(map(int, input().split())))
syougen_list.append(a_i_list)
output = 0
for i in itertools.product([1, 0], repeat=N):
legal = True
f... | false | 29.545455 | [
"-people = [-1] * N",
"- if not legal:",
"- continue",
"- match = True",
"- honest_syougen_list = []",
"- for index, j in enumerate(i):",
"- if j == 1:",
"- honest_syougen_list += syougen_list[index]",
"- for j in honest_syougen_list:",
"- if people[j... | false | 0.062606 | 0.064046 | 0.977518 | [
"s763940055",
"s804376911"
] |
u365928729 | p03043 | python | s440587729 | s391768141 | 58 | 37 | 3,060 | 2,940 | Accepted | Accepted | 36.21 | # coding: utf-8
# Your code here!
n,k=list(map(float,input().split(" ")))
ans1=0
ans=0
n=int(n)
for i in range(1,n+1):
c=0
ans1=0
while(i<k):
i*=2
c+=1
ans1+=2**c
ans+=1/ans1
# print(c)
print((ans*(1/n))) | # coding: utf-8
# Your code here!
n,k=list(map(int,input().split(" ")))
ans1=0
for i in range(1,n+1):
c=0
while(i<k):
i*=2
c+=1
ans1+=0.5**c
# print(c)
print((ans1*(1/n)))
| 16 | 12 | 250 | 206 | # coding: utf-8
# Your code here!
n, k = list(map(float, input().split(" ")))
ans1 = 0
ans = 0
n = int(n)
for i in range(1, n + 1):
c = 0
ans1 = 0
while i < k:
i *= 2
c += 1
ans1 += 2**c
ans += 1 / ans1
# print(c)
print((ans * (1 / n)))
| # coding: utf-8
# Your code here!
n, k = list(map(int, input().split(" ")))
ans1 = 0
for i in range(1, n + 1):
c = 0
while i < k:
i *= 2
c += 1
ans1 += 0.5**c
# print(c)
print((ans1 * (1 / n)))
| false | 25 | [
"-n, k = list(map(float, input().split(\" \")))",
"+n, k = list(map(int, input().split(\" \")))",
"-ans = 0",
"-n = int(n)",
"- ans1 = 0",
"- ans1 += 2**c",
"- ans += 1 / ans1",
"+ ans1 += 0.5**c",
"-print((ans * (1 / n)))",
"+print((ans1 * (1 / n)))"
] | false | 0.007508 | 0.047604 | 0.157718 | [
"s440587729",
"s391768141"
] |
u107077660 | p03999 | python | s435745131 | s231624266 | 45 | 23 | 3,064 | 3,064 | Accepted | Accepted | 48.89 | S = eval(input())
T = [letter for letter in S]
que = [T]
a = 0
while que:
T1 = que[0]
if len(T1) > 1:
a += int(T1[0])*2**(len(T1) - 2)
t2 = T1[:]
t2[1] = t2[0] + t2[1]
t2 = t2[1:]
que.append(t2)
t1 = T1[1:]
que.append(t1)
else:
a += int(T1[0])
que = que[1:]
print(a) | S = [int(n) for n in eval(input())]
l = len(S)
ans = 0
for i in range(l):
for j in range(l-i):
if i+j == l-1:
t = 1
else:
t = 2
ans += S[i]*10**j*2**(l-j-t)
print(ans)
| 18 | 11 | 297 | 185 | S = eval(input())
T = [letter for letter in S]
que = [T]
a = 0
while que:
T1 = que[0]
if len(T1) > 1:
a += int(T1[0]) * 2 ** (len(T1) - 2)
t2 = T1[:]
t2[1] = t2[0] + t2[1]
t2 = t2[1:]
que.append(t2)
t1 = T1[1:]
que.append(t1)
else:
a += int(T1[... | S = [int(n) for n in eval(input())]
l = len(S)
ans = 0
for i in range(l):
for j in range(l - i):
if i + j == l - 1:
t = 1
else:
t = 2
ans += S[i] * 10**j * 2 ** (l - j - t)
print(ans)
| false | 38.888889 | [
"-S = eval(input())",
"-T = [letter for letter in S]",
"-que = [T]",
"-a = 0",
"-while que:",
"- T1 = que[0]",
"- if len(T1) > 1:",
"- a += int(T1[0]) * 2 ** (len(T1) - 2)",
"- t2 = T1[:]",
"- t2[1] = t2[0] + t2[1]",
"- t2 = t2[1:]",
"- que.append(t2)",... | false | 0.064629 | 0.193418 | 0.334141 | [
"s435745131",
"s231624266"
] |
u952708174 | p02548 | python | s848081807 | s994332521 | 123 | 109 | 67,676 | 9,160 | Accepted | Accepted | 11.38 | def c_a_times_b_plus_c():
N = int(eval(input()))
ans = 0
for a in range(1, N + 1):
for b in range(N // a, 0, -1):
if N - a * b >= 1:
ans += 1
return ans
print((c_a_times_b_plus_c()))
| def c_a_times_b_plus_c():
N = int(eval(input()))
return sum((N - 1) // a for a in range(1, N))
print((c_a_times_b_plus_c())) | 10 | 5 | 237 | 129 | def c_a_times_b_plus_c():
N = int(eval(input()))
ans = 0
for a in range(1, N + 1):
for b in range(N // a, 0, -1):
if N - a * b >= 1:
ans += 1
return ans
print((c_a_times_b_plus_c()))
| def c_a_times_b_plus_c():
N = int(eval(input()))
return sum((N - 1) // a for a in range(1, N))
print((c_a_times_b_plus_c()))
| false | 50 | [
"- ans = 0",
"- for a in range(1, N + 1):",
"- for b in range(N // a, 0, -1):",
"- if N - a * b >= 1:",
"- ans += 1",
"- return ans",
"+ return sum((N - 1) // a for a in range(1, N))"
] | false | 0.387149 | 0.068219 | 5.675072 | [
"s848081807",
"s994332521"
] |
u191874006 | p02848 | python | s528226693 | s672040852 | 208 | 83 | 41,324 | 68,260 | Accepted | Accepted | 60.1 | #!/usr/bin/env python3
#ABC146 B
import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(1000000)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Count... | #!/usr/bin/env python3
import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from... | 28 | 25 | 735 | 691 | #!/usr/bin/env python3
# ABC146 B
import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(1000000)
from heapq import heappush, heappop, heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from c... | #!/usr/bin/env python3
import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop, heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collectio... | false | 10.714286 | [
"-# ABC146 B",
"-sys.setrecursionlimit(1000000)",
"+sys.setrecursionlimit(2147483647)",
"-alpha = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"",
"-lst = list(alpha + alpha)",
"-ans = \"\"",
"+t = []",
"- ans += lst[alpha.index(s[i]) + n]",
"-print(ans)",
"+ t.append(chr(((ord(s[i]) - ord(\"A\")) + n) % 26... | false | 0.055013 | 0.035916 | 1.531717 | [
"s528226693",
"s672040852"
] |
u756388720 | p03074 | python | s698383265 | s595182467 | 236 | 202 | 4,092 | 45,808 | Accepted | Accepted | 14.41 | N, K = list(map(int, input().split()))
S = eval(input())
A = []
if S[0] == '0':
A.append(0)
i = 0
while i < len(S):
j = i
while j < len(S) and S[i] == S[j]:
j += 1
A.append(j - i)
i = j
ans = 0
tot = 0
r = 0
for l in range(len(A)):
while r < len(A) and r - l < 2 * K + 1:
tot... | N, K = list(map(int, input().split()))
S = eval(input())
A = []
if S[0] == '0':
A.append(0)
i = 0
while i < len(S):
j = i
while j < len(S) and S[i] == S[j]:
j += 1
A.append(j - i)
i = j
ans = 0
tot = 0
r = 0
for l in range(len(A)):
while r < len(A) and r - l < 2 * K + 1:
tot += A[r]... | 31 | 26 | 438 | 428 | N, K = list(map(int, input().split()))
S = eval(input())
A = []
if S[0] == "0":
A.append(0)
i = 0
while i < len(S):
j = i
while j < len(S) and S[i] == S[j]:
j += 1
A.append(j - i)
i = j
ans = 0
tot = 0
r = 0
for l in range(len(A)):
while r < len(A) and r - l < 2 * K + 1:
tot += A... | N, K = list(map(int, input().split()))
S = eval(input())
A = []
if S[0] == "0":
A.append(0)
i = 0
while i < len(S):
j = i
while j < len(S) and S[i] == S[j]:
j += 1
A.append(j - i)
i = j
ans = 0
tot = 0
r = 0
for l in range(len(A)):
while r < len(A) and r - l < 2 * K + 1:
tot += A... | false | 16.129032 | [
"- if l == r:",
"+ if r == l:"
] | false | 0.109557 | 0.04458 | 2.457521 | [
"s698383265",
"s595182467"
] |
u623819879 | p03286 | python | s888577823 | s319343837 | 186 | 170 | 38,512 | 38,384 | Accepted | Accepted | 8.6 | from heapq import heappush, heappop
from collections import deque,defaultdict,Counter
import itertools
from itertools import permutations,combinations
import sys
import bisect
import string
#import math
#import time
#import random
def I():
return int(input())
def MI():
return map(int,input().split(... | n=int(eval(input()))
t=[]
x=0
for i in range(60):
y=((n-x)%(1<<(i+1)))*(-1)**i
if y==(-2)**i:
t+=['1']
x+=(-2)**i
else:
t+=['0']
if x==n:
break
print((''.join(t)[::-1])) | 44 | 13 | 858 | 221 | from heapq import heappush, heappop
from collections import deque, defaultdict, Counter
import itertools
from itertools import permutations, combinations
import sys
import bisect
import string
# import math
# import time
# import random
def I():
return int(input())
def MI():
return map(int, input().split())
... | n = int(eval(input()))
t = []
x = 0
for i in range(60):
y = ((n - x) % (1 << (i + 1))) * (-1) ** i
if y == (-2) ** i:
t += ["1"]
x += (-2) ** i
else:
t += ["0"]
if x == n:
break
print(("".join(t)[::-1]))
| false | 70.454545 | [
"-from heapq import heappush, heappop",
"-from collections import deque, defaultdict, Counter",
"-import itertools",
"-from itertools import permutations, combinations",
"-import sys",
"-import bisect",
"-import string",
"-",
"-# import math",
"-# import time",
"-# import random",
"-def I():",... | false | 0.117556 | 0.035647 | 3.297761 | [
"s888577823",
"s319343837"
] |
u921826483 | p03337 | python | s131994969 | s303302130 | 22 | 18 | 3,316 | 2,940 | Accepted | Accepted | 18.18 | a,b = list(map(int,input().split()))
c = []
c.append(a+b)
c.append(a-b)
c.append(a*b)
c = sorted(c,reverse=True)
print((c[0])) | a,b = list(map(int,input().split()))
c = []
c.append(a*b)
c.append(a+b)
c.append(a-b)
c = sorted(c)
print((c[2])) | 7 | 7 | 124 | 111 | a, b = list(map(int, input().split()))
c = []
c.append(a + b)
c.append(a - b)
c.append(a * b)
c = sorted(c, reverse=True)
print((c[0]))
| a, b = list(map(int, input().split()))
c = []
c.append(a * b)
c.append(a + b)
c.append(a - b)
c = sorted(c)
print((c[2]))
| false | 0 | [
"+c.append(a * b)",
"-c.append(a * b)",
"-c = sorted(c, reverse=True)",
"-print((c[0]))",
"+c = sorted(c)",
"+print((c[2]))"
] | false | 0.125412 | 0.048636 | 2.57858 | [
"s131994969",
"s303302130"
] |
u644907318 | p03111 | python | s050025175 | s273048912 | 460 | 295 | 59,372 | 75,888 | Accepted | Accepted | 35.87 | from itertools import product
N,A,B,C = list(map(int,input().split()))
L = [int(eval(input())) for _ in range(N)]
cntmin = abs(A-L[0])+abs(B-L[1])+abs(C-L[2])
for x in product(list(range(4)),repeat=N):
cnt = 0
a = x.count(1)
b = x.count(2)
c = x.count(3)
if a*b*c==0:continue
A1 = []
... | from itertools import permutations,product
N,A,B,C = list(map(int,input().split()))
L = [int(eval(input())) for _ in range(N)]
G = {0:[],1:[],2:[]}
cmin = 10**5
for x in permutations(list(range(N)),3):
for y in product(list(range(4)),repeat=N-3):
G[0] = [x[0]]
G[1] = [x[1]]
G[2] = [... | 38 | 40 | 864 | 1,034 | from itertools import product
N, A, B, C = list(map(int, input().split()))
L = [int(eval(input())) for _ in range(N)]
cntmin = abs(A - L[0]) + abs(B - L[1]) + abs(C - L[2])
for x in product(list(range(4)), repeat=N):
cnt = 0
a = x.count(1)
b = x.count(2)
c = x.count(3)
if a * b * c == 0:
co... | from itertools import permutations, product
N, A, B, C = list(map(int, input().split()))
L = [int(eval(input())) for _ in range(N)]
G = {0: [], 1: [], 2: []}
cmin = 10**5
for x in permutations(list(range(N)), 3):
for y in product(list(range(4)), repeat=N - 3):
G[0] = [x[0]]
G[1] = [x[1]]
G[... | false | 5 | [
"-from itertools import product",
"+from itertools import permutations, product",
"-cntmin = abs(A - L[0]) + abs(B - L[1]) + abs(C - L[2])",
"-for x in product(list(range(4)), repeat=N):",
"- cnt = 0",
"- a = x.count(1)",
"- b = x.count(2)",
"- c = x.count(3)",
"- if a * b * c == 0:",... | false | 0.216689 | 0.007854 | 27.590786 | [
"s050025175",
"s273048912"
] |
u923662841 | p03212 | python | s559539001 | s292179550 | 55 | 47 | 12,564 | 9,084 | Accepted | Accepted | 14.55 | import itertools
N=int(eval(input()))
ans=0
S=[]
for i in range(10):
S+=list(itertools.product("357",repeat=i))
for s in S:
if len(set(s))>2 and int("".join(s))<=N:
ans+=1
print(ans) | from itertools import product
N = int(eval(input()))
count = 0
for i in range(3,10):
a = product(["3","5","7"],repeat=i)
for b in a:
if 1<=int("".join(b))<=N and len(set(b))==3:
count += 1
print(count) | 10 | 9 | 201 | 231 | import itertools
N = int(eval(input()))
ans = 0
S = []
for i in range(10):
S += list(itertools.product("357", repeat=i))
for s in S:
if len(set(s)) > 2 and int("".join(s)) <= N:
ans += 1
print(ans)
| from itertools import product
N = int(eval(input()))
count = 0
for i in range(3, 10):
a = product(["3", "5", "7"], repeat=i)
for b in a:
if 1 <= int("".join(b)) <= N and len(set(b)) == 3:
count += 1
print(count)
| false | 10 | [
"-import itertools",
"+from itertools import product",
"-ans = 0",
"-S = []",
"-for i in range(10):",
"- S += list(itertools.product(\"357\", repeat=i))",
"-for s in S:",
"- if len(set(s)) > 2 and int(\"\".join(s)) <= N:",
"- ans += 1",
"-print(ans)",
"+count = 0",
"+for i in rang... | false | 0.200784 | 0.180428 | 1.112817 | [
"s559539001",
"s292179550"
] |
u621935300 | p02762 | python | s797827795 | s605401735 | 371 | 311 | 38,428 | 40,220 | Accepted | Accepted | 16.17 | # -*- coding: utf-8 -*-
import sys
N,M,K=list(map(int, sys.stdin.readline().split()))
par=[ i for i in range(N+1) ]
size=[ 1 for i in range(N+1) ]
def root(x):
while par[x]!=x:
x=par[x]
return x
def same(x,y):
return root(x)==root(y)
def unite(x,y):
x=root(x)
y=root(y)
... | # -*- coding: utf-8 -*-
import sys
N,M,K=list(map(int, sys.stdin.readline().split()))
par=[ i for i in range(N+1) ]
size=[ 1 for i in range(N+1) ]
def root(x):
while par[x]!=x:
x=par[x]
return x
def same(x,y):
return root(x)==root(y)
def unite(x,y):
x=root(x)
y=root(y)
... | 43 | 42 | 885 | 791 | # -*- coding: utf-8 -*-
import sys
N, M, K = list(map(int, sys.stdin.readline().split()))
par = [i for i in range(N + 1)]
size = [1 for i in range(N + 1)]
def root(x):
while par[x] != x:
x = par[x]
return x
def same(x, y):
return root(x) == root(y)
def unite(x, y):
x = root(x)
y = roo... | # -*- coding: utf-8 -*-
import sys
N, M, K = list(map(int, sys.stdin.readline().split()))
par = [i for i in range(N + 1)]
size = [1 for i in range(N + 1)]
def root(x):
while par[x] != x:
x = par[x]
return x
def same(x, y):
return root(x) == root(y)
def unite(x, y):
x = root(x)
y = roo... | false | 2.325581 | [
"-al_ok = [0 for i in range(N + 1)] # 隣接で友達関係のカウント",
"+IN = [0 for _ in range(N + 1)]",
"- al_ok[a] += 1",
"- al_ok[b] += 1",
"-al_ng = [0 for i in range(N + 1)] # 隣接でブロックしている人のカウント",
"+ IN[a] += 1",
"+ IN[b] += 1",
"- al_ng[c] += 1",
"- al_ng[d] += 1",
"+ IN[c] ... | false | 0.156063 | 0.055244 | 2.824983 | [
"s797827795",
"s605401735"
] |
u600402037 | p02787 | python | s231726757 | s891782803 | 502 | 355 | 13,148 | 44,368 | Accepted | Accepted | 29.28 | import sys
import numpy as np
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
H, N = lr()
U = 20000 # max(H)+max(A) これ以上は関係ない
INF = 10 ** 8
dp = np.full(U, INF, np.int64)
dp[0] = 0
for i in range(N):
a, b = lr()
n = (U + (-U)%a)
#列... | # coding: utf-8
import sys
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
H, N = lr()
INF = 10 ** 15
limit = H + 100
dp = [INF] * limit
dp[0] = 0
for _ in range(N):
a, b = lr()
for i in range(limit):
index = i+a
if in... | 24 | 23 | 550 | 463 | import sys
import numpy as np
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
H, N = lr()
U = 20000 # max(H)+max(A) これ以上は関係ない
INF = 10**8
dp = np.full(U, INF, np.int64)
dp[0] = 0
for i in range(N):
a, b = lr()
n = U + (-U) % a
# 列のサイズはa
dp = ... | # coding: utf-8
import sys
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
H, N = lr()
INF = 10**15
limit = H + 100
dp = [INF] * limit
dp[0] = 0
for _ in range(N):
a, b = lr()
for i in range(limit):
index = i + a
if index > limit - 1:
... | false | 4.166667 | [
"+# coding: utf-8",
"-import numpy as np",
"-U = 20000 # max(H)+max(A) これ以上は関係ない",
"-INF = 10**8",
"-dp = np.full(U, INF, np.int64)",
"+INF = 10**15",
"+limit = H + 100",
"+dp = [INF] * limit",
"-for i in range(N):",
"+for _ in range(N):",
"- n = U + (-U) % a",
"- # 列のサイズはa",
"- dp... | false | 0.352467 | 0.146499 | 2.40594 | [
"s231726757",
"s891782803"
] |
u197457087 | p03283 | python | s995790389 | s036555045 | 963 | 877 | 20,720 | 143,580 | Accepted | Accepted | 8.93 | N,M,Q = list(map(int,input().split()))
X = [[0]*N for _ in range(N)]
for i in range(M):
L,R = list(map(int,input().split()))
L-=1;R-=1
X[L][R] +=1
#print(X)
S = [[0]*(N+1) for _ in range(N+1)]
for i in range(N):
for j in range(N):
S[i+1][j+1] = S[i][j+1] + S[i+1][j] -S[i][j] + X[i][j]
#print(S)
... | #和のセグ木にするときは以下の関数を定義する必要あり。
def segfunc(x,y):
return x+y
class SegmentTree(object):
def __init__(self, A, dot, unit):
n = 1 << (len(A) - 1).bit_length()
tree = [unit] * (2 * n)
for i, v in enumerate(A):
tree[i + n] = v
for i in range(n - 1, 0, -1):
... | 19 | 70 | 430 | 1,826 | N, M, Q = list(map(int, input().split()))
X = [[0] * N for _ in range(N)]
for i in range(M):
L, R = list(map(int, input().split()))
L -= 1
R -= 1
X[L][R] += 1
# print(X)
S = [[0] * (N + 1) for _ in range(N + 1)]
for i in range(N):
for j in range(N):
S[i + 1][j + 1] = S[i][j + 1] + S[i + 1][j... | # 和のセグ木にするときは以下の関数を定義する必要あり。
def segfunc(x, y):
return x + y
class SegmentTree(object):
def __init__(self, A, dot, unit):
n = 1 << (len(A) - 1).bit_length()
tree = [unit] * (2 * n)
for i, v in enumerate(A):
tree[i + n] = v
for i in range(n - 1, 0, -1):
t... | false | 72.857143 | [
"-N, M, Q = list(map(int, input().split()))",
"-X = [[0] * N for _ in range(N)]",
"+# 和のセグ木にするときは以下の関数を定義する必要あり。",
"+def segfunc(x, y):",
"+ return x + y",
"+",
"+",
"+class SegmentTree(object):",
"+ def __init__(self, A, dot, unit):",
"+ n = 1 << (len(A) - 1).bit_length()",
"+ ... | false | 0.044404 | 0.043887 | 1.011767 | [
"s995790389",
"s036555045"
] |
u754022296 | p03148 | python | s956095118 | s497431298 | 935 | 586 | 78,684 | 85,468 | Accepted | Accepted | 37.33 | import sys
input = sys.stdin.readline
from operator import itemgetter
import heapq
n, k = list(map(int, input().split()))
TD = sorted([list(map(int, input().split())) for _ in range(n)], reverse=True, key=itemgetter(1))
L = [[] for _ in range(n+1)]
P = []
a = 0
cnt = 0
F = [-float("inf")]*(n+1)
B = 0
for t,... | import sys
input = sys.stdin.readline
from operator import itemgetter
import heapq
n, k = list(map(int, input().split()))
TD = sorted([list(map(int, input().split())) for _ in range(n)], reverse=True, key=itemgetter(1))
L = [[] for _ in range(n+1)]
P = []
a = 0
cnt = 0
F = [-float("inf")]*(n+1)
for t, d in T... | 34 | 35 | 704 | 771 | import sys
input = sys.stdin.readline
from operator import itemgetter
import heapq
n, k = list(map(int, input().split()))
TD = sorted(
[list(map(int, input().split())) for _ in range(n)], reverse=True, key=itemgetter(1)
)
L = [[] for _ in range(n + 1)]
P = []
a = 0
cnt = 0
F = [-float("inf")] * (n + 1)
B = 0
for ... | import sys
input = sys.stdin.readline
from operator import itemgetter
import heapq
n, k = list(map(int, input().split()))
TD = sorted(
[list(map(int, input().split())) for _ in range(n)], reverse=True, key=itemgetter(1)
)
L = [[] for _ in range(n + 1)]
P = []
a = 0
cnt = 0
F = [-float("inf")] * (n + 1)
for t, d i... | false | 2.857143 | [
"-B = 0",
"- if B >> t & 1:",
"- heapq.heappush(P, d)",
"- else:",
"- B |= 1 << t",
"+ L[t].append(d)",
"+ if len(L[t]) == 1:",
"+for i in range(1, n + 1):",
"+ while len(L[i]) > 1:",
"+ heapq.heappush(P, L[i].pop())",
"+now = k",
"- while k < n and B >> ... | false | 0.077487 | 0.038068 | 2.035468 | [
"s956095118",
"s497431298"
] |
u318233626 | p02720 | python | s206830328 | s030838914 | 128 | 88 | 12,404 | 11,028 | Accepted | Accepted | 31.25 | from collections import deque
K = int(eval(input()))
Queue = deque([1, 2, 3, 4, 5, 6, 7, 8, 9])
for i in range(K):
x = Queue[0]
Queue.popleft()
oneplace = x % 10
#(1の位の数)-1を付け加えた数を入れる
if oneplace == 0: #xの1の位が0
pass
else: #xの1の位が0でない
enqueue = x * 10 + (oneplace ... | k = int(eval(input()))
B = [1, 2, 3, 4, 5, 6, 7, 8, 9] #Before list
while len(B) < k:
k -= len(B)
#次の桁に更新
def update_next_digit(B:list)->list:
N = [] #New list
for i in range(len(B)):
op = B[i] % 10 #one place
for j in [-1, 0, 1]:
if 0... | 28 | 25 | 614 | 528 | from collections import deque
K = int(eval(input()))
Queue = deque([1, 2, 3, 4, 5, 6, 7, 8, 9])
for i in range(K):
x = Queue[0]
Queue.popleft()
oneplace = x % 10
# (1の位の数)-1を付け加えた数を入れる
if oneplace == 0: # xの1の位が0
pass
else: # xの1の位が0でない
enqueue = x * 10 + (oneplace - 1)
... | k = int(eval(input()))
B = [1, 2, 3, 4, 5, 6, 7, 8, 9] # Before list
while len(B) < k:
k -= len(B)
# 次の桁に更新
def update_next_digit(B: list) -> list:
N = [] # New list
for i in range(len(B)):
op = B[i] % 10 # one place
for j in [-1, 0, 1]:
if 0 <= op ... | false | 10.714286 | [
"-from collections import deque",
"+k = int(eval(input()))",
"+B = [1, 2, 3, 4, 5, 6, 7, 8, 9] # Before list",
"+while len(B) < k:",
"+ k -= len(B)",
"+ # 次の桁に更新",
"+ def update_next_digit(B: list) -> list:",
"+ N = [] # New list",
"+ for i in range(len(B)):",
"+ ... | false | 0.051271 | 0.046926 | 1.092598 | [
"s206830328",
"s030838914"
] |
u539692012 | p02660 | python | s226690112 | s465553901 | 354 | 219 | 9,184 | 9,184 | Accepted | Accepted | 38.14 | n=int(eval(input()))
a=p=1
while p<6**8:
c=t=0;p+=1
while n%p<1:n//=p;x=c==t;t+=x;c+=1-t*x;a+=x
print((a-(n<2))) | n=int(eval(input()))
a=p=1
while p<1e6:
c=t=0;p+=1
while n%p<1:n//=p;x=c==t;t+=x;c+=1-t*x;a+=x
print((a-(n<2))) | 6 | 6 | 111 | 110 | n = int(eval(input()))
a = p = 1
while p < 6**8:
c = t = 0
p += 1
while n % p < 1:
n //= p
x = c == t
t += x
c += 1 - t * x
a += x
print((a - (n < 2)))
| n = int(eval(input()))
a = p = 1
while p < 1e6:
c = t = 0
p += 1
while n % p < 1:
n //= p
x = c == t
t += x
c += 1 - t * x
a += x
print((a - (n < 2)))
| false | 0 | [
"-while p < 6**8:",
"+while p < 1e6:"
] | false | 0.735428 | 0.518236 | 1.419097 | [
"s226690112",
"s465553901"
] |
u401686269 | p02678 | python | s505703543 | s964222868 | 871 | 588 | 44,208 | 35,360 | Accepted | Accepted | 32.49 | from heapq import heappop, heappush
INF = 1000000
N, M = list(map(int, input().split()))
d = [INF]*(N+1)
d[1] = 0
prev = [0]*(N+1)
G = {}
for i in range(M):
a, b = list(map(int, input().split()))
try:
G[a].append(b)
except:
G[a] = [b]
try:
G[b].append(a)
except:
G[b] = [a]
... | from collections import deque
N,M=list(map(int,input().split()))
G=[[] for _ in range(N+1)]
for i in range(M):
a,b=list(map(int,input().split()))
G[a].append(b)
G[b].append(a)
def bfs(s):
seen = [0]*(N+1)
d = [0]*(N+1)
prev = [0]*(N+1)
todo = deque()
seen[s]=1
todo.append(... | 39 | 30 | 654 | 576 | from heapq import heappop, heappush
INF = 1000000
N, M = list(map(int, input().split()))
d = [INF] * (N + 1)
d[1] = 0
prev = [0] * (N + 1)
G = {}
for i in range(M):
a, b = list(map(int, input().split()))
try:
G[a].append(b)
except:
G[a] = [b]
try:
G[b].append(a)
except:
... | from collections import deque
N, M = list(map(int, input().split()))
G = [[] for _ in range(N + 1)]
for i in range(M):
a, b = list(map(int, input().split()))
G[a].append(b)
G[b].append(a)
def bfs(s):
seen = [0] * (N + 1)
d = [0] * (N + 1)
prev = [0] * (N + 1)
todo = deque()
seen[s] = ... | false | 23.076923 | [
"-from heapq import heappop, heappush",
"+from collections import deque",
"-INF = 1000000",
"-d = [INF] * (N + 1)",
"-d[1] = 0",
"-prev = [0] * (N + 1)",
"-G = {}",
"+G = [[] for _ in range(N + 1)]",
"- try:",
"- G[a].append(b)",
"- except:",
"- G[a] = [b]",
"- try:",
... | false | 0.069844 | 0.085738 | 0.814625 | [
"s505703543",
"s964222868"
] |
u879870653 | p03805 | python | s079695627 | s708084465 | 155 | 28 | 3,064 | 3,572 | Accepted | Accepted | 81.94 | from itertools import permutations
N,M = list(map(int,input().split()))
L = [[] for i in range(N)]
for i in range(M) :
a,b = list(map(int,input().split()))
a -= 1
b -= 1
L[a].append(b)
L[b].append(a)
P = permutations([0] + [i for i in range(1,N)])
ans = 0
for perm in P :... | from itertools import permutations
N,M = list(map(int,input().split()))
L = [[False for j in range(N)] for i in range(N)]
for i in range(M) :
a,b = list(map(int,input().split()))
a -= 1
b -= 1
L[a][b] = True
L[b][a] = True
P = list(permutations(list(range(1,N))))
ans = 0
... | 34 | 29 | 625 | 486 | from itertools import permutations
N, M = list(map(int, input().split()))
L = [[] for i in range(N)]
for i in range(M):
a, b = list(map(int, input().split()))
a -= 1
b -= 1
L[a].append(b)
L[b].append(a)
P = permutations([0] + [i for i in range(1, N)])
ans = 0
for perm in P:
visited = [0 for i i... | from itertools import permutations
N, M = list(map(int, input().split()))
L = [[False for j in range(N)] for i in range(N)]
for i in range(M):
a, b = list(map(int, input().split()))
a -= 1
b -= 1
L[a][b] = True
L[b][a] = True
P = list(permutations(list(range(1, N))))
ans = 0
for perm in P:
perm... | false | 14.705882 | [
"-L = [[] for i in range(N)]",
"+L = [[False for j in range(N)] for i in range(N)]",
"- L[a].append(b)",
"- L[b].append(a)",
"-P = permutations([0] + [i for i in range(1, N)])",
"+ L[a][b] = True",
"+ L[b][a] = True",
"+P = list(permutations(list(range(1, N))))",
"- visited = [0 for i... | false | 0.079717 | 0.103876 | 0.767426 | [
"s079695627",
"s708084465"
] |
u780962115 | p03305 | python | s439554549 | s963655955 | 1,168 | 762 | 122,108 | 152,568 | Accepted | Accepted | 34.76 | import sys
input=sys.stdin.readline
import heapq
def dijkstra(s,graph,n):
dist=[float("inf") for i in range(n+1)]
dist[s]=0
pq=[]
heapq.heapify(pq)
heapq.heappush(pq,(0,s))
while pq:
mini_dis,node=heapq.heappop(pq)
if dist[node]<mini_dis: continue
for w,point ... | import heapq
import sys
input = sys.stdin.readline
N, M, S, T = list(map(int, input().split()))
import heapq
class Edge():
""" 重み付き有向辺 """
def __init__(self, _to, _cost):
self.to = _to
self.cost = _cost
class Dijkstra():
def __init__(self, V):
self.G = [[]... | 38 | 67 | 1,163 | 1,698 | import sys
input = sys.stdin.readline
import heapq
def dijkstra(s, graph, n):
dist = [float("inf") for i in range(n + 1)]
dist[s] = 0
pq = []
heapq.heapify(pq)
heapq.heappush(pq, (0, s))
while pq:
mini_dis, node = heapq.heappop(pq)
if dist[node] < mini_dis:
continu... | import heapq
import sys
input = sys.stdin.readline
N, M, S, T = list(map(int, input().split()))
import heapq
class Edge:
"""重み付き有向辺"""
def __init__(self, _to, _cost):
self.to = _to
self.cost = _cost
class Dijkstra:
def __init__(self, V):
self.G = [[] for i in range(V + 1)]
... | false | 43.283582 | [
"+import heapq",
"+N, M, S, T = list(map(int, input().split()))",
"-def dijkstra(s, graph, n):",
"- dist = [float(\"inf\") for i in range(n + 1)]",
"- dist[s] = 0",
"- pq = []",
"- heapq.heapify(pq)",
"- heapq.heappush(pq, (0, s))",
"- while pq:",
"- mini_dis, node = heapq... | false | 0.007991 | 0.101331 | 0.078866 | [
"s439554549",
"s963655955"
] |
u190873802 | p02597 | python | s636949100 | s426522836 | 124 | 96 | 12,996 | 13,064 | Accepted | Accepted | 22.58 | # coding: utf-8
# Your code here!
N=int(eval(input()))
List=eval(input())
AList=list(List)
#print(AList)
#print(sorted(List))
RCNT=AList.count("R")
BList=sorted(List)
#print(List[0])
#print(RCNT)
ANUM=0
BNUM=0
ans=0
i=0
while i<N:
if AList[i]=="R":
ANUM+=1
if BList[i]=="R":
... | N=int(eval(input()))
List=eval(input())
AList=list(List)
RCNT=AList.count("R")
BList=sorted(List)
ANUM=0
BNUM=0
ans=0
i=0
while i<N:
if AList[i]!=BList[i]:
ans+=1
i+=1
print((ans//2)) | 46 | 14 | 525 | 198 | # coding: utf-8
# Your code here!
N = int(eval(input()))
List = eval(input())
AList = list(List)
# print(AList)
# print(sorted(List))
RCNT = AList.count("R")
BList = sorted(List)
# print(List[0])
# print(RCNT)
ANUM = 0
BNUM = 0
ans = 0
i = 0
while i < N:
if AList[i] == "R":
ANUM += 1
if BList[i] == "R":... | N = int(eval(input()))
List = eval(input())
AList = list(List)
RCNT = AList.count("R")
BList = sorted(List)
ANUM = 0
BNUM = 0
ans = 0
i = 0
while i < N:
if AList[i] != BList[i]:
ans += 1
i += 1
print((ans // 2))
| false | 69.565217 | [
"-# coding: utf-8",
"-# Your code here!",
"-# print(AList)",
"-# print(sorted(List))",
"-# print(List[0])",
"-# print(RCNT)",
"- if AList[i] == \"R\":",
"- ANUM += 1",
"- if BList[i] == \"R\":",
"- BNUM += 1",
"- # print(BNUM,ANUM)",
"- if BNUM == RCNT or ANUM == RCNT... | false | 0.080734 | 0.032422 | 2.490085 | [
"s636949100",
"s426522836"
] |
u018679195 | p02899 | python | s731050194 | s179969285 | 325 | 187 | 21,420 | 13,880 | Accepted | Accepted | 42.46 | n = int(input())
enter = list(map(int, input().split()))
new_list = []
for i in range(1, n+1):
new_list.append([enter[i-1], i])
new_list.sort()
for i in range(n):
print(new_list[i][1], end = " ")
| n = int(input().strip())
a = list(map(int, input().rstrip().split()))
b=list(range(0,n))
for i in range(0,n):
b[a[i] - 1] = i+1
for i in range(0,n):
print(b[i],end=" ")
| 13 | 7 | 220 | 178 | n = int(input())
enter = list(map(int, input().split()))
new_list = []
for i in range(1, n + 1):
new_list.append([enter[i - 1], i])
new_list.sort()
for i in range(n):
print(new_list[i][1], end=" ")
| n = int(input().strip())
a = list(map(int, input().rstrip().split()))
b = list(range(0, n))
for i in range(0, n):
b[a[i] - 1] = i + 1
for i in range(0, n):
print(b[i], end=" ")
| false | 46.153846 | [
"-n = int(input())",
"-enter = list(map(int, input().split()))",
"-new_list = []",
"-for i in range(1, n + 1):",
"- new_list.append([enter[i - 1], i])",
"-new_list.sort()",
"-for i in range(n):",
"- print(new_list[i][1], end=\" \")",
"+n = int(input().strip())",
"+a = list(map(int, input().r... | false | 0.036088 | 0.036889 | 0.978305 | [
"s731050194",
"s179969285"
] |
u816872429 | p02996 | python | s139477723 | s247173778 | 1,748 | 973 | 91,676 | 55,264 | Accepted | Accepted | 44.34 | def doit(ab):
ab = sorted(ab, key=lambda x: (x[1], x[0]))
s = 0
for a, b in ab:
s += a
if s > b:
return "No"
return "Yes"
n = int(eval(input()))
ab = [list(map(int, input().split())) for _ in range(n)]
print((doit(ab)))
| def ok(ab):
t = 0
for a, b in ab:
t += a
if t > b:
return False
return True
n = int(eval(input()))
print(('Yes' if ok(sorted([list(map(int, input().split())) for _ in range(n)], key=lambda ab: ab[1])) else 'No')) | 12 | 10 | 268 | 254 | def doit(ab):
ab = sorted(ab, key=lambda x: (x[1], x[0]))
s = 0
for a, b in ab:
s += a
if s > b:
return "No"
return "Yes"
n = int(eval(input()))
ab = [list(map(int, input().split())) for _ in range(n)]
print((doit(ab)))
| def ok(ab):
t = 0
for a, b in ab:
t += a
if t > b:
return False
return True
n = int(eval(input()))
print(
(
"Yes"
if ok(
sorted(
[list(map(int, input().split())) for _ in range(n)],
key=lambda ab: ab[1],
... | false | 16.666667 | [
"-def doit(ab):",
"- ab = sorted(ab, key=lambda x: (x[1], x[0]))",
"- s = 0",
"+def ok(ab):",
"+ t = 0",
"- s += a",
"- if s > b:",
"- return \"No\"",
"- return \"Yes\"",
"+ t += a",
"+ if t > b:",
"+ return False",
"+ return T... | false | 0.059619 | 0.124435 | 0.479119 | [
"s139477723",
"s247173778"
] |
u118642796 | p03291 | python | s944626775 | s974376999 | 832 | 151 | 20,248 | 3,188 | Accepted | Accepted | 81.85 | S = eval(input())
A_left=[0]
C_left=[0]
Q_left=[0]
for (i,s) in enumerate(S):
if s == "A":
A_left.append(A_left[i]+1)
C_left.append(C_left[i])
Q_left.append(Q_left[i])
elif s == "C":
A_left.append(A_left[i])
C_left.append(C_left[i]+1)
Q_left.append... | box = [1,0,0,0]
for c in eval(input()):
if c == "A":
box[1] = box[0]+box[1]
elif c == "B":
box[2] = box[1]+box[2]
elif c == "C":
box[3] = box[2]+box[3]
elif c == "?":
box = [box[0]*3,box[1]*3+box[0],box[2]*3+box[1],box[3]*3+box[2]]
box = [i%(10**9+7) for ... | 49 | 13 | 1,610 | 338 | S = eval(input())
A_left = [0]
C_left = [0]
Q_left = [0]
for (i, s) in enumerate(S):
if s == "A":
A_left.append(A_left[i] + 1)
C_left.append(C_left[i])
Q_left.append(Q_left[i])
elif s == "C":
A_left.append(A_left[i])
C_left.append(C_left[i] + 1)
Q_left.append(Q_le... | box = [1, 0, 0, 0]
for c in eval(input()):
if c == "A":
box[1] = box[0] + box[1]
elif c == "B":
box[2] = box[1] + box[2]
elif c == "C":
box[3] = box[2] + box[3]
elif c == "?":
box = [
box[0] * 3,
box[1] * 3 + box[0],
box[2] * 3 + box[1]... | false | 73.469388 | [
"-S = eval(input())",
"-A_left = [0]",
"-C_left = [0]",
"-Q_left = [0]",
"-for (i, s) in enumerate(S):",
"- if s == \"A\":",
"- A_left.append(A_left[i] + 1)",
"- C_left.append(C_left[i])",
"- Q_left.append(Q_left[i])",
"- elif s == \"C\":",
"- A_left.append(A_le... | false | 0.036248 | 0.040943 | 0.885325 | [
"s944626775",
"s974376999"
] |
u065446124 | p03078 | python | s321530886 | s752745796 | 1,209 | 1,033 | 99,816 | 99,780 | Accepted | Accepted | 14.56 | x,y,z,k=list(map(int, input().split()))
a=list(map(int, input().split()))
b=list(map(int, input().split()))
c=list(map(int, input().split()))
ab=[]
for i in range(x):
for j in range(y):
ab.append(a[i]+b[j])
ab.sort(key=lambda x: -x)
c.sort(key=lambda x: -x)
ans=[]
ct=[0]
ansc=[ab[0]+c[0]]
while... | x,y,z,k=list(map(int, input().split()))
a=list(map(int, input().split()))
b=list(map(int, input().split()))
c=list(map(int, input().split()))
ab=[i+j for i in a for j in b]
ab.sort(key=lambda x: -x)
c.sort(key=lambda x: -x)
ans=[]
ct=[0]
ansc=[ab[0]+c[0]]
while (len(ans)<k):
if(ct[-1]!=0 and len(ct)<z):
... | 26 | 23 | 614 | 565 | x, y, z, k = list(map(int, input().split()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
c = list(map(int, input().split()))
ab = []
for i in range(x):
for j in range(y):
ab.append(a[i] + b[j])
ab.sort(key=lambda x: -x)
c.sort(key=lambda x: -x)
ans = []
ct = [0]
ansc = [ab[0] + c... | x, y, z, k = list(map(int, input().split()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
c = list(map(int, input().split()))
ab = [i + j for i in a for j in b]
ab.sort(key=lambda x: -x)
c.sort(key=lambda x: -x)
ans = []
ct = [0]
ansc = [ab[0] + c[0]]
while len(ans) < k:
if ct[-1] != 0 an... | false | 11.538462 | [
"-ab = []",
"-for i in range(x):",
"- for j in range(y):",
"- ab.append(a[i] + b[j])",
"+ab = [i + j for i in a for j in b]"
] | false | 0.055332 | 0.041557 | 1.331475 | [
"s321530886",
"s752745796"
] |
u089230684 | p02791 | python | s981866531 | s067789401 | 244 | 116 | 75,472 | 32,280 | Accepted | Accepted | 52.46 | n = int(eval(input()))
arr = list(map(int, input().split()))
mini, res = n+1, 0
for i in arr:
if i < mini:
mini = i
res += 1
print(res)
| n = int(eval(input()))
p = list(map(int, input().split()))
m = p[0]
ans = 0
for i in p:
if (m >= i):
ans += 1
m = min(i,m)
print(ans) | 8 | 9 | 157 | 151 | n = int(eval(input()))
arr = list(map(int, input().split()))
mini, res = n + 1, 0
for i in arr:
if i < mini:
mini = i
res += 1
print(res)
| n = int(eval(input()))
p = list(map(int, input().split()))
m = p[0]
ans = 0
for i in p:
if m >= i:
ans += 1
m = min(i, m)
print(ans)
| false | 11.111111 | [
"-arr = list(map(int, input().split()))",
"-mini, res = n + 1, 0",
"-for i in arr:",
"- if i < mini:",
"- mini = i",
"- res += 1",
"-print(res)",
"+p = list(map(int, input().split()))",
"+m = p[0]",
"+ans = 0",
"+for i in p:",
"+ if m >= i:",
"+ ans += 1",
"+ ... | false | 0.03702 | 0.047256 | 0.783397 | [
"s981866531",
"s067789401"
] |
u621935300 | p03290 | python | s476982617 | s525840547 | 1,065 | 575 | 182,036 | 48,540 | Accepted | Accepted | 46.01 | from collections import defaultdict
D,G=list(map( int, input().split() ))
P=[ list(map( int, input().split() )) for i in range(D) ]
N=10**6
dp= [ [ float("inf") for i in range(N+1)] for idx in range(D+1) ]
dp[0][0]=0
for idx, x in enumerate(P):
m=idx+1 #money
p,c=x[0], x[1]/100
for i in range(N,-... | from collections import defaultdict
D,G=list(map( int, input().split() ))
P=[ list(map( int, input().split() )) for i in range(D) ]
N=10**6
dp= [ float("inf") for i in range(N+1) ]
dp[0]=0
for idx, x in enumerate(P):
m=idx+1 #money
p,c=x[0], x[1]/100
for i in range(N,-1,-1):
if dp[i]!=float("inf... | 30 | 31 | 682 | 607 | from collections import defaultdict
D, G = list(map(int, input().split()))
P = [list(map(int, input().split())) for i in range(D)]
N = 10**6
dp = [[float("inf") for i in range(N + 1)] for idx in range(D + 1)]
dp[0][0] = 0
for idx, x in enumerate(P):
m = idx + 1 # money
p, c = x[0], x[1] / 100
for i in ran... | from collections import defaultdict
D, G = list(map(int, input().split()))
P = [list(map(int, input().split())) for i in range(D)]
N = 10**6
dp = [float("inf") for i in range(N + 1)]
dp[0] = 0
for idx, x in enumerate(P):
m = idx + 1 # money
p, c = x[0], x[1] / 100
for i in range(N, -1, -1):
if dp[... | false | 3.225806 | [
"-dp = [[float(\"inf\") for i in range(N + 1)] for idx in range(D + 1)]",
"-dp[0][0] = 0",
"+dp = [float(\"inf\") for i in range(N + 1)]",
"+dp[0] = 0",
"- if dp[idx][i] != float(\"inf\"):",
"+ if dp[i] != float(\"inf\"):",
"- dp[idx + 1][i + m * j + c] = min(",
"- ... | false | 0.007476 | 1.005278 | 0.007436 | [
"s476982617",
"s525840547"
] |
u634046173 | p02688 | python | s506808765 | s805681718 | 32 | 26 | 9,160 | 9,176 | Accepted | Accepted | 18.75 | N,K = list(map(int, input().split()))
a = set()
for i in range(K):
eval(input())
b= set(map(int,input().split()))
a|= b
print((N - len(a))) | N,K = list(map(int, input().split()))
a = set()
for i in range(K):
gomi = eval(input())
b = set(map(int,input().split()))
a |= b
print((N - len(a))) | 9 | 7 | 141 | 146 | N, K = list(map(int, input().split()))
a = set()
for i in range(K):
eval(input())
b = set(map(int, input().split()))
a |= b
print((N - len(a)))
| N, K = list(map(int, input().split()))
a = set()
for i in range(K):
gomi = eval(input())
b = set(map(int, input().split()))
a |= b
print((N - len(a)))
| false | 22.222222 | [
"- eval(input())",
"+ gomi = eval(input())"
] | false | 0.047155 | 0.047538 | 0.991958 | [
"s506808765",
"s805681718"
] |
u345966487 | p03160 | python | s683990137 | s681243276 | 122 | 93 | 11,568 | 12,216 | Accepted | Accepted | 23.77 | import sys
import io
f = sys.stdin.buffer
n = int(f.readline())
h = list(map(int, f.readline().split()))
p0, p1 = 0, abs(h[1] - h[0])
for i in range(2, n):
p2 = min(p1 + abs(h[i] - h[i - 1]), p0 + abs(h[i] - h[i - 2]))
p0, p1 = p1, p2
print(p1)
| import sys
import io
def main():
f = sys.stdin.buffer
n = int(f.readline())
h = list(map(int, f.readline().split()))
p0, p1 = 0, abs(h[1] - h[0])
for i in range(2, n):
p2 = min(p1 + abs(h[i] - h[i - 1]), p0 + abs(h[i] - h[i - 2]))
p0, p1 = p1, p2
print(p1)
if _... | 11 | 17 | 264 | 355 | import sys
import io
f = sys.stdin.buffer
n = int(f.readline())
h = list(map(int, f.readline().split()))
p0, p1 = 0, abs(h[1] - h[0])
for i in range(2, n):
p2 = min(p1 + abs(h[i] - h[i - 1]), p0 + abs(h[i] - h[i - 2]))
p0, p1 = p1, p2
print(p1)
| import sys
import io
def main():
f = sys.stdin.buffer
n = int(f.readline())
h = list(map(int, f.readline().split()))
p0, p1 = 0, abs(h[1] - h[0])
for i in range(2, n):
p2 = min(p1 + abs(h[i] - h[i - 1]), p0 + abs(h[i] - h[i - 2]))
p0, p1 = p1, p2
print(p1)
if __name__ == "__m... | false | 35.294118 | [
"-f = sys.stdin.buffer",
"-n = int(f.readline())",
"-h = list(map(int, f.readline().split()))",
"-p0, p1 = 0, abs(h[1] - h[0])",
"-for i in range(2, n):",
"- p2 = min(p1 + abs(h[i] - h[i - 1]), p0 + abs(h[i] - h[i - 2]))",
"- p0, p1 = p1, p2",
"-print(p1)",
"+",
"+def main():",
"+ f = s... | false | 0.04624 | 0.046542 | 0.993514 | [
"s683990137",
"s681243276"
] |
u682672120 | p02549 | python | s985347452 | s232704441 | 402 | 106 | 71,344 | 75,156 | Accepted | Accepted | 73.63 | mod = 998244353
class FenwickTree:
def __init__(self, n, init_list=None):
self.n = n
self.data = [0] * n
if init_list:
assert n == len(init_list)
for i in range(n):
self.add(i, init_list[i])
def add(self, i, val):
asse... | mod = 998244353
n, k = list(map(int, input().split()))
s = []
for _ in range(k):
l, r = list(map(int, input().split()))
s.append((l, r))
dp = [0] * (n + 1)
dp[1] = 1
for i in range(2, n+1):
for l, r in s:
jl = max(i - l, 0)
jr = max(i - r - 1, 0)
dp[i] = (dp[i] + dp... | 48 | 18 | 1,244 | 383 | mod = 998244353
class FenwickTree:
def __init__(self, n, init_list=None):
self.n = n
self.data = [0] * n
if init_list:
assert n == len(init_list)
for i in range(n):
self.add(i, init_list[i])
def add(self, i, val):
assert 0 <= i < self.n
... | mod = 998244353
n, k = list(map(int, input().split()))
s = []
for _ in range(k):
l, r = list(map(int, input().split()))
s.append((l, r))
dp = [0] * (n + 1)
dp[1] = 1
for i in range(2, n + 1):
for l, r in s:
jl = max(i - l, 0)
jr = max(i - r - 1, 0)
dp[i] = (dp[i] + dp[jl] - dp[jr]) %... | false | 62.5 | [
"-",
"-",
"-class FenwickTree:",
"- def __init__(self, n, init_list=None):",
"- self.n = n",
"- self.data = [0] * n",
"- if init_list:",
"- assert n == len(init_list)",
"- for i in range(n):",
"- self.add(i, init_list[i])",
"-",
"- ... | false | 0.086744 | 0.058409 | 1.485126 | [
"s985347452",
"s232704441"
] |
u145231176 | p02660 | python | s991451593 | s802630232 | 229 | 92 | 72,808 | 68,316 | Accepted | Accepted | 59.83 | def getN():
return int(eval(input()))
def getNM():
return list(map(int, input().split()))
def getList():
return list(map(int, input().split()))
def getArray(intn):
return [int(eval(input())) for i in range(intn)]
def input():
return sys.stdin.readline().rstrip()
from collections import d... | def getN():
return int(eval(input()))
def getNM():
return list(map(int, input().split()))
def getList():
return list(map(int, input().split()))
def getArray(intn):
return [int(eval(input())) for i in range(intn)]
def input():
return sys.stdin.readline().rstrip()
from collections import d... | 71 | 62 | 1,535 | 1,355 | def getN():
return int(eval(input()))
def getNM():
return list(map(int, input().split()))
def getList():
return list(map(int, input().split()))
def getArray(intn):
return [int(eval(input())) for i in range(intn)]
def input():
return sys.stdin.readline().rstrip()
from collections import def... | def getN():
return int(eval(input()))
def getNM():
return list(map(int, input().split()))
def getList():
return list(map(int, input().split()))
def getArray(intn):
return [int(eval(input())) for i in range(intn)]
def input():
return sys.stdin.readline().rstrip()
from collections import def... | false | 12.676056 | [
"-from fractions import gcd",
"-from itertools import permutations",
"-from operator import mul",
"-from functools import reduce",
"-from itertools import permutations",
"-from math import factorial, hypot",
"-",
"-#############",
"-# Main Code #",
"-#############",
"-",
"-",
"+# 1(1), 2(1 +... | false | 0.172012 | 0.066032 | 2.604984 | [
"s991451593",
"s802630232"
] |
u588341295 | p03493 | python | s934163081 | s336924544 | 19 | 17 | 3,060 | 2,940 | Accepted | Accepted | 10.53 | # -*- coding: utf-8 -*-
instr = eval(input())
print((instr.count("1"))) | # -*- coding: utf-8 -*-
print((input().count("1"))) | 5 | 3 | 69 | 52 | # -*- coding: utf-8 -*-
instr = eval(input())
print((instr.count("1")))
| # -*- coding: utf-8 -*-
print((input().count("1")))
| false | 40 | [
"-instr = eval(input())",
"-print((instr.count(\"1\")))",
"+print((input().count(\"1\")))"
] | false | 0.088394 | 0.087253 | 1.01308 | [
"s934163081",
"s336924544"
] |
u786793781 | p02769 | python | s993284871 | s970288194 | 1,053 | 595 | 64,208 | 29,472 | Accepted | Accepted | 43.49 | #!/usr/bin/env python3
# -*- coding: utf-8 -*-
from functools import reduce
table_size = 510000
# table_size = 5100000
mod = 10**9+7
# Combination の計算を最適化する必要がある?
# def nCr(n, r):
# numerator = reduce(lambda x, y: x * y % mod, range(n, n - r, -1), 1)
# denominator = reduce(lambda x, y: x * y % mo... | #!/usr/bin/env python3
# -*- coding: utf-8 -*-
from functools import reduce
# table_size = 510000
table_size = 2*10**5+1 # 200001
mod = 10**9+7
# Combination の計算を最適化する必要がある?
# def nCr(n, r):
# numerator = reduce(lambda x, y: x * y % mod, range(n, n - r, -1), 1)
# denominator = reduce(lambda x, y... | 56 | 53 | 1,531 | 1,474 | #!/usr/bin/env python3
# -*- coding: utf-8 -*-
from functools import reduce
table_size = 510000
# table_size = 5100000
mod = 10**9 + 7
# Combination の計算を最適化する必要がある?
# def nCr(n, r):
# numerator = reduce(lambda x, y: x * y % mod, range(n, n - r, -1), 1)
# denominator = reduce(lambda x, y: x * y % mod, range(1, ... | #!/usr/bin/env python3
# -*- coding: utf-8 -*-
from functools import reduce
# table_size = 510000
table_size = 2 * 10**5 + 1 # 200001
mod = 10**9 + 7
# Combination の計算を最適化する必要がある?
# def nCr(n, r):
# numerator = reduce(lambda x, y: x * y % mod, range(n, n - r, -1), 1)
# denominator = reduce(lambda x, y: x * y ... | false | 5.357143 | [
"-table_size = 510000",
"-# table_size = 5100000",
"+# table_size = 510000",
"+table_size = 2 * 10**5 + 1 # 200001",
"-# この分岐がよくわかっていない",
"-if n < k:",
"- print((c.nCr(2 * n - 1, n)))",
"-else:",
"- total = 0",
"- for i in range(k + 1):",
"- total += c.nCr(n - 1, i) * c.nCr(n, i... | false | 1.401404 | 0.932326 | 1.503127 | [
"s993284871",
"s970288194"
] |
u983918956 | p03448 | python | s316567751 | s113188761 | 50 | 19 | 3,316 | 3,060 | Accepted | Accepted | 62 | A,B,C,X = [int(eval(input())) for i in range(4)]
count = 0
for i in range(A+1):
for j in range(B+1):
for k in range(C+1):
if 500*i+100*j+50*k == X:
count += 1
print(count) | info = [int(eval(input())) for _ in range(4)]
ans = 0
for i in range(info[0] + 1):
for j in range(info[1] + 1):
k = (info[3] - (500*i + 100*j)) // 50
if 0 <= k <= info[2]:
ans += 1
print(ans) | 8 | 8 | 192 | 208 | A, B, C, X = [int(eval(input())) for i in range(4)]
count = 0
for i in range(A + 1):
for j in range(B + 1):
for k in range(C + 1):
if 500 * i + 100 * j + 50 * k == X:
count += 1
print(count)
| info = [int(eval(input())) for _ in range(4)]
ans = 0
for i in range(info[0] + 1):
for j in range(info[1] + 1):
k = (info[3] - (500 * i + 100 * j)) // 50
if 0 <= k <= info[2]:
ans += 1
print(ans)
| false | 0 | [
"-A, B, C, X = [int(eval(input())) for i in range(4)]",
"-count = 0",
"-for i in range(A + 1):",
"- for j in range(B + 1):",
"- for k in range(C + 1):",
"- if 500 * i + 100 * j + 50 * k == X:",
"- count += 1",
"-print(count)",
"+info = [int(eval(input())) for _ in... | false | 0.21984 | 0.036492 | 6.024404 | [
"s316567751",
"s113188761"
] |
u280667879 | p03960 | python | s180926149 | s343151163 | 1,100 | 989 | 46,700 | 17,648 | Accepted | Accepted | 10.09 | N,M=list(map(int,input().split()));C=[[0]*-~N for _ in range(N+1)];D=list(map(list,C));S=[eval(input())for _ in range(N)];r=0
for t in range(M-1):
for i in range(1,N+1):
for j in range(1,N+1):C[i][j]=C[i-1][j-1]+int(S[i-1][t]==S[j-1][t+1]);D[i][j]=min(D[i-1][j],D[i][j-1])+C[i][j]
r+=D[N][N]
print(r) | N,M=list(map(int,input().split()));C=[[0]*-~N for _ in range(N+1)];D=list(map(list,C));S=[input()for _ in range(N)];r=0
for t in range(M-1):
for i in range(1,N+1):
for j in range(1,N+1):C[i][j]=C[i-1][j-1]+int(S[i-1][t]==S[j-1][t+1]);D[i][j]=min(D[i-1][j],D[i][j-1])+C[i][j]
r+=D[N][N]
print(r) | 6 | 6 | 297 | 298 | N, M = list(map(int, input().split()))
C = [[0] * -~N for _ in range(N + 1)]
D = list(map(list, C))
S = [eval(input()) for _ in range(N)]
r = 0
for t in range(M - 1):
for i in range(1, N + 1):
for j in range(1, N + 1):
C[i][j] = C[i - 1][j - 1] + int(S[i - 1][t] == S[j - 1][t + 1])
D... | N, M = list(map(int, input().split()))
C = [[0] * -~N for _ in range(N + 1)]
D = list(map(list, C))
S = [input() for _ in range(N)]
r = 0
for t in range(M - 1):
for i in range(1, N + 1):
for j in range(1, N + 1):
C[i][j] = C[i - 1][j - 1] + int(S[i - 1][t] == S[j - 1][t + 1])
D[i][j]... | false | 0 | [
"-S = [eval(input()) for _ in range(N)]",
"+S = [input() for _ in range(N)]"
] | false | 0.040627 | 0.045933 | 0.884481 | [
"s180926149",
"s343151163"
] |
u353797797 | p02974 | python | s851253139 | s919634865 | 1,585 | 1,261 | 67,884 | 79,072 | Accepted | Accepted | 20.44 | def f(n,k):
md = 10 ** 9 + 7
if k % 2:
print((0))
exit()
k //= 2
dp = [[[0] * (n ** 2) for _ in range(n + 2)] for __ in range(n + 1)]
dp[0][0][0] = 1
for i in range(1, n + 1):
dpi1 = dp[i - 1]
for j in range(i + 1):
for s in range(j, k + 1):... | def f(n, k):
md = 10 ** 9 + 7
if k % 2:
print((0))
exit()
k //= 2
dp = [[[0] * (n + 2) for _ in range(n ** 2)] for __ in range(n + 1)]
dp[0][0][0] = 1
for i in range(1, n + 1):
dpi1 = dp[i - 1]
for j in range(i + 1):
for s in range(j, k + 1)... | 23 | 23 | 701 | 754 | def f(n, k):
md = 10**9 + 7
if k % 2:
print((0))
exit()
k //= 2
dp = [[[0] * (n**2) for _ in range(n + 2)] for __ in range(n + 1)]
dp[0][0][0] = 1
for i in range(1, n + 1):
dpi1 = dp[i - 1]
for j in range(i + 1):
for s in range(j, k + 1):
... | def f(n, k):
md = 10**9 + 7
if k % 2:
print((0))
exit()
k //= 2
dp = [[[0] * (n + 2) for _ in range(n**2)] for __ in range(n + 1)]
dp[0][0][0] = 1
for i in range(1, n + 1):
dpi1 = dp[i - 1]
for j in range(i + 1):
for s in range(j, k + 1):
... | false | 0 | [
"- dp = [[[0] * (n**2) for _ in range(n + 2)] for __ in range(n + 1)]",
"+ dp = [[[0] * (n + 2) for _ in range(n**2)] for __ in range(n + 1)]",
"- # 片側、水平、両方上",
"- # print(i,j,s)",
"- tmp = (",
"- dpi1[j][s - j] * j * 2",
"... | false | 0.051067 | 0.069724 | 0.732419 | [
"s851253139",
"s919634865"
] |
u190405389 | p03680 | python | s792652520 | s945365161 | 194 | 72 | 7,084 | 7,084 | Accepted | Accepted | 62.89 | n = int(eval(input()))
a = [int(eval(input())) for i in range(n)]
x = 1
i = 0
while i < n and x != 2:
x = a[x-1]
i += 1
if x == 2:
print(i)
else:
print((-1))
| import sys
n = int(eval(input()))
a = [int(x) for x in sys.stdin]
x = 1
i = 0
while i < n and x != 2:
x = a[x-1]
i += 1
if x == 2:
print(i)
else:
print((-1))
| 14 | 16 | 176 | 185 | n = int(eval(input()))
a = [int(eval(input())) for i in range(n)]
x = 1
i = 0
while i < n and x != 2:
x = a[x - 1]
i += 1
if x == 2:
print(i)
else:
print((-1))
| import sys
n = int(eval(input()))
a = [int(x) for x in sys.stdin]
x = 1
i = 0
while i < n and x != 2:
x = a[x - 1]
i += 1
if x == 2:
print(i)
else:
print((-1))
| false | 12.5 | [
"+import sys",
"+",
"-a = [int(eval(input())) for i in range(n)]",
"+a = [int(x) for x in sys.stdin]"
] | false | 0.040175 | 0.041746 | 0.962357 | [
"s792652520",
"s945365161"
] |
u648881683 | p02804 | python | s042947027 | s375435371 | 343 | 307 | 18,908 | 23,104 | Accepted | Accepted | 10.5 | # import itertools
# import math
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
A = sorted(A)
mod = 10**9+7
# print(list(itertools.combinations(range(6), 3)))
# A = range(6)
# N = 6
# K = 3
# 二項係数を素数で割った余り
def combMod(n, r, p):
if (r < 0) or (n < r):
return 0... | N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
A = sorted(A)
mod = 10**9+7
# conbModに使うfactとfactinvを求める
def factorialMod(n, p):
fact = [1, 1]
factinv = [1, 1]
inv = [0, 1]
for i in range(2, N + 1):
fact.append((fact[-1] * i) % mod)
inv.append((-in... | 53 | 32 | 1,102 | 818 | # import itertools
# import math
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
A = sorted(A)
mod = 10**9 + 7
# print(list(itertools.combinations(range(6), 3)))
# A = range(6)
# N = 6
# K = 3
# 二項係数を素数で割った余り
def combMod(n, r, p):
if (r < 0) or (n < r):
return 0
r = min(r, n -... | N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
A = sorted(A)
mod = 10**9 + 7
# conbModに使うfactとfactinvを求める
def factorialMod(n, p):
fact = [1, 1]
factinv = [1, 1]
inv = [0, 1]
for i in range(2, N + 1):
fact.append((fact[-1] * i) % mod)
inv.append((-inv[mod % i] ... | false | 39.622642 | [
"-# import itertools",
"-# import math",
"-# print(list(itertools.combinations(range(6), 3)))",
"-# A = range(6)",
"-# N = 6",
"-# K = 3",
"+# conbModに使うfactとfactinvを求める",
"+def factorialMod(n, p):",
"+ fact = [1, 1]",
"+ factinv = [1, 1]",
"+ inv = [0, 1]",
"+ for i in range(2, N ... | false | 0.058853 | 0.065232 | 0.902213 | [
"s042947027",
"s375435371"
] |
u674052742 | p02766 | python | s700441195 | s752867688 | 19 | 17 | 2,940 | 2,940 | Accepted | Accepted | 10.53 | # -*- coding: utf-8 -*-
"""
Created on Sun Mar 1 14:25:07 2020
@author: Kanaru Sato
"""
N, K = list(map(int, input().split()))
r = N
res = 0
while r >= K:
r /= K
res += 1
print((res+1)) | # -*- coding: utf-8 -*-
"""
Created on Mon Mar 2 23:52:06 2020
@author: Kanaru Sato
"""
N,K = list(map(int, input().split()))
count = 1
while N >= K:
N /= K
count += 1
print(count) | 16 | 15 | 205 | 207 | # -*- coding: utf-8 -*-
"""
Created on Sun Mar 1 14:25:07 2020
@author: Kanaru Sato
"""
N, K = list(map(int, input().split()))
r = N
res = 0
while r >= K:
r /= K
res += 1
print((res + 1))
| # -*- coding: utf-8 -*-
"""
Created on Mon Mar 2 23:52:06 2020
@author: Kanaru Sato
"""
N, K = list(map(int, input().split()))
count = 1
while N >= K:
N /= K
count += 1
print(count)
| false | 6.25 | [
"-Created on Sun Mar 1 14:25:07 2020",
"+Created on Mon Mar 2 23:52:06 2020",
"-r = N",
"-res = 0",
"-while r >= K:",
"- r /= K",
"- res += 1",
"-print((res + 1))",
"+count = 1",
"+while N >= K:",
"+ N /= K",
"+ count += 1",
"+print(count)"
] | false | 0.051423 | 0.051338 | 1.001656 | [
"s700441195",
"s752867688"
] |
u034128150 | p03216 | python | s442579660 | s338027555 | 1,485 | 1,261 | 115,628 | 106,392 | Accepted | Accepted | 15.08 | import numpy as np
from numba import njit
N = int(eval(input()))
S = eval(input())
Q = int(eval(input()))
ks = list(map(int, input().split()))
def func(ch):
if ch == 'D':
return 1
if ch == 'M':
return 2
if ch == 'C':
return 3
return 0
S_arr = np.array([fun... | import numpy as np
from numba import njit
def solve(N, S_arr, k):
ans = 0
D = 0
M = 0
DM = 0
for i in range(k):
if S_arr[i] == 1:
D += 1
elif S_arr[i] == 2:
DM += D
M += 1
elif S_arr[i] == 3:
ans += DM
for i... | 53 | 66 | 1,038 | 1,387 | import numpy as np
from numba import njit
N = int(eval(input()))
S = eval(input())
Q = int(eval(input()))
ks = list(map(int, input().split()))
def func(ch):
if ch == "D":
return 1
if ch == "M":
return 2
if ch == "C":
return 3
return 0
S_arr = np.array([func(ch) for ch in S],... | import numpy as np
from numba import njit
def solve(N, S_arr, k):
ans = 0
D = 0
M = 0
DM = 0
for i in range(k):
if S_arr[i] == 1:
D += 1
elif S_arr[i] == 2:
DM += D
M += 1
elif S_arr[i] == 3:
ans += DM
for i in range(k, N)... | false | 19.69697 | [
"-N = int(eval(input()))",
"-S = eval(input())",
"-Q = int(eval(input()))",
"-ks = list(map(int, input().split()))",
"-",
"-def func(ch):",
"- if ch == \"D\":",
"- return 1",
"- if ch == \"M\":",
"- return 2",
"- if ch == \"C\":",
"- return 3",
"- return 0",
... | false | 0.293212 | 0.408322 | 0.71809 | [
"s442579660",
"s338027555"
] |
u729133443 | p02863 | python | s476420607 | s364078521 | 1,870 | 205 | 357,732 | 12,728 | Accepted | Accepted | 89.04 | def main():
e=enumerate
(n,t),*g=[list(map(int,t.split()))for t in open(0)]
d=[0]
g.sort()
dp=[]
d=[0]*t
for a,b in g:
p=d[:]
for i in range(a,t):
v=d[i-a]+b
if v>p[i]:p[i]=v
dp+=p,
d=p
a=m=0
for(*_,v),(_,w)in zip(dp[-2::-1],g[::-1]):
if w>m:m=w
if ... | from numpy import*
N,T,*L=int64(open(0).read().split())
d=zeros(6010,int)
for w,v in sorted(zip(*[iter(L)]*2)):d[w:T+w]=maximum(d[w:T+w],d[:T]+v)
print((max(d))) | 20 | 5 | 351 | 163 | def main():
e = enumerate
(n, t), *g = [list(map(int, t.split())) for t in open(0)]
d = [0]
g.sort()
dp = []
d = [0] * t
for a, b in g:
p = d[:]
for i in range(a, t):
v = d[i - a] + b
if v > p[i]:
p[i] = v
dp += (p,)
d =... | from numpy import *
N, T, *L = int64(open(0).read().split())
d = zeros(6010, int)
for w, v in sorted(zip(*[iter(L)] * 2)):
d[w : T + w] = maximum(d[w : T + w], d[:T] + v)
print((max(d)))
| false | 75 | [
"-def main():",
"- e = enumerate",
"- (n, t), *g = [list(map(int, t.split())) for t in open(0)]",
"- d = [0]",
"- g.sort()",
"- dp = []",
"- d = [0] * t",
"- for a, b in g:",
"- p = d[:]",
"- for i in range(a, t):",
"- v = d[i - a] + b",
"- ... | false | 0.03377 | 0.361866 | 0.093321 | [
"s476420607",
"s364078521"
] |
u740909619 | p03699 | python | s659515210 | s351431587 | 31 | 28 | 9,100 | 9,028 | Accepted | Accepted | 9.68 | # C - Bugged
def main():
n = int(eval(input()))
s = [int(eval(input())) for _ in range(n)]
s.sort()
if sum(s) % 10 != 0:
print((sum(s)))
else:
for i in range(n):
if s[i] % 10 != 0:
s.pop(i)
print((sum(s)))
ex... | # C - Bugged
def main():
n = int(eval(input()))
s = [int(eval(input())) for _ in range(n)]
s.sort()
if sum(s) % 10 != 0:
print((sum(s)))
else:
for i in range(n):
if s[i] % 10 != 0:
print((sum(s)-s[i]))
exit()
else:
... | 20 | 19 | 390 | 369 | # C - Bugged
def main():
n = int(eval(input()))
s = [int(eval(input())) for _ in range(n)]
s.sort()
if sum(s) % 10 != 0:
print((sum(s)))
else:
for i in range(n):
if s[i] % 10 != 0:
s.pop(i)
print((sum(s)))
exit()
els... | # C - Bugged
def main():
n = int(eval(input()))
s = [int(eval(input())) for _ in range(n)]
s.sort()
if sum(s) % 10 != 0:
print((sum(s)))
else:
for i in range(n):
if s[i] % 10 != 0:
print((sum(s) - s[i]))
exit()
else:
pri... | false | 5 | [
"- s.pop(i)",
"- print((sum(s)))",
"+ print((sum(s) - s[i]))"
] | false | 0.066639 | 0.036536 | 1.823906 | [
"s659515210",
"s351431587"
] |
u340781749 | p03019 | python | s034071312 | s525496325 | 553 | 476 | 46,064 | 35,396 | Accepted | Accepted | 13.92 | import sys
from bisect import bisect_left
from itertools import accumulate
from operator import itemgetter
n, x = list(map(int, input().split()))
exams = []
norma = 0
for i, line in enumerate(sys.stdin):
b, l, u = list(map(int, line.split()))
exams.append((u * x - b * (u - l), b, l, u, i))
norma... | import sys
n, x = list(map(int, input().split()))
exams = []
norma = 0
for i, line in enumerate(sys.stdin):
b, l, u = list(map(int, line.split()))
exams.append((u * x - b * (u - l), b, l, u, i))
norma += b * l
exams_sorted = sorted(exams, reverse=True)
remain_norma = norma
sub_d = -1
i = 0
u... | 46 | 45 | 1,565 | 1,018 | import sys
from bisect import bisect_left
from itertools import accumulate
from operator import itemgetter
n, x = list(map(int, input().split()))
exams = []
norma = 0
for i, line in enumerate(sys.stdin):
b, l, u = list(map(int, line.split()))
exams.append((u * x - b * (u - l), b, l, u, i))
norma += b * l
e... | import sys
n, x = list(map(int, input().split()))
exams = []
norma = 0
for i, line in enumerate(sys.stdin):
b, l, u = list(map(int, line.split()))
exams.append((u * x - b * (u - l), b, l, u, i))
norma += b * l
exams_sorted = sorted(exams, reverse=True)
remain_norma = norma
sub_d = -1
i = 0
used = set()
for... | false | 2.173913 | [
"-from bisect import bisect_left",
"-from itertools import accumulate",
"-from operator import itemgetter",
"-exams_acc = list(accumulate(list(map(itemgetter(0), exams_sorted))))",
"-exams_loc = {i: loc for loc, i in enumerate(map(itemgetter(4), exams_sorted))}",
"-# print(norma)",
"-# print(exams_sorte... | false | 0.039072 | 0.044447 | 0.879058 | [
"s034071312",
"s525496325"
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.