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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
u312025627 | p03549 | python | s524647864 | s498739881 | 184 | 167 | 39,024 | 38,384 | Accepted | Accepted | 9.24 | def main():
N, M = (int(i) for i in input().split())
p = (0.5)**M
np = 1 - p
t = (1900*M + 100*(N-M))
ans = 0
for i in range(1, 10**5)[::-1]:
ans += i*t*p*(np**(i-1))
print((round(ans)))
if __name__ == '__main__':
main()
| def main():
N, M = (int(i) for i in input().split())
t = 1900*M + 100*(N-M)
p = 2**M
print((t*p))
if __name__ == '__main__':
main()
| 13 | 9 | 273 | 160 | def main():
N, M = (int(i) for i in input().split())
p = (0.5) ** M
np = 1 - p
t = 1900 * M + 100 * (N - M)
ans = 0
for i in range(1, 10**5)[::-1]:
ans += i * t * p * (np ** (i - 1))
print((round(ans)))
if __name__ == "__main__":
main()
| def main():
N, M = (int(i) for i in input().split())
t = 1900 * M + 100 * (N - M)
p = 2**M
print((t * p))
if __name__ == "__main__":
main()
| false | 30.769231 | [
"- p = (0.5) ** M",
"- np = 1 - p",
"- ans = 0",
"- for i in range(1, 10**5)[::-1]:",
"- ans += i * t * p * (np ** (i - 1))",
"- print((round(ans)))",
"+ p = 2**M",
"+ print((t * p))"
] | false | 0.060016 | 0.043571 | 1.377428 | [
"s524647864",
"s498739881"
] |
u599547273 | p03854 | python | s331680599 | s046904675 | 124 | 77 | 3,188 | 3,316 | Accepted | Accepted | 37.9 | import sys
def text_match_word(text, words):
for word in words:
if word == text[:len(word)]:
return word
words_next = (("dream", "er"), ("erase", "r"))
words_next_dict = dict(words_next)
s = eval(input())
before_match_word = ""
while "" != s:
search_words = list(words_next_... | s = eval(input())
while s != "":
is_match = False
for word in ("dream", "dreamer", "erase", "eraser"):
if s[-len(word):] == word:
s = s[:-len(word)]
is_match = True
if is_match == False:
print("NO")
exit()
print("YES") | 27 | 12 | 663 | 239 | import sys
def text_match_word(text, words):
for word in words:
if word == text[: len(word)]:
return word
words_next = (("dream", "er"), ("erase", "r"))
words_next_dict = dict(words_next)
s = eval(input())
before_match_word = ""
while "" != s:
search_words = list(words_next_dict.keys())
... | s = eval(input())
while s != "":
is_match = False
for word in ("dream", "dreamer", "erase", "eraser"):
if s[-len(word) :] == word:
s = s[: -len(word)]
is_match = True
if is_match == False:
print("NO")
exit()
print("YES")
| false | 55.555556 | [
"-import sys",
"-",
"-",
"-def text_match_word(text, words):",
"- for word in words:",
"- if word == text[: len(word)]:",
"- return word",
"-",
"-",
"-words_next = ((\"dream\", \"er\"), (\"erase\", \"r\"))",
"-words_next_dict = dict(words_next)",
"-before_match_word = \"\"... | false | 0.031836 | 0.041256 | 0.771673 | [
"s331680599",
"s046904675"
] |
u994521204 | p02792 | python | s746332383 | s902934504 | 177 | 163 | 3,064 | 3,064 | Accepted | Accepted | 7.91 | n=int(eval(input()))
def kazu(a):
return (a%10, int(str(a)[0]))
cnt=[[0]*10 for i in range(10)]
for i in range(1,n+1):
p,q=kazu(i)
cnt[p][q]+=1
ans=0
for i in range(1,10):
for j in range(1,10):
ans+=cnt[i][j]*cnt[j][i]
print(ans) | s = eval(input())
n = int(s)
keta = len(s)
cnt = [[0] * (10) for _ in range(10)]
for i in range(1, n + 1):
a = int(str(i)[0])
b = i % 10
cnt[a][b] += 1
ans = 0
for i in range(1, 10):
for j in range(1, 10):
ans += cnt[i][j] * cnt[j][i]
print(ans)
| 12 | 13 | 258 | 276 | n = int(eval(input()))
def kazu(a):
return (a % 10, int(str(a)[0]))
cnt = [[0] * 10 for i in range(10)]
for i in range(1, n + 1):
p, q = kazu(i)
cnt[p][q] += 1
ans = 0
for i in range(1, 10):
for j in range(1, 10):
ans += cnt[i][j] * cnt[j][i]
print(ans)
| s = eval(input())
n = int(s)
keta = len(s)
cnt = [[0] * (10) for _ in range(10)]
for i in range(1, n + 1):
a = int(str(i)[0])
b = i % 10
cnt[a][b] += 1
ans = 0
for i in range(1, 10):
for j in range(1, 10):
ans += cnt[i][j] * cnt[j][i]
print(ans)
| false | 7.692308 | [
"-n = int(eval(input()))",
"-",
"-",
"-def kazu(a):",
"- return (a % 10, int(str(a)[0]))",
"-",
"-",
"-cnt = [[0] * 10 for i in range(10)]",
"+s = eval(input())",
"+n = int(s)",
"+keta = len(s)",
"+cnt = [[0] * (10) for _ in range(10)]",
"- p, q = kazu(i)",
"- cnt[p][q] += 1",
"... | false | 0.061312 | 0.044071 | 1.391221 | [
"s746332383",
"s902934504"
] |
u193182854 | p03722 | python | s016473246 | s747347020 | 399 | 343 | 48,748 | 46,440 | Accepted | Accepted | 14.04 | n, m = list(map(int, input().split()))
edges = [None] * m
for i in range(m):
a, b, c = list(map(int, input().split()))
edges[i] = (a-1, b-1, -c)
INF = float("inf")
d = [INF] * n
d[0] = 0
for i in range(n-1):
for f, t, c in edges:
if d[f] == INF: continue
d[t] = min(d[t], d[f... | INF = float("inf")
def bellman_ford(edges, n, s):
d = [0] + [INF] * (n-1)
for i in range(n):
for f, t, c in edges:
if d[f] == INF: continue
if d[t] > d[f] + c:
if i == n-1: d[t] = -INF
else: d[t] = d[f] + c
for i in range(n):
... | 28 | 24 | 625 | 624 | n, m = list(map(int, input().split()))
edges = [None] * m
for i in range(m):
a, b, c = list(map(int, input().split()))
edges[i] = (a - 1, b - 1, -c)
INF = float("inf")
d = [INF] * n
d[0] = 0
for i in range(n - 1):
for f, t, c in edges:
if d[f] == INF:
continue
d[t] = min(d[t], d[... | INF = float("inf")
def bellman_ford(edges, n, s):
d = [0] + [INF] * (n - 1)
for i in range(n):
for f, t, c in edges:
if d[f] == INF:
continue
if d[t] > d[f] + c:
if i == n - 1:
d[t] = -INF
else:
... | false | 14.285714 | [
"+INF = float(\"inf\")",
"+",
"+",
"+def bellman_ford(edges, n, s):",
"+ d = [0] + [INF] * (n - 1)",
"+ for i in range(n):",
"+ for f, t, c in edges:",
"+ if d[f] == INF:",
"+ continue",
"+ if d[t] > d[f] + c:",
"+ if i == n - 1:",... | false | 0.043834 | 0.043713 | 1.002749 | [
"s016473246",
"s747347020"
] |
u327466606 | p03676 | python | s489021963 | s508108791 | 580 | 237 | 13,812 | 13,812 | Accepted | Accepted | 59.14 | MOD = 10**9 + 7
def egcd(a, b):
if a == 0:
return (b, 0, 1)
else:
g, y, x = egcd(b % a, a)
return (g, x - (b // a) * y, y)
def modinv(a, m):
g, x, y = egcd(a, m)
if g != 1:
raise Exception('modular inverse does not exist')
else:
return x % m
... | MOD = 10**9 + 7
def egcd(a, b):
if a == 0:
return (b, 0, 1)
else:
g, y, x = egcd(b % a, a)
return (g, x - (b // a) * y, y)
def modinv(a, m):
g, x, y = egcd(a, m)
if g != 1:
raise Exception('modular inverse does not exist')
else:
return x % m
... | 39 | 57 | 662 | 946 | MOD = 10**9 + 7
def egcd(a, b):
if a == 0:
return (b, 0, 1)
else:
g, y, x = egcd(b % a, a)
return (g, x - (b // a) * y, y)
def modinv(a, m):
g, x, y = egcd(a, m)
if g != 1:
raise Exception("modular inverse does not exist")
else:
return x % m
n = int(eval... | MOD = 10**9 + 7
def egcd(a, b):
if a == 0:
return (b, 0, 1)
else:
g, y, x = egcd(b % a, a)
return (g, x - (b // a) * y, y)
def modinv(a, m):
g, x, y = egcd(a, m)
if g != 1:
raise Exception("modular inverse does not exist")
else:
return x % m
n = int(eval... | false | 31.578947 | [
"-temp = [None] * n",
"+temp = [None] * (n + 2)",
"-s = n + 1",
"-t = 1",
"-print(n)",
"-ik = 1",
"-for k in range(n):",
"- t *= (m - k) * ik",
"- t %= MOD",
"- ik = modinv(k + 2, MOD)",
"- s *= (n - k) * ik",
"- s %= MOD",
"+b = 1",
"+for i in range(2, m + 1):",
"+ b *... | false | 0.04444 | 0.040837 | 1.08823 | [
"s489021963",
"s508108791"
] |
u514118270 | p03438 | python | s231155897 | s582173111 | 127 | 107 | 77,804 | 78,028 | Accepted | Accepted | 15.75 | import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
def s(): return eval(input())
def i(): return int(eval(input()))
def S(): return input().split()
def I(): return list(map(int,input().split()))
def L(): return list(in... | import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
def s(): return eval(input())
def i(): return int(eval(input()))
def S(): return input().split()
def I(): return list(map(int,input().split()))
def L(): return list(in... | 32 | 32 | 719 | 726 | import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque, Counter
from decimal import Decimal
def s():
return eval(input())
def i():
return int(eval(input()))
def S():
return input().split()
def I():
return list(map(int, input().split()))
def L(... | import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque, Counter
from decimal import Decimal
def s():
return eval(input())
def i():
return int(eval(input()))
def S():
return input().split()
def I():
return list(map(int, input().split()))
def L(... | false | 0 | [
"- cnt2 += (b[i] - a[i] - 1) // 2 + 1",
"+ cnt2 += math.ceil((b[i] - a[i]) / 2)"
] | false | 0.037473 | 0.039667 | 0.944675 | [
"s231155897",
"s582173111"
] |
u263830634 | p03450 | python | s164543953 | s752476577 | 924 | 808 | 65,940 | 65,944 | Accepted | Accepted | 12.55 | import sys
input = sys.stdin.readline
N, M = list(map(int, input().split()))
graph = [[] for _ in range(N + 1)]
for _ in range(M):
L, R, D = list(map(int, input().split()))
graph[L].append((R, D))
graph[R].append((L, -D))
d = ['a'] * (N + 1)
def calc(start): #startからの連結成分をチェックする
d[star... | import sys
input = sys.stdin.readline
N, M = list(map(int, input().split()))
graph = [[] for _ in range(N + 1)]
for _ in range(M):
L, R, D = list(map(int, input().split()))
graph[L].append((R, D))
graph[R].append((L, -D))
d = [None] * (N + 1)
def calc(start): #startからの連結成分をチェックする
d[sta... | 37 | 37 | 849 | 852 | import sys
input = sys.stdin.readline
N, M = list(map(int, input().split()))
graph = [[] for _ in range(N + 1)]
for _ in range(M):
L, R, D = list(map(int, input().split()))
graph[L].append((R, D))
graph[R].append((L, -D))
d = ["a"] * (N + 1)
def calc(start): # startからの連結成分をチェックする
d[start] = 0
st... | import sys
input = sys.stdin.readline
N, M = list(map(int, input().split()))
graph = [[] for _ in range(N + 1)]
for _ in range(M):
L, R, D = list(map(int, input().split()))
graph[L].append((R, D))
graph[R].append((L, -D))
d = [None] * (N + 1)
def calc(start): # startからの連結成分をチェックする
d[start] = 0
s... | false | 0 | [
"-d = [\"a\"] * (N + 1)",
"+d = [None] * (N + 1)",
"- if d[next_] == \"a\":",
"+ if d[next_] == None:",
"- if d[i] == \"a\":",
"+ if d[i] == None:"
] | false | 0.042626 | 0.041216 | 1.034203 | [
"s164543953",
"s752476577"
] |
u072053884 | p02315 | python | s474849596 | s635817597 | 350 | 180 | 8,356 | 6,484 | Accepted | Accepted | 48.57 | import sys
def solve():
file_input = sys.stdin
N, W = list(map(int, file_input.readline().split()))
C = [0] * (W + 1)
for line in file_input:
item_v, item_w = list(map(int, line.split()))
for i, vals in enumerate(zip(C[item_w:], C)):
v1, v2 = vals
C[i] ... | import sys
def solve():
file_input = sys.stdin
N, W = list(map(int, file_input.readline().split()))
C = [0] * (W + 1)
for line in file_input:
item_v, item_w = list(map(int, line.split()))
for i, vals in enumerate(zip(C[item_w:], C)):
v1, v2 = vals
v1 +=... | 14 | 16 | 358 | 396 | import sys
def solve():
file_input = sys.stdin
N, W = list(map(int, file_input.readline().split()))
C = [0] * (W + 1)
for line in file_input:
item_v, item_w = list(map(int, line.split()))
for i, vals in enumerate(zip(C[item_w:], C)):
v1, v2 = vals
C[i] = max(v1 ... | import sys
def solve():
file_input = sys.stdin
N, W = list(map(int, file_input.readline().split()))
C = [0] * (W + 1)
for line in file_input:
item_v, item_w = list(map(int, line.split()))
for i, vals in enumerate(zip(C[item_w:], C)):
v1, v2 = vals
v1 += item_v
... | false | 12.5 | [
"- C[i] = max(v1 + item_v, v2)",
"+ v1 += item_v",
"+ if v1 > v2:",
"+ C[i] = v1"
] | false | 0.040472 | 0.036969 | 1.094772 | [
"s474849596",
"s635817597"
] |
u989345508 | p02579 | python | s553299534 | s462748817 | 1,040 | 796 | 123,056 | 119,232 | Accepted | Accepted | 23.46 | #辺の重み(変化量)が0である場合は01DFSって特別なやつ
#0の場合はそこでBFSできる
import sys
from collections import deque
sys.setrecursionlimit(10**7)
input=sys.stdin.readline
h,w=list(map(int,input().split()))
c=[int(i)-1 for i in input().split()]
d=[int(i)-1 for i in input().split()]
s=[eval(input()) for i in range(h)]
inf=100000000
dp=[[-... | #辺の重み(変化量)が0である場合は01DFSって特別なやつ
#0の場合はそこでBFSできる
import sys
from collections import deque
sys.setrecursionlimit(10**7)
input=sys.stdin.readline
h,w=list(map(int,input().split()))
c=[int(i)-1 for i in input().split()]
d=[int(i)-1 for i in input().split()]
s=[eval(input()) for i in range(h)]
inf=100000000
dp=[[-... | 47 | 33 | 1,578 | 1,113 | # 辺の重み(変化量)が0である場合は01DFSって特別なやつ
# 0の場合はそこでBFSできる
import sys
from collections import deque
sys.setrecursionlimit(10**7)
input = sys.stdin.readline
h, w = list(map(int, input().split()))
c = [int(i) - 1 for i in input().split()]
d = [int(i) - 1 for i in input().split()]
s = [eval(input()) for i in range(h)]
inf = 100000... | # 辺の重み(変化量)が0である場合は01DFSって特別なやつ
# 0の場合はそこでBFSできる
import sys
from collections import deque
sys.setrecursionlimit(10**7)
input = sys.stdin.readline
h, w = list(map(int, input().split()))
c = [int(i) - 1 for i in input().split()]
d = [int(i) - 1 for i in input().split()]
s = [eval(input()) for i in range(h)]
inf = 100000... | false | 29.787234 | [
"- if i > 0:",
"- if dp[i - 1][j] != -1:",
"- if dp[i - 1][j] > dp[i][j]:",
"- dp[i - 1][j] = dp[i][j]",
"- now.appendleft([i - 1, j])",
"- if j > 0:",
"- if dp[i][j - 1] != -1:",
"- if dp[i][j - 1]... | false | 0.036432 | 0.037265 | 0.977641 | [
"s553299534",
"s462748817"
] |
u210545407 | p02613 | python | s195082487 | s468176607 | 159 | 139 | 16,040 | 16,108 | Accepted | Accepted | 12.58 | #init
N = int(eval(input()))
S=[]
for _ in range(N):
S.append(eval(input()))
score=[0]*4
for _ in S:
if _=='AC':
score[0]=score[0]+1
if _=='WA':
score[1]=score[1]+1
if _=='TLE':
score[2]=score[2]+1
if _=='RE':
score[3]=score[3]+1
print(('AC x {0}'.format(score[0])))
print... | #init
N = int(eval(input()))
S=[eval(input()) for i in range(N)]
for word in ['AC', 'WA', 'TLE', 'RE']:
print(('{0} x {1}'.format(word, S.count(word)))) | 20 | 5 | 408 | 144 | # init
N = int(eval(input()))
S = []
for _ in range(N):
S.append(eval(input()))
score = [0] * 4
for _ in S:
if _ == "AC":
score[0] = score[0] + 1
if _ == "WA":
score[1] = score[1] + 1
if _ == "TLE":
score[2] = score[2] + 1
if _ == "RE":
score[3] = score[3] + 1
print((... | # init
N = int(eval(input()))
S = [eval(input()) for i in range(N)]
for word in ["AC", "WA", "TLE", "RE"]:
print(("{0} x {1}".format(word, S.count(word))))
| false | 75 | [
"-S = []",
"-for _ in range(N):",
"- S.append(eval(input()))",
"-score = [0] * 4",
"-for _ in S:",
"- if _ == \"AC\":",
"- score[0] = score[0] + 1",
"- if _ == \"WA\":",
"- score[1] = score[1] + 1",
"- if _ == \"TLE\":",
"- score[2] = score[2] + 1",
"- if _ ... | false | 0.136901 | 0.038886 | 3.520526 | [
"s195082487",
"s468176607"
] |
u254871849 | p03732 | python | s976451581 | s229232800 | 1,594 | 177 | 99,696 | 3,064 | Accepted | Accepted | 88.9 | import sys
n, W = list(map(int, sys.stdin.readline().split()))
wv = list(map(int, sys.stdin.read().split()))
wv = sorted(zip(*[wv] * 2))
min_w = wv[0][0]
W2 = 4 * n
def main():
dp = [[[0] * (W2 + 1) for _ in range(n+1)] for _ in range(n+1)]
for i in range(n):
w, v = wv[i]
w... | import sys
from itertools import accumulate
n, W, *wv = list(map(int, sys.stdin.read().split()))
wv = list(zip(*[iter(wv)] * 2))
def main():
wv.sort(key=lambda x: x[0])
min_w = wv[0][0]
items = [[] for _ in range(4)]
for w, v in wv:
items[w-min_w].append(v)
for i ... | 32 | 41 | 761 | 981 | import sys
n, W = list(map(int, sys.stdin.readline().split()))
wv = list(map(int, sys.stdin.read().split()))
wv = sorted(zip(*[wv] * 2))
min_w = wv[0][0]
W2 = 4 * n
def main():
dp = [[[0] * (W2 + 1) for _ in range(n + 1)] for _ in range(n + 1)]
for i in range(n):
w, v = wv[i]
w -= min_w - 1
... | import sys
from itertools import accumulate
n, W, *wv = list(map(int, sys.stdin.read().split()))
wv = list(zip(*[iter(wv)] * 2))
def main():
wv.sort(key=lambda x: x[0])
min_w = wv[0][0]
items = [[] for _ in range(4)]
for w, v in wv:
items[w - min_w].append(v)
for i in range(4):
it... | false | 21.95122 | [
"+from itertools import accumulate",
"-n, W = list(map(int, sys.stdin.readline().split()))",
"-wv = list(map(int, sys.stdin.read().split()))",
"-wv = sorted(zip(*[wv] * 2))",
"-min_w = wv[0][0]",
"-W2 = 4 * n",
"+n, W, *wv = list(map(int, sys.stdin.read().split()))",
"+wv = list(zip(*[iter(wv)] * 2))"... | false | 0.040152 | 0.040401 | 0.993821 | [
"s976451581",
"s229232800"
] |
u915737443 | p02601 | python | s684381907 | s178812382 | 30 | 27 | 9,196 | 9,112 | Accepted | Accepted | 10 | A, B, C = list(map(int, input().split()))
K = int(eval(input()))
# C > B > A
for i in range(K):
if C >= B and B > A:
# C > B > A
C = C * 2
elif C >= A and A >= B:
# C > A >= B
B = B * 2
elif (
(A >= B and B >= C)
or (B >= A and A >= C)
... | A, B, C = list(map(int, input().split()))
K = int(eval(input()))
# C > B > A
for i in range(K):
if C >= A and A >= B:
# C >= A >= B
B = B * 2
else:
C = C * 2
if C > B and B > A:
print("Yes")
else:
print("No") | 25 | 16 | 509 | 254 | A, B, C = list(map(int, input().split()))
K = int(eval(input()))
# C > B > A
for i in range(K):
if C >= B and B > A:
# C > B > A
C = C * 2
elif C >= A and A >= B:
# C > A >= B
B = B * 2
elif (
(A >= B and B >= C)
or (B >= A and A >= C)
or (A >= C and C... | A, B, C = list(map(int, input().split()))
K = int(eval(input()))
# C > B > A
for i in range(K):
if C >= A and A >= B:
# C >= A >= B
B = B * 2
else:
C = C * 2
if C > B and B > A:
print("Yes")
else:
print("No")
| false | 36 | [
"- if C >= B and B > A:",
"- # C > B > A",
"- C = C * 2",
"- elif C >= A and A >= B:",
"- # C > A >= B",
"+ if C >= A and A >= B:",
"+ # C >= A >= B",
"- elif (",
"- (A >= B and B >= C)",
"- or (B >= A and A >= C)",
"- or (A >= C and C... | false | 0.046151 | 0.048059 | 0.960298 | [
"s684381907",
"s178812382"
] |
u934442292 | p02773 | python | s831210095 | s344851381 | 476 | 408 | 45,140 | 35,936 | Accepted | Accepted | 14.29 | import sys
from collections import Counter
input = sys.stdin.readline
def main():
N = int(input())
S = [""] * N
for i in range(N):
S[i] = input().rstrip()
c = Counter(S)
ans = []
prev_v = 0
for k, v in c.most_common():
if prev_v == 0:
prev_v =... | import sys
from collections import Counter
input = sys.stdin.readline
def main():
N = int(input())
S = [""] * N
for i in range(N):
S[i] = input().rstrip()
c = Counter(S)
ans = []
max_v = max(c.values())
for k, v in c.items():
if v == max_v:
an... | 29 | 25 | 502 | 421 | import sys
from collections import Counter
input = sys.stdin.readline
def main():
N = int(input())
S = [""] * N
for i in range(N):
S[i] = input().rstrip()
c = Counter(S)
ans = []
prev_v = 0
for k, v in c.most_common():
if prev_v == 0:
prev_v = v
else:
... | import sys
from collections import Counter
input = sys.stdin.readline
def main():
N = int(input())
S = [""] * N
for i in range(N):
S[i] = input().rstrip()
c = Counter(S)
ans = []
max_v = max(c.values())
for k, v in c.items():
if v == max_v:
ans.append(k)
an... | false | 13.793103 | [
"- prev_v = 0",
"- for k, v in c.most_common():",
"- if prev_v == 0:",
"- prev_v = v",
"- else:",
"- if prev_v != v:",
"- break",
"- ans.append(k)",
"+ max_v = max(c.values())",
"+ for k, v in c.items():",
"+ if v == ma... | false | 0.036246 | 0.035876 | 1.010315 | [
"s831210095",
"s344851381"
] |
u737321654 | p03739 | python | s919392380 | s849761999 | 233 | 140 | 14,332 | 14,468 | Accepted | Accepted | 39.91 | N = int(eval(input()))
A = list(map(int, input().split()))
currentSum = 0
count1 = 0
count2 = 0
count3 = 0
count4 = 0
for i in range(N):
restSum = currentSum
currentSum += A[i]
if currentSum <= 0 and restSum < 0:
count1 += abs(currentSum) + 1
currentSum = 1
elif currentSum... | N = int(eval(input()))
A = list(map(int, input().split()))
currentSum = 0
count3 = 0
count4 = 0
currentSum = 0
for i in range(N):
restSum = currentSum
currentSum += A[i]
if currentSum <= 0 and restSum < 0:
count3 += abs(currentSum) + 1
currentSum = 1
elif currentSum >= 0 an... | 64 | 35 | 1,742 | 941 | N = int(eval(input()))
A = list(map(int, input().split()))
currentSum = 0
count1 = 0
count2 = 0
count3 = 0
count4 = 0
for i in range(N):
restSum = currentSum
currentSum += A[i]
if currentSum <= 0 and restSum < 0:
count1 += abs(currentSum) + 1
currentSum = 1
elif currentSum >= 0 and restS... | N = int(eval(input()))
A = list(map(int, input().split()))
currentSum = 0
count3 = 0
count4 = 0
currentSum = 0
for i in range(N):
restSum = currentSum
currentSum += A[i]
if currentSum <= 0 and restSum < 0:
count3 += abs(currentSum) + 1
currentSum = 1
elif currentSum >= 0 and restSum > 0:... | false | 45.3125 | [
"-count1 = 0",
"-count2 = 0",
"-for i in range(N):",
"- restSum = currentSum",
"- currentSum += A[i]",
"- if currentSum <= 0 and restSum < 0:",
"- count1 += abs(currentSum) + 1",
"- currentSum = 1",
"- elif currentSum >= 0 and restSum > 0:",
"- count1 += abs(curren... | false | 0.075442 | 0.114603 | 0.658293 | [
"s919392380",
"s849761999"
] |
u274126492 | p02619 | python | s868082298 | s426999408 | 123 | 34 | 9,344 | 9,352 | Accepted | Accepted | 72.36 |
def read_input():
D = int(eval(input()))
C = input().split()
C = [int(i) for i in C]
S = [list(map(int, input().split())) for _ in range(D)]
T = [int(eval(input())) for _ in range(D)]
return D, C, S, T
def scoring(S, D, T, C):
res = []
last = [0 for _ in range(26)]
fi... | def read_input():
D = int(eval(input()))
C = input().split()
C = [int(i) for i in C]
S = [list(map(int, input().split())) for _ in range(D)]
T = [int(eval(input())) for _ in range(D)]
return D, C, S, T
def scoring(S, D, T, C):
res = []
last = [0 for _ in range(26)]
fina... | 30 | 27 | 724 | 630 | def read_input():
D = int(eval(input()))
C = input().split()
C = [int(i) for i in C]
S = [list(map(int, input().split())) for _ in range(D)]
T = [int(eval(input())) for _ in range(D)]
return D, C, S, T
def scoring(S, D, T, C):
res = []
last = [0 for _ in range(26)]
final = 0
fo... | def read_input():
D = int(eval(input()))
C = input().split()
C = [int(i) for i in C]
S = [list(map(int, input().split())) for _ in range(D)]
T = [int(eval(input())) for _ in range(D)]
return D, C, S, T
def scoring(S, D, T, C):
res = []
last = [0 for _ in range(26)]
final = 0
fo... | false | 10 | [
"+ last[T[i] - 1] = i + 1",
"- for loc, val in enumerate(T[: i + 1]):",
"- if val == j + 1:",
"- last[j] = loc + 1"
] | false | 0.081305 | 0.078567 | 1.034858 | [
"s868082298",
"s426999408"
] |
u314906167 | p02949 | python | s337433648 | s598970535 | 1,042 | 854 | 48,312 | 48,444 | Accepted | Accepted | 18.04 | N, M, P = list(map(int, input().split()))
ABC = []
for _ in range(M):
a, b, c = list(map(int, input().split()))
ABC.append((a - 1, b - 1, P - c))
inf = float("inf")
d = [inf] * N
d[0] = 0
# Bellman-Ford
for i in range(N):
for a, b, c in ABC:
if d[b] <= d[a] + c:
continu... | N, M, P = list(map(int, input().split()))
ABC = []
for _ in range(M):
a, b, c = list(map(int, input().split()))
ABC.append((a - 1, b - 1, P - c))
inf = float("inf")
d = [inf] * N
d[0] = 0
# Bellman-Ford
for i in range(N):
for a, b, c in ABC:
if d[b] <= d[a] + c:
continu... | 27 | 27 | 546 | 542 | N, M, P = list(map(int, input().split()))
ABC = []
for _ in range(M):
a, b, c = list(map(int, input().split()))
ABC.append((a - 1, b - 1, P - c))
inf = float("inf")
d = [inf] * N
d[0] = 0
# Bellman-Ford
for i in range(N):
for a, b, c in ABC:
if d[b] <= d[a] + c:
continue
d[b] = d... | N, M, P = list(map(int, input().split()))
ABC = []
for _ in range(M):
a, b, c = list(map(int, input().split()))
ABC.append((a - 1, b - 1, P - c))
inf = float("inf")
d = [inf] * N
d[0] = 0
# Bellman-Ford
for i in range(N):
for a, b, c in ABC:
if d[b] <= d[a] + c:
continue
d[b] = d... | false | 0 | [
"- d[b] = d[a] + c",
"+ d[b] = -inf"
] | false | 0.197318 | 0.100498 | 1.963391 | [
"s337433648",
"s598970535"
] |
u411203878 | p02585 | python | s554765426 | s355518998 | 507 | 371 | 75,456 | 80,716 | Accepted | Accepted | 26.82 | N,K = list(map(int,input().split()))
P = list(map(int,input().split()))
C = list(map(int,input().split()))
ans = -10000000000
if K <= N:
for i in range(N):
count = 0
tmp_point = 0
nv = i
while count < K:
nvv = P[nv]
nvv -= 1
tmp... | #ブログの模範解答（参考のため提出）
#https://marco-note.net/abc-175-work-log/
N, K = list(map(int, input().split()))
P = list(map(int, input().split()))
C = list(map(int, input().split()))
ans = -float('inf')
for s in range(N):
### Step1
S = [] # 累積和S. ただし, 初項は0ではなく1回目の移動後の得点とする.
# 1回目の移動
i = P[s] - 1
... | 62 | 42 | 1,462 | 1,101 | N, K = list(map(int, input().split()))
P = list(map(int, input().split()))
C = list(map(int, input().split()))
ans = -10000000000
if K <= N:
for i in range(N):
count = 0
tmp_point = 0
nv = i
while count < K:
nvv = P[nv]
nvv -= 1
tmp_point += C[nvv]... | # ブログの模範解答（参考のため提出）
# https://marco-note.net/abc-175-work-log/
N, K = list(map(int, input().split()))
P = list(map(int, input().split()))
C = list(map(int, input().split()))
ans = -float("inf")
for s in range(N):
### Step1
S = [] # 累積和S. ただし, 初項は0ではなく1回目の移動後の得点とする.
# 1回目の移動
i = P[s] - 1
S.append(C[... | false | 32.258065 | [
"+# ブログの模範解答（参考のため提出）",
"+# https://marco-note.net/abc-175-work-log/",
"-ans = -10000000000",
"-if K <= N:",
"- for i in range(N):",
"- count = 0",
"- tmp_point = 0",
"- nv = i",
"- while count < K:",
"- nvv = P[nv]",
"- nvv -= 1",
"- ... | false | 0.035103 | 0.037776 | 0.929252 | [
"s554765426",
"s355518998"
] |
u562935282 | p03157 | python | s193689960 | s152084528 | 599 | 395 | 189,428 | 34,508 | Accepted | Accepted | 34.06 | def main():
import sys
sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline
h, w = list(map(int, input().split()))
s = [input().rstrip() for _ in range(h)]
d = (1, 0), (-1, 0), (0, 1), (0, -1)
checked = [[False] * w for _ in range(h)]
def dfs(r, c):
sharp, d... | from functools import reduce
def main():
from functools import reduce
from operator import mul
import sys
sys.setrecursionlimit(10 ** 7)
def dfs(sr, sc):
d = {'.': 0, '#': 0}
q = [(sr, sc)]
while q:
r, c = q.pop()
if checked[r][c]:
... | 52 | 48 | 1,195 | 1,142 | def main():
import sys
sys.setrecursionlimit(10**7)
input = sys.stdin.readline
h, w = list(map(int, input().split()))
s = [input().rstrip() for _ in range(h)]
d = (1, 0), (-1, 0), (0, 1), (0, -1)
checked = [[False] * w for _ in range(h)]
def dfs(r, c):
sharp, dot = 0, 0
... | from functools import reduce
def main():
from functools import reduce
from operator import mul
import sys
sys.setrecursionlimit(10**7)
def dfs(sr, sc):
d = {".": 0, "#": 0}
q = [(sr, sc)]
while q:
r, c = q.pop()
if checked[r][c]:
co... | false | 7.692308 | [
"+from functools import reduce",
"+",
"+",
"+ from functools import reduce",
"+ from operator import mul",
"- input = sys.stdin.readline",
"+",
"+ def dfs(sr, sc):",
"+ d = {\".\": 0, \"#\": 0}",
"+ q = [(sr, sc)]",
"+ while q:",
"+ r, c = q.pop()",
... | false | 0.037532 | 0.116164 | 0.323098 | [
"s193689960",
"s152084528"
] |
u312025627 | p02762 | python | s074089106 | s026907969 | 1,131 | 940 | 126,624 | 117,792 | Accepted | Accepted | 16.89 | def main():
import sys
input = sys.stdin.buffer.readline
N, M, K = (int(i) for i in input().split())
par = [i for i in range(N)]
rank = [0 for i in range(N)]
def find_root(x):
if par[x] == x:
return x
else:
par[x] = find_root(par[x])
... | def main():
import sys
input = sys.stdin.buffer.readline
N, M, K = (int(i) for i in input().split())
par = [i for i in range(N)]
rank = [0 for i in range(N)]
def find_root(x):
if par[x] == x:
return x
else:
par[x] = find_root(par[x])
... | 55 | 51 | 1,454 | 1,335 | def main():
import sys
input = sys.stdin.buffer.readline
N, M, K = (int(i) for i in input().split())
par = [i for i in range(N)]
rank = [0 for i in range(N)]
def find_root(x):
if par[x] == x:
return x
else:
par[x] = find_root(par[x])
return p... | def main():
import sys
input = sys.stdin.buffer.readline
N, M, K = (int(i) for i in input().split())
par = [i for i in range(N)]
rank = [0 for i in range(N)]
def find_root(x):
if par[x] == x:
return x
else:
par[x] = find_root(par[x])
return p... | false | 7.272727 | [
"- fre = [set() for _ in range(N)]",
"- blo = [set() for _ in range(N)]",
"- mem = {i for i in range(N)}",
"+ edge = [set() for _ in range(N)]",
"- fre[a - 1].add(b - 1)",
"- fre[b - 1].add(a - 1)",
"+ edge[a - 1].add(b - 1)",
"+ edge[b - 1].add(a - 1)",
"- ... | false | 0.083464 | 0.007947 | 10.503015 | [
"s074089106",
"s026907969"
] |
u156815136 | p02678 | python | s625639092 | s501403058 | 760 | 659 | 38,924 | 40,028 | Accepted | Accepted | 13.29 | from collections import deque
q = deque([0])
def dfs():
while q:
v = q.popleft()
for nv in g[v]:
if p[nv] < 1:
p[nv] = v + 1
q.append(nv)
n,m = map(int,input().split())
g = [[] for _ in range(n)]
for _ in range(m):
a,b = map(lambda x:int(... | #from statistics import median
#import collections
#aa = collections.Counter(a) # list to list || .most_common(2)で最大の2個とりだせるお a[0][0]
from fractions import gcd
from itertools import combinations,permutations,accumulate # (string,3) 3回
#from collections import deque
from collections import deque,defaultdict,Counte... | 23 | 50 | 500 | 1,195 | from collections import deque
q = deque([0])
def dfs():
while q:
v = q.popleft()
for nv in g[v]:
if p[nv] < 1:
p[nv] = v + 1
q.append(nv)
n, m = map(int, input().split())
g = [[] for _ in range(n)]
for _ in range(m):
a, b = map(lambda x: int(x) - ... | # from statistics import median
# import collections
# aa = collections.Counter(a) # list to list || .most_common(2)で最大の2個とりだせるお a[0][0]
from fractions import gcd
from itertools import combinations, permutations, accumulate # (string,3) 3回
# from collections import deque
from collections import deque, defaultdict, Co... | false | 54 | [
"-from collections import deque",
"+# from statistics import median",
"+# import collections",
"+# aa = collections.Counter(a) # list to list || .most_common(2)で最大の2個とりだせるお a[0][0]",
"+from fractions import gcd",
"+from itertools import combinations, permutations, accumulate # (string,3) 3回",
"+# from ... | false | 0.047759 | 0.047507 | 1.005307 | [
"s625639092",
"s501403058"
] |
u644907318 | p03053 | python | s966696767 | s411465178 | 886 | 803 | 166,108 | 147,548 | Accepted | Accepted | 9.37 | from collections import deque
H,W = list(map(int,input().split()))
A = [list(input().strip()) for _ in range(H)]
que = deque([])
for i in range(H):
for j in range(W):
if A[i][j]=="#":
que.append((i,j,0))
tot = 0
while que:
i,j,cnt = que.popleft()
if j+1<W and A[i][j+1]==".":
... | from collections import deque
H,W = list(map(int,input().split()))
A = [input().strip() for _ in range(H)]
B = [[-1 for j in range(W)] for i in range(H)]
que = deque([])
for i in range(H):
for j in range(W):
if A[i][j]=="#":
B[i][j] = 0
que.append((i,j,0))
bmax = 0
while q... | 28 | 27 | 744 | 739 | from collections import deque
H, W = list(map(int, input().split()))
A = [list(input().strip()) for _ in range(H)]
que = deque([])
for i in range(H):
for j in range(W):
if A[i][j] == "#":
que.append((i, j, 0))
tot = 0
while que:
i, j, cnt = que.popleft()
if j + 1 < W and A[i][j + 1] == ... | from collections import deque
H, W = list(map(int, input().split()))
A = [input().strip() for _ in range(H)]
B = [[-1 for j in range(W)] for i in range(H)]
que = deque([])
for i in range(H):
for j in range(W):
if A[i][j] == "#":
B[i][j] = 0
que.append((i, j, 0))
bmax = 0
while que:
... | false | 3.571429 | [
"-A = [list(input().strip()) for _ in range(H)]",
"+A = [input().strip() for _ in range(H)]",
"+B = [[-1 for j in range(W)] for i in range(H)]",
"+ B[i][j] = 0",
"-tot = 0",
"+bmax = 0",
"- i, j, cnt = que.popleft()",
"- if j + 1 < W and A[i][j + 1] == \".\":",
"- A[i][j + 1]... | false | 0.049622 | 0.050202 | 0.988446 | [
"s966696767",
"s411465178"
] |
u238940874 | p02719 | python | s188771299 | s026447969 | 23 | 21 | 9,104 | 9,120 | Accepted | Accepted | 8.7 | n,k=list(map(int,input().split()))
print((min(n%k,abs(n%k-k)))) | n,k=list(map(int,input().split()))
print((min(n%k,k-n%k))) | 2 | 2 | 56 | 51 | n, k = list(map(int, input().split()))
print((min(n % k, abs(n % k - k))))
| n, k = list(map(int, input().split()))
print((min(n % k, k - n % k)))
| false | 0 | [
"-print((min(n % k, abs(n % k - k))))",
"+print((min(n % k, k - n % k)))"
] | false | 0.109441 | 0.13057 | 0.838184 | [
"s188771299",
"s026447969"
] |
u761529120 | p03805 | python | s199720340 | s748182897 | 37 | 34 | 3,064 | 3,064 | Accepted | Accepted | 8.11 | N, M = list(map(int, input().split()))
v = []
for i in range(M):
line = list(map(int, input().split()))
v.append([x - 1 for x in line])
conn = []
for _ in range(N):
conn.append([False] * N)
visited = [False] * N
for start, end in v:
conn[start][end] = conn[end][start] = True
def d... | N, M = list(map(int, input().split()))
d = [[False for i in range(N)] for i in range(N)]
visited = [False] * N
for i in range(M):
a, b = list(map(int, input().split()))
a -= 1
b -= 1
d[a][b] = True
d[b][a] = True
def dfs(now, depth):
if visited[now]:
return 0
if dep... | 35 | 30 | 604 | 538 | N, M = list(map(int, input().split()))
v = []
for i in range(M):
line = list(map(int, input().split()))
v.append([x - 1 for x in line])
conn = []
for _ in range(N):
conn.append([False] * N)
visited = [False] * N
for start, end in v:
conn[start][end] = conn[end][start] = True
def dfs(now, depth):
i... | N, M = list(map(int, input().split()))
d = [[False for i in range(N)] for i in range(N)]
visited = [False] * N
for i in range(M):
a, b = list(map(int, input().split()))
a -= 1
b -= 1
d[a][b] = True
d[b][a] = True
def dfs(now, depth):
if visited[now]:
return 0
if depth == N - 1:
... | false | 14.285714 | [
"-v = []",
"+d = [[False for i in range(N)] for i in range(N)]",
"+visited = [False] * N",
"- line = list(map(int, input().split()))",
"- v.append([x - 1 for x in line])",
"-conn = []",
"-for _ in range(N):",
"- conn.append([False] * N)",
"-visited = [False] * N",
"-for start, end in v:",... | false | 0.04299 | 0.043611 | 0.98576 | [
"s199720340",
"s748182897"
] |
u968166680 | p02689 | python | s276297836 | s925119451 | 305 | 158 | 29,404 | 20,148 | Accepted | Accepted | 48.2 | from sys import stdin, setrecursionlimit
setrecursionlimit(10 ** 9)
def input():
return stdin.readline().strip()
N, M = list(map(int, input().split()))
H = list(map(int, input().split()))
g = [list() for _ in range(N)]
for i in range(M):
a, b = list(map(int, input().split()))
a -= 1
b ... | from sys import stdin, setrecursionlimit
setrecursionlimit(10 ** 9)
def input():
return stdin.readline().strip()
N, M = list(map(int, input().split()))
H = list(map(int, input().split()))
ans = [True] * N
for _ in range(M):
a, b = list(map(int, input().split()))
a -= 1
b -= 1
if... | 28 | 25 | 506 | 471 | from sys import stdin, setrecursionlimit
setrecursionlimit(10**9)
def input():
return stdin.readline().strip()
N, M = list(map(int, input().split()))
H = list(map(int, input().split()))
g = [list() for _ in range(N)]
for i in range(M):
a, b = list(map(int, input().split()))
a -= 1
b -= 1
g[a].a... | from sys import stdin, setrecursionlimit
setrecursionlimit(10**9)
def input():
return stdin.readline().strip()
N, M = list(map(int, input().split()))
H = list(map(int, input().split()))
ans = [True] * N
for _ in range(M):
a, b = list(map(int, input().split()))
a -= 1
b -= 1
if H[a] < H[b]:
... | false | 10.714286 | [
"-g = [list() for _ in range(N)]",
"-for i in range(M):",
"+ans = [True] * N",
"+for _ in range(M):",
"- g[a].append(b)",
"- g[b].append(a)",
"-ans = 0",
"-for i in range(N):",
"- good = True",
"- for j in g[i]:",
"- if H[i] <= H[j]:",
"- good = False",
"- an... | false | 0.036349 | 0.041834 | 0.868898 | [
"s276297836",
"s925119451"
] |
u257162238 | p02579 | python | s370477895 | s817248395 | 770 | 322 | 136,708 | 88,740 | Accepted | Accepted | 58.18 | import sys
input = sys.stdin.readline
from collections import deque
import heapq
def read():
H, W = list(map(int, input().strip().split()))
CH, CW = list(map(int, input().strip().split()))
DH, DW = list(map(int, input().strip().split()))
S = [[0 for j in range(W)] for i in range(H)]
for... | import sys
input = sys.stdin.readline
from collections import deque
from itertools import product
import heapq
def read():
H, W = list(map(int, input().strip().split()))
CH, CW = list(map(int, input().strip().split()))
DH, DW = list(map(int, input().strip().split()))
S = [[0 for j in range(... | 82 | 59 | 2,391 | 1,744 | import sys
input = sys.stdin.readline
from collections import deque
import heapq
def read():
H, W = list(map(int, input().strip().split()))
CH, CW = list(map(int, input().strip().split()))
DH, DW = list(map(int, input().strip().split()))
S = [[0 for j in range(W)] for i in range(H)]
for i in rang... | import sys
input = sys.stdin.readline
from collections import deque
from itertools import product
import heapq
def read():
H, W = list(map(int, input().strip().split()))
CH, CW = list(map(int, input().strip().split()))
DH, DW = list(map(int, input().strip().split()))
S = [[0 for j in range(W)] for i ... | false | 28.04878 | [
"+from itertools import product",
"-def solve(H, W, CH, CW, DH, DW, S, INF=10**7):",
"- DIR = [(0, 1), (1, 0), (0, -1), (-1, 0)]",
"- # 島を作る",
"- id = 0",
"- for i in range(H):",
"- for j in range(W):",
"- if S[i][j] == -1:",
"- id += 1",
"- ... | false | 0.188974 | 0.163225 | 1.157747 | [
"s370477895",
"s817248395"
] |
u489959379 | p03221 | python | s423112350 | s238862759 | 985 | 796 | 41,748 | 43,444 | Accepted | Accepted | 19.19 | n, m = list(map(int, input().split()))
city = []
for i in range(m):
p, y = list(map(int, input().split()))
city.append([i + 1, p, y])
city = sorted(city, key=lambda x: [x[1], x[2]])
res = []
p, pp = 0, 0
cnt = 0
for i in range(m):
idx, p, _ = city[i]
if i == 0:
cnt = 1
p... | import sys
sys.setrecursionlimit(10 ** 7)
f_inf = float('inf')
mod = 10 ** 9 + 7
def resolve():
n, m = list(map(int, input().split()))
PY = []
for i in range(m):
p, y = list(map(int, input().split()))
PY.append([i, p, y])
PY = sorted(PY, key=lambda x: x[2])
PY = sort... | 28 | 37 | 553 | 762 | n, m = list(map(int, input().split()))
city = []
for i in range(m):
p, y = list(map(int, input().split()))
city.append([i + 1, p, y])
city = sorted(city, key=lambda x: [x[1], x[2]])
res = []
p, pp = 0, 0
cnt = 0
for i in range(m):
idx, p, _ = city[i]
if i == 0:
cnt = 1
pp = p
elif pp... | import sys
sys.setrecursionlimit(10**7)
f_inf = float("inf")
mod = 10**9 + 7
def resolve():
n, m = list(map(int, input().split()))
PY = []
for i in range(m):
p, y = list(map(int, input().split()))
PY.append([i, p, y])
PY = sorted(PY, key=lambda x: x[2])
PY = sorted(PY, key=lambda ... | false | 24.324324 | [
"-n, m = list(map(int, input().split()))",
"-city = []",
"-for i in range(m):",
"- p, y = list(map(int, input().split()))",
"- city.append([i + 1, p, y])",
"-city = sorted(city, key=lambda x: [x[1], x[2]])",
"-res = []",
"-p, pp = 0, 0",
"-cnt = 0",
"-for i in range(m):",
"- idx, p, _ =... | false | 0.037334 | 0.03908 | 0.955311 | [
"s423112350",
"s238862759"
] |
u515740713 | p03436 | python | s737310007 | s793402796 | 27 | 23 | 3,316 | 3,316 | Accepted | Accepted | 14.81 | import sys
from collections import deque
H,W=list(map(int,input().split()))
map = [[i for i in map(str,sys.stdin.readline().rstrip())] for _ in range(H)]
count_dot = 0
dist = [[0]*W for _ in range(H)]
for i in range(H):
for j in range(W):
if map[i][j] == '.':
count_dot +=1
def bfs():
while q:
... | import sys
from collections import deque
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
H, W = list(map(int,readline().split()))
grid = ['#']*(W+2)
for _ in range(H):
grid += ['#'] + list(map(str,readline().decode().rstrip())) + ['X']
grid += ['#']*(... | 31 | 34 | 769 | 712 | import sys
from collections import deque
H, W = list(map(int, input().split()))
map = [[i for i in map(str, sys.stdin.readline().rstrip())] for _ in range(H)]
count_dot = 0
dist = [[0] * W for _ in range(H)]
for i in range(H):
for j in range(W):
if map[i][j] == ".":
count_dot += 1
def bfs():
... | import sys
from collections import deque
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
H, W = list(map(int, readline().split()))
grid = ["#"] * (W + 2)
for _ in range(H):
grid += ["#"] + list(map(str, readline().decode().rstrip())) + ["X"]
grid += ["#"] * ... | false | 8.823529 | [
"-H, W = list(map(int, input().split()))",
"-map = [[i for i in map(str, sys.stdin.readline().rstrip())] for _ in range(H)]",
"-count_dot = 0",
"-dist = [[0] * W for _ in range(H)]",
"-for i in range(H):",
"- for j in range(W):",
"- if map[i][j] == \".\":",
"- count_dot += 1",
"... | false | 0.049609 | 0.048852 | 1.015495 | [
"s737310007",
"s793402796"
] |
u014333473 | p03598 | python | s209149622 | s669945765 | 30 | 26 | 9,180 | 9,116 | Accepted | Accepted | 13.33 | n,k=int(eval(input())),int(eval(input()));x=list(map(int,input().split()))
print((sum([min(i,j) for i,j in zip([abs(i*2) for i in x],[abs((i-k)*2) for i in x])]))) | n,k=int(eval(input())),int(eval(input()));print((sum([min(abs(i*2),abs((i-k)*2)) for i in list(map(int,input().split()))]))) | 2 | 1 | 150 | 110 | n, k = int(eval(input())), int(eval(input()))
x = list(map(int, input().split()))
print(
(
sum(
[
min(i, j)
for i, j in zip([abs(i * 2) for i in x], [abs((i - k) * 2) for i in x])
]
)
)
)
| n, k = int(eval(input())), int(eval(input()))
print(
(sum([min(abs(i * 2), abs((i - k) * 2)) for i in list(map(int, input().split()))]))
)
| false | 50 | [
"-x = list(map(int, input().split()))",
"- (",
"- sum(",
"- [",
"- min(i, j)",
"- for i, j in zip([abs(i * 2) for i in x], [abs((i - k) * 2) for i in x])",
"- ]",
"- )",
"- )",
"+ (sum([min(abs(i * 2), abs((i - k) * 2)) for... | false | 0.040915 | 0.039182 | 1.044237 | [
"s209149622",
"s669945765"
] |
u633068244 | p01143 | python | s277712431 | s744524788 | 50 | 20 | 4,220 | 4,204 | Accepted | Accepted | 60 | while 1:
n,m,p=list(map(int,input().split()))
if n==0:break
x=[eval(input()) for i in range(n)]
print((100-p)*sum(x)/x[m-1] if x[m-1]!=0 else 0) | while 1:
n,m,p=list(map(int,input().split()))
if n==0:break
x=[int(input()) for i in range(n)]
print((100-p)*sum(x)/x[m-1] if x[m-1]!=0 else 0) | 5 | 5 | 143 | 152 | while 1:
n, m, p = list(map(int, input().split()))
if n == 0:
break
x = [eval(input()) for i in range(n)]
print((100 - p) * sum(x) / x[m - 1] if x[m - 1] != 0 else 0)
| while 1:
n, m, p = list(map(int, input().split()))
if n == 0:
break
x = [int(input()) for i in range(n)]
print((100 - p) * sum(x) / x[m - 1] if x[m - 1] != 0 else 0)
| false | 0 | [
"- x = [eval(input()) for i in range(n)]",
"+ x = [int(input()) for i in range(n)]"
] | false | 0.092773 | 0.045246 | 2.050388 | [
"s277712431",
"s744524788"
] |
u043236471 | p03062 | python | s052675074 | s597349020 | 127 | 60 | 14,412 | 14,332 | Accepted | Accepted | 52.76 | N = int(eval(input()))
A = [int(x) for x in input().split()]
abs_list = sorted([abs(x) for x in A])[::-1]
for i in range(N-1):
if A[i] < 0:
A[i] *= -1
A[i+1] *= -1
if abs(min(A)) != min(abs_list):
A[A.index(min(A))] *= -1
A[A.index(min(abs_list))] *= -1
print((sum(A))) | # D
N = int(eval(input()))
A = [int(x) for x in input().split()]
minus_num = len([x for x in A if x < 0])
abs_list = [abs(x) for x in A]
if minus_num % 2:
print((sum(abs_list) - min(abs_list)*2))
else:
print((sum(abs_list))) | 15 | 11 | 311 | 234 | N = int(eval(input()))
A = [int(x) for x in input().split()]
abs_list = sorted([abs(x) for x in A])[::-1]
for i in range(N - 1):
if A[i] < 0:
A[i] *= -1
A[i + 1] *= -1
if abs(min(A)) != min(abs_list):
A[A.index(min(A))] *= -1
A[A.index(min(abs_list))] *= -1
print((sum(A)))
| # D
N = int(eval(input()))
A = [int(x) for x in input().split()]
minus_num = len([x for x in A if x < 0])
abs_list = [abs(x) for x in A]
if minus_num % 2:
print((sum(abs_list) - min(abs_list) * 2))
else:
print((sum(abs_list)))
| false | 26.666667 | [
"+# D",
"-abs_list = sorted([abs(x) for x in A])[::-1]",
"-for i in range(N - 1):",
"- if A[i] < 0:",
"- A[i] *= -1",
"- A[i + 1] *= -1",
"-if abs(min(A)) != min(abs_list):",
"- A[A.index(min(A))] *= -1",
"- A[A.index(min(abs_list))] *= -1",
"-print((sum(A)))",
"+minus_num... | false | 0.083263 | 0.036223 | 2.298651 | [
"s052675074",
"s597349020"
] |
u272028993 | p03763 | python | s203531897 | s458068417 | 44 | 11 | 30,060 | 2,568 | Accepted | Accepted | 75 | n=int(input())
s=[input() for _ in range(n)]
cnt=[[0]*26 for _ in range(n)]
for i in range(n):
for j in range(len(s[i])):
cnt[i][ord(s[i][j])-ord("a")]+=1
ans=""
for j in range(26):
tmp=10**9
for i in range(n):
tmp=min(tmp,cnt[i][j])
ans+=chr(j+ord("a"))*tmp
print(ans) | n = int(input())
s = [input() for _ in range(n)]
cnt = [[0] * 26 for _ in range(n)]
for i in range(n):
for j in range(len(s[i])):
cnt[i][ord(s[i][j]) - ord("a")] += 1
ans = ""
for j in range(26):
cntmn = 10**9
for i in range(n):
cntmn = min(cntmn, cnt[i][j])
ans += chr(j + ord... | 13 | 13 | 326 | 359 | n = int(input())
s = [input() for _ in range(n)]
cnt = [[0] * 26 for _ in range(n)]
for i in range(n):
for j in range(len(s[i])):
cnt[i][ord(s[i][j]) - ord("a")] += 1
ans = ""
for j in range(26):
tmp = 10**9
for i in range(n):
tmp = min(tmp, cnt[i][j])
ans += chr(j + ord("a")) * tmp
prin... | n = int(input())
s = [input() for _ in range(n)]
cnt = [[0] * 26 for _ in range(n)]
for i in range(n):
for j in range(len(s[i])):
cnt[i][ord(s[i][j]) - ord("a")] += 1
ans = ""
for j in range(26):
cntmn = 10**9
for i in range(n):
cntmn = min(cntmn, cnt[i][j])
ans += chr(j + ord("a")) * cn... | false | 0 | [
"- tmp = 10**9",
"+ cntmn = 10**9",
"- tmp = min(tmp, cnt[i][j])",
"- ans += chr(j + ord(\"a\")) * tmp",
"+ cntmn = min(cntmn, cnt[i][j])",
"+ ans += chr(j + ord(\"a\")) * cntmn"
] | false | 0.086426 | 0.038519 | 2.243744 | [
"s203531897",
"s458068417"
] |
u060793972 | p03476 | python | s510411378 | s144228206 | 1,072 | 499 | 8,088 | 13,344 | Accepted | Accepted | 53.45 | a=[0 for i in range(10**5+5)]
for i in range(3,10**5+3,2):
for j in range(3,int(i**0.5)+1,2):
if i%j==0 and j!=i:
break
else:
a[i]=1
a[3],a[2]=1,1
b=[0 for i in range(10**5+5)]
for i in range(3,10**5+3,2):
b[i]=a[i] and a[(i+1)//2]
c=[0]
for i in range(len(b)):
c... | a=[0 for i in range(10**5+3)]
b=[1 for i in range(10**5+3)]
for i in range(2,10**5+3):
if b[i]==1:
for j in range(2*i,10**5+3,i):
b[j]=0
b[0]=0
b[1]=0
for i in range(1,10**5+3,2):
a[i]=b[i] and b[(i+1)//2]
e=[a[0]]
for i in range(1,10**5+3):
e.append(a[i]+e[i-1])
#print(e)
... | 17 | 17 | 427 | 407 | a = [0 for i in range(10**5 + 5)]
for i in range(3, 10**5 + 3, 2):
for j in range(3, int(i**0.5) + 1, 2):
if i % j == 0 and j != i:
break
else:
a[i] = 1
a[3], a[2] = 1, 1
b = [0 for i in range(10**5 + 5)]
for i in range(3, 10**5 + 3, 2):
b[i] = a[i] and a[(i + 1) // 2]
c = [0]
fo... | a = [0 for i in range(10**5 + 3)]
b = [1 for i in range(10**5 + 3)]
for i in range(2, 10**5 + 3):
if b[i] == 1:
for j in range(2 * i, 10**5 + 3, i):
b[j] = 0
b[0] = 0
b[1] = 0
for i in range(1, 10**5 + 3, 2):
a[i] = b[i] and b[(i + 1) // 2]
e = [a[0]]
for i in range(1, 10**5 + 3):
e.appe... | false | 0 | [
"-a = [0 for i in range(10**5 + 5)]",
"-for i in range(3, 10**5 + 3, 2):",
"- for j in range(3, int(i**0.5) + 1, 2):",
"- if i % j == 0 and j != i:",
"- break",
"- else:",
"- a[i] = 1",
"-a[3], a[2] = 1, 1",
"-b = [0 for i in range(10**5 + 5)]",
"-for i in range(3, 1... | false | 0.362732 | 0.160628 | 2.258215 | [
"s510411378",
"s144228206"
] |
u497952650 | p02661 | python | s914323195 | s249702807 | 689 | 560 | 45,300 | 42,188 | Accepted | Accepted | 18.72 | N = int(eval(input()))
ab = []
for i in range(N):
ab.append(tuple(map(int,input().split())))
up = sorted(ab,key=lambda a:a[1],reverse=True)
down = sorted(ab,key=lambda a:a[0],reverse=True)
if N%2 == 1:
print((up[N//2][1]-down[N//2][0]+1))
else:
up2 = sorted(ab,key=lambda a:a[1],reverse=False)... | N = int(eval(input()))
ab = []
for i in range(N):
ab.append(tuple(map(int,input().split())))
up = sorted(ab,key=lambda a:a[1],reverse=True)
down = sorted(ab,key=lambda a:a[0],reverse=True)
if N%2 == 1:
print((up[N//2][1]-down[N//2][0]+1))
else:
r = (up[N//2][1]+up[N//2-1][1])
l = (down[N... | 16 | 14 | 462 | 354 | N = int(eval(input()))
ab = []
for i in range(N):
ab.append(tuple(map(int, input().split())))
up = sorted(ab, key=lambda a: a[1], reverse=True)
down = sorted(ab, key=lambda a: a[0], reverse=True)
if N % 2 == 1:
print((up[N // 2][1] - down[N // 2][0] + 1))
else:
up2 = sorted(ab, key=lambda a: a[1], reverse=F... | N = int(eval(input()))
ab = []
for i in range(N):
ab.append(tuple(map(int, input().split())))
up = sorted(ab, key=lambda a: a[1], reverse=True)
down = sorted(ab, key=lambda a: a[0], reverse=True)
if N % 2 == 1:
print((up[N // 2][1] - down[N // 2][0] + 1))
else:
r = up[N // 2][1] + up[N // 2 - 1][1]
l = ... | false | 12.5 | [
"- up2 = sorted(ab, key=lambda a: a[1], reverse=False)",
"- down2 = sorted(ab, key=lambda a: a[0], reverse=False)",
"- r = up[N // 2][1] + up2[N // 2][1]",
"- l = down[N // 2][0] + down2[N // 2][0]",
"+ r = up[N // 2][1] + up[N // 2 - 1][1]",
"+ l = down[N // 2][0] + down[N // 2 - 1][0]"... | false | 0.101225 | 0.037894 | 2.671274 | [
"s914323195",
"s249702807"
] |
u163320134 | p02744 | python | s160387099 | s723143183 | 715 | 207 | 76,652 | 25,716 | Accepted | Accepted | 71.05 | n=int(eval(input()))
tmp=[['1',set({1})]]
for i in range(1,n):
tmp2=[]
for s,c in tmp:
for j in range(len(c)+1):
tmp2.append([s+str((j+1)%10),c|set({j+1})])
tmp=tmp2
ans=[]
dic={'1':'a','2':'b','3':'c','4':'d','5':'e','6':'f','7':'g','8':'h','9':'i','0':'j'}
for s,c in tmp:
ts=''
for tc ... | n=int(eval(input()))
dic={0:'a',1:'b',2:'c',3:'d',4:'e',5:'f',6:'g',7:'h',8:'i',9:'j'}
ans=[['a',1]]
for i in range(1,n):
tmp=[]
for prev,val in ans:
for j in range(val+1):
if j!=val:
tmp.append([prev+dic[j],val])
else:
tmp.append([prev+dic[j],val+1])
ans=tmp
ans=sorted... | 18 | 15 | 398 | 384 | n = int(eval(input()))
tmp = [["1", set({1})]]
for i in range(1, n):
tmp2 = []
for s, c in tmp:
for j in range(len(c) + 1):
tmp2.append([s + str((j + 1) % 10), c | set({j + 1})])
tmp = tmp2
ans = []
dic = {
"1": "a",
"2": "b",
"3": "c",
"4": "d",
"5": "e",
"6": "f... | n = int(eval(input()))
dic = {0: "a", 1: "b", 2: "c", 3: "d", 4: "e", 5: "f", 6: "g", 7: "h", 8: "i", 9: "j"}
ans = [["a", 1]]
for i in range(1, n):
tmp = []
for prev, val in ans:
for j in range(val + 1):
if j != val:
tmp.append([prev + dic[j], val])
else:
... | false | 16.666667 | [
"-tmp = [[\"1\", set({1})]]",
"+dic = {0: \"a\", 1: \"b\", 2: \"c\", 3: \"d\", 4: \"e\", 5: \"f\", 6: \"g\", 7: \"h\", 8: \"i\", 9: \"j\"}",
"+ans = [[\"a\", 1]]",
"- tmp2 = []",
"- for s, c in tmp:",
"- for j in range(len(c) + 1):",
"- tmp2.append([s + str((j + 1) % 10), c | set... | false | 0.038271 | 0.060705 | 0.630444 | [
"s160387099",
"s723143183"
] |
u604839890 | p02681 | python | s298522713 | s175414849 | 66 | 27 | 61,812 | 8,956 | Accepted | Accepted | 59.09 | s, t = [eval(input()) for i in range(2)]
print(('Yes' if s == t[:len(s):] else 'No'))
| s, t = [eval(input()) for _ in range(2)]
print(('Yes' if s == t[:len(s):] else 'No')) | 2 | 2 | 79 | 78 | s, t = [eval(input()) for i in range(2)]
print(("Yes" if s == t[: len(s) :] else "No"))
| s, t = [eval(input()) for _ in range(2)]
print(("Yes" if s == t[: len(s) :] else "No"))
| false | 0 | [
"-s, t = [eval(input()) for i in range(2)]",
"+s, t = [eval(input()) for _ in range(2)]"
] | false | 0.035606 | 0.03594 | 0.990697 | [
"s298522713",
"s175414849"
] |
u903005414 | p02837 | python | s194790371 | s597337824 | 1,813 | 197 | 3,188 | 3,064 | Accepted | Accepted | 89.13 | from itertools import combinations
import sys
N = int(eval(input()))
A = [[] for _ in range(N + 1)]
B = [[] for _ in range(N + 1)]
C = [[] for _ in range(N + 1)]
num_hint = []
# hint_dict = {}
for i in range(1, N + 1):
num_i = int(eval(input()))
num_hint.append(num_i)
for j in range(num_i):
... | N = int(eval(input()))
XY = []
for _ in range(N):
A = int(eval(input()))
tmp = []
for _ in range(A):
x, y = list(map(int, input().split()))
tmp.append((x - 1, y))
XY.append(tmp)
def judge(bit):
for i in range(N):
if not (bit & (1 << i)):
continue... | 55 | 34 | 1,623 | 751 | from itertools import combinations
import sys
N = int(eval(input()))
A = [[] for _ in range(N + 1)]
B = [[] for _ in range(N + 1)]
C = [[] for _ in range(N + 1)]
num_hint = []
# hint_dict = {}
for i in range(1, N + 1):
num_i = int(eval(input()))
num_hint.append(num_i)
for j in range(num_i):
x, y = ... | N = int(eval(input()))
XY = []
for _ in range(N):
A = int(eval(input()))
tmp = []
for _ in range(A):
x, y = list(map(int, input().split()))
tmp.append((x - 1, y))
XY.append(tmp)
def judge(bit):
for i in range(N):
if not (bit & (1 << i)):
continue
for x, ... | false | 38.181818 | [
"-from itertools import combinations",
"-import sys",
"+N = int(eval(input()))",
"+XY = []",
"+for _ in range(N):",
"+ A = int(eval(input()))",
"+ tmp = []",
"+ for _ in range(A):",
"+ x, y = list(map(int, input().split()))",
"+ tmp.append((x - 1, y))",
"+ XY.append(tmp... | false | 0.048931 | 0.044751 | 1.093412 | [
"s194790371",
"s597337824"
] |
u197956883 | p02743 | python | s389655870 | s264414355 | 278 | 170 | 59,600 | 38,256 | Accepted | Accepted | 38.85 | from decimal import *
def main():
a, b, c = list(map(int, input().split()))
ad = Decimal(a).sqrt()
bd = Decimal(b).sqrt()
cd = Decimal(c).sqrt()
if ad + bd < cd:
is_big = True
else:
is_big = False
print(('Yes' if is_big else 'No'))
if __name__ == '__main_... | def main():
a, b, c = list(map(int, input().split()))
if c - a - b <= 0:
print('No')
exit()
if 4 * a * b < pow(c - a - b, 2):
is_big = True
else:
is_big = False
print(('Yes' if is_big else 'No'))
if __name__ == '__main__':
main()
| 18 | 16 | 328 | 297 | from decimal import *
def main():
a, b, c = list(map(int, input().split()))
ad = Decimal(a).sqrt()
bd = Decimal(b).sqrt()
cd = Decimal(c).sqrt()
if ad + bd < cd:
is_big = True
else:
is_big = False
print(("Yes" if is_big else "No"))
if __name__ == "__main__":
main()
| def main():
a, b, c = list(map(int, input().split()))
if c - a - b <= 0:
print("No")
exit()
if 4 * a * b < pow(c - a - b, 2):
is_big = True
else:
is_big = False
print(("Yes" if is_big else "No"))
if __name__ == "__main__":
main()
| false | 11.111111 | [
"-from decimal import *",
"-",
"-",
"- ad = Decimal(a).sqrt()",
"- bd = Decimal(b).sqrt()",
"- cd = Decimal(c).sqrt()",
"- if ad + bd < cd:",
"+ if c - a - b <= 0:",
"+ print(\"No\")",
"+ exit()",
"+ if 4 * a * b < pow(c - a - b, 2):"
] | false | 0.052491 | 0.049225 | 1.066365 | [
"s389655870",
"s264414355"
] |
u776826405 | p03276 | python | s970765664 | s232866502 | 723 | 85 | 87,096 | 84,636 | Accepted | Accepted | 88.24 | a = [list(map(int, input().split())) for i in range(2)]
k = a[0][1]
num_list = a[1]
positive_list = []
negative_list = []
ans_positive = []
ans_negative = []
ans_list = []
for _ in num_list:
if _ > 0:
positive_list.append(_)
elif _ < 0:
negative_list.insert(0, _)
else:... | n, k = list(map(int, input().split()))
x = list(map(int, input().split()))
ans = []
for _ in range(n - k + 1):
ans.append(abs(x[k + _ - 1]) + abs(x[k + _ - 1] - x[_]))
ans.append(abs(x[_]) + abs(x[_] - x[k + _ - 1]))
print((min(ans))) | 49 | 11 | 1,086 | 255 | a = [list(map(int, input().split())) for i in range(2)]
k = a[0][1]
num_list = a[1]
positive_list = []
negative_list = []
ans_positive = []
ans_negative = []
ans_list = []
for _ in num_list:
if _ > 0:
positive_list.append(_)
elif _ < 0:
negative_list.insert(0, _)
else:
if num_list !=... | n, k = list(map(int, input().split()))
x = list(map(int, input().split()))
ans = []
for _ in range(n - k + 1):
ans.append(abs(x[k + _ - 1]) + abs(x[k + _ - 1] - x[_]))
ans.append(abs(x[_]) + abs(x[_] - x[k + _ - 1]))
print((min(ans)))
| false | 77.55102 | [
"-a = [list(map(int, input().split())) for i in range(2)]",
"-k = a[0][1]",
"-num_list = a[1]",
"-positive_list = []",
"-negative_list = []",
"-ans_positive = []",
"-ans_negative = []",
"-ans_list = []",
"-for _ in num_list:",
"- if _ > 0:",
"- positive_list.append(_)",
"- elif _ ... | false | 0.04129 | 0.038226 | 1.080149 | [
"s970765664",
"s232866502"
] |
u580404776 | p02987 | python | s245712299 | s007120922 | 20 | 17 | 3,316 | 2,940 | Accepted | Accepted | 15 | from collections import Counter
S=list(eval(input()))
print(('Yes' if len(set(S))==2 and Counter(S)[S[0]]==2 else 'No')) | S=list(eval(input()))
n=len(set(S))
print(("Yes" if n==2 and S.count(S[0])==2 else "No")) | 3 | 3 | 114 | 83 | from collections import Counter
S = list(eval(input()))
print(("Yes" if len(set(S)) == 2 and Counter(S)[S[0]] == 2 else "No"))
| S = list(eval(input()))
n = len(set(S))
print(("Yes" if n == 2 and S.count(S[0]) == 2 else "No"))
| false | 0 | [
"-from collections import Counter",
"-",
"-print((\"Yes\" if len(set(S)) == 2 and Counter(S)[S[0]] == 2 else \"No\"))",
"+n = len(set(S))",
"+print((\"Yes\" if n == 2 and S.count(S[0]) == 2 else \"No\"))"
] | false | 0.073042 | 0.07262 | 1.005804 | [
"s245712299",
"s007120922"
] |
u129978636 | p03399 | python | s560150808 | s157191225 | 19 | 17 | 3,060 | 3,060 | Accepted | Accepted | 10.53 | A = int(eval(input()))
B = int(eval(input()))
C = int(eval(input()))
D = int(eval(input()))
if( A < B):
if(C < D):
print((A + C))
else:
print((A + D))
else:
if(C < D):
print((B + C))
else:
print((B + D))
| A = int(eval(input()))
B = int(eval(input()))
C = int(eval(input()))
D = int(eval(input()))
E = min(A, B)
F = min(C, D)
print((E + F)) | 18 | 9 | 227 | 118 | A = int(eval(input()))
B = int(eval(input()))
C = int(eval(input()))
D = int(eval(input()))
if A < B:
if C < D:
print((A + C))
else:
print((A + D))
else:
if C < D:
print((B + C))
else:
print((B + D))
| A = int(eval(input()))
B = int(eval(input()))
C = int(eval(input()))
D = int(eval(input()))
E = min(A, B)
F = min(C, D)
print((E + F))
| false | 50 | [
"-if A < B:",
"- if C < D:",
"- print((A + C))",
"- else:",
"- print((A + D))",
"-else:",
"- if C < D:",
"- print((B + C))",
"- else:",
"- print((B + D))",
"+E = min(A, B)",
"+F = min(C, D)",
"+print((E + F))"
] | false | 0.044615 | 0.05422 | 0.822848 | [
"s560150808",
"s157191225"
] |
u745277023 | p00009 | python | s427696003 | s170124844 | 530 | 460 | 24,208 | 24,208 | Accepted | Accepted | 13.21 | import sys
xx = 500000
f = [0, 1] * xx
i = 3
while i * i <= 2 * xx:
if f[i] == 1:
j = i * i
while j <= 2 * xx:
f[j] = 0
j += i + i
i += 2
f.pop(0)
f.pop(1)
for n in sys.stdin:
i = int(n)
if i < 2:
print((0))
else:
... | import sys
f = [0, 1] * 500000
i = 3
while i <= 1000:
if f[i] == 1:
j = i * i
while j <= 1000000:
f[j] = 0
j += i + i
i += 2
f.pop(0)
f.pop(1)
for n in sys.stdin:
i = int(n)
if i < 2:
print((0))
else:
print((sum(... | 24 | 23 | 342 | 328 | import sys
xx = 500000
f = [0, 1] * xx
i = 3
while i * i <= 2 * xx:
if f[i] == 1:
j = i * i
while j <= 2 * xx:
f[j] = 0
j += i + i
i += 2
f.pop(0)
f.pop(1)
for n in sys.stdin:
i = int(n)
if i < 2:
print((0))
else:
print((sum(f[: i - 1])))
| import sys
f = [0, 1] * 500000
i = 3
while i <= 1000:
if f[i] == 1:
j = i * i
while j <= 1000000:
f[j] = 0
j += i + i
i += 2
f.pop(0)
f.pop(1)
for n in sys.stdin:
i = int(n)
if i < 2:
print((0))
else:
print((sum(f[: i - 1])))
| false | 4.166667 | [
"-xx = 500000",
"-f = [0, 1] * xx",
"+f = [0, 1] * 500000",
"-while i * i <= 2 * xx:",
"+while i <= 1000:",
"- while j <= 2 * xx:",
"+ while j <= 1000000:"
] | false | 0.517583 | 1.159447 | 0.446405 | [
"s427696003",
"s170124844"
] |
u671060652 | p02683 | python | s895900911 | s954180869 | 340 | 126 | 73,388 | 74,016 | Accepted | Accepted | 62.94 | import itertools
import math
import fractions
import functools
n, m, x = list(map(int, input().split()))
a_do = []
for i in range(n):
a = list(map(int, input().split()))
a_do.append(a)
nums = []
for i in range(n):
nums.append(i)
minimum = 10**20
temp = []
for i in range(1, n+1):
... | import itertools
import math
import fractions
import functools
n, m, x = list(map(int, input().split()))
a_do = []
for i in range(n):
a = list(map(int, input().split()))
a_do.append(a)
nums = []
for i in range(n):
nums.append(i)
temp = []
for i in range(1, n+1):
for v in itertool... | 46 | 40 | 970 | 783 | import itertools
import math
import fractions
import functools
n, m, x = list(map(int, input().split()))
a_do = []
for i in range(n):
a = list(map(int, input().split()))
a_do.append(a)
nums = []
for i in range(n):
nums.append(i)
minimum = 10**20
temp = []
for i in range(1, n + 1):
for v in itertools.co... | import itertools
import math
import fractions
import functools
n, m, x = list(map(int, input().split()))
a_do = []
for i in range(n):
a = list(map(int, input().split()))
a_do.append(a)
nums = []
for i in range(n):
nums.append(i)
temp = []
for i in range(1, n + 1):
for v in itertools.combinations(nums, ... | false | 13.043478 | [
"-minimum = 10**20",
"- for v in itertools.combinations(nums, i): # 参考書の選び方",
"+ for v in itertools.combinations(nums, i):",
"- ok = True",
"- for j in range(1, m + 1):",
"- if rikaido[j] < x:",
"- ok = False",
"- if ok:",
"- minimum =... | false | 0.038149 | 0.039939 | 0.955192 | [
"s895900911",
"s954180869"
] |
u077291787 | p03379 | python | s488062162 | s532340681 | 240 | 186 | 25,052 | 28,764 | Accepted | Accepted | 22.5 | # ABC094C - Many Medians (ARC095C)
def main():
N, *X = map(int, open(0).read().split())
l, h = sorted(X)[N // 2 - 1 : N // 2 + 1]
ans = [h if i <= l else l for i in X]
print(*ans, sep="\n")
if __name__ == "__main__":
main()
| # ABC094C - Many Medians (ARC095C)
def main():
N, *X = list(map(int, open(0).read().split()))
l, h = sorted(X)[N // 2 - 1 : N // 2 + 1]
ans = [h if i <= l else l for i in X]
print(("\n".join(map(str, ans))))
if __name__ == "__main__":
main() | 10 | 10 | 254 | 264 | # ABC094C - Many Medians (ARC095C)
def main():
N, *X = map(int, open(0).read().split())
l, h = sorted(X)[N // 2 - 1 : N // 2 + 1]
ans = [h if i <= l else l for i in X]
print(*ans, sep="\n")
if __name__ == "__main__":
main()
| # ABC094C - Many Medians (ARC095C)
def main():
N, *X = list(map(int, open(0).read().split()))
l, h = sorted(X)[N // 2 - 1 : N // 2 + 1]
ans = [h if i <= l else l for i in X]
print(("\n".join(map(str, ans))))
if __name__ == "__main__":
main()
| false | 0 | [
"- N, *X = map(int, open(0).read().split())",
"+ N, *X = list(map(int, open(0).read().split()))",
"- print(*ans, sep=\"\\n\")",
"+ print((\"\\n\".join(map(str, ans))))"
] | false | 0.049329 | 0.037415 | 1.318442 | [
"s488062162",
"s532340681"
] |
u072717685 | p02791 | python | s209434957 | s035297489 | 565 | 171 | 50,536 | 50,372 | Accepted | Accepted | 69.73 | import sys
read = sys.stdin.read
readlines = sys.stdin.readlines
import numpy as np
def main():
n, *a = list(map(int, read().split()))
p = np.array(a)
minp = np.minimum.accumulate(p)
r = 0
for i1, ae in enumerate(a):
r += minp[i1] >= ae
print(r)
if __name__ == '__main__... | import sys
read = sys.stdin.read
readlines = sys.stdin.readlines
import numpy as np
def main():
n, *a = list(map(int, read().split()))
p = np.array(a)
minp = np.minimum.accumulate(p)
r = np.count_nonzero(minp >= p)
print(r)
if __name__ == '__main__':
main() | 17 | 14 | 329 | 290 | import sys
read = sys.stdin.read
readlines = sys.stdin.readlines
import numpy as np
def main():
n, *a = list(map(int, read().split()))
p = np.array(a)
minp = np.minimum.accumulate(p)
r = 0
for i1, ae in enumerate(a):
r += minp[i1] >= ae
print(r)
if __name__ == "__main__":
main()... | import sys
read = sys.stdin.read
readlines = sys.stdin.readlines
import numpy as np
def main():
n, *a = list(map(int, read().split()))
p = np.array(a)
minp = np.minimum.accumulate(p)
r = np.count_nonzero(minp >= p)
print(r)
if __name__ == "__main__":
main()
| false | 17.647059 | [
"- r = 0",
"- for i1, ae in enumerate(a):",
"- r += minp[i1] >= ae",
"+ r = np.count_nonzero(minp >= p)"
] | false | 0.189198 | 0.174463 | 1.084462 | [
"s209434957",
"s035297489"
] |
u912237403 | p00073 | python | s471709957 | s529833134 | 20 | 10 | 4,284 | 4,272 | Accepted | Accepted | 50 | while 1:
x=eval(input())
h=eval(input())
if x==0 and h==0: break
a=float(x)/2
s=((a*a+h*h)**0.5 * 2 + x)*x
print(s) | while 1:
x,h = eval(input()),eval(input())
if x==0 and h==0: break
a=float(x)/2
s=x*x+2*x*(a*a+h*h)**0.5
print(s) | 7 | 6 | 132 | 125 | while 1:
x = eval(input())
h = eval(input())
if x == 0 and h == 0:
break
a = float(x) / 2
s = ((a * a + h * h) ** 0.5 * 2 + x) * x
print(s)
| while 1:
x, h = eval(input()), eval(input())
if x == 0 and h == 0:
break
a = float(x) / 2
s = x * x + 2 * x * (a * a + h * h) ** 0.5
print(s)
| false | 14.285714 | [
"- x = eval(input())",
"- h = eval(input())",
"+ x, h = eval(input()), eval(input())",
"- s = ((a * a + h * h) ** 0.5 * 2 + x) * x",
"+ s = x * x + 2 * x * (a * a + h * h) ** 0.5"
] | false | 0.040212 | 0.040487 | 0.993221 | [
"s471709957",
"s529833134"
] |
u102461423 | p02974 | python | s851591182 | s710459021 | 333 | 284 | 14,284 | 13,896 | Accepted | Accepted | 14.71 | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
import numpy as np
MOD = 10**9 + 7
N,K = list(map(int,read().split()))
# 左からの流入量、コスト
L = N*(N-1)//2+1
dp = np.zeros((N,L),dtype=np.int64)
dp[0,0] = 1
for _ in range(1,N+1):
prev ... | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
import numpy as np
MOD = 10**9 + 7
N,K = list(map(int,read().split()))
# 左からの流入量、コスト
L = N*(N-1)//2+1
dp = np.zeros((N,L),dtype=np.int64)
dp[0,0] = 1
for _ in range(1,N+1):
prev ... | 40 | 37 | 871 | 756 | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
import numpy as np
MOD = 10**9 + 7
N, K = list(map(int, read().split()))
# 左からの流入量、コスト
L = N * (N - 1) // 2 + 1
dp = np.zeros((N, L), dtype=np.int64)
dp[0, 0] = 1
for _ in range(1, N + 1):
prev = dp... | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
import numpy as np
MOD = 10**9 + 7
N, K = list(map(int, read().split()))
# 左からの流入量、コスト
L = N * (N - 1) // 2 + 1
dp = np.zeros((N, L), dtype=np.int64)
dp[0, 0] = 1
for _ in range(1, N + 1):
prev = dp... | false | 7.5 | [
"- # 自身を不動点にしてそのまま左右に流す",
"- dp[n, n:] += prev[n, : L - n]",
"+ x = prev[n]",
"+ # どれかを不動点に残りを等個数だけ左右に流す",
"+ dp[n, n:] += x[: L - n] * (n + n + 1)",
"- dp[n - 1, n - 1 :] += prev[n, : L - n + 1] * n",
"- # 左からのものを採用、自身は右に流す",
"- dp[n, n:] +=... | false | 0.220092 | 0.366615 | 0.600337 | [
"s851591182",
"s710459021"
] |
u300968187 | p03252 | python | s833586639 | s766109320 | 81 | 27 | 3,632 | 3,632 | Accepted | Accepted | 66.67 | prj = {}
prj_inv = {}
s = eval(input())
t = eval(input())
for i, j in zip(s, t):
if i not in prj and j not in prj_inv:
prj[i] = j
prj_inv[j] = i
elif i in prj and j in prj_inv:
if prj[i] == j:
continue
else:
print('No')
break
... | s = eval(input())
t = eval(input())
s_c = []
t_c = []
for c in 'abcdefghijklmnopqrstuvwxyz':
s_c.append(s.count(c))
t_c.append(t.count(c))
s_c.sort()
t_c.sort()
if s_c == t_c:
print('Yes')
else:
print('No') | 19 | 14 | 374 | 221 | prj = {}
prj_inv = {}
s = eval(input())
t = eval(input())
for i, j in zip(s, t):
if i not in prj and j not in prj_inv:
prj[i] = j
prj_inv[j] = i
elif i in prj and j in prj_inv:
if prj[i] == j:
continue
else:
print("No")
break
else:
... | s = eval(input())
t = eval(input())
s_c = []
t_c = []
for c in "abcdefghijklmnopqrstuvwxyz":
s_c.append(s.count(c))
t_c.append(t.count(c))
s_c.sort()
t_c.sort()
if s_c == t_c:
print("Yes")
else:
print("No")
| false | 26.315789 | [
"-prj = {}",
"-prj_inv = {}",
"-for i, j in zip(s, t):",
"- if i not in prj and j not in prj_inv:",
"- prj[i] = j",
"- prj_inv[j] = i",
"- elif i in prj and j in prj_inv:",
"- if prj[i] == j:",
"- continue",
"- else:",
"- print(\"No\")",
... | false | 0.131424 | 0.077079 | 1.70507 | [
"s833586639",
"s766109320"
] |
u287500079 | p03107 | python | s245473390 | s090569029 | 98 | 89 | 6,224 | 5,972 | Accepted | Accepted | 9.18 | import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii... | import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii... | 30 | 30 | 955 | 948 | import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_upper... | import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_upper... | false | 0 | [
"-stack = deque(s[0])",
"-for i in range(1, n):",
"+stack = deque()",
"+for i in range(n):"
] | false | 0.032446 | 0.033809 | 0.959671 | [
"s245473390",
"s090569029"
] |
u887207211 | p03110 | python | s640151578 | s472377476 | 19 | 17 | 3,060 | 3,060 | Accepted | Accepted | 10.53 | N = int(eval(input()))
btc = 380000
money = 0
for _ in range(N):
x, u = input().split()
if(u == "JPY"):
money += int(x)
else:
money += float(x)*btc
print(money) | import sys
stdin = sys.stdin
ns = lambda : stdin.readline().rstrip()
ni = lambda : int(ns())
n = ni()
btc = 380000
ans = 0
for _ in range(n):
a, b = ns().split()
if b == "BTC":
ans += float(a) * btc
else:
ans += int(a)
print(ans)
| 10 | 15 | 177 | 260 | N = int(eval(input()))
btc = 380000
money = 0
for _ in range(N):
x, u = input().split()
if u == "JPY":
money += int(x)
else:
money += float(x) * btc
print(money)
| import sys
stdin = sys.stdin
ns = lambda: stdin.readline().rstrip()
ni = lambda: int(ns())
n = ni()
btc = 380000
ans = 0
for _ in range(n):
a, b = ns().split()
if b == "BTC":
ans += float(a) * btc
else:
ans += int(a)
print(ans)
| false | 33.333333 | [
"-N = int(eval(input()))",
"+import sys",
"+",
"+stdin = sys.stdin",
"+ns = lambda: stdin.readline().rstrip()",
"+ni = lambda: int(ns())",
"+n = ni()",
"-money = 0",
"-for _ in range(N):",
"- x, u = input().split()",
"- if u == \"JPY\":",
"- money += int(x)",
"+ans = 0",
"+for... | false | 0.055007 | 0.148736 | 0.369833 | [
"s640151578",
"s472377476"
] |
u761989513 | p03290 | python | s857279058 | s770645800 | 25 | 19 | 3,064 | 3,064 | Accepted | Accepted | 24 | d, g = list(map(int, input().split()))
pc = [list(map(int, input().split())) for i in range(d)]
ans = float("inf")
for bit in range(1 << d):
count = 0
sum = 0
nokori = set(range(1, d + 1))
for i in range(d):
if bit & (1 << i):
sum += pc[i][0] * (i + 1) * 100 + pc[i][1]
... | def dfs(i, sum, count, nokori):
global ans
if i == d:
if sum < g:
use = max(nokori)
n = min(pc[use - 1][0], -(-(g - sum) // (use * 100)))
count += n
sum += n * use * 100
if sum >= g:
ans = min(ans, count)
return 0
... | 19 | 20 | 625 | 610 | d, g = list(map(int, input().split()))
pc = [list(map(int, input().split())) for i in range(d)]
ans = float("inf")
for bit in range(1 << d):
count = 0
sum = 0
nokori = set(range(1, d + 1))
for i in range(d):
if bit & (1 << i):
sum += pc[i][0] * (i + 1) * 100 + pc[i][1]
co... | def dfs(i, sum, count, nokori):
global ans
if i == d:
if sum < g:
use = max(nokori)
n = min(pc[use - 1][0], -(-(g - sum) // (use * 100)))
count += n
sum += n * use * 100
if sum >= g:
ans = min(ans, count)
return 0
dfs(i + 1,... | false | 5 | [
"+def dfs(i, sum, count, nokori):",
"+ global ans",
"+ if i == d:",
"+ if sum < g:",
"+ use = max(nokori)",
"+ n = min(pc[use - 1][0], -(-(g - sum) // (use * 100)))",
"+ count += n",
"+ sum += n * use * 100",
"+ if sum >= g:",
"+ ... | false | 0.059964 | 0.0562 | 1.066976 | [
"s857279058",
"s770645800"
] |
u779455925 | p02662 | python | s762804297 | s321346007 | 163 | 135 | 73,620 | 73,528 | Accepted | Accepted | 17.18 | from heapq import *
import sys
from collections import *
from itertools import *
from decimal import *
import copy
from bisect import *
import math
sys.setrecursionlimit(4100000)
def gcd(a,b):
if(a%b==0):return(b)
return (gcd(b,a%b))
input=lambda :sys.stdin.readline().rstrip()
N,S=list(map(int,inpu... | from heapq import *
import sys
from collections import *
from itertools import *
from decimal import *
import copy
from bisect import *
import math
sys.setrecursionlimit(4100000)
def gcd(a,b):
if(a%b==0):return(b)
return (gcd(b,a%b))
input=lambda :sys.stdin.readline().rstrip()
N,S=list(map(int,inpu... | 30 | 30 | 662 | 648 | from heapq import *
import sys
from collections import *
from itertools import *
from decimal import *
import copy
from bisect import *
import math
sys.setrecursionlimit(4100000)
def gcd(a, b):
if a % b == 0:
return b
return gcd(b, a % b)
input = lambda: sys.stdin.readline().rstrip()
N, S = list(ma... | from heapq import *
import sys
from collections import *
from itertools import *
from decimal import *
import copy
from bisect import *
import math
sys.setrecursionlimit(4100000)
def gcd(a, b):
if a % b == 0:
return b
return gcd(b, a % b)
input = lambda: sys.stdin.readline().rstrip()
N, S = list(ma... | false | 0 | [
"-dp = [[0, 0] for n in range(3001)]",
"+dp = [0 for n in range(3001)]",
"- dp[s + a][1] += dp[s][1] * gyaku % mod",
"- dp[s + a][1] %= mod",
"- dp[a][1] += N2",
"-print((dp[S][1]))",
"-# print(c)",
"+ dp[s + a] += dp[s] * gyaku % mod",
"+ dp[s + a] %= ... | false | 0.037418 | 0.035555 | 1.052418 | [
"s762804297",
"s321346007"
] |
u598229387 | p03436 | python | s763006325 | s891779902 | 205 | 31 | 42,096 | 3,444 | Accepted | Accepted | 84.88 | from collections import defaultdict
from collections import deque
h,w=list(map(int,input().split()))
s=[list(eval(input())) for i in range(h)]
field=[[float('inf') for i in range(w)] for j in range(h)]
q=deque()
q.append((0,0))
field[0][0]=0
dx=[0,1,0,-1]
dy=[1,0,-1,0]
while q:
y,x=q.popleft()
... | from collections import defaultdict
from collections import deque
h,w=list(map(int,input().split()))
s=[list(eval(input())) for i in range(h)]
field=[[float('inf') for i in range(w)] for j in range(h)]
q=deque()
q.append((0,0))
field[0][0]=0
dx=[0,1,0,-1]
dy=[1,0,-1,0]
while q:
y,x=q.popleft()
... | 43 | 33 | 992 | 722 | from collections import defaultdict
from collections import deque
h, w = list(map(int, input().split()))
s = [list(eval(input())) for i in range(h)]
field = [[float("inf") for i in range(w)] for j in range(h)]
q = deque()
q.append((0, 0))
field[0][0] = 0
dx = [0, 1, 0, -1]
dy = [1, 0, -1, 0]
while q:
y, x = q.popl... | from collections import defaultdict
from collections import deque
h, w = list(map(int, input().split()))
s = [list(eval(input())) for i in range(h)]
field = [[float("inf") for i in range(w)] for j in range(h)]
q = deque()
q.append((0, 0))
field[0][0] = 0
dx = [0, 1, 0, -1]
dy = [1, 0, -1, 0]
while q:
y, x = q.popl... | false | 23.255814 | [
"-dic = defaultdict(int)",
"+shiro = 0",
"- dic[field[i][j]] += 1",
"-ans = 0",
"-for key, value in list(dic.items()):",
"- if key != float(\"inf\") and key <= check:",
"- ans += value - 1",
"- elif key != float(\"inf\") and key > check:",
"- ans += value",
"-for i in ra... | false | 0.074097 | 0.037279 | 1.987642 | [
"s763006325",
"s891779902"
] |
u513081876 | p03814 | python | s999846360 | s979347026 | 56 | 44 | 11,464 | 3,500 | Accepted | Accepted | 21.43 | S = eval(input())
A = [ind for ind, x in enumerate(S) if x == 'A']
Z = [ind for ind, x in enumerate(S) if x == 'Z']
print((max(Z) - min(A) + 1)) | s = eval(input())
for ind, i in enumerate(s):
if i == 'A':
num1 = ind
break
for ind, i in enumerate(s):
if i == 'Z':
num2 = ind
print((num2 - num1 + 1)) | 4 | 12 | 139 | 190 | S = eval(input())
A = [ind for ind, x in enumerate(S) if x == "A"]
Z = [ind for ind, x in enumerate(S) if x == "Z"]
print((max(Z) - min(A) + 1))
| s = eval(input())
for ind, i in enumerate(s):
if i == "A":
num1 = ind
break
for ind, i in enumerate(s):
if i == "Z":
num2 = ind
print((num2 - num1 + 1))
| false | 66.666667 | [
"-S = eval(input())",
"-A = [ind for ind, x in enumerate(S) if x == \"A\"]",
"-Z = [ind for ind, x in enumerate(S) if x == \"Z\"]",
"-print((max(Z) - min(A) + 1))",
"+s = eval(input())",
"+for ind, i in enumerate(s):",
"+ if i == \"A\":",
"+ num1 = ind",
"+ break",
"+for ind, i in... | false | 0.044714 | 0.044542 | 1.003876 | [
"s999846360",
"s979347026"
] |
u896741788 | p03674 | python | s085823319 | s920245987 | 382 | 229 | 20,452 | 29,396 | Accepted | Accepted | 40.05 | n=int(eval(input()))
l=list(map(int,input().split()))
cnt=[0 for i in range(n+1)]
mod=10**9+7
fact=[1]*(n+2)
inv=[1]*(n+2)
for i in range(2,n+2):
fact[i]=i*fact[i-1]%mod
inv[-1]=pow(fact[-1],mod-2,mod)
for i in range(n+1,1,-1):
inv[i-1]=inv[i]*i%mod
def comb(x,y):return fact[x]*inv[y]%mod*inv[x-y]%mo... | n=int(eval(input()))
l=list(map(int,input().split()))
memo={}
for i in range(n+1):
if l[i]in memo:
g=l[i]
x,y=memo[g],i
break
memo[l[i]]=i
mod=10**9+7
fact=[1]*(n+1+1)
inv=[1]*(n+1+1)
for i in range(2,n+1+1):
fact[i]=i*fact[i-1]%mod
inv[-1]=pow(fact[-1],mod-2,mod)
... | 19 | 21 | 509 | 502 | n = int(eval(input()))
l = list(map(int, input().split()))
cnt = [0 for i in range(n + 1)]
mod = 10**9 + 7
fact = [1] * (n + 2)
inv = [1] * (n + 2)
for i in range(2, n + 2):
fact[i] = i * fact[i - 1] % mod
inv[-1] = pow(fact[-1], mod - 2, mod)
for i in range(n + 1, 1, -1):
inv[i - 1] = inv[i] * i % mod
def co... | n = int(eval(input()))
l = list(map(int, input().split()))
memo = {}
for i in range(n + 1):
if l[i] in memo:
g = l[i]
x, y = memo[g], i
break
memo[l[i]] = i
mod = 10**9 + 7
fact = [1] * (n + 1 + 1)
inv = [1] * (n + 1 + 1)
for i in range(2, n + 1 + 1):
fact[i] = i * fact[i - 1] % mod
... | false | 9.52381 | [
"-cnt = [0 for i in range(n + 1)]",
"+memo = {}",
"+for i in range(n + 1):",
"+ if l[i] in memo:",
"+ g = l[i]",
"+ x, y = memo[g], i",
"+ break",
"+ memo[l[i]] = i",
"-fact = [1] * (n + 2)",
"-inv = [1] * (n + 2)",
"-for i in range(2, n + 2):",
"+fact = [1] * (n + 1... | false | 0.03713 | 0.037135 | 0.999865 | [
"s085823319",
"s920245987"
] |
u330039499 | p03796 | python | s564562964 | s268907289 | 89 | 24 | 6,400 | 5,764 | Accepted | Accepted | 73.03 | N = eval(input())
res = 1
for i in range(1, N + 1):
res *= i
res %= 10 ** 9 + 7
print(res)
| from functools import reduce
N = eval(input())
print(reduce(lambda x, y: x * y % (10 ** 9 + 7), list(range(1, N + 1))))
| 6 | 2 | 97 | 80 | N = eval(input())
res = 1
for i in range(1, N + 1):
res *= i
res %= 10**9 + 7
print(res)
| from functools import reduce
N = eval(input())
print(reduce(lambda x, y: x * y % (10**9 + 7), list(range(1, N + 1))))
| false | 66.666667 | [
"+from functools import reduce",
"+",
"-res = 1",
"-for i in range(1, N + 1):",
"- res *= i",
"- res %= 10**9 + 7",
"-print(res)",
"+print(reduce(lambda x, y: x * y % (10**9 + 7), list(range(1, N + 1))))"
] | false | 0.058489 | 0.04005 | 1.460388 | [
"s564562964",
"s268907289"
] |
u699994820 | p03556 | python | s770513743 | s079681799 | 26 | 24 | 2,940 | 2,940 | Accepted | Accepted | 7.69 | #2
n = int(eval(input()))
s = 1
p = 1
while (True):
p = s * s
s = s + 1
if (s*s > n) :
break
print(p) | #2
n = int(eval(input()))
a=1
raw=0
while raw <= n:
raw=a*a
a=a+1
print(((a-2)*(a-2))) | 11 | 11 | 130 | 99 | # 2
n = int(eval(input()))
s = 1
p = 1
while True:
p = s * s
s = s + 1
if s * s > n:
break
print(p)
| # 2
n = int(eval(input()))
a = 1
raw = 0
while raw <= n:
raw = a * a
a = a + 1
print(((a - 2) * (a - 2)))
| false | 0 | [
"-s = 1",
"-p = 1",
"-while True:",
"- p = s * s",
"- s = s + 1",
"- if s * s > n:",
"- break",
"-print(p)",
"+a = 1",
"+raw = 0",
"+while raw <= n:",
"+ raw = a * a",
"+ a = a + 1",
"+print(((a - 2) * (a - 2)))"
] | false | 0.051311 | 0.049628 | 1.033901 | [
"s770513743",
"s079681799"
] |
u497952650 | p02802 | python | s207418194 | s864145287 | 331 | 188 | 30,520 | 10,448 | Accepted | Accepted | 43.2 | N,M = map(int,input().split())
RES = []
for i in range(M):
RES.append(list(input().split()))
WA = [0]*(M+N)
ACed = [0]*(N+M)
tmp_num = [0]*(M+N)
tmp = 0
for i in range(M):
num = int(RES[i][0])
if RES[i][1] == "WA" and not ACed[num]:
tmp_num[num] += 1
elif RES[i][1] == "WA" and ... | N,M = list(map(int,input().split()))
solved = [0]*(N+1)
penalty = [0]*(N+1)
ac = 0
wa = 0
for _ in range(M):
a,b = input().split()
a = int(a)
if not solved[a]:
if b == "AC":
wa += penalty[a]
solved[a] = 1
else:
penalty[a] += 1
print((su... | 23 | 18 | 458 | 326 | N, M = map(int, input().split())
RES = []
for i in range(M):
RES.append(list(input().split()))
WA = [0] * (M + N)
ACed = [0] * (N + M)
tmp_num = [0] * (M + N)
tmp = 0
for i in range(M):
num = int(RES[i][0])
if RES[i][1] == "WA" and not ACed[num]:
tmp_num[num] += 1
elif RES[i][1] == "WA" and ACed... | N, M = list(map(int, input().split()))
solved = [0] * (N + 1)
penalty = [0] * (N + 1)
ac = 0
wa = 0
for _ in range(M):
a, b = input().split()
a = int(a)
if not solved[a]:
if b == "AC":
wa += penalty[a]
solved[a] = 1
else:
penalty[a] += 1
print((sum(solved)... | false | 21.73913 | [
"-N, M = map(int, input().split())",
"-RES = []",
"-for i in range(M):",
"- RES.append(list(input().split()))",
"-WA = [0] * (M + N)",
"-ACed = [0] * (N + M)",
"-tmp_num = [0] * (M + N)",
"-tmp = 0",
"-for i in range(M):",
"- num = int(RES[i][0])",
"- if RES[i][1] == \"WA\" and not ACed... | false | 0.042614 | 0.070424 | 0.605105 | [
"s207418194",
"s864145287"
] |
u532966492 | p03430 | python | s787595210 | s582180277 | 982 | 688 | 154,076 | 154,076 | Accepted | Accepted | 29.94 | def main():
s = eval(input())
n = len(s)
k = int(eval(input()))
# dp[使った回数][左端からの距離][左端]
dp = [[[1]*(n-i) for i in range(n)] for _ in range(k+1)]
if n == 1:
print((1))
return
dp2 = dp[0][1]
for i in range(n-1):
if s[i] == s[i+1]:
dp2[i] =... | def main():
s = eval(input())
n = len(s)
k = int(eval(input()))
# dp[使った回数][左端からの距離][左端]
dp = [[[1]*(n-i) for i in range(n)] for _ in range(k+1)]
if n == 1:
print((1))
return
dp2 = dp[0][1]
for i in range(n-1):
if s[i] == s[i+1]:
dp2[i] =... | 44 | 50 | 1,259 | 1,361 | def main():
s = eval(input())
n = len(s)
k = int(eval(input()))
# dp[使った回数][左端からの距離][左端]
dp = [[[1] * (n - i) for i in range(n)] for _ in range(k + 1)]
if n == 1:
print((1))
return
dp2 = dp[0][1]
for i in range(n - 1):
if s[i] == s[i + 1]:
dp2[i] = 2
... | def main():
s = eval(input())
n = len(s)
k = int(eval(input()))
# dp[使った回数][左端からの距離][左端]
dp = [[[1] * (n - i) for i in range(n)] for _ in range(k + 1)]
if n == 1:
print((1))
return
dp2 = dp[0][1]
for i in range(n - 1):
if s[i] == s[i + 1]:
dp2[i] = 2
... | false | 12 | [
"+ dp4 = dp[cnt + 1]",
"+ dp5 = dp2[d - 1]",
"+ dp6 = dp2[d - 2]",
"+ dp7 = dp4[d]",
"- dp3[left],",
"- dp2[d - 1][left],",
"- dp2[d - 1][left + 1],",
"- dp2[d - 2][left + 1] + plus,",
... | false | 0.036025 | 0.056386 | 0.6389 | [
"s787595210",
"s582180277"
] |
u652057333 | p03283 | python | s731316956 | s592965509 | 1,087 | 405 | 66,268 | 59,484 | Accepted | Accepted | 62.74 | import sys
input = sys.stdin.buffer.readline
n, m, q = list(map(int, input().split()))
counts = [[0 for _ in range(n+1)] for _ in range(n+1)]
for _ in range(m):
l, r = list(map(int, input().split()))
counts[l][r] += 1
s = [[0 for _ in range(n+1)] for _ in range(n+1)]
# 横方向
for i in range(n+1):
... | import sys
input = sys.stdin.buffer.readline
n, m, q = list(map(int, input().split()))
class TwoDimSum():
def __init__(self, h, w):
self.h = h
self.w = w
self.counts = [[0 for _ in range(w+1)] for _ in range(h+1)]
self.s = [[0 for _ in range(w+1)] for _ in range(h+1)]
... | 34 | 38 | 745 | 1,080 | import sys
input = sys.stdin.buffer.readline
n, m, q = list(map(int, input().split()))
counts = [[0 for _ in range(n + 1)] for _ in range(n + 1)]
for _ in range(m):
l, r = list(map(int, input().split()))
counts[l][r] += 1
s = [[0 for _ in range(n + 1)] for _ in range(n + 1)]
# 横方向
for i in range(n + 1):
v ... | import sys
input = sys.stdin.buffer.readline
n, m, q = list(map(int, input().split()))
class TwoDimSum:
def __init__(self, h, w):
self.h = h
self.w = w
self.counts = [[0 for _ in range(w + 1)] for _ in range(h + 1)]
self.s = [[0 for _ in range(w + 1)] for _ in range(h + 1)]
d... | false | 10.526316 | [
"-counts = [[0 for _ in range(n + 1)] for _ in range(n + 1)]",
"+",
"+",
"+class TwoDimSum:",
"+ def __init__(self, h, w):",
"+ self.h = h",
"+ self.w = w",
"+ self.counts = [[0 for _ in range(w + 1)] for _ in range(h + 1)]",
"+ self.s = [[0 for _ in range(w + 1)] for ... | false | 0.038257 | 0.047372 | 0.807573 | [
"s731316956",
"s592965509"
] |
u057964173 | p02743 | python | s602834697 | s504118163 | 179 | 36 | 38,384 | 5,204 | Accepted | Accepted | 79.89 | import sys
def input(): return sys.stdin.readline().strip()
def resolve():
a,b,c=list(map(int, input().split()))
if ((c-a-b)**2 > 4*a*b) and (c-a-b>0):
print('Yes')
else:
print('No')
resolve() | import sys
from decimal import Decimal
def input(): return sys.stdin.readline().strip()
def resolve():
a,b,c=list(map(int, input().split()))
if Decimal(a).sqrt()+Decimal(b).sqrt()<Decimal(c).sqrt():
print('Yes')
else:
print('No')
resolve() | 10 | 11 | 224 | 272 | import sys
def input():
return sys.stdin.readline().strip()
def resolve():
a, b, c = list(map(int, input().split()))
if ((c - a - b) ** 2 > 4 * a * b) and (c - a - b > 0):
print("Yes")
else:
print("No")
resolve()
| import sys
from decimal import Decimal
def input():
return sys.stdin.readline().strip()
def resolve():
a, b, c = list(map(int, input().split()))
if Decimal(a).sqrt() + Decimal(b).sqrt() < Decimal(c).sqrt():
print("Yes")
else:
print("No")
resolve()
| false | 9.090909 | [
"+from decimal import Decimal",
"- if ((c - a - b) ** 2 > 4 * a * b) and (c - a - b > 0):",
"+ if Decimal(a).sqrt() + Decimal(b).sqrt() < Decimal(c).sqrt():"
] | false | 0.040186 | 0.038676 | 1.03905 | [
"s602834697",
"s504118163"
] |
u644516473 | p03835 | python | s214612618 | s690667169 | 1,530 | 821 | 3,060 | 2,940 | Accepted | Accepted | 46.34 | k, s = list(map(int, input().split()))
ans = 0
for x in range(k+1):
for y in range(k+1):
z = s - (x + y)
if 0 <= z <= k:
ans += 1
print(ans)
| def main():
k, s = list(map(int, input().split()))
ans = 0
for x in range(k+1):
for y in range(k+1):
if 0 <= s - (x + y) <= k:
ans += 1
print(ans)
if __name__ == "__main__":
main()
| 9 | 13 | 176 | 246 | k, s = list(map(int, input().split()))
ans = 0
for x in range(k + 1):
for y in range(k + 1):
z = s - (x + y)
if 0 <= z <= k:
ans += 1
print(ans)
| def main():
k, s = list(map(int, input().split()))
ans = 0
for x in range(k + 1):
for y in range(k + 1):
if 0 <= s - (x + y) <= k:
ans += 1
print(ans)
if __name__ == "__main__":
main()
| false | 30.769231 | [
"-k, s = list(map(int, input().split()))",
"-ans = 0",
"-for x in range(k + 1):",
"- for y in range(k + 1):",
"- z = s - (x + y)",
"- if 0 <= z <= k:",
"- ans += 1",
"-print(ans)",
"+def main():",
"+ k, s = list(map(int, input().split()))",
"+ ans = 0",
"+ ... | false | 0.031208 | 0.035195 | 0.886706 | [
"s214612618",
"s690667169"
] |
u021019433 | p02873 | python | s629360630 | s078410758 | 294 | 215 | 4,468 | 4,468 | Accepted | Accepted | 26.87 | from itertools import groupby
r = p = 0
for k, g in groupby(eval(input())):
l = sum(1 for _ in g)
r += l * (l + 1) // 2
if k == '>':
r -= min(l, p)
p = l
print(r)
| from itertools import groupby
r = p = 0
for k, g in groupby(eval(input())):
i = 0
for _ in g:
i += 1
r += i
if k == '>':
r -= min(i, p)
p = i
print(r)
| 10 | 12 | 191 | 198 | from itertools import groupby
r = p = 0
for k, g in groupby(eval(input())):
l = sum(1 for _ in g)
r += l * (l + 1) // 2
if k == ">":
r -= min(l, p)
p = l
print(r)
| from itertools import groupby
r = p = 0
for k, g in groupby(eval(input())):
i = 0
for _ in g:
i += 1
r += i
if k == ">":
r -= min(i, p)
p = i
print(r)
| false | 16.666667 | [
"- l = sum(1 for _ in g)",
"- r += l * (l + 1) // 2",
"+ i = 0",
"+ for _ in g:",
"+ i += 1",
"+ r += i",
"- r -= min(l, p)",
"- p = l",
"+ r -= min(i, p)",
"+ p = i"
] | false | 0.065803 | 0.040641 | 1.619113 | [
"s629360630",
"s078410758"
] |
u941753895 | p03715 | python | s845284296 | s958321069 | 483 | 406 | 5,556 | 5,204 | Accepted | Accepted | 15.94 | import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,queue,copy
sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7
dd=[(-1,0),(0,1),(1,0),(0,-1)]
ddn=[(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]
def LI(): return [int(x) for x in sys.stdin.readline().split()]
de... | # https://atcoder.jp/contests/arc026/tasks/arc026_2
import math,itertools,fractions,heapq,collections,bisect,sys,queue,copy
sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7
dd=[(-1,0),(0,1),(1,0),(0,-1)]
ddn=[(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]
def LI(): return [int(x) for x in sys.stdi... | 47 | 44 | 1,065 | 962 | import math, string, itertools, fractions, heapq, collections, re, array, bisect, sys, random, time, queue, copy
sys.setrecursionlimit(10**7)
inf = 10**20
mod = 10**9 + 7
dd = [(-1, 0), (0, 1), (1, 0), (0, -1)]
ddn = [(-1, 0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1)]
def LI():
return [int(x) ... | # https://atcoder.jp/contests/arc026/tasks/arc026_2
import math, itertools, fractions, heapq, collections, bisect, sys, queue, copy
sys.setrecursionlimit(10**7)
inf = 10**20
mod = 10**9 + 7
dd = [(-1, 0), (0, 1), (1, 0), (0, -1)]
ddn = [(-1, 0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1)]
def LI():
... | false | 6.382979 | [
"-import math, string, itertools, fractions, heapq, collections, re, array, bisect, sys, random, time, queue, copy",
"+# https://atcoder.jp/contests/arc026/tasks/arc026_2",
"+import math, itertools, fractions, heapq, collections, bisect, sys, queue, copy",
"-",
"-",
"-def LI_():",
"- return [int(x) -... | false | 0.008538 | 0.039467 | 0.216328 | [
"s845284296",
"s958321069"
] |
u923662841 | p02886 | python | s093260924 | s011788833 | 30 | 25 | 9,072 | 9,168 | Accepted | Accepted | 16.67 | import itertools
N = int(eval(input()))
D = list(input().split())
a = itertools.combinations(D,2)
sum= 0
for i,j in a:
sum += eval("{} * {}".format(i,j))
print(sum) | N = int(eval(input()))
D = list(map(int,input().split()))
print(((sum(D)**2-sum(list([x**2 for x in D])))//2)) | 8 | 3 | 169 | 107 | import itertools
N = int(eval(input()))
D = list(input().split())
a = itertools.combinations(D, 2)
sum = 0
for i, j in a:
sum += eval("{} * {}".format(i, j))
print(sum)
| N = int(eval(input()))
D = list(map(int, input().split()))
print(((sum(D) ** 2 - sum(list([x**2 for x in D]))) // 2))
| false | 62.5 | [
"-import itertools",
"-",
"-D = list(input().split())",
"-a = itertools.combinations(D, 2)",
"-sum = 0",
"-for i, j in a:",
"- sum += eval(\"{} * {}\".format(i, j))",
"-print(sum)",
"+D = list(map(int, input().split()))",
"+print(((sum(D) ** 2 - sum(list([x**2 for x in D]))) // 2))"
] | false | 0.079882 | 0.040573 | 1.968834 | [
"s093260924",
"s011788833"
] |
u255317651 | p02432 | python | s308001269 | s037217900 | 1,940 | 1,630 | 80,904 | 21,984 | Accepted | Accepted | 15.98 | # -*- coding: utf-8 -*-
"""
Created on Sat May 19 15:10:55 2018
AOJ ITP2_1_B
@author: maezawa
"""
#import numpy as np
q = int(eval(input()))
a = [0 for _ in range(8000000)]
start = 4000000
end = 4000001
for i in range(q):
ops = list(map(int,input().split()))
if ops[0] == 0:
if ops[1] == 0:... | # -*- coding: utf-8 -*-
"""
Created on Sun Jun 24 14:53:50 2018
ITP21B
@author: maezawa
"""
from collections import deque
d = deque()
n = int(eval(input()))
for i in range(n):
c = list(map(int, input().split()))
if c[0] == 0:
if c[1] == 0:
d.appendleft(c[2])
els... | 28 | 29 | 642 | 489 | # -*- coding: utf-8 -*-
"""
Created on Sat May 19 15:10:55 2018
AOJ ITP2_1_B
@author: maezawa
"""
# import numpy as np
q = int(eval(input()))
a = [0 for _ in range(8000000)]
start = 4000000
end = 4000001
for i in range(q):
ops = list(map(int, input().split()))
if ops[0] == 0:
if ops[1] == 0:
... | # -*- coding: utf-8 -*-
"""
Created on Sun Jun 24 14:53:50 2018
ITP21B
@author: maezawa
"""
from collections import deque
d = deque()
n = int(eval(input()))
for i in range(n):
c = list(map(int, input().split()))
if c[0] == 0:
if c[1] == 0:
d.appendleft(c[2])
else:
d.appe... | false | 3.448276 | [
"-Created on Sat May 19 15:10:55 2018",
"-AOJ ITP2_1_B",
"+Created on Sun Jun 24 14:53:50 2018",
"+ITP21B",
"-# import numpy as np",
"-q = int(eval(input()))",
"-a = [0 for _ in range(8000000)]",
"-start = 4000000",
"-end = 4000001",
"-for i in range(q):",
"- ops = list(map(int, input().split... | false | 1.036298 | 0.046263 | 22.400051 | [
"s308001269",
"s037217900"
] |
u058781705 | p03280 | python | s284994540 | s118274888 | 165 | 110 | 38,256 | 61,560 | Accepted | Accepted | 33.33 |
import collections
def solve():
A, B = list(map(int, input().split()))
print((A*B-(A+B-1)))
if __name__ == "__main__":
solve()
| A, B = list(map(int, input().split()))
print(((A-1)*(B-1)))
| 13 | 3 | 150 | 55 | import collections
def solve():
A, B = list(map(int, input().split()))
print((A * B - (A + B - 1)))
if __name__ == "__main__":
solve()
| A, B = list(map(int, input().split()))
print(((A - 1) * (B - 1)))
| false | 76.923077 | [
"-import collections",
"-",
"-",
"-def solve():",
"- A, B = list(map(int, input().split()))",
"- print((A * B - (A + B - 1)))",
"-",
"-",
"-if __name__ == \"__main__\":",
"- solve()",
"+A, B = list(map(int, input().split()))",
"+print(((A - 1) * (B - 1)))"
] | false | 0.043919 | 0.102726 | 0.427539 | [
"s284994540",
"s118274888"
] |
u133936772 | p02615 | python | s090077811 | s630407363 | 254 | 229 | 31,612 | 31,468 | Accepted | Accepted | 9.84 | n,*l=list(map(int,open(0).read().split()))
from heapq import *
l.sort()
hq=[-l.pop()]
heapify(hq)
a=0
for _ in range(n-1):
m=heappop(hq)
a-=m
t=-l.pop()
heappush(hq,t)
heappush(hq,t)
print(a) | n,*l=list(map(int,open(0).read().split()))
from heapq import *
l.sort()
q=[-l.pop()]
a=0
for _ in range(n-1):
m=heappop(q)
a-=m
t=-l.pop()
heappush(q,t)
heappush(q,t)
print(a) | 13 | 12 | 207 | 190 | n, *l = list(map(int, open(0).read().split()))
from heapq import *
l.sort()
hq = [-l.pop()]
heapify(hq)
a = 0
for _ in range(n - 1):
m = heappop(hq)
a -= m
t = -l.pop()
heappush(hq, t)
heappush(hq, t)
print(a)
| n, *l = list(map(int, open(0).read().split()))
from heapq import *
l.sort()
q = [-l.pop()]
a = 0
for _ in range(n - 1):
m = heappop(q)
a -= m
t = -l.pop()
heappush(q, t)
heappush(q, t)
print(a)
| false | 7.692308 | [
"-hq = [-l.pop()]",
"-heapify(hq)",
"+q = [-l.pop()]",
"- m = heappop(hq)",
"+ m = heappop(q)",
"- heappush(hq, t)",
"- heappush(hq, t)",
"+ heappush(q, t)",
"+ heappush(q, t)"
] | false | 0.081914 | 0.047066 | 1.74041 | [
"s090077811",
"s630407363"
] |
u912237403 | p00103 | python | s331798007 | s289950062 | 20 | 10 | 4,212 | 4,208 | Accepted | Accepted | 50 | n=eval(input())
for _ in [0]*n:
i=0
b=0
c=0
while i<3:
s=input()[1]
if s=='I':
if b==3:c+=1
else: b+=1
elif s=='O':
c+=b+1
b=0
elif s=='U':i+=1
print(c) | n=eval(input())
for _ in [0]*n:
i,b,c=0,0,0
while i<3:
s="IOU".index(input()[1])
if s==0:
if b==3: c+=1
else: b+=1
elif s==1:
c+=b+1
b=0
elif s==2: i+=1
print(c) | 15 | 13 | 213 | 216 | n = eval(input())
for _ in [0] * n:
i = 0
b = 0
c = 0
while i < 3:
s = input()[1]
if s == "I":
if b == 3:
c += 1
else:
b += 1
elif s == "O":
c += b + 1
b = 0
elif s == "U":
i += 1
... | n = eval(input())
for _ in [0] * n:
i, b, c = 0, 0, 0
while i < 3:
s = "IOU".index(input()[1])
if s == 0:
if b == 3:
c += 1
else:
b += 1
elif s == 1:
c += b + 1
b = 0
elif s == 2:
i += 1
... | false | 13.333333 | [
"- i = 0",
"- b = 0",
"- c = 0",
"+ i, b, c = 0, 0, 0",
"- s = input()[1]",
"- if s == \"I\":",
"+ s = \"IOU\".index(input()[1])",
"+ if s == 0:",
"- elif s == \"O\":",
"+ elif s == 1:",
"- elif s == \"U\":",
"+ elif s == 2:"
... | false | 0.047894 | 0.048808 | 0.981268 | [
"s331798007",
"s289950062"
] |
u156302018 | p03846 | python | s862005409 | s242388910 | 57 | 41 | 13,940 | 13,880 | Accepted | Accepted | 28.07 | n = int(eval(input()))
a = input().split()
int_a =[]
for i in range(len(a)):
int_a.append(int(a[i]))
if n % 2 == 0:
kakeru = n
else:
kakeru = n + 1
if sum(int_a) == kakeru * (n // 2):
syou = n // 2
answer = 2 ** syou
print((answer % ((10 ** 9) + 7)))
else:
print("0")
| n = int(eval(input()))
int_a = list(map(int, input().split()))
if n % 2 == 0:
kakeru = n
else:
kakeru = n + 1
if sum(int_a) == kakeru * (n // 2):
syou = n // 2
answer = 2 ** syou
print((answer % ((10 ** 9) + 7)))
else:
print("0")
| 16 | 14 | 304 | 261 | n = int(eval(input()))
a = input().split()
int_a = []
for i in range(len(a)):
int_a.append(int(a[i]))
if n % 2 == 0:
kakeru = n
else:
kakeru = n + 1
if sum(int_a) == kakeru * (n // 2):
syou = n // 2
answer = 2**syou
print((answer % ((10**9) + 7)))
else:
print("0")
| n = int(eval(input()))
int_a = list(map(int, input().split()))
if n % 2 == 0:
kakeru = n
else:
kakeru = n + 1
if sum(int_a) == kakeru * (n // 2):
syou = n // 2
answer = 2**syou
print((answer % ((10**9) + 7)))
else:
print("0")
| false | 12.5 | [
"-a = input().split()",
"-int_a = []",
"-for i in range(len(a)):",
"- int_a.append(int(a[i]))",
"+int_a = list(map(int, input().split()))"
] | false | 0.043821 | 0.058946 | 0.743407 | [
"s862005409",
"s242388910"
] |
u312025627 | p02984 | python | s926461677 | s863463895 | 653 | 126 | 69,940 | 14,024 | Accepted | Accepted | 80.7 | import numpy as np
from scipy.sparse import csr_matrix,linalg
import itertools
n = int(eval(input()))
b = np.array([int(i) for i in input().split()])
rows = []
cols = []
for i in range(n):
rows.append(i%n)
rows.append(i%n)
cols.append(i%n)
cols.append((i+1)%n)
A = csr_matrix((np.ones(n*2,d... | n = int(eval(input()))
a = [int(i) for i in input().split()]
s = sum(a)
x = [0] * n
x[0] = (s - 2 * sum((a[i] for i in range(1,n,2))))
for i in range(n-1):
x[i+1] = (2 * a[i] - x[i])
print((*x)) | 16 | 10 | 404 | 201 | import numpy as np
from scipy.sparse import csr_matrix, linalg
import itertools
n = int(eval(input()))
b = np.array([int(i) for i in input().split()])
rows = []
cols = []
for i in range(n):
rows.append(i % n)
rows.append(i % n)
cols.append(i % n)
cols.append((i + 1) % n)
A = csr_matrix((np.ones(n * 2, ... | n = int(eval(input()))
a = [int(i) for i in input().split()]
s = sum(a)
x = [0] * n
x[0] = s - 2 * sum((a[i] for i in range(1, n, 2)))
for i in range(n - 1):
x[i + 1] = 2 * a[i] - x[i]
print((*x))
| false | 37.5 | [
"-import numpy as np",
"-from scipy.sparse import csr_matrix, linalg",
"-import itertools",
"-",
"-b = np.array([int(i) for i in input().split()])",
"-rows = []",
"-cols = []",
"-for i in range(n):",
"- rows.append(i % n)",
"- rows.append(i % n)",
"- cols.append(i % n)",
"- cols.ap... | false | 0.951391 | 0.038634 | 24.625589 | [
"s926461677",
"s863463895"
] |
u424467986 | p02725 | python | s068360122 | s236285166 | 188 | 156 | 26,444 | 26,420 | Accepted | Accepted | 17.02 | # スペース区切りの文字列の入力
K, N = (int(x) for x in input().split())
A = [int(x) for x in input().split()]
ans = 0
max = 0
for i in range(N):
if(i == N - 1):
A2 = K + A[0]
else:
A2 = A[i+1]
# 距離が最大のもの以外をansに加算
if(max < abs(A2 - A[i])):
ans += max
max = abs(A2 - A[i])
else:
... | # スペース区切りの文字列の入力
K, N = (int(x) for x in input().split())
A = [int(x) for x in input().split()]
# 最も離れた場所を求める(通常)
max_val = 0
for i in range(N-1):
max_val = max(max_val, A[i+1] - A[i])
# 最も離れた場所を求める(先頭と終端)
max_val = max(max_val, K - A[N-1] + A[0])
print((K-max_val)) | 21 | 12 | 358 | 279 | # スペース区切りの文字列の入力
K, N = (int(x) for x in input().split())
A = [int(x) for x in input().split()]
ans = 0
max = 0
for i in range(N):
if i == N - 1:
A2 = K + A[0]
else:
A2 = A[i + 1]
# 距離が最大のもの以外をansに加算
if max < abs(A2 - A[i]):
ans += max
max = abs(A2 - A[i])
else:
... | # スペース区切りの文字列の入力
K, N = (int(x) for x in input().split())
A = [int(x) for x in input().split()]
# 最も離れた場所を求める(通常)
max_val = 0
for i in range(N - 1):
max_val = max(max_val, A[i + 1] - A[i])
# 最も離れた場所を求める(先頭と終端)
max_val = max(max_val, K - A[N - 1] + A[0])
print((K - max_val))
| false | 42.857143 | [
"-ans = 0",
"-max = 0",
"-for i in range(N):",
"- if i == N - 1:",
"- A2 = K + A[0]",
"- else:",
"- A2 = A[i + 1]",
"- # 距離が最大のもの以外をansに加算",
"- if max < abs(A2 - A[i]):",
"- ans += max",
"- max = abs(A2 - A[i])",
"- else:",
"- ans += abs(A2 -... | false | 0.03688 | 0.03625 | 1.017395 | [
"s068360122",
"s236285166"
] |
u278670845 | p03476 | python | s544631306 | s759354464 | 853 | 248 | 7,716 | 7,716 | Accepted | Accepted | 70.93 | import itertools
def prime_boolean_table(n):
primes = [True] * (n + 1)
primes[0] = False
primes[1] = False
for i in range(2, n + 1):
if primes[i]:
for j in range(i + i, n + 1, i):
primes[j] = False
return primes
pl = prime_boolean_table(10**5)
ql = ... | import itertools
import sys
input = sys.stdin.readline
def prime_boolean_table(n):
primes = [True] * (n + 1)
primes[0] = False
primes[1] = False
for i in range(2, n + 1):
if primes[i]:
for j in range(i + i, n + 1, i):
primes[j] = False
return primes
... | 22 | 28 | 551 | 683 | import itertools
def prime_boolean_table(n):
primes = [True] * (n + 1)
primes[0] = False
primes[1] = False
for i in range(2, n + 1):
if primes[i]:
for j in range(i + i, n + 1, i):
primes[j] = False
return primes
pl = prime_boolean_table(10**5)
ql = [0] * (10**... | import itertools
import sys
input = sys.stdin.readline
def prime_boolean_table(n):
primes = [True] * (n + 1)
primes[0] = False
primes[1] = False
for i in range(2, n + 1):
if primes[i]:
for j in range(i + i, n + 1, i):
primes[j] = False
return primes
def main(... | false | 21.428571 | [
"+import sys",
"+",
"+input = sys.stdin.readline",
"-pl = prime_boolean_table(10**5)",
"-ql = [0] * (10**5 + 1)",
"-for i in range(1, 10**5 + 1):",
"- if pl[i] and pl[(i + 1) // 2]:",
"- ql[i] += 1",
"-ql = list(itertools.accumulate(ql))",
"-q = int(eval(input()))",
"-for _ in range(q)... | false | 0.068556 | 0.092954 | 0.737527 | [
"s544631306",
"s759354464"
] |
u285891772 | p02756 | python | s955363708 | s074893210 | 578 | 503 | 108,120 | 95,192 | Accepted | Accepted | 12.98 | import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, tan, asin, acos, atan, radians, degrees#, log2
from itertools import accumulate, permutations, combinations, combinations_with_replacement, product, groupby
from operator import itemgetter... | import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, tan, asin, acos, atan, radians, degrees#, log2
from itertools import accumulate, permutations, combinations, combinations_with_replacement, product, groupby
from operator import itemgetter... | 39 | 41 | 1,211 | 1,201 | import sys, re
from collections import deque, defaultdict, Counter
from math import (
ceil,
sqrt,
hypot,
factorial,
pi,
sin,
cos,
tan,
asin,
acos,
atan,
radians,
degrees,
) # , log2
from itertools import (
accumulate,
permutations,
combinations,
combi... | import sys, re
from collections import deque, defaultdict, Counter
from math import (
ceil,
sqrt,
hypot,
factorial,
pi,
sin,
cos,
tan,
asin,
acos,
atan,
radians,
degrees,
) # , log2
from itertools import (
accumulate,
permutations,
combinations,
combi... | false | 4.878049 | [
"- return int(input())",
"+ return int(eval(input()))",
"- return map(int, input().split())",
"+ return list(map(int, input().split()))",
"- return zip(*(MAP() for _ in range(n)))",
"+ return list(zip(*(MAP() for _ in range(n))))",
"-S = input()",
"+S = eval(input())",
"-if flg == ... | false | 0.101079 | 0.118825 | 0.850652 | [
"s955363708",
"s074893210"
] |
u906501980 | p02689 | python | s434412557 | s645787713 | 256 | 228 | 84,828 | 84,840 | Accepted | Accepted | 10.94 | def main():
n, m = list(map(int, input().split()))
h = list(map(int, input().split()))
to = [0]*(n+1)
ans = 0
for _ in range(m):
a, b = list(map(int, input().split()))
to[a] = max(to[a], h[b-1])
to[b] = max(to[b], h[a-1])
for i, hi in enumerate(h, 1):
t ... | def main():
n, m = list(map(int, input().split()))
h = list(map(int, input().split()))
to = [0]*(n+1)
ans = 0
for _ in range(m):
a, b = list(map(int, input().split()))
to[a] = max(to[a], h[b-1])
to[b] = max(to[b], h[a-1])
for i, hi in enumerate(h, 1):
if... | 17 | 16 | 425 | 400 | def main():
n, m = list(map(int, input().split()))
h = list(map(int, input().split()))
to = [0] * (n + 1)
ans = 0
for _ in range(m):
a, b = list(map(int, input().split()))
to[a] = max(to[a], h[b - 1])
to[b] = max(to[b], h[a - 1])
for i, hi in enumerate(h, 1):
t = ... | def main():
n, m = list(map(int, input().split()))
h = list(map(int, input().split()))
to = [0] * (n + 1)
ans = 0
for _ in range(m):
a, b = list(map(int, input().split()))
to[a] = max(to[a], h[b - 1])
to[b] = max(to[b], h[a - 1])
for i, hi in enumerate(h, 1):
if h... | false | 5.882353 | [
"- t = to[i]",
"- if t == 0 or hi > t:",
"+ if hi > to[i]:"
] | false | 0.042726 | 0.03958 | 1.079483 | [
"s434412557",
"s645787713"
] |
u145035045 | p03287 | python | s194938935 | s338729696 | 92 | 83 | 17,368 | 16,348 | Accepted | Accepted | 9.78 | from collections import Counter
n, m = list(map(int, input().split()))
alst = list(map(int, input().split()))
acc = 0
acc_alst = []
for a in alst:
acc += a
acc %= m
acc_alst.append(acc)
count = Counter(acc_alst)
ans = 0
for k, v in list(count.items()):
if k == 0:
ans += v
if v >= 2:
a... | from collections import Counter as C
from itertools import accumulate as a
def inp():return list(map(int,input().split()))
n,m = inp()
print((sum([v*(v-1)//2+(0 if k else v)for k,v in list(C([x%m for x in a(inp())]).items())]))) | 18 | 5 | 342 | 221 | from collections import Counter
n, m = list(map(int, input().split()))
alst = list(map(int, input().split()))
acc = 0
acc_alst = []
for a in alst:
acc += a
acc %= m
acc_alst.append(acc)
count = Counter(acc_alst)
ans = 0
for k, v in list(count.items()):
if k == 0:
ans += v
if v >= 2:
... | from collections import Counter as C
from itertools import accumulate as a
def inp():
return list(map(int, input().split()))
n, m = inp()
print(
(
sum(
[
v * (v - 1) // 2 + (0 if k else v)
for k, v in list(C([x % m for x in a(inp())]).items())
... | false | 72.222222 | [
"-from collections import Counter",
"+from collections import Counter as C",
"+from itertools import accumulate as a",
"-n, m = list(map(int, input().split()))",
"-alst = list(map(int, input().split()))",
"-acc = 0",
"-acc_alst = []",
"-for a in alst:",
"- acc += a",
"- acc %= m",
"- ac... | false | 0.048602 | 0.046261 | 1.050604 | [
"s194938935",
"s338729696"
] |
u585482323 | p02972 | python | s382014667 | s291891853 | 337 | 289 | 73,976 | 68,856 | Accepted | Accepted | 14.24 | #!usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS():return [list(x) for x in sys.stdin.readline()... | #!usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
from itertools import permutations
import sys
import math
import bisect
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS():return [list(x) for x in... | 99 | 46 | 1,806 | 1,076 | #!usr/bin/env python3
from collections import defaultdict, deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI():
return [int(x) for x in sys.stdin.readline().split()]
def I():
return int(sys.stdin.readline())
def LS():
return [list(x) for x in sys.stdin... | #!usr/bin/env python3
from collections import defaultdict, deque
from heapq import heappush, heappop
from itertools import permutations
import sys
import math
import bisect
def LI():
return [int(x) for x in sys.stdin.readline().split()]
def I():
return int(sys.stdin.readline())
def LS():
return [list(... | false | 53.535354 | [
"+from itertools import permutations",
"-import random",
"- return list(sys.stdin.readline())[:-1]",
"+ res = list(sys.stdin.readline())",
"+ if res[-1] == \"\\n\":",
"+ return res[:-1]",
"+ return res",
"-# A",
"-def A():",
"- n = I()",
"- print((3 * n**2))",
"- re... | false | 0.049248 | 0.047699 | 1.032461 | [
"s382014667",
"s291891853"
] |
u350508326 | p00219 | python | s717026956 | s870268223 | 170 | 110 | 9,472 | 7,404 | Accepted | Accepted | 35.29 | #!/usr/bin/env python3
while True:
n = int(input())
data = [0] * 10
if n == 0:
break
for _ in range(n):
in_data = int(input())
data[in_data] += 1
for d in data:
for _ in range(d):
print("*", end="")
if d == 0:
print... | #!/usr/bin/env python3
while True:
n = int(eval(input()))
data = [0] * 10
if n == 0:
break
for _ in range(n):
in_data = int(eval(input()))
data[in_data] += 1
for d in data:
if d == 0:
print("-")
else:
print(("*" * d)) | 20 | 17 | 369 | 306 | #!/usr/bin/env python3
while True:
n = int(input())
data = [0] * 10
if n == 0:
break
for _ in range(n):
in_data = int(input())
data[in_data] += 1
for d in data:
for _ in range(d):
print("*", end="")
if d == 0:
print("-")
else:
... | #!/usr/bin/env python3
while True:
n = int(eval(input()))
data = [0] * 10
if n == 0:
break
for _ in range(n):
in_data = int(eval(input()))
data[in_data] += 1
for d in data:
if d == 0:
print("-")
else:
print(("*" * d))
| false | 15 | [
"- n = int(input())",
"+ n = int(eval(input()))",
"- in_data = int(input())",
"+ in_data = int(eval(input()))",
"- for _ in range(d):",
"- print(\"*\", end=\"\")",
"- print(end=\"\\n\")",
"+ print((\"*\" * d))"
] | false | 0.032979 | 0.042371 | 0.778344 | [
"s717026956",
"s870268223"
] |
u226108478 | p03634 | python | s626871512 | s694376930 | 1,669 | 845 | 106,204 | 64,808 | Accepted | Accepted | 49.37 | # -*- coding: utf-8 -*-
def main():
from collections import defaultdict
from collections import deque
n = int(eval(input()))
graph = [defaultdict(int) for _ in range(n)]
visited = [False for _ in range(n)]
dist = [0 for _ in range(n)]
for i in range(n - 1):
ai, bi, c... | # -*- coding: utf-8 -*-
def main():
from collections import defaultdict
from collections import deque
n = int(eval(input()))
graph = [defaultdict(int) for _ in range(n)]
visited = [False for _ in range(n)]
dist = [float('inf') for _ in range(n)]
for i in range(n - 1):
... | 45 | 49 | 956 | 1,043 | # -*- coding: utf-8 -*-
def main():
from collections import defaultdict
from collections import deque
n = int(eval(input()))
graph = [defaultdict(int) for _ in range(n)]
visited = [False for _ in range(n)]
dist = [0 for _ in range(n)]
for i in range(n - 1):
ai, bi, ci = list(map(int... | # -*- coding: utf-8 -*-
def main():
from collections import defaultdict
from collections import deque
n = int(eval(input()))
graph = [defaultdict(int) for _ in range(n)]
visited = [False for _ in range(n)]
dist = [float("inf") for _ in range(n)]
for i in range(n - 1):
ai, bi, ci = l... | false | 8.163265 | [
"- dist = [0 for _ in range(n)]",
"+ dist = [float(\"inf\") for _ in range(n)]",
"+ ans = [0 for _ in range(q)]",
"- print((dist[xi] + dist[yi]))",
"+ ans[j] = dist[xi] + dist[yi]",
"+ print((\"\\n\".join(map(str, ans))))"
] | false | 0.108098 | 0.048212 | 2.242161 | [
"s626871512",
"s694376930"
] |
u606045429 | p03576 | python | s574876341 | s907004865 | 30 | 27 | 3,064 | 3,828 | Accepted | Accepted | 10 | INF = float("inf")
N, K, *XY = list(map(int, open(0).read().split()))
X, Y = list(zip(*sorted(zip(*[iter(XY)] * 2))))
ans = INF
for k in range(K, N + 1):
for i in range(N - k + 1):
dx = X[i + k - 1] - X[i]
YY = sorted(Y[i:i + k])
for j in range(k - K + 1):
dy = YY[... | N, K, *XY = list(map(int, open(0).read().split()))
X, Y = list(zip(*sorted(zip(*[iter(XY)] * 2))))
cand = []
for k in range(K, N + 1):
for i in range(N - k + 1):
dx = X[i + k - 1] - X[i]
YY = sorted(Y[i:i + k])
cand += [dx * (YY[j + K - 1] - YY[j]) for j in range(k - K + 1)]
pr... | 16 | 12 | 377 | 322 | INF = float("inf")
N, K, *XY = list(map(int, open(0).read().split()))
X, Y = list(zip(*sorted(zip(*[iter(XY)] * 2))))
ans = INF
for k in range(K, N + 1):
for i in range(N - k + 1):
dx = X[i + k - 1] - X[i]
YY = sorted(Y[i : i + k])
for j in range(k - K + 1):
dy = YY[j + K - 1] - ... | N, K, *XY = list(map(int, open(0).read().split()))
X, Y = list(zip(*sorted(zip(*[iter(XY)] * 2))))
cand = []
for k in range(K, N + 1):
for i in range(N - k + 1):
dx = X[i + k - 1] - X[i]
YY = sorted(Y[i : i + k])
cand += [dx * (YY[j + K - 1] - YY[j]) for j in range(k - K + 1)]
print((min(can... | false | 25 | [
"-INF = float(\"inf\")",
"-ans = INF",
"+cand = []",
"- for j in range(k - K + 1):",
"- dy = YY[j + K - 1] - YY[j]",
"- ans = min(ans, dx * dy)",
"-print(ans)",
"+ cand += [dx * (YY[j + K - 1] - YY[j]) for j in range(k - K + 1)]",
"+print((min(cand)))"
] | false | 0.036474 | 0.038255 | 0.953443 | [
"s574876341",
"s907004865"
] |
u043048943 | p03069 | python | s204611850 | s866846090 | 74 | 58 | 3,500 | 3,500 | Accepted | Accepted | 21.62 | _,S=eval(input()),eval(input())
numc,numw,numcmin=0,0,0
for s in S:
if s == '#':
numc = numc + 1
else:
numw = numw + 1
numc = numc - 1
if numc < numcmin:
numcmin = numc
print((numcmin + numw)) | _,S=eval(input()),eval(input())
numw=S.count('.')
numc,numcmin=0,0
for s in S:
if s == '#':
numc = numc + 1
else:
numc = numc - 1
if numc < numcmin:
numcmin = numc
print((numcmin+numw)) | 11 | 11 | 240 | 225 | _, S = eval(input()), eval(input())
numc, numw, numcmin = 0, 0, 0
for s in S:
if s == "#":
numc = numc + 1
else:
numw = numw + 1
numc = numc - 1
if numc < numcmin:
numcmin = numc
print((numcmin + numw))
| _, S = eval(input()), eval(input())
numw = S.count(".")
numc, numcmin = 0, 0
for s in S:
if s == "#":
numc = numc + 1
else:
numc = numc - 1
if numc < numcmin:
numcmin = numc
print((numcmin + numw))
| false | 0 | [
"-numc, numw, numcmin = 0, 0, 0",
"+numw = S.count(\".\")",
"+numc, numcmin = 0, 0",
"- numw = numw + 1"
] | false | 0.037402 | 0.077054 | 0.485406 | [
"s204611850",
"s866846090"
] |
u633068244 | p00082 | python | s149287624 | s906512548 | 20 | 10 | 4,252 | 4,248 | Accepted | Accepted | 50 | cart = [4,1,4,1,2,1,2,1]
while True:
try:
que = list(map(int, input().split()))
mx,mxcart = 0, "99999999"
for sp in range(8):
sm = 0
for num in range(8):
if cart[(sp+num)%8] <= que[num]:
sm += cart[(sp+num)%8]
else:
sm += que[num]
if sm > mx:
mx = sm
mxcart = "".j... | c = [4,1,4,1,2,1,2,1]
while True:
try:
que = list(map(int, input().split()))
mx,mxc = 0, "99999999"
for sp in range(8):
sm = 0
for num in range(8):
sm += c[(sp+num)%8] if c[(sp+num)%8] <= que[num] else que[num]
if sm > mx:
mx = sm
mxc = "".join(map(str, c[sp:]+c[:sp]))
elif sm... | 22 | 19 | 533 | 463 | cart = [4, 1, 4, 1, 2, 1, 2, 1]
while True:
try:
que = list(map(int, input().split()))
mx, mxcart = 0, "99999999"
for sp in range(8):
sm = 0
for num in range(8):
if cart[(sp + num) % 8] <= que[num]:
sm += cart[(sp + num) % 8]
... | c = [4, 1, 4, 1, 2, 1, 2, 1]
while True:
try:
que = list(map(int, input().split()))
mx, mxc = 0, "99999999"
for sp in range(8):
sm = 0
for num in range(8):
sm += c[(sp + num) % 8] if c[(sp + num) % 8] <= que[num] else que[num]
if sm > mx:
... | false | 13.636364 | [
"-cart = [4, 1, 4, 1, 2, 1, 2, 1]",
"+c = [4, 1, 4, 1, 2, 1, 2, 1]",
"- mx, mxcart = 0, \"99999999\"",
"+ mx, mxc = 0, \"99999999\"",
"- if cart[(sp + num) % 8] <= que[num]:",
"- sm += cart[(sp + num) % 8]",
"- else:",
"- ... | false | 0.04024 | 0.039949 | 1.007277 | [
"s149287624",
"s906512548"
] |
u379629675 | p02913 | python | s683380930 | s204135444 | 213 | 96 | 42,992 | 5,032 | Accepted | Accepted | 54.93 | import sys
# input関係の定義
sys.setrecursionlimit(200000)
input = sys.stdin.readline
def ii(): return int(input())
def mi(): return map(int, input().rstrip().split())
def lmi(): return list(map(int, input().rstrip().split()))
def fi(): return float(input())
def mfi(): return map(float, input().rstrip().split())
de... | import sys
# input関係の定義
sys.setrecursionlimit(200000)
input = sys.stdin.readline
def ii(): return int(input())
def mi(): return map(int, input().rstrip().split())
def lmi(): return list(map(int, input().rstrip().split()))
def fi(): return float(input())
def mfi(): return map(float, input().rstrip().split())
de... | 78 | 83 | 2,619 | 2,693 | import sys
# input関係の定義
sys.setrecursionlimit(200000)
input = sys.stdin.readline
def ii():
return int(input())
def mi():
return map(int, input().rstrip().split())
def lmi():
return list(map(int, input().rstrip().split()))
def fi():
return float(input())
def mfi():
return map(float, input(... | import sys
# input関係の定義
sys.setrecursionlimit(200000)
input = sys.stdin.readline
def ii():
return int(input())
def mi():
return map(int, input().rstrip().split())
def lmi():
return list(map(int, input().rstrip().split()))
def fi():
return float(input())
def mfi():
return map(float, input(... | false | 6.024096 | [
"+",
"+",
"+def si():",
"+ return input().rstrip()",
"- return (res1, res2) if self.opt == 2 else res1",
"+ if self.opt == 2:",
"+ return (res1, res2)",
"+ else:",
"+ return res1",
"- S = li()",
"- rh = RollingHash(S, opt=1)",
"+ S = si()"... | false | 0.046351 | 0.038597 | 1.200898 | [
"s683380930",
"s204135444"
] |
u072717685 | p03739 | python | s330829976 | s184745601 | 156 | 83 | 14,464 | 19,888 | Accepted | Accepted | 46.79 | n = int(eval(input()))
a = list(map(int, input().split()))
r_even = 0 # 偶数桁を＋にする場合の値
a_even = a[:]
sum_even = 0
for i in range(len(a)):
sum_even += a_even[i]
if i % 2 == 0:
if sum_even <= 0:
r_even += 1 - sum_even
a_even[i] += 1 - sum_even
sum_even += 1... | import sys
read = sys.stdin.read
readlines = sys.stdin.readlines
def main():
n, *a = list(map(int, read().split()))
# 第一項をプラスにする場合
r1 = 0
csum = 0
parity = True # 「次の項目はプラスであるべき」のTrue/Falseを示す
for ae in a:
csum += ae
if parity:
if csum <= 0:
... | 36 | 44 | 910 | 1,016 | n = int(eval(input()))
a = list(map(int, input().split()))
r_even = 0 # 偶数桁を＋にする場合の値
a_even = a[:]
sum_even = 0
for i in range(len(a)):
sum_even += a_even[i]
if i % 2 == 0:
if sum_even <= 0:
r_even += 1 - sum_even
a_even[i] += 1 - sum_even
sum_even += 1 - sum_even
... | import sys
read = sys.stdin.read
readlines = sys.stdin.readlines
def main():
n, *a = list(map(int, read().split()))
# 第一項をプラスにする場合
r1 = 0
csum = 0
parity = True # 「次の項目はプラスであるべき」のTrue/Falseを示す
for ae in a:
csum += ae
if parity:
if csum <= 0:
plus =... | false | 18.181818 | [
"-n = int(eval(input()))",
"-a = list(map(int, input().split()))",
"-r_even = 0 # 偶数桁を＋にする場合の値",
"-a_even = a[:]",
"-sum_even = 0",
"-for i in range(len(a)):",
"- sum_even += a_even[i]",
"- if i % 2 == 0:",
"- if sum_even <= 0:",
"- r_even += 1 - sum_even",
"- ... | false | 0.035479 | 0.036113 | 0.982443 | [
"s330829976",
"s184745601"
] |
u841623074 | p03576 | python | s443977983 | s287779066 | 60 | 42 | 3,064 | 3,064 | Accepted | Accepted | 30 | def main():
N,K = list(map(int,input().split()))
XY = [list(map(int,input().split())) for _ in [0]*N]
iX = sorted(x for x,y in XY)
iY = sorted(y for x,y in XY)
X = {x:i for i,x in enumerate(iX)}
Y = {y:i for i,y in enumerate(iY)}
c = [[0]*(N+1) for i in [0]*(N+1)]
for x,y... | n,k=list(map(int,input().split()))
points=[]
for _ in range(n):
x,y=list(map(int,input().split()))
points.append((x,y))
points.sort()
ans=float('inf')
for i in range(n-k+1):
for j in range(i+k-1,n):
y_sorted=sorted(points[i:j+1],key=lambda x:x[1])
height_min=float('inf')
f... | 39 | 15 | 992 | 482 | def main():
N, K = list(map(int, input().split()))
XY = [list(map(int, input().split())) for _ in [0] * N]
iX = sorted(x for x, y in XY)
iY = sorted(y for x, y in XY)
X = {x: i for i, x in enumerate(iX)}
Y = {y: i for i, y in enumerate(iY)}
c = [[0] * (N + 1) for i in [0] * (N + 1)]
for ... | n, k = list(map(int, input().split()))
points = []
for _ in range(n):
x, y = list(map(int, input().split()))
points.append((x, y))
points.sort()
ans = float("inf")
for i in range(n - k + 1):
for j in range(i + k - 1, n):
y_sorted = sorted(points[i : j + 1], key=lambda x: x[1])
height_min = f... | false | 61.538462 | [
"-def main():",
"- N, K = list(map(int, input().split()))",
"- XY = [list(map(int, input().split())) for _ in [0] * N]",
"- iX = sorted(x for x, y in XY)",
"- iY = sorted(y for x, y in XY)",
"- X = {x: i for i, x in enumerate(iX)}",
"- Y = {y: i for i, y in enumerate(iY)}",
"- c =... | false | 0.036404 | 0.042828 | 0.850003 | [
"s443977983",
"s287779066"
] |
u893063840 | p03569 | python | s665047069 | s319975838 | 77 | 67 | 3,316 | 3,316 | Accepted | Accepted | 12.99 | s = eval(input())
ss = ""
cnt = 0
for e in s:
if e == "x":
cnt += 1
else:
ss += e
if ss == ss[::-1]:
l = 0
r = len(s) - 1
ans = 0
while r > l:
if s[l] == s[r] == "x":
l += 1
r -= 1
elif s[l] == "x":
l += 1
... | s = eval(input())
l = 0
r = len(s) - 1
ans = 0
while r > l:
if s[l] == s[r] == "x":
l += 1
r -= 1
elif s[l] == "x":
l += 1
ans += 1
elif s[r] == "x":
r -= 1
ans += 1
elif s[l] == s[r]:
l += 1
r -= 1
else:
a... | 32 | 24 | 511 | 351 | s = eval(input())
ss = ""
cnt = 0
for e in s:
if e == "x":
cnt += 1
else:
ss += e
if ss == ss[::-1]:
l = 0
r = len(s) - 1
ans = 0
while r > l:
if s[l] == s[r] == "x":
l += 1
r -= 1
elif s[l] == "x":
l += 1
ans += 1
... | s = eval(input())
l = 0
r = len(s) - 1
ans = 0
while r > l:
if s[l] == s[r] == "x":
l += 1
r -= 1
elif s[l] == "x":
l += 1
ans += 1
elif s[r] == "x":
r -= 1
ans += 1
elif s[l] == s[r]:
l += 1
r -= 1
else:
ans = -1
break
... | false | 25 | [
"-ss = \"\"",
"-cnt = 0",
"-for e in s:",
"- if e == \"x\":",
"- cnt += 1",
"+l = 0",
"+r = len(s) - 1",
"+ans = 0",
"+while r > l:",
"+ if s[l] == s[r] == \"x\":",
"+ l += 1",
"+ r -= 1",
"+ elif s[l] == \"x\":",
"+ l += 1",
"+ ans += 1",
"+... | false | 0.038525 | 0.042429 | 0.907966 | [
"s665047069",
"s319975838"
] |
u057964173 | p03352 | python | s194203721 | s242489278 | 167 | 17 | 38,384 | 3,064 | Accepted | Accepted | 89.82 | import sys
def input(): return sys.stdin.readline().strip()
def resolve():
x=int(eval(input()))
ans=0
for i in range(1,33):
for j in range(2,11):
y=i**j
if y<x:
ans=max(y,ans)
elif y==x:
ans=max(y,ans)
... | import sys
def input(): return sys.stdin.readline().strip()
def resolve():
x=int(eval(input()))
ans=0
for i in range(1,33):
if i>x:
break
for j in range(2,11):
y=i**j
if y<x:
ans=max(y,ans)
elif y==x:
... | 18 | 20 | 389 | 424 | import sys
def input():
return sys.stdin.readline().strip()
def resolve():
x = int(eval(input()))
ans = 0
for i in range(1, 33):
for j in range(2, 11):
y = i**j
if y < x:
ans = max(y, ans)
elif y == x:
ans = max(y, ans)
... | import sys
def input():
return sys.stdin.readline().strip()
def resolve():
x = int(eval(input()))
ans = 0
for i in range(1, 33):
if i > x:
break
for j in range(2, 11):
y = i**j
if y < x:
ans = max(y, ans)
elif y == x:
... | false | 10 | [
"+ if i > x:",
"+ break"
] | false | 0.035319 | 0.035013 | 1.008745 | [
"s194203721",
"s242489278"
] |
u847923740 | p03038 | python | s976740283 | s655779647 | 338 | 275 | 34,452 | 108,660 | Accepted | Accepted | 18.64 | from bisect import bisect_left
N, M = list(map(int, input().split()))
d = dict()
A = list(map(int, input().split()))
for i in range(N):
d[A[i]] = d.get(A[i], 0) + 1
for i in range(M):
B, C = list(map(int, input().split()))
d[C] = d.get(C, 0) + B
ans = 0
keys = sorted(list(d.keys()), reverse = True)
fo... | N, M = list(map(int, input().split()))
d = dict()
A = list(map(int, input().split()))
for i in range(N):
d[A[i]] = d.get(A[i], 0) + 1
for i in range(M):
B, C = list(map(int, input().split()))
d[C] = d.get(C, 0) + B
ans = 0
keys = sorted(list(d.keys()), reverse = True)
for k in keys:
kosuu = min(N, d.ge... | 20 | 18 | 413 | 379 | from bisect import bisect_left
N, M = list(map(int, input().split()))
d = dict()
A = list(map(int, input().split()))
for i in range(N):
d[A[i]] = d.get(A[i], 0) + 1
for i in range(M):
B, C = list(map(int, input().split()))
d[C] = d.get(C, 0) + B
ans = 0
keys = sorted(list(d.keys()), reverse=True)
for k in ... | N, M = list(map(int, input().split()))
d = dict()
A = list(map(int, input().split()))
for i in range(N):
d[A[i]] = d.get(A[i], 0) + 1
for i in range(M):
B, C = list(map(int, input().split()))
d[C] = d.get(C, 0) + B
ans = 0
keys = sorted(list(d.keys()), reverse=True)
for k in keys:
kosuu = min(N, d.get(k... | false | 10 | [
"-from bisect import bisect_left",
"-"
] | false | 0.043089 | 0.03617 | 1.1913 | [
"s976740283",
"s655779647"
] |
u016302627 | p03805 | python | s026422352 | s249240155 | 146 | 21 | 3,064 | 3,064 | Accepted | Accepted | 85.62 | import itertools
n, m = list(map(int, input().split()))
AB = []
for i in range(m):
AB.append(list(map(int, input().split())))
ct = 0
N_lis = [(i + 2) for i in range(n - 1)]
Pat = itertools.permutations(N_lis)
for one_case in Pat:
tmp = 1
all_flag = True
for j in one_case:
flag = Fa... | n, m = list(map(int, input().split()))
P = [[0] * n for i in range(n)]
for _ in range(m):
a, b = list(map(int, input().split()))
P[a-1][b-1] = 1
P[b-1][a-1] = 1
#dp[S][v] := 頂点０から出発し、集合Sに含まれる頂点を全て訪れるpathのうち、頂点vが最後になるようなpathの総数
dp = [[0] * n for _ in range(1 << n)]
#dpの初期化 dp({0}, 0) = 1
dp[1]... | 31 | 30 | 778 | 741 | import itertools
n, m = list(map(int, input().split()))
AB = []
for i in range(m):
AB.append(list(map(int, input().split())))
ct = 0
N_lis = [(i + 2) for i in range(n - 1)]
Pat = itertools.permutations(N_lis)
for one_case in Pat:
tmp = 1
all_flag = True
for j in one_case:
flag = False
f... | n, m = list(map(int, input().split()))
P = [[0] * n for i in range(n)]
for _ in range(m):
a, b = list(map(int, input().split()))
P[a - 1][b - 1] = 1
P[b - 1][a - 1] = 1
# dp[S][v] := 頂点０から出発し、集合Sに含まれる頂点を全て訪れるpathのうち、頂点vが最後になるようなpathの総数
dp = [[0] * n for _ in range(1 << n)]
# dpの初期化 dp({0}, 0) = 1
dp[1][0] =... | false | 3.225806 | [
"-import itertools",
"-",
"-AB = []",
"-for i in range(m):",
"- AB.append(list(map(int, input().split())))",
"-ct = 0",
"-N_lis = [(i + 2) for i in range(n - 1)]",
"-Pat = itertools.permutations(N_lis)",
"-for one_case in Pat:",
"- tmp = 1",
"- all_flag = True",
"- for j in one_cas... | false | 0.150064 | 0.07322 | 2.049475 | [
"s026422352",
"s249240155"
] |
u089230684 | p02880 | python | s630956383 | s813646472 | 185 | 17 | 39,764 | 2,940 | Accepted | Accepted | 90.81 | import sys
import math
import bisect
sys.setrecursionlimit(1000000000)
def input():
return sys.stdin.readline().strip()
def iinput():
return int(eval(input()))
def finput():
return float(eval(input()))
def tinput():
return input().split()
def rinput():
return list(map(... | possible = False
a = int(eval(input()))
for m in range(1, 10):
if a % m == 0 and a / m < 10:
print("Yes")
possible = True
break
if not possible:
print("No")
| 43 | 9 | 706 | 191 | import sys
import math
import bisect
sys.setrecursionlimit(1000000000)
def input():
return sys.stdin.readline().strip()
def iinput():
return int(eval(input()))
def finput():
return float(eval(input()))
def tinput():
return input().split()
def rinput():
return list(map(int, tinput()))
de... | possible = False
a = int(eval(input()))
for m in range(1, 10):
if a % m == 0 and a / m < 10:
print("Yes")
possible = True
break
if not possible:
print("No")
| false | 79.069767 | [
"-import sys",
"-import math",
"-import bisect",
"-",
"-sys.setrecursionlimit(1000000000)",
"-",
"-",
"-def input():",
"- return sys.stdin.readline().strip()",
"-",
"-",
"-def iinput():",
"- return int(eval(input()))",
"-",
"-",
"-def finput():",
"- return float(eval(input()... | false | 0.106346 | 0.036306 | 2.929183 | [
"s630956383",
"s813646472"
] |
u260980560 | p01314 | python | s792620592 | s173144387 | 50 | 20 | 4,200 | 4,352 | Accepted | Accepted | 60 | while True:
n = eval(input())
if n==0:
break
ans = 0
for i in range(1, n/2+1):
su = 0
c = i
while su<n:
su += c
c += 1
if su==n:
ans += 1
print(ans) | import math
while 1:
n = int(input())
if not n:
break
ans = 0
for p in range(1, int(math.sqrt(2*n))+1):
if 2*n % p ==0:
q = 2*n / p
if p>1 and (p+q)%2:
ans += 1
print(ans) | 14 | 12 | 251 | 262 | while True:
n = eval(input())
if n == 0:
break
ans = 0
for i in range(1, n / 2 + 1):
su = 0
c = i
while su < n:
su += c
c += 1
if su == n:
ans += 1
print(ans)
| import math
while 1:
n = int(input())
if not n:
break
ans = 0
for p in range(1, int(math.sqrt(2 * n)) + 1):
if 2 * n % p == 0:
q = 2 * n / p
if p > 1 and (p + q) % 2:
ans += 1
print(ans)
| false | 14.285714 | [
"-while True:",
"- n = eval(input())",
"- if n == 0:",
"+import math",
"+",
"+while 1:",
"+ n = int(input())",
"+ if not n:",
"- for i in range(1, n / 2 + 1):",
"- su = 0",
"- c = i",
"- while su < n:",
"- su += c",
"- c += 1",
"-... | false | 0.182184 | 0.104307 | 1.746619 | [
"s792620592",
"s173144387"
] |
u653485478 | p03814 | python | s013010240 | s254380411 | 63 | 48 | 4,840 | 4,840 | Accepted | Accepted | 23.81 | s = eval(input())
list_s = list(s)
a_num = len(s)
z_num = -1
for i in range(len(s)):
if list_s[i] == "A":
if a_num > i:
a_num = i
if list_s[i] == "Z":
z_num = i
print((z_num - a_num + 1)) | s = eval(input())
list_s = list(s)
a_num = -1
z_num = -1
for i in range(len(s)):
if list_s[i] == "A":
a_num = i
break
for j in range(len(s)):
if list_s[j] == "Z":
z_num = j
print((z_num - a_num + 1)) | 15 | 16 | 233 | 242 | s = eval(input())
list_s = list(s)
a_num = len(s)
z_num = -1
for i in range(len(s)):
if list_s[i] == "A":
if a_num > i:
a_num = i
if list_s[i] == "Z":
z_num = i
print((z_num - a_num + 1))
| s = eval(input())
list_s = list(s)
a_num = -1
z_num = -1
for i in range(len(s)):
if list_s[i] == "A":
a_num = i
break
for j in range(len(s)):
if list_s[j] == "Z":
z_num = j
print((z_num - a_num + 1))
| false | 6.25 | [
"-a_num = len(s)",
"+a_num = -1",
"- if a_num > i:",
"- a_num = i",
"- if list_s[i] == \"Z\":",
"- z_num = i",
"+ a_num = i",
"+ break",
"+for j in range(len(s)):",
"+ if list_s[j] == \"Z\":",
"+ z_num = j"
] | false | 0.044317 | 0.044693 | 0.991584 | [
"s013010240",
"s254380411"
] |
u970868612 | p02713 | python | s696878518 | s854660006 | 1,379 | 1,274 | 68,624 | 73,880 | Accepted | Accepted | 7.61 | def gcd(a,b):
while(b):
a,b = b,a%b
return a
k = int(eval(input()))
ans=0
for a in range(1,k+1):
for b in range(1,k+1):
for c in range(1,k+1):
ans+=gcd(a,gcd(b,c))
print(ans) | def gcd(a,b):
while(b):
a,b = b,a%b
return a
def main():
k = int(eval(input()))
ans=0
for a in range(1,k+1):
for b in range(1,k+1):
for c in range(1,k+1):
ans+=gcd(a,gcd(b,c))
print(ans)
if __name__ == '__main__':
main() | 12 | 15 | 190 | 247 | def gcd(a, b):
while b:
a, b = b, a % b
return a
k = int(eval(input()))
ans = 0
for a in range(1, k + 1):
for b in range(1, k + 1):
for c in range(1, k + 1):
ans += gcd(a, gcd(b, c))
print(ans)
| def gcd(a, b):
while b:
a, b = b, a % b
return a
def main():
k = int(eval(input()))
ans = 0
for a in range(1, k + 1):
for b in range(1, k + 1):
for c in range(1, k + 1):
ans += gcd(a, gcd(b, c))
print(ans)
if __name__ == "__main__":
main()
| false | 20 | [
"-k = int(eval(input()))",
"-ans = 0",
"-for a in range(1, k + 1):",
"- for b in range(1, k + 1):",
"- for c in range(1, k + 1):",
"- ans += gcd(a, gcd(b, c))",
"-print(ans)",
"+def main():",
"+ k = int(eval(input()))",
"+ ans = 0",
"+ for a in range(1, k + 1):",
... | false | 0.04373 | 0.048132 | 0.908552 | [
"s696878518",
"s854660006"
] |
u691896522 | p02991 | python | s700335464 | s562099684 | 747 | 643 | 106,212 | 77,076 | Accepted | Accepted | 13.92 | from collections import deque
n, m = list(map(int, input().split()))
inf = 10**9
def bfs(start):
dist = [inf for i in range((n+1) * 3)]
que = deque()
que.append(start)
finished = set()
dist[start] = 0
while que:
node = que.popleft()
if node not in finished:
... | from collections import deque
n, m = list(map(int, input().split()))
adjacent_list = [[] for i in range(3*n + 3)]
for i in range(m):
u, v = list(map(int, input().split()))
for j in range(1,4):
p = j + 3 * u - 3
q = (j % 3) + 3 * v - 2
#print("{} -> {}".format(p, q))
adja... | 29 | 28 | 813 | 799 | from collections import deque
n, m = list(map(int, input().split()))
inf = 10**9
def bfs(start):
dist = [inf for i in range((n + 1) * 3)]
que = deque()
que.append(start)
finished = set()
dist[start] = 0
while que:
node = que.popleft()
if node not in finished:
finis... | from collections import deque
n, m = list(map(int, input().split()))
adjacent_list = [[] for i in range(3 * n + 3)]
for i in range(m):
u, v = list(map(int, input().split()))
for j in range(1, 4):
p = j + 3 * u - 3
q = (j % 3) + 3 * v - 2
# print("{} -> {}".format(p, q))
adjacent... | false | 3.448276 | [
"-inf = 10**9",
"+adjacent_list = [[] for i in range(3 * n + 3)]",
"+for i in range(m):",
"+ u, v = list(map(int, input().split()))",
"+ for j in range(1, 4):",
"+ p = j + 3 * u - 3",
"+ q = (j % 3) + 3 * v - 2",
"+ # print(\"{} -> {}\".format(p, q))",
"+ adjacent_l... | false | 0.096671 | 0.094678 | 1.021045 | [
"s700335464",
"s562099684"
] |
u934246119 | p03240 | python | s970768116 | s609556584 | 120 | 104 | 3,188 | 3,064 | Accepted | Accepted | 13.33 | import math
n = int(eval(input()))
x = [0 for i in range(n)]
y = [0 for i in range(n)]
h = [0 for i in range(n)]
judge = False
for i in range(n):
x[i], y[i], h[i] = list(map(int, input().split()))
for i in range(0, 101):
for j in range(0, 101):
for k in range(0, n):
if h[k] != 0:
... | # 全探索可能
# 座標の候補は101 * 101 通り *100座標ぶんなので。
# 0の場合どうするか
# 0以外で候補を列挙して、あとで合ってるか検証(方針合ってた)
def abs(key):
if key < 0:
return -key
else:
return key
n = int(eval(input()))
x = [0] * n
y = [0] * n
h = [0] * n
for i in range(n):
x[i], y[i], h[i] = list(map(int, input().split()))... | 27 | 54 | 777 | 1,487 | import math
n = int(eval(input()))
x = [0 for i in range(n)]
y = [0 for i in range(n)]
h = [0 for i in range(n)]
judge = False
for i in range(n):
x[i], y[i], h[i] = list(map(int, input().split()))
for i in range(0, 101):
for j in range(0, 101):
for k in range(0, n):
if h[k] != 0:
... | # 全探索可能
# 座標の候補は101 * 101 通り *100座標ぶんなので。
# 0の場合どうするか
# 0以外で候補を列挙して、あとで合ってるか検証(方針合ってた)
def abs(key):
if key < 0:
return -key
else:
return key
n = int(eval(input()))
x = [0] * n
y = [0] * n
h = [0] * n
for i in range(n):
x[i], y[i], h[i] = list(map(int, input().split()))
pos_max = 100 # 座標... | false | 50 | [
"-import math",
"+# 全探索可能",
"+# 座標の候補は101 * 101 通り *100座標ぶんなので。",
"+# 0の場合どうするか",
"+# 0以外で候補を列挙して、あとで合ってるか検証(方針合ってた)",
"+def abs(key):",
"+ if key < 0:",
"+ return -key",
"+ else:",
"+ return key",
"+",
"-x = [0 for i in range(n)]",
"-y = [0 for i in range(n)]",
"-h = [... | false | 0.091331 | 0.267401 | 0.341552 | [
"s970768116",
"s609556584"
] |
u968950181 | p03075 | python | s918698933 | s102296158 | 177 | 161 | 38,256 | 38,256 | Accepted | Accepted | 9.04 | l = [int(eval(input())) for _ in range(5)]
k = int(eval(input()))
print(('Yay!' if k >= max(l) - min(l) else ':(')) | l = [int(eval(input())) for _ in range(5)]
k = int(eval(input()))
print(('Yay!' if k >= l[4] - l[0] else ':('))
| 3 | 3 | 103 | 100 | l = [int(eval(input())) for _ in range(5)]
k = int(eval(input()))
print(("Yay!" if k >= max(l) - min(l) else ":("))
| l = [int(eval(input())) for _ in range(5)]
k = int(eval(input()))
print(("Yay!" if k >= l[4] - l[0] else ":("))
| false | 0 | [
"-print((\"Yay!\" if k >= max(l) - min(l) else \":(\"))",
"+print((\"Yay!\" if k >= l[4] - l[0] else \":(\"))"
] | false | 0.03817 | 0.037994 | 1.004648 | [
"s918698933",
"s102296158"
] |
u368780724 | p03602 | python | s082260810 | s371740443 | 1,991 | 648 | 16,268 | 16,268 | Accepted | Accepted | 67.45 | def inpl(): return [int(i) for i in input().split()]
import sys
import numpy
N = int(eval(input()))
A = numpy.asarray([inpl() for _ in range(N)])
ans = 0
for i in range(N):
A[i][i] = 10**9+1
for i in range(N):
for j in range(i):
mindis = numpy.min([A[i] + A[j]])
if mindis > A[i][j]:
... | def inpl(): return [int(i) for i in input().split()]
import sys
import numpy
N = int(eval(input()))
A = numpy.array([inpl() for _ in range(N)])
ans = 0
for i in range(N):
A[i][i] = 10**9+1
for i in range(N):
for j in range(i):
mindis = numpy.min(A[i] + A[j])
if mindis > A[i][j]:
... | 19 | 18 | 454 | 448 | def inpl():
return [int(i) for i in input().split()]
import sys
import numpy
N = int(eval(input()))
A = numpy.asarray([inpl() for _ in range(N)])
ans = 0
for i in range(N):
A[i][i] = 10**9 + 1
for i in range(N):
for j in range(i):
mindis = numpy.min([A[i] + A[j]])
if mindis > A[i][j]:
... | def inpl():
return [int(i) for i in input().split()]
import sys
import numpy
N = int(eval(input()))
A = numpy.array([inpl() for _ in range(N)])
ans = 0
for i in range(N):
A[i][i] = 10**9 + 1
for i in range(N):
for j in range(i):
mindis = numpy.min(A[i] + A[j])
if mindis > A[i][j]:
... | false | 5.263158 | [
"-A = numpy.asarray([inpl() for _ in range(N)])",
"+A = numpy.array([inpl() for _ in range(N)])",
"- mindis = numpy.min([A[i] + A[j]])",
"+ mindis = numpy.min(A[i] + A[j])"
] | false | 0.224305 | 0.007245 | 30.961699 | [
"s082260810",
"s371740443"
] |
u923279197 | p02981 | python | s487004437 | s211109804 | 166 | 17 | 38,432 | 2,940 | Accepted | Accepted | 89.76 | n,a,b = list(map(int,input().split()))
print((min(a*n,b))) | n,a,b = list(map(int,input().split()))
print((min(n*a,b))) | 2 | 2 | 51 | 51 | n, a, b = list(map(int, input().split()))
print((min(a * n, b)))
| n, a, b = list(map(int, input().split()))
print((min(n * a, b)))
| false | 0 | [
"-print((min(a * n, b)))",
"+print((min(n * a, b)))"
] | false | 0.048131 | 0.045142 | 1.066224 | [
"s487004437",
"s211109804"
] |
u842170774 | p03448 | python | s285312619 | s943538319 | 62 | 51 | 9,164 | 9,036 | Accepted | Accepted | 17.74 | I=input
A,B,C,X,s=int(I()),int(I()),int(I()),int(I()),0
for i in range(A+1):
for j in range(int(B)+1):
for k in range(int(C)+1):
if 500*i+100*j+50*k==int(X):s+=1
print(s) | I=input
A,B,C,X,s=int(I()),int(I()),int(I()),int(I()),0
for i in range(A+1):
for j in range(B+1):
for k in range(C+1):
if 500*i+100*j+50*k==X:s+=1
print(s) | 7 | 7 | 200 | 185 | I = input
A, B, C, X, s = int(I()), int(I()), int(I()), int(I()), 0
for i in range(A + 1):
for j in range(int(B) + 1):
for k in range(int(C) + 1):
if 500 * i + 100 * j + 50 * k == int(X):
s += 1
print(s)
| I = input
A, B, C, X, s = int(I()), int(I()), int(I()), int(I()), 0
for i in range(A + 1):
for j in range(B + 1):
for k in range(C + 1):
if 500 * i + 100 * j + 50 * k == X:
s += 1
print(s)
| false | 0 | [
"- for j in range(int(B) + 1):",
"- for k in range(int(C) + 1):",
"- if 500 * i + 100 * j + 50 * k == int(X):",
"+ for j in range(B + 1):",
"+ for k in range(C + 1):",
"+ if 500 * i + 100 * j + 50 * k == X:"
] | false | 0.125793 | 0.111047 | 1.132786 | [
"s285312619",
"s943538319"
] |
u729133443 | p03221 | python | s261352462 | s029668249 | 979 | 677 | 94,168 | 31,172 | Accepted | Accepted | 30.85 | I=lambda:list(map(int,input().split()))[::-1];m,n=I();l=[I()+[i]for i in range(m)];c=[0]*-~n;a=[0]*m
for y,p,i in sorted(l):c[p]+=1;a[i]='%06d'%p+'%06d'%c[p]
print(('\n'.join(a))) | I=lambda:list(map(int,input().split()))[::-1];m,n=I();c=[0]*-~n;a=[0]*m
for y,p,i in sorted(I()+[i]for i in range(m)):c[p]+=1;a[i]='%06d'%p+'%06d'%c[p]
for t in a:print(t) | 3 | 3 | 179 | 173 | I = lambda: list(map(int, input().split()))[::-1]
m, n = I()
l = [I() + [i] for i in range(m)]
c = [0] * -~n
a = [0] * m
for y, p, i in sorted(l):
c[p] += 1
a[i] = "%06d" % p + "%06d" % c[p]
print(("\n".join(a)))
| I = lambda: list(map(int, input().split()))[::-1]
m, n = I()
c = [0] * -~n
a = [0] * m
for y, p, i in sorted(I() + [i] for i in range(m)):
c[p] += 1
a[i] = "%06d" % p + "%06d" % c[p]
for t in a:
print(t)
| false | 0 | [
"-l = [I() + [i] for i in range(m)]",
"-for y, p, i in sorted(l):",
"+for y, p, i in sorted(I() + [i] for i in range(m)):",
"-print((\"\\n\".join(a)))",
"+for t in a:",
"+ print(t)"
] | false | 0.041876 | 0.151366 | 0.276653 | [
"s261352462",
"s029668249"
] |
u350997995 | p03830 | python | s744793361 | s886860166 | 63 | 42 | 3,064 | 3,064 | Accepted | Accepted | 33.33 | N = int(eval(input()))
m = pow(10,9)+7
A = [1]*(N+1)
for n in range(2,N+1):
k = n
for i in range(2,n+1):
if k%i==0:
while k>1:
k//=i
A[i]+=1
if k%i!=0:break
ans = 1
for a in A:ans*=a
print((ans%m)) | N = int(eval(input()))
mod = pow(10,9)+7
A = [1]*(N+1)
for i in range(1,N+1):
n = i
for j in range(2,i+1):
if j>n:break
while n%j==0:
A[j]+=1
n//=j
cnt = 1
for i in range(N+1):
cnt *= A[i]
print((cnt%mod)) | 15 | 14 | 280 | 262 | N = int(eval(input()))
m = pow(10, 9) + 7
A = [1] * (N + 1)
for n in range(2, N + 1):
k = n
for i in range(2, n + 1):
if k % i == 0:
while k > 1:
k //= i
A[i] += 1
if k % i != 0:
break
ans = 1
for a in A:
ans *= a
print(... | N = int(eval(input()))
mod = pow(10, 9) + 7
A = [1] * (N + 1)
for i in range(1, N + 1):
n = i
for j in range(2, i + 1):
if j > n:
break
while n % j == 0:
A[j] += 1
n //= j
cnt = 1
for i in range(N + 1):
cnt *= A[i]
print((cnt % mod))
| false | 6.666667 | [
"-m = pow(10, 9) + 7",
"+mod = pow(10, 9) + 7",
"-for n in range(2, N + 1):",
"- k = n",
"- for i in range(2, n + 1):",
"- if k % i == 0:",
"- while k > 1:",
"- k //= i",
"- A[i] += 1",
"- if k % i != 0:",
"- ... | false | 0.04334 | 0.043304 | 1.000843 | [
"s744793361",
"s886860166"
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.