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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
u279266699
|
p02848
|
python
|
s788654831
|
s453637821
| 37 | 30 | 9,140 | 9,000 |
Accepted
|
Accepted
| 18.92 |
n = int(eval(input()))
S = eval(input())
ans = ''
for s in S:
if ord(s) + n <= 90:
ans += chr(ord(s) + n)
else:
ans += chr(65 + ord(s) + n - 90 - 1)
print(ans)
|
n = int(eval(input()))
S = eval(input())
a = ord('A')
z = ord('Z')
ans = ''
for s in S:
if ord(s) + n <= 90:
ans += chr(ord(s) + n)
else:
ans += chr(a + ord(s) + n - z - 1)
print(ans)
| 9 | 11 | 180 | 206 |
n = int(eval(input()))
S = eval(input())
ans = ""
for s in S:
if ord(s) + n <= 90:
ans += chr(ord(s) + n)
else:
ans += chr(65 + ord(s) + n - 90 - 1)
print(ans)
|
n = int(eval(input()))
S = eval(input())
a = ord("A")
z = ord("Z")
ans = ""
for s in S:
if ord(s) + n <= 90:
ans += chr(ord(s) + n)
else:
ans += chr(a + ord(s) + n - z - 1)
print(ans)
| false | 18.181818 |
[
"+a = ord(\"A\")",
"+z = ord(\"Z\")",
"- ans += chr(65 + ord(s) + n - 90 - 1)",
"+ ans += chr(a + ord(s) + n - z - 1)"
] | false | 0.048633 | 0.037836 | 1.285359 |
[
"s788654831",
"s453637821"
] |
u391875425
|
p03548
|
python
|
s762636968
|
s630153660
| 19 | 17 | 2,940 | 2,940 |
Accepted
|
Accepted
| 10.53 |
X, Y, Z = list(map(int, input().split()))
ans = X//(Y+Z)
if X - ans*(Y+Z) < Z:
print((ans-1))
else:
print(ans)
|
X, Y, Z = list(map(int, input().split()))
print(((X-Z)//(Y+Z)))
| 6 | 2 | 116 | 57 |
X, Y, Z = list(map(int, input().split()))
ans = X // (Y + Z)
if X - ans * (Y + Z) < Z:
print((ans - 1))
else:
print(ans)
|
X, Y, Z = list(map(int, input().split()))
print(((X - Z) // (Y + Z)))
| false | 66.666667 |
[
"-ans = X // (Y + Z)",
"-if X - ans * (Y + Z) < Z:",
"- print((ans - 1))",
"-else:",
"- print(ans)",
"+print(((X - Z) // (Y + Z)))"
] | false | 0.038488 | 0.037323 | 1.031219 |
[
"s762636968",
"s630153660"
] |
u879266613
|
p02899
|
python
|
s654626297
|
s562891448
| 124 | 106 | 19,704 | 13,880 |
Accepted
|
Accepted
| 14.52 |
N = int(eval(input()))
list = list(map(int,input().split()))
dic={}
ans=""
for i in range(N):
dic[list[i]]=i+1
for i in range(1, N+1):
ans += " " + str(dic[i])
print(ans)
|
N = int(eval(input()))
A = list(map(int,input().split()))
ans = [0]*N
for i, a in enumerate(A):
ans[a-1] = i + 1
print((*ans))
| 13 | 7 | 197 | 129 |
N = int(eval(input()))
list = list(map(int, input().split()))
dic = {}
ans = ""
for i in range(N):
dic[list[i]] = i + 1
for i in range(1, N + 1):
ans += " " + str(dic[i])
print(ans)
|
N = int(eval(input()))
A = list(map(int, input().split()))
ans = [0] * N
for i, a in enumerate(A):
ans[a - 1] = i + 1
print((*ans))
| false | 46.153846 |
[
"-list = list(map(int, input().split()))",
"-dic = {}",
"-ans = \"\"",
"-for i in range(N):",
"- dic[list[i]] = i + 1",
"-for i in range(1, N + 1):",
"- ans += \" \" + str(dic[i])",
"-print(ans)",
"+A = list(map(int, input().split()))",
"+ans = [0] * N",
"+for i, a in enumerate(A):",
"+ ans[a - 1] = i + 1",
"+print((*ans))"
] | false | 0.035698 | 0.035598 | 1.002803 |
[
"s654626297",
"s562891448"
] |
u282228874
|
p03039
|
python
|
s074588947
|
s309492092
| 176 | 82 | 11,252 | 10,868 |
Accepted
|
Accepted
| 53.41 |
MOD = 10**9+7
N,M,K = list(map(int,input().split()))
U = N*M
fact = [1]*(U+1)
for i in range(1,U+1):
fact[i] = (fact[i-1]*i)%MOD
def comb(n,k):
x = fact[n]
x *= pow(fact[n-k],MOD-2,MOD)
x %= MOD
x *= pow(fact[k],MOD-2,MOD)
return x
res = 0
for i in range(1,N):
res += i*M*M*(N-i)%MOD
res %= MOD
for i in range(1,M):
res += i*N*N*(M-i)%MOD
res %= MOD
res *= comb(N*M-2,K-2)
res %= MOD
print(res)
|
mod = 10**9 + 7
n,m,k = list(map(int,input().split()))
nm = n*m
f = [1]*(nm+1)
for i in range(1,nm+1):
f[i] = (f[i-1]*i)%mod
def C(n,k):
x = f[n]
x *= pow(f[n-k],mod-2,mod)
x %= mod
x *= pow(f[k],mod-2,mod)
x %= mod
return x
def F(n):
x = n*n*(n+1)//2
y = n*(n+1)*(2*n+1)//6
return (x-y)%mod
res = (m*m%mod*F(n)%mod + n*n%mod*F(m)%mod)%mod
res *= C(n*m-2,k-2)
print((res%mod))
| 28 | 20 | 461 | 427 |
MOD = 10**9 + 7
N, M, K = list(map(int, input().split()))
U = N * M
fact = [1] * (U + 1)
for i in range(1, U + 1):
fact[i] = (fact[i - 1] * i) % MOD
def comb(n, k):
x = fact[n]
x *= pow(fact[n - k], MOD - 2, MOD)
x %= MOD
x *= pow(fact[k], MOD - 2, MOD)
return x
res = 0
for i in range(1, N):
res += i * M * M * (N - i) % MOD
res %= MOD
for i in range(1, M):
res += i * N * N * (M - i) % MOD
res %= MOD
res *= comb(N * M - 2, K - 2)
res %= MOD
print(res)
|
mod = 10**9 + 7
n, m, k = list(map(int, input().split()))
nm = n * m
f = [1] * (nm + 1)
for i in range(1, nm + 1):
f[i] = (f[i - 1] * i) % mod
def C(n, k):
x = f[n]
x *= pow(f[n - k], mod - 2, mod)
x %= mod
x *= pow(f[k], mod - 2, mod)
x %= mod
return x
def F(n):
x = n * n * (n + 1) // 2
y = n * (n + 1) * (2 * n + 1) // 6
return (x - y) % mod
res = (m * m % mod * F(n) % mod + n * n % mod * F(m) % mod) % mod
res *= C(n * m - 2, k - 2)
print((res % mod))
| false | 28.571429 |
[
"-MOD = 10**9 + 7",
"-N, M, K = list(map(int, input().split()))",
"-U = N * M",
"-fact = [1] * (U + 1)",
"-for i in range(1, U + 1):",
"- fact[i] = (fact[i - 1] * i) % MOD",
"+mod = 10**9 + 7",
"+n, m, k = list(map(int, input().split()))",
"+nm = n * m",
"+f = [1] * (nm + 1)",
"+for i in range(1, nm + 1):",
"+ f[i] = (f[i - 1] * i) % mod",
"-def comb(n, k):",
"- x = fact[n]",
"- x *= pow(fact[n - k], MOD - 2, MOD)",
"- x %= MOD",
"- x *= pow(fact[k], MOD - 2, MOD)",
"+def C(n, k):",
"+ x = f[n]",
"+ x *= pow(f[n - k], mod - 2, mod)",
"+ x %= mod",
"+ x *= pow(f[k], mod - 2, mod)",
"+ x %= mod",
"-res = 0",
"-for i in range(1, N):",
"- res += i * M * M * (N - i) % MOD",
"- res %= MOD",
"-for i in range(1, M):",
"- res += i * N * N * (M - i) % MOD",
"- res %= MOD",
"-res *= comb(N * M - 2, K - 2)",
"-res %= MOD",
"-print(res)",
"+def F(n):",
"+ x = n * n * (n + 1) // 2",
"+ y = n * (n + 1) * (2 * n + 1) // 6",
"+ return (x - y) % mod",
"+",
"+",
"+res = (m * m % mod * F(n) % mod + n * n % mod * F(m) % mod) % mod",
"+res *= C(n * m - 2, k - 2)",
"+print((res % mod))"
] | false | 0.083136 | 0.084166 | 0.987766 |
[
"s074588947",
"s309492092"
] |
u606045429
|
p02874
|
python
|
s606904670
|
s371738990
| 334 | 300 | 26,504 | 25,564 |
Accepted
|
Accepted
| 10.18 |
N, *LR = list(map(int, open(0).read().split()))
L, R = LR[::2], LR[1::2]
max_l = max(L)
min_r = min(R)
ab = [(max(0, r - max_l + 1), -max(0, min_r - l + 1)) for l, r in zip(L, R)]
ab.sort()
mi = float("inf")
ma = max(r - l + 1 for l, r in zip(L, R)) + max(0, min_r - max_l + 1)
for i in range(N - 1):
mi = min(mi, -ab[i][1])
ma = max(ma, mi + ab[i + 1][0])
print(ma)
|
N, *LR = list(map(int, open(0).read().split()))
L, R = LR[::2], LR[1::2]
max_l = max(L)
min_r = min(R)
A = sorted(max(0, r - max_l + 1) for r in R)
B = sorted(-max(0, min_r - l + 1) for l in L)
mi = float("inf")
ma = max(r - l + 1 for l, r in zip(L, R)) + max(0, min_r - max_l + 1)
for i in range(N - 1):
mi = min(mi, -B[i])
ma = max(ma, mi + A[i + 1])
print(ma)
| 17 | 17 | 390 | 385 |
N, *LR = list(map(int, open(0).read().split()))
L, R = LR[::2], LR[1::2]
max_l = max(L)
min_r = min(R)
ab = [(max(0, r - max_l + 1), -max(0, min_r - l + 1)) for l, r in zip(L, R)]
ab.sort()
mi = float("inf")
ma = max(r - l + 1 for l, r in zip(L, R)) + max(0, min_r - max_l + 1)
for i in range(N - 1):
mi = min(mi, -ab[i][1])
ma = max(ma, mi + ab[i + 1][0])
print(ma)
|
N, *LR = list(map(int, open(0).read().split()))
L, R = LR[::2], LR[1::2]
max_l = max(L)
min_r = min(R)
A = sorted(max(0, r - max_l + 1) for r in R)
B = sorted(-max(0, min_r - l + 1) for l in L)
mi = float("inf")
ma = max(r - l + 1 for l, r in zip(L, R)) + max(0, min_r - max_l + 1)
for i in range(N - 1):
mi = min(mi, -B[i])
ma = max(ma, mi + A[i + 1])
print(ma)
| false | 0 |
[
"-ab = [(max(0, r - max_l + 1), -max(0, min_r - l + 1)) for l, r in zip(L, R)]",
"-ab.sort()",
"+A = sorted(max(0, r - max_l + 1) for r in R)",
"+B = sorted(-max(0, min_r - l + 1) for l in L)",
"- mi = min(mi, -ab[i][1])",
"- ma = max(ma, mi + ab[i + 1][0])",
"+ mi = min(mi, -B[i])",
"+ ma = max(ma, mi + A[i + 1])"
] | false | 0.046997 | 0.037879 | 1.240724 |
[
"s606904670",
"s371738990"
] |
u279605379
|
p02297
|
python
|
s213895056
|
s711744209
| 30 | 20 | 7,712 | 7,728 |
Accepted
|
Accepted
| 33.33 |
n = int(eval(input()))
P =[]
s = 0
for i in range(n):P.append([int(i) for i in input().split()])
P.append(P[0])
for i in range(n):s += (P[i][0])*P[i+1][1] - (P[i][1])*P[i+1][0]
print((abs(s)*0.5))
|
n = int(eval(input()))
P =[]
s = 0
for i in range(n):P.append([int(i) for i in input().split()])
P.append(P[0])
for i in range(n):s += P[i][0]*P[i+1][1] - P[i][1]*P[i+1][0]
print((s*0.5))
| 7 | 7 | 194 | 185 |
n = int(eval(input()))
P = []
s = 0
for i in range(n):
P.append([int(i) for i in input().split()])
P.append(P[0])
for i in range(n):
s += (P[i][0]) * P[i + 1][1] - (P[i][1]) * P[i + 1][0]
print((abs(s) * 0.5))
|
n = int(eval(input()))
P = []
s = 0
for i in range(n):
P.append([int(i) for i in input().split()])
P.append(P[0])
for i in range(n):
s += P[i][0] * P[i + 1][1] - P[i][1] * P[i + 1][0]
print((s * 0.5))
| false | 0 |
[
"- s += (P[i][0]) * P[i + 1][1] - (P[i][1]) * P[i + 1][0]",
"-print((abs(s) * 0.5))",
"+ s += P[i][0] * P[i + 1][1] - P[i][1] * P[i + 1][0]",
"+print((s * 0.5))"
] | false | 0.073165 | 0.035778 | 2.044956 |
[
"s213895056",
"s711744209"
] |
u135389999
|
p02624
|
python
|
s608093573
|
s439008068
| 2,516 | 2,116 | 9,176 | 9,168 |
Accepted
|
Accepted
| 15.9 |
n = int(eval(input()))
ans = 0
for i in range(1, n + 1):
if i == 1:
ans += sum(range(1,n + 1))
else:
t = n//i
ans += 0.5 * i * t * ( t + 1)
print((int(ans)))
|
n = int(eval(input()))
ans = 0
for i in range(1, n + 1):
t = n//i
ans += 0.5 * i * t * ( t + 1)
print((int(ans)))
| 12 | 9 | 195 | 124 |
n = int(eval(input()))
ans = 0
for i in range(1, n + 1):
if i == 1:
ans += sum(range(1, n + 1))
else:
t = n // i
ans += 0.5 * i * t * (t + 1)
print((int(ans)))
|
n = int(eval(input()))
ans = 0
for i in range(1, n + 1):
t = n // i
ans += 0.5 * i * t * (t + 1)
print((int(ans)))
| false | 25 |
[
"- if i == 1:",
"- ans += sum(range(1, n + 1))",
"- else:",
"- t = n // i",
"- ans += 0.5 * i * t * (t + 1)",
"+ t = n // i",
"+ ans += 0.5 * i * t * (t + 1)"
] | false | 0.80822 | 0.6671 | 1.211543 |
[
"s608093573",
"s439008068"
] |
u102461423
|
p02750
|
python
|
s303038998
|
s947420738
| 1,411 | 516 | 91,920 | 90,152 |
Accepted
|
Accepted
| 63.43 |
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
from functools import cmp_to_key
import itertools
N, T = list(map(int, readline().split()))
m = list(map(int, read().split()))
AB0 = []
AB1 = []
for a,b in zip(m,m):
if a == 0:
AB0.append(b)
else:
AB1.append((a,b))
def sort_func(ab0, ab1):
a0, b0 = ab0
a1, b1 = ab1
return a1*(1+b0) - a0*(1+b1)
AB0.sort()
AB1.sort(key=cmp_to_key(sort_func))
AB0, AB1
def compute_0():
INF = T + 1
dp = [INF] * 40
dp[0] = 0
for a,b in AB1:
for n in range(39, -1, -1):
if dp[n] > T:
continue
x = (dp[n] + 1) * (a + 1) + b
if x < dp[n+1]:
dp[n+1] = x
return dp
def compute_1():
return [0] + list(itertools.accumulate(x + 1 for x in AB0))
dp0 = compute_0()
dp1 = compute_1()
R = len(dp1) - 1
answer = 0
for i,x in enumerate(dp0):
if x > T:
break
while x + dp1[R] > T:
R -= 1
value = i + R
if answer < value:
answer = value
print(answer)
|
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
from functools import cmp_to_key
import itertools
N, T = list(map(int, readline().split()))
m = list(map(int, read().split()))
AB0 = []
AB1 = []
for a,b in zip(m,m):
if a == 0:
AB0.append(b)
else:
AB1.append((a,b))
def sort_func(ab0, ab1):
a0, b0 = ab0
a1, b1 = ab1
return a1*(1+b0) - a0*(1+b1)
AB0.sort()
AB1.sort(key=lambda x: x[0] / (x[1] + 1), reverse=True)
AB0, AB1
def compute_0():
INF = T + 1
dp = [INF] * 40
dp[0] = 0
for a,b in AB1:
for n in range(39, -1, -1):
if dp[n] > T:
continue
x = (dp[n] + 1) * (a + 1) + b
if x < dp[n+1]:
dp[n+1] = x
return dp
def compute_1():
return [0] + list(itertools.accumulate(x + 1 for x in AB0))
dp0 = compute_0()
dp1 = compute_1()
R = len(dp1) - 1
answer = 0
for i,x in enumerate(dp0):
if x > T:
break
while x + dp1[R] > T:
R -= 1
value = i + R
if answer < value:
answer = value
print(answer)
| 58 | 58 | 1,161 | 1,182 |
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
from functools import cmp_to_key
import itertools
N, T = list(map(int, readline().split()))
m = list(map(int, read().split()))
AB0 = []
AB1 = []
for a, b in zip(m, m):
if a == 0:
AB0.append(b)
else:
AB1.append((a, b))
def sort_func(ab0, ab1):
a0, b0 = ab0
a1, b1 = ab1
return a1 * (1 + b0) - a0 * (1 + b1)
AB0.sort()
AB1.sort(key=cmp_to_key(sort_func))
AB0, AB1
def compute_0():
INF = T + 1
dp = [INF] * 40
dp[0] = 0
for a, b in AB1:
for n in range(39, -1, -1):
if dp[n] > T:
continue
x = (dp[n] + 1) * (a + 1) + b
if x < dp[n + 1]:
dp[n + 1] = x
return dp
def compute_1():
return [0] + list(itertools.accumulate(x + 1 for x in AB0))
dp0 = compute_0()
dp1 = compute_1()
R = len(dp1) - 1
answer = 0
for i, x in enumerate(dp0):
if x > T:
break
while x + dp1[R] > T:
R -= 1
value = i + R
if answer < value:
answer = value
print(answer)
|
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
from functools import cmp_to_key
import itertools
N, T = list(map(int, readline().split()))
m = list(map(int, read().split()))
AB0 = []
AB1 = []
for a, b in zip(m, m):
if a == 0:
AB0.append(b)
else:
AB1.append((a, b))
def sort_func(ab0, ab1):
a0, b0 = ab0
a1, b1 = ab1
return a1 * (1 + b0) - a0 * (1 + b1)
AB0.sort()
AB1.sort(key=lambda x: x[0] / (x[1] + 1), reverse=True)
AB0, AB1
def compute_0():
INF = T + 1
dp = [INF] * 40
dp[0] = 0
for a, b in AB1:
for n in range(39, -1, -1):
if dp[n] > T:
continue
x = (dp[n] + 1) * (a + 1) + b
if x < dp[n + 1]:
dp[n + 1] = x
return dp
def compute_1():
return [0] + list(itertools.accumulate(x + 1 for x in AB0))
dp0 = compute_0()
dp1 = compute_1()
R = len(dp1) - 1
answer = 0
for i, x in enumerate(dp0):
if x > T:
break
while x + dp1[R] > T:
R -= 1
value = i + R
if answer < value:
answer = value
print(answer)
| false | 0 |
[
"-AB1.sort(key=cmp_to_key(sort_func))",
"+AB1.sort(key=lambda x: x[0] / (x[1] + 1), reverse=True)"
] | false | 0.037771 | 0.045197 | 0.835709 |
[
"s303038998",
"s947420738"
] |
u279493135
|
p02787
|
python
|
s249531458
|
s950579200
| 1,222 | 540 | 318,428 | 70,488 |
Accepted
|
Accepted
| 55.81 |
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(eval(input()))
def MAP(): return list(map(int, input().split()))
def LIST(): return list(map(int, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7
H, N = MAP()
A, B = [0]*N, [0]*N
for i in range(N):
A[i], B[i] = MAP()
dp = [[INF]*(H+max(A)+1) for _ in range(N+1)]
dp[0][0] = 0
for i in range(N):
for j in range(H+max(A)+1):
if j-A[i] >= 0:
dp[i+1][j] = min(dp[i][j], dp[i+1][j-A[i]]+B[i])
else:
dp[i+1][j] = dp[i][j]
print((min(dp[N][H:])))
|
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(eval(input()))
def MAP(): return list(map(int, input().split()))
def LIST(): return list(map(int, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7
H, N = MAP()
A, B = [0]*N, [0]*N
for i in range(N):
A[i], B[i] = MAP()
max_A = max(A)
dp = [INF]*(H+max_A+1)
dp[0] = 0
for i in range(N):
for j in range(A[i], H+max_A+1):
dp[j] = min(dp[j], dp[j-A[i]]+B[i])
print((min(dp[H:])))
| 36 | 34 | 1,046 | 970 |
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input():
return sys.stdin.readline().strip()
def INT():
return int(eval(input()))
def MAP():
return list(map(int, input().split()))
def LIST():
return list(map(int, input().split()))
sys.setrecursionlimit(10**9)
INF = float("inf")
mod = 10**9 + 7
H, N = MAP()
A, B = [0] * N, [0] * N
for i in range(N):
A[i], B[i] = MAP()
dp = [[INF] * (H + max(A) + 1) for _ in range(N + 1)]
dp[0][0] = 0
for i in range(N):
for j in range(H + max(A) + 1):
if j - A[i] >= 0:
dp[i + 1][j] = min(dp[i][j], dp[i + 1][j - A[i]] + B[i])
else:
dp[i + 1][j] = dp[i][j]
print((min(dp[N][H:])))
|
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input():
return sys.stdin.readline().strip()
def INT():
return int(eval(input()))
def MAP():
return list(map(int, input().split()))
def LIST():
return list(map(int, input().split()))
sys.setrecursionlimit(10**9)
INF = float("inf")
mod = 10**9 + 7
H, N = MAP()
A, B = [0] * N, [0] * N
for i in range(N):
A[i], B[i] = MAP()
max_A = max(A)
dp = [INF] * (H + max_A + 1)
dp[0] = 0
for i in range(N):
for j in range(A[i], H + max_A + 1):
dp[j] = min(dp[j], dp[j - A[i]] + B[i])
print((min(dp[H:])))
| false | 5.555556 |
[
"-dp = [[INF] * (H + max(A) + 1) for _ in range(N + 1)]",
"-dp[0][0] = 0",
"+max_A = max(A)",
"+dp = [INF] * (H + max_A + 1)",
"+dp[0] = 0",
"- for j in range(H + max(A) + 1):",
"- if j - A[i] >= 0:",
"- dp[i + 1][j] = min(dp[i][j], dp[i + 1][j - A[i]] + B[i])",
"- else:",
"- dp[i + 1][j] = dp[i][j]",
"-print((min(dp[N][H:])))",
"+ for j in range(A[i], H + max_A + 1):",
"+ dp[j] = min(dp[j], dp[j - A[i]] + B[i])",
"+print((min(dp[H:])))"
] | false | 0.125687 | 0.067488 | 1.862366 |
[
"s249531458",
"s950579200"
] |
u223133214
|
p03286
|
python
|
s036024655
|
s214902631
| 19 | 17 | 2,940 | 2,940 |
Accepted
|
Accepted
| 10.53 |
N = int(eval(input()))
ans = []
num = 0
while True:
if N % (2**(num + 1)) == 0:
b = 0
else:
b = 1
ans.append(str(b))
N = N - ((-2)**num) * b
num += 1
if N == 0:
break
print((''.join(ans[::-1])))
|
N = int(eval(input()))
a = ''
n = 0
while N != 0:
b = '0' if N % (2**(n + 1)) == 0 else '1'
a += b
N -= ((-2)**n) * int(b)
n += 1
print((a[::-1] if a else 0))
| 15 | 9 | 250 | 175 |
N = int(eval(input()))
ans = []
num = 0
while True:
if N % (2 ** (num + 1)) == 0:
b = 0
else:
b = 1
ans.append(str(b))
N = N - ((-2) ** num) * b
num += 1
if N == 0:
break
print(("".join(ans[::-1])))
|
N = int(eval(input()))
a = ""
n = 0
while N != 0:
b = "0" if N % (2 ** (n + 1)) == 0 else "1"
a += b
N -= ((-2) ** n) * int(b)
n += 1
print((a[::-1] if a else 0))
| false | 40 |
[
"-ans = []",
"-num = 0",
"-while True:",
"- if N % (2 ** (num + 1)) == 0:",
"- b = 0",
"- else:",
"- b = 1",
"- ans.append(str(b))",
"- N = N - ((-2) ** num) * b",
"- num += 1",
"- if N == 0:",
"- break",
"-print((\"\".join(ans[::-1])))",
"+a = \"\"",
"+n = 0",
"+while N != 0:",
"+ b = \"0\" if N % (2 ** (n + 1)) == 0 else \"1\"",
"+ a += b",
"+ N -= ((-2) ** n) * int(b)",
"+ n += 1",
"+print((a[::-1] if a else 0))"
] | false | 0.063226 | 0.043879 | 1.44093 |
[
"s036024655",
"s214902631"
] |
u543954314
|
p02854
|
python
|
s449043349
|
s481265071
| 210 | 181 | 26,056 | 26,024 |
Accepted
|
Accepted
| 13.81 |
n = int(eval(input()))
a = list(map(int,input().split()))
for i in range(1,n):
a[i] += a[i-1]
c = a[-1]
for i in range(n):
c = min(c, abs(a[-1]-a[i]*2))
print(c)
|
n = int(eval(input()))
a = list(map(int,input().split()))
for i in range(1,n):
a[i] += a[i-1]
c = a[-1]
for i in range(n):
p = abs(a[-1]-a[i]*2)
if c > p:
c = p
print(c)
| 10 | 10 | 175 | 195 |
n = int(eval(input()))
a = list(map(int, input().split()))
for i in range(1, n):
a[i] += a[i - 1]
c = a[-1]
for i in range(n):
c = min(c, abs(a[-1] - a[i] * 2))
print(c)
|
n = int(eval(input()))
a = list(map(int, input().split()))
for i in range(1, n):
a[i] += a[i - 1]
c = a[-1]
for i in range(n):
p = abs(a[-1] - a[i] * 2)
if c > p:
c = p
print(c)
| false | 0 |
[
"- c = min(c, abs(a[-1] - a[i] * 2))",
"+ p = abs(a[-1] - a[i] * 2)",
"+ if c > p:",
"+ c = p"
] | false | 0.040899 | 0.068247 | 0.59928 |
[
"s449043349",
"s481265071"
] |
u785578220
|
p03038
|
python
|
s842589147
|
s064519819
| 738 | 571 | 24,520 | 26,732 |
Accepted
|
Accepted
| 22.63 |
import heapq
N,M=list(map(int,input().split()))
A = list(map(int,input().split()))
heapq.heapify(A)
l = []
for i in range(M):
tmp = list(map(int,input().split()))
l.append([tmp[1],tmp[0]])
l.sort(reverse=True)
for i,j in l:
for I in range(j):
Q = heapq.heappop(A)
if Q<i :
heapq.heappush(A,i)
else:
heapq.heappush(A,Q)
break
# print(A)
print((sum(A)))
|
N,M=list(map(int,input().split()))
A = list(map(int,input().split()))
l = []
for i in range(M):
tmp = list(map(int,input().split()))
l.append([tmp[1],tmp[0]])
l.sort(reverse=True)
for i,j in l:
A.extend([i]*j)
if len(A)>2*N:break
A.sort(reverse=True)
print((sum(A[:N])))
| 21 | 12 | 402 | 286 |
import heapq
N, M = list(map(int, input().split()))
A = list(map(int, input().split()))
heapq.heapify(A)
l = []
for i in range(M):
tmp = list(map(int, input().split()))
l.append([tmp[1], tmp[0]])
l.sort(reverse=True)
for i, j in l:
for I in range(j):
Q = heapq.heappop(A)
if Q < i:
heapq.heappush(A, i)
else:
heapq.heappush(A, Q)
break
# print(A)
print((sum(A)))
|
N, M = list(map(int, input().split()))
A = list(map(int, input().split()))
l = []
for i in range(M):
tmp = list(map(int, input().split()))
l.append([tmp[1], tmp[0]])
l.sort(reverse=True)
for i, j in l:
A.extend([i] * j)
if len(A) > 2 * N:
break
A.sort(reverse=True)
print((sum(A[:N])))
| false | 42.857143 |
[
"-import heapq",
"-",
"-heapq.heapify(A)",
"- for I in range(j):",
"- Q = heapq.heappop(A)",
"- if Q < i:",
"- heapq.heappush(A, i)",
"- else:",
"- heapq.heappush(A, Q)",
"- break",
"-# print(A)",
"-print((sum(A)))",
"+ A.extend([i] * j)",
"+ if len(A) > 2 * N:",
"+ break",
"+A.sort(reverse=True)",
"+print((sum(A[:N])))"
] | false | 0.040814 | 0.037094 | 1.100276 |
[
"s842589147",
"s064519819"
] |
u941407962
|
p02626
|
python
|
s901192495
|
s251921715
| 75 | 64 | 67,000 | 61,960 |
Accepted
|
Accepted
| 14.67 |
from functools import lru_cache
N, = list(map(int, input().split()))
X = list(map(int, input().split()))
t = 0
for x in X:
t = t^x
inf = float('inf')
@lru_cache(None)
def it(x, y, z):
xm, ym, zm = x%2, y%2, z%2
if xm ^ ym != zm:
return inf
if x^y == z:
return 0
Rz = 2*it(x>>1, y>>1, z>>1)
Ro = inf
if x:
Ro = 2*it((x-1)>>1, (y+1)>>1, z>>1)+1
Rz = min(Rz, Ro)
return Rz
r = it(X[0], X[1], t^X[0]^X[1])
if 0 <= r < X[0]:
print(r)
else:
print((-1))
|
import sys
N, = list(map(int, input().split()))
X = list(map(int, input().split()))
S = X[0]+X[1]
T = 0
for i in range(2, N):
T ^= X[i]
if S<T or (S-T)%2:
print((-1))
sys.exit()
D = (S-T)//2
if D&T:
print((-1))
sys.exit()
M = T.bit_length()+1
if D > X[0]:
print((-1))
sys.exit()
Y = 0
for i in range(M, -1, -1):
if T & (1<<i) and ((1<<i)|Y)^D <= X[0]:
Y = (1<<i)|Y
if Y^D == 0:
print((-1))
else:
print((X[0]-(Y^D)))
| 26 | 26 | 533 | 473 |
from functools import lru_cache
(N,) = list(map(int, input().split()))
X = list(map(int, input().split()))
t = 0
for x in X:
t = t ^ x
inf = float("inf")
@lru_cache(None)
def it(x, y, z):
xm, ym, zm = x % 2, y % 2, z % 2
if xm ^ ym != zm:
return inf
if x ^ y == z:
return 0
Rz = 2 * it(x >> 1, y >> 1, z >> 1)
Ro = inf
if x:
Ro = 2 * it((x - 1) >> 1, (y + 1) >> 1, z >> 1) + 1
Rz = min(Rz, Ro)
return Rz
r = it(X[0], X[1], t ^ X[0] ^ X[1])
if 0 <= r < X[0]:
print(r)
else:
print((-1))
|
import sys
(N,) = list(map(int, input().split()))
X = list(map(int, input().split()))
S = X[0] + X[1]
T = 0
for i in range(2, N):
T ^= X[i]
if S < T or (S - T) % 2:
print((-1))
sys.exit()
D = (S - T) // 2
if D & T:
print((-1))
sys.exit()
M = T.bit_length() + 1
if D > X[0]:
print((-1))
sys.exit()
Y = 0
for i in range(M, -1, -1):
if T & (1 << i) and ((1 << i) | Y) ^ D <= X[0]:
Y = (1 << i) | Y
if Y ^ D == 0:
print((-1))
else:
print((X[0] - (Y ^ D)))
| false | 0 |
[
"-from functools import lru_cache",
"+import sys",
"-t = 0",
"-for x in X:",
"- t = t ^ x",
"-inf = float(\"inf\")",
"-",
"-",
"-@lru_cache(None)",
"-def it(x, y, z):",
"- xm, ym, zm = x % 2, y % 2, z % 2",
"- if xm ^ ym != zm:",
"- return inf",
"- if x ^ y == z:",
"- return 0",
"- Rz = 2 * it(x >> 1, y >> 1, z >> 1)",
"- Ro = inf",
"- if x:",
"- Ro = 2 * it((x - 1) >> 1, (y + 1) >> 1, z >> 1) + 1",
"- Rz = min(Rz, Ro)",
"- return Rz",
"-",
"-",
"-r = it(X[0], X[1], t ^ X[0] ^ X[1])",
"-if 0 <= r < X[0]:",
"- print(r)",
"+S = X[0] + X[1]",
"+T = 0",
"+for i in range(2, N):",
"+ T ^= X[i]",
"+if S < T or (S - T) % 2:",
"+ print((-1))",
"+ sys.exit()",
"+D = (S - T) // 2",
"+if D & T:",
"+ print((-1))",
"+ sys.exit()",
"+M = T.bit_length() + 1",
"+if D > X[0]:",
"+ print((-1))",
"+ sys.exit()",
"+Y = 0",
"+for i in range(M, -1, -1):",
"+ if T & (1 << i) and ((1 << i) | Y) ^ D <= X[0]:",
"+ Y = (1 << i) | Y",
"+if Y ^ D == 0:",
"+ print((-1))",
"- print((-1))",
"+ print((X[0] - (Y ^ D)))"
] | false | 0.049265 | 0.046923 | 1.049905 |
[
"s901192495",
"s251921715"
] |
u664610890
|
p03013
|
python
|
s259262701
|
s707644890
| 492 | 186 | 51,180 | 7,832 |
Accepted
|
Accepted
| 62.2 |
N, M = list(map(int, input().split()))
a = []
stair = [1 for i in range(N+1)]
for i in range(M):
stair[int(eval(input()))] = 0
dp = [0 for i in range(N+2)]
dp[1] = 1
MOD = 1000000007
for i in range(2, N+2):
if stair[i-1] == 1:
dp[i] = (dp[i-1] + dp[i-2]) % MOD
print((dp[N+1]))
|
N, M = list(map(int, input().split()))
a = []
stair = [1 for i in range(N+2)]
for i in range(M):
stair[int(eval(input()))] = 0
dp = [0 for i in range(N+2)]
dp[0] = 1
MOD = 1000000007
for i in range(1, N+1):
if stair[i] == 1:
if i == 1:
dp[i] = dp[i - 1] % MOD
else:
dp[i] = (dp[i-1] % MOD + dp[i-2] % MOD) % MOD
print((dp[N]))
| 17 | 19 | 301 | 383 |
N, M = list(map(int, input().split()))
a = []
stair = [1 for i in range(N + 1)]
for i in range(M):
stair[int(eval(input()))] = 0
dp = [0 for i in range(N + 2)]
dp[1] = 1
MOD = 1000000007
for i in range(2, N + 2):
if stair[i - 1] == 1:
dp[i] = (dp[i - 1] + dp[i - 2]) % MOD
print((dp[N + 1]))
|
N, M = list(map(int, input().split()))
a = []
stair = [1 for i in range(N + 2)]
for i in range(M):
stair[int(eval(input()))] = 0
dp = [0 for i in range(N + 2)]
dp[0] = 1
MOD = 1000000007
for i in range(1, N + 1):
if stair[i] == 1:
if i == 1:
dp[i] = dp[i - 1] % MOD
else:
dp[i] = (dp[i - 1] % MOD + dp[i - 2] % MOD) % MOD
print((dp[N]))
| false | 10.526316 |
[
"-stair = [1 for i in range(N + 1)]",
"+stair = [1 for i in range(N + 2)]",
"-dp[1] = 1",
"+dp[0] = 1",
"-for i in range(2, N + 2):",
"- if stair[i - 1] == 1:",
"- dp[i] = (dp[i - 1] + dp[i - 2]) % MOD",
"-print((dp[N + 1]))",
"+for i in range(1, N + 1):",
"+ if stair[i] == 1:",
"+ if i == 1:",
"+ dp[i] = dp[i - 1] % MOD",
"+ else:",
"+ dp[i] = (dp[i - 1] % MOD + dp[i - 2] % MOD) % MOD",
"+print((dp[N]))"
] | false | 0.054001 | 0.036103 | 1.495755 |
[
"s259262701",
"s707644890"
] |
u729133443
|
p03221
|
python
|
s951516936
|
s813517543
| 1,282 | 941 | 92,960 | 49,684 |
Accepted
|
Accepted
| 26.6 |
I=lambda:list(map(int,input().split()))
n,m=I()
l=[[]for _ in range(n+1)]
for i in range(m):
p,y=I()
l[p].append([y,i])
a=[]
for p in range(1,n+1):
l[p].sort()
for i,t in enumerate(l[p]):
a.append([t[1],'%06d'%p+'%06d'%-~i])
a.sort()
for t in a:
print((t[1]))
|
I=lambda:list(map(int,input().split()));n,m=I();l=[[]for _ in[0]*-~n];a=[]
for i in range(m):p,y=I();l[p].append([y,i])
for p in range(1,n+1):
for i,t in enumerate(sorted(l[p])):a.append([t[1],'%06d'%p+'%06d'%-~i])
for t in sorted(a):print((t[1]))
| 14 | 5 | 278 | 244 |
I = lambda: list(map(int, input().split()))
n, m = I()
l = [[] for _ in range(n + 1)]
for i in range(m):
p, y = I()
l[p].append([y, i])
a = []
for p in range(1, n + 1):
l[p].sort()
for i, t in enumerate(l[p]):
a.append([t[1], "%06d" % p + "%06d" % -~i])
a.sort()
for t in a:
print((t[1]))
|
I = lambda: list(map(int, input().split()))
n, m = I()
l = [[] for _ in [0] * -~n]
a = []
for i in range(m):
p, y = I()
l[p].append([y, i])
for p in range(1, n + 1):
for i, t in enumerate(sorted(l[p])):
a.append([t[1], "%06d" % p + "%06d" % -~i])
for t in sorted(a):
print((t[1]))
| false | 64.285714 |
[
"-l = [[] for _ in range(n + 1)]",
"+l = [[] for _ in [0] * -~n]",
"+a = []",
"-a = []",
"- l[p].sort()",
"- for i, t in enumerate(l[p]):",
"+ for i, t in enumerate(sorted(l[p])):",
"-a.sort()",
"-for t in a:",
"+for t in sorted(a):"
] | false | 0.04287 | 0.098106 | 0.436972 |
[
"s951516936",
"s813517543"
] |
u845573105
|
p02580
|
python
|
s923438333
|
s440267536
| 1,283 | 710 | 272,488 | 213,784 |
Accepted
|
Accepted
| 44.66 |
H, W, M = list(map(int, input().split()))
countH = [[h, 0] for h in range(H)]
countW = [[w, 0] for w in range(W)]
Bh = {}
for i in range(M):
h, w = list(map(int, input().split()))
h, w = h-1, w-1
if h in Bh:
Bh[h].add(w)
else:
Bh[h] = {w}
countH[h][1] += 1
countW[w][1] += 1
countH.sort(reverse=True, key=lambda x: x[1])
countW.sort(reverse=True, key=lambda x: x[1])
#print(countH)
#print(countW)
#rint(Bh)
maxh = countH[0][1]
maxw = countW[0][1]
ans = maxh + maxw
ch = [countH[0][0]]
i = 1
while i < H and countH[i][1]==maxh:
ch.append(countH[i][0])
i += 1
cw = [countW[0][0]]
i = 1
while i < W and countW[i][1]==maxw:
cw.append(countW[i][0])
i += 1
flag = False
for h in ch:
for w in cw:
#print(h,w)
if w not in Bh[h]:
flag = True
break
if flag:
print(ans)
else:
print((ans-1))
|
H, W, M = list(map(int, input().split()))
countH = [0 for h in range(H)]
countW = [0 for w in range(W)]
Bh = {}
for i in range(M):
h, w = list(map(int, input().split()))
h, w = h-1, w-1
if h in Bh:
Bh[h].add(w)
else:
Bh[h] = {w}
countH[h] += 1
countW[w] += 1
maxh = 0
ch = []
maxw = 0
cw = []
for i in range(H):
if maxh==countH[i]:
ch.append(i)
elif maxh<countH[i]:
ch = [i]
maxh = countH[i]
for i in range(W):
if maxw==countW[i]:
cw.append(i)
elif maxw<countW[i]:
cw = [i]
maxw = countW[i]
#print(countH)
#print(countW)
#rint(Bh)
ans = maxh + maxw
flag = False
for h in ch:
for w in cw:
#print(h,w)
if w not in Bh[h]:
flag = True
break
if flag:
print(ans)
else:
print((ans-1))
| 45 | 47 | 866 | 790 |
H, W, M = list(map(int, input().split()))
countH = [[h, 0] for h in range(H)]
countW = [[w, 0] for w in range(W)]
Bh = {}
for i in range(M):
h, w = list(map(int, input().split()))
h, w = h - 1, w - 1
if h in Bh:
Bh[h].add(w)
else:
Bh[h] = {w}
countH[h][1] += 1
countW[w][1] += 1
countH.sort(reverse=True, key=lambda x: x[1])
countW.sort(reverse=True, key=lambda x: x[1])
# print(countH)
# print(countW)
# rint(Bh)
maxh = countH[0][1]
maxw = countW[0][1]
ans = maxh + maxw
ch = [countH[0][0]]
i = 1
while i < H and countH[i][1] == maxh:
ch.append(countH[i][0])
i += 1
cw = [countW[0][0]]
i = 1
while i < W and countW[i][1] == maxw:
cw.append(countW[i][0])
i += 1
flag = False
for h in ch:
for w in cw:
# print(h,w)
if w not in Bh[h]:
flag = True
break
if flag:
print(ans)
else:
print((ans - 1))
|
H, W, M = list(map(int, input().split()))
countH = [0 for h in range(H)]
countW = [0 for w in range(W)]
Bh = {}
for i in range(M):
h, w = list(map(int, input().split()))
h, w = h - 1, w - 1
if h in Bh:
Bh[h].add(w)
else:
Bh[h] = {w}
countH[h] += 1
countW[w] += 1
maxh = 0
ch = []
maxw = 0
cw = []
for i in range(H):
if maxh == countH[i]:
ch.append(i)
elif maxh < countH[i]:
ch = [i]
maxh = countH[i]
for i in range(W):
if maxw == countW[i]:
cw.append(i)
elif maxw < countW[i]:
cw = [i]
maxw = countW[i]
# print(countH)
# print(countW)
# rint(Bh)
ans = maxh + maxw
flag = False
for h in ch:
for w in cw:
# print(h,w)
if w not in Bh[h]:
flag = True
break
if flag:
print(ans)
else:
print((ans - 1))
| false | 4.255319 |
[
"-countH = [[h, 0] for h in range(H)]",
"-countW = [[w, 0] for w in range(W)]",
"+countH = [0 for h in range(H)]",
"+countW = [0 for w in range(W)]",
"- countH[h][1] += 1",
"- countW[w][1] += 1",
"-countH.sort(reverse=True, key=lambda x: x[1])",
"-countW.sort(reverse=True, key=lambda x: x[1])",
"+ countH[h] += 1",
"+ countW[w] += 1",
"+maxh = 0",
"+ch = []",
"+maxw = 0",
"+cw = []",
"+for i in range(H):",
"+ if maxh == countH[i]:",
"+ ch.append(i)",
"+ elif maxh < countH[i]:",
"+ ch = [i]",
"+ maxh = countH[i]",
"+for i in range(W):",
"+ if maxw == countW[i]:",
"+ cw.append(i)",
"+ elif maxw < countW[i]:",
"+ cw = [i]",
"+ maxw = countW[i]",
"-maxh = countH[0][1]",
"-maxw = countW[0][1]",
"-ch = [countH[0][0]]",
"-i = 1",
"-while i < H and countH[i][1] == maxh:",
"- ch.append(countH[i][0])",
"- i += 1",
"-cw = [countW[0][0]]",
"-i = 1",
"-while i < W and countW[i][1] == maxw:",
"- cw.append(countW[i][0])",
"- i += 1"
] | false | 0.058385 | 0.052528 | 1.1115 |
[
"s923438333",
"s440267536"
] |
u638456847
|
p03476
|
python
|
s711331630
|
s210178984
| 1,059 | 181 | 18,248 | 25,588 |
Accepted
|
Accepted
| 82.91 |
import math
import numpy as np
n = 10**5 + 1
p = [False] * n
c = [0] * n
def main():
# 2からnまでの数字をsearch_listに入れる
search_list = list(range(2,n))
while True:
# search_listの先頭の値が√nの値を超えたら処理終了
if search_list[0] > math.sqrt(n):
# search_listの残りの素数フラグを立てる
for num in search_list:
p[num] = True
break
else:
# search_listの先頭の素数フラグを立てる
tmp = search_list[0]
p[tmp] = True
# search_listの先頭をpopする
search_list.pop(0)
# search_listの先頭の倍数を取り除く
search_list = [num for num in search_list if num % tmp != 0]
# 1以上i以下のN-like数の数をc[i]とする
for i in range(1,n):
if p[i] and p[(i+1)//2]:
c[i] = c[i-1] + 1
else:
c[i] = c[i-1]
Q = int(eval(input()))
for i in range(Q):
l, r = list(map(int, input().split()))
print((c[r] - c[l-1]))
if __name__ == "__main__":
main()
|
from math import ceil, sqrt
from itertools import accumulate
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
def eratosthenes(n):
p = [] # n以下の素数リスト
t = [-1] * n # t_iの素因数の内最小のもの
t[0] = 0
t[1] = 0
for i in range(2, ceil(sqrt(n))):
if t[i] == -1:
p.append(i)
#t[i] = i
for j in range(2*i, n, i):
if t[j] == -1:
t[j] = i
for j in range(i+1, n):
if t[j] == -1:
p.append(j)
#t[j] = j
return p, t
def main():
Q,*lr = list(map(int, read().split()))
P, T = eratosthenes(10**5+5)
table2017 = [0] * (10**5+5)
for p in P:
if T[(p+1)//2] == -1:
table2017[p] = 1
acc = list(accumulate(table2017))
for l, r in zip(*[iter(lr)]*2):
print((acc[r] - acc[l-1]))
if __name__ == "__main__":
main()
| 42 | 45 | 1,025 | 980 |
import math
import numpy as np
n = 10**5 + 1
p = [False] * n
c = [0] * n
def main():
# 2からnまでの数字をsearch_listに入れる
search_list = list(range(2, n))
while True:
# search_listの先頭の値が√nの値を超えたら処理終了
if search_list[0] > math.sqrt(n):
# search_listの残りの素数フラグを立てる
for num in search_list:
p[num] = True
break
else:
# search_listの先頭の素数フラグを立てる
tmp = search_list[0]
p[tmp] = True
# search_listの先頭をpopする
search_list.pop(0)
# search_listの先頭の倍数を取り除く
search_list = [num for num in search_list if num % tmp != 0]
# 1以上i以下のN-like数の数をc[i]とする
for i in range(1, n):
if p[i] and p[(i + 1) // 2]:
c[i] = c[i - 1] + 1
else:
c[i] = c[i - 1]
Q = int(eval(input()))
for i in range(Q):
l, r = list(map(int, input().split()))
print((c[r] - c[l - 1]))
if __name__ == "__main__":
main()
|
from math import ceil, sqrt
from itertools import accumulate
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
def eratosthenes(n):
p = [] # n以下の素数リスト
t = [-1] * n # t_iの素因数の内最小のもの
t[0] = 0
t[1] = 0
for i in range(2, ceil(sqrt(n))):
if t[i] == -1:
p.append(i)
# t[i] = i
for j in range(2 * i, n, i):
if t[j] == -1:
t[j] = i
for j in range(i + 1, n):
if t[j] == -1:
p.append(j)
# t[j] = j
return p, t
def main():
Q, *lr = list(map(int, read().split()))
P, T = eratosthenes(10**5 + 5)
table2017 = [0] * (10**5 + 5)
for p in P:
if T[(p + 1) // 2] == -1:
table2017[p] = 1
acc = list(accumulate(table2017))
for l, r in zip(*[iter(lr)] * 2):
print((acc[r] - acc[l - 1]))
if __name__ == "__main__":
main()
| false | 6.666667 |
[
"-import math",
"-import numpy as np",
"+from math import ceil, sqrt",
"+from itertools import accumulate",
"+import sys",
"-n = 10**5 + 1",
"-p = [False] * n",
"-c = [0] * n",
"+read = sys.stdin.read",
"+readline = sys.stdin.readline",
"+readlines = sys.stdin.readlines",
"+",
"+",
"+def eratosthenes(n):",
"+ p = [] # n以下の素数リスト",
"+ t = [-1] * n # t_iの素因数の内最小のもの",
"+ t[0] = 0",
"+ t[1] = 0",
"+ for i in range(2, ceil(sqrt(n))):",
"+ if t[i] == -1:",
"+ p.append(i)",
"+ # t[i] = i",
"+ for j in range(2 * i, n, i):",
"+ if t[j] == -1:",
"+ t[j] = i",
"+ for j in range(i + 1, n):",
"+ if t[j] == -1:",
"+ p.append(j)",
"+ # t[j] = j",
"+ return p, t",
"- # 2からnまでの数字をsearch_listに入れる",
"- search_list = list(range(2, n))",
"- while True:",
"- # search_listの先頭の値が√nの値を超えたら処理終了",
"- if search_list[0] > math.sqrt(n):",
"- # search_listの残りの素数フラグを立てる",
"- for num in search_list:",
"- p[num] = True",
"- break",
"- else:",
"- # search_listの先頭の素数フラグを立てる",
"- tmp = search_list[0]",
"- p[tmp] = True",
"- # search_listの先頭をpopする",
"- search_list.pop(0)",
"- # search_listの先頭の倍数を取り除く",
"- search_list = [num for num in search_list if num % tmp != 0]",
"- # 1以上i以下のN-like数の数をc[i]とする",
"- for i in range(1, n):",
"- if p[i] and p[(i + 1) // 2]:",
"- c[i] = c[i - 1] + 1",
"- else:",
"- c[i] = c[i - 1]",
"- Q = int(eval(input()))",
"- for i in range(Q):",
"- l, r = list(map(int, input().split()))",
"- print((c[r] - c[l - 1]))",
"+ Q, *lr = list(map(int, read().split()))",
"+ P, T = eratosthenes(10**5 + 5)",
"+ table2017 = [0] * (10**5 + 5)",
"+ for p in P:",
"+ if T[(p + 1) // 2] == -1:",
"+ table2017[p] = 1",
"+ acc = list(accumulate(table2017))",
"+ for l, r in zip(*[iter(lr)] * 2):",
"+ print((acc[r] - acc[l - 1]))"
] | false | 0.19483 | 0.107268 | 1.816286 |
[
"s711331630",
"s210178984"
] |
u309120194
|
p02910
|
python
|
s655544468
|
s567028514
| 29 | 25 | 9,052 | 8,928 |
Accepted
|
Accepted
| 13.79 |
S = eval(input())
N = len(S)
# 1,3,...文字目が'R'でも'U'でも'D'でもない、または、2,4,...文字目が'L'でも'U'でも'D'でもないとき、'No'を出力する
ans = 'Yes'
for i in range(N):
if (i % 2 == 0 and S[i] != 'R' and S[i] != 'U' and S[i] != 'D') or (i % 2 == 1 and S[i] != 'L' and S[i] != 'U' and S[i] != 'D'):
ans = 'No'
break
print(ans)
|
S = eval(input())
# Sの各文字は'L', 'R', 'U', 'D'のいずれかであることに注意する
# 1,3,...文字目が'L'でなく、偶数文字目が'R'でないとき 'Yes'とする
N = len(S)
ans = 'Yes'
for i in range(N):
if (i % 2 == 0 and S[i] == 'L') or (i % 2 == 1 and S[i] == 'R'):
ans = 'No'
break
print(ans)
| 11 | 12 | 312 | 260 |
S = eval(input())
N = len(S)
# 1,3,...文字目が'R'でも'U'でも'D'でもない、または、2,4,...文字目が'L'でも'U'でも'D'でもないとき、'No'を出力する
ans = "Yes"
for i in range(N):
if (i % 2 == 0 and S[i] != "R" and S[i] != "U" and S[i] != "D") or (
i % 2 == 1 and S[i] != "L" and S[i] != "U" and S[i] != "D"
):
ans = "No"
break
print(ans)
|
S = eval(input())
# Sの各文字は'L', 'R', 'U', 'D'のいずれかであることに注意する
# 1,3,...文字目が'L'でなく、偶数文字目が'R'でないとき 'Yes'とする
N = len(S)
ans = "Yes"
for i in range(N):
if (i % 2 == 0 and S[i] == "L") or (i % 2 == 1 and S[i] == "R"):
ans = "No"
break
print(ans)
| false | 8.333333 |
[
"+# Sの各文字は'L', 'R', 'U', 'D'のいずれかであることに注意する",
"+# 1,3,...文字目が'L'でなく、偶数文字目が'R'でないとき 'Yes'とする",
"-# 1,3,...文字目が'R'でも'U'でも'D'でもない、または、2,4,...文字目が'L'でも'U'でも'D'でもないとき、'No'を出力する",
"- if (i % 2 == 0 and S[i] != \"R\" and S[i] != \"U\" and S[i] != \"D\") or (",
"- i % 2 == 1 and S[i] != \"L\" and S[i] != \"U\" and S[i] != \"D\"",
"- ):",
"+ if (i % 2 == 0 and S[i] == \"L\") or (i % 2 == 1 and S[i] == \"R\"):"
] | false | 0.100577 | 0.060709 | 1.656704 |
[
"s655544468",
"s567028514"
] |
u537782349
|
p03605
|
python
|
s133589539
|
s150146200
| 20 | 17 | 3,060 | 2,940 |
Accepted
|
Accepted
| 15 |
a = eval(input())
for i in range(len(a)):
if a[i] == "9":
print("Yes")
exit()
print("No")
|
a = eval(input())
print(("Yes" if a[0] == "9" or a[1] == "9" else "No"))
| 6 | 2 | 109 | 66 |
a = eval(input())
for i in range(len(a)):
if a[i] == "9":
print("Yes")
exit()
print("No")
|
a = eval(input())
print(("Yes" if a[0] == "9" or a[1] == "9" else "No"))
| false | 66.666667 |
[
"-for i in range(len(a)):",
"- if a[i] == \"9\":",
"- print(\"Yes\")",
"- exit()",
"-print(\"No\")",
"+print((\"Yes\" if a[0] == \"9\" or a[1] == \"9\" else \"No\"))"
] | false | 0.042543 | 0.042802 | 0.99395 |
[
"s133589539",
"s150146200"
] |
u340781749
|
p02873
|
python
|
s307959038
|
s879285695
| 384 | 189 | 75,564 | 8,328 |
Accepted
|
Accepted
| 50.78 |
s = eval(input())
n = len(s) + 1
ans = [0] * n
tmp = 1
ens = list(enumerate(s))
for i, c in ens:
if c == '<':
ans[i + 1] = tmp
tmp += 1
else:
tmp = 1
tmp = 1
for i, c in reversed(ens):
if c == '>':
ans[i] = max(ans[i], tmp)
tmp += 1
else:
tmp = 1
print((sum(ans)))
|
import itertools
s = eval(input())
rlc = [len(list(itr)) for _, itr in itertools.groupby(s)]
for i in range(s[0] == '>', len(rlc) - 1, 2):
if rlc[i] < rlc[i + 1]:
rlc[i] -= 1
else:
rlc[i + 1] -= 1
print((sum(l * (l + 1) // 2 for l in rlc)))
| 21 | 11 | 343 | 269 |
s = eval(input())
n = len(s) + 1
ans = [0] * n
tmp = 1
ens = list(enumerate(s))
for i, c in ens:
if c == "<":
ans[i + 1] = tmp
tmp += 1
else:
tmp = 1
tmp = 1
for i, c in reversed(ens):
if c == ">":
ans[i] = max(ans[i], tmp)
tmp += 1
else:
tmp = 1
print((sum(ans)))
|
import itertools
s = eval(input())
rlc = [len(list(itr)) for _, itr in itertools.groupby(s)]
for i in range(s[0] == ">", len(rlc) - 1, 2):
if rlc[i] < rlc[i + 1]:
rlc[i] -= 1
else:
rlc[i + 1] -= 1
print((sum(l * (l + 1) // 2 for l in rlc)))
| false | 47.619048 |
[
"+import itertools",
"+",
"-n = len(s) + 1",
"-ans = [0] * n",
"-tmp = 1",
"-ens = list(enumerate(s))",
"-for i, c in ens:",
"- if c == \"<\":",
"- ans[i + 1] = tmp",
"- tmp += 1",
"+rlc = [len(list(itr)) for _, itr in itertools.groupby(s)]",
"+for i in range(s[0] == \">\", len(rlc) - 1, 2):",
"+ if rlc[i] < rlc[i + 1]:",
"+ rlc[i] -= 1",
"- tmp = 1",
"-tmp = 1",
"-for i, c in reversed(ens):",
"- if c == \">\":",
"- ans[i] = max(ans[i], tmp)",
"- tmp += 1",
"- else:",
"- tmp = 1",
"-print((sum(ans)))",
"+ rlc[i + 1] -= 1",
"+print((sum(l * (l + 1) // 2 for l in rlc)))"
] | false | 0.06084 | 0.042989 | 1.415225 |
[
"s307959038",
"s879285695"
] |
u075836834
|
p00586
|
python
|
s398108285
|
s899842666
| 30 | 20 | 7,536 | 7,656 |
Accepted
|
Accepted
| 33.33 |
import sys
for line in sys.stdin.readlines():
data=line.split()
print((int(data[0])+int(data[1])))
#print(eval(data[0]+"+"+data[1]))
|
while True:
try:
x,y=list(map(int,input().split()))
print((x+y))
except EOFError:
break
| 5 | 6 | 137 | 92 |
import sys
for line in sys.stdin.readlines():
data = line.split()
print((int(data[0]) + int(data[1])))
# print(eval(data[0]+"+"+data[1]))
|
while True:
try:
x, y = list(map(int, input().split()))
print((x + y))
except EOFError:
break
| false | 16.666667 |
[
"-import sys",
"-",
"-for line in sys.stdin.readlines():",
"- data = line.split()",
"- print((int(data[0]) + int(data[1])))",
"- # print(eval(data[0]+\"+\"+data[1]))",
"+while True:",
"+ try:",
"+ x, y = list(map(int, input().split()))",
"+ print((x + y))",
"+ except EOFError:",
"+ break"
] | false | 0.040615 | 0.04074 | 0.996943 |
[
"s398108285",
"s899842666"
] |
u754022296
|
p02559
|
python
|
s434317285
|
s322490239
| 634 | 572 | 126,908 | 125,836 |
Accepted
|
Accepted
| 9.78 |
class BIT():
__slots__ = ["n", "data"]
def __init__(self, li):
self.n = len(li) + 1
self.data = [0] + li
for i in range(1, self.n):
if i + (i & -i) < self.n:
self.data[i + (i & -i)] += self.data[i]
def add(self, i, a):
i += 1
while i < self.n:
self.data[i] += a
i += i & -i
def acc(self, i):
res = 0
while i > 0:
res += self.data[i]
i -= i & -i
return res
def fold(self, l, r):
return self.acc(r) - self.acc(l)
import sys
input = sys.stdin.buffer.readline
n, q = list(map(int, input().split()))
A = list(map(int, input().split()))
bit = BIT(A)
for _ in range(q):
t, p, x = list(map(int, input().split()))
if t == 0:
bit.add(p, x)
else:
print((bit.fold(p, x)))
|
class BIT():
__slots__ = ["n", "data"]
def __init__(self, li):
self.n = len(li) + 1
self.data = [0] + li
for i in range(1, self.n):
if i + (i & -i) < self.n:
self.data[i + (i & -i)] += self.data[i]
def add(self, i, a):
i += 1
while i < self.n:
self.data[i] += a
i += i & -i
def acc(self, i):
res = 0
while i > 0:
res += self.data[i]
i -= i & -i
return res
def fold(self, l, r):
res = 0
while l < r:
res += self.data[r]
r -= r & -r
while r < l:
res -= self.data[l]
l -= l & -l
return res
import sys
input = sys.stdin.buffer.readline
n, q = list(map(int, input().split()))
A = list(map(int, input().split()))
bit = BIT(A)
for _ in range(q):
t, p, x = list(map(int, input().split()))
if t == 0:
bit.add(p, x)
else:
print((bit.fold(p, x)))
| 38 | 45 | 896 | 1,051 |
class BIT:
__slots__ = ["n", "data"]
def __init__(self, li):
self.n = len(li) + 1
self.data = [0] + li
for i in range(1, self.n):
if i + (i & -i) < self.n:
self.data[i + (i & -i)] += self.data[i]
def add(self, i, a):
i += 1
while i < self.n:
self.data[i] += a
i += i & -i
def acc(self, i):
res = 0
while i > 0:
res += self.data[i]
i -= i & -i
return res
def fold(self, l, r):
return self.acc(r) - self.acc(l)
import sys
input = sys.stdin.buffer.readline
n, q = list(map(int, input().split()))
A = list(map(int, input().split()))
bit = BIT(A)
for _ in range(q):
t, p, x = list(map(int, input().split()))
if t == 0:
bit.add(p, x)
else:
print((bit.fold(p, x)))
|
class BIT:
__slots__ = ["n", "data"]
def __init__(self, li):
self.n = len(li) + 1
self.data = [0] + li
for i in range(1, self.n):
if i + (i & -i) < self.n:
self.data[i + (i & -i)] += self.data[i]
def add(self, i, a):
i += 1
while i < self.n:
self.data[i] += a
i += i & -i
def acc(self, i):
res = 0
while i > 0:
res += self.data[i]
i -= i & -i
return res
def fold(self, l, r):
res = 0
while l < r:
res += self.data[r]
r -= r & -r
while r < l:
res -= self.data[l]
l -= l & -l
return res
import sys
input = sys.stdin.buffer.readline
n, q = list(map(int, input().split()))
A = list(map(int, input().split()))
bit = BIT(A)
for _ in range(q):
t, p, x = list(map(int, input().split()))
if t == 0:
bit.add(p, x)
else:
print((bit.fold(p, x)))
| false | 15.555556 |
[
"- return self.acc(r) - self.acc(l)",
"+ res = 0",
"+ while l < r:",
"+ res += self.data[r]",
"+ r -= r & -r",
"+ while r < l:",
"+ res -= self.data[l]",
"+ l -= l & -l",
"+ return res"
] | false | 0.044216 | 0.044858 | 0.98568 |
[
"s434317285",
"s322490239"
] |
u098223184
|
p03331
|
python
|
s351989141
|
s653706960
| 133 | 117 | 9,176 | 9,092 |
Accepted
|
Accepted
| 12.03 |
n=int(eval(input()))
ans=10e5
for a in range(1,n//2+1):
b=n-a
ans=min(ans,sum([int(i) for i in str(a)])+sum([int(i) for i in str(b)]))
print((int(ans)))
|
n=int(eval(input()))
ans=10e5
for a in range(1,n//2+1):
b=n-a
ans=min(ans,sum(map(int,str(a)))+sum(map(int,str(b))))
print((int(ans)))
| 6 | 6 | 158 | 140 |
n = int(eval(input()))
ans = 10e5
for a in range(1, n // 2 + 1):
b = n - a
ans = min(ans, sum([int(i) for i in str(a)]) + sum([int(i) for i in str(b)]))
print((int(ans)))
|
n = int(eval(input()))
ans = 10e5
for a in range(1, n // 2 + 1):
b = n - a
ans = min(ans, sum(map(int, str(a))) + sum(map(int, str(b))))
print((int(ans)))
| false | 0 |
[
"- ans = min(ans, sum([int(i) for i in str(a)]) + sum([int(i) for i in str(b)]))",
"+ ans = min(ans, sum(map(int, str(a))) + sum(map(int, str(b))))"
] | false | 0.09691 | 0.073463 | 1.319163 |
[
"s351989141",
"s653706960"
] |
u157020659
|
p02665
|
python
|
s401557754
|
s017870593
| 122 | 110 | 22,376 | 22,244 |
Accepted
|
Accepted
| 9.84 |
n = int(eval(input()))
a = list(map(int, input().split()))
a_min = [0] * (n + 1)
a_min[n] = a[n]
for i in range(n - 1, -1, -1):
a_min[i] = a[i] + a_min[i + 1]
b = [1]
for i in range(n):
tmp = b[i] - a[i]
b.append(min(tmp * 2, a_min[i + 1]))
if tmp < 1 or tmp * 2 < a[i + 1]:
print((-1))
break
else:
if n == 0:
ans = 1 if a[0] == 1 else -1
print(ans)
else:
print((sum(b)))
|
n = int(eval(input()))
a = list(map(int, input().split()))
a_min = [0] * (n + 1)
a_min[n] = a[n]
for i in range(n - 1, -1, -1):
a_min[i] = a[i] + a_min[i + 1]
b = [1]
for i in range(n):
tmp = b[i] - a[i]
b.append(min(tmp * 2, a_min[i + 1]))
if tmp < 1:
print((-1))
break
else:
if b[n] != a[n]:
print((-1))
else:
print((sum(b)))
| 20 | 19 | 446 | 391 |
n = int(eval(input()))
a = list(map(int, input().split()))
a_min = [0] * (n + 1)
a_min[n] = a[n]
for i in range(n - 1, -1, -1):
a_min[i] = a[i] + a_min[i + 1]
b = [1]
for i in range(n):
tmp = b[i] - a[i]
b.append(min(tmp * 2, a_min[i + 1]))
if tmp < 1 or tmp * 2 < a[i + 1]:
print((-1))
break
else:
if n == 0:
ans = 1 if a[0] == 1 else -1
print(ans)
else:
print((sum(b)))
|
n = int(eval(input()))
a = list(map(int, input().split()))
a_min = [0] * (n + 1)
a_min[n] = a[n]
for i in range(n - 1, -1, -1):
a_min[i] = a[i] + a_min[i + 1]
b = [1]
for i in range(n):
tmp = b[i] - a[i]
b.append(min(tmp * 2, a_min[i + 1]))
if tmp < 1:
print((-1))
break
else:
if b[n] != a[n]:
print((-1))
else:
print((sum(b)))
| false | 5 |
[
"- if tmp < 1 or tmp * 2 < a[i + 1]:",
"+ if tmp < 1:",
"- if n == 0:",
"- ans = 1 if a[0] == 1 else -1",
"- print(ans)",
"+ if b[n] != a[n]:",
"+ print((-1))"
] | false | 0.038692 | 0.03871 | 0.999546 |
[
"s401557754",
"s017870593"
] |
u759412327
|
p02946
|
python
|
s406253567
|
s267888375
| 30 | 25 | 9,140 | 9,092 |
Accepted
|
Accepted
| 16.67 |
K,X = list(map(int,input().split()))
print((*[n for n in range(1+X-K,X+K)]))
|
K,X = list(map(int,input().split()))
print((*list(range(1+X-K,X+K))))
| 2 | 2 | 69 | 56 |
K, X = list(map(int, input().split()))
print((*[n for n in range(1 + X - K, X + K)]))
|
K, X = list(map(int, input().split()))
print((*list(range(1 + X - K, X + K))))
| false | 0 |
[
"-print((*[n for n in range(1 + X - K, X + K)]))",
"+print((*list(range(1 + X - K, X + K))))"
] | false | 0.039185 | 0.039564 | 0.99042 |
[
"s406253567",
"s267888375"
] |
u002459665
|
p02743
|
python
|
s026806072
|
s268368992
| 34 | 17 | 5,076 | 2,940 |
Accepted
|
Accepted
| 50 |
a, b, c = list(map(int, input().split()))
# from math import sqrt
import decimal
a2 = decimal.Decimal(a)
b2 = decimal.Decimal(b)
c2 = decimal.Decimal(c)
a2 = a2.sqrt()
b2 = b2.sqrt()
c2 = c2.sqrt()
# if sqrt(a) + sqrt(b) < sqrt(c):
# print('Yes')
# else:
# print('No')
if a2 + b2 < c2:
print('Yes')
else:
print('No')
|
a, b, c = list(map(int, input().split()))
if c - a - b > 0 and 4 * a * b < (c - a - b) ** 2:
print('Yes')
else:
print('No')
| 23 | 6 | 360 | 137 |
a, b, c = list(map(int, input().split()))
# from math import sqrt
import decimal
a2 = decimal.Decimal(a)
b2 = decimal.Decimal(b)
c2 = decimal.Decimal(c)
a2 = a2.sqrt()
b2 = b2.sqrt()
c2 = c2.sqrt()
# if sqrt(a) + sqrt(b) < sqrt(c):
# print('Yes')
# else:
# print('No')
if a2 + b2 < c2:
print("Yes")
else:
print("No")
|
a, b, c = list(map(int, input().split()))
if c - a - b > 0 and 4 * a * b < (c - a - b) ** 2:
print("Yes")
else:
print("No")
| false | 73.913043 |
[
"-# from math import sqrt",
"-import decimal",
"-",
"-a2 = decimal.Decimal(a)",
"-b2 = decimal.Decimal(b)",
"-c2 = decimal.Decimal(c)",
"-a2 = a2.sqrt()",
"-b2 = b2.sqrt()",
"-c2 = c2.sqrt()",
"-# if sqrt(a) + sqrt(b) < sqrt(c):",
"-# print('Yes')",
"-# else:",
"-# print('No')",
"-if a2 + b2 < c2:",
"+if c - a - b > 0 and 4 * a * b < (c - a - b) ** 2:"
] | false | 0.041416 | 0.070668 | 0.586068 |
[
"s026806072",
"s268368992"
] |
u938812966
|
p03546
|
python
|
s688292569
|
s362164287
| 38 | 30 | 3,064 | 3,064 |
Accepted
|
Accepted
| 21.05 |
H,W=list(map(int,input().split()))
c=[list(map(int,input().split())) for _ in range(10)]
for k in range(10):
for i in range(10):
for j in range(10):
c[i][j] = min(c[i][j], c[i][k] + c[k][j])
ans = 0
for _ in range(H):
for x in input().split():
x = int(x)
if x != -1:
ans += c[x][1]
print(ans)
|
H,W=list(map(int,input().split()))
c=[list(map(int,input().split())) for _ in range(10)]
for k in range(10):
for i in range(10):
for j in range(10):
c[i][j] = min(c[i][j], c[i][k] + c[k][j])
ans = 0
for _ in range(H):
ans += sum([c[x][1] for x in map(int,input().split()) if x != -1])
print(ans)
| 15 | 13 | 317 | 312 |
H, W = list(map(int, input().split()))
c = [list(map(int, input().split())) for _ in range(10)]
for k in range(10):
for i in range(10):
for j in range(10):
c[i][j] = min(c[i][j], c[i][k] + c[k][j])
ans = 0
for _ in range(H):
for x in input().split():
x = int(x)
if x != -1:
ans += c[x][1]
print(ans)
|
H, W = list(map(int, input().split()))
c = [list(map(int, input().split())) for _ in range(10)]
for k in range(10):
for i in range(10):
for j in range(10):
c[i][j] = min(c[i][j], c[i][k] + c[k][j])
ans = 0
for _ in range(H):
ans += sum([c[x][1] for x in map(int, input().split()) if x != -1])
print(ans)
| false | 13.333333 |
[
"- for x in input().split():",
"- x = int(x)",
"- if x != -1:",
"- ans += c[x][1]",
"+ ans += sum([c[x][1] for x in map(int, input().split()) if x != -1])"
] | false | 0.044436 | 0.043429 | 1.023182 |
[
"s688292569",
"s362164287"
] |
u073852194
|
p03682
|
python
|
s679151380
|
s504031130
| 1,892 | 1,370 | 127,512 | 125,648 |
Accepted
|
Accepted
| 27.59 |
import sys
input = sys.stdin.readline
class UnionFind():
def __init__(self, n):
self.n = n
self.parents = [-1] * n
def find(self, x):
if self.parents[x] < 0:
return x
else:
self.parents[x] = self.find(self.parents[x])
return self.parents[x]
def union(self, x, y):
x = self.find(x)
y = self.find(y)
if x == y:
return
if self.parents[x] > self.parents[y]:
x, y = y, x
self.parents[x] += self.parents[y]
self.parents[y] = x
def size(self, x):
return -self.parents[self.find(x)]
def same(self, x, y):
return self.find(x) == self.find(y)
N = int(eval(input()))
town = [list(map(int,input().split()))+[i] for i in range(N)]
townx = sorted(town)
towny = sorted(town,key = lambda t : t[1])
road = []
for i in range(N-1):
road.append([abs(townx[i][0]-townx[i+1][0]),townx[i][2],townx[i+1][2]])
road.append([abs(towny[i][1]-towny[i+1][1]),towny[i][2],towny[i+1][2]])
road.sort()
uf = UnionFind(N)
ans = 0
for r in road:
cost,t1,t2 = r
if uf.same(t1,t2):
continue
uf.union(t1,t2)
ans += cost
print(ans)
|
class Graph(): #non-directed
def __init__(self, n, edge, indexed=1):
self.n = n
self.edge = edge
self.indexed = indexed
self.graph = [[] for _ in range(n)]
for e in edge:
self.graph[e[0] - indexed].append((e[1] - indexed, e[2]))
self.graph[e[1] - indexed].append((e[0] - indexed, e[2]))
def kruskal(self): #UnionFind
edgemap = {self.edge[i]: i for i in range(len(self.edge))}
sortedge = sorted(self.edge, key=lambda x: x[2])
#sortedge = reversed(sortedge) コストの最大化
uf = UnionFind(self.n)
res = 0
restored = []
for e in sortedge:
if uf.find(e[0] - self.indexed) != uf.find(e[1] - self.indexed):
res += e[2]
restored.append(edgemap[e])
uf.unite(e[0] - self.indexed, e[1] - self.indexed)
return res, restored
class UnionFind():
def __init__(self, n):
self.n = n
self.parents = [i for i in range(n)]
self.rank = [0 for _ in range(n)]
self.size = [1 for _ in range(n)]
def find(self, x):
root = x
while self.parents[root] != root:
root = self.parents[root]
while self.parents[x] != root:
parent = self.parents[x]
self.parents[x] = root
x = parent
return root
def unite(self, x, y):
xroot = self.find(x)
yroot = self.find(y)
if xroot == yroot: return
xrank = self.rank[xroot]
yrank = self.rank[yroot]
if xrank < yrank:
self.parents[xroot] = yroot
self.size[yroot] += self.size[xroot]
elif xrank == yrank:
self.parents[yroot] = xroot
self.rank[yroot] += 1
self.size[xroot] += self.size[yroot]
else:
self.parents[yroot] = xroot
self.size[xroot] += self.size[yroot]
import sys
input = sys.stdin.readline
N = int(eval(input()))
T = []
for i in range(N):
x, y = list(map(int, input().split()))
T.append((x, y, i))
sort_by_x = sorted(T, key=lambda x: x[0])
sort_by_y = sorted(T, key=lambda x: x[1])
E = []
for i in range(N - 1):
x1, y1, id1 = sort_by_x[i]
x2, y2 ,id2 = sort_by_x[i + 1]
E.append((id1, id2, min(abs(x1 - x2), abs(y1 - y2))))
x1, y1, id1 = sort_by_y[i]
x2, y2 ,id2 = sort_by_y[i + 1]
E.append((id1, id2, min(abs(x1 - x2), abs(y1 - y2))))
g = Graph(N, E)
print((g.kruskal()[0]))
| 52 | 84 | 1,257 | 2,562 |
import sys
input = sys.stdin.readline
class UnionFind:
def __init__(self, n):
self.n = n
self.parents = [-1] * n
def find(self, x):
if self.parents[x] < 0:
return x
else:
self.parents[x] = self.find(self.parents[x])
return self.parents[x]
def union(self, x, y):
x = self.find(x)
y = self.find(y)
if x == y:
return
if self.parents[x] > self.parents[y]:
x, y = y, x
self.parents[x] += self.parents[y]
self.parents[y] = x
def size(self, x):
return -self.parents[self.find(x)]
def same(self, x, y):
return self.find(x) == self.find(y)
N = int(eval(input()))
town = [list(map(int, input().split())) + [i] for i in range(N)]
townx = sorted(town)
towny = sorted(town, key=lambda t: t[1])
road = []
for i in range(N - 1):
road.append([abs(townx[i][0] - townx[i + 1][0]), townx[i][2], townx[i + 1][2]])
road.append([abs(towny[i][1] - towny[i + 1][1]), towny[i][2], towny[i + 1][2]])
road.sort()
uf = UnionFind(N)
ans = 0
for r in road:
cost, t1, t2 = r
if uf.same(t1, t2):
continue
uf.union(t1, t2)
ans += cost
print(ans)
|
class Graph: # non-directed
def __init__(self, n, edge, indexed=1):
self.n = n
self.edge = edge
self.indexed = indexed
self.graph = [[] for _ in range(n)]
for e in edge:
self.graph[e[0] - indexed].append((e[1] - indexed, e[2]))
self.graph[e[1] - indexed].append((e[0] - indexed, e[2]))
def kruskal(self): # UnionFind
edgemap = {self.edge[i]: i for i in range(len(self.edge))}
sortedge = sorted(self.edge, key=lambda x: x[2])
# sortedge = reversed(sortedge) コストの最大化
uf = UnionFind(self.n)
res = 0
restored = []
for e in sortedge:
if uf.find(e[0] - self.indexed) != uf.find(e[1] - self.indexed):
res += e[2]
restored.append(edgemap[e])
uf.unite(e[0] - self.indexed, e[1] - self.indexed)
return res, restored
class UnionFind:
def __init__(self, n):
self.n = n
self.parents = [i for i in range(n)]
self.rank = [0 for _ in range(n)]
self.size = [1 for _ in range(n)]
def find(self, x):
root = x
while self.parents[root] != root:
root = self.parents[root]
while self.parents[x] != root:
parent = self.parents[x]
self.parents[x] = root
x = parent
return root
def unite(self, x, y):
xroot = self.find(x)
yroot = self.find(y)
if xroot == yroot:
return
xrank = self.rank[xroot]
yrank = self.rank[yroot]
if xrank < yrank:
self.parents[xroot] = yroot
self.size[yroot] += self.size[xroot]
elif xrank == yrank:
self.parents[yroot] = xroot
self.rank[yroot] += 1
self.size[xroot] += self.size[yroot]
else:
self.parents[yroot] = xroot
self.size[xroot] += self.size[yroot]
import sys
input = sys.stdin.readline
N = int(eval(input()))
T = []
for i in range(N):
x, y = list(map(int, input().split()))
T.append((x, y, i))
sort_by_x = sorted(T, key=lambda x: x[0])
sort_by_y = sorted(T, key=lambda x: x[1])
E = []
for i in range(N - 1):
x1, y1, id1 = sort_by_x[i]
x2, y2, id2 = sort_by_x[i + 1]
E.append((id1, id2, min(abs(x1 - x2), abs(y1 - y2))))
x1, y1, id1 = sort_by_y[i]
x2, y2, id2 = sort_by_y[i + 1]
E.append((id1, id2, min(abs(x1 - x2), abs(y1 - y2))))
g = Graph(N, E)
print((g.kruskal()[0]))
| false | 38.095238 |
[
"-import sys",
"+class Graph: # non-directed",
"+ def __init__(self, n, edge, indexed=1):",
"+ self.n = n",
"+ self.edge = edge",
"+ self.indexed = indexed",
"+ self.graph = [[] for _ in range(n)]",
"+ for e in edge:",
"+ self.graph[e[0] - indexed].append((e[1] - indexed, e[2]))",
"+ self.graph[e[1] - indexed].append((e[0] - indexed, e[2]))",
"-input = sys.stdin.readline",
"+ def kruskal(self): # UnionFind",
"+ edgemap = {self.edge[i]: i for i in range(len(self.edge))}",
"+ sortedge = sorted(self.edge, key=lambda x: x[2])",
"+ # sortedge = reversed(sortedge) コストの最大化",
"+ uf = UnionFind(self.n)",
"+ res = 0",
"+ restored = []",
"+ for e in sortedge:",
"+ if uf.find(e[0] - self.indexed) != uf.find(e[1] - self.indexed):",
"+ res += e[2]",
"+ restored.append(edgemap[e])",
"+ uf.unite(e[0] - self.indexed, e[1] - self.indexed)",
"+ return res, restored",
"- self.parents = [-1] * n",
"+ self.parents = [i for i in range(n)]",
"+ self.rank = [0 for _ in range(n)]",
"+ self.size = [1 for _ in range(n)]",
"- if self.parents[x] < 0:",
"- return x",
"+ root = x",
"+ while self.parents[root] != root:",
"+ root = self.parents[root]",
"+ while self.parents[x] != root:",
"+ parent = self.parents[x]",
"+ self.parents[x] = root",
"+ x = parent",
"+ return root",
"+",
"+ def unite(self, x, y):",
"+ xroot = self.find(x)",
"+ yroot = self.find(y)",
"+ if xroot == yroot:",
"+ return",
"+ xrank = self.rank[xroot]",
"+ yrank = self.rank[yroot]",
"+ if xrank < yrank:",
"+ self.parents[xroot] = yroot",
"+ self.size[yroot] += self.size[xroot]",
"+ elif xrank == yrank:",
"+ self.parents[yroot] = xroot",
"+ self.rank[yroot] += 1",
"+ self.size[xroot] += self.size[yroot]",
"- self.parents[x] = self.find(self.parents[x])",
"- return self.parents[x]",
"-",
"- def union(self, x, y):",
"- x = self.find(x)",
"- y = self.find(y)",
"- if x == y:",
"- return",
"- if self.parents[x] > self.parents[y]:",
"- x, y = y, x",
"- self.parents[x] += self.parents[y]",
"- self.parents[y] = x",
"-",
"- def size(self, x):",
"- return -self.parents[self.find(x)]",
"-",
"- def same(self, x, y):",
"- return self.find(x) == self.find(y)",
"+ self.parents[yroot] = xroot",
"+ self.size[xroot] += self.size[yroot]",
"+import sys",
"+",
"+input = sys.stdin.readline",
"-town = [list(map(int, input().split())) + [i] for i in range(N)]",
"-townx = sorted(town)",
"-towny = sorted(town, key=lambda t: t[1])",
"-road = []",
"+T = []",
"+for i in range(N):",
"+ x, y = list(map(int, input().split()))",
"+ T.append((x, y, i))",
"+sort_by_x = sorted(T, key=lambda x: x[0])",
"+sort_by_y = sorted(T, key=lambda x: x[1])",
"+E = []",
"- road.append([abs(townx[i][0] - townx[i + 1][0]), townx[i][2], townx[i + 1][2]])",
"- road.append([abs(towny[i][1] - towny[i + 1][1]), towny[i][2], towny[i + 1][2]])",
"-road.sort()",
"-uf = UnionFind(N)",
"-ans = 0",
"-for r in road:",
"- cost, t1, t2 = r",
"- if uf.same(t1, t2):",
"- continue",
"- uf.union(t1, t2)",
"- ans += cost",
"-print(ans)",
"+ x1, y1, id1 = sort_by_x[i]",
"+ x2, y2, id2 = sort_by_x[i + 1]",
"+ E.append((id1, id2, min(abs(x1 - x2), abs(y1 - y2))))",
"+ x1, y1, id1 = sort_by_y[i]",
"+ x2, y2, id2 = sort_by_y[i + 1]",
"+ E.append((id1, id2, min(abs(x1 - x2), abs(y1 - y2))))",
"+g = Graph(N, E)",
"+print((g.kruskal()[0]))"
] | false | 0.042333 | 0.040706 | 1.039986 |
[
"s679151380",
"s504031130"
] |
u918601425
|
p02623
|
python
|
s131609820
|
s698452031
| 1,518 | 292 | 61,228 | 48,940 |
Accepted
|
Accepted
| 80.76 |
N,M,K=[int(s) for s in input().split()]
A=[int(s) for s in input().split()]
B=[int(s) for s in input().split()]
Asum=[0 for i in range(N+1)]
Bsum=[0 for i in range(M+1)]
for i in range(N):
Asum[i+1]=Asum[i]+A[i]
for i in range(M):
Bsum[i+1]=Bsum[i]+B[i]
def nibu(x):
time=set()
for i in range(0,N+1):
if i>x:
break
if x-i>M:
continue
time.add(Asum[i]+Bsum[x-i])
if min(time)<=K:
return True
else:
return False
nibu_l=0
nibu_r=N+M
while nibu_r-nibu_l>1:
c=(nibu_l+nibu_r)//2
if nibu(c)==True:
nibu_l=c
else:
nibu_r=c
if nibu(nibu_r)==True:
print(nibu_r)
else:
print(nibu_l)
|
import bisect
N,M,K=[int(s) for s in input().split()]
A=[int(s) for s in input().split()]
B=[int(s) for s in input().split()]
Asum=[0 for i in range(N+1)]
Bsum=[0 for i in range(M+1)]
for i in range(N):
Asum[i+1]=Asum[i]+A[i]
for i in range(M):
Bsum[i+1]=Bsum[i]+B[i]
ans=[0 for i in range(N+1)]
t=bisect.bisect_right(Bsum,K)-1
ans[0]=t
for i in range(1,N+1):
if Asum[i]>K:
break
while Bsum[t]+Asum[i]>K:
t-=1
ans[i]=i+t
print((max(ans)))
| 35 | 22 | 672 | 480 |
N, M, K = [int(s) for s in input().split()]
A = [int(s) for s in input().split()]
B = [int(s) for s in input().split()]
Asum = [0 for i in range(N + 1)]
Bsum = [0 for i in range(M + 1)]
for i in range(N):
Asum[i + 1] = Asum[i] + A[i]
for i in range(M):
Bsum[i + 1] = Bsum[i] + B[i]
def nibu(x):
time = set()
for i in range(0, N + 1):
if i > x:
break
if x - i > M:
continue
time.add(Asum[i] + Bsum[x - i])
if min(time) <= K:
return True
else:
return False
nibu_l = 0
nibu_r = N + M
while nibu_r - nibu_l > 1:
c = (nibu_l + nibu_r) // 2
if nibu(c) == True:
nibu_l = c
else:
nibu_r = c
if nibu(nibu_r) == True:
print(nibu_r)
else:
print(nibu_l)
|
import bisect
N, M, K = [int(s) for s in input().split()]
A = [int(s) for s in input().split()]
B = [int(s) for s in input().split()]
Asum = [0 for i in range(N + 1)]
Bsum = [0 for i in range(M + 1)]
for i in range(N):
Asum[i + 1] = Asum[i] + A[i]
for i in range(M):
Bsum[i + 1] = Bsum[i] + B[i]
ans = [0 for i in range(N + 1)]
t = bisect.bisect_right(Bsum, K) - 1
ans[0] = t
for i in range(1, N + 1):
if Asum[i] > K:
break
while Bsum[t] + Asum[i] > K:
t -= 1
ans[i] = i + t
print((max(ans)))
| false | 37.142857 |
[
"+import bisect",
"+",
"-",
"-",
"-def nibu(x):",
"- time = set()",
"- for i in range(0, N + 1):",
"- if i > x:",
"- break",
"- if x - i > M:",
"- continue",
"- time.add(Asum[i] + Bsum[x - i])",
"- if min(time) <= K:",
"- return True",
"- else:",
"- return False",
"-",
"-",
"-nibu_l = 0",
"-nibu_r = N + M",
"-while nibu_r - nibu_l > 1:",
"- c = (nibu_l + nibu_r) // 2",
"- if nibu(c) == True:",
"- nibu_l = c",
"- else:",
"- nibu_r = c",
"-if nibu(nibu_r) == True:",
"- print(nibu_r)",
"-else:",
"- print(nibu_l)",
"+ans = [0 for i in range(N + 1)]",
"+t = bisect.bisect_right(Bsum, K) - 1",
"+ans[0] = t",
"+for i in range(1, N + 1):",
"+ if Asum[i] > K:",
"+ break",
"+ while Bsum[t] + Asum[i] > K:",
"+ t -= 1",
"+ ans[i] = i + t",
"+print((max(ans)))"
] | false | 0.040163 | 0.034373 | 1.168424 |
[
"s131609820",
"s698452031"
] |
u191874006
|
p02846
|
python
|
s539847176
|
s873341212
| 171 | 71 | 38,384 | 65,776 |
Accepted
|
Accepted
| 58.48 |
#!/usr/bin/env python3
import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7
inf = float('inf')
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
t1,t2 = LI()
a1,a2 = LI()
b1,b2 = LI()
x,y = a1*t1,b1*t1
z,w = a1*t1 + a2*t2, b1*t1 + b2*t2
if (x > y and z > w) or (y > x and w > z):
print((0))
quit()
if (z == w) :
print('infinity')
quit()
if x < y:
x,y = y,x
if z < w:
z,w = w,z
s1 = x - y
s2 = z - w
p = math.ceil(s1/s2)
q = s1 % s2
ans = 2*p - (q != 0)
print(ans)
|
#!/usr/bin/env python3
import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7
inf = float('inf')
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
t1, t2 = LI()
a1, a2 = LI()
b1, b2 = LI()
a = a1 * t1 + a2 * t2
b = b1 * t1 + b2 * t2
if a == b:
print('infinity')
else:
if b > a:
if a1 * t1 < b1 * t1:
print((0))
elif a1 * t1 == b1 * t1:
print((1))
elif a1 * t1 > b1 * t1:
c = b - a
d = a1 * t1 - b1 * t1
e = d % c != 0
print((2 * (d // c) + e))
else:
if b1 * t1 < a1 * t1:
print((0))
elif b1 * t1 == a1 * t1:
print((1))
elif b1 * t1 > a1 * t1:
c = a - b
d = b1 * t1 - a1 * t1
e = d % c != 0
print((2 * (d // c) + e))
| 41 | 49 | 923 | 1,252 |
#!/usr/bin/env python3
import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop, heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7
inf = float("inf")
def I():
return int(sys.stdin.readline())
def LI():
return list(map(int, sys.stdin.readline().split()))
t1, t2 = LI()
a1, a2 = LI()
b1, b2 = LI()
x, y = a1 * t1, b1 * t1
z, w = a1 * t1 + a2 * t2, b1 * t1 + b2 * t2
if (x > y and z > w) or (y > x and w > z):
print((0))
quit()
if z == w:
print("infinity")
quit()
if x < y:
x, y = y, x
if z < w:
z, w = w, z
s1 = x - y
s2 = z - w
p = math.ceil(s1 / s2)
q = s1 % s2
ans = 2 * p - (q != 0)
print(ans)
|
#!/usr/bin/env python3
import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop, heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7
inf = float("inf")
def I():
return int(sys.stdin.readline())
def LI():
return list(map(int, sys.stdin.readline().split()))
t1, t2 = LI()
a1, a2 = LI()
b1, b2 = LI()
a = a1 * t1 + a2 * t2
b = b1 * t1 + b2 * t2
if a == b:
print("infinity")
else:
if b > a:
if a1 * t1 < b1 * t1:
print((0))
elif a1 * t1 == b1 * t1:
print((1))
elif a1 * t1 > b1 * t1:
c = b - a
d = a1 * t1 - b1 * t1
e = d % c != 0
print((2 * (d // c) + e))
else:
if b1 * t1 < a1 * t1:
print((0))
elif b1 * t1 == a1 * t1:
print((1))
elif b1 * t1 > a1 * t1:
c = a - b
d = b1 * t1 - a1 * t1
e = d % c != 0
print((2 * (d // c) + e))
| false | 16.326531 |
[
"-x, y = a1 * t1, b1 * t1",
"-z, w = a1 * t1 + a2 * t2, b1 * t1 + b2 * t2",
"-if (x > y and z > w) or (y > x and w > z):",
"- print((0))",
"- quit()",
"-if z == w:",
"+a = a1 * t1 + a2 * t2",
"+b = b1 * t1 + b2 * t2",
"+if a == b:",
"- quit()",
"-if x < y:",
"- x, y = y, x",
"-if z < w:",
"- z, w = w, z",
"-s1 = x - y",
"-s2 = z - w",
"-p = math.ceil(s1 / s2)",
"-q = s1 % s2",
"-ans = 2 * p - (q != 0)",
"-print(ans)",
"+else:",
"+ if b > a:",
"+ if a1 * t1 < b1 * t1:",
"+ print((0))",
"+ elif a1 * t1 == b1 * t1:",
"+ print((1))",
"+ elif a1 * t1 > b1 * t1:",
"+ c = b - a",
"+ d = a1 * t1 - b1 * t1",
"+ e = d % c != 0",
"+ print((2 * (d // c) + e))",
"+ else:",
"+ if b1 * t1 < a1 * t1:",
"+ print((0))",
"+ elif b1 * t1 == a1 * t1:",
"+ print((1))",
"+ elif b1 * t1 > a1 * t1:",
"+ c = a - b",
"+ d = b1 * t1 - a1 * t1",
"+ e = d % c != 0",
"+ print((2 * (d // c) + e))"
] | false | 0.036168 | 0.0352 | 1.027521 |
[
"s539847176",
"s873341212"
] |
u747602774
|
p02755
|
python
|
s958184511
|
s175081230
| 49 | 20 | 3,060 | 3,064 |
Accepted
|
Accepted
| 59.18 |
A,B = list(map(int,input().split()))
for i in range(100000):
if int(i*0.08) == A and int(i*0.1) == B:
break
print((i if i != 99999 else -1))
|
A,B = list(map(int,input().split()))
for i in range(10000):
if int(i*0.08) == A and int(i*0.1) == B:
print(i)
exit()
print((-1))
| 6 | 6 | 151 | 146 |
A, B = list(map(int, input().split()))
for i in range(100000):
if int(i * 0.08) == A and int(i * 0.1) == B:
break
print((i if i != 99999 else -1))
|
A, B = list(map(int, input().split()))
for i in range(10000):
if int(i * 0.08) == A and int(i * 0.1) == B:
print(i)
exit()
print((-1))
| false | 0 |
[
"-for i in range(100000):",
"+for i in range(10000):",
"- break",
"-print((i if i != 99999 else -1))",
"+ print(i)",
"+ exit()",
"+print((-1))"
] | false | 0.047879 | 0.03509 | 1.364466 |
[
"s958184511",
"s175081230"
] |
u968166680
|
p03732
|
python
|
s950814035
|
s805797081
| 219 | 74 | 74,500 | 74,032 |
Accepted
|
Accepted
| 66.21 |
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
def solve1(N, W, weight, value):
dp = [[0] * (W + 1) for _ in range(N + 1)]
for i in range(N):
for w in range(W + 1):
if w - weight[i] >= 0:
dp[i + 1][w] = dp[i][w - weight[i]] + value[i]
if dp[i + 1][w] < dp[i][w]:
dp[i + 1][w] = dp[i][w]
return dp[N][W]
def solve2(N, W, weight, value):
w0 = weight[0]
M = W // w0
if M == 0:
return 0
weight_adj = [w - w0 for w in weight]
w_total = sum(weight_adj)
dp = [[[0] * (w_total + 1) for j in range(N + 1)] for i in range(M + 1)]
for i in range(M):
for j in range(N):
for w in range(w_total + 1):
if w - weight_adj[j] >= 0:
dp[i + 1][j + 1][w] = dp[i][j][w - weight_adj[j]] + value[j]
if dp[i + 1][j + 1][w] < dp[i + 1][j][w]:
dp[i + 1][j + 1][w] = dp[i + 1][j][w]
if dp[i + 1][j + 1][w] < dp[i][j + 1][w]:
dp[i + 1][j + 1][w] = dp[i][j + 1][w]
return max(dp[M][N][min(W - w0 * M, w_total)], dp[M - 1][N][min(W - w0 * (M - 1), w_total)])
def main():
N, W, *wv = list(map(int, read().split()))
weight = wv[::2]
value = wv[1::2]
if weight[0] < 500:
ans = solve1(N, W, weight, value)
else:
ans = solve2(N, W, weight, value)
print(ans)
return
if __name__ == '__main__':
main()
|
import sys
from itertools import accumulate
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
def main():
N, W, *wv = list(map(int, read().split()))
w0 = wv[0]
weight = [[] for _ in range(4)]
for w, v in zip(*[iter(wv)] * 2):
weight[w - w0].append(v)
for i in range(4):
weight[i].sort(reverse=True)
csum = [[0] for _ in range(4)]
for i in range(4):
csum[i].extend(accumulate(weight[i]))
def dfs(w, v, idx):
if idx == 4:
return v
ans = 0
for i in range(len(csum[idx])):
if w + (w0 + idx) * i > W:
break
ans = max(ans, dfs(w + (w0 + idx) * i, v + csum[idx][i], idx + 1))
return ans
print((dfs(0, 0, 0)))
return
if __name__ == '__main__':
main()
| 61 | 45 | 1,634 | 940 |
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10**9)
INF = 1 << 60
MOD = 1000000007
def solve1(N, W, weight, value):
dp = [[0] * (W + 1) for _ in range(N + 1)]
for i in range(N):
for w in range(W + 1):
if w - weight[i] >= 0:
dp[i + 1][w] = dp[i][w - weight[i]] + value[i]
if dp[i + 1][w] < dp[i][w]:
dp[i + 1][w] = dp[i][w]
return dp[N][W]
def solve2(N, W, weight, value):
w0 = weight[0]
M = W // w0
if M == 0:
return 0
weight_adj = [w - w0 for w in weight]
w_total = sum(weight_adj)
dp = [[[0] * (w_total + 1) for j in range(N + 1)] for i in range(M + 1)]
for i in range(M):
for j in range(N):
for w in range(w_total + 1):
if w - weight_adj[j] >= 0:
dp[i + 1][j + 1][w] = dp[i][j][w - weight_adj[j]] + value[j]
if dp[i + 1][j + 1][w] < dp[i + 1][j][w]:
dp[i + 1][j + 1][w] = dp[i + 1][j][w]
if dp[i + 1][j + 1][w] < dp[i][j + 1][w]:
dp[i + 1][j + 1][w] = dp[i][j + 1][w]
return max(
dp[M][N][min(W - w0 * M, w_total)], dp[M - 1][N][min(W - w0 * (M - 1), w_total)]
)
def main():
N, W, *wv = list(map(int, read().split()))
weight = wv[::2]
value = wv[1::2]
if weight[0] < 500:
ans = solve1(N, W, weight, value)
else:
ans = solve2(N, W, weight, value)
print(ans)
return
if __name__ == "__main__":
main()
|
import sys
from itertools import accumulate
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10**9)
INF = 1 << 60
MOD = 1000000007
def main():
N, W, *wv = list(map(int, read().split()))
w0 = wv[0]
weight = [[] for _ in range(4)]
for w, v in zip(*[iter(wv)] * 2):
weight[w - w0].append(v)
for i in range(4):
weight[i].sort(reverse=True)
csum = [[0] for _ in range(4)]
for i in range(4):
csum[i].extend(accumulate(weight[i]))
def dfs(w, v, idx):
if idx == 4:
return v
ans = 0
for i in range(len(csum[idx])):
if w + (w0 + idx) * i > W:
break
ans = max(ans, dfs(w + (w0 + idx) * i, v + csum[idx][i], idx + 1))
return ans
print((dfs(0, 0, 0)))
return
if __name__ == "__main__":
main()
| false | 26.229508 |
[
"+from itertools import accumulate",
"-def solve1(N, W, weight, value):",
"- dp = [[0] * (W + 1) for _ in range(N + 1)]",
"- for i in range(N):",
"- for w in range(W + 1):",
"- if w - weight[i] >= 0:",
"- dp[i + 1][w] = dp[i][w - weight[i]] + value[i]",
"- if dp[i + 1][w] < dp[i][w]:",
"- dp[i + 1][w] = dp[i][w]",
"- return dp[N][W]",
"-",
"-",
"-def solve2(N, W, weight, value):",
"- w0 = weight[0]",
"- M = W // w0",
"- if M == 0:",
"- return 0",
"- weight_adj = [w - w0 for w in weight]",
"- w_total = sum(weight_adj)",
"- dp = [[[0] * (w_total + 1) for j in range(N + 1)] for i in range(M + 1)]",
"- for i in range(M):",
"- for j in range(N):",
"- for w in range(w_total + 1):",
"- if w - weight_adj[j] >= 0:",
"- dp[i + 1][j + 1][w] = dp[i][j][w - weight_adj[j]] + value[j]",
"- if dp[i + 1][j + 1][w] < dp[i + 1][j][w]:",
"- dp[i + 1][j + 1][w] = dp[i + 1][j][w]",
"- if dp[i + 1][j + 1][w] < dp[i][j + 1][w]:",
"- dp[i + 1][j + 1][w] = dp[i][j + 1][w]",
"- return max(",
"- dp[M][N][min(W - w0 * M, w_total)], dp[M - 1][N][min(W - w0 * (M - 1), w_total)]",
"- )",
"-",
"-",
"- weight = wv[::2]",
"- value = wv[1::2]",
"- if weight[0] < 500:",
"- ans = solve1(N, W, weight, value)",
"- else:",
"- ans = solve2(N, W, weight, value)",
"- print(ans)",
"+ w0 = wv[0]",
"+ weight = [[] for _ in range(4)]",
"+ for w, v in zip(*[iter(wv)] * 2):",
"+ weight[w - w0].append(v)",
"+ for i in range(4):",
"+ weight[i].sort(reverse=True)",
"+ csum = [[0] for _ in range(4)]",
"+ for i in range(4):",
"+ csum[i].extend(accumulate(weight[i]))",
"+",
"+ def dfs(w, v, idx):",
"+ if idx == 4:",
"+ return v",
"+ ans = 0",
"+ for i in range(len(csum[idx])):",
"+ if w + (w0 + idx) * i > W:",
"+ break",
"+ ans = max(ans, dfs(w + (w0 + idx) * i, v + csum[idx][i], idx + 1))",
"+ return ans",
"+",
"+ print((dfs(0, 0, 0)))"
] | false | 0.03868 | 0.038225 | 1.011894 |
[
"s950814035",
"s805797081"
] |
u297574184
|
p02937
|
python
|
s471890634
|
s911926937
| 757 | 324 | 111,604 | 107,044 |
Accepted
|
Accepted
| 57.2 |
import sys
ordA = ord('a')
ss = eval(input())
ts = eval(input())
lenS, lenT = len(ss), len(ts)
setS = set(ss)
for t in ts:
if t not in setS:
print((-1))
sys.exit()
poss = [-1] * 26
for i, s in enumerate(ss):
ch = ord(s)-ordA
if poss[ch] == -1:
poss[ch] = i + lenS
nextss = [[0]*(26) for _ in range(lenS)]
for i in reversed(list(range(lenS))):
ch = ord(ss[i])-ordA
poss[ch] = i
for ch, pos in enumerate(poss):
nextss[i][ch] = pos-i
i = 0
ans = 1
for t in ts:
ch = ord(t)-ordA
d = nextss[i][ch]
ans += d+1
i = (i+d+1) % lenS
print((ans-1))
|
import sys
numChar = 26
ordA = ord('a')
Ss = input().rstrip()
Ts = input().rstrip()
setS, setT = set(Ss), set(Ts)
for T in setT:
if T not in setS:
print((-1))
sys.exit()
def getDistNextss(As, numChar):
lenA = len(As)
poss = [-1] * numChar
for i, A in enumerate(As):
if poss[A] == -1:
poss[A] = i + lenA
distNextss = [[0]*(numChar) for _ in range(lenA)]
for i in reversed(list(range(lenA))):
poss[As[i]] = i
distNextss[i] = [pos-i for pos in poss]
return distNextss
As = [ord(S)-ordA for S in Ss]
distNextss = getDistNextss(As, numChar)
lenS = len(Ss)
i = 0
for T in Ts:
T = ord(T) - ordA
i += distNextss[i%lenS][T]
i += 1
print(i)
| 37 | 37 | 632 | 758 |
import sys
ordA = ord("a")
ss = eval(input())
ts = eval(input())
lenS, lenT = len(ss), len(ts)
setS = set(ss)
for t in ts:
if t not in setS:
print((-1))
sys.exit()
poss = [-1] * 26
for i, s in enumerate(ss):
ch = ord(s) - ordA
if poss[ch] == -1:
poss[ch] = i + lenS
nextss = [[0] * (26) for _ in range(lenS)]
for i in reversed(list(range(lenS))):
ch = ord(ss[i]) - ordA
poss[ch] = i
for ch, pos in enumerate(poss):
nextss[i][ch] = pos - i
i = 0
ans = 1
for t in ts:
ch = ord(t) - ordA
d = nextss[i][ch]
ans += d + 1
i = (i + d + 1) % lenS
print((ans - 1))
|
import sys
numChar = 26
ordA = ord("a")
Ss = input().rstrip()
Ts = input().rstrip()
setS, setT = set(Ss), set(Ts)
for T in setT:
if T not in setS:
print((-1))
sys.exit()
def getDistNextss(As, numChar):
lenA = len(As)
poss = [-1] * numChar
for i, A in enumerate(As):
if poss[A] == -1:
poss[A] = i + lenA
distNextss = [[0] * (numChar) for _ in range(lenA)]
for i in reversed(list(range(lenA))):
poss[As[i]] = i
distNextss[i] = [pos - i for pos in poss]
return distNextss
As = [ord(S) - ordA for S in Ss]
distNextss = getDistNextss(As, numChar)
lenS = len(Ss)
i = 0
for T in Ts:
T = ord(T) - ordA
i += distNextss[i % lenS][T]
i += 1
print(i)
| false | 0 |
[
"+numChar = 26",
"-ss = eval(input())",
"-ts = eval(input())",
"-lenS, lenT = len(ss), len(ts)",
"-setS = set(ss)",
"-for t in ts:",
"- if t not in setS:",
"+Ss = input().rstrip()",
"+Ts = input().rstrip()",
"+setS, setT = set(Ss), set(Ts)",
"+for T in setT:",
"+ if T not in setS:",
"-poss = [-1] * 26",
"-for i, s in enumerate(ss):",
"- ch = ord(s) - ordA",
"- if poss[ch] == -1:",
"- poss[ch] = i + lenS",
"-nextss = [[0] * (26) for _ in range(lenS)]",
"-for i in reversed(list(range(lenS))):",
"- ch = ord(ss[i]) - ordA",
"- poss[ch] = i",
"- for ch, pos in enumerate(poss):",
"- nextss[i][ch] = pos - i",
"+",
"+",
"+def getDistNextss(As, numChar):",
"+ lenA = len(As)",
"+ poss = [-1] * numChar",
"+ for i, A in enumerate(As):",
"+ if poss[A] == -1:",
"+ poss[A] = i + lenA",
"+ distNextss = [[0] * (numChar) for _ in range(lenA)]",
"+ for i in reversed(list(range(lenA))):",
"+ poss[As[i]] = i",
"+ distNextss[i] = [pos - i for pos in poss]",
"+ return distNextss",
"+",
"+",
"+As = [ord(S) - ordA for S in Ss]",
"+distNextss = getDistNextss(As, numChar)",
"+lenS = len(Ss)",
"-ans = 1",
"-for t in ts:",
"- ch = ord(t) - ordA",
"- d = nextss[i][ch]",
"- ans += d + 1",
"- i = (i + d + 1) % lenS",
"-print((ans - 1))",
"+for T in Ts:",
"+ T = ord(T) - ordA",
"+ i += distNextss[i % lenS][T]",
"+ i += 1",
"+print(i)"
] | false | 0.126629 | 0.076758 | 1.649728 |
[
"s471890634",
"s911926937"
] |
u372501464
|
p02781
|
python
|
s876960871
|
s365393859
| 192 | 29 | 41,328 | 3,820 |
Accepted
|
Accepted
| 84.9 |
from collections import defaultdict
N = input().strip()
K = int(input().strip())
lenN = len(N)
memo = defaultdict(lambda :defaultdict(lambda :defaultdict(int)))
def f(keta, flag, k):
if keta == lenN-1:
if k == K:
return 1
else:
return 0
if keta in memo and flag in memo[keta] and k in memo[keta][flag]:
return memo[keta][flag][k]
nketa = keta + 1
maxi = int(N[nketa]) if flag else 9
res = 0
for i in range(maxi+1):
nflag = flag and (int(N[nketa]) == i)
nk = k if i == 0 else k + 1
if nk > K:
continue
res += f(nketa, nflag, nk)
memo[keta][flag][k] = res
return res
print((f(-1, True, 0)))
|
from collections import defaultdict
from functools import lru_cache
N = input().strip()
K = int(input().strip())
lenN = len(N)
#memo = defaultdict(lambda :defaultdict(lambda :defaultdict(int)))
@lru_cache(maxsize=None)
def f(keta, flag, k):
if keta == lenN-1:
if k == K:
return 1
else:
return 0
#if keta in memo and flag in memo[keta] and k in memo[keta][flag]:
# return memo[keta][flag][k]
nketa = keta + 1
maxi = int(N[nketa]) if flag else 9
res = 0
for i in range(maxi+1):
nflag = flag and (int(N[nketa]) == i)
nk = k if i == 0 else k + 1
if nk > K:
continue
res += f(nketa, nflag, nk)
#memo[keta][flag][k] = res
return res
print((f(-1, True, 0)))
| 28 | 30 | 741 | 804 |
from collections import defaultdict
N = input().strip()
K = int(input().strip())
lenN = len(N)
memo = defaultdict(lambda: defaultdict(lambda: defaultdict(int)))
def f(keta, flag, k):
if keta == lenN - 1:
if k == K:
return 1
else:
return 0
if keta in memo and flag in memo[keta] and k in memo[keta][flag]:
return memo[keta][flag][k]
nketa = keta + 1
maxi = int(N[nketa]) if flag else 9
res = 0
for i in range(maxi + 1):
nflag = flag and (int(N[nketa]) == i)
nk = k if i == 0 else k + 1
if nk > K:
continue
res += f(nketa, nflag, nk)
memo[keta][flag][k] = res
return res
print((f(-1, True, 0)))
|
from collections import defaultdict
from functools import lru_cache
N = input().strip()
K = int(input().strip())
lenN = len(N)
# memo = defaultdict(lambda :defaultdict(lambda :defaultdict(int)))
@lru_cache(maxsize=None)
def f(keta, flag, k):
if keta == lenN - 1:
if k == K:
return 1
else:
return 0
# if keta in memo and flag in memo[keta] and k in memo[keta][flag]:
# return memo[keta][flag][k]
nketa = keta + 1
maxi = int(N[nketa]) if flag else 9
res = 0
for i in range(maxi + 1):
nflag = flag and (int(N[nketa]) == i)
nk = k if i == 0 else k + 1
if nk > K:
continue
res += f(nketa, nflag, nk)
# memo[keta][flag][k] = res
return res
print((f(-1, True, 0)))
| false | 6.666667 |
[
"+from functools import lru_cache",
"-memo = defaultdict(lambda: defaultdict(lambda: defaultdict(int)))",
"-",
"-",
"+# memo = defaultdict(lambda :defaultdict(lambda :defaultdict(int)))",
"+@lru_cache(maxsize=None)",
"- if keta in memo and flag in memo[keta] and k in memo[keta][flag]:",
"- return memo[keta][flag][k]",
"+ # if keta in memo and flag in memo[keta] and k in memo[keta][flag]:",
"+ # return memo[keta][flag][k]",
"- memo[keta][flag][k] = res",
"+ # memo[keta][flag][k] = res"
] | false | 0.086111 | 0.036421 | 2.364333 |
[
"s876960871",
"s365393859"
] |
u645250356
|
p03438
|
python
|
s277854133
|
s829982823
| 209 | 46 | 41,580 | 6,648 |
Accepted
|
Accepted
| 77.99 |
from collections import Counter,defaultdict,deque
import sys,heapq,bisect,math,itertools,string,queue
sys.setrecursionlimit(10**8)
mod = 10**9+7
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
def inpl_str(): return list(sys.stdin.readline().split())
def inpln(n): return list(int(sys.stdin.readline()) for i in range(n))
n = inp()
a = inpl()
b = inpl()
x = 0
y = 0
for i in range(n):
if b[i] - a[i] > 0:
x += (b[i] - a[i])//2
else:
y += a[i] - b[i]
if x >= y:
print('Yes')
else:
print('No')
|
from collections import Counter,defaultdict,deque
from heapq import heappop,heappush,heapify
import sys,bisect,math,itertools,fractions
sys.setrecursionlimit(10**8)
mod = 10**9+7
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
n = inp()
a = inpl()
b = inpl()
res = 0
for i in range(n):
if a[i] > b[i]:
res += b[i] - a[i]
elif b[i] - a[i]:
res += (b[i] - a[i])//2
print(('Yes' if res >= 0 else 'No'))
| 23 | 19 | 606 | 519 |
from collections import Counter, defaultdict, deque
import sys, heapq, bisect, math, itertools, string, queue
sys.setrecursionlimit(10**8)
mod = 10**9 + 7
def inp():
return int(sys.stdin.readline())
def inpl():
return list(map(int, sys.stdin.readline().split()))
def inpl_str():
return list(sys.stdin.readline().split())
def inpln(n):
return list(int(sys.stdin.readline()) for i in range(n))
n = inp()
a = inpl()
b = inpl()
x = 0
y = 0
for i in range(n):
if b[i] - a[i] > 0:
x += (b[i] - a[i]) // 2
else:
y += a[i] - b[i]
if x >= y:
print("Yes")
else:
print("No")
|
from collections import Counter, defaultdict, deque
from heapq import heappop, heappush, heapify
import sys, bisect, math, itertools, fractions
sys.setrecursionlimit(10**8)
mod = 10**9 + 7
INF = float("inf")
def inp():
return int(sys.stdin.readline())
def inpl():
return list(map(int, sys.stdin.readline().split()))
n = inp()
a = inpl()
b = inpl()
res = 0
for i in range(n):
if a[i] > b[i]:
res += b[i] - a[i]
elif b[i] - a[i]:
res += (b[i] - a[i]) // 2
print(("Yes" if res >= 0 else "No"))
| false | 17.391304 |
[
"-import sys, heapq, bisect, math, itertools, string, queue",
"+from heapq import heappop, heappush, heapify",
"+import sys, bisect, math, itertools, fractions",
"+INF = float(\"inf\")",
"-def inpl_str():",
"- return list(sys.stdin.readline().split())",
"-",
"-",
"-def inpln(n):",
"- return list(int(sys.stdin.readline()) for i in range(n))",
"-",
"-",
"-x = 0",
"-y = 0",
"+res = 0",
"- if b[i] - a[i] > 0:",
"- x += (b[i] - a[i]) // 2",
"- else:",
"- y += a[i] - b[i]",
"-if x >= y:",
"- print(\"Yes\")",
"-else:",
"- print(\"No\")",
"+ if a[i] > b[i]:",
"+ res += b[i] - a[i]",
"+ elif b[i] - a[i]:",
"+ res += (b[i] - a[i]) // 2",
"+print((\"Yes\" if res >= 0 else \"No\"))"
] | false | 0.045947 | 0.037623 | 1.221259 |
[
"s277854133",
"s829982823"
] |
u168825829
|
p03111
|
python
|
s675492230
|
s980722029
| 73 | 60 | 3,064 | 3,064 |
Accepted
|
Accepted
| 17.81 |
N, A, B, C = list(map(int, input().split(" ")))
l = [int(eval(input())) for i in range(N)]
INF = 10 ** 9
def dfs(cnt, a, b, c):
if cnt == N:
return abs(a-A)+abs(b-B)+abs(c-C)-30 if min(a,b,c)>0 else INF
ret1=dfs(cnt+1,a+l[cnt],b,c)+10
ret2=dfs(cnt+1,a,b+l[cnt],c)+10
ret3=dfs(cnt+1,a,b,c+l[cnt])+10
ret4=dfs(cnt+1,a,b,c)
return min(ret1,ret2,ret3,ret4)
print((dfs(0,0,0,0)))
|
N,A,B,C = list(map(int, input().split()))
l = [0]*N
for i in range(N):
l[i] = int(eval(input()))
def dfs(i,a,b,c):
if i == N:
if a==0 or b==0 or c==0:
return 100000
else:
return abs(A-a)+abs(B-b)+abs(C-c)-30
else:
return min(dfs(i+1,a+l[i],b,c)+10, dfs(i+1,a,b+l[i],c)+10, dfs(i+1,a,b,c+l[i])+10, dfs(i+1,a,b,c))
print((dfs(0,0,0,0)))
| 13 | 14 | 405 | 396 |
N, A, B, C = list(map(int, input().split(" ")))
l = [int(eval(input())) for i in range(N)]
INF = 10**9
def dfs(cnt, a, b, c):
if cnt == N:
return abs(a - A) + abs(b - B) + abs(c - C) - 30 if min(a, b, c) > 0 else INF
ret1 = dfs(cnt + 1, a + l[cnt], b, c) + 10
ret2 = dfs(cnt + 1, a, b + l[cnt], c) + 10
ret3 = dfs(cnt + 1, a, b, c + l[cnt]) + 10
ret4 = dfs(cnt + 1, a, b, c)
return min(ret1, ret2, ret3, ret4)
print((dfs(0, 0, 0, 0)))
|
N, A, B, C = list(map(int, input().split()))
l = [0] * N
for i in range(N):
l[i] = int(eval(input()))
def dfs(i, a, b, c):
if i == N:
if a == 0 or b == 0 or c == 0:
return 100000
else:
return abs(A - a) + abs(B - b) + abs(C - c) - 30
else:
return min(
dfs(i + 1, a + l[i], b, c) + 10,
dfs(i + 1, a, b + l[i], c) + 10,
dfs(i + 1, a, b, c + l[i]) + 10,
dfs(i + 1, a, b, c),
)
print((dfs(0, 0, 0, 0)))
| false | 7.142857 |
[
"-N, A, B, C = list(map(int, input().split(\" \")))",
"-l = [int(eval(input())) for i in range(N)]",
"-INF = 10**9",
"+N, A, B, C = list(map(int, input().split()))",
"+l = [0] * N",
"+for i in range(N):",
"+ l[i] = int(eval(input()))",
"-def dfs(cnt, a, b, c):",
"- if cnt == N:",
"- return abs(a - A) + abs(b - B) + abs(c - C) - 30 if min(a, b, c) > 0 else INF",
"- ret1 = dfs(cnt + 1, a + l[cnt], b, c) + 10",
"- ret2 = dfs(cnt + 1, a, b + l[cnt], c) + 10",
"- ret3 = dfs(cnt + 1, a, b, c + l[cnt]) + 10",
"- ret4 = dfs(cnt + 1, a, b, c)",
"- return min(ret1, ret2, ret3, ret4)",
"+def dfs(i, a, b, c):",
"+ if i == N:",
"+ if a == 0 or b == 0 or c == 0:",
"+ return 100000",
"+ else:",
"+ return abs(A - a) + abs(B - b) + abs(C - c) - 30",
"+ else:",
"+ return min(",
"+ dfs(i + 1, a + l[i], b, c) + 10,",
"+ dfs(i + 1, a, b + l[i], c) + 10,",
"+ dfs(i + 1, a, b, c + l[i]) + 10,",
"+ dfs(i + 1, a, b, c),",
"+ )"
] | false | 0.094195 | 0.216181 | 0.435725 |
[
"s675492230",
"s980722029"
] |
u077291787
|
p02558
|
python
|
s754292048
|
s982268637
| 378 | 308 | 144,920 | 18,872 |
Accepted
|
Accepted
| 18.52 |
class UnionFind:
"""Union-Find: O(α(N))"""
__slots__ = ["_data_size", "_first_idx", "_parents"]
def __init__(self, data_size: int, is_zero_origin: bool = True) -> None:
self._data_size = data_size
self._first_idx = 0 if is_zero_origin else 1
self._parents = [-1] * (data_size + self._first_idx)
def _find(self, x: int) -> int:
if self._parents[x] < 0:
return x
self._parents[x] = self._find(self._parents[x])
return self._parents[x]
def is_connected(self, x: int, y: int) -> bool:
"""Return whether two vertices x and y are connected or not."""
return self._find(x) == self._find(y)
def unite(self, x: int, y: int) -> None:
"""Unite two groups of vertices x and y."""
x, y = self._find(x), self._find(y)
if x == y:
return
if self._parents[x] > self._parents[y]:
x, y = y, x
self._parents[x] += self._parents[y]
self._parents[y] = x
def unionfind():
# https://judge.yosupo.jp/problem/unionfind
# https://atcoder.jp/contests/practice2/tasks/practice2_a
N, Q, *TUV = list(map(int, open(0).read().split()))
tree = UnionFind(N)
res = []
for t, u, v in zip(*[iter(TUV)] * 3):
if t:
res.append(int(tree.is_connected(u, v)))
else:
tree.unite(u, v)
print(("\n".join(map(str, res))))
if __name__ == "__main__":
unionfind()
|
class UnionFind:
__slots__ = ["N", "root", "rank"]
def __init__(self, N):
"""
N:要素数
root:各要素の親要素の番号を格納するリスト.
ただし, root[x] < 0 ならその頂点が根で-root[x]が木の要素数.
rank:ランク
"""
self.N = N
self.root = [-1] * N
def __repr__(self):
return "\n".join("{}: {}".format(r, self.members(r)) for r in self.roots())
def find(self, x):
"""頂点xの根を見つける"""
while self.root[x] >= 0:
x = self.root[x]
return x
def union(self, x, y):
"""x, yが属する木をunion"""
# 根を比較する
# すでに同じ木に属していた場合は何もしない.
# 違う木に属していた場合はrankを見てくっつける方を決める.
# rankが同じ時はrankを1増やす
x = self.find(x)
y = self.find(y)
if x == y:
return
elif self.root[y] < self.root[x]:
x, y = y, x
self.root[x] += self.root[y]
self.root[y] = x
def same(self, x, y):
"""xとyが同じグループに属するかどうか"""
return self.find(x) == self.find(y)
def count(self, x):
"""頂点xが属する木のサイズを返す"""
return -self.root[self.find(x)]
def members(self, x):
"""xが属する木の要素を列挙"""
_root = self.find(x)
return [i for i in range(self.N) if self.find == _root]
def roots(self):
"""森の根を列挙"""
return [i for i, x in enumerate(self.root) if x < 0]
def group_count(self):
"""連結成分の数"""
return len(self.roots())
def all_group_members(self):
"""{ルート要素: [そのグループに含まれる要素のリスト], ...}の辞書を返す"""
return {r: self.members(r) for r in self.roots()}
def main():
import sys
input = sys.stdin.readline
n, q = list(map(int, input().split()))
uf = UnionFind(n)
res = []
for i in range(q):
t, u, v = list(map(int, input().split()))
if t:
res.append(int(uf.same(u, v)))
else:
uf.union(u, v)
print(("\n".join(map(str, res))))
if __name__ == "__main__":
main()
| 47 | 81 | 1,504 | 2,036 |
class UnionFind:
"""Union-Find: O(α(N))"""
__slots__ = ["_data_size", "_first_idx", "_parents"]
def __init__(self, data_size: int, is_zero_origin: bool = True) -> None:
self._data_size = data_size
self._first_idx = 0 if is_zero_origin else 1
self._parents = [-1] * (data_size + self._first_idx)
def _find(self, x: int) -> int:
if self._parents[x] < 0:
return x
self._parents[x] = self._find(self._parents[x])
return self._parents[x]
def is_connected(self, x: int, y: int) -> bool:
"""Return whether two vertices x and y are connected or not."""
return self._find(x) == self._find(y)
def unite(self, x: int, y: int) -> None:
"""Unite two groups of vertices x and y."""
x, y = self._find(x), self._find(y)
if x == y:
return
if self._parents[x] > self._parents[y]:
x, y = y, x
self._parents[x] += self._parents[y]
self._parents[y] = x
def unionfind():
# https://judge.yosupo.jp/problem/unionfind
# https://atcoder.jp/contests/practice2/tasks/practice2_a
N, Q, *TUV = list(map(int, open(0).read().split()))
tree = UnionFind(N)
res = []
for t, u, v in zip(*[iter(TUV)] * 3):
if t:
res.append(int(tree.is_connected(u, v)))
else:
tree.unite(u, v)
print(("\n".join(map(str, res))))
if __name__ == "__main__":
unionfind()
|
class UnionFind:
__slots__ = ["N", "root", "rank"]
def __init__(self, N):
"""
N:要素数
root:各要素の親要素の番号を格納するリスト.
ただし, root[x] < 0 ならその頂点が根で-root[x]が木の要素数.
rank:ランク
"""
self.N = N
self.root = [-1] * N
def __repr__(self):
return "\n".join("{}: {}".format(r, self.members(r)) for r in self.roots())
def find(self, x):
"""頂点xの根を見つける"""
while self.root[x] >= 0:
x = self.root[x]
return x
def union(self, x, y):
"""x, yが属する木をunion"""
# 根を比較する
# すでに同じ木に属していた場合は何もしない.
# 違う木に属していた場合はrankを見てくっつける方を決める.
# rankが同じ時はrankを1増やす
x = self.find(x)
y = self.find(y)
if x == y:
return
elif self.root[y] < self.root[x]:
x, y = y, x
self.root[x] += self.root[y]
self.root[y] = x
def same(self, x, y):
"""xとyが同じグループに属するかどうか"""
return self.find(x) == self.find(y)
def count(self, x):
"""頂点xが属する木のサイズを返す"""
return -self.root[self.find(x)]
def members(self, x):
"""xが属する木の要素を列挙"""
_root = self.find(x)
return [i for i in range(self.N) if self.find == _root]
def roots(self):
"""森の根を列挙"""
return [i for i, x in enumerate(self.root) if x < 0]
def group_count(self):
"""連結成分の数"""
return len(self.roots())
def all_group_members(self):
"""{ルート要素: [そのグループに含まれる要素のリスト], ...}の辞書を返す"""
return {r: self.members(r) for r in self.roots()}
def main():
import sys
input = sys.stdin.readline
n, q = list(map(int, input().split()))
uf = UnionFind(n)
res = []
for i in range(q):
t, u, v = list(map(int, input().split()))
if t:
res.append(int(uf.same(u, v)))
else:
uf.union(u, v)
print(("\n".join(map(str, res))))
if __name__ == "__main__":
main()
| false | 41.975309 |
[
"- \"\"\"Union-Find: O(α(N))\"\"\"",
"+ __slots__ = [\"N\", \"root\", \"rank\"]",
"- __slots__ = [\"_data_size\", \"_first_idx\", \"_parents\"]",
"+ def __init__(self, N):",
"+ \"\"\"",
"+ N:要素数",
"+ root:各要素の親要素の番号を格納するリスト.",
"+ ただし, root[x] < 0 ならその頂点が根で-root[x]が木の要素数.",
"+ rank:ランク",
"+ \"\"\"",
"+ self.N = N",
"+ self.root = [-1] * N",
"- def __init__(self, data_size: int, is_zero_origin: bool = True) -> None:",
"- self._data_size = data_size",
"- self._first_idx = 0 if is_zero_origin else 1",
"- self._parents = [-1] * (data_size + self._first_idx)",
"+ def __repr__(self):",
"+ return \"\\n\".join(\"{}: {}\".format(r, self.members(r)) for r in self.roots())",
"- def _find(self, x: int) -> int:",
"- if self._parents[x] < 0:",
"- return x",
"- self._parents[x] = self._find(self._parents[x])",
"- return self._parents[x]",
"+ def find(self, x):",
"+ \"\"\"頂点xの根を見つける\"\"\"",
"+ while self.root[x] >= 0:",
"+ x = self.root[x]",
"+ return x",
"- def is_connected(self, x: int, y: int) -> bool:",
"- \"\"\"Return whether two vertices x and y are connected or not.\"\"\"",
"- return self._find(x) == self._find(y)",
"-",
"- def unite(self, x: int, y: int) -> None:",
"- \"\"\"Unite two groups of vertices x and y.\"\"\"",
"- x, y = self._find(x), self._find(y)",
"+ def union(self, x, y):",
"+ \"\"\"x, yが属する木をunion\"\"\"",
"+ # 根を比較する",
"+ # すでに同じ木に属していた場合は何もしない.",
"+ # 違う木に属していた場合はrankを見てくっつける方を決める.",
"+ # rankが同じ時はrankを1増やす",
"+ x = self.find(x)",
"+ y = self.find(y)",
"- if self._parents[x] > self._parents[y]:",
"+ elif self.root[y] < self.root[x]:",
"- self._parents[x] += self._parents[y]",
"- self._parents[y] = x",
"+ self.root[x] += self.root[y]",
"+ self.root[y] = x",
"+",
"+ def same(self, x, y):",
"+ \"\"\"xとyが同じグループに属するかどうか\"\"\"",
"+ return self.find(x) == self.find(y)",
"+",
"+ def count(self, x):",
"+ \"\"\"頂点xが属する木のサイズを返す\"\"\"",
"+ return -self.root[self.find(x)]",
"+",
"+ def members(self, x):",
"+ \"\"\"xが属する木の要素を列挙\"\"\"",
"+ _root = self.find(x)",
"+ return [i for i in range(self.N) if self.find == _root]",
"+",
"+ def roots(self):",
"+ \"\"\"森の根を列挙\"\"\"",
"+ return [i for i, x in enumerate(self.root) if x < 0]",
"+",
"+ def group_count(self):",
"+ \"\"\"連結成分の数\"\"\"",
"+ return len(self.roots())",
"+",
"+ def all_group_members(self):",
"+ \"\"\"{ルート要素: [そのグループに含まれる要素のリスト], ...}の辞書を返す\"\"\"",
"+ return {r: self.members(r) for r in self.roots()}",
"-def unionfind():",
"- # https://judge.yosupo.jp/problem/unionfind",
"- # https://atcoder.jp/contests/practice2/tasks/practice2_a",
"- N, Q, *TUV = list(map(int, open(0).read().split()))",
"- tree = UnionFind(N)",
"+def main():",
"+ import sys",
"+",
"+ input = sys.stdin.readline",
"+ n, q = list(map(int, input().split()))",
"+ uf = UnionFind(n)",
"- for t, u, v in zip(*[iter(TUV)] * 3):",
"+ for i in range(q):",
"+ t, u, v = list(map(int, input().split()))",
"- res.append(int(tree.is_connected(u, v)))",
"+ res.append(int(uf.same(u, v)))",
"- tree.unite(u, v)",
"+ uf.union(u, v)",
"- unionfind()",
"+ main()"
] | false | 0.047376 | 0.099617 | 0.475586 |
[
"s754292048",
"s982268637"
] |
u332385682
|
p03999
|
python
|
s223217627
|
s526803120
| 20 | 17 | 3,064 | 3,064 |
Accepted
|
Accepted
| 15 |
import sys
def debug(x, table):
for name, val in table.items():
if x is val:
print('DEBUG:{} -> {}'.format(name, val), file=sys.stderr)
return None
def solve():
S = input()
N = len(S) - 1
ans = 0
for i in range(2**N):
bi = bin(i)[2:].zfill(N)
# print(bi)
ans += calc(S, bi)
print(ans)
def calc(S, bi):
ret = 0
k = 0
for i in range(len(S)):
if i == 0:
continue
else:
if bi[i-1] == '1':
ret += int(S[k:i])
k = i
ret += int(S[k:])
return ret
if __name__ == '__main__':
solve()
|
import sys
from itertools import accumulate
def debug(x, table):
for name, val in table.items():
if x is val:
print('DEBUG:{} -> {}'.format(name, val), file=sys.stderr)
return None
def solve():
S = [int(i) for i in input()]
N = len(S)
sac = [0] + list(accumulate(S))
ans = 0
for i in range(N):
ans += (int(sac[i] * 2**(i - 1)) + 2**i * S[i]) * 10**(N - 1 - i)
print(ans)
if __name__ == '__main__':
solve()
| 38 | 22 | 695 | 503 |
import sys
def debug(x, table):
for name, val in table.items():
if x is val:
print("DEBUG:{} -> {}".format(name, val), file=sys.stderr)
return None
def solve():
S = input()
N = len(S) - 1
ans = 0
for i in range(2**N):
bi = bin(i)[2:].zfill(N)
# print(bi)
ans += calc(S, bi)
print(ans)
def calc(S, bi):
ret = 0
k = 0
for i in range(len(S)):
if i == 0:
continue
else:
if bi[i - 1] == "1":
ret += int(S[k:i])
k = i
ret += int(S[k:])
return ret
if __name__ == "__main__":
solve()
|
import sys
from itertools import accumulate
def debug(x, table):
for name, val in table.items():
if x is val:
print("DEBUG:{} -> {}".format(name, val), file=sys.stderr)
return None
def solve():
S = [int(i) for i in input()]
N = len(S)
sac = [0] + list(accumulate(S))
ans = 0
for i in range(N):
ans += (int(sac[i] * 2 ** (i - 1)) + 2**i * S[i]) * 10 ** (N - 1 - i)
print(ans)
if __name__ == "__main__":
solve()
| false | 42.105263 |
[
"+from itertools import accumulate",
"- S = input()",
"- N = len(S) - 1",
"+ S = [int(i) for i in input()]",
"+ N = len(S)",
"+ sac = [0] + list(accumulate(S))",
"- for i in range(2**N):",
"- bi = bin(i)[2:].zfill(N)",
"- # print(bi)",
"- ans += calc(S, bi)",
"+ for i in range(N):",
"+ ans += (int(sac[i] * 2 ** (i - 1)) + 2**i * S[i]) * 10 ** (N - 1 - i)",
"-",
"-",
"-def calc(S, bi):",
"- ret = 0",
"- k = 0",
"- for i in range(len(S)):",
"- if i == 0:",
"- continue",
"- else:",
"- if bi[i - 1] == \"1\":",
"- ret += int(S[k:i])",
"- k = i",
"- ret += int(S[k:])",
"- return ret"
] | false | 0.036486 | 0.037456 | 0.974102 |
[
"s223217627",
"s526803120"
] |
u634079249
|
p02959
|
python
|
s838859631
|
s694636655
| 177 | 121 | 19,228 | 18,744 |
Accepted
|
Accepted
| 31.64 |
import sys
import os
def main():
if os.getenv("LOCAL"):
sys.stdin = open("input.txt", "r")
N = int(sys.stdin.readline().rstrip())
city = list(map(int, sys.stdin.readline().split()))
brave = list(map(int, sys.stdin.readline().split()))
init = sum(city)
for n in range(N):
bef = city[n]
city[n] -= min(city[n], brave[n])
city[n+1] -= min(city[n+1], brave[n]-min(bef, brave[n]))
print((init-sum(city)))
if __name__ == '__main__':
main()
|
import sys
sys.setrecursionlimit(10000000)
import os
import math
import bisect
import collections
import itertools
import heapq
import re
import queue
# import fractions
ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: list(map(int, sys.stdin.buffer.readline().split()))
fl = lambda: list(map(float, sys.stdin.buffer.readline().split()))
iln = lambda n: [int(sys.stdin.buffer.readline().rstrip()) for _ in range(n)]
iss = lambda: sys.stdin.buffer.readline().decode().rstrip()
sl = lambda: list(map(str, sys.stdin.buffer.readline().decode().split()))
isn = lambda n: [sys.stdin.buffer.readline().decode().rstrip() for _ in range(n)]
lcm = lambda x, y: (x * y) // math.gcd(x, y)
# lcm = lambda x, y: (x * y) // fractions.gcd(x, y)
MOD = 10 ** 9 + 7
MAX = float('inf')
def main():
if os.getenv("LOCAL"):
sys.stdin = open("input.txt", "r")
N = ii()
A = il()
B = il()
ret = 0
for n in range(N):
if B[n] >= A[n]+A[n+1]:
ret += A[n] + A[n+1]
A[n+1] = 0
elif B[n] >= A[n]:
ret += B[n]
A[n+1] -= B[n] - A[n]
else:
ret += B[n]
print(ret)
if __name__ == '__main__':
main()
| 23 | 54 | 525 | 1,271 |
import sys
import os
def main():
if os.getenv("LOCAL"):
sys.stdin = open("input.txt", "r")
N = int(sys.stdin.readline().rstrip())
city = list(map(int, sys.stdin.readline().split()))
brave = list(map(int, sys.stdin.readline().split()))
init = sum(city)
for n in range(N):
bef = city[n]
city[n] -= min(city[n], brave[n])
city[n + 1] -= min(city[n + 1], brave[n] - min(bef, brave[n]))
print((init - sum(city)))
if __name__ == "__main__":
main()
|
import sys
sys.setrecursionlimit(10000000)
import os
import math
import bisect
import collections
import itertools
import heapq
import re
import queue
# import fractions
ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: list(map(int, sys.stdin.buffer.readline().split()))
fl = lambda: list(map(float, sys.stdin.buffer.readline().split()))
iln = lambda n: [int(sys.stdin.buffer.readline().rstrip()) for _ in range(n)]
iss = lambda: sys.stdin.buffer.readline().decode().rstrip()
sl = lambda: list(map(str, sys.stdin.buffer.readline().decode().split()))
isn = lambda n: [sys.stdin.buffer.readline().decode().rstrip() for _ in range(n)]
lcm = lambda x, y: (x * y) // math.gcd(x, y)
# lcm = lambda x, y: (x * y) // fractions.gcd(x, y)
MOD = 10**9 + 7
MAX = float("inf")
def main():
if os.getenv("LOCAL"):
sys.stdin = open("input.txt", "r")
N = ii()
A = il()
B = il()
ret = 0
for n in range(N):
if B[n] >= A[n] + A[n + 1]:
ret += A[n] + A[n + 1]
A[n + 1] = 0
elif B[n] >= A[n]:
ret += B[n]
A[n + 1] -= B[n] - A[n]
else:
ret += B[n]
print(ret)
if __name__ == "__main__":
main()
| false | 57.407407 |
[
"+",
"+sys.setrecursionlimit(10000000)",
"+import math",
"+import bisect",
"+import collections",
"+import itertools",
"+import heapq",
"+import re",
"+import queue",
"+",
"+# import fractions",
"+ii = lambda: int(sys.stdin.buffer.readline().rstrip())",
"+il = lambda: list(map(int, sys.stdin.buffer.readline().split()))",
"+fl = lambda: list(map(float, sys.stdin.buffer.readline().split()))",
"+iln = lambda n: [int(sys.stdin.buffer.readline().rstrip()) for _ in range(n)]",
"+iss = lambda: sys.stdin.buffer.readline().decode().rstrip()",
"+sl = lambda: list(map(str, sys.stdin.buffer.readline().decode().split()))",
"+isn = lambda n: [sys.stdin.buffer.readline().decode().rstrip() for _ in range(n)]",
"+lcm = lambda x, y: (x * y) // math.gcd(x, y)",
"+# lcm = lambda x, y: (x * y) // fractions.gcd(x, y)",
"+MOD = 10**9 + 7",
"+MAX = float(\"inf\")",
"- N = int(sys.stdin.readline().rstrip())",
"- city = list(map(int, sys.stdin.readline().split()))",
"- brave = list(map(int, sys.stdin.readline().split()))",
"- init = sum(city)",
"+ N = ii()",
"+ A = il()",
"+ B = il()",
"+ ret = 0",
"- bef = city[n]",
"- city[n] -= min(city[n], brave[n])",
"- city[n + 1] -= min(city[n + 1], brave[n] - min(bef, brave[n]))",
"- print((init - sum(city)))",
"+ if B[n] >= A[n] + A[n + 1]:",
"+ ret += A[n] + A[n + 1]",
"+ A[n + 1] = 0",
"+ elif B[n] >= A[n]:",
"+ ret += B[n]",
"+ A[n + 1] -= B[n] - A[n]",
"+ else:",
"+ ret += B[n]",
"+ print(ret)"
] | false | 0.039438 | 0.040445 | 0.975116 |
[
"s838859631",
"s694636655"
] |
u072717685
|
p02702
|
python
|
s880877238
|
s696753679
| 312 | 104 | 87,652 | 87,728 |
Accepted
|
Accepted
| 66.67 |
import sys
read = sys.stdin.read
readlines = sys.stdin.readlines
from collections import defaultdict
def main():
s = tuple(map(int, eval(input())))
lens = len(s)
d1 = defaultdict(int)
ss = 0
k = 1
num10 = 1
while k <= lens:
ss += (int(s[-k]) * num10) % 2019
ss = ss % 2019
d1[ss] += 1
k += 1
num10 = (num10 * 10) % 2019
r = d1[0]
for v in list(d1.values()):
r += v * (v - 1) // 2
print(r)
if __name__ == '__main__':
main()
|
import sys
read = sys.stdin.read
readlines = sys.stdin.readlines
from collections import defaultdict
def main():
s = tuple(map(int, eval(input())))
lens = len(s)
d1 = defaultdict(int)
ss = 0
num10 = 1
for i1 in range(1, lens+1):
ss += (int(s[-i1]) * num10) % 2019
ss = ss % 2019
d1[ss] += 1
num10 = (num10 * 10) % 2019
r = d1[0]
for v in list(d1.values()):
r += v * (v - 1) // 2
print(r)
if __name__ == '__main__':
main()
| 25 | 23 | 528 | 513 |
import sys
read = sys.stdin.read
readlines = sys.stdin.readlines
from collections import defaultdict
def main():
s = tuple(map(int, eval(input())))
lens = len(s)
d1 = defaultdict(int)
ss = 0
k = 1
num10 = 1
while k <= lens:
ss += (int(s[-k]) * num10) % 2019
ss = ss % 2019
d1[ss] += 1
k += 1
num10 = (num10 * 10) % 2019
r = d1[0]
for v in list(d1.values()):
r += v * (v - 1) // 2
print(r)
if __name__ == "__main__":
main()
|
import sys
read = sys.stdin.read
readlines = sys.stdin.readlines
from collections import defaultdict
def main():
s = tuple(map(int, eval(input())))
lens = len(s)
d1 = defaultdict(int)
ss = 0
num10 = 1
for i1 in range(1, lens + 1):
ss += (int(s[-i1]) * num10) % 2019
ss = ss % 2019
d1[ss] += 1
num10 = (num10 * 10) % 2019
r = d1[0]
for v in list(d1.values()):
r += v * (v - 1) // 2
print(r)
if __name__ == "__main__":
main()
| false | 8 |
[
"- k = 1",
"- while k <= lens:",
"- ss += (int(s[-k]) * num10) % 2019",
"+ for i1 in range(1, lens + 1):",
"+ ss += (int(s[-i1]) * num10) % 2019",
"- k += 1"
] | false | 0.037573 | 0.038457 | 0.977001 |
[
"s880877238",
"s696753679"
] |
u883621917
|
p03775
|
python
|
s699386059
|
s177661466
| 192 | 86 | 40,432 | 65,692 |
Accepted
|
Accepted
| 55.21 |
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
n = int(eval(input()))
i = 1
ab = set()
while i ** 2 <= n:
if n % i == 0:
ab.add((i, n // i))
i += 1
def digit(n):
ans = 0
while n > 0:
ans += 1
n //= 10
return ans
ans = 10 ** 10
for a, b in ab:
ans = min(ans, max(digit(a), digit(b)))
print(ans)
|
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
n = int(eval(input()))
def digit(n):
l = 0
while n:
l += 1
n //= 10
return l
ans = 100
i = 1
while i ** 2 <= n:
if n % i == 0:
#ans = min(ans, max(len(str(i)), len(str(n // i))))
ans = min(ans, max(digit(i), digit(n // i)))
i += 1
print(ans)
| 25 | 21 | 387 | 380 |
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
n = int(eval(input()))
i = 1
ab = set()
while i**2 <= n:
if n % i == 0:
ab.add((i, n // i))
i += 1
def digit(n):
ans = 0
while n > 0:
ans += 1
n //= 10
return ans
ans = 10**10
for a, b in ab:
ans = min(ans, max(digit(a), digit(b)))
print(ans)
|
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
n = int(eval(input()))
def digit(n):
l = 0
while n:
l += 1
n //= 10
return l
ans = 100
i = 1
while i**2 <= n:
if n % i == 0:
# ans = min(ans, max(len(str(i)), len(str(n // i))))
ans = min(ans, max(digit(i), digit(n // i)))
i += 1
print(ans)
| false | 16 |
[
"-i = 1",
"-ab = set()",
"-while i**2 <= n:",
"- if n % i == 0:",
"- ab.add((i, n // i))",
"- i += 1",
"- ans = 0",
"- while n > 0:",
"- ans += 1",
"+ l = 0",
"+ while n:",
"+ l += 1",
"- return ans",
"+ return l",
"-ans = 10**10",
"-for a, b in ab:",
"- ans = min(ans, max(digit(a), digit(b)))",
"+ans = 100",
"+i = 1",
"+while i**2 <= n:",
"+ if n % i == 0:",
"+ # ans = min(ans, max(len(str(i)), len(str(n // i))))",
"+ ans = min(ans, max(digit(i), digit(n // i)))",
"+ i += 1"
] | false | 0.061722 | 0.062387 | 0.989337 |
[
"s699386059",
"s177661466"
] |
u281610856
|
p03162
|
python
|
s927899763
|
s661082570
| 1,094 | 659 | 47,272 | 68,716 |
Accepted
|
Accepted
| 39.76 |
n = int(eval(input()))
a = [0] * n
for x in range(n):
a[x] = list(map(int, input().split()))
# print(a)
dp = [[0 for _ in range(3)] for _ in range(n+1)]
# print(dp)
for i in range(n):
for j in range(3):
for k in range(3):
if j == k:
continue
dp[i + 1][k] = max(dp[i + 1][k], dp[i][j] + a[i][k])
# print(dp)
print((max(dp[n])))
|
MAX_N = 10 ** 5 + 10
N = int(eval(input()))
dp = [[0] * 3 for _ in range(MAX_N)]
arr = [0] * MAX_N
for i in range(N):
arr[i] = list(map(int, input().split()))
for i in range(N):
for j in range(3):
for k in range(3):
if j == k:
continue
dp[i+1][k] = max(dp[i+1][k], dp[i][j] + arr[i][k])
print((max(dp[N])))
| 15 | 14 | 388 | 368 |
n = int(eval(input()))
a = [0] * n
for x in range(n):
a[x] = list(map(int, input().split()))
# print(a)
dp = [[0 for _ in range(3)] for _ in range(n + 1)]
# print(dp)
for i in range(n):
for j in range(3):
for k in range(3):
if j == k:
continue
dp[i + 1][k] = max(dp[i + 1][k], dp[i][j] + a[i][k])
# print(dp)
print((max(dp[n])))
|
MAX_N = 10**5 + 10
N = int(eval(input()))
dp = [[0] * 3 for _ in range(MAX_N)]
arr = [0] * MAX_N
for i in range(N):
arr[i] = list(map(int, input().split()))
for i in range(N):
for j in range(3):
for k in range(3):
if j == k:
continue
dp[i + 1][k] = max(dp[i + 1][k], dp[i][j] + arr[i][k])
print((max(dp[N])))
| false | 6.666667 |
[
"-n = int(eval(input()))",
"-a = [0] * n",
"-for x in range(n):",
"- a[x] = list(map(int, input().split()))",
"-# print(a)",
"-dp = [[0 for _ in range(3)] for _ in range(n + 1)]",
"-# print(dp)",
"-for i in range(n):",
"+MAX_N = 10**5 + 10",
"+N = int(eval(input()))",
"+dp = [[0] * 3 for _ in range(MAX_N)]",
"+arr = [0] * MAX_N",
"+for i in range(N):",
"+ arr[i] = list(map(int, input().split()))",
"+for i in range(N):",
"- dp[i + 1][k] = max(dp[i + 1][k], dp[i][j] + a[i][k])",
"-# print(dp)",
"-print((max(dp[n])))",
"+ dp[i + 1][k] = max(dp[i + 1][k], dp[i][j] + arr[i][k])",
"+print((max(dp[N])))"
] | false | 0.091827 | 0.119172 | 0.770542 |
[
"s927899763",
"s661082570"
] |
u535803878
|
p02744
|
python
|
s481891943
|
s328503138
| 494 | 440 | 139,736 | 155,736 |
Accepted
|
Accepted
| 10.93 |
# パナソニック2020D
from queue import deque
n = int(eval(input()))
q = deque([("a", "a")])
while True:
s, m = q.pop()
if len(s)==n:
print(s)
elif len(s)>=n+1:
break
for o in range(ord("a"), ord(m)+2):
if ord(m)<o:
m = chr(o)
q.appendleft((s + chr(o), m))
|
# パナソニック2020D
import sys
write = lambda x: sys.stdout.write(x+"\n")
from queue import deque
n = int(eval(input()))
q = deque([("a", "a")])
while True:
s, m = q.pop()
if len(s)==n:
write(s)
elif len(s)>=n+1:
break
for o in range(ord("a"), ord(m)+2):
if ord(m)<o:
m = chr(o)
q.appendleft((s + chr(o), m))
| 14 | 16 | 315 | 371 |
# パナソニック2020D
from queue import deque
n = int(eval(input()))
q = deque([("a", "a")])
while True:
s, m = q.pop()
if len(s) == n:
print(s)
elif len(s) >= n + 1:
break
for o in range(ord("a"), ord(m) + 2):
if ord(m) < o:
m = chr(o)
q.appendleft((s + chr(o), m))
|
# パナソニック2020D
import sys
write = lambda x: sys.stdout.write(x + "\n")
from queue import deque
n = int(eval(input()))
q = deque([("a", "a")])
while True:
s, m = q.pop()
if len(s) == n:
write(s)
elif len(s) >= n + 1:
break
for o in range(ord("a"), ord(m) + 2):
if ord(m) < o:
m = chr(o)
q.appendleft((s + chr(o), m))
| false | 12.5 |
[
"+import sys",
"+",
"+write = lambda x: sys.stdout.write(x + \"\\n\")",
"- print(s)",
"+ write(s)"
] | false | 0.09061 | 0.0448 | 2.02254 |
[
"s481891943",
"s328503138"
] |
u298297089
|
p03330
|
python
|
s222938177
|
s961076147
| 237 | 219 | 3,188 | 3,188 |
Accepted
|
Accepted
| 7.59 |
n,c = list(map(int, input().split()))
color, grid = [], []
for _ in range(c):
color.append(list(map(int, input().split())))
grid = {i:{} for i in range(3)}
for i in range(n):
for j,t in enumerate(map(int, input().split())):
t -= 1
if t not in grid[(i+j + 2) % 3]:
grid[(i+j + 2) % 3][t] = 0
grid[(i+j + 2) % 3][t] += 1
costs = [[0 for _ in range(c)],[0 for _ in range(c)],[0 for _ in range(c)]]
for cc in range(c):
for i in range(3):
for d,cnt in list(grid[i].items()):
costs[i][cc] += color[d][cc] * cnt
x = sorted(list(range(c)), key=lambda x: costs[0][x])[:3]
y = sorted(list(range(c)), key=lambda x: costs[1][x])[:3]
z = sorted(list(range(c)), key=lambda x: costs[2][x])[:3]
mn = 10**9
for i in x:
for j in y:
for k in z:
if i == j or j == k or k == i:
continue
if mn > costs[0][i] + costs[1][j] + costs[2][k]:
mn = costs[0][i] + costs[1][j] + costs[2][k]
print(mn)
|
import sys
input = sys.stdin.readline
n,c = list(map(int, input().split()))
color = []
for _ in range(c):
color.append(list(map(int, input().split())))
grid = {i:{} for i in range(3)}
for i in range(n):
for j,t in enumerate(map(int, input().split())):
t -= 1
if t not in grid[(i+j + 2) % 3]:
grid[(i+j + 2) % 3][t] = 0
grid[(i+j + 2) % 3][t] += 1
costs = [[0 for _ in range(c)],[0 for _ in range(c)],[0 for _ in range(c)]]
for cc in range(c):
for i in range(3):
for d,cnt in list(grid[i].items()):
costs[i][cc] += color[d][cc] * cnt
rc = list(range(c))
x = sorted(list(rc), key=lambda x: costs[0][x])[:3]
y = sorted(list(rc), key=lambda x: costs[1][x])[:3]
z = sorted(list(rc), key=lambda x: costs[2][x])[:3]
mn = 10**9
for i in x:
for j in y:
for k in z:
if i == j or j == k or k == i:
continue
if mn > costs[0][i] + costs[1][j] + costs[2][k]:
mn = costs[0][i] + costs[1][j] + costs[2][k]
print(mn)
| 31 | 36 | 1,026 | 1,057 |
n, c = list(map(int, input().split()))
color, grid = [], []
for _ in range(c):
color.append(list(map(int, input().split())))
grid = {i: {} for i in range(3)}
for i in range(n):
for j, t in enumerate(map(int, input().split())):
t -= 1
if t not in grid[(i + j + 2) % 3]:
grid[(i + j + 2) % 3][t] = 0
grid[(i + j + 2) % 3][t] += 1
costs = [[0 for _ in range(c)], [0 for _ in range(c)], [0 for _ in range(c)]]
for cc in range(c):
for i in range(3):
for d, cnt in list(grid[i].items()):
costs[i][cc] += color[d][cc] * cnt
x = sorted(list(range(c)), key=lambda x: costs[0][x])[:3]
y = sorted(list(range(c)), key=lambda x: costs[1][x])[:3]
z = sorted(list(range(c)), key=lambda x: costs[2][x])[:3]
mn = 10**9
for i in x:
for j in y:
for k in z:
if i == j or j == k or k == i:
continue
if mn > costs[0][i] + costs[1][j] + costs[2][k]:
mn = costs[0][i] + costs[1][j] + costs[2][k]
print(mn)
|
import sys
input = sys.stdin.readline
n, c = list(map(int, input().split()))
color = []
for _ in range(c):
color.append(list(map(int, input().split())))
grid = {i: {} for i in range(3)}
for i in range(n):
for j, t in enumerate(map(int, input().split())):
t -= 1
if t not in grid[(i + j + 2) % 3]:
grid[(i + j + 2) % 3][t] = 0
grid[(i + j + 2) % 3][t] += 1
costs = [[0 for _ in range(c)], [0 for _ in range(c)], [0 for _ in range(c)]]
for cc in range(c):
for i in range(3):
for d, cnt in list(grid[i].items()):
costs[i][cc] += color[d][cc] * cnt
rc = list(range(c))
x = sorted(list(rc), key=lambda x: costs[0][x])[:3]
y = sorted(list(rc), key=lambda x: costs[1][x])[:3]
z = sorted(list(rc), key=lambda x: costs[2][x])[:3]
mn = 10**9
for i in x:
for j in y:
for k in z:
if i == j or j == k or k == i:
continue
if mn > costs[0][i] + costs[1][j] + costs[2][k]:
mn = costs[0][i] + costs[1][j] + costs[2][k]
print(mn)
| false | 13.888889 |
[
"+import sys",
"+",
"+input = sys.stdin.readline",
"-color, grid = [], []",
"+color = []",
"-x = sorted(list(range(c)), key=lambda x: costs[0][x])[:3]",
"-y = sorted(list(range(c)), key=lambda x: costs[1][x])[:3]",
"-z = sorted(list(range(c)), key=lambda x: costs[2][x])[:3]",
"+rc = list(range(c))",
"+x = sorted(list(rc), key=lambda x: costs[0][x])[:3]",
"+y = sorted(list(rc), key=lambda x: costs[1][x])[:3]",
"+z = sorted(list(rc), key=lambda x: costs[2][x])[:3]"
] | false | 0.045848 | 0.034692 | 1.32158 |
[
"s222938177",
"s961076147"
] |
u419877586
|
p02779
|
python
|
s642258229
|
s254535515
| 282 | 147 | 86,228 | 33,996 |
Accepted
|
Accepted
| 47.87 |
N=int(eval(input()))
A=list(map(int, input().split()))
A.sort()
ans="YES"
for i in range(N-1):
if A[i]==A[i+1]:
ans="NO"
break
print(ans)
|
from collections import defaultdict
N = int(eval(input()))
A = list(map(int, input().split()))
d = defaultdict(int)
for a in A:
d[a] += 1
if len(d) == N:
print("YES")
else:
print("NO")
| 9 | 13 | 159 | 205 |
N = int(eval(input()))
A = list(map(int, input().split()))
A.sort()
ans = "YES"
for i in range(N - 1):
if A[i] == A[i + 1]:
ans = "NO"
break
print(ans)
|
from collections import defaultdict
N = int(eval(input()))
A = list(map(int, input().split()))
d = defaultdict(int)
for a in A:
d[a] += 1
if len(d) == N:
print("YES")
else:
print("NO")
| false | 30.769231 |
[
"+from collections import defaultdict",
"+",
"-A.sort()",
"-ans = \"YES\"",
"-for i in range(N - 1):",
"- if A[i] == A[i + 1]:",
"- ans = \"NO\"",
"- break",
"-print(ans)",
"+d = defaultdict(int)",
"+for a in A:",
"+ d[a] += 1",
"+if len(d) == N:",
"+ print(\"YES\")",
"+else:",
"+ print(\"NO\")"
] | false | 0.079015 | 0.035518 | 2.224672 |
[
"s642258229",
"s254535515"
] |
u363407238
|
p03370
|
python
|
s232872096
|
s281846016
| 36 | 17 | 3,060 | 2,940 |
Accepted
|
Accepted
| 52.78 |
n,x=list(map(int, input().split()))
min_cost=float('inf')
cnt=0
for i in range(n):
mi = int(eval(input()))
x -= mi
cnt += 1
min_cost = min(min_cost,mi)
while x >= min_cost:
x -= min_cost
cnt += 1
print(cnt)
|
n,x = list(map(int, input().split()))
l = [int(eval(input())) for _ in range(n)]
print((len(l)+(x-sum(l))//min(l)))
| 12 | 3 | 229 | 103 |
n, x = list(map(int, input().split()))
min_cost = float("inf")
cnt = 0
for i in range(n):
mi = int(eval(input()))
x -= mi
cnt += 1
min_cost = min(min_cost, mi)
while x >= min_cost:
x -= min_cost
cnt += 1
print(cnt)
|
n, x = list(map(int, input().split()))
l = [int(eval(input())) for _ in range(n)]
print((len(l) + (x - sum(l)) // min(l)))
| false | 75 |
[
"-min_cost = float(\"inf\")",
"-cnt = 0",
"-for i in range(n):",
"- mi = int(eval(input()))",
"- x -= mi",
"- cnt += 1",
"- min_cost = min(min_cost, mi)",
"-while x >= min_cost:",
"- x -= min_cost",
"- cnt += 1",
"-print(cnt)",
"+l = [int(eval(input())) for _ in range(n)]",
"+print((len(l) + (x - sum(l)) // min(l)))"
] | false | 0.038701 | 0.076949 | 0.502942 |
[
"s232872096",
"s281846016"
] |
u146803137
|
p03289
|
python
|
s428458134
|
s971672471
| 169 | 29 | 38,384 | 9,100 |
Accepted
|
Accepted
| 82.84 |
import sys
s = eval(input())
ans = 'AC'
c = 0
if s[0] != 'A':
ans = "WA"
for i in range(2,len(s)-1):
if "C" == s[i]:
c += 1
if c != 1:
ans = "WA"
c = 0
for i in range(len(s)):
a = ord(s[i])
if 65 <= a and a <= 96:
c += 1
if c != 2:
ans = "WA"
print(ans)
|
s = eval(input())
ans = 'AC'
if s[0] != 'A':
ans = 'WA'
if not('C' in s[2:-1]):
ans = 'WA'
s = s.replace('A','')
s = s.replace('C','',1)
for i in s:
if ord(i) < ord('a') or ord(i) > ord('z'):
ans = 'WA'
print(ans)
| 19 | 12 | 305 | 239 |
import sys
s = eval(input())
ans = "AC"
c = 0
if s[0] != "A":
ans = "WA"
for i in range(2, len(s) - 1):
if "C" == s[i]:
c += 1
if c != 1:
ans = "WA"
c = 0
for i in range(len(s)):
a = ord(s[i])
if 65 <= a and a <= 96:
c += 1
if c != 2:
ans = "WA"
print(ans)
|
s = eval(input())
ans = "AC"
if s[0] != "A":
ans = "WA"
if not ("C" in s[2:-1]):
ans = "WA"
s = s.replace("A", "")
s = s.replace("C", "", 1)
for i in s:
if ord(i) < ord("a") or ord(i) > ord("z"):
ans = "WA"
print(ans)
| false | 36.842105 |
[
"-import sys",
"-",
"-c = 0",
"-for i in range(2, len(s) - 1):",
"- if \"C\" == s[i]:",
"- c += 1",
"-if c != 1:",
"+if not (\"C\" in s[2:-1]):",
"-c = 0",
"-for i in range(len(s)):",
"- a = ord(s[i])",
"- if 65 <= a and a <= 96:",
"- c += 1",
"-if c != 2:",
"- ans = \"WA\"",
"+s = s.replace(\"A\", \"\")",
"+s = s.replace(\"C\", \"\", 1)",
"+for i in s:",
"+ if ord(i) < ord(\"a\") or ord(i) > ord(\"z\"):",
"+ ans = \"WA\""
] | false | 0.036293 | 0.033204 | 1.093049 |
[
"s428458134",
"s971672471"
] |
u365686736
|
p02401
|
python
|
s786512771
|
s583168484
| 30 | 20 | 5,548 | 5,548 |
Accepted
|
Accepted
| 33.33 |
while True:
s = eval(input())
if '?' in s:
break
print((int(eval(s))))
|
while 1:
s = eval(input())
if '?' in s:break
print((int(eval(s))))
| 5 | 4 | 87 | 74 |
while True:
s = eval(input())
if "?" in s:
break
print((int(eval(s))))
|
while 1:
s = eval(input())
if "?" in s:
break
print((int(eval(s))))
| false | 20 |
[
"-while True:",
"+while 1:"
] | false | 0.038876 | 0.038725 | 1.003897 |
[
"s786512771",
"s583168484"
] |
u243312682
|
p02780
|
python
|
s002232397
|
s879247706
| 169 | 139 | 32,000 | 31,892 |
Accepted
|
Accepted
| 17.75 |
n, k = list(map(int, input().split()))
P = [int(x) for x in input().split()]
p_e = list()
exp = 0
for p in P:
# 期待値
# 累積和
exp += (1+p)/2
p_e.append(exp)
# この後差を取るので
# n==kの時とそうでない時でやり方を分けないとだめ
if n == k:
print((p_e[-1]))
else:
# 初期値
maxv = p_e[k-1] - 0
for i in range(1, n-k):
# 隣接するk個の期待値の和
p_sum = p_e[k+i] - p_e[i]
maxv = max(maxv, p_sum)
print(maxv)
|
def main():
n, k = list(map(int, input().split()))
P = [int(x) for x in input().split()]
p_e = list()
exp = 0
for p in P:
# 期待値
# 累積和
exp += (1+p)/2
p_e.append(exp)
# 初期値
maxv = p_e[k-1] - 0
for i in range(1, n-k):
# 隣接するk個の期待値の和
p_sum = p_e[k+i] - p_e[i]
maxv = max(maxv, p_sum)
print(maxv)
if __name__ == '__main__':
main()
| 21 | 19 | 427 | 434 |
n, k = list(map(int, input().split()))
P = [int(x) for x in input().split()]
p_e = list()
exp = 0
for p in P:
# 期待値
# 累積和
exp += (1 + p) / 2
p_e.append(exp)
# この後差を取るので
# n==kの時とそうでない時でやり方を分けないとだめ
if n == k:
print((p_e[-1]))
else:
# 初期値
maxv = p_e[k - 1] - 0
for i in range(1, n - k):
# 隣接するk個の期待値の和
p_sum = p_e[k + i] - p_e[i]
maxv = max(maxv, p_sum)
print(maxv)
|
def main():
n, k = list(map(int, input().split()))
P = [int(x) for x in input().split()]
p_e = list()
exp = 0
for p in P:
# 期待値
# 累積和
exp += (1 + p) / 2
p_e.append(exp)
# 初期値
maxv = p_e[k - 1] - 0
for i in range(1, n - k):
# 隣接するk個の期待値の和
p_sum = p_e[k + i] - p_e[i]
maxv = max(maxv, p_sum)
print(maxv)
if __name__ == "__main__":
main()
| false | 9.52381 |
[
"-n, k = list(map(int, input().split()))",
"-P = [int(x) for x in input().split()]",
"-p_e = list()",
"-exp = 0",
"-for p in P:",
"- # 期待値",
"- # 累積和",
"- exp += (1 + p) / 2",
"- p_e.append(exp)",
"-# この後差を取るので",
"-# n==kの時とそうでない時でやり方を分けないとだめ",
"-if n == k:",
"- print((p_e[-1]))",
"-else:",
"+def main():",
"+ n, k = list(map(int, input().split()))",
"+ P = [int(x) for x in input().split()]",
"+ p_e = list()",
"+ exp = 0",
"+ for p in P:",
"+ # 期待値",
"+ # 累積和",
"+ exp += (1 + p) / 2",
"+ p_e.append(exp)",
"+",
"+",
"+if __name__ == \"__main__\":",
"+ main()"
] | false | 0.119598 | 0.045195 | 2.646272 |
[
"s002232397",
"s879247706"
] |
u820351940
|
p03167
|
python
|
s898767844
|
s144415760
| 1,002 | 584 | 265,992 | 246,364 |
Accepted
|
Accepted
| 41.72 |
import sys
sys.setrecursionlimit(10**6)
h, w = list(map(int, input().split()))
field = [list(eval(input())) for _ in range(h)]
dp = [[None] * w for _ in range(h)]
def dfs(hindex=h - 1, windex=w - 1):
if field[hindex][windex] == "#":
return 0
if hindex == windex == 0:
return 1
if dp[hindex][windex] is not None:
return dp[hindex][windex]
r = (hindex and dfs(hindex - 1, windex)) + (windex and dfs(hindex, windex - 1))
dp[hindex][windex] = r
return r
print((dfs() % (10**9 + 7)))
|
import sys
sys.setrecursionlimit(10**6)
h, w = list(map(int, input().split()))
field = [list(eval(input())) for _ in range(h)]
dp = [[None] * w for _ in range(h)]
# def dfs(hindex=h - 1, windex=w - 1):
# if field[hindex][windex] == "#":
# return 0
# if hindex == windex == 0:
# return 1
#
# if dp[hindex][windex] is not None:
# return dp[hindex][windex]
# r = (hindex and dfs(hindex - 1, windex)) + (windex and dfs(hindex, windex - 1))
# dp[hindex][windex] = r
# return r
#
# print(dfs() % (10**9 + 7))
for hindex in range(h):
for windex in range(w):
if hindex == windex == 0:
dp[hindex][windex] = 1
elif field[hindex][windex] == "#":
dp[hindex][windex] = 0
else:
dp[hindex][windex] = (hindex and dp[hindex - 1][windex]) + (windex and dp[hindex][windex - 1])
print((dp[hindex][windex] % (10**9 + 7)))
| 20 | 30 | 536 | 931 |
import sys
sys.setrecursionlimit(10**6)
h, w = list(map(int, input().split()))
field = [list(eval(input())) for _ in range(h)]
dp = [[None] * w for _ in range(h)]
def dfs(hindex=h - 1, windex=w - 1):
if field[hindex][windex] == "#":
return 0
if hindex == windex == 0:
return 1
if dp[hindex][windex] is not None:
return dp[hindex][windex]
r = (hindex and dfs(hindex - 1, windex)) + (windex and dfs(hindex, windex - 1))
dp[hindex][windex] = r
return r
print((dfs() % (10**9 + 7)))
|
import sys
sys.setrecursionlimit(10**6)
h, w = list(map(int, input().split()))
field = [list(eval(input())) for _ in range(h)]
dp = [[None] * w for _ in range(h)]
# def dfs(hindex=h - 1, windex=w - 1):
# if field[hindex][windex] == "#":
# return 0
# if hindex == windex == 0:
# return 1
#
# if dp[hindex][windex] is not None:
# return dp[hindex][windex]
# r = (hindex and dfs(hindex - 1, windex)) + (windex and dfs(hindex, windex - 1))
# dp[hindex][windex] = r
# return r
#
# print(dfs() % (10**9 + 7))
for hindex in range(h):
for windex in range(w):
if hindex == windex == 0:
dp[hindex][windex] = 1
elif field[hindex][windex] == "#":
dp[hindex][windex] = 0
else:
dp[hindex][windex] = (hindex and dp[hindex - 1][windex]) + (
windex and dp[hindex][windex - 1]
)
print((dp[hindex][windex] % (10**9 + 7)))
| false | 33.333333 |
[
"-",
"-",
"-def dfs(hindex=h - 1, windex=w - 1):",
"- if field[hindex][windex] == \"#\":",
"- return 0",
"- if hindex == windex == 0:",
"- return 1",
"- if dp[hindex][windex] is not None:",
"- return dp[hindex][windex]",
"- r = (hindex and dfs(hindex - 1, windex)) + (windex and dfs(hindex, windex - 1))",
"- dp[hindex][windex] = r",
"- return r",
"-",
"-",
"-print((dfs() % (10**9 + 7)))",
"+# def dfs(hindex=h - 1, windex=w - 1):",
"+# if field[hindex][windex] == \"#\":",
"+# return 0",
"+# if hindex == windex == 0:",
"+# return 1",
"+#",
"+# if dp[hindex][windex] is not None:",
"+# return dp[hindex][windex]",
"+# r = (hindex and dfs(hindex - 1, windex)) + (windex and dfs(hindex, windex - 1))",
"+# dp[hindex][windex] = r",
"+# return r",
"+#",
"+# print(dfs() % (10**9 + 7))",
"+for hindex in range(h):",
"+ for windex in range(w):",
"+ if hindex == windex == 0:",
"+ dp[hindex][windex] = 1",
"+ elif field[hindex][windex] == \"#\":",
"+ dp[hindex][windex] = 0",
"+ else:",
"+ dp[hindex][windex] = (hindex and dp[hindex - 1][windex]) + (",
"+ windex and dp[hindex][windex - 1]",
"+ )",
"+print((dp[hindex][windex] % (10**9 + 7)))"
] | false | 0.046542 | 0.091803 | 0.506978 |
[
"s898767844",
"s144415760"
] |
u084963909
|
p02711
|
python
|
s106533232
|
s521546208
| 24 | 22 | 9,024 | 8,960 |
Accepted
|
Accepted
| 8.33 |
s = eval(input())
for c in s:
if '7' in s:
print("Yes")
break
else:
print("No")
break
|
n=eval(input(""))
x=0
while x<3:
if n[x]=="7":
print("Yes")
break
x=x+1
if x==3: print("No")
| 9 | 9 | 128 | 124 |
s = eval(input())
for c in s:
if "7" in s:
print("Yes")
break
else:
print("No")
break
|
n = eval(input(""))
x = 0
while x < 3:
if n[x] == "7":
print("Yes")
break
x = x + 1
if x == 3:
print("No")
| false | 0 |
[
"-s = eval(input())",
"-for c in s:",
"- if \"7\" in s:",
"+n = eval(input(\"\"))",
"+x = 0",
"+while x < 3:",
"+ if n[x] == \"7\":",
"- else:",
"+ x = x + 1",
"+ if x == 3:",
"- break"
] | false | 0.041982 | 0.104406 | 0.402102 |
[
"s106533232",
"s521546208"
] |
u051684204
|
p02923
|
python
|
s094156936
|
s462503520
| 101 | 69 | 14,252 | 14,224 |
Accepted
|
Accepted
| 31.68 |
N=int(eval(input()))
H = list(map(int, input().split()))
I=[H[i]-H[i+1] for i in range(N-1)]
a=0
n=0
j=0
while j<N-1:
if I[j]>=0:
j+=1
n+=1
else:
j+=1
a=max(n,a)
n=0
a=max(n,a)
print(a)
|
N=int(eval(input()))
ls=list(map(int,input().split()))
if N==1:
print((0))
exit()
a=[]
k=0
for i in range(N-1):
if ls[i]>=ls[i+1]:
k+=1
else:
a.append(k)
k=0
a.append(k)
print((max(a)))
| 16 | 15 | 218 | 209 |
N = int(eval(input()))
H = list(map(int, input().split()))
I = [H[i] - H[i + 1] for i in range(N - 1)]
a = 0
n = 0
j = 0
while j < N - 1:
if I[j] >= 0:
j += 1
n += 1
else:
j += 1
a = max(n, a)
n = 0
a = max(n, a)
print(a)
|
N = int(eval(input()))
ls = list(map(int, input().split()))
if N == 1:
print((0))
exit()
a = []
k = 0
for i in range(N - 1):
if ls[i] >= ls[i + 1]:
k += 1
else:
a.append(k)
k = 0
a.append(k)
print((max(a)))
| false | 6.25 |
[
"-H = list(map(int, input().split()))",
"-I = [H[i] - H[i + 1] for i in range(N - 1)]",
"-a = 0",
"-n = 0",
"-j = 0",
"-while j < N - 1:",
"- if I[j] >= 0:",
"- j += 1",
"- n += 1",
"+ls = list(map(int, input().split()))",
"+if N == 1:",
"+ print((0))",
"+ exit()",
"+a = []",
"+k = 0",
"+for i in range(N - 1):",
"+ if ls[i] >= ls[i + 1]:",
"+ k += 1",
"- j += 1",
"- a = max(n, a)",
"- n = 0",
"-a = max(n, a)",
"-print(a)",
"+ a.append(k)",
"+ k = 0",
"+a.append(k)",
"+print((max(a)))"
] | false | 0.035408 | 0.036129 | 0.980041 |
[
"s094156936",
"s462503520"
] |
u046187684
|
p02912
|
python
|
s525272210
|
s367762838
| 118 | 104 | 14,224 | 15,172 |
Accepted
|
Accepted
| 11.86 |
n,m = list(map(int,input().split()))
arr = list(map(int,input().split()))
l = len(arr)
while m != 0 :
arr.sort(reverse=True)
j = arr[0] // 2
for i in range(l):
if arr[i] > j:
if m != 0:
m -= 1
else:
break
arr[i] //= 2
else:
break
if arr[0] == 0:
break
print((sum(arr)))
|
from heapq import heappush, heappop
def solve(string):
n, m, *a = list(map(int, string.split()))
while m > 0:
a.sort(reverse=True)
if a[0] == 0:
break
b = a[0] // 2
for i, _a in enumerate(a):
if m == 0 or _a <= b:
break
a[i] //= 2
m -= 1
return str(sum(a))
if __name__ == '__main__':
print((solve('\n'.join([eval(input()), eval(input())]))))
| 21 | 20 | 457 | 457 |
n, m = list(map(int, input().split()))
arr = list(map(int, input().split()))
l = len(arr)
while m != 0:
arr.sort(reverse=True)
j = arr[0] // 2
for i in range(l):
if arr[i] > j:
if m != 0:
m -= 1
else:
break
arr[i] //= 2
else:
break
if arr[0] == 0:
break
print((sum(arr)))
|
from heapq import heappush, heappop
def solve(string):
n, m, *a = list(map(int, string.split()))
while m > 0:
a.sort(reverse=True)
if a[0] == 0:
break
b = a[0] // 2
for i, _a in enumerate(a):
if m == 0 or _a <= b:
break
a[i] //= 2
m -= 1
return str(sum(a))
if __name__ == "__main__":
print((solve("\n".join([eval(input()), eval(input())]))))
| false | 4.761905 |
[
"-n, m = list(map(int, input().split()))",
"-arr = list(map(int, input().split()))",
"-l = len(arr)",
"-while m != 0:",
"- arr.sort(reverse=True)",
"- j = arr[0] // 2",
"- for i in range(l):",
"- if arr[i] > j:",
"- if m != 0:",
"- m -= 1",
"- else:",
"+from heapq import heappush, heappop",
"+",
"+",
"+def solve(string):",
"+ n, m, *a = list(map(int, string.split()))",
"+ while m > 0:",
"+ a.sort(reverse=True)",
"+ if a[0] == 0:",
"+ break",
"+ b = a[0] // 2",
"+ for i, _a in enumerate(a):",
"+ if m == 0 or _a <= b:",
"- arr[i] //= 2",
"- else:",
"- break",
"- if arr[0] == 0:",
"- break",
"-print((sum(arr)))",
"+ a[i] //= 2",
"+ m -= 1",
"+ return str(sum(a))",
"+",
"+",
"+if __name__ == \"__main__\":",
"+ print((solve(\"\\n\".join([eval(input()), eval(input())]))))"
] | false | 0.03687 | 0.036921 | 0.998615 |
[
"s525272210",
"s367762838"
] |
u634490486
|
p02384
|
python
|
s288934228
|
s223399952
| 120 | 40 | 7,344 | 7,100 |
Accepted
|
Accepted
| 66.67 |
from sys import stdin
from copy import deepcopy
import queue
class Dice:
def __init__(self, nums):
self.labels = [None] + [ nums[i] for i in range(6) ]
self.pos = {
"E" : 3,
"W" : 4,
"S" : 2,
"N" : 5,
"T" : 1,
"B" : 6
}
def rolled(dice, queries):
d = deepcopy(dice)
for q in queries:
if q == "E":
d.pos["T"], d.pos["E"], d.pos["B"], d.pos["W"] = d.pos["W"], d.pos["T"], d.pos["E"], d.pos["B"]
elif q == "W":
d.pos["T"], d.pos["E"], d.pos["B"], d.pos["W"] = d.pos["E"], d.pos["B"], d.pos["W"], d.pos["T"]
elif q == "S":
d.pos["T"], d.pos["S"], d.pos["B"], d.pos["N"] = d.pos["N"], d.pos["T"], d.pos["S"], d.pos["B"]
elif q == "N":
d.pos["T"], d.pos["S"], d.pos["B"], d.pos["N"] = d.pos["S"], d.pos["B"], d.pos["N"], d.pos["T"]
else:
return d
nums = [int(x) for x in stdin.readline().rstrip().split()]
q = int(stdin.readline().rstrip())
dice = Dice(nums)
# TとSに対応するクエリを記憶し, resをすぐに呼び出せるようにする
memo = [[False] * 7 for i in range(7)]
memo[dice.pos["T"]][dice.pos["S"]] = ""
# クエリとさいころの東面を記憶
res = { "" : dice.labels[dice.pos["E"]] }
# BFSで探索, 解を求めたらreturn Trueで抜け出す
# diceの中身をいじってはならない
def solve(T, S):
que = queue.Queue()
que.put(dice)
sol_q = ["E", "N", "S", "W"]
while not que.empty():
d = que.get()
if d.pos["T"] == T and d.pos["S"] == S:
break
else:
for i in sol_q:
d_next = Dice.rolled(d, i)
que.put(d_next)
memo[d_next.pos["T"]][d_next.pos["S"]] = memo[d.pos["T"]][d.pos["S"]] + i
res[memo[d_next.pos["T"]][d_next.pos["S"]]] = d_next.labels[d_next.pos["E"]]
else:
return memo[T][S]
for i in range(q):
ts = [int(x) for x in stdin.readline().rstrip().split()]
T = dice.labels.index(ts[0])
S = dice.labels.index(ts[1])
if solve(T, S) != False:
print((res[memo[T][S]]))
|
from sys import stdin
from copy import deepcopy
import queue
class Dice:
def __init__(self, nums):
self.labels = [None] + [ nums[i] for i in range(6) ]
self.pos = {
"E" : 3,
"W" : 4,
"S" : 2,
"N" : 5,
"T" : 1,
"B" : 6
}
def rolled(dice, queries):
d = deepcopy(dice)
for q in queries:
if q == "E":
d.pos["T"], d.pos["E"], d.pos["B"], d.pos["W"] = d.pos["W"], d.pos["T"], d.pos["E"], d.pos["B"]
elif q == "W":
d.pos["T"], d.pos["E"], d.pos["B"], d.pos["W"] = d.pos["E"], d.pos["B"], d.pos["W"], d.pos["T"]
elif q == "S":
d.pos["T"], d.pos["S"], d.pos["B"], d.pos["N"] = d.pos["N"], d.pos["T"], d.pos["S"], d.pos["B"]
elif q == "N":
d.pos["T"], d.pos["S"], d.pos["B"], d.pos["N"] = d.pos["S"], d.pos["B"], d.pos["N"], d.pos["T"]
else:
return d
nums = [int(x) for x in stdin.readline().rstrip().split()]
q = int(stdin.readline().rstrip())
dice = Dice(nums)
# TとSに対応するクエリを記憶し, resをすぐに呼び出せるようにする
memo = [[False] * 7 for i in range(7)]
memo[dice.pos["T"]][dice.pos["S"]] = ""
# クエリとさいころの東面を記憶
res = { "" : dice.labels[dice.pos["E"]] }
# BFSで探索, 解を求めたらreturn Trueで抜け出す
# diceの中身をいじってはならない
def solve(T, S):
if isinstance(memo[T][S], str):
return memo[T][S]
que = queue.Queue()
que.put(dice)
sol_q = ["E", "N", "S", "W"]
while not que.empty():
d = que.get()
if d.pos["T"] == T and d.pos["S"] == S:
break
else:
for i in sol_q:
d_next = Dice.rolled(d, i)
que.put(d_next)
memo[d_next.pos["T"]][d_next.pos["S"]] = memo[d.pos["T"]][d.pos["S"]] + i
res[memo[d_next.pos["T"]][d_next.pos["S"]]] = d_next.labels[d_next.pos["E"]]
else:
return memo[T][S]
for i in range(q):
ts = [int(x) for x in stdin.readline().rstrip().split()]
T = dice.labels.index(ts[0])
S = dice.labels.index(ts[1])
if solve(T, S) != False:
print((res[memo[T][S]]))
| 68 | 71 | 2,058 | 2,115 |
from sys import stdin
from copy import deepcopy
import queue
class Dice:
def __init__(self, nums):
self.labels = [None] + [nums[i] for i in range(6)]
self.pos = {"E": 3, "W": 4, "S": 2, "N": 5, "T": 1, "B": 6}
def rolled(dice, queries):
d = deepcopy(dice)
for q in queries:
if q == "E":
d.pos["T"], d.pos["E"], d.pos["B"], d.pos["W"] = (
d.pos["W"],
d.pos["T"],
d.pos["E"],
d.pos["B"],
)
elif q == "W":
d.pos["T"], d.pos["E"], d.pos["B"], d.pos["W"] = (
d.pos["E"],
d.pos["B"],
d.pos["W"],
d.pos["T"],
)
elif q == "S":
d.pos["T"], d.pos["S"], d.pos["B"], d.pos["N"] = (
d.pos["N"],
d.pos["T"],
d.pos["S"],
d.pos["B"],
)
elif q == "N":
d.pos["T"], d.pos["S"], d.pos["B"], d.pos["N"] = (
d.pos["S"],
d.pos["B"],
d.pos["N"],
d.pos["T"],
)
else:
return d
nums = [int(x) for x in stdin.readline().rstrip().split()]
q = int(stdin.readline().rstrip())
dice = Dice(nums)
# TとSに対応するクエリを記憶し, resをすぐに呼び出せるようにする
memo = [[False] * 7 for i in range(7)]
memo[dice.pos["T"]][dice.pos["S"]] = ""
# クエリとさいころの東面を記憶
res = {"": dice.labels[dice.pos["E"]]}
# BFSで探索, 解を求めたらreturn Trueで抜け出す
# diceの中身をいじってはならない
def solve(T, S):
que = queue.Queue()
que.put(dice)
sol_q = ["E", "N", "S", "W"]
while not que.empty():
d = que.get()
if d.pos["T"] == T and d.pos["S"] == S:
break
else:
for i in sol_q:
d_next = Dice.rolled(d, i)
que.put(d_next)
memo[d_next.pos["T"]][d_next.pos["S"]] = (
memo[d.pos["T"]][d.pos["S"]] + i
)
res[memo[d_next.pos["T"]][d_next.pos["S"]]] = d_next.labels[
d_next.pos["E"]
]
else:
return memo[T][S]
for i in range(q):
ts = [int(x) for x in stdin.readline().rstrip().split()]
T = dice.labels.index(ts[0])
S = dice.labels.index(ts[1])
if solve(T, S) != False:
print((res[memo[T][S]]))
|
from sys import stdin
from copy import deepcopy
import queue
class Dice:
def __init__(self, nums):
self.labels = [None] + [nums[i] for i in range(6)]
self.pos = {"E": 3, "W": 4, "S": 2, "N": 5, "T": 1, "B": 6}
def rolled(dice, queries):
d = deepcopy(dice)
for q in queries:
if q == "E":
d.pos["T"], d.pos["E"], d.pos["B"], d.pos["W"] = (
d.pos["W"],
d.pos["T"],
d.pos["E"],
d.pos["B"],
)
elif q == "W":
d.pos["T"], d.pos["E"], d.pos["B"], d.pos["W"] = (
d.pos["E"],
d.pos["B"],
d.pos["W"],
d.pos["T"],
)
elif q == "S":
d.pos["T"], d.pos["S"], d.pos["B"], d.pos["N"] = (
d.pos["N"],
d.pos["T"],
d.pos["S"],
d.pos["B"],
)
elif q == "N":
d.pos["T"], d.pos["S"], d.pos["B"], d.pos["N"] = (
d.pos["S"],
d.pos["B"],
d.pos["N"],
d.pos["T"],
)
else:
return d
nums = [int(x) for x in stdin.readline().rstrip().split()]
q = int(stdin.readline().rstrip())
dice = Dice(nums)
# TとSに対応するクエリを記憶し, resをすぐに呼び出せるようにする
memo = [[False] * 7 for i in range(7)]
memo[dice.pos["T"]][dice.pos["S"]] = ""
# クエリとさいころの東面を記憶
res = {"": dice.labels[dice.pos["E"]]}
# BFSで探索, 解を求めたらreturn Trueで抜け出す
# diceの中身をいじってはならない
def solve(T, S):
if isinstance(memo[T][S], str):
return memo[T][S]
que = queue.Queue()
que.put(dice)
sol_q = ["E", "N", "S", "W"]
while not que.empty():
d = que.get()
if d.pos["T"] == T and d.pos["S"] == S:
break
else:
for i in sol_q:
d_next = Dice.rolled(d, i)
que.put(d_next)
memo[d_next.pos["T"]][d_next.pos["S"]] = (
memo[d.pos["T"]][d.pos["S"]] + i
)
res[memo[d_next.pos["T"]][d_next.pos["S"]]] = d_next.labels[
d_next.pos["E"]
]
else:
return memo[T][S]
for i in range(q):
ts = [int(x) for x in stdin.readline().rstrip().split()]
T = dice.labels.index(ts[0])
S = dice.labels.index(ts[1])
if solve(T, S) != False:
print((res[memo[T][S]]))
| false | 4.225352 |
[
"+ if isinstance(memo[T][S], str):",
"+ return memo[T][S]"
] | false | 0.058574 | 0.054344 | 1.077821 |
[
"s288934228",
"s223399952"
] |
u796942881
|
p02898
|
python
|
s450849770
|
s932675529
| 51 | 47 | 11,872 | 11,872 |
Accepted
|
Accepted
| 7.84 |
N, K, *h = list(map(int, open(0).read().split()))
print((sum(1 for i in [x for x in h if K <= x])))
|
N, K, *h = list(map(int, open(0).read().split()))
print((sum([1 for i in h if K <= i])))
| 2 | 2 | 96 | 82 |
N, K, *h = list(map(int, open(0).read().split()))
print((sum(1 for i in [x for x in h if K <= x])))
|
N, K, *h = list(map(int, open(0).read().split()))
print((sum([1 for i in h if K <= i])))
| false | 0 |
[
"-print((sum(1 for i in [x for x in h if K <= x])))",
"+print((sum([1 for i in h if K <= i])))"
] | false | 0.055363 | 0.039341 | 1.407255 |
[
"s450849770",
"s932675529"
] |
u460245024
|
p03102
|
python
|
s401785677
|
s845359138
| 22 | 17 | 3,444 | 3,064 |
Accepted
|
Accepted
| 22.73 |
import copy
N, M, C = list(map(int, input().split()))
B = list(map(int, input().split()))
As = []
for i in range(N):
As.append(list(map(int, input().split())))
correct_answer_num = 0
for A in As:
result = 0
for j in range(M):
result += A[j] * B[j]
result += C
if result > 0:
correct_answer_num += 1
print(("{}".format(correct_answer_num)))
|
N, M, C = list(map(int, input().split()))
B = list(map(int, input().split()))
As = []
for i in range(N):
As.append(list(map(int, input().split())))
correct_answer_num = 0
for A in As:
result = 0
for j in range(M):
result += A[j] * B[j]
result += C
if result > 0:
correct_answer_num += 1
print(("{}".format(correct_answer_num)))
| 20 | 18 | 392 | 377 |
import copy
N, M, C = list(map(int, input().split()))
B = list(map(int, input().split()))
As = []
for i in range(N):
As.append(list(map(int, input().split())))
correct_answer_num = 0
for A in As:
result = 0
for j in range(M):
result += A[j] * B[j]
result += C
if result > 0:
correct_answer_num += 1
print(("{}".format(correct_answer_num)))
|
N, M, C = list(map(int, input().split()))
B = list(map(int, input().split()))
As = []
for i in range(N):
As.append(list(map(int, input().split())))
correct_answer_num = 0
for A in As:
result = 0
for j in range(M):
result += A[j] * B[j]
result += C
if result > 0:
correct_answer_num += 1
print(("{}".format(correct_answer_num)))
| false | 10 |
[
"-import copy",
"-"
] | false | 0.052207 | 0.052339 | 0.997483 |
[
"s401785677",
"s845359138"
] |
u814986259
|
p03546
|
python
|
s382473517
|
s605924423
| 386 | 211 | 3,828 | 14,040 |
Accepted
|
Accepted
| 45.34 |
import copy
H, W = list(map(int, input().split()))
c = [list(map(int, input().split())) for i in range(10)]
A = [list(map(int, input().split())) for i in range(H)]
# cost = [[-1]*10 for i in range(10)]
# for j in range(10):
# cost[j] = [[c[i][j], i] for i in range(10)]
cost = [-1]*10
cost[1] = 0
dp = [[-1]*10 for i in range(10)]
for i in range(10):
dp[i][i] = 0
def search_cost(i, j, reached):
# if dp[i][j] != -1:
# return dp[i][j]
if cost[i] != -1:
return cost[i]
tmp_list = copy.copy(reached)
tmp_list.append(i)
ret = c[i][j]
for k in range(10):
if k == i or k == 1 or k in reached:
continue
else:
tmp = c[i][k] + search_cost(k, j, tmp_list)
ret = min(tmp, ret)
if ret <= 2:
break
#print("i:"+str(i) + "k:" + str(k) + "j:"+str(j) + "=" + str(tmp))
# dp[i][j] = ret
# for i in range(10):
# print(dp[i])
return ret
for i in range(10):
if i == 1:
continue
else:
if c[i][1] <= 2:
dp[i][1] = c[i][1]
cost[i] = c[i][1]
else:
cost[i] = search_cost(i, 1, [])
ans = 0
for i in range(H):
for j in range(W):
if A[i][j] != -1:
ans += cost[A[i][j]]
print(ans)
|
from scipy.sparse.csgraph import floyd_warshall, csgraph_from_dense
H, W = list(map(int, input().split()))
c = [tuple(map(int, input().split())) for i in range(10)]
A = [list(map(int, input().split())) for i in range(H)]
G = csgraph_from_dense(c)
C = floyd_warshall(G)
ans = 0
for i in range(H):
for j in range(W):
if A[i][j] >= 0:
ans += int(C[A[i][j]][1])
print(ans)
| 55 | 14 | 1,359 | 402 |
import copy
H, W = list(map(int, input().split()))
c = [list(map(int, input().split())) for i in range(10)]
A = [list(map(int, input().split())) for i in range(H)]
# cost = [[-1]*10 for i in range(10)]
# for j in range(10):
# cost[j] = [[c[i][j], i] for i in range(10)]
cost = [-1] * 10
cost[1] = 0
dp = [[-1] * 10 for i in range(10)]
for i in range(10):
dp[i][i] = 0
def search_cost(i, j, reached):
# if dp[i][j] != -1:
# return dp[i][j]
if cost[i] != -1:
return cost[i]
tmp_list = copy.copy(reached)
tmp_list.append(i)
ret = c[i][j]
for k in range(10):
if k == i or k == 1 or k in reached:
continue
else:
tmp = c[i][k] + search_cost(k, j, tmp_list)
ret = min(tmp, ret)
if ret <= 2:
break
# print("i:"+str(i) + "k:" + str(k) + "j:"+str(j) + "=" + str(tmp))
# dp[i][j] = ret
# for i in range(10):
# print(dp[i])
return ret
for i in range(10):
if i == 1:
continue
else:
if c[i][1] <= 2:
dp[i][1] = c[i][1]
cost[i] = c[i][1]
else:
cost[i] = search_cost(i, 1, [])
ans = 0
for i in range(H):
for j in range(W):
if A[i][j] != -1:
ans += cost[A[i][j]]
print(ans)
|
from scipy.sparse.csgraph import floyd_warshall, csgraph_from_dense
H, W = list(map(int, input().split()))
c = [tuple(map(int, input().split())) for i in range(10)]
A = [list(map(int, input().split())) for i in range(H)]
G = csgraph_from_dense(c)
C = floyd_warshall(G)
ans = 0
for i in range(H):
for j in range(W):
if A[i][j] >= 0:
ans += int(C[A[i][j]][1])
print(ans)
| false | 74.545455 |
[
"-import copy",
"+from scipy.sparse.csgraph import floyd_warshall, csgraph_from_dense",
"-c = [list(map(int, input().split())) for i in range(10)]",
"+c = [tuple(map(int, input().split())) for i in range(10)]",
"-# cost = [[-1]*10 for i in range(10)]",
"-# for j in range(10):",
"-# cost[j] = [[c[i][j], i] for i in range(10)]",
"-cost = [-1] * 10",
"-cost[1] = 0",
"-dp = [[-1] * 10 for i in range(10)]",
"-for i in range(10):",
"- dp[i][i] = 0",
"-",
"-",
"-def search_cost(i, j, reached):",
"- # if dp[i][j] != -1:",
"- # return dp[i][j]",
"- if cost[i] != -1:",
"- return cost[i]",
"- tmp_list = copy.copy(reached)",
"- tmp_list.append(i)",
"- ret = c[i][j]",
"- for k in range(10):",
"- if k == i or k == 1 or k in reached:",
"- continue",
"- else:",
"- tmp = c[i][k] + search_cost(k, j, tmp_list)",
"- ret = min(tmp, ret)",
"- if ret <= 2:",
"- break",
"- # print(\"i:\"+str(i) + \"k:\" + str(k) + \"j:\"+str(j) + \"=\" + str(tmp))",
"- # dp[i][j] = ret",
"- # for i in range(10):",
"- # print(dp[i])",
"- return ret",
"-",
"-",
"-for i in range(10):",
"- if i == 1:",
"- continue",
"- else:",
"- if c[i][1] <= 2:",
"- dp[i][1] = c[i][1]",
"- cost[i] = c[i][1]",
"- else:",
"- cost[i] = search_cost(i, 1, [])",
"+G = csgraph_from_dense(c)",
"+C = floyd_warshall(G)",
"- if A[i][j] != -1:",
"- ans += cost[A[i][j]]",
"+ if A[i][j] >= 0:",
"+ ans += int(C[A[i][j]][1])"
] | false | 0.225719 | 0.361101 | 0.625087 |
[
"s382473517",
"s605924423"
] |
u377989038
|
p03073
|
python
|
s375123285
|
s053502999
| 78 | 63 | 3,188 | 3,188 |
Accepted
|
Accepted
| 19.23 |
s = eval(input())
a = ""
cnt, cnt_ = 0, 0
while len(a) <= len(s):
a += "10"
for i in range(len(s)):
if s[i] != a[i]:
cnt += 1
if s[i] != a[i + 1]:
cnt_ += 1
print((min(cnt, cnt_)))
|
s = eval(input())
cnt, cnt_ = 0, 0
a = "10" * (len(s)//2+1)
for i in range(len(s)):
if s[i] != a[i]:
cnt += 1
if s[i] != a[i + 1]:
cnt_ += 1
print((min(cnt, cnt_)))
| 12 | 9 | 212 | 188 |
s = eval(input())
a = ""
cnt, cnt_ = 0, 0
while len(a) <= len(s):
a += "10"
for i in range(len(s)):
if s[i] != a[i]:
cnt += 1
if s[i] != a[i + 1]:
cnt_ += 1
print((min(cnt, cnt_)))
|
s = eval(input())
cnt, cnt_ = 0, 0
a = "10" * (len(s) // 2 + 1)
for i in range(len(s)):
if s[i] != a[i]:
cnt += 1
if s[i] != a[i + 1]:
cnt_ += 1
print((min(cnt, cnt_)))
| false | 25 |
[
"-a = \"\"",
"-while len(a) <= len(s):",
"- a += \"10\"",
"+a = \"10\" * (len(s) // 2 + 1)"
] | false | 0.036566 | 0.041654 | 0.877845 |
[
"s375123285",
"s053502999"
] |
u075012704
|
p03488
|
python
|
s412407887
|
s505777594
| 1,493 | 382 | 3,816 | 49,116 |
Accepted
|
Accepted
| 74.41 |
S = [len(s) for s in input().split("T")]
X, Y = list(map(int, input().split()))
# X方向・Y方向の移動成分
X_move = S[2::2]
Y_move = S[1::2]
# X方向・Y方法の到達可能な場所
X_reached = {S[0]}
Y_reached = {0}
# 到達可能な場所を計算
for xm in X_move:
tmp = set()
for xr in X_reached:
tmp.add(xr + xm)
tmp.add(xr - xm)
X_reached = tmp
for ym in Y_move:
tmp = set()
for yr in Y_reached:
tmp.add(yr + ym)
tmp.add(yr - ym)
Y_reached = tmp
print(("Yes" if (X in X_reached and Y in Y_reached) else "No"))
|
S = eval(input())
X, Y = list(map(int, input().split()))
X_move = [len(s) for s in S.split("T")[::2]]
Y_move = [len(s) for s in S.split("T")[1::2]]
X_reached = {X_move.pop(0)}
Y_reached = {0}
for x in X_move:
tmp = set()
for nx in X_reached:
tmp.add(nx + x)
tmp.add(nx - x)
X_reached = tmp
for y in Y_move:
tmp = set()
for ny in Y_reached:
tmp.add(ny + y)
tmp.add(ny - y)
Y_reached = tmp
print(("Yes" if (X in X_reached) and (Y in Y_reached) else "No"))
| 27 | 24 | 540 | 524 |
S = [len(s) for s in input().split("T")]
X, Y = list(map(int, input().split()))
# X方向・Y方向の移動成分
X_move = S[2::2]
Y_move = S[1::2]
# X方向・Y方法の到達可能な場所
X_reached = {S[0]}
Y_reached = {0}
# 到達可能な場所を計算
for xm in X_move:
tmp = set()
for xr in X_reached:
tmp.add(xr + xm)
tmp.add(xr - xm)
X_reached = tmp
for ym in Y_move:
tmp = set()
for yr in Y_reached:
tmp.add(yr + ym)
tmp.add(yr - ym)
Y_reached = tmp
print(("Yes" if (X in X_reached and Y in Y_reached) else "No"))
|
S = eval(input())
X, Y = list(map(int, input().split()))
X_move = [len(s) for s in S.split("T")[::2]]
Y_move = [len(s) for s in S.split("T")[1::2]]
X_reached = {X_move.pop(0)}
Y_reached = {0}
for x in X_move:
tmp = set()
for nx in X_reached:
tmp.add(nx + x)
tmp.add(nx - x)
X_reached = tmp
for y in Y_move:
tmp = set()
for ny in Y_reached:
tmp.add(ny + y)
tmp.add(ny - y)
Y_reached = tmp
print(("Yes" if (X in X_reached) and (Y in Y_reached) else "No"))
| false | 11.111111 |
[
"-S = [len(s) for s in input().split(\"T\")]",
"+S = eval(input())",
"-# X方向・Y方向の移動成分",
"-X_move = S[2::2]",
"-Y_move = S[1::2]",
"-# X方向・Y方法の到達可能な場所",
"-X_reached = {S[0]}",
"+X_move = [len(s) for s in S.split(\"T\")[::2]]",
"+Y_move = [len(s) for s in S.split(\"T\")[1::2]]",
"+X_reached = {X_move.pop(0)}",
"-# 到達可能な場所を計算",
"-for xm in X_move:",
"+for x in X_move:",
"- for xr in X_reached:",
"- tmp.add(xr + xm)",
"- tmp.add(xr - xm)",
"+ for nx in X_reached:",
"+ tmp.add(nx + x)",
"+ tmp.add(nx - x)",
"-for ym in Y_move:",
"+for y in Y_move:",
"- for yr in Y_reached:",
"- tmp.add(yr + ym)",
"- tmp.add(yr - ym)",
"+ for ny in Y_reached:",
"+ tmp.add(ny + y)",
"+ tmp.add(ny - y)",
"-print((\"Yes\" if (X in X_reached and Y in Y_reached) else \"No\"))",
"+print((\"Yes\" if (X in X_reached) and (Y in Y_reached) else \"No\"))"
] | false | 0.038456 | 0.038738 | 0.992725 |
[
"s412407887",
"s505777594"
] |
u844005364
|
p03061
|
python
|
s345702823
|
s811931755
| 839 | 192 | 14,588 | 14,584 |
Accepted
|
Accepted
| 77.12 |
n = int(eval(input()))
a = list(map(int, input().split()))
a.sort(reverse=True)
from functools import lru_cache
import sys
if n == 2:
print((max(a)))
sys.exit()
@lru_cache(maxsize=100000)
def gcd(x, y):
while y:
x, y = y, x % y
return x
def gcd_list(li):
if len(li) == 1:
return li[0]
g = gcd(li[0], li[1])
for i in range(2, len(li)):
g = gcd(g, li[i])
return g
def gcd_list_2(li):
g = gcd(li[0], li[1])
if g == 1:
return max(gcd_list([li[0]] + li[2:]), gcd_list(li[1:]))
for i in range(2, n):
if gcd(g, li[i]) == 1:
if i == n - 1:
return gcd_list(li[:i])
gg = gcd_list(li[i+1:])
bb = [gcd(li[x], gg) for x in range(i+1)]
bb.sort()
return bb[1]
else:
g = gcd(g, li[i])
return g
def max_gcd(a):
g = gcd_list(a)
a = [a[i]//g for i in range(n)]
m = gcd_list_2(a)
print((g * m))
max_gcd(a)
|
n = int(eval(input()))
a = list(map(int, input().split()))
import sys
if n == 2:
print((max(a)))
sys.exit()
def gcd(x, y):
while y:
x, y = y, x % y
return x
g = a[0]
gcd_left = [g]
for i in range(n-1):
g = gcd(g, a[i+1])
gcd_left.append(g)
g = a[n-1]
gcd_right = [g]
for i in range(n-1):
g = gcd(g, a[n-2-i])
gcd_right.append(g)
max_gcd = gcd_right[n-2]
for i in range(1, n-1):
max_gcd = max(max_gcd, gcd(gcd_left[i-1], gcd_right[n - 2 - i]))
max_gcd = max(max_gcd, gcd_left[n-2])
print(max_gcd)
| 55 | 35 | 1,043 | 575 |
n = int(eval(input()))
a = list(map(int, input().split()))
a.sort(reverse=True)
from functools import lru_cache
import sys
if n == 2:
print((max(a)))
sys.exit()
@lru_cache(maxsize=100000)
def gcd(x, y):
while y:
x, y = y, x % y
return x
def gcd_list(li):
if len(li) == 1:
return li[0]
g = gcd(li[0], li[1])
for i in range(2, len(li)):
g = gcd(g, li[i])
return g
def gcd_list_2(li):
g = gcd(li[0], li[1])
if g == 1:
return max(gcd_list([li[0]] + li[2:]), gcd_list(li[1:]))
for i in range(2, n):
if gcd(g, li[i]) == 1:
if i == n - 1:
return gcd_list(li[:i])
gg = gcd_list(li[i + 1 :])
bb = [gcd(li[x], gg) for x in range(i + 1)]
bb.sort()
return bb[1]
else:
g = gcd(g, li[i])
return g
def max_gcd(a):
g = gcd_list(a)
a = [a[i] // g for i in range(n)]
m = gcd_list_2(a)
print((g * m))
max_gcd(a)
|
n = int(eval(input()))
a = list(map(int, input().split()))
import sys
if n == 2:
print((max(a)))
sys.exit()
def gcd(x, y):
while y:
x, y = y, x % y
return x
g = a[0]
gcd_left = [g]
for i in range(n - 1):
g = gcd(g, a[i + 1])
gcd_left.append(g)
g = a[n - 1]
gcd_right = [g]
for i in range(n - 1):
g = gcd(g, a[n - 2 - i])
gcd_right.append(g)
max_gcd = gcd_right[n - 2]
for i in range(1, n - 1):
max_gcd = max(max_gcd, gcd(gcd_left[i - 1], gcd_right[n - 2 - i]))
max_gcd = max(max_gcd, gcd_left[n - 2])
print(max_gcd)
| false | 36.363636 |
[
"-a.sort(reverse=True)",
"-from functools import lru_cache",
"-@lru_cache(maxsize=100000)",
"-def gcd_list(li):",
"- if len(li) == 1:",
"- return li[0]",
"- g = gcd(li[0], li[1])",
"- for i in range(2, len(li)):",
"- g = gcd(g, li[i])",
"- return g",
"-",
"-",
"-def gcd_list_2(li):",
"- g = gcd(li[0], li[1])",
"- if g == 1:",
"- return max(gcd_list([li[0]] + li[2:]), gcd_list(li[1:]))",
"- for i in range(2, n):",
"- if gcd(g, li[i]) == 1:",
"- if i == n - 1:",
"- return gcd_list(li[:i])",
"- gg = gcd_list(li[i + 1 :])",
"- bb = [gcd(li[x], gg) for x in range(i + 1)]",
"- bb.sort()",
"- return bb[1]",
"- else:",
"- g = gcd(g, li[i])",
"- return g",
"-",
"-",
"-def max_gcd(a):",
"- g = gcd_list(a)",
"- a = [a[i] // g for i in range(n)]",
"- m = gcd_list_2(a)",
"- print((g * m))",
"-",
"-",
"-max_gcd(a)",
"+g = a[0]",
"+gcd_left = [g]",
"+for i in range(n - 1):",
"+ g = gcd(g, a[i + 1])",
"+ gcd_left.append(g)",
"+g = a[n - 1]",
"+gcd_right = [g]",
"+for i in range(n - 1):",
"+ g = gcd(g, a[n - 2 - i])",
"+ gcd_right.append(g)",
"+max_gcd = gcd_right[n - 2]",
"+for i in range(1, n - 1):",
"+ max_gcd = max(max_gcd, gcd(gcd_left[i - 1], gcd_right[n - 2 - i]))",
"+max_gcd = max(max_gcd, gcd_left[n - 2])",
"+print(max_gcd)"
] | false | 0.007787 | 0.044755 | 0.173993 |
[
"s345702823",
"s811931755"
] |
u644907318
|
p02718
|
python
|
s523546894
|
s846616606
| 181 | 63 | 38,256 | 62,080 |
Accepted
|
Accepted
| 65.19 |
N,M = list(map(int,input().split()))
A = sorted(list(map(int,input().split())),reverse=True)
if A[M-1]>=sum(A)/(4*M):
print("Yes")
else:
print("No")
|
import math
N,M = list(map(int,input().split()))
A = list(map(int,input().split()))
a = sum(A)
b = math.ceil(a/(4*M))
cnt = 0
for i in range(N):
if A[i]>=b:
cnt += 1
if cnt>=M:
print("Yes")
else:
print("No")
| 6 | 13 | 155 | 233 |
N, M = list(map(int, input().split()))
A = sorted(list(map(int, input().split())), reverse=True)
if A[M - 1] >= sum(A) / (4 * M):
print("Yes")
else:
print("No")
|
import math
N, M = list(map(int, input().split()))
A = list(map(int, input().split()))
a = sum(A)
b = math.ceil(a / (4 * M))
cnt = 0
for i in range(N):
if A[i] >= b:
cnt += 1
if cnt >= M:
print("Yes")
else:
print("No")
| false | 53.846154 |
[
"+import math",
"+",
"-A = sorted(list(map(int, input().split())), reverse=True)",
"-if A[M - 1] >= sum(A) / (4 * M):",
"+A = list(map(int, input().split()))",
"+a = sum(A)",
"+b = math.ceil(a / (4 * M))",
"+cnt = 0",
"+for i in range(N):",
"+ if A[i] >= b:",
"+ cnt += 1",
"+if cnt >= M:"
] | false | 0.036652 | 0.037796 | 0.969733 |
[
"s523546894",
"s846616606"
] |
u729133443
|
p02891
|
python
|
s409763107
|
s183783690
| 169 | 20 | 38,384 | 3,188 |
Accepted
|
Accepted
| 88.17 |
from itertools import*
s,k=open(0)
k,x=int(k),0
g=[len(list(v))for _,v in groupby(s)]
for c in g:x+=c//2
x*=k
if(s[0]==s[-2])*g[0]%2&g[-2]%2:x+=k//2if-len(s)==~g[0]else k-1
print(x)
|
from itertools import*
s,k=open(0)
k=int(k)
g=[len(list(v))for _,v in groupby(s)]
print((sum(c//2for c in g)*k+((s[0]==s[-2])*g[0]%2&g[-2]%2)*(k//2*(-len(s)==~g[0])or k-1)))
| 8 | 5 | 188 | 175 |
from itertools import *
s, k = open(0)
k, x = int(k), 0
g = [len(list(v)) for _, v in groupby(s)]
for c in g:
x += c // 2
x *= k
if (s[0] == s[-2]) * g[0] % 2 & g[-2] % 2:
x += k // 2 if -len(s) == ~g[0] else k - 1
print(x)
|
from itertools import *
s, k = open(0)
k = int(k)
g = [len(list(v)) for _, v in groupby(s)]
print(
(
sum(c // 2 for c in g) * k
+ ((s[0] == s[-2]) * g[0] % 2 & g[-2] % 2)
* (k // 2 * (-len(s) == ~g[0]) or k - 1)
)
)
| false | 37.5 |
[
"-k, x = int(k), 0",
"+k = int(k)",
"-for c in g:",
"- x += c // 2",
"-x *= k",
"-if (s[0] == s[-2]) * g[0] % 2 & g[-2] % 2:",
"- x += k // 2 if -len(s) == ~g[0] else k - 1",
"-print(x)",
"+print(",
"+ (",
"+ sum(c // 2 for c in g) * k",
"+ + ((s[0] == s[-2]) * g[0] % 2 & g[-2] % 2)",
"+ * (k // 2 * (-len(s) == ~g[0]) or k - 1)",
"+ )",
"+)"
] | false | 0.041002 | 0.040003 | 1.024972 |
[
"s409763107",
"s183783690"
] |
u392319141
|
p03291
|
python
|
s649501804
|
s726923844
| 506 | 94 | 27,600 | 3,188 |
Accepted
|
Accepted
| 81.42 |
S = eval(input())
N = len(S)
MOD = 10**9 + 7
mask = 'ABC'
dp = [[0,0,0,0] for _ in range(N+1)]
for i in range(N, -1, -1) :
for j in range(4) :
if i == N :
if j == 3 :
dp[i][j] = 1
else :
dp[i][j] = 0
else :
if j == 3 :
weight = 3 if S[i] == '?' else 1
dp[i][j] = weight * dp[i+1][j]
else :
weight = 3 if S[i] == '?' else 1
able = 1 if (S[i] == mask[j] or S[i] == '?') else 0
dp[i][j] = weight * dp[i+1][j] + able * dp[i+1][j+1]
dp[i][j] %= MOD
print((dp[0][0] % MOD))
|
S = eval(input())
MOD = 10**9 + 7
A = 0
AB = 0
Q = 1
ans = 0
for s in S:
if s == '?':
ans = (3 * ans + AB) % MOD
AB = (3 * AB + A) % MOD
A = (3 * A + Q) % MOD
Q = Q * 3 % MOD
elif s == 'A':
A = (A + Q) % MOD
elif s == 'B':
AB = (AB + A) % MOD
elif s == 'C':
ans = (ans + AB) % MOD
print(ans)
| 26 | 22 | 680 | 382 |
S = eval(input())
N = len(S)
MOD = 10**9 + 7
mask = "ABC"
dp = [[0, 0, 0, 0] for _ in range(N + 1)]
for i in range(N, -1, -1):
for j in range(4):
if i == N:
if j == 3:
dp[i][j] = 1
else:
dp[i][j] = 0
else:
if j == 3:
weight = 3 if S[i] == "?" else 1
dp[i][j] = weight * dp[i + 1][j]
else:
weight = 3 if S[i] == "?" else 1
able = 1 if (S[i] == mask[j] or S[i] == "?") else 0
dp[i][j] = weight * dp[i + 1][j] + able * dp[i + 1][j + 1]
dp[i][j] %= MOD
print((dp[0][0] % MOD))
|
S = eval(input())
MOD = 10**9 + 7
A = 0
AB = 0
Q = 1
ans = 0
for s in S:
if s == "?":
ans = (3 * ans + AB) % MOD
AB = (3 * AB + A) % MOD
A = (3 * A + Q) % MOD
Q = Q * 3 % MOD
elif s == "A":
A = (A + Q) % MOD
elif s == "B":
AB = (AB + A) % MOD
elif s == "C":
ans = (ans + AB) % MOD
print(ans)
| false | 15.384615 |
[
"-N = len(S)",
"-mask = \"ABC\"",
"-dp = [[0, 0, 0, 0] for _ in range(N + 1)]",
"-for i in range(N, -1, -1):",
"- for j in range(4):",
"- if i == N:",
"- if j == 3:",
"- dp[i][j] = 1",
"- else:",
"- dp[i][j] = 0",
"- else:",
"- if j == 3:",
"- weight = 3 if S[i] == \"?\" else 1",
"- dp[i][j] = weight * dp[i + 1][j]",
"- else:",
"- weight = 3 if S[i] == \"?\" else 1",
"- able = 1 if (S[i] == mask[j] or S[i] == \"?\") else 0",
"- dp[i][j] = weight * dp[i + 1][j] + able * dp[i + 1][j + 1]",
"- dp[i][j] %= MOD",
"-print((dp[0][0] % MOD))",
"+A = 0",
"+AB = 0",
"+Q = 1",
"+ans = 0",
"+for s in S:",
"+ if s == \"?\":",
"+ ans = (3 * ans + AB) % MOD",
"+ AB = (3 * AB + A) % MOD",
"+ A = (3 * A + Q) % MOD",
"+ Q = Q * 3 % MOD",
"+ elif s == \"A\":",
"+ A = (A + Q) % MOD",
"+ elif s == \"B\":",
"+ AB = (AB + A) % MOD",
"+ elif s == \"C\":",
"+ ans = (ans + AB) % MOD",
"+print(ans)"
] | false | 0.088606 | 0.115499 | 0.767159 |
[
"s649501804",
"s726923844"
] |
u579699847
|
p02861
|
python
|
s982561815
|
s630664622
| 1,520 | 1,375 | 14,508 | 14,496 |
Accepted
|
Accepted
| 9.54 |
import itertools,math,numpy as np
def I(): return int(eval(input()))
def LI(): return list(map(int,input().split()))
N = I()
xy = np.array([LI() for _ in range(N)])
sum_norm = 0
dict_norm = {}
for a in itertools.permutations(list(range(N))):
for i in range(len(a)-1):
vector = xy[a[i+1]]-xy[a[i]]
if not tuple(vector) in dict_norm:
dict_norm[tuple(vector)] = np.linalg.norm(vector)
sum_norm += dict_norm[tuple(vector)]
print((sum_norm/math.factorial(N)))
|
import itertools,math,numpy as np
def I(): return int(eval(input()))
def LI(): return list(map(int,input().split()))
N = I()
xy = np.array([LI() for _ in range(N)])
sum_norm = 0
dict_norm = {}
for a in itertools.permutations(list(range(N))):
for i in range(len(a)-1):
vector = tuple(xy[a[i+1]]-xy[a[i]])
if not vector in dict_norm:
dict_norm[vector] = np.linalg.norm(vector)
sum_norm += dict_norm[vector]
print((sum_norm/math.factorial(N)))
| 14 | 14 | 494 | 480 |
import itertools, math, numpy as np
def I():
return int(eval(input()))
def LI():
return list(map(int, input().split()))
N = I()
xy = np.array([LI() for _ in range(N)])
sum_norm = 0
dict_norm = {}
for a in itertools.permutations(list(range(N))):
for i in range(len(a) - 1):
vector = xy[a[i + 1]] - xy[a[i]]
if not tuple(vector) in dict_norm:
dict_norm[tuple(vector)] = np.linalg.norm(vector)
sum_norm += dict_norm[tuple(vector)]
print((sum_norm / math.factorial(N)))
|
import itertools, math, numpy as np
def I():
return int(eval(input()))
def LI():
return list(map(int, input().split()))
N = I()
xy = np.array([LI() for _ in range(N)])
sum_norm = 0
dict_norm = {}
for a in itertools.permutations(list(range(N))):
for i in range(len(a) - 1):
vector = tuple(xy[a[i + 1]] - xy[a[i]])
if not vector in dict_norm:
dict_norm[vector] = np.linalg.norm(vector)
sum_norm += dict_norm[vector]
print((sum_norm / math.factorial(N)))
| false | 0 |
[
"- vector = xy[a[i + 1]] - xy[a[i]]",
"- if not tuple(vector) in dict_norm:",
"- dict_norm[tuple(vector)] = np.linalg.norm(vector)",
"- sum_norm += dict_norm[tuple(vector)]",
"+ vector = tuple(xy[a[i + 1]] - xy[a[i]])",
"+ if not vector in dict_norm:",
"+ dict_norm[vector] = np.linalg.norm(vector)",
"+ sum_norm += dict_norm[vector]"
] | false | 0.203176 | 0.19444 | 1.044927 |
[
"s982561815",
"s630664622"
] |
u509830642
|
p03011
|
python
|
s161646149
|
s335083892
| 164 | 21 | 38,256 | 2,940 |
Accepted
|
Accepted
| 87.2 |
T = eval(input())
data = T.split()
data_int = list(map(int, data))
data_int.sort()
print((data_int[0] + data_int[1]))
|
import sys
input = sys.stdin.readline
def print_ans(ar):
"""Test Case
>>> print_ans([1, 3, 4])
4
>>> print_ans([3, 2, 3])
5
"""
print((sum(ar) - max(ar)))
if __name__ == '__main__':
ar = list(map(int, input().rstrip().split()))
print_ans(ar)
| 5 | 16 | 113 | 294 |
T = eval(input())
data = T.split()
data_int = list(map(int, data))
data_int.sort()
print((data_int[0] + data_int[1]))
|
import sys
input = sys.stdin.readline
def print_ans(ar):
"""Test Case
>>> print_ans([1, 3, 4])
4
>>> print_ans([3, 2, 3])
5
"""
print((sum(ar) - max(ar)))
if __name__ == "__main__":
ar = list(map(int, input().rstrip().split()))
print_ans(ar)
| false | 68.75 |
[
"-T = eval(input())",
"-data = T.split()",
"-data_int = list(map(int, data))",
"-data_int.sort()",
"-print((data_int[0] + data_int[1]))",
"+import sys",
"+",
"+input = sys.stdin.readline",
"+",
"+",
"+def print_ans(ar):",
"+ \"\"\"Test Case",
"+ >>> print_ans([1, 3, 4])",
"+ 4",
"+ >>> print_ans([3, 2, 3])",
"+ 5",
"+ \"\"\"",
"+ print((sum(ar) - max(ar)))",
"+",
"+",
"+if __name__ == \"__main__\":",
"+ ar = list(map(int, input().rstrip().split()))",
"+ print_ans(ar)"
] | false | 0.090356 | 0.039349 | 2.296281 |
[
"s161646149",
"s335083892"
] |
u498487134
|
p02863
|
python
|
s714435040
|
s886102295
| 871 | 532 | 178,308 | 115,928 |
Accepted
|
Accepted
| 38.92 |
N,T = list(map(int,input().split()))
A = [0]*N
B = [0]*N
for i in range(N):
A[i],B[i] = list(map(int,input().split()))
# T-1分以内に完食を目指す，特定の料理のみ使わないで計算したい．
#DP1[i][t]はi番目の料理まででt分後までに完食で得られる幸福度の最大(商品番号は1から振る)
#DP2[i][t]はiからN番目の料理でt分後までに完食で得られる幸福度の最大
dp1 =[[0]*T for _ in range(N+1)]
dp2 =[[0]*T for _ in range(N+1)]
for i in range(N):
for t in range(1,T):
dp1[i+1][t] = dp1[i][t]
if t-A[i]>=0:
dp1[i+1][t]=max(dp1[i][t],dp1[i][t-A[i]]+B[i])
for i in reversed(list(range(0,N))):
for t in range(1,T):
dp2[i][t] = dp2[i+1][t]
if t-A[i]>=0:
dp2[i][t]=max(dp2[i+1][t],dp2[i+1][t-A[i]]+B[i])
ans=0
#i番目の料理を時間ギリギリに注文
for i in range(1,N):
for j in range(0,T):
ans = max(ans,dp1[i][j]+dp2[i+1][T-1-j]+B[i])
print(ans)
|
#Aをソートしておく，時間ギリギリにi番目の料理を頼むことで固定．
N,T = list(map(int,input().split()))
AB = [[0,0] for _ in range(N)]
for i in range(N):
AB[i][0],AB[i][1] = list(map(int,input().split()))
AB.sort()
#ソートした時のbの情報を維持しないと
# T-1分以内にi番目以外の料理をできるだけ完食する
#DP1[i][t]はi番目の料理まででt分後までに完食で得られる幸福度の最大(商品番号は1から振る)
dp1 =[[0]*T for _ in range(N+1)]
for i in range(N):
for t in range(1,T):
dp1[i+1][t] = dp1[i][t]
if t-AB[i][0]>=0:
dp1[i+1][t]=max(dp1[i][t],dp1[i][t-AB[i][0]]+AB[i][1])
ans=0
for i in range(N):
ans=max(ans,dp1[i][-1]+AB[i][1])
print(ans)
| 33 | 26 | 806 | 592 |
N, T = list(map(int, input().split()))
A = [0] * N
B = [0] * N
for i in range(N):
A[i], B[i] = list(map(int, input().split()))
# T-1分以内に完食を目指す，特定の料理のみ使わないで計算したい．
# DP1[i][t]はi番目の料理まででt分後までに完食で得られる幸福度の最大(商品番号は1から振る)
# DP2[i][t]はiからN番目の料理でt分後までに完食で得られる幸福度の最大
dp1 = [[0] * T for _ in range(N + 1)]
dp2 = [[0] * T for _ in range(N + 1)]
for i in range(N):
for t in range(1, T):
dp1[i + 1][t] = dp1[i][t]
if t - A[i] >= 0:
dp1[i + 1][t] = max(dp1[i][t], dp1[i][t - A[i]] + B[i])
for i in reversed(list(range(0, N))):
for t in range(1, T):
dp2[i][t] = dp2[i + 1][t]
if t - A[i] >= 0:
dp2[i][t] = max(dp2[i + 1][t], dp2[i + 1][t - A[i]] + B[i])
ans = 0
# i番目の料理を時間ギリギリに注文
for i in range(1, N):
for j in range(0, T):
ans = max(ans, dp1[i][j] + dp2[i + 1][T - 1 - j] + B[i])
print(ans)
|
# Aをソートしておく，時間ギリギリにi番目の料理を頼むことで固定．
N, T = list(map(int, input().split()))
AB = [[0, 0] for _ in range(N)]
for i in range(N):
AB[i][0], AB[i][1] = list(map(int, input().split()))
AB.sort()
# ソートした時のbの情報を維持しないと
# T-1分以内にi番目以外の料理をできるだけ完食する
# DP1[i][t]はi番目の料理まででt分後までに完食で得られる幸福度の最大(商品番号は1から振る)
dp1 = [[0] * T for _ in range(N + 1)]
for i in range(N):
for t in range(1, T):
dp1[i + 1][t] = dp1[i][t]
if t - AB[i][0] >= 0:
dp1[i + 1][t] = max(dp1[i][t], dp1[i][t - AB[i][0]] + AB[i][1])
ans = 0
for i in range(N):
ans = max(ans, dp1[i][-1] + AB[i][1])
print(ans)
| false | 21.212121 |
[
"+# Aをソートしておく，時間ギリギリにi番目の料理を頼むことで固定．",
"-A = [0] * N",
"-B = [0] * N",
"+AB = [[0, 0] for _ in range(N)]",
"- A[i], B[i] = list(map(int, input().split()))",
"-# T-1分以内に完食を目指す，特定の料理のみ使わないで計算したい．",
"+ AB[i][0], AB[i][1] = list(map(int, input().split()))",
"+AB.sort()",
"+# ソートした時のbの情報を維持しないと",
"+# T-1分以内にi番目以外の料理をできるだけ完食する",
"-# DP2[i][t]はiからN番目の料理でt分後までに完食で得られる幸福度の最大",
"-dp2 = [[0] * T for _ in range(N + 1)]",
"- if t - A[i] >= 0:",
"- dp1[i + 1][t] = max(dp1[i][t], dp1[i][t - A[i]] + B[i])",
"-for i in reversed(list(range(0, N))):",
"- for t in range(1, T):",
"- dp2[i][t] = dp2[i + 1][t]",
"- if t - A[i] >= 0:",
"- dp2[i][t] = max(dp2[i + 1][t], dp2[i + 1][t - A[i]] + B[i])",
"+ if t - AB[i][0] >= 0:",
"+ dp1[i + 1][t] = max(dp1[i][t], dp1[i][t - AB[i][0]] + AB[i][1])",
"-# i番目の料理を時間ギリギリに注文",
"-for i in range(1, N):",
"- for j in range(0, T):",
"- ans = max(ans, dp1[i][j] + dp2[i + 1][T - 1 - j] + B[i])",
"+for i in range(N):",
"+ ans = max(ans, dp1[i][-1] + AB[i][1])"
] | false | 0.050161 | 0.04907 | 1.022246 |
[
"s714435040",
"s886102295"
] |
u350997995
|
p03212
|
python
|
s881927526
|
s558509947
| 152 | 87 | 3,060 | 3,436 |
Accepted
|
Accepted
| 42.76 |
N = int(eval(input()))
s = "357"
cnt = 0
for i in range(1,10):
for j in range(3**i):
n = j
t = ""
for k in range(i):
t+=s[n%3]
n//=3
if len(set(t))!=3:continue
if int(t)<=N:cnt+=1
print(cnt)
|
from collections import deque
N = int(eval(input()))
ans = 0
A = "357"
Q = deque(["3","5","7"])
while Q:
q = Q.pop()
x = int(q)
if x>N:continue
if len(set(q))==3:ans+=1
for a in A:
Q.append(q+a)
print(ans)
| 13 | 13 | 264 | 239 |
N = int(eval(input()))
s = "357"
cnt = 0
for i in range(1, 10):
for j in range(3**i):
n = j
t = ""
for k in range(i):
t += s[n % 3]
n //= 3
if len(set(t)) != 3:
continue
if int(t) <= N:
cnt += 1
print(cnt)
|
from collections import deque
N = int(eval(input()))
ans = 0
A = "357"
Q = deque(["3", "5", "7"])
while Q:
q = Q.pop()
x = int(q)
if x > N:
continue
if len(set(q)) == 3:
ans += 1
for a in A:
Q.append(q + a)
print(ans)
| false | 0 |
[
"+from collections import deque",
"+",
"-s = \"357\"",
"-cnt = 0",
"-for i in range(1, 10):",
"- for j in range(3**i):",
"- n = j",
"- t = \"\"",
"- for k in range(i):",
"- t += s[n % 3]",
"- n //= 3",
"- if len(set(t)) != 3:",
"- continue",
"- if int(t) <= N:",
"- cnt += 1",
"-print(cnt)",
"+ans = 0",
"+A = \"357\"",
"+Q = deque([\"3\", \"5\", \"7\"])",
"+while Q:",
"+ q = Q.pop()",
"+ x = int(q)",
"+ if x > N:",
"+ continue",
"+ if len(set(q)) == 3:",
"+ ans += 1",
"+ for a in A:",
"+ Q.append(q + a)",
"+print(ans)"
] | false | 0.150492 | 0.048144 | 3.125853 |
[
"s881927526",
"s558509947"
] |
u704216644
|
p03003
|
python
|
s939966521
|
s825839801
| 647 | 292 | 126,172 | 42,348 |
Accepted
|
Accepted
| 54.87 |
N, M = list(map(int, input().split()))
S = list(map(int, input().split()))
T = list(map(int, input().split()))
dp = [1] * (M+1)
dpleft = [0] * (M)
MOD = 10 ** 9 + 7
ndp = [1] * (M+1)
for n in range(N):
for m in range(M):
if S[n] == T[m]:
ndp[m+1] = ndp[m] + dp[m+1]
dpleft[m] = dp[m+1]
else:
ndp[m+1] = ndp[m] + dpleft[m]
dp[m] = ndp[m]
dp[M] = ndp[M]
print((dp[-1] % MOD))
|
N, M = list(map(int, input().split()))
S = list(map(int, input().split()))
T = list(map(int, input().split()))
dp = [1] * (M+1)
dpleft = [0] * (M)
MOD = 10 ** 9 + 7
ndp = [1] * (M+1)
for n in range(N):
for m in range(M):
if S[n] == T[m]:
ndp[m+1] = (ndp[m] + dp[m+1]) % MOD
dpleft[m] = dp[m+1]
else:
ndp[m+1] = (ndp[m] + dpleft[m]) % MOD
dp[m] = ndp[m]
dp[-1] = ndp[-1]
print((dp[-1]))
| 17 | 17 | 449 | 461 |
N, M = list(map(int, input().split()))
S = list(map(int, input().split()))
T = list(map(int, input().split()))
dp = [1] * (M + 1)
dpleft = [0] * (M)
MOD = 10**9 + 7
ndp = [1] * (M + 1)
for n in range(N):
for m in range(M):
if S[n] == T[m]:
ndp[m + 1] = ndp[m] + dp[m + 1]
dpleft[m] = dp[m + 1]
else:
ndp[m + 1] = ndp[m] + dpleft[m]
dp[m] = ndp[m]
dp[M] = ndp[M]
print((dp[-1] % MOD))
|
N, M = list(map(int, input().split()))
S = list(map(int, input().split()))
T = list(map(int, input().split()))
dp = [1] * (M + 1)
dpleft = [0] * (M)
MOD = 10**9 + 7
ndp = [1] * (M + 1)
for n in range(N):
for m in range(M):
if S[n] == T[m]:
ndp[m + 1] = (ndp[m] + dp[m + 1]) % MOD
dpleft[m] = dp[m + 1]
else:
ndp[m + 1] = (ndp[m] + dpleft[m]) % MOD
dp[m] = ndp[m]
dp[-1] = ndp[-1]
print((dp[-1]))
| false | 0 |
[
"- ndp[m + 1] = ndp[m] + dp[m + 1]",
"+ ndp[m + 1] = (ndp[m] + dp[m + 1]) % MOD",
"- ndp[m + 1] = ndp[m] + dpleft[m]",
"+ ndp[m + 1] = (ndp[m] + dpleft[m]) % MOD",
"- dp[M] = ndp[M]",
"-print((dp[-1] % MOD))",
"+ dp[-1] = ndp[-1]",
"+print((dp[-1]))"
] | false | 0.085638 | 0.038108 | 2.247238 |
[
"s939966521",
"s825839801"
] |
u327532412
|
p02623
|
python
|
s559569783
|
s328245299
| 325 | 282 | 47,352 | 47,060 |
Accepted
|
Accepted
| 13.23 |
from bisect import bisect
N, M, K = list(map(int, input().split()))
*A, = list(map(int, input().split()))
*B, = list(map(int, input().split()))
a = [0] * (N+1)
b = [0] * (M+1)
for i in range(N):
a[i+1] = a[i] + A[i]
for i in range(M):
b[i+1] = b[i] + B[i]
ans = 0
for i in range(N+1):
tmp = K - a[i]
if tmp < 0:
break
ans = max(ans, i + bisect(b, tmp) - 1)
print(ans)
|
N, M, K = list(map(int, input().split()))
*A, = list(map(int, input().split()))
*B, = list(map(int, input().split()))
a = [0] * (N+1)
b = [0] * (M+1)
for i in range(N):
a[i+1] = a[i] + A[i]
for i in range(M):
b[i+1] = b[i] + B[i]
ans = 0
j = M
for i in range(N+1):
if a[i] > K:
break
while b[j] > K - a[i]:
j -= 1
ans = max(ans, i + j)
print(ans)
| 17 | 18 | 393 | 381 |
from bisect import bisect
N, M, K = list(map(int, input().split()))
(*A,) = list(map(int, input().split()))
(*B,) = list(map(int, input().split()))
a = [0] * (N + 1)
b = [0] * (M + 1)
for i in range(N):
a[i + 1] = a[i] + A[i]
for i in range(M):
b[i + 1] = b[i] + B[i]
ans = 0
for i in range(N + 1):
tmp = K - a[i]
if tmp < 0:
break
ans = max(ans, i + bisect(b, tmp) - 1)
print(ans)
|
N, M, K = list(map(int, input().split()))
(*A,) = list(map(int, input().split()))
(*B,) = list(map(int, input().split()))
a = [0] * (N + 1)
b = [0] * (M + 1)
for i in range(N):
a[i + 1] = a[i] + A[i]
for i in range(M):
b[i + 1] = b[i] + B[i]
ans = 0
j = M
for i in range(N + 1):
if a[i] > K:
break
while b[j] > K - a[i]:
j -= 1
ans = max(ans, i + j)
print(ans)
| false | 5.555556 |
[
"-from bisect import bisect",
"-",
"+j = M",
"- tmp = K - a[i]",
"- if tmp < 0:",
"+ if a[i] > K:",
"- ans = max(ans, i + bisect(b, tmp) - 1)",
"+ while b[j] > K - a[i]:",
"+ j -= 1",
"+ ans = max(ans, i + j)"
] | false | 0.047345 | 0.043782 | 1.08138 |
[
"s559569783",
"s328245299"
] |
u350997995
|
p03112
|
python
|
s135751405
|
s558058674
| 1,960 | 1,136 | 16,880 | 17,400 |
Accepted
|
Accepted
| 42.04 |
def search(x, l, first, end):
if end-first<=1:
if x<l[first]:
return -1
elif x>l[end]:
return end
else:
return first
middle = (first+end)//2
if x >= l[middle]:
return search(x, l, middle, end)
else:
return search(x, l, first, middle)
A,B,Q = list(map(int,input().split()))
INF = 10**18
s = [-INF]+[int(eval(input())) for i in range(A)]+[INF]
t = [-INF]+[int(eval(input())) for i in range(B)]+[INF]
s.sort()
t.sort()
answer = []
for i in range(Q):
x = int(eval(input()))
sk = search(x,s,0,A)
tk = search(x,t,0,B)
ptn1 = abs(s[sk]-x) + min(abs(t[tk]-s[sk]),abs(t[tk+1]-s[sk]))
ptn2 = abs(s[sk+1]-x) + min(abs(t[tk]-s[sk+1]),abs(t[tk+1]-s[sk+1]))
ptn3 = abs(t[tk]-x) + min(abs(s[sk]-t[tk]),abs(s[sk+1]-t[tk]))
ptn4 = abs(t[tk+1]-x) + min(abs(s[sk]-t[tk+1]),abs(s[sk+1]-t[tk+1]))
answer.append(min(ptn1,ptn2,ptn3,ptn4))
for i in answer:
print(i)
|
import bisect
A,B,Q = list(map(int,input().split()))
INF = 10**18
s = [-INF]+[int(eval(input())) for i in range(A)]+[INF]
t = [-INF]+[int(eval(input())) for i in range(B)]+[INF]
s.sort()
t.sort()
answer = []
for i in range(Q):
x = int(eval(input()))
sk = bisect.bisect_left(s,x)-1
tk = bisect.bisect_left(t,x)-1
ptn1 = abs(s[sk]-x) + min(abs(t[tk]-s[sk]),abs(t[tk+1]-s[sk]))
ptn2 = abs(s[sk+1]-x) + min(abs(t[tk]-s[sk+1]),abs(t[tk+1]-s[sk+1]))
ptn3 = abs(t[tk]-x) + min(abs(s[sk]-t[tk]),abs(s[sk+1]-t[tk]))
ptn4 = abs(t[tk+1]-x) + min(abs(s[sk]-t[tk+1]),abs(s[sk+1]-t[tk+1]))
answer.append(min(ptn1,ptn2,ptn3,ptn4))
for i in answer:
print(i)
| 31 | 19 | 975 | 672 |
def search(x, l, first, end):
if end - first <= 1:
if x < l[first]:
return -1
elif x > l[end]:
return end
else:
return first
middle = (first + end) // 2
if x >= l[middle]:
return search(x, l, middle, end)
else:
return search(x, l, first, middle)
A, B, Q = list(map(int, input().split()))
INF = 10**18
s = [-INF] + [int(eval(input())) for i in range(A)] + [INF]
t = [-INF] + [int(eval(input())) for i in range(B)] + [INF]
s.sort()
t.sort()
answer = []
for i in range(Q):
x = int(eval(input()))
sk = search(x, s, 0, A)
tk = search(x, t, 0, B)
ptn1 = abs(s[sk] - x) + min(abs(t[tk] - s[sk]), abs(t[tk + 1] - s[sk]))
ptn2 = abs(s[sk + 1] - x) + min(abs(t[tk] - s[sk + 1]), abs(t[tk + 1] - s[sk + 1]))
ptn3 = abs(t[tk] - x) + min(abs(s[sk] - t[tk]), abs(s[sk + 1] - t[tk]))
ptn4 = abs(t[tk + 1] - x) + min(abs(s[sk] - t[tk + 1]), abs(s[sk + 1] - t[tk + 1]))
answer.append(min(ptn1, ptn2, ptn3, ptn4))
for i in answer:
print(i)
|
import bisect
A, B, Q = list(map(int, input().split()))
INF = 10**18
s = [-INF] + [int(eval(input())) for i in range(A)] + [INF]
t = [-INF] + [int(eval(input())) for i in range(B)] + [INF]
s.sort()
t.sort()
answer = []
for i in range(Q):
x = int(eval(input()))
sk = bisect.bisect_left(s, x) - 1
tk = bisect.bisect_left(t, x) - 1
ptn1 = abs(s[sk] - x) + min(abs(t[tk] - s[sk]), abs(t[tk + 1] - s[sk]))
ptn2 = abs(s[sk + 1] - x) + min(abs(t[tk] - s[sk + 1]), abs(t[tk + 1] - s[sk + 1]))
ptn3 = abs(t[tk] - x) + min(abs(s[sk] - t[tk]), abs(s[sk + 1] - t[tk]))
ptn4 = abs(t[tk + 1] - x) + min(abs(s[sk] - t[tk + 1]), abs(s[sk + 1] - t[tk + 1]))
answer.append(min(ptn1, ptn2, ptn3, ptn4))
for i in answer:
print(i)
| false | 38.709677 |
[
"-def search(x, l, first, end):",
"- if end - first <= 1:",
"- if x < l[first]:",
"- return -1",
"- elif x > l[end]:",
"- return end",
"- else:",
"- return first",
"- middle = (first + end) // 2",
"- if x >= l[middle]:",
"- return search(x, l, middle, end)",
"- else:",
"- return search(x, l, first, middle)",
"-",
"+import bisect",
"- sk = search(x, s, 0, A)",
"- tk = search(x, t, 0, B)",
"+ sk = bisect.bisect_left(s, x) - 1",
"+ tk = bisect.bisect_left(t, x) - 1"
] | false | 0.037297 | 0.037738 | 0.988325 |
[
"s135751405",
"s558058674"
] |
u786793781
|
p02936
|
python
|
s189447921
|
s723111721
| 1,949 | 1,783 | 74,768 | 62,232 |
Accepted
|
Accepted
| 8.52 |
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
from collections import deque
# N: ノードの数
# Q: 数値をノードに付与する回数
N, Q = list(map(int, input().split()))
links = [[] for _ in range(N)]
values = [0 for _ in range(N)]
for i in range(N - 1):
edge1, edge2 = [x - 1 for x in list(map(int, input().split()))]
links[edge1].append(edge2)
links[edge2].append(edge1)
for i in range(Q):
node, val = list(map(int, input().split()))
values[node - 1] += val
# 値の計算
stack = deque()
stack.append((0, -1))
while stack:
node = stack.pop()
for linked_node in links[node[0]]:
if linked_node == node[1]: # link が親ノード向けでなければ
continue
values[linked_node] += values[node[0]]
stack.append((linked_node, node[0]))
print((*values))
|
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
from collections import deque
# N: ノードの数
# Q: 数値をノードに付与する回数
N, Q = list(map(int, input().split()))
links = [[] for _ in range(N)]
values = [0] * N
for i in range(N - 1):
edge1, edge2 = [x - 1 for x in map(int, input().split())]
links[edge1].append(edge2)
links[edge2].append(edge1)
for i in range(Q):
node, val = list(map(int, input().split()))
values[node - 1] += val
# 値の計算
stack = deque()
stack.append((0, -1))
while stack:
node = stack.pop()
for linked_node in links[node[0]]:
if linked_node == node[1]: # link が親ノード向けでなければ
continue
values[linked_node] += values[node[0]]
stack.append((linked_node, node[0]))
print((*values))
| 35 | 35 | 803 | 771 |
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
from collections import deque
# N: ノードの数
# Q: 数値をノードに付与する回数
N, Q = list(map(int, input().split()))
links = [[] for _ in range(N)]
values = [0 for _ in range(N)]
for i in range(N - 1):
edge1, edge2 = [x - 1 for x in list(map(int, input().split()))]
links[edge1].append(edge2)
links[edge2].append(edge1)
for i in range(Q):
node, val = list(map(int, input().split()))
values[node - 1] += val
# 値の計算
stack = deque()
stack.append((0, -1))
while stack:
node = stack.pop()
for linked_node in links[node[0]]:
if linked_node == node[1]: # link が親ノード向けでなければ
continue
values[linked_node] += values[node[0]]
stack.append((linked_node, node[0]))
print((*values))
|
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
from collections import deque
# N: ノードの数
# Q: 数値をノードに付与する回数
N, Q = list(map(int, input().split()))
links = [[] for _ in range(N)]
values = [0] * N
for i in range(N - 1):
edge1, edge2 = [x - 1 for x in map(int, input().split())]
links[edge1].append(edge2)
links[edge2].append(edge1)
for i in range(Q):
node, val = list(map(int, input().split()))
values[node - 1] += val
# 値の計算
stack = deque()
stack.append((0, -1))
while stack:
node = stack.pop()
for linked_node in links[node[0]]:
if linked_node == node[1]: # link が親ノード向けでなければ
continue
values[linked_node] += values[node[0]]
stack.append((linked_node, node[0]))
print((*values))
| false | 0 |
[
"-values = [0 for _ in range(N)]",
"+values = [0] * N",
"- edge1, edge2 = [x - 1 for x in list(map(int, input().split()))]",
"+ edge1, edge2 = [x - 1 for x in map(int, input().split())]"
] | false | 0.089689 | 0.092741 | 0.967094 |
[
"s189447921",
"s723111721"
] |
u237094818
|
p02388
|
python
|
s446401665
|
s654532191
| 20 | 10 | 7,600 | 4,636 |
Accepted
|
Accepted
| 50 |
number = int(eval(input()))
number3 = number*number*number
print(number3)
|
# -*- coding: utf-8
x = eval(input())
y = x*x*x
print(y)
| 6 | 5 | 75 | 56 |
number = int(eval(input()))
number3 = number * number * number
print(number3)
|
# -*- coding: utf-8
x = eval(input())
y = x * x * x
print(y)
| false | 16.666667 |
[
"-number = int(eval(input()))",
"-number3 = number * number * number",
"-print(number3)",
"+# -*- coding: utf-8",
"+x = eval(input())",
"+y = x * x * x",
"+print(y)"
] | false | 0.040383 | 0.040445 | 0.998454 |
[
"s446401665",
"s654532191"
] |
u266014018
|
p03821
|
python
|
s306070969
|
s471307985
| 1,122 | 310 | 36,124 | 36,244 |
Accepted
|
Accepted
| 72.37 |
def main():
import sys
def input(): return sys.stdin.readline().rstrip()
n = int(eval(input()))
A = []
B = []
for _ in range(n):
a,b = list(map(int, input().split()))
A.append(a)
B.append(b)
import numpy as np
a = np.array(A[::-1], dtype=int)
ans = 0
for i, b in enumerate(B[::-1]):
tmp = (b-a[i]%b)%b
a[i:] += tmp
ans += tmp
print(ans)
if __name__ == '__main__':
main()
|
def main():
import sys
def input(): return sys.stdin.readline().rstrip()
n = int(eval(input()))
A = []
B = []
for _ in range(n):
a,b = list(map(int, input().split()))
A.append(a)
B.append(b)
import numpy as np
a = np.array(A[::-1], dtype=int)
ans = 0
for i, b in enumerate(B[::-1]):
tmp = (b - (a[i] + ans)%b) % b
ans += tmp
print(ans)
if __name__ == '__main__':
main()
| 24 | 23 | 489 | 479 |
def main():
import sys
def input():
return sys.stdin.readline().rstrip()
n = int(eval(input()))
A = []
B = []
for _ in range(n):
a, b = list(map(int, input().split()))
A.append(a)
B.append(b)
import numpy as np
a = np.array(A[::-1], dtype=int)
ans = 0
for i, b in enumerate(B[::-1]):
tmp = (b - a[i] % b) % b
a[i:] += tmp
ans += tmp
print(ans)
if __name__ == "__main__":
main()
|
def main():
import sys
def input():
return sys.stdin.readline().rstrip()
n = int(eval(input()))
A = []
B = []
for _ in range(n):
a, b = list(map(int, input().split()))
A.append(a)
B.append(b)
import numpy as np
a = np.array(A[::-1], dtype=int)
ans = 0
for i, b in enumerate(B[::-1]):
tmp = (b - (a[i] + ans) % b) % b
ans += tmp
print(ans)
if __name__ == "__main__":
main()
| false | 4.166667 |
[
"- tmp = (b - a[i] % b) % b",
"- a[i:] += tmp",
"+ tmp = (b - (a[i] + ans) % b) % b"
] | false | 0.419365 | 0.318675 | 1.315964 |
[
"s306070969",
"s471307985"
] |
u391819434
|
p03993
|
python
|
s535824248
|
s956032161
| 75 | 65 | 13,880 | 13,940 |
Accepted
|
Accepted
| 13.33 |
N=int(eval(input()))
*A,=list(map(int,input().split()))
i=0
ans=0
while i<N:
if i+1==A[A[i]-1]:
ans+=1
i+=1
print((ans//2))
|
N,*A=list(map(int,open(0).read().split()))
print((sum(i+1==A[A[i]-1]for i in range(N))//2))
| 9 | 2 | 133 | 84 |
N = int(eval(input()))
(*A,) = list(map(int, input().split()))
i = 0
ans = 0
while i < N:
if i + 1 == A[A[i] - 1]:
ans += 1
i += 1
print((ans // 2))
|
N, *A = list(map(int, open(0).read().split()))
print((sum(i + 1 == A[A[i] - 1] for i in range(N)) // 2))
| false | 77.777778 |
[
"-N = int(eval(input()))",
"-(*A,) = list(map(int, input().split()))",
"-i = 0",
"-ans = 0",
"-while i < N:",
"- if i + 1 == A[A[i] - 1]:",
"- ans += 1",
"- i += 1",
"-print((ans // 2))",
"+N, *A = list(map(int, open(0).read().split()))",
"+print((sum(i + 1 == A[A[i] - 1] for i in range(N)) // 2))"
] | false | 0.033335 | 0.034941 | 0.954047 |
[
"s535824248",
"s956032161"
] |
u562935282
|
p03289
|
python
|
s091818654
|
s796694531
| 19 | 17 | 3,064 | 3,064 |
Accepted
|
Accepted
| 10.53 |
s = eval(input())
chrs = 'abcdefghijklmnopqrstuvwxyz'
p1 = (s[0] == 'A')
p2 = (s[2:-1].count('C') == 1)
p4 = (s[1] in chrs)
p5 = (s[-1] in chrs)
p3 = True
C_found = False
for i in range(2, len(s) - 1):
if not(s[i] in chrs):
if (s[i] == 'C'):
if C_found:
p3 = False
break
else:
C_found = True
else:
p3 = False
break
if p1 and p2 and p3 and p4 and p5 and C_found:
print('AC')
else:
print('WA')
|
def check(s):
if (s[0] != 'A'): return False
c = 0
for i in range(2, len(s) - 1):
if (s[i] == 'C'):
c += 1
if c != 1: return False
upper = 0
for i in range(len(s)):
if ('A' <= s[i] <= 'Z'):
upper += 1
if upper != 2: return False
return True
S = eval(input())
print(('AC' if check(S) else 'WA'))
| 26 | 18 | 545 | 382 |
s = eval(input())
chrs = "abcdefghijklmnopqrstuvwxyz"
p1 = s[0] == "A"
p2 = s[2:-1].count("C") == 1
p4 = s[1] in chrs
p5 = s[-1] in chrs
p3 = True
C_found = False
for i in range(2, len(s) - 1):
if not (s[i] in chrs):
if s[i] == "C":
if C_found:
p3 = False
break
else:
C_found = True
else:
p3 = False
break
if p1 and p2 and p3 and p4 and p5 and C_found:
print("AC")
else:
print("WA")
|
def check(s):
if s[0] != "A":
return False
c = 0
for i in range(2, len(s) - 1):
if s[i] == "C":
c += 1
if c != 1:
return False
upper = 0
for i in range(len(s)):
if "A" <= s[i] <= "Z":
upper += 1
if upper != 2:
return False
return True
S = eval(input())
print(("AC" if check(S) else "WA"))
| false | 30.769231 |
[
"-s = eval(input())",
"-chrs = \"abcdefghijklmnopqrstuvwxyz\"",
"-p1 = s[0] == \"A\"",
"-p2 = s[2:-1].count(\"C\") == 1",
"-p4 = s[1] in chrs",
"-p5 = s[-1] in chrs",
"-p3 = True",
"-C_found = False",
"-for i in range(2, len(s) - 1):",
"- if not (s[i] in chrs):",
"+def check(s):",
"+ if s[0] != \"A\":",
"+ return False",
"+ c = 0",
"+ for i in range(2, len(s) - 1):",
"- if C_found:",
"- p3 = False",
"- break",
"- else:",
"- C_found = True",
"- else:",
"- p3 = False",
"- break",
"-if p1 and p2 and p3 and p4 and p5 and C_found:",
"- print(\"AC\")",
"-else:",
"- print(\"WA\")",
"+ c += 1",
"+ if c != 1:",
"+ return False",
"+ upper = 0",
"+ for i in range(len(s)):",
"+ if \"A\" <= s[i] <= \"Z\":",
"+ upper += 1",
"+ if upper != 2:",
"+ return False",
"+ return True",
"+",
"+",
"+S = eval(input())",
"+print((\"AC\" if check(S) else \"WA\"))"
] | false | 0.072652 | 0.069333 | 1.04787 |
[
"s091818654",
"s796694531"
] |
u974292946
|
p03325
|
python
|
s979334508
|
s520294918
| 101 | 88 | 4,084 | 4,084 |
Accepted
|
Accepted
| 12.87 |
n, *a = list(map(int, open(0).read().split()))
count = 0
for i in a:
if i % 2 == 0:
while i % 2 == 0:
if i % 2 == 0:
count += 1
i //= 2
else:
break
print(count)
|
n, *a = list(map(int, open(0).read().split()))
count = 0
for i in a:
while i % 2 == 0:
count += 1
i //= 2
print(count)
| 13 | 7 | 252 | 150 |
n, *a = list(map(int, open(0).read().split()))
count = 0
for i in a:
if i % 2 == 0:
while i % 2 == 0:
if i % 2 == 0:
count += 1
i //= 2
else:
break
print(count)
|
n, *a = list(map(int, open(0).read().split()))
count = 0
for i in a:
while i % 2 == 0:
count += 1
i //= 2
print(count)
| false | 46.153846 |
[
"- if i % 2 == 0:",
"- while i % 2 == 0:",
"- if i % 2 == 0:",
"- count += 1",
"- i //= 2",
"- else:",
"- break",
"+ while i % 2 == 0:",
"+ count += 1",
"+ i //= 2"
] | false | 0.038405 | 0.060501 | 0.634782 |
[
"s979334508",
"s520294918"
] |
u095021077
|
p02951
|
python
|
s059533512
|
s529252803
| 204 | 169 | 38,384 | 38,256 |
Accepted
|
Accepted
| 17.16 |
temp=list(map(int, input().split()))
a=temp[2]-(temp[0]-temp[1])
if a>=0:
print(a)
else:
print((0))
|
temp=list(map(int, input().split()))
temp=temp[2]-(temp[0]-temp[1])
if temp<0:
print((0))
else:
print((int(temp)))
| 6 | 8 | 106 | 123 |
temp = list(map(int, input().split()))
a = temp[2] - (temp[0] - temp[1])
if a >= 0:
print(a)
else:
print((0))
|
temp = list(map(int, input().split()))
temp = temp[2] - (temp[0] - temp[1])
if temp < 0:
print((0))
else:
print((int(temp)))
| false | 25 |
[
"-a = temp[2] - (temp[0] - temp[1])",
"-if a >= 0:",
"- print(a)",
"+temp = temp[2] - (temp[0] - temp[1])",
"+if temp < 0:",
"+ print((0))",
"- print((0))",
"+ print((int(temp)))"
] | false | 0.041782 | 0.036726 | 1.13768 |
[
"s059533512",
"s529252803"
] |
u263830634
|
p03972
|
python
|
s218627969
|
s013031964
| 323 | 284 | 11,592 | 11,592 |
Accepted
|
Accepted
| 12.07 |
import sys
input = sys.stdin.readline
from bisect import bisect_left, bisect_right
W, H = list(map(int, input().split()))
P = [int(eval(input())) for _ in range(W)]
P.sort()
Q = [int(eval(input())) for _ in range(H)]
Q.sort()
ans = 0
for q in Q:
tmp = bisect_right(P, q)
# print ('tmp=', tmp)
ans += q * (1 + W - tmp)
# print (ans)
for p in P:
tmp = bisect_left(Q, p)
ans += p * (1 + H - tmp)
print (ans)
# print ('P:', P)
# print ('Q:', Q)
|
def main():
import sys
input = sys.stdin.readline
from bisect import bisect_left, bisect_right
W, H = list(map(int, input().split()))
P = [int(eval(input())) for _ in range(W)]
P.sort()
Q = [int(eval(input())) for _ in range(H)]
Q.sort()
ans = 0
for q in Q:
tmp = bisect_right(P, q)
# print ('tmp=', tmp)
ans += q * (1 + W - tmp)
# print (ans)
for p in P:
tmp = bisect_left(Q, p)
ans += p * (1 + H - tmp)
print (ans)
# print ('P:', P)
# print ('Q:', Q)
if __name__ == '__main__':
main()
| 26 | 30 | 477 | 612 |
import sys
input = sys.stdin.readline
from bisect import bisect_left, bisect_right
W, H = list(map(int, input().split()))
P = [int(eval(input())) for _ in range(W)]
P.sort()
Q = [int(eval(input())) for _ in range(H)]
Q.sort()
ans = 0
for q in Q:
tmp = bisect_right(P, q)
# print ('tmp=', tmp)
ans += q * (1 + W - tmp)
# print (ans)
for p in P:
tmp = bisect_left(Q, p)
ans += p * (1 + H - tmp)
print(ans)
# print ('P:', P)
# print ('Q:', Q)
|
def main():
import sys
input = sys.stdin.readline
from bisect import bisect_left, bisect_right
W, H = list(map(int, input().split()))
P = [int(eval(input())) for _ in range(W)]
P.sort()
Q = [int(eval(input())) for _ in range(H)]
Q.sort()
ans = 0
for q in Q:
tmp = bisect_right(P, q)
# print ('tmp=', tmp)
ans += q * (1 + W - tmp)
# print (ans)
for p in P:
tmp = bisect_left(Q, p)
ans += p * (1 + H - tmp)
print(ans)
# print ('P:', P)
# print ('Q:', Q)
if __name__ == "__main__":
main()
| false | 13.333333 |
[
"-import sys",
"+def main():",
"+ import sys",
"-input = sys.stdin.readline",
"-from bisect import bisect_left, bisect_right",
"+ input = sys.stdin.readline",
"+ from bisect import bisect_left, bisect_right",
"-W, H = list(map(int, input().split()))",
"-P = [int(eval(input())) for _ in range(W)]",
"-P.sort()",
"-Q = [int(eval(input())) for _ in range(H)]",
"-Q.sort()",
"-ans = 0",
"-for q in Q:",
"- tmp = bisect_right(P, q)",
"- # print ('tmp=', tmp)",
"- ans += q * (1 + W - tmp)",
"- # print (ans)",
"-for p in P:",
"- tmp = bisect_left(Q, p)",
"- ans += p * (1 + H - tmp)",
"-print(ans)",
"-# print ('P:', P)",
"-# print ('Q:', Q)",
"+ W, H = list(map(int, input().split()))",
"+ P = [int(eval(input())) for _ in range(W)]",
"+ P.sort()",
"+ Q = [int(eval(input())) for _ in range(H)]",
"+ Q.sort()",
"+ ans = 0",
"+ for q in Q:",
"+ tmp = bisect_right(P, q)",
"+ # print ('tmp=', tmp)",
"+ ans += q * (1 + W - tmp)",
"+ # print (ans)",
"+ for p in P:",
"+ tmp = bisect_left(Q, p)",
"+ ans += p * (1 + H - tmp)",
"+ print(ans)",
"+ # print ('P:', P)",
"+ # print ('Q:', Q)",
"+",
"+",
"+if __name__ == \"__main__\":",
"+ main()"
] | false | 0.113221 | 0.043871 | 2.580792 |
[
"s218627969",
"s013031964"
] |
u839537730
|
p03994
|
python
|
s678834657
|
s815923916
| 176 | 99 | 4,156 | 4,152 |
Accepted
|
Accepted
| 43.75 |
s = list(eval(input()))
K = int(eval(input()))
alphabet = ['a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z']
for i in range(len(s)):
if K <=0 :
break
if (26 - alphabet.index(s[i])) <= K and s[i] != "a":
K -= (26 - alphabet.index(s[i]))
s[i] = "a"
# print(K)
if K > 0:
if K%26 + alphabet.index(s[-1]) > 25:
s[-1] = alphabet[(K%26 - alphabet.index(s[-1]))]
else:
s[-1] = alphabet[(K%26+alphabet.index(s[-1]))]
print(("".join(s)))
|
s = list(eval(input()))
K = int(eval(input()))
alphabet = "abcdefghijklmnopqrstuvwxyz"
for i in range(len(s)):
if (26 - alphabet.index(s[i])) <= K and (s[i] != "a"):
K -= (26 - alphabet.index(s[i]))
s[i] = "a"
if K <= 0:
break
if K > 0:
K = K % 26
idx = alphabet.index(s[-1])+K
s[-1] = alphabet[idx%26]
print(("".join(s)))
| 20 | 20 | 588 | 399 |
s = list(eval(input()))
K = int(eval(input()))
alphabet = [
"a",
"b",
"c",
"d",
"e",
"f",
"g",
"h",
"i",
"j",
"k",
"l",
"m",
"n",
"o",
"p",
"q",
"r",
"s",
"t",
"u",
"v",
"w",
"x",
"y",
"z",
]
for i in range(len(s)):
if K <= 0:
break
if (26 - alphabet.index(s[i])) <= K and s[i] != "a":
K -= 26 - alphabet.index(s[i])
s[i] = "a"
# print(K)
if K > 0:
if K % 26 + alphabet.index(s[-1]) > 25:
s[-1] = alphabet[(K % 26 - alphabet.index(s[-1]))]
else:
s[-1] = alphabet[(K % 26 + alphabet.index(s[-1]))]
print(("".join(s)))
|
s = list(eval(input()))
K = int(eval(input()))
alphabet = "abcdefghijklmnopqrstuvwxyz"
for i in range(len(s)):
if (26 - alphabet.index(s[i])) <= K and (s[i] != "a"):
K -= 26 - alphabet.index(s[i])
s[i] = "a"
if K <= 0:
break
if K > 0:
K = K % 26
idx = alphabet.index(s[-1]) + K
s[-1] = alphabet[idx % 26]
print(("".join(s)))
| false | 0 |
[
"-alphabet = [",
"- \"a\",",
"- \"b\",",
"- \"c\",",
"- \"d\",",
"- \"e\",",
"- \"f\",",
"- \"g\",",
"- \"h\",",
"- \"i\",",
"- \"j\",",
"- \"k\",",
"- \"l\",",
"- \"m\",",
"- \"n\",",
"- \"o\",",
"- \"p\",",
"- \"q\",",
"- \"r\",",
"- \"s\",",
"- \"t\",",
"- \"u\",",
"- \"v\",",
"- \"w\",",
"- \"x\",",
"- \"y\",",
"- \"z\",",
"-]",
"+alphabet = \"abcdefghijklmnopqrstuvwxyz\"",
"+ if (26 - alphabet.index(s[i])) <= K and (s[i] != \"a\"):",
"+ K -= 26 - alphabet.index(s[i])",
"+ s[i] = \"a\"",
"- if (26 - alphabet.index(s[i])) <= K and s[i] != \"a\":",
"- K -= 26 - alphabet.index(s[i])",
"- s[i] = \"a\"",
"-# print(K)",
"- if K % 26 + alphabet.index(s[-1]) > 25:",
"- s[-1] = alphabet[(K % 26 - alphabet.index(s[-1]))]",
"- else:",
"- s[-1] = alphabet[(K % 26 + alphabet.index(s[-1]))]",
"+ K = K % 26",
"+ idx = alphabet.index(s[-1]) + K",
"+ s[-1] = alphabet[idx % 26]"
] | false | 0.041399 | 0.040335 | 1.026381 |
[
"s678834657",
"s815923916"
] |
u631277801
|
p03999
|
python
|
s121273585
|
s190998829
| 19 | 17 | 3,064 | 3,064 |
Accepted
|
Accepted
| 10.53 |
S = eval(input())
tf_str = ""
ans = 0
def dfs(tf_str,S):
global ans
if len(tf_str) != len(S)-1:
dfs(tf_str + "f",S)
dfs(tf_str + "t",S)
else:
frm = 0
for to in range(1,len(S)):
if tf_str[to-1] == "t":
ans += int(S[frm:to])
frm = to
ans += int(S[frm:])
dfs(tf_str,S)
print(ans)
|
s = input()
d = len(s) - 1
def dfs(depth: int, cur:int, s: str, res: str) -> int:
if depth == d:
tmp = s + res[:1]
return cur + int(tmp)
else:
tmp = s + res[:1]
return dfs(depth+1, cur+int(tmp), "", res[1:]) \
+ dfs(depth+1, cur, tmp, res[1:])
ans = dfs(0, 0, "", s)
print(ans)
| 22 | 17 | 403 | 374 |
S = eval(input())
tf_str = ""
ans = 0
def dfs(tf_str, S):
global ans
if len(tf_str) != len(S) - 1:
dfs(tf_str + "f", S)
dfs(tf_str + "t", S)
else:
frm = 0
for to in range(1, len(S)):
if tf_str[to - 1] == "t":
ans += int(S[frm:to])
frm = to
ans += int(S[frm:])
dfs(tf_str, S)
print(ans)
|
s = input()
d = len(s) - 1
def dfs(depth: int, cur: int, s: str, res: str) -> int:
if depth == d:
tmp = s + res[:1]
return cur + int(tmp)
else:
tmp = s + res[:1]
return dfs(depth + 1, cur + int(tmp), "", res[1:]) + dfs(
depth + 1, cur, tmp, res[1:]
)
ans = dfs(0, 0, "", s)
print(ans)
| false | 22.727273 |
[
"-S = eval(input())",
"-tf_str = \"\"",
"-ans = 0",
"+s = input()",
"+d = len(s) - 1",
"-def dfs(tf_str, S):",
"- global ans",
"- if len(tf_str) != len(S) - 1:",
"- dfs(tf_str + \"f\", S)",
"- dfs(tf_str + \"t\", S)",
"+def dfs(depth: int, cur: int, s: str, res: str) -> int:",
"+ if depth == d:",
"+ tmp = s + res[:1]",
"+ return cur + int(tmp)",
"- frm = 0",
"- for to in range(1, len(S)):",
"- if tf_str[to - 1] == \"t\":",
"- ans += int(S[frm:to])",
"- frm = to",
"- ans += int(S[frm:])",
"+ tmp = s + res[:1]",
"+ return dfs(depth + 1, cur + int(tmp), \"\", res[1:]) + dfs(",
"+ depth + 1, cur, tmp, res[1:]",
"+ )",
"-dfs(tf_str, S)",
"+ans = dfs(0, 0, \"\", s)"
] | false | 0.0388 | 0.044539 | 0.871167 |
[
"s121273585",
"s190998829"
] |
u391875425
|
p03087
|
python
|
s209601847
|
s665123205
| 898 | 323 | 8,712 | 8,948 |
Accepted
|
Accepted
| 64.03 |
from itertools import accumulate
N, Q = list(map(int, input().split()))
S = eval(input())
rs = [0] * N
for i in range(N - 1):
if S[i] + S[i + 1] == "AC":
rs[i + 1] = 1
rm = [0] + list(accumulate(rs))
for i in range(Q):
ans = 0
l, r = list(map(int, input().split()))
if S[l] == "C":
ans -= 1
ans = rm[r] - rm[l]
print(ans)
|
from itertools import accumulate
import sys
N, Q = list(map(int, input().split()))
S = eval(input())
rs = [0] * N
for i in range(N - 1):
if S[i] + S[i + 1] == "AC":
rs[i + 1] = 1
rm = [0] + list(accumulate(rs))
for i in range(Q):
ans = 0
l, r = list(map(int, sys.stdin.readline().split()))
if S[l] == "C":
ans -= 1
ans = rm[r] - rm[l]
print(ans)
| 18 | 19 | 363 | 388 |
from itertools import accumulate
N, Q = list(map(int, input().split()))
S = eval(input())
rs = [0] * N
for i in range(N - 1):
if S[i] + S[i + 1] == "AC":
rs[i + 1] = 1
rm = [0] + list(accumulate(rs))
for i in range(Q):
ans = 0
l, r = list(map(int, input().split()))
if S[l] == "C":
ans -= 1
ans = rm[r] - rm[l]
print(ans)
|
from itertools import accumulate
import sys
N, Q = list(map(int, input().split()))
S = eval(input())
rs = [0] * N
for i in range(N - 1):
if S[i] + S[i + 1] == "AC":
rs[i + 1] = 1
rm = [0] + list(accumulate(rs))
for i in range(Q):
ans = 0
l, r = list(map(int, sys.stdin.readline().split()))
if S[l] == "C":
ans -= 1
ans = rm[r] - rm[l]
print(ans)
| false | 5.263158 |
[
"+import sys",
"- l, r = list(map(int, input().split()))",
"+ l, r = list(map(int, sys.stdin.readline().split()))"
] | false | 0.042496 | 0.173533 | 0.244884 |
[
"s209601847",
"s665123205"
] |
u962024525
|
p02612
|
python
|
s053469129
|
s892842237
| 30 | 25 | 9,116 | 9,096 |
Accepted
|
Accepted
| 16.67 |
m=int(eval(input()))
if m%1000==0:
print((0))
else:
print((1000-m%1000))
|
m=int(eval(input()))
print(((1000-m%1000)%1000))
| 5 | 2 | 74 | 41 |
m = int(eval(input()))
if m % 1000 == 0:
print((0))
else:
print((1000 - m % 1000))
|
m = int(eval(input()))
print(((1000 - m % 1000) % 1000))
| false | 60 |
[
"-if m % 1000 == 0:",
"- print((0))",
"-else:",
"- print((1000 - m % 1000))",
"+print(((1000 - m % 1000) % 1000))"
] | false | 0.044023 | 0.044162 | 0.99686 |
[
"s053469129",
"s892842237"
] |
u936985471
|
p03147
|
python
|
s449477577
|
s497630700
| 19 | 17 | 3,060 | 2,940 |
Accepted
|
Accepted
| 10.53 |
N=int(eval(input()))
A=list(map(int,input().split()))
maxh=max(A)
ans=0
for i in range(1,maxh+1):
# i 以上の高さのブロック数をカウントする
block=0
cur=False
if A[0]>=i:
block+=1
cur=True
for j in range(1,len(A)):
if A[j]>=i:
if not cur:
block+=1
cur=True
else:
cur=False
ans+=block
print(ans)
|
N=int(eval(input()))
A=list(map(int,input().split()))
cur=0
ans=0
for i in range(N):
if A[i]>cur:
ans+=A[i]-cur
cur=A[i]
print(ans)
| 22 | 9 | 348 | 141 |
N = int(eval(input()))
A = list(map(int, input().split()))
maxh = max(A)
ans = 0
for i in range(1, maxh + 1):
# i 以上の高さのブロック数をカウントする
block = 0
cur = False
if A[0] >= i:
block += 1
cur = True
for j in range(1, len(A)):
if A[j] >= i:
if not cur:
block += 1
cur = True
else:
cur = False
ans += block
print(ans)
|
N = int(eval(input()))
A = list(map(int, input().split()))
cur = 0
ans = 0
for i in range(N):
if A[i] > cur:
ans += A[i] - cur
cur = A[i]
print(ans)
| false | 59.090909 |
[
"-maxh = max(A)",
"+cur = 0",
"-for i in range(1, maxh + 1):",
"- # i 以上の高さのブロック数をカウントする",
"- block = 0",
"- cur = False",
"- if A[0] >= i:",
"- block += 1",
"- cur = True",
"- for j in range(1, len(A)):",
"- if A[j] >= i:",
"- if not cur:",
"- block += 1",
"- cur = True",
"- else:",
"- cur = False",
"- ans += block",
"+for i in range(N):",
"+ if A[i] > cur:",
"+ ans += A[i] - cur",
"+ cur = A[i]"
] | false | 0.061062 | 0.036866 | 1.656318 |
[
"s449477577",
"s497630700"
] |
u057109575
|
p02598
|
python
|
s199803989
|
s393652393
| 185 | 170 | 94,108 | 104,172 |
Accepted
|
Accepted
| 8.11 |
N, K = list(map(int, input().split()))
X = list(map(int, input().split()))
ub = 10 ** 9 + 7
lb = 0
while ub - lb > 1:
mid = (ub + lb) // 2
res = 0
for v in X:
res += (v - 1) // mid
if res <= K:
ub = mid
else:
lb = mid
print(ub)
|
N, K = list(map(int, input().split()))
X = list(map(int, input().split()))
ub = 10 ** 9 + 7
lb = 0
while ub - lb > 1:
mid = (ub + lb) // 2
cnt = 0
for v in X:
cnt += -(-v // mid) - 1
if cnt <= K:
ub = mid
else:
lb = mid
print(ub)
| 19 | 19 | 289 | 291 |
N, K = list(map(int, input().split()))
X = list(map(int, input().split()))
ub = 10**9 + 7
lb = 0
while ub - lb > 1:
mid = (ub + lb) // 2
res = 0
for v in X:
res += (v - 1) // mid
if res <= K:
ub = mid
else:
lb = mid
print(ub)
|
N, K = list(map(int, input().split()))
X = list(map(int, input().split()))
ub = 10**9 + 7
lb = 0
while ub - lb > 1:
mid = (ub + lb) // 2
cnt = 0
for v in X:
cnt += -(-v // mid) - 1
if cnt <= K:
ub = mid
else:
lb = mid
print(ub)
| false | 0 |
[
"- res = 0",
"+ cnt = 0",
"- res += (v - 1) // mid",
"- if res <= K:",
"+ cnt += -(-v // mid) - 1",
"+ if cnt <= K:"
] | false | 0.03753 | 0.037226 | 1.008164 |
[
"s199803989",
"s393652393"
] |
u936985471
|
p03213
|
python
|
s631564387
|
s640757730
| 26 | 21 | 3,444 | 3,316 |
Accepted
|
Accepted
| 19.23 |
def factorization(n):
arr = []
temp = n
for i in range(2, int(-(-n**0.5//1))+1):
if temp%i==0:
cnt=0
while temp%i==0:
cnt+=1
temp //= i
arr.append([i, cnt])
if temp!=1:
arr.append([temp, 1])
if arr==[]:
arr.append([n, 1])
return arr
N=int(eval(input()))
from collections import defaultdict
dic=defaultdict(int)
for i in range(1,N+1):
arr=factorization(i)
for a in arr:
dic[a[0]]+=a[1]
# これら素因数の集まりに対して、
# 2,4,4
# 74
# 2,24
# 4,14
# 個選択できるペアをいくつ作れるかを数える
items=list(dic.items())
def c(items,p):
return len(list([x for x in items if x[1]>=p]))
ans=0
ans+=c(items,74)
ans+=(c(items,4)*(c(items,4)-1)*(c(items,2)-2))//2
ans+=c(items,24)*(c(items,2)-1)
ans+=c(items,14)*(c(items,4)-1)
print(ans)
|
# 約数の数 = 素因数分解して、各素因数の(指数 + 1)をかけ合わせたもの
# 例：12 = 2^2 * 3^1 -> 3 * 2 = 6 (1,2,3,4,6,12)
# これが75になるためには、以下のペアを作れる必要がある。この組み合わせを数える
# 75 : 指数が74
# 3 * 25 : 指数が2 , 24
# 5 * 15 : 指数が4 , 14
# 3 * 5 * 5 : 指数が2,4,4
import sys
readline = sys.stdin.readline
N = int(readline())
def factorization(n):
res = []
temp = n
for i in range(2, int(-(-n ** 0.5 // 1)) + 1):
if temp % i == 0:
cnt = 0
while temp % i == 0:
cnt += 1
temp //= i
res.append([i,cnt])
if temp != 1:
res.append([temp, 1])
if res == []:
res.append([n, 1])
return res
from collections import defaultdict
dic = defaultdict(int)
for i in range(1, N + 1):
res = factorization(i)
for r in res:
dic[r[0]] += r[1]
ans = 0
vals = list(dic.values())
# 74以上のものを探す
i74 = 0
for v in vals:
if v >= 74:
i74 += 1
ans += i74
i2 = 0
i24 = 0
# 2,24以上のものを探す
for v in vals:
if v >= 24:
i24 += 1
elif v >= 2:
i2 += 1
ans += (i24 * (i24 - 1))
ans += i24 * i2
# 5,15以上のものを探す
i4 = 0
i14 = 0
for v in vals:
if v >= 14:
i14 += 1
elif v >= 4:
i4 += 1
ans += (i14 * (i14 - 1))
ans += i14 * i4
# 2,4,4を探す
i4 = 0
i2 = 0
for v in vals:
if v >= 4:
i4 += 1
elif v >= 2:
i2 += 1
if i4 >= 3:
ans += ((i4 * (i4 - 1)) // 2) * (i4 - 2)
ans += ((i4 * (i4 - 1)) // 2) * i2
print(ans)
| 44 | 81 | 858 | 1,394 |
def factorization(n):
arr = []
temp = n
for i in range(2, int(-(-(n**0.5) // 1)) + 1):
if temp % i == 0:
cnt = 0
while temp % i == 0:
cnt += 1
temp //= i
arr.append([i, cnt])
if temp != 1:
arr.append([temp, 1])
if arr == []:
arr.append([n, 1])
return arr
N = int(eval(input()))
from collections import defaultdict
dic = defaultdict(int)
for i in range(1, N + 1):
arr = factorization(i)
for a in arr:
dic[a[0]] += a[1]
# これら素因数の集まりに対して、
# 2,4,4
# 74
# 2,24
# 4,14
# 個選択できるペアをいくつ作れるかを数える
items = list(dic.items())
def c(items, p):
return len(list([x for x in items if x[1] >= p]))
ans = 0
ans += c(items, 74)
ans += (c(items, 4) * (c(items, 4) - 1) * (c(items, 2) - 2)) // 2
ans += c(items, 24) * (c(items, 2) - 1)
ans += c(items, 14) * (c(items, 4) - 1)
print(ans)
|
# 約数の数 = 素因数分解して、各素因数の(指数 + 1)をかけ合わせたもの
# 例：12 = 2^2 * 3^1 -> 3 * 2 = 6 (1,2,3,4,6,12)
# これが75になるためには、以下のペアを作れる必要がある。この組み合わせを数える
# 75 : 指数が74
# 3 * 25 : 指数が2 , 24
# 5 * 15 : 指数が4 , 14
# 3 * 5 * 5 : 指数が2,4,4
import sys
readline = sys.stdin.readline
N = int(readline())
def factorization(n):
res = []
temp = n
for i in range(2, int(-(-(n**0.5) // 1)) + 1):
if temp % i == 0:
cnt = 0
while temp % i == 0:
cnt += 1
temp //= i
res.append([i, cnt])
if temp != 1:
res.append([temp, 1])
if res == []:
res.append([n, 1])
return res
from collections import defaultdict
dic = defaultdict(int)
for i in range(1, N + 1):
res = factorization(i)
for r in res:
dic[r[0]] += r[1]
ans = 0
vals = list(dic.values())
# 74以上のものを探す
i74 = 0
for v in vals:
if v >= 74:
i74 += 1
ans += i74
i2 = 0
i24 = 0
# 2,24以上のものを探す
for v in vals:
if v >= 24:
i24 += 1
elif v >= 2:
i2 += 1
ans += i24 * (i24 - 1)
ans += i24 * i2
# 5,15以上のものを探す
i4 = 0
i14 = 0
for v in vals:
if v >= 14:
i14 += 1
elif v >= 4:
i4 += 1
ans += i14 * (i14 - 1)
ans += i14 * i4
# 2,4,4を探す
i4 = 0
i2 = 0
for v in vals:
if v >= 4:
i4 += 1
elif v >= 2:
i2 += 1
if i4 >= 3:
ans += ((i4 * (i4 - 1)) // 2) * (i4 - 2)
ans += ((i4 * (i4 - 1)) // 2) * i2
print(ans)
| false | 45.679012 |
[
"+# 約数の数 = 素因数分解して、各素因数の(指数 + 1)をかけ合わせたもの",
"+# 例：12 = 2^2 * 3^1 -> 3 * 2 = 6 (1,2,3,4,6,12)",
"+# これが75になるためには、以下のペアを作れる必要がある。この組み合わせを数える",
"+# 75 : 指数が74",
"+# 3 * 25 : 指数が2 , 24",
"+# 5 * 15 : 指数が4 , 14",
"+# 3 * 5 * 5 : 指数が2,4,4",
"+import sys",
"+",
"+readline = sys.stdin.readline",
"+N = int(readline())",
"+",
"+",
"- arr = []",
"+ res = []",
"- arr.append([i, cnt])",
"+ res.append([i, cnt])",
"- arr.append([temp, 1])",
"- if arr == []:",
"- arr.append([n, 1])",
"- return arr",
"+ res.append([temp, 1])",
"+ if res == []:",
"+ res.append([n, 1])",
"+ return res",
"-N = int(eval(input()))",
"- arr = factorization(i)",
"- for a in arr:",
"- dic[a[0]] += a[1]",
"-# これら素因数の集まりに対して、",
"-# 2,4,4",
"-# 74",
"-# 2,24",
"-# 4,14",
"-# 個選択できるペアをいくつ作れるかを数える",
"-items = list(dic.items())",
"-",
"-",
"-def c(items, p):",
"- return len(list([x for x in items if x[1] >= p]))",
"-",
"-",
"+ res = factorization(i)",
"+ for r in res:",
"+ dic[r[0]] += r[1]",
"-ans += c(items, 74)",
"-ans += (c(items, 4) * (c(items, 4) - 1) * (c(items, 2) - 2)) // 2",
"-ans += c(items, 24) * (c(items, 2) - 1)",
"-ans += c(items, 14) * (c(items, 4) - 1)",
"+vals = list(dic.values())",
"+# 74以上のものを探す",
"+i74 = 0",
"+for v in vals:",
"+ if v >= 74:",
"+ i74 += 1",
"+ans += i74",
"+i2 = 0",
"+i24 = 0",
"+# 2,24以上のものを探す",
"+for v in vals:",
"+ if v >= 24:",
"+ i24 += 1",
"+ elif v >= 2:",
"+ i2 += 1",
"+ans += i24 * (i24 - 1)",
"+ans += i24 * i2",
"+# 5,15以上のものを探す",
"+i4 = 0",
"+i14 = 0",
"+for v in vals:",
"+ if v >= 14:",
"+ i14 += 1",
"+ elif v >= 4:",
"+ i4 += 1",
"+ans += i14 * (i14 - 1)",
"+ans += i14 * i4",
"+# 2,4,4を探す",
"+i4 = 0",
"+i2 = 0",
"+for v in vals:",
"+ if v >= 4:",
"+ i4 += 1",
"+ elif v >= 2:",
"+ i2 += 1",
"+if i4 >= 3:",
"+ ans += ((i4 * (i4 - 1)) // 2) * (i4 - 2)",
"+ans += ((i4 * (i4 - 1)) // 2) * i2"
] | false | 0.042471 | 0.042437 | 1.000804 |
[
"s631564387",
"s640757730"
] |
u102461423
|
p03305
|
python
|
s651399075
|
s312039062
| 1,545 | 1,240 | 63,828 | 78,388 |
Accepted
|
Accepted
| 19.74 |
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
import numpy as np
from heapq import heappush, heappop
N,M,S,T = map(int,input().split())
graph = [[] for _ in range(N+1)]
for _ in range(M):
u,v,a,b = map(int,input().split())
graph[u].append((v,a,b))
graph[v].append((u,a,b))
def dijkstra(start, mode):
INF = 10 ** 15
dist = [INF] * (N+1)
dist[start] = 0
q = [(0,start)]
while q:
d,v = heappop(q)
if dist[v] < d:
continue
for w,*a in graph[v]:
d1 = d + a[mode]
if dist[w] > d1:
dist[w] = d1
heappush(q, (d1,w))
return dist
d1 = np.array(dijkstra(S,0))
d2 = np.array(dijkstra(T,1))
d1 += d2
answer = 10 ** 15 - np.minimum.accumulate(d1[::-1])[::-1][1:]
print(*answer, sep='\n')
|
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
import numpy as np
from heapq import heappush, heappop
N,M,S,T = list(map(int,input().split()))
graph = [[] for _ in range(N+1)]
for _ in range(M):
u,v,a,b = list(map(int,input().split()))
graph[u].append((v,a,b))
graph[v].append((u,a,b))
def dijkstra(start, mode):
INF = 10 ** 15
dist = [INF] * (N+1)
dist[start] = 0
q = [(0,start)]
while q:
d,v = heappop(q)
if dist[v] < d:
continue
for w,*a in graph[v]:
d1 = d + a[mode]
if dist[w] > d1:
dist[w] = d1
heappush(q, (d1,w))
return dist
d1 = np.array(dijkstra(S,0))
d2 = np.array(dijkstra(T,1))
d1 += d2
answer = 10 ** 15 - np.minimum.accumulate(d1[::-1])[::-1][1:]
print(('\n'.join(answer.astype(str))))
| 37 | 36 | 866 | 876 |
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
import numpy as np
from heapq import heappush, heappop
N, M, S, T = map(int, input().split())
graph = [[] for _ in range(N + 1)]
for _ in range(M):
u, v, a, b = map(int, input().split())
graph[u].append((v, a, b))
graph[v].append((u, a, b))
def dijkstra(start, mode):
INF = 10**15
dist = [INF] * (N + 1)
dist[start] = 0
q = [(0, start)]
while q:
d, v = heappop(q)
if dist[v] < d:
continue
for w, *a in graph[v]:
d1 = d + a[mode]
if dist[w] > d1:
dist[w] = d1
heappush(q, (d1, w))
return dist
d1 = np.array(dijkstra(S, 0))
d2 = np.array(dijkstra(T, 1))
d1 += d2
answer = 10**15 - np.minimum.accumulate(d1[::-1])[::-1][1:]
print(*answer, sep="\n")
|
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
import numpy as np
from heapq import heappush, heappop
N, M, S, T = list(map(int, input().split()))
graph = [[] for _ in range(N + 1)]
for _ in range(M):
u, v, a, b = list(map(int, input().split()))
graph[u].append((v, a, b))
graph[v].append((u, a, b))
def dijkstra(start, mode):
INF = 10**15
dist = [INF] * (N + 1)
dist[start] = 0
q = [(0, start)]
while q:
d, v = heappop(q)
if dist[v] < d:
continue
for w, *a in graph[v]:
d1 = d + a[mode]
if dist[w] > d1:
dist[w] = d1
heappush(q, (d1, w))
return dist
d1 = np.array(dijkstra(S, 0))
d2 = np.array(dijkstra(T, 1))
d1 += d2
answer = 10**15 - np.minimum.accumulate(d1[::-1])[::-1][1:]
print(("\n".join(answer.astype(str))))
| false | 2.702703 |
[
"-N, M, S, T = map(int, input().split())",
"+N, M, S, T = list(map(int, input().split()))",
"- u, v, a, b = map(int, input().split())",
"+ u, v, a, b = list(map(int, input().split()))",
"-print(*answer, sep=\"\\n\")",
"+print((\"\\n\".join(answer.astype(str))))"
] | false | 0.337645 | 0.31021 | 1.088439 |
[
"s651399075",
"s312039062"
] |
u493130708
|
p02949
|
python
|
s229797415
|
s383740384
| 1,012 | 576 | 75,856 | 75,152 |
Accepted
|
Accepted
| 43.08 |
import bisect
import collections
import copy
import functools
import heapq
import math
import sys
from collections import deque
from collections import defaultdict
input = sys.stdin.readline
MOD = 10**9+7
N,M,P = list(map(int,(input().split())))
line = []
for i in range(M):
a,b,c = list(map(int,(input().split())))
line.append([a-1,b-1,-c+P])
min_distance = [float("inf")]*N # min_distance[i] は始点から街iまでの最短距離
min_distance[0] = 0 # 始点から始点への最短距離は0とする
flag = 0
for _ in range(N):
update = False
for s,g,d in line: # [s,g,d] = [道路の始点,道路の終点,道路の長さ] について、すべての道路を見る
if min_distance[s] != float("inf") and min_distance[s] + d < min_distance[g]: # 最短経路が確立されている街から伸びる道路を通ることで、距離を短くできるならば、
min_distance[g] = min_distance[s] + d # 最短距離を上書きする
update = True
if not update:
flag = 1
break
if flag == 1:
ans = min_distance[N-1]
print((max(-ans,0)))
else:
for _ in range(N):
for s,g,d in line: # [s,g,d] = [道路の始点,道路の終点,道路の長さ] について、すべての道路を見る
if min_distance[s] != float("inf") and min_distance[s] + d < min_distance[g]: # 最短経路が確立されている街から伸びる道路を通ることで、距離を短くできるならば、
min_distance[g] = -float("inf")
if g == N-1:
break
else:
continue
break
ans = min_distance[N-1]
if ans == -float("inf"):
print((-1))
else:
print((max(-ans,0)))
#print(min_distance)
|
import bisect
import collections
import copy
import functools
import heapq
import math
import sys
from collections import deque
from collections import defaultdict
input = sys.stdin.readline
MOD = 10**9+7
INF = float("inf")
N,M,P = list(map(int,(input().split())))
line = []
for i in range(M):
a,b,c = list(map(int,(input().split())))
line.append([a-1,b-1,-c+P])
min_distance = [INF]*N # min_distance[i] は始点から街iまでの最短距離
min_distance[0] = 0 # 始点から始点への最短距離は0とする
def Bellman_Ford():
for _ in range(N):
update = False
for s,g,d in line: # [s,g,d] = [道路の始点,道路の終点,道路の長さ] について、すべての道路を見る
if min_distance[s] != INF and min_distance[s] + d < min_distance[g]: # 最短経路が確立されている街から伸びる道路を通ることで、距離を短くできるならば、
min_distance[g] = min_distance[s] + d # 最短距離を上書きする
update = True
if not update:
flag = 1
break
def Bellman_Ford2():
for _ in range(N):
for s,g,d in line: # [s,g,d] = [道路の始点,道路の終点,道路の長さ] について、すべての道路を見る
if min_distance[s] != INF and min_distance[s] + d < min_distance[g]: # 最短経路が確立されている街から伸びる道路を通ることで、距離を短くできるならば、
min_distance[g] = -INF
if g == N-1:
break
else:
continue
break
flag = 0
Bellman_Ford()
if flag == 1:
ans = min_distance[N-1]
print((max(-ans,0)))
else:
Bellman_Ford2()
ans = min_distance[N-1]
if ans == -INF:
print((-1))
else:
print((max(-ans,0)))
#print(min_distance)
| 52 | 59 | 1,502 | 1,565 |
import bisect
import collections
import copy
import functools
import heapq
import math
import sys
from collections import deque
from collections import defaultdict
input = sys.stdin.readline
MOD = 10**9 + 7
N, M, P = list(map(int, (input().split())))
line = []
for i in range(M):
a, b, c = list(map(int, (input().split())))
line.append([a - 1, b - 1, -c + P])
min_distance = [float("inf")] * N # min_distance[i] は始点から街iまでの最短距離
min_distance[0] = 0 # 始点から始点への最短距離は0とする
flag = 0
for _ in range(N):
update = False
for s, g, d in line: # [s,g,d] = [道路の始点,道路の終点,道路の長さ] について、すべての道路を見る
if (
min_distance[s] != float("inf") and min_distance[s] + d < min_distance[g]
): # 最短経路が確立されている街から伸びる道路を通ることで、距離を短くできるならば、
min_distance[g] = min_distance[s] + d # 最短距離を上書きする
update = True
if not update:
flag = 1
break
if flag == 1:
ans = min_distance[N - 1]
print((max(-ans, 0)))
else:
for _ in range(N):
for s, g, d in line: # [s,g,d] = [道路の始点,道路の終点,道路の長さ] について、すべての道路を見る
if (
min_distance[s] != float("inf")
and min_distance[s] + d < min_distance[g]
): # 最短経路が確立されている街から伸びる道路を通ることで、距離を短くできるならば、
min_distance[g] = -float("inf")
if g == N - 1:
break
else:
continue
break
ans = min_distance[N - 1]
if ans == -float("inf"):
print((-1))
else:
print((max(-ans, 0)))
# print(min_distance)
|
import bisect
import collections
import copy
import functools
import heapq
import math
import sys
from collections import deque
from collections import defaultdict
input = sys.stdin.readline
MOD = 10**9 + 7
INF = float("inf")
N, M, P = list(map(int, (input().split())))
line = []
for i in range(M):
a, b, c = list(map(int, (input().split())))
line.append([a - 1, b - 1, -c + P])
min_distance = [INF] * N # min_distance[i] は始点から街iまでの最短距離
min_distance[0] = 0 # 始点から始点への最短距離は0とする
def Bellman_Ford():
for _ in range(N):
update = False
for s, g, d in line: # [s,g,d] = [道路の始点,道路の終点,道路の長さ] について、すべての道路を見る
if (
min_distance[s] != INF and min_distance[s] + d < min_distance[g]
): # 最短経路が確立されている街から伸びる道路を通ることで、距離を短くできるならば、
min_distance[g] = min_distance[s] + d # 最短距離を上書きする
update = True
if not update:
flag = 1
break
def Bellman_Ford2():
for _ in range(N):
for s, g, d in line: # [s,g,d] = [道路の始点,道路の終点,道路の長さ] について、すべての道路を見る
if (
min_distance[s] != INF and min_distance[s] + d < min_distance[g]
): # 最短経路が確立されている街から伸びる道路を通ることで、距離を短くできるならば、
min_distance[g] = -INF
if g == N - 1:
break
else:
continue
break
flag = 0
Bellman_Ford()
if flag == 1:
ans = min_distance[N - 1]
print((max(-ans, 0)))
else:
Bellman_Ford2()
ans = min_distance[N - 1]
if ans == -INF:
print((-1))
else:
print((max(-ans, 0)))
# print(min_distance)
| false | 11.864407 |
[
"+INF = float(\"inf\")",
"-min_distance = [float(\"inf\")] * N # min_distance[i] は始点から街iまでの最短距離",
"+min_distance = [INF] * N # min_distance[i] は始点から街iまでの最短距離",
"-flag = 0",
"-for _ in range(N):",
"- update = False",
"- for s, g, d in line: # [s,g,d] = [道路の始点,道路の終点,道路の長さ] について、すべての道路を見る",
"- if (",
"- min_distance[s] != float(\"inf\") and min_distance[s] + d < min_distance[g]",
"- ): # 最短経路が確立されている街から伸びる道路を通ることで、距離を短くできるならば、",
"- min_distance[g] = min_distance[s] + d # 最短距離を上書きする",
"- update = True",
"- if not update:",
"- flag = 1",
"- break",
"-if flag == 1:",
"- ans = min_distance[N - 1]",
"- print((max(-ans, 0)))",
"-else:",
"+",
"+",
"+def Bellman_Ford():",
"+ for _ in range(N):",
"+ update = False",
"+ for s, g, d in line: # [s,g,d] = [道路の始点,道路の終点,道路の長さ] について、すべての道路を見る",
"+ if (",
"+ min_distance[s] != INF and min_distance[s] + d < min_distance[g]",
"+ ): # 最短経路が確立されている街から伸びる道路を通ることで、距離を短くできるならば、",
"+ min_distance[g] = min_distance[s] + d # 最短距離を上書きする",
"+ update = True",
"+ if not update:",
"+ flag = 1",
"+ break",
"+",
"+",
"+def Bellman_Ford2():",
"- min_distance[s] != float(\"inf\")",
"- and min_distance[s] + d < min_distance[g]",
"+ min_distance[s] != INF and min_distance[s] + d < min_distance[g]",
"- min_distance[g] = -float(\"inf\")",
"+ min_distance[g] = -INF",
"+",
"+",
"+flag = 0",
"+Bellman_Ford()",
"+if flag == 1:",
"- if ans == -float(\"inf\"):",
"+ print((max(-ans, 0)))",
"+else:",
"+ Bellman_Ford2()",
"+ ans = min_distance[N - 1]",
"+ if ans == -INF:"
] | false | 0.03725 | 0.037132 | 1.003175 |
[
"s229797415",
"s383740384"
] |
u191874006
|
p02947
|
python
|
s420808978
|
s468164977
| 1,778 | 374 | 105,084 | 31,800 |
Accepted
|
Accepted
| 78.97 |
#!/usr/bin/env python3
#ABC137 C
import sys
import math
import bisect
sys.setrecursionlimit(1000000000)
from heapq import heappush, heappop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
def comb(n,r):
return math.factorial(n)//math.factorial(n-r)//math.factorial(r)
n = I()
s = [eval(input()) for _ in range(n)]
x = [list(Counter(s[i]).items()) for i in range(n)]
for i in x:
i.sort()
y = [tuple(i) for i in x]
f = defaultdict(lambda : 0)
for i in range(n):
f[y[i]] += 1
ans = 0
for i in list(f.values()):
if i < 2:
continue
ans += comb(i,2)
print(ans)
|
#!/usr/bin/env python3
#ABC137 C
import sys
import math
import bisect
sys.setrecursionlimit(1000000000)
from heapq import heappush, heappop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
n = I()
s = [list(eval(input())) for _ in range(n)]
for i in s:
i.sort()
s = [''.join(i) for i in s]
t = list(Counter(s).items())
ans = 0
for i,j in t:
if j == 1:
continue
else:
ans += (j)*(j-1)//2
print(ans)
| 36 | 31 | 878 | 720 |
#!/usr/bin/env python3
# ABC137 C
import sys
import math
import bisect
sys.setrecursionlimit(1000000000)
from heapq import heappush, heappop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7
def I():
return int(sys.stdin.readline())
def LI():
return list(map(int, sys.stdin.readline().split()))
def comb(n, r):
return math.factorial(n) // math.factorial(n - r) // math.factorial(r)
n = I()
s = [eval(input()) for _ in range(n)]
x = [list(Counter(s[i]).items()) for i in range(n)]
for i in x:
i.sort()
y = [tuple(i) for i in x]
f = defaultdict(lambda: 0)
for i in range(n):
f[y[i]] += 1
ans = 0
for i in list(f.values()):
if i < 2:
continue
ans += comb(i, 2)
print(ans)
|
#!/usr/bin/env python3
# ABC137 C
import sys
import math
import bisect
sys.setrecursionlimit(1000000000)
from heapq import heappush, heappop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7
def I():
return int(sys.stdin.readline())
def LI():
return list(map(int, sys.stdin.readline().split()))
n = I()
s = [list(eval(input())) for _ in range(n)]
for i in s:
i.sort()
s = ["".join(i) for i in s]
t = list(Counter(s).items())
ans = 0
for i, j in t:
if j == 1:
continue
else:
ans += (j) * (j - 1) // 2
print(ans)
| false | 13.888889 |
[
"-def comb(n, r):",
"- return math.factorial(n) // math.factorial(n - r) // math.factorial(r)",
"-",
"-",
"-s = [eval(input()) for _ in range(n)]",
"-x = [list(Counter(s[i]).items()) for i in range(n)]",
"-for i in x:",
"+s = [list(eval(input())) for _ in range(n)]",
"+for i in s:",
"-y = [tuple(i) for i in x]",
"-f = defaultdict(lambda: 0)",
"-for i in range(n):",
"- f[y[i]] += 1",
"+s = [\"\".join(i) for i in s]",
"+t = list(Counter(s).items())",
"-for i in list(f.values()):",
"- if i < 2:",
"+for i, j in t:",
"+ if j == 1:",
"- ans += comb(i, 2)",
"+ else:",
"+ ans += (j) * (j - 1) // 2"
] | false | 0.089969 | 0.06057 | 1.485368 |
[
"s420808978",
"s468164977"
] |
u647522078
|
p02922
|
python
|
s434636681
|
s662233116
| 19 | 17 | 2,940 | 2,940 |
Accepted
|
Accepted
| 10.53 |
a,b = list(map(int, input().split()))
cnt = 0
tap = 0
for i in range(10000):
if cnt >= b or b == 1:
break
if i == 0:
cnt += a
else:
cnt += a-1
tap += 1
print(tap)
|
a, b = list(map(int, input().split()))
if b == 1:
print((0))
exit(0)
for i in range(10000):
if a + i * a - i >= b:
print((1 + i))
break
| 13 | 8 | 210 | 160 |
a, b = list(map(int, input().split()))
cnt = 0
tap = 0
for i in range(10000):
if cnt >= b or b == 1:
break
if i == 0:
cnt += a
else:
cnt += a - 1
tap += 1
print(tap)
|
a, b = list(map(int, input().split()))
if b == 1:
print((0))
exit(0)
for i in range(10000):
if a + i * a - i >= b:
print((1 + i))
break
| false | 38.461538 |
[
"-cnt = 0",
"-tap = 0",
"+if b == 1:",
"+ print((0))",
"+ exit(0)",
"- if cnt >= b or b == 1:",
"+ if a + i * a - i >= b:",
"+ print((1 + i))",
"- if i == 0:",
"- cnt += a",
"- else:",
"- cnt += a - 1",
"- tap += 1",
"-print(tap)"
] | false | 0.047892 | 0.048276 | 0.992045 |
[
"s434636681",
"s662233116"
] |
u108617242
|
p02659
|
python
|
s625831948
|
s103635673
| 56 | 30 | 61,804 | 8,988 |
Accepted
|
Accepted
| 46.43 |
A, B = list(map(float, input().split()))
print(((int(A)*round(B*100))//100))
|
A, B = list(map(str, input().split()))
B = ''.join(B.split('.'))
print((int(A)*int(B)//100))
| 2 | 3 | 69 | 86 |
A, B = list(map(float, input().split()))
print(((int(A) * round(B * 100)) // 100))
|
A, B = list(map(str, input().split()))
B = "".join(B.split("."))
print((int(A) * int(B) // 100))
| false | 33.333333 |
[
"-A, B = list(map(float, input().split()))",
"-print(((int(A) * round(B * 100)) // 100))",
"+A, B = list(map(str, input().split()))",
"+B = \"\".join(B.split(\".\"))",
"+print((int(A) * int(B) // 100))"
] | false | 0.046579 | 0.04634 | 1.005164 |
[
"s625831948",
"s103635673"
] |
u622523700
|
p03163
|
python
|
s966846017
|
s855026507
| 468 | 230 | 119,916 | 92,264 |
Accepted
|
Accepted
| 50.85 |
n, W = list(map(int, input().split()))
dp = [[0] * (W + 1) for _ in range(n + 1)]
dp[0][W] = 0
for i in range(n):
w, v = list(map(int, input().split()))
for j in range(W + 1):
if j >= w:
dp[i + 1][j] = max(dp[i][j - w] + v, dp[i][j])
else:
dp[i + 1][j] = dp[i][j]
print((dp[n][W]))
|
import numpy as np
n, W = list(map(int, input().split()))
dp = np.zeros((n + 1, W + 1))
for i in range(n):
w, v = list(map(int, input().split()))
dp[i + 1] = dp[i]
if w <= W:
dp[i + 1][w:] = np.maximum(dp[i][:W - w + 1] + v, dp[i][w:])
print((int(dp[n][W])))
| 12 | 10 | 327 | 274 |
n, W = list(map(int, input().split()))
dp = [[0] * (W + 1) for _ in range(n + 1)]
dp[0][W] = 0
for i in range(n):
w, v = list(map(int, input().split()))
for j in range(W + 1):
if j >= w:
dp[i + 1][j] = max(dp[i][j - w] + v, dp[i][j])
else:
dp[i + 1][j] = dp[i][j]
print((dp[n][W]))
|
import numpy as np
n, W = list(map(int, input().split()))
dp = np.zeros((n + 1, W + 1))
for i in range(n):
w, v = list(map(int, input().split()))
dp[i + 1] = dp[i]
if w <= W:
dp[i + 1][w:] = np.maximum(dp[i][: W - w + 1] + v, dp[i][w:])
print((int(dp[n][W])))
| false | 16.666667 |
[
"+import numpy as np",
"+",
"-dp = [[0] * (W + 1) for _ in range(n + 1)]",
"-dp[0][W] = 0",
"+dp = np.zeros((n + 1, W + 1))",
"- for j in range(W + 1):",
"- if j >= w:",
"- dp[i + 1][j] = max(dp[i][j - w] + v, dp[i][j])",
"- else:",
"- dp[i + 1][j] = dp[i][j]",
"-print((dp[n][W]))",
"+ dp[i + 1] = dp[i]",
"+ if w <= W:",
"+ dp[i + 1][w:] = np.maximum(dp[i][: W - w + 1] + v, dp[i][w:])",
"+print((int(dp[n][W])))"
] | false | 0.038533 | 0.17291 | 0.22285 |
[
"s966846017",
"s855026507"
] |
u947883560
|
p02642
|
python
|
s137443023
|
s366147166
| 462 | 207 | 112,240 | 32,304 |
Accepted
|
Accepted
| 55.19 |
#!/usr/bin/env python3
import sys
import math
sys.setrecursionlimit(10**8)
def eratosthenes_sieve(n):
table = [0] * (n + 1)
prime_list = []
for i in range(2, n + 1):
if table[i] == 0:
prime_list.append(i)
for j in range(i + i, n + 1, i):
table[j] = 1
return prime_list
def main():
N = int(eval(input()))
A = list(map(int, input().split()))
ans = 0
m = max(A)
zeta = [0]*(m+1)
for a in A:
zeta[a] += 1
# 素数の列挙
primes = eratosthenes_sieve(m)
# ゼータ変換
for p in primes:
for i in range(1, m//p+1):
zeta[p*i] += zeta[i]
for a in A:
if zeta[a] == 1:
ans += 1
print(ans)
# print(zeta)
# for a in A:
# print(a, zeta[a])
return
if __name__ == '__main__':
main()
|
#!/usr/bin/env python3
import sys
sys.setrecursionlimit(10**8)
def input(): return sys.stdin.readline().strip()
def INT(): return int(eval(input()))
def MAP(): return list(map(int, input().split()))
def LIST(): return list(map(int, input().split()))
def ZIP(n): return [LIST() for _ in range(n)]
INF = float("inf")
MOD = 10**9 + 7
def main():
N = INT()
A = LIST()
A.sort()
M = A[-1] + 1
table = [0] * (M)
for i in A:
if table[i] == 0:
table[i] = -1
for j in range(i + i, M, i):
table[j] = 1
elif table[i] == -1:
# 重複しているということ
table[i] = -2
# print(table)
cnt = 0
for i in range(N):
if table[A[i]] == -1:
cnt += 1
print(cnt)
return
if __name__ == '__main__':
main()
| 50 | 41 | 887 | 849 |
#!/usr/bin/env python3
import sys
import math
sys.setrecursionlimit(10**8)
def eratosthenes_sieve(n):
table = [0] * (n + 1)
prime_list = []
for i in range(2, n + 1):
if table[i] == 0:
prime_list.append(i)
for j in range(i + i, n + 1, i):
table[j] = 1
return prime_list
def main():
N = int(eval(input()))
A = list(map(int, input().split()))
ans = 0
m = max(A)
zeta = [0] * (m + 1)
for a in A:
zeta[a] += 1
# 素数の列挙
primes = eratosthenes_sieve(m)
# ゼータ変換
for p in primes:
for i in range(1, m // p + 1):
zeta[p * i] += zeta[i]
for a in A:
if zeta[a] == 1:
ans += 1
print(ans)
# print(zeta)
# for a in A:
# print(a, zeta[a])
return
if __name__ == "__main__":
main()
|
#!/usr/bin/env python3
import sys
sys.setrecursionlimit(10**8)
def input():
return sys.stdin.readline().strip()
def INT():
return int(eval(input()))
def MAP():
return list(map(int, input().split()))
def LIST():
return list(map(int, input().split()))
def ZIP(n):
return [LIST() for _ in range(n)]
INF = float("inf")
MOD = 10**9 + 7
def main():
N = INT()
A = LIST()
A.sort()
M = A[-1] + 1
table = [0] * (M)
for i in A:
if table[i] == 0:
table[i] = -1
for j in range(i + i, M, i):
table[j] = 1
elif table[i] == -1:
# 重複しているということ
table[i] = -2
# print(table)
cnt = 0
for i in range(N):
if table[A[i]] == -1:
cnt += 1
print(cnt)
return
if __name__ == "__main__":
main()
| false | 18 |
[
"-import math",
"-def eratosthenes_sieve(n):",
"- table = [0] * (n + 1)",
"- prime_list = []",
"- for i in range(2, n + 1):",
"- if table[i] == 0:",
"- prime_list.append(i)",
"- for j in range(i + i, n + 1, i):",
"- table[j] = 1",
"- return prime_list",
"+def input():",
"+ return sys.stdin.readline().strip()",
"+",
"+",
"+def INT():",
"+ return int(eval(input()))",
"+",
"+",
"+def MAP():",
"+ return list(map(int, input().split()))",
"+",
"+",
"+def LIST():",
"+ return list(map(int, input().split()))",
"+",
"+",
"+def ZIP(n):",
"+ return [LIST() for _ in range(n)]",
"+",
"+",
"+INF = float(\"inf\")",
"+MOD = 10**9 + 7",
"- N = int(eval(input()))",
"- A = list(map(int, input().split()))",
"- ans = 0",
"- m = max(A)",
"- zeta = [0] * (m + 1)",
"- for a in A:",
"- zeta[a] += 1",
"- # 素数の列挙",
"- primes = eratosthenes_sieve(m)",
"- # ゼータ変換",
"- for p in primes:",
"- for i in range(1, m // p + 1):",
"- zeta[p * i] += zeta[i]",
"- for a in A:",
"- if zeta[a] == 1:",
"- ans += 1",
"- print(ans)",
"- # print(zeta)",
"- # for a in A:",
"- # print(a, zeta[a])",
"+ N = INT()",
"+ A = LIST()",
"+ A.sort()",
"+ M = A[-1] + 1",
"+ table = [0] * (M)",
"+ for i in A:",
"+ if table[i] == 0:",
"+ table[i] = -1",
"+ for j in range(i + i, M, i):",
"+ table[j] = 1",
"+ elif table[i] == -1:",
"+ # 重複しているということ",
"+ table[i] = -2",
"+ # print(table)",
"+ cnt = 0",
"+ for i in range(N):",
"+ if table[A[i]] == -1:",
"+ cnt += 1",
"+ print(cnt)"
] | false | 0.03161 | 0.031763 | 0.995172 |
[
"s137443023",
"s366147166"
] |
u540877546
|
p02768
|
python
|
s556013379
|
s508045789
| 210 | 183 | 38,512 | 38,512 |
Accepted
|
Accepted
| 12.86 |
n, a, b = list(map(int, input().split()))
mod = 10**9+7
def extgcd(a, b):
r = [1, 0, a]
w = [0, 1, b]
while w[2] != 1:
q = r[2]//w[2]
r2 = w
w2 = [r[0]-q*w[0], r[1]-q*w[1], r[2]-q*w[2]]
r = r2
w = w2
# [x,y]
return [w[0], w[1]]
def mod_inv(a, m):
x = extgcd(a, m)[0]
return (m+x % m) % m
def comb(n, r, mod):
u = 1
d = 1
for i in range(r):
u *= n-i
d *= i+1
if u >= mod:
u %= mod
if d >= mod:
d %= mod
return u*mod_inv(d, mod)
def binary(n):
return bin(n)[2:]
def pow_by_binary_exponentiation(a, x, n): # a^x mod n
x = [int(b) for b in binary(x)]
y = a
for i in range(1, len(x)):
y = (y**2) % n
if x[i] == 1:
y = (y * a) % n
return y
ac = comb(n, a, mod)
bc = comb(n, b, mod)
ans = pow_by_binary_exponentiation(2, n, mod)
print((((ans - ac - bc - 1) % mod)//1))
|
n, a, b = list(map(int, input().split()))
mod = 10**9+7
def binary(n):
return bin(n)[2:]
# a^x mod n : ans = pow_by_binary_exponentiation(2, 1000, 10**9+7)
def pow_by_binary_exponentiation(a, x, n):
x = [int(b) for b in binary(x)]
y = a
for i in range(1, len(x)):
y = (y**2) % n
if x[i] == 1:
y = (y * a) % n
return y
def combination(n, r, mod=10**9+7):
n1, r = n+1, min(r, n-r)
numer = denom = 1
for i in range(1, r+1):
numer = numer * (n1-i) % mod
denom = denom * i % mod
return numer * pow(denom, mod-2, mod) % mod
ac = combination(n, a, mod)
bc = combination(n, b, mod)
ans = pow_by_binary_exponentiation(2, n, mod)
print((((ans - ac - bc - 1) % mod)//1))
| 53 | 32 | 1,007 | 771 |
n, a, b = list(map(int, input().split()))
mod = 10**9 + 7
def extgcd(a, b):
r = [1, 0, a]
w = [0, 1, b]
while w[2] != 1:
q = r[2] // w[2]
r2 = w
w2 = [r[0] - q * w[0], r[1] - q * w[1], r[2] - q * w[2]]
r = r2
w = w2
# [x,y]
return [w[0], w[1]]
def mod_inv(a, m):
x = extgcd(a, m)[0]
return (m + x % m) % m
def comb(n, r, mod):
u = 1
d = 1
for i in range(r):
u *= n - i
d *= i + 1
if u >= mod:
u %= mod
if d >= mod:
d %= mod
return u * mod_inv(d, mod)
def binary(n):
return bin(n)[2:]
def pow_by_binary_exponentiation(a, x, n): # a^x mod n
x = [int(b) for b in binary(x)]
y = a
for i in range(1, len(x)):
y = (y**2) % n
if x[i] == 1:
y = (y * a) % n
return y
ac = comb(n, a, mod)
bc = comb(n, b, mod)
ans = pow_by_binary_exponentiation(2, n, mod)
print((((ans - ac - bc - 1) % mod) // 1))
|
n, a, b = list(map(int, input().split()))
mod = 10**9 + 7
def binary(n):
return bin(n)[2:]
# a^x mod n : ans = pow_by_binary_exponentiation(2, 1000, 10**9+7)
def pow_by_binary_exponentiation(a, x, n):
x = [int(b) for b in binary(x)]
y = a
for i in range(1, len(x)):
y = (y**2) % n
if x[i] == 1:
y = (y * a) % n
return y
def combination(n, r, mod=10**9 + 7):
n1, r = n + 1, min(r, n - r)
numer = denom = 1
for i in range(1, r + 1):
numer = numer * (n1 - i) % mod
denom = denom * i % mod
return numer * pow(denom, mod - 2, mod) % mod
ac = combination(n, a, mod)
bc = combination(n, b, mod)
ans = pow_by_binary_exponentiation(2, n, mod)
print((((ans - ac - bc - 1) % mod) // 1))
| false | 39.622642 |
[
"-",
"-",
"-def extgcd(a, b):",
"- r = [1, 0, a]",
"- w = [0, 1, b]",
"- while w[2] != 1:",
"- q = r[2] // w[2]",
"- r2 = w",
"- w2 = [r[0] - q * w[0], r[1] - q * w[1], r[2] - q * w[2]]",
"- r = r2",
"- w = w2",
"- # [x,y]",
"- return [w[0], w[1]]",
"-",
"-",
"-def mod_inv(a, m):",
"- x = extgcd(a, m)[0]",
"- return (m + x % m) % m",
"-",
"-",
"-def comb(n, r, mod):",
"- u = 1",
"- d = 1",
"- for i in range(r):",
"- u *= n - i",
"- d *= i + 1",
"- if u >= mod:",
"- u %= mod",
"- if d >= mod:",
"- d %= mod",
"- return u * mod_inv(d, mod)",
"-def pow_by_binary_exponentiation(a, x, n): # a^x mod n",
"+# a^x mod n : ans = pow_by_binary_exponentiation(2, 1000, 10**9+7)",
"+def pow_by_binary_exponentiation(a, x, n):",
"-ac = comb(n, a, mod)",
"-bc = comb(n, b, mod)",
"+def combination(n, r, mod=10**9 + 7):",
"+ n1, r = n + 1, min(r, n - r)",
"+ numer = denom = 1",
"+ for i in range(1, r + 1):",
"+ numer = numer * (n1 - i) % mod",
"+ denom = denom * i % mod",
"+ return numer * pow(denom, mod - 2, mod) % mod",
"+",
"+",
"+ac = combination(n, a, mod)",
"+bc = combination(n, b, mod)"
] | false | 0.12716 | 0.093974 | 1.353139 |
[
"s556013379",
"s508045789"
] |
u391589398
|
p02582
|
python
|
s935504018
|
s038108402
| 58 | 25 | 61,588 | 8,940 |
Accepted
|
Accepted
| 56.9 |
S = eval(input())
RC = S.count('R')
if S[1] == 'S' and RC == 2:
print((1))
else:
print(RC)
|
S = eval(input())
# RC = S.count('R')
# if S[1] == 'S' and RC == 2:
# print(1)
# else:
# print(RC)
rs = S.split('S')
ans = 0
for r in rs:
ans = max(ans, len(r))
print(ans)
| 6 | 12 | 96 | 190 |
S = eval(input())
RC = S.count("R")
if S[1] == "S" and RC == 2:
print((1))
else:
print(RC)
|
S = eval(input())
# RC = S.count('R')
# if S[1] == 'S' and RC == 2:
# print(1)
# else:
# print(RC)
rs = S.split("S")
ans = 0
for r in rs:
ans = max(ans, len(r))
print(ans)
| false | 50 |
[
"-RC = S.count(\"R\")",
"-if S[1] == \"S\" and RC == 2:",
"- print((1))",
"-else:",
"- print(RC)",
"+# RC = S.count('R')",
"+# if S[1] == 'S' and RC == 2:",
"+# print(1)",
"+# else:",
"+# print(RC)",
"+rs = S.split(\"S\")",
"+ans = 0",
"+for r in rs:",
"+ ans = max(ans, len(r))",
"+print(ans)"
] | false | 0.054484 | 0.04608 | 1.182369 |
[
"s935504018",
"s038108402"
] |
u532966492
|
p02722
|
python
|
s548948941
|
s121674838
| 189 | 121 | 40,380 | 4,172 |
Accepted
|
Accepted
| 35.98 |
def main():
from collections import Counter as ct
def soinsuu(a):
yy, j = [], 2
y = yy.append
while(a > 1):
for i in range(j, int(a**0.5)+1):
if a % i == 0:
y(i)
a, j = a//i, i
break
else:
y(a)
break
return ct(yy)
def soinsuu2(a):
s = {1}
for i, j in list(a.items()):
s2 = set()
for k in range(1, j+1):
for l in s:
s2.add(l*pow(i, k))
s |= s2
s.remove(1)
return s
n = int(eval(input()))
ans = 0
s = soinsuu(n)
s2 = soinsuu2(s)
for i in s2:
m = n
while m % i == 0:
m //= i
m -= 1
if m % i == 0:
ans += 1
n -= 1
ans2 = 1
for i in list(soinsuu(n).values()):
ans2 *= i+1
ans2 -= 1
print((ans+ans2))
main()
|
def main():
from collections import Counter as ct
def soinsuu(a):
yy, j = [], 2
y = yy.append
while(a > 1):
for i in range(j, int(a**0.5)+1):
if a % i == 0:
y(i)
a, j = a//i, i
break
else:
y(a)
break
return ct(yy)
def yakusuu(a):
s = {1}
for i, j in list(a.items()):
s |= {l*i**k for l in s for k in range(1, j+1)}
s.remove(1)
return s
n = int(eval(input()))
ans = 1
for i in list(soinsuu(n-1).values()):
ans *= i+1
ans -= 1
for i in yakusuu(soinsuu(n)):
m = n
while m % i == 0:
m //= i
m -= 1
if m % i == 0:
ans += 1
print(ans)
main()
| 50 | 42 | 1,022 | 873 |
def main():
from collections import Counter as ct
def soinsuu(a):
yy, j = [], 2
y = yy.append
while a > 1:
for i in range(j, int(a**0.5) + 1):
if a % i == 0:
y(i)
a, j = a // i, i
break
else:
y(a)
break
return ct(yy)
def soinsuu2(a):
s = {1}
for i, j in list(a.items()):
s2 = set()
for k in range(1, j + 1):
for l in s:
s2.add(l * pow(i, k))
s |= s2
s.remove(1)
return s
n = int(eval(input()))
ans = 0
s = soinsuu(n)
s2 = soinsuu2(s)
for i in s2:
m = n
while m % i == 0:
m //= i
m -= 1
if m % i == 0:
ans += 1
n -= 1
ans2 = 1
for i in list(soinsuu(n).values()):
ans2 *= i + 1
ans2 -= 1
print((ans + ans2))
main()
|
def main():
from collections import Counter as ct
def soinsuu(a):
yy, j = [], 2
y = yy.append
while a > 1:
for i in range(j, int(a**0.5) + 1):
if a % i == 0:
y(i)
a, j = a // i, i
break
else:
y(a)
break
return ct(yy)
def yakusuu(a):
s = {1}
for i, j in list(a.items()):
s |= {l * i**k for l in s for k in range(1, j + 1)}
s.remove(1)
return s
n = int(eval(input()))
ans = 1
for i in list(soinsuu(n - 1).values()):
ans *= i + 1
ans -= 1
for i in yakusuu(soinsuu(n)):
m = n
while m % i == 0:
m //= i
m -= 1
if m % i == 0:
ans += 1
print(ans)
main()
| false | 16 |
[
"- def soinsuu2(a):",
"+ def yakusuu(a):",
"- s2 = set()",
"- for k in range(1, j + 1):",
"- for l in s:",
"- s2.add(l * pow(i, k))",
"- s |= s2",
"+ s |= {l * i**k for l in s for k in range(1, j + 1)}",
"- ans = 0",
"- s = soinsuu(n)",
"- s2 = soinsuu2(s)",
"- for i in s2:",
"+ ans = 1",
"+ for i in list(soinsuu(n - 1).values()):",
"+ ans *= i + 1",
"+ ans -= 1",
"+ for i in yakusuu(soinsuu(n)):",
"- n -= 1",
"- ans2 = 1",
"- for i in list(soinsuu(n).values()):",
"- ans2 *= i + 1",
"- ans2 -= 1",
"- print((ans + ans2))",
"+ print(ans)"
] | false | 0.045313 | 0.048161 | 0.940868 |
[
"s548948941",
"s121674838"
] |
u366996583
|
p02570
|
python
|
s998275408
|
s383898179
| 30 | 27 | 9,152 | 8,964 |
Accepted
|
Accepted
| 10 |
d,t,s=list(map(int,input().split()))
p=d/s
if t>=p:
print('Yes')
else:
print('No')
|
from sys import stdin
def ip():
return stdin.readline().rstrip()
d,t,s=list(map(int,ip().split()))
if d<=t*s:
print('Yes')
else:
print('No')
| 6 | 8 | 85 | 153 |
d, t, s = list(map(int, input().split()))
p = d / s
if t >= p:
print("Yes")
else:
print("No")
|
from sys import stdin
def ip():
return stdin.readline().rstrip()
d, t, s = list(map(int, ip().split()))
if d <= t * s:
print("Yes")
else:
print("No")
| false | 25 |
[
"-d, t, s = list(map(int, input().split()))",
"-p = d / s",
"-if t >= p:",
"+from sys import stdin",
"+",
"+",
"+def ip():",
"+ return stdin.readline().rstrip()",
"+",
"+",
"+d, t, s = list(map(int, ip().split()))",
"+if d <= t * s:"
] | false | 0.038938 | 0.041227 | 0.944475 |
[
"s998275408",
"s383898179"
] |
u150984829
|
p02397
|
python
|
s376475679
|
s499960668
| 50 | 40 | 5,596 | 5,892 |
Accepted
|
Accepted
| 20 |
while 1:
a=eval(input())
if a=='0 0':break
print((*sorted(map(int,a.split()))))
|
import sys
for s in sys.stdin:
if'0 0\n'==s:break
print((*sorted(map(int,s.split()))))
| 4 | 4 | 77 | 89 |
while 1:
a = eval(input())
if a == "0 0":
break
print((*sorted(map(int, a.split()))))
|
import sys
for s in sys.stdin:
if "0 0\n" == s:
break
print((*sorted(map(int, s.split()))))
| false | 0 |
[
"-while 1:",
"- a = eval(input())",
"- if a == \"0 0\":",
"+import sys",
"+",
"+for s in sys.stdin:",
"+ if \"0 0\\n\" == s:",
"- print((*sorted(map(int, a.split()))))",
"+ print((*sorted(map(int, s.split()))))"
] | false | 0.035564 | 0.033461 | 1.062854 |
[
"s376475679",
"s499960668"
] |
u454557108
|
p03006
|
python
|
s538774997
|
s210493896
| 864 | 69 | 134,084 | 4,248 |
Accepted
|
Accepted
| 92.01 |
import sys
n = int(eval(input()))
x = [0]*n ; y = [0]*n
for i in range(n):
x[i],y[i] = list(map(int, input().split()))
if n == 1:
print((1))
sys.exit()
ans = []
for i in range(n):
for j in range(n):
if i == j:
continue
p = x[i]-x[j]
q = y[i]-y[j]
count = 0
for k in range(n):
for l in range(n):
if p == x[k]-x[l] and q == y[k]-y[l]:
count += 1
ans.append(count)
print((n-max(ans)))
|
from collections import Counter
import sys
n = int(eval(input()))
x = [0]*n ; y = [0]*n
for i in range(n):
x[i],y[i] = list(map(int, input().split()))
if n == 1:
print((1))
sys.exit()
dc_c = []
dc_c = []
dc_ans = []
for i in range(n):
ii = 0
d = [[-1]*2 for i in range(n)]
for j in range(n):
if i != j:
d[ii][0] = x[i]-x[j]
d[ii][1] = y[i]-y[j]
ii += 1
dc = Counter(list(map(tuple, d)))
dc_ans = Counter(dc_ans) + dc
dc_ans = dc_ans.most_common()
if dc_ans[0][0] == (-1, -1):
print((n-dc_ans[1][1]))
else:
print((n-dc_ans[0][1]))
| 26 | 30 | 526 | 622 |
import sys
n = int(eval(input()))
x = [0] * n
y = [0] * n
for i in range(n):
x[i], y[i] = list(map(int, input().split()))
if n == 1:
print((1))
sys.exit()
ans = []
for i in range(n):
for j in range(n):
if i == j:
continue
p = x[i] - x[j]
q = y[i] - y[j]
count = 0
for k in range(n):
for l in range(n):
if p == x[k] - x[l] and q == y[k] - y[l]:
count += 1
ans.append(count)
print((n - max(ans)))
|
from collections import Counter
import sys
n = int(eval(input()))
x = [0] * n
y = [0] * n
for i in range(n):
x[i], y[i] = list(map(int, input().split()))
if n == 1:
print((1))
sys.exit()
dc_c = []
dc_c = []
dc_ans = []
for i in range(n):
ii = 0
d = [[-1] * 2 for i in range(n)]
for j in range(n):
if i != j:
d[ii][0] = x[i] - x[j]
d[ii][1] = y[i] - y[j]
ii += 1
dc = Counter(list(map(tuple, d)))
dc_ans = Counter(dc_ans) + dc
dc_ans = dc_ans.most_common()
if dc_ans[0][0] == (-1, -1):
print((n - dc_ans[1][1]))
else:
print((n - dc_ans[0][1]))
| false | 13.333333 |
[
"+from collections import Counter",
"-ans = []",
"+dc_c = []",
"+dc_c = []",
"+dc_ans = []",
"+ ii = 0",
"+ d = [[-1] * 2 for i in range(n)]",
"- if i == j:",
"- continue",
"- p = x[i] - x[j]",
"- q = y[i] - y[j]",
"- count = 0",
"- for k in range(n):",
"- for l in range(n):",
"- if p == x[k] - x[l] and q == y[k] - y[l]:",
"- count += 1",
"- ans.append(count)",
"-print((n - max(ans)))",
"+ if i != j:",
"+ d[ii][0] = x[i] - x[j]",
"+ d[ii][1] = y[i] - y[j]",
"+ ii += 1",
"+ dc = Counter(list(map(tuple, d)))",
"+ dc_ans = Counter(dc_ans) + dc",
"+dc_ans = dc_ans.most_common()",
"+if dc_ans[0][0] == (-1, -1):",
"+ print((n - dc_ans[1][1]))",
"+else:",
"+ print((n - dc_ans[0][1]))"
] | false | 0.133867 | 0.036903 | 3.62753 |
[
"s538774997",
"s210493896"
] |
u699296734
|
p03624
|
python
|
s453533564
|
s510874591
| 50 | 26 | 9,176 | 9,020 |
Accepted
|
Accepted
| 48 |
s = eval(input())
alphabets = [0] * 26
for i in s:
alphabets[ord(i) - ord("a")] += 1
for i in range(26):
if alphabets[i] == 0:
print((chr(i + ord("a"))))
break
else:
print("None")
|
s = set(eval(input()))
for i in range(26):
if chr(i + ord("a")) not in s:
print((chr(i + ord("a"))))
break
else:
print("None")
| 12 | 8 | 213 | 151 |
s = eval(input())
alphabets = [0] * 26
for i in s:
alphabets[ord(i) - ord("a")] += 1
for i in range(26):
if alphabets[i] == 0:
print((chr(i + ord("a"))))
break
else:
print("None")
|
s = set(eval(input()))
for i in range(26):
if chr(i + ord("a")) not in s:
print((chr(i + ord("a"))))
break
else:
print("None")
| false | 33.333333 |
[
"-s = eval(input())",
"-alphabets = [0] * 26",
"-for i in s:",
"- alphabets[ord(i) - ord(\"a\")] += 1",
"+s = set(eval(input()))",
"- if alphabets[i] == 0:",
"+ if chr(i + ord(\"a\")) not in s:"
] | false | 0.042052 | 0.03921 | 1.072482 |
[
"s453533564",
"s510874591"
] |
u596276291
|
p02847
|
python
|
s753231197
|
s845653358
| 161 | 36 | 4,208 | 9,776 |
Accepted
|
Accepted
| 77.64 |
#!/usr/bin/env python3
from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt
from collections import deque
from bisect import bisect, bisect_left, bisect_right
from string import ascii_lowercase
from functools import lru_cache
import sys
sys.setrecursionlimit(10000)
INF = float("inf")
YES, Yes, yes, NO, No, no = "YES", "Yes", "yes", "NO", "No", "no"
dy4, dx4 = [0, 1, 0, -1], [1, 0, -1, 0]
dy8, dx8 = [0, -1, 0, 1, 1, -1, -1, 1], [1, 0, -1, 0, 1, 1, -1, -1]
def inside(y, x, H, W):
return 0 <= y < H and 0 <= x < W
def ceil(a, b):
return (a + b - 1) // b
def sum_of_arithmetic_progression(s, d, n):
return n * (2 * s + (n - 1) * d) // 2
def gcd(a, b):
if b == 0:
return a
return gcd(b, a % b)
def lcm(a, b):
g = gcd(a, b)
return a / g * b
def solve():
return
def main():
S = eval(input())
d = {"SUN":7 ,"MON": 6,"TUE": 5,"WED": 4,"THU": 3,"FRI": 2,"SAT": 1}
print((d[S]))
if __name__ == '__main__':
main()
|
#!/usr/bin/env python3
from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt
from collections import deque
from bisect import bisect, bisect_left, bisect_right
from string import ascii_lowercase
from functools import lru_cache
import sys
sys.setrecursionlimit(10000)
INF = float("inf")
YES, Yes, yes, NO, No, no = "YES", "Yes", "yes", "NO", "No", "no"
dy4, dx4 = [0, 1, 0, -1], [1, 0, -1, 0]
dy8, dx8 = [0, -1, 0, 1, 1, -1, -1, 1], [1, 0, -1, 0, 1, 1, -1, -1]
def inside(y, x, H, W):
return 0 <= y < H and 0 <= x < W
def ceil(a, b):
return (a + b - 1) // b
def sum_of_arithmetic_progression(s, d, n):
return n * (2 * s + (n - 1) * d) // 2
def gcd(a, b):
if b == 0:
return a
return gcd(b, a % b)
def lcm(a, b):
g = gcd(a, b)
return a / g * b
def solve():
S = eval(input())
i = ["SUN", "MON", "TUE", "WED", "THU", "FRI", "SAT"].index(S)
print((7 - i))
def main():
solve()
if __name__ == '__main__':
main()
| 50 | 51 | 1,111 | 1,109 |
#!/usr/bin/env python3
from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt
from collections import deque
from bisect import bisect, bisect_left, bisect_right
from string import ascii_lowercase
from functools import lru_cache
import sys
sys.setrecursionlimit(10000)
INF = float("inf")
YES, Yes, yes, NO, No, no = "YES", "Yes", "yes", "NO", "No", "no"
dy4, dx4 = [0, 1, 0, -1], [1, 0, -1, 0]
dy8, dx8 = [0, -1, 0, 1, 1, -1, -1, 1], [1, 0, -1, 0, 1, 1, -1, -1]
def inside(y, x, H, W):
return 0 <= y < H and 0 <= x < W
def ceil(a, b):
return (a + b - 1) // b
def sum_of_arithmetic_progression(s, d, n):
return n * (2 * s + (n - 1) * d) // 2
def gcd(a, b):
if b == 0:
return a
return gcd(b, a % b)
def lcm(a, b):
g = gcd(a, b)
return a / g * b
def solve():
return
def main():
S = eval(input())
d = {"SUN": 7, "MON": 6, "TUE": 5, "WED": 4, "THU": 3, "FRI": 2, "SAT": 1}
print((d[S]))
if __name__ == "__main__":
main()
|
#!/usr/bin/env python3
from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt
from collections import deque
from bisect import bisect, bisect_left, bisect_right
from string import ascii_lowercase
from functools import lru_cache
import sys
sys.setrecursionlimit(10000)
INF = float("inf")
YES, Yes, yes, NO, No, no = "YES", "Yes", "yes", "NO", "No", "no"
dy4, dx4 = [0, 1, 0, -1], [1, 0, -1, 0]
dy8, dx8 = [0, -1, 0, 1, 1, -1, -1, 1], [1, 0, -1, 0, 1, 1, -1, -1]
def inside(y, x, H, W):
return 0 <= y < H and 0 <= x < W
def ceil(a, b):
return (a + b - 1) // b
def sum_of_arithmetic_progression(s, d, n):
return n * (2 * s + (n - 1) * d) // 2
def gcd(a, b):
if b == 0:
return a
return gcd(b, a % b)
def lcm(a, b):
g = gcd(a, b)
return a / g * b
def solve():
S = eval(input())
i = ["SUN", "MON", "TUE", "WED", "THU", "FRI", "SAT"].index(S)
print((7 - i))
def main():
solve()
if __name__ == "__main__":
main()
| false | 1.960784 |
[
"- return",
"+ S = eval(input())",
"+ i = [\"SUN\", \"MON\", \"TUE\", \"WED\", \"THU\", \"FRI\", \"SAT\"].index(S)",
"+ print((7 - i))",
"- S = eval(input())",
"- d = {\"SUN\": 7, \"MON\": 6, \"TUE\": 5, \"WED\": 4, \"THU\": 3, \"FRI\": 2, \"SAT\": 1}",
"- print((d[S]))",
"+ solve()"
] | false | 0.048279 | 0.048365 | 0.99822 |
[
"s753231197",
"s845653358"
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.