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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
u170201762 | p02856 | python | s360288841 | s599290185 | 1,626 | 598 | 72,724 | 3,060 | Accepted | Accepted | 63.22 | M = int(eval(input()))
D = []
C = []
for i in range(M):
d,c = list(map(int,input().split()))
D.append(d)
C.append(c)
ans = 0
n = D[0]
C[0] -= 1
for i in range(M):
c = C[i]
d = D[i]
while c != 0:
if c%2==0:
ans += c//2*((2*d)//10+1)
d = (2*d)//10+(2*d)%10
c //= 2
else:
ans += c//2*((2*d)//10+1)
ans += (n+d)//10+1
n = (n+d)//10+(n+d)%10
d = (2*d)//10+(2*d)%10
c //= 2
print(ans) | M = int(eval(input()))
D = 0
S = 0
for i in range(M):
c,d = list(map(int,input().split()))
D += d
S += c*d
print((D-1+(S-1)//9)) | 26 | 8 | 528 | 133 | M = int(eval(input()))
D = []
C = []
for i in range(M):
d, c = list(map(int, input().split()))
D.append(d)
C.append(c)
ans = 0
n = D[0]
C[0] -= 1
for i in range(M):
c = C[i]
d = D[i]
while c != 0:
if c % 2 == 0:
ans += c // 2 * ((2 * d) // 10 + 1)
d = (2 * d) // 10 + (2 * d) % 10
c //= 2
else:
ans += c // 2 * ((2 * d) // 10 + 1)
ans += (n + d) // 10 + 1
n = (n + d) // 10 + (n + d) % 10
d = (2 * d) // 10 + (2 * d) % 10
c //= 2
print(ans)
| M = int(eval(input()))
D = 0
S = 0
for i in range(M):
c, d = list(map(int, input().split()))
D += d
S += c * d
print((D - 1 + (S - 1) // 9))
| false | 69.230769 | [
"-D = []",
"-C = []",
"+D = 0",
"+S = 0",
"- d, c = list(map(int, input().split()))",
"- D.append(d)",
"- C.append(c)",
"-ans = 0",
"-n = D[0]",
"-C[0] -= 1",
"-for i in range(M):",
"- c = C[i]",
"- d = D[i]",
"- while c != 0:",
"- if c % 2 == 0:",
"- ans += c // 2 * ((2 * d) // 10 + 1)",
"- d = (2 * d) // 10 + (2 * d) % 10",
"- c //= 2",
"- else:",
"- ans += c // 2 * ((2 * d) // 10 + 1)",
"- ans += (n + d) // 10 + 1",
"- n = (n + d) // 10 + (n + d) % 10",
"- d = (2 * d) // 10 + (2 * d) % 10",
"- c //= 2",
"-print(ans)",
"+ c, d = list(map(int, input().split()))",
"+ D += d",
"+ S += c * d",
"+print((D - 1 + (S - 1) // 9))"
] | false | 0.109142 | 0.036656 | 2.97745 | [
"s360288841",
"s599290185"
] |
u572373398 | p02720 | python | s248653741 | s815264715 | 292 | 184 | 7,440 | 12,404 | Accepted | Accepted | 36.99 | import sys
sys.setrecursionlimit(3000)
k = int(eval(input()))
ans = []
def solve(x, l):
if int(x) > 3234566667:
return l
l.append(int(x))
if x[-1] == '0':
solve(x + '0', l)
solve(x + '1', l)
elif x[-1] == '9':
solve(x + '9', l)
solve(x + '8', l)
else:
last_digit = int(x[-1])
for i in range(-1, 2):
new_digit = last_digit + i
solve(x + str(new_digit), l)
for i in range(1, 10):
solve(str(i), ans)
ans.sort()
print((ans[k - 1])) | from collections import deque
k = int(eval(input()))
#初めに、1~9まではキューに入れておく
q = deque([i for i in range(1, 10)])
ans = 0
while True:
v = q.popleft()
ans += 1
if ans == k:
print(v)
break
#末尾の1桁を求める
last_digit = v % 10
#求めた末尾の1桁との差が1になる数字を最後の1桁にする
#つまり、末尾の1桁に対して-1,+0,+1とする計算を行う
for i in range(-1, 2):
new_digit = last_digit + i
if new_digit < 0 or new_digit > 9:
continue
q.append(v * 10 + new_digit)
| 27 | 23 | 553 | 505 | import sys
sys.setrecursionlimit(3000)
k = int(eval(input()))
ans = []
def solve(x, l):
if int(x) > 3234566667:
return l
l.append(int(x))
if x[-1] == "0":
solve(x + "0", l)
solve(x + "1", l)
elif x[-1] == "9":
solve(x + "9", l)
solve(x + "8", l)
else:
last_digit = int(x[-1])
for i in range(-1, 2):
new_digit = last_digit + i
solve(x + str(new_digit), l)
for i in range(1, 10):
solve(str(i), ans)
ans.sort()
print((ans[k - 1]))
| from collections import deque
k = int(eval(input()))
# 初めに、1~9まではキューに入れておく
q = deque([i for i in range(1, 10)])
ans = 0
while True:
v = q.popleft()
ans += 1
if ans == k:
print(v)
break
# 末尾の1桁を求める
last_digit = v % 10
# 求めた末尾の1桁との差が1になる数字を最後の1桁にする
# つまり、末尾の1桁に対して-1,+0,+1とする計算を行う
for i in range(-1, 2):
new_digit = last_digit + i
if new_digit < 0 or new_digit > 9:
continue
q.append(v * 10 + new_digit)
| false | 14.814815 | [
"-import sys",
"+from collections import deque",
"-sys.setrecursionlimit(3000)",
"-ans = []",
"-",
"-",
"-def solve(x, l):",
"- if int(x) > 3234566667:",
"- return l",
"- l.append(int(x))",
"- if x[-1] == \"0\":",
"- solve(x + \"0\", l)",
"- solve(x + \"1\", l)",
"- elif x[-1] == \"9\":",
"- solve(x + \"9\", l)",
"- solve(x + \"8\", l)",
"- else:",
"- last_digit = int(x[-1])",
"- for i in range(-1, 2):",
"- new_digit = last_digit + i",
"- solve(x + str(new_digit), l)",
"-",
"-",
"-for i in range(1, 10):",
"- solve(str(i), ans)",
"-ans.sort()",
"-print((ans[k - 1]))",
"+# 初めに、1~9まではキューに入れておく",
"+q = deque([i for i in range(1, 10)])",
"+ans = 0",
"+while True:",
"+ v = q.popleft()",
"+ ans += 1",
"+ if ans == k:",
"+ print(v)",
"+ break",
"+ # 末尾の1桁を求める",
"+ last_digit = v % 10",
"+ # 求めた末尾の1桁との差が1になる数字を最後の1桁にする",
"+ # つまり、末尾の1桁に対して-1,+0,+1とする計算を行う",
"+ for i in range(-1, 2):",
"+ new_digit = last_digit + i",
"+ if new_digit < 0 or new_digit > 9:",
"+ continue",
"+ q.append(v * 10 + new_digit)"
] | false | 0.439135 | 0.197986 | 2.218014 | [
"s248653741",
"s815264715"
] |
u340781749 | p02589 | python | s381660676 | s754573661 | 2,066 | 1,834 | 310,404 | 302,668 | Accepted | Accepted | 11.23 | from collections import Counter
from string import ascii_lowercase
n = int(eval(input()))
sss = [eval(input()) for _ in range(n)]
flags = {c: 1 << (ord(c) - 97) for c in ascii_lowercase}
trie_chr = [-1]
trie_children = [{}]
trie_counter = [0]
trie_fin = [0]
l = 1
for s in sss:
node = 0
trie_counter[node] += 1
for i in range(len(s) - 1, 0, -1):
c = ord(s[i]) - 97
if c in trie_children[node]:
node = trie_children[node][c]
trie_counter[node] += 1
else:
trie_chr.append(c)
trie_children.append({})
trie_fin.append(0)
trie_children[node][c] = l
trie_counter.append(1)
node = l
l += 1
trie_fin[node] |= flags[s[0]]
ans = 0
for s in sss:
cnt = Counter(s)
flag = 0
for c in cnt:
flag |= flags[c]
node = 0
if len(s) > 1 and trie_fin[node] > 0:
ans += bin(trie_fin[node] & flag).count('1')
for i in range(len(s) - 1, 1, -1):
c = s[i]
cnt[c] -= 1
if cnt[c] == 0:
flag ^= flags[c]
k = ord(c) - 97
node = trie_children[node][k]
if trie_counter[node] == 1:
break
if trie_fin[node] > 0:
ans += bin(trie_fin[node] & flag).count('1')
print(ans)
| from collections import Counter
from string import ascii_lowercase
n = int(eval(input()))
sss = [eval(input()) for _ in range(n)]
flags = {c: 1 << (ord(c) - 97) for c in ascii_lowercase}
trie_chr = [-1]
trie_children = [{}]
trie_fin = [0]
l = 1
for s in sss:
node = 0
for i in range(len(s) - 1, 0, -1):
c = ord(s[i]) - 97
if c in trie_children[node]:
node = trie_children[node][c]
else:
trie_chr.append(c)
trie_children.append({})
trie_fin.append(0)
trie_children[node][c] = l
node = l
l += 1
trie_fin[node] |= flags[s[0]]
ans = 0
for s in sss:
cnt = Counter(s)
flag = 0
for c in cnt:
flag |= flags[c]
node = 0
if len(s) > 1 and trie_fin[node] > 0:
ans += bin(trie_fin[node] & flag).count('1')
for i in range(len(s) - 1, 1, -1):
c = s[i]
cnt[c] -= 1
if cnt[c] == 0:
flag ^= flags[c]
k = ord(c) - 97
node = trie_children[node][k]
if trie_fin[node] > 0:
ans += bin(trie_fin[node] & flag).count('1')
print(ans)
| 55 | 49 | 1,361 | 1,183 | from collections import Counter
from string import ascii_lowercase
n = int(eval(input()))
sss = [eval(input()) for _ in range(n)]
flags = {c: 1 << (ord(c) - 97) for c in ascii_lowercase}
trie_chr = [-1]
trie_children = [{}]
trie_counter = [0]
trie_fin = [0]
l = 1
for s in sss:
node = 0
trie_counter[node] += 1
for i in range(len(s) - 1, 0, -1):
c = ord(s[i]) - 97
if c in trie_children[node]:
node = trie_children[node][c]
trie_counter[node] += 1
else:
trie_chr.append(c)
trie_children.append({})
trie_fin.append(0)
trie_children[node][c] = l
trie_counter.append(1)
node = l
l += 1
trie_fin[node] |= flags[s[0]]
ans = 0
for s in sss:
cnt = Counter(s)
flag = 0
for c in cnt:
flag |= flags[c]
node = 0
if len(s) > 1 and trie_fin[node] > 0:
ans += bin(trie_fin[node] & flag).count("1")
for i in range(len(s) - 1, 1, -1):
c = s[i]
cnt[c] -= 1
if cnt[c] == 0:
flag ^= flags[c]
k = ord(c) - 97
node = trie_children[node][k]
if trie_counter[node] == 1:
break
if trie_fin[node] > 0:
ans += bin(trie_fin[node] & flag).count("1")
print(ans)
| from collections import Counter
from string import ascii_lowercase
n = int(eval(input()))
sss = [eval(input()) for _ in range(n)]
flags = {c: 1 << (ord(c) - 97) for c in ascii_lowercase}
trie_chr = [-1]
trie_children = [{}]
trie_fin = [0]
l = 1
for s in sss:
node = 0
for i in range(len(s) - 1, 0, -1):
c = ord(s[i]) - 97
if c in trie_children[node]:
node = trie_children[node][c]
else:
trie_chr.append(c)
trie_children.append({})
trie_fin.append(0)
trie_children[node][c] = l
node = l
l += 1
trie_fin[node] |= flags[s[0]]
ans = 0
for s in sss:
cnt = Counter(s)
flag = 0
for c in cnt:
flag |= flags[c]
node = 0
if len(s) > 1 and trie_fin[node] > 0:
ans += bin(trie_fin[node] & flag).count("1")
for i in range(len(s) - 1, 1, -1):
c = s[i]
cnt[c] -= 1
if cnt[c] == 0:
flag ^= flags[c]
k = ord(c) - 97
node = trie_children[node][k]
if trie_fin[node] > 0:
ans += bin(trie_fin[node] & flag).count("1")
print(ans)
| false | 10.909091 | [
"-trie_counter = [0]",
"- trie_counter[node] += 1",
"- trie_counter[node] += 1",
"- trie_counter.append(1)",
"- if trie_counter[node] == 1:",
"- break"
] | false | 0.052362 | 0.090354 | 0.579524 | [
"s381660676",
"s754573661"
] |
u368780724 | p03782 | python | s003845024 | s786420237 | 426 | 346 | 80,988 | 77,660 | Accepted | Accepted | 18.78 | from collections import defaultdict
import bisect
import sys
def inpl(): return [int(i) for i in input().split()]
def search(a,j):
if D[j]:
if D[j] == 1:
return True
else:
return False
H = defaultdict(lambda: 0)
H[0] = True
for i in a:
for ni in list(H.copy().keys()):
if ni + i < K-j:
H[ni+i] = True
continue
elif ni + i <= K-1:
D[j] = 1
return True
D[j] = -1
return False
N, K = inpl()
A = inpl()
A.sort()
A = A[:bisect.bisect_left(A,K)]
M = len(A)
D = defaultdict(lambda: 0)
if sum(A) < K:
print(M)
sys.exit()
if sum(A) == K:
print((0))
sys.exit()
lo = -1
hi = M
while hi - lo > 1:
me = (hi+lo)//2
B = A[:me] + A[me+1:]
if search(B, A[me]):
hi = me
else:
lo = me
print(hi) | from operator import or_
from functools import reduce
import sys
readline = sys.stdin.readline
def check(a, l, r):
if (reduce(or_, [r*(1<<k) for k in range(K) if l & (1<<k)])&filt).bit_length() + a > K:
return True
else:
return False
N, K = list(map(int, readline().split()))
A = list(map(int, readline().split()))
A = [a for a in A if a < K]
A.sort()
filt = (1<<K) - 1
M = len(A)
A = [None]+A
dpl = [0]*(M+2)
dpr = [0]*(M+2)
dpl[0] = 1
dpr[M+1] = 1
for i in range(1, M+1):
dpl[i] = dpl[i-1]*(1<<A[i])&filt |dpl[i-1]
for i in range(M, 0, -1):
dpr[i] = dpr[i+1]*(1<<A[i])&filt |dpr[i+1]
ok = M+1
ng = 0
while abs(ok - ng) > 1:
med = (ok+ng)//2
if check(A[med], dpl[med-1], dpr[med+1]):
ok = med
else:
ng = med
print(ng)
| 45 | 38 | 920 | 819 | from collections import defaultdict
import bisect
import sys
def inpl():
return [int(i) for i in input().split()]
def search(a, j):
if D[j]:
if D[j] == 1:
return True
else:
return False
H = defaultdict(lambda: 0)
H[0] = True
for i in a:
for ni in list(H.copy().keys()):
if ni + i < K - j:
H[ni + i] = True
continue
elif ni + i <= K - 1:
D[j] = 1
return True
D[j] = -1
return False
N, K = inpl()
A = inpl()
A.sort()
A = A[: bisect.bisect_left(A, K)]
M = len(A)
D = defaultdict(lambda: 0)
if sum(A) < K:
print(M)
sys.exit()
if sum(A) == K:
print((0))
sys.exit()
lo = -1
hi = M
while hi - lo > 1:
me = (hi + lo) // 2
B = A[:me] + A[me + 1 :]
if search(B, A[me]):
hi = me
else:
lo = me
print(hi)
| from operator import or_
from functools import reduce
import sys
readline = sys.stdin.readline
def check(a, l, r):
if (
reduce(or_, [r * (1 << k) for k in range(K) if l & (1 << k)]) & filt
).bit_length() + a > K:
return True
else:
return False
N, K = list(map(int, readline().split()))
A = list(map(int, readline().split()))
A = [a for a in A if a < K]
A.sort()
filt = (1 << K) - 1
M = len(A)
A = [None] + A
dpl = [0] * (M + 2)
dpr = [0] * (M + 2)
dpl[0] = 1
dpr[M + 1] = 1
for i in range(1, M + 1):
dpl[i] = dpl[i - 1] * (1 << A[i]) & filt | dpl[i - 1]
for i in range(M, 0, -1):
dpr[i] = dpr[i + 1] * (1 << A[i]) & filt | dpr[i + 1]
ok = M + 1
ng = 0
while abs(ok - ng) > 1:
med = (ok + ng) // 2
if check(A[med], dpl[med - 1], dpr[med + 1]):
ok = med
else:
ng = med
print(ng)
| false | 15.555556 | [
"-from collections import defaultdict",
"-import bisect",
"+from operator import or_",
"+from functools import reduce",
"-",
"-def inpl():",
"- return [int(i) for i in input().split()]",
"+readline = sys.stdin.readline",
"-def search(a, j):",
"- if D[j]:",
"- if D[j] == 1:",
"- return True",
"- else:",
"- return False",
"- H = defaultdict(lambda: 0)",
"- H[0] = True",
"- for i in a:",
"- for ni in list(H.copy().keys()):",
"- if ni + i < K - j:",
"- H[ni + i] = True",
"- continue",
"- elif ni + i <= K - 1:",
"- D[j] = 1",
"- return True",
"- D[j] = -1",
"- return False",
"+def check(a, l, r):",
"+ if (",
"+ reduce(or_, [r * (1 << k) for k in range(K) if l & (1 << k)]) & filt",
"+ ).bit_length() + a > K:",
"+ return True",
"+ else:",
"+ return False",
"-N, K = inpl()",
"-A = inpl()",
"+N, K = list(map(int, readline().split()))",
"+A = list(map(int, readline().split()))",
"+A = [a for a in A if a < K]",
"-A = A[: bisect.bisect_left(A, K)]",
"+filt = (1 << K) - 1",
"-D = defaultdict(lambda: 0)",
"-if sum(A) < K:",
"- print(M)",
"- sys.exit()",
"-if sum(A) == K:",
"- print((0))",
"- sys.exit()",
"-lo = -1",
"-hi = M",
"-while hi - lo > 1:",
"- me = (hi + lo) // 2",
"- B = A[:me] + A[me + 1 :]",
"- if search(B, A[me]):",
"- hi = me",
"+A = [None] + A",
"+dpl = [0] * (M + 2)",
"+dpr = [0] * (M + 2)",
"+dpl[0] = 1",
"+dpr[M + 1] = 1",
"+for i in range(1, M + 1):",
"+ dpl[i] = dpl[i - 1] * (1 << A[i]) & filt | dpl[i - 1]",
"+for i in range(M, 0, -1):",
"+ dpr[i] = dpr[i + 1] * (1 << A[i]) & filt | dpr[i + 1]",
"+ok = M + 1",
"+ng = 0",
"+while abs(ok - ng) > 1:",
"+ med = (ok + ng) // 2",
"+ if check(A[med], dpl[med - 1], dpr[med + 1]):",
"+ ok = med",
"- lo = me",
"-print(hi)",
"+ ng = med",
"+print(ng)"
] | false | 0.070786 | 0.039877 | 1.775101 | [
"s003845024",
"s786420237"
] |
u970197315 | p02861 | python | s235386253 | s004081133 | 512 | 424 | 9,460 | 9,204 | Accepted | Accepted | 17.19 | # ABC145 A
import itertools
si = lambda: eval(input())
ni = lambda: int(eval(input()))
nm = lambda: list(map(int, input().split()))
nl = lambda: list(map(int, input().split()))
n = ni()
L = [[] for i in range(n)]
D = []
for i in range(n):
x,y = nm()
L[i].append(x)
L[i].append(y)
L = list(itertools.permutations(L))
for l in L:
d = 0.0
for i in range(len(l)-1):
d += float(((l[i][0]-l[i+1][0])**2 + (l[i][1]-l[i+1][1])**2)**0.5)
D.append(d)
ans = float(sum(D)/len(D))
print(ans) | from itertools import permutations
n=int(eval(input()))
l=[]
for i in range(n):
x,y=list(map(int,input().split()))
l.append((x,y))
dist=[]
for ll in list(permutations(l)):
d=0.0
for i in range(len(ll)-1):
d+=((ll[i][0]-ll[i+1][0])**2+(ll[i][1]-ll[i+1][1])**2)**0.5
dist.append(d)
print((sum(dist)/len(dist)))
| 24 | 14 | 518 | 344 | # ABC145 A
import itertools
si = lambda: eval(input())
ni = lambda: int(eval(input()))
nm = lambda: list(map(int, input().split()))
nl = lambda: list(map(int, input().split()))
n = ni()
L = [[] for i in range(n)]
D = []
for i in range(n):
x, y = nm()
L[i].append(x)
L[i].append(y)
L = list(itertools.permutations(L))
for l in L:
d = 0.0
for i in range(len(l) - 1):
d += float(((l[i][0] - l[i + 1][0]) ** 2 + (l[i][1] - l[i + 1][1]) ** 2) ** 0.5)
D.append(d)
ans = float(sum(D) / len(D))
print(ans)
| from itertools import permutations
n = int(eval(input()))
l = []
for i in range(n):
x, y = list(map(int, input().split()))
l.append((x, y))
dist = []
for ll in list(permutations(l)):
d = 0.0
for i in range(len(ll) - 1):
d += ((ll[i][0] - ll[i + 1][0]) ** 2 + (ll[i][1] - ll[i + 1][1]) ** 2) ** 0.5
dist.append(d)
print((sum(dist) / len(dist)))
| false | 41.666667 | [
"-# ABC145 A",
"-import itertools",
"+from itertools import permutations",
"-si = lambda: eval(input())",
"-ni = lambda: int(eval(input()))",
"-nm = lambda: list(map(int, input().split()))",
"-nl = lambda: list(map(int, input().split()))",
"-n = ni()",
"-L = [[] for i in range(n)]",
"-D = []",
"+n = int(eval(input()))",
"+l = []",
"- x, y = nm()",
"- L[i].append(x)",
"- L[i].append(y)",
"-L = list(itertools.permutations(L))",
"-for l in L:",
"+ x, y = list(map(int, input().split()))",
"+ l.append((x, y))",
"+dist = []",
"+for ll in list(permutations(l)):",
"- for i in range(len(l) - 1):",
"- d += float(((l[i][0] - l[i + 1][0]) ** 2 + (l[i][1] - l[i + 1][1]) ** 2) ** 0.5)",
"- D.append(d)",
"-ans = float(sum(D) / len(D))",
"-print(ans)",
"+ for i in range(len(ll) - 1):",
"+ d += ((ll[i][0] - ll[i + 1][0]) ** 2 + (ll[i][1] - ll[i + 1][1]) ** 2) ** 0.5",
"+ dist.append(d)",
"+print((sum(dist) / len(dist)))"
] | false | 0.116441 | 0.154366 | 0.754322 | [
"s235386253",
"s004081133"
] |
u768559443 | p04030 | python | s879190293 | s548345040 | 166 | 19 | 38,256 | 2,940 | Accepted | Accepted | 88.55 | t=""
for x in eval(input()):
if x=="B":
t=t[:-1]
else:
t+=x
print(t) | t=[]
for i in eval(input()):
if i=="B":
try:t.pop()
except:pass
else:
t.append(i)
print(("".join(t))) | 7 | 8 | 80 | 116 | t = ""
for x in eval(input()):
if x == "B":
t = t[:-1]
else:
t += x
print(t)
| t = []
for i in eval(input()):
if i == "B":
try:
t.pop()
except:
pass
else:
t.append(i)
print(("".join(t)))
| false | 12.5 | [
"-t = \"\"",
"-for x in eval(input()):",
"- if x == \"B\":",
"- t = t[:-1]",
"+t = []",
"+for i in eval(input()):",
"+ if i == \"B\":",
"+ try:",
"+ t.pop()",
"+ except:",
"+ pass",
"- t += x",
"-print(t)",
"+ t.append(i)",
"+print((\"\".join(t)))"
] | false | 0.037476 | 0.035333 | 1.060661 | [
"s879190293",
"s548345040"
] |
u235376569 | p02755 | python | s952353503 | s950452639 | 30 | 18 | 3,064 | 2,940 | Accepted | Accepted | 40 | A,B=[int(x) for x in input().rstrip().split()]
count=0
for i in range(1,20000):
ans1=int(0.08*i)
ans2=int(0.1*i)
if ans1==A and ans2==B:
print(i)
count=1
break
if count==0:
print((-1)) | A,B=[int(x) for x in input().rstrip().split()]
flag=0
for i in range(1,1001):
if int(i*0.08)==A and int(i*0.1)==B:
print(i)
flag=1
break
if flag==0:
print((-1))
| 11 | 10 | 232 | 185 | A, B = [int(x) for x in input().rstrip().split()]
count = 0
for i in range(1, 20000):
ans1 = int(0.08 * i)
ans2 = int(0.1 * i)
if ans1 == A and ans2 == B:
print(i)
count = 1
break
if count == 0:
print((-1))
| A, B = [int(x) for x in input().rstrip().split()]
flag = 0
for i in range(1, 1001):
if int(i * 0.08) == A and int(i * 0.1) == B:
print(i)
flag = 1
break
if flag == 0:
print((-1))
| false | 9.090909 | [
"-count = 0",
"-for i in range(1, 20000):",
"- ans1 = int(0.08 * i)",
"- ans2 = int(0.1 * i)",
"- if ans1 == A and ans2 == B:",
"+flag = 0",
"+for i in range(1, 1001):",
"+ if int(i * 0.08) == A and int(i * 0.1) == B:",
"- count = 1",
"+ flag = 1",
"-if count == 0:",
"+if flag == 0:"
] | false | 0.088043 | 0.037063 | 2.375511 | [
"s952353503",
"s950452639"
] |
u525065967 | p02615 | python | s634114440 | s871449532 | 168 | 140 | 31,724 | 31,344 | Accepted | Accepted | 16.67 | from heapq import *
n = int(eval(input()))
A = [*[-int(x) for x in input().split()]]
heapify(A)
ans = -heappop(A)
for c in range(0, n-2, 2): ans += -heappop(A) * (1<<(c+1 < n-2))
print(ans)
| n = int(eval(input()))
A = sorted([*list(map(int, input().split()))], reverse=True)
ans = -A[0]
for i in range(n): ans += A[i//2]
print(ans)
| 7 | 5 | 195 | 133 | from heapq import *
n = int(eval(input()))
A = [*[-int(x) for x in input().split()]]
heapify(A)
ans = -heappop(A)
for c in range(0, n - 2, 2):
ans += -heappop(A) * (1 << (c + 1 < n - 2))
print(ans)
| n = int(eval(input()))
A = sorted([*list(map(int, input().split()))], reverse=True)
ans = -A[0]
for i in range(n):
ans += A[i // 2]
print(ans)
| false | 28.571429 | [
"-from heapq import *",
"-",
"-A = [*[-int(x) for x in input().split()]]",
"-heapify(A)",
"-ans = -heappop(A)",
"-for c in range(0, n - 2, 2):",
"- ans += -heappop(A) * (1 << (c + 1 < n - 2))",
"+A = sorted([*list(map(int, input().split()))], reverse=True)",
"+ans = -A[0]",
"+for i in range(n):",
"+ ans += A[i // 2]"
] | false | 0.045293 | 0.035701 | 1.268678 | [
"s634114440",
"s871449532"
] |
u021019433 | p02688 | python | s777853328 | s340728861 | 24 | 19 | 9,216 | 9,160 | Accepted | Accepted | 20.83 | from itertools import chain
a = list(open(0))
n = int(a[0].split()[0])
print((n - len(set(chain.from_iterable(list(map(str.split, a[2::2])))))))
| R = lambda: list(map(int, input().split()))
n, k = R()
s = set()
for _ in range(k):
R()
s.update(R())
print((n - len(s)))
| 5 | 7 | 142 | 124 | from itertools import chain
a = list(open(0))
n = int(a[0].split()[0])
print((n - len(set(chain.from_iterable(list(map(str.split, a[2::2])))))))
| R = lambda: list(map(int, input().split()))
n, k = R()
s = set()
for _ in range(k):
R()
s.update(R())
print((n - len(s)))
| false | 28.571429 | [
"-from itertools import chain",
"-",
"-a = list(open(0))",
"-n = int(a[0].split()[0])",
"-print((n - len(set(chain.from_iterable(list(map(str.split, a[2::2])))))))",
"+R = lambda: list(map(int, input().split()))",
"+n, k = R()",
"+s = set()",
"+for _ in range(k):",
"+ R()",
"+ s.update(R())",
"+print((n - len(s)))"
] | false | 0.15004 | 0.039843 | 3.765778 | [
"s777853328",
"s340728861"
] |
u588341295 | p03212 | python | s467061009 | s812987084 | 64 | 21 | 3,060 | 3,316 | Accepted | Accepted | 67.19 | # -*- coding: utf-8 -*-
"""
解説参考
再帰関数で候補の数を作っていく版
"""
N = int(eval(input()))
def dfs(s):
# N以下しかやらない
if int(s) > N:
return 0
# 753数かどうか
if '7' in s and '5' in s and '3' in s:
res = 1
else:
res = 0
# sの後ろに753を付けたもので再帰していく
for c in '753':
res += dfs(s + c)
# 最終的に自分より大きい桁で増えた分を返却していく
return res
print((dfs('0')))
| # -*- coding: utf-8 -*-
import sys
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]
def ceil(x, y=1): return int(-(-x // y))
def INT(): return int(eval(input()))
def MAP(): return list(map(int, input().split()))
def LIST(N=None): return list(MAP()) if N is None else [INT() for i in range(N)]
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
sys.setrecursionlimit(10 ** 9)
INF = 10 ** 18
MOD = 10 ** 9 + 7
S = eval(input())
N = len(S)
# dp[i][bit][j] := i桁目まで見て、出現済の3,5,7の集合がbitで、Nより小さいのが確定しているorしていない(j=0,1)状態の場合の数
dp = list3d(N+1, 1<<3, 2, 0)
dp[0][0][0] = 1
for i in range(N):
a = int(S[i])
for bit in range(1<<3):
# 0への遷移
if bit == 0:
dp[i+1][bit][1] += dp[i][bit][0]
dp[i+1][bit][1] += dp[i][bit][1]
# 3,5,7への遷移
for k, x in enumerate([3, 5, 7]):
dp[i+1][bit|1<<k][1] += dp[i][bit][1]
if a == x:
dp[i+1][bit|1<<k][0] += dp[i][bit][0]
elif a > x:
dp[i+1][bit|1<<k][1] += dp[i][bit][0]
# N桁見終わって、3,5,7出現済(bit=111)の合計
print((dp[N][-1][0] + dp[N][-1][1]))
| 25 | 42 | 399 | 1,393 | # -*- coding: utf-8 -*-
"""
解説参考
再帰関数で候補の数を作っていく版
"""
N = int(eval(input()))
def dfs(s):
# N以下しかやらない
if int(s) > N:
return 0
# 753数かどうか
if "7" in s and "5" in s and "3" in s:
res = 1
else:
res = 0
# sの後ろに753を付けたもので再帰していく
for c in "753":
res += dfs(s + c)
# 最終的に自分より大きい桁で増えた分を返却していく
return res
print((dfs("0")))
| # -*- coding: utf-8 -*-
import sys
def input():
return sys.stdin.readline().strip()
def list2d(a, b, c):
return [[c] * b for i in range(a)]
def list3d(a, b, c, d):
return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e):
return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]
def ceil(x, y=1):
return int(-(-x // y))
def INT():
return int(eval(input()))
def MAP():
return list(map(int, input().split()))
def LIST(N=None):
return list(MAP()) if N is None else [INT() for i in range(N)]
def Yes():
print("Yes")
def No():
print("No")
def YES():
print("YES")
def NO():
print("NO")
sys.setrecursionlimit(10**9)
INF = 10**18
MOD = 10**9 + 7
S = eval(input())
N = len(S)
# dp[i][bit][j] := i桁目まで見て、出現済の3,5,7の集合がbitで、Nより小さいのが確定しているorしていない(j=0,1)状態の場合の数
dp = list3d(N + 1, 1 << 3, 2, 0)
dp[0][0][0] = 1
for i in range(N):
a = int(S[i])
for bit in range(1 << 3):
# 0への遷移
if bit == 0:
dp[i + 1][bit][1] += dp[i][bit][0]
dp[i + 1][bit][1] += dp[i][bit][1]
# 3,5,7への遷移
for k, x in enumerate([3, 5, 7]):
dp[i + 1][bit | 1 << k][1] += dp[i][bit][1]
if a == x:
dp[i + 1][bit | 1 << k][0] += dp[i][bit][0]
elif a > x:
dp[i + 1][bit | 1 << k][1] += dp[i][bit][0]
# N桁見終わって、3,5,7出現済(bit=111)の合計
print((dp[N][-1][0] + dp[N][-1][1]))
| false | 40.47619 | [
"-\"\"\"",
"-解説参考",
"-再帰関数で候補の数を作っていく版",
"-\"\"\"",
"-N = int(eval(input()))",
"+import sys",
"-def dfs(s):",
"- # N以下しかやらない",
"- if int(s) > N:",
"- return 0",
"- # 753数かどうか",
"- if \"7\" in s and \"5\" in s and \"3\" in s:",
"- res = 1",
"- else:",
"- res = 0",
"- # sの後ろに753を付けたもので再帰していく",
"- for c in \"753\":",
"- res += dfs(s + c)",
"- # 最終的に自分より大きい桁で増えた分を返却していく",
"- return res",
"+def input():",
"+ return sys.stdin.readline().strip()",
"-print((dfs(\"0\")))",
"+def list2d(a, b, c):",
"+ return [[c] * b for i in range(a)]",
"+",
"+",
"+def list3d(a, b, c, d):",
"+ return [[[d] * c for j in range(b)] for i in range(a)]",
"+",
"+",
"+def list4d(a, b, c, d, e):",
"+ return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]",
"+",
"+",
"+def ceil(x, y=1):",
"+ return int(-(-x // y))",
"+",
"+",
"+def INT():",
"+ return int(eval(input()))",
"+",
"+",
"+def MAP():",
"+ return list(map(int, input().split()))",
"+",
"+",
"+def LIST(N=None):",
"+ return list(MAP()) if N is None else [INT() for i in range(N)]",
"+",
"+",
"+def Yes():",
"+ print(\"Yes\")",
"+",
"+",
"+def No():",
"+ print(\"No\")",
"+",
"+",
"+def YES():",
"+ print(\"YES\")",
"+",
"+",
"+def NO():",
"+ print(\"NO\")",
"+",
"+",
"+sys.setrecursionlimit(10**9)",
"+INF = 10**18",
"+MOD = 10**9 + 7",
"+S = eval(input())",
"+N = len(S)",
"+# dp[i][bit][j] := i桁目まで見て、出現済の3,5,7の集合がbitで、Nより小さいのが確定しているorしていない(j=0,1)状態の場合の数",
"+dp = list3d(N + 1, 1 << 3, 2, 0)",
"+dp[0][0][0] = 1",
"+for i in range(N):",
"+ a = int(S[i])",
"+ for bit in range(1 << 3):",
"+ # 0への遷移",
"+ if bit == 0:",
"+ dp[i + 1][bit][1] += dp[i][bit][0]",
"+ dp[i + 1][bit][1] += dp[i][bit][1]",
"+ # 3,5,7への遷移",
"+ for k, x in enumerate([3, 5, 7]):",
"+ dp[i + 1][bit | 1 << k][1] += dp[i][bit][1]",
"+ if a == x:",
"+ dp[i + 1][bit | 1 << k][0] += dp[i][bit][0]",
"+ elif a > x:",
"+ dp[i + 1][bit | 1 << k][1] += dp[i][bit][0]",
"+# N桁見終わって、3,5,7出現済(bit=111)の合計",
"+print((dp[N][-1][0] + dp[N][-1][1]))"
] | false | 0.101559 | 0.044739 | 2.270049 | [
"s467061009",
"s812987084"
] |
u144913062 | p03855 | python | s828102942 | s973099924 | 948 | 812 | 119,384 | 105,552 | Accepted | Accepted | 14.35 | from collections import defaultdict
import sys
input = sys.stdin.readline
class UnionFind:
def __init__(self, N):
self.parent = list(range(N))
self.rank = [0] * N
self.size = [1] * N
def find(self, x):
if self.parent[x] != x:
self.parent[x] = self.find(self.parent[x])
return self.parent[x]
def unite(self, x, y):
x = self.find(x)
y = self.find(y)
if x == y:
return
if self.rank[x] < self.rank[y]:
self.parent[x] = y
self.size[y] += self.size[x]
else:
self.parent[y] = x
self.size[x] += self.size[y]
if self.rank[x] == self.rank[y]:
self.rank[x] += 1
def same(self, x, y):
return self.find(x) == self.find(y)
def get_size(self, x):
return self.size[self.find(x)]
N, K, L = list(map(int, input().split()))
uf1 = UnionFind(N+1)
for _ in range(K):
p, q = list(map(int, input().split()))
uf1.unite(p, q)
uf2 = UnionFind(N+1)
for _ in range(L):
r, s = list(map(int, input().split()))
uf2.unite(r, s)
cnt = defaultdict(int)
for i in range(1, N+1):
cnt[(uf1.find(i), uf2.find(i))] += 1
ans = [cnt[(uf1.find(i), uf2.find(i))] for i in range(1, N+1)]
print((*ans)) | from collections import defaultdict
import sys
input = sys.stdin.readline
class UnionFind:
def __init__(self, N):
self.parent = list(range(N))
self.rank = [0] * N
self.size = [1] * N
def find(self, x):
r = x
while self.parent[r] != r:
r = self.parent[r]
while self.parent[x] != r:
x, self.parent[x] = self.parent[x], r
return r
def unite(self, x, y):
x = self.find(x)
y = self.find(y)
if x == y:
return
if self.rank[x] < self.rank[y]:
self.parent[x] = y
self.size[y] += self.size[x]
else:
self.parent[y] = x
self.size[x] += self.size[y]
if self.rank[x] == self.rank[y]:
self.rank[x] += 1
def same(self, x, y):
return self.find(x) == self.find(y)
def get_size(self, x):
return self.size[self.find(x)]
N, K, L = list(map(int, input().split()))
uf1 = UnionFind(N+1)
for _ in range(K):
p, q = list(map(int, input().split()))
uf1.unite(p, q)
uf2 = UnionFind(N+1)
for _ in range(L):
r, s = list(map(int, input().split()))
uf2.unite(r, s)
cnt = defaultdict(int)
for i in range(1, N+1):
cnt[(uf1.find(i), uf2.find(i))] += 1
ans = [cnt[(uf1.find(i), uf2.find(i))] for i in range(1, N+1)]
print((*ans)) | 49 | 52 | 1,325 | 1,393 | from collections import defaultdict
import sys
input = sys.stdin.readline
class UnionFind:
def __init__(self, N):
self.parent = list(range(N))
self.rank = [0] * N
self.size = [1] * N
def find(self, x):
if self.parent[x] != x:
self.parent[x] = self.find(self.parent[x])
return self.parent[x]
def unite(self, x, y):
x = self.find(x)
y = self.find(y)
if x == y:
return
if self.rank[x] < self.rank[y]:
self.parent[x] = y
self.size[y] += self.size[x]
else:
self.parent[y] = x
self.size[x] += self.size[y]
if self.rank[x] == self.rank[y]:
self.rank[x] += 1
def same(self, x, y):
return self.find(x) == self.find(y)
def get_size(self, x):
return self.size[self.find(x)]
N, K, L = list(map(int, input().split()))
uf1 = UnionFind(N + 1)
for _ in range(K):
p, q = list(map(int, input().split()))
uf1.unite(p, q)
uf2 = UnionFind(N + 1)
for _ in range(L):
r, s = list(map(int, input().split()))
uf2.unite(r, s)
cnt = defaultdict(int)
for i in range(1, N + 1):
cnt[(uf1.find(i), uf2.find(i))] += 1
ans = [cnt[(uf1.find(i), uf2.find(i))] for i in range(1, N + 1)]
print((*ans))
| from collections import defaultdict
import sys
input = sys.stdin.readline
class UnionFind:
def __init__(self, N):
self.parent = list(range(N))
self.rank = [0] * N
self.size = [1] * N
def find(self, x):
r = x
while self.parent[r] != r:
r = self.parent[r]
while self.parent[x] != r:
x, self.parent[x] = self.parent[x], r
return r
def unite(self, x, y):
x = self.find(x)
y = self.find(y)
if x == y:
return
if self.rank[x] < self.rank[y]:
self.parent[x] = y
self.size[y] += self.size[x]
else:
self.parent[y] = x
self.size[x] += self.size[y]
if self.rank[x] == self.rank[y]:
self.rank[x] += 1
def same(self, x, y):
return self.find(x) == self.find(y)
def get_size(self, x):
return self.size[self.find(x)]
N, K, L = list(map(int, input().split()))
uf1 = UnionFind(N + 1)
for _ in range(K):
p, q = list(map(int, input().split()))
uf1.unite(p, q)
uf2 = UnionFind(N + 1)
for _ in range(L):
r, s = list(map(int, input().split()))
uf2.unite(r, s)
cnt = defaultdict(int)
for i in range(1, N + 1):
cnt[(uf1.find(i), uf2.find(i))] += 1
ans = [cnt[(uf1.find(i), uf2.find(i))] for i in range(1, N + 1)]
print((*ans))
| false | 5.769231 | [
"- if self.parent[x] != x:",
"- self.parent[x] = self.find(self.parent[x])",
"- return self.parent[x]",
"+ r = x",
"+ while self.parent[r] != r:",
"+ r = self.parent[r]",
"+ while self.parent[x] != r:",
"+ x, self.parent[x] = self.parent[x], r",
"+ return r"
] | false | 0.037457 | 0.04309 | 0.86928 | [
"s828102942",
"s973099924"
] |
u588341295 | p02580 | python | s731036039 | s281617237 | 1,290 | 330 | 137,152 | 167,408 | Accepted | Accepted | 74.42 | import sys
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]
def ceil(x, y=1): return int(-(-x // y))
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(N=None): return list(MAP()) if N is None else [INT() for i in range(N)]
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
sys.setrecursionlimit(10 ** 9)
INF = 10 ** 19
MOD = 10 ** 19 + 7
EPS = 10 ** -10
class BIT:
""" BIT汎用版 """
def __init__(self, n, func, init):
# 0-indexed
n += 1
nv = 1
while nv < n:
nv *= 2
self.size = nv
self.func = func
self.init = init
self.tree = [init] * nv
def query(self, i):
""" [0, i]の値を取得 """
s = self.init
i += 1
while i > 0:
s = self.func(s, self.tree[i-1])
i -= i & -i
return s
def update(self, i, x):
""" 値の更新：添字i, 値x """
i += 1
while i <= self.size:
self.tree[i-1] = self.func(self.tree[i-1], x)
i += i & -i
class SegTree:
"""
セグメント木
1.update: i番目の値をxに更新する
2.query: 区間[l, r)の値を得る
"""
def __init__(self, n, func, intv, A=[]):
"""
:param n: 要素数(0-indexed)
:param func: 値の操作に使う関数(min, max, add, gcdなど)
:param intv: 要素の初期値(単位元)
:param A: 初期化に使うリスト(オプション)
"""
self.n = n
self.func = func
self.intv = intv
n2 = 1
while n2 < n:
n2 <<= 1
self.n2 = n2
self.tree = [self.intv] * (n2 << 1)
if A:
for i in range(n):
self.tree[n2+i] = A[i]
for i in range(n2-1, -1, -1):
self.tree[i] = self.func(self.tree[i*2], self.tree[i*2+1])
def update(self, i, x):
"""
i番目の値をxに更新
:param i: index(0-indexed)
:param x: update value
"""
i += self.n2
self.tree[i] = x
while i > 0:
i >>= 1
self.tree[i] = self.func(self.tree[i*2], self.tree[i*2+1])
def add(self, i, x):
self.update(i, self.get(i) + x)
def query(self, a, b):
"""
[a, b)の値を得る
:param a: index(0-indexed)
:param b: index(0-indexed)
"""
l = a + self.n2
r = b + self.n2
s = self.intv
while l < r:
if r & 1:
r -= 1
s = self.func(s, self.tree[r])
if l & 1:
s = self.func(s, self.tree[l])
l += 1
l >>= 1
r >>= 1
return s
def get(self, i):
""" 一点取得 """
return self.tree[i+self.n2]
def all(self):
""" 全区間[0, n)の取得 """
return self.tree[1]
def print(self):
for i in range(self.n):
print(self.get(i), end=' ')
print()
H, W, M = MAP()
seg = SegTree(W+1, max, -INF, [0]*(W+1))
adjli = [[] for i in range(H+1)]
C = [0] * (W+1)
for i in range(M):
h, w = MAP()
seg.add(w, 1)
adjli[h].append(w)
ans = 0
for h in range(1, H+1):
rowcnt = len(adjli[h])
for w in adjli[h]:
seg.add(w, -1)
ans = max(ans, rowcnt+seg.all())
for w in adjli[h]:
seg.add(w, 1)
print(ans)
| import sys
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]
def ceil(x, y=1): return int(-(-x // y))
def INT(): return int(eval(input()))
def MAP(): return list(map(int, input().split()))
def LIST(N=None): return list(MAP()) if N is None else [INT() for i in range(N)]
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
sys.setrecursionlimit(10 ** 9)
INF = 10 ** 19
MOD = 10 ** 19 + 7
EPS = 10 ** -10
H, W, M = MAP()
row = [0] * (H+1)
col = [0] * (W+1)
se = set()
for i in range(M):
h, w = MAP()
row[h] += 1
col[w] += 1
se.add((h, w))
mxh = max(row)
hli = []
for h, cnt in enumerate(row):
if cnt == mxh:
hli.append(h)
mxw = max(col)
wli = []
for w, cnt in enumerate(col):
if cnt == mxw:
wli.append(w)
ok = 0
for h in hli:
for w in wli:
if (h, w) not in se:
ok = 1
break
if ok:
break
ans = mxh + mxw - 1 + ok
print(ans)
| 144 | 50 | 3,670 | 1,226 | import sys
def input():
return sys.stdin.readline().strip()
def list2d(a, b, c):
return [[c] * b for i in range(a)]
def list3d(a, b, c, d):
return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e):
return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]
def ceil(x, y=1):
return int(-(-x // y))
def INT():
return int(input())
def MAP():
return map(int, input().split())
def LIST(N=None):
return list(MAP()) if N is None else [INT() for i in range(N)]
def Yes():
print("Yes")
def No():
print("No")
def YES():
print("YES")
def NO():
print("NO")
sys.setrecursionlimit(10**9)
INF = 10**19
MOD = 10**19 + 7
EPS = 10**-10
class BIT:
"""BIT汎用版"""
def __init__(self, n, func, init):
# 0-indexed
n += 1
nv = 1
while nv < n:
nv *= 2
self.size = nv
self.func = func
self.init = init
self.tree = [init] * nv
def query(self, i):
"""[0, i]の値を取得"""
s = self.init
i += 1
while i > 0:
s = self.func(s, self.tree[i - 1])
i -= i & -i
return s
def update(self, i, x):
"""値の更新：添字i, 値x"""
i += 1
while i <= self.size:
self.tree[i - 1] = self.func(self.tree[i - 1], x)
i += i & -i
class SegTree:
"""
セグメント木
1.update: i番目の値をxに更新する
2.query: 区間[l, r)の値を得る
"""
def __init__(self, n, func, intv, A=[]):
"""
:param n: 要素数(0-indexed)
:param func: 値の操作に使う関数(min, max, add, gcdなど)
:param intv: 要素の初期値(単位元)
:param A: 初期化に使うリスト(オプション)
"""
self.n = n
self.func = func
self.intv = intv
n2 = 1
while n2 < n:
n2 <<= 1
self.n2 = n2
self.tree = [self.intv] * (n2 << 1)
if A:
for i in range(n):
self.tree[n2 + i] = A[i]
for i in range(n2 - 1, -1, -1):
self.tree[i] = self.func(self.tree[i * 2], self.tree[i * 2 + 1])
def update(self, i, x):
"""
i番目の値をxに更新
:param i: index(0-indexed)
:param x: update value
"""
i += self.n2
self.tree[i] = x
while i > 0:
i >>= 1
self.tree[i] = self.func(self.tree[i * 2], self.tree[i * 2 + 1])
def add(self, i, x):
self.update(i, self.get(i) + x)
def query(self, a, b):
"""
[a, b)の値を得る
:param a: index(0-indexed)
:param b: index(0-indexed)
"""
l = a + self.n2
r = b + self.n2
s = self.intv
while l < r:
if r & 1:
r -= 1
s = self.func(s, self.tree[r])
if l & 1:
s = self.func(s, self.tree[l])
l += 1
l >>= 1
r >>= 1
return s
def get(self, i):
"""一点取得"""
return self.tree[i + self.n2]
def all(self):
"""全区間[0, n)の取得"""
return self.tree[1]
def print(self):
for i in range(self.n):
print(self.get(i), end=" ")
print()
H, W, M = MAP()
seg = SegTree(W + 1, max, -INF, [0] * (W + 1))
adjli = [[] for i in range(H + 1)]
C = [0] * (W + 1)
for i in range(M):
h, w = MAP()
seg.add(w, 1)
adjli[h].append(w)
ans = 0
for h in range(1, H + 1):
rowcnt = len(adjli[h])
for w in adjli[h]:
seg.add(w, -1)
ans = max(ans, rowcnt + seg.all())
for w in adjli[h]:
seg.add(w, 1)
print(ans)
| import sys
def input():
return sys.stdin.readline().strip()
def list2d(a, b, c):
return [[c] * b for i in range(a)]
def list3d(a, b, c, d):
return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e):
return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]
def ceil(x, y=1):
return int(-(-x // y))
def INT():
return int(eval(input()))
def MAP():
return list(map(int, input().split()))
def LIST(N=None):
return list(MAP()) if N is None else [INT() for i in range(N)]
def Yes():
print("Yes")
def No():
print("No")
def YES():
print("YES")
def NO():
print("NO")
sys.setrecursionlimit(10**9)
INF = 10**19
MOD = 10**19 + 7
EPS = 10**-10
H, W, M = MAP()
row = [0] * (H + 1)
col = [0] * (W + 1)
se = set()
for i in range(M):
h, w = MAP()
row[h] += 1
col[w] += 1
se.add((h, w))
mxh = max(row)
hli = []
for h, cnt in enumerate(row):
if cnt == mxh:
hli.append(h)
mxw = max(col)
wli = []
for w, cnt in enumerate(col):
if cnt == mxw:
wli.append(w)
ok = 0
for h in hli:
for w in wli:
if (h, w) not in se:
ok = 1
break
if ok:
break
ans = mxh + mxw - 1 + ok
print(ans)
| false | 65.277778 | [
"- return int(input())",
"+ return int(eval(input()))",
"- return map(int, input().split())",
"+ return list(map(int, input().split()))",
"-",
"-",
"-class BIT:",
"- \"\"\"BIT汎用版\"\"\"",
"-",
"- def __init__(self, n, func, init):",
"- # 0-indexed",
"- n += 1",
"- nv = 1",
"- while nv < n:",
"- nv *= 2",
"- self.size = nv",
"- self.func = func",
"- self.init = init",
"- self.tree = [init] * nv",
"-",
"- def query(self, i):",
"- \"\"\"[0, i]の値を取得\"\"\"",
"- s = self.init",
"- i += 1",
"- while i > 0:",
"- s = self.func(s, self.tree[i - 1])",
"- i -= i & -i",
"- return s",
"-",
"- def update(self, i, x):",
"- \"\"\"値の更新：添字i, 値x\"\"\"",
"- i += 1",
"- while i <= self.size:",
"- self.tree[i - 1] = self.func(self.tree[i - 1], x)",
"- i += i & -i",
"-",
"-",
"-class SegTree:",
"- \"\"\"",
"- セグメント木",
"- 1.update: i番目の値をxに更新する",
"- 2.query: 区間[l, r)の値を得る",
"- \"\"\"",
"-",
"- def __init__(self, n, func, intv, A=[]):",
"- \"\"\"",
"- :param n: 要素数(0-indexed)",
"- :param func: 値の操作に使う関数(min, max, add, gcdなど)",
"- :param intv: 要素の初期値(単位元)",
"- :param A: 初期化に使うリスト(オプション)",
"- \"\"\"",
"- self.n = n",
"- self.func = func",
"- self.intv = intv",
"- n2 = 1",
"- while n2 < n:",
"- n2 <<= 1",
"- self.n2 = n2",
"- self.tree = [self.intv] * (n2 << 1)",
"- if A:",
"- for i in range(n):",
"- self.tree[n2 + i] = A[i]",
"- for i in range(n2 - 1, -1, -1):",
"- self.tree[i] = self.func(self.tree[i * 2], self.tree[i * 2 + 1])",
"-",
"- def update(self, i, x):",
"- \"\"\"",
"- i番目の値をxに更新",
"- :param i: index(0-indexed)",
"- :param x: update value",
"- \"\"\"",
"- i += self.n2",
"- self.tree[i] = x",
"- while i > 0:",
"- i >>= 1",
"- self.tree[i] = self.func(self.tree[i * 2], self.tree[i * 2 + 1])",
"-",
"- def add(self, i, x):",
"- self.update(i, self.get(i) + x)",
"-",
"- def query(self, a, b):",
"- \"\"\"",
"- [a, b)の値を得る",
"- :param a: index(0-indexed)",
"- :param b: index(0-indexed)",
"- \"\"\"",
"- l = a + self.n2",
"- r = b + self.n2",
"- s = self.intv",
"- while l < r:",
"- if r & 1:",
"- r -= 1",
"- s = self.func(s, self.tree[r])",
"- if l & 1:",
"- s = self.func(s, self.tree[l])",
"- l += 1",
"- l >>= 1",
"- r >>= 1",
"- return s",
"-",
"- def get(self, i):",
"- \"\"\"一点取得\"\"\"",
"- return self.tree[i + self.n2]",
"-",
"- def all(self):",
"- \"\"\"全区間[0, n)の取得\"\"\"",
"- return self.tree[1]",
"-",
"- def print(self):",
"- for i in range(self.n):",
"- print(self.get(i), end=\" \")",
"- print()",
"-",
"-",
"-seg = SegTree(W + 1, max, -INF, [0] * (W + 1))",
"-adjli = [[] for i in range(H + 1)]",
"-C = [0] * (W + 1)",
"+row = [0] * (H + 1)",
"+col = [0] * (W + 1)",
"+se = set()",
"- seg.add(w, 1)",
"- adjli[h].append(w)",
"-ans = 0",
"-for h in range(1, H + 1):",
"- rowcnt = len(adjli[h])",
"- for w in adjli[h]:",
"- seg.add(w, -1)",
"- ans = max(ans, rowcnt + seg.all())",
"- for w in adjli[h]:",
"- seg.add(w, 1)",
"+ row[h] += 1",
"+ col[w] += 1",
"+ se.add((h, w))",
"+mxh = max(row)",
"+hli = []",
"+for h, cnt in enumerate(row):",
"+ if cnt == mxh:",
"+ hli.append(h)",
"+mxw = max(col)",
"+wli = []",
"+for w, cnt in enumerate(col):",
"+ if cnt == mxw:",
"+ wli.append(w)",
"+ok = 0",
"+for h in hli:",
"+ for w in wli:",
"+ if (h, w) not in se:",
"+ ok = 1",
"+ break",
"+ if ok:",
"+ break",
"+ans = mxh + mxw - 1 + ok"
] | false | 0.044818 | 0.037644 | 1.190587 | [
"s731036039",
"s281617237"
] |
u898917044 | p03262 | python | s791225151 | s525627704 | 192 | 83 | 15,268 | 14,748 | Accepted | Accepted | 56.77 | # abc109_c
def mcd(x, y):
if x > y:
big = x
small = y
else:
big = y
small = x
while True:
rest = big % small
if rest == 0:
return small
else:
big = small
small = rest
def solve(seq):
satisfy = [] # find distances to satisfy
for i in range(len(seq) - 1):
satisfy.append(abs(seq[i] - seq[i + 1]))
# print(satisfy)
if len(satisfy) == 1:
return satisfy[0]
mcds = []
for i in range(len(satisfy) - 1):
mcds.append(mcd(satisfy[i], satisfy[i + 1]))
# print(sol)
return min(mcds)
if __name__ == "__main__":
firstline_input = list(map(int, input("").split(" ")))
seq = list(map(int, input("").split(" ")))
seq.insert(0, firstline_input[1])
print((solve(seq)))
| # abc109_c
from functools import reduce
def mcd(x, y):
if x > y:
big = x
small = y
else:
big = y
small = x
while True:
rest = big % small
if rest == 0:
return small
else:
big = small
small = rest
def solve(seq):
satisfy = [] # find distances to satisfy
for i in range(len(seq) - 1):
satisfy.append(abs(seq[i] - seq[i + 1]))
if len(satisfy) == 1:
return satisfy[0]
return reduce(mcd, satisfy)
if __name__ == "__main__":
firstline_input = list(map(int, input("").split(" ")))
seq = list(map(int, input("").split(" ")))
seq.insert(0, firstline_input[1])
print((solve(seq)))
| 41 | 37 | 874 | 767 | # abc109_c
def mcd(x, y):
if x > y:
big = x
small = y
else:
big = y
small = x
while True:
rest = big % small
if rest == 0:
return small
else:
big = small
small = rest
def solve(seq):
satisfy = [] # find distances to satisfy
for i in range(len(seq) - 1):
satisfy.append(abs(seq[i] - seq[i + 1]))
# print(satisfy)
if len(satisfy) == 1:
return satisfy[0]
mcds = []
for i in range(len(satisfy) - 1):
mcds.append(mcd(satisfy[i], satisfy[i + 1]))
# print(sol)
return min(mcds)
if __name__ == "__main__":
firstline_input = list(map(int, input("").split(" ")))
seq = list(map(int, input("").split(" ")))
seq.insert(0, firstline_input[1])
print((solve(seq)))
| # abc109_c
from functools import reduce
def mcd(x, y):
if x > y:
big = x
small = y
else:
big = y
small = x
while True:
rest = big % small
if rest == 0:
return small
else:
big = small
small = rest
def solve(seq):
satisfy = [] # find distances to satisfy
for i in range(len(seq) - 1):
satisfy.append(abs(seq[i] - seq[i + 1]))
if len(satisfy) == 1:
return satisfy[0]
return reduce(mcd, satisfy)
if __name__ == "__main__":
firstline_input = list(map(int, input("").split(" ")))
seq = list(map(int, input("").split(" ")))
seq.insert(0, firstline_input[1])
print((solve(seq)))
| false | 9.756098 | [
"+from functools import reduce",
"+",
"+",
"- # print(satisfy)",
"- mcds = []",
"- for i in range(len(satisfy) - 1):",
"- mcds.append(mcd(satisfy[i], satisfy[i + 1]))",
"- # print(sol)",
"- return min(mcds)",
"+ return reduce(mcd, satisfy)"
] | false | 0.03607 | 0.056313 | 0.640538 | [
"s791225151",
"s525627704"
] |
u188827677 | p02995 | python | s060786907 | s958892512 | 36 | 26 | 5,048 | 9,080 | Accepted | Accepted | 27.78 | from fractions import gcd
a,b,c,d = list(map(int, input().split()))
lcm = (c*d)//gcd(c,d)
x = ((a-1)//c)+((a-1)//d)-((a-1)//lcm)
y = (b//c)+(b//d)-(b//lcm)
print(((b-(a-1))-(y-x)))
| from math import gcd
a,b,c,d = list(map(int, input().split()))
t = c*d//gcd(c,d)
x = (a-1) - ((a-1)//c + (a-1)//d) + (a-1)//t
y = b - (b//c + b//d) + b//t
print((y-x)) | 9 | 8 | 184 | 168 | from fractions import gcd
a, b, c, d = list(map(int, input().split()))
lcm = (c * d) // gcd(c, d)
x = ((a - 1) // c) + ((a - 1) // d) - ((a - 1) // lcm)
y = (b // c) + (b // d) - (b // lcm)
print(((b - (a - 1)) - (y - x)))
| from math import gcd
a, b, c, d = list(map(int, input().split()))
t = c * d // gcd(c, d)
x = (a - 1) - ((a - 1) // c + (a - 1) // d) + (a - 1) // t
y = b - (b // c + b // d) + b // t
print((y - x))
| false | 11.111111 | [
"-from fractions import gcd",
"+from math import gcd",
"-lcm = (c * d) // gcd(c, d)",
"-x = ((a - 1) // c) + ((a - 1) // d) - ((a - 1) // lcm)",
"-y = (b // c) + (b // d) - (b // lcm)",
"-print(((b - (a - 1)) - (y - x)))",
"+t = c * d // gcd(c, d)",
"+x = (a - 1) - ((a - 1) // c + (a - 1) // d) + (a - 1) // t",
"+y = b - (b // c + b // d) + b // t",
"+print((y - x))"
] | false | 0.044832 | 0.057622 | 0.778035 | [
"s060786907",
"s958892512"
] |
u271752889 | p03408 | python | s881694458 | s245373175 | 22 | 17 | 3,316 | 3,064 | Accepted | Accepted | 22.73 | import collections
n=int(eval(input()))
lb=[eval(input()) for i in range(n)]
m=int(eval(input()))
lr=[eval(input()) for i in range(m)]
for i in range(len(lr)):
if lr[i] in lb:
lb.remove(lr[i])
else:
pass
if lb==[]:
ans=0
else:
s=collections.Counter(lb)
ans=s.most_common()[0][1]
print(ans) | n=int(eval(input()))
b=[eval(input()) for i in range(n)]
m=int(eval(input()))
r=[eval(input()) for i in range(m)]
ans=[0]
for i in set(b):
ans.append(b.count(i)-r.count(i))
print((max(ans))) | 19 | 11 | 328 | 181 | import collections
n = int(eval(input()))
lb = [eval(input()) for i in range(n)]
m = int(eval(input()))
lr = [eval(input()) for i in range(m)]
for i in range(len(lr)):
if lr[i] in lb:
lb.remove(lr[i])
else:
pass
if lb == []:
ans = 0
else:
s = collections.Counter(lb)
ans = s.most_common()[0][1]
print(ans)
| n = int(eval(input()))
b = [eval(input()) for i in range(n)]
m = int(eval(input()))
r = [eval(input()) for i in range(m)]
ans = [0]
for i in set(b):
ans.append(b.count(i) - r.count(i))
print((max(ans)))
| false | 42.105263 | [
"-import collections",
"-",
"-lb = [eval(input()) for i in range(n)]",
"+b = [eval(input()) for i in range(n)]",
"-lr = [eval(input()) for i in range(m)]",
"-for i in range(len(lr)):",
"- if lr[i] in lb:",
"- lb.remove(lr[i])",
"- else:",
"- pass",
"-if lb == []:",
"- ans = 0",
"-else:",
"- s = collections.Counter(lb)",
"- ans = s.most_common()[0][1]",
"-print(ans)",
"+r = [eval(input()) for i in range(m)]",
"+ans = [0]",
"+for i in set(b):",
"+ ans.append(b.count(i) - r.count(i))",
"+print((max(ans)))"
] | false | 0.044223 | 0.04833 | 0.915041 | [
"s881694458",
"s245373175"
] |
u938486382 | p03128 | python | s056233850 | s278400900 | 241 | 200 | 12,776 | 3,444 | Accepted | Accepted | 17.01 | n, m = list(map(int, input().split(' ')))
l = list(map(int, input().split(' ')))
d = {} # key=match, val=num
d[2] = [1]
d[3] = [7]
d[4] = [4]
d[5] = [5, 3, 2]
d[6] = [9, 6]
d[7] = [8]
enable = [False] * 10
for a in l:
enable[a] = True
memo = {}
# マッチをk(=2..7)本使う場合の一番大きい値を総当たり
def f(nokori, current):
k = (nokori, current)
if k in memo:
return memo[k]
if nokori <= 0:
return current if nokori == 0 else -1
temps = []
for key, nums in list(d.items())[::-1]:
for num in nums:
if enable[num]:
if nokori-key != 0 and current % 10 != 0 and current % 10 < num:
# 98 ok, 89 重複するので最後の桁以外は skip
continue
temps.append(f(nokori-key, current*10+num))
break
memo[k] = max(temps)
return memo[k]
# 余裕があるうちは一番マッチの本数が少ないモノをヤケクソで詰めまくる
hoge = False
for key, nums in list(d.items()):
# print(key, nums, type(nums))
for num in nums:
if enable[num]:
hoge = True
break
if hoge:
break
cs = []
while n > 50:
n -= key
cs.append(str(num))
# ヤケクソで詰めたやつと総当たりで調べたマックスを並び替えて辞書順で大きくする
num_ans = str(f(n, 0))
print((''.join(sorted(list(num_ans) + cs)[::-1]))) | n, m = list(map(int, input().split(' ')))
l = list(map(int, input().split(' ')))
d = {} # key=match, val=num
d[2] = [1]
d[3] = [7]
d[4] = [4]
d[5] = [5, 3, 2]
d[6] = [9, 6]
d[7] = [8]
enable = [False] * 10
for a in l:
enable[a] = True
# マッチをk(=2..7)本使う場合の一番大きい値を総当たり
def f(nokori, current):
if nokori == 0:
return current
if nokori < 0:
return -1
temps = []
for key, nums in list(d.items())[::-1]:
for num in nums:
if enable[num]:
if nokori-key != 0 and current % 10 != 0 and current % 10 < num:
# 98 ok, 89 重複するので最後の桁以外は skip
continue
temps.append(f(nokori-key, current*10+num))
break
return max(temps)
# 余裕があるうちは一番マッチの本数が少ないモノをヤケクソで詰めまくる
hoge = False
for key, nums in list(d.items()):
# print(key, nums, type(nums))
for num in nums:
if enable[num]:
hoge = True
break
if hoge:
break
cs = []
while n > 50:
n -= key
cs.append(str(num))
# ヤケクソで詰めたやつと総当たりで調べたマックスを並び替えて辞書順で大きくする
num_ans = str(f(n, 0))
print((''.join(sorted(list(num_ans) + cs)[::-1])))
| 50 | 47 | 1,198 | 1,115 | n, m = list(map(int, input().split(" ")))
l = list(map(int, input().split(" ")))
d = {} # key=match, val=num
d[2] = [1]
d[3] = [7]
d[4] = [4]
d[5] = [5, 3, 2]
d[6] = [9, 6]
d[7] = [8]
enable = [False] * 10
for a in l:
enable[a] = True
memo = {}
# マッチをk(=2..7)本使う場合の一番大きい値を総当たり
def f(nokori, current):
k = (nokori, current)
if k in memo:
return memo[k]
if nokori <= 0:
return current if nokori == 0 else -1
temps = []
for key, nums in list(d.items())[::-1]:
for num in nums:
if enable[num]:
if nokori - key != 0 and current % 10 != 0 and current % 10 < num:
# 98 ok, 89 重複するので最後の桁以外は skip
continue
temps.append(f(nokori - key, current * 10 + num))
break
memo[k] = max(temps)
return memo[k]
# 余裕があるうちは一番マッチの本数が少ないモノをヤケクソで詰めまくる
hoge = False
for key, nums in list(d.items()):
# print(key, nums, type(nums))
for num in nums:
if enable[num]:
hoge = True
break
if hoge:
break
cs = []
while n > 50:
n -= key
cs.append(str(num))
# ヤケクソで詰めたやつと総当たりで調べたマックスを並び替えて辞書順で大きくする
num_ans = str(f(n, 0))
print(("".join(sorted(list(num_ans) + cs)[::-1])))
| n, m = list(map(int, input().split(" ")))
l = list(map(int, input().split(" ")))
d = {} # key=match, val=num
d[2] = [1]
d[3] = [7]
d[4] = [4]
d[5] = [5, 3, 2]
d[6] = [9, 6]
d[7] = [8]
enable = [False] * 10
for a in l:
enable[a] = True
# マッチをk(=2..7)本使う場合の一番大きい値を総当たり
def f(nokori, current):
if nokori == 0:
return current
if nokori < 0:
return -1
temps = []
for key, nums in list(d.items())[::-1]:
for num in nums:
if enable[num]:
if nokori - key != 0 and current % 10 != 0 and current % 10 < num:
# 98 ok, 89 重複するので最後の桁以外は skip
continue
temps.append(f(nokori - key, current * 10 + num))
break
return max(temps)
# 余裕があるうちは一番マッチの本数が少ないモノをヤケクソで詰めまくる
hoge = False
for key, nums in list(d.items()):
# print(key, nums, type(nums))
for num in nums:
if enable[num]:
hoge = True
break
if hoge:
break
cs = []
while n > 50:
n -= key
cs.append(str(num))
# ヤケクソで詰めたやつと総当たりで調べたマックスを並び替えて辞書順で大きくする
num_ans = str(f(n, 0))
print(("".join(sorted(list(num_ans) + cs)[::-1])))
| false | 6 | [
"-memo = {}",
"- k = (nokori, current)",
"- if k in memo:",
"- return memo[k]",
"- if nokori <= 0:",
"- return current if nokori == 0 else -1",
"+ if nokori == 0:",
"+ return current",
"+ if nokori < 0:",
"+ return -1",
"- memo[k] = max(temps)",
"- return memo[k]",
"+ return max(temps)"
] | false | 0.428319 | 0.083812 | 5.110503 | [
"s056233850",
"s278400900"
] |
u721446434 | p02389 | python | s426255245 | s603613641 | 40 | 20 | 7,584 | 7,572 | Accepted | Accepted | 50 | a = input().split()
print(((int(a[0]) * int(a[1])), ((int(a[0]) + int(a[1])) * 2))) | nums = list(map(int, input().split()))
print((nums[0] * nums[1], (nums[0] + nums[1]) * 2)) | 2 | 2 | 82 | 89 | a = input().split()
print(((int(a[0]) * int(a[1])), ((int(a[0]) + int(a[1])) * 2)))
| nums = list(map(int, input().split()))
print((nums[0] * nums[1], (nums[0] + nums[1]) * 2))
| false | 0 | [
"-a = input().split()",
"-print(((int(a[0]) * int(a[1])), ((int(a[0]) + int(a[1])) * 2)))",
"+nums = list(map(int, input().split()))",
"+print((nums[0] * nums[1], (nums[0] + nums[1]) * 2))"
] | false | 0.146664 | 0.045771 | 3.204275 | [
"s426255245",
"s603613641"
] |
u604774382 | p02420 | python | s622686393 | s798496401 | 30 | 20 | 6,724 | 4,204 | Accepted | Accepted | 33.33 | import sys
def shuffle( cards ):
h = int( sys.stdin.readline() )
n = len( cards )
s = ""
t = ""
for i in range( h ):
s += cards[i]
for i in range( h, n ):
t += cards[i]
t += s
return t
while True:
cards = sys.stdin.readline().rstrip()
if '-' == cards:
break
m = int( sys.stdin.readline() )
for i in range( 0, m ):
cards = shuffle( cards )
print( cards ) | import sys
def shuffle( cards ):
h = int( sys.stdin.readline() )
cards = cards[ h : ] + cards[ 0 : h ]
return cards
while True:
cards = sys.stdin.readline().rstrip()
if '-' == cards:
break
m = int( sys.stdin.readline() )
for i in range( m ):
cards = shuffle( cards )
print( cards ) | 22 | 15 | 397 | 309 | import sys
def shuffle(cards):
h = int(sys.stdin.readline())
n = len(cards)
s = ""
t = ""
for i in range(h):
s += cards[i]
for i in range(h, n):
t += cards[i]
t += s
return t
while True:
cards = sys.stdin.readline().rstrip()
if "-" == cards:
break
m = int(sys.stdin.readline())
for i in range(0, m):
cards = shuffle(cards)
print(cards)
| import sys
def shuffle(cards):
h = int(sys.stdin.readline())
cards = cards[h:] + cards[0:h]
return cards
while True:
cards = sys.stdin.readline().rstrip()
if "-" == cards:
break
m = int(sys.stdin.readline())
for i in range(m):
cards = shuffle(cards)
print(cards)
| false | 31.818182 | [
"- n = len(cards)",
"- s = \"\"",
"- t = \"\"",
"- for i in range(h):",
"- s += cards[i]",
"- for i in range(h, n):",
"- t += cards[i]",
"- t += s",
"- return t",
"+ cards = cards[h:] + cards[0:h]",
"+ return cards",
"- for i in range(0, m):",
"+ for i in range(m):"
] | false | 0.008177 | 0.040967 | 0.1996 | [
"s622686393",
"s798496401"
] |
u113971909 | p03739 | python | s443487578 | s717281432 | 215 | 152 | 14,332 | 14,332 | Accepted | Accepted | 29.3 | n=int(eval(input()))
a=list(map(int,input().split()))
fg=[1,-1]
ret = [0]*2
tot = [0]*2
il = list(range(n))
jl = list(range(2))
for i in il:
for j in jl:
tot[j]+=a[i]
if tot[j]*fg[j]<=0:
ret[j] += abs(fg[j] - tot[j])
tot[j] += fg[j] - tot[j]
fg[j]*=-1
print((min(ret))) | n=int(eval(input()))
a=list(map(int,input().split()))
def ma():
fg=[1,-1]
ret = [0]*2
tot = [0]*2
il = list(range(n))
jl = list(range(2))
for i in il:
for j in jl:
tot[j]+=a[i]
if tot[j]*fg[j]<=0:
ret[j] += abs(fg[j] - tot[j])
tot[j] += fg[j] - tot[j]
fg[j]*=-1
return min(ret)
print((ma())) | 15 | 17 | 289 | 339 | n = int(eval(input()))
a = list(map(int, input().split()))
fg = [1, -1]
ret = [0] * 2
tot = [0] * 2
il = list(range(n))
jl = list(range(2))
for i in il:
for j in jl:
tot[j] += a[i]
if tot[j] * fg[j] <= 0:
ret[j] += abs(fg[j] - tot[j])
tot[j] += fg[j] - tot[j]
fg[j] *= -1
print((min(ret)))
| n = int(eval(input()))
a = list(map(int, input().split()))
def ma():
fg = [1, -1]
ret = [0] * 2
tot = [0] * 2
il = list(range(n))
jl = list(range(2))
for i in il:
for j in jl:
tot[j] += a[i]
if tot[j] * fg[j] <= 0:
ret[j] += abs(fg[j] - tot[j])
tot[j] += fg[j] - tot[j]
fg[j] *= -1
return min(ret)
print((ma()))
| false | 11.764706 | [
"-fg = [1, -1]",
"-ret = [0] * 2",
"-tot = [0] * 2",
"-il = list(range(n))",
"-jl = list(range(2))",
"-for i in il:",
"- for j in jl:",
"- tot[j] += a[i]",
"- if tot[j] * fg[j] <= 0:",
"- ret[j] += abs(fg[j] - tot[j])",
"- tot[j] += fg[j] - tot[j]",
"- fg[j] *= -1",
"-print((min(ret)))",
"+",
"+",
"+def ma():",
"+ fg = [1, -1]",
"+ ret = [0] * 2",
"+ tot = [0] * 2",
"+ il = list(range(n))",
"+ jl = list(range(2))",
"+ for i in il:",
"+ for j in jl:",
"+ tot[j] += a[i]",
"+ if tot[j] * fg[j] <= 0:",
"+ ret[j] += abs(fg[j] - tot[j])",
"+ tot[j] += fg[j] - tot[j]",
"+ fg[j] *= -1",
"+ return min(ret)",
"+",
"+",
"+print((ma()))"
] | false | 0.03352 | 0.036815 | 0.910502 | [
"s443487578",
"s717281432"
] |
u483187413 | p03078 | python | s708240587 | s148447864 | 1,653 | 31 | 232,504 | 4,848 | Accepted | Accepted | 98.12 | import sys
def solve(k, ax, bx, cx):
ab = []
for a in ax:
for b in bx:
ab.append(a+b)
ab.sort(reverse=True)
abk = ab[:k]
ans = []
for c in cx:
for abi in abk:
ans.append(c+abi)
return sorted(ans, reverse=True)[:k]
if __name__ == '__main__':
_, _, _, k = map(int, input().split())
ax = sorted(list(map(int, sys.stdin.readline().split())), reverse=True)
bx = sorted(list(map(int, sys.stdin.readline().split())), reverse=True)
cx = sorted(list(map(int, sys.stdin.readline().split())), reverse=True)
ans = solve(k, ax, bx, cx)
print(*ans, sep="\n")
| from heapq import heappush, heappop
def solve(k, ax, bx, cx, x, y, z):
ans = []
heap = [(-(ax[0] + bx[0] + cx[0]), 0, 0, 0)]
d = {(0, 0, 0)}
for _ in range(k):
s, ai, bi, ci = heappop(heap)
ans += [-s]
if (ai+1, bi, ci) not in d and ai+1 < x:
heappush(heap, (-(ax[ai+1] + bx[bi] + cx[ci]), ai+1, bi, ci))
d.add((ai+1, bi, ci))
if (ai, bi+1, ci) not in d and bi+1 < y:
heappush(heap, (-(ax[ai] + bx[bi+1] + cx[ci]), ai, bi+1, ci))
d.add((ai, bi+1, ci))
if (ai, bi, ci+1) not in d and ci+1 < z:
heappush(heap, (-(ax[ai] + bx[bi] + cx[ci+1]), ai, bi, ci+1))
d.add((ai, bi, ci+1))
return ans
if __name__ == "__main__":
x, y, z, k = map(int, input().split())
ax = sorted(list(map(int, input().split())), reverse=True)
bx = sorted(list(map(int, input().split())), reverse=True)
cx = sorted(list(map(int, input().split())), reverse=True)
ans = solve(k, ax, bx, cx, x, y, z)
print(*ans, sep="\n")
| 29 | 32 | 674 | 1,083 | import sys
def solve(k, ax, bx, cx):
ab = []
for a in ax:
for b in bx:
ab.append(a + b)
ab.sort(reverse=True)
abk = ab[:k]
ans = []
for c in cx:
for abi in abk:
ans.append(c + abi)
return sorted(ans, reverse=True)[:k]
if __name__ == "__main__":
_, _, _, k = map(int, input().split())
ax = sorted(list(map(int, sys.stdin.readline().split())), reverse=True)
bx = sorted(list(map(int, sys.stdin.readline().split())), reverse=True)
cx = sorted(list(map(int, sys.stdin.readline().split())), reverse=True)
ans = solve(k, ax, bx, cx)
print(*ans, sep="\n")
| from heapq import heappush, heappop
def solve(k, ax, bx, cx, x, y, z):
ans = []
heap = [(-(ax[0] + bx[0] + cx[0]), 0, 0, 0)]
d = {(0, 0, 0)}
for _ in range(k):
s, ai, bi, ci = heappop(heap)
ans += [-s]
if (ai + 1, bi, ci) not in d and ai + 1 < x:
heappush(heap, (-(ax[ai + 1] + bx[bi] + cx[ci]), ai + 1, bi, ci))
d.add((ai + 1, bi, ci))
if (ai, bi + 1, ci) not in d and bi + 1 < y:
heappush(heap, (-(ax[ai] + bx[bi + 1] + cx[ci]), ai, bi + 1, ci))
d.add((ai, bi + 1, ci))
if (ai, bi, ci + 1) not in d and ci + 1 < z:
heappush(heap, (-(ax[ai] + bx[bi] + cx[ci + 1]), ai, bi, ci + 1))
d.add((ai, bi, ci + 1))
return ans
if __name__ == "__main__":
x, y, z, k = map(int, input().split())
ax = sorted(list(map(int, input().split())), reverse=True)
bx = sorted(list(map(int, input().split())), reverse=True)
cx = sorted(list(map(int, input().split())), reverse=True)
ans = solve(k, ax, bx, cx, x, y, z)
print(*ans, sep="\n")
| false | 9.375 | [
"-import sys",
"+from heapq import heappush, heappop",
"-def solve(k, ax, bx, cx):",
"- ab = []",
"- for a in ax:",
"- for b in bx:",
"- ab.append(a + b)",
"- ab.sort(reverse=True)",
"- abk = ab[:k]",
"+def solve(k, ax, bx, cx, x, y, z):",
"- for c in cx:",
"- for abi in abk:",
"- ans.append(c + abi)",
"- return sorted(ans, reverse=True)[:k]",
"+ heap = [(-(ax[0] + bx[0] + cx[0]), 0, 0, 0)]",
"+ d = {(0, 0, 0)}",
"+ for _ in range(k):",
"+ s, ai, bi, ci = heappop(heap)",
"+ ans += [-s]",
"+ if (ai + 1, bi, ci) not in d and ai + 1 < x:",
"+ heappush(heap, (-(ax[ai + 1] + bx[bi] + cx[ci]), ai + 1, bi, ci))",
"+ d.add((ai + 1, bi, ci))",
"+ if (ai, bi + 1, ci) not in d and bi + 1 < y:",
"+ heappush(heap, (-(ax[ai] + bx[bi + 1] + cx[ci]), ai, bi + 1, ci))",
"+ d.add((ai, bi + 1, ci))",
"+ if (ai, bi, ci + 1) not in d and ci + 1 < z:",
"+ heappush(heap, (-(ax[ai] + bx[bi] + cx[ci + 1]), ai, bi, ci + 1))",
"+ d.add((ai, bi, ci + 1))",
"+ return ans",
"- _, _, _, k = map(int, input().split())",
"- ax = sorted(list(map(int, sys.stdin.readline().split())), reverse=True)",
"- bx = sorted(list(map(int, sys.stdin.readline().split())), reverse=True)",
"- cx = sorted(list(map(int, sys.stdin.readline().split())), reverse=True)",
"- ans = solve(k, ax, bx, cx)",
"+ x, y, z, k = map(int, input().split())",
"+ ax = sorted(list(map(int, input().split())), reverse=True)",
"+ bx = sorted(list(map(int, input().split())), reverse=True)",
"+ cx = sorted(list(map(int, input().split())), reverse=True)",
"+ ans = solve(k, ax, bx, cx, x, y, z)"
] | false | 0.048926 | 0.046655 | 1.048693 | [
"s708240587",
"s148447864"
] |
u933096856 | p02418 | python | s917437393 | s219148017 | 60 | 50 | 7,580 | 7,556 | Accepted | Accepted | 16.67 | s,p=[eval(input()) for i in range(2)]
s=s*4
if p in s:
print('Yes')
else:
print('No') | s,p=[eval(input()) for i in range(2)]
s=s*3
if p in s:
print('Yes')
else:
print('No') | 6 | 6 | 92 | 92 | s, p = [eval(input()) for i in range(2)]
s = s * 4
if p in s:
print("Yes")
else:
print("No")
| s, p = [eval(input()) for i in range(2)]
s = s * 3
if p in s:
print("Yes")
else:
print("No")
| false | 0 | [
"-s = s * 4",
"+s = s * 3"
] | false | 0.04701 | 0.110831 | 0.424154 | [
"s917437393",
"s219148017"
] |
u952708174 | p03659 | python | s915179541 | s084810195 | 169 | 127 | 24,828 | 23,800 | Accepted | Accepted | 24.85 | def c_splitting_pile(N, A):
# Aの要素の総和をX、カードの山の先頭i枚の総和をxとすると、
# |y-x|=|X-2x|である。各iについてこの値を計算すればよい
total = sum(A)
ans = float('inf')
s = 0
for i in range(N-1):
s += A[i]
ans = min(ans, abs(total - s * 2))
return ans
N = int(eval(input()))
A = [int(i) for i in input().split()]
print((c_splitting_pile(N, A))) | def c_splitting_pile(N, A):
# Aの要素の総和をX、カードの山の先頭i枚の総和をxとすると、
# |y-x|=|X-2x|である。各i(1<=i<=N-1)についてこの値を計算すればよい
from itertools import accumulate
total = sum(A)
return min([abs(total - 2 * x) for x in accumulate(A[:-1])])
N = int(eval(input()))
A = [int(i) for i in input().split()]
print((c_splitting_pile(N, A))) | 14 | 10 | 356 | 331 | def c_splitting_pile(N, A):
# Aの要素の総和をX、カードの山の先頭i枚の総和をxとすると、
# |y-x|=|X-2x|である。各iについてこの値を計算すればよい
total = sum(A)
ans = float("inf")
s = 0
for i in range(N - 1):
s += A[i]
ans = min(ans, abs(total - s * 2))
return ans
N = int(eval(input()))
A = [int(i) for i in input().split()]
print((c_splitting_pile(N, A)))
| def c_splitting_pile(N, A):
# Aの要素の総和をX、カードの山の先頭i枚の総和をxとすると、
# |y-x|=|X-2x|である。各i(1<=i<=N-1)についてこの値を計算すればよい
from itertools import accumulate
total = sum(A)
return min([abs(total - 2 * x) for x in accumulate(A[:-1])])
N = int(eval(input()))
A = [int(i) for i in input().split()]
print((c_splitting_pile(N, A)))
| false | 28.571429 | [
"- # |y-x|=|X-2x|である。各iについてこの値を計算すればよい",
"+ # |y-x|=|X-2x|である。各i(1<=i<=N-1)についてこの値を計算すればよい",
"+ from itertools import accumulate",
"+",
"- ans = float(\"inf\")",
"- s = 0",
"- for i in range(N - 1):",
"- s += A[i]",
"- ans = min(ans, abs(total - s * 2))",
"- return ans",
"+ return min([abs(total - 2 * x) for x in accumulate(A[:-1])])"
] | false | 0.041614 | 0.037274 | 1.116442 | [
"s915179541",
"s084810195"
] |
u519939795 | p02659 | python | s434232670 | s228136146 | 26 | 21 | 10,012 | 8,920 | Accepted | Accepted | 19.23 | from decimal import *
a,b=list(map(Decimal,input().split()))
print((int(a*b))) | a,b=input().split()
a=int(a)
b=int(b.replace('.',''))*100
print((a*b//10000)) | 3 | 4 | 72 | 78 | from decimal import *
a, b = list(map(Decimal, input().split()))
print((int(a * b)))
| a, b = input().split()
a = int(a)
b = int(b.replace(".", "")) * 100
print((a * b // 10000))
| false | 25 | [
"-from decimal import *",
"-",
"-a, b = list(map(Decimal, input().split()))",
"-print((int(a * b)))",
"+a, b = input().split()",
"+a = int(a)",
"+b = int(b.replace(\".\", \"\")) * 100",
"+print((a * b // 10000))"
] | false | 0.050712 | 0.047403 | 1.069806 | [
"s434232670",
"s228136146"
] |
u418149936 | p02719 | python | s807298743 | s221910655 | 28 | 25 | 9,096 | 9,112 | Accepted | Accepted | 10.71 | N, K = list(map(int, input().split(' ')))
print((min(N % K, abs(N % K - K)))) | N, K = list(map(int, input().split(' ')))
print((min(N % K, abs((N % K) - K)))) | 2 | 2 | 71 | 72 | N, K = list(map(int, input().split(" ")))
print((min(N % K, abs(N % K - K))))
| N, K = list(map(int, input().split(" ")))
print((min(N % K, abs((N % K) - K))))
| false | 0 | [
"-print((min(N % K, abs(N % K - K))))",
"+print((min(N % K, abs((N % K) - K))))"
] | false | 0.038214 | 0.046543 | 0.821044 | [
"s807298743",
"s221910655"
] |
u323680411 | p03599 | python | s966864875 | s547574994 | 478 | 177 | 3,064 | 3,064 | Accepted | Accepted | 62.97 | A, B, C, D, E, F = list(map(int, input().split()))
best = -1.0
a = ws = sg = 0
while 100 * a * A <= F:
b = 0
while True:
w = 100 * (a * A + b * B)
if w > F: break
c = 0
while w + c * C <= F and 100 * c * C <= w * E:
d = 0
while True:
s = c * C + d * D
if w + s > F or 100 * s > w * E:
break
elif w + s != 0 and best < s / (w + s):
best = s / (w + s)
ws = w + s
sg = s
d += 1
c += 1
b += 1
a += 1
print((ws, sg)) | A, B, C, D, E, F = list(map(int, input().split()))
best = -1.0
ws = sg = 0
for a in range(0, F + 1, 100 * A):
for b in range(0, F - a + 1, 100 * B):
w = a + b
m = min(F - w, w * E // 100)
if w == 0: continue
for c in range(0, m + 1, C):
for d in range(0, m - c + 1, D):
s = c + d
if best < s / (w + s):
best = s / (w + s)
ws = w + s
sg = s
print((ws, sg)) | 26 | 19 | 662 | 508 | A, B, C, D, E, F = list(map(int, input().split()))
best = -1.0
a = ws = sg = 0
while 100 * a * A <= F:
b = 0
while True:
w = 100 * (a * A + b * B)
if w > F:
break
c = 0
while w + c * C <= F and 100 * c * C <= w * E:
d = 0
while True:
s = c * C + d * D
if w + s > F or 100 * s > w * E:
break
elif w + s != 0 and best < s / (w + s):
best = s / (w + s)
ws = w + s
sg = s
d += 1
c += 1
b += 1
a += 1
print((ws, sg))
| A, B, C, D, E, F = list(map(int, input().split()))
best = -1.0
ws = sg = 0
for a in range(0, F + 1, 100 * A):
for b in range(0, F - a + 1, 100 * B):
w = a + b
m = min(F - w, w * E // 100)
if w == 0:
continue
for c in range(0, m + 1, C):
for d in range(0, m - c + 1, D):
s = c + d
if best < s / (w + s):
best = s / (w + s)
ws = w + s
sg = s
print((ws, sg))
| false | 26.923077 | [
"-a = ws = sg = 0",
"-while 100 * a * A <= F:",
"- b = 0",
"- while True:",
"- w = 100 * (a * A + b * B)",
"- if w > F:",
"- break",
"- c = 0",
"- while w + c * C <= F and 100 * c * C <= w * E:",
"- d = 0",
"- while True:",
"- s = c * C + d * D",
"- if w + s > F or 100 * s > w * E:",
"- break",
"- elif w + s != 0 and best < s / (w + s):",
"+ws = sg = 0",
"+for a in range(0, F + 1, 100 * A):",
"+ for b in range(0, F - a + 1, 100 * B):",
"+ w = a + b",
"+ m = min(F - w, w * E // 100)",
"+ if w == 0:",
"+ continue",
"+ for c in range(0, m + 1, C):",
"+ for d in range(0, m - c + 1, D):",
"+ s = c + d",
"+ if best < s / (w + s):",
"- d += 1",
"- c += 1",
"- b += 1",
"- a += 1"
] | false | 0.095059 | 0.057838 | 1.643533 | [
"s966864875",
"s547574994"
] |
u254871849 | p02888 | python | s516513459 | s437026837 | 869 | 472 | 3,188 | 3,692 | Accepted | Accepted | 45.68 | # 2019-11-18 23:58:23(JST)
import sys
# import collections
# import math
# from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect_left as bi_l, bisect_right as bi_r
# import itertools
# from functools import reduce
# import operator as op
# import re
# import heapq
# import array
# from scipy.misc import comb # (default: exact=False)
# import numpy as np
def main():
n, *l = [int(x) for x in sys.stdin.read().split()]
l.sort()
count = 0
for i in range(n-2):
a = l[i]
for j in range(i+1, n-1):
b = l[j]
count += (bi_l(l, a + b) - 1) - j
print(count)
if __name__ == "__main__":
main()
| # 2019-11-18 23:58:23(JST)
import sys
import collections
# import math
# from string import ascii_lowercase, ascii_uppercase, digits
# from bisect import bisect_left as bi_l, bisect_right as bi_r
# import itertools
# from functools import reduce
# import operator as op
# import re
# import heapq
# import array
# from scipy.misc import comb # (default: exact=False)
# import numpy as np
def main():
n, *l = [int(x) for x in sys.stdin.read().split()]
l.sort()
c = collections.defaultdict(int)
for i in range(n):
c[l[i]] += 1
# cumsum: count of {l[j]|l[j] <= l[i]}
s = [0 for _ in range(l[-3] + l[-2] + 1)] # a+bの最大値以下まで
for i in range(l[-3] + l[-2]):
s[i+1] = s[i] + c[i+1]
count = 0
# a <= b <= c
for i in range(n-2):
a = l[i]
for j in range(i+1, n-1):
b = l[j]
# cの候補の数: a+b > cを満たし、c = l[k]となるkがjより大きい棒の数
count += s[a+b-1] - (j + 1) # b は j+1番目
print(count)
if __name__ == "__main__":
main()
| 30 | 47 | 718 | 1,078 | # 2019-11-18 23:58:23(JST)
import sys
# import collections
# import math
# from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect_left as bi_l, bisect_right as bi_r
# import itertools
# from functools import reduce
# import operator as op
# import re
# import heapq
# import array
# from scipy.misc import comb # (default: exact=False)
# import numpy as np
def main():
n, *l = [int(x) for x in sys.stdin.read().split()]
l.sort()
count = 0
for i in range(n - 2):
a = l[i]
for j in range(i + 1, n - 1):
b = l[j]
count += (bi_l(l, a + b) - 1) - j
print(count)
if __name__ == "__main__":
main()
| # 2019-11-18 23:58:23(JST)
import sys
import collections
# import math
# from string import ascii_lowercase, ascii_uppercase, digits
# from bisect import bisect_left as bi_l, bisect_right as bi_r
# import itertools
# from functools import reduce
# import operator as op
# import re
# import heapq
# import array
# from scipy.misc import comb # (default: exact=False)
# import numpy as np
def main():
n, *l = [int(x) for x in sys.stdin.read().split()]
l.sort()
c = collections.defaultdict(int)
for i in range(n):
c[l[i]] += 1
# cumsum: count of {l[j]|l[j] <= l[i]}
s = [0 for _ in range(l[-3] + l[-2] + 1)] # a+bの最大値以下まで
for i in range(l[-3] + l[-2]):
s[i + 1] = s[i] + c[i + 1]
count = 0
# a <= b <= c
for i in range(n - 2):
a = l[i]
for j in range(i + 1, n - 1):
b = l[j]
# cの候補の数: a+b > cを満たし、c = l[k]となるkがjより大きい棒の数
count += s[a + b - 1] - (j + 1) # b は j+1番目
print(count)
if __name__ == "__main__":
main()
| false | 36.170213 | [
"+import collections",
"-# import collections",
"-from bisect import bisect_left as bi_l, bisect_right as bi_r",
"-",
"+# from bisect import bisect_left as bi_l, bisect_right as bi_r",
"+ c = collections.defaultdict(int)",
"+ for i in range(n):",
"+ c[l[i]] += 1",
"+ # cumsum: count of {l[j]|l[j] <= l[i]}",
"+ s = [0 for _ in range(l[-3] + l[-2] + 1)] # a+bの最大値以下まで",
"+ for i in range(l[-3] + l[-2]):",
"+ s[i + 1] = s[i] + c[i + 1]",
"+ # a <= b <= c",
"- count += (bi_l(l, a + b) - 1) - j",
"+ # cの候補の数: a+b > cを満たし、c = l[k]となるkがjより大きい棒の数",
"+ count += s[a + b - 1] - (j + 1) # b は j+1番目"
] | false | 0.037362 | 0.067511 | 0.553425 | [
"s516513459",
"s437026837"
] |
u025501820 | p03339 | python | s586477832 | s370138807 | 246 | 219 | 3,700 | 3,700 | Accepted | Accepted | 10.98 | N = int(eval(input()))
S = eval(input())
left = 0
right = S.count("E")
ans = False
for i in range(N):
if i > 0:
left += 1 if S[i - 1] == "W" else 0
right -= 1 if S[i] == "E" else 0
if ans is not False:
ans = min(ans, left + right)
else:
ans = left + right
print(ans) | N = int(eval(input()))
S = eval(input())
left = 0
right = S.count("E")
ans = False
for i in range(N):
if i > 0 and S[i - 1] == "W":
left += 1
if S[i] == "E":
right -= 1
if ans is not False:
ans = min(ans, left + right)
else:
ans = left + right
print(ans)
| 14 | 16 | 307 | 310 | N = int(eval(input()))
S = eval(input())
left = 0
right = S.count("E")
ans = False
for i in range(N):
if i > 0:
left += 1 if S[i - 1] == "W" else 0
right -= 1 if S[i] == "E" else 0
if ans is not False:
ans = min(ans, left + right)
else:
ans = left + right
print(ans)
| N = int(eval(input()))
S = eval(input())
left = 0
right = S.count("E")
ans = False
for i in range(N):
if i > 0 and S[i - 1] == "W":
left += 1
if S[i] == "E":
right -= 1
if ans is not False:
ans = min(ans, left + right)
else:
ans = left + right
print(ans)
| false | 12.5 | [
"- if i > 0:",
"- left += 1 if S[i - 1] == \"W\" else 0",
"- right -= 1 if S[i] == \"E\" else 0",
"+ if i > 0 and S[i - 1] == \"W\":",
"+ left += 1",
"+ if S[i] == \"E\":",
"+ right -= 1"
] | false | 0.047948 | 0.047324 | 1.013187 | [
"s586477832",
"s370138807"
] |
u396495667 | p03795 | python | s684432096 | s037386437 | 177 | 17 | 38,256 | 2,940 | Accepted | Accepted | 90.4 | x = int(eval(input()))
ans =( 800*x) - ((x//15)*200)
print( ans) | n = int(eval(input()))
x = n*800
y = 200*(n//15)
print((x-y))
| 5 | 4 | 64 | 57 | x = int(eval(input()))
ans = (800 * x) - ((x // 15) * 200)
print(ans)
| n = int(eval(input()))
x = n * 800
y = 200 * (n // 15)
print((x - y))
| false | 20 | [
"-x = int(eval(input()))",
"-ans = (800 * x) - ((x // 15) * 200)",
"-print(ans)",
"+n = int(eval(input()))",
"+x = n * 800",
"+y = 200 * (n // 15)",
"+print((x - y))"
] | false | 0.116459 | 0.0443 | 2.628883 | [
"s684432096",
"s037386437"
] |
u977389981 | p03435 | python | s592864763 | s160565554 | 19 | 17 | 3,064 | 3,064 | Accepted | Accepted | 10.53 | A = [[int(i) for i in input().split()] for i in range(3)]
diff1 = []
diff2 = []
for i in range(3):
diff1.append(A[0][i] - A[1][i])
for i in range(3):
diff2.append(A[1][i] - A[2][i])
if len(set(diff1)) == 1 and len(set(diff2)) == 1:
print('Yes')
else:
print('No') | A = [[int(i) for i in input().split()] for i in range(3)]
ans = 'Yes'
for i in range(2):
if A[i][0] - A[i + 1][0] != A[i][1] - A[i + 1][1]:
ans = 'No'
break
if A[i][1] - A[i + 1][1] != A[i][2] - A[i + 1][2]:
ans = 'No'
break
print(ans) | 14 | 12 | 302 | 296 | A = [[int(i) for i in input().split()] for i in range(3)]
diff1 = []
diff2 = []
for i in range(3):
diff1.append(A[0][i] - A[1][i])
for i in range(3):
diff2.append(A[1][i] - A[2][i])
if len(set(diff1)) == 1 and len(set(diff2)) == 1:
print("Yes")
else:
print("No")
| A = [[int(i) for i in input().split()] for i in range(3)]
ans = "Yes"
for i in range(2):
if A[i][0] - A[i + 1][0] != A[i][1] - A[i + 1][1]:
ans = "No"
break
if A[i][1] - A[i + 1][1] != A[i][2] - A[i + 1][2]:
ans = "No"
break
print(ans)
| false | 14.285714 | [
"-diff1 = []",
"-diff2 = []",
"-for i in range(3):",
"- diff1.append(A[0][i] - A[1][i])",
"-for i in range(3):",
"- diff2.append(A[1][i] - A[2][i])",
"-if len(set(diff1)) == 1 and len(set(diff2)) == 1:",
"- print(\"Yes\")",
"-else:",
"- print(\"No\")",
"+ans = \"Yes\"",
"+for i in range(2):",
"+ if A[i][0] - A[i + 1][0] != A[i][1] - A[i + 1][1]:",
"+ ans = \"No\"",
"+ break",
"+ if A[i][1] - A[i + 1][1] != A[i][2] - A[i + 1][2]:",
"+ ans = \"No\"",
"+ break",
"+print(ans)"
] | false | 0.042583 | 0.040687 | 1.046606 | [
"s592864763",
"s160565554"
] |
u163703551 | p03805 | python | s886238333 | s899339739 | 36 | 30 | 3,188 | 3,188 | Accepted | Accepted | 16.67 | import itertools
s = eval(input())
l = s.split()
N = int(l[0])
M = int(l[1])
a = list()
b = list()
edges = set()
for i in range(1, M + 1):
s = eval(input())
l = s.split()
u = int(l[0])
v = int(l[1])
a.append(u)
b.append(v)
edges.add((u, v))
edges.add((v, u))
#print(edges)
t = list(range(1, N + 1))
res = 0
for p in itertools.permutations(t):
if p[0] != 1:
break
c = 0
for j in range(0, N - 1):
if (p[j], p[j + 1]) in edges:
c += 1
if c == N - 1:
res += 1
print(res) | import itertools
import sys
# sys.stdin = open('c1.in')
def read_int_list():
return list(map(int, input().split()))
def read_str_list():
return input().split()
def read_int():
return int(eval(input()))
def read_str():
return eval(input())
N, M = read_int_list()
a = list()
b = list()
edges = set()
for i in range(1, M + 1):
s = eval(input())
l = s.split()
u = int(l[0])
v = int(l[1])
a.append(u)
b.append(v)
edges.add((u, v))
edges.add((v, u))
# print(edges)
t = list(range(1, N + 1))
res = 0
for p in itertools.permutations(t):
if p[0] != 1:
break
c = 0
for j in range(0, N - 1):
if (p[j], p[j + 1]) in edges:
c += 1
if c == N - 1:
res += 1
print(res)
| 33 | 49 | 567 | 789 | import itertools
s = eval(input())
l = s.split()
N = int(l[0])
M = int(l[1])
a = list()
b = list()
edges = set()
for i in range(1, M + 1):
s = eval(input())
l = s.split()
u = int(l[0])
v = int(l[1])
a.append(u)
b.append(v)
edges.add((u, v))
edges.add((v, u))
# print(edges)
t = list(range(1, N + 1))
res = 0
for p in itertools.permutations(t):
if p[0] != 1:
break
c = 0
for j in range(0, N - 1):
if (p[j], p[j + 1]) in edges:
c += 1
if c == N - 1:
res += 1
print(res)
| import itertools
import sys
# sys.stdin = open('c1.in')
def read_int_list():
return list(map(int, input().split()))
def read_str_list():
return input().split()
def read_int():
return int(eval(input()))
def read_str():
return eval(input())
N, M = read_int_list()
a = list()
b = list()
edges = set()
for i in range(1, M + 1):
s = eval(input())
l = s.split()
u = int(l[0])
v = int(l[1])
a.append(u)
b.append(v)
edges.add((u, v))
edges.add((v, u))
# print(edges)
t = list(range(1, N + 1))
res = 0
for p in itertools.permutations(t):
if p[0] != 1:
break
c = 0
for j in range(0, N - 1):
if (p[j], p[j + 1]) in edges:
c += 1
if c == N - 1:
res += 1
print(res)
| false | 32.653061 | [
"+import sys",
"-s = eval(input())",
"-l = s.split()",
"-N = int(l[0])",
"-M = int(l[1])",
"+# sys.stdin = open('c1.in')",
"+def read_int_list():",
"+ return list(map(int, input().split()))",
"+",
"+",
"+def read_str_list():",
"+ return input().split()",
"+",
"+",
"+def read_int():",
"+ return int(eval(input()))",
"+",
"+",
"+def read_str():",
"+ return eval(input())",
"+",
"+",
"+N, M = read_int_list()"
] | false | 0.04707 | 0.048 | 0.980642 | [
"s886238333",
"s899339739"
] |
u796942881 | p03548 | python | s011342750 | s100042420 | 35 | 31 | 2,940 | 2,940 | Accepted | Accepted | 11.43 | X, Y, Z = list(map(int, input().split()))
num = 0
for i in range(1, 100000):
if X < i * Y + (i - 1) * Z + 2 * Z:
break
num = i
print(num)
| X, Y, Z = list(map(int, input().split()))
for i in range(1, 100000):
if X < i * Y + (i - 1) * Z + 2 * Z:
break
print((i - 1))
| 10 | 7 | 160 | 138 | X, Y, Z = list(map(int, input().split()))
num = 0
for i in range(1, 100000):
if X < i * Y + (i - 1) * Z + 2 * Z:
break
num = i
print(num)
| X, Y, Z = list(map(int, input().split()))
for i in range(1, 100000):
if X < i * Y + (i - 1) * Z + 2 * Z:
break
print((i - 1))
| false | 30 | [
"-num = 0",
"- num = i",
"-print(num)",
"+print((i - 1))"
] | false | 0.039502 | 0.051731 | 0.763602 | [
"s011342750",
"s100042420"
] |
u888092736 | p03854 | python | s156564943 | s440550507 | 80 | 19 | 3,188 | 3,188 | Accepted | Accepted | 76.25 | S = input()
words = ("dream", "dreamer", "erase", "eraser")
for _ in range((len(S) + 4) // 5):
for word in words:
if S.endswith(word):
S = S[: -len(word)]
print("NO") if S else print("YES")
| S = input()
for w in ("eraser", "erase", "dreamer", "dream"):
S = S.replace(w, "")
print("NO") if S else print("YES")
| 8 | 4 | 222 | 125 | S = input()
words = ("dream", "dreamer", "erase", "eraser")
for _ in range((len(S) + 4) // 5):
for word in words:
if S.endswith(word):
S = S[: -len(word)]
print("NO") if S else print("YES")
| S = input()
for w in ("eraser", "erase", "dreamer", "dream"):
S = S.replace(w, "")
print("NO") if S else print("YES")
| false | 50 | [
"-words = (\"dream\", \"dreamer\", \"erase\", \"eraser\")",
"-for _ in range((len(S) + 4) // 5):",
"- for word in words:",
"- if S.endswith(word):",
"- S = S[: -len(word)]",
"+for w in (\"eraser\", \"erase\", \"dreamer\", \"dream\"):",
"+ S = S.replace(w, \"\")"
] | false | 0.069426 | 0.037535 | 1.849639 | [
"s156564943",
"s440550507"
] |
u140963344 | p03373 | python | s149998939 | s047837268 | 21 | 17 | 3,316 | 3,064 | Accepted | Accepted | 19.05 | a, b, c, x, y = list(map(int, input().split()))
res = 0
if a+b > c*2:
mi = min(x, y)
res += c*2 * mi
x -= mi
y -= mi
res += x * min(a, c*2)
res += y * min(b, c*2)
print(res)
| a, b, c, x, y=list(map(int, input().split()))
m=2*x*c
n=c*y*2+a*(x-y)
d=2*y*c
e=c*x*2+b*(y-x)
f=a*x+b*y
g=min(m,n,f)
h=min(d,e,f)
if x>=y:
print(g)
else:
print(h)
| 10 | 12 | 193 | 176 | a, b, c, x, y = list(map(int, input().split()))
res = 0
if a + b > c * 2:
mi = min(x, y)
res += c * 2 * mi
x -= mi
y -= mi
res += x * min(a, c * 2)
res += y * min(b, c * 2)
print(res)
| a, b, c, x, y = list(map(int, input().split()))
m = 2 * x * c
n = c * y * 2 + a * (x - y)
d = 2 * y * c
e = c * x * 2 + b * (y - x)
f = a * x + b * y
g = min(m, n, f)
h = min(d, e, f)
if x >= y:
print(g)
else:
print(h)
| false | 16.666667 | [
"-res = 0",
"-if a + b > c * 2:",
"- mi = min(x, y)",
"- res += c * 2 * mi",
"- x -= mi",
"- y -= mi",
"-res += x * min(a, c * 2)",
"-res += y * min(b, c * 2)",
"-print(res)",
"+m = 2 * x * c",
"+n = c * y * 2 + a * (x - y)",
"+d = 2 * y * c",
"+e = c * x * 2 + b * (y - x)",
"+f = a * x + b * y",
"+g = min(m, n, f)",
"+h = min(d, e, f)",
"+if x >= y:",
"+ print(g)",
"+else:",
"+ print(h)"
] | false | 0.127677 | 0.115899 | 1.101627 | [
"s149998939",
"s047837268"
] |
u350248178 | p02683 | python | s973103460 | s843326950 | 340 | 147 | 27,304 | 27,184 | Accepted | Accepted | 56.76 | n,m,x=[int(j) for j in input().split()]
l=[]
import numpy as np
for i in range(n):
tmp=[int(j) for j in input().split()]
l.append((tmp[0],np.array(tmp[1:])))
ans=10**18
for i in range(1<<n):
tl=np.array([0]*m)
tc=0
for j in range(n):
if i>>j&1:
c,ll=l[j]
tc+=c
tl+=ll
if len(tl[tl>=x])==m:
ans=min(ans,tc)
if ans!=10**18:
print(ans)
else:
print((-1)) | n,m,x=[int(j) for j in input().split()]
l=[]
import numpy as np
for i in range(n):
tmp=[int(j) for j in input().split()]
l.append((tmp[0],np.array(tmp[1:])))
ans=10**18
import itertools
for i in itertools.product(list(range(2)),repeat=n):
tl=np.array([0]*m)
tc=0
for idx,j in enumerate(i):
if j==1:
c,ll=l[idx]
tc+=c
tl+=ll
if len(tl[tl>=x])==m:
ans=min(ans,tc)
if ans!=10**18:
print(ans)
else:
print((-1)) | 22 | 23 | 454 | 505 | n, m, x = [int(j) for j in input().split()]
l = []
import numpy as np
for i in range(n):
tmp = [int(j) for j in input().split()]
l.append((tmp[0], np.array(tmp[1:])))
ans = 10**18
for i in range(1 << n):
tl = np.array([0] * m)
tc = 0
for j in range(n):
if i >> j & 1:
c, ll = l[j]
tc += c
tl += ll
if len(tl[tl >= x]) == m:
ans = min(ans, tc)
if ans != 10**18:
print(ans)
else:
print((-1))
| n, m, x = [int(j) for j in input().split()]
l = []
import numpy as np
for i in range(n):
tmp = [int(j) for j in input().split()]
l.append((tmp[0], np.array(tmp[1:])))
ans = 10**18
import itertools
for i in itertools.product(list(range(2)), repeat=n):
tl = np.array([0] * m)
tc = 0
for idx, j in enumerate(i):
if j == 1:
c, ll = l[idx]
tc += c
tl += ll
if len(tl[tl >= x]) == m:
ans = min(ans, tc)
if ans != 10**18:
print(ans)
else:
print((-1))
| false | 4.347826 | [
"-for i in range(1 << n):",
"+import itertools",
"+",
"+for i in itertools.product(list(range(2)), repeat=n):",
"- for j in range(n):",
"- if i >> j & 1:",
"- c, ll = l[j]",
"+ for idx, j in enumerate(i):",
"+ if j == 1:",
"+ c, ll = l[idx]"
] | false | 0.462071 | 0.174942 | 2.641279 | [
"s973103460",
"s843326950"
] |
u434296044 | p02690 | python | s855284859 | s654367780 | 40 | 36 | 9,176 | 9,052 | Accepted | Accepted | 10 | import itertools
X=int(eval(input()))
for A,B in itertools.product(list(range(150)),list(range(-150,150))):
if (A**5-B**5==X):
print((A, B))
break
| x=int(eval(input()))
for i in range(1,120):
for j in range(-120,120):
if ((i**5)-(j**5))==x:
print((i, j))
exit()
| 7 | 7 | 154 | 149 | import itertools
X = int(eval(input()))
for A, B in itertools.product(list(range(150)), list(range(-150, 150))):
if A**5 - B**5 == X:
print((A, B))
break
| x = int(eval(input()))
for i in range(1, 120):
for j in range(-120, 120):
if ((i**5) - (j**5)) == x:
print((i, j))
exit()
| false | 0 | [
"-import itertools",
"-",
"-X = int(eval(input()))",
"-for A, B in itertools.product(list(range(150)), list(range(-150, 150))):",
"- if A**5 - B**5 == X:",
"- print((A, B))",
"- break",
"+x = int(eval(input()))",
"+for i in range(1, 120):",
"+ for j in range(-120, 120):",
"+ if ((i**5) - (j**5)) == x:",
"+ print((i, j))",
"+ exit()"
] | false | 0.042862 | 0.040105 | 1.068756 | [
"s855284859",
"s654367780"
] |
u879870653 | p03807 | python | s627362113 | s644045392 | 67 | 57 | 14,112 | 14,108 | Accepted | Accepted | 14.93 | N = int(eval(input()))
L = list(map(int,input().split()))
A = []
B = []
for i in range(N) :
if L[i] % 2 == 0 :
A.append(L[i])
else :
B.append(L[i])
if len(B) % 2 == 0 :
print("YES")
else :
print("NO")
| N = int(eval(input()))
A = list(map(int,input().split()))
even = odd = 0
for a in A :
if a % 2 :
odd += 1
else :
even += 1
print(("YES" if odd % 2 == 0 else "NO")) | 14 | 9 | 244 | 187 | N = int(eval(input()))
L = list(map(int, input().split()))
A = []
B = []
for i in range(N):
if L[i] % 2 == 0:
A.append(L[i])
else:
B.append(L[i])
if len(B) % 2 == 0:
print("YES")
else:
print("NO")
| N = int(eval(input()))
A = list(map(int, input().split()))
even = odd = 0
for a in A:
if a % 2:
odd += 1
else:
even += 1
print(("YES" if odd % 2 == 0 else "NO"))
| false | 35.714286 | [
"-L = list(map(int, input().split()))",
"-A = []",
"-B = []",
"-for i in range(N):",
"- if L[i] % 2 == 0:",
"- A.append(L[i])",
"+A = list(map(int, input().split()))",
"+even = odd = 0",
"+for a in A:",
"+ if a % 2:",
"+ odd += 1",
"- B.append(L[i])",
"-if len(B) % 2 == 0:",
"- print(\"YES\")",
"-else:",
"- print(\"NO\")",
"+ even += 1",
"+print((\"YES\" if odd % 2 == 0 else \"NO\"))"
] | false | 0.07315 | 0.072099 | 1.014572 | [
"s627362113",
"s644045392"
] |
u664796535 | p03353 | python | s392219375 | s751648696 | 1,763 | 36 | 4,072 | 5,068 | Accepted | Accepted | 97.96 | s = eval(input())
k = int(eval(input()))
ss = []
for i in range(len(s)):
for j in range(i+1, i+k+1):
if s[i:j] not in ss:
ss.append(s[i:j])
ss = sorted(ss)
print((ss[k-1])) |
s = eval(input())
k = int(eval(input()))
ss = []
for i in range(len(s)):
for j in range(i+1, i+k+1):
ss.append(s[i:j])
ss = sorted(list(set(ss)))
print((ss[k-1])) | 10 | 10 | 192 | 171 | s = eval(input())
k = int(eval(input()))
ss = []
for i in range(len(s)):
for j in range(i + 1, i + k + 1):
if s[i:j] not in ss:
ss.append(s[i:j])
ss = sorted(ss)
print((ss[k - 1]))
| s = eval(input())
k = int(eval(input()))
ss = []
for i in range(len(s)):
for j in range(i + 1, i + k + 1):
ss.append(s[i:j])
ss = sorted(list(set(ss)))
print((ss[k - 1]))
| false | 0 | [
"- if s[i:j] not in ss:",
"- ss.append(s[i:j])",
"-ss = sorted(ss)",
"+ ss.append(s[i:j])",
"+ss = sorted(list(set(ss)))"
] | false | 0.117426 | 0.040731 | 2.882997 | [
"s392219375",
"s751648696"
] |
u688488162 | p02392 | python | s888934041 | s169351002 | 60 | 20 | 7,612 | 5,588 | Accepted | Accepted | 66.67 | a,b,c = list(map(int,input().split()))
if(a<b and b<c):
print("Yes")
else:
print("No") | a,b,c = [int(i) for i in input().split()]
if a < b and b < c:
print("Yes")
else:
print("No")
| 6 | 6 | 94 | 107 | a, b, c = list(map(int, input().split()))
if a < b and b < c:
print("Yes")
else:
print("No")
| a, b, c = [int(i) for i in input().split()]
if a < b and b < c:
print("Yes")
else:
print("No")
| false | 0 | [
"-a, b, c = list(map(int, input().split()))",
"+a, b, c = [int(i) for i in input().split()]"
] | false | 0.037102 | 0.03664 | 1.0126 | [
"s888934041",
"s169351002"
] |
u127499732 | p03274 | python | s130867223 | s679916343 | 66 | 59 | 14,052 | 14,052 | Accepted | Accepted | 10.61 | def main():
n, k, *x = list(map(int, open(0).read().split()))
d = 2 * 10 ** 9
for i, j in zip(x, x[k - 1:]):
d = min(d, j - i + min(abs(i), abs(j)))
print(d)
if __name__ == '__main__':
main()
| def main():
n, k, *x = list(map(int, open(0).read().split()))
l = x[k - 1] - x[0] + min(abs(x[k - 1]), abs(x[0]))
for i, j in zip(x, x[k - 1:]):
y = j - i + min(abs(i), abs(j))
if y - l < 0:
l = y
print(l)
if __name__ == '__main__':
main()
| 10 | 14 | 225 | 299 | def main():
n, k, *x = list(map(int, open(0).read().split()))
d = 2 * 10**9
for i, j in zip(x, x[k - 1 :]):
d = min(d, j - i + min(abs(i), abs(j)))
print(d)
if __name__ == "__main__":
main()
| def main():
n, k, *x = list(map(int, open(0).read().split()))
l = x[k - 1] - x[0] + min(abs(x[k - 1]), abs(x[0]))
for i, j in zip(x, x[k - 1 :]):
y = j - i + min(abs(i), abs(j))
if y - l < 0:
l = y
print(l)
if __name__ == "__main__":
main()
| false | 28.571429 | [
"- d = 2 * 10**9",
"+ l = x[k - 1] - x[0] + min(abs(x[k - 1]), abs(x[0]))",
"- d = min(d, j - i + min(abs(i), abs(j)))",
"- print(d)",
"+ y = j - i + min(abs(i), abs(j))",
"+ if y - l < 0:",
"+ l = y",
"+ print(l)"
] | false | 0.061247 | 0.043484 | 1.408481 | [
"s130867223",
"s679916343"
] |
u077291787 | p03673 | python | s708700793 | s348655975 | 141 | 48 | 24,412 | 26,076 | Accepted | Accepted | 65.96 | # ABC066C - pushpush (ARC077)
from collections import deque
def main():
N, *A = open(0).read().split()
B, x = deque(), int(N) & 1
for i, a in enumerate(A, start=x):
if i & 1:
B.appendleft(a)
else:
B.append(a)
print((*B))
if __name__ == "__main__":
main() | # ABC066C - pushpush (ARC077)
def main():
N, *A = open(0).read().split()
if int(N) & 1:
B = A[::2][::-1] + A[1::2]
else:
B = A[1::2][::-1] + A[::2]
print((" ".join(B)))
if __name__ == "__main__":
main() | 17 | 12 | 332 | 249 | # ABC066C - pushpush (ARC077)
from collections import deque
def main():
N, *A = open(0).read().split()
B, x = deque(), int(N) & 1
for i, a in enumerate(A, start=x):
if i & 1:
B.appendleft(a)
else:
B.append(a)
print((*B))
if __name__ == "__main__":
main()
| # ABC066C - pushpush (ARC077)
def main():
N, *A = open(0).read().split()
if int(N) & 1:
B = A[::2][::-1] + A[1::2]
else:
B = A[1::2][::-1] + A[::2]
print((" ".join(B)))
if __name__ == "__main__":
main()
| false | 29.411765 | [
"-from collections import deque",
"-",
"-",
"- B, x = deque(), int(N) & 1",
"- for i, a in enumerate(A, start=x):",
"- if i & 1:",
"- B.appendleft(a)",
"- else:",
"- B.append(a)",
"- print((*B))",
"+ if int(N) & 1:",
"+ B = A[::2][::-1] + A[1::2]",
"+ else:",
"+ B = A[1::2][::-1] + A[::2]",
"+ print((\" \".join(B)))"
] | false | 0.033131 | 0.075453 | 0.439093 | [
"s708700793",
"s348655975"
] |
u277314812 | p02700 | python | s356115613 | s492919409 | 22 | 19 | 9,164 | 9,132 | Accepted | Accepted | 13.64 | t_hp, t_atk, a_hp, a_atk = list(map(int, input().split()))
t_life_span = -(-t_hp//a_atk)
a_life_span = -(-a_hp//t_atk)
#print(t_life_span,a_life_span)
print(("Yes" if t_life_span >= a_life_span else "No")) | taka_f,taka_p,aoki_f,aoki_p = list(map(int,input().split()))
taka_life_span = -(-taka_f//aoki_p)
aoki_life_span = -(-aoki_f//taka_p)
print(("Yes" if taka_life_span >= aoki_life_span else "No")) | 5 | 4 | 201 | 188 | t_hp, t_atk, a_hp, a_atk = list(map(int, input().split()))
t_life_span = -(-t_hp // a_atk)
a_life_span = -(-a_hp // t_atk)
# print(t_life_span,a_life_span)
print(("Yes" if t_life_span >= a_life_span else "No"))
| taka_f, taka_p, aoki_f, aoki_p = list(map(int, input().split()))
taka_life_span = -(-taka_f // aoki_p)
aoki_life_span = -(-aoki_f // taka_p)
print(("Yes" if taka_life_span >= aoki_life_span else "No"))
| false | 20 | [
"-t_hp, t_atk, a_hp, a_atk = list(map(int, input().split()))",
"-t_life_span = -(-t_hp // a_atk)",
"-a_life_span = -(-a_hp // t_atk)",
"-# print(t_life_span,a_life_span)",
"-print((\"Yes\" if t_life_span >= a_life_span else \"No\"))",
"+taka_f, taka_p, aoki_f, aoki_p = list(map(int, input().split()))",
"+taka_life_span = -(-taka_f // aoki_p)",
"+aoki_life_span = -(-aoki_f // taka_p)",
"+print((\"Yes\" if taka_life_span >= aoki_life_span else \"No\"))"
] | false | 0.045954 | 0.036122 | 1.272195 | [
"s356115613",
"s492919409"
] |
u994988729 | p02953 | python | s944568556 | s080721847 | 92 | 75 | 14,396 | 15,020 | Accepted | Accepted | 18.48 | N = int(eval(input()))
A = list(map(int, input().split()))
A = [-10 ** 18] + A
ans = "Yes"
for i in range(N):
if A[i] == A[i + 1]:
continue
elif A[i] + 1 <= A[i + 1]:
A[i + 1] -= 1
else:
ans = "No"
break
print(ans)
| N = int(eval(input()))
A = [0]+list(map(int, input().split()))
l = -1
ans = "Yes"
for i in range(1, N+1):
if A[i] > A[i-1]:
A[i] -= 1
elif A[i] == A[i-1]:
continue
else:
ans = "No"
print(ans) | 16 | 13 | 271 | 234 | N = int(eval(input()))
A = list(map(int, input().split()))
A = [-(10**18)] + A
ans = "Yes"
for i in range(N):
if A[i] == A[i + 1]:
continue
elif A[i] + 1 <= A[i + 1]:
A[i + 1] -= 1
else:
ans = "No"
break
print(ans)
| N = int(eval(input()))
A = [0] + list(map(int, input().split()))
l = -1
ans = "Yes"
for i in range(1, N + 1):
if A[i] > A[i - 1]:
A[i] -= 1
elif A[i] == A[i - 1]:
continue
else:
ans = "No"
print(ans)
| false | 18.75 | [
"-A = list(map(int, input().split()))",
"-A = [-(10**18)] + A",
"+A = [0] + list(map(int, input().split()))",
"+l = -1",
"-for i in range(N):",
"- if A[i] == A[i + 1]:",
"+for i in range(1, N + 1):",
"+ if A[i] > A[i - 1]:",
"+ A[i] -= 1",
"+ elif A[i] == A[i - 1]:",
"- elif A[i] + 1 <= A[i + 1]:",
"- A[i + 1] -= 1",
"- break"
] | false | 0.047537 | 0.045536 | 1.043934 | [
"s944568556",
"s080721847"
] |
u600402037 | p03722 | python | s580521209 | s762029017 | 573 | 196 | 3,316 | 14,968 | Accepted | Accepted | 65.79 | import sys
INF = float('inf')
def Bellmanford(n, edges, r): #r: 始点
d = [INF] * n
d[r] = 0
for i in range(n):
for (u, v, c) in edges:
if d[u] != INF and d[u] + c < d[v]:
d[v] = d[u] + c
if i == n-1 and v == n-1:
return 'inf'
return -d[n-1]
N, M = list(map(int, sys.stdin.readline().split()))
Edges = [None] * M
for i in range(M):
ai, bi, ci = list(map(int, sys.stdin.readline().split()))
Edges[i] = (ai-1, bi-1, -ci)
ans = Bellmanford(N, Edges, 0)
print(ans) | import sys
sys.setrecursionlimit(10 ** 9)
import numpy as np
from heapq import heappush, heappop
N, M, = list(map(int, input().split()))
graph = [[] for _ in range(N+1)] # graph[0]は使わない
for _ in range(M):
a, b, c = list(map(int, input().split()))
graph[a].append((b, c))
def dijkstra(start, c):
INF = float('inf')
dist = [-INF] * (N+1) # dist[0]は使わない
dist[start] = 0
que = [(start, 0, c)]
while que:
place, score, count = heappop(que) # placeは現在地
if score < dist[place] or count > 3000: # 前来た時より点数が悪いか、無限ループしている場合continue
continue
for next_node, weight in graph[place]:
score2 = score + weight
if next_node == N and count > 1000: # いくらでも大きくなる場合
print('inf')
exit()
if dist[next_node] < score2: # 点数が良くなるなら、データを更新
dist[next_node] = score2
heappush(que, (next_node, score2, count+1))
return dist
d1 = np.array(dijkstra(1, 0))
print((int(d1[N])))
| 28 | 34 | 593 | 1,036 | import sys
INF = float("inf")
def Bellmanford(n, edges, r): # r: 始点
d = [INF] * n
d[r] = 0
for i in range(n):
for (u, v, c) in edges:
if d[u] != INF and d[u] + c < d[v]:
d[v] = d[u] + c
if i == n - 1 and v == n - 1:
return "inf"
return -d[n - 1]
N, M = list(map(int, sys.stdin.readline().split()))
Edges = [None] * M
for i in range(M):
ai, bi, ci = list(map(int, sys.stdin.readline().split()))
Edges[i] = (ai - 1, bi - 1, -ci)
ans = Bellmanford(N, Edges, 0)
print(ans)
| import sys
sys.setrecursionlimit(10**9)
import numpy as np
from heapq import heappush, heappop
(
N,
M,
) = list(map(int, input().split()))
graph = [[] for _ in range(N + 1)] # graph[0]は使わない
for _ in range(M):
a, b, c = list(map(int, input().split()))
graph[a].append((b, c))
def dijkstra(start, c):
INF = float("inf")
dist = [-INF] * (N + 1) # dist[0]は使わない
dist[start] = 0
que = [(start, 0, c)]
while que:
place, score, count = heappop(que) # placeは現在地
if score < dist[place] or count > 3000: # 前来た時より点数が悪いか、無限ループしている場合continue
continue
for next_node, weight in graph[place]:
score2 = score + weight
if next_node == N and count > 1000: # いくらでも大きくなる場合
print("inf")
exit()
if dist[next_node] < score2: # 点数が良くなるなら、データを更新
dist[next_node] = score2
heappush(que, (next_node, score2, count + 1))
return dist
d1 = np.array(dijkstra(1, 0))
print((int(d1[N])))
| false | 17.647059 | [
"-INF = float(\"inf\")",
"+sys.setrecursionlimit(10**9)",
"+import numpy as np",
"+from heapq import heappush, heappop",
"+",
"+(",
"+ N,",
"+ M,",
"+) = list(map(int, input().split()))",
"+graph = [[] for _ in range(N + 1)] # graph[0]は使わない",
"+for _ in range(M):",
"+ a, b, c = list(map(int, input().split()))",
"+ graph[a].append((b, c))",
"-def Bellmanford(n, edges, r): # r: 始点",
"- d = [INF] * n",
"- d[r] = 0",
"- for i in range(n):",
"- for (u, v, c) in edges:",
"- if d[u] != INF and d[u] + c < d[v]:",
"- d[v] = d[u] + c",
"- if i == n - 1 and v == n - 1:",
"- return \"inf\"",
"- return -d[n - 1]",
"+def dijkstra(start, c):",
"+ INF = float(\"inf\")",
"+ dist = [-INF] * (N + 1) # dist[0]は使わない",
"+ dist[start] = 0",
"+ que = [(start, 0, c)]",
"+ while que:",
"+ place, score, count = heappop(que) # placeは現在地",
"+ if score < dist[place] or count > 3000: # 前来た時より点数が悪いか、無限ループしている場合continue",
"+ continue",
"+ for next_node, weight in graph[place]:",
"+ score2 = score + weight",
"+ if next_node == N and count > 1000: # いくらでも大きくなる場合",
"+ print(\"inf\")",
"+ exit()",
"+ if dist[next_node] < score2: # 点数が良くなるなら、データを更新",
"+ dist[next_node] = score2",
"+ heappush(que, (next_node, score2, count + 1))",
"+ return dist",
"-N, M = list(map(int, sys.stdin.readline().split()))",
"-Edges = [None] * M",
"-for i in range(M):",
"- ai, bi, ci = list(map(int, sys.stdin.readline().split()))",
"- Edges[i] = (ai - 1, bi - 1, -ci)",
"-ans = Bellmanford(N, Edges, 0)",
"-print(ans)",
"+d1 = np.array(dijkstra(1, 0))",
"+print((int(d1[N])))"
] | false | 0.085556 | 0.233584 | 0.366273 | [
"s580521209",
"s762029017"
] |
u997641430 | p02550 | python | s853360078 | s351813321 | 145 | 82 | 16,448 | 13,644 | Accepted | Accepted | 43.45 | n, x, m = list(map(int, input().split()))
a = x
S = [0] * (m + 1)
F = [None] * m
F[x] = 0
i0, j0 = None, None
for i in range(1, m + 1):
S[i] = S[i - 1] + a
a = pow(a, 2, m)
if F[a] is not None:
i0, j0 = F[a], i
F[a] = i
q, r = (n - i0) // (j0 - i0), (n - i0) % (j0 - i0)
print(((S[j0] - S[i0]) * q + S[i0 + r]))
| n, x, m = list(map(int, input().split()))
S = [0]
F = [None] * m
for i in range(m + 1):
S.append(S[-1] + x)
if F[x] is not None:
j = F[x]
q, r = (n - j) // (i - j), (n - j) % (i - j)
print(((S[i] - S[j]) * q + S[j + r]))
exit()
F[x] = i
x = pow(x, 2, m)
print((0))
| 14 | 13 | 341 | 315 | n, x, m = list(map(int, input().split()))
a = x
S = [0] * (m + 1)
F = [None] * m
F[x] = 0
i0, j0 = None, None
for i in range(1, m + 1):
S[i] = S[i - 1] + a
a = pow(a, 2, m)
if F[a] is not None:
i0, j0 = F[a], i
F[a] = i
q, r = (n - i0) // (j0 - i0), (n - i0) % (j0 - i0)
print(((S[j0] - S[i0]) * q + S[i0 + r]))
| n, x, m = list(map(int, input().split()))
S = [0]
F = [None] * m
for i in range(m + 1):
S.append(S[-1] + x)
if F[x] is not None:
j = F[x]
q, r = (n - j) // (i - j), (n - j) % (i - j)
print(((S[i] - S[j]) * q + S[j + r]))
exit()
F[x] = i
x = pow(x, 2, m)
print((0))
| false | 7.142857 | [
"-a = x",
"-S = [0] * (m + 1)",
"+S = [0]",
"-F[x] = 0",
"-i0, j0 = None, None",
"-for i in range(1, m + 1):",
"- S[i] = S[i - 1] + a",
"- a = pow(a, 2, m)",
"- if F[a] is not None:",
"- i0, j0 = F[a], i",
"- F[a] = i",
"-q, r = (n - i0) // (j0 - i0), (n - i0) % (j0 - i0)",
"-print(((S[j0] - S[i0]) * q + S[i0 + r]))",
"+for i in range(m + 1):",
"+ S.append(S[-1] + x)",
"+ if F[x] is not None:",
"+ j = F[x]",
"+ q, r = (n - j) // (i - j), (n - j) % (i - j)",
"+ print(((S[i] - S[j]) * q + S[j + r]))",
"+ exit()",
"+ F[x] = i",
"+ x = pow(x, 2, m)",
"+print((0))"
] | false | 0.160884 | 0.04334 | 3.712158 | [
"s853360078",
"s351813321"
] |
u806976856 | p03108 | python | s585420967 | s194671643 | 424 | 260 | 28,804 | 96,460 | Accepted | Accepted | 38.68 | n,m=list(map(int,input().split()))
ab=[[0,0] for i in range(m)]
for i in range(m):
ab[i][0],ab[i][1]=list(map(int,input().split()))
import sys
sys.setrecursionlimit(10**9) #再帰の上限をあげる
root=[-1 for i in range(n+1)] #自分が親なら自身の番号を、そうでないなら（元）親の番号を示す
def r(x): #親は誰？
if root[x]<0:
return x
else:
root[x]=r(root[x])
return root[x]
ans=n*(n-1)//2
d=[n*(n-1)//2]
for i in range(1,m+1):
a,b=ab[-i][0],ab[-i][1]
a=r(a)
b=r(b)
a,b=min(a,b),max(a,b)
if a!=b:
ans-=root[a]*root[b]
root[a]+=root[b]
root[b]=a
d.append(ans)
for i in range(m):
print((d[-2-i]))
| import sys
input=sys.stdin.readline #文字列入力はするな！！
n,m=list(map(int,input().split()))
ab=[[0,0] for i in range(m)]
for i in range(m):
ab[i][0],ab[i][1]=list(map(int,input().split()))
sys.setrecursionlimit(10**9) #再帰の上限をあげる
root=[-1 for i in range(n+1)] #自分が親なら自身の番号を、そうでないなら（元）親の番号を示す
def r(x): #親は誰？
if root[x]<0:
return x
else:
root[x]=r(root[x])
return root[x]
ans=n*(n-1)//2
d=[n*(n-1)//2]
for i in range(1,m+1):
a,b=ab[-i][0],ab[-i][1]
a=r(a)
b=r(b)
a,b=min(a,b),max(a,b)
if a!=b:
ans-=root[a]*root[b]
root[a]+=root[b]
root[b]=a
d.append(ans)
for i in range(m):
print((d[-2-i]))
| 32 | 37 | 656 | 703 | n, m = list(map(int, input().split()))
ab = [[0, 0] for i in range(m)]
for i in range(m):
ab[i][0], ab[i][1] = list(map(int, input().split()))
import sys
sys.setrecursionlimit(10**9) # 再帰の上限をあげる
root = [-1 for i in range(n + 1)] # 自分が親なら自身の番号を、そうでないなら（元）親の番号を示す
def r(x): # 親は誰？
if root[x] < 0:
return x
else:
root[x] = r(root[x])
return root[x]
ans = n * (n - 1) // 2
d = [n * (n - 1) // 2]
for i in range(1, m + 1):
a, b = ab[-i][0], ab[-i][1]
a = r(a)
b = r(b)
a, b = min(a, b), max(a, b)
if a != b:
ans -= root[a] * root[b]
root[a] += root[b]
root[b] = a
d.append(ans)
for i in range(m):
print((d[-2 - i]))
| import sys
input = sys.stdin.readline # 文字列入力はするな！！
n, m = list(map(int, input().split()))
ab = [[0, 0] for i in range(m)]
for i in range(m):
ab[i][0], ab[i][1] = list(map(int, input().split()))
sys.setrecursionlimit(10**9) # 再帰の上限をあげる
root = [-1 for i in range(n + 1)] # 自分が親なら自身の番号を、そうでないなら（元）親の番号を示す
def r(x): # 親は誰？
if root[x] < 0:
return x
else:
root[x] = r(root[x])
return root[x]
ans = n * (n - 1) // 2
d = [n * (n - 1) // 2]
for i in range(1, m + 1):
a, b = ab[-i][0], ab[-i][1]
a = r(a)
b = r(b)
a, b = min(a, b), max(a, b)
if a != b:
ans -= root[a] * root[b]
root[a] += root[b]
root[b] = a
d.append(ans)
for i in range(m):
print((d[-2 - i]))
| false | 13.513514 | [
"+import sys",
"+",
"+input = sys.stdin.readline # 文字列入力はするな！！",
"-import sys",
"-"
] | false | 0.036812 | 0.036331 | 1.013256 | [
"s585420967",
"s194671643"
] |
u588341295 | p03732 | python | s959606462 | s706349764 | 297 | 183 | 3,316 | 12,332 | Accepted | Accepted | 38.38 | # -*- coding: utf-8 -*-
"""
参考：https://img.atcoder.jp/arc073/editorial.pdf
https://ei1333.hateblo.jp/entry/2017/05/01/004235
https://atcoder.jp/contests/abc060/submissions/3782609
・公式解
・累積和あり
"""
import sys
def input(): return sys.stdin.readline().strip()
sys.setrecursionlimit(10 ** 9)
from collections import defaultdict
N, W = list(map(int, input().split()))
wN = [0] * N
vN = [[] for i in range(4)]
for i in range(N):
w, v = list(map(int, input().split()))
if i == 0:
offset = w
vN[w-offset].append(v)
# 重さ毎のリストを降順ソート
for i in range(4):
# 空リストのままだとこの後ループを回ってくれないので、[0]を追加する
vN[i] = [0] + sorted(vN[i], reverse=True)
# 累積和
for i in range(4):
for j in range(1, len(vN[i])):
vN[i][j] = vN[i][j-1] + vN[i][j]
ans = 0
for i in range(len(vN[0])):
for j in range(len(vN[1])):
for k in range(len(vN[2])):
for l in range(len(vN[3])):
# 重さリミットを超えるパターンは対象外
if offset * i + (offset+1) * j + (offset+2) * k + (offset+3) * l > W:
continue
ans = max(vN[0][i] + vN[1][j] + vN[2][k] + vN[3][l], ans)
print(ans)
| # -*- coding: utf-8 -*-
"""
参考：https://atcoder.jp/contests/abc060/submissions/3958560
・前から普通にDPもdictでやってみる。
"""
import sys
def input(): return sys.stdin.readline().strip()
sys.setrecursionlimit(10 ** 9)
from collections import defaultdict
N, W = list(map(int, input().split()))
wN = [0] * N
vN = [0] * N
for i in range(N):
wN[i], vN[i] = list(map(int, input().split()))
# 重さの添字にはdictを使う
dp = [defaultdict(int) for i in range(N+1)]
dp[0][0] = 0
for i in range(N):
for k, v in list(dp[i].items()):
# 重さの条件がOKなら、今回の値を足したケースを次のステップに送る
if k + wN[i] <= W:
dp[i+1][k+wN[i]] = max(dp[i][k] + vN[i], dp[i+1][k+wN[i]])
# 足さないケースを送る
dp[i+1][k] = max(dp[i][k], dp[i+1][k])
# 最適が重さWを全て使った場合とは限らないのでNステップ目のmaxを取る
print((max(dp[N].values())))
| 45 | 33 | 1,175 | 799 | # -*- coding: utf-8 -*-
"""
参考：https://img.atcoder.jp/arc073/editorial.pdf
https://ei1333.hateblo.jp/entry/2017/05/01/004235
https://atcoder.jp/contests/abc060/submissions/3782609
・公式解
・累積和あり
"""
import sys
def input():
return sys.stdin.readline().strip()
sys.setrecursionlimit(10**9)
from collections import defaultdict
N, W = list(map(int, input().split()))
wN = [0] * N
vN = [[] for i in range(4)]
for i in range(N):
w, v = list(map(int, input().split()))
if i == 0:
offset = w
vN[w - offset].append(v)
# 重さ毎のリストを降順ソート
for i in range(4):
# 空リストのままだとこの後ループを回ってくれないので、[0]を追加する
vN[i] = [0] + sorted(vN[i], reverse=True)
# 累積和
for i in range(4):
for j in range(1, len(vN[i])):
vN[i][j] = vN[i][j - 1] + vN[i][j]
ans = 0
for i in range(len(vN[0])):
for j in range(len(vN[1])):
for k in range(len(vN[2])):
for l in range(len(vN[3])):
# 重さリミットを超えるパターンは対象外
if (
offset * i + (offset + 1) * j + (offset + 2) * k + (offset + 3) * l
> W
):
continue
ans = max(vN[0][i] + vN[1][j] + vN[2][k] + vN[3][l], ans)
print(ans)
| # -*- coding: utf-8 -*-
"""
参考：https://atcoder.jp/contests/abc060/submissions/3958560
・前から普通にDPもdictでやってみる。
"""
import sys
def input():
return sys.stdin.readline().strip()
sys.setrecursionlimit(10**9)
from collections import defaultdict
N, W = list(map(int, input().split()))
wN = [0] * N
vN = [0] * N
for i in range(N):
wN[i], vN[i] = list(map(int, input().split()))
# 重さの添字にはdictを使う
dp = [defaultdict(int) for i in range(N + 1)]
dp[0][0] = 0
for i in range(N):
for k, v in list(dp[i].items()):
# 重さの条件がOKなら、今回の値を足したケースを次のステップに送る
if k + wN[i] <= W:
dp[i + 1][k + wN[i]] = max(dp[i][k] + vN[i], dp[i + 1][k + wN[i]])
# 足さないケースを送る
dp[i + 1][k] = max(dp[i][k], dp[i + 1][k])
# 最適が重さWを全て使った場合とは限らないのでNステップ目のmaxを取る
print((max(dp[N].values())))
| false | 26.666667 | [
"-参考：https://img.atcoder.jp/arc073/editorial.pdf",
"- https://ei1333.hateblo.jp/entry/2017/05/01/004235",
"- https://atcoder.jp/contests/abc060/submissions/3782609",
"-・公式解",
"-・累積和あり",
"+参考：https://atcoder.jp/contests/abc060/submissions/3958560",
"+・前から普通にDPもdictでやってみる。",
"-vN = [[] for i in range(4)]",
"+vN = [0] * N",
"- w, v = list(map(int, input().split()))",
"- if i == 0:",
"- offset = w",
"- vN[w - offset].append(v)",
"-# 重さ毎のリストを降順ソート",
"-for i in range(4):",
"- # 空リストのままだとこの後ループを回ってくれないので、[0]を追加する",
"- vN[i] = [0] + sorted(vN[i], reverse=True)",
"-# 累積和",
"-for i in range(4):",
"- for j in range(1, len(vN[i])):",
"- vN[i][j] = vN[i][j - 1] + vN[i][j]",
"-ans = 0",
"-for i in range(len(vN[0])):",
"- for j in range(len(vN[1])):",
"- for k in range(len(vN[2])):",
"- for l in range(len(vN[3])):",
"- # 重さリミットを超えるパターンは対象外",
"- if (",
"- offset * i + (offset + 1) * j + (offset + 2) * k + (offset + 3) * l",
"- > W",
"- ):",
"- continue",
"- ans = max(vN[0][i] + vN[1][j] + vN[2][k] + vN[3][l], ans)",
"-print(ans)",
"+ wN[i], vN[i] = list(map(int, input().split()))",
"+# 重さの添字にはdictを使う",
"+dp = [defaultdict(int) for i in range(N + 1)]",
"+dp[0][0] = 0",
"+for i in range(N):",
"+ for k, v in list(dp[i].items()):",
"+ # 重さの条件がOKなら、今回の値を足したケースを次のステップに送る",
"+ if k + wN[i] <= W:",
"+ dp[i + 1][k + wN[i]] = max(dp[i][k] + vN[i], dp[i + 1][k + wN[i]])",
"+ # 足さないケースを送る",
"+ dp[i + 1][k] = max(dp[i][k], dp[i + 1][k])",
"+# 最適が重さWを全て使った場合とは限らないのでNステップ目のmaxを取る",
"+print((max(dp[N].values())))"
] | false | 0.171368 | 0.037187 | 4.60832 | [
"s959606462",
"s706349764"
] |
u815878613 | p03037 | python | s312548596 | s043802358 | 251 | 220 | 27,204 | 27,220 | Accepted | Accepted | 12.35 | N, M = list(map(int, input().split()))
LR = [list(map(int, input().split())) for _ in range(M)]
left = 1
right = N
for l, r in LR:
left = max(left, l)
right = min(right, r)
ans = right - left
print((ans + 1 if ans >= 0 else 0))
| N, M = list(map(int, input().split()))
LR = [list(map(int, input().split())) for _ in range(M)]
left = 1
right = N
for l, r in LR:
if left < l:
left = l
if right > r:
right = r
ans = right - left
print((ans + 1 if ans >= 0 else 0))
| 13 | 15 | 244 | 266 | N, M = list(map(int, input().split()))
LR = [list(map(int, input().split())) for _ in range(M)]
left = 1
right = N
for l, r in LR:
left = max(left, l)
right = min(right, r)
ans = right - left
print((ans + 1 if ans >= 0 else 0))
| N, M = list(map(int, input().split()))
LR = [list(map(int, input().split())) for _ in range(M)]
left = 1
right = N
for l, r in LR:
if left < l:
left = l
if right > r:
right = r
ans = right - left
print((ans + 1 if ans >= 0 else 0))
| false | 13.333333 | [
"- left = max(left, l)",
"- right = min(right, r)",
"+ if left < l:",
"+ left = l",
"+ if right > r:",
"+ right = r"
] | false | 0.041863 | 0.045612 | 0.917819 | [
"s312548596",
"s043802358"
] |
u869154953 | p03623 | python | s559042546 | s519712985 | 31 | 27 | 8,900 | 9,016 | Accepted | Accepted | 12.9 | x,a,b=list(map(int,input().split()))
if abs(x-a)<abs(x-b):
print("A")
else:
print("B")
| x,a,b=list(map(int,input().split()))
flg=0
if b<a:
b,a=a,b
flg=1
ans = ["A","B"]
if 2*x<b+a:
print((ans[flg]))
else:
print((ans[-1+flg]))
| 7 | 14 | 91 | 149 | x, a, b = list(map(int, input().split()))
if abs(x - a) < abs(x - b):
print("A")
else:
print("B")
| x, a, b = list(map(int, input().split()))
flg = 0
if b < a:
b, a = a, b
flg = 1
ans = ["A", "B"]
if 2 * x < b + a:
print((ans[flg]))
else:
print((ans[-1 + flg]))
| false | 50 | [
"-if abs(x - a) < abs(x - b):",
"- print(\"A\")",
"+flg = 0",
"+if b < a:",
"+ b, a = a, b",
"+ flg = 1",
"+ans = [\"A\", \"B\"]",
"+if 2 * x < b + a:",
"+ print((ans[flg]))",
"- print(\"B\")",
"+ print((ans[-1 + flg]))"
] | false | 0.180038 | 0.045034 | 3.997838 | [
"s559042546",
"s519712985"
] |
u883048396 | p03127 | python | s782086487 | s294468988 | 122 | 64 | 19,728 | 14,252 | Accepted | Accepted | 47.54 | #gcdか....
def fgcd(a,b):
while b:
a,b = b,a%b
return a
N = int(eval(input()))
aA = sorted(set(int(_) for _ in input().split()))
b = aA[0]
for a in aA[1:]:
b = fgcd(a,b)
print(b)
| N = int(eval(input()))
aA=[int(_) for _ in input().split()]
iMin = min(aA)
iMax = max(aA)
def fgcd(a,b):
while b:
a,b = b,a%b
return a
if iMin == 1:
print((1))
else:
iDm = [ _ % iMin for _ in aA]
if max(iDm) == 0:
print(iMin)
else:
b = aA[0]
for _ in aA[1:]:
b = fgcd(_,b)
if b == 1:
print((1))
exit()
print(b)
| 12 | 24 | 204 | 447 | # gcdか....
def fgcd(a, b):
while b:
a, b = b, a % b
return a
N = int(eval(input()))
aA = sorted(set(int(_) for _ in input().split()))
b = aA[0]
for a in aA[1:]:
b = fgcd(a, b)
print(b)
| N = int(eval(input()))
aA = [int(_) for _ in input().split()]
iMin = min(aA)
iMax = max(aA)
def fgcd(a, b):
while b:
a, b = b, a % b
return a
if iMin == 1:
print((1))
else:
iDm = [_ % iMin for _ in aA]
if max(iDm) == 0:
print(iMin)
else:
b = aA[0]
for _ in aA[1:]:
b = fgcd(_, b)
if b == 1:
print((1))
exit()
print(b)
| false | 50 | [
"-# gcdか....",
"+N = int(eval(input()))",
"+aA = [int(_) for _ in input().split()]",
"+iMin = min(aA)",
"+iMax = max(aA)",
"+",
"+",
"-N = int(eval(input()))",
"-aA = sorted(set(int(_) for _ in input().split()))",
"-b = aA[0]",
"-for a in aA[1:]:",
"- b = fgcd(a, b)",
"-print(b)",
"+if iMin == 1:",
"+ print((1))",
"+else:",
"+ iDm = [_ % iMin for _ in aA]",
"+ if max(iDm) == 0:",
"+ print(iMin)",
"+ else:",
"+ b = aA[0]",
"+ for _ in aA[1:]:",
"+ b = fgcd(_, b)",
"+ if b == 1:",
"+ print((1))",
"+ exit()",
"+ print(b)"
] | false | 0.084862 | 0.045541 | 1.863411 | [
"s782086487",
"s294468988"
] |
u022871813 | p02820 | python | s120354326 | s571153661 | 261 | 197 | 15,404 | 15,404 | Accepted | Accepted | 24.52 | d = {"r": "p", "s": "r", "p": "s"}
n, k = list(map(int, input().split()))
r, s, p = list(map(int, input().split()))
t = eval(input())
score = {"r": r, "s": s, "p": p}
d2 = {}
r = 0
def set_hand(l, k):
if l + k < n:
if {d.get(t[l - k]), d.get(t[l + k])} == {"r", "s"}:
return "p"
if {d.get(t[l - k]), d.get(t[l + k])} == {"r", "p"}:
return "s"
if {d.get(t[l - k]), d.get(t[l + k])} == {"p", "s"}:
return "r"
return t[l]
else:
return t[l]
for i in range(n):
for l in range(i, n, k):
if d2.get(l) is not None:
break
if l - k >= 0:
if d2[l - k] == d.get(t[l]):
d2[l] = set_hand(l, k)
else:
d2[l] = d.get(t[l])
r += score[d2[l]]
if l - k < 0:
d2[l] = d.get(t[l])
r += score[d2[l]]
print(r)
| d = {"r": "p", "s": "r", "p": "s"}
n, k = list(map(int, input().split()))
r, s, p = list(map(int, input().split()))
t = eval(input())
score = {"r": r, "s": s, "p": p}
d2 = {}
r = 0
def set_hand(l, k):
if l + k < n:
if {d.get(t[l - k]), d.get(t[l + k])} == {"r", "s"}:
return "p"
if {d.get(t[l - k]), d.get(t[l + k])} == {"r", "p"}:
return "s"
if {d.get(t[l - k]), d.get(t[l + k])} == {"p", "s"}:
return "r"
return t[l]
else:
return t[l]
for i in range(k):
for l in range(i, n, k):
if l - k >= 0:
if d2[l - k] == d.get(t[l]):
d2[l] = set_hand(l, k)
else:
d2[l] = d.get(t[l])
r += score[d2[l]]
if l - k < 0:
d2[l] = d.get(t[l])
r += score[d2[l]]
print(r)
| 36 | 34 | 926 | 872 | d = {"r": "p", "s": "r", "p": "s"}
n, k = list(map(int, input().split()))
r, s, p = list(map(int, input().split()))
t = eval(input())
score = {"r": r, "s": s, "p": p}
d2 = {}
r = 0
def set_hand(l, k):
if l + k < n:
if {d.get(t[l - k]), d.get(t[l + k])} == {"r", "s"}:
return "p"
if {d.get(t[l - k]), d.get(t[l + k])} == {"r", "p"}:
return "s"
if {d.get(t[l - k]), d.get(t[l + k])} == {"p", "s"}:
return "r"
return t[l]
else:
return t[l]
for i in range(n):
for l in range(i, n, k):
if d2.get(l) is not None:
break
if l - k >= 0:
if d2[l - k] == d.get(t[l]):
d2[l] = set_hand(l, k)
else:
d2[l] = d.get(t[l])
r += score[d2[l]]
if l - k < 0:
d2[l] = d.get(t[l])
r += score[d2[l]]
print(r)
| d = {"r": "p", "s": "r", "p": "s"}
n, k = list(map(int, input().split()))
r, s, p = list(map(int, input().split()))
t = eval(input())
score = {"r": r, "s": s, "p": p}
d2 = {}
r = 0
def set_hand(l, k):
if l + k < n:
if {d.get(t[l - k]), d.get(t[l + k])} == {"r", "s"}:
return "p"
if {d.get(t[l - k]), d.get(t[l + k])} == {"r", "p"}:
return "s"
if {d.get(t[l - k]), d.get(t[l + k])} == {"p", "s"}:
return "r"
return t[l]
else:
return t[l]
for i in range(k):
for l in range(i, n, k):
if l - k >= 0:
if d2[l - k] == d.get(t[l]):
d2[l] = set_hand(l, k)
else:
d2[l] = d.get(t[l])
r += score[d2[l]]
if l - k < 0:
d2[l] = d.get(t[l])
r += score[d2[l]]
print(r)
| false | 5.555556 | [
"-for i in range(n):",
"+for i in range(k):",
"- if d2.get(l) is not None:",
"- break"
] | false | 0.045954 | 0.043664 | 1.052459 | [
"s120354326",
"s571153661"
] |
u456353530 | p02762 | python | s635921891 | s708421143 | 1,463 | 966 | 128,344 | 128,604 | Accepted | Accepted | 33.97 | class Union:
def __init__(s, num):
s.T = [-1 for i in range(num)]
def root(s, x):
if s.T[x] < 0: return x, -s.T[x]
t, k = s.root(s.T[x])
s.T[x] = t
return t, k
def merge(s, x, y):
an, am = s.root(x)
bn, bm = s.root(y)
if an == bn: return False
if am < bm: an, bn = bn, an
s.T[an] += s.T[bn]
s.T[bn] = an
return True
def size(s, x):
return s.root(x)[1]
def same(s, x, y):
return s.root(x)[0] == s.root(y)[0]
N, M, K = list(map(int, input().split()))
AB = [list(map(int, input().split())) for _ in range(M)]
CD = [list(map(int, input().split())) for _ in range(K)]
uni = Union(N)
ans = [-1] * N
for a, b in AB:
a -= 1
b -= 1
uni.merge(a, b)
ans[a] -= 1
ans[b] -= 1
L = [[] for _ in range(N)]
for c, d in CD:
c -= 1
d -= 1
L[c].append(d)
L[d].append(c)
for i in range(N):
ans[i] += uni.size(i)
for j in L[i]:
if uni.same(i, j):
ans[i] -= 1
ans = list(map(str, ans))
print((" ".join(ans))) | class Union:
def __init__(s, num):
s.T = [-1 for i in range(num)]
def root(s, x):
if s.T[x] < 0: return x, -s.T[x]
t, k = s.root(s.T[x])
s.T[x] = t
return t, k
def merge(s, x, y):
an, am = s.root(x)
bn, bm = s.root(y)
if an == bn: return False
if am < bm: an, bn = bn, an
s.T[an] += s.T[bn]
s.T[bn] = an
return True
def size(s, x):
return s.root(x)[1]
def same(s, x, y):
return s.root(x)[0] == s.root(y)[0]
import sys
input = sys.stdin.readline
N, M, K = list(map(int, input().split()))
AB = [list(map(int, input().split())) for _ in range(M)]
CD = [list(map(int, input().split())) for _ in range(K)]
uni = Union(N)
ans = [-1] * N
for a, b in AB:
a -= 1
b -= 1
uni.merge(a, b)
ans[a] -= 1
ans[b] -= 1
L = [[] for _ in range(N)]
for c, d in CD:
c -= 1
d -= 1
L[c].append(d)
L[d].append(c)
for i in range(N):
ans[i] += uni.size(i)
for j in L[i]:
if uni.same(i, j):
ans[i] -= 1
ans = list(map(str, ans))
print((" ".join(ans))) | 53 | 56 | 1,044 | 1,086 | class Union:
def __init__(s, num):
s.T = [-1 for i in range(num)]
def root(s, x):
if s.T[x] < 0:
return x, -s.T[x]
t, k = s.root(s.T[x])
s.T[x] = t
return t, k
def merge(s, x, y):
an, am = s.root(x)
bn, bm = s.root(y)
if an == bn:
return False
if am < bm:
an, bn = bn, an
s.T[an] += s.T[bn]
s.T[bn] = an
return True
def size(s, x):
return s.root(x)[1]
def same(s, x, y):
return s.root(x)[0] == s.root(y)[0]
N, M, K = list(map(int, input().split()))
AB = [list(map(int, input().split())) for _ in range(M)]
CD = [list(map(int, input().split())) for _ in range(K)]
uni = Union(N)
ans = [-1] * N
for a, b in AB:
a -= 1
b -= 1
uni.merge(a, b)
ans[a] -= 1
ans[b] -= 1
L = [[] for _ in range(N)]
for c, d in CD:
c -= 1
d -= 1
L[c].append(d)
L[d].append(c)
for i in range(N):
ans[i] += uni.size(i)
for j in L[i]:
if uni.same(i, j):
ans[i] -= 1
ans = list(map(str, ans))
print((" ".join(ans)))
| class Union:
def __init__(s, num):
s.T = [-1 for i in range(num)]
def root(s, x):
if s.T[x] < 0:
return x, -s.T[x]
t, k = s.root(s.T[x])
s.T[x] = t
return t, k
def merge(s, x, y):
an, am = s.root(x)
bn, bm = s.root(y)
if an == bn:
return False
if am < bm:
an, bn = bn, an
s.T[an] += s.T[bn]
s.T[bn] = an
return True
def size(s, x):
return s.root(x)[1]
def same(s, x, y):
return s.root(x)[0] == s.root(y)[0]
import sys
input = sys.stdin.readline
N, M, K = list(map(int, input().split()))
AB = [list(map(int, input().split())) for _ in range(M)]
CD = [list(map(int, input().split())) for _ in range(K)]
uni = Union(N)
ans = [-1] * N
for a, b in AB:
a -= 1
b -= 1
uni.merge(a, b)
ans[a] -= 1
ans[b] -= 1
L = [[] for _ in range(N)]
for c, d in CD:
c -= 1
d -= 1
L[c].append(d)
L[d].append(c)
for i in range(N):
ans[i] += uni.size(i)
for j in L[i]:
if uni.same(i, j):
ans[i] -= 1
ans = list(map(str, ans))
print((" ".join(ans)))
| false | 5.357143 | [
"+import sys",
"+",
"+input = sys.stdin.readline"
] | false | 0.044209 | 0.039479 | 1.119809 | [
"s635921891",
"s708421143"
] |
u329565519 | p03814 | python | s790471216 | s417509123 | 55 | 18 | 3,516 | 3,500 | Accepted | Accepted | 67.27 | s = eval(input())
st = None
en = None
for i in range(len(s)):
if st is None and s[i] == 'A':
st = i
if en is None and s[-i-1] == 'Z':
en = -i - 1
print((len(s[st:en]) + 1)) | s = eval(input())
print((s.rindex('Z') - s.index('A') + 1))
| 10 | 3 | 198 | 55 | s = eval(input())
st = None
en = None
for i in range(len(s)):
if st is None and s[i] == "A":
st = i
if en is None and s[-i - 1] == "Z":
en = -i - 1
print((len(s[st:en]) + 1))
| s = eval(input())
print((s.rindex("Z") - s.index("A") + 1))
| false | 70 | [
"-st = None",
"-en = None",
"-for i in range(len(s)):",
"- if st is None and s[i] == \"A\":",
"- st = i",
"- if en is None and s[-i - 1] == \"Z\":",
"- en = -i - 1",
"-print((len(s[st:en]) + 1))",
"+print((s.rindex(\"Z\") - s.index(\"A\") + 1))"
] | false | 0.039078 | 0.038732 | 1.008935 | [
"s790471216",
"s417509123"
] |
u977389981 | p03308 | python | s143355201 | s140000968 | 21 | 19 | 3,060 | 2,940 | Accepted | Accepted | 9.52 | n = int(eval(input()))
A = [int(i) for i in input().split()]
ans = -1
for i in range(n):
for j in range(n):
temp = abs(A[i] - A[j])
ans = max(ans, temp)
print(ans) | n = int(eval(input()))
A = [int(i) for i in input().split()]
ans = 0
for i in range(n):
for j in range(i, n):
ans = max(ans, abs(A[i] - A[j]))
print(ans) | 10 | 9 | 196 | 177 | n = int(eval(input()))
A = [int(i) for i in input().split()]
ans = -1
for i in range(n):
for j in range(n):
temp = abs(A[i] - A[j])
ans = max(ans, temp)
print(ans)
| n = int(eval(input()))
A = [int(i) for i in input().split()]
ans = 0
for i in range(n):
for j in range(i, n):
ans = max(ans, abs(A[i] - A[j]))
print(ans)
| false | 10 | [
"-ans = -1",
"+ans = 0",
"- for j in range(n):",
"- temp = abs(A[i] - A[j])",
"- ans = max(ans, temp)",
"+ for j in range(i, n):",
"+ ans = max(ans, abs(A[i] - A[j]))"
] | false | 0.045974 | 0.046659 | 0.985317 | [
"s143355201",
"s140000968"
] |
u272075541 | p03014 | python | s005509388 | s299789468 | 899 | 829 | 141,792 | 141,728 | Accepted | Accepted | 7.79 | # -*- coding: utf-8 -*-
import numpy as np
### TESTCASE
test = ""
#test = \
"""
4 6
#..#..
.....#
....#.
#.#...
ans 8
"""
"""
8 8
..#...#.
....#...
##......
..###..#
...#..#.
##....#.
#...#...
###.#..#
ans 13
"""
############
test = list(reversed(test.strip().splitlines()))
if test:
def input2():
return test.pop()
else:
def input2():
return eval(input())
####### MAIN
h, w = list(map(int, input2().split()))
s = [["#"] * (w+1)]
s += [list("#" + input2()) for _ in range(h)]
s = np.array(s)
hs = np.zeros((h+1, w+1), dtype="int64")
ws = np.zeros((h+1, w+1), dtype="int64")
for hi in range(1, h+1):
htmp = np.array(s[hi] == ".", dtype="int")
hs[hi] = hs[hi-1] * htmp + htmp
for hj in range(h-1, 0, -1):
hs[hj] = np.maximum(hs[hj], np.minimum(hs[hj+1], hs[hj] * hs[hj+1]))
for wi in range(1, w+1):
wtmp = np.array(s[:, wi] == ".", dtype="int")
ws[:, wi] = ws[:, wi-1] * wtmp + wtmp
for wj in range(w-1, 0, -1):
ws[:, wj] = np.maximum(ws[:, wj],
np.minimum(ws[:, wj+1], ws[:, wj] * ws[:, wj+1]))
print((np.max(ws + hs) - 1))
| import numpy as np
h, w = list(map(int, input().split()))
grid = np.array([list(eval(input())) for _ in range(h)], dtype="str")
hgrid = np.zeros((h, w), dtype="int")
for hi in range(h):
hdot = np.array(grid[hi] == ".", dtype="int")
hgrid[hi] = hgrid[hi-1] * hdot + hdot
for hi in range(h-2, -1, -1):
hi_1 = np.minimum(hgrid[hi+1], hgrid[hi] * hgrid[hi+1])
hgrid[hi] = np.maximum(hgrid[hi], hi_1)
wgrid = np.zeros((h, w), dtype="int")
for wi in range(w):
wdot = np.array(grid[:, wi] == ".", dtype="int")
wgrid[:, wi] = wgrid[:, wi-1] * wdot + wdot
for wi in range(w-2, -1, -1):
wi_1 = np.minimum(wgrid[:, wi+1], wgrid[:, wi] * wgrid[:, wi+1])
wgrid[:, wi] = np.maximum(wgrid[:, wi], wi_1)
print((np.max(wgrid + hgrid) - 1)) | 65 | 25 | 1,169 | 783 | # -*- coding: utf-8 -*-
import numpy as np
### TESTCASE
test = ""
# test = \
"""
4 6
#..#..
.....#
....#.
#.#...
ans 8
"""
"""
8 8
..#...#.
....#...
##......
..###..#
...#..#.
##....#.
#...#...
###.#..#
ans 13
"""
############
test = list(reversed(test.strip().splitlines()))
if test:
def input2():
return test.pop()
else:
def input2():
return eval(input())
####### MAIN
h, w = list(map(int, input2().split()))
s = [["#"] * (w + 1)]
s += [list("#" + input2()) for _ in range(h)]
s = np.array(s)
hs = np.zeros((h + 1, w + 1), dtype="int64")
ws = np.zeros((h + 1, w + 1), dtype="int64")
for hi in range(1, h + 1):
htmp = np.array(s[hi] == ".", dtype="int")
hs[hi] = hs[hi - 1] * htmp + htmp
for hj in range(h - 1, 0, -1):
hs[hj] = np.maximum(hs[hj], np.minimum(hs[hj + 1], hs[hj] * hs[hj + 1]))
for wi in range(1, w + 1):
wtmp = np.array(s[:, wi] == ".", dtype="int")
ws[:, wi] = ws[:, wi - 1] * wtmp + wtmp
for wj in range(w - 1, 0, -1):
ws[:, wj] = np.maximum(
ws[:, wj], np.minimum(ws[:, wj + 1], ws[:, wj] * ws[:, wj + 1])
)
print((np.max(ws + hs) - 1))
| import numpy as np
h, w = list(map(int, input().split()))
grid = np.array([list(eval(input())) for _ in range(h)], dtype="str")
hgrid = np.zeros((h, w), dtype="int")
for hi in range(h):
hdot = np.array(grid[hi] == ".", dtype="int")
hgrid[hi] = hgrid[hi - 1] * hdot + hdot
for hi in range(h - 2, -1, -1):
hi_1 = np.minimum(hgrid[hi + 1], hgrid[hi] * hgrid[hi + 1])
hgrid[hi] = np.maximum(hgrid[hi], hi_1)
wgrid = np.zeros((h, w), dtype="int")
for wi in range(w):
wdot = np.array(grid[:, wi] == ".", dtype="int")
wgrid[:, wi] = wgrid[:, wi - 1] * wdot + wdot
for wi in range(w - 2, -1, -1):
wi_1 = np.minimum(wgrid[:, wi + 1], wgrid[:, wi] * wgrid[:, wi + 1])
wgrid[:, wi] = np.maximum(wgrid[:, wi], wi_1)
print((np.max(wgrid + hgrid) - 1))
| false | 61.538462 | [
"-# -*- coding: utf-8 -*-",
"-### TESTCASE",
"-test = \"\"",
"-# test = \\",
"-\"\"\"",
"-4 6",
"-#..#..",
"-.....#",
"-....#.",
"-#.#...",
"-ans 8",
"-\"\"\"",
"-\"\"\"",
"-8 8",
"-..#...#.",
"-....#...",
"-##......",
"-..###..#",
"-...#..#.",
"-##....#.",
"-#...#...",
"-###.#..#",
"-ans 13",
"-\"\"\"",
"-############",
"-test = list(reversed(test.strip().splitlines()))",
"-if test:",
"-",
"- def input2():",
"- return test.pop()",
"-",
"-else:",
"-",
"- def input2():",
"- return eval(input())",
"-",
"-",
"-####### MAIN",
"-h, w = list(map(int, input2().split()))",
"-s = [[\"#\"] * (w + 1)]",
"-s += [list(\"#\" + input2()) for _ in range(h)]",
"-s = np.array(s)",
"-hs = np.zeros((h + 1, w + 1), dtype=\"int64\")",
"-ws = np.zeros((h + 1, w + 1), dtype=\"int64\")",
"-for hi in range(1, h + 1):",
"- htmp = np.array(s[hi] == \".\", dtype=\"int\")",
"- hs[hi] = hs[hi - 1] * htmp + htmp",
"-for hj in range(h - 1, 0, -1):",
"- hs[hj] = np.maximum(hs[hj], np.minimum(hs[hj + 1], hs[hj] * hs[hj + 1]))",
"-for wi in range(1, w + 1):",
"- wtmp = np.array(s[:, wi] == \".\", dtype=\"int\")",
"- ws[:, wi] = ws[:, wi - 1] * wtmp + wtmp",
"-for wj in range(w - 1, 0, -1):",
"- ws[:, wj] = np.maximum(",
"- ws[:, wj], np.minimum(ws[:, wj + 1], ws[:, wj] * ws[:, wj + 1])",
"- )",
"-print((np.max(ws + hs) - 1))",
"+h, w = list(map(int, input().split()))",
"+grid = np.array([list(eval(input())) for _ in range(h)], dtype=\"str\")",
"+hgrid = np.zeros((h, w), dtype=\"int\")",
"+for hi in range(h):",
"+ hdot = np.array(grid[hi] == \".\", dtype=\"int\")",
"+ hgrid[hi] = hgrid[hi - 1] * hdot + hdot",
"+for hi in range(h - 2, -1, -1):",
"+ hi_1 = np.minimum(hgrid[hi + 1], hgrid[hi] * hgrid[hi + 1])",
"+ hgrid[hi] = np.maximum(hgrid[hi], hi_1)",
"+wgrid = np.zeros((h, w), dtype=\"int\")",
"+for wi in range(w):",
"+ wdot = np.array(grid[:, wi] == \".\", dtype=\"int\")",
"+ wgrid[:, wi] = wgrid[:, wi - 1] * wdot + wdot",
"+for wi in range(w - 2, -1, -1):",
"+ wi_1 = np.minimum(wgrid[:, wi + 1], wgrid[:, wi] * wgrid[:, wi + 1])",
"+ wgrid[:, wi] = np.maximum(wgrid[:, wi], wi_1)",
"+print((np.max(wgrid + hgrid) - 1))"
] | false | 0.307252 | 0.35991 | 0.853691 | [
"s005509388",
"s299789468"
] |
u697386253 | p02712 | python | s048392084 | s431457182 | 161 | 144 | 9,168 | 9,168 | Accepted | Accepted | 10.56 | n = int(eval(input()))
ans = 0
for i in range(n+1):
if i % 3 != 0 and i % 5 != 0:
ans += i
print(ans) | N = int(eval(input()))
ans = 0
for i in range(1, N+1):
if i % 3 != 0 and i % 5 != 0:
ans += i
print(ans) | 8 | 8 | 118 | 121 | n = int(eval(input()))
ans = 0
for i in range(n + 1):
if i % 3 != 0 and i % 5 != 0:
ans += i
print(ans)
| N = int(eval(input()))
ans = 0
for i in range(1, N + 1):
if i % 3 != 0 and i % 5 != 0:
ans += i
print(ans)
| false | 0 | [
"-n = int(eval(input()))",
"+N = int(eval(input()))",
"-for i in range(n + 1):",
"+for i in range(1, N + 1):"
] | false | 0.48069 | 0.228445 | 2.104186 | [
"s048392084",
"s431457182"
] |
u460386402 | p02995 | python | s113223039 | s703521166 | 32 | 27 | 9,092 | 9,096 | Accepted | Accepted | 15.62 | import math
a,b,c,d=list(map(int,input().split()))
count=b-a+1
A=a-1
l=c*d//math.gcd(c,d)
acou=(A//c)+(A//d)-int((A//l))
bcou=(b//c)+(b//d)-int((b//l))
print((count-(bcou-acou))) | import math
a,b,c,d=list(map(int,input().split()))
count=b-a+1
acou=((a-1)//c)+((a-1)//d)-int(((a-1)//(c*d//math.gcd(c,d))))
bcou=(b//c)+(b//d)-int((b//(c*d//math.gcd(c,d))))
print((count-(bcou-acou)))
| 10 | 6 | 181 | 199 | import math
a, b, c, d = list(map(int, input().split()))
count = b - a + 1
A = a - 1
l = c * d // math.gcd(c, d)
acou = (A // c) + (A // d) - int((A // l))
bcou = (b // c) + (b // d) - int((b // l))
print((count - (bcou - acou)))
| import math
a, b, c, d = list(map(int, input().split()))
count = b - a + 1
acou = ((a - 1) // c) + ((a - 1) // d) - int(((a - 1) // (c * d // math.gcd(c, d))))
bcou = (b // c) + (b // d) - int((b // (c * d // math.gcd(c, d))))
print((count - (bcou - acou)))
| false | 40 | [
"-A = a - 1",
"-l = c * d // math.gcd(c, d)",
"-acou = (A // c) + (A // d) - int((A // l))",
"-bcou = (b // c) + (b // d) - int((b // l))",
"+acou = ((a - 1) // c) + ((a - 1) // d) - int(((a - 1) // (c * d // math.gcd(c, d))))",
"+bcou = (b // c) + (b // d) - int((b // (c * d // math.gcd(c, d))))"
] | false | 0.044608 | 0.044615 | 0.999836 | [
"s113223039",
"s703521166"
] |
u670567845 | p02658 | python | s368282631 | s231862403 | 86 | 59 | 87,880 | 21,536 | Accepted | Accepted | 31.4 | def main():
N = int(eval(input()))
A = list(map(int, input().split()))
if 0 in A:
print((0))
return
prd = 1
for a in A:
prd *= a
if prd > 1000000000000000000:
print((-1))
return
print(prd)
main() | N = int(eval(input()))
A = list(map(int, input().split()))
X = 10**18
ans = 1
if 0 in A:
ans = 0
else:
for i in range(N):
ans = ans * A[i]
if ans > X:
ans = -1
break
print(ans) | 15 | 13 | 240 | 207 | def main():
N = int(eval(input()))
A = list(map(int, input().split()))
if 0 in A:
print((0))
return
prd = 1
for a in A:
prd *= a
if prd > 1000000000000000000:
print((-1))
return
print(prd)
main()
| N = int(eval(input()))
A = list(map(int, input().split()))
X = 10**18
ans = 1
if 0 in A:
ans = 0
else:
for i in range(N):
ans = ans * A[i]
if ans > X:
ans = -1
break
print(ans)
| false | 13.333333 | [
"-def main():",
"- N = int(eval(input()))",
"- A = list(map(int, input().split()))",
"- if 0 in A:",
"- print((0))",
"- return",
"- prd = 1",
"- for a in A:",
"- prd *= a",
"- if prd > 1000000000000000000:",
"- print((-1))",
"- return",
"- print(prd)",
"-",
"-",
"-main()",
"+N = int(eval(input()))",
"+A = list(map(int, input().split()))",
"+X = 10**18",
"+ans = 1",
"+if 0 in A:",
"+ ans = 0",
"+else:",
"+ for i in range(N):",
"+ ans = ans * A[i]",
"+ if ans > X:",
"+ ans = -1",
"+ break",
"+print(ans)"
] | false | 0.03886 | 0.120319 | 0.322976 | [
"s368282631",
"s231862403"
] |
u094191970 | p03038 | python | s619808629 | s484386775 | 529 | 432 | 33,640 | 33,696 | Accepted | Accepted | 18.34 | n,m=list(map(int,input().split()))
a=sorted(list(map(int,input().split())))
l=[list(map(int,input().split())) for i in range(m)]
l=sorted(l,key=lambda x:x[1], reverse=True)
p=0
comp=[]
for b,c in l:
comp+=[c]*b
p+=b
if p>=n:
break
ans=0
for i in range(n):
if i<len(comp):
ans+=max(a[i],comp[i])
else:
ans+=a[i]
print(ans) | from sys import stdin
na=lambda: list(map(int,stdin.readline().split()))
n,m=list(map(int,input().split()))
a=sorted(list(na()))
l=[list(na()) for i in range(m)]
l=sorted(l,key=lambda x:x[1], reverse=True)
p=0
comp=[]
for b,c in l:
comp+=[c]*b
p+=b
if p>=n:
break
ans=0
for i in range(n):
if i<len(comp):
ans+=max(a[i],comp[i])
else:
ans+=a[i]
print(ans) | 20 | 23 | 358 | 389 | n, m = list(map(int, input().split()))
a = sorted(list(map(int, input().split())))
l = [list(map(int, input().split())) for i in range(m)]
l = sorted(l, key=lambda x: x[1], reverse=True)
p = 0
comp = []
for b, c in l:
comp += [c] * b
p += b
if p >= n:
break
ans = 0
for i in range(n):
if i < len(comp):
ans += max(a[i], comp[i])
else:
ans += a[i]
print(ans)
| from sys import stdin
na = lambda: list(map(int, stdin.readline().split()))
n, m = list(map(int, input().split()))
a = sorted(list(na()))
l = [list(na()) for i in range(m)]
l = sorted(l, key=lambda x: x[1], reverse=True)
p = 0
comp = []
for b, c in l:
comp += [c] * b
p += b
if p >= n:
break
ans = 0
for i in range(n):
if i < len(comp):
ans += max(a[i], comp[i])
else:
ans += a[i]
print(ans)
| false | 13.043478 | [
"+from sys import stdin",
"+",
"+na = lambda: list(map(int, stdin.readline().split()))",
"-a = sorted(list(map(int, input().split())))",
"-l = [list(map(int, input().split())) for i in range(m)]",
"+a = sorted(list(na()))",
"+l = [list(na()) for i in range(m)]"
] | false | 0.04096 | 0.039867 | 1.027433 | [
"s619808629",
"s484386775"
] |
u014333473 | p03774 | python | s091698167 | s477525805 | 30 | 27 | 9,116 | 9,244 | Accepted | Accepted | 10 | N,M=list(map(int,input().split()))
n=[list(map(int,input().split())) for _ in range(N)]
m=[list(map(int,input().split())) for _ in range(M)]
result=[]
for i in range(len(n)):
result=[]
for j in range(len(m)):
result.append(abs(n[i][0]-m[j][0])+abs(n[i][1]-m[j][1]))
print((result.index(min(result))+1)) | n,m=map(int,input().split())
ab=[list(map(int,input().split())) for _ in range(n)]
cd=[list(map(int,input().split())) for _ in range(m)]
r=[]
for i in ab:
x1,y1=i[0],i[1]
temp=[]
for j in cd:
x2,y2=j[0],j[1]
temp.append(abs(x1-x2)+abs(y1-y2))
r.append(temp.index(min(temp))+1)
print(*r,sep='\n')
| 9 | 12 | 312 | 322 | N, M = list(map(int, input().split()))
n = [list(map(int, input().split())) for _ in range(N)]
m = [list(map(int, input().split())) for _ in range(M)]
result = []
for i in range(len(n)):
result = []
for j in range(len(m)):
result.append(abs(n[i][0] - m[j][0]) + abs(n[i][1] - m[j][1]))
print((result.index(min(result)) + 1))
| n, m = map(int, input().split())
ab = [list(map(int, input().split())) for _ in range(n)]
cd = [list(map(int, input().split())) for _ in range(m)]
r = []
for i in ab:
x1, y1 = i[0], i[1]
temp = []
for j in cd:
x2, y2 = j[0], j[1]
temp.append(abs(x1 - x2) + abs(y1 - y2))
r.append(temp.index(min(temp)) + 1)
print(*r, sep="\n")
| false | 25 | [
"-N, M = list(map(int, input().split()))",
"-n = [list(map(int, input().split())) for _ in range(N)]",
"-m = [list(map(int, input().split())) for _ in range(M)]",
"-result = []",
"-for i in range(len(n)):",
"- result = []",
"- for j in range(len(m)):",
"- result.append(abs(n[i][0] - m[j][0]) + abs(n[i][1] - m[j][1]))",
"- print((result.index(min(result)) + 1))",
"+n, m = map(int, input().split())",
"+ab = [list(map(int, input().split())) for _ in range(n)]",
"+cd = [list(map(int, input().split())) for _ in range(m)]",
"+r = []",
"+for i in ab:",
"+ x1, y1 = i[0], i[1]",
"+ temp = []",
"+ for j in cd:",
"+ x2, y2 = j[0], j[1]",
"+ temp.append(abs(x1 - x2) + abs(y1 - y2))",
"+ r.append(temp.index(min(temp)) + 1)",
"+print(*r, sep=\"\\n\")"
] | false | 0.088428 | 0.035201 | 2.51207 | [
"s091698167",
"s477525805"
] |
u240055120 | p03478 | python | s014821322 | s748918832 | 39 | 29 | 2,940 | 3,060 | Accepted | Accepted | 25.64 | n, a, b = list(map(int, input().split()))
count = 0
for xx in range(1, n+1):
x = str(xx)
sum_x = 0
for i in range(len(x)):
sum_x += int(x[i])
if sum_x >= a and sum_x <= b:
count += xx
print(count)
| def find_sum_of_digits(n):
sum = 0
while(n>0):
sum += n%10
n = int(n/10)
return sum
n, a, b = list(map(int, input().split()))
count = 0
for i in range(1, n+1):
x = find_sum_of_digits(i)
if x >= a and x <= b:
count += i
print(count)
| 11 | 15 | 218 | 264 | n, a, b = list(map(int, input().split()))
count = 0
for xx in range(1, n + 1):
x = str(xx)
sum_x = 0
for i in range(len(x)):
sum_x += int(x[i])
if sum_x >= a and sum_x <= b:
count += xx
print(count)
| def find_sum_of_digits(n):
sum = 0
while n > 0:
sum += n % 10
n = int(n / 10)
return sum
n, a, b = list(map(int, input().split()))
count = 0
for i in range(1, n + 1):
x = find_sum_of_digits(i)
if x >= a and x <= b:
count += i
print(count)
| false | 26.666667 | [
"+def find_sum_of_digits(n):",
"+ sum = 0",
"+ while n > 0:",
"+ sum += n % 10",
"+ n = int(n / 10)",
"+ return sum",
"+",
"+",
"-for xx in range(1, n + 1):",
"- x = str(xx)",
"- sum_x = 0",
"- for i in range(len(x)):",
"- sum_x += int(x[i])",
"- if sum_x >= a and sum_x <= b:",
"- count += xx",
"+for i in range(1, n + 1):",
"+ x = find_sum_of_digits(i)",
"+ if x >= a and x <= b:",
"+ count += i"
] | false | 0.038728 | 0.04653 | 0.832318 | [
"s014821322",
"s748918832"
] |
u934442292 | p02854 | python | s317854933 | s720824741 | 130 | 118 | 26,216 | 25,748 | Accepted | Accepted | 9.23 | import sys
input = sys.stdin.readline
def main():
N = int(eval(input()))
A = list(map(int, input().split()))
sum_A = sum(A)
center = sum_A / 2
total = 0
near_center = 0
for a in A:
total += a
if abs(total - center) < abs(near_center - center):
near_center = total
ans = abs((sum_A - near_center) - near_center)
print(ans)
if __name__ == "__main__":
main()
| import sys
from itertools import accumulate
input = sys.stdin.readline
def main():
N = int(eval(input()))
A = list(map(int, input().split()))
cumsum_A = list(accumulate(A))
sum_A = sum(A)
ans = float("inf")
for i in range(N - 1):
cost = abs((sum_A - cumsum_A[i]) - cumsum_A[i])
if cost < ans:
ans = cost
print(ans)
if __name__ == "__main__":
main()
| 24 | 24 | 448 | 434 | import sys
input = sys.stdin.readline
def main():
N = int(eval(input()))
A = list(map(int, input().split()))
sum_A = sum(A)
center = sum_A / 2
total = 0
near_center = 0
for a in A:
total += a
if abs(total - center) < abs(near_center - center):
near_center = total
ans = abs((sum_A - near_center) - near_center)
print(ans)
if __name__ == "__main__":
main()
| import sys
from itertools import accumulate
input = sys.stdin.readline
def main():
N = int(eval(input()))
A = list(map(int, input().split()))
cumsum_A = list(accumulate(A))
sum_A = sum(A)
ans = float("inf")
for i in range(N - 1):
cost = abs((sum_A - cumsum_A[i]) - cumsum_A[i])
if cost < ans:
ans = cost
print(ans)
if __name__ == "__main__":
main()
| false | 0 | [
"+from itertools import accumulate",
"+ cumsum_A = list(accumulate(A))",
"- center = sum_A / 2",
"- total = 0",
"- near_center = 0",
"- for a in A:",
"- total += a",
"- if abs(total - center) < abs(near_center - center):",
"- near_center = total",
"- ans = abs((sum_A - near_center) - near_center)",
"+ ans = float(\"inf\")",
"+ for i in range(N - 1):",
"+ cost = abs((sum_A - cumsum_A[i]) - cumsum_A[i])",
"+ if cost < ans:",
"+ ans = cost"
] | false | 0.035222 | 0.040418 | 0.871449 | [
"s317854933",
"s720824741"
] |
u098012509 | p03244 | python | s424619617 | s356934571 | 266 | 193 | 65,628 | 22,252 | Accepted | Accepted | 27.44 | import sys
input = sys.stdin.readline
from collections import Counter
def main():
N = int(eval(input()))
V = [int(x) for x in input().split()]
a = []
b = []
for i in range(N):
if i & 1:
a.append(V[i])
else:
b.append(V[i])
ac = Counter(a)
bc = Counter(b)
acm = ac.most_common()
bcm = bc.most_common()
if acm[0][0] != bcm[0][0]:
print((N // 2 - acm[0][1] + N // 2 - bcm[0][1]))
else:
ans = float("inf")
for i in acm:
if i[0] == bcm[0][0]:
continue
ans = min(ans, N // 2 - i[1] + N // 2 - bcm[0][1])
for j in bcm:
if acm[0][0] == j[0]:
continue
ans = min(ans, N // 2 - j[1] + N // 2 - acm[0][1])
if ans == float("inf"):
print((N // 2))
else:
print(ans)
if __name__ == '__main__':
main()
| import sys
input = sys.stdin.readline
from collections import Counter
def main():
N = int(eval(input()))
V = [int(x) for x in input().split()]
ac = Counter()
bc = Counter()
for i in range(N):
if i & 1:
ac[V[i]] += 1
else:
bc[V[i]] += 1
acm = ac.most_common()
bcm = bc.most_common()
if acm[0][0] != bcm[0][0]:
print((N // 2 - acm[0][1] + N // 2 - bcm[0][1]))
else:
ans = float("inf")
for i in acm:
if i[0] == bcm[0][0]:
continue
ans = min(ans, N // 2 - i[1] + N // 2 - bcm[0][1])
for j in bcm:
if acm[0][0] == j[0]:
continue
ans = min(ans, N // 2 - j[1] + N // 2 - acm[0][1])
if ans == float("inf"):
print((N // 2))
else:
print(ans)
if __name__ == '__main__':
main()
| 46 | 43 | 970 | 940 | import sys
input = sys.stdin.readline
from collections import Counter
def main():
N = int(eval(input()))
V = [int(x) for x in input().split()]
a = []
b = []
for i in range(N):
if i & 1:
a.append(V[i])
else:
b.append(V[i])
ac = Counter(a)
bc = Counter(b)
acm = ac.most_common()
bcm = bc.most_common()
if acm[0][0] != bcm[0][0]:
print((N // 2 - acm[0][1] + N // 2 - bcm[0][1]))
else:
ans = float("inf")
for i in acm:
if i[0] == bcm[0][0]:
continue
ans = min(ans, N // 2 - i[1] + N // 2 - bcm[0][1])
for j in bcm:
if acm[0][0] == j[0]:
continue
ans = min(ans, N // 2 - j[1] + N // 2 - acm[0][1])
if ans == float("inf"):
print((N // 2))
else:
print(ans)
if __name__ == "__main__":
main()
| import sys
input = sys.stdin.readline
from collections import Counter
def main():
N = int(eval(input()))
V = [int(x) for x in input().split()]
ac = Counter()
bc = Counter()
for i in range(N):
if i & 1:
ac[V[i]] += 1
else:
bc[V[i]] += 1
acm = ac.most_common()
bcm = bc.most_common()
if acm[0][0] != bcm[0][0]:
print((N // 2 - acm[0][1] + N // 2 - bcm[0][1]))
else:
ans = float("inf")
for i in acm:
if i[0] == bcm[0][0]:
continue
ans = min(ans, N // 2 - i[1] + N // 2 - bcm[0][1])
for j in bcm:
if acm[0][0] == j[0]:
continue
ans = min(ans, N // 2 - j[1] + N // 2 - acm[0][1])
if ans == float("inf"):
print((N // 2))
else:
print(ans)
if __name__ == "__main__":
main()
| false | 6.521739 | [
"- a = []",
"- b = []",
"+ ac = Counter()",
"+ bc = Counter()",
"- a.append(V[i])",
"+ ac[V[i]] += 1",
"- b.append(V[i])",
"- ac = Counter(a)",
"- bc = Counter(b)",
"+ bc[V[i]] += 1"
] | false | 0.150026 | 0.188424 | 0.796213 | [
"s424619617",
"s356934571"
] |
u527848444 | p02413 | python | s914136742 | s887889421 | 50 | 30 | 6,724 | 7,768 | Accepted | Accepted | 40 | (r,c) = [int(i) for i in input().split()]
table = []
for rc in range(r):
table.append([int(i) for i in input().split()])
table.append([0 for _ in range(c + 1)])
for rc in range(r):
row_total = 0
for cc in range(c):
table[r][cc] += table[rc][cc]
row_total += table[rc][cc]
table[rc].append(row_total)
table[r][c] += row_total
for row in table:
print((' '.join([str(column) for column in row]))) | (r, c) = [int(i) for i in input().split()]
last_row = [0 for _ in range(c+1)]
for _ in range(r):
row = [int(i) for i in input().split()]
for cc in range(c):
last_row[cc] += int(row[cc])
print(row[cc], end=' ')
print(sum(row))
last_row[-1] = sum(last_row)
print(' '.join([str(a) for a in last_row]))
| 19 | 13 | 459 | 344 | (r, c) = [int(i) for i in input().split()]
table = []
for rc in range(r):
table.append([int(i) for i in input().split()])
table.append([0 for _ in range(c + 1)])
for rc in range(r):
row_total = 0
for cc in range(c):
table[r][cc] += table[rc][cc]
row_total += table[rc][cc]
table[rc].append(row_total)
table[r][c] += row_total
for row in table:
print((" ".join([str(column) for column in row])))
| (r, c) = [int(i) for i in input().split()]
last_row = [0 for _ in range(c + 1)]
for _ in range(r):
row = [int(i) for i in input().split()]
for cc in range(c):
last_row[cc] += int(row[cc])
print(row[cc], end=" ")
print(sum(row))
last_row[-1] = sum(last_row)
print(" ".join([str(a) for a in last_row]))
| false | 31.578947 | [
"-table = []",
"-for rc in range(r):",
"- table.append([int(i) for i in input().split()])",
"-table.append([0 for _ in range(c + 1)])",
"-for rc in range(r):",
"- row_total = 0",
"+last_row = [0 for _ in range(c + 1)]",
"+for _ in range(r):",
"+ row = [int(i) for i in input().split()]",
"- table[r][cc] += table[rc][cc]",
"- row_total += table[rc][cc]",
"- table[rc].append(row_total)",
"- table[r][c] += row_total",
"-for row in table:",
"- print((\" \".join([str(column) for column in row])))",
"+ last_row[cc] += int(row[cc])",
"+ print(row[cc], end=\" \")",
"+ print(sum(row))",
"+last_row[-1] = sum(last_row)",
"+print(\" \".join([str(a) for a in last_row]))"
] | false | 0.084675 | 0.129601 | 0.653352 | [
"s914136742",
"s887889421"
] |
u022407960 | p02314 | python | s292468417 | s857065072 | 510 | 470 | 9,572 | 9,488 | Accepted | Accepted | 7.84 | #!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
input:
15 6
1 2 7 8 12 50
output:
2
"""
import sys
def solve():
rec[0] = 0
for i in range(c_num):
for j in range(coins[i], money + 1):
rec[j] = min(rec[j], rec[j - coins[i]] + 1)
return rec
if __name__ == '__main__':
_input = sys.stdin.readlines()
money, c_num = list(map(int, _input[0].split()))
coins = list(map(int, _input[1].split()))
# assert len(coins) == c_num
rec = [float('inf')] * (money + 1)
ans = solve()
print((ans.pop())) | #!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
input:
15 6
1 2 7 8 12 50
output:
2
"""
import sys
def solve():
rec[0] = 0
for i in range(all_coins):
for j in range(coins[i], money + 1):
rec[j] = min(rec[j], rec[j - coins[i]] + 1)
return rec
if __name__ == '__main__':
_input = sys.stdin.readlines()
money, all_coins = list(map(int, _input[0].split()))
coins = list(map(int, _input[1].split()))
# assert len(coins) == c_num
rec = [float('inf')] * (money + 1)
ans = solve()
print((ans.pop())) | 32 | 32 | 576 | 584 | #!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
input:
15 6
1 2 7 8 12 50
output:
2
"""
import sys
def solve():
rec[0] = 0
for i in range(c_num):
for j in range(coins[i], money + 1):
rec[j] = min(rec[j], rec[j - coins[i]] + 1)
return rec
if __name__ == "__main__":
_input = sys.stdin.readlines()
money, c_num = list(map(int, _input[0].split()))
coins = list(map(int, _input[1].split()))
# assert len(coins) == c_num
rec = [float("inf")] * (money + 1)
ans = solve()
print((ans.pop()))
| #!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
input:
15 6
1 2 7 8 12 50
output:
2
"""
import sys
def solve():
rec[0] = 0
for i in range(all_coins):
for j in range(coins[i], money + 1):
rec[j] = min(rec[j], rec[j - coins[i]] + 1)
return rec
if __name__ == "__main__":
_input = sys.stdin.readlines()
money, all_coins = list(map(int, _input[0].split()))
coins = list(map(int, _input[1].split()))
# assert len(coins) == c_num
rec = [float("inf")] * (money + 1)
ans = solve()
print((ans.pop()))
| false | 0 | [
"- for i in range(c_num):",
"+ for i in range(all_coins):",
"- money, c_num = list(map(int, _input[0].split()))",
"+ money, all_coins = list(map(int, _input[0].split()))"
] | false | 0.007834 | 0.186338 | 0.042041 | [
"s292468417",
"s857065072"
] |
u380524497 | p02845 | python | s846487259 | s441739777 | 112 | 73 | 13,964 | 20,488 | Accepted | Accepted | 34.82 | n = int(eval(input()))
A = list(map(int, input().split()))
mod = 10**9 + 7
ans = 1
hats = [0, 0, 0]
for a in A:
count = hats.count(a)
if count == 0:
print((0))
exit()
idx = hats.index(a)
hats[idx] += 1
ans *= count
ans %= mod
print(ans) | import sys
input = sys.stdin.readline
mod = 10**9 + 7
def main():
n = int(eval(input()))
A = list(map(int, input().split()))
candidates = [0] * (n+1)
candidates[0] = 3
ans = 1
for a in A:
ans *= candidates[a]
ans %= mod
candidates[a] -= 1
candidates[a+1] += 1
print(ans)
if __name__ == "__main__":
main()
| 19 | 22 | 294 | 389 | n = int(eval(input()))
A = list(map(int, input().split()))
mod = 10**9 + 7
ans = 1
hats = [0, 0, 0]
for a in A:
count = hats.count(a)
if count == 0:
print((0))
exit()
idx = hats.index(a)
hats[idx] += 1
ans *= count
ans %= mod
print(ans)
| import sys
input = sys.stdin.readline
mod = 10**9 + 7
def main():
n = int(eval(input()))
A = list(map(int, input().split()))
candidates = [0] * (n + 1)
candidates[0] = 3
ans = 1
for a in A:
ans *= candidates[a]
ans %= mod
candidates[a] -= 1
candidates[a + 1] += 1
print(ans)
if __name__ == "__main__":
main()
| false | 13.636364 | [
"-n = int(eval(input()))",
"-A = list(map(int, input().split()))",
"+import sys",
"+",
"+input = sys.stdin.readline",
"-ans = 1",
"-hats = [0, 0, 0]",
"-for a in A:",
"- count = hats.count(a)",
"- if count == 0:",
"- print((0))",
"- exit()",
"- idx = hats.index(a)",
"- hats[idx] += 1",
"- ans *= count",
"- ans %= mod",
"-print(ans)",
"+",
"+",
"+def main():",
"+ n = int(eval(input()))",
"+ A = list(map(int, input().split()))",
"+ candidates = [0] * (n + 1)",
"+ candidates[0] = 3",
"+ ans = 1",
"+ for a in A:",
"+ ans *= candidates[a]",
"+ ans %= mod",
"+ candidates[a] -= 1",
"+ candidates[a + 1] += 1",
"+ print(ans)",
"+",
"+",
"+if __name__ == \"__main__\":",
"+ main()"
] | false | 0.036357 | 0.033951 | 1.070854 | [
"s846487259",
"s441739777"
] |
u312025627 | p03854 | python | s170881440 | s921129136 | 76 | 18 | 3,192 | 3,188 | Accepted | Accepted | 76.32 | def main():
S = input()
S = S[::-1]
ans = ["maerd", "remaerd", "esare", "resare"]
while S:
for a in ans:
if S[:5] in ans:
S = S.replace(S[:5], "", 1)
break
elif S[:6] in ans:
S = S.replace(S[:6], "", 1)
break
elif S[:7] in ans:
S = S.replace(S[:7], "", 1)
break
else:
return print("NO")
else:
return print("YES")
if __name__ == '__main__':
main()
| def main():
S = input()
if S.replace("eraser", "").replace("erase", "").replace("dreamer", "").\
replace("dream", ""):
return print("NO")
else:
return print("YES")
if __name__ == '__main__':
main()
| 23 | 11 | 563 | 254 | def main():
S = input()
S = S[::-1]
ans = ["maerd", "remaerd", "esare", "resare"]
while S:
for a in ans:
if S[:5] in ans:
S = S.replace(S[:5], "", 1)
break
elif S[:6] in ans:
S = S.replace(S[:6], "", 1)
break
elif S[:7] in ans:
S = S.replace(S[:7], "", 1)
break
else:
return print("NO")
else:
return print("YES")
if __name__ == "__main__":
main()
| def main():
S = input()
if (
S.replace("eraser", "")
.replace("erase", "")
.replace("dreamer", "")
.replace("dream", "")
):
return print("NO")
else:
return print("YES")
if __name__ == "__main__":
main()
| false | 52.173913 | [
"- S = S[::-1]",
"- ans = [\"maerd\", \"remaerd\", \"esare\", \"resare\"]",
"- while S:",
"- for a in ans:",
"- if S[:5] in ans:",
"- S = S.replace(S[:5], \"\", 1)",
"- break",
"- elif S[:6] in ans:",
"- S = S.replace(S[:6], \"\", 1)",
"- break",
"- elif S[:7] in ans:",
"- S = S.replace(S[:7], \"\", 1)",
"- break",
"- else:",
"- return print(\"NO\")",
"+ if (",
"+ S.replace(\"eraser\", \"\")",
"+ .replace(\"erase\", \"\")",
"+ .replace(\"dreamer\", \"\")",
"+ .replace(\"dream\", \"\")",
"+ ):",
"+ return print(\"NO\")"
] | false | 0.036692 | 0.065621 | 0.559143 | [
"s170881440",
"s921129136"
] |
u225388820 | p03425 | python | s789668183 | s302072069 | 269 | 151 | 3,064 | 3,064 | Accepted | Accepted | 43.87 | import itertools
'''
∧_,,∧ 究極奥義「WAがACになーれ！！」
（`・ω・)つ━☆・*。
⊂ ノ ・゜+.
し’´Ｊ *・
'''
n=int(eval(input()))
a=["M","A","R","C","H"]
cnt=[0]*5
for i in range(n):
s=eval(input())
for i in range(5):
if s[0]==a[i]:
cnt[i]+=1
ans=0
for i in itertools.combinations(list(range(5)),3):
ans+=cnt[i[0]]*cnt[i[1]]*cnt[i[2]]
print(ans) | import sys
input = sys.stdin.readline
n=int(eval(input()))
a=["M","A","R","C","H"]
cnt=[0]*5
for i in range(n):
s=eval(input())
for i in range(5):
if s[0]==a[i]:
cnt[i]+=1
ans=0
for i in range(3):
for j in range(i+1,4):
for k in range(j+1,5):
ans+=cnt[i]*cnt[j]*cnt[k]
print(ans)
| 20 | 17 | 365 | 325 | import itertools
"""
∧_,,∧ 究極奥義「WAがACになーれ！！」
（`・ω・)つ━☆・*。
⊂ ノ ・゜+.
し’´Ｊ *・
"""
n = int(eval(input()))
a = ["M", "A", "R", "C", "H"]
cnt = [0] * 5
for i in range(n):
s = eval(input())
for i in range(5):
if s[0] == a[i]:
cnt[i] += 1
ans = 0
for i in itertools.combinations(list(range(5)), 3):
ans += cnt[i[0]] * cnt[i[1]] * cnt[i[2]]
print(ans)
| import sys
input = sys.stdin.readline
n = int(eval(input()))
a = ["M", "A", "R", "C", "H"]
cnt = [0] * 5
for i in range(n):
s = eval(input())
for i in range(5):
if s[0] == a[i]:
cnt[i] += 1
ans = 0
for i in range(3):
for j in range(i + 1, 4):
for k in range(j + 1, 5):
ans += cnt[i] * cnt[j] * cnt[k]
print(ans)
| false | 15 | [
"-import itertools",
"+import sys",
"-\"\"\"",
"- ∧_,,∧ 究極奥義「WAがACになーれ！！」",
"- （`・ω・)つ━☆・*。",
"- ⊂ ノ ・゜+.",
"- し’´Ｊ *・",
"-\"\"\"",
"+input = sys.stdin.readline",
"-for i in itertools.combinations(list(range(5)), 3):",
"- ans += cnt[i[0]] * cnt[i[1]] * cnt[i[2]]",
"+for i in range(3):",
"+ for j in range(i + 1, 4):",
"+ for k in range(j + 1, 5):",
"+ ans += cnt[i] * cnt[j] * cnt[k]"
] | false | 0.034706 | 0.0354 | 0.980385 | [
"s789668183",
"s302072069"
] |
u476604182 | p02851 | python | s476070349 | s190661208 | 518 | 339 | 71,048 | 40,792 | Accepted | Accepted | 34.56 | from collections import defaultdict
N, K = list(map(int, input().split()))
A = [(int(c)%K)-1 for c in input().split()]
B = [0]
for c in A:
B += [B[-1]+c]
dic = defaultdict(int)
ldic = defaultdict(int)
for i in range(min(K,N+1)):
c = B[i]
dic[c%K] += 1
ans = 0
#print(dic)
for i in range(1,N+1):
x = B[i-1]
ldic[x%K] += 1
ans += dic[x%K]-ldic[x%K]
if K+i-1<=N:
dic[B[K+i-1]%K] += 1
"""
print('###############')
print(i,x, ans)
print(dic)
print(ldic)
"""
print(ans)
| from itertools import accumulate
from collections import Counter
N,K,*A = list(map(int, open(0).read().split()))
A = [a-1 for a in A]
B = [b%K for b in accumulate(A)]
if K>N:
Cnt = Counter(B)
ans = Cnt[0]+sum(v*(v-1)//2 for v in list(Cnt.values()))
else:
Cnt = Counter(B[:K])
ans = Cnt[0]+sum(v*(v-1)//2 for v in list(Cnt.values()))
if B[K-1]==0:
ans -= 1
for i in range(N-K):
Cnt[B[i]] -= 1
ans += Cnt[B[i+K]]
Cnt[B[i+K]] += 1
print(ans) | 26 | 18 | 513 | 465 | from collections import defaultdict
N, K = list(map(int, input().split()))
A = [(int(c) % K) - 1 for c in input().split()]
B = [0]
for c in A:
B += [B[-1] + c]
dic = defaultdict(int)
ldic = defaultdict(int)
for i in range(min(K, N + 1)):
c = B[i]
dic[c % K] += 1
ans = 0
# print(dic)
for i in range(1, N + 1):
x = B[i - 1]
ldic[x % K] += 1
ans += dic[x % K] - ldic[x % K]
if K + i - 1 <= N:
dic[B[K + i - 1] % K] += 1
"""
print('###############')
print(i,x, ans)
print(dic)
print(ldic)
"""
print(ans)
| from itertools import accumulate
from collections import Counter
N, K, *A = list(map(int, open(0).read().split()))
A = [a - 1 for a in A]
B = [b % K for b in accumulate(A)]
if K > N:
Cnt = Counter(B)
ans = Cnt[0] + sum(v * (v - 1) // 2 for v in list(Cnt.values()))
else:
Cnt = Counter(B[:K])
ans = Cnt[0] + sum(v * (v - 1) // 2 for v in list(Cnt.values()))
if B[K - 1] == 0:
ans -= 1
for i in range(N - K):
Cnt[B[i]] -= 1
ans += Cnt[B[i + K]]
Cnt[B[i + K]] += 1
print(ans)
| false | 30.769231 | [
"-from collections import defaultdict",
"+from itertools import accumulate",
"+from collections import Counter",
"-N, K = list(map(int, input().split()))",
"-A = [(int(c) % K) - 1 for c in input().split()]",
"-B = [0]",
"-for c in A:",
"- B += [B[-1] + c]",
"-dic = defaultdict(int)",
"-ldic = defaultdict(int)",
"-for i in range(min(K, N + 1)):",
"- c = B[i]",
"- dic[c % K] += 1",
"-ans = 0",
"-# print(dic)",
"-for i in range(1, N + 1):",
"- x = B[i - 1]",
"- ldic[x % K] += 1",
"- ans += dic[x % K] - ldic[x % K]",
"- if K + i - 1 <= N:",
"- dic[B[K + i - 1] % K] += 1",
"- \"\"\"",
"- print('###############')",
"- print(i,x, ans)",
"- print(dic)",
"- print(ldic)",
"- \"\"\"",
"+N, K, *A = list(map(int, open(0).read().split()))",
"+A = [a - 1 for a in A]",
"+B = [b % K for b in accumulate(A)]",
"+if K > N:",
"+ Cnt = Counter(B)",
"+ ans = Cnt[0] + sum(v * (v - 1) // 2 for v in list(Cnt.values()))",
"+else:",
"+ Cnt = Counter(B[:K])",
"+ ans = Cnt[0] + sum(v * (v - 1) // 2 for v in list(Cnt.values()))",
"+ if B[K - 1] == 0:",
"+ ans -= 1",
"+ for i in range(N - K):",
"+ Cnt[B[i]] -= 1",
"+ ans += Cnt[B[i + K]]",
"+ Cnt[B[i + K]] += 1"
] | false | 0.038612 | 0.007217 | 5.349913 | [
"s476070349",
"s190661208"
] |
u062655521 | p03448 | python | s279791510 | s485458313 | 28 | 18 | 3,064 | 3,060 | Accepted | Accepted | 35.71 | a = int(eval(input()))
b = int(eval(input()))
c = int(eval(input()))
x = int(eval(input()))
cnt = 0
for i in range(a + 1):
if 500 * i <= x:
p = x - 500 * i
for j in range(b + 1):
if 100 * j <= p:
q = p - 100 * j
for k in range(c + 1):
if q - 50 * k == 0:
cnt += 1
print(cnt) | a = int(eval(input()))
b = int(eval(input()))
c = int(eval(input()))
x = int(eval(input()))
n = 0
for i in range(a + 1):
for j in range(b + 1):
k = (x - 500 * i - 100 * j) // 50
if 0 <= k <= c:
n += 1
print(n) | 17 | 13 | 295 | 207 | a = int(eval(input()))
b = int(eval(input()))
c = int(eval(input()))
x = int(eval(input()))
cnt = 0
for i in range(a + 1):
if 500 * i <= x:
p = x - 500 * i
for j in range(b + 1):
if 100 * j <= p:
q = p - 100 * j
for k in range(c + 1):
if q - 50 * k == 0:
cnt += 1
print(cnt)
| a = int(eval(input()))
b = int(eval(input()))
c = int(eval(input()))
x = int(eval(input()))
n = 0
for i in range(a + 1):
for j in range(b + 1):
k = (x - 500 * i - 100 * j) // 50
if 0 <= k <= c:
n += 1
print(n)
| false | 23.529412 | [
"-cnt = 0",
"+n = 0",
"- if 500 * i <= x:",
"- p = x - 500 * i",
"- for j in range(b + 1):",
"- if 100 * j <= p:",
"- q = p - 100 * j",
"- for k in range(c + 1):",
"- if q - 50 * k == 0:",
"- cnt += 1",
"-print(cnt)",
"+ for j in range(b + 1):",
"+ k = (x - 500 * i - 100 * j) // 50",
"+ if 0 <= k <= c:",
"+ n += 1",
"+print(n)"
] | false | 0.044161 | 0.007459 | 5.920856 | [
"s279791510",
"s485458313"
] |
u545368057 | p02588 | python | s886896258 | s540861757 | 918 | 786 | 20,204 | 20,060 | Accepted | Accepted | 14.38 | n = int(eval(input()))
As = [int(round(float(eval(input()))*10**9)) for _ in range(n)]
fives = [0] * n
twos = [0] * n
cnts = [[0] * 20 for i in range(20)]
for i, a in enumerate(As):
tmp = a
five = 0
two = 0
while tmp % 5 == 0:
five += 1
tmp //= 5
while tmp % 2 == 0:
two += 1
tmp //= 2
cnts[min(two,18)][min(five,18)] += 1
# fiveの和とtwoの和が共に18以上ならOK
# 条件を満たすcnts
ans = 0
for i1 in range(19):
for j1 in range(19):
for i2 in range(19):
for j2 in range(19):
if i1+i2 >= 18 and j1+j2>=18:
ans += cnts[i1][j1]*cnts[i2][j2]
# 自分自身を除外
for i in range(19):
for j in range(19):
if i*2 >= 18 and j*2 >= 18:
ans -= cnts[i][j]
# ダブルカウント
ans //= 2
print(ans) | import sys
input = sys.stdin.readline
n = int(eval(input()))
As = [int(round(float(eval(input()))*10**9)) for _ in range(n)]
fives = [0] * n
twos = [0] * n
cnts = [[0] * 20 for i in range(20)]
for i, a in enumerate(As):
tmp = a
five = 0
two = 0
while tmp % 5 == 0:
five += 1
tmp //= 5
while tmp % 2 == 0:
two += 1
tmp //= 2
cnts[min(two,18)][min(five,18)] += 1
# fiveの和とtwoの和が共に18以上ならOK
# 条件を満たすcnts
ans = 0
for i1 in range(19):
for j1 in range(19):
for i2 in range(19):
for j2 in range(19):
if i1+i2 >= 18 and j1+j2>=18:
ans += cnts[i1][j1]*cnts[i2][j2]
# 自分自身を除外
for i in range(19):
for j in range(19):
if i*2 >= 18 and j*2 >= 18:
ans -= cnts[i][j]
# ダブルカウント
ans //= 2
print(ans) | 37 | 40 | 820 | 862 | n = int(eval(input()))
As = [int(round(float(eval(input())) * 10**9)) for _ in range(n)]
fives = [0] * n
twos = [0] * n
cnts = [[0] * 20 for i in range(20)]
for i, a in enumerate(As):
tmp = a
five = 0
two = 0
while tmp % 5 == 0:
five += 1
tmp //= 5
while tmp % 2 == 0:
two += 1
tmp //= 2
cnts[min(two, 18)][min(five, 18)] += 1
# fiveの和とtwoの和が共に18以上ならOK
# 条件を満たすcnts
ans = 0
for i1 in range(19):
for j1 in range(19):
for i2 in range(19):
for j2 in range(19):
if i1 + i2 >= 18 and j1 + j2 >= 18:
ans += cnts[i1][j1] * cnts[i2][j2]
# 自分自身を除外
for i in range(19):
for j in range(19):
if i * 2 >= 18 and j * 2 >= 18:
ans -= cnts[i][j]
# ダブルカウント
ans //= 2
print(ans)
| import sys
input = sys.stdin.readline
n = int(eval(input()))
As = [int(round(float(eval(input())) * 10**9)) for _ in range(n)]
fives = [0] * n
twos = [0] * n
cnts = [[0] * 20 for i in range(20)]
for i, a in enumerate(As):
tmp = a
five = 0
two = 0
while tmp % 5 == 0:
five += 1
tmp //= 5
while tmp % 2 == 0:
two += 1
tmp //= 2
cnts[min(two, 18)][min(five, 18)] += 1
# fiveの和とtwoの和が共に18以上ならOK
# 条件を満たすcnts
ans = 0
for i1 in range(19):
for j1 in range(19):
for i2 in range(19):
for j2 in range(19):
if i1 + i2 >= 18 and j1 + j2 >= 18:
ans += cnts[i1][j1] * cnts[i2][j2]
# 自分自身を除外
for i in range(19):
for j in range(19):
if i * 2 >= 18 and j * 2 >= 18:
ans -= cnts[i][j]
# ダブルカウント
ans //= 2
print(ans)
| false | 7.5 | [
"+import sys",
"+",
"+input = sys.stdin.readline"
] | false | 0.086412 | 0.072562 | 1.190867 | [
"s886896258",
"s540861757"
] |
u627600101 | p02722 | python | s321084004 | s047359335 | 96 | 65 | 9,404 | 69,264 | Accepted | Accepted | 32.29 | N = int(eval(input()))
originalN = 0 +N
if N == 2:
print((1))
exit()
ans = 0
"""
primenum = [2]
count = [0 for _ in range(int(N**0.5)+2)]
for k in range(3, len(count), 2):
if count[k] == 0:
primenum.append(k)
for j in range(k, len(count), k):
count[j] = 1
def factorization(n):
lis = []
k = 0
while primenum[k] <= n:
if n%primenum[k] == 0:
c = 0
while n%primenum[k] == 0:
n //= primenum[k]
c += 1
lis.append([primenum[k], c])
else:
k += 1
if k > len(primenum)-1:
break
if n > 1:
lis.append([n, 1])
return lis
"""
def factorization(n):
lis = []
if n % 2 == 0:
c = 0
while n%2 == 0:
n //= 2
c += 1
lis.append([2, c])
k = 3
while k*k <= n:
if n%k == 0:
c = 0
while n%k == 0:
n //= k
c += 1
lis.append([k, c])
else:
k += 2
if n > 1:
lis.append([n, 1])
return lis
list1 = factorization(N-1)
#print(factorization(N-1))
ans1 = 1
for k in range(len(list1)):
ans1*= list1[k][1]+1
ans1 -= 1
ans += ans1
#print(ans1)
def operation(K):
N = originalN
while N%K == 0:
N //= K
if N%K == 1:
return True
else:
return False
list2 = factorization(N)
#print(list2)
factorlist = [1]
for l in range(len(list2)):
list3 = []
for j in range(list2[l][1]):
for k in range(len(factorlist)):
list3.append(factorlist[k]*list2[l][0]**(j+1))
factorlist += list3
factorlist = factorlist[1:-1]
#print(factorlist)
ans2 = 1
for item in factorlist:
if operation(item):
#print(item)
ans2 +=1
ans += ans2
#print(ans2)
print(ans) | N = int(eval(input()))
if N == 2:
print((1))
exit()
ans = 0
def factorization(n):
lis = []
if n % 2 == 0:
c = 0
while n%2 == 0:
n //= 2
c += 1
lis.append([2, c])
k = 3
while k*k <= n:
if n%k == 0:
c = 0
while n%k == 0:
n //= k
c += 1
lis.append([k, c])
else:
k += 2
if n > 1:
lis.append([n, 1])
return lis
list1 = factorization(N-1)
ans1 = 1
for k in range(len(list1)):
ans1 *= list1[k][1]+1
ans += ans1-1
def operation(K):
n = N
while n%K == 0:
n //= K
if n%K == 1:
return True
else:
return False
list2 = factorization(N)
factorlist = [1]
for l in range(len(list2)):
list3 = []
for j in range(list2[l][1]):
for k in range(len(factorlist)):
list3.append(factorlist[k]*list2[l][0]**(j+1))
factorlist += list3
factorlist = factorlist[1:-1]
ans += 1
for item in factorlist:
if operation(item):
ans +=1
print(ans) | 98 | 59 | 1,726 | 1,002 | N = int(eval(input()))
originalN = 0 + N
if N == 2:
print((1))
exit()
ans = 0
"""
primenum = [2]
count = [0 for _ in range(int(N**0.5)+2)]
for k in range(3, len(count), 2):
if count[k] == 0:
primenum.append(k)
for j in range(k, len(count), k):
count[j] = 1
def factorization(n):
lis = []
k = 0
while primenum[k] <= n:
if n%primenum[k] == 0:
c = 0
while n%primenum[k] == 0:
n //= primenum[k]
c += 1
lis.append([primenum[k], c])
else:
k += 1
if k > len(primenum)-1:
break
if n > 1:
lis.append([n, 1])
return lis
"""
def factorization(n):
lis = []
if n % 2 == 0:
c = 0
while n % 2 == 0:
n //= 2
c += 1
lis.append([2, c])
k = 3
while k * k <= n:
if n % k == 0:
c = 0
while n % k == 0:
n //= k
c += 1
lis.append([k, c])
else:
k += 2
if n > 1:
lis.append([n, 1])
return lis
list1 = factorization(N - 1)
# print(factorization(N-1))
ans1 = 1
for k in range(len(list1)):
ans1 *= list1[k][1] + 1
ans1 -= 1
ans += ans1
# print(ans1)
def operation(K):
N = originalN
while N % K == 0:
N //= K
if N % K == 1:
return True
else:
return False
list2 = factorization(N)
# print(list2)
factorlist = [1]
for l in range(len(list2)):
list3 = []
for j in range(list2[l][1]):
for k in range(len(factorlist)):
list3.append(factorlist[k] * list2[l][0] ** (j + 1))
factorlist += list3
factorlist = factorlist[1:-1]
# print(factorlist)
ans2 = 1
for item in factorlist:
if operation(item):
# print(item)
ans2 += 1
ans += ans2
# print(ans2)
print(ans)
| N = int(eval(input()))
if N == 2:
print((1))
exit()
ans = 0
def factorization(n):
lis = []
if n % 2 == 0:
c = 0
while n % 2 == 0:
n //= 2
c += 1
lis.append([2, c])
k = 3
while k * k <= n:
if n % k == 0:
c = 0
while n % k == 0:
n //= k
c += 1
lis.append([k, c])
else:
k += 2
if n > 1:
lis.append([n, 1])
return lis
list1 = factorization(N - 1)
ans1 = 1
for k in range(len(list1)):
ans1 *= list1[k][1] + 1
ans += ans1 - 1
def operation(K):
n = N
while n % K == 0:
n //= K
if n % K == 1:
return True
else:
return False
list2 = factorization(N)
factorlist = [1]
for l in range(len(list2)):
list3 = []
for j in range(list2[l][1]):
for k in range(len(factorlist)):
list3.append(factorlist[k] * list2[l][0] ** (j + 1))
factorlist += list3
factorlist = factorlist[1:-1]
ans += 1
for item in factorlist:
if operation(item):
ans += 1
print(ans)
| false | 39.795918 | [
"-originalN = 0 + N",
"-\"\"\"",
"-primenum = [2]",
"-count = [0 for _ in range(int(N**0.5)+2)]",
"-for k in range(3, len(count), 2):",
"- if count[k] == 0:",
"- primenum.append(k)",
"- for j in range(k, len(count), k):",
"- count[j] = 1",
"-def factorization(n):",
"- lis = []",
"- k = 0",
"- while primenum[k] <= n:",
"- if n%primenum[k] == 0:",
"- c = 0",
"- while n%primenum[k] == 0:",
"- n //= primenum[k]",
"- c += 1",
"- lis.append([primenum[k], c])",
"- else:",
"- k += 1",
"- if k > len(primenum)-1:",
"- break",
"- if n > 1:",
"- lis.append([n, 1])",
"- return lis",
"-\"\"\"",
"-# print(factorization(N-1))",
"-ans1 -= 1",
"-ans += ans1",
"-# print(ans1)",
"+ans += ans1 - 1",
"+",
"+",
"- N = originalN",
"- while N % K == 0:",
"- N //= K",
"- if N % K == 1:",
"+ n = N",
"+ while n % K == 0:",
"+ n //= K",
"+ if n % K == 1:",
"-# print(list2)",
"-# print(factorlist)",
"-ans2 = 1",
"+ans += 1",
"- # print(item)",
"- ans2 += 1",
"-ans += ans2",
"-# print(ans2)",
"+ ans += 1"
] | false | 0.071398 | 0.236487 | 0.301911 | [
"s321084004",
"s047359335"
] |
u729133443 | p02735 | python | s700816545 | s595637678 | 22 | 20 | 3,064 | 3,064 | Accepted | Accepted | 9.09 | def main():
import sys
input=sys.stdin.buffer.readline
h,w=list(map(int,input().split()))
s=eval(input())
a=x=s[0]>>3
b=y=5-a
d=[(b,a)]
for i in range(1,w):
f=s[i]>>3
b+=a^f
a=f
d+=(b,a),
for _ in range(1,h):
s=eval(input())
f=s[0]>>3
y+=x^f
b=y
a=x=f
p=[(b,a)]
for i in range(1,w):
f=s[i]>>3
b+=a^f
c,g=d[i]
c+=f^g
if b>c:b=c
a=f
p+=(b,a),
d=p
print((b+1>>1))
main() | def main():
import sys
input=sys.stdin.buffer.readline
h,w=list(map(int,input().split()))
s=eval(input())
a=b=x=y=s[0]==35
d=[(b,a)]
for i in range(1,w):
f=s[i]==35
b+=a^f
a=f
d+=(b,a),
for _ in range(1,h):
s=eval(input())
f=s[0]==35
y+=x^f
b=y
a=x=f
p=[(b,a)]
for i in range(1,w):
f=s[i]==35
b+=a^f
c,g=d[i]
c+=f^g
if b>c:b=c
a=f
p+=(b,a),
d=p
print((b+1>>1))
main() | 31 | 30 | 487 | 484 | def main():
import sys
input = sys.stdin.buffer.readline
h, w = list(map(int, input().split()))
s = eval(input())
a = x = s[0] >> 3
b = y = 5 - a
d = [(b, a)]
for i in range(1, w):
f = s[i] >> 3
b += a ^ f
a = f
d += ((b, a),)
for _ in range(1, h):
s = eval(input())
f = s[0] >> 3
y += x ^ f
b = y
a = x = f
p = [(b, a)]
for i in range(1, w):
f = s[i] >> 3
b += a ^ f
c, g = d[i]
c += f ^ g
if b > c:
b = c
a = f
p += ((b, a),)
d = p
print((b + 1 >> 1))
main()
| def main():
import sys
input = sys.stdin.buffer.readline
h, w = list(map(int, input().split()))
s = eval(input())
a = b = x = y = s[0] == 35
d = [(b, a)]
for i in range(1, w):
f = s[i] == 35
b += a ^ f
a = f
d += ((b, a),)
for _ in range(1, h):
s = eval(input())
f = s[0] == 35
y += x ^ f
b = y
a = x = f
p = [(b, a)]
for i in range(1, w):
f = s[i] == 35
b += a ^ f
c, g = d[i]
c += f ^ g
if b > c:
b = c
a = f
p += ((b, a),)
d = p
print((b + 1 >> 1))
main()
| false | 3.225806 | [
"- a = x = s[0] >> 3",
"- b = y = 5 - a",
"+ a = b = x = y = s[0] == 35",
"- f = s[i] >> 3",
"+ f = s[i] == 35",
"- f = s[0] >> 3",
"+ f = s[0] == 35",
"- f = s[i] >> 3",
"+ f = s[i] == 35"
] | false | 0.04885 | 0.049675 | 0.983378 | [
"s700816545",
"s595637678"
] |
u372144784 | p03162 | python | s025021237 | s652449156 | 639 | 297 | 60,268 | 54,380 | Accepted | Accepted | 53.52 | n = int(eval(input()))
dp = [[0]*3 for i in range(n)]
a,b,c = list(map(int,input().split()))
dp[0] = [a,b,c]
for i in range(1,n):
a,b,c = list(map(int,input().split()))
dp[i][0] = max(dp[i-1][1],dp[i-1][2]) + a
dp[i][1] = max(dp[i-1][0],dp[i-1][2]) + b
dp[i][2] = max(dp[i-1][0],dp[i-1][1]) + c
print((max(dp[-1]))) | import sys
readline = sys.stdin.buffer.readline
def even(n): return 1 if n%2==0 else 0
n = int(readline())
dp = [[0]*3 for _ in range(n)]
lst1 = list(map(int,readline().split()))
for i in range(3):
dp[0][i] = lst1[i]
for i in range(n-1):
lst1 = list(map(int,readline().split()))
dp[i+1][0] = max(dp[i][1]+lst1[0],dp[i][2]+lst1[0])
dp[i+1][1] = max(dp[i][0]+lst1[1],dp[i][2]+lst1[1])
dp[i+1][2] = max(dp[i][0]+lst1[2],dp[i][1]+lst1[2])
print((max(dp[-1]))) | 12 | 16 | 324 | 475 | n = int(eval(input()))
dp = [[0] * 3 for i in range(n)]
a, b, c = list(map(int, input().split()))
dp[0] = [a, b, c]
for i in range(1, n):
a, b, c = list(map(int, input().split()))
dp[i][0] = max(dp[i - 1][1], dp[i - 1][2]) + a
dp[i][1] = max(dp[i - 1][0], dp[i - 1][2]) + b
dp[i][2] = max(dp[i - 1][0], dp[i - 1][1]) + c
print((max(dp[-1])))
| import sys
readline = sys.stdin.buffer.readline
def even(n):
return 1 if n % 2 == 0 else 0
n = int(readline())
dp = [[0] * 3 for _ in range(n)]
lst1 = list(map(int, readline().split()))
for i in range(3):
dp[0][i] = lst1[i]
for i in range(n - 1):
lst1 = list(map(int, readline().split()))
dp[i + 1][0] = max(dp[i][1] + lst1[0], dp[i][2] + lst1[0])
dp[i + 1][1] = max(dp[i][0] + lst1[1], dp[i][2] + lst1[1])
dp[i + 1][2] = max(dp[i][0] + lst1[2], dp[i][1] + lst1[2])
print((max(dp[-1])))
| false | 25 | [
"-n = int(eval(input()))",
"-dp = [[0] * 3 for i in range(n)]",
"-a, b, c = list(map(int, input().split()))",
"-dp[0] = [a, b, c]",
"-for i in range(1, n):",
"- a, b, c = list(map(int, input().split()))",
"- dp[i][0] = max(dp[i - 1][1], dp[i - 1][2]) + a",
"- dp[i][1] = max(dp[i - 1][0], dp[i - 1][2]) + b",
"- dp[i][2] = max(dp[i - 1][0], dp[i - 1][1]) + c",
"+import sys",
"+",
"+readline = sys.stdin.buffer.readline",
"+",
"+",
"+def even(n):",
"+ return 1 if n % 2 == 0 else 0",
"+",
"+",
"+n = int(readline())",
"+dp = [[0] * 3 for _ in range(n)]",
"+lst1 = list(map(int, readline().split()))",
"+for i in range(3):",
"+ dp[0][i] = lst1[i]",
"+for i in range(n - 1):",
"+ lst1 = list(map(int, readline().split()))",
"+ dp[i + 1][0] = max(dp[i][1] + lst1[0], dp[i][2] + lst1[0])",
"+ dp[i + 1][1] = max(dp[i][0] + lst1[1], dp[i][2] + lst1[1])",
"+ dp[i + 1][2] = max(dp[i][0] + lst1[2], dp[i][1] + lst1[2])"
] | false | 0.042827 | 0.119423 | 0.358612 | [
"s025021237",
"s652449156"
] |
u867320886 | p03240 | python | s133772935 | s156706349 | 60 | 34 | 3,064 | 3,064 | Accepted | Accepted | 43.33 | n,*xyh=list(map(int,open(0).read().split()))
x=xyh[0::3]
y=xyh[1::3]
h=xyh[2::3]
for cx in range(101):
for cy in range(101):
hmax_i = h.index(max(h))
H = abs(cx-x[hmax_i]) + abs(cy-y[hmax_i]) + h[hmax_i]
for i in range(0,n):
if max(H-abs(cx-x[i])-abs(cy-y[i]),0) == h[i]:
if i == n-1:
print((cx,cy,H))
exit()
else:
continue
else:
break | n,*xyh=list(map(int,open(0).read().split()))
x=xyh[0::3]
y=xyh[1::3]
h=xyh[2::3]
hmax_i = h.index(max(h))
for cx in range(101):
for cy in range(101):
H = abs(cx-x[hmax_i]) + abs(cy-y[hmax_i]) + h[hmax_i]
for i in range(0,n):
if max(H-abs(cx-x[i])-abs(cy-y[i]),0) == h[i]:
if i == n-1:
print((cx,cy,H))
exit()
else:
continue
else:
break | 18 | 18 | 505 | 497 | n, *xyh = list(map(int, open(0).read().split()))
x = xyh[0::3]
y = xyh[1::3]
h = xyh[2::3]
for cx in range(101):
for cy in range(101):
hmax_i = h.index(max(h))
H = abs(cx - x[hmax_i]) + abs(cy - y[hmax_i]) + h[hmax_i]
for i in range(0, n):
if max(H - abs(cx - x[i]) - abs(cy - y[i]), 0) == h[i]:
if i == n - 1:
print((cx, cy, H))
exit()
else:
continue
else:
break
| n, *xyh = list(map(int, open(0).read().split()))
x = xyh[0::3]
y = xyh[1::3]
h = xyh[2::3]
hmax_i = h.index(max(h))
for cx in range(101):
for cy in range(101):
H = abs(cx - x[hmax_i]) + abs(cy - y[hmax_i]) + h[hmax_i]
for i in range(0, n):
if max(H - abs(cx - x[i]) - abs(cy - y[i]), 0) == h[i]:
if i == n - 1:
print((cx, cy, H))
exit()
else:
continue
else:
break
| false | 0 | [
"+hmax_i = h.index(max(h))",
"- hmax_i = h.index(max(h))"
] | false | 0.042155 | 0.051035 | 0.826005 | [
"s133772935",
"s156706349"
] |
u736479342 | p03352 | python | s384102662 | s069777378 | 29 | 25 | 8,888 | 8,980 | Accepted | Accepted | 13.79 | x = int(eval(input()))
c = 1
for b in range(1,x):
for q in range(2,x):
if b**q <=x:
c = max(c,b**q)
else:
break
print(c) | x = int(eval(input()))
c = []
for b in range(1,x+1):
for q in range(2,x+2):
a = b**q
if a <=x:
c.append(a)
else:
break
C = set(c)
print((max(C)))
| 10 | 13 | 146 | 178 | x = int(eval(input()))
c = 1
for b in range(1, x):
for q in range(2, x):
if b**q <= x:
c = max(c, b**q)
else:
break
print(c)
| x = int(eval(input()))
c = []
for b in range(1, x + 1):
for q in range(2, x + 2):
a = b**q
if a <= x:
c.append(a)
else:
break
C = set(c)
print((max(C)))
| false | 23.076923 | [
"-c = 1",
"-for b in range(1, x):",
"- for q in range(2, x):",
"- if b**q <= x:",
"- c = max(c, b**q)",
"+c = []",
"+for b in range(1, x + 1):",
"+ for q in range(2, x + 2):",
"+ a = b**q",
"+ if a <= x:",
"+ c.append(a)",
"-print(c)",
"+C = set(c)",
"+print((max(C)))"
] | false | 0.061035 | 0.042121 | 1.449059 | [
"s384102662",
"s069777378"
] |
u759412327 | p04045 | python | s936786148 | s400317375 | 86 | 77 | 2,940 | 9,152 | Accepted | Accepted | 10.47 | N,K = list(map(int,input().split()))
D = set(input().split())
while len(set(str(N))&D)>0:
N+=1
print(N) | N,K = list(map(int,input().split()))
D = set(input().split())
for n in range(N,100000):
if len(set(str(n))&D)==0:
print(n)
break | 7 | 7 | 107 | 139 | N, K = list(map(int, input().split()))
D = set(input().split())
while len(set(str(N)) & D) > 0:
N += 1
print(N)
| N, K = list(map(int, input().split()))
D = set(input().split())
for n in range(N, 100000):
if len(set(str(n)) & D) == 0:
print(n)
break
| false | 0 | [
"-while len(set(str(N)) & D) > 0:",
"- N += 1",
"-print(N)",
"+for n in range(N, 100000):",
"+ if len(set(str(n)) & D) == 0:",
"+ print(n)",
"+ break"
] | false | 0.036015 | 0.086576 | 0.415996 | [
"s936786148",
"s400317375"
] |
u350064373 | p02394 | python | s668142022 | s271246259 | 30 | 20 | 7,668 | 5,596 | Accepted | Accepted | 33.33 | W, H, x, y, r = list(map(int, input().split()))
if x-r >= 0 and y-r >= 0 and x+r <= W and y+r <= H:
print("Yes")
else:
print("No") | W,H,x,y,r = list(map(int,input().split()))
if H >= y+r and W >= x+r and 0 <= y-r and 0 <= x-r:
print('Yes')
else:
print('No')
| 5 | 5 | 136 | 132 | W, H, x, y, r = list(map(int, input().split()))
if x - r >= 0 and y - r >= 0 and x + r <= W and y + r <= H:
print("Yes")
else:
print("No")
| W, H, x, y, r = list(map(int, input().split()))
if H >= y + r and W >= x + r and 0 <= y - r and 0 <= x - r:
print("Yes")
else:
print("No")
| false | 0 | [
"-if x - r >= 0 and y - r >= 0 and x + r <= W and y + r <= H:",
"+if H >= y + r and W >= x + r and 0 <= y - r and 0 <= x - r:"
] | false | 0.070559 | 0.066711 | 1.057681 | [
"s668142022",
"s271246259"
] |
u476604182 | p03222 | python | s643688326 | s761064923 | 210 | 145 | 41,968 | 3,064 | Accepted | Accepted | 30.95 | H, W, K = list(map(int, input().split()))
MOD = 10**9+7
dp = [[0]*W for i in range(H+1)]
dp[0][0] = 1
ls = []
for h in range(2**(W-1)):
log = ''
flag = True
for x in range(W-1):
if h%2==1 and flag:
log += '1'
flag = False
else:
log += '0'
flag = True
h >>= 1
ls += [log]
if W==1:
ls = ['0']
ls = set(ls)
for i in range(H):
for j in range(W):
# print(dp[-1], j)
for log in ls:
if j==0:
if log[j]=='1':
dp[i+1][j+1] += dp[i][j]%MOD
else:
dp[i+1][j] += dp[i][j]%MOD
elif j==W-1:
if log[j-1]=='1':
dp[i+1][j-1] += dp[i][j]%MOD
else:
dp[i+1][j] += dp[i][j]%MOD
else:
if log[j-1]=='1':
dp[i+1][j-1] += dp[i][j]%MOD
elif log[j]=='1':
dp[i+1][j+1] += dp[i][j]%MOD
else:
dp[i+1][j] += dp[i][j]%MOD
print((dp[-1][K-1]%MOD)) | H, W, K = list(map(int, input().split()))
A = [[0]*W for i in range(H+1)]
A[0][0] = 1
MOD = 10**9+7
for i in range(H):
for j in range(W):
for k in range(1<<(W-1)):
for l in range(W-1):
if (k>>l)&1 and (k>>(l+1))&1:
break
else:
if j>0 and (k>>(j-1))&1:
A[i+1][j-1] += A[i][j]
A[i+1][j-1] %= MOD
elif j<W-1 and (k>>j)&1:
A[i+1][j+1] += A[i][j]
A[i+1][j+1] %= MOD
else:
A[i+1][j] += A[i][j]
A[i+1][j] %= MOD
print((A[H][K-1])) | 42 | 22 | 945 | 557 | H, W, K = list(map(int, input().split()))
MOD = 10**9 + 7
dp = [[0] * W for i in range(H + 1)]
dp[0][0] = 1
ls = []
for h in range(2 ** (W - 1)):
log = ""
flag = True
for x in range(W - 1):
if h % 2 == 1 and flag:
log += "1"
flag = False
else:
log += "0"
flag = True
h >>= 1
ls += [log]
if W == 1:
ls = ["0"]
ls = set(ls)
for i in range(H):
for j in range(W):
# print(dp[-1], j)
for log in ls:
if j == 0:
if log[j] == "1":
dp[i + 1][j + 1] += dp[i][j] % MOD
else:
dp[i + 1][j] += dp[i][j] % MOD
elif j == W - 1:
if log[j - 1] == "1":
dp[i + 1][j - 1] += dp[i][j] % MOD
else:
dp[i + 1][j] += dp[i][j] % MOD
else:
if log[j - 1] == "1":
dp[i + 1][j - 1] += dp[i][j] % MOD
elif log[j] == "1":
dp[i + 1][j + 1] += dp[i][j] % MOD
else:
dp[i + 1][j] += dp[i][j] % MOD
print((dp[-1][K - 1] % MOD))
| H, W, K = list(map(int, input().split()))
A = [[0] * W for i in range(H + 1)]
A[0][0] = 1
MOD = 10**9 + 7
for i in range(H):
for j in range(W):
for k in range(1 << (W - 1)):
for l in range(W - 1):
if (k >> l) & 1 and (k >> (l + 1)) & 1:
break
else:
if j > 0 and (k >> (j - 1)) & 1:
A[i + 1][j - 1] += A[i][j]
A[i + 1][j - 1] %= MOD
elif j < W - 1 and (k >> j) & 1:
A[i + 1][j + 1] += A[i][j]
A[i + 1][j + 1] %= MOD
else:
A[i + 1][j] += A[i][j]
A[i + 1][j] %= MOD
print((A[H][K - 1]))
| false | 47.619048 | [
"+A = [[0] * W for i in range(H + 1)]",
"+A[0][0] = 1",
"-dp = [[0] * W for i in range(H + 1)]",
"-dp[0][0] = 1",
"-ls = []",
"-for h in range(2 ** (W - 1)):",
"- log = \"\"",
"- flag = True",
"- for x in range(W - 1):",
"- if h % 2 == 1 and flag:",
"- log += \"1\"",
"- flag = False",
"- else:",
"- log += \"0\"",
"- flag = True",
"- h >>= 1",
"- ls += [log]",
"-if W == 1:",
"- ls = [\"0\"]",
"-ls = set(ls)",
"- # print(dp[-1], j)",
"- for log in ls:",
"- if j == 0:",
"- if log[j] == \"1\":",
"- dp[i + 1][j + 1] += dp[i][j] % MOD",
"+ for k in range(1 << (W - 1)):",
"+ for l in range(W - 1):",
"+ if (k >> l) & 1 and (k >> (l + 1)) & 1:",
"+ break",
"+ else:",
"+ if j > 0 and (k >> (j - 1)) & 1:",
"+ A[i + 1][j - 1] += A[i][j]",
"+ A[i + 1][j - 1] %= MOD",
"+ elif j < W - 1 and (k >> j) & 1:",
"+ A[i + 1][j + 1] += A[i][j]",
"+ A[i + 1][j + 1] %= MOD",
"- dp[i + 1][j] += dp[i][j] % MOD",
"- elif j == W - 1:",
"- if log[j - 1] == \"1\":",
"- dp[i + 1][j - 1] += dp[i][j] % MOD",
"- else:",
"- dp[i + 1][j] += dp[i][j] % MOD",
"- else:",
"- if log[j - 1] == \"1\":",
"- dp[i + 1][j - 1] += dp[i][j] % MOD",
"- elif log[j] == \"1\":",
"- dp[i + 1][j + 1] += dp[i][j] % MOD",
"- else:",
"- dp[i + 1][j] += dp[i][j] % MOD",
"-print((dp[-1][K - 1] % MOD))",
"+ A[i + 1][j] += A[i][j]",
"+ A[i + 1][j] %= MOD",
"+print((A[H][K - 1]))"
] | false | 0.084731 | 0.09062 | 0.935017 | [
"s643688326",
"s761064923"
] |
u028973125 | p03420 | python | s205655338 | s808915356 | 82 | 63 | 9,128 | 65,992 | Accepted | Accepted | 23.17 | import sys
N, K = list(map(int, sys.stdin.readline().split()))
if K == 0:
print((N*N))
sys.exit()
# b は K 以上
# a は b * c + K <= a < b * (c+1)
ans = 0
for i in range(1, N+1):
# print(N // i, (i - K), max(N % i - K, 0))
tmp = (N // i) * max(i - K, 0) + max(N % i + 1 - K, 0)
ans += tmp
print(ans) | import sys
N, K = list(map(int, sys.stdin.readline().split()))
if K == 0:
print((N*N))
sys.exit()
ans = 0
for b in range(K+1, N+1):
r = N // b
# tmp = (b - K) * r
# tmp2 = (N % b + 1 - K)
# print(b, tmp, tmp2)
tmp = (b - K) * r + max(0, N % b + 1 - K)
ans += tmp
print(ans) | 17 | 18 | 326 | 318 | import sys
N, K = list(map(int, sys.stdin.readline().split()))
if K == 0:
print((N * N))
sys.exit()
# b は K 以上
# a は b * c + K <= a < b * (c+1)
ans = 0
for i in range(1, N + 1):
# print(N // i, (i - K), max(N % i - K, 0))
tmp = (N // i) * max(i - K, 0) + max(N % i + 1 - K, 0)
ans += tmp
print(ans)
| import sys
N, K = list(map(int, sys.stdin.readline().split()))
if K == 0:
print((N * N))
sys.exit()
ans = 0
for b in range(K + 1, N + 1):
r = N // b
# tmp = (b - K) * r
# tmp2 = (N % b + 1 - K)
# print(b, tmp, tmp2)
tmp = (b - K) * r + max(0, N % b + 1 - K)
ans += tmp
print(ans)
| false | 5.555556 | [
"-# b は K 以上",
"-# a は b * c + K <= a < b * (c+1)",
"-for i in range(1, N + 1):",
"- # print(N // i, (i - K), max(N % i - K, 0))",
"- tmp = (N // i) * max(i - K, 0) + max(N % i + 1 - K, 0)",
"+for b in range(K + 1, N + 1):",
"+ r = N // b",
"+ # tmp = (b - K) * r",
"+ # tmp2 = (N % b + 1 - K)",
"+ # print(b, tmp, tmp2)",
"+ tmp = (b - K) * r + max(0, N % b + 1 - K)"
] | false | 0.050028 | 0.044774 | 1.117338 | [
"s205655338",
"s808915356"
] |
u150984829 | p00037 | python | s756654050 | s110782169 | 30 | 20 | 5,604 | 5,612 | Accepted | Accepted | 33.33 | g=[[0]*5 for _ in[0]*5]
for i in range(9):
e=eval(input())
for j in range(4+i%2):
if int(e[j]):
if i%2:g[i//2][j]+=4;g[i//2+1][j]+=1
else:r=g[i//2];r[j]+=2;r[j+1]+=8
y,x,k=0,1,1
a='1'
while 1:
k=k%4+2
for _ in[0]*4:
k+=1
if g[y][x]&int(2**(k%4)):a+=str(k%4);break
if k%2:x+=[1,-1][(k%4)>1]
else:y+=[-1,1][(k%4)>0]
if x+y==0:break
print((''.join('URDL'[int(c)]for c in a)))
| g=[[0]*5 for _ in[0]*5]
for i in range(9):
e=eval(input())
for j in range(4+i%2):
if int(e[j]):
if i%2:g[i//2][j]+=4;g[i//2+1][j]+=1
else:r=g[i//2];r[j]+=2;r[j+1]+=8
y,x=0,1
k=1
a='1'
while 1:
k=k%4+2
for _ in[0]*4:
k+=1
if g[y][x]&int(2**(k%4)):a+=str(k%4);break
if k%2:x+=[1,-1][(k%4)>1]
else:y+=[-1,1][(k%4)>0]
if x+y==0:break
print((''.join('URDL'[int(c)]for c in a)))
| 18 | 19 | 401 | 402 | g = [[0] * 5 for _ in [0] * 5]
for i in range(9):
e = eval(input())
for j in range(4 + i % 2):
if int(e[j]):
if i % 2:
g[i // 2][j] += 4
g[i // 2 + 1][j] += 1
else:
r = g[i // 2]
r[j] += 2
r[j + 1] += 8
y, x, k = 0, 1, 1
a = "1"
while 1:
k = k % 4 + 2
for _ in [0] * 4:
k += 1
if g[y][x] & int(2 ** (k % 4)):
a += str(k % 4)
break
if k % 2:
x += [1, -1][(k % 4) > 1]
else:
y += [-1, 1][(k % 4) > 0]
if x + y == 0:
break
print(("".join("URDL"[int(c)] for c in a)))
| g = [[0] * 5 for _ in [0] * 5]
for i in range(9):
e = eval(input())
for j in range(4 + i % 2):
if int(e[j]):
if i % 2:
g[i // 2][j] += 4
g[i // 2 + 1][j] += 1
else:
r = g[i // 2]
r[j] += 2
r[j + 1] += 8
y, x = 0, 1
k = 1
a = "1"
while 1:
k = k % 4 + 2
for _ in [0] * 4:
k += 1
if g[y][x] & int(2 ** (k % 4)):
a += str(k % 4)
break
if k % 2:
x += [1, -1][(k % 4) > 1]
else:
y += [-1, 1][(k % 4) > 0]
if x + y == 0:
break
print(("".join("URDL"[int(c)] for c in a)))
| false | 5.263158 | [
"-y, x, k = 0, 1, 1",
"+y, x = 0, 1",
"+k = 1"
] | false | 0.057177 | 0.049064 | 1.165358 | [
"s756654050",
"s110782169"
] |
u580697892 | p02882 | python | s805180351 | s389749604 | 20 | 18 | 3,188 | 3,188 | Accepted | Accepted | 10 | #coding: utf-8
from math import tan, pi
eps = 10**(-12)
def binary_search(a, b, x):
l = pi / 2
r = 0.0
if x <= a ** 2 * b / 2:
while l - r > eps:
mid = (r + l) / 2
if a * b**2 / tan(mid) / 2 == x:
return x
elif a * b**2 / tan(mid) / 2 > x:
r = mid
else:
l = mid
return l
else:
while l - r > eps:
mid = (r + l) / 2
if a**2 * b - a**3 * tan(mid) / 2 == x:
return x
elif a**2 * b - a**3 * tan(mid) / 2 > x:
r = mid
else:
l = mid
return l
a, b, x = list(map(int, input().split()))
print(("{:.10f}".format(binary_search(a, b, x) * 180 / pi))) | #coding: utf-8
from math import tan, pi
eps = 10**(-9)
def binary_search(a, b, x):
l = pi / 2
r = 0.0
if x <= a ** 2 * b / 2:
while l - r > eps:
mid = (r + l) / 2
if a * b**2 / tan(mid) / 2 == x:
return x
elif a * b**2 / tan(mid) / 2 > x:
r = mid
else:
l = mid
return l
else:
while l - r > eps:
mid = (r + l) / 2
if a**2 * b - a**3 * tan(mid) / 2 == x:
return x
elif a**2 * b - a**3 * tan(mid) / 2 > x:
r = mid
else:
l = mid
return l
a, b, x = list(map(int, input().split()))
print(("{:.10f}".format(binary_search(a, b, x) * 180 / pi))) | 31 | 31 | 810 | 809 | # coding: utf-8
from math import tan, pi
eps = 10 ** (-12)
def binary_search(a, b, x):
l = pi / 2
r = 0.0
if x <= a**2 * b / 2:
while l - r > eps:
mid = (r + l) / 2
if a * b**2 / tan(mid) / 2 == x:
return x
elif a * b**2 / tan(mid) / 2 > x:
r = mid
else:
l = mid
return l
else:
while l - r > eps:
mid = (r + l) / 2
if a**2 * b - a**3 * tan(mid) / 2 == x:
return x
elif a**2 * b - a**3 * tan(mid) / 2 > x:
r = mid
else:
l = mid
return l
a, b, x = list(map(int, input().split()))
print(("{:.10f}".format(binary_search(a, b, x) * 180 / pi)))
| # coding: utf-8
from math import tan, pi
eps = 10 ** (-9)
def binary_search(a, b, x):
l = pi / 2
r = 0.0
if x <= a**2 * b / 2:
while l - r > eps:
mid = (r + l) / 2
if a * b**2 / tan(mid) / 2 == x:
return x
elif a * b**2 / tan(mid) / 2 > x:
r = mid
else:
l = mid
return l
else:
while l - r > eps:
mid = (r + l) / 2
if a**2 * b - a**3 * tan(mid) / 2 == x:
return x
elif a**2 * b - a**3 * tan(mid) / 2 > x:
r = mid
else:
l = mid
return l
a, b, x = list(map(int, input().split()))
print(("{:.10f}".format(binary_search(a, b, x) * 180 / pi)))
| false | 0 | [
"-eps = 10 ** (-12)",
"+eps = 10 ** (-9)"
] | false | 0.036647 | 0.036188 | 1.012699 | [
"s805180351",
"s389749604"
] |
u252964975 | p03861 | python | s655196657 | s813182614 | 20 | 17 | 3,060 | 2,940 | Accepted | Accepted | 15 | a,b,x=list(map(int, input().split()))
print((b//x-((a-1)//x+1)+1)) | a,b,x=list(map(int, input().split()))
print((b//x-(a-1)//x))
| 2 | 2 | 59 | 54 | a, b, x = list(map(int, input().split()))
print((b // x - ((a - 1) // x + 1) + 1))
| a, b, x = list(map(int, input().split()))
print((b // x - (a - 1) // x))
| false | 0 | [
"-print((b // x - ((a - 1) // x + 1) + 1))",
"+print((b // x - (a - 1) // x))"
] | false | 0.048546 | 0.047144 | 1.029759 | [
"s655196657",
"s813182614"
] |
u021019433 | p02873 | python | s041008686 | s365578969 | 371 | 264 | 4,468 | 4,468 | Accepted | Accepted | 28.84 | from itertools import groupby, chain, islice
def pairs(t):
a = True
while a:
a =[sum(1 for _ in g) for k, g in islice(t, 2)]
if a:
yield sum(x * (x - 1) // 2 for x in a) + max(a)
s = eval(input())
t = groupby(s)
if s[0] == '>':
t = chain([(0, ())], t)
print((sum(pairs(t))))
| from itertools import groupby
s = eval(input())
if s[-1] == '<':
s += '>'
r = p = 0
for k, g in groupby(s):
s = sum(1 for _ in g)
if k == '>':
r += (p * p + s * s - p - s) // 2 + max(p, s)
p = s
print(r)
| 14 | 12 | 324 | 236 | from itertools import groupby, chain, islice
def pairs(t):
a = True
while a:
a = [sum(1 for _ in g) for k, g in islice(t, 2)]
if a:
yield sum(x * (x - 1) // 2 for x in a) + max(a)
s = eval(input())
t = groupby(s)
if s[0] == ">":
t = chain([(0, ())], t)
print((sum(pairs(t))))
| from itertools import groupby
s = eval(input())
if s[-1] == "<":
s += ">"
r = p = 0
for k, g in groupby(s):
s = sum(1 for _ in g)
if k == ">":
r += (p * p + s * s - p - s) // 2 + max(p, s)
p = s
print(r)
| false | 14.285714 | [
"-from itertools import groupby, chain, islice",
"-",
"-",
"-def pairs(t):",
"- a = True",
"- while a:",
"- a = [sum(1 for _ in g) for k, g in islice(t, 2)]",
"- if a:",
"- yield sum(x * (x - 1) // 2 for x in a) + max(a)",
"-",
"+from itertools import groupby",
"-t = groupby(s)",
"-if s[0] == \">\":",
"- t = chain([(0, ())], t)",
"-print((sum(pairs(t))))",
"+if s[-1] == \"<\":",
"+ s += \">\"",
"+r = p = 0",
"+for k, g in groupby(s):",
"+ s = sum(1 for _ in g)",
"+ if k == \">\":",
"+ r += (p * p + s * s - p - s) // 2 + max(p, s)",
"+ p = s",
"+print(r)"
] | false | 0.116195 | 0.085458 | 1.35968 | [
"s041008686",
"s365578969"
] |
u609407244 | p02266 | python | s156167049 | s107895679 | 60 | 50 | 8,824 | 8,824 | Accepted | Accepted | 16.67 | visited = {0: -1}
height = 0
pools = []
for i, c in enumerate(eval(input())):
if c == '\\':
height -= 1
elif c == '/':
height += 1
if height in visited:
width = i - visited[height]
sm = 0
while pools and pools[-1][0] > visited[height]:
x, l = pools.pop()
sm += l
pools.append((i, sm + width - 1))
visited[height] = i
print((sum(l for x, l in pools)))
if pools:
print((len(pools), ' '.join(str(l) for x, l in pools)))
else:
print((0)) | cross_section = eval(input())
visited = {0: -1}
height = 0
pools = []
for i, c in enumerate(cross_section):
if c == '\\':
height -= 1
elif c == '/':
height += 1
if height in visited:
width = i - visited[height]
sm = 0
while pools and pools[-1][0] > visited[height]:
_, volume = pools.pop()
sm += volume
pools.append((i, sm + width - 1))
visited[height] = i
print((sum(v for _, v in pools)))
print((len(pools), *(v for _, v in pools))) | 22 | 20 | 567 | 560 | visited = {0: -1}
height = 0
pools = []
for i, c in enumerate(eval(input())):
if c == "\\":
height -= 1
elif c == "/":
height += 1
if height in visited:
width = i - visited[height]
sm = 0
while pools and pools[-1][0] > visited[height]:
x, l = pools.pop()
sm += l
pools.append((i, sm + width - 1))
visited[height] = i
print((sum(l for x, l in pools)))
if pools:
print((len(pools), " ".join(str(l) for x, l in pools)))
else:
print((0))
| cross_section = eval(input())
visited = {0: -1}
height = 0
pools = []
for i, c in enumerate(cross_section):
if c == "\\":
height -= 1
elif c == "/":
height += 1
if height in visited:
width = i - visited[height]
sm = 0
while pools and pools[-1][0] > visited[height]:
_, volume = pools.pop()
sm += volume
pools.append((i, sm + width - 1))
visited[height] = i
print((sum(v for _, v in pools)))
print((len(pools), *(v for _, v in pools)))
| false | 9.090909 | [
"+cross_section = eval(input())",
"-for i, c in enumerate(eval(input())):",
"+for i, c in enumerate(cross_section):",
"- x, l = pools.pop()",
"- sm += l",
"+ _, volume = pools.pop()",
"+ sm += volume",
"-print((sum(l for x, l in pools)))",
"-if pools:",
"- print((len(pools), \" \".join(str(l) for x, l in pools)))",
"-else:",
"- print((0))",
"+print((sum(v for _, v in pools)))",
"+print((len(pools), *(v for _, v in pools)))"
] | false | 0.043193 | 0.042519 | 1.015839 | [
"s156167049",
"s107895679"
] |
u312025627 | p03161 | python | s869527027 | s988074481 | 365 | 168 | 54,092 | 84,760 | Accepted | Accepted | 53.97 | def main():
import sys
input = sys.stdin.buffer.readline
N, K = (int(i) for i in input().split())
h = [0] + [int(i) for i in input().split()]
memo = [float('inf')] * (N+1)
memo[1] = 0
for j in range(2, N+1):
for i in range(j-K, j):
if i < 0:
continue
memo[j] = min(memo[j], memo[i] + abs(h[j] - h[i]))
print((memo[N]))
if __name__ == '__main__':
main()
| INF = 10**9 + 7
def main():
N, K = (int(i) for i in input().split())
H = [int(i) for i in input().split()]
dp = [INF]*N
dp[0] = 0
for i in range(N):
for k in range(1, K+1):
if i + k >= N:
break
dp[i+k] = min(dp[i+k], dp[i] + abs(H[i+k] - H[i]))
print((dp[-1]))
if __name__ == '__main__':
main()
| 19 | 18 | 457 | 390 | def main():
import sys
input = sys.stdin.buffer.readline
N, K = (int(i) for i in input().split())
h = [0] + [int(i) for i in input().split()]
memo = [float("inf")] * (N + 1)
memo[1] = 0
for j in range(2, N + 1):
for i in range(j - K, j):
if i < 0:
continue
memo[j] = min(memo[j], memo[i] + abs(h[j] - h[i]))
print((memo[N]))
if __name__ == "__main__":
main()
| INF = 10**9 + 7
def main():
N, K = (int(i) for i in input().split())
H = [int(i) for i in input().split()]
dp = [INF] * N
dp[0] = 0
for i in range(N):
for k in range(1, K + 1):
if i + k >= N:
break
dp[i + k] = min(dp[i + k], dp[i] + abs(H[i + k] - H[i]))
print((dp[-1]))
if __name__ == "__main__":
main()
| false | 5.263158 | [
"+INF = 10**9 + 7",
"+",
"+",
"- import sys",
"-",
"- input = sys.stdin.buffer.readline",
"- h = [0] + [int(i) for i in input().split()]",
"- memo = [float(\"inf\")] * (N + 1)",
"- memo[1] = 0",
"- for j in range(2, N + 1):",
"- for i in range(j - K, j):",
"- if i < 0:",
"- continue",
"- memo[j] = min(memo[j], memo[i] + abs(h[j] - h[i]))",
"- print((memo[N]))",
"+ H = [int(i) for i in input().split()]",
"+ dp = [INF] * N",
"+ dp[0] = 0",
"+ for i in range(N):",
"+ for k in range(1, K + 1):",
"+ if i + k >= N:",
"+ break",
"+ dp[i + k] = min(dp[i + k], dp[i] + abs(H[i + k] - H[i]))",
"+ print((dp[-1]))"
] | false | 0.043587 | 0.03747 | 1.163228 | [
"s869527027",
"s988074481"
] |
u709799578 | p03455 | python | s904756266 | s046833353 | 174 | 17 | 38,256 | 2,940 | Accepted | Accepted | 90.23 | a, b = list(map(int, input().split()))
if a * b % 2 == 0:
print("Even")
else:
print("Odd")
| a, b = list(map(int, input().split()))
print(('Even' if a*b % 2 == 0 else 'Odd')) | 7 | 2 | 98 | 74 | a, b = list(map(int, input().split()))
if a * b % 2 == 0:
print("Even")
else:
print("Odd")
| a, b = list(map(int, input().split()))
print(("Even" if a * b % 2 == 0 else "Odd"))
| false | 71.428571 | [
"-if a * b % 2 == 0:",
"- print(\"Even\")",
"-else:",
"- print(\"Odd\")",
"+print((\"Even\" if a * b % 2 == 0 else \"Odd\"))"
] | false | 0.092184 | 0.064467 | 1.429946 | [
"s904756266",
"s046833353"
] |
u578953945 | p03109 | python | s792713370 | s568944950 | 19 | 17 | 3,312 | 2,940 | Accepted | Accepted | 10.53 | import datetime
y,m,d=list(map(int,input().split('/')))
print(('Heisei' if datetime.datetime(y, m, d, 0, 0) <= datetime.datetime(2019, 4, 30, 0, 0) else 'TBD')) | print(('Heisei' if '20190430' >= ''.join(input().split('/')) else 'TBD'))
| 3 | 1 | 154 | 72 | import datetime
y, m, d = list(map(int, input().split("/")))
print(
(
"Heisei"
if datetime.datetime(y, m, d, 0, 0) <= datetime.datetime(2019, 4, 30, 0, 0)
else "TBD"
)
)
| print(("Heisei" if "20190430" >= "".join(input().split("/")) else "TBD"))
| false | 66.666667 | [
"-import datetime",
"-",
"-y, m, d = list(map(int, input().split(\"/\")))",
"-print(",
"- (",
"- \"Heisei\"",
"- if datetime.datetime(y, m, d, 0, 0) <= datetime.datetime(2019, 4, 30, 0, 0)",
"- else \"TBD\"",
"- )",
"-)",
"+print((\"Heisei\" if \"20190430\" >= \"\".join(input().split(\"/\")) else \"TBD\"))"
] | false | 0.060524 | 0.055503 | 1.090477 | [
"s792713370",
"s568944950"
] |
u347640436 | p03476 | python | s624427937 | s926011445 | 489 | 278 | 12,540 | 24,876 | Accepted | Accepted | 43.15 | # エラトステネスの篩, 累積和
def make_prime_table(N):
sieve = [0] * (N + 1)
sieve[0] = -1
sieve[1] = -1
for i in range(2, N + 1):
if sieve[i] != 0:
continue
sieve[i] = i
for j in range(i * i, N + 1, i):
if sieve[j] == 0:
sieve[j] = i
return sieve
max_lr = 10 ** 5
prime_table = make_prime_table(max_lr)
cs = [0] * (max_lr + 1)
for i in range(3, max_lr + 1, 2):
if prime_table[i] == i and prime_table[(i + 1) // 2] == (i + 1) // 2:
cs[i] = 1
for i in range(1, max_lr + 1):
cs[i] += cs[i - 1]
Q = int(eval(input()))
for _ in range(Q):
l, r = list(map(int, input().split()))
print((cs[r] - cs[l - 1]))
| # エラトステネスの篩, 累積和
def make_prime_table(N):
sieve = list(range(N + 1))
sieve[0] = -1
sieve[1] = -1
for i in range(2, int(N ** 0.5) + 1):
if sieve[i] != i:
continue
for j in range(i * i, N + 1, i):
if sieve[j] == j:
sieve[j] = i
return sieve
max_lr = 10 ** 5
prime_table = make_prime_table(max_lr)
cs = [0] * (max_lr + 1)
for i in range(3, max_lr + 1, 2):
if prime_table[i] == i and prime_table[(i + 1) // 2] == (i + 1) // 2:
cs[i] = 1
for i in range(1, max_lr + 1):
cs[i] += cs[i - 1]
Q = int(eval(input()))
result = []
for _ in range(Q):
l, r = list(map(int, input().split()))
result.append(cs[r] - cs[l - 1])
print(('\n'.join(str(i) for i in result)))
| 29 | 31 | 713 | 773 | # エラトステネスの篩, 累積和
def make_prime_table(N):
sieve = [0] * (N + 1)
sieve[0] = -1
sieve[1] = -1
for i in range(2, N + 1):
if sieve[i] != 0:
continue
sieve[i] = i
for j in range(i * i, N + 1, i):
if sieve[j] == 0:
sieve[j] = i
return sieve
max_lr = 10**5
prime_table = make_prime_table(max_lr)
cs = [0] * (max_lr + 1)
for i in range(3, max_lr + 1, 2):
if prime_table[i] == i and prime_table[(i + 1) // 2] == (i + 1) // 2:
cs[i] = 1
for i in range(1, max_lr + 1):
cs[i] += cs[i - 1]
Q = int(eval(input()))
for _ in range(Q):
l, r = list(map(int, input().split()))
print((cs[r] - cs[l - 1]))
| # エラトステネスの篩, 累積和
def make_prime_table(N):
sieve = list(range(N + 1))
sieve[0] = -1
sieve[1] = -1
for i in range(2, int(N**0.5) + 1):
if sieve[i] != i:
continue
for j in range(i * i, N + 1, i):
if sieve[j] == j:
sieve[j] = i
return sieve
max_lr = 10**5
prime_table = make_prime_table(max_lr)
cs = [0] * (max_lr + 1)
for i in range(3, max_lr + 1, 2):
if prime_table[i] == i and prime_table[(i + 1) // 2] == (i + 1) // 2:
cs[i] = 1
for i in range(1, max_lr + 1):
cs[i] += cs[i - 1]
Q = int(eval(input()))
result = []
for _ in range(Q):
l, r = list(map(int, input().split()))
result.append(cs[r] - cs[l - 1])
print(("\n".join(str(i) for i in result)))
| false | 6.451613 | [
"- sieve = [0] * (N + 1)",
"+ sieve = list(range(N + 1))",
"- for i in range(2, N + 1):",
"- if sieve[i] != 0:",
"+ for i in range(2, int(N**0.5) + 1):",
"+ if sieve[i] != i:",
"- sieve[i] = i",
"- if sieve[j] == 0:",
"+ if sieve[j] == j:",
"+result = []",
"- print((cs[r] - cs[l - 1]))",
"+ result.append(cs[r] - cs[l - 1])",
"+print((\"\\n\".join(str(i) for i in result)))"
] | false | 0.166376 | 0.363772 | 0.457363 | [
"s624427937",
"s926011445"
] |
u513081876 | p03339 | python | s107068280 | s249326277 | 203 | 148 | 3,672 | 15,436 | Accepted | Accepted | 27.09 | N = int(eval(input()))
S = eval(input())
l = 0
r = S[1:].count('E')
ans = l+r
for i in range(1, N):
if S[i-1] == 'W':
l += 1
if S[i] == 'E':
r -= 1
ans = min(ans, r+l)
print(ans) | N = int(eval(input()))
S = eval(input())
ans = [0] * N
ans[0] = S[1:].count('E')
num = ans[0]
for i in range(1, N):
if S[i-1] == 'W':
num += 1
if S[i] == 'E':
num -= 1
ans[i] = num
print((min(ans))) | 15 | 14 | 215 | 231 | N = int(eval(input()))
S = eval(input())
l = 0
r = S[1:].count("E")
ans = l + r
for i in range(1, N):
if S[i - 1] == "W":
l += 1
if S[i] == "E":
r -= 1
ans = min(ans, r + l)
print(ans)
| N = int(eval(input()))
S = eval(input())
ans = [0] * N
ans[0] = S[1:].count("E")
num = ans[0]
for i in range(1, N):
if S[i - 1] == "W":
num += 1
if S[i] == "E":
num -= 1
ans[i] = num
print((min(ans)))
| false | 6.666667 | [
"-l = 0",
"-r = S[1:].count(\"E\")",
"-ans = l + r",
"+ans = [0] * N",
"+ans[0] = S[1:].count(\"E\")",
"+num = ans[0]",
"- l += 1",
"+ num += 1",
"- r -= 1",
"- ans = min(ans, r + l)",
"-print(ans)",
"+ num -= 1",
"+ ans[i] = num",
"+print((min(ans)))"
] | false | 0.039077 | 0.038171 | 1.02374 | [
"s107068280",
"s249326277"
] |
u573754721 | p03012 | python | s799724085 | s286071393 | 179 | 18 | 38,512 | 3,060 | Accepted | Accepted | 89.94 | n = int(eval(input()))
w = list(map(int,input().split()))
m=[]
for i in range(1,n):
m.append(abs(sum(w[:i]) - sum(w[i:])))
print((min(m))) | n=int(eval(input()))
w=list(map(int,input().split()))
ans=float("inf")
for i in range(n):
ans=min(ans,abs(sum(w[:i])-sum(w[i:])))
print(ans) | 7 | 7 | 141 | 147 | n = int(eval(input()))
w = list(map(int, input().split()))
m = []
for i in range(1, n):
m.append(abs(sum(w[:i]) - sum(w[i:])))
print((min(m)))
| n = int(eval(input()))
w = list(map(int, input().split()))
ans = float("inf")
for i in range(n):
ans = min(ans, abs(sum(w[:i]) - sum(w[i:])))
print(ans)
| false | 0 | [
"-m = []",
"-for i in range(1, n):",
"- m.append(abs(sum(w[:i]) - sum(w[i:])))",
"-print((min(m)))",
"+ans = float(\"inf\")",
"+for i in range(n):",
"+ ans = min(ans, abs(sum(w[:i]) - sum(w[i:])))",
"+print(ans)"
] | false | 0.033998 | 0.033284 | 1.02143 | [
"s799724085",
"s286071393"
] |
u597455618 | p02560 | python | s915330848 | s297394303 | 601 | 231 | 110,068 | 78,184 | Accepted | Accepted | 61.56 | import sys
from numba import njit, i8
@njit((i8, i8, i8, i8), cache=True)
def floor_sum(n, m, a, b):
ans = n*(b//m)
b %= m
while True:
ans += (n-1)*n*(a//m)//2
a %= m
if a*n+b < m:
return ans
y_max = (a*n + b)//m
b -= y_max*m # now we have x_max = -(b//a)
ans += (n + b//a)*y_max
b %= a
m, a, n = a, m, y_max
def main():
t = int(sys.stdin.buffer.readline())
for x in sys.stdin.buffer.readlines():
n, m, a, b = list(map(int, x.split()))
res = floor_sum(n, m, a, b)
print(res)
if __name__ == "__main__":
main()
| import sys
def floor_sum(n, m, a, b):
ans = n*(b//m)
b %= m
while True:
ans += (n-1)*n*(a//m)//2
a %= m
if a*n+b < m:
return ans
y_max = (a*n + b)//m
b -= y_max*m # now we have x_max = -(b//a)
ans += (n + b//a)*y_max
b %= a
m, a, n = a, m, y_max
def main():
t = int(sys.stdin.buffer.readline())
for x in sys.stdin.buffer.readlines():
n, m, a, b = list(map(int, x.split()))
res = floor_sum(n, m, a, b)
print(res)
if __name__ == "__main__":
main()
| 30 | 28 | 663 | 598 | import sys
from numba import njit, i8
@njit((i8, i8, i8, i8), cache=True)
def floor_sum(n, m, a, b):
ans = n * (b // m)
b %= m
while True:
ans += (n - 1) * n * (a // m) // 2
a %= m
if a * n + b < m:
return ans
y_max = (a * n + b) // m
b -= y_max * m # now we have x_max = -(b//a)
ans += (n + b // a) * y_max
b %= a
m, a, n = a, m, y_max
def main():
t = int(sys.stdin.buffer.readline())
for x in sys.stdin.buffer.readlines():
n, m, a, b = list(map(int, x.split()))
res = floor_sum(n, m, a, b)
print(res)
if __name__ == "__main__":
main()
| import sys
def floor_sum(n, m, a, b):
ans = n * (b // m)
b %= m
while True:
ans += (n - 1) * n * (a // m) // 2
a %= m
if a * n + b < m:
return ans
y_max = (a * n + b) // m
b -= y_max * m # now we have x_max = -(b//a)
ans += (n + b // a) * y_max
b %= a
m, a, n = a, m, y_max
def main():
t = int(sys.stdin.buffer.readline())
for x in sys.stdin.buffer.readlines():
n, m, a, b = list(map(int, x.split()))
res = floor_sum(n, m, a, b)
print(res)
if __name__ == "__main__":
main()
| false | 6.666667 | [
"-from numba import njit, i8",
"-@njit((i8, i8, i8, i8), cache=True)"
] | false | 0.036971 | 0.035983 | 1.027463 | [
"s915330848",
"s297394303"
] |
u631277801 | p03038 | python | s416387610 | s329299284 | 460 | 405 | 40,860 | 32,448 | Accepted | Accepted | 11.96 | import sys
stdin = sys.stdin
sys.setrecursionlimit(10 ** 7)
def li(): return list(map(int, stdin.readline().split()))
def li_(): return [int(x) - 1 for x in stdin.readline().split()]
def lf(): return list(map(float, stdin.readline().split()))
def ls(): return stdin.readline().split()
def ns(): return stdin.readline().rstrip()
def lc(): return list(ns())
def ni(): return int(stdin.readline())
def nf(): return float(stdin.readline())
from collections import defaultdict
dic = defaultdict(int)
n, m = li()
a = list(li())
key = set()
for ai in a:
dic[ai] += 1
key.add(ai)
for _ in range(m):
bi, ci = li()
dic[ci] += bi
key.add(ci)
res = n
ans = 0
for ki in sorted(list(key), reverse=True):
if res - dic[ki] >= 0:
ans += ki*dic[ki]
res -= dic[ki]
else:
ans += ki*res
res = 0
if res == 0:
break
print(ans)
| import sys
stdin = sys.stdin
sys.setrecursionlimit(10 ** 7)
def li(): return list(map(int, stdin.readline().split()))
def li_(): return [int(x) - 1 for x in stdin.readline().split()]
def lf(): return list(map(float, stdin.readline().split()))
def ls(): return stdin.readline().split()
def ns(): return stdin.readline().rstrip()
def lc(): return list(ns())
def ni(): return int(stdin.readline())
def nf(): return float(stdin.readline())
from collections import defaultdict
n, m = li()
a = list(li())
dic = defaultdict(int)
for ai in a:
dic[ai] += 1
for _ in range(m):
b, c = li()
dic[c] += b
keys = sorted(list(dic.keys()), reverse=True)
rest = n
ans = 0
for ki in keys:
if dic[ki] > rest:
ans += ki * rest
rest = 0
elif dic[ki] == rest:
ans += ki * dic[ki]
rest = 0
else:
ans += ki * dic[ki]
rest -= dic[ki]
if rest <= 0:
break
print(ans)
| 45 | 49 | 923 | 977 | import sys
stdin = sys.stdin
sys.setrecursionlimit(10**7)
def li():
return list(map(int, stdin.readline().split()))
def li_():
return [int(x) - 1 for x in stdin.readline().split()]
def lf():
return list(map(float, stdin.readline().split()))
def ls():
return stdin.readline().split()
def ns():
return stdin.readline().rstrip()
def lc():
return list(ns())
def ni():
return int(stdin.readline())
def nf():
return float(stdin.readline())
from collections import defaultdict
dic = defaultdict(int)
n, m = li()
a = list(li())
key = set()
for ai in a:
dic[ai] += 1
key.add(ai)
for _ in range(m):
bi, ci = li()
dic[ci] += bi
key.add(ci)
res = n
ans = 0
for ki in sorted(list(key), reverse=True):
if res - dic[ki] >= 0:
ans += ki * dic[ki]
res -= dic[ki]
else:
ans += ki * res
res = 0
if res == 0:
break
print(ans)
| import sys
stdin = sys.stdin
sys.setrecursionlimit(10**7)
def li():
return list(map(int, stdin.readline().split()))
def li_():
return [int(x) - 1 for x in stdin.readline().split()]
def lf():
return list(map(float, stdin.readline().split()))
def ls():
return stdin.readline().split()
def ns():
return stdin.readline().rstrip()
def lc():
return list(ns())
def ni():
return int(stdin.readline())
def nf():
return float(stdin.readline())
from collections import defaultdict
n, m = li()
a = list(li())
dic = defaultdict(int)
for ai in a:
dic[ai] += 1
for _ in range(m):
b, c = li()
dic[c] += b
keys = sorted(list(dic.keys()), reverse=True)
rest = n
ans = 0
for ki in keys:
if dic[ki] > rest:
ans += ki * rest
rest = 0
elif dic[ki] == rest:
ans += ki * dic[ki]
rest = 0
else:
ans += ki * dic[ki]
rest -= dic[ki]
if rest <= 0:
break
print(ans)
| false | 8.163265 | [
"-dic = defaultdict(int)",
"-key = set()",
"+dic = defaultdict(int)",
"- key.add(ai)",
"- bi, ci = li()",
"- dic[ci] += bi",
"- key.add(ci)",
"-res = n",
"+ b, c = li()",
"+ dic[c] += b",
"+keys = sorted(list(dic.keys()), reverse=True)",
"+rest = n",
"-for ki in sorted(list(key), reverse=True):",
"- if res - dic[ki] >= 0:",
"+for ki in keys:",
"+ if dic[ki] > rest:",
"+ ans += ki * rest",
"+ rest = 0",
"+ elif dic[ki] == rest:",
"- res -= dic[ki]",
"+ rest = 0",
"- ans += ki * res",
"- res = 0",
"- if res == 0:",
"+ ans += ki * dic[ki]",
"+ rest -= dic[ki]",
"+ if rest <= 0:"
] | false | 0.049638 | 0.049233 | 1.008242 | [
"s416387610",
"s329299284"
] |
u829249049 | p02696 | python | s252393380 | s852777268 | 60 | 23 | 61,792 | 9,168 | Accepted | Accepted | 61.67 | import sys
A,B,N=list(map(int,input().split()))
X=B-1
ans=(A*N)//B-A*(N//B)
if B==1:
print((0))
sys.exit()
while X<=N:
ans=max(ans,(A*X)//B-A*(X//B))
X+=B
print(ans) | import sys
A,B,N=list(map(int,input().split()))
X=B-1
X=min(B-1,N)
ans=(A*X)//B-A*(X//B)
print(ans) | 11 | 6 | 176 | 99 | import sys
A, B, N = list(map(int, input().split()))
X = B - 1
ans = (A * N) // B - A * (N // B)
if B == 1:
print((0))
sys.exit()
while X <= N:
ans = max(ans, (A * X) // B - A * (X // B))
X += B
print(ans)
| import sys
A, B, N = list(map(int, input().split()))
X = B - 1
X = min(B - 1, N)
ans = (A * X) // B - A * (X // B)
print(ans)
| false | 45.454545 | [
"-ans = (A * N) // B - A * (N // B)",
"-if B == 1:",
"- print((0))",
"- sys.exit()",
"-while X <= N:",
"- ans = max(ans, (A * X) // B - A * (X // B))",
"- X += B",
"+X = min(B - 1, N)",
"+ans = (A * X) // B - A * (X // B)"
] | false | 0.048728 | 0.05747 | 0.847877 | [
"s252393380",
"s852777268"
] |
u102461423 | p03170 | python | s803807514 | s780581928 | 123 | 85 | 3,828 | 4,596 | Accepted | Accepted | 30.89 | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
N,K,*A = list(map(int,read().split()))
dp = [0]*(K+1) # bitset
for n in range(K):
if not dp[n]:
for a in A:
if n+a>K:
break
dp[n+a]=1
answer = 'First' if dp[-1] else 'Second'
print(answer) | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
N,K,*A = list(map(int,read().split()))
dp = [0]*(K+K+1) # bitset
for n in range(K):
if not dp[n]:
for a in A:
dp[n+a]=1
answer = 'First' if dp[K] else 'Second'
print(answer) | 17 | 15 | 369 | 324 | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
N, K, *A = list(map(int, read().split()))
dp = [0] * (K + 1) # bitset
for n in range(K):
if not dp[n]:
for a in A:
if n + a > K:
break
dp[n + a] = 1
answer = "First" if dp[-1] else "Second"
print(answer)
| import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
N, K, *A = list(map(int, read().split()))
dp = [0] * (K + K + 1) # bitset
for n in range(K):
if not dp[n]:
for a in A:
dp[n + a] = 1
answer = "First" if dp[K] else "Second"
print(answer)
| false | 11.764706 | [
"-dp = [0] * (K + 1) # bitset",
"+dp = [0] * (K + K + 1) # bitset",
"- if n + a > K:",
"- break",
"-answer = \"First\" if dp[-1] else \"Second\"",
"+answer = \"First\" if dp[K] else \"Second\""
] | false | 0.079766 | 0.079694 | 1.000904 | [
"s803807514",
"s780581928"
] |
u057964173 | p02927 | python | s153620640 | s039152219 | 22 | 19 | 3,060 | 3,060 | Accepted | Accepted | 13.64 | def resolve():
m,d=list(map(int, input().split()))
cnt=0
for i in range(1,m+1):
for j in range(22,d+1):
jstr=str(j)
j10=int(jstr[0])
j1=int(jstr[1])
if j1>=2 and j10>=2 and i==j1*j10:
cnt+=1
print(cnt)
resolve() | def resolve():
m,d=list(map(int, input().split()))
cnt=0
for i in range(1,m+1):
for j in range(22,d+1):
if j//10>=2 and j%10>=2 and i==(j//10)*(j%10):
cnt+=1
print(cnt)
resolve() | 12 | 9 | 304 | 232 | def resolve():
m, d = list(map(int, input().split()))
cnt = 0
for i in range(1, m + 1):
for j in range(22, d + 1):
jstr = str(j)
j10 = int(jstr[0])
j1 = int(jstr[1])
if j1 >= 2 and j10 >= 2 and i == j1 * j10:
cnt += 1
print(cnt)
resolve()
| def resolve():
m, d = list(map(int, input().split()))
cnt = 0
for i in range(1, m + 1):
for j in range(22, d + 1):
if j // 10 >= 2 and j % 10 >= 2 and i == (j // 10) * (j % 10):
cnt += 1
print(cnt)
resolve()
| false | 25 | [
"- jstr = str(j)",
"- j10 = int(jstr[0])",
"- j1 = int(jstr[1])",
"- if j1 >= 2 and j10 >= 2 and i == j1 * j10:",
"+ if j // 10 >= 2 and j % 10 >= 2 and i == (j // 10) * (j % 10):"
] | false | 0.036635 | 0.096555 | 0.379425 | [
"s153620640",
"s039152219"
] |
u216928054 | p02558 | python | s455121729 | s794619496 | 430 | 277 | 82,336 | 75,028 | Accepted | Accepted | 35.58 | #!/usr/bin/env python3
import sys
sys.setrecursionlimit(10**6)
INF = 10 ** 9 + 1 # sys.maxsize # float("inf")
MOD = 10 ** 9 + 7
# dsu / UnionFind
def init_unionfind(N):
global parent, rank
parent = [-1] * N
rank = [0] * N
def find_root(x):
p = parent[x]
if p == -1:
return x
p2 = find_root(p)
parent[x] = p2
return p2
def unite(x, y):
x = find_root(x)
y = find_root(y)
if x == y:
return # already united
if rank[x] < rank[y]:
parent[x] = y
else:
parent[y] = x
if rank[x] == rank[y]:
rank[x] += 1
def is_connected(x, y):
return (find_root(x) == find_root(y))
# acl/dsu
init = init_unionfind
merge = unite
# FIXME: return value
same = is_connected
leader = find_root
def size(a):
raise NotImplementedError
def group(a):
raise NotImplementedError
# ---
def debug(*x):
print(*x, file=sys.stderr)
def main():
# parse input
N, Q = map(int, input().split())
init(N)
for _q in range(Q):
q, u, v = map(int, input().split())
if q == 0:
merge(u, v)
else:
print(int(same(u, v)))
# tests
T1 = """
4 7
1 0 1
0 0 1
0 2 3
1 0 1
1 1 2
0 0 2
1 1 3
"""
TEST_T1 = """
>>> as_input(T1)
>>> main()
0
1
0
1
"""
def _test():
import doctest
doctest.testmod()
g = globals()
for k in sorted(g):
if k.startswith("TEST_"):
doctest.run_docstring_examples(g[k], g, name=k)
def as_input(s):
"use in test, use given string as input file"
import io
f = io.StringIO(s.strip())
g = globals()
g["input"] = lambda: bytes(f.readline(), "ascii")
g["read"] = lambda: bytes(f.read(), "ascii")
input = sys.stdin.buffer.readline
read = sys.stdin.buffer.read
if sys.argv[-1] == "-t":
print("testing")
_test()
sys.exit()
main()
| #!/usr/bin/env python3
import sys
sys.setrecursionlimit(10**6)
INF = 10 ** 9 + 1 # sys.maxsize # float("inf")
MOD = 10 ** 9 + 7
# dsu / UnionFind
def init_unionfind(N):
global parent, rank
parent = [-1] * N
rank = [0] * N
def find_root_1(x):
p = parent[x]
if p == -1:
return x
p2 = find_root(p)
parent[x] = p2
return p2
def find_root(x):
p = parent[x]
while p != -1:
x = p
p = parent[x]
return x
def unite(x, y):
x = find_root(x)
y = find_root(y)
if x == y:
return # already united
if rank[x] < rank[y]:
parent[x] = y
else:
parent[y] = x
if rank[x] == rank[y]:
rank[x] += 1
def is_connected(x, y):
return (find_root(x) == find_root(y))
# acl/dsu
init = init_unionfind
merge = unite
# FIXME: return value
same = is_connected
leader = find_root
def size(a):
raise NotImplementedError
def group(a):
raise NotImplementedError
# ---
def debug(*x):
print(*x, file=sys.stderr)
def main():
# parse input
N, Q = map(int, input().split())
init(N)
for _q in range(Q):
q, u, v = map(int, input().split())
if q == 0:
merge(u, v)
else:
print(int(same(u, v)))
# tests
T1 = """
4 7
1 0 1
0 0 1
0 2 3
1 0 1
1 1 2
0 0 2
1 1 3
"""
TEST_T1 = """
>>> as_input(T1)
>>> main()
0
1
0
1
"""
def _test():
import doctest
doctest.testmod()
g = globals()
for k in sorted(g):
if k.startswith("TEST_"):
doctest.run_docstring_examples(g[k], g, name=k)
def as_input(s):
"use in test, use given string as input file"
import io
f = io.StringIO(s.strip())
g = globals()
g["input"] = lambda: bytes(f.readline(), "ascii")
g["read"] = lambda: bytes(f.read(), "ascii")
input = sys.stdin.buffer.readline
read = sys.stdin.buffer.read
if sys.argv[-1] == "-t":
print("testing")
_test()
sys.exit()
main()
| 124 | 132 | 1,994 | 2,110 | #!/usr/bin/env python3
import sys
sys.setrecursionlimit(10**6)
INF = 10**9 + 1 # sys.maxsize # float("inf")
MOD = 10**9 + 7
# dsu / UnionFind
def init_unionfind(N):
global parent, rank
parent = [-1] * N
rank = [0] * N
def find_root(x):
p = parent[x]
if p == -1:
return x
p2 = find_root(p)
parent[x] = p2
return p2
def unite(x, y):
x = find_root(x)
y = find_root(y)
if x == y:
return # already united
if rank[x] < rank[y]:
parent[x] = y
else:
parent[y] = x
if rank[x] == rank[y]:
rank[x] += 1
def is_connected(x, y):
return find_root(x) == find_root(y)
# acl/dsu
init = init_unionfind
merge = unite
# FIXME: return value
same = is_connected
leader = find_root
def size(a):
raise NotImplementedError
def group(a):
raise NotImplementedError
# ---
def debug(*x):
print(*x, file=sys.stderr)
def main():
# parse input
N, Q = map(int, input().split())
init(N)
for _q in range(Q):
q, u, v = map(int, input().split())
if q == 0:
merge(u, v)
else:
print(int(same(u, v)))
# tests
T1 = """
4 7
1 0 1
0 0 1
0 2 3
1 0 1
1 1 2
0 0 2
1 1 3
"""
TEST_T1 = """
>>> as_input(T1)
>>> main()
0
1
0
1
"""
def _test():
import doctest
doctest.testmod()
g = globals()
for k in sorted(g):
if k.startswith("TEST_"):
doctest.run_docstring_examples(g[k], g, name=k)
def as_input(s):
"use in test, use given string as input file"
import io
f = io.StringIO(s.strip())
g = globals()
g["input"] = lambda: bytes(f.readline(), "ascii")
g["read"] = lambda: bytes(f.read(), "ascii")
input = sys.stdin.buffer.readline
read = sys.stdin.buffer.read
if sys.argv[-1] == "-t":
print("testing")
_test()
sys.exit()
main()
| #!/usr/bin/env python3
import sys
sys.setrecursionlimit(10**6)
INF = 10**9 + 1 # sys.maxsize # float("inf")
MOD = 10**9 + 7
# dsu / UnionFind
def init_unionfind(N):
global parent, rank
parent = [-1] * N
rank = [0] * N
def find_root_1(x):
p = parent[x]
if p == -1:
return x
p2 = find_root(p)
parent[x] = p2
return p2
def find_root(x):
p = parent[x]
while p != -1:
x = p
p = parent[x]
return x
def unite(x, y):
x = find_root(x)
y = find_root(y)
if x == y:
return # already united
if rank[x] < rank[y]:
parent[x] = y
else:
parent[y] = x
if rank[x] == rank[y]:
rank[x] += 1
def is_connected(x, y):
return find_root(x) == find_root(y)
# acl/dsu
init = init_unionfind
merge = unite
# FIXME: return value
same = is_connected
leader = find_root
def size(a):
raise NotImplementedError
def group(a):
raise NotImplementedError
# ---
def debug(*x):
print(*x, file=sys.stderr)
def main():
# parse input
N, Q = map(int, input().split())
init(N)
for _q in range(Q):
q, u, v = map(int, input().split())
if q == 0:
merge(u, v)
else:
print(int(same(u, v)))
# tests
T1 = """
4 7
1 0 1
0 0 1
0 2 3
1 0 1
1 1 2
0 0 2
1 1 3
"""
TEST_T1 = """
>>> as_input(T1)
>>> main()
0
1
0
1
"""
def _test():
import doctest
doctest.testmod()
g = globals()
for k in sorted(g):
if k.startswith("TEST_"):
doctest.run_docstring_examples(g[k], g, name=k)
def as_input(s):
"use in test, use given string as input file"
import io
f = io.StringIO(s.strip())
g = globals()
g["input"] = lambda: bytes(f.readline(), "ascii")
g["read"] = lambda: bytes(f.read(), "ascii")
input = sys.stdin.buffer.readline
read = sys.stdin.buffer.read
if sys.argv[-1] == "-t":
print("testing")
_test()
sys.exit()
main()
| false | 6.060606 | [
"-def find_root(x):",
"+def find_root_1(x):",
"+",
"+",
"+def find_root(x):",
"+ p = parent[x]",
"+ while p != -1:",
"+ x = p",
"+ p = parent[x]",
"+ return x"
] | false | 0.036919 | 0.039217 | 0.941388 | [
"s455121729",
"s794619496"
] |
u653837719 | p02984 | python | s308112399 | s907181963 | 361 | 326 | 67,556 | 63,856 | Accepted | Accepted | 9.7 | n = int(input())
a = list(map(int, input().split()))
sum_water = sum(a) // 2
sum_even_left = [0]
sum_odd_left = [0]
for i in range(n):
if i % 2 == 0:
sum_even_left.append(sum_even_left[-1] + a[i])
else:
sum_odd_left.append(sum_odd_left[-1] + a[i])
sum_even_right = [0]
sum_odd_right = [0]
for i in range(n-1, -1, -1):
if i % 2 == 0:
sum_even_right.append(sum_even_right[-1] + a[i])
else:
sum_odd_right.append(sum_odd_right[-1] + a[i])
sum_even_right = sum_even_right[::-1]
sum_odd_right = sum_odd_right[::-1]
for i in range(n):
if i % 2 == 0:
print(2 * (sum_water - sum_even_left[i//2] - sum_odd_right[i//2]), end=' ')
else:
print(2 * (sum_water - sum_odd_left[i//2] - sum_even_right[i//2+1]), end=' ')
| n = int(input())
a = list(map(int, input().split()))
x = 0
for i in range(n):
x = a[i] - x
res = x // 2
for i in range(n):
print(2*res, end=' ')
res = a[i] - res
| 28 | 11 | 806 | 185 | n = int(input())
a = list(map(int, input().split()))
sum_water = sum(a) // 2
sum_even_left = [0]
sum_odd_left = [0]
for i in range(n):
if i % 2 == 0:
sum_even_left.append(sum_even_left[-1] + a[i])
else:
sum_odd_left.append(sum_odd_left[-1] + a[i])
sum_even_right = [0]
sum_odd_right = [0]
for i in range(n - 1, -1, -1):
if i % 2 == 0:
sum_even_right.append(sum_even_right[-1] + a[i])
else:
sum_odd_right.append(sum_odd_right[-1] + a[i])
sum_even_right = sum_even_right[::-1]
sum_odd_right = sum_odd_right[::-1]
for i in range(n):
if i % 2 == 0:
print(2 * (sum_water - sum_even_left[i // 2] - sum_odd_right[i // 2]), end=" ")
else:
print(
2 * (sum_water - sum_odd_left[i // 2] - sum_even_right[i // 2 + 1]), end=" "
)
| n = int(input())
a = list(map(int, input().split()))
x = 0
for i in range(n):
x = a[i] - x
res = x // 2
for i in range(n):
print(2 * res, end=" ")
res = a[i] - res
| false | 60.714286 | [
"-sum_water = sum(a) // 2",
"-sum_even_left = [0]",
"-sum_odd_left = [0]",
"+x = 0",
"- if i % 2 == 0:",
"- sum_even_left.append(sum_even_left[-1] + a[i])",
"- else:",
"- sum_odd_left.append(sum_odd_left[-1] + a[i])",
"-sum_even_right = [0]",
"-sum_odd_right = [0]",
"-for i in range(n - 1, -1, -1):",
"- if i % 2 == 0:",
"- sum_even_right.append(sum_even_right[-1] + a[i])",
"- else:",
"- sum_odd_right.append(sum_odd_right[-1] + a[i])",
"-sum_even_right = sum_even_right[::-1]",
"-sum_odd_right = sum_odd_right[::-1]",
"+ x = a[i] - x",
"+res = x // 2",
"- if i % 2 == 0:",
"- print(2 * (sum_water - sum_even_left[i // 2] - sum_odd_right[i // 2]), end=\" \")",
"- else:",
"- print(",
"- 2 * (sum_water - sum_odd_left[i // 2] - sum_even_right[i // 2 + 1]), end=\" \"",
"- )",
"+ print(2 * res, end=\" \")",
"+ res = a[i] - res"
] | false | 0.073951 | 0.042167 | 1.753771 | [
"s308112399",
"s907181963"
] |
u421499233 | p03470 | python | s005433870 | s714525214 | 21 | 17 | 2,940 | 2,940 | Accepted | Accepted | 19.05 | N = int(eval(input()))
d = set()
for i in range(N):
d.add(int(eval(input())))
print((len(d))) | N = int(eval(input()))
d = []
for i in range(N):
d.append(int(eval(input())))
d = set(d)
print((len(d))) | 5 | 6 | 91 | 99 | N = int(eval(input()))
d = set()
for i in range(N):
d.add(int(eval(input())))
print((len(d)))
| N = int(eval(input()))
d = []
for i in range(N):
d.append(int(eval(input())))
d = set(d)
print((len(d)))
| false | 16.666667 | [
"-d = set()",
"+d = []",
"- d.add(int(eval(input())))",
"+ d.append(int(eval(input())))",
"+d = set(d)"
] | false | 0.115917 | 0.047107 | 2.46073 | [
"s005433870",
"s714525214"
] |
u670180528 | p03029 | python | s114703402 | s494304138 | 166 | 17 | 38,384 | 2,940 | Accepted | Accepted | 89.76 | a,p = list(map(int,input().split()))
print(((a*3+p)//2)) | a,b=list(map(int,input().split()));print(((3*a+b)//2)) | 2 | 1 | 49 | 46 | a, p = list(map(int, input().split()))
print(((a * 3 + p) // 2))
| a, b = list(map(int, input().split()))
print(((3 * a + b) // 2))
| false | 50 | [
"-a, p = list(map(int, input().split()))",
"-print(((a * 3 + p) // 2))",
"+a, b = list(map(int, input().split()))",
"+print(((3 * a + b) // 2))"
] | false | 0.044262 | 0.045729 | 0.967909 | [
"s114703402",
"s494304138"
] |
u606878291 | p02971 | python | s402366140 | s824732032 | 694 | 483 | 15,636 | 12,520 | Accepted | Accepted | 30.4 | N = int(eval(input()))
A = [int(eval(input())) for _ in range(N)]
left_max = [0] * (N + 1)
right_max = [0] * (N + 1)
for index, a in enumerate(A, start=1):
left_max[index] = max(left_max[index - 1], a)
for index, a in enumerate(reversed(A), start=1):
right_max[index] = max(right_max[index - 1], a)
for i in range(N):
print((max(left_max[i], right_max[N - i - 1])))
| N = int(eval(input()))
A = [int(eval(input())) for _ in range(N)]
max1 = 0
max2 = 0
for a in A:
if a > max1:
max2 = max1
max1 = a
elif a > max2:
max2 = a
for a in A:
if a == max1:
print(max2)
else:
print(max1)
| 13 | 18 | 379 | 274 | N = int(eval(input()))
A = [int(eval(input())) for _ in range(N)]
left_max = [0] * (N + 1)
right_max = [0] * (N + 1)
for index, a in enumerate(A, start=1):
left_max[index] = max(left_max[index - 1], a)
for index, a in enumerate(reversed(A), start=1):
right_max[index] = max(right_max[index - 1], a)
for i in range(N):
print((max(left_max[i], right_max[N - i - 1])))
| N = int(eval(input()))
A = [int(eval(input())) for _ in range(N)]
max1 = 0
max2 = 0
for a in A:
if a > max1:
max2 = max1
max1 = a
elif a > max2:
max2 = a
for a in A:
if a == max1:
print(max2)
else:
print(max1)
| false | 27.777778 | [
"-left_max = [0] * (N + 1)",
"-right_max = [0] * (N + 1)",
"-for index, a in enumerate(A, start=1):",
"- left_max[index] = max(left_max[index - 1], a)",
"-for index, a in enumerate(reversed(A), start=1):",
"- right_max[index] = max(right_max[index - 1], a)",
"-for i in range(N):",
"- print((max(left_max[i], right_max[N - i - 1])))",
"+max1 = 0",
"+max2 = 0",
"+for a in A:",
"+ if a > max1:",
"+ max2 = max1",
"+ max1 = a",
"+ elif a > max2:",
"+ max2 = a",
"+for a in A:",
"+ if a == max1:",
"+ print(max2)",
"+ else:",
"+ print(max1)"
] | false | 0.044155 | 0.046235 | 0.955012 | [
"s402366140",
"s824732032"
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.