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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
u899975427 | p02975 | python | s147217682 | s380054168 | 61 | 48 | 14,212 | 14,212 | Accepted | Accepted | 21.31 | n = int(eval(input()))
an = [int(i) for i in input().split()]
ax = 0
for i in range(n):
ax ^= an[i]
if ax:
print('No')
else:
print('Yes') | N=int(eval(input()))
a = list(map(int,input().split()))
s = set(a)
sl = list(s)
if len(s)==1:
if sl[0]==0:
print('Yes')
else:
print('No')
elif len(s)==2:
if N%3==0:
if sl[0]==0 or sl[1]==0:
if a.count(0)==N/3:
print('Yes')
else:
... | 9 | 33 | 145 | 716 | n = int(eval(input()))
an = [int(i) for i in input().split()]
ax = 0
for i in range(n):
ax ^= an[i]
if ax:
print("No")
else:
print("Yes")
| N = int(eval(input()))
a = list(map(int, input().split()))
s = set(a)
sl = list(s)
if len(s) == 1:
if sl[0] == 0:
print("Yes")
else:
print("No")
elif len(s) == 2:
if N % 3 == 0:
if sl[0] == 0 or sl[1] == 0:
if a.count(0) == N / 3:
print("Yes")
... | false | 72.727273 | [
"-n = int(eval(input()))",
"-an = [int(i) for i in input().split()]",
"-ax = 0",
"-for i in range(n):",
"- ax ^= an[i]",
"-if ax:",
"+N = int(eval(input()))",
"+a = list(map(int, input().split()))",
"+s = set(a)",
"+sl = list(s)",
"+if len(s) == 1:",
"+ if sl[0] == 0:",
"+ print... | false | 0.038989 | 0.055013 | 0.708722 | [
"s147217682",
"s380054168"
] |
u115994101 | p03731 | python | s547700290 | s682996914 | 354 | 216 | 20,060 | 20,060 | Accepted | Accepted | 38.98 | num,time = list(map(int, input().split()))
t = input().split()
ans = time
for i in range(0,num-1):
if int(t[i+1])-int(t[i]) < time:
ans += int(t[i+1])-int(t[i])
else:
ans += time
print(ans) | num,time = list(map(int, input().split()))
t = input().split()
ans = time
for i in range(0,num-1):
a = int(t[i+1])-int(t[i])
if a < time:
ans += a
else:
ans += time
print(ans) | 9 | 10 | 204 | 194 | num, time = list(map(int, input().split()))
t = input().split()
ans = time
for i in range(0, num - 1):
if int(t[i + 1]) - int(t[i]) < time:
ans += int(t[i + 1]) - int(t[i])
else:
ans += time
print(ans)
| num, time = list(map(int, input().split()))
t = input().split()
ans = time
for i in range(0, num - 1):
a = int(t[i + 1]) - int(t[i])
if a < time:
ans += a
else:
ans += time
print(ans)
| false | 10 | [
"- if int(t[i + 1]) - int(t[i]) < time:",
"- ans += int(t[i + 1]) - int(t[i])",
"+ a = int(t[i + 1]) - int(t[i])",
"+ if a < time:",
"+ ans += a"
] | false | 0.129309 | 0.048943 | 2.642024 | [
"s547700290",
"s682996914"
] |
u761320129 | p03148 | python | s637152968 | s158601107 | 495 | 284 | 28,088 | 25,244 | Accepted | Accepted | 42.63 | from collections import Counter
N,K = list(map(int,input().split()))
src = [tuple(map(int,input().split())) for i in range(N)]
src.sort(key=lambda x:-x[1])
selected = Counter()
ans = 0
stack = []
for t,d in src[:K]:
ans += d
selected[t] += 1
stack.append((t,d))
ans += len(selected)**2
tmp ... | N,K = list(map(int,input().split()))
TD = [tuple(map(int,input().split())) for i in range(N)]
TD.sort(key=lambda x:x[1])
import heapq
hq = []
heapq.heapify(hq)
selected = set()
ans = 0
for _ in range(K):
t,d = TD.pop()
if t in selected:
heapq.heappush(hq, d)
else:
selected.add... | 29 | 29 | 647 | 592 | from collections import Counter
N, K = list(map(int, input().split()))
src = [tuple(map(int, input().split())) for i in range(N)]
src.sort(key=lambda x: -x[1])
selected = Counter()
ans = 0
stack = []
for t, d in src[:K]:
ans += d
selected[t] += 1
stack.append((t, d))
ans += len(selected) ** 2
tmp = ans
for... | N, K = list(map(int, input().split()))
TD = [tuple(map(int, input().split())) for i in range(N)]
TD.sort(key=lambda x: x[1])
import heapq
hq = []
heapq.heapify(hq)
selected = set()
ans = 0
for _ in range(K):
t, d = TD.pop()
if t in selected:
heapq.heappush(hq, d)
else:
selected.add(t)
a... | false | 0 | [
"-from collections import Counter",
"+N, K = list(map(int, input().split()))",
"+TD = [tuple(map(int, input().split())) for i in range(N)]",
"+TD.sort(key=lambda x: x[1])",
"+import heapq",
"-N, K = list(map(int, input().split()))",
"-src = [tuple(map(int, input().split())) for i in range(N)]",
"-src.... | false | 0.087377 | 0.079531 | 1.098655 | [
"s637152968",
"s158601107"
] |
u597374218 | p02694 | python | s944863961 | s469493325 | 30 | 27 | 9,156 | 9,032 | Accepted | Accepted | 10 | X = int(eval(input()))
year = 0
deposit = 100
while deposit < X:
deposit = deposit*101//100
year = year+1
print(year) | X=int(eval(input()))
year=0
deposit=100
while deposit<X:
deposit+=deposit//100
year+=1
print(year) | 7 | 7 | 125 | 106 | X = int(eval(input()))
year = 0
deposit = 100
while deposit < X:
deposit = deposit * 101 // 100
year = year + 1
print(year)
| X = int(eval(input()))
year = 0
deposit = 100
while deposit < X:
deposit += deposit // 100
year += 1
print(year)
| false | 0 | [
"- deposit = deposit * 101 // 100",
"- year = year + 1",
"+ deposit += deposit // 100",
"+ year += 1"
] | false | 0.264851 | 0.252407 | 1.049303 | [
"s944863961",
"s469493325"
] |
u912237403 | p00129 | python | s536654358 | s881556219 | 290 | 60 | 4,596 | 4,600 | Accepted | Accepted | 79.31 | import math as M
def R(A): return (A[0]**2+A[1]**2)**.5
def I(i): return [list(map(int,input().split())) for _ in [0]*i]
def C(a,b): return a>b or abs(a-b)<1e-6
def f(e1):
tx,ty,sx,sy=e1
x=[]
for e2 in WP:
wx,wy,r=e2
wt=[tx-wx,ty-wy]; rwt=R(wt)
sw=[wx-sx,wy-sy]; rsw=R(sw)
st=[tx-sx,ty-s... | import math as M
def R(A): return (A[0]**2+A[1]**2)**.5
def I(i): return [list(map(int,input().split())) for _ in [0]*i]
def C(a,b): return a>b or abs(a-b)<1e-6
def f(e1):
tx,ty,sx,sy=e1
x=[]
for e2 in WP:
wx,wy,r=e2
wt=[tx-wx,ty-wy]; rwt=R(wt)
sw=[wx-sx,wy-sy]; rsw=R(sw)
st=[tx-sx,ty-s... | 30 | 31 | 756 | 779 | import math as M
def R(A):
return (A[0] ** 2 + A[1] ** 2) ** 0.5
def I(i):
return [list(map(int, input().split())) for _ in [0] * i]
def C(a, b):
return a > b or abs(a - b) < 1e-6
def f(e1):
tx, ty, sx, sy = e1
x = []
for e2 in WP:
wx, wy, r = e2
wt = [tx - wx, ty - wy]
... | import math as M
def R(A):
return (A[0] ** 2 + A[1] ** 2) ** 0.5
def I(i):
return [list(map(int, input().split())) for _ in [0] * i]
def C(a, b):
return a > b or abs(a - b) < 1e-6
def f(e1):
tx, ty, sx, sy = e1
x = []
for e2 in WP:
wx, wy, r = e2
wt = [tx - wx, ty - wy]
... | false | 3.225806 | [
"+ if c == 0:",
"+ return 0"
] | false | 0.057624 | 0.035708 | 1.61376 | [
"s536654358",
"s881556219"
] |
u222668979 | p02937 | python | s791925226 | s113748280 | 117 | 108 | 81,244 | 80,100 | Accepted | Accepted | 7.69 | from bisect import bisect_left as bisect
from collections import defaultdict
s, t = eval(input()), eval(input())
lens, sets = len(s), set(s)
if not all(i in sets for i in t):
print((-1))
exit()
alp = defaultdict(list)
for i, si in enumerate(s):
alp[si].append(i)
ans, cnt = 1 - lens, 0
f... | from bisect import bisect_left as bisect
s, t = eval(input()), eval(input())
lens, sets = len(s), set(s)
if not all(i in sets for i in t):
print((-1))
exit()
alp = [[] for i in range(26)]
for i, si in enumerate(s):
alp[ord(si) - 97].append(i)
ans, cnt = 1 - lens, 0
for i in t:
li = al... | 22 | 21 | 500 | 488 | from bisect import bisect_left as bisect
from collections import defaultdict
s, t = eval(input()), eval(input())
lens, sets = len(s), set(s)
if not all(i in sets for i in t):
print((-1))
exit()
alp = defaultdict(list)
for i, si in enumerate(s):
alp[si].append(i)
ans, cnt = 1 - lens, 0
for i in t:
ans +... | from bisect import bisect_left as bisect
s, t = eval(input()), eval(input())
lens, sets = len(s), set(s)
if not all(i in sets for i in t):
print((-1))
exit()
alp = [[] for i in range(26)]
for i, si in enumerate(s):
alp[ord(si) - 97].append(i)
ans, cnt = 1 - lens, 0
for i in t:
li = alp[ord(i) - 97]
... | false | 4.545455 | [
"-from collections import defaultdict",
"-alp = defaultdict(list)",
"+alp = [[] for i in range(26)]",
"- alp[si].append(i)",
"+ alp[ord(si) - 97].append(i)",
"+ li = alp[ord(i) - 97]",
"- num = bisect(alp[i], cnt)",
"- ans += lens * (num == len(alp[i]))",
"- cnt = (alp[i][num % len... | false | 0.043865 | 0.061526 | 0.712942 | [
"s791925226",
"s113748280"
] |
u777923818 | p02949 | python | s929379193 | s718201251 | 718 | 638 | 73,440 | 66,652 | Accepted | Accepted | 11.14 | # -*- coding: utf-8 -*-
from itertools import accumulate
from bisect import bisect, bisect_left
from collections import Counter, deque, defaultdict
from functools import reduce
from itertools import accumulate
from operator import itemgetter, xor
from string import ascii_lowercase as abc
from sys import set... | # -*- coding: utf-8 -*-
from collections import deque
import sys
sys.setrecursionlimit(10**9)
input = sys.stdin.readline
def inpl(): return list(map(int, input().split()))
N, M, P = inpl()
INF = 10**12
G = [[] for _ in range(N)]
E = []
G2 = [[] for _ in range(N)]
rG2 = [[] for _ in range(N)]
for _ in ra... | 140 | 130 | 3,099 | 2,788 | # -*- coding: utf-8 -*-
from itertools import accumulate
from bisect import bisect, bisect_left
from collections import Counter, deque, defaultdict
from functools import reduce
from itertools import accumulate
from operator import itemgetter, xor
from string import ascii_lowercase as abc
from sys import setrecursionlim... | # -*- coding: utf-8 -*-
from collections import deque
import sys
sys.setrecursionlimit(10**9)
input = sys.stdin.readline
def inpl():
return list(map(int, input().split()))
N, M, P = inpl()
INF = 10**12
G = [[] for _ in range(N)]
E = []
G2 = [[] for _ in range(N)]
rG2 = [[] for _ in range(N)]
for _ in range(M):... | false | 7.142857 | [
"-from itertools import accumulate",
"-from bisect import bisect, bisect_left",
"-from collections import Counter, deque, defaultdict",
"-from functools import reduce",
"-from itertools import accumulate",
"-from operator import itemgetter, xor",
"-from string import ascii_lowercase as abc",
"-from sy... | false | 0.038419 | 0.038107 | 1.008176 | [
"s929379193",
"s718201251"
] |
u187462782 | p02675 | python | s879289404 | s641149086 | 23 | 21 | 9,156 | 9,148 | Accepted | Accepted | 8.7 | N = int(eval(input()))
onesPlace = N % 10
output = ''
if onesPlace == 3:
output = 'bon'
elif onesPlace == 0 or onesPlace == 1 or onesPlace == 6 or onesPlace == 8:
output = 'pon'
else:
output = 'hon'
print(output) | N = int(eval(input()))
onesPlace = N % 10
firstChars = 'pphbhhphph'
print((firstChars[onesPlace] + 'on'))
| 12 | 6 | 231 | 105 | N = int(eval(input()))
onesPlace = N % 10
output = ""
if onesPlace == 3:
output = "bon"
elif onesPlace == 0 or onesPlace == 1 or onesPlace == 6 or onesPlace == 8:
output = "pon"
else:
output = "hon"
print(output)
| N = int(eval(input()))
onesPlace = N % 10
firstChars = "pphbhhphph"
print((firstChars[onesPlace] + "on"))
| false | 50 | [
"-output = \"\"",
"-if onesPlace == 3:",
"- output = \"bon\"",
"-elif onesPlace == 0 or onesPlace == 1 or onesPlace == 6 or onesPlace == 8:",
"- output = \"pon\"",
"-else:",
"- output = \"hon\"",
"-print(output)",
"+firstChars = \"pphbhhphph\"",
"+print((firstChars[onesPlace] + \"on\"))"
... | false | 0.036389 | 0.054899 | 0.662836 | [
"s879289404",
"s641149086"
] |
u744920373 | p03252 | python | s718071322 | s103435485 | 294 | 257 | 49,200 | 49,200 | Accepted | Accepted | 12.59 | S = eval(input())
T = eval(input())
l = len(S)
ad_list = [[] for i in range(l)]
ad_list2 = [[] for i in range(l)]
al_dict = {}
al_dict2 = {}
for i, moji in enumerate(S):
if moji not in al_dict:
al_dict[moji] = i
else:
ad_list[al_dict[moji]].append(i)
for i, moji in enumerat... | def ad_list_gen(S):
l = len(S)
ad_list = [[] for i in range(l)]
al_dict = {}
for i, moji in enumerate(S):
if moji not in al_dict:
al_dict[moji] = i
else:
ad_list[al_dict[moji]].append(i)
return ad_list
S = eval(input())
T = eval(input())
... | 27 | 22 | 493 | 426 | S = eval(input())
T = eval(input())
l = len(S)
ad_list = [[] for i in range(l)]
ad_list2 = [[] for i in range(l)]
al_dict = {}
al_dict2 = {}
for i, moji in enumerate(S):
if moji not in al_dict:
al_dict[moji] = i
else:
ad_list[al_dict[moji]].append(i)
for i, moji in enumerate(T):
if moji not ... | def ad_list_gen(S):
l = len(S)
ad_list = [[] for i in range(l)]
al_dict = {}
for i, moji in enumerate(S):
if moji not in al_dict:
al_dict[moji] = i
else:
ad_list[al_dict[moji]].append(i)
return ad_list
S = eval(input())
T = eval(input())
ad_list = ad_list_ge... | false | 18.518519 | [
"+def ad_list_gen(S):",
"+ l = len(S)",
"+ ad_list = [[] for i in range(l)]",
"+ al_dict = {}",
"+ for i, moji in enumerate(S):",
"+ if moji not in al_dict:",
"+ al_dict[moji] = i",
"+ else:",
"+ ad_list[al_dict[moji]].append(i)",
"+ return ad_lis... | false | 0.036789 | 0.075173 | 0.489394 | [
"s718071322",
"s103435485"
] |
u901447859 | p03624 | python | s584852722 | s933889653 | 40 | 19 | 4,408 | 3,188 | Accepted | Accepted | 52.5 | import itertools
s = eval(input())
cnt = ord('a')
for k, _ in itertools.groupby(sorted(s)):
if not cnt == ord(k):
break
cnt += 1
print(([chr(cnt), 'None'][cnt>ord('z')])) | ans = sorted({chr(i) for i in range(97, 123)} - set(eval(input())))
print((ans[0] if ans else 'None')) | 8 | 2 | 177 | 95 | import itertools
s = eval(input())
cnt = ord("a")
for k, _ in itertools.groupby(sorted(s)):
if not cnt == ord(k):
break
cnt += 1
print(([chr(cnt), "None"][cnt > ord("z")]))
| ans = sorted({chr(i) for i in range(97, 123)} - set(eval(input())))
print((ans[0] if ans else "None"))
| false | 75 | [
"-import itertools",
"-",
"-s = eval(input())",
"-cnt = ord(\"a\")",
"-for k, _ in itertools.groupby(sorted(s)):",
"- if not cnt == ord(k):",
"- break",
"- cnt += 1",
"-print(([chr(cnt), \"None\"][cnt > ord(\"z\")]))",
"+ans = sorted({chr(i) for i in range(97, 123)} - set(eval(input()... | false | 0.032673 | 0.040702 | 0.802736 | [
"s584852722",
"s933889653"
] |
u060793972 | p03583 | python | s805400722 | s018880036 | 282 | 221 | 3,064 | 3,188 | Accepted | Accepted | 21.63 | n=int(eval(input()))
a=n*3//4+3
for i in range(max(n//4,1),a):
for j in range(a-3,3501):
k=4*i*j-n*(i+j)
if k==0:
continue
x,y=divmod(n*i*j,4*i*j-n*(i+j))
if y==0 and x>0:
print((i,j,x))
exit() | n=int(eval(input()))
a=n*3//4+3
for i in range(max(n//4,1),a):
for j in range(a-3,3501):
k=4*i*j-n*(i+j)
if k==0:
continue
x,y=divmod(n*i*j,k)
if y==0 and x>0:
print((i,j,x))
exit()
| 11 | 11 | 267 | 256 | n = int(eval(input()))
a = n * 3 // 4 + 3
for i in range(max(n // 4, 1), a):
for j in range(a - 3, 3501):
k = 4 * i * j - n * (i + j)
if k == 0:
continue
x, y = divmod(n * i * j, 4 * i * j - n * (i + j))
if y == 0 and x > 0:
print((i, j, x))
exit()... | n = int(eval(input()))
a = n * 3 // 4 + 3
for i in range(max(n // 4, 1), a):
for j in range(a - 3, 3501):
k = 4 * i * j - n * (i + j)
if k == 0:
continue
x, y = divmod(n * i * j, k)
if y == 0 and x > 0:
print((i, j, x))
exit()
| false | 0 | [
"- x, y = divmod(n * i * j, 4 * i * j - n * (i + j))",
"+ x, y = divmod(n * i * j, k)"
] | false | 0.336038 | 0.111946 | 3.001772 | [
"s805400722",
"s018880036"
] |
u631277801 | p03475 | python | s810698744 | s852306821 | 132 | 95 | 3,188 | 3,188 | Accepted | Accepted | 28.03 | N = int(eval(input()))
CSF = []
for i in range(N-1):
CSF.append(list(map(int, input().split())))
for i in range(N-1):
start = CSF[i][1]
goal = 0
for cur in range(i,N-1):
start = max(CSF[cur][1],
(goal//CSF[cur][2]+bool(goal%CSF[cur][2])) * CSF[cur][2])
... | import sys
stdin = sys.stdin
sys.setrecursionlimit(10**5)
def li(): return list(map(int, stdin.readline().split()))
def li_(): return [int(x)-1 for x in stdin.readline().split()]
def lf(): return list(map(float, stdin.readline().split()))
def ls(): return stdin.readline().split()
def ns(): return stdin.rea... | 18 | 31 | 389 | 872 | N = int(eval(input()))
CSF = []
for i in range(N - 1):
CSF.append(list(map(int, input().split())))
for i in range(N - 1):
start = CSF[i][1]
goal = 0
for cur in range(i, N - 1):
start = max(
CSF[cur][1], (goal // CSF[cur][2] + bool(goal % CSF[cur][2])) * CSF[cur][2]
)
... | import sys
stdin = sys.stdin
sys.setrecursionlimit(10**5)
def li():
return list(map(int, stdin.readline().split()))
def li_():
return [int(x) - 1 for x in stdin.readline().split()]
def lf():
return list(map(float, stdin.readline().split()))
def ls():
return stdin.readline().split()
def ns():
... | false | 41.935484 | [
"-N = int(eval(input()))",
"-CSF = []",
"-for i in range(N - 1):",
"- CSF.append(list(map(int, input().split())))",
"-for i in range(N - 1):",
"- start = CSF[i][1]",
"- goal = 0",
"- for cur in range(i, N - 1):",
"- start = max(",
"- CSF[cur][1], (goal // CSF[cur][2] ... | false | 0.040753 | 0.039889 | 1.021676 | [
"s810698744",
"s852306821"
] |
u285443936 | p02556 | python | s988046994 | s061008151 | 1,040 | 404 | 36,544 | 24,812 | Accepted | Accepted | 61.15 | import sys
input = sys.stdin.readline
# coding: utf-8
def det(p, q):
return p[0]*q[1] - p[1]*q[0]
def sub(p, q):
return (p[0]-q[0], p[1]-q[1])
def get_convex_hull(points):
# どの3点も直線上に並んでいないと仮定する。
n = len(points)
points.sort()
size_convex_hull = 0
ch = []
for i ... | N = int(eval(input()))
z = []
w = []
for i in range(N):
x,y = list(map(int,input().split()))
z.append(x+y)
w.append(x-y)
z_max = max(z)
z_min = min(z)
w_max = max(w)
w_min = min(w)
print((max(z_max-z_min,w_max-w_min))) | 66 | 14 | 1,431 | 231 | import sys
input = sys.stdin.readline
# coding: utf-8
def det(p, q):
return p[0] * q[1] - p[1] * q[0]
def sub(p, q):
return (p[0] - q[0], p[1] - q[1])
def get_convex_hull(points):
# どの3点も直線上に並んでいないと仮定する。
n = len(points)
points.sort()
size_convex_hull = 0
ch = []
for i in range(n):
... | N = int(eval(input()))
z = []
w = []
for i in range(N):
x, y = list(map(int, input().split()))
z.append(x + y)
w.append(x - y)
z_max = max(z)
z_min = min(z)
w_max = max(w)
w_min = min(w)
print((max(z_max - z_min, w_max - w_min)))
| false | 78.787879 | [
"-import sys",
"-",
"-input = sys.stdin.readline",
"-# coding: utf-8",
"-def det(p, q):",
"- return p[0] * q[1] - p[1] * q[0]",
"-",
"-",
"-def sub(p, q):",
"- return (p[0] - q[0], p[1] - q[1])",
"-",
"-",
"-def get_convex_hull(points):",
"- # どの3点も直線上に並んでいないと仮定する。",
"- n = l... | false | 0.122249 | 0.063586 | 1.922565 | [
"s988046994",
"s061008151"
] |
u905895868 | p03284 | python | s430072563 | s037673671 | 29 | 25 | 9,012 | 8,968 | Accepted | Accepted | 13.79 | snacks_num, persons = list(map(int, input().split()))
if snacks_num % persons == 0:
print((0))
else:
print((1)) | m, k = list(map(int, input().split()))
print((0 if m % k == 0 else 1))
| 6 | 3 | 115 | 66 | snacks_num, persons = list(map(int, input().split()))
if snacks_num % persons == 0:
print((0))
else:
print((1))
| m, k = list(map(int, input().split()))
print((0 if m % k == 0 else 1))
| false | 50 | [
"-snacks_num, persons = list(map(int, input().split()))",
"-if snacks_num % persons == 0:",
"- print((0))",
"-else:",
"- print((1))",
"+m, k = list(map(int, input().split()))",
"+print((0 if m % k == 0 else 1))"
] | false | 0.035862 | 0.037017 | 0.968817 | [
"s430072563",
"s037673671"
] |
u401452016 | p03163 | python | s358091086 | s683837287 | 1,855 | 739 | 654,684 | 171,528 | Accepted | Accepted | 60.16 | #EDP-D, E
import sys
from collections import defaultdict
n, W = list(map(int, sys.stdin.readline().split()))
dp = [defaultdict(int) for _ in range(n)]
#初期設定
w, v = list(map(int, sys.stdin.readline().split()))
dp[0][w] = v
#print(dp)
for i in range(1, n):
w, v = list(map(int, sys.stdin.readline().split()... | #DP D
def main():
import sys
N, W = list(map(int, sys.stdin.readline().split()))
L = tuple([tuple(map(int, sys.stdin.readline().split())) for _ in range(N)])
#print(L)
dp = [[0 for i in range(10**5+1)] for _ in range(N)]
for i in range(N):
w, v = L[i][0], L[i][1]
if i>=1... | 19 | 25 | 524 | 725 | # EDP-D, E
import sys
from collections import defaultdict
n, W = list(map(int, sys.stdin.readline().split()))
dp = [defaultdict(int) for _ in range(n)]
# 初期設定
w, v = list(map(int, sys.stdin.readline().split()))
dp[0][w] = v
# print(dp)
for i in range(1, n):
w, v = list(map(int, sys.stdin.readline().split()))
d... | # DP D
def main():
import sys
N, W = list(map(int, sys.stdin.readline().split()))
L = tuple([tuple(map(int, sys.stdin.readline().split())) for _ in range(N)])
# print(L)
dp = [[0 for i in range(10**5 + 1)] for _ in range(N)]
for i in range(N):
w, v = L[i][0], L[i][1]
if i >= 1:
... | false | 24 | [
"-# EDP-D, E",
"-import sys",
"-from collections import defaultdict",
"+# DP D",
"+def main():",
"+ import sys",
"-n, W = list(map(int, sys.stdin.readline().split()))",
"-dp = [defaultdict(int) for _ in range(n)]",
"-# 初期設定",
"-w, v = list(map(int, sys.stdin.readline().split()))",
"-dp[0][w] ... | false | 0.03956 | 0.099328 | 0.398276 | [
"s358091086",
"s683837287"
] |
u620846115 | p03076 | python | s674469876 | s705718329 | 29 | 25 | 9,188 | 9,080 | Accepted | Accepted | 13.79 | import math
a = []
for i in range(5):
a.append(int(eval(input())))
sum = 0
r =10
for i in range(5):
if a[i] % 10 ==0:
sum+=a[i]
elif a[i] % 10 !=0:
r = min(r,a[i]%10)
sum+= (10*math.ceil(a[i]/10))
print((sum-10+r)) | import math
a = [int(eval(input())) for i in range(5)]
sum = 0
r =10
for i in range(5):
if a[i] % 10 ==0:
sum+=a[i]
elif a[i] % 10 !=0:
r = min(r,a[i]%10)
sum+= (10*math.ceil(a[i]/10))
print((sum-10+r)) | 13 | 11 | 238 | 220 | import math
a = []
for i in range(5):
a.append(int(eval(input())))
sum = 0
r = 10
for i in range(5):
if a[i] % 10 == 0:
sum += a[i]
elif a[i] % 10 != 0:
r = min(r, a[i] % 10)
sum += 10 * math.ceil(a[i] / 10)
print((sum - 10 + r))
| import math
a = [int(eval(input())) for i in range(5)]
sum = 0
r = 10
for i in range(5):
if a[i] % 10 == 0:
sum += a[i]
elif a[i] % 10 != 0:
r = min(r, a[i] % 10)
sum += 10 * math.ceil(a[i] / 10)
print((sum - 10 + r))
| false | 15.384615 | [
"-a = []",
"-for i in range(5):",
"- a.append(int(eval(input())))",
"+a = [int(eval(input())) for i in range(5)]"
] | false | 0.043003 | 0.043547 | 0.987512 | [
"s674469876",
"s705718329"
] |
u848535504 | p02595 | python | s263978633 | s767696141 | 552 | 503 | 45,456 | 9,128 | Accepted | Accepted | 8.88 | import math
N,D = list(map(int,input().split()))
X = [list(map(int,input().split())) for i in range(N)]
ans = 0
for i in range(N):
if math.sqrt((X[i][0])**2+(X[i][1])**2) <= D:
ans += 1
print(ans) | N,D = list(map(int,input().split()))
ans = 0
for i in range(N):
X,Y = list(map(int,input().split()))
if X**2 + Y ** 2 <= D**2:
ans += 1
print(ans) | 10 | 9 | 221 | 166 | import math
N, D = list(map(int, input().split()))
X = [list(map(int, input().split())) for i in range(N)]
ans = 0
for i in range(N):
if math.sqrt((X[i][0]) ** 2 + (X[i][1]) ** 2) <= D:
ans += 1
print(ans)
| N, D = list(map(int, input().split()))
ans = 0
for i in range(N):
X, Y = list(map(int, input().split()))
if X**2 + Y**2 <= D**2:
ans += 1
print(ans)
| false | 10 | [
"-import math",
"-",
"-X = [list(map(int, input().split())) for i in range(N)]",
"- if math.sqrt((X[i][0]) ** 2 + (X[i][1]) ** 2) <= D:",
"+ X, Y = list(map(int, input().split()))",
"+ if X**2 + Y**2 <= D**2:"
] | false | 0.040081 | 0.043249 | 0.92676 | [
"s263978633",
"s767696141"
] |
u726615467 | p04045 | python | s186654048 | s156021457 | 60 | 54 | 3,648 | 3,064 | Accepted | Accepted | 10 | # encoding: utf-8
N, K = list(map(int, input().split()))
D = list(map(int, input().split()))
Db = []
for Di in range(10):
if Di not in D: Db.append(Di)
# print("#", Db)
for level in range(6):
if N // (10 ** level) < 1: break
# print("#", level)
memo = [None] * ((level + 1) * 10000)
de... | # encoding: utf-8
N, K = list(map(int, input().split()))
D = list(map(int, input().split()))
Db = []
for Di in range(10):
if Di not in D: Db.append(Di)
# print("#", Db)
for level in range(6):
if N // (10 ** level) < 1: break
# print("#", level)
# memo = [None] * ((level + 1) * 10000)
... | 32 | 32 | 819 | 825 | # encoding: utf-8
N, K = list(map(int, input().split()))
D = list(map(int, input().split()))
Db = []
for Di in range(10):
if Di not in D:
Db.append(Di)
# print("#", Db)
for level in range(6):
if N // (10**level) < 1:
break
# print("#", level)
memo = [None] * ((level + 1) * 10000)
def pay(pos, ... | # encoding: utf-8
N, K = list(map(int, input().split()))
D = list(map(int, input().split()))
Db = []
for Di in range(10):
if Di not in D:
Db.append(Di)
# print("#", Db)
for level in range(6):
if N // (10**level) < 1:
break
# print("#", level)
# memo = [None] * ((level + 1) * 10000)
def pay(pos, ... | false | 0 | [
"-memo = [None] * ((level + 1) * 10000)",
"-",
"-",
"+# memo = [None] * ((level + 1) * 10000)",
"- elif memo[pos * 10000 + tmp] != None:",
"- return memo[pos * 10000 + tmp]",
"+ # elif memo[pos * 10000 + tmp] != None: return memo[pos * 10000 + tmp]",
"- if memo[pos * 10000 + tmp] == No... | false | 0.042649 | 0.039959 | 1.067299 | [
"s186654048",
"s156021457"
] |
u018168283 | p02660 | python | s841667903 | s551745287 | 268 | 146 | 9,260 | 9,460 | Accepted | Accepted | 45.52 | n = int(eval(input()))
ans = 0
i = 2
while n>1 and i*i<=n:
if n % i == 0:
c = 0
while n % i == 0:
n = n / i
c += 1
j = 1
while c>=j:
ans=ans+1
c -= j
j += 1
i = i + 1
if n > 1:
ans = 1 + ans
print(ans) | n = int(eval(input()))
ans = 0
N = n
for i in range(2,int(n**0.5//1 + 2)):
if n % i == 0:
c = 0
while n%i == 0:
n//=i
c += 1
j = 1
while c-j >= 0:
ans += 1
c -= j
j += 1
if n > 1:
ans = ans + 1
print(ans) | 23 | 19 | 287 | 272 | n = int(eval(input()))
ans = 0
i = 2
while n > 1 and i * i <= n:
if n % i == 0:
c = 0
while n % i == 0:
n = n / i
c += 1
j = 1
while c >= j:
ans = ans + 1
c -= j
j += 1
i = i + 1
if n > 1:
ans = 1 + ans
print(ans)
| n = int(eval(input()))
ans = 0
N = n
for i in range(2, int(n**0.5 // 1 + 2)):
if n % i == 0:
c = 0
while n % i == 0:
n //= i
c += 1
j = 1
while c - j >= 0:
ans += 1
c -= j
j += 1
if n > 1:
ans = ans + 1
print(ans)
| false | 17.391304 | [
"-i = 2",
"-while n > 1 and i * i <= n:",
"+N = n",
"+for i in range(2, int(n**0.5 // 1 + 2)):",
"- n = n / i",
"+ n //= i",
"- while c >= j:",
"- ans = ans + 1",
"+ while c - j >= 0:",
"+ ans += 1",
"- i = i + 1",
"- ans = 1 + an... | false | 0.098628 | 0.228535 | 0.431569 | [
"s841667903",
"s551745287"
] |
u530383736 | p02597 | python | s212046725 | s326296881 | 63 | 44 | 10,772 | 10,740 | Accepted | Accepted | 30.16 | # -*- coding: utf-8 -*-
import sys
def main():
N = int( sys.stdin.readline() )
c_list = list(sys.stdin.readline().rstrip())
cnt = 0
L = 0
R = len(c_list) - 1
while L < R:
if (c_list[L] == "W") and (c_list[R] == "R"):
c_list[L], c_list[R] = c_list[R], c... | # -*- coding: utf-8 -*-
import sys
def main():
N = int( sys.stdin.readline() )
c_list = list(sys.stdin.readline().rstrip())
num_R = c_list.count("R")
cnt = 0
for i in range(num_R):
if c_list[i] == "W":
cnt += 1
print(cnt)
if __name__ == "__m... | 30 | 21 | 567 | 340 | # -*- coding: utf-8 -*-
import sys
def main():
N = int(sys.stdin.readline())
c_list = list(sys.stdin.readline().rstrip())
cnt = 0
L = 0
R = len(c_list) - 1
while L < R:
if (c_list[L] == "W") and (c_list[R] == "R"):
c_list[L], c_list[R] = c_list[R], c_list[L]
cnt... | # -*- coding: utf-8 -*-
import sys
def main():
N = int(sys.stdin.readline())
c_list = list(sys.stdin.readline().rstrip())
num_R = c_list.count("R")
cnt = 0
for i in range(num_R):
if c_list[i] == "W":
cnt += 1
print(cnt)
if __name__ == "__main__":
main()
| false | 30 | [
"+ num_R = c_list.count(\"R\")",
"- L = 0",
"- R = len(c_list) - 1",
"- while L < R:",
"- if (c_list[L] == \"W\") and (c_list[R] == \"R\"):",
"- c_list[L], c_list[R] = c_list[R], c_list[L]",
"+ for i in range(num_R):",
"+ if c_list[i] == \"W\":",
"- ... | false | 0.036503 | 0.037207 | 0.981087 | [
"s212046725",
"s326296881"
] |
u268210555 | p03148 | python | s231975054 | s264362380 | 615 | 551 | 29,244 | 19,188 | Accepted | Accepted | 10.41 | from collections import *
n, k = list(map(int, input().split()))
d, t = list(zip(*sorted(tuple(map(int, input().split()))[::-1] for _ in range(n))[::-1]))
c = Counter(t[:k])
x = len(c)
a = [sum(d[:k])]
for i in range(k)[::-1]:
if c[t[i]] > 1:
c[t[i]] -= 1
a.append(a[-1] - d[i])
b = [0]
fo... | n, k =list(map(int, input().split()))
dt = sorted(tuple(map(int, input().split()))[::-1] for _ in range(n))[::-1]
r = v = 0
a = []
s = set()
for i, (d,t) in enumerate(dt, 1):
if t in s:
if i <= k:
a.append(d)
v += d
else:
if i > k:
if not a:
... | 19 | 19 | 490 | 429 | from collections import *
n, k = list(map(int, input().split()))
d, t = list(
zip(*sorted(tuple(map(int, input().split()))[::-1] for _ in range(n))[::-1])
)
c = Counter(t[:k])
x = len(c)
a = [sum(d[:k])]
for i in range(k)[::-1]:
if c[t[i]] > 1:
c[t[i]] -= 1
a.append(a[-1] - d[i])
b = [0]
for i ... | n, k = list(map(int, input().split()))
dt = sorted(tuple(map(int, input().split()))[::-1] for _ in range(n))[::-1]
r = v = 0
a = []
s = set()
for i, (d, t) in enumerate(dt, 1):
if t in s:
if i <= k:
a.append(d)
v += d
else:
if i > k:
if not a:
... | false | 0 | [
"-from collections import *",
"-",
"-d, t = list(",
"- zip(*sorted(tuple(map(int, input().split()))[::-1] for _ in range(n))[::-1])",
"-)",
"-c = Counter(t[:k])",
"-x = len(c)",
"-a = [sum(d[:k])]",
"-for i in range(k)[::-1]:",
"- if c[t[i]] > 1:",
"- c[t[i]] -= 1",
"- a.ap... | false | 0.084361 | 0.077595 | 1.087204 | [
"s231975054",
"s264362380"
] |
u996758922 | p02412 | python | s816611509 | s675092200 | 1,750 | 1,250 | 7,664 | 7,656 | Accepted | Accepted | 28.57 | while True:
ins = list(map(int, input().split()))
ls = list(range(1,ins[0]+1))
if ins[0] == 0 and ins[1] == 0:
break
else:
counter = 0
for i in range(ins[0]-2):
for j in range(i+1, ins[0]-1):
for k in range(j+1, ins[0]):
... | while True:
ins = list(map(int, input().split()))
ls = list(range(1,ins[0]+1))
if ins[0] == 0 and ins[1] == 0:
break
else:
counter = 0
for i in range(ins[0]-2):
if ls[i]+ls[i+1]+ls[i+2] <= ins[1]:
for j in range(i+1, ins[... | 15 | 16 | 409 | 505 | while True:
ins = list(map(int, input().split()))
ls = list(range(1, ins[0] + 1))
if ins[0] == 0 and ins[1] == 0:
break
else:
counter = 0
for i in range(ins[0] - 2):
for j in range(i + 1, ins[0] - 1):
for k in range(j + 1, ins[0]):
... | while True:
ins = list(map(int, input().split()))
ls = list(range(1, ins[0] + 1))
if ins[0] == 0 and ins[1] == 0:
break
else:
counter = 0
for i in range(ins[0] - 2):
if ls[i] + ls[i + 1] + ls[i + 2] <= ins[1]:
for j in range(i + 1, ins[0] - 1):
... | false | 6.25 | [
"- for j in range(i + 1, ins[0] - 1):",
"- for k in range(j + 1, ins[0]):",
"- if ls[i] + ls[j] + ls[k] == ins[1]:",
"- counter += 1",
"+ if ls[i] + ls[i + 1] + ls[i + 2] <= ins[1]:",
"+ for j in range(i + 1, ins... | false | 0.045466 | 0.044842 | 1.013902 | [
"s816611509",
"s675092200"
] |
u936985471 | p03045 | python | s771209957 | s649721457 | 1,907 | 402 | 34,420 | 16,812 | Accepted | Accepted | 78.92 | n,m=list(map(int,input().split()))
parent=[i for i in range(n)]
rank=[0 for i in range(n)]
def find(a):
if parent[a]==a:
return a
else:
return find(parent[a])
def union(a,b):
ar=find(a)
br=find(b)
if ar==br:
return
if rank[a]>rank[b]:
parent[br]=ar
else:
parent[ar... | import sys
read=sys.stdin.read
readline=sys.stdin.readline
readlines=sys.stdin.readlines
# 0-indexed
class UnionFind:
N=0
parent=None
size=None
def __init__(self,N):
self.N=N
self.parent=[i for i in range(self.N)]
self.size=[1]*self.N
def root(self,x):
while x!=self.paren... | 42 | 59 | 676 | 1,216 | n, m = list(map(int, input().split()))
parent = [i for i in range(n)]
rank = [0 for i in range(n)]
def find(a):
if parent[a] == a:
return a
else:
return find(parent[a])
def union(a, b):
ar = find(a)
br = find(b)
if ar == br:
return
if rank[a] > rank[b]:
parent... | import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
# 0-indexed
class UnionFind:
N = 0
parent = None
size = None
def __init__(self, N):
self.N = N
self.parent = [i for i in range(self.N)]
self.size = [1] * self.N
def root(self, x)... | false | 28.813559 | [
"-n, m = list(map(int, input().split()))",
"-parent = [i for i in range(n)]",
"-rank = [0 for i in range(n)]",
"+import sys",
"+",
"+read = sys.stdin.read",
"+readline = sys.stdin.readline",
"+readlines = sys.stdin.readlines",
"+# 0-indexed",
"+class UnionFind:",
"+ N = 0",
"+ parent = N... | false | 0.156652 | 0.047268 | 3.314117 | [
"s771209957",
"s649721457"
] |
u189487046 | p02720 | python | s503391493 | s231029638 | 284 | 182 | 10,904 | 12,396 | Accepted | Accepted | 35.92 | from collections import deque
K = int(eval(input()))
dque = deque([1, 2, 3, 4, 5, 6, 7, 8, 9])
ans = 0
while True:
v = dque.popleft()
ans += 1
if ans == K:
print(v)
exit(0)
strv = str(v)
if strv[-1] == '0':
dque.append(int(strv+'0'))
dque.append(int... | from collections import deque
K = int(eval(input()))
dque = deque([1, 2, 3, 4, 5, 6, 7, 8, 9])
ans = 0
while True:
v = dque.popleft()
ans += 1
if ans == K:
print(v)
exit(0)
for i in range(-1, 2):
# 10で割った余りを取得して、iを足す
tmp = v % 10+i
if not(0 <= t... | 25 | 19 | 596 | 376 | from collections import deque
K = int(eval(input()))
dque = deque([1, 2, 3, 4, 5, 6, 7, 8, 9])
ans = 0
while True:
v = dque.popleft()
ans += 1
if ans == K:
print(v)
exit(0)
strv = str(v)
if strv[-1] == "0":
dque.append(int(strv + "0"))
dque.append(int(strv + "1"))
... | from collections import deque
K = int(eval(input()))
dque = deque([1, 2, 3, 4, 5, 6, 7, 8, 9])
ans = 0
while True:
v = dque.popleft()
ans += 1
if ans == K:
print(v)
exit(0)
for i in range(-1, 2):
# 10で割った余りを取得して、iを足す
tmp = v % 10 + i
if not (0 <= tmp <= 9):
... | false | 24 | [
"- strv = str(v)",
"- if strv[-1] == \"0\":",
"- dque.append(int(strv + \"0\"))",
"- dque.append(int(strv + \"1\"))",
"- elif strv[-1] == \"9\":",
"- dque.append(int(strv + \"8\"))",
"- dque.append(int(strv + \"9\"))",
"- else:",
"- endv = int(strv[-1])... | false | 0.08271 | 0.071389 | 1.15859 | [
"s503391493",
"s231029638"
] |
u440566786 | p02890 | python | s191081901 | s591638125 | 1,148 | 768 | 120,108 | 120,476 | Accepted | Accepted | 33.1 | import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=lambda :sys.stdin.readline().rstrip()
def bisection(l,r,f,discrete=True,left=True):
eps=1 if discrete else 10**-12
if((not left)^f(r)): return r if left else r+1
elif(left^f(l)): return l-1 if left else l
while(r-l>... | import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=lambda :sys.stdin.readline().rstrip()
def resolve():
from collections import Counter
n=int(eval(input()))
A=list(Counter(list(map(int,input().split()))).values())
A.sort()
m=len(A)
S=[0]*(m+1) # cumulative... | 32 | 25 | 945 | 652 | import sys
sys.setrecursionlimit(2147483647)
INF = float("inf")
MOD = 10**9 + 7
input = lambda: sys.stdin.readline().rstrip()
def bisection(l, r, f, discrete=True, left=True):
eps = 1 if discrete else 10**-12
if (not left) ^ f(r):
return r if left else r + 1
elif left ^ f(l):
return l - 1... | import sys
sys.setrecursionlimit(2147483647)
INF = float("inf")
MOD = 10**9 + 7
input = lambda: sys.stdin.readline().rstrip()
def resolve():
from collections import Counter
n = int(eval(input()))
A = list(Counter(list(map(int, input().split()))).values())
A.sort()
m = len(A)
S = [0] * (m + 1... | false | 21.875 | [
"-def bisection(l, r, f, discrete=True, left=True):",
"- eps = 1 if discrete else 10**-12",
"- if (not left) ^ f(r):",
"- return r if left else r + 1",
"- elif left ^ f(l):",
"- return l - 1 if left else l",
"- while r - l > eps:",
"- h = (l + r) // 2 if discrete else ... | false | 0.045193 | 0.046589 | 0.970031 | [
"s191081901",
"s591638125"
] |
u983918956 | p03331 | python | s837236773 | s654112499 | 406 | 18 | 3,064 | 3,064 | Accepted | Accepted | 95.57 | N = int(eval(input()))
ans = N
for i in range(1,N):
A,B = 0,0
A_str = list(str(i))
B_str = list(str(N-i))
for e in A_str:
A += int(e)
for e in B_str:
B += int(e)
if A + B < ans:
ans = A + B
print(ans) | def degit_sum(n):
if len(str(n)) < 2:
return n
s = list(str(n))
s = [int(e) for e in s]
return sum(s)
N = int(eval(input()))
degit = len(str(N))
if N % pow(10,degit-1) == 0 and N >= 10:
degit -= 1
A = pow(10,degit-1)
B = N - A
ans = degit_sum(A) + degit_sum(B)
print(ans) | 13 | 15 | 261 | 308 | N = int(eval(input()))
ans = N
for i in range(1, N):
A, B = 0, 0
A_str = list(str(i))
B_str = list(str(N - i))
for e in A_str:
A += int(e)
for e in B_str:
B += int(e)
if A + B < ans:
ans = A + B
print(ans)
| def degit_sum(n):
if len(str(n)) < 2:
return n
s = list(str(n))
s = [int(e) for e in s]
return sum(s)
N = int(eval(input()))
degit = len(str(N))
if N % pow(10, degit - 1) == 0 and N >= 10:
degit -= 1
A = pow(10, degit - 1)
B = N - A
ans = degit_sum(A) + degit_sum(B)
print(ans)
| false | 13.333333 | [
"+def degit_sum(n):",
"+ if len(str(n)) < 2:",
"+ return n",
"+ s = list(str(n))",
"+ s = [int(e) for e in s]",
"+ return sum(s)",
"+",
"+",
"-ans = N",
"-for i in range(1, N):",
"- A, B = 0, 0",
"- A_str = list(str(i))",
"- B_str = list(str(N - i))",
"- for ... | false | 0.244109 | 0.035918 | 6.796227 | [
"s837236773",
"s654112499"
] |
u829796346 | p02598 | python | s745622484 | s633791421 | 1,782 | 1,247 | 32,148 | 32,168 | Accepted | Accepted | 30.02 | #!/usr/bin/env python3
# N,M = map(int,sys.stdin.readline().split())
# a = tuple(map(int,sys.stdin.readline().split())) # single line with multi param
# a = tuple(int(sys.stdin.readline()) for _ in range(N)) # multi line with single param
# a = tuple(tuple(map(int,sys.stdin.readline().rstrip().split())) for _ in ra... | #!/usr/bin/env python3
# N,M = map(int,sys.stdin.readline().split())
# a = tuple(map(int,sys.stdin.readline().split())) # single line with multi param
# a = tuple(int(sys.stdin.readline()) for _ in range(N)) # multi line with single param
# a = tuple(tuple(map(int,sys.stdin.readline().rstrip().split())) for _ in ra... | 44 | 45 | 1,403 | 1,443 | #!/usr/bin/env python3
# N,M = map(int,sys.stdin.readline().split())
# a = tuple(map(int,sys.stdin.readline().split())) # single line with multi param
# a = tuple(int(sys.stdin.readline()) for _ in range(N)) # multi line with single param
# a = tuple(tuple(map(int,sys.stdin.readline().rstrip().split())) for _ in range(... | #!/usr/bin/env python3
# N,M = map(int,sys.stdin.readline().split())
# a = tuple(map(int,sys.stdin.readline().split())) # single line with multi param
# a = tuple(int(sys.stdin.readline()) for _ in range(N)) # multi line with single param
# a = tuple(tuple(map(int,sys.stdin.readline().rstrip().split())) for _ in range(... | false | 2.222222 | [
"- k = k - (math.ceil(a[i] / v) - 1)",
"+ k = k - (((a[i] + v - 1) // v) - 1)",
"+ # k = k - (math.ceil(a[i]/v) - 1)"
] | false | 0.039077 | 0.03932 | 0.993822 | [
"s745622484",
"s633791421"
] |
u638795007 | p03805 | python | s501476876 | s543601268 | 433 | 45 | 4,212 | 5,232 | Accepted | Accepted | 89.61 | def examC():
def search_graph(graph_releation, result_list, current_idx=0, path=[0]):
for i in range(len(graph_releation[current_idx])):
next_idx = graph_releation[current_idx][i]
#次の点の候補全部ひとつずつやる
tmp_path = copy.deepcopy(path)
#今まで通った点
if n... | def examA():
O = SI()
E = SI()
ans = ""
for i in range(len(O)+len(E)):
if i%2==0:
ans += O[i//2]
else:
ans += E[i//2]
print(ans)
return
def examB():
A = LI()
A.sort()
ans = (A[2] - A[0]) // 2 + (A[2] - A[1]) // 2
if (A[2]-A... | 41 | 122 | 1,285 | 2,691 | def examC():
def search_graph(graph_releation, result_list, current_idx=0, path=[0]):
for i in range(len(graph_releation[current_idx])):
next_idx = graph_releation[current_idx][i]
# 次の点の候補全部ひとつずつやる
tmp_path = copy.deepcopy(path)
# 今まで通った点
if next_i... | def examA():
O = SI()
E = SI()
ans = ""
for i in range(len(O) + len(E)):
if i % 2 == 0:
ans += O[i // 2]
else:
ans += E[i // 2]
print(ans)
return
def examB():
A = LI()
A.sort()
ans = (A[2] - A[0]) // 2 + (A[2] - A[1]) // 2
if (A[2] - A[0]... | false | 66.393443 | [
"-def examC():",
"- def search_graph(graph_releation, result_list, current_idx=0, path=[0]):",
"- for i in range(len(graph_releation[current_idx])):",
"- next_idx = graph_releation[current_idx][i]",
"- # 次の点の候補全部ひとつずつやる",
"- tmp_path = copy.deepcopy(path)",
"- ... | false | 0.098274 | 0.043172 | 2.276338 | [
"s501476876",
"s543601268"
] |
u997641430 | p03179 | python | s410068130 | s909647999 | 640 | 587 | 119,516 | 119,388 | Accepted | Accepted | 8.28 | n = int(eval(input()))
S = eval(input())
p = 10**9+7
DP = [[0 for j in range(n+1)] for i in range(n+1)]
for j in range(n):
DP[1][j] = 1
for i in range(2, n+1):
A = [0]
for j in range(n):
A.append(A[-1]+DP[i-1][j])
for j in range(n-i+1):
if S[i-2] == '<':
DP[i][j] ... | n = int(eval(input()))
S = eval(input())
p = 10**9 + 7
DP = [[0 for j in range(n + 1)] for i in range(n + 1)]
for j in range(n):
DP[1][j] = 1
for i in range(2, n + 1):
A = [0]
for j in range(n):
A.append(A[-1] + DP[i - 1][j])
for j in range(n - i + 1):
if S[i - 2] == '<':
... | 16 | 16 | 403 | 431 | n = int(eval(input()))
S = eval(input())
p = 10**9 + 7
DP = [[0 for j in range(n + 1)] for i in range(n + 1)]
for j in range(n):
DP[1][j] = 1
for i in range(2, n + 1):
A = [0]
for j in range(n):
A.append(A[-1] + DP[i - 1][j])
for j in range(n - i + 1):
if S[i - 2] == "<":
DP[... | n = int(eval(input()))
S = eval(input())
p = 10**9 + 7
DP = [[0 for j in range(n + 1)] for i in range(n + 1)]
for j in range(n):
DP[1][j] = 1
for i in range(2, n + 1):
A = [0]
for j in range(n):
A.append(A[-1] + DP[i - 1][j])
for j in range(n - i + 1):
if S[i - 2] == "<":
DP[... | false | 0 | [
"- DP[i][j] = (A[n - (i - 1) + 1] - A[j + 1]) % p",
"+ DP[i][j] = (A[n - i + 1 + 1] - A[j + 1]) % p"
] | false | 0.036431 | 0.060095 | 0.606213 | [
"s410068130",
"s909647999"
] |
u697386253 | p02725 | python | s452944667 | s449748362 | 122 | 102 | 26,060 | 26,420 | Accepted | Accepted | 16.39 | k,n = list(map(int, input().split()))
a = list(map(int, input().split()))
b = 0
for i in range(n):
if i == 0:
if a[0] + k - a[-1] > b:
b = a[0] - a[-1] + k
if a[i] - a[i-1] > b:
b = a[i] - a[i-1]
print((k - b)) | k,n = list(map(int, input().split()))
a = list(map(int, input().split()))
longest = k - (a[-1] - a[0])
for i in range(n-1):
if a[i+1] - a[i] > longest:
longest = a[i+1] - a[i]
print((k-longest)) | 12 | 10 | 251 | 210 | k, n = list(map(int, input().split()))
a = list(map(int, input().split()))
b = 0
for i in range(n):
if i == 0:
if a[0] + k - a[-1] > b:
b = a[0] - a[-1] + k
if a[i] - a[i - 1] > b:
b = a[i] - a[i - 1]
print((k - b))
| k, n = list(map(int, input().split()))
a = list(map(int, input().split()))
longest = k - (a[-1] - a[0])
for i in range(n - 1):
if a[i + 1] - a[i] > longest:
longest = a[i + 1] - a[i]
print((k - longest))
| false | 16.666667 | [
"-b = 0",
"-for i in range(n):",
"- if i == 0:",
"- if a[0] + k - a[-1] > b:",
"- b = a[0] - a[-1] + k",
"- if a[i] - a[i - 1] > b:",
"- b = a[i] - a[i - 1]",
"-print((k - b))",
"+longest = k - (a[-1] - a[0])",
"+for i in range(n - 1):",
"+ if a[i + 1] - a[i] > ... | false | 0.115278 | 0.036154 | 3.188515 | [
"s452944667",
"s449748362"
] |
u870164956 | p02900 | python | s077391749 | s368722028 | 284 | 192 | 113,904 | 40,044 | Accepted | Accepted | 32.39 | # 1. 最大公約数を求める(ユークリッドの互除法)
# 2. 最大公約数を素因数分解する。
# 3. 2.の結果に含まれる素因数の種類の数＋１が答え
def main():
a, b = sorted(list(map(int, input().split())), reverse = True)
while b != 0: a, b = b, a % b
print((num_facto(a) + 1))
def num_facto(n):
ans = 0
max_n = int(n ** 0.5) + 1
is_prime = [True for x in range... | # 1. 最大公約数を求める(ユークリッドの互除法)
# 2. 最大公約数を2と3以上の奇数で順次割っていくする（下から計算したら、素数判定は不要）
# 3. 2.の結果に含まれる数の種類の数＋１が答え
def main():
a, b = sorted(list(map(int, input().split())), reverse = True) #aのほうを大きくする
while b != 0: a, b = b, a % b #最大公約数を求める
print((num_facto(a) + 1))
def num_facto(n):
ans = 0
max_n = int... | 29 | 27 | 772 | 663 | # 1. 最大公約数を求める(ユークリッドの互除法)
# 2. 最大公約数を素因数分解する。
# 3. 2.の結果に含まれる素因数の種類の数＋１が答え
def main():
a, b = sorted(list(map(int, input().split())), reverse=True)
while b != 0:
a, b = b, a % b
print((num_facto(a) + 1))
def num_facto(n):
ans = 0
max_n = int(n**0.5) + 1
is_prime = [True for x in range... | # 1. 最大公約数を求める(ユークリッドの互除法)
# 2. 最大公約数を2と3以上の奇数で順次割っていくする（下から計算したら、素数判定は不要）
# 3. 2.の結果に含まれる数の種類の数＋１が答え
def main():
a, b = sorted(list(map(int, input().split())), reverse=True) # aのほうを大きくする
while b != 0:
a, b = b, a % b # 最大公約数を求める
print((num_facto(a) + 1))
def num_facto(n):
ans = 0
max_n ... | false | 6.896552 | [
"-# 2. 最大公約数を素因数分解する。",
"-# 3. 2.の結果に含まれる素因数の種類の数＋１が答え",
"+# 2. 最大公約数を2と3以上の奇数で順次割っていくする（下から計算したら、素数判定は不要）",
"+# 3. 2.の結果に含まれる数の種類の数＋１が答え",
"- a, b = sorted(list(map(int, input().split())), reverse=True)",
"+ a, b = sorted(list(map(int, input().split())), reverse=True) # aのほうを大きくする",
"- a,... | false | 0.043888 | 0.042092 | 1.042664 | [
"s077391749",
"s368722028"
] |
u644907318 | p03761 | python | s922609013 | s035275778 | 185 | 26 | 40,560 | 9,116 | Accepted | Accepted | 85.95 | n = int(eval(input()))
G = []
for _ in range(n):
S = list(input().strip())
C = {}
for i in range(len(S)):
x = S[i]
if x not in C:
C[x] = 0
C[x] += 1
G.append(C)
A = {}
for i in range(97,123):
flag = 0
cmin = 50
for C in G:
if chr(i)... | n = int(eval(input()))
S = [input().strip() for _ in range(n)]
C = {chr(i):0 for i in range(97,123)}
for i in range(len(S[0])):
C[S[0][i]] += 1
for j in range(1,n):
C1 = {chr(i):0 for i in range(97,123)}
for i in range(len(S[j])):
C1[S[j][i]] += 1
for i in range(97,123):
C[chr(... | 28 | 16 | 557 | 447 | n = int(eval(input()))
G = []
for _ in range(n):
S = list(input().strip())
C = {}
for i in range(len(S)):
x = S[i]
if x not in C:
C[x] = 0
C[x] += 1
G.append(C)
A = {}
for i in range(97, 123):
flag = 0
cmin = 50
for C in G:
if chr(i) not in C:
... | n = int(eval(input()))
S = [input().strip() for _ in range(n)]
C = {chr(i): 0 for i in range(97, 123)}
for i in range(len(S[0])):
C[S[0][i]] += 1
for j in range(1, n):
C1 = {chr(i): 0 for i in range(97, 123)}
for i in range(len(S[j])):
C1[S[j][i]] += 1
for i in range(97, 123):
C[chr(i)] ... | false | 42.857143 | [
"-G = []",
"-for _ in range(n):",
"- S = list(input().strip())",
"- C = {}",
"- for i in range(len(S)):",
"- x = S[i]",
"- if x not in C:",
"- C[x] = 0",
"- C[x] += 1",
"- G.append(C)",
"-A = {}",
"+S = [input().strip() for _ in range(n)]",
"+C = {... | false | 0.046881 | 0.03863 | 1.213565 | [
"s922609013",
"s035275778"
] |
u350093546 | p02549 | python | s853806997 | s252356738 | 123 | 110 | 84,844 | 76,620 | Accepted | Accepted | 10.57 | n,k=list(map(int,input().split()))
lst=[list(map(int,input().split())) for i in range(k)]
mod=998244353
dp=[1]
imos=[0]*(2*n+10)
imos[0]=1
imos[1]=-1
for i in range(n):
for l,r in lst:
imos[i+l]+=dp[-1]
imos[i+r+1]-=dp[-1]
dp.append((dp[-1]+imos[i+1])%mod)
print((dp[n-1])) | n,k=list(map(int,input().split()))
lst=[list(map(int,input().split())) for i in range(k)]
mod=998244353
dp=[0]*(2*n+10)
dp[0]=1
dp[1]=-1
for i in range(n):
for l,r in lst:
dp[i+l]+=dp[i]
dp[i+r+1]-=dp[i]
dp[i+1]+=dp[i]
dp[i+1]%=mod
print((dp[n-1])) | 17 | 17 | 309 | 292 | n, k = list(map(int, input().split()))
lst = [list(map(int, input().split())) for i in range(k)]
mod = 998244353
dp = [1]
imos = [0] * (2 * n + 10)
imos[0] = 1
imos[1] = -1
for i in range(n):
for l, r in lst:
imos[i + l] += dp[-1]
imos[i + r + 1] -= dp[-1]
dp.append((dp[-1] + imos[i + 1]) % mod)... | n, k = list(map(int, input().split()))
lst = [list(map(int, input().split())) for i in range(k)]
mod = 998244353
dp = [0] * (2 * n + 10)
dp[0] = 1
dp[1] = -1
for i in range(n):
for l, r in lst:
dp[i + l] += dp[i]
dp[i + r + 1] -= dp[i]
dp[i + 1] += dp[i]
dp[i + 1] %= mod
print((dp[n - 1]))
| false | 0 | [
"-dp = [1]",
"-imos = [0] * (2 * n + 10)",
"-imos[0] = 1",
"-imos[1] = -1",
"+dp = [0] * (2 * n + 10)",
"+dp[0] = 1",
"+dp[1] = -1",
"- imos[i + l] += dp[-1]",
"- imos[i + r + 1] -= dp[-1]",
"- dp.append((dp[-1] + imos[i + 1]) % mod)",
"+ dp[i + l] += dp[i]",
"+ ... | false | 0.045474 | 0.043292 | 1.050412 | [
"s853806997",
"s252356738"
] |
u029000441 | p02735 | python | s229136257 | s439051421 | 219 | 53 | 43,760 | 3,572 | Accepted | Accepted | 75.8 | H,W = list(map(int,input().split()))
s = []
for i in range(H):
S = list(eval(input()))
s.append(S)
dis = [[float("inf")] * W for i in range(H)]
if s[0][0] == "#":
dis[0][0] = 1
else:
dis[0][0] = 0
for i in range(H):
for j in range(W):
if i != H-1:
i... | #dpでできないかな？
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
from collections import Counter, deque
from collections import defaultdict
from itertools import combinations, permutations, accumulate, groupby, product
from bisect import bisect_left,bisect_right
from heapq import heapify, heappop,... | 38 | 57 | 733 | 1,745 | H, W = list(map(int, input().split()))
s = []
for i in range(H):
S = list(eval(input()))
s.append(S)
dis = [[float("inf")] * W for i in range(H)]
if s[0][0] == "#":
dis[0][0] = 1
else:
dis[0][0] = 0
for i in range(H):
for j in range(W):
if i != H - 1:
if s[i][j] == "." and s[i + ... | # dpでできないかな？
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
from collections import Counter, deque
from collections import defaultdict
from itertools import combinations, permutations, accumulate, groupby, product
from bisect import bisect_left, bisect_right
from heapq import heapify, heappop, heap... | false | 33.333333 | [
"-H, W = list(map(int, input().split()))",
"-s = []",
"-for i in range(H):",
"- S = list(eval(input()))",
"- s.append(S)",
"-dis = [[float(\"inf\")] * W for i in range(H)]",
"-if s[0][0] == \"#\":",
"- dis[0][0] = 1",
"-else:",
"- dis[0][0] = 0",
"-for i in range(H):",
"- for j ... | false | 0.035033 | 0.03648 | 0.960328 | [
"s229136257",
"s439051421"
] |
u721446434 | p02400 | python | s657678231 | s575434625 | 30 | 20 | 7,416 | 7,424 | Accepted | Accepted | 33.33 | pi = 3.1415926535897932
r = float(eval(input()))
print((r * r * pi, 2 * pi * r)) | pi = 3.141592653589793238
r = float(eval(input()))
print((r * r * pi, 2 * pi * r)) | 3 | 3 | 74 | 76 | pi = 3.1415926535897932
r = float(eval(input()))
print((r * r * pi, 2 * pi * r))
| pi = 3.141592653589793238
r = float(eval(input()))
print((r * r * pi, 2 * pi * r))
| false | 0 | [
"-pi = 3.1415926535897932",
"+pi = 3.141592653589793238"
] | false | 0.114461 | 0.038939 | 2.93949 | [
"s657678231",
"s575434625"
] |
u767664985 | p02720 | python | s292046561 | s692420682 | 266 | 187 | 12,208 | 12,228 | Accepted | Accepted | 29.7 | from heapq import heapify, heappop, heappush
# 次の桁の生成ルール ex. 1 -> 10, 11, 12
def next_int(n):
nums = {0: [0, 1],
1: [0, 1, 2],
2: [1, 2, 3],
3: [2, 3, 4],
4: [3, 4, 5],
5: [4, 5, 6],
6: [5, 6, 7],
7: [6, 7, 8],
... | from heapq import heapify, heappop, heappush
# 次の桁の生成ルール ex. 1 -> 10, 11, 12
def next_int(n):
if n == 0:
return [0, 1]
elif n == 9:
return [8, 9]
else:
return [n-1, n, n+1]
K = int(eval(input()))
queue = [1, 2, 3, 4, 5, 6, 7, 8, 9] # とりあえず 1 桁目を初期値にとる
heapify(queue)
... | 27 | 22 | 688 | 525 | from heapq import heapify, heappop, heappush
# 次の桁の生成ルール ex. 1 -> 10, 11, 12
def next_int(n):
nums = {
0: [0, 1],
1: [0, 1, 2],
2: [1, 2, 3],
3: [2, 3, 4],
4: [3, 4, 5],
5: [4, 5, 6],
6: [5, 6, 7],
7: [6, 7, 8],
8: [7, 8, 9],
9: [8, 9]... | from heapq import heapify, heappop, heappush
# 次の桁の生成ルール ex. 1 -> 10, 11, 12
def next_int(n):
if n == 0:
return [0, 1]
elif n == 9:
return [8, 9]
else:
return [n - 1, n, n + 1]
K = int(eval(input()))
queue = [1, 2, 3, 4, 5, 6, 7, 8, 9] # とりあえず 1 桁目を初期値にとる
heapify(queue)
for _ in ... | false | 18.518519 | [
"- nums = {",
"- 0: [0, 1],",
"- 1: [0, 1, 2],",
"- 2: [1, 2, 3],",
"- 3: [2, 3, 4],",
"- 4: [3, 4, 5],",
"- 5: [4, 5, 6],",
"- 6: [5, 6, 7],",
"- 7: [6, 7, 8],",
"- 8: [7, 8, 9],",
"- 9: [8, 9],",
"- }",
"- retur... | false | 0.151509 | 0.054663 | 2.771697 | [
"s292046561",
"s692420682"
] |
u732870425 | p03548 | python | s423414535 | s059516772 | 30 | 17 | 2,940 | 3,064 | Accepted | Accepted | 43.33 | X, Y, Z = list(map(int, input().split()))
ans = 0
X -= Z
while Y+Z <= X:
X -= Y+Z
ans += 1
print(ans) | X, Y, Z = list(map(int, input().split()))
print(((X - Z) // (Y + Z))) | 7 | 2 | 109 | 62 | X, Y, Z = list(map(int, input().split()))
ans = 0
X -= Z
while Y + Z <= X:
X -= Y + Z
ans += 1
print(ans)
| X, Y, Z = list(map(int, input().split()))
print(((X - Z) // (Y + Z)))
| false | 71.428571 | [
"-ans = 0",
"-X -= Z",
"-while Y + Z <= X:",
"- X -= Y + Z",
"- ans += 1",
"-print(ans)",
"+print(((X - Z) // (Y + Z)))"
] | false | 0.041638 | 0.036165 | 1.151335 | [
"s423414535",
"s059516772"
] |
u285891772 | p03599 | python | s389221391 | s309181015 | 47 | 41 | 10,508 | 10,416 | Accepted | Accepted | 12.77 | 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, gcd
from itertools import accumulate, permutations, combinations, combinations_with_replacement, product, groupby
from operator import itemge... | 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, gcd
from itertools import accumulate, permutations, combinations, combinations_with_replacement, product, groupby
from operator import itemge... | 75 | 82 | 1,932 | 2,080 | 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,
gcd,
)
from itertools import (
accumulate,
permutations,
combinations,
... | 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,
gcd,
)
from itertools import (
accumulate,
permutations,
combinations,
... | false | 8.536585 | [
"-sugar = [0] * (F + 1)",
"-f = F // 2",
"-for c in range(f // C + 1):",
"- for d in range((f - c * C) // D + 1):",
"- sugar[c * C + d * D] = 1",
"+sugar = [0] * (F + 1)",
"+sugar[0] = 1",
"+for i in range(1, F + 1):",
"+ sugar[i] = 0 < (sugar[i - C] * (0 < i) + sugar[i - D] * (0 < i))"... | false | 0.040696 | 0.038241 | 1.064191 | [
"s389221391",
"s309181015"
] |
u505564549 | p02659 | python | s188704059 | s081648024 | 29 | 21 | 10,056 | 9,080 | Accepted | Accepted | 27.59 | import math
from decimal import *
a,b=input().split()
print((math.floor(Decimal(a)*Decimal(b))))
| a,b=input().split()
a=int(a)
val=100*int(b[0])+10*int(b[2])+int(b[3])
print(((a*val)//100)) | 4 | 4 | 98 | 92 | import math
from decimal import *
a, b = input().split()
print((math.floor(Decimal(a) * Decimal(b))))
| a, b = input().split()
a = int(a)
val = 100 * int(b[0]) + 10 * int(b[2]) + int(b[3])
print(((a * val) // 100))
| false | 0 | [
"-import math",
"-from decimal import *",
"-",
"-print((math.floor(Decimal(a) * Decimal(b))))",
"+a = int(a)",
"+val = 100 * int(b[0]) + 10 * int(b[2]) + int(b[3])",
"+print(((a * val) // 100))"
] | false | 0.111864 | 0.039662 | 2.820435 | [
"s188704059",
"s081648024"
] |
u203843959 | p02990 | python | s521013909 | s015201303 | 89 | 21 | 3,316 | 3,316 | Accepted | Accepted | 76.4 | MOD=10**9+7
N,K=list(map(int,input().split()))
def powmod(a,p):
if p==0:
return 1
elif p==1:
return a
else:
pow2=powmod(a,p//2)
if p%2==0:
return (pow2**2)%MOD
else:
return (a*pow2**2)%MOD
def invmod(a):
return powmod(a,MOD-2)
term1=N-K+1
term2=1
for i in ran... | MOD=10**9+7
N,K=list(map(int,input().split()))
inv_table = [0]+[1]
for i in range(2,K+2):
inv_table.append(-(MOD//i)*inv_table[MOD%i]%MOD)
term1=N-K+1
term2=1
for i in range(1,K+1):
#print(term1,term2)
print(((term1*term2)%MOD))
term1=term1*(N-K+1-i)*inv_table[i+1]%MOD
term2=term2*(K-i)... | 25 | 15 | 457 | 329 | MOD = 10**9 + 7
N, K = list(map(int, input().split()))
def powmod(a, p):
if p == 0:
return 1
elif p == 1:
return a
else:
pow2 = powmod(a, p // 2)
if p % 2 == 0:
return (pow2**2) % MOD
else:
return (a * pow2**2) % MOD
def invmod(a):
retu... | MOD = 10**9 + 7
N, K = list(map(int, input().split()))
inv_table = [0] + [1]
for i in range(2, K + 2):
inv_table.append(-(MOD // i) * inv_table[MOD % i] % MOD)
term1 = N - K + 1
term2 = 1
for i in range(1, K + 1):
# print(term1,term2)
print(((term1 * term2) % MOD))
term1 = term1 * (N - K + 1 - i) * inv_... | false | 40 | [
"-",
"-",
"-def powmod(a, p):",
"- if p == 0:",
"- return 1",
"- elif p == 1:",
"- return a",
"- else:",
"- pow2 = powmod(a, p // 2)",
"- if p % 2 == 0:",
"- return (pow2**2) % MOD",
"- else:",
"- return (a * pow2**2) % MOD",
... | false | 0.04097 | 0.040933 | 1.000911 | [
"s521013909",
"s015201303"
] |
u490642448 | p02720 | python | s475399386 | s745200829 | 110 | 19 | 11,968 | 3,188 | Accepted | Accepted | 82.73 | k = int(eval(input()))
# キュー
from collections import deque
d = deque()
for i in range(1,10):
d.append(i)
for i in range(k):
tmp = d.popleft()
right = tmp%10
if(right!=0):
d.append(tmp*10+right-1)
d.append(tmp*10+right)
if(right!=9):
d.append(tmp*10+right+1)
... | k = int(eval(input()))
def calc_dp(n):
if(n==0):
return 0
s = str(n)
slen = len(s)
dp = [[0] * 12 for _ in range(slen)]
dp_o = [[0] * 12 for _ in range(slen)]
#initial
for i in range(1,int(s[0])):
dp[0][i+1] = 1
dp_o[0][int(s[0])+1] = 1
#update
... | 19 | 53 | 324 | 1,067 | k = int(eval(input()))
# キュー
from collections import deque
d = deque()
for i in range(1, 10):
d.append(i)
for i in range(k):
tmp = d.popleft()
right = tmp % 10
if right != 0:
d.append(tmp * 10 + right - 1)
d.append(tmp * 10 + right)
if right != 9:
d.append(tmp * 10 + right + 1)
... | k = int(eval(input()))
def calc_dp(n):
if n == 0:
return 0
s = str(n)
slen = len(s)
dp = [[0] * 12 for _ in range(slen)]
dp_o = [[0] * 12 for _ in range(slen)]
# initial
for i in range(1, int(s[0])):
dp[0][i + 1] = 1
dp_o[0][int(s[0]) + 1] = 1
# update
for i in ... | false | 64.150943 | [
"-# キュー",
"-from collections import deque",
"-d = deque()",
"-for i in range(1, 10):",
"- d.append(i)",
"-for i in range(k):",
"- tmp = d.popleft()",
"- right = tmp % 10",
"- if right != 0:",
"- d.append(tmp * 10 + right - 1)",
"- d.append(tmp * 10 + right)",
"- if rig... | false | 0.064931 | 0.08635 | 0.751951 | [
"s475399386",
"s745200829"
] |
u496821919 | p03290 | python | s269022401 | s064956619 | 25 | 19 | 3,064 | 3,064 | Accepted | Accepted | 24 | D,G = list(map(int,input().split()))
pc = [list(map(int,input().split())) for i in range(D)]
#print(pc)
ans = float("inf")
for i in range(2**D):
sum = 0
count = 0
rem = set(range(1,D+1))
for j in range(D):
if (i >> j) & 1:
sum += pc[j][0]*100*(j+1)+pc[j][1]
... | def dfs (i,sum,count,rem):
global ans
if i == D:
if sum < G:
k = max(rem)
n = min(pc[k-1][0],-(-(G-sum)//(k*100)))
count += n
sum += n*100*k
if sum >= G:
ans = min(ans,count)
else:
dfs(i+1,sum,count,rem)
... | 24 | 21 | 566 | 543 | D, G = list(map(int, input().split()))
pc = [list(map(int, input().split())) for i in range(D)]
# print(pc)
ans = float("inf")
for i in range(2**D):
sum = 0
count = 0
rem = set(range(1, D + 1))
for j in range(D):
if (i >> j) & 1:
sum += pc[j][0] * 100 * (j + 1) + pc[j][1]
... | def dfs(i, sum, count, rem):
global ans
if i == D:
if sum < G:
k = max(rem)
n = min(pc[k - 1][0], -(-(G - sum) // (k * 100)))
count += n
sum += n * 100 * k
if sum >= G:
ans = min(ans, count)
else:
dfs(i + 1, sum, count, rem)... | false | 12.5 | [
"+def dfs(i, sum, count, rem):",
"+ global ans",
"+ if i == D:",
"+ if sum < G:",
"+ k = max(rem)",
"+ n = min(pc[k - 1][0], -(-(G - sum) // (k * 100)))",
"+ count += n",
"+ sum += n * 100 * k",
"+ if sum >= G:",
"+ ans = m... | false | 0.037679 | 0.041165 | 0.915318 | [
"s269022401",
"s064956619"
] |
u150984829 | p02315 | python | s139034010 | s977220593 | 1,030 | 370 | 25,512 | 5,924 | Accepted | Accepted | 64.08 | N,W=list(map(int,input().split()))
I=[0]+[[*list(map(int,input().split()))]for _ in[0]*N]
C=[[0]*-~W for _ in[0]*-~N]
for i in range(1,N+1):
for w in range(1,W+1):
C[i][w]=C[i-1][w]
if w>=I[i][1]and I[i][0]+C[i-1][w-I[i][1]]>C[i-1][w]:
C[i][w]=I[i][0]+C[i-1][w-I[i][1]]
print((C[N][W]))
| N,W=list(map(int,input().split()))
I=[[*list(map(int,input().split()))]for _ in[0]*N]
C=[0]*-~W
for i in range(1,N+1):
v,w=I[~-i]
for j in range(W,w-1,-1):
t=v+C[j-w]
if t>C[j]:C[j]=t
print((C[W]))
| 9 | 9 | 289 | 198 | N, W = list(map(int, input().split()))
I = [0] + [[*list(map(int, input().split()))] for _ in [0] * N]
C = [[0] * -~W for _ in [0] * -~N]
for i in range(1, N + 1):
for w in range(1, W + 1):
C[i][w] = C[i - 1][w]
if w >= I[i][1] and I[i][0] + C[i - 1][w - I[i][1]] > C[i - 1][w]:
C[i][w] =... | N, W = list(map(int, input().split()))
I = [[*list(map(int, input().split()))] for _ in [0] * N]
C = [0] * -~W
for i in range(1, N + 1):
v, w = I[~-i]
for j in range(W, w - 1, -1):
t = v + C[j - w]
if t > C[j]:
C[j] = t
print((C[W]))
| false | 0 | [
"-I = [0] + [[*list(map(int, input().split()))] for _ in [0] * N]",
"-C = [[0] * -~W for _ in [0] * -~N]",
"+I = [[*list(map(int, input().split()))] for _ in [0] * N]",
"+C = [0] * -~W",
"- for w in range(1, W + 1):",
"- C[i][w] = C[i - 1][w]",
"- if w >= I[i][1] and I[i][0] + C[i - 1][... | false | 0.045719 | 0.042784 | 1.068601 | [
"s139034010",
"s977220593"
] |
u072717685 | p02714 | python | s980309871 | s548922326 | 1,451 | 1,294 | 9,196 | 9,192 | Accepted | Accepted | 10.82 | import sys
read = sys.stdin.read
readlines = sys.stdin.readlines
def main():
n = int(eval(input()))
s = eval(input())
res = s.count('R') * s.count('G') * s.count('B')
if res == 0:
print((0))
sys.exit()
for i1 in range(n):
for i2 in range(i1+1, n):
if... | import sys
read = sys.stdin.read
readlines = sys.stdin.readlines
def main():
n = int(eval(input()))
s = eval(input())
res = s.count('R') * s.count('G') * s.count('B')
if res == 0:
print((0))
sys.exit()
for i1 in range(n):
for i2 in range(i1+1, n):
i3... | 20 | 20 | 498 | 485 | import sys
read = sys.stdin.read
readlines = sys.stdin.readlines
def main():
n = int(eval(input()))
s = eval(input())
res = s.count("R") * s.count("G") * s.count("B")
if res == 0:
print((0))
sys.exit()
for i1 in range(n):
for i2 in range(i1 + 1, n):
if i2 * 2 -... | import sys
read = sys.stdin.read
readlines = sys.stdin.readlines
def main():
n = int(eval(input()))
s = eval(input())
res = s.count("R") * s.count("G") * s.count("B")
if res == 0:
print((0))
sys.exit()
for i1 in range(n):
for i2 in range(i1 + 1, n):
i3 = i2 * 2... | false | 0 | [
"- if i2 * 2 - i1 <= n - 1:",
"- if s[i1] != s[i2]:",
"- res -= s[i1] != s[i2 * 2 - i1] and s[i2] != s[i2 * 2 - i1]",
"+ i3 = i2 * 2 - i1",
"+ if i3 <= n - 1:",
"+ res -= s[i1] != s[i2] and s[i1] != s[i3] and s[i2] != s[i3]"... | false | 0.035625 | 0.035398 | 1.006398 | [
"s980309871",
"s548922326"
] |
u706929073 | p02923 | python | s511645805 | s787371299 | 85 | 78 | 14,252 | 14,252 | Accepted | Accepted | 8.24 | n = int(eval(input()))
h = list(map(int, input().split()))
current_height = h[0]
current_count = 0
max_count = current_count
for i in range(1, n):
if current_height >= h[i]:
current_count += 1
else:
max_count = max(current_count, max_count)
current_count = 0
current_heig... | n = int(eval(input()))
h = list(map(int, input().split()))
count = 0
max_value = 0
for i in range(n)[1::]:
if h[i-1] >= h[i]:
count += 1
else:
max_value = max(max_value, count)
count = 0
max_value = max(max_value, count)
print(max_value)
| 16 | 13 | 387 | 277 | n = int(eval(input()))
h = list(map(int, input().split()))
current_height = h[0]
current_count = 0
max_count = current_count
for i in range(1, n):
if current_height >= h[i]:
current_count += 1
else:
max_count = max(current_count, max_count)
current_count = 0
current_height = h[i]
max... | n = int(eval(input()))
h = list(map(int, input().split()))
count = 0
max_value = 0
for i in range(n)[1::]:
if h[i - 1] >= h[i]:
count += 1
else:
max_value = max(max_value, count)
count = 0
max_value = max(max_value, count)
print(max_value)
| false | 18.75 | [
"-current_height = h[0]",
"-current_count = 0",
"-max_count = current_count",
"-for i in range(1, n):",
"- if current_height >= h[i]:",
"- current_count += 1",
"+count = 0",
"+max_value = 0",
"+for i in range(n)[1::]:",
"+ if h[i - 1] >= h[i]:",
"+ count += 1",
"- ma... | false | 0.034048 | 0.034914 | 0.975196 | [
"s511645805",
"s787371299"
] |
u112629957 | p02768 | python | s111046454 | s937184057 | 203 | 175 | 94,064 | 38,640 | Accepted | Accepted | 13.79 | n,a,b=list(map(int,input().split()))
MOD=10**9+7
def inv(a):
return pow(a,MOD-2,MOD)
def choose(n,r):
if r==0 or r==n:
return 1
else:
A=B=1
ls_A=[1]
ls_B=[1]
for i in range(r):
A=ls_A[i]*(n-i)%MOD
ls_A.append(A)
B=ls_B[i]*(i+1)%MOD
ls_B.append(B)
r... | n,a,b=list(map(int,input().split()))
MOD=10**9+7
def inv(a):
return pow(a,MOD-2,MOD)
def choose(n,r):
if r==0 or r==n:
return 1
else:
A=B=1
for i in range(r):
A=A*(n-i)%MOD
B=B*(i+1)%MOD
return A*inv(B)%MOD
print(((pow(2,n,MOD)-1-choose(n,a)-choose(n,b))%MOD)) | 34 | 14 | 650 | 299 | n, a, b = list(map(int, input().split()))
MOD = 10**9 + 7
def inv(a):
return pow(a, MOD - 2, MOD)
def choose(n, r):
if r == 0 or r == n:
return 1
else:
A = B = 1
ls_A = [1]
ls_B = [1]
for i in range(r):
A = ls_A[i] * (n - i) % MOD
ls_A.appe... | n, a, b = list(map(int, input().split()))
MOD = 10**9 + 7
def inv(a):
return pow(a, MOD - 2, MOD)
def choose(n, r):
if r == 0 or r == n:
return 1
else:
A = B = 1
for i in range(r):
A = A * (n - i) % MOD
B = B * (i + 1) % MOD
return A * inv(B) % MOD... | false | 58.823529 | [
"- ls_A = [1]",
"- ls_B = [1]",
"- A = ls_A[i] * (n - i) % MOD",
"- ls_A.append(A)",
"- B = ls_B[i] * (i + 1) % MOD",
"- ls_B.append(B)",
"- return ls_A[r] * inv(ls_B[r]) % MOD",
"+ A = A * (n - i) % MOD",
"+ B = ... | false | 0.417197 | 0.12645 | 3.299292 | [
"s111046454",
"s937184057"
] |
u576917603 | p02802 | python | s798531651 | s768896179 | 388 | 297 | 29,804 | 4,596 | Accepted | Accepted | 23.45 | n,m=list(map(int,input().split()))
import collections
d=collections.defaultdict(list)
for i in range(m):
x,a=input().split()
x=int(x)
d[x].append(a)
ac=0
wa=0
for i in d:
cnt=0
for j in d[i]:
if j=="WA":
cnt+=1
else:
ac+=1
wa+=cnt... | n,m=list(map(int,input().split()))
ac_list=[None]*n
wa_list=[0]*n
ans=0
for i in range(m):
q,status=input().split()
q=int(q)
if status=="AC" and ac_list[q-1]==None:
ac_list[q-1]=True
ans+=wa_list[q-1]
elif status=="WA" and ac_list[q-1]==None:
wa_list[q-1]+=1
x=ac_list... | 20 | 14 | 347 | 340 | n, m = list(map(int, input().split()))
import collections
d = collections.defaultdict(list)
for i in range(m):
x, a = input().split()
x = int(x)
d[x].append(a)
ac = 0
wa = 0
for i in d:
cnt = 0
for j in d[i]:
if j == "WA":
cnt += 1
else:
ac += 1
w... | n, m = list(map(int, input().split()))
ac_list = [None] * n
wa_list = [0] * n
ans = 0
for i in range(m):
q, status = input().split()
q = int(q)
if status == "AC" and ac_list[q - 1] == None:
ac_list[q - 1] = True
ans += wa_list[q - 1]
elif status == "WA" and ac_list[q - 1] == None:
... | false | 30 | [
"-import collections",
"-",
"-d = collections.defaultdict(list)",
"+ac_list = [None] * n",
"+wa_list = [0] * n",
"+ans = 0",
"- x, a = input().split()",
"- x = int(x)",
"- d[x].append(a)",
"-ac = 0",
"-wa = 0",
"-for i in d:",
"- cnt = 0",
"- for j in d[i]:",
"- if ... | false | 0.036589 | 0.038013 | 0.962536 | [
"s798531651",
"s768896179"
] |
u968404618 | p02889 | python | s001329736 | s624749053 | 1,722 | 1,517 | 125,404 | 125,020 | Accepted | Accepted | 11.9 | import sys
input = sys.stdin.readline
def main():
n, m, l = list(map(int, input().split()))
dist = [[float('inf')]*n for _ in range(n)]
def Warshall_Floyd(d):
for k in range(n):
for i in range(n):
for j in range(n):
d[i][j] = min(d[i][... | import sys
input = sys.stdin.readline
def main():
n, m, l = list(map(int, input().split()))
f_inf = float('inf')
dist = [[f_inf]*n for _ in range(n)]
def Warshall_Floyd(d):
for k in range(n):
for i in range(n):
for j in range(n):
... | 46 | 45 | 1,080 | 1,041 | import sys
input = sys.stdin.readline
def main():
n, m, l = list(map(int, input().split()))
dist = [[float("inf")] * n for _ in range(n)]
def Warshall_Floyd(d):
for k in range(n):
for i in range(n):
for j in range(n):
d[i][j] = min(d[i][j], d[i][k]... | import sys
input = sys.stdin.readline
def main():
n, m, l = list(map(int, input().split()))
f_inf = float("inf")
dist = [[f_inf] * n for _ in range(n)]
def Warshall_Floyd(d):
for k in range(n):
for i in range(n):
for j in range(n):
d[i][j] = mi... | false | 2.173913 | [
"- dist = [[float(\"inf\")] * n for _ in range(n)]",
"+ f_inf = float(\"inf\")",
"+ dist = [[f_inf] * n for _ in range(n)]",
"- if c > l:",
"- continue",
"- dist2 = [[float(\"inf\")] * n for _ in range(n)]",
"+ dist2 = [[f_inf] * n for _ in range(n)]",
"- if dis... | false | 0.035394 | 0.036797 | 0.96189 | [
"s001329736",
"s624749053"
] |
u068142202 | p02681 | python | s530707349 | s578507224 | 21 | 19 | 9,032 | 9,104 | Accepted | Accepted | 9.52 | s = eval(input())
t = eval(input())
if s + t[-1] == t:
print("Yes")
else:
print("No") | s = eval(input())
t = eval(input())
if s == t[:len(s)]:
print("Yes")
else:
print("No") | 6 | 6 | 82 | 83 | s = eval(input())
t = eval(input())
if s + t[-1] == t:
print("Yes")
else:
print("No")
| s = eval(input())
t = eval(input())
if s == t[: len(s)]:
print("Yes")
else:
print("No")
| false | 0 | [
"-if s + t[-1] == t:",
"+if s == t[: len(s)]:"
] | false | 0.038658 | 0.047535 | 0.813252 | [
"s530707349",
"s578507224"
] |
u077291787 | p03231 | python | s244170621 | s970172410 | 69 | 38 | 17,488 | 5,340 | Accepted | Accepted | 44.93 | # AGC028
from fractions import gcd
def main():
n, m = tuple(map(int, input().rstrip().split()))
S, T = tuple(input().rstrip() for _ in range(2))
l = n // gcd(n, m) * m
x = {}
for i in range(n): # place S in x
j = (l // n) * i
x[j] = S[i]
for i in range(m): # check... | # AGC028A - Two Abbreviations
from fractions import gcd
def main():
n, m = tuple(map(int, input().rstrip().split()))
S, T = tuple(input().rstrip() for _ in range(2))
g = gcd(n, m)
flg = S[:: n // g] == T[:: m // g]
print((n // g * m if flg else -1))
if __name__ == "__main__":
ma... | 23 | 14 | 519 | 322 | # AGC028
from fractions import gcd
def main():
n, m = tuple(map(int, input().rstrip().split()))
S, T = tuple(input().rstrip() for _ in range(2))
l = n // gcd(n, m) * m
x = {}
for i in range(n): # place S in x
j = (l // n) * i
x[j] = S[i]
for i in range(m): # check T adapts to... | # AGC028A - Two Abbreviations
from fractions import gcd
def main():
n, m = tuple(map(int, input().rstrip().split()))
S, T = tuple(input().rstrip() for _ in range(2))
g = gcd(n, m)
flg = S[:: n // g] == T[:: m // g]
print((n // g * m if flg else -1))
if __name__ == "__main__":
main()
| false | 39.130435 | [
"-# AGC028",
"+# AGC028A - Two Abbreviations",
"- l = n // gcd(n, m) * m",
"- x = {}",
"- for i in range(n): # place S in x",
"- j = (l // n) * i",
"- x[j] = S[i]",
"- for i in range(m): # check T adapts to x or not",
"- j = (l // m) * i",
"- if j in x and... | false | 0.051807 | 0.179969 | 0.287868 | [
"s244170621",
"s970172410"
] |
u729133443 | p03447 | python | s505561024 | s694661162 | 35 | 18 | 27,244 | 2,940 | Accepted | Accepted | 48.57 | print((eval(input())-eval(input()))%eval(input())) | i=input;print((eval(i()+'-'+i())%int(i()))) | 1 | 1 | 30 | 41 | print((eval(input()) - eval(input())) % eval(input()))
| i = input
print((eval(i() + "-" + i()) % int(i())))
| false | 0 | [
"-print((eval(input()) - eval(input())) % eval(input()))",
"+i = input",
"+print((eval(i() + \"-\" + i()) % int(i())))"
] | false | 0.036358 | 0.039829 | 0.912846 | [
"s505561024",
"s694661162"
] |
u077291787 | p03489 | python | s874062339 | s019170192 | 73 | 67 | 18,168 | 18,676 | Accepted | Accepted | 8.22 | # ARC087C - Good Sequence (ABC082C)
import sys
input = sys.stdin.readline
def main():
n = int(eval(input()))
lst = list(map(int, input().rstrip().split()))
cnt = {}
for i in lst:
if i not in cnt:
cnt[i] = 0
cnt[i] += 1
ans = 0
for i, j in list(cnt.items(... | # ABC082C - Good Sequence (ARC087C)
import sys
input = sys.stdin.readline
from collections import Counter
def main():
n = int(eval(input()))
cnt = Counter(list(map(int, input().rstrip().split())))
ans = 0
for i, j in list(cnt.items()):
if i > j:
ans += j
el... | 23 | 22 | 460 | 403 | # ARC087C - Good Sequence (ABC082C)
import sys
input = sys.stdin.readline
def main():
n = int(eval(input()))
lst = list(map(int, input().rstrip().split()))
cnt = {}
for i in lst:
if i not in cnt:
cnt[i] = 0
cnt[i] += 1
ans = 0
for i, j in list(cnt.items()):
... | # ABC082C - Good Sequence (ARC087C)
import sys
input = sys.stdin.readline
from collections import Counter
def main():
n = int(eval(input()))
cnt = Counter(list(map(int, input().rstrip().split())))
ans = 0
for i, j in list(cnt.items()):
if i > j:
ans += j
elif i < j:
... | false | 4.347826 | [
"-# ARC087C - Good Sequence (ABC082C)",
"+# ABC082C - Good Sequence (ARC087C)",
"+from collections import Counter",
"- lst = list(map(int, input().rstrip().split()))",
"- cnt = {}",
"- for i in lst:",
"- if i not in cnt:",
"- cnt[i] = 0",
"- cnt[i] += 1",
"+ cn... | false | 0.048467 | 0.049026 | 0.9886 | [
"s874062339",
"s019170192"
] |
u021019433 | p02960 | python | s624431547 | s799446785 | 973 | 676 | 44,012 | 46,428 | Accepted | Accepted | 30.52 | M = 10**9 + 7
a = [1] + [0] * 12
p = 1
for c in reversed(eval(input())):
if c == '?':
a = [sum(x) % M for x in zip(*(a[j % 13:] + a[:j % 13]
for j in range(0, -p * 10, -p)))]
elif c > '0':
j = -p * int(c) % 13
a = a[j:] + a[:j]
p = p * 10 % 13
... | M = 10**9 + 7
a = [1] + [0] * 12
p = 1
for c in reversed(eval(input())):
if c > '0':
r = list(range(0, p * 10, p)) if c == '?' else (p * int(c),)
a = [sum(a[(i - j) % 13] for j in r) % M for i in range(13)]
p = p * 10 % 13
print((a[5]))
| 12 | 9 | 327 | 255 | M = 10**9 + 7
a = [1] + [0] * 12
p = 1
for c in reversed(eval(input())):
if c == "?":
a = [
sum(x) % M
for x in zip(*(a[j % 13 :] + a[: j % 13] for j in range(0, -p * 10, -p)))
]
elif c > "0":
j = -p * int(c) % 13
a = a[j:] + a[:j]
p = p * 10 % 13
prin... | M = 10**9 + 7
a = [1] + [0] * 12
p = 1
for c in reversed(eval(input())):
if c > "0":
r = list(range(0, p * 10, p)) if c == "?" else (p * int(c),)
a = [sum(a[(i - j) % 13] for j in r) % M for i in range(13)]
p = p * 10 % 13
print((a[5]))
| false | 25 | [
"- if c == \"?\":",
"- a = [",
"- sum(x) % M",
"- for x in zip(*(a[j % 13 :] + a[: j % 13] for j in range(0, -p * 10, -p)))",
"- ]",
"- elif c > \"0\":",
"- j = -p * int(c) % 13",
"- a = a[j:] + a[:j]",
"+ if c > \"0\":",
"+ r = lis... | false | 0.086036 | 0.035909 | 2.395935 | [
"s624431547",
"s799446785"
] |
u761320129 | p03745 | python | s008491710 | s764526665 | 76 | 64 | 14,252 | 14,252 | Accepted | Accepted | 15.79 | N = int(eval(input()))
A = list(map(int,input().split()))
ans = 1
up = None
for a,b in zip(A,A[1:]):
if a==b: continue
if up is None:
up = a<b
elif up:
if a>b:
up = None
ans += 1
else:
if a<b:
up = None
ans += 1
pr... | N = int(eval(input()))
A = list(map(int,input().split()))
ans = 1
up = down = False
for a,b in zip(A,A[1:]):
if a<b:
if down:
ans += 1
up = down = False
else:
up = True
down = False
elif a>b:
if up:
ans += 1
... | 18 | 21 | 322 | 416 | N = int(eval(input()))
A = list(map(int, input().split()))
ans = 1
up = None
for a, b in zip(A, A[1:]):
if a == b:
continue
if up is None:
up = a < b
elif up:
if a > b:
up = None
ans += 1
else:
if a < b:
up = None
ans += 1
p... | N = int(eval(input()))
A = list(map(int, input().split()))
ans = 1
up = down = False
for a, b in zip(A, A[1:]):
if a < b:
if down:
ans += 1
up = down = False
else:
up = True
down = False
elif a > b:
if up:
ans += 1
u... | false | 14.285714 | [
"-up = None",
"+up = down = False",
"- if a == b:",
"- continue",
"- if up is None:",
"- up = a < b",
"- elif up:",
"- if a > b:",
"- up = None",
"+ if a < b:",
"+ if down:",
"- else:",
"- if a < b:",
"- up = None",
... | false | 0.084304 | 0.085825 | 0.982277 | [
"s008491710",
"s764526665"
] |
u622523700 | p03632 | python | s201623706 | s529735303 | 152 | 17 | 12,496 | 2,940 | Accepted | Accepted | 88.82 | import numpy as np
a, b, c, d = list(map(int, input().split()))
print((np.clip(min(b, d) - max(a, c), 0, None)))
| a, b, c, d = list(map(int, input().split()))
time = min(b, d) - max(a, c)
if time >= 0:
print(time)
else:
print("0")
| 4 | 7 | 109 | 122 | import numpy as np
a, b, c, d = list(map(int, input().split()))
print((np.clip(min(b, d) - max(a, c), 0, None)))
| a, b, c, d = list(map(int, input().split()))
time = min(b, d) - max(a, c)
if time >= 0:
print(time)
else:
print("0")
| false | 42.857143 | [
"-import numpy as np",
"-",
"-print((np.clip(min(b, d) - max(a, c), 0, None)))",
"+time = min(b, d) - max(a, c)",
"+if time >= 0:",
"+ print(time)",
"+else:",
"+ print(\"0\")"
] | false | 0.193064 | 0.036282 | 5.321176 | [
"s201623706",
"s529735303"
] |
u759412327 | p04013 | python | s043248517 | s768690171 | 170 | 26 | 14,876 | 3,188 | Accepted | Accepted | 84.71 | import numpy as np
N,A = list(map(int,input().split()))
X = [int(x) for x in input().split()]
dp = np.zeros((N+1,3000),dtype=np.int64) # 枚数、目標数ごとに場合の数
dp[0,0] = 1
for x in X:
dp[1:,x:] += dp[:-1,:-x].copy()
answer = 0
for n in range(1,N+1):
answer += dp[n,n*A]
print(answer) | N,A = list(map(int,input().split()))
Y = list([int(x)-A for x in input().split()])
dp = {0:1}
for y in Y:
for k,v in list(dp.items()):
dp[k+y]=dp.get(k+y,0)+v
print((dp[0]-1)) | 14 | 9 | 292 | 183 | import numpy as np
N, A = list(map(int, input().split()))
X = [int(x) for x in input().split()]
dp = np.zeros((N + 1, 3000), dtype=np.int64) # 枚数、目標数ごとに場合の数
dp[0, 0] = 1
for x in X:
dp[1:, x:] += dp[:-1, :-x].copy()
answer = 0
for n in range(1, N + 1):
answer += dp[n, n * A]
print(answer)
| N, A = list(map(int, input().split()))
Y = list([int(x) - A for x in input().split()])
dp = {0: 1}
for y in Y:
for k, v in list(dp.items()):
dp[k + y] = dp.get(k + y, 0) + v
print((dp[0] - 1))
| false | 35.714286 | [
"-import numpy as np",
"-",
"-X = [int(x) for x in input().split()]",
"-dp = np.zeros((N + 1, 3000), dtype=np.int64) # 枚数、目標数ごとに場合の数",
"-dp[0, 0] = 1",
"-for x in X:",
"- dp[1:, x:] += dp[:-1, :-x].copy()",
"-answer = 0",
"-for n in range(1, N + 1):",
"- answer += dp[n, n * A]",
"-print(a... | false | 0.00717 | 0.038851 | 0.184562 | [
"s043248517",
"s768690171"
] |
u166306121 | p03112 | python | s069742543 | s482779280 | 1,686 | 1,036 | 12,152 | 12,204 | Accepted | Accepted | 38.55 | import bisect
f_inf = float('inf')
def cal(syurui, d, index):
if d == 'e':
return syurui[index]
elif d == 'w':
return syurui[index - 1]
A, B, Q = list(map(int, input().split()))
s = [int(eval(input())) for i in range(A)]
s.sort()
t = [int(eval(input())) for i in range(B)]
t.... | import bisect
import sys
f_inf = float('inf')
def cal(syurui, d, index):
if d == 'e':
return syurui[index]
elif d == 'w':
return syurui[index - 1]
A, B, Q = list(map(int, input().split()))
s = [int(eval(input())) for i in range(A)]
s.sort()
t = [int(eval(input())) for i in r... | 27 | 29 | 779 | 884 | import bisect
f_inf = float("inf")
def cal(syurui, d, index):
if d == "e":
return syurui[index]
elif d == "w":
return syurui[index - 1]
A, B, Q = list(map(int, input().split()))
s = [int(eval(input())) for i in range(A)]
s.sort()
t = [int(eval(input())) for i in range(B)]
t.sort()
ｓ.insert(... | import bisect
import sys
f_inf = float("inf")
def cal(syurui, d, index):
if d == "e":
return syurui[index]
elif d == "w":
return syurui[index - 1]
A, B, Q = list(map(int, input().split()))
s = [int(eval(input())) for i in range(A)]
s.sort()
t = [int(eval(input())) for i in range(B)]
t.sort(... | false | 6.896552 | [
"+import sys",
"- x = int(eval(input()))",
"+ x = int(sys.stdin.readline().rstrip(\"\\n\"))"
] | false | 0.178604 | 0.2245 | 0.795565 | [
"s069742543",
"s482779280"
] |
u670180528 | p02991 | python | s087042679 | s451765411 | 427 | 293 | 26,948 | 28,484 | Accepted | Accepted | 31.38 | from collections import deque
N,M,*L,S,T = list(map(int,open(0).read().split()))
G = [[] for _ in range(N)]
step = [0 for _ in range(N)]
step[S-1] = 1
for u,v in zip(*[iter(L)]*2):
G[u-1].append(v-1)
q = deque([(S-1,0)])
while q:
cur,d = q.popleft()
for nxt in G[cur]:
if nxt==T-1 and (d+1)%3==0:
pri... | def main():
from collections import deque
N,M,*L,S,T = list(map(int,open(0).read().split()))
G = [[] for _ in range(N)]
step = [False]*(3*N)
step[(S-1)*3] = True
for u,v in zip(*[iter(L)]*2):
G[u-1].append(v-1)
q = deque([(S-1,0)])
while q:
cur,d = q.popleft()
for nxt in G[cur]:
if nxt==T-1... | 18 | 21 | 436 | 499 | from collections import deque
N, M, *L, S, T = list(map(int, open(0).read().split()))
G = [[] for _ in range(N)]
step = [0 for _ in range(N)]
step[S - 1] = 1
for u, v in zip(*[iter(L)] * 2):
G[u - 1].append(v - 1)
q = deque([(S - 1, 0)])
while q:
cur, d = q.popleft()
for nxt in G[cur]:
if nxt == T ... | def main():
from collections import deque
N, M, *L, S, T = list(map(int, open(0).read().split()))
G = [[] for _ in range(N)]
step = [False] * (3 * N)
step[(S - 1) * 3] = True
for u, v in zip(*[iter(L)] * 2):
G[u - 1].append(v - 1)
q = deque([(S - 1, 0)])
while q:
cur, d ... | false | 14.285714 | [
"-from collections import deque",
"+def main():",
"+ from collections import deque",
"-N, M, *L, S, T = list(map(int, open(0).read().split()))",
"-G = [[] for _ in range(N)]",
"-step = [0 for _ in range(N)]",
"-step[S - 1] = 1",
"-for u, v in zip(*[iter(L)] * 2):",
"- G[u - 1].append(v - 1)",
... | false | 0.080583 | 0.036414 | 2.212973 | [
"s087042679",
"s451765411"
] |
u968404618 | p02644 | python | s969878518 | s223965073 | 2,534 | 1,642 | 36,596 | 36,732 | Accepted | Accepted | 35.2 | from collections import deque
import sys
input = sys.stdin.readline
h, w, k = list(map(int, input().split()))
x1, y1, x2, y2 = list(map(int, input().split()))
x1-=1
y1-=1
x2-=1
y2-=1
dist = [eval(input()) for _ in range(h)]
ans = [[-1]*w for _ in range(h)]
ans[x1][y1] = 0
que = deque()
que.append((x1... | def main():
## IMPORT MODULE
from collections import deque
import sys
input=lambda :sys.stdin.readline().rstrip()
#sys.setrecursionlimit(100000)
#f_inf=float("inf")
#MOD=10**9+7
if 'get_ipython' in globals():
## SAMPLE INPUT
h, w, k = 3, 5, 2
x1, y1, x2, y2 = 3, 2, 3, 4
... | 42 | 60 | 817 | 1,214 | from collections import deque
import sys
input = sys.stdin.readline
h, w, k = list(map(int, input().split()))
x1, y1, x2, y2 = list(map(int, input().split()))
x1 -= 1
y1 -= 1
x2 -= 1
y2 -= 1
dist = [eval(input()) for _ in range(h)]
ans = [[-1] * w for _ in range(h)]
ans[x1][y1] = 0
que = deque()
que.append((x1, y1))
d... | def main():
## IMPORT MODULE
from collections import deque
import sys
input = lambda: sys.stdin.readline().rstrip()
# sys.setrecursionlimit(100000)
# f_inf=float("inf")
# MOD=10**9+7
if "get_ipython" in globals():
## SAMPLE INPUT
h, w, k = 3, 5, 2
x1, y1, x2, y2 ... | false | 30 | [
"-from collections import deque",
"-import sys",
"+def main():",
"+ ## IMPORT MODULE",
"+ from collections import deque",
"+ import sys",
"-input = sys.stdin.readline",
"-h, w, k = list(map(int, input().split()))",
"-x1, y1, x2, y2 = list(map(int, input().split()))",
"-x1 -= 1",
"-y1 -=... | false | 0.042909 | 0.036661 | 1.170438 | [
"s969878518",
"s223965073"
] |
u360116509 | p03338 | python | s020118719 | s748413411 | 20 | 18 | 3,060 | 2,940 | Accepted | Accepted | 10 | def main():
N = int(eval(input()))
S = eval(input())
ans = 0
for n in range(N + 1):
c = 0
u = []
for s in S[:n]:
if s in u:
continue
if S[n:].count(s) > 0:
c += 1
u.append(s)
ans = max(ans, c... | def main():
N = int(eval(input()))
S = eval(input())
ans = 0
for n in range(N + 1):
c = 0
for s in set(S[:n]):
if S[n:].count(s) > 0:
c += 1
ans = max(ans, c)
print(ans)
main()
| 18 | 14 | 338 | 252 | def main():
N = int(eval(input()))
S = eval(input())
ans = 0
for n in range(N + 1):
c = 0
u = []
for s in S[:n]:
if s in u:
continue
if S[n:].count(s) > 0:
c += 1
u.append(s)
ans = max(ans, c)
print(a... | def main():
N = int(eval(input()))
S = eval(input())
ans = 0
for n in range(N + 1):
c = 0
for s in set(S[:n]):
if S[n:].count(s) > 0:
c += 1
ans = max(ans, c)
print(ans)
main()
| false | 22.222222 | [
"- u = []",
"- for s in S[:n]:",
"- if s in u:",
"- continue",
"+ for s in set(S[:n]):",
"- u.append(s)"
] | false | 0.03918 | 0.042434 | 0.923321 | [
"s020118719",
"s748413411"
] |
u631299617 | p02678 | python | s100760939 | s021599920 | 1,478 | 707 | 34,352 | 34,584 | Accepted | Accepted | 52.17 | n,m=list(map(int,input().split()))
g=[[] for x in range(n)]
for c in range(m):
a,b= list(map(int,input().split()))
g[a-1].append(b-1)
g[b-1].append(a-1)
ans_list=[-1]*n
queue=[0]
while queue:
qi=queue.pop(0)
for gi in g[qi]:
if ans_list[gi]==-1:
queue.append(gi)... | n,m=list(map(int,input().split()))
r=[[] for x in range(n)]
for c in range(m):
a,b=list(map(int,input().split()))
r[a-1].append(b-1)
r[b-1].append(a-1)
s=[-1]*n
u=[0]
v=[]
k=1
while k<n:
for d in u:
for e in r[d]:
if s[e]==-1:
s[e]=d
k+=... | 21 | 21 | 397 | 404 | n, m = list(map(int, input().split()))
g = [[] for x in range(n)]
for c in range(m):
a, b = list(map(int, input().split()))
g[a - 1].append(b - 1)
g[b - 1].append(a - 1)
ans_list = [-1] * n
queue = [0]
while queue:
qi = queue.pop(0)
for gi in g[qi]:
if ans_list[gi] == -1:
queue.a... | n, m = list(map(int, input().split()))
r = [[] for x in range(n)]
for c in range(m):
a, b = list(map(int, input().split()))
r[a - 1].append(b - 1)
r[b - 1].append(a - 1)
s = [-1] * n
u = [0]
v = []
k = 1
while k < n:
for d in u:
for e in r[d]:
if s[e] == -1:
s[e] = d
... | false | 0 | [
"-g = [[] for x in range(n)]",
"+r = [[] for x in range(n)]",
"- g[a - 1].append(b - 1)",
"- g[b - 1].append(a - 1)",
"-ans_list = [-1] * n",
"-queue = [0]",
"-while queue:",
"- qi = queue.pop(0)",
"- for gi in g[qi]:",
"- if ans_list[gi] == -1:",
"- queue.append(gi... | false | 0.059283 | 0.043192 | 1.372533 | [
"s100760939",
"s021599920"
] |
u761989513 | p04005 | python | s010659766 | s026317130 | 19 | 17 | 3,060 | 2,940 | Accepted | Accepted | 10.53 | a, b, c = list(map(int, input().split()))
if a * b * c % 2 == 0:
print((0))
else:
n = sorted([a, b, c])
print((n[0] * n[1])) | a = sorted(list(map(int, input().split())))
if a[0] % 2 and a[1] % 2 and a[2] % 2:
print((a[0] * a[1]))
else:
print((0))
| 6 | 5 | 125 | 129 | a, b, c = list(map(int, input().split()))
if a * b * c % 2 == 0:
print((0))
else:
n = sorted([a, b, c])
print((n[0] * n[1]))
| a = sorted(list(map(int, input().split())))
if a[0] % 2 and a[1] % 2 and a[2] % 2:
print((a[0] * a[1]))
else:
print((0))
| false | 16.666667 | [
"-a, b, c = list(map(int, input().split()))",
"-if a * b * c % 2 == 0:",
"+a = sorted(list(map(int, input().split())))",
"+if a[0] % 2 and a[1] % 2 and a[2] % 2:",
"+ print((a[0] * a[1]))",
"+else:",
"-else:",
"- n = sorted([a, b, c])",
"- print((n[0] * n[1]))"
] | false | 0.04289 | 0.043431 | 0.987535 | [
"s010659766",
"s026317130"
] |
u508486691 | p02893 | python | s358717779 | s229399335 | 1,948 | 82 | 118,400 | 5,476 | Accepted | Accepted | 95.79 | import sys
import math
from collections import defaultdict
sys.setrecursionlimit(10**7)
def input():
return sys.stdin.readline()[:-1]
mod = 998244353
def I(): return int(eval(input()))
def II(): return list(map(int, input().split()))
def III(): return list(map(int, input().split()))
def Line(N,num):... | import sys
import math
from collections import defaultdict
sys.setrecursionlimit(10**7)
def input():
return sys.stdin.readline()[:-1]
mod = 998244353
def I(): return int(eval(input()))
def II(): return list(map(int, input().split()))
def III(): return list(map(int, input().split()))
def Line(N,num):... | 61 | 60 | 1,369 | 1,360 | import sys
import math
from collections import defaultdict
sys.setrecursionlimit(10**7)
def input():
return sys.stdin.readline()[:-1]
mod = 998244353
def I():
return int(eval(input()))
def II():
return list(map(int, input().split()))
def III():
return list(map(int, input().split()))
def Lin... | import sys
import math
from collections import defaultdict
sys.setrecursionlimit(10**7)
def input():
return sys.stdin.readline()[:-1]
mod = 998244353
def I():
return int(eval(input()))
def II():
return list(map(int, input().split()))
def III():
return list(map(int, input().split()))
def Lin... | false | 1.639344 | [
"-ans = 0"
] | false | 0.040551 | 0.043092 | 0.941033 | [
"s358717779",
"s229399335"
] |
u690536347 | p03272 | python | s927122896 | s561973253 | 164 | 18 | 38,384 | 2,940 | Accepted | Accepted | 89.02 | n,i=list(map(int,input().split()))
print((n-i+1))
| a,b=list(map(int,input().split()))
print((a-b+1)) | 2 | 2 | 43 | 42 | n, i = list(map(int, input().split()))
print((n - i + 1))
| a, b = list(map(int, input().split()))
print((a - b + 1))
| false | 0 | [
"-n, i = list(map(int, input().split()))",
"-print((n - i + 1))",
"+a, b = list(map(int, input().split()))",
"+print((a - b + 1))"
] | false | 0.040717 | 0.035455 | 1.14842 | [
"s927122896",
"s561973253"
] |
u156815136 | p03380 | python | s786421819 | s217977761 | 135 | 77 | 14,936 | 21,556 | Accepted | Accepted | 42.96 | #from statistics import median
#import collections
#aa = collections.Counter(a) # list to list || .most_common(2)で最大の2個とりだせるお a[0][0]
#from fractions import gcd
#from itertools import combinations # (string,3) 3回
#from collections import deque
from collections import defaultdict
#import bisect
#
# d = m - k... | #from statistics import median
#import collections
#aa = collections.Counter(a) # list to list || .most_common(2)で最大の2個とりだせるお a[0][0]
from fractions import gcd
from itertools import combinations,permutations,accumulate # (string,3) 3回
#from collections import deque
from collections import deque,defaultdict,Counte... | 35 | 36 | 775 | 807 | # from statistics import median
# import collections
# aa = collections.Counter(a) # list to list || .most_common(2)で最大の2個とりだせるお a[0][0]
# from fractions import gcd
# from itertools import combinations # (string,3) 3回
# from collections import deque
from collections import defaultdict
# import bisect
#
# d = m - k[... | # from statistics import median
# import collections
# aa = collections.Counter(a) # list to list || .most_common(2)で最大の2個とりだせるお a[0][0]
from fractions import gcd
from itertools import combinations, permutations, accumulate # (string,3) 3回
# from collections import deque
from collections import deque, defaultdict, Co... | false | 2.777778 | [
"-# from fractions import gcd",
"-# from itertools import combinations # (string,3) 3回",
"+from fractions import gcd",
"+from itertools import combinations, permutations, accumulate # (string,3) 3回",
"+",
"-from collections import defaultdict",
"+from collections import deque, defaultdict, Counter",
... | false | 0.078172 | 0.036854 | 2.121138 | [
"s786421819",
"s217977761"
] |
u813098295 | p03546 | python | s391629240 | s596787615 | 32 | 29 | 2,948 | 2,948 | Accepted | Accepted | 9.38 | # coding: utf-8
H, W = list(map(int, input().split()))
c = [list(map(int, input().split())) for _ in range(10)]
A = [list(map(int, input().split())) for _ in range(H)]
d = [float('inf')] * 10
def bellman_ford(s):
d[s] = 0
for i in range(10):
for j in range(10):
for k in range(... | # coding: utf-8
H, W = list(map(int, input().split()))
c = [list(map(int, input().split())) for _ in range(10)]
A = [list(map(int, input().split())) for _ in range(H)]
d = [float('inf')] * 10
d[1] = 0
for i in range(10):
for j in range(10):
for k in range(10):
if d[j] != float('... | 26 | 17 | 617 | 454 | # coding: utf-8
H, W = list(map(int, input().split()))
c = [list(map(int, input().split())) for _ in range(10)]
A = [list(map(int, input().split())) for _ in range(H)]
d = [float("inf")] * 10
def bellman_ford(s):
d[s] = 0
for i in range(10):
for j in range(10):
for k in range(10):
... | # coding: utf-8
H, W = list(map(int, input().split()))
c = [list(map(int, input().split())) for _ in range(10)]
A = [list(map(int, input().split())) for _ in range(H)]
d = [float("inf")] * 10
d[1] = 0
for i in range(10):
for j in range(10):
for k in range(10):
if d[j] != float("inf") and d[k] > ... | false | 34.615385 | [
"-",
"-",
"-def bellman_ford(s):",
"- d[s] = 0",
"- for i in range(10):",
"- for j in range(10):",
"- for k in range(10):",
"- if d[j] != float(\"inf\") and d[k] > d[j] + c[k][j]:",
"- d[k] = d[j] + c[k][j]",
"-",
"-",
"-bellman_ford(1)... | false | 0.047022 | 0.04986 | 0.943086 | [
"s391629240",
"s596787615"
] |
u606045429 | p03695 | python | s965005848 | s823234323 | 21 | 17 | 3,316 | 2,940 | Accepted | Accepted | 19.05 | from collections import Counter
N = int(eval(input()))
A = (int(i) // 400 for i in input().split())
mi, d = 0, 0
for k, v in list(Counter(A).items()):
if k >= 8:
d += v
else:
mi += 1
if mi == 0:
print((1, N))
else:
print((mi, mi + d)) | N = int(eval(input()))
A = (int(i) // 400 for i in input().split())
m, d = [0] * 8, 0
for a in A:
if a >= 8:
d += 1
else:
m[a] = 1
s = sum(m)
if s > 0:
print((s, s + d))
else:
print((1, N))
| 16 | 14 | 268 | 226 | from collections import Counter
N = int(eval(input()))
A = (int(i) // 400 for i in input().split())
mi, d = 0, 0
for k, v in list(Counter(A).items()):
if k >= 8:
d += v
else:
mi += 1
if mi == 0:
print((1, N))
else:
print((mi, mi + d))
| N = int(eval(input()))
A = (int(i) // 400 for i in input().split())
m, d = [0] * 8, 0
for a in A:
if a >= 8:
d += 1
else:
m[a] = 1
s = sum(m)
if s > 0:
print((s, s + d))
else:
print((1, N))
| false | 12.5 | [
"-from collections import Counter",
"-",
"-mi, d = 0, 0",
"-for k, v in list(Counter(A).items()):",
"- if k >= 8:",
"- d += v",
"+m, d = [0] * 8, 0",
"+for a in A:",
"+ if a >= 8:",
"+ d += 1",
"- mi += 1",
"-if mi == 0:",
"+ m[a] = 1",
"+s = sum(m)",
"+... | false | 0.048227 | 0.046519 | 1.036731 | [
"s965005848",
"s823234323"
] |
u631277801 | p03645 | python | s862381763 | s528885930 | 1,422 | 350 | 95,932 | 37,072 | Accepted | Accepted | 75.39 | from collections import deque
def bfs(graph:list, node:int, start:int) -> list:
# 未探索のノードは距離INF
INF = float("inf")
dist = [INF]*node
# 始点ノードの距離を0とし、dfsのためのstackを作成
dist[start] = 0
que = deque([(0,start)])
# 未探索のノードをqueueに入れる
while que:
cost, cur_node = que... | import sys
sdin = sys.stdin.readline
N,M = list(map(int, sdin().split()))
AB = []
for i in range(M):
AB.append(tuple(map(int, sdin().split())))
to_mid = set()
from_mid = set()
for a,b in AB:
if a==1:
to_mid.add(b)
if b==N:
from_mid.add(a)
if to_mid & from_mid... | 45 | 21 | 1,035 | 371 | from collections import deque
def bfs(graph: list, node: int, start: int) -> list:
# 未探索のノードは距離INF
INF = float("inf")
dist = [INF] * node
# 始点ノードの距離を0とし、dfsのためのstackを作成
dist[start] = 0
que = deque([(0, start)])
# 未探索のノードをqueueに入れる
while que:
cost, cur_node = que.popleft()
... | import sys
sdin = sys.stdin.readline
N, M = list(map(int, sdin().split()))
AB = []
for i in range(M):
AB.append(tuple(map(int, sdin().split())))
to_mid = set()
from_mid = set()
for a, b in AB:
if a == 1:
to_mid.add(b)
if b == N:
from_mid.add(a)
if to_mid & from_mid:
print("POSSIBLE")
el... | false | 53.333333 | [
"-from collections import deque",
"+import sys",
"-",
"-def bfs(graph: list, node: int, start: int) -> list:",
"- # 未探索のノードは距離INF",
"- INF = float(\"inf\")",
"- dist = [INF] * node",
"- # 始点ノードの距離を0とし、dfsのためのstackを作成",
"- dist[start] = 0",
"- que = deque([(0, start)])",
"- #... | false | 0.034553 | 0.035847 | 0.963892 | [
"s862381763",
"s528885930"
] |
u696197059 | p03470 | python | s891703492 | s499347465 | 74 | 61 | 62,456 | 62,380 | Accepted | Accepted | 17.57 | n = int(eval(input()))
d = [int(eval(input())) for i in range(n)]
num = [0] * 110
count = 0
for i in range(len(d)):
num[d[i]]+= 1
for j in num:
if j >= 1:
count += 1
print(count) | n = int(eval(input()))
syu = set([int(eval(input())) for i in range(n)])
print((len(syu))) | 10 | 4 | 191 | 80 | n = int(eval(input()))
d = [int(eval(input())) for i in range(n)]
num = [0] * 110
count = 0
for i in range(len(d)):
num[d[i]] += 1
for j in num:
if j >= 1:
count += 1
print(count)
| n = int(eval(input()))
syu = set([int(eval(input())) for i in range(n)])
print((len(syu)))
| false | 60 | [
"-d = [int(eval(input())) for i in range(n)]",
"-num = [0] * 110",
"-count = 0",
"-for i in range(len(d)):",
"- num[d[i]] += 1",
"-for j in num:",
"- if j >= 1:",
"- count += 1",
"-print(count)",
"+syu = set([int(eval(input())) for i in range(n)])",
"+print((len(syu)))"
] | false | 0.042674 | 0.037132 | 1.149242 | [
"s891703492",
"s499347465"
] |
u143492911 | p03495 | python | s150182293 | s397363244 | 230 | 207 | 52,788 | 39,348 | Accepted | Accepted | 10 | n,k=list(map(int,input().split()))
a=list(map(int,input().split()))
from collections import Counter
data=Counter(a)
data_i=sorted(list(data.items()),key=lambda x:x[1])
count=0
set_a=list(set(a))
if k<len(set_a):
for i in range(len(set_a)-k):
count+=data_i[i][1]
print(count)
else:
print((... | n,k=list(map(int,input().split()))
a=list(map(int,input().split()))
import collections
data=collections.Counter(a)
data=sorted(list(data.items()),key=lambda x:x[1])
count=0
if len(data)<=k:
print((0))
exit()
else:
for i in range(len(data)-k):
count+=data[i][1]
print(count)
| 13 | 13 | 310 | 292 | n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
from collections import Counter
data = Counter(a)
data_i = sorted(list(data.items()), key=lambda x: x[1])
count = 0
set_a = list(set(a))
if k < len(set_a):
for i in range(len(set_a) - k):
count += data_i[i][1]
print(count)
else:... | n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
import collections
data = collections.Counter(a)
data = sorted(list(data.items()), key=lambda x: x[1])
count = 0
if len(data) <= k:
print((0))
exit()
else:
for i in range(len(data) - k):
count += data[i][1]
print(count)
| false | 0 | [
"-from collections import Counter",
"+import collections",
"-data = Counter(a)",
"-data_i = sorted(list(data.items()), key=lambda x: x[1])",
"+data = collections.Counter(a)",
"+data = sorted(list(data.items()), key=lambda x: x[1])",
"-set_a = list(set(a))",
"-if k < len(set_a):",
"- for i in rang... | false | 0.040976 | 0.040932 | 1.001083 | [
"s150182293",
"s397363244"
] |
u426534722 | p02244 | python | s581888106 | s842740590 | 410 | 360 | 6,356 | 6,348 | Accepted | Accepted | 12.2 | from itertools import product
from copy import deepcopy, copy
class QueenMAP():
def __init__(self):
self.yoko = set()
self.tate = set()
self.naname1 = set()
self.naname2 = set()
self.MAP = [["."] * 8 for _ in range(8)]
def add(self, y, x):
self.MAP[y][x]... | from itertools import product
from copy import deepcopy, copy
class QueenMAP():
__slots__ = ["yoko", "tate", "naname1", "naname2", "MAP"]
def __init__(self):
self.yoko = set()
self.tate = set()
self.naname1 = set()
self.naname2 = set()
self.MAP = [["."] * 8 for _... | 90 | 49 | 2,475 | 1,472 | from itertools import product
from copy import deepcopy, copy
class QueenMAP:
def __init__(self):
self.yoko = set()
self.tate = set()
self.naname1 = set()
self.naname2 = set()
self.MAP = [["."] * 8 for _ in range(8)]
def add(self, y, x):
self.MAP[y][x] = "Q"
... | from itertools import product
from copy import deepcopy, copy
class QueenMAP:
__slots__ = ["yoko", "tate", "naname1", "naname2", "MAP"]
def __init__(self):
self.yoko = set()
self.tate = set()
self.naname1 = set()
self.naname2 = set()
self.MAP = [["."] * 8 for _ in rang... | false | 45.555556 | [
"+ __slots__ = [\"yoko\", \"tate\", \"naname1\", \"naname2\", \"MAP\"]",
"+",
"-def nuri(m, a, b):",
"- for i in range(8):",
"- m[a][i] = \"1\"",
"- m[i][b] = \"1\"",
"- if a + b < 8:",
"- y = a + b",
"- x = 0",
"- l = a + b + 1",
"- else:",
"- ... | false | 0.241515 | 0.239642 | 1.007816 | [
"s581888106",
"s842740590"
] |
u094191970 | p02862 | python | s339713595 | s049946141 | 754 | 156 | 82,448 | 3,064 | Accepted | Accepted | 79.31 | def make_tables(m):
fac=[1,1]
finv=[1,1]
inv=[0,1]
for i in range(2,m+1):
fac.append((fac[-1]*i)%mod)
inv.append((-inv[mod%i]*(mod//i))%mod)
finv.append(finv[i-1]*inv[i]%mod)
return fac,finv
def calc_nCk(n,k,fac,finv):
if n<k or (n<0 or k<0):
return 0... | def nCk(n,k):
if n<k or (n<0 or k<0):
return 0
#k=min(k,n-k)
num,denum=1,1
for i in range(k):
num=num*(n-i)%mod
denum=denum*(i+1)%mod
return num*pow(denum,mod-2,mod)%mod
x,y=list(map(int,input().split()))
mod=10**9+7
n=(y-0.5*x)/1.5
if int(n)!=n:
print((0))... | 27 | 19 | 593 | 370 | def make_tables(m):
fac = [1, 1]
finv = [1, 1]
inv = [0, 1]
for i in range(2, m + 1):
fac.append((fac[-1] * i) % mod)
inv.append((-inv[mod % i] * (mod // i)) % mod)
finv.append(finv[i - 1] * inv[i] % mod)
return fac, finv
def calc_nCk(n, k, fac, finv):
if n < k or (n < ... | def nCk(n, k):
if n < k or (n < 0 or k < 0):
return 0
# k=min(k,n-k)
num, denum = 1, 1
for i in range(k):
num = num * (n - i) % mod
denum = denum * (i + 1) % mod
return num * pow(denum, mod - 2, mod) % mod
x, y = list(map(int, input().split()))
mod = 10**9 + 7
n = (y - 0.5 ... | false | 29.62963 | [
"-def make_tables(m):",
"- fac = [1, 1]",
"- finv = [1, 1]",
"- inv = [0, 1]",
"- for i in range(2, m + 1):",
"- fac.append((fac[-1] * i) % mod)",
"- inv.append((-inv[mod % i] * (mod // i)) % mod)",
"- finv.append(finv[i - 1] * inv[i] % mod)",
"- return fac, finv"... | false | 0.284551 | 0.154612 | 1.84042 | [
"s339713595",
"s049946141"
] |
u747602774 | p02804 | python | s835748007 | s298406991 | 389 | 359 | 14,416 | 14,044 | Accepted | Accepted | 7.71 | def modinv2(a,m):
return pow(a,m-2,m)
N,K = list(map(int,input().split()))
A = list(map(int,input().split()))
A.sort()
P = 10**9+7
cominv = [0 for i in range(N-1)]
for i in range(N-1):
if i+2 == K:
cominv[i] = 1
elif i+1 == K:
cominv[i] = (i+1)%P
elif i+1 > K:
a ... | def modinv2(a,m):
return pow(a,m-2,m)
def modcomn(n,r,m):
modcom = [0 for _ in range(n)]
for i in range(n):
if i < r-1:
continue
if i == r-1:
modcom[i] = 1
elif i == r:
modcom[i] = (i+1)%m
else:
div = modinv2(i-r+1... | 30 | 34 | 593 | 695 | def modinv2(a, m):
return pow(a, m - 2, m)
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
A.sort()
P = 10**9 + 7
cominv = [0 for i in range(N - 1)]
for i in range(N - 1):
if i + 2 == K:
cominv[i] = 1
elif i + 1 == K:
cominv[i] = (i + 1) % P
elif i + 1 > K:
... | def modinv2(a, m):
return pow(a, m - 2, m)
def modcomn(n, r, m):
modcom = [0 for _ in range(n)]
for i in range(n):
if i < r - 1:
continue
if i == r - 1:
modcom[i] = 1
elif i == r:
modcom[i] = (i + 1) % m
else:
div = modinv2(i ... | false | 11.764706 | [
"+",
"+",
"+def modcomn(n, r, m):",
"+ modcom = [0 for _ in range(n)]",
"+ for i in range(n):",
"+ if i < r - 1:",
"+ continue",
"+ if i == r - 1:",
"+ modcom[i] = 1",
"+ elif i == r:",
"+ modcom[i] = (i + 1) % m",
"+ else:",
... | false | 0.070231 | 0.070447 | 0.996927 | [
"s835748007",
"s298406991"
] |
u002459665 | p03290 | python | s985203834 | s748339595 | 63 | 44 | 3,188 | 3,064 | Accepted | Accepted | 30.16 | from itertools import combinations
D, G = list(map(int, input().split()))
PC = []
for i in range(D):
p, c = list(map(int, input().split()))
total = ((i + 1) * 100) * p + c
PC.append([p, c, total])
A = []
B = {i for i in range(D)}
for i in range(D+1):
A += list(combinations(B, i))
# prin... | D, G = list(map(int, input().split()))
PC = []
for i in range(D):
p, c = list(map(int, input().split()))
s = (i+1) * 100
PC.append([p, c, s])
P = []
for i in range(2 ** D):
b = format(i, 'b').zfill(D)
P.append(b)
def get_high_score_q(p):
if p.count('0') == 0:
return None
... | 39 | 52 | 822 | 1,151 | from itertools import combinations
D, G = list(map(int, input().split()))
PC = []
for i in range(D):
p, c = list(map(int, input().split()))
total = ((i + 1) * 100) * p + c
PC.append([p, c, total])
A = []
B = {i for i in range(D)}
for i in range(D + 1):
A += list(combinations(B, i))
# print(A)
ans = []
... | D, G = list(map(int, input().split()))
PC = []
for i in range(D):
p, c = list(map(int, input().split()))
s = (i + 1) * 100
PC.append([p, c, s])
P = []
for i in range(2**D):
b = format(i, "b").zfill(D)
P.append(b)
def get_high_score_q(p):
if p.count("0") == 0:
return None
else:
... | false | 25 | [
"-from itertools import combinations",
"-",
"- total = ((i + 1) * 100) * p + c",
"- PC.append([p, c, total])",
"-A = []",
"-B = {i for i in range(D)}",
"-for i in range(D + 1):",
"- A += list(combinations(B, i))",
"-# print(A)",
"-ans = []",
"-for ai in A:",
"- p = 0 # ポイント",
"-... | false | 0.007455 | 0.04312 | 0.172896 | [
"s985203834",
"s748339595"
] |
u392029857 | p03495 | python | s397696949 | s767470112 | 116 | 106 | 32,544 | 32,540 | Accepted | Accepted | 8.62 | from collections import Counter
N, K = list(map(int, input().split()))
a = Counter(list(map(int, input().split())))
if N == K:
print((0))
else:
num = list(a.values())
if len(num) <= K:
print((0))
else:
print((sum(sorted(num)[:-K]))) | from collections import Counter
N, K = list(map(int, input().split()))
A = sorted(list(Counter(list(map(int, input().split()))).values()))
if N == K:
print((0))
elif len(A) <= K:
print((0))
else:
print((sum(A[:-K]))) | 11 | 9 | 262 | 224 | from collections import Counter
N, K = list(map(int, input().split()))
a = Counter(list(map(int, input().split())))
if N == K:
print((0))
else:
num = list(a.values())
if len(num) <= K:
print((0))
else:
print((sum(sorted(num)[:-K])))
| from collections import Counter
N, K = list(map(int, input().split()))
A = sorted(list(Counter(list(map(int, input().split()))).values()))
if N == K:
print((0))
elif len(A) <= K:
print((0))
else:
print((sum(A[:-K])))
| false | 18.181818 | [
"-a = Counter(list(map(int, input().split())))",
"+A = sorted(list(Counter(list(map(int, input().split()))).values()))",
"+elif len(A) <= K:",
"+ print((0))",
"- num = list(a.values())",
"- if len(num) <= K:",
"- print((0))",
"- else:",
"- print((sum(sorted(num)[:-K])))",
... | false | 0.038543 | 0.047787 | 0.806556 | [
"s397696949",
"s767470112"
] |
u294922877 | p02390 | python | s865406753 | s579444361 | 30 | 20 | 8,116 | 7,660 | Accepted | Accepted | 33.33 | import datetime
s = int(eval(input()))
hour = int(s / 60 / 60)
minute = int((s - (hour * 60 * 60)) / 60)
second = int((s - (hour * 60 * 60)) % 60)
print(("{0}:{1}:{2}".format(hour,minute,second))) | S = int(eval(input()))
h = S // 3600
m = S % 3600 // 60
s = S % 3600 % 60
print(("%d:%d:%d" % (h,m,s))) | 7 | 5 | 195 | 99 | import datetime
s = int(eval(input()))
hour = int(s / 60 / 60)
minute = int((s - (hour * 60 * 60)) / 60)
second = int((s - (hour * 60 * 60)) % 60)
print(("{0}:{1}:{2}".format(hour, minute, second)))
| S = int(eval(input()))
h = S // 3600
m = S % 3600 // 60
s = S % 3600 % 60
print(("%d:%d:%d" % (h, m, s)))
| false | 28.571429 | [
"-import datetime",
"-",
"-s = int(eval(input()))",
"-hour = int(s / 60 / 60)",
"-minute = int((s - (hour * 60 * 60)) / 60)",
"-second = int((s - (hour * 60 * 60)) % 60)",
"-print((\"{0}:{1}:{2}\".format(hour, minute, second)))",
"+S = int(eval(input()))",
"+h = S // 3600",
"+m = S % 3600 // 60",
... | false | 0.048335 | 0.049929 | 0.968056 | [
"s865406753",
"s579444361"
] |
u633068244 | p00275 | python | s400363700 | s183750410 | 30 | 20 | 4,232 | 4,232 | Accepted | Accepted | 33.33 | while 1:
n=eval(input())
if n==0:break
a=[0]*n
c=input()
b=0
for i in range(100):
if c[i]=="M":
a[i%n]+=1
elif c[i]=="S":
b+=1+a[i%n]
a[i%n]=0
else:
a[i%n]+=1+b
b=0
print(" ".join(map(str,sorted(a))),b) | while 1:
n=eval(input())
if n==0:break
a,b,c=[0]*n,0,input()
for i in range(100):
if c[i]=="M":
a[i%n]+=1
elif c[i]=="S":
b+=1+a[i%n]
a[i%n]=0
else:
a[i%n]+=1+b
b=0
print(" ".join(map(str,sorted(a))),b) | 16 | 14 | 242 | 238 | while 1:
n = eval(input())
if n == 0:
break
a = [0] * n
c = input()
b = 0
for i in range(100):
if c[i] == "M":
a[i % n] += 1
elif c[i] == "S":
b += 1 + a[i % n]
a[i % n] = 0
else:
a[i % n] += 1 + b
b = 0
... | while 1:
n = eval(input())
if n == 0:
break
a, b, c = [0] * n, 0, input()
for i in range(100):
if c[i] == "M":
a[i % n] += 1
elif c[i] == "S":
b += 1 + a[i % n]
a[i % n] = 0
else:
a[i % n] += 1 + b
b = 0
prin... | false | 12.5 | [
"- a = [0] * n",
"- c = input()",
"- b = 0",
"+ a, b, c = [0] * n, 0, input()"
] | false | 0.038583 | 0.03661 | 1.05387 | [
"s400363700",
"s183750410"
] |
u209918867 | p03502 | python | s604122515 | s962663306 | 20 | 17 | 3,060 | 2,940 | Accepted | Accepted | 15 | n=int(eval(input()))
def ds(n):
return sum(map(int,str(n)))
print(('Yes' if n%ds(n)==0 else 'No')) | s=eval(input());print(('YNeos'[int(s)%sum(map(int,s))>0::2])) | 4 | 1 | 95 | 53 | n = int(eval(input()))
def ds(n):
return sum(map(int, str(n)))
print(("Yes" if n % ds(n) == 0 else "No"))
| s = eval(input())
print(("YNeos"[int(s) % sum(map(int, s)) > 0 :: 2]))
| false | 75 | [
"-n = int(eval(input()))",
"-",
"-",
"-def ds(n):",
"- return sum(map(int, str(n)))",
"-",
"-",
"-print((\"Yes\" if n % ds(n) == 0 else \"No\"))",
"+s = eval(input())",
"+print((\"YNeos\"[int(s) % sum(map(int, s)) > 0 :: 2]))"
] | false | 0.008483 | 0.037508 | 0.226172 | [
"s604122515",
"s962663306"
] |
u481250941 | p03636 | python | s827258658 | s776991958 | 106 | 75 | 6,376 | 16,320 | Accepted | Accepted | 29.25 | #
# abc06x b
#
import unittest
from io import StringIO
import sys
def input():
return sys.stdin.readline().rstrip()
def resolve():
s = eval(input())
print((s[0]+str(len(s)-2)+s[-1]))
class TestClass(unittest.TestCase):
def assertIO(self, input, output):
stdout, stdin = s... | #
# abc069 b
#
import sys
from io import StringIO
import unittest
class TestClass(unittest.TestCase):
def assertIO(self, input, output):
stdout, stdin = sys.stdout, sys.stdin
sys.stdout, sys.stdin = StringIO(), StringIO(input)
resolve()
sys.stdout.seek(0)
out ... | 46 | 42 | 1,021 | 967 | #
# abc06x b
#
import unittest
from io import StringIO
import sys
def input():
return sys.stdin.readline().rstrip()
def resolve():
s = eval(input())
print((s[0] + str(len(s) - 2) + s[-1]))
class TestClass(unittest.TestCase):
def assertIO(self, input, output):
stdout, stdin = sys.stdout, sy... | #
# abc069 b
#
import sys
from io import StringIO
import unittest
class TestClass(unittest.TestCase):
def assertIO(self, input, output):
stdout, stdin = sys.stdout, sys.stdin
sys.stdout, sys.stdin = StringIO(), StringIO(input)
resolve()
sys.stdout.seek(0)
out = sys.stdout.r... | false | 8.695652 | [
"-# abc06x b",
"+# abc069 b",
"+import sys",
"+from io import StringIO",
"-from io import StringIO",
"-import sys",
"-",
"-",
"-def input():",
"- return sys.stdin.readline().rstrip()",
"-",
"-",
"-def resolve():",
"- s = eval(input())",
"- print((s[0] + str(len(s) - 2) + s[-1]))... | false | 0.103384 | 0.223986 | 0.461563 | [
"s827258658",
"s776991958"
] |
u279493135 | p02609 | python | s397080778 | s451196114 | 348 | 231 | 85,748 | 89,792 | Accepted | Accepted | 33.62 | import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, gcd
from itertools import accumulate, permutations, combinations, product, groupby, combinations_with_replacement
from operator import itemgetter, mul
from copy import deepcopy
... | import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, gcd
from itertools import accumulate, permutations, combinations, product, groupby, combinations_with_replacement
from operator import itemgetter, mul
from copy import deepcopy
... | 62 | 75 | 1,571 | 2,005 | import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, gcd
from itertools import (
accumulate,
permutations,
combinations,
product,
groupby,
combinations_with_replacement,
)
from operator import itemgetter, mul
fro... | import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, gcd
from itertools import (
accumulate,
permutations,
combinations,
product,
groupby,
combinations_with_replacement,
)
from operator import itemgetter, mul
fro... | false | 17.333333 | [
"+def bitcount(x):",
"+ \"\"\"xの立っているビット数をカウントする関数",
"+ (xは64bit整数)\"\"\"",
"+ # 2bitごとの組に分け、立っているビット数を2bitで表現する",
"+ x = x - ((x >> 1) & 0x5555555555555555)",
"+ # 4bit整数に 上位2bit + 下位2bit を計算した値を入れる",
"+ x = (x & 0x3333333333333333) + ((x >> 2) & 0x3333333333333333)",
"+ x = (x +... | false | 0.043148 | 0.199058 | 0.216763 | [
"s397080778",
"s451196114"
] |
u488127128 | p03796 | python | s471514725 | s637972642 | 43 | 32 | 2,940 | 2,940 | Accepted | Accepted | 25.58 | N = int(eval(input()))
power_r = 1
for n in range(2,N+1):
power_r *= n
power_r %= 10**9+7
print(power_r) | def factorial(N):
power_r = 1
for n in range(2,N+1):
power_r *= n
power_r %= 10**9+7
return power_r
if __name__ == '__main__':
N = int(eval(input()))
print((factorial(N))) | 6 | 10 | 111 | 209 | N = int(eval(input()))
power_r = 1
for n in range(2, N + 1):
power_r *= n
power_r %= 10**9 + 7
print(power_r)
| def factorial(N):
power_r = 1
for n in range(2, N + 1):
power_r *= n
power_r %= 10**9 + 7
return power_r
if __name__ == "__main__":
N = int(eval(input()))
print((factorial(N)))
| false | 40 | [
"-N = int(eval(input()))",
"-power_r = 1",
"-for n in range(2, N + 1):",
"- power_r *= n",
"- power_r %= 10**9 + 7",
"-print(power_r)",
"+def factorial(N):",
"+ power_r = 1",
"+ for n in range(2, N + 1):",
"+ power_r *= n",
"+ power_r %= 10**9 + 7",
"+ return power... | false | 0.044446 | 0.050538 | 0.879455 | [
"s471514725",
"s637972642"
] |
u620084012 | p03574 | python | s017402143 | s008853370 | 219 | 27 | 44,272 | 3,188 | Accepted | Accepted | 87.67 | H, W = map(int,input().split())
S = ["."*(W+2)]+ ["."+input()+"." for k in range(H)] + ["."*(W+2)]
ans = [[0 for k in range(W)] for l in range(H)]
for x in range(1,W+1):
for y in range(1,H+1):
if S[y][x] == "#":
ans[y-1][x-1] = "#"
else:
c = 0
for dx in... | H, W = list(map(int,input().split()))
S = ["."+eval(input())+"." for k in range(H)]
S = ["."*(W+2)] + S + ["."*(W+2)]
A = [[""]*W for _ in range(H)]
for h in range(1,H+1):
for w in range(1,W+1):
if S[h][w] == "#":
A[h-1][w-1] = "#"
else:
temp = 0
for d... | 18 | 18 | 522 | 520 | H, W = map(int, input().split())
S = ["." * (W + 2)] + ["." + input() + "." for k in range(H)] + ["." * (W + 2)]
ans = [[0 for k in range(W)] for l in range(H)]
for x in range(1, W + 1):
for y in range(1, H + 1):
if S[y][x] == "#":
ans[y - 1][x - 1] = "#"
else:
c = 0
... | H, W = list(map(int, input().split()))
S = ["." + eval(input()) + "." for k in range(H)]
S = ["." * (W + 2)] + S + ["." * (W + 2)]
A = [[""] * W for _ in range(H)]
for h in range(1, H + 1):
for w in range(1, W + 1):
if S[h][w] == "#":
A[h - 1][w - 1] = "#"
else:
temp = 0
... | false | 0 | [
"-H, W = map(int, input().split())",
"-S = [\".\" * (W + 2)] + [\".\" + input() + \".\" for k in range(H)] + [\".\" * (W + 2)]",
"-ans = [[0 for k in range(W)] for l in range(H)]",
"-for x in range(1, W + 1):",
"- for y in range(1, H + 1):",
"- if S[y][x] == \"#\":",
"- ans[y - 1][x... | false | 0.043262 | 0.073311 | 0.590123 | [
"s017402143",
"s008853370"
] |
u175746978 | p02713 | python | s328831721 | s722223623 | 1,393 | 1,223 | 9,124 | 9,176 | Accepted | Accepted | 12.2 | import math
num = (int)(eval(input()))
total = 0
for i in range(1, num + 1):
for j in range(1, num + 1):
sub = math.gcd(i, j)
for k in range(1, num + 1):
total += math.gcd(sub, k)
print(total) | from math import gcd
num = (int)(eval(input()))
total = 0
for i in range(1, num + 1):
for j in range(1, num + 1):
sub = gcd(i, j)
for k in range(1, num + 1):
total += gcd(sub, k)
print(total)
| 10 | 10 | 213 | 213 | import math
num = (int)(eval(input()))
total = 0
for i in range(1, num + 1):
for j in range(1, num + 1):
sub = math.gcd(i, j)
for k in range(1, num + 1):
total += math.gcd(sub, k)
print(total)
| from math import gcd
num = (int)(eval(input()))
total = 0
for i in range(1, num + 1):
for j in range(1, num + 1):
sub = gcd(i, j)
for k in range(1, num + 1):
total += gcd(sub, k)
print(total)
| false | 0 | [
"-import math",
"+from math import gcd",
"- sub = math.gcd(i, j)",
"+ sub = gcd(i, j)",
"- total += math.gcd(sub, k)",
"+ total += gcd(sub, k)"
] | false | 0.124093 | 0.103244 | 1.201942 | [
"s328831721",
"s722223623"
] |
u995062424 | p03137 | python | s653878308 | s427609680 | 113 | 102 | 13,960 | 13,960 | Accepted | Accepted | 9.73 | N, M = list(map(int, input().split()))
X = list(map(int, input().split()))
X.sort()
L = [0]*(M-1)
for i in range(M-1):
L[i] = X[i+1]-X[i]
L.sort(reverse=True)
print((X[M-1]-X[0]-sum(L[:N-1]))) | def main():
N, M = list(map(int, input().split()))
X = list(map(int, input().split()))
X.sort()
h = [0]*M
for i in range(1, M):
h[i] = X[i]-X[i-1]
h.sort(reverse=True)
print((X[M-1]-X[0]-sum(h[:(N-1)])))
main() | 10 | 12 | 199 | 259 | N, M = list(map(int, input().split()))
X = list(map(int, input().split()))
X.sort()
L = [0] * (M - 1)
for i in range(M - 1):
L[i] = X[i + 1] - X[i]
L.sort(reverse=True)
print((X[M - 1] - X[0] - sum(L[: N - 1])))
| def main():
N, M = list(map(int, input().split()))
X = list(map(int, input().split()))
X.sort()
h = [0] * M
for i in range(1, M):
h[i] = X[i] - X[i - 1]
h.sort(reverse=True)
print((X[M - 1] - X[0] - sum(h[: (N - 1)])))
main()
| false | 16.666667 | [
"-N, M = list(map(int, input().split()))",
"-X = list(map(int, input().split()))",
"-X.sort()",
"-L = [0] * (M - 1)",
"-for i in range(M - 1):",
"- L[i] = X[i + 1] - X[i]",
"-L.sort(reverse=True)",
"-print((X[M - 1] - X[0] - sum(L[: N - 1])))",
"+def main():",
"+ N, M = list(map(int, input()... | false | 0.040367 | 0.040955 | 0.985625 | [
"s653878308",
"s427609680"
] |
u761320129 | p03611 | python | s286740278 | s687975505 | 174 | 77 | 14,564 | 14,092 | Accepted | Accepted | 55.75 | from collections import Counter
N = int(eval(input()))
src = list(map(int,input().split()))
ctr = Counter(src)
mx = max(src)
ans = 0
for i in range(mx+1):
ans = max(ans, ctr[i] + ctr[i+1] + ctr[i+2])
print(ans)
| N = int(eval(input()))
src = list(map(int,input().split()))
mem = [0] * (10**5+2)
for a in src:
mem[a] += 1
mem[a+1] += 1
mem[a+2] += 1
print((max(mem))) | 10 | 8 | 219 | 164 | from collections import Counter
N = int(eval(input()))
src = list(map(int, input().split()))
ctr = Counter(src)
mx = max(src)
ans = 0
for i in range(mx + 1):
ans = max(ans, ctr[i] + ctr[i + 1] + ctr[i + 2])
print(ans)
| N = int(eval(input()))
src = list(map(int, input().split()))
mem = [0] * (10**5 + 2)
for a in src:
mem[a] += 1
mem[a + 1] += 1
mem[a + 2] += 1
print((max(mem)))
| false | 20 | [
"-from collections import Counter",
"-",
"-ctr = Counter(src)",
"-mx = max(src)",
"-ans = 0",
"-for i in range(mx + 1):",
"- ans = max(ans, ctr[i] + ctr[i + 1] + ctr[i + 2])",
"-print(ans)",
"+mem = [0] * (10**5 + 2)",
"+for a in src:",
"+ mem[a] += 1",
"+ mem[a + 1] += 1",
"+ me... | false | 0.039514 | 0.061535 | 0.642139 | [
"s286740278",
"s687975505"
] |
u604774382 | p02398 | python | s677850684 | s438492478 | 30 | 20 | 6,724 | 4,500 | Accepted | Accepted | 33.33 | import sys
a, b, c = [ int( val ) for val in sys.stdin.readline().split( ' ' ) ]
cnt = 0
for divisor in range( a, b+1 ):
if ( c % divisor ) == 0:
cnt += 1
print(( "{}".format( cnt ) )) | import sys
a, b, c = [ int( val ) for val in sys.stdin.readline().split( " " ) ]
cnt = 0
for i in range( a, b+1 ):
if 0 == c%i:
cnt += 1
print(( "{}".format( cnt ) )) | 8 | 8 | 202 | 175 | import sys
a, b, c = [int(val) for val in sys.stdin.readline().split(" ")]
cnt = 0
for divisor in range(a, b + 1):
if (c % divisor) == 0:
cnt += 1
print(("{}".format(cnt)))
| import sys
a, b, c = [int(val) for val in sys.stdin.readline().split(" ")]
cnt = 0
for i in range(a, b + 1):
if 0 == c % i:
cnt += 1
print(("{}".format(cnt)))
| false | 0 | [
"-for divisor in range(a, b + 1):",
"- if (c % divisor) == 0:",
"+for i in range(a, b + 1):",
"+ if 0 == c % i:"
] | false | 0.037575 | 0.038082 | 0.986698 | [
"s677850684",
"s438492478"
] |
u609061751 | p02885 | python | s309854670 | s937131999 | 182 | 164 | 38,256 | 38,256 | Accepted | Accepted | 9.89 | import sys
input = sys.stdin.readline
a, b = [int(x) for x in input().split()]
if 2*b >= a:
print((0))
else:
print((a - 2*b)) | import sys
input = lambda : sys.stdin.readline().rstrip()
a, b = list(map(int, input().split()))
print((max(0, a - 2*b))) | 8 | 5 | 137 | 118 | import sys
input = sys.stdin.readline
a, b = [int(x) for x in input().split()]
if 2 * b >= a:
print((0))
else:
print((a - 2 * b))
| import sys
input = lambda: sys.stdin.readline().rstrip()
a, b = list(map(int, input().split()))
print((max(0, a - 2 * b)))
| false | 37.5 | [
"-input = sys.stdin.readline",
"-a, b = [int(x) for x in input().split()]",
"-if 2 * b >= a:",
"- print((0))",
"-else:",
"- print((a - 2 * b))",
"+input = lambda: sys.stdin.readline().rstrip()",
"+a, b = list(map(int, input().split()))",
"+print((max(0, a - 2 * b)))"
] | false | 0.037045 | 0.035747 | 1.036323 | [
"s309854670",
"s937131999"
] |
u600402037 | p03274 | python | s918209721 | s201483254 | 104 | 96 | 14,224 | 15,020 | Accepted | Accepted | 7.69 | N, K = list(map(int, input().split()))
X = list(map(int, input().split()))
answer = 10 ** 9
for i in range(N-K+1):
b, c = X[i], X[i+K-1]
if b * c >= 0:
answer = min(answer, max(abs(b), abs(c)))
else:
d, e = min(abs(b), abs(c)), max(abs(b), abs(c))
answer = min(answer, d*2+... | N, K = list(map(int, input().split()))
X = list(map(int, input().split()))
answer = []
for i in range(N-K+1):
a, b = X[i], X[i+K-1]
answer.append(min(abs(a-b) + abs(b), abs(b-a) + abs(a)))
print((min(answer)))
| 12 | 8 | 332 | 218 | N, K = list(map(int, input().split()))
X = list(map(int, input().split()))
answer = 10**9
for i in range(N - K + 1):
b, c = X[i], X[i + K - 1]
if b * c >= 0:
answer = min(answer, max(abs(b), abs(c)))
else:
d, e = min(abs(b), abs(c)), max(abs(b), abs(c))
answer = min(answer, d * 2 + e... | N, K = list(map(int, input().split()))
X = list(map(int, input().split()))
answer = []
for i in range(N - K + 1):
a, b = X[i], X[i + K - 1]
answer.append(min(abs(a - b) + abs(b), abs(b - a) + abs(a)))
print((min(answer)))
| false | 33.333333 | [
"-answer = 10**9",
"+answer = []",
"- b, c = X[i], X[i + K - 1]",
"- if b * c >= 0:",
"- answer = min(answer, max(abs(b), abs(c)))",
"- else:",
"- d, e = min(abs(b), abs(c)), max(abs(b), abs(c))",
"- answer = min(answer, d * 2 + e)",
"-print(answer)",
"+ a, b = X[i... | false | 0.122001 | 0.105975 | 1.151223 | [
"s918209721",
"s201483254"
] |
u130900604 | p02719 | python | s096971255 | s166198023 | 180 | 17 | 38,256 | 2,940 | Accepted | Accepted | 90.56 | def MI():return list(map(int,input().split()))
def LI():return list(MI())
N,K=MI()
ans=N%K
ans2=(-N)%K
print((min(ans,ans2))) | n,k=list(map(int,input().split()))
print((min(n%k,(-n)%k))) | 8 | 2 | 126 | 52 | def MI():
return list(map(int, input().split()))
def LI():
return list(MI())
N, K = MI()
ans = N % K
ans2 = (-N) % K
print((min(ans, ans2)))
| n, k = list(map(int, input().split()))
print((min(n % k, (-n) % k)))
| false | 75 | [
"-def MI():",
"- return list(map(int, input().split()))",
"-",
"-",
"-def LI():",
"- return list(MI())",
"-",
"-",
"-N, K = MI()",
"-ans = N % K",
"-ans2 = (-N) % K",
"-print((min(ans, ans2)))",
"+n, k = list(map(int, input().split()))",
"+print((min(n % k, (-n) % k)))"
] | false | 0.053629 | 0.036128 | 1.484413 | [
"s096971255",
"s166198023"
] |
u699296734 | p02952 | python | s329367326 | s069770905 | 59 | 25 | 9,092 | 9,196 | Accepted | Accepted | 57.63 | n = int(eval(input()))
counter = 0
for i in range(1, n + 1):
if len(str(i)) % 2 == 1:
counter += 1
print(counter) | n = int(eval(input()))
res = 0
for i in range(6):
if n // (10 ** i) >= 10 and (i + 1) % 2 == 1:
res += 9 * (10 ** i)
elif 1 <= n // (10 ** i) < 10 and (i + 1) % 2 == 1:
res += ((n // (10 ** i)) - 1) * (10 ** i)
res += (n % (10 ** i)) + 1 # i になってなかった
print(res)
# res_2 = 0
# ... | 7 | 16 | 126 | 412 | n = int(eval(input()))
counter = 0
for i in range(1, n + 1):
if len(str(i)) % 2 == 1:
counter += 1
print(counter)
| n = int(eval(input()))
res = 0
for i in range(6):
if n // (10**i) >= 10 and (i + 1) % 2 == 1:
res += 9 * (10**i)
elif 1 <= n // (10**i) < 10 and (i + 1) % 2 == 1:
res += ((n // (10**i)) - 1) * (10**i)
res += (n % (10**i)) + 1 # i になってなかった
print(res)
# res_2 = 0
# for i in range(1, n + 1... | false | 56.25 | [
"-counter = 0",
"-for i in range(1, n + 1):",
"- if len(str(i)) % 2 == 1:",
"- counter += 1",
"-print(counter)",
"+res = 0",
"+for i in range(6):",
"+ if n // (10**i) >= 10 and (i + 1) % 2 == 1:",
"+ res += 9 * (10**i)",
"+ elif 1 <= n // (10**i) < 10 and (i + 1) % 2 == 1:",... | false | 0.04313 | 0.045051 | 0.957361 | [
"s329367326",
"s069770905"
] |
u073852194 | p03346 | python | s592211280 | s221911674 | 418 | 379 | 18,856 | 18,888 | Accepted | Accepted | 9.33 | N = int(eval(input()))
P = [int(eval(input())) for _ in range(N)]
S = [0 for _ in range(N+1)]
for i in range(N):
if S[P[i]-1]!=0:
S[P[i]] = S[P[i]-1]+1
else:
S[P[i]] = 1
print((N-max(S))) | N = int(eval(input()))
P = [int(eval(input())) for _ in range(N)]
S = [0]*(N+1)
for p in P:
S[p] = S[p-1]+1
print((N-max(S))) | 12 | 9 | 215 | 126 | N = int(eval(input()))
P = [int(eval(input())) for _ in range(N)]
S = [0 for _ in range(N + 1)]
for i in range(N):
if S[P[i] - 1] != 0:
S[P[i]] = S[P[i] - 1] + 1
else:
S[P[i]] = 1
print((N - max(S)))
| N = int(eval(input()))
P = [int(eval(input())) for _ in range(N)]
S = [0] * (N + 1)
for p in P:
S[p] = S[p - 1] + 1
print((N - max(S)))
| false | 25 | [
"-S = [0 for _ in range(N + 1)]",
"-for i in range(N):",
"- if S[P[i] - 1] != 0:",
"- S[P[i]] = S[P[i] - 1] + 1",
"- else:",
"- S[P[i]] = 1",
"+S = [0] * (N + 1)",
"+for p in P:",
"+ S[p] = S[p - 1] + 1"
] | false | 0.097765 | 0.036022 | 2.714013 | [
"s592211280",
"s221911674"
] |
u810288681 | p03723 | python | s768822751 | s380549963 | 19 | 17 | 3,316 | 3,064 | Accepted | Accepted | 10.53 | a,b,c = list(map(int, input().split()))
ans = 0
while(a%2==0 and b%2==0 and c%2==0):
if(a==b and b==c and c==a):
ans = -1
break
else:
a1 = b+c
b1 = a+c
c1 = b+a
a = a1/2
b = b1/2
c = c1/2
ans+=1
print(ans) | l = list(map(int, input().split()))
ans = 0
while( l[0]%2==0 and l[1]%2==0 and l[2]%2==0):
if l[0]==l[1]and l[1]==l[2]:
ans = -1
break
else:
a = l[0]
b = l[1]
c = l[2]
l[0]=(b+c)/2
l[1]=(a+c)/2
l[2]=(a+b)/2
ans+=1
print(ans) | 16 | 15 | 299 | 318 | a, b, c = list(map(int, input().split()))
ans = 0
while a % 2 == 0 and b % 2 == 0 and c % 2 == 0:
if a == b and b == c and c == a:
ans = -1
break
else:
a1 = b + c
b1 = a + c
c1 = b + a
a = a1 / 2
b = b1 / 2
c = c1 / 2
ans += 1
print(ans)
| l = list(map(int, input().split()))
ans = 0
while l[0] % 2 == 0 and l[1] % 2 == 0 and l[2] % 2 == 0:
if l[0] == l[1] and l[1] == l[2]:
ans = -1
break
else:
a = l[0]
b = l[1]
c = l[2]
l[0] = (b + c) / 2
l[1] = (a + c) / 2
l[2] = (a + b) / 2
... | false | 6.25 | [
"-a, b, c = list(map(int, input().split()))",
"+l = list(map(int, input().split()))",
"-while a % 2 == 0 and b % 2 == 0 and c % 2 == 0:",
"- if a == b and b == c and c == a:",
"+while l[0] % 2 == 0 and l[1] % 2 == 0 and l[2] % 2 == 0:",
"+ if l[0] == l[1] and l[1] == l[2]:",
"- a1 = b + c",... | false | 0.065149 | 0.059771 | 1.089981 | [
"s768822751",
"s380549963"
] |
u777299405 | p00011 | python | s243793687 | s379189261 | 30 | 20 | 7,668 | 7,600 | Accepted | Accepted | 33.33 | w = int(eval(input()))
n = int(eval(input()))
lines = []
for i in range(n):
a, b = list(map(int, input().split(",")))
lines.append([a, b])
lines = list(reversed(lines))
for j in range(1, w + 1):
for line in lines:
if line[0] == j:
j = line[1]
elif line[1] == j:
... | w = int(eval(input())) + 1
l = [i for i in range(w)]
n = int(eval(input()))
for i in range(n):
a, b = list(map(int, input().split(",")))
l[a], l[b] = l[b], l[a]
for i in range(1, w):
print((l[i])) | 14 | 8 | 333 | 195 | w = int(eval(input()))
n = int(eval(input()))
lines = []
for i in range(n):
a, b = list(map(int, input().split(",")))
lines.append([a, b])
lines = list(reversed(lines))
for j in range(1, w + 1):
for line in lines:
if line[0] == j:
j = line[1]
elif line[1] == j:
j = li... | w = int(eval(input())) + 1
l = [i for i in range(w)]
n = int(eval(input()))
for i in range(n):
a, b = list(map(int, input().split(",")))
l[a], l[b] = l[b], l[a]
for i in range(1, w):
print((l[i]))
| false | 42.857143 | [
"-w = int(eval(input()))",
"+w = int(eval(input())) + 1",
"+l = [i for i in range(w)]",
"-lines = []",
"- lines.append([a, b])",
"-lines = list(reversed(lines))",
"-for j in range(1, w + 1):",
"- for line in lines:",
"- if line[0] == j:",
"- j = line[1]",
"- elif l... | false | 0.03615 | 0.034736 | 1.040693 | [
"s243793687",
"s379189261"
] |
u969080040 | p02693 | python | s408544218 | s600643674 | 21 | 19 | 9,152 | 9,176 | Accepted | Accepted | 9.52 | import sys
input=sys.stdin.readline
K=int(eval(input()))
A,B=list(map(int,input().split()))
for i in range(1001):
s=i*K
if A<=s and s<=B:
print("OK")
break
if 1000<s:
print("NG")
break | K=int(eval(input()))
A,B=list(map(int,input().split()))
for i in range(1001):
s=i*K
if A<=s and s<=B:
print("OK")
break
if 1000<s:
print("NG")
break | 12 | 10 | 205 | 167 | import sys
input = sys.stdin.readline
K = int(eval(input()))
A, B = list(map(int, input().split()))
for i in range(1001):
s = i * K
if A <= s and s <= B:
print("OK")
break
if 1000 < s:
print("NG")
break
| K = int(eval(input()))
A, B = list(map(int, input().split()))
for i in range(1001):
s = i * K
if A <= s and s <= B:
print("OK")
break
if 1000 < s:
print("NG")
break
| false | 16.666667 | [
"-import sys",
"-",
"-input = sys.stdin.readline"
] | false | 0.035196 | 0.034564 | 1.018277 | [
"s408544218",
"s600643674"
] |
u669770658 | p04045 | python | s535211246 | s436817592 | 434 | 302 | 3,060 | 3,188 | Accepted | Accepted | 30.41 | def abc042_c():
price, len_hate_set = list(map(int, input().split()))
hate_set = set([int(i) for i in input().split()])
while True:
if all([int(x) in set(range(0, 10)) - hate_set for x in [int(str(price)[i]) for i in range(len(str(price)))]]) and price >= price:
return price
... | def abc042_c():
price, len_hate_set = list(map(int, input().split()))
hate_set = set([int(i) for i in input().split()])
usable_set = set(range(0, 10)) - hate_set
while True:
if all([int(x) in usable_set for x in [int(str(price)[i]) for i in range(len(str(price)))]]) and price >= price... | 14 | 15 | 411 | 443 | def abc042_c():
price, len_hate_set = list(map(int, input().split()))
hate_set = set([int(i) for i in input().split()])
while True:
if (
all(
[
int(x) in set(range(0, 10)) - hate_set
for x in [int(str(price)[i]) for i in range(len(s... | def abc042_c():
price, len_hate_set = list(map(int, input().split()))
hate_set = set([int(i) for i in input().split()])
usable_set = set(range(0, 10)) - hate_set
while True:
if (
all(
[
int(x) in usable_set
for x in [int(str(pri... | false | 6.666667 | [
"+ usable_set = set(range(0, 10)) - hate_set",
"- int(x) in set(range(0, 10)) - hate_set",
"+ int(x) in usable_set"
] | false | 0.052609 | 0.047826 | 1.100006 | [
"s535211246",
"s436817592"
] |
u778204640 | p03177 | python | s156597990 | s943805615 | 1,486 | 577 | 12,308 | 10,672 | Accepted | Accepted | 61.17 | from numpy import*
M=10**9+7
m=lambda:list(map(int,input().split()))
n,k=m()
b=eye(n,n,0,'O')
a=matrix([m()for i in b],'O')
while k:b,a=[b,b*a][k&1],a*a%M;k/=2
print(sum(b)%M) | from numpy import*
M=10**9+7
m=lambda*z:list(map(int,input().split()))
n,k=m()
b=[1]*n
a=matrix(list(map(m,b)),'O')
while k:b=[b,b*a][k&1];a=a*a%M;k/=2
print(sum(b)%M) | 8 | 8 | 179 | 165 | from numpy import *
M = 10**9 + 7
m = lambda: list(map(int, input().split()))
n, k = m()
b = eye(n, n, 0, "O")
a = matrix([m() for i in b], "O")
while k:
b, a = [b, b * a][k & 1], a * a % M
k /= 2
print(sum(b) % M)
| from numpy import *
M = 10**9 + 7
m = lambda *z: list(map(int, input().split()))
n, k = m()
b = [1] * n
a = matrix(list(map(m, b)), "O")
while k:
b = [b, b * a][k & 1]
a = a * a % M
k /= 2
print(sum(b) % M)
| false | 0 | [
"-m = lambda: list(map(int, input().split()))",
"+m = lambda *z: list(map(int, input().split()))",
"-b = eye(n, n, 0, \"O\")",
"-a = matrix([m() for i in b], \"O\")",
"+b = [1] * n",
"+a = matrix(list(map(m, b)), \"O\")",
"- b, a = [b, b * a][k & 1], a * a % M",
"+ b = [b, b * a][k & 1]",
"+ ... | false | 0.213359 | 0.194614 | 1.096322 | [
"s156597990",
"s943805615"
] |
u763383823 | p02701 | python | s417085528 | s966424532 | 294 | 68 | 35,592 | 38,720 | Accepted | Accepted | 76.87 | N = int(eval(input()))
S = list()
for i in range(N):
x = eval(input())
S.append(x)
A = set(S)
print((len(A))) | N, *S = open(0).read().split()
print((len(set(S)))) | 8 | 2 | 109 | 50 | N = int(eval(input()))
S = list()
for i in range(N):
x = eval(input())
S.append(x)
A = set(S)
print((len(A)))
| N, *S = open(0).read().split()
print((len(set(S))))
| false | 75 | [
"-N = int(eval(input()))",
"-S = list()",
"-for i in range(N):",
"- x = eval(input())",
"- S.append(x)",
"-A = set(S)",
"-print((len(A)))",
"+N, *S = open(0).read().split()",
"+print((len(set(S))))"
] | false | 0.045307 | 0.041097 | 1.102442 | [
"s417085528",
"s966424532"
] |
u419877586 | p03038 | python | s420298285 | s269855487 | 796 | 600 | 87,320 | 39,372 | Accepted | Accepted | 24.62 | from collections import defaultdict
N, M=list(map(int, input().split()))
A=list(map(int, input().split()))
d=defaultdict(int)
for a in A:
d[a]+=1
for i in range(M):
B, C=list(map(int, input().split()))
d[C]+=B
index_list=sorted(d)
ans=0
ans_size=0
for i in range(len(index_list)-1, -1, -1):
card=ind... | import heapq
N, M=list(map(int, input().split()))
A=list(map(int, input().split()))
heapq.heapify(A)
BC=[list(map(int, input().split())) for _ in range(M)]
BC.sort(key=lambda x:(x[1], x[0]), reverse=True)
for b, c in BC:
if len(A) and A[0]>=c:
break
for i in range(b):
if len(A) and... | 21 | 18 | 451 | 415 | from collections import defaultdict
N, M = list(map(int, input().split()))
A = list(map(int, input().split()))
d = defaultdict(int)
for a in A:
d[a] += 1
for i in range(M):
B, C = list(map(int, input().split()))
d[C] += B
index_list = sorted(d)
ans = 0
ans_size = 0
for i in range(len(index_list) - 1, -1, -... | import heapq
N, M = list(map(int, input().split()))
A = list(map(int, input().split()))
heapq.heapify(A)
BC = [list(map(int, input().split())) for _ in range(M)]
BC.sort(key=lambda x: (x[1], x[0]), reverse=True)
for b, c in BC:
if len(A) and A[0] >= c:
break
for i in range(b):
if len(A) and A[0... | false | 14.285714 | [
"-from collections import defaultdict",
"+import heapq",
"-d = defaultdict(int)",
"-for a in A:",
"- d[a] += 1",
"-for i in range(M):",
"- B, C = list(map(int, input().split()))",
"- d[C] += B",
"-index_list = sorted(d)",
"-ans = 0",
"-ans_size = 0",
"-for i in range(len(index_list) -... | false | 0.07791 | 0.036888 | 2.112082 | [
"s420298285",
"s269855487"
] |
u353895424 | p03423 | python | s881591468 | s086545286 | 175 | 17 | 38,256 | 2,940 | Accepted | Accepted | 90.29 | print((int(eval(input()))//3)) | n = int(eval(input()))
print((n//3)) | 1 | 2 | 22 | 29 | print((int(eval(input())) // 3))
| n = int(eval(input()))
print((n // 3))
| false | 50 | [
"-print((int(eval(input())) // 3))",
"+n = int(eval(input()))",
"+print((n // 3))"
] | false | 0.083087 | 0.047134 | 1.762767 | [
"s881591468",
"s086545286"
] |
u759412327 | p03145 | python | s657740601 | s545739015 | 20 | 17 | 2,940 | 2,940 | Accepted | Accepted | 15 | AB,BC,CA = list(map(int,input().split()))
print((AB*BC//2)) | a,b,c=list(map(int,input().split()))
print((a*b//2)) | 2 | 2 | 58 | 45 | AB, BC, CA = list(map(int, input().split()))
print((AB * BC // 2))
| a, b, c = list(map(int, input().split()))
print((a * b // 2))
| false | 0 | [
"-AB, BC, CA = list(map(int, input().split()))",
"-print((AB * BC // 2))",
"+a, b, c = list(map(int, input().split()))",
"+print((a * b // 2))"
] | false | 0.047319 | 0.047106 | 1.004517 | [
"s657740601",
"s545739015"
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.