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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
u223663729 | p02736 | python | s830400854 | s067979056 | 538 | 423 | 13,632 | 20,460 | Accepted | Accepted | 21.38 | N = int(eval(input()))
A = [int(a)-1 for a in eval(input())]
r = 1 if 1 in A else 2
def parity_of_nCk(n, k):
return (n&k)==k
ans = 0
for i, a in enumerate(A):
if a & r:
if parity_of_nCk(N-1,i):
ans ^= 1
print((ans*r)) | N=int(eval(input()))
A=[int(a)-1 for a in eval(input())]
r=1 if 1 in A else 2
print((sum([1 if A[i]&r and (N-1&i)==i else 0 for i in range(N)])%2*r)) | 15 | 4 | 249 | 138 | N = int(eval(input()))
A = [int(a) - 1 for a in eval(input())]
r = 1 if 1 in A else 2
def parity_of_nCk(n, k):
return (n & k) == k
ans = 0
for i, a in enumerate(A):
if a & r:
if parity_of_nCk(N - 1, i):
ans ^= 1
print((ans * r))
| N = int(eval(input()))
A = [int(a) - 1 for a in eval(input())]
r = 1 if 1 in A else 2
print((sum([1 if A[i] & r and (N - 1 & i) == i else 0 for i in range(N)]) % 2 * r))
| false | 73.333333 | [
"-",
"-",
"-def parity_of_nCk(n, k):",
"- return (n & k) == k",
"-",
"-",
"-ans = 0",
"-for i, a in enumerate(A):",
"- if a & r:",
"- if parity_of_nCk(N - 1, i):",
"- ans ^= 1",
"-print((ans * r))",
"+print((sum([1 if A[i] & r and (N - 1 & i) == i else 0 for i in rang... | false | 0.044164 | 0.045612 | 0.968245 | [
"s830400854",
"s067979056"
] |
u518378780 | p03088 | python | s759242843 | s776229921 | 54 | 17 | 3,188 | 3,188 | Accepted | Accepted | 68.52 | a = ['A', 'G', 'C', 'T']
l = ["GACA","GACC","GACT","AGGC","AGCA","AGCG","AGCC","AGCT","AGTC","ACGA","ACGG","ACGC","ACGT","ATGC"]
dict1_y = {}
dict1_n = {}
dict2_y = {}
dict2_n = {}
t = 3
p = 10**9+7
n = int(eval(input()))
for i in a:
for j in a:
for k in a:
s = i + j + k
... | n = int(eval(input()))
dict = {
3 : 61,
4 : 230 ,
5 : 865 ,
6 : 3247 ,
7 : 12185 ,
8 : 45719 ,
9 : 171531 ,
10 : 643550 ,
11 : 2414454 ,
12 : 9058467 ,
13 : 33985227 ,
14 : 127504505 ,
15 : 478366600 ,
16 : 794717734 ,
17 : 733354121 ,
18 : 261943303 ,
19 : 776803305 ,
20 : 580025381 ,
21 : 51688048... | 64 | 102 | 1,743 | 1,750 | a = ["A", "G", "C", "T"]
l = [
"GACA",
"GACC",
"GACT",
"AGGC",
"AGCA",
"AGCG",
"AGCC",
"AGCT",
"AGTC",
"ACGA",
"ACGG",
"ACGC",
"ACGT",
"ATGC",
]
dict1_y = {}
dict1_n = {}
dict2_y = {}
dict2_n = {}
t = 3
p = 10**9 + 7
n = int(eval(input()))
for i in a:
for j in... | n = int(eval(input()))
dict = {
3: 61,
4: 230,
5: 865,
6: 3247,
7: 12185,
8: 45719,
9: 171531,
10: 643550,
11: 2414454,
12: 9058467,
13: 33985227,
14: 127504505,
15: 478366600,
16: 794717734,
17: 733354121,
18: 261943303,
19: 776803305,
20: 5800253... | false | 37.254902 | [
"-a = [\"A\", \"G\", \"C\", \"T\"]",
"-l = [",
"- \"GACA\",",
"- \"GACC\",",
"- \"GACT\",",
"- \"AGGC\",",
"- \"AGCA\",",
"- \"AGCG\",",
"- \"AGCC\",",
"- \"AGCT\",",
"- \"AGTC\",",
"- \"ACGA\",",
"- \"ACGG\",",
"- \"ACGC\",",
"- \"ACGT\",",
"- ... | false | 0.047814 | 0.075221 | 0.635643 | [
"s759242843",
"s776229921"
] |
u393224521 | p02583 | python | s892005895 | s406171060 | 105 | 82 | 9,196 | 73,076 | Accepted | Accepted | 21.9 | import sys
n = int(sys.stdin.readline().rstrip("\n"))
l = [int(s) for s in sys.stdin.readline().rstrip("\n").split()]
l.sort()
ans = 0
for a in range(n):
for b in range(a+1,n):
for c in range(b+1,n):
if l[a] != l[b] and l[b] != l[c] and l[c] != l[a]:
if l[a]+l[b] > l[c]:... | import sys
n = int(sys.stdin.readline().rstrip("\n"))
l = [int(s) for s in sys.stdin.readline().rstrip("\n").split()]
l.sort()
ans = 0
for a in range(n):
for b in range(a+1,n):
for c in range(b+1,n):
if l[a] != l[b] and l[b] != l[c] and l[a] != l[c]:
if l[a] + l[b] > l[c... | 12 | 12 | 362 | 364 | import sys
n = int(sys.stdin.readline().rstrip("\n"))
l = [int(s) for s in sys.stdin.readline().rstrip("\n").split()]
l.sort()
ans = 0
for a in range(n):
for b in range(a + 1, n):
for c in range(b + 1, n):
if l[a] != l[b] and l[b] != l[c] and l[c] != l[a]:
if l[a] + l[b] > l[c]:... | import sys
n = int(sys.stdin.readline().rstrip("\n"))
l = [int(s) for s in sys.stdin.readline().rstrip("\n").split()]
l.sort()
ans = 0
for a in range(n):
for b in range(a + 1, n):
for c in range(b + 1, n):
if l[a] != l[b] and l[b] != l[c] and l[a] != l[c]:
if l[a] + l[b] > l[c]:... | false | 0 | [
"- if l[a] != l[b] and l[b] != l[c] and l[c] != l[a]:",
"+ if l[a] != l[b] and l[b] != l[c] and l[a] != l[c]:"
] | false | 0.036649 | 0.054549 | 0.671854 | [
"s892005895",
"s406171060"
] |
u072053884 | p02268 | python | s597131514 | s496070384 | 340 | 290 | 19,100 | 18,968 | Accepted | Accepted | 14.71 | def binarySearch(A, key, n):
left = 0
right = n
while left < right:
mid = (left + right) // 2
if S[mid] == i:
return True
elif i < S[mid]:
right = mid
else:
left = mid + 1
return False
n = int(eval(input()))
S = tuple(map... | def binarySearch(A, key, n):
left = 0
right = n
while left < right:
mid = (left + right) // 2
if A[mid] == key:
return True
elif key < A[mid]:
right = mid
else:
left = mid + 1
return False
n = int(eval(input()))
S = tuple... | 26 | 26 | 485 | 489 | def binarySearch(A, key, n):
left = 0
right = n
while left < right:
mid = (left + right) // 2
if S[mid] == i:
return True
elif i < S[mid]:
right = mid
else:
left = mid + 1
return False
n = int(eval(input()))
S = tuple(map(int, input()... | def binarySearch(A, key, n):
left = 0
right = n
while left < right:
mid = (left + right) // 2
if A[mid] == key:
return True
elif key < A[mid]:
right = mid
else:
left = mid + 1
return False
n = int(eval(input()))
S = tuple(map(int, inp... | false | 0 | [
"- if S[mid] == i:",
"+ if A[mid] == key:",
"- elif i < S[mid]:",
"+ elif key < A[mid]:"
] | false | 0.035824 | 0.03648 | 0.982019 | [
"s597131514",
"s496070384"
] |
u049354454 | p03645 | python | s584508610 | s193169199 | 636 | 349 | 26,592 | 26,600 | Accepted | Accepted | 45.13 | a=eval(input())
b=a.split(" ")
N=int(b[0])
M=int(b[1])
in2=[]
out2=[]
for i in range(M):
c=eval(input())
d=c.split(" ")
in1=int(d[0])
out=int(d[1])
if in1==1:
in2.append(str(out))
elif out==N:
out2.append(str(in1))
in2_set=set(in2)
out2_set=set(out2)
ma... | import sys
input = sys.stdin.readline
a=eval(input())
b=a.split(" ")
N=int(b[0])
M=int(b[1])
in2=[]
out2=[]
for i in range(M):
c=eval(input())
d=c.split(" ")
in1=int(d[0])
out=int(d[1])
if in1==1:
in2.append(str(out))
elif out==N:
out2.append(str(in1))
... | 24 | 28 | 446 | 491 | a = eval(input())
b = a.split(" ")
N = int(b[0])
M = int(b[1])
in2 = []
out2 = []
for i in range(M):
c = eval(input())
d = c.split(" ")
in1 = int(d[0])
out = int(d[1])
if in1 == 1:
in2.append(str(out))
elif out == N:
out2.append(str(in1))
in2_set = set(in2)
out2_set = set(out2)
m... | import sys
input = sys.stdin.readline
a = eval(input())
b = a.split(" ")
N = int(b[0])
M = int(b[1])
in2 = []
out2 = []
for i in range(M):
c = eval(input())
d = c.split(" ")
in1 = int(d[0])
out = int(d[1])
if in1 == 1:
in2.append(str(out))
elif out == N:
out2.append(str(in1))
in... | false | 14.285714 | [
"+import sys",
"+",
"+input = sys.stdin.readline"
] | false | 0.039742 | 0.044124 | 0.900688 | [
"s584508610",
"s193169199"
] |
u970308980 | p03401 | python | s183558933 | s807396513 | 258 | 238 | 14,036 | 14,048 | Accepted | Accepted | 7.75 | N = int(eval(input()))
A = list(map(int, input().split()))
D = 0
for i in range(1, N):
D += abs(A[i] - A[i-1])
D += abs(A[0] - 0)
D += abs(A[N-1] - 0)
ans = []
for i in range(N):
if i == 0:
a = abs(A[i+1] - A[i]) + abs(A[i] - 0)
b = abs(A[i+1] - 0)
elif i == N - 1:
a... | N = int(eval(input()))
A = list(map(int, input().split()))
A.insert(0, 0)
A.append(0)
D = 0
for i in range(N+1):
D += abs(A[i+1] - A[i])
for i in range(1, N+1):
dist = D - (abs(A[i-1] - A[i]) + abs(A[i] - A[i+1])) + abs(A[i-1] - A[i+1])
print(dist) | 24 | 12 | 537 | 267 | N = int(eval(input()))
A = list(map(int, input().split()))
D = 0
for i in range(1, N):
D += abs(A[i] - A[i - 1])
D += abs(A[0] - 0)
D += abs(A[N - 1] - 0)
ans = []
for i in range(N):
if i == 0:
a = abs(A[i + 1] - A[i]) + abs(A[i] - 0)
b = abs(A[i + 1] - 0)
elif i == N - 1:
a = abs(0 ... | N = int(eval(input()))
A = list(map(int, input().split()))
A.insert(0, 0)
A.append(0)
D = 0
for i in range(N + 1):
D += abs(A[i + 1] - A[i])
for i in range(1, N + 1):
dist = D - (abs(A[i - 1] - A[i]) + abs(A[i] - A[i + 1])) + abs(A[i - 1] - A[i + 1])
print(dist)
| false | 50 | [
"+A.insert(0, 0)",
"+A.append(0)",
"-for i in range(1, N):",
"- D += abs(A[i] - A[i - 1])",
"-D += abs(A[0] - 0)",
"-D += abs(A[N - 1] - 0)",
"-ans = []",
"-for i in range(N):",
"- if i == 0:",
"- a = abs(A[i + 1] - A[i]) + abs(A[i] - 0)",
"- b = abs(A[i + 1] - 0)",
"- e... | false | 0.04694 | 0.083854 | 0.559782 | [
"s183558933",
"s807396513"
] |
u695811449 | p03286 | python | s260778276 | s346885265 | 19 | 17 | 3,064 | 2,940 | Accepted | Accepted | 10.53 | x=int(input())
LIST2=[1]
LIST2X=[-2]
N=1
for i in range(1,30):
N=N+4**i
LIST2.append(N)
N=-2
for i in range(1,30):
N=N-2*4**i
LIST2X.append(N)
LIST=[0]*60
def nex(N):
if N>0:
for i in range(30):
if N<=LIST2[i]:
break
LIST[i*2]+... | N=int(eval(input()))
if N==0:
print((0))
s=""
while N:
if N%2==1:
s="1"+s
N-=1
else:
s="0"+s
N=-N//2
print(s) | 46 | 12 | 695 | 152 | x = int(input())
LIST2 = [1]
LIST2X = [-2]
N = 1
for i in range(1, 30):
N = N + 4**i
LIST2.append(N)
N = -2
for i in range(1, 30):
N = N - 2 * 4**i
LIST2X.append(N)
LIST = [0] * 60
def nex(N):
if N > 0:
for i in range(30):
if N <= LIST2[i]:
break
LIST[i ... | N = int(eval(input()))
if N == 0:
print((0))
s = ""
while N:
if N % 2 == 1:
s = "1" + s
N -= 1
else:
s = "0" + s
N = -N // 2
print(s)
| false | 73.913043 | [
"-x = int(input())",
"-LIST2 = [1]",
"-LIST2X = [-2]",
"-N = 1",
"-for i in range(1, 30):",
"- N = N + 4**i",
"- LIST2.append(N)",
"-N = -2",
"-for i in range(1, 30):",
"- N = N - 2 * 4**i",
"- LIST2X.append(N)",
"-LIST = [0] * 60",
"-",
"-",
"-def nex(N):",
"- if N > 0:... | false | 0.045236 | 0.143175 | 0.31595 | [
"s260778276",
"s346885265"
] |
u785578220 | p03160 | python | s148305259 | s876305741 | 224 | 139 | 13,924 | 14,436 | Accepted | Accepted | 37.95 | N = int(eval(input()))
a = list(map(int, input().split()))
dp = [0] + [10**10]*N
for i,h in enumerate(a):
for j in range(i+1,min(i+3,N)):
dp[j] = min(dp[j],dp[i]+abs(h-a[j]))
#print(dp)
print((dp[N-1])) | n = int(eval(input()))
dp = [0]+ [float("INF")]*(n)
h = list(map(int, input().split()))
for i in range(n):
dp[i] = min(dp[i],dp[i-2]+abs(h[i]-h[i-2]),dp[i-1]+abs(h[i]-h[i-1]))
print((dp[n-1])) | 8 | 7 | 217 | 195 | N = int(eval(input()))
a = list(map(int, input().split()))
dp = [0] + [10**10] * N
for i, h in enumerate(a):
for j in range(i + 1, min(i + 3, N)):
dp[j] = min(dp[j], dp[i] + abs(h - a[j]))
# print(dp)
print((dp[N - 1]))
| n = int(eval(input()))
dp = [0] + [float("INF")] * (n)
h = list(map(int, input().split()))
for i in range(n):
dp[i] = min(
dp[i], dp[i - 2] + abs(h[i] - h[i - 2]), dp[i - 1] + abs(h[i] - h[i - 1])
)
print((dp[n - 1]))
| false | 12.5 | [
"-N = int(eval(input()))",
"-a = list(map(int, input().split()))",
"-dp = [0] + [10**10] * N",
"-for i, h in enumerate(a):",
"- for j in range(i + 1, min(i + 3, N)):",
"- dp[j] = min(dp[j], dp[i] + abs(h - a[j]))",
"- # print(dp)",
"-print((dp[N - 1]))",
"+n = int(eval(input()))",
"+d... | false | 0.034113 | 0.03374 | 1.011052 | [
"s148305259",
"s876305741"
] |
u347640436 | p02832 | python | s522204363 | s637315102 | 121 | 98 | 26,140 | 18,204 | Accepted | Accepted | 19.01 | N = int(eval(input()))
a = [int(s) - 1 for s in input().split()]
result = 0
for i in range(N):
if a[i] != (i - result):
result += 1
if result == N:
print((-1))
else:
print(result)
| N = int(eval(input()))
t = 1
result = 0
for a in map(int, input().split()):
if a == t:
t += 1
else:
result += 1
if result == N:
print((-1))
else:
print(result)
| 11 | 14 | 193 | 199 | N = int(eval(input()))
a = [int(s) - 1 for s in input().split()]
result = 0
for i in range(N):
if a[i] != (i - result):
result += 1
if result == N:
print((-1))
else:
print(result)
| N = int(eval(input()))
t = 1
result = 0
for a in map(int, input().split()):
if a == t:
t += 1
else:
result += 1
if result == N:
print((-1))
else:
print(result)
| false | 21.428571 | [
"-a = [int(s) - 1 for s in input().split()]",
"+t = 1",
"-for i in range(N):",
"- if a[i] != (i - result):",
"+for a in map(int, input().split()):",
"+ if a == t:",
"+ t += 1",
"+ else:"
] | false | 0.048527 | 0.048648 | 0.997517 | [
"s522204363",
"s637315102"
] |
u475503988 | p03078 | python | s862523527 | s836403731 | 120 | 36 | 8,708 | 4,852 | Accepted | Accepted | 70 | X, Y, Z, K = list(map(int, input().split()))
A = list(map(int, input().split()))
A.sort(reverse=True)
B = list(map(int, input().split()))
B.sort(reverse=True)
C = list(map(int, input().split()))
C.sort(reverse=True)
ABC = []
for xi in range(X):
if xi+1 > K:
break
for yi in range(Y):
... | import heapq
X, Y, Z, K = list(map(int, input().split()))
A = list(map(int, input().split()))
A.sort(reverse=True)
B = list(map(int, input().split()))
B.sort(reverse=True)
C = list(map(int, input().split()))
C.sort(reverse=True)
q = [(-(A[0] + B[0] + C[0]), 0, 0, 0)]
s = set()
for n in range(K):
p, a, b,... | 22 | 22 | 558 | 761 | X, Y, Z, K = list(map(int, input().split()))
A = list(map(int, input().split()))
A.sort(reverse=True)
B = list(map(int, input().split()))
B.sort(reverse=True)
C = list(map(int, input().split()))
C.sort(reverse=True)
ABC = []
for xi in range(X):
if xi + 1 > K:
break
for yi in range(Y):
if (xi + 1... | import heapq
X, Y, Z, K = list(map(int, input().split()))
A = list(map(int, input().split()))
A.sort(reverse=True)
B = list(map(int, input().split()))
B.sort(reverse=True)
C = list(map(int, input().split()))
C.sort(reverse=True)
q = [(-(A[0] + B[0] + C[0]), 0, 0, 0)]
s = set()
for n in range(K):
p, a, b, c = heapq... | false | 0 | [
"+import heapq",
"+",
"-ABC = []",
"-for xi in range(X):",
"- if xi + 1 > K:",
"- break",
"- for yi in range(Y):",
"- if (xi + 1) * (yi + 1) > K:",
"- break",
"- for zi in range(Z):",
"- if (xi + 1) * (yi + 1) * (zi + 1) > K:",
"- ... | false | 0.007201 | 0.034607 | 0.208074 | [
"s862523527",
"s836403731"
] |
u494058663 | p03244 | python | s515221895 | s179242213 | 122 | 67 | 24,288 | 23,452 | Accepted | Accepted | 45.08 | import collections
n = int(eval(input()))
V = [int(i) for i in input().split()]
E,O = [],[]
E_cnt2,O_cnt2 = 0,0
for i in range(n):
if i%2:
E.append(V[i])
else:
O.append(V[i])
e = collections.Counter(E)
tmp = e.most_common()
E_mode,E_cnt = tmp[0][0],tmp[0][1]
if len(tmp)>=2:
E_c... | import collections
n = int(eval(input()))
v = [int(i) for i in input().split()]
kisu = []
gusu = []
kisu = v[::2]
gusu = v[1::2]
kisu_cnt = collections.Counter(kisu)
gusu_cnt = collections.Counter(gusu)
kisu_cnt = kisu_cnt.most_common(2)#引数にnを用意すると，出現回数の多い順にn子だけ呼び出せる
gusu_cnt = gusu_cnt.most_common(2)
... | 27 | 25 | 602 | 619 | import collections
n = int(eval(input()))
V = [int(i) for i in input().split()]
E, O = [], []
E_cnt2, O_cnt2 = 0, 0
for i in range(n):
if i % 2:
E.append(V[i])
else:
O.append(V[i])
e = collections.Counter(E)
tmp = e.most_common()
E_mode, E_cnt = tmp[0][0], tmp[0][1]
if len(tmp) >= 2:
E_cnt2... | import collections
n = int(eval(input()))
v = [int(i) for i in input().split()]
kisu = []
gusu = []
kisu = v[::2]
gusu = v[1::2]
kisu_cnt = collections.Counter(kisu)
gusu_cnt = collections.Counter(gusu)
kisu_cnt = kisu_cnt.most_common(2) # 引数にnを用意すると，出現回数の多い順にn子だけ呼び出せる
gusu_cnt = gusu_cnt.most_common(2)
kisu_most = 0... | false | 7.407407 | [
"-V = [int(i) for i in input().split()]",
"-E, O = [], []",
"-E_cnt2, O_cnt2 = 0, 0",
"-for i in range(n):",
"- if i % 2:",
"- E.append(V[i])",
"+v = [int(i) for i in input().split()]",
"+kisu = []",
"+gusu = []",
"+kisu = v[::2]",
"+gusu = v[1::2]",
"+kisu_cnt = collections.Counter(... | false | 0.084533 | 0.045846 | 1.843852 | [
"s515221895",
"s179242213"
] |
u323680411 | p03012 | python | s413649475 | s830588196 | 20 | 17 | 3,060 | 3,060 | Accepted | Accepted | 15 | n = int(eval(input()))
w = list(map(int, input().split()))
ans = 10 ** 9
for t in range(n):
cnt = 0
for i in range(n):
a = 1
if i > t:
a = -1
cnt += a * w[i]
ans = min(ans, abs(cnt))
print(ans) | n = int(eval(input()))
w = list(map(int, input().split()))
ans = 10 ** 9
now = sum(w)
for i in range(n):
now -= 2 * w[i]
ans = min(ans, abs(now))
print(ans) | 14 | 11 | 254 | 171 | n = int(eval(input()))
w = list(map(int, input().split()))
ans = 10**9
for t in range(n):
cnt = 0
for i in range(n):
a = 1
if i > t:
a = -1
cnt += a * w[i]
ans = min(ans, abs(cnt))
print(ans)
| n = int(eval(input()))
w = list(map(int, input().split()))
ans = 10**9
now = sum(w)
for i in range(n):
now -= 2 * w[i]
ans = min(ans, abs(now))
print(ans)
| false | 21.428571 | [
"-for t in range(n):",
"- cnt = 0",
"- for i in range(n):",
"- a = 1",
"- if i > t:",
"- a = -1",
"- cnt += a * w[i]",
"- ans = min(ans, abs(cnt))",
"+now = sum(w)",
"+for i in range(n):",
"+ now -= 2 * w[i]",
"+ ans = min(ans, abs(now))"
] | false | 0.052985 | 0.07093 | 0.747003 | [
"s413649475",
"s830588196"
] |
u020390084 | p03325 | python | s677096233 | s395855875 | 89 | 77 | 4,148 | 4,212 | Accepted | Accepted | 13.48 | import math
n = int(eval(input()))
a = list(map(int,input().split()))
maxlog = int(math.log2(max(a)))
answer = 0
for _ in range(maxlog):
a = [aa/2 for aa in a if aa%2==0]
answer+= len(a)
if not a:
break
print(answer) | #!/usr/bin/env python3
import sys
def solve(N: int, a: "List[int]"):
answer = 0
for i in range(N):
while a[i]%2 == 0:
answer += 1
a[i] //= 2
print(answer)
return
def main():
def iterate_tokens():
for line in sys.stdin:
fo... | 11 | 27 | 230 | 570 | import math
n = int(eval(input()))
a = list(map(int, input().split()))
maxlog = int(math.log2(max(a)))
answer = 0
for _ in range(maxlog):
a = [aa / 2 for aa in a if aa % 2 == 0]
answer += len(a)
if not a:
break
print(answer)
| #!/usr/bin/env python3
import sys
def solve(N: int, a: "List[int]"):
answer = 0
for i in range(N):
while a[i] % 2 == 0:
answer += 1
a[i] //= 2
print(answer)
return
def main():
def iterate_tokens():
for line in sys.stdin:
for word in line.split(... | false | 59.259259 | [
"-import math",
"+#!/usr/bin/env python3",
"+import sys",
"-n = int(eval(input()))",
"-a = list(map(int, input().split()))",
"-maxlog = int(math.log2(max(a)))",
"-answer = 0",
"-for _ in range(maxlog):",
"- a = [aa / 2 for aa in a if aa % 2 == 0]",
"- answer += len(a)",
"- if not a:",
... | false | 0.085366 | 0.031687 | 2.69408 | [
"s677096233",
"s395855875"
] |
u067299340 | p00009 | python | s065052510 | s276124209 | 210 | 160 | 44,580 | 19,916 | Accepted | Accepted | 23.81 | #coding: UTF-8
from bisect import bisect_right
max_number = 1000000
prime_flag_list = [True] * max_number
prime_flag_list[0] = prime_flag_list[1] = False
prime_flag_list[4::2] = [False] * len(prime_flag_list[4::2])
for i in range(3, int(max_number**0.5) + 1, 2):
prime_flag_list[i*i::i] = [False] * ... | #coding: UTF-8
from bisect import bisect_right
max_number = 1000000
prime_flag_list = [True] * max_number
prime_flag_list[0] = False
prime_flag_list[1] = False
prime_flag_list[4::2] = [False] * len(prime_flag_list[4::2])
for i in range(3, int(max_number**0.5) + 1, 2):
prime_flag_list[i*i::i] = [Fa... | 23 | 24 | 561 | 570 | # coding: UTF-8
from bisect import bisect_right
max_number = 1000000
prime_flag_list = [True] * max_number
prime_flag_list[0] = prime_flag_list[1] = False
prime_flag_list[4::2] = [False] * len(prime_flag_list[4::2])
for i in range(3, int(max_number**0.5) + 1, 2):
prime_flag_list[i * i :: i] = [False] * len(prime_f... | # coding: UTF-8
from bisect import bisect_right
max_number = 1000000
prime_flag_list = [True] * max_number
prime_flag_list[0] = False
prime_flag_list[1] = False
prime_flag_list[4::2] = [False] * len(prime_flag_list[4::2])
for i in range(3, int(max_number**0.5) + 1, 2):
prime_flag_list[i * i :: i] = [False] * len(p... | false | 4.166667 | [
"-prime_flag_list[0] = prime_flag_list[1] = False",
"+prime_flag_list[0] = False",
"+prime_flag_list[1] = False"
] | false | 0.334189 | 0.6275 | 0.532573 | [
"s065052510",
"s276124209"
] |
u729133443 | p02973 | python | s557785138 | s180237993 | 310 | 95 | 48,604 | 7,840 | Accepted | Accepted | 69.35 | from bisect import*
n,*a=list(map(int,open(0)))
b=[-1]*n
for a in a:b[bisect(b,a-1)-1]=a
print((n-b.count(-1))) | from bisect import*
n,*a=list(map(int,open(0)))
b=bisect
c=[-1]*n
for a in a:c[b(c,a-1)-1]=a
print((n-b(c,-1))) | 5 | 6 | 107 | 108 | from bisect import *
n, *a = list(map(int, open(0)))
b = [-1] * n
for a in a:
b[bisect(b, a - 1) - 1] = a
print((n - b.count(-1)))
| from bisect import *
n, *a = list(map(int, open(0)))
b = bisect
c = [-1] * n
for a in a:
c[b(c, a - 1) - 1] = a
print((n - b(c, -1)))
| false | 16.666667 | [
"-b = [-1] * n",
"+b = bisect",
"+c = [-1] * n",
"- b[bisect(b, a - 1) - 1] = a",
"-print((n - b.count(-1)))",
"+ c[b(c, a - 1) - 1] = a",
"+print((n - b(c, -1)))"
] | false | 0.077936 | 0.077328 | 1.007866 | [
"s557785138",
"s180237993"
] |
u179169725 | p02574 | python | s755148356 | s667619941 | 1,325 | 600 | 202,656 | 203,704 | Accepted | Accepted | 54.72 | import sys
sys.setrecursionlimit(1 << 25)
readline = sys.stdin.buffer.readline
read = sys.stdin.readline # 文字列読み込む時はこっち
ra = range
enu = enumerate
def exit(*argv, **kwarg):
print(*argv, **kwarg)
sys.exit()
def mina(*argv, sub=1): return list(map(lambda x: x - sub, argv))
# 受け渡されたすべての要素からsubだけ... | import sys
sys.setrecursionlimit(1 << 25)
readline = sys.stdin.buffer.readline
read = sys.stdin.readline # 文字列読み込む時はこっち
ra = range
enu = enumerate
def exit(*argv, **kwarg):
print(*argv, **kwarg)
sys.exit()
def mina(*argv, sub=1): return list(map(lambda x: x - sub, argv))
# 受け渡されたすべての要素からsubだけ... | 96 | 99 | 1,986 | 2,049 | import sys
sys.setrecursionlimit(1 << 25)
readline = sys.stdin.buffer.readline
read = sys.stdin.readline # 文字列読み込む時はこっち
ra = range
enu = enumerate
def exit(*argv, **kwarg):
print(*argv, **kwarg)
sys.exit()
def mina(*argv, sub=1):
return list(map(lambda x: x - sub, argv))
# 受け渡されたすべての要素からsubだけ引く.リストを... | import sys
sys.setrecursionlimit(1 << 25)
readline = sys.stdin.buffer.readline
read = sys.stdin.readline # 文字列読み込む時はこっち
ra = range
enu = enumerate
def exit(*argv, **kwarg):
print(*argv, **kwarg)
sys.exit()
def mina(*argv, sub=1):
return list(map(lambda x: x - sub, argv))
# 受け渡されたすべての要素からsubだけ引く.リストを... | false | 3.030303 | [
"+import random",
"+random.shuffle(A)",
"- for p, n in fast_factorization(a).items():",
"- if cnt[p] != 0:",
"- flg = 0",
"- cnt[p] += n",
"+ if flg:",
"+ for p, n in fast_factorization(a).items():",
"+ if cnt[p] != 0:",
"+ flg = 0",
... | false | 0.571077 | 0.63273 | 0.902561 | [
"s755148356",
"s667619941"
] |
u977389981 | p03043 | python | s381791962 | s443168801 | 174 | 53 | 39,280 | 9,260 | Accepted | Accepted | 69.54 | N, K = list(map(int, input().split()))
ans = 0
for i in range(1, N + 1):
tmp = 1 / N
cnt = 0
while i < K:
i *= 2
cnt += 1
tmp *= (0.5) ** cnt
ans += tmp
print(ans) | n, k = list(map(int, input().split()))
ans = 0
for i in range(1, n + 1):
cnt = 0
while i * (2 ** cnt) < k:
cnt += 1
tmp = (1 / n) * (0.5 ** cnt)
ans += tmp
print(ans) | 13 | 11 | 211 | 201 | N, K = list(map(int, input().split()))
ans = 0
for i in range(1, N + 1):
tmp = 1 / N
cnt = 0
while i < K:
i *= 2
cnt += 1
tmp *= (0.5) ** cnt
ans += tmp
print(ans)
| n, k = list(map(int, input().split()))
ans = 0
for i in range(1, n + 1):
cnt = 0
while i * (2**cnt) < k:
cnt += 1
tmp = (1 / n) * (0.5**cnt)
ans += tmp
print(ans)
| false | 15.384615 | [
"-N, K = list(map(int, input().split()))",
"+n, k = list(map(int, input().split()))",
"-for i in range(1, N + 1):",
"- tmp = 1 / N",
"+for i in range(1, n + 1):",
"- while i < K:",
"- i *= 2",
"+ while i * (2**cnt) < k:",
"- tmp *= (0.5) ** cnt",
"+ tmp = (1 / n) * (0.5**cnt)... | false | 0.134763 | 0.243609 | 0.553193 | [
"s381791962",
"s443168801"
] |
u690536347 | p02579 | python | s296718503 | s471311948 | 954 | 804 | 122,512 | 105,276 | Accepted | Accepted | 15.72 | from collections import deque
import sys
input=sys.stdin.readline
def solve():
H, W = list(map(int, input().split()))
Ch, Cw = list(map(int, input().split()))
Dh, Dw = list(map(int, input().split()))
l = [[1 if i=="#" else 0 for i in eval(input())] for _ in range(H)]
q = deque([(0, (Ch... | from collections import deque
H, W = list(map(int, input().split()))
Ch, Cw = list(map(int, input().split()))
Dh, Dw = list(map(int, input().split()))
l = [[1 if i=="#" else 0 for i in eval(input())] for _ in range(H)]
q = deque([(0, (Ch-1, Cw-1))])
INF = 10**12
costs = [[INF]*W for _ in range(H)]
costs[Ch-... | 41 | 34 | 1,233 | 1,050 | from collections import deque
import sys
input = sys.stdin.readline
def solve():
H, W = list(map(int, input().split()))
Ch, Cw = list(map(int, input().split()))
Dh, Dw = list(map(int, input().split()))
l = [[1 if i == "#" else 0 for i in eval(input())] for _ in range(H)]
q = deque([(0, (Ch - 1, C... | from collections import deque
H, W = list(map(int, input().split()))
Ch, Cw = list(map(int, input().split()))
Dh, Dw = list(map(int, input().split()))
l = [[1 if i == "#" else 0 for i in eval(input())] for _ in range(H)]
q = deque([(0, (Ch - 1, Cw - 1))])
INF = 10**12
costs = [[INF] * W for _ in range(H)]
costs[Ch - 1... | false | 17.073171 | [
"-import sys",
"-input = sys.stdin.readline",
"-",
"-",
"-def solve():",
"- H, W = list(map(int, input().split()))",
"- Ch, Cw = list(map(int, input().split()))",
"- Dh, Dw = list(map(int, input().split()))",
"- l = [[1 if i == \"#\" else 0 for i in eval(input())] for _ in range(H)]",
... | false | 0.117642 | 0.047271 | 2.488664 | [
"s296718503",
"s471311948"
] |
u065099501 | p03699 | python | s509306552 | s457451417 | 30 | 26 | 9,080 | 9,164 | Accepted | Accepted | 13.33 | n=int(eval(input()))
a = [int(eval(input())) for _ in range(n)]
ans=0
a.sort()
for i in range(n):
if sum(a)%10 == 0:
if a[i]%10 == 0:
pass
else:
a[i]=0
else:
print((sum(a)))
exit(0)
print((0)) | n=int(eval(input()))
a = [int(eval(input())) for _ in range(n)]
a.sort()
for i in range(n):
if sum(a)%10 == 0:
if a[i]%10 == 0:
continue
else:
a[i]=0
else:
print((sum(a)))
exit(0)
print((0)) | 14 | 13 | 253 | 250 | n = int(eval(input()))
a = [int(eval(input())) for _ in range(n)]
ans = 0
a.sort()
for i in range(n):
if sum(a) % 10 == 0:
if a[i] % 10 == 0:
pass
else:
a[i] = 0
else:
print((sum(a)))
exit(0)
print((0))
| n = int(eval(input()))
a = [int(eval(input())) for _ in range(n)]
a.sort()
for i in range(n):
if sum(a) % 10 == 0:
if a[i] % 10 == 0:
continue
else:
a[i] = 0
else:
print((sum(a)))
exit(0)
print((0))
| false | 7.142857 | [
"-ans = 0",
"- pass",
"+ continue"
] | false | 0.032615 | 0.032225 | 1.012106 | [
"s509306552",
"s457451417"
] |
u773265208 | p02753 | python | s930542870 | s757569326 | 201 | 17 | 38,384 | 2,940 | Accepted | Accepted | 91.54 | s = list(eval(input()))
if 'A' not in s or 'B' not in s:
print('No')
else:
print('Yes')
| s = eval(input())
if s[0] != s[1] or s[1] != s[2]:
print('Yes')
else:
print('No')
| 6 | 6 | 96 | 84 | s = list(eval(input()))
if "A" not in s or "B" not in s:
print("No")
else:
print("Yes")
| s = eval(input())
if s[0] != s[1] or s[1] != s[2]:
print("Yes")
else:
print("No")
| false | 0 | [
"-s = list(eval(input()))",
"-if \"A\" not in s or \"B\" not in s:",
"+s = eval(input())",
"+if s[0] != s[1] or s[1] != s[2]:",
"+ print(\"Yes\")",
"+else:",
"-else:",
"- print(\"Yes\")"
] | false | 0.043681 | 0.036073 | 1.210909 | [
"s930542870",
"s757569326"
] |
u350064373 | p00208 | python | s061195750 | s256567778 | 240 | 120 | 5,608 | 5,900 | Accepted | Accepted | 50 | while 4:
n=int(eval(input()))
if n==0:break
print((oct(n)[2:].translate(str.maketrans("4567","5789")))) | from sys import stdin
for i in stdin:
if i=="0\n":break
print((oct(int(i))[2:].translate(str.maketrans("4567","5789")))) | 4 | 4 | 110 | 129 | while 4:
n = int(eval(input()))
if n == 0:
break
print((oct(n)[2:].translate(str.maketrans("4567", "5789"))))
| from sys import stdin
for i in stdin:
if i == "0\n":
break
print((oct(int(i))[2:].translate(str.maketrans("4567", "5789"))))
| false | 0 | [
"-while 4:",
"- n = int(eval(input()))",
"- if n == 0:",
"+from sys import stdin",
"+",
"+for i in stdin:",
"+ if i == \"0\\n\":",
"- print((oct(n)[2:].translate(str.maketrans(\"4567\", \"5789\"))))",
"+ print((oct(int(i))[2:].translate(str.maketrans(\"4567\", \"5789\"))))"
] | false | 0.041661 | 0.095262 | 0.437334 | [
"s061195750",
"s256567778"
] |
u922449550 | p02720 | python | s471773280 | s750139843 | 96 | 49 | 7,044 | 7,156 | Accepted | Accepted | 48.96 | cands = [1, 2, 3, 4, 5, 6, 7, 8, 9]
def add_v(v):
global cands
global K
v = str(v)
v0 = int(v[-1])
if v0 == 0:
cands += [int(v+'0'), int(v+'1')]
K -=2
elif v0 == 9:
cands += [int(v+'8'), int(v+'9')]
K -= 2
else:
cands += [int(v+str(v0-1)), int(v+str(v0)), int(v+str(v0+1)... | cands = [1, 2, 3, 4, 5, 6, 7, 8, 9]
def add_v(v):
global cands
global K
v0 = v % 10
if v0 == 0:
cands += [v*10, v*10+1]
K -=2
elif v0 == 9:
cands += [v*10+8, v*10+9]
K -= 2
else:
cands += [v*10+v0-1, v*10+v0, v*10+v0+1]
K -= 3
K = int(eval(input()))
idk = K
K -= 9... | 26 | 25 | 451 | 394 | cands = [1, 2, 3, 4, 5, 6, 7, 8, 9]
def add_v(v):
global cands
global K
v = str(v)
v0 = int(v[-1])
if v0 == 0:
cands += [int(v + "0"), int(v + "1")]
K -= 2
elif v0 == 9:
cands += [int(v + "8"), int(v + "9")]
K -= 2
else:
cands += [int(v + str(v0 - 1)... | cands = [1, 2, 3, 4, 5, 6, 7, 8, 9]
def add_v(v):
global cands
global K
v0 = v % 10
if v0 == 0:
cands += [v * 10, v * 10 + 1]
K -= 2
elif v0 == 9:
cands += [v * 10 + 8, v * 10 + 9]
K -= 2
else:
cands += [v * 10 + v0 - 1, v * 10 + v0, v * 10 + v0 + 1]
... | false | 3.846154 | [
"- v = str(v)",
"- v0 = int(v[-1])",
"+ v0 = v % 10",
"- cands += [int(v + \"0\"), int(v + \"1\")]",
"+ cands += [v * 10, v * 10 + 1]",
"- cands += [int(v + \"8\"), int(v + \"9\")]",
"+ cands += [v * 10 + 8, v * 10 + 9]",
"- cands += [int(v + str(v0 - 1)), i... | false | 0.054043 | 0.038916 | 1.388719 | [
"s471773280",
"s750139843"
] |
u968166680 | p02820 | python | s140431552 | s449532912 | 123 | 61 | 94,304 | 10,508 | Accepted | Accepted | 50.41 | import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
def main():
N, K = list(map(int, readline().split()))
point = list(map(int, readline().split()))
T = readline().strip()
T = T.tr... | import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
def main():
N, K = list(map(int, readline().split()))
point = list(map(int, readline().split()))
T = readline().strip()
T = list... | 37 | 33 | 836 | 676 | import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10**9)
INF = 1 << 60
MOD = 1000000007
def main():
N, K = list(map(int, readline().split()))
point = list(map(int, readline().split()))
T = readline().strip()
T = T.translate(str.maketr... | import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10**9)
INF = 1 << 60
MOD = 1000000007
def main():
N, K = list(map(int, readline().split()))
point = list(map(int, readline().split()))
T = readline().strip()
T = list(map(int, T.transl... | false | 10.810811 | [
"- T = T.translate(str.maketrans(\"rsp\", \"012\"))",
"- T = list(map(int, T))",
"+ T = list(map(int, T.translate(str.maketrans(\"rsp\", \"012\"))))",
"+ hand = [0] * N",
"- for i in range(K):",
"- vec = T[i::K]",
"- M = len(vec)",
"- dp = [[0] * 3 for _ in range(M ... | false | 0.178897 | 0.037724 | 4.742229 | [
"s140431552",
"s449532912"
] |
u729133443 | p03130 | python | s001303554 | s112915209 | 175 | 18 | 38,768 | 2,940 | Accepted | Accepted | 89.71 | print(('YNEOS'[sum(map(int,open(0).read().split()))!=15::2])) | print(('NYOE S'[sum(map(int,open(0).read().split()))%2::2])) | 1 | 1 | 59 | 58 | print(("YNEOS"[sum(map(int, open(0).read().split())) != 15 :: 2]))
| print(("NYOE S"[sum(map(int, open(0).read().split())) % 2 :: 2]))
| false | 0 | [
"-print((\"YNEOS\"[sum(map(int, open(0).read().split())) != 15 :: 2]))",
"+print((\"NYOE S\"[sum(map(int, open(0).read().split())) % 2 :: 2]))"
] | false | 0.034573 | 0.035315 | 0.979 | [
"s001303554",
"s112915209"
] |
u891635666 | p03045 | python | s683070897 | s235932698 | 601 | 486 | 16,784 | 16,808 | Accepted | Accepted | 19.13 | class UnionFind:
def __init__(self, n):
self.n = n
self.parents = list(range(n + 1))
self.ranks = [0 for _ in range(n + 1)]
def get_root(self, x):
if self.parents[x] == x:
return x
self.parents[x] = self.get_root(self.parents[x])
return self... | import sys
input = sys.stdin.readline
ri = lambda: int(eval(input()))
rs = lambda: input().rstrip()
ril = lambda: list(map(int, input().split()))
rsl = lambda: input().rstrip().split()
ris = lambda n: [ri() for _ in range(n)]
rss = lambda n: [rs() for _ in range(n)]
rils = lambda n: [ril() for _ in range(n)... | 33 | 47 | 898 | 1,215 | class UnionFind:
def __init__(self, n):
self.n = n
self.parents = list(range(n + 1))
self.ranks = [0 for _ in range(n + 1)]
def get_root(self, x):
if self.parents[x] == x:
return x
self.parents[x] = self.get_root(self.parents[x])
return self.parents[x... | import sys
input = sys.stdin.readline
ri = lambda: int(eval(input()))
rs = lambda: input().rstrip()
ril = lambda: list(map(int, input().split()))
rsl = lambda: input().rstrip().split()
ris = lambda n: [ri() for _ in range(n)]
rss = lambda n: [rs() for _ in range(n)]
rils = lambda n: [ril() for _ in range(n)]
rsls = la... | false | 29.787234 | [
"+import sys",
"+",
"+input = sys.stdin.readline",
"+ri = lambda: int(eval(input()))",
"+rs = lambda: input().rstrip()",
"+ril = lambda: list(map(int, input().split()))",
"+rsl = lambda: input().rstrip().split()",
"+ris = lambda n: [ri() for _ in range(n)]",
"+rss = lambda n: [rs() for _ in range(n)... | false | 0.047187 | 0.053596 | 0.880409 | [
"s683070897",
"s235932698"
] |
u888092736 | p02995 | python | s314280394 | s912616195 | 36 | 29 | 5,048 | 9,092 | Accepted | Accepted | 19.44 | from fractions import gcd
A, B, C, D = list(map(int, input().split()))
LCM = C * D // gcd(C, D)
print((
B
- A
+ 1
- B // C
+ (A - 1) // C
- B // D
+ (A - 1) // D
+ B // LCM
- (A - 1) // LCM
))
| from math import gcd
def count_indivs(N):
return N - (N // C + N // D - N // L)
A, B, C, D = list(map(int, input().split()))
L = C * D // gcd(C, D)
print((count_indivs(B) - count_indivs(A - 1)))
| 16 | 10 | 238 | 204 | from fractions import gcd
A, B, C, D = list(map(int, input().split()))
LCM = C * D // gcd(C, D)
print(
(
B
- A
+ 1
- B // C
+ (A - 1) // C
- B // D
+ (A - 1) // D
+ B // LCM
- (A - 1) // LCM
)
)
| from math import gcd
def count_indivs(N):
return N - (N // C + N // D - N // L)
A, B, C, D = list(map(int, input().split()))
L = C * D // gcd(C, D)
print((count_indivs(B) - count_indivs(A - 1)))
| false | 37.5 | [
"-from fractions import gcd",
"+from math import gcd",
"+",
"+",
"+def count_indivs(N):",
"+ return N - (N // C + N // D - N // L)",
"+",
"-LCM = C * D // gcd(C, D)",
"-print(",
"- (",
"- B",
"- - A",
"- + 1",
"- - B // C",
"- + (A - 1) // C",
"... | false | 0.007904 | 0.073792 | 0.107117 | [
"s314280394",
"s912616195"
] |
u581187895 | p03945 | python | s654949993 | s055755394 | 55 | 28 | 15,860 | 3,956 | Accepted | Accepted | 49.09 | from itertools import groupby
S = eval(input())
G = groupby(S)
print((len(list(G))-1)) | from itertools import groupby
S = groupby(eval(input()))
cnt = sum([1 for k, v in S])
print((cnt-1))
| 4 | 6 | 81 | 100 | from itertools import groupby
S = eval(input())
G = groupby(S)
print((len(list(G)) - 1))
| from itertools import groupby
S = groupby(eval(input()))
cnt = sum([1 for k, v in S])
print((cnt - 1))
| false | 33.333333 | [
"-S = eval(input())",
"-G = groupby(S)",
"-print((len(list(G)) - 1))",
"+S = groupby(eval(input()))",
"+cnt = sum([1 for k, v in S])",
"+print((cnt - 1))"
] | false | 0.046735 | 0.043176 | 1.082433 | [
"s654949993",
"s055755394"
] |
u597374218 | p03377 | python | s492416803 | s192540877 | 31 | 25 | 9,148 | 9,156 | Accepted | Accepted | 19.35 | A,B,X=list(map(int,input().split()))
print(("YES" if A<=X and X<=A+B else "NO")) | A,B,X=list(map(int,input().split()))
print(("YES" if A<=X<=A+B else "NO")) | 2 | 2 | 73 | 67 | A, B, X = list(map(int, input().split()))
print(("YES" if A <= X and X <= A + B else "NO"))
| A, B, X = list(map(int, input().split()))
print(("YES" if A <= X <= A + B else "NO"))
| false | 0 | [
"-print((\"YES\" if A <= X and X <= A + B else \"NO\"))",
"+print((\"YES\" if A <= X <= A + B else \"NO\"))"
] | false | 0.074306 | 0.037343 | 1.98979 | [
"s492416803",
"s192540877"
] |
u440566786 | p02889 | python | s370296042 | s095950755 | 1,946 | 831 | 127,964 | 17,940 | Accepted | Accepted | 57.3 | import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=lambda :sys.stdin.readline().rstrip()
def resolve():
n,m,L=list(map(int,input().split()))
A=[[INF]*n for _ in range(n)]
for _ in range(m):
a,b,c=list(map(int,input().split()))
a-=1; b-=1
A[a][b... | import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=lambda :sys.stdin.readline().rstrip()
from scipy.sparse.csgraph import floyd_warshall
n,m,L=list(map(int,input().split()))
A=[[INF]*n for _ in range(n)]
for _ in range(m):
a,b,c=list(map(int,input().split()))
a-=1; b-=1
... | 26 | 23 | 816 | 618 | import sys
sys.setrecursionlimit(2147483647)
INF = float("inf")
MOD = 10**9 + 7
input = lambda: sys.stdin.readline().rstrip()
def resolve():
n, m, L = list(map(int, input().split()))
A = [[INF] * n for _ in range(n)]
for _ in range(m):
a, b, c = list(map(int, input().split()))
a -= 1
... | import sys
sys.setrecursionlimit(2147483647)
INF = float("inf")
MOD = 10**9 + 7
input = lambda: sys.stdin.readline().rstrip()
from scipy.sparse.csgraph import floyd_warshall
n, m, L = list(map(int, input().split()))
A = [[INF] * n for _ in range(n)]
for _ in range(m):
a, b, c = list(map(int, input().split()))
... | false | 11.538462 | [
"+from scipy.sparse.csgraph import floyd_warshall",
"-",
"-def resolve():",
"- n, m, L = list(map(int, input().split()))",
"- A = [[INF] * n for _ in range(n)]",
"- for _ in range(m):",
"- a, b, c = list(map(int, input().split()))",
"- a -= 1",
"- b -= 1",
"- A... | false | 0.076271 | 0.3317 | 0.229939 | [
"s370296042",
"s095950755"
] |
u371763408 | p03475 | python | s951689167 | s847437140 | 1,204 | 77 | 3,188 | 3,188 | Accepted | Accepted | 93.6 | n=int(eval(input()))
ls=[]
ans=[]
for i in range(n-1):
ls.append(list(map(int,input().split())))
def calculate(i):
time=ls[i][1]+ls[i][0]
for j in range(i+1,len(ls)):
if time<ls[j][1]:
time=ls[j][1]+ls[j][0]
else:
additional_time=ls[j][2]
while time %additional_time!=0:
... | n=int(eval(input()))
ls=[]
ans=[]
for i in range(n-1):
ls.append(list(map(int,input().split())))
def calculate(i):
time=ls[i][1]+ls[i][0]
for j in range(i+1,len(ls)):
if time<ls[j][1]:
time=ls[j][1]+ls[j][0]
elif time %ls[j][2]==0:
time+=ls[j][0]
else:
time+=ls[j][0]+l... | 23 | 22 | 463 | 448 | n = int(eval(input()))
ls = []
ans = []
for i in range(n - 1):
ls.append(list(map(int, input().split())))
def calculate(i):
time = ls[i][1] + ls[i][0]
for j in range(i + 1, len(ls)):
if time < ls[j][1]:
time = ls[j][1] + ls[j][0]
else:
additional_time = ls[j][2]
... | n = int(eval(input()))
ls = []
ans = []
for i in range(n - 1):
ls.append(list(map(int, input().split())))
def calculate(i):
time = ls[i][1] + ls[i][0]
for j in range(i + 1, len(ls)):
if time < ls[j][1]:
time = ls[j][1] + ls[j][0]
elif time % ls[j][2] == 0:
time += l... | false | 4.347826 | [
"+ elif time % ls[j][2] == 0:",
"+ time += ls[j][0]",
"- additional_time = ls[j][2]",
"- while time % additional_time != 0:",
"- time += 1",
"- time += ls[j][0]",
"+ time += ls[j][0] + ls[j][2] - time % ls[j][2]"
] | false | 0.040451 | 0.035852 | 1.128287 | [
"s951689167",
"s847437140"
] |
u780475861 | p02803 | python | s977262527 | s964709830 | 327 | 184 | 3,064 | 3,316 | Accepted | Accepted | 43.73 | import sys
from heapq import heappop, heappush
readline = sys.stdin.readline
H, W = list(map(int, readline().split()))
grid = '#' * (W + 2) + ''.join('#' + readline().strip() +
'#' for _ in range(H)) + '#' * (W + 2)
INF = 400
def shortest(grid, start, cost=0):
dist = [... | import sys
from collections import deque
readline = sys.stdin.readline
H, W = list(map(int, readline().split()))
grid = '#' * (W + 2) + ''.join('#' + readline().strip() +
'#' for _ in range(H)) + '#' * (W + 2)
INF = 400
def shortest(grid, start, cost=0):
dist = [INF] *... | 39 | 39 | 940 | 939 | import sys
from heapq import heappop, heappush
readline = sys.stdin.readline
H, W = list(map(int, readline().split()))
grid = (
"#" * (W + 2)
+ "".join("#" + readline().strip() + "#" for _ in range(H))
+ "#" * (W + 2)
)
INF = 400
def shortest(grid, start, cost=0):
dist = [INF] * (H + 2) * (W + 2)
... | import sys
from collections import deque
readline = sys.stdin.readline
H, W = list(map(int, readline().split()))
grid = (
"#" * (W + 2)
+ "".join("#" + readline().strip() + "#" for _ in range(H))
+ "#" * (W + 2)
)
INF = 400
def shortest(grid, start, cost=0):
dist = [INF] * (H + 2) * (W + 2)
move ... | false | 0 | [
"-from heapq import heappop, heappush",
"+from collections import deque",
"- st = [start]",
"+ st = deque([start])",
"- sx = heappop(st)",
"+ sx = st.popleft()",
"- heappush(st, x)",
"+ st.append(x)"
] | false | 0.064731 | 0.042654 | 1.517609 | [
"s977262527",
"s964709830"
] |
u312025627 | p03175 | python | s606117185 | s505725653 | 935 | 320 | 123,672 | 101,424 | Accepted | Accepted | 65.78 | MOD = 10**9 + 7
class modint():
def __init__(self, value):
self.value = value % MOD
def __int__(self):
return int(self.value)
def __float__(self):
return float(self.value)
def __str__(self):
return str(self.value)
def __repr__(self):
ret... | MOD = 10**9 + 7
def main():
N = int(eval(input()))
G = [[] for _ in range(N)]
for _ in range(N-1):
a, b = (int(i) for i in input().split())
G[a-1].append(b-1)
G[b-1].append(a-1)
dp_w = [0]*N
dp_b = [0]*N
def dfs(s):
seen = [False]*N
par... | 130 | 53 | 4,177 | 1,286 | MOD = 10**9 + 7
class modint:
def __init__(self, value):
self.value = value % MOD
def __int__(self):
return int(self.value)
def __float__(self):
return float(self.value)
def __str__(self):
return str(self.value)
def __repr__(self):
return str(self.value)... | MOD = 10**9 + 7
def main():
N = int(eval(input()))
G = [[] for _ in range(N)]
for _ in range(N - 1):
a, b = (int(i) for i in input().split())
G[a - 1].append(b - 1)
G[b - 1].append(a - 1)
dp_w = [0] * N
dp_b = [0] * N
def dfs(s):
seen = [False] * N
par ... | false | 59.230769 | [
"-class modint:",
"- def __init__(self, value):",
"- self.value = value % MOD",
"+def main():",
"+ N = int(eval(input()))",
"+ G = [[] for _ in range(N)]",
"+ for _ in range(N - 1):",
"+ a, b = (int(i) for i in input().split())",
"+ G[a - 1].append(b - 1)",
"+ ... | false | 0.037881 | 0.036355 | 1.041977 | [
"s606117185",
"s505725653"
] |
u540761833 | p02900 | python | s377038638 | s212699565 | 117 | 92 | 3,316 | 3,064 | Accepted | Accepted | 21.37 | A,B = list(map(int,input().split()))
def gcd(a,b):
if b == 0:
return a
else:
return gcd(b,a%b)
def make_divisors(n):
divisors = []
for i in range(1, int(n**0.5)+1):
if n % i == 0:
divisors.append(i)
if i != n // i:
divisors.append(n//i)
retu... | A,B = list(map(int,input().split()))
def gcd(a,b):
if b == 0:
return a
else:
return gcd(b,a%b)
def prime_factorize(n):
a = []
while n % 2 == 0:
a.append(2)
n //= 2
f = 3
while f * f <= n:
if n % f == 0:
a.append(f)
n //= f
els... | 25 | 25 | 605 | 454 | A, B = list(map(int, input().split()))
def gcd(a, b):
if b == 0:
return a
else:
return gcd(b, a % b)
def make_divisors(n):
divisors = []
for i in range(1, int(n**0.5) + 1):
if n % i == 0:
divisors.append(i)
if i != n // i:
divisors.appe... | A, B = list(map(int, input().split()))
def gcd(a, b):
if b == 0:
return a
else:
return gcd(b, a % b)
def prime_factorize(n):
a = []
while n % 2 == 0:
a.append(2)
n //= 2
f = 3
while f * f <= n:
if n % f == 0:
a.append(f)
n //= f... | false | 0 | [
"-def make_divisors(n):",
"- divisors = []",
"- for i in range(1, int(n**0.5) + 1):",
"- if n % i == 0:",
"- divisors.append(i)",
"- if i != n // i:",
"- divisors.append(n // i)",
"- return divisors",
"+def prime_factorize(n):",
"+ a = []",
... | false | 0.043625 | 0.043807 | 0.995855 | [
"s377038638",
"s212699565"
] |
u352394527 | p00179 | python | s805703709 | s682218195 | 710 | 610 | 7,908 | 7,816 | Accepted | Accepted | 14.08 | from collections import deque
def new_color(s, i, rgb):
for color in rgb:
if color != s[i] and color != s[i + 1]:
break
return s[:i] + color * 2 + s[i + 2:]
def solve(s):
length = len(s)
monos = ["r" * length, "g" * length, "b" * length]
if s in monos:
print((0))
return
dic... | from collections import deque
def new_color(s, i, color):
return s[:i] + color * 2 + s[i + 2:]
def solve(s):
length = len(s)
monos = ["r" * length, "g" * length, "b" * length]
if s in monos:
print((0))
return
rgb = "rgb"
another = {("r", "g"):"b", ("g", "r"):"b",
("r", "... | 51 | 51 | 921 | 999 | from collections import deque
def new_color(s, i, rgb):
for color in rgb:
if color != s[i] and color != s[i + 1]:
break
return s[:i] + color * 2 + s[i + 2 :]
def solve(s):
length = len(s)
monos = ["r" * length, "g" * length, "b" * length]
if s in monos:
print((0))
... | from collections import deque
def new_color(s, i, color):
return s[:i] + color * 2 + s[i + 2 :]
def solve(s):
length = len(s)
monos = ["r" * length, "g" * length, "b" * length]
if s in monos:
print((0))
return
rgb = "rgb"
another = {
("r", "g"): "b",
("g", "r"... | false | 0 | [
"-def new_color(s, i, rgb):",
"- for color in rgb:",
"- if color != s[i] and color != s[i + 1]:",
"- break",
"+def new_color(s, i, color):",
"+ rgb = \"rgb\"",
"+ another = {",
"+ (\"r\", \"g\"): \"b\",",
"+ (\"g\", \"r\"): \"b\",",
"+ (\"r\", \"b\")... | false | 0.04991 | 0.095581 | 0.522169 | [
"s805703709",
"s682218195"
] |
u606033239 | p03456 | python | s507781684 | s094425109 | 73 | 18 | 2,940 | 2,940 | Accepted | Accepted | 75.34 | a,b = input().split()
ab = a+b
for i in range(int(a+b)):
if int(a+b) == i**2:
print("Yes")
exit()
print("No") | from math import sqrt
a,b = input().split()
ab = int(a+b)
print((["No","Yes"][int(sqrt(ab))**2 == ab])) | 7 | 4 | 135 | 106 | a, b = input().split()
ab = a + b
for i in range(int(a + b)):
if int(a + b) == i**2:
print("Yes")
exit()
print("No")
| from math import sqrt
a, b = input().split()
ab = int(a + b)
print((["No", "Yes"][int(sqrt(ab)) ** 2 == ab]))
| false | 42.857143 | [
"+from math import sqrt",
"+",
"-ab = a + b",
"-for i in range(int(a + b)):",
"- if int(a + b) == i**2:",
"- print(\"Yes\")",
"- exit()",
"-print(\"No\")",
"+ab = int(a + b)",
"+print(([\"No\", \"Yes\"][int(sqrt(ab)) ** 2 == ab]))"
] | false | 0.108413 | 0.076093 | 1.424753 | [
"s507781684",
"s094425109"
] |
u145231176 | p03816 | python | s013179665 | s588082930 | 248 | 154 | 56,560 | 104,060 | Accepted | Accepted | 37.9 | def getN():
return int(eval(input()))
def getNM():
return list(map(int, input().split()))
def getList():
return list(map(int, input().split()))
def getArray(intn):
return [int(eval(input())) for i in range(intn)]
from collections import defaultdict, deque, Counter
from sys import exit
import... | def getN():
return int(eval(input()))
def getNM():
return list(map(int, input().split()))
def getList():
return list(map(int, input().split()))
def getArray(intn):
return [int(eval(input())) for i in range(intn)]
def input():
return sys.stdin.readline().rstrip()
def rand_N(ran1, ran2):
... | 32 | 70 | 690 | 1,555 | def getN():
return int(eval(input()))
def getNM():
return list(map(int, input().split()))
def getList():
return list(map(int, input().split()))
def getArray(intn):
return [int(eval(input())) for i in range(intn)]
from collections import defaultdict, deque, Counter
from sys import exit
import hea... | def getN():
return int(eval(input()))
def getNM():
return list(map(int, input().split()))
def getList():
return list(map(int, input().split()))
def getArray(intn):
return [int(eval(input())) for i in range(intn)]
def input():
return sys.stdin.readline().rstrip()
def rand_N(ran1, ran2):
... | false | 54.285714 | [
"+def input():",
"+ return sys.stdin.readline().rstrip()",
"+",
"+",
"+def rand_N(ran1, ran2):",
"+ return random.randint(ran1, ran2)",
"+",
"+",
"+def rand_List(ran1, ran2, rantime):",
"+ return [random.randint(ran1, ran2) for i in range(rantime)]",
"+",
"+",
"+def rand_ints_nodup(... | false | 0.059217 | 0.047782 | 1.239318 | [
"s013179665",
"s588082930"
] |
u842401785 | p02899 | python | s693742725 | s558592022 | 806 | 513 | 23,368 | 23,384 | Accepted | Accepted | 36.35 | import numpy as np
n = int(input())
a = list(map(int, input().split()))
a = np.array(a)
b = np.argsort(a)
for x in b:
print(x+1, end=" ")
print()
| import numpy as np
n = int(eval(input()))
a = list(map(int, input().split()))
b = np.argsort(a)
print((*(b+1)))
| 10 | 6 | 161 | 110 | import numpy as np
n = int(input())
a = list(map(int, input().split()))
a = np.array(a)
b = np.argsort(a)
for x in b:
print(x + 1, end=" ")
print()
| import numpy as np
n = int(eval(input()))
a = list(map(int, input().split()))
b = np.argsort(a)
print((*(b + 1)))
| false | 40 | [
"-n = int(input())",
"+n = int(eval(input()))",
"-a = np.array(a)",
"-for x in b:",
"- print(x + 1, end=\" \")",
"-print()",
"+print((*(b + 1)))"
] | false | 0.389961 | 0.688474 | 0.566413 | [
"s693742725",
"s558592022"
] |
u761320129 | p03829 | python | s733099448 | s226387470 | 92 | 76 | 12,632 | 14,252 | Accepted | Accepted | 17.39 | N,A,B = list(map(int, input().split()))
TOWNS = list(map(int, input().split()))
dists = [TOWNS[i+1] - TOWNS[i] for i in range(N-1)]
sum = 0
for dist in dists:
sum += min(dist*A, B)
print(sum) | N,A,B = list(map(int,input().split()))
X = list(map(int,input().split()))
ans = 0
now = X[0]
for x in X[1:]:
d = x - now
if d*A < B:
ans += d*A
else:
ans += B
now = x
print(ans) | 7 | 13 | 194 | 216 | N, A, B = list(map(int, input().split()))
TOWNS = list(map(int, input().split()))
dists = [TOWNS[i + 1] - TOWNS[i] for i in range(N - 1)]
sum = 0
for dist in dists:
sum += min(dist * A, B)
print(sum)
| N, A, B = list(map(int, input().split()))
X = list(map(int, input().split()))
ans = 0
now = X[0]
for x in X[1:]:
d = x - now
if d * A < B:
ans += d * A
else:
ans += B
now = x
print(ans)
| false | 46.153846 | [
"-TOWNS = list(map(int, input().split()))",
"-dists = [TOWNS[i + 1] - TOWNS[i] for i in range(N - 1)]",
"-sum = 0",
"-for dist in dists:",
"- sum += min(dist * A, B)",
"-print(sum)",
"+X = list(map(int, input().split()))",
"+ans = 0",
"+now = X[0]",
"+for x in X[1:]:",
"+ d = x - now",
"... | false | 0.109256 | 0.043404 | 2.517167 | [
"s733099448",
"s226387470"
] |
u131811591 | p02378 | python | s330088455 | s461384434 | 190 | 80 | 9,488 | 9,496 | Accepted | Accepted | 57.89 | import sys
from collections import deque
class MaxFlow:
class Edge:
def __init__(self, to, cap, rev):
self.to, self.cap, self.rev = to, cap, rev
def __init__(self, node_size, inf):
self._node = node_size
self._inf = inf
self._level = [-1]*self._node
... | import sys
from collections import deque
class MaxFlow:
class Edge:
def __init__(self, to, cap, rev):
self.to, self.cap, self.rev = to, cap, rev
def __init__(self, node_size, inf):
self._node = node_size
self._inf = inf
self._level = [-1]*self._node
... | 80 | 82 | 2,777 | 2,869 | import sys
from collections import deque
class MaxFlow:
class Edge:
def __init__(self, to, cap, rev):
self.to, self.cap, self.rev = to, cap, rev
def __init__(self, node_size, inf):
self._node = node_size
self._inf = inf
self._level = [-1] * self._node
self.... | import sys
from collections import deque
class MaxFlow:
class Edge:
def __init__(self, to, cap, rev):
self.to, self.cap, self.rev = to, cap, rev
def __init__(self, node_size, inf):
self._node = node_size
self._inf = inf
self._level = [-1] * self._node
self.... | false | 2.439024 | [
"- for e in self._graph[cur_vertex][",
"- self._iter[cur_vertex] : len(self._graph[cur_vertex])",
"- ]:",
"+ while self._iter[cur_vertex] < len(self._graph[cur_vertex]):",
"+ e = self._graph[cur_vertex][self._iter[cur_vertex]]",
"+ self._iter[cur_verte... | false | 0.008076 | 0.04136 | 0.195258 | [
"s330088455",
"s461384434"
] |
u883040023 | p02711 | python | s871987556 | s232111472 | 21 | 19 | 9,092 | 8,860 | Accepted | Accepted | 9.52 | n = eval(input())
print(("YNeos"["7" not in n::2])) | print(("YNeos"["7" not in eval(input())::2]))
| 2 | 1 | 44 | 38 | n = eval(input())
print(("YNeos"["7" not in n :: 2]))
| print(("YNeos"["7" not in eval(input()) :: 2]))
| false | 50 | [
"-n = eval(input())",
"-print((\"YNeos\"[\"7\" not in n :: 2]))",
"+print((\"YNeos\"[\"7\" not in eval(input()) :: 2]))"
] | false | 0.046671 | 0.046293 | 1.008166 | [
"s871987556",
"s232111472"
] |
u201856486 | p03835 | python | s253872537 | s008964064 | 1,309 | 1,101 | 39,704 | 2,940 | Accepted | Accepted | 15.89 | k,s=list(map(int, input().split()))
r=range
ans=[1 for x in r(k+1) for y in r(k+1)if x+y<=s and s-x-y<=k]
print((sum(ans))) | k,s=list(map(int,input().split()));r=range;print((sum(1 for x in r(k+1) for y in r(k+1)if x+y<=s and s-x-y<=k))) | 4 | 1 | 118 | 104 | k, s = list(map(int, input().split()))
r = range
ans = [1 for x in r(k + 1) for y in r(k + 1) if x + y <= s and s - x - y <= k]
print((sum(ans)))
| k, s = list(map(int, input().split()))
r = range
print((sum(1 for x in r(k + 1) for y in r(k + 1) if x + y <= s and s - x - y <= k)))
| false | 75 | [
"-ans = [1 for x in r(k + 1) for y in r(k + 1) if x + y <= s and s - x - y <= k]",
"-print((sum(ans)))",
"+print((sum(1 for x in r(k + 1) for y in r(k + 1) if x + y <= s and s - x - y <= k)))"
] | false | 0.03832 | 0.048896 | 0.783694 | [
"s253872537",
"s008964064"
] |
u728473456 | p02713 | python | s469996599 | s488326146 | 1,448 | 441 | 10,652 | 10,344 | Accepted | Accepted | 69.54 | k = int(eval(input()))
import math
import fractions
ans = 0
e = 0
d = 0
for a in range(1,k+1):
for b in range(a,k+1):
#e = math.gcd(a,b)
e = fractions.gcd(a,b)
for c in range(b,k+1):
#d = math.gcd(e,c)
d = fractions.gcd(e,c)
if a != b and b!= ... | k = int(eval(input()))
import math
import fractions
ans = 0
e = 0
d = 0
for a in range(1,k+1):
for b in range(a,k+1):
e = math.gcd(a,b)
#e = fractions.gcd(a,b)
for c in range(b,k+1):
d = math.gcd(e,c)
#d = fractions.gcd(e,c)
if a != b and b!= ... | 20 | 20 | 514 | 514 | k = int(eval(input()))
import math
import fractions
ans = 0
e = 0
d = 0
for a in range(1, k + 1):
for b in range(a, k + 1):
# e = math.gcd(a,b)
e = fractions.gcd(a, b)
for c in range(b, k + 1):
# d = math.gcd(e,c)
d = fractions.gcd(e, c)
if a != b and b !... | k = int(eval(input()))
import math
import fractions
ans = 0
e = 0
d = 0
for a in range(1, k + 1):
for b in range(a, k + 1):
e = math.gcd(a, b)
# e = fractions.gcd(a,b)
for c in range(b, k + 1):
d = math.gcd(e, c)
# d = fractions.gcd(e,c)
if a != b and b !... | false | 0 | [
"- # e = math.gcd(a,b)",
"- e = fractions.gcd(a, b)",
"+ e = math.gcd(a, b)",
"+ # e = fractions.gcd(a,b)",
"- # d = math.gcd(e,c)",
"- d = fractions.gcd(e, c)",
"+ d = math.gcd(e, c)",
"+ # d = fractions.gcd(e,c)"
] | false | 0.147281 | 0.083098 | 1.772385 | [
"s469996599",
"s488326146"
] |
u936755756 | p02881 | python | s668422704 | s289799104 | 269 | 181 | 3,060 | 2,940 | Accepted | Accepted | 32.71 | n = int(eval(input()))
a = [1, n]
for i in range(1, int(n**0.5)+1):
j = n // i
if n % i == 0 and a[0] + a[1] > i + j:
a = [i, j]
print((a[0] - 1 + a[1] - 1)) | n = int(eval(input()))
#(1,1)から一番長く移動しないといけないのは(1,n)の時
ans = n - 1
for i in range(1, int(n**0.5) + 1):
if n % i == 0:
ans = min(ans, i + int(n/i) - 2)
print(ans) | 10 | 10 | 177 | 179 | n = int(eval(input()))
a = [1, n]
for i in range(1, int(n**0.5) + 1):
j = n // i
if n % i == 0 and a[0] + a[1] > i + j:
a = [i, j]
print((a[0] - 1 + a[1] - 1))
| n = int(eval(input()))
# (1,1)から一番長く移動しないといけないのは(1,n)の時
ans = n - 1
for i in range(1, int(n**0.5) + 1):
if n % i == 0:
ans = min(ans, i + int(n / i) - 2)
print(ans)
| false | 0 | [
"-a = [1, n]",
"+# (1,1)から一番長く移動しないといけないのは(1,n)の時",
"+ans = n - 1",
"- j = n // i",
"- if n % i == 0 and a[0] + a[1] > i + j:",
"- a = [i, j]",
"-print((a[0] - 1 + a[1] - 1))",
"+ if n % i == 0:",
"+ ans = min(ans, i + int(n / i) - 2)",
"+print(ans)"
] | false | 0.077754 | 0.039929 | 1.947289 | [
"s668422704",
"s289799104"
] |
u156815136 | p03380 | python | s033426817 | s786421819 | 174 | 135 | 16,520 | 14,936 | Accepted | Accepted | 22.41 | 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[i] -... | #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... | 35 | 35 | 762 | 775 | 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[i] - k[j... | # 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[... | false | 0 | [
"-from statistics import median",
"-",
"+# from statistics import median",
"-from fractions import gcd",
"-from itertools import combinations # (string,3) 3回",
"-from collections import deque",
"+# from fractions import gcd",
"+# from itertools import combinations # (string,3) 3回",
"+# from collect... | false | 0.040104 | 0.078172 | 0.513019 | [
"s033426817",
"s786421819"
] |
u934442292 | p03161 | python | s506182287 | s053525925 | 1,965 | 736 | 20,348 | 111,652 | Accepted | Accepted | 62.54 | import sys
input = sys.stdin.readline
INF = float("inf")
def main():
N, K = list(map(int, input().split()))
h = list(map(int, input().split()))
dp = [0] * N
for i in range(1, N):
min_cost = INF
for k in range(1, min(K + 1, i + 1)):
cost = dp[i - k] + abs(h[i... | import sys
import numba as nb
import numpy as np
input = sys.stdin.readline
INF = float("inf")
@nb.njit
def solve(N, K, h):
dp = [0] * N
for i in range(1, N):
min_cost = INF
for k in range(1, min(K + 1, i + 1)):
cost = dp[i - k] + abs(h[i] - h[i - k])
... | 25 | 32 | 500 | 612 | import sys
input = sys.stdin.readline
INF = float("inf")
def main():
N, K = list(map(int, input().split()))
h = list(map(int, input().split()))
dp = [0] * N
for i in range(1, N):
min_cost = INF
for k in range(1, min(K + 1, i + 1)):
cost = dp[i - k] + abs(h[i] - h[i - k])
... | import sys
import numba as nb
import numpy as np
input = sys.stdin.readline
INF = float("inf")
@nb.njit
def solve(N, K, h):
dp = [0] * N
for i in range(1, N):
min_cost = INF
for k in range(1, min(K + 1, i + 1)):
cost = dp[i - k] + abs(h[i] - h[i - k])
if cost < min_cos... | false | 21.875 | [
"+import numba as nb",
"+import numpy as np",
"-def main():",
"- N, K = list(map(int, input().split()))",
"- h = list(map(int, input().split()))",
"+@nb.njit",
"+def solve(N, K, h):",
"- ans = dp[-1]",
"+ return dp[-1]",
"+",
"+",
"+def main():",
"+ N, K = list(map(int, input(... | false | 0.081796 | 0.056094 | 1.458186 | [
"s506182287",
"s053525925"
] |
u729133443 | p02762 | python | s554606517 | s355518725 | 1,550 | 1,423 | 110,424 | 97,624 | Accepted | Accepted | 8.19 | r=lambda x:p[x]>=0and r(p[x])or x
(n,m,k),*t=[list(map(int,t.split()))for t in open(0)]
p=[-1]*-~n
f=[[]for _ in p]
for a,b in t[:m]:
x,y=r(a),r(b)
if x!=y:
if x>y:x,y=y,x
p[x]+=p[y]
p[y]=x
f[a]+=b,
f[b]+=a,
a=[~len(f[i])-p[r(i)]for i in range(n+1)]
for c,d in t[m:]:
if r(c)==r(d):
... | r=lambda x:p[x]>=0and r(p[x])or x
(n,m,k),*t=[list(map(int,t.split()))for t in open(0)]
p,f=[-1]*-~n,[-1]*-~n
for a,b in t[:m]:
x,y=r(a),r(b)
if x!=y:
if x>y:x,y=y,x
p[x]+=p[y]
p[y]=x
f[a]-=1
f[b]-=1
a=[f[i]-p[r(i)]for i in range(n+1)]
for c,d in t[m:]:
if r(c)==r(d):
a[c]-=1
... | 18 | 17 | 353 | 338 | r = lambda x: p[x] >= 0 and r(p[x]) or x
(n, m, k), *t = [list(map(int, t.split())) for t in open(0)]
p = [-1] * -~n
f = [[] for _ in p]
for a, b in t[:m]:
x, y = r(a), r(b)
if x != y:
if x > y:
x, y = y, x
p[x] += p[y]
p[y] = x
f[a] += (b,)
f[b] += (a,)
a = [~len(f[i... | r = lambda x: p[x] >= 0 and r(p[x]) or x
(n, m, k), *t = [list(map(int, t.split())) for t in open(0)]
p, f = [-1] * -~n, [-1] * -~n
for a, b in t[:m]:
x, y = r(a), r(b)
if x != y:
if x > y:
x, y = y, x
p[x] += p[y]
p[y] = x
f[a] -= 1
f[b] -= 1
a = [f[i] - p[r(i)] for ... | false | 5.555556 | [
"-p = [-1] * -~n",
"-f = [[] for _ in p]",
"+p, f = [-1] * -~n, [-1] * -~n",
"- f[a] += (b,)",
"- f[b] += (a,)",
"-a = [~len(f[i]) - p[r(i)] for i in range(n + 1)]",
"+ f[a] -= 1",
"+ f[b] -= 1",
"+a = [f[i] - p[r(i)] for i in range(n + 1)]"
] | false | 0.036548 | 0.035605 | 1.0265 | [
"s554606517",
"s355518725"
] |
u729133443 | p02578 | python | s878821937 | s320955947 | 124 | 106 | 25,140 | 92,980 | Accepted | Accepted | 14.52 | b=0
print((sum((b:=max(c:=int(a),b))-c for a in[*open(0)][1].split()))) | b=s=0
for a in[*open(0)][1].split():a=int(a);b=max(b,a);s+=b-a
print(s) | 2 | 3 | 70 | 73 | b = 0
print((sum((b := max(c := int(a), b)) - c for a in [*open(0)][1].split())))
| b = s = 0
for a in [*open(0)][1].split():
a = int(a)
b = max(b, a)
s += b - a
print(s)
| false | 33.333333 | [
"-b = 0",
"-print((sum((b := max(c := int(a), b)) - c for a in [*open(0)][1].split())))",
"+b = s = 0",
"+for a in [*open(0)][1].split():",
"+ a = int(a)",
"+ b = max(b, a)",
"+ s += b - a",
"+print(s)"
] | false | 0.095056 | 0.060813 | 1.563093 | [
"s878821937",
"s320955947"
] |
u325264482 | p03095 | python | s597947504 | s557313951 | 49 | 32 | 3,188 | 3,444 | Accepted | Accepted | 34.69 | N = int(eval(input()))
S = eval(input())
M = 10**9 + 7
cnt = [0] * 26
for i in range(N):
cnt[ord(S[i]) - ord('a')] += 1
ans = 1
for i in range(26):
ans *= (cnt[i] + 1)
ans %= M
print((ans - 1)) | from collections import defaultdict
N = int(eval(input()))
S = eval(input())
M = 10**9 + 7
count_dict = defaultdict(int)
for s in S:
count_dict[s] += 1
ans = 1
for v in list(count_dict.values()):
ans *= (v + 1)
ans %= M
print((ans - 1))
| 15 | 18 | 209 | 252 | N = int(eval(input()))
S = eval(input())
M = 10**9 + 7
cnt = [0] * 26
for i in range(N):
cnt[ord(S[i]) - ord("a")] += 1
ans = 1
for i in range(26):
ans *= cnt[i] + 1
ans %= M
print((ans - 1))
| from collections import defaultdict
N = int(eval(input()))
S = eval(input())
M = 10**9 + 7
count_dict = defaultdict(int)
for s in S:
count_dict[s] += 1
ans = 1
for v in list(count_dict.values()):
ans *= v + 1
ans %= M
print((ans - 1))
| false | 16.666667 | [
"+from collections import defaultdict",
"+",
"-cnt = [0] * 26",
"-for i in range(N):",
"- cnt[ord(S[i]) - ord(\"a\")] += 1",
"+count_dict = defaultdict(int)",
"+for s in S:",
"+ count_dict[s] += 1",
"-for i in range(26):",
"- ans *= cnt[i] + 1",
"+for v in list(count_dict.values()):",
... | false | 0.045524 | 0.040326 | 1.128891 | [
"s597947504",
"s557313951"
] |
u077291787 | p02714 | python | s381605928 | s490219458 | 861 | 779 | 9,676 | 9,912 | Accepted | Accepted | 9.52 | # D - RGB Triplets
from collections import defaultdict
def main():
_ = int(eval(input()))
S = input().rstrip()
indices = defaultdict(set)
for i, c in enumerate(S):
indices[c].add(i)
cnt = len(indices["R"]) * len(indices["G"]) * len(indices["B"])
for c1, c2, c3 in ["RGB", "GB... | # D - RGB Triplets
from collections import defaultdict
def main():
_ = int(eval(input()))
S = input().rstrip()
indices = defaultdict(set)
for i, c in enumerate(S):
indices[c].add(2 * i)
cnt = len(indices["R"]) * len(indices["G"]) * len(indices["B"])
for c1, c2, c3 in ["RGB",... | 22 | 20 | 548 | 505 | # D - RGB Triplets
from collections import defaultdict
def main():
_ = int(eval(input()))
S = input().rstrip()
indices = defaultdict(set)
for i, c in enumerate(S):
indices[c].add(i)
cnt = len(indices["R"]) * len(indices["G"]) * len(indices["B"])
for c1, c2, c3 in ["RGB", "GBR", "BRG"]:... | # D - RGB Triplets
from collections import defaultdict
def main():
_ = int(eval(input()))
S = input().rstrip()
indices = defaultdict(set)
for i, c in enumerate(S):
indices[c].add(2 * i)
cnt = len(indices["R"]) * len(indices["G"]) * len(indices["B"])
for c1, c2, c3 in ["RGB", "GBR", "BR... | false | 9.090909 | [
"- indices[c].add(i)",
"+ indices[c].add(2 * i)",
"- (i + j) % 2 == 0 and (i + j) // 2 in indices[c3]",
"- for i in indices[c1]",
"- for j in indices[c2]",
"+ (i + j) // 2 in indices[c3] for i in indices[c1] for j in indices[c2]"
] | false | 0.048922 | 0.041373 | 1.18246 | [
"s381605928",
"s490219458"
] |
u155174554 | p03048 | python | s639798432 | s596642034 | 1,998 | 19 | 3,060 | 3,060 | Accepted | Accepted | 99.05 | r, g, b, n = list(map(int, input().split()))
s_rgb = sorted([r, g, b], reverse=True)
count = 0
for i in range(int(n / s_rgb[0]) + 1)[::-1]:
for j in range(int((n - s_rgb[0] * i) / s_rgb[1]) + 1)[::-1]:
tmp = n - s_rgb[0] * i - s_rgb[1] * j
if (tmp >= 0 and tmp % s_rgb[2] == 0):
co... | R, G, B, N = [int(i) for i in input().split()]
dp = [0] * (N + 1)
dp[0] = 1
for c in (R, G, B):
for i in range(N + 1 - c):
dp[i + c] += dp[i]
print((dp[N])) | 9 | 7 | 337 | 172 | r, g, b, n = list(map(int, input().split()))
s_rgb = sorted([r, g, b], reverse=True)
count = 0
for i in range(int(n / s_rgb[0]) + 1)[::-1]:
for j in range(int((n - s_rgb[0] * i) / s_rgb[1]) + 1)[::-1]:
tmp = n - s_rgb[0] * i - s_rgb[1] * j
if tmp >= 0 and tmp % s_rgb[2] == 0:
count += 1
... | R, G, B, N = [int(i) for i in input().split()]
dp = [0] * (N + 1)
dp[0] = 1
for c in (R, G, B):
for i in range(N + 1 - c):
dp[i + c] += dp[i]
print((dp[N]))
| false | 22.222222 | [
"-r, g, b, n = list(map(int, input().split()))",
"-s_rgb = sorted([r, g, b], reverse=True)",
"-count = 0",
"-for i in range(int(n / s_rgb[0]) + 1)[::-1]:",
"- for j in range(int((n - s_rgb[0] * i) / s_rgb[1]) + 1)[::-1]:",
"- tmp = n - s_rgb[0] * i - s_rgb[1] * j",
"- if tmp >= 0 and tm... | false | 0.072565 | 0.051433 | 1.410861 | [
"s639798432",
"s596642034"
] |
u023231878 | p03382 | python | s208912944 | s849333054 | 305 | 60 | 28,540 | 14,428 | Accepted | Accepted | 80.33 | import numpy as np;eval(input());a=list(map(int,input().split(' ')));m=max(a);a.remove(m);b=[abs(2*i-m) for i in a];j=b.index(min(b));print((m,a[j])) | eval(input());a=list(map(int,input().split(' ')));m=max(a);a.remove(m);b=[abs(2*i-m) for i in a];print((m,a[b.index(min(b))])) | 1 | 1 | 141 | 118 | import numpy as np
eval(input())
a = list(map(int, input().split(" ")))
m = max(a)
a.remove(m)
b = [abs(2 * i - m) for i in a]
j = b.index(min(b))
print((m, a[j]))
| eval(input())
a = list(map(int, input().split(" ")))
m = max(a)
a.remove(m)
b = [abs(2 * i - m) for i in a]
print((m, a[b.index(min(b))]))
| false | 0 | [
"-import numpy as np",
"-",
"-j = b.index(min(b))",
"-print((m, a[j]))",
"+print((m, a[b.index(min(b))]))"
] | false | 0.174905 | 0.034505 | 5.068998 | [
"s208912944",
"s849333054"
] |
u239981649 | p03448 | python | s109432358 | s761956735 | 51 | 19 | 2,940 | 3,060 | Accepted | Accepted | 62.75 | A, B, C, X = [int(eval(input())) for _ in range(4)]
m = 0
for a in range(A + 1):
for b in range(B + 1):
for c in range(C + 1):
if (500 * a) + (100 * b) + (50 * c) == X:
m += 1
print(m)
| Li = [int(eval(input())) for _ in range(4)]
a, b, c, x = Li[0], Li[1], Li[2], Li[3]
ans = 0
for i in range(min(x//500, a)+1):
for j in range(min((x-500*i)//100, b)+1):
ans += 1 if (x-500*i-100*j)//50 <= c else 0
print(ans)
| 8 | 7 | 226 | 235 | A, B, C, X = [int(eval(input())) for _ in range(4)]
m = 0
for a in range(A + 1):
for b in range(B + 1):
for c in range(C + 1):
if (500 * a) + (100 * b) + (50 * c) == X:
m += 1
print(m)
| Li = [int(eval(input())) for _ in range(4)]
a, b, c, x = Li[0], Li[1], Li[2], Li[3]
ans = 0
for i in range(min(x // 500, a) + 1):
for j in range(min((x - 500 * i) // 100, b) + 1):
ans += 1 if (x - 500 * i - 100 * j) // 50 <= c else 0
print(ans)
| false | 12.5 | [
"-A, B, C, X = [int(eval(input())) for _ in range(4)]",
"-m = 0",
"-for a in range(A + 1):",
"- for b in range(B + 1):",
"- for c in range(C + 1):",
"- if (500 * a) + (100 * b) + (50 * c) == X:",
"- m += 1",
"-print(m)",
"+Li = [int(eval(input())) for _ in range(4... | false | 0.11752 | 0.041619 | 2.823691 | [
"s109432358",
"s761956735"
] |
u301461168 | p02264 | python | s756346637 | s504438887 | 1,360 | 450 | 11,552 | 11,872 | Accepted | Accepted | 66.91 | # coding: utf-8
class CPU():
def __init__(self, in_quantum):
self.quantum = in_quantum
self.total_time = 0
def deal(self, in_process, in_time):
sum_process_time = 0
this_process_time = 0
sum_process_time += in_time[0]
if sum_process_... | # coding: utf-8
# Here your code !
import sys
from collections import deque
class CPU():
def __init__(self, in_quantum):
self.quantum = in_quantum
self.total_time = 0
def deal(self, in_process, in_time):
this_process_time = 0
if in_time[0] > self.quantum:
... | 53 | 52 | 1,402 | 1,336 | # coding: utf-8
class CPU:
def __init__(self, in_quantum):
self.quantum = in_quantum
self.total_time = 0
def deal(self, in_process, in_time):
sum_process_time = 0
this_process_time = 0
sum_process_time += in_time[0]
if sum_process_time > self.quantum:
... | # coding: utf-8
# Here your code !
import sys
from collections import deque
class CPU:
def __init__(self, in_quantum):
self.quantum = in_quantum
self.total_time = 0
def deal(self, in_process, in_time):
this_process_time = 0
if in_time[0] > self.quantum:
remain_time... | false | 1.886792 | [
"+# Here your code !",
"+import sys",
"+from collections import deque",
"+",
"+",
"- sum_process_time = 0",
"- sum_process_time += in_time[0]",
"- if sum_process_time > self.quantum:",
"- remain_time = sum_process_time - self.quantum",
"+ if in_time[0] > self... | false | 0.082467 | 0.039623 | 2.081312 | [
"s756346637",
"s504438887"
] |
u638795007 | p03163 | python | s697946168 | s899488055 | 711 | 522 | 171,376 | 120,684 | Accepted | Accepted | 26.58 | N,W = list(map(int, input().split()))
w = [0]*N
v = [0]*N
for i in range(N):
w[i],v[i] = list(map(int,input().split()))
dp = [[int(0) for i in range(W+1)] for i in range(N+1)]
ans = int(0)
dp[0][0] = 0
for i in range(N):
for j in range(W+1):
if w[i]<=j:
dp[i+1][j] = max(dp[i+1... | N,W = list(map(int, input().split()))
w = [0]*N
v = [0]*N
for i in range(N):
w[i],v[i] = list(map(int,input().split()))
dp = [[0] * (W + 1) for _ in range(N + 1)]
ans = int(0)
dp[0][0] = 0
for i in range(N):
for j in range(W+1):
if w[i]<=j:
dp[i+1][j] = max(dp[i+1][j], dp[i][j-w... | 19 | 18 | 419 | 404 | N, W = list(map(int, input().split()))
w = [0] * N
v = [0] * N
for i in range(N):
w[i], v[i] = list(map(int, input().split()))
dp = [[int(0) for i in range(W + 1)] for i in range(N + 1)]
ans = int(0)
dp[0][0] = 0
for i in range(N):
for j in range(W + 1):
if w[i] <= j:
dp[i + 1][j] = max(dp[i... | N, W = list(map(int, input().split()))
w = [0] * N
v = [0] * N
for i in range(N):
w[i], v[i] = list(map(int, input().split()))
dp = [[0] * (W + 1) for _ in range(N + 1)]
ans = int(0)
dp[0][0] = 0
for i in range(N):
for j in range(W + 1):
if w[i] <= j:
dp[i + 1][j] = max(dp[i + 1][j], dp[i][j... | false | 5.263158 | [
"-dp = [[int(0) for i in range(W + 1)] for i in range(N + 1)]",
"+dp = [[0] * (W + 1) for _ in range(N + 1)]"
] | false | 0.086351 | 0.080896 | 1.067432 | [
"s697946168",
"s899488055"
] |
u035210736 | p03835 | python | s033686793 | s928348748 | 1,213 | 1,096 | 9,172 | 9,096 | Accepted | Accepted | 9.65 | k, s = list(map(int, input().split()))
cnt = 0
for x in range(k + 1):
for y in range(k + 1):
z = s - x - y
if 0 <= z and z <= k:
cnt += 1
print(cnt) | k, s = list(map(int, input().split()))
cnt = 0
for x in range(k + 1):
for y in range(min(k + 1, s + 1 - x)):
z = s - x - y
if 0 <= z and z <= k:
cnt += 1
print(cnt) | 8 | 8 | 165 | 181 | k, s = list(map(int, input().split()))
cnt = 0
for x in range(k + 1):
for y in range(k + 1):
z = s - x - y
if 0 <= z and z <= k:
cnt += 1
print(cnt)
| k, s = list(map(int, input().split()))
cnt = 0
for x in range(k + 1):
for y in range(min(k + 1, s + 1 - x)):
z = s - x - y
if 0 <= z and z <= k:
cnt += 1
print(cnt)
| false | 0 | [
"- for y in range(k + 1):",
"+ for y in range(min(k + 1, s + 1 - x)):"
] | false | 0.039319 | 0.03801 | 1.034436 | [
"s033686793",
"s928348748"
] |
u501451051 | p03814 | python | s204492397 | s672199772 | 44 | 29 | 9,344 | 9,088 | Accepted | Accepted | 34.09 | s = eval(input())
rs = s[::-1]
inds = 0
indrs = 0
for i in range(len(s)):
if s[i] == "A":
inds = i
break
for j in range(len(rs)):
if rs[j] == "Z":
indrs = j
break
indrs = len(s) - indrs
print((abs(indrs - inds)))
| s = eval(input())
left = s.find("A")
right = s.rfind("Z")
print((right - left + 1)) | 20 | 6 | 275 | 82 | s = eval(input())
rs = s[::-1]
inds = 0
indrs = 0
for i in range(len(s)):
if s[i] == "A":
inds = i
break
for j in range(len(rs)):
if rs[j] == "Z":
indrs = j
break
indrs = len(s) - indrs
print((abs(indrs - inds)))
| s = eval(input())
left = s.find("A")
right = s.rfind("Z")
print((right - left + 1))
| false | 70 | [
"-rs = s[::-1]",
"-inds = 0",
"-indrs = 0",
"-for i in range(len(s)):",
"- if s[i] == \"A\":",
"- inds = i",
"- break",
"-for j in range(len(rs)):",
"- if rs[j] == \"Z\":",
"- indrs = j",
"- break",
"-indrs = len(s) - indrs",
"-print((abs(indrs - inds)))",
... | false | 0.008204 | 0.041281 | 0.198727 | [
"s204492397",
"s672199772"
] |
u075012704 | p02904 | python | s513921034 | s233057422 | 419 | 386 | 33,888 | 43,544 | Accepted | Accepted | 7.88 | from collections import Counter, deque
N, K = list(map(int, input().split()))
P = list(map(int, input().split()))
ans = N - K + 1
# 変化しないものを数える
LIS = [-1] * N
LIS[-1] = 1
LIS_MIN_NOW = P[-1]
for i in reversed(list(range(N - 1))):
p = P[i]
if p < LIS_MIN_NOW:
LIS_MIN_NOW = p
LIS[i... | from collections import Counter, deque
N, K = list(map(int, input().split()))
P = list(map(int, input().split()))
ans = N - K + 1
# 変化しないものを数える
LIS = [-1] * N
LIS[-1] = 1
LIS_MIN_NOW = P[-1]
for i in reversed(list(range(N - 1))):
p = P[i]
if p < LIS_MIN_NOW:
LIS_MIN_NOW = p
LIS[i... | 66 | 56 | 1,292 | 1,126 | from collections import Counter, deque
N, K = list(map(int, input().split()))
P = list(map(int, input().split()))
ans = N - K + 1
# 変化しないものを数える
LIS = [-1] * N
LIS[-1] = 1
LIS_MIN_NOW = P[-1]
for i in reversed(list(range(N - 1))):
p = P[i]
if p < LIS_MIN_NOW:
LIS_MIN_NOW = p
LIS[i] = LIS[i + 1] ... | from collections import Counter, deque
N, K = list(map(int, input().split()))
P = list(map(int, input().split()))
ans = N - K + 1
# 変化しないものを数える
LIS = [-1] * N
LIS[-1] = 1
LIS_MIN_NOW = P[-1]
for i in reversed(list(range(N - 1))):
p = P[i]
if p < LIS_MIN_NOW:
LIS_MIN_NOW = p
LIS[i] = LIS[i + 1] ... | false | 15.151515 | [
"-# スライド最小値を計算",
"-slide_min = deque([])",
"-MIN = []",
"-for k in range(N):",
"- while slide_min and P[slide_min[-1]] >= P[k]:",
"- slide_min.pop()",
"- slide_min.append(k)",
"- if k < K - 1:",
"- continue",
"- if slide_min[0] + K <= k:",
"- slide_min.popleft()"... | false | 0.102786 | 0.040934 | 2.511002 | [
"s513921034",
"s233057422"
] |
u780475861 | p03680 | python | s658852053 | s055287665 | 184 | 61 | 7,084 | 7,084 | Accepted | Accepted | 66.85 | n = int(eval(input()))
lst = [int(eval(input())) for _ in range(n)]
i = lst[0]
for c in range(n):
if i == 2:
print((c + 1))
quit()
i = lst[i - 1]
print((-1)) | import sys
n = int(eval(input()))
lst = [int(i) for i in sys.stdin]
i = lst[0]
for c in range(n):
if i == 2:
print((c + 1))
quit()
i = lst[i - 1]
print((-1)) | 9 | 11 | 173 | 182 | n = int(eval(input()))
lst = [int(eval(input())) for _ in range(n)]
i = lst[0]
for c in range(n):
if i == 2:
print((c + 1))
quit()
i = lst[i - 1]
print((-1))
| import sys
n = int(eval(input()))
lst = [int(i) for i in sys.stdin]
i = lst[0]
for c in range(n):
if i == 2:
print((c + 1))
quit()
i = lst[i - 1]
print((-1))
| false | 18.181818 | [
"+import sys",
"+",
"-lst = [int(eval(input())) for _ in range(n)]",
"+lst = [int(i) for i in sys.stdin]"
] | false | 0.044052 | 0.044806 | 0.983165 | [
"s658852053",
"s055287665"
] |
u932868243 | p03354 | python | s577432993 | s110394275 | 640 | 419 | 13,812 | 20,608 | Accepted | Accepted | 34.53 | n,m=list(map(int,input().split()))
f=lambda x:int(x)-1
p=list(map(f,input().split()))
par=[j for j in range(n)]
def find(x):
if x==par[x]:
return x
else:
par[x]=find(par[x])
return par[x]
def union(a,b):
ra=find(a)
rb=find(b)
if ra!=rb:
par[ra]=par[rb]
for i in range(m):
... | n,m=list(map(int,input().split()))
p=list(map(int,input().split()))
par=[i for i in range(n)]
def find(x):
if par[x]==x:
return par[x]
else:
par[x]=find(par[x])
return par[x]
def union(x,y):
fx=find(x)
fy=find(y)
if fx!=fy:
par[fx]=fy
f=lambda x:int(x)-1
for mm in range... | 26 | 27 | 437 | 445 | n, m = list(map(int, input().split()))
f = lambda x: int(x) - 1
p = list(map(f, input().split()))
par = [j for j in range(n)]
def find(x):
if x == par[x]:
return x
else:
par[x] = find(par[x])
return par[x]
def union(a, b):
ra = find(a)
rb = find(b)
if ra != rb:
pa... | n, m = list(map(int, input().split()))
p = list(map(int, input().split()))
par = [i for i in range(n)]
def find(x):
if par[x] == x:
return par[x]
else:
par[x] = find(par[x])
return par[x]
def union(x, y):
fx = find(x)
fy = find(y)
if fx != fy:
par[fx] = fy
f = l... | false | 3.703704 | [
"-f = lambda x: int(x) - 1",
"-p = list(map(f, input().split()))",
"-par = [j for j in range(n)]",
"+p = list(map(int, input().split()))",
"+par = [i for i in range(n)]",
"- if x == par[x]:",
"- return x",
"+ if par[x] == x:",
"+ return par[x]",
"-def union(a, b):",
"- ra ... | false | 0.040994 | 0.044793 | 0.915202 | [
"s577432993",
"s110394275"
] |
u002459665 | p02873 | python | s512334538 | s215428434 | 462 | 407 | 31,092 | 23,336 | Accepted | Accepted | 11.9 | S = eval(input())
N = len(S) + 1
# 左に<がいくつ連続しているか
dai = [None] * N
dai[0] = 0
c = 0
for i, si in enumerate(S):
if si == '<':
c += 1
else:
c = 0
dai[i+1] = c
# 右に>がいくつ連続しているかを実装を簡単にするためにSをひっくり返して調べる
S = S[::-1]
sho = [None] * N
sho[0] = 0 #
c = 0
for i, si in enum... | S = eval(input())
N = len(S) + 1
A = [0] * N
c = 0
for i, si in enumerate(S):
if si == '<':
c += 1
else:
c = 0
A[i+1] = c
c = 0
for i in range(len(S)-1, -1, -1):
if S[i] == '>':
c += 1
else:
c = 0
A[i] = max(A[i], c)
# print(A)
print((sum... | 41 | 23 | 571 | 317 | S = eval(input())
N = len(S) + 1
# 左に<がいくつ連続しているか
dai = [None] * N
dai[0] = 0
c = 0
for i, si in enumerate(S):
if si == "<":
c += 1
else:
c = 0
dai[i + 1] = c
# 右に>がいくつ連続しているかを実装を簡単にするためにSをひっくり返して調べる
S = S[::-1]
sho = [None] * N
sho[0] = 0 #
c = 0
for i, si in enumerate(S):
if si == ">"... | S = eval(input())
N = len(S) + 1
A = [0] * N
c = 0
for i, si in enumerate(S):
if si == "<":
c += 1
else:
c = 0
A[i + 1] = c
c = 0
for i in range(len(S) - 1, -1, -1):
if S[i] == ">":
c += 1
else:
c = 0
A[i] = max(A[i], c)
# print(A)
print((sum(A)))
| false | 43.902439 | [
"-# 左に<がいくつ連続しているか",
"-dai = [None] * N",
"-dai[0] = 0",
"+A = [0] * N",
"- dai[i + 1] = c",
"-# 右に>がいくつ連続しているかを実装を簡単にするためにSをひっくり返して調べる",
"-S = S[::-1]",
"-sho = [None] * N",
"-sho[0] = 0 #",
"+ A[i + 1] = c",
"-for i, si in enumerate(S):",
"- if si == \">\":",
"+for i in range(len... | false | 0.042805 | 0.043691 | 0.979722 | [
"s512334538",
"s215428434"
] |
u652656291 | p03360 | python | s853070437 | s259281427 | 20 | 17 | 2,940 | 2,940 | Accepted | Accepted | 15 | a,b,c = list(map(int,input().split()))
k = int(eval(input()))
print((a+b+c-max(a,b,c)+max(a,b,c)*(2 ** k)))
| l = list(map(int,input().split()))
k = int(eval(input()))
L =l.sort()
print((int(l[0])+int(l[1])+int(l[2])*(2**k)))
| 3 | 4 | 96 | 111 | a, b, c = list(map(int, input().split()))
k = int(eval(input()))
print((a + b + c - max(a, b, c) + max(a, b, c) * (2**k)))
| l = list(map(int, input().split()))
k = int(eval(input()))
L = l.sort()
print((int(l[0]) + int(l[1]) + int(l[2]) * (2**k)))
| false | 25 | [
"-a, b, c = list(map(int, input().split()))",
"+l = list(map(int, input().split()))",
"-print((a + b + c - max(a, b, c) + max(a, b, c) * (2**k)))",
"+L = l.sort()",
"+print((int(l[0]) + int(l[1]) + int(l[2]) * (2**k)))"
] | false | 0.089433 | 0.0458 | 1.952666 | [
"s853070437",
"s259281427"
] |
u255821449 | p02713 | python | s974760543 | s228118435 | 1,017 | 868 | 305,284 | 225,048 | Accepted | Accepted | 14.65 | memo = [[[-1] * 201 for j in range(201)] for i in range(201)]
def gcd(numbers):
numbers.sort()
a = numbers[1]
b = numbers[0]
ans = b
while True:
q, mod = divmod(a, b)
if mod == 0:
break
a = b
b = mod
ans = mod
return ans
K = i... | def gcd(numbers):
numbers.sort()
a = numbers[1]
b = numbers[0]
ans = b
while True:
q, mod = divmod(a, b)
if mod == 0:
break
a = b
b = mod
ans = mod
return ans
K = int(eval(input()))
numbers = []
for i in range(K, 0, -1):
... | 39 | 34 | 867 | 705 | memo = [[[-1] * 201 for j in range(201)] for i in range(201)]
def gcd(numbers):
numbers.sort()
a = numbers[1]
b = numbers[0]
ans = b
while True:
q, mod = divmod(a, b)
if mod == 0:
break
a = b
b = mod
ans = mod
return ans
K = int(eval(input(... | def gcd(numbers):
numbers.sort()
a = numbers[1]
b = numbers[0]
ans = b
while True:
q, mod = divmod(a, b)
if mod == 0:
break
a = b
b = mod
ans = mod
return ans
K = int(eval(input()))
numbers = []
for i in range(K, 0, -1):
for j in range(i,... | false | 12.820513 | [
"-memo = [[[-1] * 201 for j in range(201)] for i in range(201)]",
"-",
"-",
"- if memo[a][b][c] == -1:",
"- if dup == 1:",
"- ans = gcd([gcd([a, b]), c])",
"- elif dup == 2:",
"- ans = gcd([gcd([a, b]), c]) * 3",
"- else:",
"- ans = gcd([gcd... | false | 0.425148 | 0.108466 | 3.919636 | [
"s974760543",
"s228118435"
] |
u365364616 | p02983 | python | s037251882 | s877528230 | 781 | 645 | 3,060 | 3,060 | Accepted | Accepted | 17.41 | l, r = list(map(int, input().split()))
if r - l >= 2019:
print((0))
elif l % 2019 > r % 2019:
print((0))
else:
ans = 2019
for i in range(l, r):
for j in range(i + 1, r + 1):
ans = min(ans, i * j % 2019)
print(ans)
| l, r = list(map(int, input().split()))
if r - l >= 2019:
print((0))
elif l % 2019 > r % 2019:
print((0))
else:
ans = 2019
for i in range(l % 2019, r % 2019):
for j in range(i + 1, r % 2019 + 1):
ans = min(ans, i * j % 2019)
print(ans)
| 11 | 11 | 254 | 275 | l, r = list(map(int, input().split()))
if r - l >= 2019:
print((0))
elif l % 2019 > r % 2019:
print((0))
else:
ans = 2019
for i in range(l, r):
for j in range(i + 1, r + 1):
ans = min(ans, i * j % 2019)
print(ans)
| l, r = list(map(int, input().split()))
if r - l >= 2019:
print((0))
elif l % 2019 > r % 2019:
print((0))
else:
ans = 2019
for i in range(l % 2019, r % 2019):
for j in range(i + 1, r % 2019 + 1):
ans = min(ans, i * j % 2019)
print(ans)
| false | 0 | [
"- for i in range(l, r):",
"- for j in range(i + 1, r + 1):",
"+ for i in range(l % 2019, r % 2019):",
"+ for j in range(i + 1, r % 2019 + 1):"
] | false | 0.041659 | 0.042202 | 0.987137 | [
"s037251882",
"s877528230"
] |
u732870425 | p03076 | python | s018138464 | s196857737 | 19 | 17 | 3,064 | 3,060 | Accepted | Accepted | 10.53 | a = int(eval(input()))
b = int(eval(input()))
c = int(eval(input()))
d = int(eval(input()))
e = int(eval(input()))
li = [a,b,c,d,e]
for i in range(len(li)):
if li[i]%10 != 0:
if li[i]%10 == min([x%10 if x%10 != 0 else 10 for x in li]):
N = i+0
break
else:
N = 0
... | a = [int(eval(input())) for _ in range(5)]
m = 0#1の位が0以外で一番小さいもの(10との差が一番大きいもの)
sum_a = 0#10倍数にしたものの合計
for x in a:
if x%10 != 0:
t = 10 - x%10#10倍数との差
else:
t = 0
sum_a += x+t
m = max(m, t)
print((sum_a - m)) | 23 | 13 | 425 | 246 | a = int(eval(input()))
b = int(eval(input()))
c = int(eval(input()))
d = int(eval(input()))
e = int(eval(input()))
li = [a, b, c, d, e]
for i in range(len(li)):
if li[i] % 10 != 0:
if li[i] % 10 == min([x % 10 if x % 10 != 0 else 10 for x in li]):
N = i + 0
break
else:
N = 0
for ... | a = [int(eval(input())) for _ in range(5)]
m = 0 # 1の位が0以外で一番小さいもの(10との差が一番大きいもの)
sum_a = 0 # 10倍数にしたものの合計
for x in a:
if x % 10 != 0:
t = 10 - x % 10 # 10倍数との差
else:
t = 0
sum_a += x + t
m = max(m, t)
print((sum_a - m))
| false | 43.478261 | [
"-a = int(eval(input()))",
"-b = int(eval(input()))",
"-c = int(eval(input()))",
"-d = int(eval(input()))",
"-e = int(eval(input()))",
"-li = [a, b, c, d, e]",
"-for i in range(len(li)):",
"- if li[i] % 10 != 0:",
"- if li[i] % 10 == min([x % 10 if x % 10 != 0 else 10 for x in li]):",
"-... | false | 0.059278 | 0.05005 | 1.184366 | [
"s018138464",
"s196857737"
] |
u644907318 | p03131 | python | s813205160 | s687352334 | 172 | 99 | 38,868 | 61,760 | Accepted | Accepted | 42.44 | K,A,B = list(map(int,input().split()))
if B<=A+2 or K<=A-1:
ans = 1+K
else:
cnt = A-1
ans = A
while cnt<=K:
k = min(ans//A,(K-cnt)//2)
if k>=1:
cnt += 2*k
ans = ans-k*A + k*B
else:
ans += (K-cnt)
break
print(ans) | K,A,B = list(map(int,input().split()))
if B-A<=2:
print((1+K))
else:
if K<=A-1:
print((1+K))
else:
d = K-(A-1)
if d==1:
print((A+1))
elif d%2==0:
print((B+((d-2)//2)*(B-A)))
else:
print((B+((d-3)//2)*(B-A)+1)) | 15 | 14 | 308 | 294 | K, A, B = list(map(int, input().split()))
if B <= A + 2 or K <= A - 1:
ans = 1 + K
else:
cnt = A - 1
ans = A
while cnt <= K:
k = min(ans // A, (K - cnt) // 2)
if k >= 1:
cnt += 2 * k
ans = ans - k * A + k * B
else:
ans += K - cnt
br... | K, A, B = list(map(int, input().split()))
if B - A <= 2:
print((1 + K))
else:
if K <= A - 1:
print((1 + K))
else:
d = K - (A - 1)
if d == 1:
print((A + 1))
elif d % 2 == 0:
print((B + ((d - 2) // 2) * (B - A)))
else:
print((B + ((d ... | false | 6.666667 | [
"-if B <= A + 2 or K <= A - 1:",
"- ans = 1 + K",
"+if B - A <= 2:",
"+ print((1 + K))",
"- cnt = A - 1",
"- ans = A",
"- while cnt <= K:",
"- k = min(ans // A, (K - cnt) // 2)",
"- if k >= 1:",
"- cnt += 2 * k",
"- ans = ans - k * A + k * B",
... | false | 0.043415 | 0.044031 | 0.986009 | [
"s813205160",
"s687352334"
] |
u525065967 | p03308 | python | s836613091 | s223306796 | 19 | 17 | 2,940 | 2,940 | Accepted | Accepted | 10.53 | n = int(eval(input()))
A = list(map(int, input().split()))
dmax = 0
for i in range(n-1):
for j in range(i+1,n):
dmax = max(dmax, abs(A[i]-A[j]))
print(dmax)
| _ = eval(input())
A = list(map(int, input().split()))
print((abs(max(A) - min(A))))
| 7 | 3 | 169 | 78 | n = int(eval(input()))
A = list(map(int, input().split()))
dmax = 0
for i in range(n - 1):
for j in range(i + 1, n):
dmax = max(dmax, abs(A[i] - A[j]))
print(dmax)
| _ = eval(input())
A = list(map(int, input().split()))
print((abs(max(A) - min(A))))
| false | 57.142857 | [
"-n = int(eval(input()))",
"+_ = eval(input())",
"-dmax = 0",
"-for i in range(n - 1):",
"- for j in range(i + 1, n):",
"- dmax = max(dmax, abs(A[i] - A[j]))",
"-print(dmax)",
"+print((abs(max(A) - min(A))))"
] | false | 0.083444 | 0.049227 | 1.695095 | [
"s836613091",
"s223306796"
] |
u919633157 | p03212 | python | s642353876 | s527159106 | 202 | 95 | 3,064 | 3,060 | Accepted | Accepted | 52.97 | # 2019/08/27
n=int(eval(input()))
ln=len(str(n))
sft='7530'
cnt=0
def dfs(ln,s):
global cnt
if ln==0:
if '7' in s and '5' in s and '3' in s:
if '0' in str(int(s)):return
if n>=int(s):cnt+=1
return
for e in sft:
dfs(ln-1,s+e)
dfs(ln,'')
print... | # 写経
n=int(eval(input()))
def dfs(s):
if int(s)>n:return 0
ret=1 if all(s.count(c)>0 for c in '753') else 0
for c in '753':
ret+=dfs(s+c)
return ret
print((dfs('0'))) | 18 | 13 | 319 | 202 | # 2019/08/27
n = int(eval(input()))
ln = len(str(n))
sft = "7530"
cnt = 0
def dfs(ln, s):
global cnt
if ln == 0:
if "7" in s and "5" in s and "3" in s:
if "0" in str(int(s)):
return
if n >= int(s):
cnt += 1
return
for e in sft:
... | # 写経
n = int(eval(input()))
def dfs(s):
if int(s) > n:
return 0
ret = 1 if all(s.count(c) > 0 for c in "753") else 0
for c in "753":
ret += dfs(s + c)
return ret
print((dfs("0")))
| false | 27.777778 | [
"-# 2019/08/27",
"+# 写経",
"-ln = len(str(n))",
"-sft = \"7530\"",
"-cnt = 0",
"-def dfs(ln, s):",
"- global cnt",
"- if ln == 0:",
"- if \"7\" in s and \"5\" in s and \"3\" in s:",
"- if \"0\" in str(int(s)):",
"- return",
"- if n >= int(s):",
... | false | 0.142529 | 0.06201 | 2.298502 | [
"s642353876",
"s527159106"
] |
u678167152 | p02608 | python | s995417728 | s945301077 | 314 | 97 | 9,332 | 74,812 | Accepted | Accepted | 69.11 | def solve():
N = int(input())
ans = [0]*N
for x in range(1,101):
for y in range(1,101):
for z in range(1,101):
left = x*x+y*y+z*z+x*y+y*z+z*x
if left<=N:
ans[left-1] += 1
return ans
print(*solve(),sep='\n')
| def solve():
N = int(input())
ans = [0]*(N+1)
for x in range(1,100):
for y in range(1,100):
for z in range(1,100):
left = x*x+y*y+z*z+x*y+y*z+z*x
if left<=N:
ans[left] += 1
return ans[1:]
print(*solve(),sep='\n')
| 11 | 11 | 260 | 266 | def solve():
N = int(input())
ans = [0] * N
for x in range(1, 101):
for y in range(1, 101):
for z in range(1, 101):
left = x * x + y * y + z * z + x * y + y * z + z * x
if left <= N:
ans[left - 1] += 1
return ans
print(*solve(), s... | def solve():
N = int(input())
ans = [0] * (N + 1)
for x in range(1, 100):
for y in range(1, 100):
for z in range(1, 100):
left = x * x + y * y + z * z + x * y + y * z + z * x
if left <= N:
ans[left] += 1
return ans[1:]
print(*solv... | false | 0 | [
"- ans = [0] * N",
"- for x in range(1, 101):",
"- for y in range(1, 101):",
"- for z in range(1, 101):",
"+ ans = [0] * (N + 1)",
"+ for x in range(1, 100):",
"+ for y in range(1, 100):",
"+ for z in range(1, 100):",
"- ans[left - 1... | false | 1.640201 | 0.645286 | 2.54182 | [
"s995417728",
"s945301077"
] |
u891635666 | p02887 | python | s757119048 | s618432006 | 77 | 54 | 10,396 | 15,860 | Accepted | Accepted | 29.87 | n = int(eval(input()))
s = input().rstrip()
def rle(s):
import itertools
return list([(x[0], len(list(x[1]))) for x in itertools.groupby(s)])
print((len(rle(s)))) | import itertools
import sys
input = sys.stdin.readline
ri = lambda: int(eval(input()))
rs = lambda: input().rstrip()
ril = lambda: list(map(int, input().split()))
rsl = lambda: input().rstrip().split()
ris = lambda n: [ri() for _ in range(n)]
rss = lambda n: [rs() for _ in range(n)]
rils = lambda n: [ril()... | 10 | 17 | 180 | 439 | n = int(eval(input()))
s = input().rstrip()
def rle(s):
import itertools
return list([(x[0], len(list(x[1]))) for x in itertools.groupby(s)])
print((len(rle(s))))
| import itertools
import sys
input = sys.stdin.readline
ri = lambda: int(eval(input()))
rs = lambda: input().rstrip()
ril = lambda: list(map(int, input().split()))
rsl = lambda: input().rstrip().split()
ris = lambda n: [ri() for _ in range(n)]
rss = lambda n: [rs() for _ in range(n)]
rils = lambda n: [ril() for _ in ra... | false | 41.176471 | [
"-n = int(eval(input()))",
"-s = input().rstrip()",
"+import itertools",
"+import sys",
"-",
"-def rle(s):",
"- import itertools",
"-",
"- return list([(x[0], len(list(x[1]))) for x in itertools.groupby(s)])",
"-",
"-",
"-print((len(rle(s))))",
"+input = sys.stdin.readline",
"+ri = l... | false | 0.040742 | 0.038484 | 1.058675 | [
"s757119048",
"s618432006"
] |
u952708174 | p03545 | python | s273681618 | s480965798 | 167 | 27 | 38,384 | 9,028 | Accepted | Accepted | 83.83 | def c_train_ticket(N):
A, B, C, D = list(map(int, N))
# 各演算子の決定。本問では高々8通りなので愚直にやる
# オペランド数が増えた場合は、バイナリを演算子の並びとみなせばよい
operator = ['---', '--+', '-+-', '-++', '+--', '+-+', '++-', '+++']
ans = ''
for i, op in enumerate(operator):
code = 'A {0} B {1} C {2} D'.format(op[0], op[1], o... | def c_train_ticket():
from itertools import product
operands = tuple(eval(input()))
# 演算子の選び方は高々 8 通りなので全探索する
for operators in product('+-', repeat=3):
formula = ''.join(ch + op for ch, op in zip(operands, operators + ('',)))
if eval(formula) == 7:
return formula + '=7... | 17 | 11 | 540 | 388 | def c_train_ticket(N):
A, B, C, D = list(map(int, N))
# 各演算子の決定。本問では高々8通りなので愚直にやる
# オペランド数が増えた場合は、バイナリを演算子の並びとみなせばよい
operator = ["---", "--+", "-+-", "-++", "+--", "+-+", "++-", "+++"]
ans = ""
for i, op in enumerate(operator):
code = "A {0} B {1} C {2} D".format(op[0], op[1], op[2])
... | def c_train_ticket():
from itertools import product
operands = tuple(eval(input()))
# 演算子の選び方は高々 8 通りなので全探索する
for operators in product("+-", repeat=3):
formula = "".join(ch + op for ch, op in zip(operands, operators + ("",)))
if eval(formula) == 7:
return formula + "=7"
... | false | 35.294118 | [
"-def c_train_ticket(N):",
"- A, B, C, D = list(map(int, N))",
"- # 各演算子の決定。本問では高々8通りなので愚直にやる",
"- # オペランド数が増えた場合は、バイナリを演算子の並びとみなせばよい",
"- ans = \"\"",
"- for i, op in enumerate(operator):",
"- code = \"A {0} B {1} C {2} D\".format(op[0], op[1], op[2])",
"- if eval(code) =... | false | 0.088805 | 0.068207 | 1.301994 | [
"s273681618",
"s480965798"
] |
u930705402 | p02625 | python | s692110898 | s714313453 | 136 | 119 | 95,472 | 103,668 | Accepted | Accepted | 12.5 | MOD=10**9+7
def facinv(N):
fac,finv,inv=[0]*(N+1),[0]*(N+1),[0]*(N+1)
fac[0]=1;fac[1]=1;finv[0]=1;finv[1]=1;inv[1]=1
for i in range(2,N+1):
fac[i]=fac[i-1]*i%MOD
inv[i]=MOD-inv[MOD%i]*(MOD//i)%MOD
finv[i]=finv[i-1]*inv[i]%MOD
return fac,finv,inv
def COM(n,r):
if n... | MOD=10**9+7
def facinv(N):
fac,finv,inv=[0]*(N+1),[0]*(N+1),[0]*(N+1)
fac[0]=1;fac[1]=1;finv[0]=1;finv[1]=1;inv[1]=1
for i in range(2,N+1):
fac[i]=fac[i-1]*i%MOD
inv[i]=MOD-inv[MOD%i]*(MOD//i)%MOD
finv[i]=finv[i-1]*inv[i]%MOD
return fac,finv,inv
def COM(n,r):
if n... | 31 | 34 | 747 | 782 | MOD = 10**9 + 7
def facinv(N):
fac, finv, inv = [0] * (N + 1), [0] * (N + 1), [0] * (N + 1)
fac[0] = 1
fac[1] = 1
finv[0] = 1
finv[1] = 1
inv[1] = 1
for i in range(2, N + 1):
fac[i] = fac[i - 1] * i % MOD
inv[i] = MOD - inv[MOD % i] * (MOD // i) % MOD
finv[i] = finv... | MOD = 10**9 + 7
def facinv(N):
fac, finv, inv = [0] * (N + 1), [0] * (N + 1), [0] * (N + 1)
fac[0] = 1
fac[1] = 1
finv[0] = 1
finv[1] = 1
inv[1] = 1
for i in range(2, N + 1):
fac[i] = fac[i - 1] * i % MOD
inv[i] = MOD - inv[MOD % i] * (MOD // i) % MOD
finv[i] = finv... | false | 8.823529 | [
"+def p(r):",
"+ return 1 if r % 2 else -1",
"+",
"+",
"- res = (res + (pow(-1, r - 1) * f) + MOD) % MOD",
"+ res = (res + (p(r) * f) + MOD) % MOD"
] | false | 0.244324 | 0.233156 | 1.0479 | [
"s692110898",
"s714313453"
] |
u163320134 | p03722 | python | s666000479 | s994986555 | 815 | 635 | 3,392 | 4,336 | Accepted | Accepted | 22.09 | #https://qiita.com/chun1182/items/ddf2b6cba932b2bb0d4e
def BF(p,n,s):
inf=float("inf")
d=[inf for i in range(n)]
d[s-1]=0
for i in range(n+1):
for e in p:
if e[0]!=inf and d[e[1]-1]>d[e[0]-1]+e[2]:
d[e[1]-1] = d[e[0]-1] + e[2]
if i==n-1:t=d[-1]
... | import sys
sys.setrecursionlimit(10**9)
def BF(edges,n,s):
inf=float("inf")
d=[inf for i in range(n+1)]
d[s]=0
update=True
for i in range(n+1):
update=False
for v,u,cost in edges:
if cand[v]!=1 or cand[u]!=1:
continue
if d[v]!=inf and d[u]>d[v]+cos... | 20 | 57 | 548 | 1,118 | # https://qiita.com/chun1182/items/ddf2b6cba932b2bb0d4e
def BF(p, n, s):
inf = float("inf")
d = [inf for i in range(n)]
d[s - 1] = 0
for i in range(n + 1):
for e in p:
if e[0] != inf and d[e[1] - 1] > d[e[0] - 1] + e[2]:
d[e[1] - 1] = d[e[0] - 1] + e[2]
if i =... | import sys
sys.setrecursionlimit(10**9)
def BF(edges, n, s):
inf = float("inf")
d = [inf for i in range(n + 1)]
d[s] = 0
update = True
for i in range(n + 1):
update = False
for v, u, cost in edges:
if cand[v] != 1 or cand[u] != 1:
continue
i... | false | 64.912281 | [
"-# https://qiita.com/chun1182/items/ddf2b6cba932b2bb0d4e",
"-def BF(p, n, s):",
"+import sys",
"+",
"+sys.setrecursionlimit(10**9)",
"+",
"+",
"+def BF(edges, n, s):",
"- d = [inf for i in range(n)]",
"- d[s - 1] = 0",
"+ d = [inf for i in range(n + 1)]",
"+ d[s] = 0",
"+ upd... | false | 0.053242 | 0.053881 | 0.98814 | [
"s666000479",
"s994986555"
] |
u972591645 | p02803 | python | s022705069 | s532383326 | 387 | 203 | 9,424 | 9,468 | Accepted | Accepted | 47.55 | from collections import deque
h, w = list(map(int, input().split()))
s = [list(eval(input())) for _ in range(h)]
sl = []
flag = False
for i in range(h):
for j in range(w):
if s[i][j] == '.':
sl.append([i, j])
q = deque()
dire = [(0, 1), (0, -1), (1, 0), (-1, 0)]
ans = 0
for sh,... | def main():
import sys
readline = sys.stdin.buffer.readline
from collections import deque
h, w = list(map(int, readline().split()))
s = ['#'*(w+2)] + ['#' + readline().rstrip().decode('utf-8') + '#' for _ in range(h)] + ['#'*(w+2)]
l = []
for i in range(h+2):
for j in r... | 30 | 32 | 768 | 949 | from collections import deque
h, w = list(map(int, input().split()))
s = [list(eval(input())) for _ in range(h)]
sl = []
flag = False
for i in range(h):
for j in range(w):
if s[i][j] == ".":
sl.append([i, j])
q = deque()
dire = [(0, 1), (0, -1), (1, 0), (-1, 0)]
ans = 0
for sh, sw in sl:
c ... | def main():
import sys
readline = sys.stdin.buffer.readline
from collections import deque
h, w = list(map(int, readline().split()))
s = (
["#" * (w + 2)]
+ ["#" + readline().rstrip().decode("utf-8") + "#" for _ in range(h)]
+ ["#" * (w + 2)]
)
l = []
for i in ra... | false | 6.25 | [
"-from collections import deque",
"+def main():",
"+ import sys",
"-h, w = list(map(int, input().split()))",
"-s = [list(eval(input())) for _ in range(h)]",
"-sl = []",
"-flag = False",
"-for i in range(h):",
"- for j in range(w):",
"- if s[i][j] == \".\":",
"- sl.append(... | false | 0.086803 | 0.0382 | 2.272358 | [
"s022705069",
"s532383326"
] |
u522140891 | p02954 | python | s455894704 | s104712270 | 102 | 92 | 79,228 | 73,284 | Accepted | Accepted | 9.8 | #!/usr/bin/env python3
# -*- coding: utf-8 -*-
#
# Created: Jul, 13, 2020 16:37:16 by Nobody
# $Author$
# $Date$
# $URL$
__giturl__ = "$URL$"
from collections import defaultdict
from collections import deque
from collections import OrderedDict
import itertools
from sys import stdin
input = stdin.readli... | from sys import stdin
input = stdin.readline
def main():
S = input()[:-1]
pre = 'R'
r_cnt = 1
l_cnt = 0
l_pre = -1
C = [0]*(len(S))
for i in range(1, len(S)):
now = S[i]
if pre == 'R' and now == 'R':
r_cnt += 1
elif pre == 'R' and now == 'L':
C[i-1] = r_cnt
... | 64 | 50 | 1,429 | 1,152 | #!/usr/bin/env python3
# -*- coding: utf-8 -*-
#
# Created: Jul, 13, 2020 16:37:16 by Nobody
# $Author$
# $Date$
# $URL$
__giturl__ = "$URL$"
from collections import defaultdict
from collections import deque
from collections import OrderedDict
import itertools
from sys import stdin
input = stdin.readline
def main():... | from sys import stdin
input = stdin.readline
def main():
S = input()[:-1]
pre = "R"
r_cnt = 1
l_cnt = 0
l_pre = -1
C = [0] * (len(S))
for i in range(1, len(S)):
now = S[i]
if pre == "R" and now == "R":
r_cnt += 1
elif pre == "R" and now == "L":
... | false | 21.875 | [
"-#!/usr/bin/env python3",
"-# -*- coding: utf-8 -*-",
"-#",
"-# Created: Jul, 13, 2020 16:37:16 by Nobody",
"-# $Author$",
"-# $Date$",
"-# $URL$",
"-__giturl__ = \"$URL$\"",
"-from collections import defaultdict",
"-from collections import deque",
"-from collections import OrderedDict",
"-im... | false | 0.042486 | 0.04272 | 0.994504 | [
"s455894704",
"s104712270"
] |
u049182844 | p03378 | python | s041033046 | s580488299 | 32 | 29 | 9,176 | 9,200 | Accepted | Accepted | 9.38 | def count_fee_station(a, n_list):
cost = 0
for i in n_list:
if i in a:
cost += 1
return cost
def main():
n , m , x = list(map(int,input().split()))
a = list(map(int, input().split()))
if n in a:
a.remove(n)
n_list_a = list(range(0,x+1))
n_list... | def count_fee_station(a, n_list):
cost = 0
for i in n_list:
if i in a:
cost += 1
return cost
def main():
n , m , x = list(map(int,input().split()))
a = list(map(int, input().split()))
# if n in a:
# a.remove(n)
n_list_a = list(range(0,x+1))
n_... | 21 | 21 | 499 | 503 | def count_fee_station(a, n_list):
cost = 0
for i in n_list:
if i in a:
cost += 1
return cost
def main():
n, m, x = list(map(int, input().split()))
a = list(map(int, input().split()))
if n in a:
a.remove(n)
n_list_a = list(range(0, x + 1))
n_list_b = list(ran... | def count_fee_station(a, n_list):
cost = 0
for i in n_list:
if i in a:
cost += 1
return cost
def main():
n, m, x = list(map(int, input().split()))
a = list(map(int, input().split()))
# if n in a:
# a.remove(n)
n_list_a = list(range(0, x + 1))
n_list_b = list... | false | 0 | [
"- if n in a:",
"- a.remove(n)",
"+ # if n in a:",
"+ # a.remove(n)"
] | false | 0.048411 | 0.039344 | 1.230464 | [
"s041033046",
"s580488299"
] |
u977389981 | p03846 | python | s799242378 | s197469744 | 104 | 72 | 15,312 | 14,812 | Accepted | Accepted | 30.77 | from collections import Counter
n = int(eval(input()))
A = sorted(Counter([int(i) for i in input().split()]).most_common())
flag = 0
for i in range(len(A) - 1):
if A[i + 1][0] - A[i][0] != 2:
flag = 1
cnt = 0
for a in A:
if a[0] == 0 and a[1] == 1:
pass
elif a[0] != 0 and a[1]... | from collections import Counter
mod = 10 ** 9 + 7
n = int(eval(input()))
A = Counter([int(i) for i in input().split()])
ans = 0
if n % 2 == 1:
for k, v in list(A.items()):
if k == 0 and v != 1:
ans = 0
break
elif v >= 3:
ans = 0
break
... | 23 | 33 | 472 | 636 | from collections import Counter
n = int(eval(input()))
A = sorted(Counter([int(i) for i in input().split()]).most_common())
flag = 0
for i in range(len(A) - 1):
if A[i + 1][0] - A[i][0] != 2:
flag = 1
cnt = 0
for a in A:
if a[0] == 0 and a[1] == 1:
pass
elif a[0] != 0 and a[1] == 2:
... | from collections import Counter
mod = 10**9 + 7
n = int(eval(input()))
A = Counter([int(i) for i in input().split()])
ans = 0
if n % 2 == 1:
for k, v in list(A.items()):
if k == 0 and v != 1:
ans = 0
break
elif v >= 3:
ans = 0
break
elif v == ... | false | 30.30303 | [
"+mod = 10**9 + 7",
"-A = sorted(Counter([int(i) for i in input().split()]).most_common())",
"-flag = 0",
"-for i in range(len(A) - 1):",
"- if A[i + 1][0] - A[i][0] != 2:",
"- flag = 1",
"-cnt = 0",
"-for a in A:",
"- if a[0] == 0 and a[1] == 1:",
"- pass",
"- elif a[0] !... | false | 0.03455 | 0.051322 | 0.673202 | [
"s799242378",
"s197469744"
] |
u248418051 | p02597 | python | s226694851 | s188902090 | 103 | 66 | 71,536 | 64,452 | Accepted | Accepted | 35.92 | import sys
import math
from collections import Counter
import heapq
for _ in range(1):
n=int(eval(input()))
s=list(eval(input()))
ptr=0
while(ptr<n and s[ptr]=="R"):ptr+=1
if ptr==n:
print((0))
exit(0)
k=ptr
ptr=n-1
while(ptr>=0 and s[ptr]=="W"):
pt... | n=int(eval(input()))
s=eval(input())
k=s.count('R')
count=0
for i in range(k):
if s[i]=='R':
count+=1
print((k-count)) | 35 | 8 | 648 | 123 | import sys
import math
from collections import Counter
import heapq
for _ in range(1):
n = int(eval(input()))
s = list(eval(input()))
ptr = 0
while ptr < n and s[ptr] == "R":
ptr += 1
if ptr == n:
print((0))
exit(0)
k = ptr
ptr = n - 1
while ptr >= 0 and s[ptr] =... | n = int(eval(input()))
s = eval(input())
k = s.count("R")
count = 0
for i in range(k):
if s[i] == "R":
count += 1
print((k - count))
| false | 77.142857 | [
"-import sys",
"-import math",
"-from collections import Counter",
"-import heapq",
"-",
"-for _ in range(1):",
"- n = int(eval(input()))",
"- s = list(eval(input()))",
"- ptr = 0",
"- while ptr < n and s[ptr] == \"R\":",
"- ptr += 1",
"- if ptr == n:",
"- print(... | false | 0.037363 | 0.036154 | 1.033443 | [
"s226694851",
"s188902090"
] |
u346395915 | p02861 | python | s906695454 | s844944209 | 432 | 325 | 3,188 | 13,868 | Accepted | Accepted | 24.77 | import itertools
n = int(eval(input()))
city_distance = [list(map(int, input().split())) for _ in range(n)]
city_number = [i for i in range(n)]
permutations_city_number = itertools.permutations(city_number)
sum_distance = 0
cnt = 0
for city in permutations_city_number:
memo = 0
for x in city:
... | import itertools
n = int(eval(input()))
li = [list(map(int, input().split())) for _ in range(n)]
s = [i for i in range(n)]
path = list(itertools.permutations(s, len(s)))
ans = 0
for i in range(len(path)):
for j in range(n-1):
ans += ((li[path[i][j]][0] - li[path[i][j+1]][0]) ** 2 + (li[pat... | 21 | 16 | 563 | 394 | import itertools
n = int(eval(input()))
city_distance = [list(map(int, input().split())) for _ in range(n)]
city_number = [i for i in range(n)]
permutations_city_number = itertools.permutations(city_number)
sum_distance = 0
cnt = 0
for city in permutations_city_number:
memo = 0
for x in city:
if memo =... | import itertools
n = int(eval(input()))
li = [list(map(int, input().split())) for _ in range(n)]
s = [i for i in range(n)]
path = list(itertools.permutations(s, len(s)))
ans = 0
for i in range(len(path)):
for j in range(n - 1):
ans += (
(li[path[i][j]][0] - li[path[i][j + 1]][0]) ** 2
... | false | 23.809524 | [
"-city_distance = [list(map(int, input().split())) for _ in range(n)]",
"-city_number = [i for i in range(n)]",
"-permutations_city_number = itertools.permutations(city_number)",
"-sum_distance = 0",
"-cnt = 0",
"-for city in permutations_city_number:",
"- memo = 0",
"- for x in city:",
"- ... | false | 0.074753 | 0.073115 | 1.022399 | [
"s906695454",
"s844944209"
] |
u514401521 | p03317 | python | s180180364 | s809359138 | 49 | 40 | 14,008 | 13,812 | Accepted | Accepted | 18.37 | n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
p = 0
cnt= 0
while p < n - 1:
p += k - 1
cnt += 1
print(cnt) | import math
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
print((int(math.ceil((n-1)/(k-1))))) | 10 | 5 | 148 | 120 | n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
p = 0
cnt = 0
while p < n - 1:
p += k - 1
cnt += 1
print(cnt)
| import math
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
print((int(math.ceil((n - 1) / (k - 1)))))
| false | 50 | [
"+import math",
"+",
"-p = 0",
"-cnt = 0",
"-while p < n - 1:",
"- p += k - 1",
"- cnt += 1",
"-print(cnt)",
"+print((int(math.ceil((n - 1) / (k - 1)))))"
] | false | 0.03493 | 0.036226 | 0.964217 | [
"s180180364",
"s809359138"
] |
u256678932 | p02412 | python | s337393283 | s161977538 | 250 | 50 | 5,600 | 5,592 | Accepted | Accepted | 80 | def how_many_ways(n, x):
ways = 0
for i in range(1, n-1):
for j in range(i+1, n):
for k in range(j+1, n+1):
if i+j+k == x:
ways += 1
return ways
def main():
while True:
n, x = [int(x) for x in input().split()]
if n ==... | while True:
n, x = list(map(int, input().split()))
if n == x == 0:
break
count = 0
for i in range(1, n+1):
for j in range(i+1, n+1):
k = x - i - j
if not (j < k <= n):
continue
count += 1
print(count)
| 21 | 18 | 430 | 306 | def how_many_ways(n, x):
ways = 0
for i in range(1, n - 1):
for j in range(i + 1, n):
for k in range(j + 1, n + 1):
if i + j + k == x:
ways += 1
return ways
def main():
while True:
n, x = [int(x) for x in input().split()]
if n == ... | while True:
n, x = list(map(int, input().split()))
if n == x == 0:
break
count = 0
for i in range(1, n + 1):
for j in range(i + 1, n + 1):
k = x - i - j
if not (j < k <= n):
continue
count += 1
print(count)
| false | 14.285714 | [
"-def how_many_ways(n, x):",
"- ways = 0",
"- for i in range(1, n - 1):",
"- for j in range(i + 1, n):",
"- for k in range(j + 1, n + 1):",
"- if i + j + k == x:",
"- ways += 1",
"- return ways",
"-",
"-",
"-def main():",
"- while... | false | 0.085248 | 0.124936 | 0.682334 | [
"s337393283",
"s161977538"
] |
u905582793 | p03132 | python | s104770441 | s334468791 | 659 | 547 | 126,428 | 95,952 | Accepted | Accepted | 17 | import sys
input = sys.stdin.readline
n = int(eval(input()))
a = [int(eval(input())) for i in range(n)]
b = [0]*n
for i in range(n):
if a[i]%2:
b[i] = 1
elif a[i]:
b[i] = 2
a.append(0)
b.append(0)
n += 1
DP = [[[10**18 for i in range(3)] for j in range(3)] for k in range(n+1)]
for i in range(3... | import sys
input = sys.stdin.readline
n = int(eval(input()))
a = [int(eval(input())) for i in range(n)]
b = [0]*n
for i in range(n):
if a[i]%2:
b[i] = 1
elif a[i]:
b[i] = 2
DP = [[10**18 for i in range(5)] for j in range(n+1)]
for i in range(5):
DP[0][i] = 0
for i in range(1,n+1):
for j ... | 33 | 23 | 1,019 | 606 | import sys
input = sys.stdin.readline
n = int(eval(input()))
a = [int(eval(input())) for i in range(n)]
b = [0] * n
for i in range(n):
if a[i] % 2:
b[i] = 1
elif a[i]:
b[i] = 2
a.append(0)
b.append(0)
n += 1
DP = [[[10**18 for i in range(3)] for j in range(3)] for k in range(n + 1)]
for i in ra... | import sys
input = sys.stdin.readline
n = int(eval(input()))
a = [int(eval(input())) for i in range(n)]
b = [0] * n
for i in range(n):
if a[i] % 2:
b[i] = 1
elif a[i]:
b[i] = 2
DP = [[10**18 for i in range(5)] for j in range(n + 1)]
for i in range(5):
DP[0][i] = 0
for i in range(1, n + 1):
... | false | 30.30303 | [
"-a.append(0)",
"-b.append(0)",
"-n += 1",
"-DP = [[[10**18 for i in range(3)] for j in range(3)] for k in range(n + 1)]",
"-for i in range(3):",
"- for j in range(3):",
"- DP[0][i][j] = 0",
"+DP = [[10**18 for i in range(5)] for j in range(n + 1)]",
"+for i in range(5):",
"+ DP[0][i]... | false | 0.037911 | 0.037219 | 1.018566 | [
"s104770441",
"s334468791"
] |
u130900604 | p02693 | python | s019294161 | s575305397 | 63 | 55 | 61,892 | 61,880 | Accepted | Accepted | 12.7 | k,a,b=list(map(int,open(0).read().split()))
print(("OK"if a<=b//k*k else"NG")) | k,a,b=list(map(int,open(0).read().split()))
print(("ONKG"[a>b//k*k::2])) | 2 | 2 | 71 | 65 | k, a, b = list(map(int, open(0).read().split()))
print(("OK" if a <= b // k * k else "NG"))
| k, a, b = list(map(int, open(0).read().split()))
print(("ONKG"[a > b // k * k :: 2]))
| false | 0 | [
"-print((\"OK\" if a <= b // k * k else \"NG\"))",
"+print((\"ONKG\"[a > b // k * k :: 2]))"
] | false | 0.037289 | 0.137813 | 0.270577 | [
"s019294161",
"s575305397"
] |
u163703551 | p03732 | python | s046578848 | s315542594 | 317 | 244 | 3,188 | 3,192 | Accepted | Accepted | 23.03 | import sys
# sys.stdin = open('d1.in')
n, W = list(map(int, input().split()))
g = {}
w1 = 0
for i in range(n):
w, v = list(map(int, input().split()))
if i == 0:
w1 = w
for x in range(w, w + 4):
g[x] = []
g[w].append(v)
for w, values in list(g.items()):
values... | import sys
# sys.stdin = open('d1.in')
n, W = list(map(int, input().split()))
g = {}
w1 = 0
for i in range(n):
w, v = list(map(int, input().split()))
if i == 0:
w1 = w
for x in range(w, w + 4):
g[x] = []
g[w].append(v)
for w, values in list(g.items()):
values... | 44 | 55 | 1,183 | 1,418 | import sys
# sys.stdin = open('d1.in')
n, W = list(map(int, input().split()))
g = {}
w1 = 0
for i in range(n):
w, v = list(map(int, input().split()))
if i == 0:
w1 = w
for x in range(w, w + 4):
g[x] = []
g[w].append(v)
for w, values in list(g.items()):
values.sort(reverse=Tr... | import sys
# sys.stdin = open('d1.in')
n, W = list(map(int, input().split()))
g = {}
w1 = 0
for i in range(n):
w, v = list(map(int, input().split()))
if i == 0:
w1 = w
for x in range(w, w + 4):
g[x] = []
g[w].append(v)
for w, values in list(g.items()):
values.sort(reverse=Tr... | false | 20 | [
"+wa = 0",
"+ wa = w1 * a",
"+ if wa > W:",
"+ continue",
"+ wb = (w1 + 1) * b",
"+ if wa + wb > W:",
"+ continue",
"+ wc = (w1 + 2) * c",
"+ if wa + wb + wc > W:",
"+ continue",
"- total_w = w1 * a + (w1 +... | false | 0.049985 | 0.041732 | 1.197758 | [
"s046578848",
"s315542594"
] |
u488178971 | p03556 | python | s408551377 | s283117922 | 165 | 152 | 12,972 | 12,388 | Accepted | Accepted | 7.88 | # 077 B
import numpy as np
N = int(eval(input()))
print((int(np.sqrt(N)) * int(np.sqrt(N)))) | # 077 B
import numpy as np
N = int(eval(input()))
n=int(np.sqrt(N))
print((n**2)) | 5 | 6 | 89 | 79 | # 077 B
import numpy as np
N = int(eval(input()))
print((int(np.sqrt(N)) * int(np.sqrt(N))))
| # 077 B
import numpy as np
N = int(eval(input()))
n = int(np.sqrt(N))
print((n**2))
| false | 16.666667 | [
"-print((int(np.sqrt(N)) * int(np.sqrt(N))))",
"+n = int(np.sqrt(N))",
"+print((n**2))"
] | false | 0.584827 | 0.23867 | 2.450364 | [
"s408551377",
"s283117922"
] |
u312025627 | p03061 | python | s180587215 | s595418698 | 257 | 162 | 63,984 | 87,724 | Accepted | Accepted | 36.96 | def main():
N = int(eval(input()))
A = [int(i) for i in input().split()]
gcd_L = [0]*(N+2)
gcd_R = [0]*(N+2)
def gcd(x, y):
if y == 0:
return x
while y != 0:
x, y = y, x % y
return x
for i, a in enumerate(A):
gcd_L[i+1] = gc... | from math import gcd
class SegTree:
X_unit = 0
X_f = gcd
def __init__(self, N):
self.N = N
self.X = [self.X_unit] * (N + N)
def build(self, seq):
for i, x in enumerate(seq, self.N):
self.X[i] = x
for i in range(self.N - 1, 0, -1):
... | 29 | 54 | 671 | 1,256 | def main():
N = int(eval(input()))
A = [int(i) for i in input().split()]
gcd_L = [0] * (N + 2)
gcd_R = [0] * (N + 2)
def gcd(x, y):
if y == 0:
return x
while y != 0:
x, y = y, x % y
return x
for i, a in enumerate(A):
gcd_L[i + 1] = gcd(gc... | from math import gcd
class SegTree:
X_unit = 0
X_f = gcd
def __init__(self, N):
self.N = N
self.X = [self.X_unit] * (N + N)
def build(self, seq):
for i, x in enumerate(seq, self.N):
self.X[i] = x
for i in range(self.N - 1, 0, -1):
self.X[i] = s... | false | 46.296296 | [
"+from math import gcd",
"+",
"+",
"+class SegTree:",
"+ X_unit = 0",
"+ X_f = gcd",
"+",
"+ def __init__(self, N):",
"+ self.N = N",
"+ self.X = [self.X_unit] * (N + N)",
"+",
"+ def build(self, seq):",
"+ for i, x in enumerate(seq, self.N):",
"+ ... | false | 0.035835 | 0.036297 | 0.987284 | [
"s180587215",
"s595418698"
] |
u411203878 | p02832 | python | s256777688 | s899199253 | 242 | 105 | 77,516 | 100,940 | Accepted | Accepted | 56.61 | n=int(eval(input()))
t = list(map(int,input().split()))
res = 0
count = 1
for i in t:
if i == count:
count += 1
res += 1
if res == 0:
print((-1))
else:
print((n-res)) | n=int(eval(input()))
t = list(map(int,input().split()))
if 1 in t:
ans = 0
else:
print((-1))
exit()
for i in range(n):
if t[i] == ans+1:
ans += 1
print((n-ans))
| 16 | 15 | 203 | 196 | n = int(eval(input()))
t = list(map(int, input().split()))
res = 0
count = 1
for i in t:
if i == count:
count += 1
res += 1
if res == 0:
print((-1))
else:
print((n - res))
| n = int(eval(input()))
t = list(map(int, input().split()))
if 1 in t:
ans = 0
else:
print((-1))
exit()
for i in range(n):
if t[i] == ans + 1:
ans += 1
print((n - ans))
| false | 6.25 | [
"-res = 0",
"-count = 1",
"-for i in t:",
"- if i == count:",
"- count += 1",
"- res += 1",
"-if res == 0:",
"+if 1 in t:",
"+ ans = 0",
"+else:",
"-else:",
"- print((n - res))",
"+ exit()",
"+for i in range(n):",
"+ if t[i] == ans + 1:",
"+ ans += 1... | false | 0.039226 | 0.03618 | 1.084192 | [
"s256777688",
"s899199253"
] |
u477977638 | p02947 | python | s206959555 | s835347459 | 438 | 176 | 18,148 | 28,072 | Accepted | Accepted | 59.82 | from collections import defaultdict
n=int(eval(input()))
dct=defaultdict(int)
for i in range(n):
s=eval(input())
sort_s="".join(sorted(s))
dct[sort_s]+=1
ans=0
for k,v in list(dct.items()):
ans+= v*(v-1)//2
print(ans) | import sys
input = sys.stdin.buffer.readline
#sys.setrecursionlimit(10**9)
#from functools import lru_cache
def RD(): return input().rstrip().decode()
def II(): return int(eval(input()))
def FI(): return int(eval(input()))
def MI(): return list(map(int,input().split()))
def MF(): return list(map(float,input... | 13 | 42 | 221 | 756 | from collections import defaultdict
n = int(eval(input()))
dct = defaultdict(int)
for i in range(n):
s = eval(input())
sort_s = "".join(sorted(s))
dct[sort_s] += 1
ans = 0
for k, v in list(dct.items()):
ans += v * (v - 1) // 2
print(ans)
| import sys
input = sys.stdin.buffer.readline
# sys.setrecursionlimit(10**9)
# from functools import lru_cache
def RD():
return input().rstrip().decode()
def II():
return int(eval(input()))
def FI():
return int(eval(input()))
def MI():
return list(map(int, input().split()))
def MF():
return ... | false | 69.047619 | [
"+import sys",
"+",
"+input = sys.stdin.buffer.readline",
"+# sys.setrecursionlimit(10**9)",
"+# from functools import lru_cache",
"+def RD():",
"+ return input().rstrip().decode()",
"+",
"+",
"+def II():",
"+ return int(eval(input()))",
"+",
"+",
"+def FI():",
"+ return int(eva... | false | 0.073628 | 0.079019 | 0.931784 | [
"s206959555",
"s835347459"
] |
u318427318 | p02899 | python | s947099967 | s600536600 | 294 | 139 | 34,744 | 33,620 | Accepted | Accepted | 52.72 | if __name__ == "__main__":
list = []
tmp = []
sort_list = []
num = int(eval(input()))
list = input().split()
for i,v in enumerate(list):
tmp.append([int(v),i+1])
sort_list=sorted(tmp)
ans = [str(i[1]) for i in sort_list ]
print((" ".join(ans))) | #-*-coding:utf-8-*-
import sys
input=sys.stdin.readline
def main():
attended_people=[]
sorted_attended_people=[]
index_number=[]
answer=[]
n = int(eval(input()))
attended_people=list(map(int,input().split()))
index_number=[[idx,number] for idx,number in enumerate(attended_people)... | 11 | 19 | 290 | 531 | if __name__ == "__main__":
list = []
tmp = []
sort_list = []
num = int(eval(input()))
list = input().split()
for i, v in enumerate(list):
tmp.append([int(v), i + 1])
sort_list = sorted(tmp)
ans = [str(i[1]) for i in sort_list]
print((" ".join(ans)))
| # -*-coding:utf-8-*-
import sys
input = sys.stdin.readline
def main():
attended_people = []
sorted_attended_people = []
index_number = []
answer = []
n = int(eval(input()))
attended_people = list(map(int, input().split()))
index_number = [[idx, number] for idx, number in enumerate(attende... | false | 42.105263 | [
"+# -*-coding:utf-8-*-",
"+import sys",
"+",
"+input = sys.stdin.readline",
"+",
"+",
"+def main():",
"+ attended_people = []",
"+ sorted_attended_people = []",
"+ index_number = []",
"+ answer = []",
"+ n = int(eval(input()))",
"+ attended_people = list(map(int, input().sp... | false | 0.037125 | 0.110773 | 0.335142 | [
"s947099967",
"s600536600"
] |
u168578024 | p03061 | python | s858772081 | s506218244 | 1,024 | 687 | 107,424 | 81,340 | Accepted | Accepted | 32.91 | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
from fractions import gcd
import copy
class SegmentTree:
def __init__(self, N, func, I):
self.sz = N
self.func = func
self.I = copy.deepcopy(I)
self.seg = [copy.deepcopy(I) for i in range(self.sz... | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
from fractions import gcd
class SegmentTree:
def __init__(self, N, func, I):
self.sz = N
self.func = func
self.I = I
self.seg = [I] * (self.sz * 2)
def assign(self, k, x):
self.se... | 53 | 52 | 1,440 | 1,324 | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
from fractions import gcd
import copy
class SegmentTree:
def __init__(self, N, func, I):
self.sz = N
self.func = func
self.I = copy.deepcopy(I)
self.seg = [copy.deepcopy(I) for i in range(self.sz * 2)]
... | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
from fractions import gcd
class SegmentTree:
def __init__(self, N, func, I):
self.sz = N
self.func = func
self.I = I
self.seg = [I] * (self.sz * 2)
def assign(self, k, x):
self.seg[k + self.s... | false | 1.886792 | [
"-import copy",
"- self.I = copy.deepcopy(I)",
"- self.seg = [copy.deepcopy(I) for i in range(self.sz * 2)]",
"+ self.I = I",
"+ self.seg = [I] * (self.sz * 2)",
"- self.seg[k + self.sz] = copy.deepcopy(x)",
"+ self.seg[k + self.sz] = x",
"- self.seg[k]... | false | 0.112604 | 0.050738 | 2.219325 | [
"s858772081",
"s506218244"
] |
u883621917 | p04001 | python | s006217075 | s739858692 | 27 | 24 | 3,060 | 3,064 | Accepted | Accepted | 11.11 | s = eval(input())
if len(s) == 1:
print(s)
else:
total = 0
for i in range((2 ** (len(s) - 1))):
bit = format(i, '0{}b'.format(len(s) - 1))
e = ''
for j in range(len(s) - 1):
e += s[j]
if bit[j] == '1':
e += '+'
e += s[-1]
... | s = eval(input())
def bit():
if len(s) == 1:
print(s)
else:
total = 0
for i in range((2 ** (len(s) - 1))):
bit = format(i, '0{}b'.format(len(s) - 1))
e = ''
for j in range(len(s) - 1):
e += s[j]
if bit[j] ==... | 16 | 33 | 358 | 846 | s = eval(input())
if len(s) == 1:
print(s)
else:
total = 0
for i in range((2 ** (len(s) - 1))):
bit = format(i, "0{}b".format(len(s) - 1))
e = ""
for j in range(len(s) - 1):
e += s[j]
if bit[j] == "1":
e += "+"
e += s[-1]
total ... | s = eval(input())
def bit():
if len(s) == 1:
print(s)
else:
total = 0
for i in range((2 ** (len(s) - 1))):
bit = format(i, "0{}b".format(len(s) - 1))
e = ""
for j in range(len(s) - 1):
e += s[j]
if bit[j] == "1":
... | false | 51.515152 | [
"-if len(s) == 1:",
"- print(s)",
"-else:",
"- total = 0",
"- for i in range((2 ** (len(s) - 1))):",
"- bit = format(i, \"0{}b\".format(len(s) - 1))",
"- e = \"\"",
"- for j in range(len(s) - 1):",
"- e += s[j]",
"- if bit[j] == \"1\":",
"- ... | false | 0.046392 | 0.047546 | 0.975721 | [
"s006217075",
"s739858692"
] |
u020373088 | p03495 | python | s328361685 | s518605228 | 142 | 112 | 32,440 | 32,564 | Accepted | Accepted | 21.13 | n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
from collections import Counter
c = Counter(a)
cnts = []
for i, j in list(c.items()):
cnts.append(j)
print((sum(sorted(cnts)[:-k]))) | from collections import Counter
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
cnts = list(Counter(a).values())
print((sum(sorted(cnts)[:-k]))) | 10 | 5 | 206 | 161 | n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
from collections import Counter
c = Counter(a)
cnts = []
for i, j in list(c.items()):
cnts.append(j)
print((sum(sorted(cnts)[:-k])))
| from collections import Counter
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
cnts = list(Counter(a).values())
print((sum(sorted(cnts)[:-k])))
| false | 50 | [
"+from collections import Counter",
"+",
"-from collections import Counter",
"-",
"-c = Counter(a)",
"-cnts = []",
"-for i, j in list(c.items()):",
"- cnts.append(j)",
"+cnts = list(Counter(a).values())"
] | false | 0.045294 | 0.052856 | 0.85694 | [
"s328361685",
"s518605228"
] |
u226155577 | p02913 | python | s154737875 | s731057057 | 91 | 67 | 3,840 | 3,848 | Accepted | Accepted | 26.37 | def solve():
N = int(eval(input()))
S = eval(input())
def rolling_hash(s, mod, base = 37):
l = len(s)
h = [0]*(l + 1)
v = 0
for i in range(l):
h[i+1] = v = (v * base + ord(s[i])) % mod
pw = [1]*(l + 1)
v = 1
for i in range(l):
... | def solve():
N = int(eval(input()))
S = eval(input())
def rolling_hash(s, mod, base = 37):
l = len(s)
h = [0]*(l + 1)
v = 0
for i in range(l):
h[i+1] = v = (v * base + ord(s[i])) % mod
pw = [1]*(l + 1)
v = 1
for i in range(l):
... | 43 | 42 | 1,170 | 1,133 | def solve():
N = int(eval(input()))
S = eval(input())
def rolling_hash(s, mod, base=37):
l = len(s)
h = [0] * (l + 1)
v = 0
for i in range(l):
h[i + 1] = v = (v * base + ord(s[i])) % mod
pw = [1] * (l + 1)
v = 1
for i in range(l):
... | def solve():
N = int(eval(input()))
S = eval(input())
def rolling_hash(s, mod, base=37):
l = len(s)
h = [0] * (l + 1)
v = 0
for i in range(l):
h[i + 1] = v = (v * base + ord(s[i])) % mod
pw = [1] * (l + 1)
v = 1
for i in range(l):
... | false | 2.325581 | [
"- res3 = chk(S, 1004535809)",
"- print((min(res1, res2, res3)))",
"+ print((min(res1, res2)))"
] | false | 0.085414 | 0.068328 | 1.250067 | [
"s154737875",
"s731057057"
] |
u156815136 | p04044 | python | s035642486 | s886383991 | 40 | 36 | 10,424 | 10,352 | Accepted | Accepted | 10 | #from statistics import median
#import collections
#aa = collections.Counter(a) # list to list || .most_common(2)で最大の2個とりだせるお a[0][0]
from fractions import gcd
from itertools import combinations,permutations,accumulate, product # (string,3) 3回
#from collections import deque
from collections import deque,defaultdi... | #from statistics import median
#import collections
#aa = collections.Counter(a) # list to list || .most_common(2)で最大の2個とりだせるお a[0][0]
from math import gcd
from itertools import combinations,permutations,accumulate, product # (string,3) 3回
#from collections import deque
from collections import deque,defaultdict,Co... | 42 | 43 | 1,034 | 1,049 | # from statistics import median
# import collections
# aa = collections.Counter(a) # list to list || .most_common(2)で最大の2個とりだせるお a[0][0]
from fractions import gcd
from itertools import combinations, permutations, accumulate, product # (string,3) 3回
# from collections import deque
from collections import deque, defaul... | # from statistics import median
# import collections
# aa = collections.Counter(a) # list to list || .most_common(2)で最大の2個とりだせるお a[0][0]
from math import gcd
from itertools import combinations, permutations, accumulate, product # (string,3) 3回
# from collections import deque
from collections import deque, defaultdict... | false | 2.325581 | [
"-from fractions import gcd",
"+from math import gcd",
"+import heapq",
"+INF = float(\"inf\")",
"-s = [eval(input()) for _ in range(n)]",
"-s = sorted(s)",
"-print((\"\".join(map(str, s))))",
"+S = sorted([eval(input()) for _ in range(n)])",
"+print((\"\".join(S)))"
] | false | 0.047993 | 0.037157 | 1.291627 | [
"s035642486",
"s886383991"
] |
u205762924 | p02659 | python | s268375179 | s964425890 | 23 | 21 | 9,192 | 9,176 | Accepted | Accepted | 8.7 | C = input().split()
A = int(C[0])
B = int(float(C[1])*100+0.5)
E = A*B
if E < 100:
print((0))
elif E < 200:
print((1))
elif E < 300:
print((2))
else:
F = str(E)
print((F[0:len(F)-2])) | C = input().split()
A = int(C[0])
B = int(float(C[1])*100+0.1)
E = A*B
if E < 100:
print((0))
elif E < 200:
print((1))
elif E < 300:
print((2))
else:
F = str(E)
print((F[0:len(F)-2])) | 20 | 20 | 221 | 221 | C = input().split()
A = int(C[0])
B = int(float(C[1]) * 100 + 0.5)
E = A * B
if E < 100:
print((0))
elif E < 200:
print((1))
elif E < 300:
print((2))
else:
F = str(E)
print((F[0 : len(F) - 2]))
| C = input().split()
A = int(C[0])
B = int(float(C[1]) * 100 + 0.1)
E = A * B
if E < 100:
print((0))
elif E < 200:
print((1))
elif E < 300:
print((2))
else:
F = str(E)
print((F[0 : len(F) - 2]))
| false | 0 | [
"-B = int(float(C[1]) * 100 + 0.5)",
"+B = int(float(C[1]) * 100 + 0.1)"
] | false | 0.007552 | 0.041122 | 0.183653 | [
"s268375179",
"s964425890"
] |
u647766105 | p00011 | python | s585259191 | s413050580 | 20 | 10 | 5,012 | 5,012 | Accepted | Accepted | 50 | w=eval(input())
list=list(range(0,w+1))
n=eval(input())
for i in range(n):
a,b=list(map(int,input().split(',')))
tmp=list[a]
list[a]=list[b]
list[b]=tmp
for i in range(w):
print(list[i+1]) | w=eval(input())
list=list(range(0,w+1))
n=eval(input())
for i in range(n):
a,b=list(map(int,input().split(',')))
tmp=list[a]
list[a]=list[b]
list[b]=tmp
for i in list[1:]:
print(i) | 10 | 10 | 198 | 189 | w = eval(input())
list = list(range(0, w + 1))
n = eval(input())
for i in range(n):
a, b = list(map(int, input().split(",")))
tmp = list[a]
list[a] = list[b]
list[b] = tmp
for i in range(w):
print(list[i + 1])
| w = eval(input())
list = list(range(0, w + 1))
n = eval(input())
for i in range(n):
a, b = list(map(int, input().split(",")))
tmp = list[a]
list[a] = list[b]
list[b] = tmp
for i in list[1:]:
print(i)
| false | 0 | [
"-for i in range(w):",
"- print(list[i + 1])",
"+for i in list[1:]:",
"+ print(i)"
] | false | 0.040645 | 0.038905 | 1.044727 | [
"s585259191",
"s413050580"
] |
u508732591 | p02315 | python | s003800637 | s708018466 | 430 | 370 | 6,660 | 6,660 | Accepted | Accepted | 13.95 | N,W = list(map(int, input().split()))
dp = [0]*(W+1)
temp = [0]*(W+1)
for i in range(1,N+1):
v,w = list(map(int,input().split()))
for j in range(1, W+1):
if w <= j and v + temp[j-w] > temp[j]:
dp[j] = temp[j-w]+v
temp[0:W+1] = dp[0:W+1]
print((dp[W])) | N,W = list(map(int, input().split()))
dp = [0]*(W+1)
temp = [0]*(W+1)
for i in range(1,N+1):
v,w = list(map(int,input().split()))
for j in range(w, W+1):
if v + temp[j-w] > temp[j]:
dp[j] = temp[j-w]+v
temp[0:W+1] = dp[0:W+1]
print((dp[W])) | 12 | 12 | 282 | 271 | N, W = list(map(int, input().split()))
dp = [0] * (W + 1)
temp = [0] * (W + 1)
for i in range(1, N + 1):
v, w = list(map(int, input().split()))
for j in range(1, W + 1):
if w <= j and v + temp[j - w] > temp[j]:
dp[j] = temp[j - w] + v
temp[0 : W + 1] = dp[0 : W + 1]
print((dp[W]))
| N, W = list(map(int, input().split()))
dp = [0] * (W + 1)
temp = [0] * (W + 1)
for i in range(1, N + 1):
v, w = list(map(int, input().split()))
for j in range(w, W + 1):
if v + temp[j - w] > temp[j]:
dp[j] = temp[j - w] + v
temp[0 : W + 1] = dp[0 : W + 1]
print((dp[W]))
| false | 0 | [
"- for j in range(1, W + 1):",
"- if w <= j and v + temp[j - w] > temp[j]:",
"+ for j in range(w, W + 1):",
"+ if v + temp[j - w] > temp[j]:"
] | false | 0.045707 | 0.046847 | 0.975664 | [
"s003800637",
"s708018466"
] |
u421674761 | p02706 | python | s653428592 | s801954244 | 32 | 29 | 10,020 | 10,032 | Accepted | Accepted | 9.38 | n,m = list(map(int,input().split()))
a = list(map(int,input().split()))
for i in range(m):
n -= a[i]
if n < 0:
print((-1))
else:
print(n)
| n,m = list(map(int,input().split()))
a = list(map(int,input().split()))
if n >= sum(a):
print((n-sum(a)))
else:
print((-1))
| 10 | 7 | 153 | 129 | n, m = list(map(int, input().split()))
a = list(map(int, input().split()))
for i in range(m):
n -= a[i]
if n < 0:
print((-1))
else:
print(n)
| n, m = list(map(int, input().split()))
a = list(map(int, input().split()))
if n >= sum(a):
print((n - sum(a)))
else:
print((-1))
| false | 30 | [
"-for i in range(m):",
"- n -= a[i]",
"-if n < 0:",
"+if n >= sum(a):",
"+ print((n - sum(a)))",
"+else:",
"-else:",
"- print(n)"
] | false | 0.048895 | 0.047584 | 1.027559 | [
"s653428592",
"s801954244"
] |
u461833298 | p03673 | python | s837930224 | s243011363 | 209 | 174 | 25,412 | 26,180 | Accepted | Accepted | 16.75 | from collections import deque
N = int(eval(input()))
A = [int(x) for x in input().split()]
if N%2==0:
queue = deque()
for i in range(0, N, 2):
queue.append(A[i])
queue.appendleft(A[i+1])
else:
queue = deque([A[0]])
for i in range(1, N, 2):
queue.append(A[i])
q... | N = int(eval(input()))
A = [int(x) for x in input().split()]
if N&1:
ans = A[::2][::-1] + A[1::2]
else:
ans = A[1::2][::-1] + A[::2]
print((*ans)) | 19 | 7 | 370 | 152 | from collections import deque
N = int(eval(input()))
A = [int(x) for x in input().split()]
if N % 2 == 0:
queue = deque()
for i in range(0, N, 2):
queue.append(A[i])
queue.appendleft(A[i + 1])
else:
queue = deque([A[0]])
for i in range(1, N, 2):
queue.append(A[i])
queue.... | N = int(eval(input()))
A = [int(x) for x in input().split()]
if N & 1:
ans = A[::2][::-1] + A[1::2]
else:
ans = A[1::2][::-1] + A[::2]
print((*ans))
| false | 63.157895 | [
"-from collections import deque",
"-",
"-if N % 2 == 0:",
"- queue = deque()",
"- for i in range(0, N, 2):",
"- queue.append(A[i])",
"- queue.appendleft(A[i + 1])",
"+if N & 1:",
"+ ans = A[::2][::-1] + A[1::2]",
"- queue = deque([A[0]])",
"- for i in range(1, N, 2):... | false | 0.086357 | 0.044568 | 1.937642 | [
"s837930224",
"s243011363"
] |
u886766186 | p01751 | python | s335779887 | s959137272 | 80 | 30 | 7,720 | 7,728 | Accepted | Accepted | 62.5 | def solve(a, b, c):
l = 0; r = a;
for t in range(114514):
t = l // 60
p = 60*t + c
if l <= p <= r:
print(p)
exit()
l = r + b
r = l + a
print((-1))
a, b, c = list(map(int, input().split()))
solve(a,b,c) | def solve(a, b, c):
l = 0; r = a;
for t in range(514):
t = l // 60
p = 60*t + c
if l <= p <= r:
print(p)
exit()
l = r + b
r = l + a
print((-1))
a, b, c = list(map(int, input().split()))
solve(a,b,c) | 16 | 16 | 287 | 284 | def solve(a, b, c):
l = 0
r = a
for t in range(114514):
t = l // 60
p = 60 * t + c
if l <= p <= r:
print(p)
exit()
l = r + b
r = l + a
print((-1))
a, b, c = list(map(int, input().split()))
solve(a, b, c)
| def solve(a, b, c):
l = 0
r = a
for t in range(514):
t = l // 60
p = 60 * t + c
if l <= p <= r:
print(p)
exit()
l = r + b
r = l + a
print((-1))
a, b, c = list(map(int, input().split()))
solve(a, b, c)
| false | 0 | [
"- for t in range(114514):",
"+ for t in range(514):"
] | false | 0.088562 | 0.037857 | 2.3394 | [
"s335779887",
"s959137272"
] |
u050024609 | p03326 | python | s727620823 | s510915171 | 52 | 42 | 3,392 | 4,596 | Accepted | Accepted | 19.23 | [N, M] = list(map(int, input().split()))
a = [list(map(int, input().split())) for i in range(N)]
def v(x, s):
return sum([x[i]*(1 - 2*((s & (1 << i)) >> i)) for i in range(3)])
print((0 if M == 0 else max([sum([v(a[j], s) for j in sorted([i for i in range(N)], key = lambda i : v(a[i], s))[-M:]]) for s in range(8)]... | [N, M] = list(map(int, input().split()))
a = eval('input().split(),'*N)
print((0 if M==0 else max([sum(sorted([sum([int(x[b])*(s>>b&1or-1)for b in range(3)]) for x in a])[-M:])for s in range(8)]))) | 5 | 3 | 315 | 191 | [N, M] = list(map(int, input().split()))
a = [list(map(int, input().split())) for i in range(N)]
def v(x, s):
return sum([x[i] * (1 - 2 * ((s & (1 << i)) >> i)) for i in range(3)])
print(
(
0
if M == 0
else max(
[
sum(
[
... | [N, M] = list(map(int, input().split()))
a = eval("input().split()," * N)
print(
(
0
if M == 0
else max(
[
sum(
sorted(
[
sum([int(x[b]) * (s >> b & 1 or -1) for b in range(3)])
... | false | 40 | [
"-a = [list(map(int, input().split())) for i in range(N)]",
"-",
"-",
"-def v(x, s):",
"- return sum([x[i] * (1 - 2 * ((s & (1 << i)) >> i)) for i in range(3)])",
"-",
"-",
"+a = eval(\"input().split(),\" * N)",
"- [",
"- v(a[j], s)",
"- ... | false | 0.038168 | 0.035747 | 1.067736 | [
"s727620823",
"s510915171"
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.