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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
u102461423 | p02950 | python | s726108094 | s054228179 | 1,911 | 597 | 176,400 | 225,484 | Accepted | Accepted | 68.76 | import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
import numpy as np
from numpy.fft import rfft, irfft
import itertools
P = int(eval(input()))
A = [int(x) for x in input().split()]
fft_len = 6144
def fft_convolve(A,B):
C = irfft(rfft(A,fft_len) * rfft(B,fft_len))
C = (C + .5)... | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
import numpy as np
p = int(readline())
A = np.array(read().split(),np.int64)
"""
・f_i(x) = 1 - (x-a)^{p-1} とすると、f_i(x)はx=iのみで1をとる：これは二項係数とべき乗
・sum a_if_i が答
"""
power = np.ones((p,p),dt... | 31 | 49 | 818 | 1,228 | import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
import numpy as np
from numpy.fft import rfft, irfft
import itertools
P = int(eval(input()))
A = [int(x) for x in input().split()]
fft_len = 6144
def fft_convolve(A, B):
C = irfft(rfft(A, fft_len) * rfft(B, fft_len))
C = (C + 0.5).astype(np.... | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
import numpy as np
p = int(readline())
A = np.array(read().split(), np.int64)
"""
・f_i(x) = 1 - (x-a)^{p-1} とすると、f_i(x)はx=iのみで1をとる：これは二項係数とべき乗
・sum a_if_i が答
"""
power = np.ones((p, p), dtype=np.int64)
... | false | 36.734694 | [
"-input = sys.stdin.readline",
"-sys.setrecursionlimit(10**7)",
"+read = sys.stdin.buffer.read",
"+readline = sys.stdin.buffer.readline",
"+readlines = sys.stdin.buffer.readlines",
"-from numpy.fft import rfft, irfft",
"-import itertools",
"-P = int(eval(input()))",
"-A = [int(x) for x in input().sp... | false | 0.177169 | 0.266103 | 0.665794 | [
"s726108094",
"s054228179"
] |
u411923565 | p02844 | python | s891486466 | s573099789 | 78 | 28 | 63,968 | 9,276 | Accepted | Accepted | 64.1 | # D - Lucky PIN
N = int(eval(input()))
S = eval(input())
ans = 0
for i in range(10):
for j in range(10):
for k in range(10):
a = S.find(str(i))
if a == -1:
continue
# i が含まれるとき
b = S.find(str(j),a+1)
if not(a < b):
... | # D - Lucky PIN
N = int(eval(input()))
S = eval(input())
cnt = 0
for i in range(10):
for j in range(10):
for k in range(10):
a = S.find(str(i))
if a == -1:
continue
b = S.find(str(j),a+1)
if b == -1:
continue
... | 22 | 19 | 523 | 423 | # D - Lucky PIN
N = int(eval(input()))
S = eval(input())
ans = 0
for i in range(10):
for j in range(10):
for k in range(10):
a = S.find(str(i))
if a == -1:
continue
# i が含まれるとき
b = S.find(str(j), a + 1)
if not (a < b):
... | # D - Lucky PIN
N = int(eval(input()))
S = eval(input())
cnt = 0
for i in range(10):
for j in range(10):
for k in range(10):
a = S.find(str(i))
if a == -1:
continue
b = S.find(str(j), a + 1)
if b == -1:
continue
c = ... | false | 13.636364 | [
"-ans = 0",
"+cnt = 0",
"- # i が含まれるとき",
"- if not (a < b):",
"+ if b == -1:",
"- # j の index が a以降のとき",
"- if not (b < c):",
"+ if c == -1:",
"- # k の index が b 以降のとき",
"- ans += 1",
"-print(ans)",
"+ ... | false | 0.035841 | 0.040668 | 0.881303 | [
"s891486466",
"s573099789"
] |
u297574184 | p03394 | python | s977419002 | s722511581 | 33 | 29 | 5,472 | 5,100 | Accepted | Accepted | 12.12 | N = int(eval(input()))
if N == 3:
ans = {2, 3, 25}
elif N == 4:
ans = {2, 3, 4, 9}
elif N == 5:
ans = {2, 3, 4, 6, 9}
else:
ans = set()
sumAns = 0
num = 0
# 2の倍数もしくは3の倍数を、小さい順に追加する
for i in range(1, 30001):
if i % 2 == 0 or i % 3 == 0:
ans.add(i)
... | N = int(eval(input()))
if N == 3:
ans = [2, 3, 25]
else:
# [合計が6の倍数]を常に満たすように追加する
if N % 2 == 0:
As = [2, 10, 3, 9, 4, 8, 6, 12]
else:
As = [6, 2, 10, 3, 9, 4, 8, 12]
ans = []
for i in range(N):
ans.append(As[i % 8] + 12 * (i // 8))
print((' '.join(map(s... | 33 | 16 | 743 | 324 | N = int(eval(input()))
if N == 3:
ans = {2, 3, 25}
elif N == 4:
ans = {2, 3, 4, 9}
elif N == 5:
ans = {2, 3, 4, 6, 9}
else:
ans = set()
sumAns = 0
num = 0
# 2の倍数もしくは3の倍数を、小さい順に追加する
for i in range(1, 30001):
if i % 2 == 0 or i % 3 == 0:
ans.add(i)
sumAns +=... | N = int(eval(input()))
if N == 3:
ans = [2, 3, 25]
else:
# [合計が6の倍数]を常に満たすように追加する
if N % 2 == 0:
As = [2, 10, 3, 9, 4, 8, 6, 12]
else:
As = [6, 2, 10, 3, 9, 4, 8, 12]
ans = []
for i in range(N):
ans.append(As[i % 8] + 12 * (i // 8))
print((" ".join(map(str, ans))))
| false | 51.515152 | [
"- ans = {2, 3, 25}",
"-elif N == 4:",
"- ans = {2, 3, 4, 9}",
"-elif N == 5:",
"- ans = {2, 3, 4, 6, 9}",
"+ ans = [2, 3, 25]",
"- ans = set()",
"- sumAns = 0",
"- num = 0",
"- # 2の倍数もしくは3の倍数を、小さい順に追加する",
"- for i in range(1, 30001):",
"- if i % 2 == 0 or i %... | false | 0.034695 | 0.040667 | 0.853156 | [
"s977419002",
"s722511581"
] |
u477977638 | p02883 | python | s229925876 | s639647371 | 413 | 357 | 34,476 | 34,380 | Accepted | Accepted | 13.56 | import sys
read = sys.stdin.buffer.read
input = sys.stdin.buffer.readline
inputs= sys.stdin.buffer.readlines
#rstrip().decode('utf-8')
#import math
import numpy as np
#import operator
#from heapq import heapify,heappop,heappush
#from math import gcd
#from fractions import gcd
#from collections import deque... | import sys
read = sys.stdin.buffer.read
input = sys.stdin.buffer.readline
inputs= sys.stdin.buffer.readlines
#rstrip().decode('utf-8')
#import math
import numpy as np
#import operator
#from heapq import heapify,heappop,heappush
#from math import gcd
#from fractions import gcd
#from collections import deque... | 52 | 52 | 1,151 | 1,152 | import sys
read = sys.stdin.buffer.read
input = sys.stdin.buffer.readline
inputs = sys.stdin.buffer.readlines
# rstrip().decode('utf-8')
# import math
import numpy as np
# import operator
# from heapq import heapify,heappop,heappush
# from math import gcd
# from fractions import gcd
# from collections import deque
# ... | import sys
read = sys.stdin.buffer.read
input = sys.stdin.buffer.readline
inputs = sys.stdin.buffer.readlines
# rstrip().decode('utf-8')
# import math
import numpy as np
# import operator
# from heapq import heapify,heappop,heappush
# from math import gcd
# from fractions import gcd
# from collections import deque
# ... | false | 0 | [
"- Asum = sum(A)",
"+ Asum = A.sum()"
] | false | 0.681451 | 0.313874 | 2.171101 | [
"s229925876",
"s639647371"
] |
u489124637 | p02691 | python | s154379378 | s678812647 | 332 | 262 | 73,928 | 57,728 | Accepted | Accepted | 21.08 | import collections
N = int(eval(input()))
A = list(map(int, input().split()))
B = collections.defaultdict(int)
C = collections.defaultdict(int)
for i in range(N):
B[i-A[i]] += 1
C[i+A[i]] += 1
#print(B)
#print(C)
ans = 0
for i in B:
#print(i) i=Key
ans += B[i]*C[i]
print(ans) | import collections
N = int(eval(input()))
A = list(map(int, input().split()))
B = {}
C = {}
for i in range(N):
if i-A[i] in B:
B[i-A[i]] += 1
else:
B[i-A[i]] = 1
if i+A[i] in C:
C[i+A[i]] += 1
else:
C[i+A[i]] = 1
#print(B)
#print(C)
ans = 0
for i in B... | 17 | 24 | 305 | 390 | import collections
N = int(eval(input()))
A = list(map(int, input().split()))
B = collections.defaultdict(int)
C = collections.defaultdict(int)
for i in range(N):
B[i - A[i]] += 1
C[i + A[i]] += 1
# print(B)
# print(C)
ans = 0
for i in B:
# print(i) i=Key
ans += B[i] * C[i]
print(ans)
| import collections
N = int(eval(input()))
A = list(map(int, input().split()))
B = {}
C = {}
for i in range(N):
if i - A[i] in B:
B[i - A[i]] += 1
else:
B[i - A[i]] = 1
if i + A[i] in C:
C[i + A[i]] += 1
else:
C[i + A[i]] = 1
# print(B)
# print(C)
ans = 0
for i in B:
... | false | 29.166667 | [
"-B = collections.defaultdict(int)",
"-C = collections.defaultdict(int)",
"+B = {}",
"+C = {}",
"- B[i - A[i]] += 1",
"- C[i + A[i]] += 1",
"+ if i - A[i] in B:",
"+ B[i - A[i]] += 1",
"+ else:",
"+ B[i - A[i]] = 1",
"+ if i + A[i] in C:",
"+ C[i + A[i]] += ... | false | 0.048575 | 0.077456 | 0.627123 | [
"s154379378",
"s678812647"
] |
u367701763 | p03163 | python | s527576907 | s040165589 | 328 | 116 | 79,756 | 65,932 | Accepted | Accepted | 64.63 | def knapsack_weight(single=True):
"""
重さが小さい時のナップサックDP
:param single: True = 重複なし
"""
""" dp[weight <= W] = 重さ上限を固定した時の最大価値 """
dp_min = 0 # 総和価値の最小値
dp = [dp_min] * (W + 1)
for item in range(N):
if single:
S = list(range(W, weight_list[item] - 1, -1))
... | def knapsack_weight(single=True):
"""
重さが小さい時のナップサックDP
:param single: True = 重複なし
"""
""" dp[weight <= W] = 重さ上限を固定した時の最大価値 """
dp_min = 0 # 総和価値の最小値
dp = [dp_min] * (W + 1)
for item in range(N):
S = list(range(W, weight_list[item] - 1, -1))
for weight in S:
... | 29 | 29 | 872 | 829 | def knapsack_weight(single=True):
"""
重さが小さい時のナップサックDP
:param single: True = 重複なし
"""
""" dp[weight <= W] = 重さ上限を固定した時の最大価値 """
dp_min = 0 # 総和価値の最小値
dp = [dp_min] * (W + 1)
for item in range(N):
if single:
S = list(range(W, weight_list[item] - 1, -1))
else:
... | def knapsack_weight(single=True):
"""
重さが小さい時のナップサックDP
:param single: True = 重複なし
"""
""" dp[weight <= W] = 重さ上限を固定した時の最大価値 """
dp_min = 0 # 総和価値の最小値
dp = [dp_min] * (W + 1)
for item in range(N):
S = list(range(W, weight_list[item] - 1, -1))
for weight in S:
... | false | 0 | [
"- if single:",
"- S = list(range(W, weight_list[item] - 1, -1))",
"- else:",
"- S = list(range(weight_list[item], W + 1))",
"+ S = list(range(W, weight_list[item] - 1, -1))",
"+import sys",
"+",
"+input = sys.stdin.readline"
] | false | 0.040162 | 0.037528 | 1.07018 | [
"s527576907",
"s040165589"
] |
u687416863 | p02554 | python | s196453742 | s801641149 | 400 | 27 | 10,900 | 9,060 | Accepted | Accepted | 93.25 | N=int(eval(input()))
print(((pow(10,N)-pow(9,N)*2+pow(8,N))%1000000007)) | N=int(eval(input()))
print(((pow(10,N,1000000007)-pow(9,N,1000000007)*2+pow(8,N,1000000007))%1000000007))
#print((pow(10,N)-pow(9,N)*2+pow(8,N))%1000000007) | 2 | 3 | 65 | 150 | N = int(eval(input()))
print(((pow(10, N) - pow(9, N) * 2 + pow(8, N)) % 1000000007))
| N = int(eval(input()))
print(
(
(pow(10, N, 1000000007) - pow(9, N, 1000000007) * 2 + pow(8, N, 1000000007))
% 1000000007
)
)
# print((pow(10,N)-pow(9,N)*2+pow(8,N))%1000000007)
| false | 33.333333 | [
"-print(((pow(10, N) - pow(9, N) * 2 + pow(8, N)) % 1000000007))",
"+print(",
"+ (",
"+ (pow(10, N, 1000000007) - pow(9, N, 1000000007) * 2 + pow(8, N, 1000000007))",
"+ % 1000000007",
"+ )",
"+)",
"+# print((pow(10,N)-pow(9,N)*2+pow(8,N))%1000000007)"
] | false | 0.233543 | 0.006839 | 34.150704 | [
"s196453742",
"s801641149"
] |
u692498898 | p02837 | python | s422147434 | s034809620 | 882 | 315 | 3,444 | 3,064 | Accepted | Accepted | 64.29 | n=int(eval(input()))
xy=[]
for i in range(n):
a=int(eval(input()))
xy.append([list(map(int,input().split())) for j in range(a)])
ans=[]
for i in range(2**n):
honest=[]
for j in range(n):
if (i>>j)&1:
honest.append(1)
else:
honest.append(0)
p=0
q=0
for j,k in enumerate(... | n=int(eval(input()))
xy=[]
for i in range(n):
a=int(eval(input()))
xy.append([list(map(int,input().split())) for j in range(a)])
ans=0
for i in range(2**n):
honest=[]
for j in range(n):
if (i>>j)&1:
honest.append(1)
else:
honest.append(0)
p=0
for j,k in enumerate(honest)... | 28 | 27 | 516 | 513 | n = int(eval(input()))
xy = []
for i in range(n):
a = int(eval(input()))
xy.append([list(map(int, input().split())) for j in range(a)])
ans = []
for i in range(2**n):
honest = []
for j in range(n):
if (i >> j) & 1:
honest.append(1)
else:
honest.append(0)
p = 0... | n = int(eval(input()))
xy = []
for i in range(n):
a = int(eval(input()))
xy.append([list(map(int, input().split())) for j in range(a)])
ans = 0
for i in range(2**n):
honest = []
for j in range(n):
if (i >> j) & 1:
honest.append(1)
else:
honest.append(0)
p = 0
... | false | 3.571429 | [
"-ans = []",
"+ans = 0",
"- q = 0",
"- q = q + 1",
"- if honest[l[0] - 1] == l[1]:",
"- r = r + 1",
"- if r == len(xy[j]):",
"+ if honest[l[0] - 1] != l[1]:",
"+ r = 1",
"+ break",
"+ ... | false | 0.045036 | 0.037732 | 1.193555 | [
"s422147434",
"s034809620"
] |
u445624660 | p03252 | python | s604026864 | s059883384 | 136 | 98 | 3,632 | 4,164 | Accepted | Accepted | 27.94 | # 1対1なので決めていく
s, t = eval(input()), eval(input())
sd, td = {}, {}
for i in range(len(s)):
if t[i] not in td and s[i] not in sd:
sd[s[i]] = t[i]
td[t[i]] = s[i]
elif t[i] in td and s[i] in sd and td[t[i]] == s[i] and sd[s[i]] == t[i]:
continue
else:
print("No")
... | # きりみんちゃんの配信からきました
# 登場回数が同一ならいけそうなのでそうする
from string import ascii_lowercase
s, t = eval(input()), eval(input())
alphabets = ascii_lowercase
sd, td = {}, {}
for sv in s:
if sv in sd:
sd[sv] += 1
else:
sd[sv] = 1
for tv in t:
if tv in td:
td[tv] += 1
else:
t... | 13 | 19 | 333 | 425 | # 1対1なので決めていく
s, t = eval(input()), eval(input())
sd, td = {}, {}
for i in range(len(s)):
if t[i] not in td and s[i] not in sd:
sd[s[i]] = t[i]
td[t[i]] = s[i]
elif t[i] in td and s[i] in sd and td[t[i]] == s[i] and sd[s[i]] == t[i]:
continue
else:
print("No")
exit()
... | # きりみんちゃんの配信からきました
# 登場回数が同一ならいけそうなのでそうする
from string import ascii_lowercase
s, t = eval(input()), eval(input())
alphabets = ascii_lowercase
sd, td = {}, {}
for sv in s:
if sv in sd:
sd[sv] += 1
else:
sd[sv] = 1
for tv in t:
if tv in td:
td[tv] += 1
else:
td[tv] = 1
sort... | false | 31.578947 | [
"-# 1対1なので決めていく",
"+# きりみんちゃんの配信からきました",
"+# 登場回数が同一ならいけそうなのでそうする",
"+from string import ascii_lowercase",
"+",
"+alphabets = ascii_lowercase",
"-for i in range(len(s)):",
"- if t[i] not in td and s[i] not in sd:",
"- sd[s[i]] = t[i]",
"- td[t[i]] = s[i]",
"- elif t[i] in td ... | false | 0.039724 | 0.045671 | 0.869792 | [
"s604026864",
"s059883384"
] |
u767995501 | p03292 | python | s594215329 | s085449226 | 19 | 17 | 2,940 | 2,940 | Accepted | Accepted | 10.53 | A = list(map(int, input().split()))
A_sort = sorted(A)
print((abs(A_sort[1] - A_sort[0]) + (A_sort[2] - A_sort[1])))
| a,b,c=sorted(map(int,input().split()))
print((c-a))
| 4 | 2 | 119 | 51 | A = list(map(int, input().split()))
A_sort = sorted(A)
print((abs(A_sort[1] - A_sort[0]) + (A_sort[2] - A_sort[1])))
| a, b, c = sorted(map(int, input().split()))
print((c - a))
| false | 50 | [
"-A = list(map(int, input().split()))",
"-A_sort = sorted(A)",
"-print((abs(A_sort[1] - A_sort[0]) + (A_sort[2] - A_sort[1])))",
"+a, b, c = sorted(map(int, input().split()))",
"+print((c - a))"
] | false | 0.042072 | 0.042868 | 0.981423 | [
"s594215329",
"s085449226"
] |
u064505481 | p03161 | python | s369394155 | s932986752 | 371 | 295 | 41,836 | 92,292 | Accepted | Accepted | 20.49 | from sys import stdin, stdout
rl = lambda: stdin.readline()
rll = lambda: stdin.readline().split()
rli = lambda: list(map(int, stdin.readline().split()))
INF, NINF = float('inf'), float('-inf')
def main():
n, k = rli()
H = list(rli())
dp = [INF for _ in range(n)]
dp[0] = 0
for i in range(1, n):
fo... | from sys import stdin, stdout, setrecursionlimit
from collections import deque, defaultdict, Counter
from heapq import heappush, heappop
import math
rl = lambda: stdin.readline()
rll = lambda: stdin.readline().split()
rli = lambda: list(map(int, stdin.readline().split()))
rlf = lambda: list(map(float, stdin.re... | 21 | 25 | 480 | 640 | from sys import stdin, stdout
rl = lambda: stdin.readline()
rll = lambda: stdin.readline().split()
rli = lambda: list(map(int, stdin.readline().split()))
INF, NINF = float("inf"), float("-inf")
def main():
n, k = rli()
H = list(rli())
dp = [INF for _ in range(n)]
dp[0] = 0
for i in range(1, n):
... | from sys import stdin, stdout, setrecursionlimit
from collections import deque, defaultdict, Counter
from heapq import heappush, heappop
import math
rl = lambda: stdin.readline()
rll = lambda: stdin.readline().split()
rli = lambda: list(map(int, stdin.readline().split()))
rlf = lambda: list(map(float, stdin.readline()... | false | 16 | [
"-from sys import stdin, stdout",
"+from sys import stdin, stdout, setrecursionlimit",
"+from collections import deque, defaultdict, Counter",
"+from heapq import heappush, heappop",
"+import math",
"+rlf = lambda: list(map(float, stdin.readline().split()))",
"- H = list(rli())",
"+ A = list(rli... | false | 0.046635 | 0.038236 | 1.219652 | [
"s369394155",
"s932986752"
] |
u714642969 | p03014 | python | s999556361 | s562996303 | 1,972 | 1,328 | 251,016 | 248,712 | Accepted | Accepted | 32.66 | import sys
sys.setrecursionlimit(10**9)
def input():
return sys.stdin.readline().rstrip()
def main():
H, W = list(map(int, input().split()))
S = [list(eval(input())) for i in range(H)]
ans = float(0)
memo_y = [[-float('inf')]*W for i in range(H)]
memo_x = [[-float('inf')]*W for ... | import sys
sys.setrecursionlimit(10**9)
INF = 10**18
def input():
return sys.stdin.readline().rstrip()
def main():
H, W = list(map(int, input().split()))
S = [list(eval(input())) for i in range(H)]
ans = 0
memo_y = [[-INF]*W for i in range(H)]
memo_x = [[-INF]*W for i in range(H)]
... | 64 | 63 | 2,090 | 1,996 | import sys
sys.setrecursionlimit(10**9)
def input():
return sys.stdin.readline().rstrip()
def main():
H, W = list(map(int, input().split()))
S = [list(eval(input())) for i in range(H)]
ans = float(0)
memo_y = [[-float("inf")] * W for i in range(H)]
memo_x = [[-float("inf")] * W for i in ran... | import sys
sys.setrecursionlimit(10**9)
INF = 10**18
def input():
return sys.stdin.readline().rstrip()
def main():
H, W = list(map(int, input().split()))
S = [list(eval(input())) for i in range(H)]
ans = 0
memo_y = [[-INF] * W for i in range(H)]
memo_x = [[-INF] * W for i in range(H)]
f... | false | 1.5625 | [
"+INF = 10**18",
"- ans = float(0)",
"- memo_y = [[-float(\"inf\")] * W for i in range(H)]",
"- memo_x = [[-float(\"inf\")] * W for i in range(H)]",
"+ ans = 0",
"+ memo_y = [[-INF] * W for i in range(H)]",
"+ memo_x = [[-INF] * W for i in range(H)]",
"- c = float(0)",
"... | false | 0.034718 | 0.124594 | 0.278649 | [
"s999556361",
"s562996303"
] |
u327532412 | p02713 | python | s161036598 | s152380724 | 1,904 | 1,165 | 9,188 | 9,036 | Accepted | Accepted | 38.81 | from math import gcd
K = int(eval(input()))
ans = 0
for i in range(1, K+1):
for j in range(1, K+1):
for k in range(1, K+1):
ans += gcd(gcd(i, j), k)
print(ans) | from math import gcd
K = int(eval(input()))
ans = 0
for i in range(1, K+1):
for j in range(1, K+1):
a = gcd(i, j)
for k in range(1, K+1):
ans += gcd(a, k)
print(ans) | 8 | 9 | 184 | 199 | from math import gcd
K = int(eval(input()))
ans = 0
for i in range(1, K + 1):
for j in range(1, K + 1):
for k in range(1, K + 1):
ans += gcd(gcd(i, j), k)
print(ans)
| from math import gcd
K = int(eval(input()))
ans = 0
for i in range(1, K + 1):
for j in range(1, K + 1):
a = gcd(i, j)
for k in range(1, K + 1):
ans += gcd(a, k)
print(ans)
| false | 11.111111 | [
"+ a = gcd(i, j)",
"- ans += gcd(gcd(i, j), k)",
"+ ans += gcd(a, k)"
] | false | 0.047509 | 0.271925 | 0.174714 | [
"s161036598",
"s152380724"
] |
u218834617 | p02580 | python | s503517646 | s317503309 | 542 | 480 | 169,188 | 169,376 | Accepted | Accepted | 11.44 | h,w,m=list(map(int,input().split()))
r=[0]*h
c=[0]*w
s=set()
for _ in range(m):
i,j=list(map(int,input().split()))
i-=1
j-=1
r[i]+=1
c[j]+=1
s.add(i*w+j)
rmx=max(r)
cmx=max(c)
rc=[i for i in range(h) if r[i]==rmx]
cc=[j for j in range(w) if c[j]==cmx]
ans=rmx+cmx-1
ok=False... | h,w,m=list(map(int,input().split()))
r=[0]*h
c=[0]*w
s=set()
for _ in range(m):
i,j=list(map(int,input().split()))
i-=1
j-=1
r[i]+=1
c[j]+=1
s.add(i*w+j)
rmx=max(r)
cmx=max(c)
rc=[i for i in range(h) if r[i]==rmx]
cc=[j for j in range(w) if c[j]==cmx]
ans=rmx+cmx-1
for i in... | 30 | 26 | 470 | 419 | h, w, m = list(map(int, input().split()))
r = [0] * h
c = [0] * w
s = set()
for _ in range(m):
i, j = list(map(int, input().split()))
i -= 1
j -= 1
r[i] += 1
c[j] += 1
s.add(i * w + j)
rmx = max(r)
cmx = max(c)
rc = [i for i in range(h) if r[i] == rmx]
cc = [j for j in range(w) if c[j] == cmx]
a... | h, w, m = list(map(int, input().split()))
r = [0] * h
c = [0] * w
s = set()
for _ in range(m):
i, j = list(map(int, input().split()))
i -= 1
j -= 1
r[i] += 1
c[j] += 1
s.add(i * w + j)
rmx = max(r)
cmx = max(c)
rc = [i for i in range(h) if r[i] == rmx]
cc = [j for j in range(w) if c[j] == cmx]
a... | false | 13.333333 | [
"-ok = False",
"- ans += 1",
"- ok = True",
"- break",
"- if ok:",
"- break",
"+ print((ans + 1))",
"+ exit()"
] | false | 0.147734 | 0.048204 | 3.064778 | [
"s503517646",
"s317503309"
] |
u624475441 | p03283 | python | s923652620 | s706408078 | 430 | 390 | 37,168 | 38,468 | Accepted | Accepted | 9.3 | import sys
def main():
s = sys.stdin.readlines()
N, M, Q = list(map(int, s[0].split()))
x = [[0] * N for _ in [0] * N]
for e in s[1:M + 1]:
L, R = list(map(int, e.split()))
x[L - 1][R - 1] += 1
for k in range(1, N):
for i in range(N - k):
j = i + k
... | import sys
from itertools import accumulate as acc
def main():
s = sys.stdin.readlines()
N, M, _ = list(map(int, s[0].split()))
X = [[0] * N for _ in [0] * N]
for L, R in (list(map(int, e.split())) for e in s[1:M + 1]): X[L - 1][R - 1] += 1
S = [tuple(acc(reversed(s))) for s in zip(*(acc(x) f... | 19 | 11 | 559 | 464 | import sys
def main():
s = sys.stdin.readlines()
N, M, Q = list(map(int, s[0].split()))
x = [[0] * N for _ in [0] * N]
for e in s[1 : M + 1]:
L, R = list(map(int, e.split()))
x[L - 1][R - 1] += 1
for k in range(1, N):
for i in range(N - k):
j = i + k
... | import sys
from itertools import accumulate as acc
def main():
s = sys.stdin.readlines()
N, M, _ = list(map(int, s[0].split()))
X = [[0] * N for _ in [0] * N]
for L, R in (list(map(int, e.split())) for e in s[1 : M + 1]):
X[L - 1][R - 1] += 1
S = [tuple(acc(reversed(s))) for s in zip(*(acc... | false | 42.105263 | [
"+from itertools import accumulate as acc",
"- N, M, Q = list(map(int, s[0].split()))",
"- x = [[0] * N for _ in [0] * N]",
"- for e in s[1 : M + 1]:",
"- L, R = list(map(int, e.split()))",
"- x[L - 1][R - 1] += 1",
"- for k in range(1, N):",
"- for i in range(N - k):"... | false | 0.049044 | 0.047769 | 1.026685 | [
"s923652620",
"s706408078"
] |
u098012509 | p02939 | python | s242622624 | s568643336 | 78 | 41 | 3,624 | 3,500 | Accepted | Accepted | 47.44 | import sys
sys.setrecursionlimit(10 ** 8)
input = sys.stdin.readline
def main():
S = input().strip()
i = 1
prev = S[0]
cnt = 1
while i < len(S):
if S[i] == prev:
prev = prev + S[i]
if i + 1 < len(S):
prev = S[i] + S[i + 1]
... | import sys
sys.setrecursionlimit(10 ** 8)
input = sys.stdin.readline
def main():
S = input().strip()
prev = S[0]
c = ""
cnt = 1
for s in S[1:]:
c += s
if prev != c:
cnt += 1
prev = c
c = ""
print(cnt)
if __name__ ... | 32 | 25 | 550 | 347 | import sys
sys.setrecursionlimit(10**8)
input = sys.stdin.readline
def main():
S = input().strip()
i = 1
prev = S[0]
cnt = 1
while i < len(S):
if S[i] == prev:
prev = prev + S[i]
if i + 1 < len(S):
prev = S[i] + S[i + 1]
cnt += 1
... | import sys
sys.setrecursionlimit(10**8)
input = sys.stdin.readline
def main():
S = input().strip()
prev = S[0]
c = ""
cnt = 1
for s in S[1:]:
c += s
if prev != c:
cnt += 1
prev = c
c = ""
print(cnt)
if __name__ == "__main__":
main()
| false | 21.875 | [
"- i = 1",
"+ c = \"\"",
"- while i < len(S):",
"- if S[i] == prev:",
"- prev = prev + S[i]",
"- if i + 1 < len(S):",
"- prev = S[i] + S[i + 1]",
"- cnt += 1",
"- i += 2",
"- else:",
"- i... | false | 0.0806 | 0.037557 | 2.146066 | [
"s242622624",
"s568643336"
] |
u699296734 | p03778 | python | s056838551 | s054812329 | 30 | 27 | 9,120 | 9,104 | Accepted | Accepted | 10 | w, a, b = list(map(int, input().split()))
if b + w < a:
res = a - (b + w)
elif a <= b + w <= a + 2 * w:
res = 0
else:
res = b - (a + w)
print(res)
| w, a, b = list(map(int, input().split()))
res = max(0, abs(a - b) - w)
print(res)
| 9 | 3 | 162 | 78 | w, a, b = list(map(int, input().split()))
if b + w < a:
res = a - (b + w)
elif a <= b + w <= a + 2 * w:
res = 0
else:
res = b - (a + w)
print(res)
| w, a, b = list(map(int, input().split()))
res = max(0, abs(a - b) - w)
print(res)
| false | 66.666667 | [
"-if b + w < a:",
"- res = a - (b + w)",
"-elif a <= b + w <= a + 2 * w:",
"- res = 0",
"-else:",
"- res = b - (a + w)",
"+res = max(0, abs(a - b) - w)"
] | false | 0.044683 | 0.04739 | 0.942882 | [
"s056838551",
"s054812329"
] |
u525065967 | p03309 | python | s572978415 | s824815109 | 270 | 246 | 25,196 | 25,196 | Accepted | Accepted | 8.89 | n = int(eval(input()))
A = list(map(int, input().split()))
B = []
for i in range(n): B.append(A[i] - (i+1))
B.sort()
r = B[n//2] # median right
l = B[n//2] if n%2 else B[n//2-1] # median left
# print(n,A)
# print(B)
# print(l,r)
ans_l = 0
ans_r = 0
for bi in B:
ans_l += abs(bi-l)
ans_r += abs(bi-r... | n = int(eval(input()))
B = list(a-i for i,a in zip(list(range(1,n+1)), list(map(int,input().split()))))
B.sort()
l = r = B[n//2] # median left, right
if n%2 == 0: l -= 1 # left fix
ans_l, ans_r = 0, 0
for bi in B:
ans_l += abs(bi-l)
ans_r += abs(bi-r)
print((min([ans_l, ans_r])))
| 16 | 10 | 344 | 278 | n = int(eval(input()))
A = list(map(int, input().split()))
B = []
for i in range(n):
B.append(A[i] - (i + 1))
B.sort()
r = B[n // 2] # median right
l = B[n // 2] if n % 2 else B[n // 2 - 1] # median left
# print(n,A)
# print(B)
# print(l,r)
ans_l = 0
ans_r = 0
for bi in B:
ans_l += abs(bi - l)
ans_r += ab... | n = int(eval(input()))
B = list(a - i for i, a in zip(list(range(1, n + 1)), list(map(int, input().split()))))
B.sort()
l = r = B[n // 2] # median left, right
if n % 2 == 0:
l -= 1 # left fix
ans_l, ans_r = 0, 0
for bi in B:
ans_l += abs(bi - l)
ans_r += abs(bi - r)
print((min([ans_l, ans_r])))
| false | 37.5 | [
"-A = list(map(int, input().split()))",
"-B = []",
"-for i in range(n):",
"- B.append(A[i] - (i + 1))",
"+B = list(a - i for i, a in zip(list(range(1, n + 1)), list(map(int, input().split()))))",
"-r = B[n // 2] # median right",
"-l = B[n // 2] if n % 2 else B[n // 2 - 1] # median left",
"-# prin... | false | 0.037428 | 0.097943 | 0.382137 | [
"s572978415",
"s824815109"
] |
u621935300 | p03503 | python | s324182380 | s285935352 | 301 | 88 | 3,844 | 33,640 | Accepted | Accepted | 70.76 | import itertools
N=eval(input())
F=[]
for i in range(N):
F.append(list(map(int,input().split())))
#print F
P=[]
for i in range(N):
P.append(list(map(int,input().split())))
#print P
l=list(itertools.product(list(range(2)), repeat=10))
#l=[(1, 1, 1, 1, 1, 0, 0, 0, 0, 0),(0, 0, 0, 0, 0, 1, 1, 1, 1, 1),(... | # -*- coding: utf-8 -*-
import sys
N=eval(input())
F=[ list(map(int, sys.stdin.readline().split())) for _ in range(N)]
P=[ list(map(int, sys.stdin.readline().split())) for _ in range(N)]
D=[] #各店の状態を10進数で表示
for f in F: #各店の状態を10進数に置き換え
n=0
for i,x in enumerate(f):
if x==1:
n... | 38 | 31 | 797 | 623 | import itertools
N = eval(input())
F = []
for i in range(N):
F.append(list(map(int, input().split())))
# print F
P = []
for i in range(N):
P.append(list(map(int, input().split())))
# print P
l = list(itertools.product(list(range(2)), repeat=10))
# l=[(1, 1, 1, 1, 1, 0, 0, 0, 0, 0),(0, 0, 0, 0, 0, 1, 1, 1, 1, 1... | # -*- coding: utf-8 -*-
import sys
N = eval(input())
F = [list(map(int, sys.stdin.readline().split())) for _ in range(N)]
P = [list(map(int, sys.stdin.readline().split())) for _ in range(N)]
D = [] # 各店の状態を10進数で表示
for f in F: # 各店の状態を10進数に置き換え
n = 0
for i, x in enumerate(f):
if x == 1:
n ... | false | 18.421053 | [
"-import itertools",
"+# -*- coding: utf-8 -*-",
"+import sys",
"-F = []",
"-for i in range(N):",
"- F.append(list(map(int, input().split())))",
"-# print F",
"-P = []",
"-for i in range(N):",
"- P.append(list(map(int, input().split())))",
"-# print P",
"-l = list(itertools.product(list(... | false | 0.042377 | 0.10162 | 0.417015 | [
"s324182380",
"s285935352"
] |
u013756322 | p03644 | python | s512653004 | s185131546 | 19 | 17 | 2,940 | 2,940 | Accepted | Accepted | 10.53 | n = int(eval(input()))
ans = [-1000] + [0] * n
for i in range(1, n + 1):
j = i
while (j % 2 == 0):
ans[i] += 1
j /= 2
print((ans.index(max(ans))))
| n = int(eval(input()))
A = [2 ** i for i in range(1, 7)]
ans = 1
for a in A:
if (n < a):
break
ans = a
print(ans)
| 8 | 8 | 158 | 123 | n = int(eval(input()))
ans = [-1000] + [0] * n
for i in range(1, n + 1):
j = i
while j % 2 == 0:
ans[i] += 1
j /= 2
print((ans.index(max(ans))))
| n = int(eval(input()))
A = [2**i for i in range(1, 7)]
ans = 1
for a in A:
if n < a:
break
ans = a
print(ans)
| false | 0 | [
"-ans = [-1000] + [0] * n",
"-for i in range(1, n + 1):",
"- j = i",
"- while j % 2 == 0:",
"- ans[i] += 1",
"- j /= 2",
"-print((ans.index(max(ans))))",
"+A = [2**i for i in range(1, 7)]",
"+ans = 1",
"+for a in A:",
"+ if n < a:",
"+ break",
"+ ans = a",
... | false | 0.041992 | 0.03986 | 1.053497 | [
"s512653004",
"s185131546"
] |
u382114513 | p02723 | python | s862707326 | s337898017 | 174 | 63 | 38,256 | 61,856 | Accepted | Accepted | 63.79 | from sys import stdin
inp = stdin.readline
t = inp().strip()
if t[2] == t[3] and t[4] == t[5]:
print("Yes")
else:
print("No")
| s = eval(input())
if s[2] == s[3] and s[4] == s[5]:
print('Yes')
else:
print('No') | 12 | 5 | 150 | 84 | from sys import stdin
inp = stdin.readline
t = inp().strip()
if t[2] == t[3] and t[4] == t[5]:
print("Yes")
else:
print("No")
| s = eval(input())
if s[2] == s[3] and s[4] == s[5]:
print("Yes")
else:
print("No")
| false | 58.333333 | [
"-from sys import stdin",
"-",
"-inp = stdin.readline",
"-t = inp().strip()",
"-if t[2] == t[3] and t[4] == t[5]:",
"+s = eval(input())",
"+if s[2] == s[3] and s[4] == s[5]:"
] | false | 0.037108 | 0.037404 | 0.99208 | [
"s862707326",
"s337898017"
] |
u900109664 | p03712 | python | s122911410 | s551222351 | 27 | 18 | 4,596 | 3,060 | Accepted | Accepted | 33.33 | y,x = map(int, input().split())
li = []
for i in range(y):
li.append(list(input()))
print('#'*(x+2))
for i in li:
print('#', end = '')
for k in i:
print(k, end = '')
print('#')
print('#'*(x+2))
| y,x = map(int, input().split())
li = []
for i in range(y):
li.append(input())
print('#'*(x+2))
for i in li:
print('#', end = '')
print(i, end = '')
print('#')
print('#'*(x+2))
| 12 | 11 | 230 | 203 | y, x = map(int, input().split())
li = []
for i in range(y):
li.append(list(input()))
print("#" * (x + 2))
for i in li:
print("#", end="")
for k in i:
print(k, end="")
print("#")
print("#" * (x + 2))
| y, x = map(int, input().split())
li = []
for i in range(y):
li.append(input())
print("#" * (x + 2))
for i in li:
print("#", end="")
print(i, end="")
print("#")
print("#" * (x + 2))
| false | 8.333333 | [
"- li.append(list(input()))",
"+ li.append(input())",
"- for k in i:",
"- print(k, end=\"\")",
"+ print(i, end=\"\")"
] | false | 0.043793 | 0.04264 | 1.027036 | [
"s122911410",
"s551222351"
] |
u571537830 | p02713 | python | s595639624 | s172023572 | 1,903 | 1,312 | 9,112 | 9,076 | Accepted | Accepted | 31.06 | from math import gcd
k = int(eval(input()))
sum = 0
for a in range(1,k+1):
for b in range(1,k+1):
for c in range(1,k+1):
sum += gcd(gcd(a, b), c)
print(sum) | import math
k = int(eval(input()))
sum = 0
for a in range(1,k+1):
for b in range(1,k+1):
x = math.gcd(a, b)
for c in range(1,k+1):
sum += math.gcd(x, c)
print(sum) | 10 | 11 | 186 | 202 | from math import gcd
k = int(eval(input()))
sum = 0
for a in range(1, k + 1):
for b in range(1, k + 1):
for c in range(1, k + 1):
sum += gcd(gcd(a, b), c)
print(sum)
| import math
k = int(eval(input()))
sum = 0
for a in range(1, k + 1):
for b in range(1, k + 1):
x = math.gcd(a, b)
for c in range(1, k + 1):
sum += math.gcd(x, c)
print(sum)
| false | 9.090909 | [
"-from math import gcd",
"+import math",
"+ x = math.gcd(a, b)",
"- sum += gcd(gcd(a, b), c)",
"+ sum += math.gcd(x, c)"
] | false | 0.128312 | 0.165631 | 0.774686 | [
"s595639624",
"s172023572"
] |
u618373524 | p02675 | python | s578809801 | s358366752 | 26 | 19 | 9,108 | 9,064 | Accepted | Accepted | 26.92 | n = eval(input())
if n[-1] == "2" or n[-1] == "4" or n[-1] == "5" or n[-1] == "7" or n[-1] == "9" :
print("hon")
elif n[-1] == "0" or n[-1] == "1" or n[-1] == "6" or n[-1] == "8" :
print("pon")
else:
print("bon")
| n = eval(input())
if n[-1] in("2","4","5","7","9") :
print("hon")
elif n[-1] in("0","1","6","8"):
print("pon")
else:
print("bon") | 7 | 7 | 225 | 141 | n = eval(input())
if n[-1] == "2" or n[-1] == "4" or n[-1] == "5" or n[-1] == "7" or n[-1] == "9":
print("hon")
elif n[-1] == "0" or n[-1] == "1" or n[-1] == "6" or n[-1] == "8":
print("pon")
else:
print("bon")
| n = eval(input())
if n[-1] in ("2", "4", "5", "7", "9"):
print("hon")
elif n[-1] in ("0", "1", "6", "8"):
print("pon")
else:
print("bon")
| false | 0 | [
"-if n[-1] == \"2\" or n[-1] == \"4\" or n[-1] == \"5\" or n[-1] == \"7\" or n[-1] == \"9\":",
"+if n[-1] in (\"2\", \"4\", \"5\", \"7\", \"9\"):",
"-elif n[-1] == \"0\" or n[-1] == \"1\" or n[-1] == \"6\" or n[-1] == \"8\":",
"+elif n[-1] in (\"0\", \"1\", \"6\", \"8\"):"
] | false | 0.036149 | 0.035586 | 1.015824 | [
"s578809801",
"s358366752"
] |
u670180528 | p03372 | python | s913535775 | s009908219 | 192 | 162 | 25,588 | 28,852 | Accepted | Accepted | 15.62 | from itertools import*
n,c,*L=list(map(int,open(0).read().split()))
acc=[a-x for x,a in zip(L[::2],accumulate(L[1::2]))]
acc_max=list(accumulate([0]+acc,max))
R=L[::-1]
rev=[a-(c-x) for x,a in zip(R[1::2],accumulate(R[::2]))]
rev_max=list(accumulate([0]+rev,max))
p=max(rev_max[n-i-1]+a-b for i,(a,b) in enumerate... | from itertools import accumulate as f
def main():
n, c, *L = list(map(int, open(0).read().split()))
acc = [a - x for x, a in zip(L[::2], f(L[1::2]))]
acc_max = list(f(acc, max))[::-1]
R = L[::-1]
rev = [a - (c - x) for x, a in zip(R[1::2], f(R[::2]))]
rev_max = list(f(rev, max))[::-1]
p = max([a - b + ... | 11 | 16 | 459 | 544 | from itertools import *
n, c, *L = list(map(int, open(0).read().split()))
acc = [a - x for x, a in zip(L[::2], accumulate(L[1::2]))]
acc_max = list(accumulate([0] + acc, max))
R = L[::-1]
rev = [a - (c - x) for x, a in zip(R[1::2], accumulate(R[::2]))]
rev_max = list(accumulate([0] + rev, max))
p = max(rev_max[n - i -... | from itertools import accumulate as f
def main():
n, c, *L = list(map(int, open(0).read().split()))
acc = [a - x for x, a in zip(L[::2], f(L[1::2]))]
acc_max = list(f(acc, max))[::-1]
R = L[::-1]
rev = [a - (c - x) for x, a in zip(R[1::2], f(R[::2]))]
rev_max = list(f(rev, max))[::-1]
p = ... | false | 31.25 | [
"-from itertools import *",
"+from itertools import accumulate as f",
"-n, c, *L = list(map(int, open(0).read().split()))",
"-acc = [a - x for x, a in zip(L[::2], accumulate(L[1::2]))]",
"-acc_max = list(accumulate([0] + acc, max))",
"-R = L[::-1]",
"-rev = [a - (c - x) for x, a in zip(R[1::2], accumula... | false | 0.054809 | 0.058271 | 0.940576 | [
"s913535775",
"s009908219"
] |
u150984829 | p02239 | python | s227219653 | s807857536 | 50 | 40 | 7,004 | 7,004 | Accepted | Accepted | 20 | import queue
N=int(eval(input()))
M=[input().split()[2:]for _ in[0]*N]
q=queue.Queue();q.put(0)
d=[-1]*N;d[0]=0
while q.qsize()>0:
u=q.get()
for v in M[u]:
v=int(v)-1
if d[v]<0:d[v]=d[u]+1;q.put(v)
for i in range(N):print((i+1,d[i]))
| import queue
N=int(eval(input()))
M=[list(map(int,input().split()[2:]))for _ in[0]*N]
q=queue.Queue();q.put(0)
d=[-1]*N;d[0]=0
while q.qsize()>0:
u=q.get()
for v in M[u]:
v-=1
if d[v]<0:d[v]=d[u]+1;q.put(v)
for i in range(N):print((i+1,d[i]))
| 11 | 11 | 242 | 251 | import queue
N = int(eval(input()))
M = [input().split()[2:] for _ in [0] * N]
q = queue.Queue()
q.put(0)
d = [-1] * N
d[0] = 0
while q.qsize() > 0:
u = q.get()
for v in M[u]:
v = int(v) - 1
if d[v] < 0:
d[v] = d[u] + 1
q.put(v)
for i in range(N):
print((i + 1, d[i])... | import queue
N = int(eval(input()))
M = [list(map(int, input().split()[2:])) for _ in [0] * N]
q = queue.Queue()
q.put(0)
d = [-1] * N
d[0] = 0
while q.qsize() > 0:
u = q.get()
for v in M[u]:
v -= 1
if d[v] < 0:
d[v] = d[u] + 1
q.put(v)
for i in range(N):
print((i + ... | false | 0 | [
"-M = [input().split()[2:] for _ in [0] * N]",
"+M = [list(map(int, input().split()[2:])) for _ in [0] * N]",
"- v = int(v) - 1",
"+ v -= 1"
] | false | 0.044043 | 0.045264 | 0.973016 | [
"s227219653",
"s807857536"
] |
u807315165 | p02856 | python | s206504732 | s330619753 | 672 | 600 | 53,772 | 12,612 | Accepted | Accepted | 10.71 | m = int(eval(input()))
d = [list(map(int, input().split())) for _ in range(m)]
print((sum([x[1] for x in d]) - 1 + (sum([x[0]*x[1] for x in d]) - 1) // 9))
| M=int(eval(input()))
#Get the number that needs to be handled
num=''
D,C=[],[]
for _ in range(M):
D1,C1=list(map(int, input().split()))
D.append(D1)
C.append(C1)
S = sum(d * c for d, c in zip(D, C))
print((sum(C)-1+(S-1)//9)) | 3 | 10 | 150 | 233 | m = int(eval(input()))
d = [list(map(int, input().split())) for _ in range(m)]
print((sum([x[1] for x in d]) - 1 + (sum([x[0] * x[1] for x in d]) - 1) // 9))
| M = int(eval(input()))
# Get the number that needs to be handled
num = ""
D, C = [], []
for _ in range(M):
D1, C1 = list(map(int, input().split()))
D.append(D1)
C.append(C1)
S = sum(d * c for d, c in zip(D, C))
print((sum(C) - 1 + (S - 1) // 9))
| false | 70 | [
"-m = int(eval(input()))",
"-d = [list(map(int, input().split())) for _ in range(m)]",
"-print((sum([x[1] for x in d]) - 1 + (sum([x[0] * x[1] for x in d]) - 1) // 9))",
"+M = int(eval(input()))",
"+# Get the number that needs to be handled",
"+num = \"\"",
"+D, C = [], []",
"+for _ in range(M):",
"... | false | 0.046231 | 0.045571 | 1.014477 | [
"s206504732",
"s330619753"
] |
u867069435 | p03457 | python | s046916219 | s943344656 | 370 | 325 | 3,064 | 3,060 | Accepted | Accepted | 12.16 | n = int(eval(input()))
pretime, prex, prey = 0, 0, 0
for i in range(n):
nowtime, nowx, nowy = list(map(int, input().split()))
time = nowtime - pretime
x = abs(nowx - prex)
y = abs(nowy - prey)
if x+y > time:
print("No")
exit()
if (x+y) % 2 != time % 2:
print("N... | n = int(eval(input()))
for i in range(n):
t,x,y=list(map(int,input().split()))
if(not((x+y)<=t and (x+y)%2 == t%2)):
print("No")
exit()
print("Yes") | 17 | 7 | 404 | 166 | n = int(eval(input()))
pretime, prex, prey = 0, 0, 0
for i in range(n):
nowtime, nowx, nowy = list(map(int, input().split()))
time = nowtime - pretime
x = abs(nowx - prex)
y = abs(nowy - prey)
if x + y > time:
print("No")
exit()
if (x + y) % 2 != time % 2:
print("No")
... | n = int(eval(input()))
for i in range(n):
t, x, y = list(map(int, input().split()))
if not ((x + y) <= t and (x + y) % 2 == t % 2):
print("No")
exit()
print("Yes")
| false | 58.823529 | [
"-pretime, prex, prey = 0, 0, 0",
"- nowtime, nowx, nowy = list(map(int, input().split()))",
"- time = nowtime - pretime",
"- x = abs(nowx - prex)",
"- y = abs(nowy - prey)",
"- if x + y > time:",
"+ t, x, y = list(map(int, input().split()))",
"+ if not ((x + y) <= t and (x + y) %... | false | 0.034718 | 0.035181 | 0.986829 | [
"s046916219",
"s943344656"
] |
u227082700 | p03393 | python | s334754328 | s814830277 | 19 | 17 | 3,064 | 3,064 | Accepted | Accepted | 10.53 | s=eval(input())
t="abcdefghijklmnopqrstuvwxyz"
if s==t[::-1]:print((-1));exit()
if len(s)<26:
for i in t:
if not i in s:print((s+i));exit()
else:
for i in range(25):
if s[-i-2]<s[-1-i]:
t=s[:-i-2]
a=sorted(list(s[-2-i:]))
print((t+a[a.index(s[-2-i])+1]));exit() | t="abcdefghijklmnopqrstuvwxyz"
s=eval(input())
if s==t[::-1]:print((-1));exit()
if len(s)!=26:
for i in t:
if i not in s:print((s+i));exit()
i=25
while s[i-1]>s[i]:i-=1
tt=s[i-1]
ss=list(s[i-1:])
ss.sort()
print((s[:i-1]+ss[ss.index(tt)+1])) | 12 | 12 | 290 | 246 | s = eval(input())
t = "abcdefghijklmnopqrstuvwxyz"
if s == t[::-1]:
print((-1))
exit()
if len(s) < 26:
for i in t:
if not i in s:
print((s + i))
exit()
else:
for i in range(25):
if s[-i - 2] < s[-1 - i]:
t = s[: -i - 2]
a = sorted(list(s[-2... | t = "abcdefghijklmnopqrstuvwxyz"
s = eval(input())
if s == t[::-1]:
print((-1))
exit()
if len(s) != 26:
for i in t:
if i not in s:
print((s + i))
exit()
i = 25
while s[i - 1] > s[i]:
i -= 1
tt = s[i - 1]
ss = list(s[i - 1 :])
ss.sort()
print((s[: i - 1] + ss[ss.index(tt) ... | false | 0 | [
"+t = \"abcdefghijklmnopqrstuvwxyz\"",
"-t = \"abcdefghijklmnopqrstuvwxyz\"",
"-if len(s) < 26:",
"+if len(s) != 26:",
"- if not i in s:",
"+ if i not in s:",
"-else:",
"- for i in range(25):",
"- if s[-i - 2] < s[-1 - i]:",
"- t = s[: -i - 2]",
"- a... | false | 0.114096 | 0.046309 | 2.463794 | [
"s334754328",
"s814830277"
] |
u758815106 | p03168 | python | s572986082 | s759770561 | 1,963 | 1,698 | 222,612 | 222,552 | Accepted | Accepted | 13.5 | #import
#import math
#import numpy as np
N = int(eval(input()))
#= input()
#= map(int, input().split())
p = list(map(float, input().split()))
#= [input(), input()]
#= [list(map(int, input().split())) for _ in range(N)]
#= {i:[] for i in range(N)}
dp = [[0.0] * (N + 1) for _ in range(N + 1)]
dp[0][0] = 1
... | import sys
input = sys.stdin.readline
#import math
#import numpy as np
N = int(eval(input()))
#= input()
#= map(int, input().split())
p = list(map(float, input().split()))
#= [input(), input()]
#= [list(map(int, input().split())) for _ in range(N)]
#= {i:[] for i in range(N)}
dp = [[0.0] * (N + 1) for _ in... | 32 | 35 | 683 | 718 | # import
# import math
# import numpy as np
N = int(eval(input()))
# = input()
# = map(int, input().split())
p = list(map(float, input().split()))
# = [input(), input()]
# = [list(map(int, input().split())) for _ in range(N)]
# = {i:[] for i in range(N)}
dp = [[0.0] * (N + 1) for _ in range(N + 1)]
dp[0][0] = 1
for i, ... | import sys
input = sys.stdin.readline
# import math
# import numpy as np
N = int(eval(input()))
# = input()
# = map(int, input().split())
p = list(map(float, input().split()))
# = [input(), input()]
# = [list(map(int, input().split())) for _ in range(N)]
# = {i:[] for i in range(N)}
dp = [[0.0] * (N + 1) for _ in rang... | false | 8.571429 | [
"-# import",
"+import sys",
"+",
"+input = sys.stdin.readline",
"+ dpi = dp[i - 1]",
"- dp[i][j] = dp[i - 1][j] * pp",
"+ dp[i][j] = dpi[j] * pp",
"- dp[i][j] = dp[i - 1][j - 1] * p",
"+ dp[i][j] = dpi[j - 1] * p",
"- dp[i][j] = dp[i - 1][j... | false | 0.035911 | 0.149657 | 0.239959 | [
"s572986082",
"s759770561"
] |
u375695365 | p02696 | python | s568465828 | s781054291 | 22 | 20 | 9,104 | 9,048 | Accepted | Accepted | 9.09 | a,b,n=list(map(int,input().split()))
ans=min(n,b-1)
print((a*ans//b-ans//b)) | import math
a,b,n=list(map(int,input().split()))
ans=min(n,b-1)
print((math.floor(a*ans/b)-math.floor(ans/b))) | 3 | 4 | 70 | 105 | a, b, n = list(map(int, input().split()))
ans = min(n, b - 1)
print((a * ans // b - ans // b))
| import math
a, b, n = list(map(int, input().split()))
ans = min(n, b - 1)
print((math.floor(a * ans / b) - math.floor(ans / b)))
| false | 25 | [
"+import math",
"+",
"-print((a * ans // b - ans // b))",
"+print((math.floor(a * ans / b) - math.floor(ans / b)))"
] | false | 0.101998 | 0.125792 | 0.810841 | [
"s568465828",
"s781054291"
] |
u477529658 | p02897 | python | s183710549 | s972342540 | 32 | 17 | 4,208 | 2,940 | Accepted | Accepted | 46.88 | import random
int_N = int(eval(input()))
i = 1
Kisu = 0
for i in range(int_N):
if i % 2 == 0:
Kisu += 1
print((Kisu/int_N)) |
int_N = int(eval(input()))
Kisu = 0
for i in range(1, int_N+1):
if (i % 2) == 1:
Kisu += 1
print((Kisu/int_N))
| 11 | 9 | 141 | 126 | import random
int_N = int(eval(input()))
i = 1
Kisu = 0
for i in range(int_N):
if i % 2 == 0:
Kisu += 1
print((Kisu / int_N))
| int_N = int(eval(input()))
Kisu = 0
for i in range(1, int_N + 1):
if (i % 2) == 1:
Kisu += 1
print((Kisu / int_N))
| false | 18.181818 | [
"-import random",
"-",
"-i = 1",
"-for i in range(int_N):",
"- if i % 2 == 0:",
"+for i in range(1, int_N + 1):",
"+ if (i % 2) == 1:"
] | false | 0.03816 | 0.090347 | 0.422368 | [
"s183710549",
"s972342540"
] |
u379692329 | p03436 | python | s783568695 | s273893302 | 29 | 24 | 3,316 | 3,316 | Accepted | Accepted | 17.24 | import sys
from collections import deque
sys.setrecursionlimit(10**7)
def bfs(h, w):
for i in dhw:
dh = i[0]
dw = i[1]
if h+dh < 0 or h+dh > H-1 or w+dw < 0 or w+dw > W-1 or field[h+dh][w+dw] == '#':
continue
if seen[h+dh][w+dw] == -1:
seen[h+d... | from collections import deque
H, W = list(map(int, input().split()))
start = [1, 1]
goal = [H, W]
maps = [[-1]*(W+2)] + [([-1] + list(eval(input())) + [-1]) for _ in range(H)] + [[-1]*(W+2)]
seen = [[-1]*(W+2) for _ in range(H+2)]
dxy = ((-1, 0), (1, 0), (0, -1), (0, 1))
todo = deque()
blacknum = 0
for ... | 35 | 39 | 866 | 898 | import sys
from collections import deque
sys.setrecursionlimit(10**7)
def bfs(h, w):
for i in dhw:
dh = i[0]
dw = i[1]
if (
h + dh < 0
or h + dh > H - 1
or w + dw < 0
or w + dw > W - 1
or field[h + dh][w + dw] == "#"
):
... | from collections import deque
H, W = list(map(int, input().split()))
start = [1, 1]
goal = [H, W]
maps = (
[[-1] * (W + 2)]
+ [([-1] + list(eval(input())) + [-1]) for _ in range(H)]
+ [[-1] * (W + 2)]
)
seen = [[-1] * (W + 2) for _ in range(H + 2)]
dxy = ((-1, 0), (1, 0), (0, -1), (0, 1))
todo = deque()
bl... | false | 10.25641 | [
"-import sys",
"-sys.setrecursionlimit(10**7)",
"+H, W = list(map(int, input().split()))",
"+start = [1, 1]",
"+goal = [H, W]",
"+maps = (",
"+ [[-1] * (W + 2)]",
"+ + [([-1] + list(eval(input())) + [-1]) for _ in range(H)]",
"+ + [[-1] * (W + 2)]",
"+)",
"+seen = [[-1] * (W + 2) for _ ... | false | 0.039118 | 0.044688 | 0.875366 | [
"s783568695",
"s273893302"
] |
u701531204 | p03474 | python | s002856230 | s825517849 | 19 | 17 | 3,064 | 3,064 | Accepted | Accepted | 10.53 | #!/usr/bin/env python3
import sys
YES = "Yes" # type: str
NO = "No" # type: str
def solve(A: int, B: int, S: str):
is_hyphen = True if S[A : A + 1] == "-" else False
before = S[:A]
after = S[A + 1 :]
try:
int(before)
int(after)
if is_hyphen:
print(... | #!/usr/bin/env python3
import sys
YES = "Yes" # type: str
NO = "No" # type: str
def solve(A: int, B: int, S: str):
is_mid = True if S[A] == "-" else False
is_num = (S[:A] + S[A + 1 :]).find("-") == -1
print((YES if is_mid and is_num else NO))
# Generated by 1.1.7.1 https://github.com/kyu... | 40 | 29 | 933 | 792 | #!/usr/bin/env python3
import sys
YES = "Yes" # type: str
NO = "No" # type: str
def solve(A: int, B: int, S: str):
is_hyphen = True if S[A : A + 1] == "-" else False
before = S[:A]
after = S[A + 1 :]
try:
int(before)
int(after)
if is_hyphen:
print(YES)
el... | #!/usr/bin/env python3
import sys
YES = "Yes" # type: str
NO = "No" # type: str
def solve(A: int, B: int, S: str):
is_mid = True if S[A] == "-" else False
is_num = (S[:A] + S[A + 1 :]).find("-") == -1
print((YES if is_mid and is_num else NO))
# Generated by 1.1.7.1 https://github.com/kyuridenamida/at... | false | 27.5 | [
"- is_hyphen = True if S[A : A + 1] == \"-\" else False",
"- before = S[:A]",
"- after = S[A + 1 :]",
"- try:",
"- int(before)",
"- int(after)",
"- if is_hyphen:",
"- print(YES)",
"- else:",
"- print(NO)",
"- except:",
"- ... | false | 0.041875 | 0.04188 | 0.999878 | [
"s002856230",
"s825517849"
] |
u131984977 | p02422 | python | s757803280 | s093547283 | 30 | 20 | 6,724 | 7,680 | Accepted | Accepted | 33.33 | text = eval(input())
count = int(eval(input()))
for c in range(count):
args = input().split()
(a, b) = [int(x) for x in args[1:3]]
if args[0] == 'print':
print((text[a:b + 1]))
elif args[0] == 'reverse':
text = text[0:a] + text[a:b + 1][::-1] + text[b + 1:]
elif args[0] ==... | s = eval(input())
q = int(eval(input()))
for qi in range(q):
command = input().split()
a = int(command[1])
b = int(command[2])
if command[0] == 'print':
print((s[a:b + 1]))
elif command[0] == 'reverse':
s = s[:a] + s[a:b + 1][::-1] + s[b + 1:]
else:
p = com... | 12 | 15 | 368 | 348 | text = eval(input())
count = int(eval(input()))
for c in range(count):
args = input().split()
(a, b) = [int(x) for x in args[1:3]]
if args[0] == "print":
print((text[a : b + 1]))
elif args[0] == "reverse":
text = text[0:a] + text[a : b + 1][::-1] + text[b + 1 :]
elif args[0] == "repl... | s = eval(input())
q = int(eval(input()))
for qi in range(q):
command = input().split()
a = int(command[1])
b = int(command[2])
if command[0] == "print":
print((s[a : b + 1]))
elif command[0] == "reverse":
s = s[:a] + s[a : b + 1][::-1] + s[b + 1 :]
else:
p = command[3]
... | false | 20 | [
"-text = eval(input())",
"-count = int(eval(input()))",
"-for c in range(count):",
"- args = input().split()",
"- (a, b) = [int(x) for x in args[1:3]]",
"- if args[0] == \"print\":",
"- print((text[a : b + 1]))",
"- elif args[0] == \"reverse\":",
"- text = text[0:a] + text[... | false | 0.035706 | 0.037334 | 0.956401 | [
"s757803280",
"s093547283"
] |
u102461423 | p03786 | python | s411201613 | s530260075 | 289 | 138 | 14,684 | 33,496 | Accepted | Accepted | 52.25 | import sys
input = sys.stdin.readline
N = int(eval(input()))
A = [int(x) for x in input().split()]
A.sort()
total = sum(A)
def test(i):
# i番の色の人が最大になれる
size = sum(A[:i+1])
for x in A[i+1:]:
if size*2 >= x:
size += x
else:
break
return size == t... | import sys
import numpy as np
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
A = np.array(read().split(), np.int64)[1:]
A.sort()
Acum = A.cumsum()
ng = Acum[:-1] * 2 < A[1:]
ng = np.logical_or.accumulate(ng[::-1])[::-1]
x = (~ng).sum() + 1
pri... | 30 | 16 | 523 | 325 | import sys
input = sys.stdin.readline
N = int(eval(input()))
A = [int(x) for x in input().split()]
A.sort()
total = sum(A)
def test(i):
# i番の色の人が最大になれる
size = sum(A[: i + 1])
for x in A[i + 1 :]:
if size * 2 >= x:
size += x
else:
break
return size == total
le... | import sys
import numpy as np
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
A = np.array(read().split(), np.int64)[1:]
A.sort()
Acum = A.cumsum()
ng = Acum[:-1] * 2 < A[1:]
ng = np.logical_or.accumulate(ng[::-1])[::-1]
x = (~ng).sum() + 1
print(x)
| false | 46.666667 | [
"+import numpy as np",
"-input = sys.stdin.readline",
"-N = int(eval(input()))",
"-A = [int(x) for x in input().split()]",
"+read = sys.stdin.buffer.read",
"+readline = sys.stdin.buffer.readline",
"+readlines = sys.stdin.buffer.readlines",
"+A = np.array(read().split(), np.int64)[1:]",
"-total = sum... | false | 0.041345 | 0.208031 | 0.198743 | [
"s411201613",
"s530260075"
] |
u377989038 | p02597 | python | s814540939 | s797605277 | 56 | 51 | 9,468 | 9,368 | Accepted | Accepted | 8.93 | n = int(eval(input()))
c = eval(input())
r = c.count("R")
w = n - r
cnt = 0
ans = 0
for i in c:
if cnt == r:
break
if i == "W":
ans += 1
cnt += 1
print((min(r, w, ans))) | n = int(eval(input()))
c = eval(input())
r = c.count("R")
cnt = 0
for i, j in enumerate(c):
if i == r:
break
if j == "W":
cnt += 1
print(cnt) | 14 | 11 | 197 | 164 | n = int(eval(input()))
c = eval(input())
r = c.count("R")
w = n - r
cnt = 0
ans = 0
for i in c:
if cnt == r:
break
if i == "W":
ans += 1
cnt += 1
print((min(r, w, ans)))
| n = int(eval(input()))
c = eval(input())
r = c.count("R")
cnt = 0
for i, j in enumerate(c):
if i == r:
break
if j == "W":
cnt += 1
print(cnt)
| false | 21.428571 | [
"-w = n - r",
"-ans = 0",
"-for i in c:",
"- if cnt == r:",
"+for i, j in enumerate(c):",
"+ if i == r:",
"- if i == \"W\":",
"- ans += 1",
"- cnt += 1",
"-print((min(r, w, ans)))",
"+ if j == \"W\":",
"+ cnt += 1",
"+print(cnt)"
] | false | 0.038499 | 0.039996 | 0.962569 | [
"s814540939",
"s797605277"
] |
u599114793 | p03062 | python | s936189648 | s572065028 | 104 | 87 | 14,412 | 14,412 | Accepted | Accepted | 16.35 | n = int(eval(input()))
a = list(map(int,input().split()))
minus_num = 0
for i in range(n):
if a[i] < 0:
minus_num += 1
if minus_num % 2 == 0:
ans = 0
for i in range(n):
ans += abs(a[i])
else:
min_abs = abs(a[0])
ans = 0
for i in range(n):
ans += abs(a[i])
... | n = int(eval(input()))
a = list(map(int,input().split()))
cnt = 0
for i in range(n):
if a[i] < 0:
cnt += 1
ans = 0
if cnt % 2 == 0:
for i in range(n):
ans += abs(a[i])
print(ans)
else:
tar = abs(a[0])
for i in range(n):
ans += abs(a[i])
if tar > abs(a[i... | 18 | 18 | 396 | 369 | n = int(eval(input()))
a = list(map(int, input().split()))
minus_num = 0
for i in range(n):
if a[i] < 0:
minus_num += 1
if minus_num % 2 == 0:
ans = 0
for i in range(n):
ans += abs(a[i])
else:
min_abs = abs(a[0])
ans = 0
for i in range(n):
ans += abs(a[i])
min_abs... | n = int(eval(input()))
a = list(map(int, input().split()))
cnt = 0
for i in range(n):
if a[i] < 0:
cnt += 1
ans = 0
if cnt % 2 == 0:
for i in range(n):
ans += abs(a[i])
print(ans)
else:
tar = abs(a[0])
for i in range(n):
ans += abs(a[i])
if tar > abs(a[i]):
... | false | 0 | [
"-minus_num = 0",
"+cnt = 0",
"- minus_num += 1",
"-if minus_num % 2 == 0:",
"- ans = 0",
"+ cnt += 1",
"+ans = 0",
"+if cnt % 2 == 0:",
"+ print(ans)",
"- min_abs = abs(a[0])",
"- ans = 0",
"+ tar = abs(a[0])",
"- min_abs = min(min_abs, abs(a[i]))",
"- ... | false | 0.069928 | 0.069269 | 1.00952 | [
"s936189648",
"s572065028"
] |
u562935282 | p03343 | python | s405337507 | s226375875 | 1,402 | 852 | 3,316 | 3,316 | Accepted | Accepted | 39.23 | inf = 10 ** 9
n, k, q = list(map(int, input().split()))
a = tuple(map(int, input().split()))
ans = inf
for min_ in sorted(set(a)):
res = [] # 最小値min_としたとき、取り除ける要素全て
seq = 0
for ind, a_ in enumerate(a):
if a_ >= min_:
seq += 1
else:
if seq >= k:
... | def main():
def calc_x_y(mi):
"""取り除いた要素の最小値がmiとなるように
操作をQ回行えるか
行える -> Q回の操作で取り除いた要素の最大値 - mi
行えない -> -1
"""
cont = 0
removed = []
for i, x in enumerate(a):
if x < mi:
if cont >= K:
removed ... | 28 | 52 | 813 | 1,120 | inf = 10**9
n, k, q = list(map(int, input().split()))
a = tuple(map(int, input().split()))
ans = inf
for min_ in sorted(set(a)):
res = [] # 最小値min_としたとき、取り除ける要素全て
seq = 0
for ind, a_ in enumerate(a):
if a_ >= min_:
seq += 1
else:
if seq >= k:
sequence... | def main():
def calc_x_y(mi):
"""取り除いた要素の最小値がmiとなるように
操作をQ回行えるか
行える -> Q回の操作で取り除いた要素の最大値 - mi
行えない -> -1
"""
cont = 0
removed = []
for i, x in enumerate(a):
if x < mi:
if cont >= K:
removed += sorted(a[i ... | false | 46.153846 | [
"-inf = 10**9",
"-n, k, q = list(map(int, input().split()))",
"-a = tuple(map(int, input().split()))",
"-ans = inf",
"-for min_ in sorted(set(a)):",
"- res = [] # 最小値min_としたとき、取り除ける要素全て",
"- seq = 0",
"- for ind, a_ in enumerate(a):",
"- if a_ >= min_:",
"- seq += 1",
... | false | 0.036104 | 0.037751 | 0.956384 | [
"s405337507",
"s226375875"
] |
u432780056 | p03137 | python | s982094450 | s560681677 | 212 | 180 | 19,904 | 20,472 | Accepted | Accepted | 15.09 | n, m = list(map(int, input().split()))
x = list(map(int, input().split()))
if n >= m:
print((0))
exit()
x.sort()
dif = []
for i in range(m - 1):
dif.append((x[i + 1] - x[i], i + 1))
dif.sort(key = lambda x: x[0], reverse = True)
split = set()
for i in range(n - 1):
split.add(dif[i][1])
ans ... | n, m = list(map(int, input().split()))
x = list(map(int, input().split()))
if n >= m:
print((0))
exit()
x.sort()
dif = []
for i in range(m - 1):
dif.append((x[i + 1] - x[i], i + 1))
dif.sort(key = lambda x: x[0], reverse = True)
split = set()
for i in range(n - 1):
split.add(dif[i][1])
ans ... | 22 | 17 | 495 | 389 | n, m = list(map(int, input().split()))
x = list(map(int, input().split()))
if n >= m:
print((0))
exit()
x.sort()
dif = []
for i in range(m - 1):
dif.append((x[i + 1] - x[i], i + 1))
dif.sort(key=lambda x: x[0], reverse=True)
split = set()
for i in range(n - 1):
split.add(dif[i][1])
ans = 0
minn, maxx = ... | n, m = list(map(int, input().split()))
x = list(map(int, input().split()))
if n >= m:
print((0))
exit()
x.sort()
dif = []
for i in range(m - 1):
dif.append((x[i + 1] - x[i], i + 1))
dif.sort(key=lambda x: x[0], reverse=True)
split = set()
for i in range(n - 1):
split.add(dif[i][1])
ans = x[-1] - x[0]
fo... | false | 22.727273 | [
"-ans = 0",
"-minn, maxx = x[0], x[0]",
"-for i in range(m):",
"- if i in split:",
"- ans += maxx - minn",
"- minn = x[i]",
"- maxx = max(x[i], maxx)",
"-ans += maxx - minn",
"+ans = x[-1] - x[0]",
"+for i in split:",
"+ ans -= x[i] - x[i - 1]"
] | false | 0.137967 | 0.033363 | 4.135359 | [
"s982094450",
"s560681677"
] |
u525065967 | p02622 | python | s556162984 | s013030038 | 65 | 60 | 9,288 | 17,120 | Accepted | Accepted | 7.69 | s = eval(input())
t = eval(input())
ans = 0
for i in range(len(s)):
if s[i] != t[i]: ans += 1
print(ans)
| s, t = eval(input()), eval(input())
print((len([*[x for x in range(len(s)) if s[x]!=t[x]]])))
| 6 | 2 | 102 | 84 | s = eval(input())
t = eval(input())
ans = 0
for i in range(len(s)):
if s[i] != t[i]:
ans += 1
print(ans)
| s, t = eval(input()), eval(input())
print((len([*[x for x in range(len(s)) if s[x] != t[x]]])))
| false | 66.666667 | [
"-s = eval(input())",
"-t = eval(input())",
"-ans = 0",
"-for i in range(len(s)):",
"- if s[i] != t[i]:",
"- ans += 1",
"-print(ans)",
"+s, t = eval(input()), eval(input())",
"+print((len([*[x for x in range(len(s)) if s[x] != t[x]]])))"
] | false | 0.046357 | 0.091661 | 0.50575 | [
"s556162984",
"s013030038"
] |
u107639613 | p03326 | python | s071354575 | s199063882 | 652 | 78 | 221,648 | 71,272 | Accepted | Accepted | 88.04 | import sys
def input(): return sys.stdin.readline().strip()
def main():
N, M = list(map(int, input().split()))
cakes = [(0, 0, 0)]
for _ in range(N):
x, y, z = list(map(int, input().split()))
cakes.append((x, y, z))
"""
dp[n][m][t] = (1~n番目までのケーキからm個のケーキをタイプtで選んだ時の合計の最... | import sys
def input(): return sys.stdin.readline().strip()
def main():
N, M = list(map(int, input().split()))
cakes = [(0, 0, 0)]
for _ in range(N):
x, y, z = list(map(int, input().split()))
cakes.append((x, y, z))
"""
これはdpするべきではなかった。O(NlogN)で解ける。
単純にx+y+zやx-y-z... | 51 | 34 | 2,191 | 845 | import sys
def input():
return sys.stdin.readline().strip()
def main():
N, M = list(map(int, input().split()))
cakes = [(0, 0, 0)]
for _ in range(N):
x, y, z = list(map(int, input().split()))
cakes.append((x, y, z))
"""
dp[n][m][t] = (1~n番目までのケーキからm個のケーキをタイプtで選んだ時の合計の最大値)
... | import sys
def input():
return sys.stdin.readline().strip()
def main():
N, M = list(map(int, input().split()))
cakes = [(0, 0, 0)]
for _ in range(N):
x, y, z = list(map(int, input().split()))
cakes.append((x, y, z))
"""
これはdpするべきではなかった。O(NlogN)で解ける。
単純にx+y+zやx-y-z等のそれぞれに対... | false | 33.333333 | [
"- dp[n][m][t] = (1~n番目までのケーキからm個のケーキをタイプtで選んだ時の合計の最大値)",
"- と定める。ここでタイプとは",
"- t=0 -> val = x + y + z",
"- t=1 -> val = x + y - z",
"- t=2 -> val = x - y + z",
"- t=3 -> val = x - y - z",
"- t=4 -> val = -x + y + z",
"- t=5 -> val = -x + y - z",
"- ... | false | 0.048051 | 0.122519 | 0.392195 | [
"s071354575",
"s199063882"
] |
u175034939 | p02550 | python | s386962540 | s972802340 | 801 | 66 | 68,636 | 14,024 | Accepted | Accepted | 91.76 | n, x, m = list(map(int, input().split()))
amr = []
for i in range(n):
if i == 0:
x %= m
amr.append(x)
continue
x = pow(x, 2, m)
if x in amr:
break
if x == 0:
break
amr.append(x)
if x == 0:
print((sum(amr[:n])))
else:
idx = amr.index... | n, x, m = list(map(int, input().split()))
A = []
al = [-1]*(m+1)
cnt = 0
for i in range(n):
if al[x%m] >= 0:
break
al[x%m] = cnt
A.append(x)
cnt += 1
x = x**2 % m
if n <= al[x]:
print((sum(A[:al[x]])))
exit()
lena = len(A)
loop = A[al[x]:]
lenl = cnt-al[x]
n -... | 29 | 22 | 532 | 394 | n, x, m = list(map(int, input().split()))
amr = []
for i in range(n):
if i == 0:
x %= m
amr.append(x)
continue
x = pow(x, 2, m)
if x in amr:
break
if x == 0:
break
amr.append(x)
if x == 0:
print((sum(amr[:n])))
else:
idx = amr.index(x)
loop = sum(a... | n, x, m = list(map(int, input().split()))
A = []
al = [-1] * (m + 1)
cnt = 0
for i in range(n):
if al[x % m] >= 0:
break
al[x % m] = cnt
A.append(x)
cnt += 1
x = x**2 % m
if n <= al[x]:
print((sum(A[: al[x]])))
exit()
lena = len(A)
loop = A[al[x] :]
lenl = cnt - al[x]
n -= al[x]
cnt ... | false | 24.137931 | [
"-amr = []",
"+A = []",
"+al = [-1] * (m + 1)",
"+cnt = 0",
"- if i == 0:",
"- x %= m",
"- amr.append(x)",
"- continue",
"- x = pow(x, 2, m)",
"- if x in amr:",
"+ if al[x % m] >= 0:",
"- if x == 0:",
"- break",
"- amr.append(x)",
"-if x == 0... | false | 0.042843 | 0.0406 | 1.055244 | [
"s386962540",
"s972802340"
] |
u141610915 | p02784 | python | s874068672 | s719254892 | 252 | 231 | 53,340 | 53,340 | Accepted | Accepted | 8.33 | import sys
input = sys.stdin.readline
H, N = list(map(int, input().split()))
a = list(map(int, input().split()))
if sum(a) >= H:
print("Yes")
else: print("No") | import sys
input = sys.stdin.readline
H, N = list(map(int, input().split()))
sm = sum(list(map(int, input().split())))
if H <= sm: print("Yes")
else: print("No") | 7 | 6 | 161 | 160 | import sys
input = sys.stdin.readline
H, N = list(map(int, input().split()))
a = list(map(int, input().split()))
if sum(a) >= H:
print("Yes")
else:
print("No")
| import sys
input = sys.stdin.readline
H, N = list(map(int, input().split()))
sm = sum(list(map(int, input().split())))
if H <= sm:
print("Yes")
else:
print("No")
| false | 14.285714 | [
"-a = list(map(int, input().split()))",
"-if sum(a) >= H:",
"+sm = sum(list(map(int, input().split())))",
"+if H <= sm:"
] | false | 0.041717 | 0.035045 | 1.190363 | [
"s874068672",
"s719254892"
] |
u810356688 | p03618 | python | s112896215 | s481056498 | 184 | 31 | 42,608 | 3,752 | Accepted | Accepted | 83.15 | import sys
def input(): return sys.stdin.readline().rstrip()
from collections import defaultdict
def main():
A=eval(input())
len_a=len(A)
dp=[0]*len_a
dp[0]=1
dd=defaultdict(int)
dd[A[0]]+=1
for i in range(1,len_a):
a=A[i]
dp[i]=i-dd[a]
dd[a]+=1
prin... | import sys
def input(): return sys.stdin.readline().rstrip()
from collections import Counter
def main():
A=eval(input())
ac=list(Counter(A).values())
len_a=len(A)
ans=len_a*(len_a-1)//2
for acc in ac:
ans-=acc*(acc-1)//2
print((ans+1))
if __name__=='__main__':
main() | 18 | 14 | 364 | 309 | import sys
def input():
return sys.stdin.readline().rstrip()
from collections import defaultdict
def main():
A = eval(input())
len_a = len(A)
dp = [0] * len_a
dp[0] = 1
dd = defaultdict(int)
dd[A[0]] += 1
for i in range(1, len_a):
a = A[i]
dp[i] = i - dd[a]
... | import sys
def input():
return sys.stdin.readline().rstrip()
from collections import Counter
def main():
A = eval(input())
ac = list(Counter(A).values())
len_a = len(A)
ans = len_a * (len_a - 1) // 2
for acc in ac:
ans -= acc * (acc - 1) // 2
print((ans + 1))
if __name__ == "... | false | 22.222222 | [
"-from collections import defaultdict",
"+from collections import Counter",
"+ ac = list(Counter(A).values())",
"- dp = [0] * len_a",
"- dp[0] = 1",
"- dd = defaultdict(int)",
"- dd[A[0]] += 1",
"- for i in range(1, len_a):",
"- a = A[i]",
"- dp[i] = i - dd[a]",
"... | false | 0.114913 | 0.05894 | 1.949657 | [
"s112896215",
"s481056498"
] |
u628581330 | p02832 | python | s917084790 | s493715253 | 117 | 106 | 24,744 | 24,744 | Accepted | Accepted | 9.4 | n = int(eval(input()))
s = list(map(int,input().split()))
flag = -1
for i in range(n):
if s[i] == 1:
flag = 2
if s[i] == flag:
flag += 1
if flag == -1:
print((-1))
else:
print((n - flag + 1)) | n = int(eval(input()))
s = list(map(int,input().split()))
flag = 1
for i in range(n):
if s[i] == flag:
flag += 1
if 1 not in s:
print((-1))
else:
print((n - flag +1)) | 12 | 10 | 224 | 185 | n = int(eval(input()))
s = list(map(int, input().split()))
flag = -1
for i in range(n):
if s[i] == 1:
flag = 2
if s[i] == flag:
flag += 1
if flag == -1:
print((-1))
else:
print((n - flag + 1))
| n = int(eval(input()))
s = list(map(int, input().split()))
flag = 1
for i in range(n):
if s[i] == flag:
flag += 1
if 1 not in s:
print((-1))
else:
print((n - flag + 1))
| false | 16.666667 | [
"-flag = -1",
"+flag = 1",
"- if s[i] == 1:",
"- flag = 2",
"-if flag == -1:",
"+if 1 not in s:"
] | false | 0.038964 | 0.0398 | 0.978995 | [
"s917084790",
"s493715253"
] |
u600261652 | p02681 | python | s388401285 | s129642088 | 24 | 20 | 9,036 | 9,092 | Accepted | Accepted | 16.67 | S = eval(input())
T = eval(input())
if S+T[-1] in T:
print("Yes")
else:
print("No") | S = eval(input())
T = eval(input())
print(("Yes" if S == T[:-1] else "No")) | 6 | 3 | 80 | 63 | S = eval(input())
T = eval(input())
if S + T[-1] in T:
print("Yes")
else:
print("No")
| S = eval(input())
T = eval(input())
print(("Yes" if S == T[:-1] else "No"))
| false | 50 | [
"-if S + T[-1] in T:",
"- print(\"Yes\")",
"-else:",
"- print(\"No\")",
"+print((\"Yes\" if S == T[:-1] else \"No\"))"
] | false | 0.041659 | 0.041134 | 1.012768 | [
"s388401285",
"s129642088"
] |
u073852194 | p02995 | python | s901024768 | s743591350 | 35 | 17 | 5,048 | 3,064 | Accepted | Accepted | 51.43 | import fractions
a,b,c,d = list(map(int, input().split()))
p = b//c + (-a//c) +1
q = b//d + (-a//d) +1
r = b*fractions.gcd(c,d)//(c*d) + (-a*fractions.gcd(c,d)//(c*d)) +1
print((b-a+1-p-q+r)) | def gcd(x,y):
if y == 0:
return x
else:
return gcd(y,x%y)
a,b,c,d = list(map(int, input().split()))
p = b//c + (-a//c) +1
q = b//d + (-a//d) +1
r = b*gcd(c,d)//(c*d) + (-a*gcd(c,d)//(c*d)) +1
print((b-a+1-p-q+r)) | 6 | 10 | 188 | 225 | import fractions
a, b, c, d = list(map(int, input().split()))
p = b // c + (-a // c) + 1
q = b // d + (-a // d) + 1
r = b * fractions.gcd(c, d) // (c * d) + (-a * fractions.gcd(c, d) // (c * d)) + 1
print((b - a + 1 - p - q + r))
| def gcd(x, y):
if y == 0:
return x
else:
return gcd(y, x % y)
a, b, c, d = list(map(int, input().split()))
p = b // c + (-a // c) + 1
q = b // d + (-a // d) + 1
r = b * gcd(c, d) // (c * d) + (-a * gcd(c, d) // (c * d)) + 1
print((b - a + 1 - p - q + r))
| false | 40 | [
"-import fractions",
"+def gcd(x, y):",
"+ if y == 0:",
"+ return x",
"+ else:",
"+ return gcd(y, x % y)",
"+",
"-r = b * fractions.gcd(c, d) // (c * d) + (-a * fractions.gcd(c, d) // (c * d)) + 1",
"+r = b * gcd(c, d) // (c * d) + (-a * gcd(c, d) // (c * d)) + 1"
] | false | 0.048186 | 0.038073 | 1.265609 | [
"s901024768",
"s743591350"
] |
u604839890 | p02596 | python | s584913222 | s822193737 | 215 | 188 | 9,088 | 9,116 | Accepted | Accepted | 12.56 | k = int(eval(input()))
if k % 2 == 0 or k % 5 == 0:
print((-1))
exit()
ans = 1
a = 7 % k
while a:
a = a*10 + 7
a %= k
ans += 1
print(ans) | k = int(eval(input()))
if k % 2 == 0 or k % 5 == 0:
print((-1))
else:
a = 7 % k
cnt = 1
while a:
a = (a*10 + 7) % k
cnt += 1
print(cnt) | 12 | 11 | 161 | 174 | k = int(eval(input()))
if k % 2 == 0 or k % 5 == 0:
print((-1))
exit()
ans = 1
a = 7 % k
while a:
a = a * 10 + 7
a %= k
ans += 1
print(ans)
| k = int(eval(input()))
if k % 2 == 0 or k % 5 == 0:
print((-1))
else:
a = 7 % k
cnt = 1
while a:
a = (a * 10 + 7) % k
cnt += 1
print(cnt)
| false | 8.333333 | [
"- exit()",
"-ans = 1",
"-a = 7 % k",
"-while a:",
"- a = a * 10 + 7",
"- a %= k",
"- ans += 1",
"-print(ans)",
"+else:",
"+ a = 7 % k",
"+ cnt = 1",
"+ while a:",
"+ a = (a * 10 + 7) % k",
"+ cnt += 1",
"+ print(cnt)"
] | false | 0.069075 | 0.06555 | 1.053777 | [
"s584913222",
"s822193737"
] |
u606045429 | p02874 | python | s976873744 | s540086702 | 327 | 299 | 26,512 | 26,680 | Accepted | Accepted | 8.56 | def main():
N, *LR = list(map(int, open(0).read().split()))
L, R = LR[::2], LR[1::2]
max_l = max(L)
min_r = min(R)
ab = [(max(0, r - max_l + 1), -max(0, min_r - l + 1)) for l, r in zip(L, R)]
ab.sort()
mi = float("inf")
ma = max(r - l + 1 for l, r in zip(L, R)) + max(0, min... | from sys import stdin
def main():
N, *LR = list(map(int, stdin.buffer.read().split()))
L, R = LR[::2], LR[1::2]
max_l = max(L)
min_r = min(R)
ab = [(max(0, r - max_l + 1), -max(0, min_r - l + 1)) for l, r in zip(L, R)]
ab.sort()
mi = float("inf")
ma = max(r - l + 1 for l... | 19 | 21 | 459 | 489 | def main():
N, *LR = list(map(int, open(0).read().split()))
L, R = LR[::2], LR[1::2]
max_l = max(L)
min_r = min(R)
ab = [(max(0, r - max_l + 1), -max(0, min_r - l + 1)) for l, r in zip(L, R)]
ab.sort()
mi = float("inf")
ma = max(r - l + 1 for l, r in zip(L, R)) + max(0, min_r - max_l + 1... | from sys import stdin
def main():
N, *LR = list(map(int, stdin.buffer.read().split()))
L, R = LR[::2], LR[1::2]
max_l = max(L)
min_r = min(R)
ab = [(max(0, r - max_l + 1), -max(0, min_r - l + 1)) for l, r in zip(L, R)]
ab.sort()
mi = float("inf")
ma = max(r - l + 1 for l, r in zip(L, R... | false | 9.52381 | [
"+from sys import stdin",
"+",
"+",
"- N, *LR = list(map(int, open(0).read().split()))",
"+ N, *LR = list(map(int, stdin.buffer.read().split()))"
] | false | 0.045255 | 0.032007 | 1.413922 | [
"s976873744",
"s540086702"
] |
u426534722 | p02275 | python | s539454792 | s439531941 | 2,420 | 2,190 | 224,376 | 224,376 | Accepted | Accepted | 9.5 | n = int(eval(input()))
def CountingSort(A, B, k):
C = [0] * (k + 1)
for j in range(n):
C[A[j]] += 1
C[0] -= 1
for i in range(1, k + 1):
C[i] += C[i - 1]
for j in range(n - 1, -1, -1):
B[C[A[j]]] = A[j]
C[A[j]] -= 1
A = list(map(int, input().split()))
B = [... | n = int(eval(input()))
def CountingSort(A, B, k):
C = [0] * (k + 1)
for j in range(n):
C[A[j]] += 1
C[0] -= 1
for i in range(1, k + 1):
C[i] += C[i - 1]
for j in A[::-1]:
B[C[j]] = j
C[j] -= 1
A = list(map(int, input().split()))
B = [0] * n
CountingSort(A... | 16 | 16 | 362 | 340 | n = int(eval(input()))
def CountingSort(A, B, k):
C = [0] * (k + 1)
for j in range(n):
C[A[j]] += 1
C[0] -= 1
for i in range(1, k + 1):
C[i] += C[i - 1]
for j in range(n - 1, -1, -1):
B[C[A[j]]] = A[j]
C[A[j]] -= 1
A = list(map(int, input().split()))
B = [0] * n
C... | n = int(eval(input()))
def CountingSort(A, B, k):
C = [0] * (k + 1)
for j in range(n):
C[A[j]] += 1
C[0] -= 1
for i in range(1, k + 1):
C[i] += C[i - 1]
for j in A[::-1]:
B[C[j]] = j
C[j] -= 1
A = list(map(int, input().split()))
B = [0] * n
CountingSort(A, B, max(... | false | 0 | [
"- for j in range(n - 1, -1, -1):",
"- B[C[A[j]]] = A[j]",
"- C[A[j]] -= 1",
"+ for j in A[::-1]:",
"+ B[C[j]] = j",
"+ C[j] -= 1"
] | false | 0.032946 | 0.113985 | 0.289034 | [
"s539454792",
"s439531941"
] |
u646203242 | p02719 | python | s422500901 | s097969889 | 183 | 169 | 38,256 | 38,384 | Accepted | Accepted | 7.65 | n,k=list(map(int,input().split()))
n%=k
N=abs(n-k)
while N<n:
n=N
N=abs(n-k)
print(n)
| n,k=list(map(int,input().split()))
n%=k
N=abs(n-k)
if N<n:
n=N
print(n)
| 7 | 6 | 94 | 73 | n, k = list(map(int, input().split()))
n %= k
N = abs(n - k)
while N < n:
n = N
N = abs(n - k)
print(n)
| n, k = list(map(int, input().split()))
n %= k
N = abs(n - k)
if N < n:
n = N
print(n)
| false | 14.285714 | [
"-while N < n:",
"+if N < n:",
"- N = abs(n - k)"
] | false | 0.093957 | 0.036057 | 2.605748 | [
"s422500901",
"s097969889"
] |
u103902792 | p03013 | python | s727584882 | s395038871 | 442 | 192 | 460,020 | 7,064 | Accepted | Accepted | 56.56 | number = 1000000007
fib = [1,1,2,3,5,8,13]
def fibon(n):
if(n+1> len(fib)):
while(len(fib) < n+1):
fib.append(fib[-1]+ fib[-2])
return fib[n]
n,m = list(map(int,input().split()))
start = 0
ans = 1
for i in range(m):
broken = int(eval(input()))
if broken - start == 0:
print((0))
e... | CONST = 10**9 + 7
n,m = list(map(int,input().split()))
dp = [-1 for _ in range(n+1)]
dp[0] = 1
dp[1] = 1
for _ in range(m):
a = int(eval(input()))
dp[a] = 0
for i in range(2,n+1):
if dp[i] == 0:
continue
dp[i] = (dp[i-1] + dp[i-2]) % CONST
print((dp[n]))
| 22 | 18 | 454 | 275 | number = 1000000007
fib = [1, 1, 2, 3, 5, 8, 13]
def fibon(n):
if n + 1 > len(fib):
while len(fib) < n + 1:
fib.append(fib[-1] + fib[-2])
return fib[n]
n, m = list(map(int, input().split()))
start = 0
ans = 1
for i in range(m):
broken = int(eval(input()))
if broken - start == 0:
... | CONST = 10**9 + 7
n, m = list(map(int, input().split()))
dp = [-1 for _ in range(n + 1)]
dp[0] = 1
dp[1] = 1
for _ in range(m):
a = int(eval(input()))
dp[a] = 0
for i in range(2, n + 1):
if dp[i] == 0:
continue
dp[i] = (dp[i - 1] + dp[i - 2]) % CONST
print((dp[n]))
| false | 18.181818 | [
"-number = 1000000007",
"-fib = [1, 1, 2, 3, 5, 8, 13]",
"-",
"-",
"-def fibon(n):",
"- if n + 1 > len(fib):",
"- while len(fib) < n + 1:",
"- fib.append(fib[-1] + fib[-2])",
"- return fib[n]",
"-",
"-",
"+CONST = 10**9 + 7",
"-start = 0",
"-ans = 1",
"-for i in r... | false | 0.035688 | 0.13126 | 0.271891 | [
"s727584882",
"s395038871"
] |
u519339498 | p02946 | python | s960949378 | s018300252 | 28 | 25 | 9,120 | 9,008 | Accepted | Accepted | 10.71 | K,X=map(int,input().split())
t1=X-K+1
t2=X+K
for x in range(t1,t2):
print(x,end="")
if x != t2-1:
print(" ",end="")
else:
print("")
| import sys
pin=sys.stdin.readline
pout=sys.stdout.write
K,X=list(map(int,pin().split()))
for i in range(X-K+1,X+K):
pout(f"{i} ")
print() | 9 | 8 | 153 | 141 | K, X = map(int, input().split())
t1 = X - K + 1
t2 = X + K
for x in range(t1, t2):
print(x, end="")
if x != t2 - 1:
print(" ", end="")
else:
print("")
| import sys
pin = sys.stdin.readline
pout = sys.stdout.write
K, X = list(map(int, pin().split()))
for i in range(X - K + 1, X + K):
pout(f"{i} ")
print()
| false | 11.111111 | [
"-K, X = map(int, input().split())",
"-t1 = X - K + 1",
"-t2 = X + K",
"-for x in range(t1, t2):",
"- print(x, end=\"\")",
"- if x != t2 - 1:",
"- print(\" \", end=\"\")",
"- else:",
"- print(\"\")",
"+import sys",
"+",
"+pin = sys.stdin.readline",
"+pout = sys.stdout.... | false | 0.066491 | 0.105574 | 0.6298 | [
"s960949378",
"s018300252"
] |
u480138356 | p03681 | python | s086597650 | s657343424 | 184 | 59 | 38,640 | 3,060 | Accepted | Accepted | 67.93 | import sys
input = sys.stdin.readline
def main():
N, M = list(map(int, input().split()))
MOD = int(1e9) + 7
tmp = abs(N - M)
if tmp >= 2:
print((0))
else:
ans = 2
if tmp == 1:
ans = 1
for i in range(2, N+1):
ans *= i
... | N, M = list(map(int, input().split()))
MOD = int(1e9) + 7
tmp = abs(N - M)
if tmp >= 2:
print((0))
else:
ans = 2
if tmp == 1:
ans = 1
for i in range(2, N+1):
ans *= i
ans = ans % MOD
for i in range(2, M+1):
ans *= i
ans = ans % MOD
print... | 25 | 18 | 479 | 318 | import sys
input = sys.stdin.readline
def main():
N, M = list(map(int, input().split()))
MOD = int(1e9) + 7
tmp = abs(N - M)
if tmp >= 2:
print((0))
else:
ans = 2
if tmp == 1:
ans = 1
for i in range(2, N + 1):
ans *= i
ans = ans ... | N, M = list(map(int, input().split()))
MOD = int(1e9) + 7
tmp = abs(N - M)
if tmp >= 2:
print((0))
else:
ans = 2
if tmp == 1:
ans = 1
for i in range(2, N + 1):
ans *= i
ans = ans % MOD
for i in range(2, M + 1):
ans *= i
ans = ans % MOD
print(ans)
| false | 28 | [
"-import sys",
"-",
"-input = sys.stdin.readline",
"-",
"-",
"-def main():",
"- N, M = list(map(int, input().split()))",
"- MOD = int(1e9) + 7",
"- tmp = abs(N - M)",
"- if tmp >= 2:",
"- print((0))",
"- else:",
"- ans = 2",
"- if tmp == 1:",
"- ... | false | 0.046796 | 0.085376 | 0.548116 | [
"s086597650",
"s657343424"
] |
u813450984 | p03565 | python | s096211121 | s361743909 | 19 | 17 | 3,188 | 3,064 | Accepted | Accepted | 10.53 | s = eval(input())
t = eval(input())
def f(s, t):
l = "?"*len(t)
found = False
# if l in s:
# print('done')
for i in range(len(s)-len(t)+1):
temp = s[len(s)-len(t)-i:len(s)-i]
count = 0
for j in range(len(temp)):
if t[j] == temp[j] or temp[j] == "?":
count += 1
if... | s = list(eval(input()))
t = eval(input())
ans = False
for i in range(len(s)-len(t), -1, -1):
temp = s[i:i+len(t)]
count = 0
for j in range(len(temp)):
if temp[j] == t[j] or temp[j] == "?":
count += 1
else:
break
if count == len(t):
ans = True
s[i:i+len(t)] = t
s = "... | 23 | 20 | 527 | 400 | s = eval(input())
t = eval(input())
def f(s, t):
l = "?" * len(t)
found = False
# if l in s:
# print('done')
for i in range(len(s) - len(t) + 1):
temp = s[len(s) - len(t) - i : len(s) - i]
count = 0
for j in range(len(temp)):
if t[j] == temp[j] or temp[j] == "... | s = list(eval(input()))
t = eval(input())
ans = False
for i in range(len(s) - len(t), -1, -1):
temp = s[i : i + len(t)]
count = 0
for j in range(len(temp)):
if temp[j] == t[j] or temp[j] == "?":
count += 1
else:
break
if count == len(t):
ans = True
... | false | 13.043478 | [
"-s = eval(input())",
"+s = list(eval(input()))",
"-",
"-",
"-def f(s, t):",
"- l = \"?\" * len(t)",
"- found = False",
"- # if l in s:",
"- # print('done')",
"- for i in range(len(s) - len(t) + 1):",
"- temp = s[len(s) - len(t) - i : len(s) - i]",
"- count = 0",... | false | 0.03819 | 0.037366 | 1.02205 | [
"s096211121",
"s361743909"
] |
u880480312 | p02861 | python | s243503664 | s319358179 | 268 | 29 | 10,804 | 9,368 | Accepted | Accepted | 89.18 | from itertools import permutations
n= int(eval(input()))
ls = []
for i in range(n):
a = list(map(int,input().split()))
ls.append(a)
ans = []
for i in permutations(ls,n):
#print(i)
result = 0
for j in range(n-1):
result += (((i[j][0]-i[j+1][0])**2+(i[j][1]-i[j+1][1])**2)**(1/2))
... | #<100q.順列全探索>
#<15>
from itertools import combinations
n = int(eval(input()))
town = []
for i in range(n):
x, y = list(map(int,input().split()))
town.append((x,y))
ans = 0
for i, j in combinations(town, 2):
ans += ((i[0] - j[0]) ** 2 + (i[1] - j[1]) ** 2) ** (0.5)
print((2 * ans / n))
... | 16 | 16 | 378 | 315 | from itertools import permutations
n = int(eval(input()))
ls = []
for i in range(n):
a = list(map(int, input().split()))
ls.append(a)
ans = []
for i in permutations(ls, n):
# print(i)
result = 0
for j in range(n - 1):
result += ((i[j][0] - i[j + 1][0]) ** 2 + (i[j][1] - i[j + 1][1]) ** 2) *... | # <100q.順列全探索>
# <15>
from itertools import combinations
n = int(eval(input()))
town = []
for i in range(n):
x, y = list(map(int, input().split()))
town.append((x, y))
ans = 0
for i, j in combinations(town, 2):
ans += ((i[0] - j[0]) ** 2 + (i[1] - j[1]) ** 2) ** (0.5)
print((2 * ans / n))
| false | 0 | [
"-from itertools import permutations",
"+# <100q.順列全探索>",
"+# <15>",
"+from itertools import combinations",
"-ls = []",
"+town = []",
"- a = list(map(int, input().split()))",
"- ls.append(a)",
"-ans = []",
"-for i in permutations(ls, n):",
"- # print(i)",
"- result = 0",
"- fo... | false | 0.039961 | 0.040338 | 0.990654 | [
"s243503664",
"s319358179"
] |
u707500405 | p04049 | python | s477256091 | s841537427 | 1,605 | 1,198 | 108,188 | 98,844 | Accepted | Accepted | 25.36 | from sys import setrecursionlimit
setrecursionlimit(1000000)
def calc_dist(b,h,dist,E,D,ne):
D[dist] += 1
for nxt in E[h]:
if nxt == b or nxt == ne:
continue
calc_dist(h,nxt,dist+1,E,D,ne)
def solve():
N,K = list(map(int,input().split()))
pairs = []
E = [[] for i in range(N)]
for i in range(... | from sys import setrecursionlimit
setrecursionlimit(100000)
def rad_reach(b,h,dist,E,rad,ne):
cnt = 1
if dist < rad:
for nxt in E[h]:
if nxt == b or nxt == ne:
continue
cnt += rad_reach(h,nxt,dist+1,E,rad,ne)
return cnt
def solve():
N,K = list(map(int,input().split()))
pairs = []
E = [[]... | 40 | 29 | 880 | 712 | from sys import setrecursionlimit
setrecursionlimit(1000000)
def calc_dist(b, h, dist, E, D, ne):
D[dist] += 1
for nxt in E[h]:
if nxt == b or nxt == ne:
continue
calc_dist(h, nxt, dist + 1, E, D, ne)
def solve():
N, K = list(map(int, input().split()))
pairs = []
E =... | from sys import setrecursionlimit
setrecursionlimit(100000)
def rad_reach(b, h, dist, E, rad, ne):
cnt = 1
if dist < rad:
for nxt in E[h]:
if nxt == b or nxt == ne:
continue
cnt += rad_reach(h, nxt, dist + 1, E, rad, ne)
return cnt
def solve():
N, K =... | false | 27.5 | [
"-setrecursionlimit(1000000)",
"+setrecursionlimit(100000)",
"-def calc_dist(b, h, dist, E, D, ne):",
"- D[dist] += 1",
"- for nxt in E[h]:",
"- if nxt == b or nxt == ne:",
"- continue",
"- calc_dist(h, nxt, dist + 1, E, D, ne)",
"+def rad_reach(b, h, dist, E, rad, ne)... | false | 0.04018 | 0.041839 | 0.960348 | [
"s477256091",
"s841537427"
] |
u759412327 | p03804 | python | s240540044 | s785246803 | 170 | 122 | 12,416 | 27,088 | Accepted | Accepted | 28.24 | import numpy as np
N,M = list(map(int,input().split()))
A = np.array([list(eval(input())) for i in range(N)])
B = np.array([list(eval(input())) for i in range(M)])
f = False
for i in range(N-M+1):
for j in range(N-M+1):
if (A[i:i+M,j:j+M]==B).all():
f = True
if f:
print("Yes")
else:
pr... | import numpy as np
N,M = list(map(int,input().split()))
A = np.array([list(eval(input())) for n in range(N)])
B = np.array([list(eval(input())) for m in range(M)])
a = "No"
for i in range(N-M+1):
for j in range(N-M+1):
if (A[i:i+M,j:j+M]==B).all():
a = "Yes"
print(a) | 16 | 12 | 312 | 274 | import numpy as np
N, M = list(map(int, input().split()))
A = np.array([list(eval(input())) for i in range(N)])
B = np.array([list(eval(input())) for i in range(M)])
f = False
for i in range(N - M + 1):
for j in range(N - M + 1):
if (A[i : i + M, j : j + M] == B).all():
f = True
if f:
print... | import numpy as np
N, M = list(map(int, input().split()))
A = np.array([list(eval(input())) for n in range(N)])
B = np.array([list(eval(input())) for m in range(M)])
a = "No"
for i in range(N - M + 1):
for j in range(N - M + 1):
if (A[i : i + M, j : j + M] == B).all():
a = "Yes"
print(a)
| false | 25 | [
"-A = np.array([list(eval(input())) for i in range(N)])",
"-B = np.array([list(eval(input())) for i in range(M)])",
"-f = False",
"+A = np.array([list(eval(input())) for n in range(N)])",
"+B = np.array([list(eval(input())) for m in range(M)])",
"+a = \"No\"",
"- f = True",
"-if f:",
"- ... | false | 0.251217 | 0.22694 | 1.106977 | [
"s240540044",
"s785246803"
] |
u753803401 | p03549 | python | s197691985 | s221798652 | 183 | 167 | 38,256 | 38,256 | Accepted | Accepted | 8.74 | import sys
def solve():
readline = sys.stdin.buffer.readline
mod = 10 ** 9 + 7
n, m = list(map(int, readline().split()))
t1 = n - m
t2 = m
print((int((t1 * 100 + t2 * 1900) / (1 / 2) ** t2)))
if __name__ == '__main__':
solve()
| import sys
def solve():
readline = sys.stdin.buffer.readline
mod = 10 ** 9 + 7
n, m = list(map(int, readline().split()))
print((1900 * m * 2 ** m + 100 * (n - m) * 2 ** m))
if __name__ == '__main__':
solve()
| 14 | 12 | 270 | 241 | import sys
def solve():
readline = sys.stdin.buffer.readline
mod = 10**9 + 7
n, m = list(map(int, readline().split()))
t1 = n - m
t2 = m
print((int((t1 * 100 + t2 * 1900) / (1 / 2) ** t2)))
if __name__ == "__main__":
solve()
| import sys
def solve():
readline = sys.stdin.buffer.readline
mod = 10**9 + 7
n, m = list(map(int, readline().split()))
print((1900 * m * 2**m + 100 * (n - m) * 2**m))
if __name__ == "__main__":
solve()
| false | 14.285714 | [
"- t1 = n - m",
"- t2 = m",
"- print((int((t1 * 100 + t2 * 1900) / (1 / 2) ** t2)))",
"+ print((1900 * m * 2**m + 100 * (n - m) * 2**m))"
] | false | 0.042735 | 0.034659 | 1.233025 | [
"s197691985",
"s221798652"
] |
u553987207 | p02862 | python | s374098341 | s399145195 | 224 | 174 | 3,064 | 9,184 | Accepted | Accepted | 22.32 | X, Y = list(map(int, input().split()))
MOD = 10 ** 9 + 7
def modpow(a, n):
ret = 1
while n > 0:
if n & 1:
ret = ret * a % MOD
a = a * a % MOD
n >>= 1
return ret
def modinv(a):
return modpow(a, MOD - 2)
def modfac(x):
ret = 1
for i in range(... | X, Y = list(map(int, input().split()))
MOD = 10 ** 9 + 7
def modpow(x, n):
ret = 1
while n > 0:
if n & 1:
ret = ret * x % MOD
x = x * x % MOD
n >>= 1
return ret
def modinv(x):
return modpow(x, MOD - 2)
def modf(x):
ret = 1
for i in range(2,... | 33 | 30 | 631 | 575 | X, Y = list(map(int, input().split()))
MOD = 10**9 + 7
def modpow(a, n):
ret = 1
while n > 0:
if n & 1:
ret = ret * a % MOD
a = a * a % MOD
n >>= 1
return ret
def modinv(a):
return modpow(a, MOD - 2)
def modfac(x):
ret = 1
for i in range(2, x + 1):
... | X, Y = list(map(int, input().split()))
MOD = 10**9 + 7
def modpow(x, n):
ret = 1
while n > 0:
if n & 1:
ret = ret * x % MOD
x = x * x % MOD
n >>= 1
return ret
def modinv(x):
return modpow(x, MOD - 2)
def modf(x):
ret = 1
for i in range(2, x + 1):
... | false | 9.090909 | [
"-def modpow(a, n):",
"+def modpow(x, n):",
"- ret = ret * a % MOD",
"- a = a * a % MOD",
"+ ret = ret * x % MOD",
"+ x = x * x % MOD",
"-def modinv(a):",
"- return modpow(a, MOD - 2)",
"+def modinv(x):",
"+ return modpow(x, MOD - 2)",
"-def modfac(x):",... | false | 0.212037 | 0.376727 | 0.56284 | [
"s374098341",
"s399145195"
] |
u073549161 | p03564 | python | s797409174 | s159829802 | 172 | 18 | 38,256 | 2,940 | Accepted | Accepted | 89.53 | n = int(eval(input()))
k = int(eval(input()))
cur = 1
for i in range(n):
if (cur * 2) > (cur + k):
cur += k
else:
cur *= 2
print(cur) | n = int(eval(input()))
k = int(eval(input()))
res = 1
for i in range(n):
if res > k:
res += k
else:
res *= 2
print(res) | 9 | 9 | 153 | 139 | n = int(eval(input()))
k = int(eval(input()))
cur = 1
for i in range(n):
if (cur * 2) > (cur + k):
cur += k
else:
cur *= 2
print(cur)
| n = int(eval(input()))
k = int(eval(input()))
res = 1
for i in range(n):
if res > k:
res += k
else:
res *= 2
print(res)
| false | 0 | [
"-cur = 1",
"+res = 1",
"- if (cur * 2) > (cur + k):",
"- cur += k",
"+ if res > k:",
"+ res += k",
"- cur *= 2",
"-print(cur)",
"+ res *= 2",
"+print(res)"
] | false | 0.038395 | 0.038623 | 0.994088 | [
"s797409174",
"s159829802"
] |
u567225946 | p02659 | python | s698580468 | s275267853 | 130 | 96 | 72,964 | 71,364 | Accepted | Accepted | 26.15 | from fractions import Fraction
a,b=list(map(Fraction,input().split()))
print((int(a*b)))
| from decimal import Decimal
a,b=list(map(Decimal,input().split()))
a=int(a)
print((int((a*(b*100))//100)))
| 3 | 4 | 83 | 102 | from fractions import Fraction
a, b = list(map(Fraction, input().split()))
print((int(a * b)))
| from decimal import Decimal
a, b = list(map(Decimal, input().split()))
a = int(a)
print((int((a * (b * 100)) // 100)))
| false | 25 | [
"-from fractions import Fraction",
"+from decimal import Decimal",
"-a, b = list(map(Fraction, input().split()))",
"-print((int(a * b)))",
"+a, b = list(map(Decimal, input().split()))",
"+a = int(a)",
"+print((int((a * (b * 100)) // 100)))"
] | false | 0.095278 | 0.041982 | 2.269486 | [
"s698580468",
"s275267853"
] |
u062691227 | p04046 | python | s979987850 | s463944960 | 412 | 165 | 9,212 | 68,016 | Accepted | Accepted | 59.95 | H, W, A, B = list(map(int, open(0).read().split()))
MOD = 10**9+7
def modcomb(m, n, mod):
if n > m - n:
n = m - n
p = 1
q = 1
for i in range(n):
p = p * (m - i) % mod
q = q * (i + 1) % mod
result = p * pow(q, mod - 2, mod) % mod
return result
total = modco... | H, W, A, B = list(map(int, open(0).read().split()))
MOD = 10**9+7
def modperm(m, n, mod):
p = 1
for i in range(n):
p = p * (m - i) % mod
return p
def modcomb(m, n, mod):
if n > m - n:
n = m - n
p = modperm(m, n, mod)
q = pow(modperm(n, n, mod), mod - 2, mod)
r... | 32 | 34 | 691 | 735 | H, W, A, B = list(map(int, open(0).read().split()))
MOD = 10**9 + 7
def modcomb(m, n, mod):
if n > m - n:
n = m - n
p = 1
q = 1
for i in range(n):
p = p * (m - i) % mod
q = q * (i + 1) % mod
result = p * pow(q, mod - 2, mod) % mod
return result
total = modcomb(H + W -... | H, W, A, B = list(map(int, open(0).read().split()))
MOD = 10**9 + 7
def modperm(m, n, mod):
p = 1
for i in range(n):
p = p * (m - i) % mod
return p
def modcomb(m, n, mod):
if n > m - n:
n = m - n
p = modperm(m, n, mod)
q = pow(modperm(n, n, mod), mod - 2, mod)
return p * ... | false | 5.882353 | [
"+",
"+",
"+def modperm(m, n, mod):",
"+ p = 1",
"+ for i in range(n):",
"+ p = p * (m - i) % mod",
"+ return p",
"- p = 1",
"- q = 1",
"- for i in range(n):",
"- p = p * (m - i) % mod",
"- q = q * (i + 1) % mod",
"- result = p * pow(q, mod - 2, mod)... | false | 0.038638 | 0.044664 | 0.865087 | [
"s979987850",
"s463944960"
] |
u347640436 | p02936 | python | s394879100 | s251989725 | 1,961 | 1,471 | 268,436 | 62,132 | Accepted | Accepted | 24.99 | import sys
sys.setrecursionlimit(1000000)
def main():
_map = map
_input = input
_int = int
def calc_results(values, links, i, p):
for j in links[i]:
if j == p:
continue
values[j] += values[i]
calc_results(values, links, j, i)
n, q = _map(_int, _input().split())
val... | from collections import deque
def main():
_map, _input, _int = map, input, int
n, q = _map(_int, _input().split())
values = [0] * n
links = [[] for _ in range(n)]
for _ in range(n - 1):
a, b = _map(_int, _input().split())
links[a - 1].append(b - 1)
links[b - 1].append(a - 1)
for _ in r... | 25 | 24 | 643 | 616 | import sys
sys.setrecursionlimit(1000000)
def main():
_map = map
_input = input
_int = int
def calc_results(values, links, i, p):
for j in links[i]:
if j == p:
continue
values[j] += values[i]
calc_results(values, links, j, i)
n, q = _m... | from collections import deque
def main():
_map, _input, _int = map, input, int
n, q = _map(_int, _input().split())
values = [0] * n
links = [[] for _ in range(n)]
for _ in range(n - 1):
a, b = _map(_int, _input().split())
links[a - 1].append(b - 1)
links[b - 1].append(a - 1... | false | 4 | [
"-import sys",
"-",
"-sys.setrecursionlimit(1000000)",
"+from collections import deque",
"- _map = map",
"- _input = input",
"- _int = int",
"-",
"- def calc_results(values, links, i, p):",
"+ _map, _input, _int = map, input, int",
"+ n, q = _map(_int, _input().split())",
"+ ... | false | 0.008194 | 0.040091 | 0.204377 | [
"s394879100",
"s251989725"
] |
u282228874 | p03103 | python | s107668469 | s306084919 | 519 | 455 | 28,652 | 27,756 | Accepted | Accepted | 12.33 | n,m = list(map(int,input().split()))
AB = sorted([list(map(int,input().split())) for i in range(n)])
res = 0
for a,b in AB:
m -= b
if m >= 0:
res += a*b
else:
m += b
res += a*m
break
print(res) | n,m = list(map(int,input().split()))
AB = [list(map(int,input().split())) for i in range(n)]
AB.sort()
res = 0
for a,b in AB:
m -= b
if m >= 0:
res += a*b
else:
m += b
res += a*m
break
print(res) | 12 | 13 | 242 | 245 | n, m = list(map(int, input().split()))
AB = sorted([list(map(int, input().split())) for i in range(n)])
res = 0
for a, b in AB:
m -= b
if m >= 0:
res += a * b
else:
m += b
res += a * m
break
print(res)
| n, m = list(map(int, input().split()))
AB = [list(map(int, input().split())) for i in range(n)]
AB.sort()
res = 0
for a, b in AB:
m -= b
if m >= 0:
res += a * b
else:
m += b
res += a * m
break
print(res)
| false | 7.692308 | [
"-AB = sorted([list(map(int, input().split())) for i in range(n)])",
"+AB = [list(map(int, input().split())) for i in range(n)]",
"+AB.sort()"
] | false | 0.06522 | 0.083297 | 0.782986 | [
"s107668469",
"s306084919"
] |
u375695365 | p03261 | python | s722242662 | s264306344 | 21 | 17 | 3,316 | 3,060 | Accepted | Accepted | 19.05 | import collections
n=int(eval(input()))
w=[]
for i in range(n):
w.append(str(eval(input())))
w_count=collections.Counter(w)
if max(w_count.values())>=2:
print("No")
exit()
for i in range(n-1):
if w[i][-1]!=w[i+1][0]:
print("No")
exit()
print("Yes") | n=int(eval(input()))
w=[str(eval(input())) for _ in range(n)]
if len(set(w))!=n:
print("No")
exit()
for i in range(n-1):
if w[i][-1]!=w[i+1][0]:
print("No")
break
else:
print("Yes") | 16 | 13 | 285 | 215 | import collections
n = int(eval(input()))
w = []
for i in range(n):
w.append(str(eval(input())))
w_count = collections.Counter(w)
if max(w_count.values()) >= 2:
print("No")
exit()
for i in range(n - 1):
if w[i][-1] != w[i + 1][0]:
print("No")
exit()
print("Yes")
| n = int(eval(input()))
w = [str(eval(input())) for _ in range(n)]
if len(set(w)) != n:
print("No")
exit()
for i in range(n - 1):
if w[i][-1] != w[i + 1][0]:
print("No")
break
else:
print("Yes")
| false | 18.75 | [
"-import collections",
"-",
"-w = []",
"-for i in range(n):",
"- w.append(str(eval(input())))",
"-w_count = collections.Counter(w)",
"-if max(w_count.values()) >= 2:",
"+w = [str(eval(input())) for _ in range(n)]",
"+if len(set(w)) != n:",
"- exit()",
"-print(\"Yes\")",
"+ bre... | false | 0.174294 | 0.177295 | 0.983076 | [
"s722242662",
"s264306344"
] |
u267300160 | p03437 | python | s822145219 | s006980681 | 192 | 17 | 2,940 | 2,940 | Accepted | Accepted | 91.15 | X,Y = list(map(int,input().split()))
for i in range(1,10**6):
if((X*i) % Y != 0):
print((X*i))
exit()
print((-1))
| X,Y=list(map(int,input().split()))
print((-1 if X%Y==0 else X))
| 6 | 2 | 129 | 57 | X, Y = list(map(int, input().split()))
for i in range(1, 10**6):
if (X * i) % Y != 0:
print((X * i))
exit()
print((-1))
| X, Y = list(map(int, input().split()))
print((-1 if X % Y == 0 else X))
| false | 66.666667 | [
"-for i in range(1, 10**6):",
"- if (X * i) % Y != 0:",
"- print((X * i))",
"- exit()",
"-print((-1))",
"+print((-1 if X % Y == 0 else X))"
] | false | 0.090855 | 0.036017 | 2.522542 | [
"s822145219",
"s006980681"
] |
u918601425 | p02683 | python | s128265053 | s084004978 | 108 | 37 | 9,196 | 9,280 | Accepted | Accepted | 65.74 | N,M,X=[int(s) for s in input().split()]
Book=[[int(s) for s in input().split()] for _ in range(N)]
INF=10**7
ans=set()
ans.add(INF)
for n in range(2**N):
#Bit全探索
Xls=[0 for i in range(M)]
cost=0
for i in range(N):
if ((n>>i)&1)==1:
cost+=Book[i][0]
for b in range(M):
Xls... | N,M,X=[int(s) for s in input().split()]
Book=[[int(s) for s in input().split()] for _ in range(N)]
INF=10**7
ans=set()
ans.add(INF)
#深さ優先探索
def DFS(n,cost,Xls):
if n==N:
if min(Xls)>=X:
ans.add(cost)
else:
Xnext=[Xls[i]+Book[n][i+1] for i in range(M)]
DFS(n+1,cost+Book[n][0],Xnext)
... | 22 | 21 | 437 | 433 | N, M, X = [int(s) for s in input().split()]
Book = [[int(s) for s in input().split()] for _ in range(N)]
INF = 10**7
ans = set()
ans.add(INF)
for n in range(2**N):
# Bit全探索
Xls = [0 for i in range(M)]
cost = 0
for i in range(N):
if ((n >> i) & 1) == 1:
cost += Book[i][0]
... | N, M, X = [int(s) for s in input().split()]
Book = [[int(s) for s in input().split()] for _ in range(N)]
INF = 10**7
ans = set()
ans.add(INF)
# 深さ優先探索
def DFS(n, cost, Xls):
if n == N:
if min(Xls) >= X:
ans.add(cost)
else:
Xnext = [Xls[i] + Book[n][i + 1] for i in range(M)]
D... | false | 4.545455 | [
"-for n in range(2**N):",
"- # Bit全探索",
"- Xls = [0 for i in range(M)]",
"- cost = 0",
"- for i in range(N):",
"- if ((n >> i) & 1) == 1:",
"- cost += Book[i][0]",
"- for b in range(M):",
"- Xls[b] += Book[i][b + 1]",
"+# 深さ優先探索",
"+def DFS... | false | 0.044423 | 0.048283 | 0.92006 | [
"s128265053",
"s084004978"
] |
u814986259 | p03796 | python | s652959482 | s581871405 | 168 | 43 | 38,640 | 2,940 | Accepted | Accepted | 74.4 | N = int(eval(input()))
ans = 1
mod = 10**9+7
for i in range(1, N+1):
ans *= i
ans %= mod
print(ans)
| N = int(eval(input()))
mod = 10**9 + 7
ans = 1
for i in range(N):
ans *= (i+1)
ans %= mod
print(ans)
| 7 | 7 | 108 | 109 | N = int(eval(input()))
ans = 1
mod = 10**9 + 7
for i in range(1, N + 1):
ans *= i
ans %= mod
print(ans)
| N = int(eval(input()))
mod = 10**9 + 7
ans = 1
for i in range(N):
ans *= i + 1
ans %= mod
print(ans)
| false | 0 | [
"+mod = 10**9 + 7",
"-mod = 10**9 + 7",
"-for i in range(1, N + 1):",
"- ans *= i",
"+for i in range(N):",
"+ ans *= i + 1"
] | false | 0.038801 | 0.039788 | 0.975198 | [
"s652959482",
"s581871405"
] |
u371763408 | p03200 | python | s704330894 | s841418244 | 112 | 68 | 22,336 | 22,308 | Accepted | Accepted | 39.29 | s=list(eval(input()))
count=0
# print('lens',len(s))
indexes = [i for i, x in enumerate(s) if x == "B"]
ideal=sorted([len(s)-i-1 for i in range(len(indexes))])
# print(indexes)
# print(ideal)
for i in range(len(indexes)):
count+=ideal[i]-indexes[i]
print(count) | s=list(eval(input()))
w=[i for i in range(len(s)) if s[i]=="W"]
ideal=[j for j in range(s.count('W'))]
print((sum([i-j for i,j in zip(w,ideal)]))) | 11 | 4 | 268 | 141 | s = list(eval(input()))
count = 0
# print('lens',len(s))
indexes = [i for i, x in enumerate(s) if x == "B"]
ideal = sorted([len(s) - i - 1 for i in range(len(indexes))])
# print(indexes)
# print(ideal)
for i in range(len(indexes)):
count += ideal[i] - indexes[i]
print(count)
| s = list(eval(input()))
w = [i for i in range(len(s)) if s[i] == "W"]
ideal = [j for j in range(s.count("W"))]
print((sum([i - j for i, j in zip(w, ideal)])))
| false | 63.636364 | [
"-count = 0",
"-# print('lens',len(s))",
"-indexes = [i for i, x in enumerate(s) if x == \"B\"]",
"-ideal = sorted([len(s) - i - 1 for i in range(len(indexes))])",
"-# print(indexes)",
"-# print(ideal)",
"-for i in range(len(indexes)):",
"- count += ideal[i] - indexes[i]",
"-print(count)",
"+w ... | false | 0.037869 | 0.037937 | 0.998216 | [
"s704330894",
"s841418244"
] |
u156302018 | p03109 | python | s859508280 | s486557863 | 19 | 17 | 2,940 | 2,940 | Accepted | Accepted | 10.53 | s = input().split("/")
for i in range(3):
s[i] = int(s[i])
p = "TBD"
if s[0] <= 2019:
if s[1] <= 4:
if s[2] <= 30:
p = "Heisei"
print(p) | s = input().split("/")
for i in range(3):
s[i] = int(s[i])
p = "TBD"
if s[0] <= 2019 and s[1] <= 4 and s[2] <= 30:
p = "Heisei"
print(p)
| 9 | 7 | 172 | 151 | s = input().split("/")
for i in range(3):
s[i] = int(s[i])
p = "TBD"
if s[0] <= 2019:
if s[1] <= 4:
if s[2] <= 30:
p = "Heisei"
print(p)
| s = input().split("/")
for i in range(3):
s[i] = int(s[i])
p = "TBD"
if s[0] <= 2019 and s[1] <= 4 and s[2] <= 30:
p = "Heisei"
print(p)
| false | 22.222222 | [
"-if s[0] <= 2019:",
"- if s[1] <= 4:",
"- if s[2] <= 30:",
"- p = \"Heisei\"",
"+if s[0] <= 2019 and s[1] <= 4 and s[2] <= 30:",
"+ p = \"Heisei\""
] | false | 0.042925 | 0.042616 | 1.007243 | [
"s859508280",
"s486557863"
] |
u724687935 | p03600 | python | s438209848 | s276153042 | 1,337 | 797 | 52,024 | 50,268 | Accepted | Accepted | 40.39 | N = int(eval(input()))
A = [list(map(int, input().split())) for _ in range(N)]
dp = A
cnt = 0
for i in range(N):
for j in range(N):
if all(dp[i][j] < dp[i][k] + dp[k][j] for k in range(N) if k != i and k != j):
cnt += dp[i][j]
if any(dp[i][j] > dp[i][k] + dp[k][j] for k in rang... | N = int(eval(input()))
A = [list(map(int, input().split())) for _ in range(N)]
dp = A
cnt = 0
for i in range(N - 1):
for j in range(i + 1, N):
if all(dp[i][j] < dp[i][k] + dp[k][j] for k in range(N) if k != i and k != j):
cnt += dp[i][j]
if any(dp[i][j] > dp[i][k] + dp[k][j] fo... | 14 | 14 | 383 | 389 | N = int(eval(input()))
A = [list(map(int, input().split())) for _ in range(N)]
dp = A
cnt = 0
for i in range(N):
for j in range(N):
if all(dp[i][j] < dp[i][k] + dp[k][j] for k in range(N) if k != i and k != j):
cnt += dp[i][j]
if any(dp[i][j] > dp[i][k] + dp[k][j] for k in range(N)):
... | N = int(eval(input()))
A = [list(map(int, input().split())) for _ in range(N)]
dp = A
cnt = 0
for i in range(N - 1):
for j in range(i + 1, N):
if all(dp[i][j] < dp[i][k] + dp[k][j] for k in range(N) if k != i and k != j):
cnt += dp[i][j]
if any(dp[i][j] > dp[i][k] + dp[k][j] for k in ran... | false | 0 | [
"-for i in range(N):",
"- for j in range(N):",
"+for i in range(N - 1):",
"+ for j in range(i + 1, N):",
"-print((cnt // 2))",
"+print(cnt)"
] | false | 0.034132 | 0.041676 | 0.818981 | [
"s438209848",
"s276153042"
] |
u537905693 | p03112 | python | s856217174 | s914712280 | 1,100 | 623 | 36,684 | 36,620 | Accepted | Accepted | 43.36 | #!/usr/bin/env python
# coding: utf-8
inf = float('inf')
def main():
A, B, Q = list(map(int, input().split()))
ls = []
lt = []
lx = []
for _ in range(A):
ls.append(int(eval(input())))
for _ in range(B):
lt.append(int(eval(input())))
for i in range(Q):
... | #!/usr/bin/env python
# coding: utf-8
import sys
input = sys.stdin.readline
inf = float('inf')
def main():
A, B, Q = list(map(int, input().split()))
ls = [-inf] + [int(eval(input())) for _ in range(A)] + [inf]
lt = [-inf] + [int(eval(input())) for _ in range(B)] + [inf]
lx = [(int(eval(in... | 59 | 43 | 1,445 | 1,054 | #!/usr/bin/env python
# coding: utf-8
inf = float("inf")
def main():
A, B, Q = list(map(int, input().split()))
ls = []
lt = []
lx = []
for _ in range(A):
ls.append(int(eval(input())))
for _ in range(B):
lt.append(int(eval(input())))
for i in range(Q):
lx.append((int... | #!/usr/bin/env python
# coding: utf-8
import sys
input = sys.stdin.readline
inf = float("inf")
def main():
A, B, Q = list(map(int, input().split()))
ls = [-inf] + [int(eval(input())) for _ in range(A)] + [inf]
lt = [-inf] + [int(eval(input())) for _ in range(B)] + [inf]
lx = [(int(eval(input())), i) ... | false | 27.118644 | [
"+import sys",
"+",
"+input = sys.stdin.readline",
"- ls = []",
"- lt = []",
"- lx = []",
"- for _ in range(A):",
"- ls.append(int(eval(input())))",
"- for _ in range(B):",
"- lt.append(int(eval(input())))",
"- for i in range(Q):",
"- lx.append((int(eval(... | false | 0.047506 | 0.040419 | 1.175327 | [
"s856217174",
"s914712280"
] |
u287500079 | p02733 | python | s747418702 | s060962706 | 597 | 392 | 51,420 | 47,580 | Accepted | Accepted | 34.34 | import sys
inf = sys.maxsize
if __name__ == '__main__':
h, w, k = list(map(int, sys.stdin.readline().strip().split()))
s = [[int(i) for i in sys.stdin.readline().strip()] for _ in range(h)]
ans = inf
for i in range(2 ** (h - 1)): #縦方向の割り方を全探索 O(512)
hdiv = [1 if i & 2 ** j else 0 ... | import sys
def input(): return sys.stdin.readline().strip()
def STR(): return eval(input())
def MAP(): return list(map(int, input().split()))
inf = sys.maxsize
h, w, k = MAP()
s = [[int(i) for i in STR()] for _ in range(h)]
ans = inf
for i in range(2 ** (h - 1)): #縦方向の割り方を全探索 O(500)
hdiv = [1 for _ in ... | 39 | 46 | 1,346 | 1,202 | import sys
inf = sys.maxsize
if __name__ == "__main__":
h, w, k = list(map(int, sys.stdin.readline().strip().split()))
s = [[int(i) for i in sys.stdin.readline().strip()] for _ in range(h)]
ans = inf
for i in range(2 ** (h - 1)): # 縦方向の割り方を全探索 O(512)
hdiv = [1 if i & 2**j else 0 for j in range... | import sys
def input():
return sys.stdin.readline().strip()
def STR():
return eval(input())
def MAP():
return list(map(int, input().split()))
inf = sys.maxsize
h, w, k = MAP()
s = [[int(i) for i in STR()] for _ in range(h)]
ans = inf
for i in range(2 ** (h - 1)): # 縦方向の割り方を全探索 O(500)
hdiv = [1 ... | false | 15.217391 | [
"+",
"+def input():",
"+ return sys.stdin.readline().strip()",
"+",
"+",
"+def STR():",
"+ return eval(input())",
"+",
"+",
"+def MAP():",
"+ return list(map(int, input().split()))",
"+",
"+",
"-if __name__ == \"__main__\":",
"- h, w, k = list(map(int, sys.stdin.readline().st... | false | 0.166071 | 0.034837 | 4.767058 | [
"s747418702",
"s060962706"
] |
u875541136 | p02730 | python | s458594340 | s599239507 | 196 | 18 | 38,384 | 3,060 | Accepted | Accepted | 90.82 | s = eval(input())
n = len(s)
for i in range((n - 1)//4):
if not(s[i] == s[(n-1)//2-i-1] and s[(n+3)//2 + i-1] == s[-i-1] and s[i] == s[-i-1]):
print('No')
exit()
if (n-1)%4 != 0:
j = (n - 1) // 4
if s[j] != s[-j-1]:
print('No')
exit()
print('Yes') | s = eval(input())
n = len(s)
for i in range((n-1+3)//4):# 切り上げ
if not(s[i] == s[(n-1)//2-i-1] and s[(n+3)//2 + i-1] == s[-i-1] and s[i] == s[-i-1]):
print('No')
exit()
print('Yes') | 12 | 7 | 297 | 201 | s = eval(input())
n = len(s)
for i in range((n - 1) // 4):
if not (
s[i] == s[(n - 1) // 2 - i - 1]
and s[(n + 3) // 2 + i - 1] == s[-i - 1]
and s[i] == s[-i - 1]
):
print("No")
exit()
if (n - 1) % 4 != 0:
j = (n - 1) // 4
if s[j] != s[-j - 1]:
print("No")... | s = eval(input())
n = len(s)
for i in range((n - 1 + 3) // 4): # 切り上げ
if not (
s[i] == s[(n - 1) // 2 - i - 1]
and s[(n + 3) // 2 + i - 1] == s[-i - 1]
and s[i] == s[-i - 1]
):
print("No")
exit()
print("Yes")
| false | 41.666667 | [
"-for i in range((n - 1) // 4):",
"+for i in range((n - 1 + 3) // 4): # 切り上げ",
"-if (n - 1) % 4 != 0:",
"- j = (n - 1) // 4",
"- if s[j] != s[-j - 1]:",
"- print(\"No\")",
"- exit()"
] | false | 0.039426 | 0.04018 | 0.981228 | [
"s458594340",
"s599239507"
] |
u853185302 | p03273 | python | s064463724 | s322977558 | 31 | 18 | 4,596 | 3,188 | Accepted | Accepted | 41.94 | H, W = map(int, input().split())
a = [list(input()) for _ in range(H)]
a_h = [False]*H
a_w = [False]*W
for i in range(H):
for j in range(W):
if a[i][j] == '#':
a_h[i] = True
a_w[j] = True
for i in range(H):
if a_h[i] == True:
for j in range(W):
if a_w[j] == True:
p... | h,w=list(map(int,input().split()))
a=[[j for j in eval(input())] for i in range(h)]
b=[x for x in a if "#" in x]
c=list(zip(*[y for y in zip(*b) if "#" in y]))
for d in c:print(("".join(d))) | 19 | 5 | 359 | 174 | H, W = map(int, input().split())
a = [list(input()) for _ in range(H)]
a_h = [False] * H
a_w = [False] * W
for i in range(H):
for j in range(W):
if a[i][j] == "#":
a_h[i] = True
a_w[j] = True
for i in range(H):
if a_h[i] == True:
for j in range(W):
if a_w[j] =... | h, w = list(map(int, input().split()))
a = [[j for j in eval(input())] for i in range(h)]
b = [x for x in a if "#" in x]
c = list(zip(*[y for y in zip(*b) if "#" in y]))
for d in c:
print(("".join(d)))
| false | 73.684211 | [
"-H, W = map(int, input().split())",
"-a = [list(input()) for _ in range(H)]",
"-a_h = [False] * H",
"-a_w = [False] * W",
"-for i in range(H):",
"- for j in range(W):",
"- if a[i][j] == \"#\":",
"- a_h[i] = True",
"- a_w[j] = True",
"-for i in range(H):",
"- i... | false | 0.069113 | 0.057219 | 1.207856 | [
"s064463724",
"s322977558"
] |
u353797797 | p03160 | python | s816677317 | s088831270 | 192 | 133 | 23,184 | 13,928 | Accepted | Accepted | 30.73 | n = int(eval(input()))
h = [0] + list(map(int, input().split()))
cost = {1:0,2: abs(h[2] - h[1])}
for i in range(1, n):
cost[i + 1] = min(cost[i + 1], cost[i] + abs(h[i + 1] - h[i]))
if i==n-1:break
cost[i + 2] = cost[i] + abs(h[i + 2] - h[i])
print((cost[n]))
| n = int(eval(input()))
h = list(map(int, input().split()))
dp = [0] * n
dp[1] = abs(h[1] - h[0])
for i, (h, h1, h2) in enumerate(zip(h[2:], h[1:], h)):
dp[i + 2] = min(dp[i + 1] + abs(h - h1), dp[i] + abs(h - h2))
print((dp[-1]))
| 9 | 7 | 274 | 232 | n = int(eval(input()))
h = [0] + list(map(int, input().split()))
cost = {1: 0, 2: abs(h[2] - h[1])}
for i in range(1, n):
cost[i + 1] = min(cost[i + 1], cost[i] + abs(h[i + 1] - h[i]))
if i == n - 1:
break
cost[i + 2] = cost[i] + abs(h[i + 2] - h[i])
print((cost[n]))
| n = int(eval(input()))
h = list(map(int, input().split()))
dp = [0] * n
dp[1] = abs(h[1] - h[0])
for i, (h, h1, h2) in enumerate(zip(h[2:], h[1:], h)):
dp[i + 2] = min(dp[i + 1] + abs(h - h1), dp[i] + abs(h - h2))
print((dp[-1]))
| false | 22.222222 | [
"-h = [0] + list(map(int, input().split()))",
"-cost = {1: 0, 2: abs(h[2] - h[1])}",
"-for i in range(1, n):",
"- cost[i + 1] = min(cost[i + 1], cost[i] + abs(h[i + 1] - h[i]))",
"- if i == n - 1:",
"- break",
"- cost[i + 2] = cost[i] + abs(h[i + 2] - h[i])",
"-print((cost[n]))",
"+h... | false | 0.083855 | 0.043065 | 1.947147 | [
"s816677317",
"s088831270"
] |
u285891772 | p02725 | python | s888950616 | s026186608 | 416 | 309 | 39,512 | 35,140 | Accepted | Accepted | 25.72 | import numpy as np
a = list(map(int, input().split()))
b = list(map(int, input().split()))
K = a[0]
N = a[1]
c = np.zeros(N)
for i in range(N-1):
c[i] = abs(b[i+1] - b[i])
c[N-1] = abs(K - b[N-1] + b[0])
r = max(c)
print((int(K-r))) | import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ... | 18 | 30 | 258 | 936 | import numpy as np
a = list(map(int, input().split()))
b = list(map(int, input().split()))
K = a[0]
N = a[1]
c = np.zeros(N)
for i in range(N - 1):
c[i] = abs(b[i + 1] - b[i])
c[N - 1] = abs(K - b[N - 1] + b[0])
r = max(c)
print((int(K - r)))
| import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_... | false | 40 | [
"+import sys, re",
"+from collections import deque, defaultdict, Counter",
"+from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians",
"+from itertools import accumulate, permutations, combinations, product, groupby",
"+from operator import itemgetter, mul",
"+from copy import deepcopy",
"+... | false | 0.424161 | 0.43255 | 0.980607 | [
"s888950616",
"s026186608"
] |
u078042885 | p00691 | python | s925536080 | s341918618 | 130 | 120 | 7,620 | 7,692 | Accepted | Accepted | 7.69 | a=1/3
while 1:
z=int(eval(input()))
if z==0:break
m=0
zz=z*z*z
for x in range(1,int(z/pow(2,a))+1):
xx=x*x*x
y=int(pow(zz-xx,a))
yy=y*y*y
m=max(m,yy+xx)
print((zz-m)) | a=1/3
while 1:
z=int(eval(input()))
if z==0:break
m,zz=0,z*z*z
for x in range(1,int(z/pow(2,a))+1):
xx=x*x*x
y=int(pow(zz-xx,a))
yy=y*y*y
m=max(m,yy+xx)
print((zz-m)) | 12 | 11 | 225 | 220 | a = 1 / 3
while 1:
z = int(eval(input()))
if z == 0:
break
m = 0
zz = z * z * z
for x in range(1, int(z / pow(2, a)) + 1):
xx = x * x * x
y = int(pow(zz - xx, a))
yy = y * y * y
m = max(m, yy + xx)
print((zz - m))
| a = 1 / 3
while 1:
z = int(eval(input()))
if z == 0:
break
m, zz = 0, z * z * z
for x in range(1, int(z / pow(2, a)) + 1):
xx = x * x * x
y = int(pow(zz - xx, a))
yy = y * y * y
m = max(m, yy + xx)
print((zz - m))
| false | 8.333333 | [
"- m = 0",
"- zz = z * z * z",
"+ m, zz = 0, z * z * z"
] | false | 0.045683 | 0.04713 | 0.969289 | [
"s925536080",
"s341918618"
] |
u305366205 | p02780 | python | s647075772 | s686526717 | 215 | 133 | 25,172 | 25,060 | Accepted | Accepted | 38.14 | n, k = list(map(int, input().split()))
p = list(map(int, input().split()))
dd = [0] * (n + 1)
for i in range(1, n + 1):
dd[i] = dd[i - 1] + p[i - 1]
total = 0
index = 0
j = 0
while j < n + 1:
if j + k >= n + 1:
break
now = dd[j + k] - dd[j]
if now > total:
total = now
... | n, k = list(map(int, input().split()))
p = list(map(int, input().split()))
ans = 0
now = sum(p[:k-1])
for i in range(n - k + 1):
now += p[i + k - 1]
if now > ans:
ans = now
now -= p[i]
ans += k
ans /= 2
print(ans)
| 22 | 12 | 439 | 239 | n, k = list(map(int, input().split()))
p = list(map(int, input().split()))
dd = [0] * (n + 1)
for i in range(1, n + 1):
dd[i] = dd[i - 1] + p[i - 1]
total = 0
index = 0
j = 0
while j < n + 1:
if j + k >= n + 1:
break
now = dd[j + k] - dd[j]
if now > total:
total = now
index = j
... | n, k = list(map(int, input().split()))
p = list(map(int, input().split()))
ans = 0
now = sum(p[: k - 1])
for i in range(n - k + 1):
now += p[i + k - 1]
if now > ans:
ans = now
now -= p[i]
ans += k
ans /= 2
print(ans)
| false | 45.454545 | [
"-dd = [0] * (n + 1)",
"-for i in range(1, n + 1):",
"- dd[i] = dd[i - 1] + p[i - 1]",
"-total = 0",
"-index = 0",
"-j = 0",
"-while j < n + 1:",
"- if j + k >= n + 1:",
"- break",
"- now = dd[j + k] - dd[j]",
"- if now > total:",
"- total = now",
"- index = ... | false | 0.097706 | 0.038751 | 2.521398 | [
"s647075772",
"s686526717"
] |
u197615397 | p02345 | python | s231721255 | s071831384 | 3,200 | 2,510 | 14,792 | 15,132 | Accepted | Accepted | 21.56 | import math
n, q = list(map(int, input().split()))
l = 1 << math.ceil(math.log(n, 2))
inf = 2**31-1
a = [inf]*(2*l-1)
def set_value(i, num):
k = l-1+i
a[k] = num
while k > 0:
k = (k-1)//2
num = min(a[2*k+1], a[2*k+2])
if a[k] == num:
break
else:
... | import math
class SegmentTree:
__slots__ = ["elem_size", "tree_size", "tree"]
def __init__(self, a: list, default: int):
real_size = len(a)
self.elem_size = 1 << math.ceil(math.log2(real_size))
self.tree_size = 2 * self.elem_size
self.tree = [default]*self.elem_size ... | 35 | 71 | 886 | 2,296 | import math
n, q = list(map(int, input().split()))
l = 1 << math.ceil(math.log(n, 2))
inf = 2**31 - 1
a = [inf] * (2 * l - 1)
def set_value(i, num):
k = l - 1 + i
a[k] = num
while k > 0:
k = (k - 1) // 2
num = min(a[2 * k + 1], a[2 * k + 2])
if a[k] == num:
break
... | import math
class SegmentTree:
__slots__ = ["elem_size", "tree_size", "tree"]
def __init__(self, a: list, default: int):
real_size = len(a)
self.elem_size = 1 << math.ceil(math.log2(real_size))
self.tree_size = 2 * self.elem_size
self.tree = (
[default] * self.elem... | false | 50.704225 | [
"-n, q = list(map(int, input().split()))",
"-l = 1 << math.ceil(math.log(n, 2))",
"-inf = 2**31 - 1",
"-a = [inf] * (2 * l - 1)",
"+",
"+class SegmentTree:",
"+ __slots__ = [\"elem_size\", \"tree_size\", \"tree\"]",
"+",
"+ def __init__(self, a: list, default: int):",
"+ real_size = l... | false | 0.038513 | 0.040178 | 0.958559 | [
"s231721255",
"s071831384"
] |
u123745130 | p02682 | python | s050043005 | s035688910 | 24 | 22 | 9,168 | 9,188 | Accepted | Accepted | 8.33 | a,b,c,k=list(map(int,input().split()))
if a>=k:
print(k)
elif a<k:
if k-a<=b:
print(a)
elif k-a >b:
print((a-(k-a-b)))
| a,b,c,k=list(map(int,input().split()))
ans=0
ans=min(k,a)
k-=min(k,a)
ans+=min(k,b)*0
k-=min(k,b)
ans+=min(k,c)*(-1)
print(ans) | 8 | 8 | 132 | 128 | a, b, c, k = list(map(int, input().split()))
if a >= k:
print(k)
elif a < k:
if k - a <= b:
print(a)
elif k - a > b:
print((a - (k - a - b)))
| a, b, c, k = list(map(int, input().split()))
ans = 0
ans = min(k, a)
k -= min(k, a)
ans += min(k, b) * 0
k -= min(k, b)
ans += min(k, c) * (-1)
print(ans)
| false | 0 | [
"-if a >= k:",
"- print(k)",
"-elif a < k:",
"- if k - a <= b:",
"- print(a)",
"- elif k - a > b:",
"- print((a - (k - a - b)))",
"+ans = 0",
"+ans = min(k, a)",
"+k -= min(k, a)",
"+ans += min(k, b) * 0",
"+k -= min(k, b)",
"+ans += min(k, c) * (-1)",
"+print(ans)"
... | false | 0.042312 | 0.034728 | 1.218404 | [
"s050043005",
"s035688910"
] |
u334712262 | p03078 | python | s065766351 | s714537721 | 530 | 68 | 81,236 | 7,236 | Accepted | Accepted | 87.17 | # -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
import sys
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, produc... | # -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
import sys
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, produc... | 117 | 108 | 2,762 | 2,474 | # -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
import sys
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, product, permut... | # -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
import sys
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, product, permut... | false | 7.692308 | [
"- if 1 < len(A):",
"- heapq.heappush(cand, (-s(1, 0, 0), (1, 0, 0)))",
"- used.add((1, 0, 0))",
"- if 1 < len(B):",
"- heapq.heappush(cand, (-s(0, 1, 0), (0, 1, 0)))",
"- used.add((0, 1, 0))",
"- if 1 < len(C):",
"- heapq.heappush(cand, (-s(0, 0, 1), (0, 0,... | false | 0.07667 | 0.035159 | 2.180659 | [
"s065766351",
"s714537721"
] |
u777283665 | p02936 | python | s204417174 | s217497490 | 1,720 | 1,164 | 237,004 | 65,332 | Accepted | Accepted | 32.33 | import sys
sys.setrecursionlimit(10**6)
input = sys.stdin.readline
n, q = list(map(int, input().split()))
tree = [[] for _ in range(n)]
for i in range(n-1):
a, b = list(map(int, input().split()))
tree[a-1].append(b-1)
tree[b-1].append(a-1)
add = [0] * n
for i in range(q):
p, x = lis... | from collections import deque
import sys
input = sys.stdin.readline
n, q = list(map(int, input().split()))
tree = [[] for _ in range(n)]
for _ in range(n-1):
a, b = list(map(int, input().split()))
tree[a-1].append(b-1)
tree[b-1].append(a-1)
ans = [0] * n
for _ in range(q):
p, x = list... | 32 | 30 | 555 | 706 | import sys
sys.setrecursionlimit(10**6)
input = sys.stdin.readline
n, q = list(map(int, input().split()))
tree = [[] for _ in range(n)]
for i in range(n - 1):
a, b = list(map(int, input().split()))
tree[a - 1].append(b - 1)
tree[b - 1].append(a - 1)
add = [0] * n
for i in range(q):
p, x = list(map(int,... | from collections import deque
import sys
input = sys.stdin.readline
n, q = list(map(int, input().split()))
tree = [[] for _ in range(n)]
for _ in range(n - 1):
a, b = list(map(int, input().split()))
tree[a - 1].append(b - 1)
tree[b - 1].append(a - 1)
ans = [0] * n
for _ in range(q):
p, x = list(map(int... | false | 6.25 | [
"+from collections import deque",
"-sys.setrecursionlimit(10**6)",
"-for i in range(n - 1):",
"+for _ in range(n - 1):",
"-add = [0] * n",
"-for i in range(q):",
"+ans = [0] * n",
"+for _ in range(q):",
"- add[p - 1] += x",
"-ans = [0] * n",
"-",
"-",
"-def dfs(v, p, value):",
"- val... | false | 0.036913 | 0.046119 | 0.800393 | [
"s204417174",
"s217497490"
] |
u602740328 | p03380 | python | s302412797 | s403116164 | 124 | 103 | 17,252 | 14,056 | Accepted | Accepted | 16.94 | n = int(eval(input()))
A = sorted(list(map(int, input().split())))
A_max = A.pop()
n = A_max/2
n = min([(abs(n-i), i) for i in A], key=lambda x:x[0])[1]
print((A_max, n)) | n = int(eval(input()))
A = sorted([int(i) for i in input().split()])
A_max = A.pop()
print((A_max, min(A, key=lambda x:abs(A_max-x*2)))) | 6 | 4 | 167 | 131 | n = int(eval(input()))
A = sorted(list(map(int, input().split())))
A_max = A.pop()
n = A_max / 2
n = min([(abs(n - i), i) for i in A], key=lambda x: x[0])[1]
print((A_max, n))
| n = int(eval(input()))
A = sorted([int(i) for i in input().split()])
A_max = A.pop()
print((A_max, min(A, key=lambda x: abs(A_max - x * 2))))
| false | 33.333333 | [
"-A = sorted(list(map(int, input().split())))",
"+A = sorted([int(i) for i in input().split()])",
"-n = A_max / 2",
"-n = min([(abs(n - i), i) for i in A], key=lambda x: x[0])[1]",
"-print((A_max, n))",
"+print((A_max, min(A, key=lambda x: abs(A_max - x * 2))))"
] | false | 0.038383 | 0.032528 | 1.179993 | [
"s302412797",
"s403116164"
] |
u088005953 | p03075 | python | s301057205 | s000127953 | 20 | 18 | 2,940 | 2,940 | Accepted | Accepted | 10 | a = int(eval(input()))
_ = int(eval(input()))
_ = int(eval(input()))
_ = int(eval(input()))
e = int(eval(input()))
k = int(eval(input()))
if e - a <= k:
print("Yay!")
else:
print(":(")
| a = int(eval(input()))
d = int(eval(input()))
f = int(eval(input()))
h = int(eval(input()))
e = int(eval(input()))
k = int(eval(input()))
if e - a <= k:
print("Yay!")
else:
print(":(")
| 12 | 12 | 166 | 166 | a = int(eval(input()))
_ = int(eval(input()))
_ = int(eval(input()))
_ = int(eval(input()))
e = int(eval(input()))
k = int(eval(input()))
if e - a <= k:
print("Yay!")
else:
print(":(")
| a = int(eval(input()))
d = int(eval(input()))
f = int(eval(input()))
h = int(eval(input()))
e = int(eval(input()))
k = int(eval(input()))
if e - a <= k:
print("Yay!")
else:
print(":(")
| false | 0 | [
"-_ = int(eval(input()))",
"-_ = int(eval(input()))",
"-_ = int(eval(input()))",
"+d = int(eval(input()))",
"+f = int(eval(input()))",
"+h = int(eval(input()))"
] | false | 0.090272 | 0.038173 | 2.364794 | [
"s301057205",
"s000127953"
] |
u888092736 | p03476 | python | s423537111 | s975543912 | 673 | 558 | 54,064 | 54,184 | Accepted | Accepted | 17.09 | def gen_is_prime(n):
is_prime = [True] * (n + 1)
is_prime[0] = False
is_prime[1] = False
for i in range(2, n + 1):
for j in range(i * 2, n + 1, i):
is_prime[j] = False
# return [i for i in range(n + 1) if is_prime[i]]
return is_prime
if __name__ == "__main__":
... | from itertools import accumulate
def gen_primes(n: int) -> set:
if n < 2:
return set()
is_prime = [True] * n
for i in range(3, n, 2):
if is_prime[i]:
is_prime[i * i:: 2 * i] = [False] * ((n - i * i - 1) // (2 * i) + 1)
return {2} | {i for i in range(3, n, 2) if is... | 28 | 24 | 851 | 743 | def gen_is_prime(n):
is_prime = [True] * (n + 1)
is_prime[0] = False
is_prime[1] = False
for i in range(2, n + 1):
for j in range(i * 2, n + 1, i):
is_prime[j] = False
# return [i for i in range(n + 1) if is_prime[i]]
return is_prime
if __name__ == "__main__":
max_n = 1... | from itertools import accumulate
def gen_primes(n: int) -> set:
if n < 2:
return set()
is_prime = [True] * n
for i in range(3, n, 2):
if is_prime[i]:
is_prime[i * i :: 2 * i] = [False] * ((n - i * i - 1) // (2 * i) + 1)
return {2} | {i for i in range(3, n, 2) if is_prime[i]... | false | 14.285714 | [
"-def gen_is_prime(n):",
"- is_prime = [True] * (n + 1)",
"- is_prime[0] = False",
"- is_prime[1] = False",
"- for i in range(2, n + 1):",
"- for j in range(i * 2, n + 1, i):",
"- is_prime[j] = False",
"- # return [i for i in range(n + 1) if is_prime[i]]",
"- retu... | false | 0.281361 | 0.080698 | 3.486603 | [
"s423537111",
"s975543912"
] |
u442948527 | p04011 | python | s953561904 | s009250397 | 27 | 24 | 9,032 | 8,908 | Accepted | Accepted | 11.11 | n=int(eval(input()))
k=int(eval(input()))
x=int(eval(input()))
y=int(eval(input()))
if k<n:
print((x*k+y*(n-k)))
else:
print((x*n)) | n,k,x,y=[int(eval(input())) for _ in range(4)]
print((x*min(k,n)+y*max(n-k,0))) | 9 | 2 | 120 | 72 | n = int(eval(input()))
k = int(eval(input()))
x = int(eval(input()))
y = int(eval(input()))
if k < n:
print((x * k + y * (n - k)))
else:
print((x * n))
| n, k, x, y = [int(eval(input())) for _ in range(4)]
print((x * min(k, n) + y * max(n - k, 0)))
| false | 77.777778 | [
"-n = int(eval(input()))",
"-k = int(eval(input()))",
"-x = int(eval(input()))",
"-y = int(eval(input()))",
"-if k < n:",
"- print((x * k + y * (n - k)))",
"-else:",
"- print((x * n))",
"+n, k, x, y = [int(eval(input())) for _ in range(4)]",
"+print((x * min(k, n) + y * max(n - k, 0)))"
] | false | 0.037423 | 0.033858 | 1.105284 | [
"s953561904",
"s009250397"
] |
u690554532 | p02689 | python | s607819688 | s877185396 | 246 | 136 | 20,088 | 20,168 | Accepted | Accepted | 44.72 | def main():
n, m = list(map(int, input().split()))
h = list(map(int, input().split()))
l_n = [True] * n
for i in range(m):
a, b = list(map(int, input().split()))
if h[a-1] == h[b-1]:
l_n[b-1] = False
l_n[a-1] = False
elif h[a-1] <= h[b-1]:
... | import sys
def main():
input = sys.stdin.readline
n, m = list(map(int, input().split()))
h = list(map(int, input().split()))
l_n = [True] * n
for i in range(m):
a, b = list(map(int, input().split()))
if h[a-1] == h[b-1]:
l_n[b-1] = False
l_n[a-1] =... | 17 | 20 | 456 | 502 | def main():
n, m = list(map(int, input().split()))
h = list(map(int, input().split()))
l_n = [True] * n
for i in range(m):
a, b = list(map(int, input().split()))
if h[a - 1] == h[b - 1]:
l_n[b - 1] = False
l_n[a - 1] = False
elif h[a - 1] <= h[b - 1]:
... | import sys
def main():
input = sys.stdin.readline
n, m = list(map(int, input().split()))
h = list(map(int, input().split()))
l_n = [True] * n
for i in range(m):
a, b = list(map(int, input().split()))
if h[a - 1] == h[b - 1]:
l_n[b - 1] = False
l_n[a - 1] = F... | false | 15 | [
"+import sys",
"+",
"+",
"+ input = sys.stdin.readline"
] | false | 0.036482 | 0.072603 | 0.502482 | [
"s607819688",
"s877185396"
] |
u519939795 | p03469 | python | s005919444 | s335858794 | 19 | 17 | 3,060 | 2,940 | Accepted | Accepted | 10.53 | print(('2018'+input()[4:]))
| s = eval(input())
print((s.replace('2017','2018'))) | 1 | 2 | 26 | 44 | print(("2018" + input()[4:]))
| s = eval(input())
print((s.replace("2017", "2018")))
| false | 50 | [
"-print((\"2018\" + input()[4:]))",
"+s = eval(input())",
"+print((s.replace(\"2017\", \"2018\")))"
] | false | 0.04409 | 0.042779 | 1.030648 | [
"s005919444",
"s335858794"
] |
u948911484 | p02813 | python | s414271545 | s046659433 | 51 | 27 | 10,228 | 3,060 | Accepted | Accepted | 47.06 | n = int(eval(input()))
p = list(map(int,input().split()))
q = list(map(int,input().split()))
import itertools
lst = [i+1 for i in range(n)]
l = [0]*len(lst)
for i in itertools.permutations(lst):
l.append(list(i))
for i in range(len(l)):
if p == l[i]:
a = i
if q == l[i]:
b = i
pr... | from itertools import permutations as pm
n = int(eval(input()))
p = tuple(map(int,input().split()))
q = tuple(map(int,input().split()))
i = 0
for l in pm([i+1 for i in range(n)],n):
if l == p:
a = i
if l == q:
b = i
i += 1
print((abs(a-b)))
| 14 | 13 | 327 | 274 | n = int(eval(input()))
p = list(map(int, input().split()))
q = list(map(int, input().split()))
import itertools
lst = [i + 1 for i in range(n)]
l = [0] * len(lst)
for i in itertools.permutations(lst):
l.append(list(i))
for i in range(len(l)):
if p == l[i]:
a = i
if q == l[i]:
b = i
print((a... | from itertools import permutations as pm
n = int(eval(input()))
p = tuple(map(int, input().split()))
q = tuple(map(int, input().split()))
i = 0
for l in pm([i + 1 for i in range(n)], n):
if l == p:
a = i
if l == q:
b = i
i += 1
print((abs(a - b)))
| false | 7.142857 | [
"+from itertools import permutations as pm",
"+",
"-p = list(map(int, input().split()))",
"-q = list(map(int, input().split()))",
"-import itertools",
"-",
"-lst = [i + 1 for i in range(n)]",
"-l = [0] * len(lst)",
"-for i in itertools.permutations(lst):",
"- l.append(list(i))",
"-for i in ra... | false | 0.047346 | 0.039604 | 1.195484 | [
"s414271545",
"s046659433"
] |
u642874916 | p02713 | python | s031091739 | s332385199 | 1,702 | 1,239 | 75,968 | 74,328 | Accepted | Accepted | 27.2 | from heapq import heappush, heappop, heapify
from collections import deque, defaultdict, Counter
import itertools
from itertools import permutations, combinations, accumulate
import sys
import bisect
import string
import math
import time
def I(): return int(eval(input()))
def S(): return eval(input())... | from heapq import heappush, heappop, heapify
from collections import deque, defaultdict, Counter
import itertools
from itertools import permutations, combinations, accumulate
import sys
import bisect
import string
import math
import time
def I(): return int(input())
def S(): return input()
def MI... | 90 | 80 | 1,696 | 1,527 | from heapq import heappush, heappop, heapify
from collections import deque, defaultdict, Counter
import itertools
from itertools import permutations, combinations, accumulate
import sys
import bisect
import string
import math
import time
def I():
return int(eval(input()))
def S():
return eval(input())
def... | from heapq import heappush, heappop, heapify
from collections import deque, defaultdict, Counter
import itertools
from itertools import permutations, combinations, accumulate
import sys
import bisect
import string
import math
import time
def I():
return int(input())
def S():
return input()
def MI():
r... | false | 11.111111 | [
"- return int(eval(input()))",
"+ return int(input())",
"- return eval(input())",
"+ return input()",
"- return list(map(int, input().split()))",
"+ return map(int, input().split())",
"- return list(map(str, input().split()))",
"+ return map(str, input().split())",
"- retu... | false | 0.045266 | 0.127354 | 0.355434 | [
"s031091739",
"s332385199"
] |
u263830634 | p02890 | python | s318399680 | s205237999 | 1,162 | 871 | 37,884 | 37,884 | Accepted | Accepted | 25.04 | from bisect import bisect_left
N = int(eval(input()))
A = list(map(int, input().split()))
lst = [0] * (N + 1)
for a in A:
lst[a - 1] += 1
lst.sort() #頻度列
s = [0] * (N + 1)
for i in range(N):
s[i + 1] = s[i] + lst[i + 1]
# print (lst)
# print (s)
def check(x, k):
i = bisect_left(lst, x... | from bisect import bisect_left
N = int(eval(input()))
A = list(map(int, input().split()))
lst = [0] * (N + 1)
for a in A:
lst[a - 1] += 1
lst.sort() #頻度列
s = [0] * (N + 1)
for i in range(N):
s[i + 1] = s[i] + lst[i + 1]
# print (lst)
# print (s)
def check(x, k):
i = bisect_left(lst, x... | 34 | 30 | 599 | 524 | from bisect import bisect_left
N = int(eval(input()))
A = list(map(int, input().split()))
lst = [0] * (N + 1)
for a in A:
lst[a - 1] += 1
lst.sort() # 頻度列
s = [0] * (N + 1)
for i in range(N):
s[i + 1] = s[i] + lst[i + 1]
# print (lst)
# print (s)
def check(x, k):
i = bisect_left(lst, x) - 1
total = x ... | from bisect import bisect_left
N = int(eval(input()))
A = list(map(int, input().split()))
lst = [0] * (N + 1)
for a in A:
lst[a - 1] += 1
lst.sort() # 頻度列
s = [0] * (N + 1)
for i in range(N):
s[i + 1] = s[i] + lst[i + 1]
# print (lst)
# print (s)
def check(x, k):
i = bisect_left(lst, x) - 1
total = x ... | false | 11.764706 | [
"+ans = N",
"- l = 0 # OK",
"- r = N // k + 1 # NG",
"- while l + 1 < r:",
"- c = (l + r) // 2",
"- if check(c, k):",
"- l = c",
"- else:",
"- r = c",
"- print(l)",
"+ while True:",
"+ if check(ans, k):",
"+ break"... | false | 0.045129 | 0.093765 | 0.481295 | [
"s318399680",
"s205237999"
] |
u724687935 | p03078 | python | s328902965 | s151397145 | 355 | 281 | 56,792 | 48,864 | Accepted | Accepted | 20.85 | from heapq import heappush, heappop
X, Y, Z, K = map(int, input().split())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
C = list(map(int, input().split()))
A.sort(reverse=True)
B.sort(reverse=True)
C.sort(reverse=True)
q = []
x = y = z = 0
heappush(q, (-(A[x] + B[y] + C[z]), (x,... | X, Y, Z, K = map(int, input().split())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
C = list(map(int, input().split()))
A.sort(reverse=True)
B.sort(reverse=True)
C.sort(reverse=True)
ans = []
for x in range(X):
for y in range(Y):
for z in range(Z):
if (x +... | 25 | 19 | 735 | 493 | from heapq import heappush, heappop
X, Y, Z, K = map(int, input().split())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
C = list(map(int, input().split()))
A.sort(reverse=True)
B.sort(reverse=True)
C.sort(reverse=True)
q = []
x = y = z = 0
heappush(q, (-(A[x] + B[y] + C[z]), (x, y, z)))
done... | X, Y, Z, K = map(int, input().split())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
C = list(map(int, input().split()))
A.sort(reverse=True)
B.sort(reverse=True)
C.sort(reverse=True)
ans = []
for x in range(X):
for y in range(Y):
for z in range(Z):
if (x + 1) * (y + 1)... | false | 24 | [
"-from heapq import heappush, heappop",
"-",
"-q = []",
"-x = y = z = 0",
"-heappush(q, (-(A[x] + B[y] + C[z]), (x, y, z)))",
"-done = set((0, 0, 0))",
"-for _ in range(K):",
"- val, (x, y, z) = heappop(q)",
"- ans.append(-val)",
"- for i, j, k in [(1, 0, 0), (0, 1, 0), (0, 0, 1)]:",
"-... | false | 0.045413 | 0.04486 | 1.012328 | [
"s328902965",
"s151397145"
] |
u047796752 | p02833 | python | s671113009 | s861269337 | 181 | 165 | 38,256 | 38,384 | Accepted | Accepted | 8.84 | N = int(eval(input()))
if N%2==1:
print((0))
exit()
two, five = 0, 0
for i in range(1, 100):
two += N//2**i
for i in range(1, 100):
five += N//(2*5**i)
print((min(two, five))) | N = int(eval(input()))
if N%2==1:
print((0))
exit()
two = 0
p = 1
while 2**p<=N:
two += N//2**p
p += 1
five = 0
p = 1
while 2*5**p<=N:
five += N//(2*5**p)
p += 1
print((min(two, five))) | 15 | 21 | 204 | 229 | N = int(eval(input()))
if N % 2 == 1:
print((0))
exit()
two, five = 0, 0
for i in range(1, 100):
two += N // 2**i
for i in range(1, 100):
five += N // (2 * 5**i)
print((min(two, five)))
| N = int(eval(input()))
if N % 2 == 1:
print((0))
exit()
two = 0
p = 1
while 2**p <= N:
two += N // 2**p
p += 1
five = 0
p = 1
while 2 * 5**p <= N:
five += N // (2 * 5**p)
p += 1
print((min(two, five)))
| false | 28.571429 | [
"-two, five = 0, 0",
"-for i in range(1, 100):",
"- two += N // 2**i",
"-for i in range(1, 100):",
"- five += N // (2 * 5**i)",
"+two = 0",
"+p = 1",
"+while 2**p <= N:",
"+ two += N // 2**p",
"+ p += 1",
"+five = 0",
"+p = 1",
"+while 2 * 5**p <= N:",
"+ five += N // (2 * 5... | false | 0.080873 | 0.079361 | 1.01905 | [
"s671113009",
"s861269337"
] |
u343977188 | p02971 | python | s220729993 | s261756634 | 580 | 520 | 14,800 | 14,672 | Accepted | Accepted | 10.34 | import copy
N=int(eval(input()))
A=[int(eval(input())) for _ in range(N)]
a=max(A)
k=A.count(a)#リストの最大数の個数をカウント
if k>=2:
for i in range(N):
print(a)
else:
b=A.index(a)
for i in range(N):
if i != b:
print(a)
else:
s=sorted(A)
print((s[N-2])) | import copy
def main():
N=int(eval(input()))
A=[int(eval(input())) for _ in range(N)]
a=max(A)
k=A.count(a)#リストの最大数の個数をカウント
if k>=2:
for i in range(N):
print(a)
else:
b=A.index(a)
for i in range(N):
if i != b:
print(a)
else:
s=sorted(A)
... | 17 | 22 | 279 | 366 | import copy
N = int(eval(input()))
A = [int(eval(input())) for _ in range(N)]
a = max(A)
k = A.count(a) # リストの最大数の個数をカウント
if k >= 2:
for i in range(N):
print(a)
else:
b = A.index(a)
for i in range(N):
if i != b:
print(a)
else:
s = sorted(A)
print... | import copy
def main():
N = int(eval(input()))
A = [int(eval(input())) for _ in range(N)]
a = max(A)
k = A.count(a) # リストの最大数の個数をカウント
if k >= 2:
for i in range(N):
print(a)
else:
b = A.index(a)
for i in range(N):
if i != b:
print... | false | 22.727273 | [
"-N = int(eval(input()))",
"-A = [int(eval(input())) for _ in range(N)]",
"-a = max(A)",
"-k = A.count(a) # リストの最大数の個数をカウント",
"-if k >= 2:",
"- for i in range(N):",
"- print(a)",
"-else:",
"- b = A.index(a)",
"- for i in range(N):",
"- if i != b:",
"+",
"+def main():"... | false | 0.046004 | 0.083457 | 0.551225 | [
"s220729993",
"s261756634"
] |
u133936772 | p02912 | python | s967423397 | s246392500 | 159 | 142 | 14,252 | 14,252 | Accepted | Accepted | 10.69 | f = lambda:list(map(int,input().split()))
_,m = f()
l = list([-x for x in f()])
import heapq as hq
hq.heapify(l)
for i in range(m):
p = -hq.heappop(l)//2
hq.heappush(l,-p)
print((-sum(l))) | f=lambda:input().split()
_,m=list(map(int,f()))
l=[-int(i) for i in f()]
from heapq import *
heapify(l)
for _ in range(m):
heappush(l,-(-heappop(l)//2))
print((-sum(l))) | 9 | 8 | 195 | 170 | f = lambda: list(map(int, input().split()))
_, m = f()
l = list([-x for x in f()])
import heapq as hq
hq.heapify(l)
for i in range(m):
p = -hq.heappop(l) // 2
hq.heappush(l, -p)
print((-sum(l)))
| f = lambda: input().split()
_, m = list(map(int, f()))
l = [-int(i) for i in f()]
from heapq import *
heapify(l)
for _ in range(m):
heappush(l, -(-heappop(l) // 2))
print((-sum(l)))
| false | 11.111111 | [
"-f = lambda: list(map(int, input().split()))",
"-_, m = f()",
"-l = list([-x for x in f()])",
"-import heapq as hq",
"+f = lambda: input().split()",
"+_, m = list(map(int, f()))",
"+l = [-int(i) for i in f()]",
"+from heapq import *",
"-hq.heapify(l)",
"-for i in range(m):",
"- p = -hq.heapp... | false | 0.050046 | 0.042767 | 1.170209 | [
"s967423397",
"s246392500"
] |
u499381410 | p02904 | python | s180085498 | s444863515 | 738 | 568 | 127,308 | 75,552 | Accepted | Accepted | 23.04 | from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
import math
import bisect
import random
from itertools import permutations, accumulate, combinations, product
import sys
import string
from bisect import bisect_left, bisect_right
from math import factorial, ceil, ... | from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
import math
import bisect
import random
from itertools import permutations, accumulate, combinations, product
import sys
import string
from bisect import bisect_left, bisect_right
from math import factorial, ceil, ... | 105 | 99 | 2,821 | 2,880 | from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
import math
import bisect
import random
from itertools import permutations, accumulate, combinations, product
import sys
import string
from bisect import bisect_left, bisect_right
from math import factorial, ceil, floor
fro... | from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
import math
import bisect
import random
from itertools import permutations, accumulate, combinations, product
import sys
import string
from bisect import bisect_left, bisect_right
from math import factorial, ceil, floor
fro... | false | 5.714286 | [
"-from operator import mul",
"-INF = float(\"inf\")",
"+sys.setrecursionlimit(2147483647)",
"+INF = 10**18",
"- return list(map(int, sys.stdin.readline().split()))",
"+ return list(map(int, sys.stdin.buffer.readline().split()))",
"- return int(sys.stdin.readline())",
"+ return int(sys.stdi... | false | 0.068303 | 0.045823 | 1.490582 | [
"s180085498",
"s444863515"
] |
u450956662 | p02614 | python | s589247225 | s988223265 | 92 | 55 | 74,296 | 9,148 | Accepted | Accepted | 40.22 | from itertools import combinations
H, W, K = list(map(int, input().split()))
C = [eval(input()) for _ in range(H)]
ans = 0
for i in range(1 << H):
hs = []
for h in range(H):
if (i >> h) & 1:
hs.append(h)
for j in range(1 << W):
ws = []
for w in range(W):
... | from itertools import combinations
H, W, K = list(map(int, input().split()))
C = [eval(input()) for _ in range(H)]
res = 0
for i in range(1 << H):
for j in range(1 << W):
tmp = 0
for h in range(H):
if (i >> h) & 1:
continue
for w in range(W):
... | 26 | 17 | 645 | 459 | from itertools import combinations
H, W, K = list(map(int, input().split()))
C = [eval(input()) for _ in range(H)]
ans = 0
for i in range(1 << H):
hs = []
for h in range(H):
if (i >> h) & 1:
hs.append(h)
for j in range(1 << W):
ws = []
for w in range(W):
if (... | from itertools import combinations
H, W, K = list(map(int, input().split()))
C = [eval(input()) for _ in range(H)]
res = 0
for i in range(1 << H):
for j in range(1 << W):
tmp = 0
for h in range(H):
if (i >> h) & 1:
continue
for w in range(W):
... | false | 34.615385 | [
"-ans = 0",
"+res = 0",
"- hs = []",
"- for h in range(H):",
"- if (i >> h) & 1:",
"- hs.append(h)",
"- ws = []",
"- for w in range(W):",
"- if (j >> w) & 1:",
"- ws.append(w)",
"- if h in hs:",
"+ if (i >> h... | false | 0.036625 | 0.036793 | 0.995449 | [
"s589247225",
"s988223265"
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.