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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
u254871849 | p03001 | python | s899776528 | s823915605 | 20 | 17 | 3,060 | 2,940 | Accepted | Accepted | 15 | # 2019-11-14 17:27:23(JST)
import sys
# import collections
# import math
# from string import ascii_lowercase, ascii_uppercase, digits
# from bisect import bisect_left as bi_l, bisect_right as bi_r
# import itertools
# from functools import reduce
# import operator as op
# from scipy.misc import comb # float
# import numpy as np
def main():
W, H, x, y = [int(i) for i in sys.stdin.readline().split()]
# どこに座標をとっても必ず中心を通る直線で半分になる
# 座標が中心の場合のみ、長方形を半分に分断する直線が無数に存在する
area = W * H / 2
if W == x * 2 and H == y * 2:
sign = '1'
else:
sign = '0'
print((area, sign))
if __name__ == "__main__":
main()
| import sys
w, h, x, y = map(int, sys.stdin.readline().split())
def main():
s = w * h / 2
f = (x == w / 2 and y == h / 2) & 1
return s, f
if __name__ == '__main__':
ans = main()
print(*ans, sep=' ')
| 27 | 12 | 672 | 231 | # 2019-11-14 17:27:23(JST)
import sys
# import collections
# import math
# from string import ascii_lowercase, ascii_uppercase, digits
# from bisect import bisect_left as bi_l, bisect_right as bi_r
# import itertools
# from functools import reduce
# import operator as op
# from scipy.misc import comb # float
# import numpy as np
def main():
W, H, x, y = [int(i) for i in sys.stdin.readline().split()]
# どこに座標をとっても必ず中心を通る直線で半分になる
# 座標が中心の場合のみ、長方形を半分に分断する直線が無数に存在する
area = W * H / 2
if W == x * 2 and H == y * 2:
sign = "1"
else:
sign = "0"
print((area, sign))
if __name__ == "__main__":
main()
| import sys
w, h, x, y = map(int, sys.stdin.readline().split())
def main():
s = w * h / 2
f = (x == w / 2 and y == h / 2) & 1
return s, f
if __name__ == "__main__":
ans = main()
print(*ans, sep=" ")
| false | 55.555556 | [
"-# 2019-11-14 17:27:23(JST)",
"-# import collections",
"-# import math",
"-# from string import ascii_lowercase, ascii_uppercase, digits",
"-# from bisect import bisect_left as bi_l, bisect_right as bi_r",
"-# import itertools",
"-# from functools import reduce",
"-# import operator as op",
"-# fro... | false | 0.049851 | 0.04998 | 0.997415 | [
"s899776528",
"s823915605"
] |
u043048943 | p02579 | python | s645016611 | s925837519 | 1,948 | 1,361 | 233,008 | 266,408 | Accepted | Accepted | 30.13 | def main():
from sys import setrecursionlimit, stdin, stderr
from os import environ
from collections import defaultdict, deque, Counter
from math import ceil, floor
from itertools import accumulate, combinations, combinations_with_replacement
setrecursionlimit(10**6)
dbg = (lambda *something: stderr.write("\033[92m{}\033[0m".format(str(something)+'\n'))) if 'TERM_PROGRAM' in environ else lambda *x: 0
input = lambda: stdin.readline().rstrip()
LMIIS = lambda: list(map(int,input().split()))
II = lambda: int(eval(input()))
P = 10**9+7
INF = 10**18+10
H,W = LMIIS()
Ch,Cw = LMIIS()
Ch -= 1
Cw -= 1
Dh,Dw = LMIIS()
Dh -= 1
Dw -= 1
S = []
for i in range(H):
S.append(eval(input()))
num_warp = []
for i in range(H):
num_warp.append([-1]*W)
targets = deque([(Ch,Cw,0)])
def check_and_move(y,x,d):
if 0 <= y < H and 0 <= x < W and num_warp[y][x] == -1 and S[y][x] == '.':
num_warp[y][x] = d
return True
return False
# 歩行はDFS, ワープはBFS
while targets:
y,x,d = targets.pop()
if not check_and_move(y,x,d):
continue
for y2,x2 in [(y-1,x),(y,x+1),(y+1,x),(y,x-1)]:
targets.append((y2,x2,d))
for y2,x2 in[
(y-2,x-2),(y-2,x-1),(y-2,x),(y-2,x+1),(y-2,x+2),
(y-1,x-2),(y-1,x-1),(y-1,x+1),(y-2,x+2),
(y,x-2),(y,x+2),
(y+1,x-2),(y+1,x-1),(y+1,x+1),(y+1,x+2),
(y+2,x-2),(y+2,x-1),(y+2,x),(y+2,x+1),(y+2,x+2)
]:
targets.appendleft((y2,x2,d+1))
print((num_warp[Dh][Dw]))
main() | def main():
from sys import setrecursionlimit, stdin, stderr
from os import environ
from collections import defaultdict, deque, Counter
from math import ceil, floor
from itertools import accumulate, combinations, combinations_with_replacement
setrecursionlimit(10**6)
dbg = (lambda *something: stderr.write("\033[92m{}\033[0m".format(str(something)+'\n'))) if 'TERM_PROGRAM' in environ else lambda *x: 0
input = lambda: stdin.readline().rstrip()
LMIIS = lambda: list(map(int,input().split()))
II = lambda: int(eval(input()))
P = 10**9+7
INF = 10**18+10
H,W = LMIIS()
Ch,Cw = LMIIS()
Ch -= 1
Cw -= 1
Dh,Dw = LMIIS()
Dh -= 1
Dw -= 1
S = []
for i in range(H):
S.append(eval(input()))
num_warp = []
for i in range(H):
num_warp.append([-1]*W)
def check_and_move(y,x,d):
if 0 <= y < H and 0 <= x < W and num_warp[y][x] == -1 and S[y][x] == '.':
num_warp[y][x] = d
return True
return False
# 歩行はDFS, ワープはBFS
targets = deque([(Ch,Cw,0)])
while targets:
y,x,d = targets.pop()
if not check_and_move(y,x,d):
continue
if y == Dh and x == Dw:
break
for y2,x2 in [(y-1,x),(y,x+1),(y+1,x),(y,x-1)]:
targets.append((y2,x2,d))
for y2,x2 in[
(y-2,x-2),(y-2,x-1),(y-2,x),(y-2,x+1),(y-2,x+2),
(y-1,x-2),(y-1,x-1),(y-1,x+1),(y-2,x+2),
(y,x-2),(y,x+2),
(y+1,x-2),(y+1,x-1),(y+1,x+1),(y+1,x+2),
(y+2,x-2),(y+2,x-1),(y+2,x),(y+2,x+1),(y+2,x+2)
]:
targets.appendleft((y2,x2,d+1))
print((num_warp[Dh][Dw]))
main() | 65 | 67 | 1,763 | 1,819 | def main():
from sys import setrecursionlimit, stdin, stderr
from os import environ
from collections import defaultdict, deque, Counter
from math import ceil, floor
from itertools import accumulate, combinations, combinations_with_replacement
setrecursionlimit(10**6)
dbg = (
(
lambda *something: stderr.write(
"\033[92m{}\033[0m".format(str(something) + "\n")
)
)
if "TERM_PROGRAM" in environ
else lambda *x: 0
)
input = lambda: stdin.readline().rstrip()
LMIIS = lambda: list(map(int, input().split()))
II = lambda: int(eval(input()))
P = 10**9 + 7
INF = 10**18 + 10
H, W = LMIIS()
Ch, Cw = LMIIS()
Ch -= 1
Cw -= 1
Dh, Dw = LMIIS()
Dh -= 1
Dw -= 1
S = []
for i in range(H):
S.append(eval(input()))
num_warp = []
for i in range(H):
num_warp.append([-1] * W)
targets = deque([(Ch, Cw, 0)])
def check_and_move(y, x, d):
if 0 <= y < H and 0 <= x < W and num_warp[y][x] == -1 and S[y][x] == ".":
num_warp[y][x] = d
return True
return False
# 歩行はDFS, ワープはBFS
while targets:
y, x, d = targets.pop()
if not check_and_move(y, x, d):
continue
for y2, x2 in [(y - 1, x), (y, x + 1), (y + 1, x), (y, x - 1)]:
targets.append((y2, x2, d))
for y2, x2 in [
(y - 2, x - 2),
(y - 2, x - 1),
(y - 2, x),
(y - 2, x + 1),
(y - 2, x + 2),
(y - 1, x - 2),
(y - 1, x - 1),
(y - 1, x + 1),
(y - 2, x + 2),
(y, x - 2),
(y, x + 2),
(y + 1, x - 2),
(y + 1, x - 1),
(y + 1, x + 1),
(y + 1, x + 2),
(y + 2, x - 2),
(y + 2, x - 1),
(y + 2, x),
(y + 2, x + 1),
(y + 2, x + 2),
]:
targets.appendleft((y2, x2, d + 1))
print((num_warp[Dh][Dw]))
main()
| def main():
from sys import setrecursionlimit, stdin, stderr
from os import environ
from collections import defaultdict, deque, Counter
from math import ceil, floor
from itertools import accumulate, combinations, combinations_with_replacement
setrecursionlimit(10**6)
dbg = (
(
lambda *something: stderr.write(
"\033[92m{}\033[0m".format(str(something) + "\n")
)
)
if "TERM_PROGRAM" in environ
else lambda *x: 0
)
input = lambda: stdin.readline().rstrip()
LMIIS = lambda: list(map(int, input().split()))
II = lambda: int(eval(input()))
P = 10**9 + 7
INF = 10**18 + 10
H, W = LMIIS()
Ch, Cw = LMIIS()
Ch -= 1
Cw -= 1
Dh, Dw = LMIIS()
Dh -= 1
Dw -= 1
S = []
for i in range(H):
S.append(eval(input()))
num_warp = []
for i in range(H):
num_warp.append([-1] * W)
def check_and_move(y, x, d):
if 0 <= y < H and 0 <= x < W and num_warp[y][x] == -1 and S[y][x] == ".":
num_warp[y][x] = d
return True
return False
# 歩行はDFS, ワープはBFS
targets = deque([(Ch, Cw, 0)])
while targets:
y, x, d = targets.pop()
if not check_and_move(y, x, d):
continue
if y == Dh and x == Dw:
break
for y2, x2 in [(y - 1, x), (y, x + 1), (y + 1, x), (y, x - 1)]:
targets.append((y2, x2, d))
for y2, x2 in [
(y - 2, x - 2),
(y - 2, x - 1),
(y - 2, x),
(y - 2, x + 1),
(y - 2, x + 2),
(y - 1, x - 2),
(y - 1, x - 1),
(y - 1, x + 1),
(y - 2, x + 2),
(y, x - 2),
(y, x + 2),
(y + 1, x - 2),
(y + 1, x - 1),
(y + 1, x + 1),
(y + 1, x + 2),
(y + 2, x - 2),
(y + 2, x - 1),
(y + 2, x),
(y + 2, x + 1),
(y + 2, x + 2),
]:
targets.appendleft((y2, x2, d + 1))
print((num_warp[Dh][Dw]))
main()
| false | 2.985075 | [
"- targets = deque([(Ch, Cw, 0)])",
"+ targets = deque([(Ch, Cw, 0)])",
"+ if y == Dh and x == Dw:",
"+ break"
] | false | 0.045325 | 0.045514 | 0.995852 | [
"s645016611",
"s925837519"
] |
u054514819 | p03221 | python | s175265727 | s374493469 | 688 | 318 | 38,212 | 91,408 | Accepted | Accepted | 53.78 | N, M = list(map(int, input().split()))
from bisect import bisect_right
dic = [[] for i in range(N)]
shi = {}
for i in range(M):
p, y = list(map(int, input().split()))
dic[p-1].append(y)
shi[i] = (p, y)
for i in range(N):
dic[i].sort()
for j in range(M):
p, y = shi[j]
print(('{:06}{:06}'.format(p, bisect_right(dic[p-1], y))))
| import sys
def input(): return sys.stdin.readline().strip()
def mapint(): return list(map(int, input().split()))
sys.setrecursionlimit(10**9)
N, M = mapint()
lis = [[] for _ in range(N)]
plis = []
for _ in range(M):
p, y = mapint()
lis[p-1].append(y)
plis.append((p, y))
for i in range(N):
lis[i].sort()
from bisect import bisect_left
for p, y in plis:
idx = bisect_left(lis[p-1], y)
print(('{:06}{:06}'.format(p, idx+1))) | 17 | 21 | 357 | 466 | N, M = list(map(int, input().split()))
from bisect import bisect_right
dic = [[] for i in range(N)]
shi = {}
for i in range(M):
p, y = list(map(int, input().split()))
dic[p - 1].append(y)
shi[i] = (p, y)
for i in range(N):
dic[i].sort()
for j in range(M):
p, y = shi[j]
print(("{:06}{:06}".format(p, bisect_right(dic[p - 1], y))))
| import sys
def input():
return sys.stdin.readline().strip()
def mapint():
return list(map(int, input().split()))
sys.setrecursionlimit(10**9)
N, M = mapint()
lis = [[] for _ in range(N)]
plis = []
for _ in range(M):
p, y = mapint()
lis[p - 1].append(y)
plis.append((p, y))
for i in range(N):
lis[i].sort()
from bisect import bisect_left
for p, y in plis:
idx = bisect_left(lis[p - 1], y)
print(("{:06}{:06}".format(p, idx + 1)))
| false | 19.047619 | [
"-N, M = list(map(int, input().split()))",
"-from bisect import bisect_right",
"+import sys",
"-dic = [[] for i in range(N)]",
"-shi = {}",
"-for i in range(M):",
"- p, y = list(map(int, input().split()))",
"- dic[p - 1].append(y)",
"- shi[i] = (p, y)",
"+",
"+def input():",
"+ ret... | false | 0.047024 | 0.046693 | 1.007081 | [
"s175265727",
"s374493469"
] |
u416011173 | p02600 | python | s876786173 | s249289170 | 32 | 28 | 9,120 | 9,160 | Accepted | Accepted | 12.5 | # -*- coding: utf-8 -*-
# 標準入力を取得
X = int(eval(input()))
# 求解処理
ans = int()
if X <= 599:
ans = 8
elif X <= 799:
ans = 7
elif X <= 999:
ans = 6
elif X <= 1199:
ans = 5
elif X <= 1399:
ans = 4
elif X <= 1599:
ans = 3
elif X <= 1799:
ans = 2
elif X <= 1999:
ans = 1
# 結果出力
print(ans) | # -*- coding: utf-8 -*-
def get_input() -> tuple:
"""
標準入力を取得する.
Returns:\n
tuple: 標準入力
"""
X = int(eval(input()))
return X
def main(X: int) -> None:
"""
メイン処理.
Args:\n
X (int): 最高レーティング（400 <= X <= 1999）
"""
# 求解処理
ans = 10 - (X // 200)
# 結果出力
print(ans)
if __name__ == "__main__":
# 標準入力を取得
X = get_input()
# メイン処理
main(X)
| 25 | 32 | 332 | 446 | # -*- coding: utf-8 -*-
# 標準入力を取得
X = int(eval(input()))
# 求解処理
ans = int()
if X <= 599:
ans = 8
elif X <= 799:
ans = 7
elif X <= 999:
ans = 6
elif X <= 1199:
ans = 5
elif X <= 1399:
ans = 4
elif X <= 1599:
ans = 3
elif X <= 1799:
ans = 2
elif X <= 1999:
ans = 1
# 結果出力
print(ans)
| # -*- coding: utf-8 -*-
def get_input() -> tuple:
"""
標準入力を取得する.
Returns:\n
tuple: 標準入力
"""
X = int(eval(input()))
return X
def main(X: int) -> None:
"""
メイン処理.
Args:\n
X (int): 最高レーティング（400 <= X <= 1999）
"""
# 求解処理
ans = 10 - (X // 200)
# 結果出力
print(ans)
if __name__ == "__main__":
# 標準入力を取得
X = get_input()
# メイン処理
main(X)
| false | 21.875 | [
"-# 標準入力を取得",
"-X = int(eval(input()))",
"-# 求解処理",
"-ans = int()",
"-if X <= 599:",
"- ans = 8",
"-elif X <= 799:",
"- ans = 7",
"-elif X <= 999:",
"- ans = 6",
"-elif X <= 1199:",
"- ans = 5",
"-elif X <= 1399:",
"- ans = 4",
"-elif X <= 1599:",
"- ans = 3",
"-eli... | false | 0.136563 | 0.007389 | 18.481852 | [
"s876786173",
"s249289170"
] |
u179169725 | p03283 | python | s831862724 | s577827943 | 1,458 | 1,255 | 48,984 | 48,896 | Accepted | Accepted | 13.92 | # https://atcoder.jp/contests/abc106/tasks/abc106_d
# どうやったら高速に区間[p,q]に完全に入っている区間の数を取得できるか？
# p,qを二次元座標として捉えると電車1本の線は二次元平面上の1点として表せる
# このときp,qの区間に完全に入っている電車の本数というのは、x軸、y軸の両方において[p,q]となる四角形内にある電車の本数
# queryに高速に答えるために二次元累積和を構築する
import sys
read = sys.stdin.readline
def read_ints():
return list(map(int, read().split()))
def read_tuple(H):
'''
H is number of rows
'''
ret = []
for _ in range(H):
ret.append(tuple(map(int, read().split())))
return ret
import numpy as np
N, M, Q = read_ints()
LR = read_tuple(M)
pq = read_tuple(Q)
# 二次元座標上へのプロット
LR2d = np.zeros((N + 1, N + 1), np.int64)
for L, R in LR:
LR2d[L, R] += 1
LR2d_accum = np.zeros((N + 2, N + 2), np.int64)
LR2d_accum[1:, 1:] = LR2d.cumsum(axis=0).cumsum(axis=1) # 1次元累積和同様半開区間で考える
# つまりインデックスi,jとはもとの配列においてi,jを含まない四角形の領域の合計を出す
# queryに答えていく
for p, q in pq:
print((LR2d_accum[q + 1, q + 1] - LR2d_accum[q + 1, p] -
LR2d_accum[p, q + 1] + LR2d_accum[p, p]))
| # https://atcoder.jp/contests/abc106/tasks/abc106_d
# どうやったら高速に区間[p,q]に完全に入っている区間の数を取得できるか？
# p,qを二次元座標として捉えると電車1本の線は二次元平面上の1点として表せる
# このときp,qの区間に完全に入っている電車の本数というのは、x軸、y軸の両方において[p,q]となる四角形内にある電車の本数
# queryに高速に答えるために二次元累積和を構築する
import sys
read = sys.stdin.readline
def read_ints():
return list(map(int, read().split()))
def read_tuple(H):
'''
H is number of rows
'''
ret = []
for _ in range(H):
ret.append(tuple(map(int, read().split())))
return ret
import numpy as np
N, M, Q = read_ints()
LR = read_tuple(M)
pq = read_tuple(Q)
# # 二次元座標上へのプロット
# LR2d = np.zeros((N + 1, N + 1), np.int64)
# for L, R in LR:
# LR2d[L, R] += 1 #ここがボトルネック
# numpy使わずに再実装
LR2d = [[0] * (N + 1) for _ in range(N + 1)]
for L, R in LR:
LR2d[L][R] += 1
LR2d = np.array(LR2d)
LR2d_accum = np.zeros((N + 2, N + 2), np.int64)
LR2d_accum[1:, 1:] = LR2d.cumsum(axis=0).cumsum(axis=1) # 1次元累積和同様半開区間で考える
# つまりインデックスi,jとはもとの配列においてi,jを含まない四角形の領域の合計を出す
# queryに答えていく
for p, q in pq:
print((LR2d_accum[q + 1, q + 1] - LR2d_accum[q + 1, p] -
LR2d_accum[p, q + 1] + LR2d_accum[p, p]))
| 42 | 49 | 1,019 | 1,165 | # https://atcoder.jp/contests/abc106/tasks/abc106_d
# どうやったら高速に区間[p,q]に完全に入っている区間の数を取得できるか？
# p,qを二次元座標として捉えると電車1本の線は二次元平面上の1点として表せる
# このときp,qの区間に完全に入っている電車の本数というのは、x軸、y軸の両方において[p,q]となる四角形内にある電車の本数
# queryに高速に答えるために二次元累積和を構築する
import sys
read = sys.stdin.readline
def read_ints():
return list(map(int, read().split()))
def read_tuple(H):
"""
H is number of rows
"""
ret = []
for _ in range(H):
ret.append(tuple(map(int, read().split())))
return ret
import numpy as np
N, M, Q = read_ints()
LR = read_tuple(M)
pq = read_tuple(Q)
# 二次元座標上へのプロット
LR2d = np.zeros((N + 1, N + 1), np.int64)
for L, R in LR:
LR2d[L, R] += 1
LR2d_accum = np.zeros((N + 2, N + 2), np.int64)
LR2d_accum[1:, 1:] = LR2d.cumsum(axis=0).cumsum(axis=1) # 1次元累積和同様半開区間で考える
# つまりインデックスi,jとはもとの配列においてi,jを含まない四角形の領域の合計を出す
# queryに答えていく
for p, q in pq:
print(
(
LR2d_accum[q + 1, q + 1]
- LR2d_accum[q + 1, p]
- LR2d_accum[p, q + 1]
+ LR2d_accum[p, p]
)
)
| # https://atcoder.jp/contests/abc106/tasks/abc106_d
# どうやったら高速に区間[p,q]に完全に入っている区間の数を取得できるか？
# p,qを二次元座標として捉えると電車1本の線は二次元平面上の1点として表せる
# このときp,qの区間に完全に入っている電車の本数というのは、x軸、y軸の両方において[p,q]となる四角形内にある電車の本数
# queryに高速に答えるために二次元累積和を構築する
import sys
read = sys.stdin.readline
def read_ints():
return list(map(int, read().split()))
def read_tuple(H):
"""
H is number of rows
"""
ret = []
for _ in range(H):
ret.append(tuple(map(int, read().split())))
return ret
import numpy as np
N, M, Q = read_ints()
LR = read_tuple(M)
pq = read_tuple(Q)
# # 二次元座標上へのプロット
# LR2d = np.zeros((N + 1, N + 1), np.int64)
# for L, R in LR:
# LR2d[L, R] += 1 #ここがボトルネック
# numpy使わずに再実装
LR2d = [[0] * (N + 1) for _ in range(N + 1)]
for L, R in LR:
LR2d[L][R] += 1
LR2d = np.array(LR2d)
LR2d_accum = np.zeros((N + 2, N + 2), np.int64)
LR2d_accum[1:, 1:] = LR2d.cumsum(axis=0).cumsum(axis=1) # 1次元累積和同様半開区間で考える
# つまりインデックスi,jとはもとの配列においてi,jを含まない四角形の領域の合計を出す
# queryに答えていく
for p, q in pq:
print(
(
LR2d_accum[q + 1, q + 1]
- LR2d_accum[q + 1, p]
- LR2d_accum[p, q + 1]
+ LR2d_accum[p, p]
)
)
| false | 14.285714 | [
"-# 二次元座標上へのプロット",
"-LR2d = np.zeros((N + 1, N + 1), np.int64)",
"+# # 二次元座標上へのプロット",
"+# LR2d = np.zeros((N + 1, N + 1), np.int64)",
"+# for L, R in LR:",
"+# LR2d[L, R] += 1 #ここがボトルネック",
"+# numpy使わずに再実装",
"+LR2d = [[0] * (N + 1) for _ in range(N + 1)]",
"- LR2d[L, R] += 1",
"+ LR2d[L]... | false | 0.252866 | 0.224501 | 1.126347 | [
"s831862724",
"s577827943"
] |
u648212584 | p03634 | python | s934491272 | s591764657 | 758 | 603 | 87,516 | 75,952 | Accepted | Accepted | 20.45 | import sys
input = sys.stdin.readline
def main():
N = int(eval(input()))
X = [list(map(int,input().split())) for _ in range(N-1)]
Q,K = list(map(int,input().split()))
Y = [list(map(int,input().split())) for _ in range(Q)]
tree = [[] for _ in range(N)]
dif = [10**15 for _ in range(N)]
dif[K-1] = 0
for i in range(N-1):
tree[X[i][0]-1].append((X[i][1]-1,X[i][2]))
tree[X[i][1]-1].append((X[i][0]-1,X[i][2]))
queue = [K-1]
while queue:
a = queue.pop()
for i in tree[a]:
s,t = i[0],i[1]
if dif[s] == 10**15:
dif[s] = dif[a]+t
queue.append(s)
for i in range(Q):
print((dif[Y[i][0]-1]+dif[Y[i][1]-1]))
if __name__ == "__main__":
main() | import sys
input = sys.stdin.buffer.readline
import heapq
def main():
N = int(eval(input()))
edge = [[] for _ in range(N)]
for _ in range(N-1):
a,b,d = list(map(int,input().split()))
edge[a-1].append((b-1,d))
edge[b-1].append((a-1,d))
Q,K = list(map(int,input().split()))
dist = [-1]*N
dist[(K-1)] = 0
q = [(0,K-1)]
heapq.heapify(q)
while q:
_,now = heapq.heappop(q)
for fol,d in edge[now]:
if dist[fol] == -1:
dist[fol] = dist[now]+d
heapq.heappush(q,(dist[fol],fol))
for _ in range(Q):
a,b = list(map(int,input().split()))
print((dist[a-1]+dist[b-1]))
if __name__ == "__main__":
main()
| 30 | 30 | 794 | 634 | import sys
input = sys.stdin.readline
def main():
N = int(eval(input()))
X = [list(map(int, input().split())) for _ in range(N - 1)]
Q, K = list(map(int, input().split()))
Y = [list(map(int, input().split())) for _ in range(Q)]
tree = [[] for _ in range(N)]
dif = [10**15 for _ in range(N)]
dif[K - 1] = 0
for i in range(N - 1):
tree[X[i][0] - 1].append((X[i][1] - 1, X[i][2]))
tree[X[i][1] - 1].append((X[i][0] - 1, X[i][2]))
queue = [K - 1]
while queue:
a = queue.pop()
for i in tree[a]:
s, t = i[0], i[1]
if dif[s] == 10**15:
dif[s] = dif[a] + t
queue.append(s)
for i in range(Q):
print((dif[Y[i][0] - 1] + dif[Y[i][1] - 1]))
if __name__ == "__main__":
main()
| import sys
input = sys.stdin.buffer.readline
import heapq
def main():
N = int(eval(input()))
edge = [[] for _ in range(N)]
for _ in range(N - 1):
a, b, d = list(map(int, input().split()))
edge[a - 1].append((b - 1, d))
edge[b - 1].append((a - 1, d))
Q, K = list(map(int, input().split()))
dist = [-1] * N
dist[(K - 1)] = 0
q = [(0, K - 1)]
heapq.heapify(q)
while q:
_, now = heapq.heappop(q)
for fol, d in edge[now]:
if dist[fol] == -1:
dist[fol] = dist[now] + d
heapq.heappush(q, (dist[fol], fol))
for _ in range(Q):
a, b = list(map(int, input().split()))
print((dist[a - 1] + dist[b - 1]))
if __name__ == "__main__":
main()
| false | 0 | [
"-input = sys.stdin.readline",
"+input = sys.stdin.buffer.readline",
"+import heapq",
"- X = [list(map(int, input().split())) for _ in range(N - 1)]",
"+ edge = [[] for _ in range(N)]",
"+ for _ in range(N - 1):",
"+ a, b, d = list(map(int, input().split()))",
"+ edge[a - 1].app... | false | 0.042888 | 0.037564 | 1.14174 | [
"s934491272",
"s591764657"
] |
u753803401 | p02845 | python | s456783160 | s932554749 | 245 | 226 | 55,524 | 61,548 | Accepted | Accepted | 7.76 | import sys
import collections
def solve():
readline = sys.stdin.buffer.readline
mod = 10 ** 9 + 7
n = int(readline())
a = list(map(int, readline().split()))
d = collections.defaultdict(int)
t = 1
for i in range(n):
if a[i] == 0:
t *= 3 - d[0]
d[a[i]] += 1
else:
t *= d[a[i]-1] - d[a[i]]
d[a[i]] += 1
t %= mod
print(t)
if __name__ == '__main__':
solve()
| import sys
import collections
def solve():
input = sys.stdin.readline
mod = 10 ** 9 + 7
n = int(input().rstrip('\n'))
a = list(map(int, input().rstrip('\n').split()))
d = collections.defaultdict(int)
d[-1] = 3
cnt = 1
for v in a:
cnt *= d[v-1]
d[v] += 1
d[v-1] -= 1
cnt %= mod
print(cnt)
if __name__ == '__main__':
solve()
| 24 | 22 | 488 | 420 | import sys
import collections
def solve():
readline = sys.stdin.buffer.readline
mod = 10**9 + 7
n = int(readline())
a = list(map(int, readline().split()))
d = collections.defaultdict(int)
t = 1
for i in range(n):
if a[i] == 0:
t *= 3 - d[0]
d[a[i]] += 1
else:
t *= d[a[i] - 1] - d[a[i]]
d[a[i]] += 1
t %= mod
print(t)
if __name__ == "__main__":
solve()
| import sys
import collections
def solve():
input = sys.stdin.readline
mod = 10**9 + 7
n = int(input().rstrip("\n"))
a = list(map(int, input().rstrip("\n").split()))
d = collections.defaultdict(int)
d[-1] = 3
cnt = 1
for v in a:
cnt *= d[v - 1]
d[v] += 1
d[v - 1] -= 1
cnt %= mod
print(cnt)
if __name__ == "__main__":
solve()
| false | 8.333333 | [
"- readline = sys.stdin.buffer.readline",
"+ input = sys.stdin.readline",
"- n = int(readline())",
"- a = list(map(int, readline().split()))",
"+ n = int(input().rstrip(\"\\n\"))",
"+ a = list(map(int, input().rstrip(\"\\n\").split()))",
"- t = 1",
"- for i in range(n):",
"- ... | false | 0.050397 | 0.035219 | 1.43097 | [
"s456783160",
"s932554749"
] |
u543954314 | p02641 | python | s316240249 | s395410616 | 25 | 22 | 9,168 | 9,132 | Accepted | Accepted | 12 | x, n = list(map(int, input().split()))
a = set(map(int, input().split()))
print((min([i for i in range(102) if i not in a], key=lambda y:abs(x-y))))
| x, n = list(map(int, input().split()))
a = set(map(int, input().split()))
print((min((i for i in range(102) if i not in a), key=lambda y:abs(x-y))))
| 3 | 3 | 143 | 143 | x, n = list(map(int, input().split()))
a = set(map(int, input().split()))
print((min([i for i in range(102) if i not in a], key=lambda y: abs(x - y))))
| x, n = list(map(int, input().split()))
a = set(map(int, input().split()))
print((min((i for i in range(102) if i not in a), key=lambda y: abs(x - y))))
| false | 0 | [
"-print((min([i for i in range(102) if i not in a], key=lambda y: abs(x - y))))",
"+print((min((i for i in range(102) if i not in a), key=lambda y: abs(x - y))))"
] | false | 0.036718 | 0.069179 | 0.530766 | [
"s316240249",
"s395410616"
] |
u761320129 | p03633 | python | s808084111 | s747136160 | 42 | 35 | 5,432 | 5,048 | Accepted | Accepted | 16.67 | import fractions
N = int(eval(input()))
lcm = 1
for i in range(N):
t = int(eval(input()))
lcm = lcm * t // fractions.gcd(lcm,t)
print(lcm)
| from fractions import gcd
N = int(eval(input()))
ts = [int(eval(input())) for i in range(N)]
lcm = 1
for t in ts:
lcm = lcm * t // gcd(lcm,t)
print(lcm) | 7 | 8 | 141 | 152 | import fractions
N = int(eval(input()))
lcm = 1
for i in range(N):
t = int(eval(input()))
lcm = lcm * t // fractions.gcd(lcm, t)
print(lcm)
| from fractions import gcd
N = int(eval(input()))
ts = [int(eval(input())) for i in range(N)]
lcm = 1
for t in ts:
lcm = lcm * t // gcd(lcm, t)
print(lcm)
| false | 12.5 | [
"-import fractions",
"+from fractions import gcd",
"+ts = [int(eval(input())) for i in range(N)]",
"-for i in range(N):",
"- t = int(eval(input()))",
"- lcm = lcm * t // fractions.gcd(lcm, t)",
"+for t in ts:",
"+ lcm = lcm * t // gcd(lcm, t)"
] | false | 0.059521 | 0.060481 | 0.984124 | [
"s808084111",
"s747136160"
] |
u767797498 | p02597 | python | s862637636 | s462383698 | 65 | 29 | 9,316 | 9,384 | Accepted | Accepted | 55.38 | n=int(eval(input()))
s=eval(input())
cnt=0
ri=len(s)-1
for li,ss in enumerate(s):
if ss=="W":
while ri>li and s[ri]=="W":
ri-=1
if ri<=li:
break
ri-=1
cnt+=1
print(cnt)
| n=int(eval(input()))
s=eval(input())
rcnt=s.count("R")
wcnt=s[:rcnt].count("W")
print(wcnt) | 14 | 6 | 202 | 85 | n = int(eval(input()))
s = eval(input())
cnt = 0
ri = len(s) - 1
for li, ss in enumerate(s):
if ss == "W":
while ri > li and s[ri] == "W":
ri -= 1
if ri <= li:
break
ri -= 1
cnt += 1
print(cnt)
| n = int(eval(input()))
s = eval(input())
rcnt = s.count("R")
wcnt = s[:rcnt].count("W")
print(wcnt)
| false | 57.142857 | [
"-cnt = 0",
"-ri = len(s) - 1",
"-for li, ss in enumerate(s):",
"- if ss == \"W\":",
"- while ri > li and s[ri] == \"W\":",
"- ri -= 1",
"- if ri <= li:",
"- break",
"- ri -= 1",
"- cnt += 1",
"-print(cnt)",
"+rcnt = s.count(\"R\")",
"+wcn... | false | 0.034872 | 0.042679 | 0.817071 | [
"s862637636",
"s462383698"
] |
u367701763 | p02862 | python | s082305399 | s806283841 | 223 | 88 | 65,628 | 73,328 | Accepted | Accepted | 60.54 | # https://atcoder.jp/contests/abc145/tasks/abc145_d
X, Y = list(map(int, input().split()))
if (2*Y- X) % 3 or (2*X- Y) % 3:
print((0))
exit()
x = (2*Y - X) // 3
y = (2*X - Y) // 3
if x < 0 or y < 0:
print((0))
exit()
n = x + y
r = x
mod = 10**9 + 7
f = 1
for i in range(1, n + 1):
f = f*i % mod
fac = f
f = pow(f, mod-2, mod)
facinv = [f]
for i in range(n, 0, -1):
f = f*i % mod
facinv.append(f)
facinv.append(1)
print((fac * facinv[r] * facinv[n - r] % mod)) | from functools import reduce
def combination2(n, r, MOD=10**9+7):
if not 0 <= r <= n: return 0
r = min(r, n - r)
numerator = reduce(lambda x, y: x * y % MOD, list(range(n, n - r, -1)), 1)
denominator = reduce(lambda x, y: x * y % MOD, list(range(1, r + 1)), 1)
return numerator * pow(denominator, MOD - 2, MOD) % MOD
X, Y = list(map(int, input().split()))
if (2*X-Y)%3 or (2*Y-X)%3:
print((0))
exit()
x, y = (2*X-Y)//3, (2*Y-X)//3
print((combination2(x+y,x)))
| 33 | 15 | 516 | 482 | # https://atcoder.jp/contests/abc145/tasks/abc145_d
X, Y = list(map(int, input().split()))
if (2 * Y - X) % 3 or (2 * X - Y) % 3:
print((0))
exit()
x = (2 * Y - X) // 3
y = (2 * X - Y) // 3
if x < 0 or y < 0:
print((0))
exit()
n = x + y
r = x
mod = 10**9 + 7
f = 1
for i in range(1, n + 1):
f = f * i % mod
fac = f
f = pow(f, mod - 2, mod)
facinv = [f]
for i in range(n, 0, -1):
f = f * i % mod
facinv.append(f)
facinv.append(1)
print((fac * facinv[r] * facinv[n - r] % mod))
| from functools import reduce
def combination2(n, r, MOD=10**9 + 7):
if not 0 <= r <= n:
return 0
r = min(r, n - r)
numerator = reduce(lambda x, y: x * y % MOD, list(range(n, n - r, -1)), 1)
denominator = reduce(lambda x, y: x * y % MOD, list(range(1, r + 1)), 1)
return numerator * pow(denominator, MOD - 2, MOD) % MOD
X, Y = list(map(int, input().split()))
if (2 * X - Y) % 3 or (2 * Y - X) % 3:
print((0))
exit()
x, y = (2 * X - Y) // 3, (2 * Y - X) // 3
print((combination2(x + y, x)))
| false | 54.545455 | [
"-# https://atcoder.jp/contests/abc145/tasks/abc145_d",
"+from functools import reduce",
"+",
"+",
"+def combination2(n, r, MOD=10**9 + 7):",
"+ if not 0 <= r <= n:",
"+ return 0",
"+ r = min(r, n - r)",
"+ numerator = reduce(lambda x, y: x * y % MOD, list(range(n, n - r, -1)), 1)",
... | false | 0.174306 | 0.057421 | 3.035587 | [
"s082305399",
"s806283841"
] |
u414980766 | p02862 | python | s388338630 | s334541164 | 845 | 363 | 82,072 | 45,172 | Accepted | Accepted | 57.04 | x, y = list(map(int, input().split()))
if (x + y)%3 != 0:
print((0))
else:
k = (x + y)//3
if k <= x <= 2*k:
MOD = 10**9 + 7
fac = [0]*(k + 1)
finv = [0]*(k + 1)
inv = [0]*(k + 1)
fac[0] = 1; fac[1] = 1; finv[0] =1; finv[1] = 1; inv[1] = 1
for i in range(2, k + 1):
fac[i] = fac[i - 1] * i % MOD
inv[i] = MOD - inv[MOD%i] * (MOD // i) % MOD
finv[i] = finv[i - 1] * inv[i] % MOD
i = x - k
print((fac[k] * (finv[i] * finv[k - i] % MOD) % MOD))
else:
print((0)) | # 拡張ユークリッド互除法を用いて逆元を求める
def modinv(a, m):
b = m; x0 = 1; x1 = 0
while b:
q = a//b
a, b = b, a%b
x0, x1 = x1, x0 - q*x1
return x0%m
x, y = list(map(int, input().split()))
if (x + y)%3 != 0:
print((0))
else:
k = (x + y)//3
if k <= x <= 2*k:
i = min(x - k, 2*k - x)
# 結局 コンビネーションkCiに帰着
MOD = 10**9 + 7
# まず階乗のmodを求める
fac = [1]*(k + 1)
for j in range(2, k + 1):
fac[j] = fac[j - 1]*j%MOD
# 次に階乗の逆元を求める
finv = [0]*(k + 1)
#finv[k] = pow(fac[k], MOD - 2, MOD) # fac[k]の逆元, フェルマーの小定理
finv[k] = modinv(fac[k], MOD)
for j in range(k, i, - 1):
finv[j - 1] = finv[j]*j%MOD
print((fac[k] * (finv[i] * finv[k - i] % MOD) % MOD))
else:
print((0)) | 20 | 33 | 597 | 836 | x, y = list(map(int, input().split()))
if (x + y) % 3 != 0:
print((0))
else:
k = (x + y) // 3
if k <= x <= 2 * k:
MOD = 10**9 + 7
fac = [0] * (k + 1)
finv = [0] * (k + 1)
inv = [0] * (k + 1)
fac[0] = 1
fac[1] = 1
finv[0] = 1
finv[1] = 1
inv[1] = 1
for i in range(2, k + 1):
fac[i] = fac[i - 1] * i % MOD
inv[i] = MOD - inv[MOD % i] * (MOD // i) % MOD
finv[i] = finv[i - 1] * inv[i] % MOD
i = x - k
print((fac[k] * (finv[i] * finv[k - i] % MOD) % MOD))
else:
print((0))
| # 拡張ユークリッド互除法を用いて逆元を求める
def modinv(a, m):
b = m
x0 = 1
x1 = 0
while b:
q = a // b
a, b = b, a % b
x0, x1 = x1, x0 - q * x1
return x0 % m
x, y = list(map(int, input().split()))
if (x + y) % 3 != 0:
print((0))
else:
k = (x + y) // 3
if k <= x <= 2 * k:
i = min(x - k, 2 * k - x)
# 結局 コンビネーションkCiに帰着
MOD = 10**9 + 7
# まず階乗のmodを求める
fac = [1] * (k + 1)
for j in range(2, k + 1):
fac[j] = fac[j - 1] * j % MOD
# 次に階乗の逆元を求める
finv = [0] * (k + 1)
# finv[k] = pow(fac[k], MOD - 2, MOD) # fac[k]の逆元, フェルマーの小定理
finv[k] = modinv(fac[k], MOD)
for j in range(k, i, -1):
finv[j - 1] = finv[j] * j % MOD
print((fac[k] * (finv[i] * finv[k - i] % MOD) % MOD))
else:
print((0))
| false | 39.393939 | [
"+# 拡張ユークリッド互除法を用いて逆元を求める",
"+def modinv(a, m):",
"+ b = m",
"+ x0 = 1",
"+ x1 = 0",
"+ while b:",
"+ q = a // b",
"+ a, b = b, a % b",
"+ x0, x1 = x1, x0 - q * x1",
"+ return x0 % m",
"+",
"+",
"+ i = min(x - k, 2 * k - x)",
"+ # 結局 コンビネーシ... | false | 0.218159 | 0.111499 | 1.956599 | [
"s388338630",
"s334541164"
] |
u581022379 | p03273 | python | s275884078 | s190273986 | 29 | 24 | 9,156 | 9,148 | Accepted | Accepted | 17.24 | H, W = list(map(int, input().split()))
field = []
for _ in range(H):
tmp = eval(input())
if tmp.count('#') == 0:
continue
else:
field.append(tmp)
ans_field = ["."] * len(field)
for column in range(W):
del_flag = True
for row in range(len(field)):
if field[row][column] == '#':
del_flag = False
break
if not del_flag:
for row in range(len(field)):
ans_field[row] += field[row][column]
for val in ans_field:
print((val[1:]))
| H, W = list(map(int, input().split()))
field = []
for _ in range(H):
tmp = eval(input())
if tmp.count('#') == 0:
continue
else:
field.append(tmp)
ans_field = [""] * len(field)
for column in range(W):
del_flag = True
for row in range(len(field)):
if field[row][column] == '#':
del_flag = False
break
if not del_flag:
for row in range(len(field)):
ans_field[row] += field[row][column]
for val in ans_field:
print(val)
| 20 | 20 | 524 | 519 | H, W = list(map(int, input().split()))
field = []
for _ in range(H):
tmp = eval(input())
if tmp.count("#") == 0:
continue
else:
field.append(tmp)
ans_field = ["."] * len(field)
for column in range(W):
del_flag = True
for row in range(len(field)):
if field[row][column] == "#":
del_flag = False
break
if not del_flag:
for row in range(len(field)):
ans_field[row] += field[row][column]
for val in ans_field:
print((val[1:]))
| H, W = list(map(int, input().split()))
field = []
for _ in range(H):
tmp = eval(input())
if tmp.count("#") == 0:
continue
else:
field.append(tmp)
ans_field = [""] * len(field)
for column in range(W):
del_flag = True
for row in range(len(field)):
if field[row][column] == "#":
del_flag = False
break
if not del_flag:
for row in range(len(field)):
ans_field[row] += field[row][column]
for val in ans_field:
print(val)
| false | 0 | [
"-ans_field = [\".\"] * len(field)",
"+ans_field = [\"\"] * len(field)",
"- print((val[1:]))",
"+ print(val)"
] | false | 0.036018 | 0.036952 | 0.974711 | [
"s275884078",
"s190273986"
] |
u072717685 | p02624 | python | s438722272 | s370921365 | 1,221 | 582 | 9,172 | 339,812 | Accepted | Accepted | 52.33 | import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
#import numpy as np
def main():
n = int(eval(input()))
if n == 1:
print((1))
sys.exit()
r = 0
for i1 in range(1, n + 1):
num_of_div = n // i1
r += num_of_div * (num_of_div + 1) // 2 * i1
print(r)
if __name__ == '__main__':
main()
| import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
import numpy as np
def main():
n = int(eval(input()))
if n == 1:
print((1))
sys.exit()
divs = np.arange(1, n + 1)
divs2 = n // divs
divs3 = divs2 * (divs2 + 1) // 2
divs3 = divs3 * divs
r = divs3.sum()
print(r)
if __name__ == '__main__':
main()
| 18 | 19 | 391 | 403 | import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
# import numpy as np
def main():
n = int(eval(input()))
if n == 1:
print((1))
sys.exit()
r = 0
for i1 in range(1, n + 1):
num_of_div = n // i1
r += num_of_div * (num_of_div + 1) // 2 * i1
print(r)
if __name__ == "__main__":
main()
| import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
import numpy as np
def main():
n = int(eval(input()))
if n == 1:
print((1))
sys.exit()
divs = np.arange(1, n + 1)
divs2 = n // divs
divs3 = divs2 * (divs2 + 1) // 2
divs3 = divs3 * divs
r = divs3.sum()
print(r)
if __name__ == "__main__":
main()
| false | 5.263158 | [
"-# import numpy as np",
"+import numpy as np",
"+",
"+",
"- r = 0",
"- for i1 in range(1, n + 1):",
"- num_of_div = n // i1",
"- r += num_of_div * (num_of_div + 1) // 2 * i1",
"+ divs = np.arange(1, n + 1)",
"+ divs2 = n // divs",
"+ divs3 = divs2 * (divs2 + 1) // 2... | false | 0.551713 | 0.309924 | 1.780155 | [
"s438722272",
"s370921365"
] |
u197300260 | p03308 | python | s675048032 | s061547709 | 19 | 17 | 3,188 | 2,940 | Accepted | Accepted | 10.53 | # Problem https://atcoder.jp/contests/abc102/tasks/abc102_b
# Python 2nd Try
import sys
def solver(allN, numberList):
answer = 0
for j in range(0, allN):
for k in range(0, allN):
nowAbs = (numberList[j] - numberList[k]).__abs__()
if answer < nowAbs:
answer = nowAbs
return answer
if __name__ == "__main__":
N = sys.stdin.readline().rsplit()
Ai = list(map(int, sys.stdin.readline().split()))
answer = solver(int(N[0]), Ai)
print(answer)
| # Problem https://atcoder.jp/contests/abc102/tasks/abc102_b
# Python 3rd Try
import sys
def solve(cells):
answer = 0
cells.sort(reverse=True)
answer = cells[0] - cells[-1]
return answer
if __name__ == "__main__":
X = list(map(int, sys.stdin.readline().split()))
AI = list(map(int, sys.stdin.readline().split()))
print((solve(AI)))
| 20 | 16 | 535 | 376 | # Problem https://atcoder.jp/contests/abc102/tasks/abc102_b
# Python 2nd Try
import sys
def solver(allN, numberList):
answer = 0
for j in range(0, allN):
for k in range(0, allN):
nowAbs = (numberList[j] - numberList[k]).__abs__()
if answer < nowAbs:
answer = nowAbs
return answer
if __name__ == "__main__":
N = sys.stdin.readline().rsplit()
Ai = list(map(int, sys.stdin.readline().split()))
answer = solver(int(N[0]), Ai)
print(answer)
| # Problem https://atcoder.jp/contests/abc102/tasks/abc102_b
# Python 3rd Try
import sys
def solve(cells):
answer = 0
cells.sort(reverse=True)
answer = cells[0] - cells[-1]
return answer
if __name__ == "__main__":
X = list(map(int, sys.stdin.readline().split()))
AI = list(map(int, sys.stdin.readline().split()))
print((solve(AI)))
| false | 20 | [
"-# Python 2nd Try",
"+# Python 3rd Try",
"-def solver(allN, numberList):",
"+def solve(cells):",
"- for j in range(0, allN):",
"- for k in range(0, allN):",
"- nowAbs = (numberList[j] - numberList[k]).__abs__()",
"- if answer < nowAbs:",
"- answer = no... | false | 0.047172 | 0.045369 | 1.039724 | [
"s675048032",
"s061547709"
] |
u594859393 | p03354 | python | s386170595 | s895736087 | 816 | 747 | 61,488 | 61,360 | Accepted | Accepted | 8.46 | n, m = list(map(int, input().split()))
ps = [int(p)-1 for p in input().split()]
xys = [tuple(int(x)-1 for x in input().split()) for _ in range(m)]
nodes = list(range(n))
union = {node:node for node in nodes}
def root(node, previouss=None):
if not previouss:
previouss = []
if union[node] == node:
for previous in previouss:
union[previous] = node
return node
else:
previouss.append(node)
return root(union[node], previouss)
for x, y in xys:
rx = root(x)
ry = root(y)
union[rx] = ry
groups = {node:{node} for node, rootn in list(union.items()) if node==rootn}
for node in nodes:
if node in groups:
continue
group = groups[root(node)]
group.add(node)
groups[node] = group
print((sum(p in groups[i] for i, p in enumerate(ps)))) | n, m = list(map(int, input().split()))
ps = [int(p)-1 for p in input().split()]
xys = [tuple(int(x)-1 for x in input().split()) for _ in range(m)]
nodes = list(range(n))
union = {node:node for node in nodes}
def root(node):
if union[node] == node:
return node
union[node] = root(union[node])
return union[node]
for x, y in xys:
rx = root(x)
ry = root(y)
union[rx] = ry
groups = {node:{node} for node, rootn in list(union.items()) if node==rootn}
for node in nodes:
if node in groups:
continue
group = groups[root(node)]
group.add(node)
groups[node] = group
print((sum(p in groups[i] for i, p in enumerate(ps)))) | 33 | 27 | 843 | 679 | n, m = list(map(int, input().split()))
ps = [int(p) - 1 for p in input().split()]
xys = [tuple(int(x) - 1 for x in input().split()) for _ in range(m)]
nodes = list(range(n))
union = {node: node for node in nodes}
def root(node, previouss=None):
if not previouss:
previouss = []
if union[node] == node:
for previous in previouss:
union[previous] = node
return node
else:
previouss.append(node)
return root(union[node], previouss)
for x, y in xys:
rx = root(x)
ry = root(y)
union[rx] = ry
groups = {node: {node} for node, rootn in list(union.items()) if node == rootn}
for node in nodes:
if node in groups:
continue
group = groups[root(node)]
group.add(node)
groups[node] = group
print((sum(p in groups[i] for i, p in enumerate(ps))))
| n, m = list(map(int, input().split()))
ps = [int(p) - 1 for p in input().split()]
xys = [tuple(int(x) - 1 for x in input().split()) for _ in range(m)]
nodes = list(range(n))
union = {node: node for node in nodes}
def root(node):
if union[node] == node:
return node
union[node] = root(union[node])
return union[node]
for x, y in xys:
rx = root(x)
ry = root(y)
union[rx] = ry
groups = {node: {node} for node, rootn in list(union.items()) if node == rootn}
for node in nodes:
if node in groups:
continue
group = groups[root(node)]
group.add(node)
groups[node] = group
print((sum(p in groups[i] for i, p in enumerate(ps))))
| false | 18.181818 | [
"-def root(node, previouss=None):",
"- if not previouss:",
"- previouss = []",
"+def root(node):",
"- for previous in previouss:",
"- union[previous] = node",
"- else:",
"- previouss.append(node)",
"- return root(union[node], previouss)",
"+ union[no... | false | 0.035851 | 0.036353 | 0.986195 | [
"s386170595",
"s895736087"
] |
u182765930 | p03814 | python | s478923800 | s788868686 | 19 | 17 | 3,516 | 3,500 | Accepted | Accepted | 10.53 | s=eval(input())
st=s.index('A')
end=s.rfind('Z')
print((end-st+1)) | s=eval(input())
print((s.rfind('Z')-s.find('A')+1)) | 4 | 2 | 61 | 44 | s = eval(input())
st = s.index("A")
end = s.rfind("Z")
print((end - st + 1))
| s = eval(input())
print((s.rfind("Z") - s.find("A") + 1))
| false | 50 | [
"-st = s.index(\"A\")",
"-end = s.rfind(\"Z\")",
"-print((end - st + 1))",
"+print((s.rfind(\"Z\") - s.find(\"A\") + 1))"
] | false | 0.067872 | 0.074069 | 0.916332 | [
"s478923800",
"s788868686"
] |
u347640436 | p02829 | python | s996896659 | s962423839 | 22 | 17 | 3,316 | 2,940 | Accepted | Accepted | 22.73 | A = int(eval(input()))
B = int(eval(input()))
print((*(set([1, 2, 3]) -set([A, B]))))
| A = int(eval(input()))
B = int(eval(input()))
print((6 - A - B))
| 4 | 4 | 77 | 55 | A = int(eval(input()))
B = int(eval(input()))
print((*(set([1, 2, 3]) - set([A, B]))))
| A = int(eval(input()))
B = int(eval(input()))
print((6 - A - B))
| false | 0 | [
"-print((*(set([1, 2, 3]) - set([A, B]))))",
"+print((6 - A - B))"
] | false | 0.037504 | 0.041352 | 0.906948 | [
"s996896659",
"s962423839"
] |
u285022453 | p02936 | python | s994989426 | s618046000 | 1,629 | 772 | 232,340 | 71,240 | Accepted | Accepted | 52.61 | import sys
sys.setrecursionlimit(10 ** 8)
input = sys.stdin.readline
n, q = list(map(int, input().split()))
edges = [[] for _ in range(n)]
for _ in range(n - 1):
frm, to = list(map(int, input().split()))
# 0-index
edges[frm - 1].append(to - 1)
edges[to - 1].append(frm - 1)
scores = [0] * n
for _ in range(q):
v, s = list(map(int, input().split()))
scores[v - 1] += s
def dfs(frm, cur):
if cur > 0:
scores[cur] += scores[frm]
for to in edges[cur]:
if frm != to:
dfs(cur, to)
dfs(-1, 0)
print((" ".join([str(w) for w in scores]))) | import sys
input = sys.stdin.readline
n, q = list(map(int, input().split()))
edges = [[] for _ in range(n)]
for _ in range(n - 1):
frm, to = list(map(int, input().split()))
# 0-index
edges[frm - 1].append(to - 1)
edges[to - 1].append(frm - 1)
scores = [0] * n
for _ in range(q):
v, s = list(map(int, input().split()))
scores[v - 1] += s
stack = [0]
visited = [False] * n
visited[0] = True
while len(stack):
frm = stack.pop()
for to in edges[frm]:
if not visited[to]:
scores[to] += scores[frm]
visited[to] = True
stack.append(to)
print((" ".join([str(w) for w in scores]))) | 29 | 32 | 604 | 667 | import sys
sys.setrecursionlimit(10**8)
input = sys.stdin.readline
n, q = list(map(int, input().split()))
edges = [[] for _ in range(n)]
for _ in range(n - 1):
frm, to = list(map(int, input().split()))
# 0-index
edges[frm - 1].append(to - 1)
edges[to - 1].append(frm - 1)
scores = [0] * n
for _ in range(q):
v, s = list(map(int, input().split()))
scores[v - 1] += s
def dfs(frm, cur):
if cur > 0:
scores[cur] += scores[frm]
for to in edges[cur]:
if frm != to:
dfs(cur, to)
dfs(-1, 0)
print((" ".join([str(w) for w in scores])))
| import sys
input = sys.stdin.readline
n, q = list(map(int, input().split()))
edges = [[] for _ in range(n)]
for _ in range(n - 1):
frm, to = list(map(int, input().split()))
# 0-index
edges[frm - 1].append(to - 1)
edges[to - 1].append(frm - 1)
scores = [0] * n
for _ in range(q):
v, s = list(map(int, input().split()))
scores[v - 1] += s
stack = [0]
visited = [False] * n
visited[0] = True
while len(stack):
frm = stack.pop()
for to in edges[frm]:
if not visited[to]:
scores[to] += scores[frm]
visited[to] = True
stack.append(to)
print((" ".join([str(w) for w in scores])))
| false | 9.375 | [
"-sys.setrecursionlimit(10**8)",
"-",
"-",
"-def dfs(frm, cur):",
"- if cur > 0:",
"- scores[cur] += scores[frm]",
"- for to in edges[cur]:",
"- if frm != to:",
"- dfs(cur, to)",
"-",
"-",
"-dfs(-1, 0)",
"+stack = [0]",
"+visited = [False] * n",
"+visited[0... | false | 0.059488 | 0.052196 | 1.139694 | [
"s994989426",
"s618046000"
] |
u235376569 | p02887 | python | s841815984 | s791420251 | 53 | 44 | 3,316 | 3,316 | Accepted | Accepted | 16.98 | N=int(eval(input()))
S=eval(input())
mae=S[0]
now=""
ans=S[0]
for i in range(N):
now=S[i]
if now==mae:
continue
else:
ans+=now
mae=now
print((len(ans))) | N=int(eval(input()))
S=eval(input())
mae=S[0]
now=""
ans=0
for i in range(N-1):
if S[i]!=S[i+1]:
ans+=1
print((ans+1))
| 14 | 9 | 170 | 119 | N = int(eval(input()))
S = eval(input())
mae = S[0]
now = ""
ans = S[0]
for i in range(N):
now = S[i]
if now == mae:
continue
else:
ans += now
mae = now
print((len(ans)))
| N = int(eval(input()))
S = eval(input())
mae = S[0]
now = ""
ans = 0
for i in range(N - 1):
if S[i] != S[i + 1]:
ans += 1
print((ans + 1))
| false | 35.714286 | [
"-ans = S[0]",
"-for i in range(N):",
"- now = S[i]",
"- if now == mae:",
"- continue",
"- else:",
"- ans += now",
"- mae = now",
"-print((len(ans)))",
"+ans = 0",
"+for i in range(N - 1):",
"+ if S[i] != S[i + 1]:",
"+ ans += 1",
"+print((ans + 1))"... | false | 0.096744 | 0.037627 | 2.571128 | [
"s841815984",
"s791420251"
] |
u098012509 | p02735 | python | s335946622 | s816839006 | 424 | 33 | 3,528 | 3,444 | Accepted | Accepted | 92.22 | import sys
import collections
sys.setrecursionlimit(10 ** 8)
input = sys.stdin.readline
def main():
H, W = [int(x) for x in input().split()]
S = [list(input().strip()) for _ in range(H)]
ans = 0
f = False
if S[0][0] == '#':
ans += 1
f = True
q = collections.deque()
q.append([[0, 0], 0, f])
d = [[10 ** 9] * W for j in range(H)]
while q:
c = q.pop()
dist = c[1]
fl = c[2]
j = c[0][0]
i = c[0][1]
if d[j][i] <= dist:
continue
else:
d[j][i] = dist
if i != W - 1:
if S[j][i + 1] == '#':
if fl:
q.append([[j, i + 1], dist, True])
else:
q.append([[j, i + 1], dist + 1, True])
else:
q.append([[j, i + 1], dist, False])
if j != H - 1:
if S[j + 1][i] == '#':
if fl:
q.append([[j + 1, i], dist, True])
else:
q.append([[j + 1, i], dist + 1, True])
else:
q.append([[j + 1, i], dist, False])
ans += d[H - 1][W - 1]
print(ans)
if __name__ == '__main__':
main()
| import sys
import collections
sys.setrecursionlimit(10 ** 8)
input = sys.stdin.readline
def main():
H, W = [int(x) for x in input().split()]
S = [list(input().strip()) for _ in range(H)]
dp = [[10 ** 9] * W for j in range(H)]
if S[0][0] == '#':
dp[0][0] = 1
else:
dp[0][0] = 0
for j in range(H):
for i in range(W):
if j != H - 1:
x = 1 if S[j + 1][i] == '#' and S[j][i] == '.' else 0
dp[j + 1][i] = min(dp[j + 1][i], dp[j][i] + x)
if i != W - 1:
x = 1 if S[j][i + 1] == '#' and S[j][i] == '.' else 0
dp[j][i + 1] = min(dp[j][i + 1], dp[j][i] + x)
print((dp[-1][-1]))
if __name__ == '__main__':
main()
| 60 | 33 | 1,310 | 785 | import sys
import collections
sys.setrecursionlimit(10**8)
input = sys.stdin.readline
def main():
H, W = [int(x) for x in input().split()]
S = [list(input().strip()) for _ in range(H)]
ans = 0
f = False
if S[0][0] == "#":
ans += 1
f = True
q = collections.deque()
q.append([[0, 0], 0, f])
d = [[10**9] * W for j in range(H)]
while q:
c = q.pop()
dist = c[1]
fl = c[2]
j = c[0][0]
i = c[0][1]
if d[j][i] <= dist:
continue
else:
d[j][i] = dist
if i != W - 1:
if S[j][i + 1] == "#":
if fl:
q.append([[j, i + 1], dist, True])
else:
q.append([[j, i + 1], dist + 1, True])
else:
q.append([[j, i + 1], dist, False])
if j != H - 1:
if S[j + 1][i] == "#":
if fl:
q.append([[j + 1, i], dist, True])
else:
q.append([[j + 1, i], dist + 1, True])
else:
q.append([[j + 1, i], dist, False])
ans += d[H - 1][W - 1]
print(ans)
if __name__ == "__main__":
main()
| import sys
import collections
sys.setrecursionlimit(10**8)
input = sys.stdin.readline
def main():
H, W = [int(x) for x in input().split()]
S = [list(input().strip()) for _ in range(H)]
dp = [[10**9] * W for j in range(H)]
if S[0][0] == "#":
dp[0][0] = 1
else:
dp[0][0] = 0
for j in range(H):
for i in range(W):
if j != H - 1:
x = 1 if S[j + 1][i] == "#" and S[j][i] == "." else 0
dp[j + 1][i] = min(dp[j + 1][i], dp[j][i] + x)
if i != W - 1:
x = 1 if S[j][i + 1] == "#" and S[j][i] == "." else 0
dp[j][i + 1] = min(dp[j][i + 1], dp[j][i] + x)
print((dp[-1][-1]))
if __name__ == "__main__":
main()
| false | 45 | [
"- ans = 0",
"- f = False",
"+ dp = [[10**9] * W for j in range(H)]",
"- ans += 1",
"- f = True",
"- q = collections.deque()",
"- q.append([[0, 0], 0, f])",
"- d = [[10**9] * W for j in range(H)]",
"- while q:",
"- c = q.pop()",
"- dist = c[1]",
... | false | 0.054457 | 0.034349 | 1.585385 | [
"s335946622",
"s816839006"
] |
u361381049 | p02793 | python | s213426047 | s057701852 | 182 | 163 | 83,860 | 83,148 | Accepted | Accepted | 10.44 | from collections import Counter
MOD = 10**9+7
N = int(eval(input()))
A = list(map(int,input().split()))
def prime_factorize(n):
N = n
a = []
while n % 2 == 0:
a.append(2)
n //= 2
f = 3
while f * f <= N:
if n % f == 0:
a.append(f)
n //= f
else:
f += 2
if n != 1:
a.append(n)
return a
prime = [0] * (10**6+5)
for i in range(N):
c = Counter(prime_factorize(A[i]))
for j in list(c.items()):
prime[j[0]] = max(j[1],prime[j[0]])
lcm = 1
for i in range(10**6+2):
if prime[i] > 0:
lcm *= pow(i,prime[i])
lcm %= MOD
ans = 0
for i in range(N):
ans += lcm * pow(A[i],MOD-2,MOD)
ans %= MOD
print(ans)
| from collections import Counter
MOD = 10**9+7
N = int(eval(input()))
A = list(map(int,input().split()))
def prime_factorize(n):
a = []
while n % 2 == 0:
a.append(2)
n //= 2
f = 3
while f * f <= n:
if n % f == 0:
a.append(f)
n //= f
else:
f += 2
if n != 1:
a.append(n)
return a
prime = [0] * (10**6+5)
for i in range(N):
c = Counter(prime_factorize(A[i]))
for j in list(c.items()):
prime[j[0]] = max(j[1],prime[j[0]])
lcm = 1
for i in range(10**6+2):
if prime[i] > 0:
lcm *= pow(i,prime[i])
lcm %= MOD
ans = 0
for i in range(N):
ans += lcm * pow(A[i],MOD-2,MOD)
ans %= MOD
print(ans)
| 36 | 35 | 761 | 750 | from collections import Counter
MOD = 10**9 + 7
N = int(eval(input()))
A = list(map(int, input().split()))
def prime_factorize(n):
N = n
a = []
while n % 2 == 0:
a.append(2)
n //= 2
f = 3
while f * f <= N:
if n % f == 0:
a.append(f)
n //= f
else:
f += 2
if n != 1:
a.append(n)
return a
prime = [0] * (10**6 + 5)
for i in range(N):
c = Counter(prime_factorize(A[i]))
for j in list(c.items()):
prime[j[0]] = max(j[1], prime[j[0]])
lcm = 1
for i in range(10**6 + 2):
if prime[i] > 0:
lcm *= pow(i, prime[i])
lcm %= MOD
ans = 0
for i in range(N):
ans += lcm * pow(A[i], MOD - 2, MOD)
ans %= MOD
print(ans)
| from collections import Counter
MOD = 10**9 + 7
N = int(eval(input()))
A = list(map(int, input().split()))
def prime_factorize(n):
a = []
while n % 2 == 0:
a.append(2)
n //= 2
f = 3
while f * f <= n:
if n % f == 0:
a.append(f)
n //= f
else:
f += 2
if n != 1:
a.append(n)
return a
prime = [0] * (10**6 + 5)
for i in range(N):
c = Counter(prime_factorize(A[i]))
for j in list(c.items()):
prime[j[0]] = max(j[1], prime[j[0]])
lcm = 1
for i in range(10**6 + 2):
if prime[i] > 0:
lcm *= pow(i, prime[i])
lcm %= MOD
ans = 0
for i in range(N):
ans += lcm * pow(A[i], MOD - 2, MOD)
ans %= MOD
print(ans)
| false | 2.777778 | [
"- N = n",
"- while f * f <= N:",
"+ while f * f <= n:"
] | false | 0.00887 | 0.252078 | 0.035188 | [
"s213426047",
"s057701852"
] |
u416011173 | p02640 | python | s543255409 | s667222259 | 24 | 22 | 9,172 | 9,204 | Accepted | Accepted | 8.33 | # -*- coding: utf-8 -*-
# モジュールのインポート
import math
# 標準入力の取得
X, Y = list(map(int, input().split()))
# 求解処理
result = False
for crane in range(X+1):
turtle = X - crane
if math.isclose(2*crane + 4*turtle, Y):
result = True
break
# 結果出力
if result:
print("Yes")
else:
print("No")
| # -*- coding: utf-8 -*-
# モジュールのインポート
import math
def get_input() -> tuple:
"""
標準入力を取得する.
Returns:\n
tuple: 標準入力
"""
X, Y = list(map(int, input().split()))
return X, Y
def main(X: int, Y: int) -> None:
"""
求解処理を行う.
Args:
X (int): 庭の動物の総数
Y (int): 庭の動物の足の総数
"""
# 求解処理
ans = "No"
for crane in range(X + 1):
turtle = X - crane
if math.isclose(2 * crane + 4 * turtle, Y):
ans = "Yes"
break
# 結果出力
print(ans)
if __name__ == "__main__":
X, Y = get_input()
main(X, Y)
| 20 | 39 | 328 | 642 | # -*- coding: utf-8 -*-
# モジュールのインポート
import math
# 標準入力の取得
X, Y = list(map(int, input().split()))
# 求解処理
result = False
for crane in range(X + 1):
turtle = X - crane
if math.isclose(2 * crane + 4 * turtle, Y):
result = True
break
# 結果出力
if result:
print("Yes")
else:
print("No")
| # -*- coding: utf-8 -*-
# モジュールのインポート
import math
def get_input() -> tuple:
"""
標準入力を取得する.
Returns:\n
tuple: 標準入力
"""
X, Y = list(map(int, input().split()))
return X, Y
def main(X: int, Y: int) -> None:
"""
求解処理を行う.
Args:
X (int): 庭の動物の総数
Y (int): 庭の動物の足の総数
"""
# 求解処理
ans = "No"
for crane in range(X + 1):
turtle = X - crane
if math.isclose(2 * crane + 4 * turtle, Y):
ans = "Yes"
break
# 結果出力
print(ans)
if __name__ == "__main__":
X, Y = get_input()
main(X, Y)
| false | 48.717949 | [
"-# 標準入力の取得",
"-X, Y = list(map(int, input().split()))",
"-# 求解処理",
"-result = False",
"-for crane in range(X + 1):",
"- turtle = X - crane",
"- if math.isclose(2 * crane + 4 * turtle, Y):",
"- result = True",
"- break",
"-# 結果出力",
"-if result:",
"- print(\"Yes\")",
"-... | false | 0.069451 | 0.069983 | 0.992405 | [
"s543255409",
"s667222259"
] |
u537976628 | p03624 | python | s419556974 | s260290267 | 31 | 28 | 9,144 | 9,072 | Accepted | Accepted | 9.68 | s = eval(input())
alp = set("abcdefghijklmnopqrstuvwxyz")
print((sorted(list(alp - set(s)))[0] if len(alp - set(s)) != 0 else 'None')) | S = set(eval(input()))
s = list('abcdefghijklmnopqrstuvwxyz')
for i in s:
if i not in S:
print(i)
exit()
print('None') | 3 | 7 | 128 | 138 | s = eval(input())
alp = set("abcdefghijklmnopqrstuvwxyz")
print((sorted(list(alp - set(s)))[0] if len(alp - set(s)) != 0 else "None"))
| S = set(eval(input()))
s = list("abcdefghijklmnopqrstuvwxyz")
for i in s:
if i not in S:
print(i)
exit()
print("None")
| false | 57.142857 | [
"-s = eval(input())",
"-alp = set(\"abcdefghijklmnopqrstuvwxyz\")",
"-print((sorted(list(alp - set(s)))[0] if len(alp - set(s)) != 0 else \"None\"))",
"+S = set(eval(input()))",
"+s = list(\"abcdefghijklmnopqrstuvwxyz\")",
"+for i in s:",
"+ if i not in S:",
"+ print(i)",
"+ exit()"... | false | 0.034094 | 0.037641 | 0.905774 | [
"s419556974",
"s260290267"
] |
u423966555 | p02555 | python | s269289091 | s169754757 | 323 | 28 | 9,208 | 9,188 | Accepted | Accepted | 91.33 | def main():
s = int(eval(input()))
mod = 10**9+7
dp = [0] * (s+1)
dp[0] = 1
for i in range(1, s+1):
for j in range(0, (i-3)+1):
dp[i] += dp[j]
dp[i] %= mod
print((dp[s]))
if __name__ == "__main__":
main()
| def main():
s = int(eval(input()))
mod = 10**9+7
dp = [0] * (s+1)
dp[0] = 1
x = 0
for i in range(1, s+1):
if i-3 >= 0:
x += dp[i-3]
x %= mod
dp[i] = x
print((dp[s]))
if __name__ == "__main__":
main()
| 13 | 15 | 270 | 279 | def main():
s = int(eval(input()))
mod = 10**9 + 7
dp = [0] * (s + 1)
dp[0] = 1
for i in range(1, s + 1):
for j in range(0, (i - 3) + 1):
dp[i] += dp[j]
dp[i] %= mod
print((dp[s]))
if __name__ == "__main__":
main()
| def main():
s = int(eval(input()))
mod = 10**9 + 7
dp = [0] * (s + 1)
dp[0] = 1
x = 0
for i in range(1, s + 1):
if i - 3 >= 0:
x += dp[i - 3]
x %= mod
dp[i] = x
print((dp[s]))
if __name__ == "__main__":
main()
| false | 13.333333 | [
"+ x = 0",
"- for j in range(0, (i - 3) + 1):",
"- dp[i] += dp[j]",
"- dp[i] %= mod",
"+ if i - 3 >= 0:",
"+ x += dp[i - 3]",
"+ x %= mod",
"+ dp[i] = x"
] | false | 0.123141 | 0.037633 | 3.272186 | [
"s269289091",
"s169754757"
] |
u102461423 | p02604 | python | s496211773 | s797913798 | 2,256 | 1,901 | 117,544 | 36,416 | Accepted | Accepted | 15.74 | import sys
import numpy as np
import numba
from numba import njit
i8 = numba.int64
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
@njit((i8[:], ), cache=True)
def main(XYP):
X, Y, P = XYP[::3], XYP[1::3], XYP[2::3]
N = len(X)
dp_X = np.empty((1 << N, N), np.int64) # 建設、人 -> Xコスト
dp_X[0] = np.abs(X) * P
for n in range(N):
B = 1 << n
dp_X[B:2 * B] = np.minimum(dp_X[:B], np.abs(X - X[n]) * P)
dp_Y = np.empty((1 << N, N), np.int64) # 建設、人 -> Xコスト
dp_Y[0] = np.abs(Y) * P
for n in range(N):
B = 1 << n
dp_Y[B:2 * B] = np.minimum(dp_Y[:B], np.abs(Y - Y[n]) * P)
popcount = np.zeros(1 << N, np.int64)
for n in range(N):
popcount[1 << n:1 << n + 1] = popcount[:1 << n] + 1
INF = 10**18
ans = np.full(N + 1, INF, np.int64)
for s in range(1 << N):
size = popcount[s]
t = s
while True:
u = s ^ t
cost = (np.minimum(dp_X[t], dp_Y[u])).sum()
ans[size] = min(ans[size], cost)
if t == 0:
break
t = (t - 1) & s
return ans
N = int(readline())
XYP = np.array(read().split(), np.int64)
ans = main(XYP)
print(('\n'.join(map(str, ans.tolist())))) | import sys
import numpy as np
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
def main(XYP):
X, Y, P = XYP[::3], XYP[1::3], XYP[2::3]
N = len(X)
dp_X = np.empty((1 << N, N), np.int64) # 建設、人 -> Xコスト
dp_X[0] = np.abs(X) * P
for n in range(N):
B = 1 << n
dp_X[B:2 * B] = np.minimum(dp_X[:B], np.abs(X - X[n]) * P)
dp_Y = np.empty((1 << N, N), np.int64) # 建設、人 -> Xコスト
dp_Y[0] = np.abs(Y) * P
for n in range(N):
B = 1 << n
dp_Y[B:2 * B] = np.minimum(dp_Y[:B], np.abs(Y - Y[n]) * P)
popcount = np.zeros(1 << N, np.int64)
for n in range(N):
popcount[1 << n:1 << n + 1] = popcount[:1 << n] + 1
INF = 10**18
ans = np.full(N + 1, INF, np.int64)
for s in range(1 << N):
size = popcount[s]
t = s
while True:
u = s ^ t
cost = (np.minimum(dp_X[t], dp_Y[u])).sum()
ans[size] = min(ans[size], cost)
if t == 0:
break
t = (t - 1) & s
return ans
if sys.argv[-1] == 'ONLINE_JUDGE':
import numba
from numba.pycc import CC
i8 = numba.int64
cc = CC('my_module')
def cc_export(f, signature):
cc.export(f.__name__, signature)(f)
return numba.njit(f)
main = cc_export(main, (i8[:], ))
cc.compile()
from my_module import main
N = int(readline())
XYP = np.array(read().split(), np.int64)
ans = main(XYP)
print(('\n'.join(map(str, ans.tolist())))) | 49 | 60 | 1,338 | 1,587 | import sys
import numpy as np
import numba
from numba import njit
i8 = numba.int64
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
@njit((i8[:],), cache=True)
def main(XYP):
X, Y, P = XYP[::3], XYP[1::3], XYP[2::3]
N = len(X)
dp_X = np.empty((1 << N, N), np.int64) # 建設、人 -> Xコスト
dp_X[0] = np.abs(X) * P
for n in range(N):
B = 1 << n
dp_X[B : 2 * B] = np.minimum(dp_X[:B], np.abs(X - X[n]) * P)
dp_Y = np.empty((1 << N, N), np.int64) # 建設、人 -> Xコスト
dp_Y[0] = np.abs(Y) * P
for n in range(N):
B = 1 << n
dp_Y[B : 2 * B] = np.minimum(dp_Y[:B], np.abs(Y - Y[n]) * P)
popcount = np.zeros(1 << N, np.int64)
for n in range(N):
popcount[1 << n : 1 << n + 1] = popcount[: 1 << n] + 1
INF = 10**18
ans = np.full(N + 1, INF, np.int64)
for s in range(1 << N):
size = popcount[s]
t = s
while True:
u = s ^ t
cost = (np.minimum(dp_X[t], dp_Y[u])).sum()
ans[size] = min(ans[size], cost)
if t == 0:
break
t = (t - 1) & s
return ans
N = int(readline())
XYP = np.array(read().split(), np.int64)
ans = main(XYP)
print(("\n".join(map(str, ans.tolist()))))
| import sys
import numpy as np
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
def main(XYP):
X, Y, P = XYP[::3], XYP[1::3], XYP[2::3]
N = len(X)
dp_X = np.empty((1 << N, N), np.int64) # 建設、人 -> Xコスト
dp_X[0] = np.abs(X) * P
for n in range(N):
B = 1 << n
dp_X[B : 2 * B] = np.minimum(dp_X[:B], np.abs(X - X[n]) * P)
dp_Y = np.empty((1 << N, N), np.int64) # 建設、人 -> Xコスト
dp_Y[0] = np.abs(Y) * P
for n in range(N):
B = 1 << n
dp_Y[B : 2 * B] = np.minimum(dp_Y[:B], np.abs(Y - Y[n]) * P)
popcount = np.zeros(1 << N, np.int64)
for n in range(N):
popcount[1 << n : 1 << n + 1] = popcount[: 1 << n] + 1
INF = 10**18
ans = np.full(N + 1, INF, np.int64)
for s in range(1 << N):
size = popcount[s]
t = s
while True:
u = s ^ t
cost = (np.minimum(dp_X[t], dp_Y[u])).sum()
ans[size] = min(ans[size], cost)
if t == 0:
break
t = (t - 1) & s
return ans
if sys.argv[-1] == "ONLINE_JUDGE":
import numba
from numba.pycc import CC
i8 = numba.int64
cc = CC("my_module")
def cc_export(f, signature):
cc.export(f.__name__, signature)(f)
return numba.njit(f)
main = cc_export(main, (i8[:],))
cc.compile()
from my_module import main
N = int(readline())
XYP = np.array(read().split(), np.int64)
ans = main(XYP)
print(("\n".join(map(str, ans.tolist()))))
| false | 18.333333 | [
"-import numba",
"-from numba import njit",
"-i8 = numba.int64",
"-@njit((i8[:],), cache=True)",
"+if sys.argv[-1] == \"ONLINE_JUDGE\":",
"+ import numba",
"+ from numba.pycc import CC",
"+",
"+ i8 = numba.int64",
"+ cc = CC(\"my_module\")",
"+",
"+ def cc_export(f, signature):"... | false | 0.195718 | 0.498015 | 0.392996 | [
"s496211773",
"s797913798"
] |
u598229387 | p03645 | python | s956695674 | s418457684 | 807 | 484 | 58,972 | 58,920 | Accepted | Accepted | 40.02 | n,m=list(map(int,input().split()))
ab=[[int(i) for i in input().split()] for j in range(m)]
li=[[] for i in range(n+1)]
for a,b in ab:
li[a].append(b)
li2=[]
for i in li[1]:
li2.append(i)
ans=False
for i in li2:
if n in li[i]:
ans=True
print(('POSSIBLE' if ans else 'IMPOSSIBLE')) | import sys
input = sys.stdin.readline
n,m=list(map(int,input().split()))
ab=[[int(i) for i in input().split()] for j in range(m)]
li=[[] for i in range(n+1)]
for a,b in ab:
li[a].append(b)
li2=[]
for i in li[1]:
li2.append(i)
ans=False
for i in li2:
if n in li[i]:
ans=True
print(('POSSIBLE' if ans else 'IMPOSSIBLE')) | 17 | 19 | 312 | 352 | n, m = list(map(int, input().split()))
ab = [[int(i) for i in input().split()] for j in range(m)]
li = [[] for i in range(n + 1)]
for a, b in ab:
li[a].append(b)
li2 = []
for i in li[1]:
li2.append(i)
ans = False
for i in li2:
if n in li[i]:
ans = True
print(("POSSIBLE" if ans else "IMPOSSIBLE"))
| import sys
input = sys.stdin.readline
n, m = list(map(int, input().split()))
ab = [[int(i) for i in input().split()] for j in range(m)]
li = [[] for i in range(n + 1)]
for a, b in ab:
li[a].append(b)
li2 = []
for i in li[1]:
li2.append(i)
ans = False
for i in li2:
if n in li[i]:
ans = True
print(("POSSIBLE" if ans else "IMPOSSIBLE"))
| false | 10.526316 | [
"+import sys",
"+",
"+input = sys.stdin.readline"
] | false | 0.156791 | 0.082384 | 1.90318 | [
"s956695674",
"s418457684"
] |
u785989355 | p02956 | python | s528157435 | s195518641 | 1,682 | 1,322 | 103,336 | 97,316 | Accepted | Accepted | 21.4 |
import sys
input = sys.stdin.readline
class SegmentTree:
def __init__(self, L, op, default_val):
self.op = op
self.default_val = default_val
self.sz = len(L)
self.n = 1
self.s = 1
for i in range(1000):
self.n *= 2
self.s += 1
if self.n >= self.sz:
break
self.node = [self.default_val]*(2*self.n-1)
for i in range(self.sz):
self.node[i+self.n-1] = L[i]
for i in range(self.n-2,-1,-1):
self.node[i] = self.op(self.node[i*2+1],self.node[i*2+2])
def add(self, a, x):
k = a+self.n-1
self.node[k] += x
for i in range(1000):
k = (k-1)//2
self.node[k] = self.op(self.node[2*k+1], self.node[2*k+2])
if k <= 0:
break
def get(self, l, r):
res = self.default_val
n = self.n
if self.sz <= r or 0 > l:
print("ERROR: the indice are wrong.")
return False
for i in range(self.s):
count = 2**i-1
a = (r+1)//n
b = (l-1)//n
if a-b == 3:
res = self.op(self.node[count+b+1],res)
res = self.op(self.node[count+b+2],res)
right = a*n
left = (b+1)*n-1
break
if a-b == 2:
res = self.op(self.node[count+b+1],res)
right = a*n
left = (b+1)*n-1
break
n = n//2
n1 = n//2
#left
for j in range(i+1,self.s):
count = 2**j-1
a = (left+1)//n1
b = (l-1)//n1
if a-b == 2:
res = self.op(self.node[count+b+1],res)
left = (b+1)*n1-1
n1 = n1//2
n1 = n//2
#right
for j in range(i+1,self.s):
count = 2**j-1
a = (r+1)//n1
b = (right-1)//n1
if a-b == 2:
res = self.op(self.node[count+b+1],res)
right = a*n1
n1 = n1//2
return res
N = int(eval(input()))
point = [list(map(int,input().split())) for i in range(N)]
point.sort(lambda x: x[1])
for i in range(len(point)):
point[i][1] = i
mod = 998244353
ans = ((N-4)*pow(2,N,mod)+3*N+4)%mod
pow2 = []
a = 1
for i in range(N+1):
pow2.append(a)
a *= 2
a %= mod
point.sort(lambda x: x[0])
ST = SegmentTree([0]*len(point), lambda a,b:a+b, 0)
for i,(x,y) in enumerate(point):
if point[i][1] > 0:
ld = ST.get(0,y-1)
#ls = i//2
else:
ld = 0
lu = i-ld
rd = y - ld
ru = N - i - 1 - rd
ans += pow2[lu]-1
ans += pow2[ld]-1
ans += pow2[ru]-1
ans += pow2[rd]-1
ans %= mod
ST.add(point[i][1],1)
print(ans) |
import sys
input = sys.stdin.readline
class BIT:
def __init__(self, L):
self.N = len(L)
self.bit = [0]*self.N
for i,l in enumerate(L):
self.add(i,l)
def add(self, a, w):
x = a + 1
for i in range(1000):
self.bit[x-1] += w
x += x & -x
if x > self.N:
break
def sum(self, a):
x = a+1
ret = 0
for i in range(1000):
ret += self.bit[x-1]
x -= x & -x
if x <= 0:
break
return ret
N = int(eval(input()))
point = [list(map(int,input().split())) for i in range(N)]
point.sort(lambda x: x[1])
for i in range(len(point)):
point[i][1] = i
mod = 998244353
ans = ((N-4)*pow(2,N,mod)+3*N+4)%mod
pow2 = []
a = 1
for i in range(N+1):
pow2.append(a)
a *= 2
a %= mod
point.sort(lambda x: x[0])
bit = BIT([0]*len(point))
for i,(x,y) in enumerate(point):
if y > 0:
ld = bit.sum(y-1)
#ls = i//2
else:
ld = 0
lu = i-ld
rd = y - ld
ru = N - i - 1 - rd
ans += pow2[lu]-1
ans += pow2[ld]-1
ans += pow2[ru]-1
ans += pow2[rd]-1
ans %= mod
bit.add(y,1)
print(ans) | 121 | 72 | 3,015 | 1,332 | import sys
input = sys.stdin.readline
class SegmentTree:
def __init__(self, L, op, default_val):
self.op = op
self.default_val = default_val
self.sz = len(L)
self.n = 1
self.s = 1
for i in range(1000):
self.n *= 2
self.s += 1
if self.n >= self.sz:
break
self.node = [self.default_val] * (2 * self.n - 1)
for i in range(self.sz):
self.node[i + self.n - 1] = L[i]
for i in range(self.n - 2, -1, -1):
self.node[i] = self.op(self.node[i * 2 + 1], self.node[i * 2 + 2])
def add(self, a, x):
k = a + self.n - 1
self.node[k] += x
for i in range(1000):
k = (k - 1) // 2
self.node[k] = self.op(self.node[2 * k + 1], self.node[2 * k + 2])
if k <= 0:
break
def get(self, l, r):
res = self.default_val
n = self.n
if self.sz <= r or 0 > l:
print("ERROR: the indice are wrong.")
return False
for i in range(self.s):
count = 2**i - 1
a = (r + 1) // n
b = (l - 1) // n
if a - b == 3:
res = self.op(self.node[count + b + 1], res)
res = self.op(self.node[count + b + 2], res)
right = a * n
left = (b + 1) * n - 1
break
if a - b == 2:
res = self.op(self.node[count + b + 1], res)
right = a * n
left = (b + 1) * n - 1
break
n = n // 2
n1 = n // 2
# left
for j in range(i + 1, self.s):
count = 2**j - 1
a = (left + 1) // n1
b = (l - 1) // n1
if a - b == 2:
res = self.op(self.node[count + b + 1], res)
left = (b + 1) * n1 - 1
n1 = n1 // 2
n1 = n // 2
# right
for j in range(i + 1, self.s):
count = 2**j - 1
a = (r + 1) // n1
b = (right - 1) // n1
if a - b == 2:
res = self.op(self.node[count + b + 1], res)
right = a * n1
n1 = n1 // 2
return res
N = int(eval(input()))
point = [list(map(int, input().split())) for i in range(N)]
point.sort(lambda x: x[1])
for i in range(len(point)):
point[i][1] = i
mod = 998244353
ans = ((N - 4) * pow(2, N, mod) + 3 * N + 4) % mod
pow2 = []
a = 1
for i in range(N + 1):
pow2.append(a)
a *= 2
a %= mod
point.sort(lambda x: x[0])
ST = SegmentTree([0] * len(point), lambda a, b: a + b, 0)
for i, (x, y) in enumerate(point):
if point[i][1] > 0:
ld = ST.get(0, y - 1)
# ls = i//2
else:
ld = 0
lu = i - ld
rd = y - ld
ru = N - i - 1 - rd
ans += pow2[lu] - 1
ans += pow2[ld] - 1
ans += pow2[ru] - 1
ans += pow2[rd] - 1
ans %= mod
ST.add(point[i][1], 1)
print(ans)
| import sys
input = sys.stdin.readline
class BIT:
def __init__(self, L):
self.N = len(L)
self.bit = [0] * self.N
for i, l in enumerate(L):
self.add(i, l)
def add(self, a, w):
x = a + 1
for i in range(1000):
self.bit[x - 1] += w
x += x & -x
if x > self.N:
break
def sum(self, a):
x = a + 1
ret = 0
for i in range(1000):
ret += self.bit[x - 1]
x -= x & -x
if x <= 0:
break
return ret
N = int(eval(input()))
point = [list(map(int, input().split())) for i in range(N)]
point.sort(lambda x: x[1])
for i in range(len(point)):
point[i][1] = i
mod = 998244353
ans = ((N - 4) * pow(2, N, mod) + 3 * N + 4) % mod
pow2 = []
a = 1
for i in range(N + 1):
pow2.append(a)
a *= 2
a %= mod
point.sort(lambda x: x[0])
bit = BIT([0] * len(point))
for i, (x, y) in enumerate(point):
if y > 0:
ld = bit.sum(y - 1)
# ls = i//2
else:
ld = 0
lu = i - ld
rd = y - ld
ru = N - i - 1 - rd
ans += pow2[lu] - 1
ans += pow2[ld] - 1
ans += pow2[ru] - 1
ans += pow2[rd] - 1
ans %= mod
bit.add(y, 1)
print(ans)
| false | 40.495868 | [
"-class SegmentTree:",
"- def __init__(self, L, op, default_val):",
"- self.op = op",
"- self.default_val = default_val",
"- self.sz = len(L)",
"- self.n = 1",
"- self.s = 1",
"+class BIT:",
"+ def __init__(self, L):",
"+ self.N = len(L)",
"+ ... | false | 0.047149 | 0.056244 | 0.838294 | [
"s528157435",
"s195518641"
] |
u349449706 | p03231 | python | s207099747 | s150062496 | 309 | 65 | 80,172 | 62,936 | Accepted | Accepted | 78.96 | import math
N, M = list(map(int, input().split()))
S = eval(input())
T = eval(input())
g = math.gcd(N,M)
l = N*M//g
print((l if S[::l//M] == T[::l//N] else -1))
| import math
N, M = list(map(int, input().split()))
S = eval(input())
T = eval(input())
g = math.gcd(N,M)
l = N*M//g
print((l if S[::N//g] == T[::M//g] else -1))
| 7 | 7 | 147 | 147 | import math
N, M = list(map(int, input().split()))
S = eval(input())
T = eval(input())
g = math.gcd(N, M)
l = N * M // g
print((l if S[:: l // M] == T[:: l // N] else -1))
| import math
N, M = list(map(int, input().split()))
S = eval(input())
T = eval(input())
g = math.gcd(N, M)
l = N * M // g
print((l if S[:: N // g] == T[:: M // g] else -1))
| false | 0 | [
"-print((l if S[:: l // M] == T[:: l // N] else -1))",
"+print((l if S[:: N // g] == T[:: M // g] else -1))"
] | false | 0.115934 | 0.089812 | 1.29086 | [
"s207099747",
"s150062496"
] |
u816631826 | p03447 | python | s616033227 | s204913429 | 17 | 10 | 2,940 | 2,568 | Accepted | Accepted | 41.18 | x=int(eval(input()))
a=int(eval(input()))
b=int(eval(input()))
x=x-a
re=x % b
print(re)
| x=int(input())
a=int(input())
b=int(input())
print((x-a)%b)
| 9 | 5 | 81 | 76 | x = int(eval(input()))
a = int(eval(input()))
b = int(eval(input()))
x = x - a
re = x % b
print(re)
| x = int(input())
a = int(input())
b = int(input())
print((x - a) % b)
| false | 44.444444 | [
"-x = int(eval(input()))",
"-a = int(eval(input()))",
"-b = int(eval(input()))",
"-x = x - a",
"-re = x % b",
"-print(re)",
"+x = int(input())",
"+a = int(input())",
"+b = int(input())",
"+print((x - a) % b)"
] | false | 0.037322 | 0.037118 | 1.005482 | [
"s616033227",
"s204913429"
] |
u808427016 | p03329 | python | s750656900 | s016138039 | 483 | 277 | 16,800 | 2,940 | Accepted | Accepted | 42.65 | from heapq import *
N = int(eval(input()))
result = 100000
ns = [1, 6, 9, 36, 81, 216, 729, 1296, 6561, 7776, 46656, 59049]
h = []
xs = {}
heappush(h, (0, 0))
while 1:
r, m = heappop(h)
if m == N:
result = r
break
for n in ns:
s = r + 1
x = m + n
if x <= N and not x in xs:
xs[x] = s
heappush(h, (s, x))
print(result)
| N = int(eval(input()))
result = 100000000000
def calc(x, base):
r = 0
while x:
x, m = divmod(x, base)
r += m
return r
for i in range(N + 1):
result = min(result, calc(i, 6) + calc(N - i, 9))
print(result)
| 28 | 15 | 424 | 249 | from heapq import *
N = int(eval(input()))
result = 100000
ns = [1, 6, 9, 36, 81, 216, 729, 1296, 6561, 7776, 46656, 59049]
h = []
xs = {}
heappush(h, (0, 0))
while 1:
r, m = heappop(h)
if m == N:
result = r
break
for n in ns:
s = r + 1
x = m + n
if x <= N and not x in xs:
xs[x] = s
heappush(h, (s, x))
print(result)
| N = int(eval(input()))
result = 100000000000
def calc(x, base):
r = 0
while x:
x, m = divmod(x, base)
r += m
return r
for i in range(N + 1):
result = min(result, calc(i, 6) + calc(N - i, 9))
print(result)
| false | 46.428571 | [
"-from heapq import *",
"+N = int(eval(input()))",
"+result = 100000000000",
"-N = int(eval(input()))",
"-result = 100000",
"-ns = [1, 6, 9, 36, 81, 216, 729, 1296, 6561, 7776, 46656, 59049]",
"-h = []",
"-xs = {}",
"-heappush(h, (0, 0))",
"-while 1:",
"- r, m = heappop(h)",
"- if m == N... | false | 0.090398 | 0.059937 | 1.508232 | [
"s750656900",
"s016138039"
] |
u419686324 | p03107 | python | s790383287 | s926465604 | 43 | 25 | 3,956 | 3,444 | Accepted | Accepted | 41.86 | S = eval(input())
stack = []
for s in S:
if stack and stack[-1] != s:
stack.pop()
else:
stack.append(s)
print((len(S) - len(stack))) | #!/usr/bin/env python3
# -*- coding: utf-8 -*-
from collections import Counter
S = eval(input())
c = Counter(S)
print((min(c.get('0', 0), c.get('1', 0)) * 2)) | 9 | 7 | 157 | 157 | S = eval(input())
stack = []
for s in S:
if stack and stack[-1] != s:
stack.pop()
else:
stack.append(s)
print((len(S) - len(stack)))
| #!/usr/bin/env python3
# -*- coding: utf-8 -*-
from collections import Counter
S = eval(input())
c = Counter(S)
print((min(c.get("0", 0), c.get("1", 0)) * 2))
| false | 22.222222 | [
"+#!/usr/bin/env python3",
"+# -*- coding: utf-8 -*-",
"+from collections import Counter",
"+",
"-stack = []",
"-for s in S:",
"- if stack and stack[-1] != s:",
"- stack.pop()",
"- else:",
"- stack.append(s)",
"-print((len(S) - len(stack)))",
"+c = Counter(S)",
"+print((m... | false | 0.046492 | 0.045464 | 1.022607 | [
"s790383287",
"s926465604"
] |
u620084012 | p03240 | python | s350468470 | s657984335 | 672 | 257 | 3,064 | 45,020 | Accepted | Accepted | 61.76 | N = int(eval(input()))
G = [list(map(int,input().split())) for k in range(N)]
if N == 1:
print((G[0][0],G[0][1],G[0][2]))
exit(0)
G = sorted(G, key=lambda x: -x[2])
for Cx in range(101):
for Cy in range(101):
f = 1
H = G[0][2] + abs(Cx-G[0][0]) + abs(Cy-G[0][1])
for k in range(1,N):
if max(0,H-abs(G[k][0]-Cx)-abs(G[k][1]-Cy)) != G[k][2]:
f = 0
if f:
print((Cx,Cy,H))
| N = int(eval(input()))
L = [list(map(int, input().split())) for k in range(N)]
m = 0
for l in L:
m = max(m,l[2])
for x in range(101):
for y in range(101):
for h in range(m,m+101):
f = 1
for l in L:
if l[2]!=max(h-abs(l[0]-x)-abs(l[1]-y),0):
f = 0
break
if f:
print((x,y,h))
exit(0) | 18 | 17 | 463 | 430 | N = int(eval(input()))
G = [list(map(int, input().split())) for k in range(N)]
if N == 1:
print((G[0][0], G[0][1], G[0][2]))
exit(0)
G = sorted(G, key=lambda x: -x[2])
for Cx in range(101):
for Cy in range(101):
f = 1
H = G[0][2] + abs(Cx - G[0][0]) + abs(Cy - G[0][1])
for k in range(1, N):
if max(0, H - abs(G[k][0] - Cx) - abs(G[k][1] - Cy)) != G[k][2]:
f = 0
if f:
print((Cx, Cy, H))
| N = int(eval(input()))
L = [list(map(int, input().split())) for k in range(N)]
m = 0
for l in L:
m = max(m, l[2])
for x in range(101):
for y in range(101):
for h in range(m, m + 101):
f = 1
for l in L:
if l[2] != max(h - abs(l[0] - x) - abs(l[1] - y), 0):
f = 0
break
if f:
print((x, y, h))
exit(0)
| false | 5.555556 | [
"-G = [list(map(int, input().split())) for k in range(N)]",
"-if N == 1:",
"- print((G[0][0], G[0][1], G[0][2]))",
"- exit(0)",
"-G = sorted(G, key=lambda x: -x[2])",
"-for Cx in range(101):",
"- for Cy in range(101):",
"- f = 1",
"- H = G[0][2] + abs(Cx - G[0][0]) + abs(Cy - ... | false | 0.086081 | 0.172503 | 0.499012 | [
"s350468470",
"s657984335"
] |
u392319141 | p02850 | python | s696534044 | s229193121 | 896 | 783 | 38,908 | 64,980 | Accepted | Accepted | 12.61 | N = int(eval(input()))
edges = [[] for _ in range(N)]
for i in range(N - 1):
fr, to = [int(a) - 1 for a in input().split()]
edges[fr].append((i, to))
edges[to].append((i, fr))
ans = [-1] * (N - 1)
st = [(0, -1)]
while st:
now, pr = st.pop()
C = []
D = set()
for i, _ in edges[now]:
D.add(ans[i])
for i in range(len(edges[now]) + 1)[::-1]:
if i in D:
continue
C.append(i)
for i, to in edges[now]:
if to == pr:
continue
ans[i] = C.pop()
st.append((to, now))
print((max(ans) + 1))
for a in ans:
print((a + 1))
| N = int(input())
edges = [[] for _ in range(N)]
for i in range(N - 1):
fr, to = map(lambda a: int(a) - 1, input().split())
edges[fr].append((i, to))
edges[to].append((i, fr))
ans = [-1] * (N - 1)
A = [set() for _ in range(N)]
st = [0]
while st:
now = st.pop()
s = 1
for i, to in edges[now]:
if ans[i] != -1:
continue
while s in A[now]:
s += 1
ans[i] = s
A[to].add(s)
A[now].add(s)
st.append(to)
print(max(ans))
print(*ans, sep="\n")
| 31 | 27 | 649 | 559 | N = int(eval(input()))
edges = [[] for _ in range(N)]
for i in range(N - 1):
fr, to = [int(a) - 1 for a in input().split()]
edges[fr].append((i, to))
edges[to].append((i, fr))
ans = [-1] * (N - 1)
st = [(0, -1)]
while st:
now, pr = st.pop()
C = []
D = set()
for i, _ in edges[now]:
D.add(ans[i])
for i in range(len(edges[now]) + 1)[::-1]:
if i in D:
continue
C.append(i)
for i, to in edges[now]:
if to == pr:
continue
ans[i] = C.pop()
st.append((to, now))
print((max(ans) + 1))
for a in ans:
print((a + 1))
| N = int(input())
edges = [[] for _ in range(N)]
for i in range(N - 1):
fr, to = map(lambda a: int(a) - 1, input().split())
edges[fr].append((i, to))
edges[to].append((i, fr))
ans = [-1] * (N - 1)
A = [set() for _ in range(N)]
st = [0]
while st:
now = st.pop()
s = 1
for i, to in edges[now]:
if ans[i] != -1:
continue
while s in A[now]:
s += 1
ans[i] = s
A[to].add(s)
A[now].add(s)
st.append(to)
print(max(ans))
print(*ans, sep="\n")
| false | 12.903226 | [
"-N = int(eval(input()))",
"+N = int(input())",
"- fr, to = [int(a) - 1 for a in input().split()]",
"+ fr, to = map(lambda a: int(a) - 1, input().split())",
"-st = [(0, -1)]",
"+A = [set() for _ in range(N)]",
"+st = [0]",
"- now, pr = st.pop()",
"- C = []",
"- D = set()",
"- f... | false | 0.042535 | 0.03657 | 1.163104 | [
"s696534044",
"s229193121"
] |
u569960318 | p02412 | python | s592253549 | s118186433 | 830 | 20 | 7,744 | 7,696 | Accepted | Accepted | 97.59 | import itertools
while True:
n,x = [int(x) for x in input().split()]
if (n,x)==(0,0): break
cnt=0
for comb in itertools.combinations(list(range(1,n+1)),3):
if sum(comb) == x: cnt+=1
print(cnt) | while True:
n,x = [int(x) for x in input().split()]
if (n,x)==(0,0): break
cnt=0
if 3*(n-1) >= x: # If n-2 + n-1 + n < x, there is no combination
a_max = x//3 - 1 # a_max + a_max+1 + a_max+2 = x
if 2*n-1 < x:
a_min = x - (2*n-1) # set minimum value of a
else:
a_min = 1
for a in range(a_min,a_max+1):
b_max = (x-a-1)//2 # b_max + b_max+1 <= x-a
b_min = (x-a) - n # set minimum value of b
b_min = b_min if b_min > a+1 else a+1
cnt += b_max - b_min + 1
print(cnt) | 8 | 16 | 221 | 606 | import itertools
while True:
n, x = [int(x) for x in input().split()]
if (n, x) == (0, 0):
break
cnt = 0
for comb in itertools.combinations(list(range(1, n + 1)), 3):
if sum(comb) == x:
cnt += 1
print(cnt)
| while True:
n, x = [int(x) for x in input().split()]
if (n, x) == (0, 0):
break
cnt = 0
if 3 * (n - 1) >= x: # If n-2 + n-1 + n < x, there is no combination
a_max = x // 3 - 1 # a_max + a_max+1 + a_max+2 = x
if 2 * n - 1 < x:
a_min = x - (2 * n - 1) # set minimum value of a
else:
a_min = 1
for a in range(a_min, a_max + 1):
b_max = (x - a - 1) // 2 # b_max + b_max+1 <= x-a
b_min = (x - a) - n # set minimum value of b
b_min = b_min if b_min > a + 1 else a + 1
cnt += b_max - b_min + 1
print(cnt)
| false | 50 | [
"-import itertools",
"-",
"- for comb in itertools.combinations(list(range(1, n + 1)), 3):",
"- if sum(comb) == x:",
"- cnt += 1",
"+ if 3 * (n - 1) >= x: # If n-2 + n-1 + n < x, there is no combination",
"+ a_max = x // 3 - 1 # a_max + a_max+1 + a_max+2 = x",
"+ ... | false | 0.064482 | 0.041363 | 1.558916 | [
"s592253549",
"s118186433"
] |
u150984829 | p02390 | python | s434589648 | s913666138 | 30 | 20 | 5,588 | 5,580 | Accepted | Accepted | 33.33 | s=int(eval(input()))
print(f'{s//3600}:{s//60%60}:{s%60}') | s=int(input())
print(s//3600,s//60%60,s%60,sep=':')
| 2 | 2 | 53 | 52 | s = int(eval(input()))
print(f"{s//3600}:{s//60%60}:{s%60}")
| s = int(input())
print(s // 3600, s // 60 % 60, s % 60, sep=":")
| false | 0 | [
"-s = int(eval(input()))",
"-print(f\"{s//3600}:{s//60%60}:{s%60}\")",
"+s = int(input())",
"+print(s // 3600, s // 60 % 60, s % 60, sep=\":\")"
] | false | 0.036264 | 0.038473 | 0.94259 | [
"s434589648",
"s913666138"
] |
u852690916 | p03438 | python | s370659506 | s280400336 | 196 | 24 | 40,560 | 4,468 | Accepted | Accepted | 87.76 | import sys
def main():
input = sys.stdin.readline
N=int(eval(input()))
*A,=list(map(int, input().split()))
*B,=list(map(int, input().split()))
asum=sum(A)
bsum=sum(B)
asmall=0
bsmall=0
for a,b in zip(A,B):
asmall+=(max(0, b-a)+1)//2
bsmall+=max(0, a-b)
t=bsum-asum
print(('Yes' if t>=max(asmall,bsmall) else 'No'))
if __name__ == '__main__':
main() | import sys
def main():
input = sys.stdin.readline
N=int(eval(input()))
*A,=list(map(int, input().split()))
*B,=list(map(int, input().split()))
opa=opb=0
for a,b in zip(A,B):
if a>=b:
opb+=a-b
else:
if (b-a)&1==0:
opa+=(b-a)//2
else:
opa+=(b-a)//2 + 1
opb+=1
print(('Yes' if opa>=opb else 'No'))
if __name__ == '__main__':
main() | 19 | 22 | 412 | 464 | import sys
def main():
input = sys.stdin.readline
N = int(eval(input()))
(*A,) = list(map(int, input().split()))
(*B,) = list(map(int, input().split()))
asum = sum(A)
bsum = sum(B)
asmall = 0
bsmall = 0
for a, b in zip(A, B):
asmall += (max(0, b - a) + 1) // 2
bsmall += max(0, a - b)
t = bsum - asum
print(("Yes" if t >= max(asmall, bsmall) else "No"))
if __name__ == "__main__":
main()
| import sys
def main():
input = sys.stdin.readline
N = int(eval(input()))
(*A,) = list(map(int, input().split()))
(*B,) = list(map(int, input().split()))
opa = opb = 0
for a, b in zip(A, B):
if a >= b:
opb += a - b
else:
if (b - a) & 1 == 0:
opa += (b - a) // 2
else:
opa += (b - a) // 2 + 1
opb += 1
print(("Yes" if opa >= opb else "No"))
if __name__ == "__main__":
main()
| false | 13.636364 | [
"- asum = sum(A)",
"- bsum = sum(B)",
"- asmall = 0",
"- bsmall = 0",
"+ opa = opb = 0",
"- asmall += (max(0, b - a) + 1) // 2",
"- bsmall += max(0, a - b)",
"- t = bsum - asum",
"- print((\"Yes\" if t >= max(asmall, bsmall) else \"No\"))",
"+ if a >= b:",... | false | 0.037593 | 0.036847 | 1.020249 | [
"s370659506",
"s280400336"
] |
u328510800 | p02880 | python | s832243586 | s848397893 | 31 | 27 | 9,136 | 9,104 | Accepted | Accepted | 12.9 | n = int(eval(input()))
def solve(n: int) -> str:
for l in range(1, 10):
for m in range(1, 10):
if n == l * m:
return "Yes"
return "No"
print((solve(n))) | n = int(eval(input()))
s = set([x for x in [x for x in range(1, 10)] if n % x == 0 and n / x < 10])
print(("No" if len(s) == 0 else "Yes")) | 10 | 3 | 179 | 137 | n = int(eval(input()))
def solve(n: int) -> str:
for l in range(1, 10):
for m in range(1, 10):
if n == l * m:
return "Yes"
return "No"
print((solve(n)))
| n = int(eval(input()))
s = set([x for x in [x for x in range(1, 10)] if n % x == 0 and n / x < 10])
print(("No" if len(s) == 0 else "Yes"))
| false | 70 | [
"-",
"-",
"-def solve(n: int) -> str:",
"- for l in range(1, 10):",
"- for m in range(1, 10):",
"- if n == l * m:",
"- return \"Yes\"",
"- return \"No\"",
"-",
"-",
"-print((solve(n)))",
"+s = set([x for x in [x for x in range(1, 10)] if n % x == 0 and n ... | false | 0.036983 | 0.035896 | 1.030255 | [
"s832243586",
"s848397893"
] |
u579699847 | p03162 | python | s333543156 | s876380922 | 885 | 814 | 51,340 | 51,380 | Accepted | Accepted | 8.02 | import itertools,sys
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
N = I()
abc = [LI() for _ in range(N)]
dp = [[0,0,0] for _ in range(N+1)]
for i,j,k in itertools.product(list(range(N)),[0,1,2],[0,1,2]):
if j==k:
continue
if i+1<=N:
dp[i+1][j] = max(dp[i+1][j],dp[i][k]+abc[i][j])
print((max(dp[-1])))
| import itertools,sys
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
N = I()
abc = [LI() for _ in range(N)]
dp = [[0,0,0] for _ in range(N)]
dp[0] = abc[0]
for i,j,k in itertools.product(list(range(N)),[0,1,2],[0,1,2]):
if j==k:
continue
if i-1>=0:
dp[i][j] = max(dp[i][j],dp[i-1][k]+abc[i][j])
print((max(dp[-1])))
| 12 | 13 | 405 | 417 | import itertools, sys
def I():
return int(sys.stdin.readline().rstrip())
def LI():
return list(map(int, sys.stdin.readline().rstrip().split()))
N = I()
abc = [LI() for _ in range(N)]
dp = [[0, 0, 0] for _ in range(N + 1)]
for i, j, k in itertools.product(list(range(N)), [0, 1, 2], [0, 1, 2]):
if j == k:
continue
if i + 1 <= N:
dp[i + 1][j] = max(dp[i + 1][j], dp[i][k] + abc[i][j])
print((max(dp[-1])))
| import itertools, sys
def I():
return int(sys.stdin.readline().rstrip())
def LI():
return list(map(int, sys.stdin.readline().rstrip().split()))
N = I()
abc = [LI() for _ in range(N)]
dp = [[0, 0, 0] for _ in range(N)]
dp[0] = abc[0]
for i, j, k in itertools.product(list(range(N)), [0, 1, 2], [0, 1, 2]):
if j == k:
continue
if i - 1 >= 0:
dp[i][j] = max(dp[i][j], dp[i - 1][k] + abc[i][j])
print((max(dp[-1])))
| false | 7.692308 | [
"-dp = [[0, 0, 0] for _ in range(N + 1)]",
"+dp = [[0, 0, 0] for _ in range(N)]",
"+dp[0] = abc[0]",
"- if i + 1 <= N:",
"- dp[i + 1][j] = max(dp[i + 1][j], dp[i][k] + abc[i][j])",
"+ if i - 1 >= 0:",
"+ dp[i][j] = max(dp[i][j], dp[i - 1][k] + abc[i][j])"
] | false | 0.054583 | 0.037855 | 1.441876 | [
"s333543156",
"s876380922"
] |
u572012241 | p03160 | python | s260837645 | s068202314 | 240 | 156 | 93,956 | 14,056 | Accepted | Accepted | 35 | import sys
sys.setrecursionlimit(10**5+10)
n = int(eval(input()))
h = list(map(int, input().split()))
f_inf = float("inf")
dp = [f_inf] *(10**5 +10)
def chmin(a,b):
if a<b:
return a
else:
return b
def rec(i):
if dp[i] < f_inf: #更新されてたらそのまま返す
return dp[i]
if i == 0 :
return 0
res = f_inf
res = chmin(res, rec(i-1) + abs(h[i]-h[i-1]))
if i > 1:
res = chmin(res, rec(i-2) + abs(h[i]-h[i-2]))
dp[i] = res
return res
print((rec(n-1)))
| n = int(eval(input()))
h = [int(i) for i in input().split()]
# dpの最小値を変更する関数
def chmin(a, b):
if a > b:
return b
else:
return a
# 無限大の値
f_inf = float('inf')
# DP テーブルを初期化 (最小化問題なので INF に初期化)
dp = [f_inf] * (10**5+10)
# 初期条件
dp[0] = 0
# 足場 i-1 から足場 i へ移動する。コストは|h[i]−h[i-1]|
# 足場 i-2 から足場 i へと移動する コストは |h[i]−h[i-2]|
for i in range(1, n):
dp[i] = chmin(dp[i], dp[i - 1] + abs(h[i] - h[i-1]))
# 一番目の足場では一つ前しか存在しない
if i > 1:
dp[i] = chmin(dp[i], dp[i - 2] + abs(h[i] - h[i -2]))
print((dp[n-1])) | 30 | 23 | 540 | 555 | import sys
sys.setrecursionlimit(10**5 + 10)
n = int(eval(input()))
h = list(map(int, input().split()))
f_inf = float("inf")
dp = [f_inf] * (10**5 + 10)
def chmin(a, b):
if a < b:
return a
else:
return b
def rec(i):
if dp[i] < f_inf: # 更新されてたらそのまま返す
return dp[i]
if i == 0:
return 0
res = f_inf
res = chmin(res, rec(i - 1) + abs(h[i] - h[i - 1]))
if i > 1:
res = chmin(res, rec(i - 2) + abs(h[i] - h[i - 2]))
dp[i] = res
return res
print((rec(n - 1)))
| n = int(eval(input()))
h = [int(i) for i in input().split()]
# dpの最小値を変更する関数
def chmin(a, b):
if a > b:
return b
else:
return a
# 無限大の値
f_inf = float("inf")
# DP テーブルを初期化 (最小化問題なので INF に初期化)
dp = [f_inf] * (10**5 + 10)
# 初期条件
dp[0] = 0
# 足場 i-1 から足場 i へ移動する。コストは|h[i]−h[i-1]|
# 足場 i-2 から足場 i へと移動する コストは |h[i]−h[i-2]|
for i in range(1, n):
dp[i] = chmin(dp[i], dp[i - 1] + abs(h[i] - h[i - 1]))
# 一番目の足場では一つ前しか存在しない
if i > 1:
dp[i] = chmin(dp[i], dp[i - 2] + abs(h[i] - h[i - 2]))
print((dp[n - 1]))
| false | 23.333333 | [
"-import sys",
"-",
"-sys.setrecursionlimit(10**5 + 10)",
"-h = list(map(int, input().split()))",
"-f_inf = float(\"inf\")",
"-dp = [f_inf] * (10**5 + 10)",
"+h = [int(i) for i in input().split()]",
"+# dpの最小値を変更する関数",
"+def chmin(a, b):",
"+ if a > b:",
"+ return b",
"+ else:",
... | false | 0.126529 | 0.037907 | 3.337917 | [
"s260837645",
"s068202314"
] |
u423665486 | p03162 | python | s741052044 | s613584776 | 849 | 662 | 22,824 | 58,932 | Accepted | Accepted | 22.03 | def resolve():
n = int(eval(input()))
dp = [[0]*3 for _ in range(n+1) ]
for i in range(1, n+1):
r = list(map(int, input().split()))
for j in range(3):
for k in range(3):
if j == k:
continue
dp[i][j] = max(dp[i][j], dp[i-1][k] + r[j])
print((max(dp[-1])))
resolve() | def resolve():
n = int(eval(input()))
dp = [[0]*3 for _ in range(n+1)]
for i in range(1, n+1):
nums = list(map(int, input().split()))
for j in range(3):
for k in range(3):
if j == k:
continue
dp[i][j] = max(dp[i][j], nums[j] + dp[i-1][k])
print((max(dp[-1])))
resolve() | 12 | 12 | 291 | 296 | def resolve():
n = int(eval(input()))
dp = [[0] * 3 for _ in range(n + 1)]
for i in range(1, n + 1):
r = list(map(int, input().split()))
for j in range(3):
for k in range(3):
if j == k:
continue
dp[i][j] = max(dp[i][j], dp[i - 1][k] + r[j])
print((max(dp[-1])))
resolve()
| def resolve():
n = int(eval(input()))
dp = [[0] * 3 for _ in range(n + 1)]
for i in range(1, n + 1):
nums = list(map(int, input().split()))
for j in range(3):
for k in range(3):
if j == k:
continue
dp[i][j] = max(dp[i][j], nums[j] + dp[i - 1][k])
print((max(dp[-1])))
resolve()
| false | 0 | [
"- r = list(map(int, input().split()))",
"+ nums = list(map(int, input().split()))",
"- dp[i][j] = max(dp[i][j], dp[i - 1][k] + r[j])",
"+ dp[i][j] = max(dp[i][j], nums[j] + dp[i - 1][k])"
] | false | 0.037217 | 0.108391 | 0.343364 | [
"s741052044",
"s613584776"
] |
u622045059 | p03168 | python | s540681375 | s866188608 | 1,078 | 987 | 278,264 | 274,672 | Accepted | Accepted | 8.44 | import math
import fractions
import bisect
import collections
import itertools
import heapq
import string
import sys
import copy
from collections import deque
sys.setrecursionlimit(10**7)
def gcd(a,b):return fractions.gcd(a,b) #最大公約数
def lcm(a,b):return (a*b) // fractions.gcd(a,b) #最小公倍数
def iin(): return int(eval(input())) #整数読み込み
def ifn(): return float(eval(input())) #浮動小数点読み込み
def isn(): return input().split() #文字列読み込み
def imn(): return list(map(int, input().split())) #整数map取得
def fmn(): return list(map(float, input().split())) #浮動小数点map取得
def iln(): return list(map(int, input().split())) #整数リスト取得
def iln_s(): return sorted(iln()) # 昇順の整数リスト取得
def iln_r(): return sorted(iln(), reverse=True) # 降順の整数リスト取得
def fln(): return list(map(float, input().split())) # 浮動小数点リスト取得
def join(l, s=''): return s.join(l) #リストを文字列に変換
def perm(l, n): return itertools.permutations(l, n) # 順列取得
def perm_count(n, r): return math.factorial(n) // math.factorial(n-r) # 順列の総数
def comb(l, n): return itertools.combinations(l, n) # 組み合わせ取得
def comb_count(n, r): return math.factorial(n) // (math.factorial(n-r) * math.factorial(r)) #組み合わせの総数
def two_distance(a, b, c, d): return ((c-a)**2 + (d-b)**2)**.5 # 2点間の距離
MOD = 10**9+7
N = iin()
p = fln()
dp = [[0 for _ in range(N+1)] for _ in range(N+1)]
dp[0][0] = 1
for i in range(N):
for j in range(N):
dp[i+1][j+1] += dp[i][j]*p[i]
dp[i+1][j] += dp[i][j]*(1-p[i])
ans = 0.0
for i in range(N//2+1, N+1):
ans += dp[N][i]
print(ans)
| import math
import fractions
import bisect
import collections
import itertools
import heapq
import string
import sys
import copy
from collections import deque
sys.setrecursionlimit(10**7)
MOD = 10**9+7
def gcd(a,b):return fractions.gcd(a,b) #最大公約数
def lcm(a,b):return (a*b) // fractions.gcd(a,b) #最小公倍数
def iin(): return int(eval(input())) #整数読み込み
def ifn(): return float(eval(input())) #浮動小数点読み込み
def isn(): return input().split() #文字列読み込み
def imn(): return list(map(int, input().split())) #整数map取得
def fmn(): return list(map(float, input().split())) #浮動小数点map取得
def iln(): return list(map(int, input().split())) #整数リスト取得
def iln_s(): return sorted(iln()) # 昇順の整数リスト取得
def iln_r(): return sorted(iln(), reverse=True) # 降順の整数リスト取得
def fln(): return list(map(float, input().split())) # 浮動小数点リスト取得
def join(l, s=''): return s.join(l) #リストを文字列に変換
def perm(l, n): return itertools.permutations(l, n) # 順列取得
def perm_count(n, r): return math.factorial(n) // math.factorial(n-r) # 順列の総数
def comb(l, n): return itertools.combinations(l, n) # 組み合わせ取得
def comb_count(n, r): return math.factorial(n) // (math.factorial(n-r) * math.factorial(r)) #組み合わせの総数
def two_distance(a, b, c, d): return ((c-a)**2 + (d-b)**2)**.5 # 2点間の距離
def add_mod(a,b): return (a+b) % MOD
N = iin()
p = fln()
dp = [[0 for _ in range(N+1)] for _ in range(N+1)]
dp[0][0] = 1
for i in range(N):
for j in range(i+1):
dp[i+1][j] += dp[i][j] * (1-p[i])
dp[i+1][j+1] += dp[i][j] * p[i]
ans = 0.0
for i in range(N//2+1, N+1):
ans += dp[N][i]
print(ans)
| 44 | 46 | 1,513 | 1,559 | import math
import fractions
import bisect
import collections
import itertools
import heapq
import string
import sys
import copy
from collections import deque
sys.setrecursionlimit(10**7)
def gcd(a, b):
return fractions.gcd(a, b) # 最大公約数
def lcm(a, b):
return (a * b) // fractions.gcd(a, b) # 最小公倍数
def iin():
return int(eval(input())) # 整数読み込み
def ifn():
return float(eval(input())) # 浮動小数点読み込み
def isn():
return input().split() # 文字列読み込み
def imn():
return list(map(int, input().split())) # 整数map取得
def fmn():
return list(map(float, input().split())) # 浮動小数点map取得
def iln():
return list(map(int, input().split())) # 整数リスト取得
def iln_s():
return sorted(iln()) # 昇順の整数リスト取得
def iln_r():
return sorted(iln(), reverse=True) # 降順の整数リスト取得
def fln():
return list(map(float, input().split())) # 浮動小数点リスト取得
def join(l, s=""):
return s.join(l) # リストを文字列に変換
def perm(l, n):
return itertools.permutations(l, n) # 順列取得
def perm_count(n, r):
return math.factorial(n) // math.factorial(n - r) # 順列の総数
def comb(l, n):
return itertools.combinations(l, n) # 組み合わせ取得
def comb_count(n, r):
return math.factorial(n) // (math.factorial(n - r) * math.factorial(r)) # 組み合わせの総数
def two_distance(a, b, c, d):
return ((c - a) ** 2 + (d - b) ** 2) ** 0.5 # 2点間の距離
MOD = 10**9 + 7
N = iin()
p = fln()
dp = [[0 for _ in range(N + 1)] for _ in range(N + 1)]
dp[0][0] = 1
for i in range(N):
for j in range(N):
dp[i + 1][j + 1] += dp[i][j] * p[i]
dp[i + 1][j] += dp[i][j] * (1 - p[i])
ans = 0.0
for i in range(N // 2 + 1, N + 1):
ans += dp[N][i]
print(ans)
| import math
import fractions
import bisect
import collections
import itertools
import heapq
import string
import sys
import copy
from collections import deque
sys.setrecursionlimit(10**7)
MOD = 10**9 + 7
def gcd(a, b):
return fractions.gcd(a, b) # 最大公約数
def lcm(a, b):
return (a * b) // fractions.gcd(a, b) # 最小公倍数
def iin():
return int(eval(input())) # 整数読み込み
def ifn():
return float(eval(input())) # 浮動小数点読み込み
def isn():
return input().split() # 文字列読み込み
def imn():
return list(map(int, input().split())) # 整数map取得
def fmn():
return list(map(float, input().split())) # 浮動小数点map取得
def iln():
return list(map(int, input().split())) # 整数リスト取得
def iln_s():
return sorted(iln()) # 昇順の整数リスト取得
def iln_r():
return sorted(iln(), reverse=True) # 降順の整数リスト取得
def fln():
return list(map(float, input().split())) # 浮動小数点リスト取得
def join(l, s=""):
return s.join(l) # リストを文字列に変換
def perm(l, n):
return itertools.permutations(l, n) # 順列取得
def perm_count(n, r):
return math.factorial(n) // math.factorial(n - r) # 順列の総数
def comb(l, n):
return itertools.combinations(l, n) # 組み合わせ取得
def comb_count(n, r):
return math.factorial(n) // (math.factorial(n - r) * math.factorial(r)) # 組み合わせの総数
def two_distance(a, b, c, d):
return ((c - a) ** 2 + (d - b) ** 2) ** 0.5 # 2点間の距離
def add_mod(a, b):
return (a + b) % MOD
N = iin()
p = fln()
dp = [[0 for _ in range(N + 1)] for _ in range(N + 1)]
dp[0][0] = 1
for i in range(N):
for j in range(i + 1):
dp[i + 1][j] += dp[i][j] * (1 - p[i])
dp[i + 1][j + 1] += dp[i][j] * p[i]
ans = 0.0
for i in range(N // 2 + 1, N + 1):
ans += dp[N][i]
print(ans)
| false | 4.347826 | [
"+MOD = 10**9 + 7",
"-MOD = 10**9 + 7",
"+def add_mod(a, b):",
"+ return (a + b) % MOD",
"+",
"+",
"- for j in range(N):",
"+ for j in range(i + 1):",
"+ dp[i + 1][j] += dp[i][j] * (1 - p[i])",
"- dp[i + 1][j] += dp[i][j] * (1 - p[i])"
] | false | 0.126789 | 0.06213 | 2.040706 | [
"s540681375",
"s866188608"
] |
u176463385 | p03493 | python | s463614496 | s755985017 | 19 | 17 | 3,060 | 2,940 | Accepted | Accepted | 10.53 | s = eval(input())
s1 = s[0]
s2 = s[1]
s3 = s[2]
n = 0
if s1 == '1':
n = n + 1
if s2 == '1':
n = n + 1
if s3 == '1':
n = n + 1
print (n) | s = eval(input())
n = 0
if s[0] == '1':
n = n + 1
if s[1] == '1':
n = n + 1
if s[2] == '1':
n = n + 1
print (n) | 12 | 9 | 146 | 119 | s = eval(input())
s1 = s[0]
s2 = s[1]
s3 = s[2]
n = 0
if s1 == "1":
n = n + 1
if s2 == "1":
n = n + 1
if s3 == "1":
n = n + 1
print(n)
| s = eval(input())
n = 0
if s[0] == "1":
n = n + 1
if s[1] == "1":
n = n + 1
if s[2] == "1":
n = n + 1
print(n)
| false | 25 | [
"-s1 = s[0]",
"-s2 = s[1]",
"-s3 = s[2]",
"-if s1 == \"1\":",
"+if s[0] == \"1\":",
"-if s2 == \"1\":",
"+if s[1] == \"1\":",
"-if s3 == \"1\":",
"+if s[2] == \"1\":"
] | false | 0.080911 | 0.081409 | 0.993882 | [
"s463614496",
"s755985017"
] |
u992875223 | p03338 | python | s488921006 | s259374293 | 22 | 18 | 3,060 | 3,064 | Accepted | Accepted | 18.18 | def f(s, t):
res = 0
for i in set(s):
for j in set(t):
if i == j:
res += 1
return res
N = int(eval(input()))
S = eval(input())
ans = 0
for i in range(N):
ans = max(ans, f(S[:i], S[i:]))
print(ans) | def f(s, t):
return len(set(s) & set(t))
N = int(eval(input()))
S = eval(input())
ans = 0
for i in range(N):
ans = max(ans, f(S[:i], S[i:]))
print(ans) | 14 | 9 | 250 | 156 | def f(s, t):
res = 0
for i in set(s):
for j in set(t):
if i == j:
res += 1
return res
N = int(eval(input()))
S = eval(input())
ans = 0
for i in range(N):
ans = max(ans, f(S[:i], S[i:]))
print(ans)
| def f(s, t):
return len(set(s) & set(t))
N = int(eval(input()))
S = eval(input())
ans = 0
for i in range(N):
ans = max(ans, f(S[:i], S[i:]))
print(ans)
| false | 35.714286 | [
"- res = 0",
"- for i in set(s):",
"- for j in set(t):",
"- if i == j:",
"- res += 1",
"- return res",
"+ return len(set(s) & set(t))"
] | false | 0.045028 | 0.041655 | 1.080977 | [
"s488921006",
"s259374293"
] |
u562935282 | p03576 | python | s285147126 | s468762553 | 289 | 214 | 45,032 | 42,224 | Accepted | Accepted | 25.95 | # 二次元累積和
# 写経
# https://ikatakos.com/pot/programming_algorithm/contest_history/atcoder/2017/1014_abc075
from collections import namedtuple
from operator import attrgetter
Coordinates = namedtuple('Coordinates', ('ind', 'x', 'y'))
n, k = list(map(int, input().split()))
e = []
for ind in range(n):
x, y = list(map(int, input().split()))
e.append(Coordinates(ind=ind, x=x, y=y))
x_asc = sorted(e, key=attrgetter('x')) # x昇順
y_asc = sorted(e, key=attrgetter('y')) # y昇順
# print(x_asc)
# print(y_asc)
tbl = [[0] * (n + 1) for _ in range(n + 1)]
for yi, py in enumerate(y_asc, 1):
for xi, px in enumerate(x_asc, 1):
tbl[xi][yi] = tbl[xi - 1][yi] + tbl[xi][yi - 1] - tbl[xi - 1][yi - 1] + (1 if py == px else 0)
ans = float('inf')
for left in range(1, n - (k - 1) + 1):
for top in range(1, n - (k - 1) + 1):
for right in range(left + k - 1, n + 1):
for bottom in range(top + k - 1, n + 1):
if tbl[right][bottom] - tbl[left - 1][bottom] - tbl[right][top - 1] + tbl[left - 1][top - 1] >= k:
ans = min(ans, (y_asc[bottom - 1].y - y_asc[top - 1].y) * (x_asc[right - 1].x - x_asc[left - 1].x))
print(ans)
| # 二次元累積和
# 写経
# https://ikatakos.com/pot/programming_algorithm/contest_history/atcoder/2017/1014_abc075
def solve():
from collections import namedtuple
from operator import attrgetter
import sys
input = sys.stdin.readline
Coordinates = namedtuple('Coordinates', ('x', 'y'))
n, k = list(map(int, input().split()))
e = []
for _ in range(n):
x, y = list(map(int, input().split()))
e.append(Coordinates(x=x, y=y))
x_asc = tuple(sorted(e, key=attrgetter('x'))) # x昇順
y_asc = tuple(sorted(e, key=attrgetter('y'))) # y昇順
# print(x_asc)
# print(y_asc)
tbl = tuple([0] * (n + 1) for _ in range(n + 1))
for yi, py in enumerate(y_asc, 1):
for xi, px in enumerate(x_asc, 1):
tbl[xi][yi] = tbl[xi - 1][yi] + tbl[xi][yi - 1] - tbl[xi - 1][yi - 1] + (1 if py == px else 0)
ans = float('inf')
for left in range(1, n - (k - 1) + 1):
for top in range(1, n - (k - 1) + 1):
for right in range(left + k - 1, n + 1):
for bottom in range(top + k - 1, n + 1):
if tbl[right][bottom] - tbl[left - 1][bottom] - tbl[right][top - 1] + tbl[left - 1][top - 1] >= k:
ans = min(ans,
(y_asc[bottom - 1].y - y_asc[top - 1].y) * (x_asc[right - 1].x - x_asc[left - 1].x))
print(ans)
if __name__ == '__main__':
solve()
| 35 | 44 | 1,206 | 1,447 | # 二次元累積和
# 写経
# https://ikatakos.com/pot/programming_algorithm/contest_history/atcoder/2017/1014_abc075
from collections import namedtuple
from operator import attrgetter
Coordinates = namedtuple("Coordinates", ("ind", "x", "y"))
n, k = list(map(int, input().split()))
e = []
for ind in range(n):
x, y = list(map(int, input().split()))
e.append(Coordinates(ind=ind, x=x, y=y))
x_asc = sorted(e, key=attrgetter("x")) # x昇順
y_asc = sorted(e, key=attrgetter("y")) # y昇順
# print(x_asc)
# print(y_asc)
tbl = [[0] * (n + 1) for _ in range(n + 1)]
for yi, py in enumerate(y_asc, 1):
for xi, px in enumerate(x_asc, 1):
tbl[xi][yi] = (
tbl[xi - 1][yi]
+ tbl[xi][yi - 1]
- tbl[xi - 1][yi - 1]
+ (1 if py == px else 0)
)
ans = float("inf")
for left in range(1, n - (k - 1) + 1):
for top in range(1, n - (k - 1) + 1):
for right in range(left + k - 1, n + 1):
for bottom in range(top + k - 1, n + 1):
if (
tbl[right][bottom]
- tbl[left - 1][bottom]
- tbl[right][top - 1]
+ tbl[left - 1][top - 1]
>= k
):
ans = min(
ans,
(y_asc[bottom - 1].y - y_asc[top - 1].y)
* (x_asc[right - 1].x - x_asc[left - 1].x),
)
print(ans)
| # 二次元累積和
# 写経
# https://ikatakos.com/pot/programming_algorithm/contest_history/atcoder/2017/1014_abc075
def solve():
from collections import namedtuple
from operator import attrgetter
import sys
input = sys.stdin.readline
Coordinates = namedtuple("Coordinates", ("x", "y"))
n, k = list(map(int, input().split()))
e = []
for _ in range(n):
x, y = list(map(int, input().split()))
e.append(Coordinates(x=x, y=y))
x_asc = tuple(sorted(e, key=attrgetter("x"))) # x昇順
y_asc = tuple(sorted(e, key=attrgetter("y"))) # y昇順
# print(x_asc)
# print(y_asc)
tbl = tuple([0] * (n + 1) for _ in range(n + 1))
for yi, py in enumerate(y_asc, 1):
for xi, px in enumerate(x_asc, 1):
tbl[xi][yi] = (
tbl[xi - 1][yi]
+ tbl[xi][yi - 1]
- tbl[xi - 1][yi - 1]
+ (1 if py == px else 0)
)
ans = float("inf")
for left in range(1, n - (k - 1) + 1):
for top in range(1, n - (k - 1) + 1):
for right in range(left + k - 1, n + 1):
for bottom in range(top + k - 1, n + 1):
if (
tbl[right][bottom]
- tbl[left - 1][bottom]
- tbl[right][top - 1]
+ tbl[left - 1][top - 1]
>= k
):
ans = min(
ans,
(y_asc[bottom - 1].y - y_asc[top - 1].y)
* (x_asc[right - 1].x - x_asc[left - 1].x),
)
print(ans)
if __name__ == "__main__":
solve()
| false | 20.454545 | [
"-from collections import namedtuple",
"-from operator import attrgetter",
"+def solve():",
"+ from collections import namedtuple",
"+ from operator import attrgetter",
"+ import sys",
"-Coordinates = namedtuple(\"Coordinates\", (\"ind\", \"x\", \"y\"))",
"-n, k = list(map(int, input().split(... | false | 0.053341 | 0.035701 | 1.494099 | [
"s285147126",
"s468762553"
] |
u644778646 | p02937 | python | s731751275 | s127708034 | 256 | 233 | 8,996 | 9,300 | Accepted | Accepted | 8.98 | import bisect
s = list(eval(input()))
t = list(eval(input()))
ds = {} # ｓに含まれる文字それぞれの数
dsl = {} # ｓの文字の位置
for i in range(len(s)):
if s[i] not in list(ds.keys()):
ds[s[i]] = 0
dsl[s[i]] = []
ds[s[i]] += 1
dsl[s[i]].append(i)
for i in range(len(t)):
if t[i] not in list(ds.keys()):
ds[t[i]] = 0
#print(ds, dsl)
ans = 0
now = -1#ここが-1じゃないと、最初の遷移でsの最初の文字を使えない
for i in range(len(t)):
if ds[t[i]] == 0: # ｓにｔを構成する文字がない場合
print("-1")
exit()
elif ds[t[i]] == 1:
if dsl[t[i]][0] > now: # ｔの次の文字が現在地より右にある場合
ans += (dsl[t[i]][0] - now)
else: # ｔの次の文字が現在地より左にある場合
ans += dsl[t[i]][0] + (len(s) - now)
now = dsl[t[i]][0]
else:
index = bisect.bisect_right(dsl[t[i]], now)
if index == len(dsl[t[i]]):
index = -1
if dsl[t[i]][index] > now: # ｔの次の文字が現在地より右にある場合
ans += (dsl[t[i]][index] - now)
now = dsl[t[i]][index]
else: # ｔの次の文字が現在地より左にある場合
ans += dsl[t[i]][0] + (len(s) - now)
now = dsl[t[i]][0]
print(ans)
| import bisect
s = list(eval(input()))
t = list(eval(input()))
from collections import defaultdict
ds = defaultdict(int) # ｓに含まれる文字それぞれの数
dsl = defaultdict(list) # ｓの文字の位置
for i in range(len(s)):
ds[s[i]] += 1
dsl[s[i]].append(i)
ans = 0
now = -1#ここが-1じゃないと、最初の遷移でsの最初の文字を使えない
for i in range(len(t)):
if ds[t[i]] == 0: # ｓにｔを構成する文字がない場合
print("-1")
exit()
elif ds[t[i]] == 1:
if dsl[t[i]][0] > now: # ｔの次の文字が現在地より右にある場合
ans += (dsl[t[i]][0] - now)
else: # ｔの次の文字が現在地より左にある場合
ans += dsl[t[i]][0] + (len(s) - now)
now = dsl[t[i]][0]
else:
index = bisect.bisect_right(dsl[t[i]], now)
if index == len(dsl[t[i]]):
index = -1
if dsl[t[i]][index] > now: # ｔの次の文字が現在地より右にある場合
ans += (dsl[t[i]][index] - now)
now = dsl[t[i]][index]
else: # ｔの次の文字が現在地より左にある場合
ans += dsl[t[i]][0] + (len(s) - now)
now = dsl[t[i]][0]
print(ans)
| 43 | 35 | 1,134 | 1,024 | import bisect
s = list(eval(input()))
t = list(eval(input()))
ds = {} # ｓに含まれる文字それぞれの数
dsl = {} # ｓの文字の位置
for i in range(len(s)):
if s[i] not in list(ds.keys()):
ds[s[i]] = 0
dsl[s[i]] = []
ds[s[i]] += 1
dsl[s[i]].append(i)
for i in range(len(t)):
if t[i] not in list(ds.keys()):
ds[t[i]] = 0
# print(ds, dsl)
ans = 0
now = -1 # ここが-1じゃないと、最初の遷移でsの最初の文字を使えない
for i in range(len(t)):
if ds[t[i]] == 0: # ｓにｔを構成する文字がない場合
print("-1")
exit()
elif ds[t[i]] == 1:
if dsl[t[i]][0] > now: # ｔの次の文字が現在地より右にある場合
ans += dsl[t[i]][0] - now
else: # ｔの次の文字が現在地より左にある場合
ans += dsl[t[i]][0] + (len(s) - now)
now = dsl[t[i]][0]
else:
index = bisect.bisect_right(dsl[t[i]], now)
if index == len(dsl[t[i]]):
index = -1
if dsl[t[i]][index] > now: # ｔの次の文字が現在地より右にある場合
ans += dsl[t[i]][index] - now
now = dsl[t[i]][index]
else: # ｔの次の文字が現在地より左にある場合
ans += dsl[t[i]][0] + (len(s) - now)
now = dsl[t[i]][0]
print(ans)
| import bisect
s = list(eval(input()))
t = list(eval(input()))
from collections import defaultdict
ds = defaultdict(int) # ｓに含まれる文字それぞれの数
dsl = defaultdict(list) # ｓの文字の位置
for i in range(len(s)):
ds[s[i]] += 1
dsl[s[i]].append(i)
ans = 0
now = -1 # ここが-1じゃないと、最初の遷移でsの最初の文字を使えない
for i in range(len(t)):
if ds[t[i]] == 0: # ｓにｔを構成する文字がない場合
print("-1")
exit()
elif ds[t[i]] == 1:
if dsl[t[i]][0] > now: # ｔの次の文字が現在地より右にある場合
ans += dsl[t[i]][0] - now
else: # ｔの次の文字が現在地より左にある場合
ans += dsl[t[i]][0] + (len(s) - now)
now = dsl[t[i]][0]
else:
index = bisect.bisect_right(dsl[t[i]], now)
if index == len(dsl[t[i]]):
index = -1
if dsl[t[i]][index] > now: # ｔの次の文字が現在地より右にある場合
ans += dsl[t[i]][index] - now
now = dsl[t[i]][index]
else: # ｔの次の文字が現在地より左にある場合
ans += dsl[t[i]][0] + (len(s) - now)
now = dsl[t[i]][0]
print(ans)
| false | 18.604651 | [
"-ds = {} # ｓに含まれる文字それぞれの数",
"-dsl = {} # ｓの文字の位置",
"+from collections import defaultdict",
"+",
"+ds = defaultdict(int) # ｓに含まれる文字それぞれの数",
"+dsl = defaultdict(list) # ｓの文字の位置",
"- if s[i] not in list(ds.keys()):",
"- ds[s[i]] = 0",
"- dsl[s[i]] = []",
"-for i in range(len(t))... | false | 0.038745 | 0.043934 | 0.881892 | [
"s731751275",
"s127708034"
] |
u397384480 | p02695 | python | s249688256 | s245004924 | 496 | 145 | 126,556 | 84,944 | Accepted | Accepted | 70.77 | N,M,Q = list(map(int,(input().split())))
a = [0]*Q
b = [0]*Q
c = [0]*Q
d = [0]*Q
for i in range(Q):
a[i],b[i],c[i],d[i] = list(map(int,(input().split())))
lun = [0]*N
l = []
def make(n):
if len(n) > N:
return 0
if int(n) > 3234566667:
return 0
else:
p = []
for i in range(int(n[-1]),M):
p.append(str(i))
lun.append(n)
for i in p:
lun.append(n)
if len(n) == N:
l.append(n)
make(n+i)
return 0
for i in range(M):
make(str(i))
l = list(set(l))
nax = 0
for x in l:
score = 0
for i in range(Q):
if int(x[b[i]-1]) - int(x[a[i]-1]) == c[i]:
score += d[i]
nax = max(nax,score)
print(nax) | import itertools
N,M,Q = list(map(int,(input().split())))
a = [0]*Q
b = [0]*Q
c = [0]*Q
d = [0]*Q
for i in range(Q):
a[i],b[i],c[i],d[i] = list(map(int,(input().split())))
l = list(itertools.combinations_with_replacement(list(range(1,M+1)), N))
nax = 0
for x in l:
score = 0
for i in range(Q):
if int(x[b[i]-1]) - int(x[a[i]-1]) == c[i]:
score += d[i]
nax = max(nax,score)
print(nax) | 43 | 21 | 787 | 425 | N, M, Q = list(map(int, (input().split())))
a = [0] * Q
b = [0] * Q
c = [0] * Q
d = [0] * Q
for i in range(Q):
a[i], b[i], c[i], d[i] = list(map(int, (input().split())))
lun = [0] * N
l = []
def make(n):
if len(n) > N:
return 0
if int(n) > 3234566667:
return 0
else:
p = []
for i in range(int(n[-1]), M):
p.append(str(i))
lun.append(n)
for i in p:
lun.append(n)
if len(n) == N:
l.append(n)
make(n + i)
return 0
for i in range(M):
make(str(i))
l = list(set(l))
nax = 0
for x in l:
score = 0
for i in range(Q):
if int(x[b[i] - 1]) - int(x[a[i] - 1]) == c[i]:
score += d[i]
nax = max(nax, score)
print(nax)
| import itertools
N, M, Q = list(map(int, (input().split())))
a = [0] * Q
b = [0] * Q
c = [0] * Q
d = [0] * Q
for i in range(Q):
a[i], b[i], c[i], d[i] = list(map(int, (input().split())))
l = list(itertools.combinations_with_replacement(list(range(1, M + 1)), N))
nax = 0
for x in l:
score = 0
for i in range(Q):
if int(x[b[i] - 1]) - int(x[a[i] - 1]) == c[i]:
score += d[i]
nax = max(nax, score)
print(nax)
| false | 51.162791 | [
"+import itertools",
"+",
"-lun = [0] * N",
"-l = []",
"-",
"-",
"-def make(n):",
"- if len(n) > N:",
"- return 0",
"- if int(n) > 3234566667:",
"- return 0",
"- else:",
"- p = []",
"- for i in range(int(n[-1]), M):",
"- p.append(str(i))",
... | false | 0.165287 | 0.079213 | 2.086611 | [
"s249688256",
"s245004924"
] |
u600402037 | p03055 | python | s124503619 | s040732351 | 1,510 | 1,327 | 89,856 | 69,320 | Accepted | Accepted | 12.12 | # coding: utf-8
import sys
from heapq import heapify, heappop, heappush
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
def dijkstra(start):
INF = 10 ** 15
dist = [INF] * (N+1)
dist[start] = 0
que = [(0, start)]
while que:
d, prev = heappop(que)
if dist[prev] < d:
continue
for next in graph[prev]:
d1 = d + 1
if dist[next] > d1:
dist[next] = d1
heappush(que, (d1, next))
return dist
N = ir()
graph = [[] for _ in range(N+1)] # 1-indexed
for _ in range(N-1):
a, b = lr()
graph[a].append(b)
graph[b].append(a)
# １を根とする
dist = dijkstra(1)
dist = sorted([(x, i) for i, x in enumerate(dist)], reverse=True)
new_root = dist[1][1]
dist = dijkstra(new_root)
diameter = max(dist[1:]) + 1
bl = diameter % 3 != 2
print(('First' if bl else 'Second'))
# 22 | # coding: utf-8
import sys
from heapq import heapify, heappop, heappush
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
def tree_diameter(graph): # 木の直径
def dijkstra(start):
INF = 10 ** 15
dist = [INF] * (N+1)
dist[start] = 0
que = [(0, start)]
length = 0; far = 0
while que:
d, prev = heappop(que)
if dist[prev] < d:
continue
for next in graph[prev]:
d1 = d + 1
if dist[next] > d1:
dist[next] = d1
if d1 > length:
length = d1; far = next
heappush(que, (d1, next))
return length, far
_, f = dijkstra(1)
l, f = dijkstra(f)
return l
N = ir()
graph = [[] for _ in range(N+1)] # 1-indexed
for _ in range(N-1):
a, b = lr()
graph[a].append(b)
graph[b].append(a)
daiameter = tree_diameter(graph)
bl = daiameter % 3 != 1
print(('First' if bl else 'Second'))
| 40 | 41 | 973 | 1,104 | # coding: utf-8
import sys
from heapq import heapify, heappop, heappush
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
def dijkstra(start):
INF = 10**15
dist = [INF] * (N + 1)
dist[start] = 0
que = [(0, start)]
while que:
d, prev = heappop(que)
if dist[prev] < d:
continue
for next in graph[prev]:
d1 = d + 1
if dist[next] > d1:
dist[next] = d1
heappush(que, (d1, next))
return dist
N = ir()
graph = [[] for _ in range(N + 1)] # 1-indexed
for _ in range(N - 1):
a, b = lr()
graph[a].append(b)
graph[b].append(a)
# １を根とする
dist = dijkstra(1)
dist = sorted([(x, i) for i, x in enumerate(dist)], reverse=True)
new_root = dist[1][1]
dist = dijkstra(new_root)
diameter = max(dist[1:]) + 1
bl = diameter % 3 != 2
print(("First" if bl else "Second"))
# 22
| # coding: utf-8
import sys
from heapq import heapify, heappop, heappush
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
def tree_diameter(graph): # 木の直径
def dijkstra(start):
INF = 10**15
dist = [INF] * (N + 1)
dist[start] = 0
que = [(0, start)]
length = 0
far = 0
while que:
d, prev = heappop(que)
if dist[prev] < d:
continue
for next in graph[prev]:
d1 = d + 1
if dist[next] > d1:
dist[next] = d1
if d1 > length:
length = d1
far = next
heappush(que, (d1, next))
return length, far
_, f = dijkstra(1)
l, f = dijkstra(f)
return l
N = ir()
graph = [[] for _ in range(N + 1)] # 1-indexed
for _ in range(N - 1):
a, b = lr()
graph[a].append(b)
graph[b].append(a)
daiameter = tree_diameter(graph)
bl = daiameter % 3 != 1
print(("First" if bl else "Second"))
| false | 2.439024 | [
"-def dijkstra(start):",
"- INF = 10**15",
"- dist = [INF] * (N + 1)",
"- dist[start] = 0",
"- que = [(0, start)]",
"- while que:",
"- d, prev = heappop(que)",
"- if dist[prev] < d:",
"- continue",
"- for next in graph[prev]:",
"- d1 = d ... | false | 0.123842 | 0.06577 | 1.88295 | [
"s124503619",
"s040732351"
] |
u949338836 | p02412 | python | s111848651 | s284630367 | 3,540 | 110 | 6,724 | 6,720 | Accepted | Accepted | 96.89 | #coding:utf-8
#1_7_B 2015.4.5
while True:
n,x = list(map(int,input().split()))
if n == x == 0:
break
count = 0
for i in range(1 , n + 1):
for j in range(1 , n + 1):
for k in range(1 , n + 1):
if i + j + k == x and i < j < k:
count += 1
print(count) | #coding:utf-8
#1_7_B 2015.4.5
while True:
n,x = list(map(int,input().split()))
if n == x == 0:
break
count = 0
for i in range(1 , n + 1):
for j in range(1 , n + 1):
if (x - i - j) <= n and i < j < (x - i -j):
count += 1
print(count) | 14 | 13 | 344 | 307 | # coding:utf-8
# 1_7_B 2015.4.5
while True:
n, x = list(map(int, input().split()))
if n == x == 0:
break
count = 0
for i in range(1, n + 1):
for j in range(1, n + 1):
for k in range(1, n + 1):
if i + j + k == x and i < j < k:
count += 1
print(count)
| # coding:utf-8
# 1_7_B 2015.4.5
while True:
n, x = list(map(int, input().split()))
if n == x == 0:
break
count = 0
for i in range(1, n + 1):
for j in range(1, n + 1):
if (x - i - j) <= n and i < j < (x - i - j):
count += 1
print(count)
| false | 7.142857 | [
"- for k in range(1, n + 1):",
"- if i + j + k == x and i < j < k:",
"- count += 1",
"+ if (x - i - j) <= n and i < j < (x - i - j):",
"+ count += 1"
] | false | 0.068133 | 0.03979 | 1.712292 | [
"s111848651",
"s284630367"
] |
u175426149 | p03309 | python | s106991515 | s660076350 | 271 | 211 | 27,232 | 27,224 | Accepted | Accepted | 22.14 | from statistics import median
N = int(eval(input()))
A = list(map(int, input().split()))
A_star = [a - (i + 1) for i, a in enumerate(A)]
def calc_score(b):
score = 0
for a in A_star:
score += abs(a - b)
return score
def decide_direction(b):
score0 = calc_score(b)
score1 = calc_score(b + 1)
if score0 > score1:
return 1
else:
return -1
b = int(median(A_star))
direction = decide_direction(b)
pre_score = calc_score(b)
while True:
b += direction
score = calc_score(b)
if score >= pre_score:
print(pre_score)
break
else:
pre_score = score
| from statistics import median
N = int(eval(input()))
A = list(map(int, input().split()))
A_star = [a - (i + 1) for i, a in enumerate(A)]
def calc_score(b):
score = 0
for a in A_star:
score += abs(a - b)
return score
print((calc_score(int(median(A_star))))) | 37 | 14 | 669 | 285 | from statistics import median
N = int(eval(input()))
A = list(map(int, input().split()))
A_star = [a - (i + 1) for i, a in enumerate(A)]
def calc_score(b):
score = 0
for a in A_star:
score += abs(a - b)
return score
def decide_direction(b):
score0 = calc_score(b)
score1 = calc_score(b + 1)
if score0 > score1:
return 1
else:
return -1
b = int(median(A_star))
direction = decide_direction(b)
pre_score = calc_score(b)
while True:
b += direction
score = calc_score(b)
if score >= pre_score:
print(pre_score)
break
else:
pre_score = score
| from statistics import median
N = int(eval(input()))
A = list(map(int, input().split()))
A_star = [a - (i + 1) for i, a in enumerate(A)]
def calc_score(b):
score = 0
for a in A_star:
score += abs(a - b)
return score
print((calc_score(int(median(A_star)))))
| false | 62.162162 | [
"-def decide_direction(b):",
"- score0 = calc_score(b)",
"- score1 = calc_score(b + 1)",
"- if score0 > score1:",
"- return 1",
"- else:",
"- return -1",
"-",
"-",
"-b = int(median(A_star))",
"-direction = decide_direction(b)",
"-pre_score = calc_score(b)",
"-while ... | false | 0.062846 | 0.058852 | 1.067864 | [
"s106991515",
"s660076350"
] |
u094191970 | p02726 | python | s667076994 | s911040400 | 1,454 | 1,200 | 203,448 | 3,444 | Accepted | Accepted | 17.47 | from scipy.sparse import csr_matrix
from scipy.sparse.csgraph import dijkstra
import numpy as np
from collections import Counter
n,x,y=list(map(int,input().split()))
row,col,w=[],[],[]
for i in range(n-1):
row.append(i)
col.append(i+1)
w.append(1)
row.append(x-1)
col.append(y-1)
w.append(1)
g=csr_matrix((w, (row, col)), shape=(n, n))
d=dijkstra(g,directed=False)
l=list(np.ravel(d))
c=Counter(l)
for i in range(1,n):
print((c[i]//2)) | n,x,y=list(map(int,input().split()))
x-=1
y-=1
dist=[0 for i in range(n)]
for i in range(n-1):
for j in range(i+1,n):
dist[min(j-i,abs(x-i)+1+abs(j-y))]+=1
for i in dist[1:]:
print(i) | 26 | 12 | 467 | 199 | from scipy.sparse import csr_matrix
from scipy.sparse.csgraph import dijkstra
import numpy as np
from collections import Counter
n, x, y = list(map(int, input().split()))
row, col, w = [], [], []
for i in range(n - 1):
row.append(i)
col.append(i + 1)
w.append(1)
row.append(x - 1)
col.append(y - 1)
w.append(1)
g = csr_matrix((w, (row, col)), shape=(n, n))
d = dijkstra(g, directed=False)
l = list(np.ravel(d))
c = Counter(l)
for i in range(1, n):
print((c[i] // 2))
| n, x, y = list(map(int, input().split()))
x -= 1
y -= 1
dist = [0 for i in range(n)]
for i in range(n - 1):
for j in range(i + 1, n):
dist[min(j - i, abs(x - i) + 1 + abs(j - y))] += 1
for i in dist[1:]:
print(i)
| false | 53.846154 | [
"-from scipy.sparse import csr_matrix",
"-from scipy.sparse.csgraph import dijkstra",
"-import numpy as np",
"-from collections import Counter",
"-",
"-row, col, w = [], [], []",
"+x -= 1",
"+y -= 1",
"+dist = [0 for i in range(n)]",
"- row.append(i)",
"- col.append(i + 1)",
"- w.appe... | false | 0.528522 | 0.116097 | 4.552403 | [
"s667076994",
"s911040400"
] |
u970197315 | p03805 | python | s271983594 | s023888097 | 40 | 30 | 9,304 | 9,088 | Accepted | Accepted | 25 | n,m=list(map(int,input().split()))
G=[[0]*n for i in range(n)]
for i in range(m):
a,b=list(map(int,input().split()))
G[a-1][b-1]=G[b-1][a-1]=1
from itertools import permutations
ans=0
p=list(permutations([x for x in range(1,n)]))
for pp in p:
ok=True
t=[0]+list(pp)
for i in range(1,n):
if G[t[i-1]][t[i]]==0:
ok=False
if ok:ans+=1
print(ans)
| def dfs(v,visited):
if all(visited):
return 1
res=0
for nv in G[v]:
if visited[nv]:
continue
visited[nv]=1
res+=dfs(nv,visited)
visited[nv]=0
return res
n,m=list(map(int, input().split()))
G=[[] for _ in range(n)]
visited=[0]*n
res=0
for i in range(m):
a,b=list(map(int, input().split()))
G[a-1].append(b-1)
G[b-1].append(a-1)
visited[0]=1
print((dfs(0,visited))) | 17 | 24 | 370 | 417 | n, m = list(map(int, input().split()))
G = [[0] * n for i in range(n)]
for i in range(m):
a, b = list(map(int, input().split()))
G[a - 1][b - 1] = G[b - 1][a - 1] = 1
from itertools import permutations
ans = 0
p = list(permutations([x for x in range(1, n)]))
for pp in p:
ok = True
t = [0] + list(pp)
for i in range(1, n):
if G[t[i - 1]][t[i]] == 0:
ok = False
if ok:
ans += 1
print(ans)
| def dfs(v, visited):
if all(visited):
return 1
res = 0
for nv in G[v]:
if visited[nv]:
continue
visited[nv] = 1
res += dfs(nv, visited)
visited[nv] = 0
return res
n, m = list(map(int, input().split()))
G = [[] for _ in range(n)]
visited = [0] * n
res = 0
for i in range(m):
a, b = list(map(int, input().split()))
G[a - 1].append(b - 1)
G[b - 1].append(a - 1)
visited[0] = 1
print((dfs(0, visited)))
| false | 29.166667 | [
"+def dfs(v, visited):",
"+ if all(visited):",
"+ return 1",
"+ res = 0",
"+ for nv in G[v]:",
"+ if visited[nv]:",
"+ continue",
"+ visited[nv] = 1",
"+ res += dfs(nv, visited)",
"+ visited[nv] = 0",
"+ return res",
"+",
"+",
"-G =... | false | 0.066662 | 0.040959 | 1.627544 | [
"s271983594",
"s023888097"
] |
u546285759 | p00217 | python | s025534766 | s998691533 | 760 | 680 | 8,872 | 14,264 | Accepted | Accepted | 10.53 | while True:
n = int(eval(input()))
if n == 0:
break
patients = []
for _ in range(n):
p, d1, d2 = list(map(int, input().split()))
patients.append((p, d1+d2))
print((*max(patients, key=lambda x: x[1]))) | while True:
n = int(eval(input()))
if n == 0:
break
patients = [list(map(int, input().split())) for _ in range(n)]
patients = [(p, d1+d2) for p, d1, d2 in patients]
print((*max(patients, key=lambda x: x[1]))) | 10 | 8 | 240 | 230 | while True:
n = int(eval(input()))
if n == 0:
break
patients = []
for _ in range(n):
p, d1, d2 = list(map(int, input().split()))
patients.append((p, d1 + d2))
print((*max(patients, key=lambda x: x[1])))
| while True:
n = int(eval(input()))
if n == 0:
break
patients = [list(map(int, input().split())) for _ in range(n)]
patients = [(p, d1 + d2) for p, d1, d2 in patients]
print((*max(patients, key=lambda x: x[1])))
| false | 20 | [
"- patients = []",
"- for _ in range(n):",
"- p, d1, d2 = list(map(int, input().split()))",
"- patients.append((p, d1 + d2))",
"+ patients = [list(map(int, input().split())) for _ in range(n)]",
"+ patients = [(p, d1 + d2) for p, d1, d2 in patients]"
] | false | 0.058725 | 0.056012 | 1.04845 | [
"s025534766",
"s998691533"
] |
u191874006 | p02835 | python | s163299137 | s186318013 | 186 | 71 | 38,384 | 65,552 | Accepted | Accepted | 61.83 | #!/usr/bin/env python3
#ABC147 A
import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(1000000)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7
inf = float('inf')
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
a1,a2,a3 = LI()
if a1+a2+a3 >= 22:
print('bust')
else:
print('win')
| #!/usr/bin/env python3
import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7
inf = float('inf')
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
a = LI()
s = sum(a)
if s >= 22:
print('bust')
else:
print('win') | 27 | 25 | 655 | 637 | #!/usr/bin/env python3
# ABC147 A
import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(1000000)
from heapq import heappush, heappop, heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7
inf = float("inf")
def I():
return int(sys.stdin.readline())
def LI():
return list(map(int, sys.stdin.readline().split()))
a1, a2, a3 = LI()
if a1 + a2 + a3 >= 22:
print("bust")
else:
print("win")
| #!/usr/bin/env python3
import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop, heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7
inf = float("inf")
def I():
return int(sys.stdin.readline())
def LI():
return list(map(int, sys.stdin.readline().split()))
a = LI()
s = sum(a)
if s >= 22:
print("bust")
else:
print("win")
| false | 7.407407 | [
"-# ABC147 A",
"-sys.setrecursionlimit(1000000)",
"+sys.setrecursionlimit(2147483647)",
"-a1, a2, a3 = LI()",
"-if a1 + a2 + a3 >= 22:",
"+a = LI()",
"+s = sum(a)",
"+if s >= 22:"
] | false | 0.045763 | 0.035463 | 1.290442 | [
"s163299137",
"s186318013"
] |
u867826040 | p02880 | python | s682175132 | s919764898 | 171 | 17 | 38,384 | 2,940 | Accepted | Accepted | 90.06 | N = int(eval(input()))
l = []
for i in range(1, 10):
for j in range(1, 10):
l.append(i * j)
if N in l:
print('Yes')
else:
print('No') | x = int(eval(input()))
ans = "No"
for i in range(1,10):
for j in range(1,10):
if i*j==x:
ans = "Yes"
print(ans) | 11 | 7 | 159 | 135 | N = int(eval(input()))
l = []
for i in range(1, 10):
for j in range(1, 10):
l.append(i * j)
if N in l:
print("Yes")
else:
print("No")
| x = int(eval(input()))
ans = "No"
for i in range(1, 10):
for j in range(1, 10):
if i * j == x:
ans = "Yes"
print(ans)
| false | 36.363636 | [
"-N = int(eval(input()))",
"-l = []",
"+x = int(eval(input()))",
"+ans = \"No\"",
"- l.append(i * j)",
"-if N in l:",
"- print(\"Yes\")",
"-else:",
"- print(\"No\")",
"+ if i * j == x:",
"+ ans = \"Yes\"",
"+print(ans)"
] | false | 0.115739 | 0.037755 | 3.065554 | [
"s682175132",
"s919764898"
] |
u514401521 | p02695 | python | s089520830 | s802904342 | 691 | 283 | 9,172 | 76,528 | Accepted | Accepted | 59.04 | import sys
sys.setrecursionlimit(10**9)
N, M, Q = list(map(int, input().split()))
A = []
B = []
C = []
D = []
ans = 0
for i in range(Q):
a, b, c, d = list(map(int, input().split()))
A.append(a)
B.append(b)
C.append(c)
D.append(d)
def dfs(n):
if len(n) == N+1:
global ans
tmp = 0
for i in range(Q):
if n[B[i]] - n[A[i]] == C[i]:
tmp += D[i]
ans = max(ans, tmp)
else:
for i in range(n[-1], M+1):
tmp2 = n[:]
tmp2.append(i)
dfs(tmp2)
dfs([1])
print(ans)
| import sys
sys.setrecursionlimit(10**9)
N, M, Q = list(map(int, input().split()))
l = []
for _ in range(Q):
l.append(list(map(int, input().split())))
ans = 0
def dfs(n):
if len(n) == N+1:
global ans
tmp = 0
for i in range(Q):
abi = n[l[i][1]]
aai = n[l[i][0]]
c = l[i][2]
d = l[i][3]
if abi -aai == c:
tmp += d
ans = max(ans, tmp)
else:
for i in range(n[-1], M+1):
tmp2 = n[:]
tmp2.append(i)
dfs(tmp2)
dfs([1])
print(ans)
| 30 | 26 | 601 | 605 | import sys
sys.setrecursionlimit(10**9)
N, M, Q = list(map(int, input().split()))
A = []
B = []
C = []
D = []
ans = 0
for i in range(Q):
a, b, c, d = list(map(int, input().split()))
A.append(a)
B.append(b)
C.append(c)
D.append(d)
def dfs(n):
if len(n) == N + 1:
global ans
tmp = 0
for i in range(Q):
if n[B[i]] - n[A[i]] == C[i]:
tmp += D[i]
ans = max(ans, tmp)
else:
for i in range(n[-1], M + 1):
tmp2 = n[:]
tmp2.append(i)
dfs(tmp2)
dfs([1])
print(ans)
| import sys
sys.setrecursionlimit(10**9)
N, M, Q = list(map(int, input().split()))
l = []
for _ in range(Q):
l.append(list(map(int, input().split())))
ans = 0
def dfs(n):
if len(n) == N + 1:
global ans
tmp = 0
for i in range(Q):
abi = n[l[i][1]]
aai = n[l[i][0]]
c = l[i][2]
d = l[i][3]
if abi - aai == c:
tmp += d
ans = max(ans, tmp)
else:
for i in range(n[-1], M + 1):
tmp2 = n[:]
tmp2.append(i)
dfs(tmp2)
dfs([1])
print(ans)
| false | 13.333333 | [
"-A = []",
"-B = []",
"-C = []",
"-D = []",
"+l = []",
"+for _ in range(Q):",
"+ l.append(list(map(int, input().split())))",
"-for i in range(Q):",
"- a, b, c, d = list(map(int, input().split()))",
"- A.append(a)",
"- B.append(b)",
"- C.append(c)",
"- D.append(d)",
"- ... | false | 0.083738 | 0.061227 | 1.36767 | [
"s089520830",
"s802904342"
] |
u059210959 | p02615 | python | s472614190 | s137626188 | 159 | 145 | 35,084 | 31,416 | Accepted | Accepted | 8.81 | #!/usr/bin/env python3
# encoding:utf-8
import copy
import random
import bisect #bisect_left これで二部探索の大小検索が行える
import fractions #最小公倍数などはこっち
import math
import sys
import collections
from decimal import Decimal # 10進数で考慮できる
mod = 10**9+7
sys.setrecursionlimit(mod) # 再帰回数上限はでdefault1000
d = collections.deque()
def LI(): return list(map(int, sys.stdin.readline().split()))
N = int(eval(input()))
A = LI()
A.sort(reverse=1)
ans = 0
ans += A[0]
tmp = 1
for i in range(1, N - 1):
ans += A[tmp]
if i % 2 == 0:
tmp += 1
print(ans) | N = int(eval(input()))
A = list(map(int, input().split()))
A.sort(reverse=True)
ans = 0
ans += A[0]
tmp = 1
for i in range(1, N - 1):
ans += A[tmp]
if i % 2 == 0:
tmp += 1
print(ans) | 30 | 13 | 568 | 206 | #!/usr/bin/env python3
# encoding:utf-8
import copy
import random
import bisect # bisect_left これで二部探索の大小検索が行える
import fractions # 最小公倍数などはこっち
import math
import sys
import collections
from decimal import Decimal # 10進数で考慮できる
mod = 10**9 + 7
sys.setrecursionlimit(mod) # 再帰回数上限はでdefault1000
d = collections.deque()
def LI():
return list(map(int, sys.stdin.readline().split()))
N = int(eval(input()))
A = LI()
A.sort(reverse=1)
ans = 0
ans += A[0]
tmp = 1
for i in range(1, N - 1):
ans += A[tmp]
if i % 2 == 0:
tmp += 1
print(ans)
| N = int(eval(input()))
A = list(map(int, input().split()))
A.sort(reverse=True)
ans = 0
ans += A[0]
tmp = 1
for i in range(1, N - 1):
ans += A[tmp]
if i % 2 == 0:
tmp += 1
print(ans)
| false | 56.666667 | [
"-#!/usr/bin/env python3",
"-# encoding:utf-8",
"-import copy",
"-import random",
"-import bisect # bisect_left これで二部探索の大小検索が行える",
"-import fractions # 最小公倍数などはこっち",
"-import math",
"-import sys",
"-import collections",
"-from decimal import Decimal # 10進数で考慮できる",
"-",
"-mod = 10**9 + 7",
... | false | 0.049283 | 0.037101 | 1.328347 | [
"s472614190",
"s137626188"
] |
u761320129 | p03476 | python | s440763740 | s675194173 | 861 | 457 | 9,816 | 21,012 | Accepted | Accepted | 46.92 | MAXN = 10**5+10
sieve = [0,0] + [1]*MAXN
m = 2
while m*m <= MAXN:
if sieve[m]:
for n in range(2*m,MAXN,m):
sieve[n] = 0
m += 1
ok = [0]*MAXN
cums = [0]
for n in range(MAXN):
if sieve[n] and sieve[(n+1)//2]:
ok[n] = 1
cums.append(cums[-1] + ok[n])
Q = int(eval(input()))
for i in range(Q):
l,r = list(map(int,input().split()))
print((cums[r+1] - cums[l]))
| Q = int(eval(input()))
qs = [tuple(map(int,input().split())) for i in range(Q)]
MAXN = 10**5+10
sieve = [0,0] + [1]*MAXN
p = 2
while p*p <= MAXN:
if sieve[p]:
for q in range(2*p,MAXN+1,p):
sieve[q] = 0
p += 1
cums = [0]
for i in range(1,MAXN):
valid = sieve[i] and sieve[(i+1)//2]
cums.append(cums[-1] + int(valid))
for l,r in qs:
ans = cums[r] - cums[l-1]
print(ans) | 20 | 20 | 414 | 427 | MAXN = 10**5 + 10
sieve = [0, 0] + [1] * MAXN
m = 2
while m * m <= MAXN:
if sieve[m]:
for n in range(2 * m, MAXN, m):
sieve[n] = 0
m += 1
ok = [0] * MAXN
cums = [0]
for n in range(MAXN):
if sieve[n] and sieve[(n + 1) // 2]:
ok[n] = 1
cums.append(cums[-1] + ok[n])
Q = int(eval(input()))
for i in range(Q):
l, r = list(map(int, input().split()))
print((cums[r + 1] - cums[l]))
| Q = int(eval(input()))
qs = [tuple(map(int, input().split())) for i in range(Q)]
MAXN = 10**5 + 10
sieve = [0, 0] + [1] * MAXN
p = 2
while p * p <= MAXN:
if sieve[p]:
for q in range(2 * p, MAXN + 1, p):
sieve[q] = 0
p += 1
cums = [0]
for i in range(1, MAXN):
valid = sieve[i] and sieve[(i + 1) // 2]
cums.append(cums[-1] + int(valid))
for l, r in qs:
ans = cums[r] - cums[l - 1]
print(ans)
| false | 0 | [
"+Q = int(eval(input()))",
"+qs = [tuple(map(int, input().split())) for i in range(Q)]",
"-m = 2",
"-while m * m <= MAXN:",
"- if sieve[m]:",
"- for n in range(2 * m, MAXN, m):",
"- sieve[n] = 0",
"- m += 1",
"-ok = [0] * MAXN",
"+p = 2",
"+while p * p <= MAXN:",
"+ ... | false | 0.08942 | 0.142317 | 0.628317 | [
"s440763740",
"s675194173"
] |
u433380437 | p02579 | python | s448555342 | s807183565 | 919 | 821 | 179,540 | 178,636 | Accepted | Accepted | 10.66 | # ABC176 D Wizard
# 地図系。ワープ有 01BFS??
from collections import deque
H,W = list(map(int,input().split()))
sx,sy = list(map(int,input().split()))
gx,gy = list(map(int,input().split()))
sx,sy,gx,gy = sx-1,sy-1,gx-1,gy-1
C=[list(eval(input())) for i in range(H)]
inf = float("inf")
for i in range(H):
for j in range(W):
if C[i][j] == ".":
C[i][j] =0
else:
C[i][j]=1
d0=[[1,0],[0,1],[-1,0],[0,-1]]
d1=[[-2,-2],[-2,-1],[-2,0],[-2,1],[-2,2],[-1,-2],[-1,-1],[-1,1],[-1,2],\
[0,-2],[0,2],[1,-2],[1,-1],[1,1],[1,2],[2,-2],[2,-1],[2,0],[2,1],[2,2]]
dist = [[inf]*W for i in range(H)]
dist[sx][sy]=0
que=deque([[0,sx,sy]])
while que:
L,x,y = que.popleft()
for dx,dy in d0:
nx,ny=x+dx,y+dy
if 0<=nx<H and 0<=ny<W and L+C[nx][ny] < dist[nx][ny] and C[nx][ny]==0:
dist[nx][ny] = L+C[nx][ny]
que.appendleft([L,nx,ny])
for dx,dy in d1:
nx,ny=x+dx,y+dy
if 0<=nx<H and 0<=ny<W and L+C[nx][ny]+1 < dist[nx][ny] and C[nx][ny]==0:
dist[nx][ny] = L+C[nx][ny]+1
que.append([L+1,nx,ny])
ans=dist[gx][gy]
if ans==inf:print((-1))
else: print(ans) | # ABC176 D Wizard
# 地図系。ワープ有 01BFS??
from collections import deque
H,W = list(map(int,input().split()))
sx,sy = list(map(int,input().split()))
gx,gy = list(map(int,input().split()))
sx,sy,gx,gy = sx-1,sy-1,gx-1,gy-1
C=[list(eval(input())) for i in range(H)]
inf = float("inf")
for i in range(H):
for j in range(W):
if C[i][j] == ".":
C[i][j] =0
else:
C[i][j]=1
d0=[[1,0],[0,1],[-1,0],[0,-1]]
d1=[[-2,-2],[-2,-1],[-2,0],[-2,1],[-2,2],[-1,-2],[-1,-1],[-1,1],[-1,2],\
[0,-2],[0,2],[1,-2],[1,-1],[1,1],[1,2],[2,-2],[2,-1],[2,0],[2,1],[2,2]]
dist = [[inf]*W for i in range(H)]
dist[sx][sy]=0
que=deque([[0,sx,sy]])
while que:
L,x,y = que.popleft()
for dx,dy in d0:
nx,ny=x+dx,y+dy
if 0<=nx<H and 0<=ny<W and L < dist[nx][ny] and C[nx][ny]==0:
dist[nx][ny] = L
que.appendleft([L,nx,ny])
for dx,dy in d1:
nx,ny=x+dx,y+dy
if 0<=nx<H and 0<=ny<W and L+1 < dist[nx][ny] and C[nx][ny]==0:
dist[nx][ny] = L+1
que.append([L+1,nx,ny])
ans=dist[gx][gy]
if ans==inf:print((-1))
else: print(ans) | 43 | 43 | 1,193 | 1,153 | # ABC176 D Wizard
# 地図系。ワープ有 01BFS??
from collections import deque
H, W = list(map(int, input().split()))
sx, sy = list(map(int, input().split()))
gx, gy = list(map(int, input().split()))
sx, sy, gx, gy = sx - 1, sy - 1, gx - 1, gy - 1
C = [list(eval(input())) for i in range(H)]
inf = float("inf")
for i in range(H):
for j in range(W):
if C[i][j] == ".":
C[i][j] = 0
else:
C[i][j] = 1
d0 = [[1, 0], [0, 1], [-1, 0], [0, -1]]
d1 = [
[-2, -2],
[-2, -1],
[-2, 0],
[-2, 1],
[-2, 2],
[-1, -2],
[-1, -1],
[-1, 1],
[-1, 2],
[0, -2],
[0, 2],
[1, -2],
[1, -1],
[1, 1],
[1, 2],
[2, -2],
[2, -1],
[2, 0],
[2, 1],
[2, 2],
]
dist = [[inf] * W for i in range(H)]
dist[sx][sy] = 0
que = deque([[0, sx, sy]])
while que:
L, x, y = que.popleft()
for dx, dy in d0:
nx, ny = x + dx, y + dy
if (
0 <= nx < H
and 0 <= ny < W
and L + C[nx][ny] < dist[nx][ny]
and C[nx][ny] == 0
):
dist[nx][ny] = L + C[nx][ny]
que.appendleft([L, nx, ny])
for dx, dy in d1:
nx, ny = x + dx, y + dy
if (
0 <= nx < H
and 0 <= ny < W
and L + C[nx][ny] + 1 < dist[nx][ny]
and C[nx][ny] == 0
):
dist[nx][ny] = L + C[nx][ny] + 1
que.append([L + 1, nx, ny])
ans = dist[gx][gy]
if ans == inf:
print((-1))
else:
print(ans)
| # ABC176 D Wizard
# 地図系。ワープ有 01BFS??
from collections import deque
H, W = list(map(int, input().split()))
sx, sy = list(map(int, input().split()))
gx, gy = list(map(int, input().split()))
sx, sy, gx, gy = sx - 1, sy - 1, gx - 1, gy - 1
C = [list(eval(input())) for i in range(H)]
inf = float("inf")
for i in range(H):
for j in range(W):
if C[i][j] == ".":
C[i][j] = 0
else:
C[i][j] = 1
d0 = [[1, 0], [0, 1], [-1, 0], [0, -1]]
d1 = [
[-2, -2],
[-2, -1],
[-2, 0],
[-2, 1],
[-2, 2],
[-1, -2],
[-1, -1],
[-1, 1],
[-1, 2],
[0, -2],
[0, 2],
[1, -2],
[1, -1],
[1, 1],
[1, 2],
[2, -2],
[2, -1],
[2, 0],
[2, 1],
[2, 2],
]
dist = [[inf] * W for i in range(H)]
dist[sx][sy] = 0
que = deque([[0, sx, sy]])
while que:
L, x, y = que.popleft()
for dx, dy in d0:
nx, ny = x + dx, y + dy
if 0 <= nx < H and 0 <= ny < W and L < dist[nx][ny] and C[nx][ny] == 0:
dist[nx][ny] = L
que.appendleft([L, nx, ny])
for dx, dy in d1:
nx, ny = x + dx, y + dy
if 0 <= nx < H and 0 <= ny < W and L + 1 < dist[nx][ny] and C[nx][ny] == 0:
dist[nx][ny] = L + 1
que.append([L + 1, nx, ny])
ans = dist[gx][gy]
if ans == inf:
print((-1))
else:
print(ans)
| false | 0 | [
"- if (",
"- 0 <= nx < H",
"- and 0 <= ny < W",
"- and L + C[nx][ny] < dist[nx][ny]",
"- and C[nx][ny] == 0",
"- ):",
"- dist[nx][ny] = L + C[nx][ny]",
"+ if 0 <= nx < H and 0 <= ny < W and L < dist[nx][ny] and C[nx][ny] == 0:... | false | 0.081846 | 0.072268 | 1.132545 | [
"s448555342",
"s807183565"
] |
u811733736 | p00511 | python | s988047044 | s932893750 | 30 | 20 | 7,704 | 7,672 | Accepted | Accepted | 33.33 | if __name__ == '__main__':
opcode = [] # ?????????????¨???¶??¨
operand = [] # ?????´????¢??????????????¨???¶??¨
# ??????????????\???
while True:
data = eval(input())
if data == '=':
break
elif data == '+' or data == '-' or data == '*' or data == '/':
opcode.append(data)
else:
if len(operand) == 0:
operand.append(int(data))
else:
op = opcode.pop()
operand1 = operand.pop()
operand2 = int(data)
if op == '+':
operand.append(operand1 + operand2)
elif op == '-':
operand.append(operand1 - operand2)
elif op == '*':
operand.append(operand1 * operand2)
elif op == '/':
operand.append(operand1 // operand2)
# ???????????¨???
print(('{0}'.format(operand.pop()))) | if __name__ == '__main__':
opcode = [] # ?????????????¨???¶??¨
operand = [] # ?????´????¢??????????????¨???¶??¨
# ??????????????\???
while True:
data = eval(input())
if data == '=':
break
elif data in '+-*/':
opcode.append(data)
else:
if len(operand) == 0:
operand.append(int(data))
else:
op = opcode.pop()
operand1 = operand.pop()
operand2 = int(data)
if op == '+':
operand.append(operand1 + operand2)
elif op == '-':
operand.append(operand1 - operand2)
elif op == '*':
operand.append(operand1 * operand2)
elif op == '/':
operand.append(operand1 // operand2)
# ???????????¨???
print(('{0}'.format(operand.pop()))) | 29 | 29 | 1,021 | 979 | if __name__ == "__main__":
opcode = [] # ?????????????¨???¶??¨
operand = [] # ?????´????¢??????????????¨???¶??¨
# ??????????????\???
while True:
data = eval(input())
if data == "=":
break
elif data == "+" or data == "-" or data == "*" or data == "/":
opcode.append(data)
else:
if len(operand) == 0:
operand.append(int(data))
else:
op = opcode.pop()
operand1 = operand.pop()
operand2 = int(data)
if op == "+":
operand.append(operand1 + operand2)
elif op == "-":
operand.append(operand1 - operand2)
elif op == "*":
operand.append(operand1 * operand2)
elif op == "/":
operand.append(operand1 // operand2)
# ???????????¨???
print(("{0}".format(operand.pop())))
| if __name__ == "__main__":
opcode = [] # ?????????????¨???¶??¨
operand = [] # ?????´????¢??????????????¨???¶??¨
# ??????????????\???
while True:
data = eval(input())
if data == "=":
break
elif data in "+-*/":
opcode.append(data)
else:
if len(operand) == 0:
operand.append(int(data))
else:
op = opcode.pop()
operand1 = operand.pop()
operand2 = int(data)
if op == "+":
operand.append(operand1 + operand2)
elif op == "-":
operand.append(operand1 - operand2)
elif op == "*":
operand.append(operand1 * operand2)
elif op == "/":
operand.append(operand1 // operand2)
# ???????????¨???
print(("{0}".format(operand.pop())))
| false | 0 | [
"- elif data == \"+\" or data == \"-\" or data == \"*\" or data == \"/\":",
"+ elif data in \"+-*/\":"
] | false | 0.049679 | 0.045278 | 1.097185 | [
"s988047044",
"s932893750"
] |
u678167152 | p03715 | python | s470775324 | s873100315 | 169 | 107 | 38,392 | 73,912 | Accepted | Accepted | 36.69 | def solve():
H, W = list(map(int, input().split()))
if H*W%3==0:
return 0
if H%2==0 and W%2==0:
return min(H//2,W//2)
if H%2==0:
return min([H//2,H//3*2+W//2+1-min(H//3,W//2),W])
if W%2==0:
return min([W//2,W//3*2+H//2+1-min(W//3,H//2),H])
return min([H//3*2+W//2+1-min(H//3,W//2),W//3*2+H//2+1-min(W//3,H//2),H,W])
print((solve())) | def solve():
ans = float('inf')
H, W = list(map(int, input().split()))
for h in range(1,H):
o1 = (H-h)//2*W
o2 = (H-h)*W-o1
a = [h*W,o1,o2]
ans = min(ans,max(a)-min(a))
o1 = W//2*(H-h)
o2 = (H-h)*W-o1
a = [h*W,o1,o2]
ans = min(ans,max(a)-min(a))
for w in range(1,W):
o1 = (W-w)//2*H
o2 = (W-w)*H-o1
a = [w*H,o1,o2]
ans = min(ans,max(a)-min(a))
o1 = H//2*(W-w)
o2 = (W-w)*H-o1
a = [w*H,o1,o2]
ans = min(ans,max(a)-min(a))
return ans
print((solve())) | 12 | 23 | 391 | 536 | def solve():
H, W = list(map(int, input().split()))
if H * W % 3 == 0:
return 0
if H % 2 == 0 and W % 2 == 0:
return min(H // 2, W // 2)
if H % 2 == 0:
return min([H // 2, H // 3 * 2 + W // 2 + 1 - min(H // 3, W // 2), W])
if W % 2 == 0:
return min([W // 2, W // 3 * 2 + H // 2 + 1 - min(W // 3, H // 2), H])
return min(
[
H // 3 * 2 + W // 2 + 1 - min(H // 3, W // 2),
W // 3 * 2 + H // 2 + 1 - min(W // 3, H // 2),
H,
W,
]
)
print((solve()))
| def solve():
ans = float("inf")
H, W = list(map(int, input().split()))
for h in range(1, H):
o1 = (H - h) // 2 * W
o2 = (H - h) * W - o1
a = [h * W, o1, o2]
ans = min(ans, max(a) - min(a))
o1 = W // 2 * (H - h)
o2 = (H - h) * W - o1
a = [h * W, o1, o2]
ans = min(ans, max(a) - min(a))
for w in range(1, W):
o1 = (W - w) // 2 * H
o2 = (W - w) * H - o1
a = [w * H, o1, o2]
ans = min(ans, max(a) - min(a))
o1 = H // 2 * (W - w)
o2 = (W - w) * H - o1
a = [w * H, o1, o2]
ans = min(ans, max(a) - min(a))
return ans
print((solve()))
| false | 47.826087 | [
"+ ans = float(\"inf\")",
"- if H * W % 3 == 0:",
"- return 0",
"- if H % 2 == 0 and W % 2 == 0:",
"- return min(H // 2, W // 2)",
"- if H % 2 == 0:",
"- return min([H // 2, H // 3 * 2 + W // 2 + 1 - min(H // 3, W // 2), W])",
"- if W % 2 == 0:",
"- return ... | false | 0.04414 | 0.04385 | 1.006628 | [
"s470775324",
"s873100315"
] |
u102461423 | p03724 | python | s598650512 | s770142544 | 191 | 149 | 21,936 | 39,256 | Accepted | Accepted | 21.99 | import sys
input = sys.stdin.readline
N,M = list(map(int,input().split()))
AB = [[int(x) for x in input().split()] for _ in range(M)]
# (x,y)をすることは、(1,x),(1,y)とすることと同じ
counter = [0] * (N+1)
for x,y in AB:
counter[x] += 1
counter[y] += 1
answer = 'NO' if any(x&1 for x in counter) else 'YES'
print(answer) | import sys
import numpy as np
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
nums = np.array(read().split(), np.int32)[2:]
cond = np.all(np.bincount(nums) % 2 == 0)
print(('YES' if cond else 'NO')) | 16 | 11 | 326 | 266 | import sys
input = sys.stdin.readline
N, M = list(map(int, input().split()))
AB = [[int(x) for x in input().split()] for _ in range(M)]
# (x,y)をすることは、(1,x),(1,y)とすることと同じ
counter = [0] * (N + 1)
for x, y in AB:
counter[x] += 1
counter[y] += 1
answer = "NO" if any(x & 1 for x in counter) else "YES"
print(answer)
| import sys
import numpy as np
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
nums = np.array(read().split(), np.int32)[2:]
cond = np.all(np.bincount(nums) % 2 == 0)
print(("YES" if cond else "NO"))
| false | 31.25 | [
"+import numpy as np",
"-input = sys.stdin.readline",
"-N, M = list(map(int, input().split()))",
"-AB = [[int(x) for x in input().split()] for _ in range(M)]",
"-# (x,y)をすることは、(1,x),(1,y)とすることと同じ",
"-counter = [0] * (N + 1)",
"-for x, y in AB:",
"- counter[x] += 1",
"- counter[y] += 1",
"-an... | false | 0.040905 | 0.353186 | 0.115818 | [
"s598650512",
"s770142544"
] |
u106095117 | p02682 | python | s572284690 | s518006578 | 26 | 20 | 9,204 | 9,104 | Accepted | Accepted | 23.08 |
A, B, C, K = list(map(int, input().split()))
sum = 0
if A <= K:
K -= A
sum += 1 * A
elif K > 0:
sum += 1 * K
K = 0
if B <= K:
K -= B
elif K > 0:
K = 0
if C <= K:
K -= C
sum -= 1 * C
elif K > 0:
sum -= 1 * K
print(sum) | a, b, c, k = list(map(int, input().split()))
if k <= a:
print(k)
elif k <= a + b:
print(a)
else:
print((a - (k - (a + b))))
| 19 | 8 | 266 | 136 | A, B, C, K = list(map(int, input().split()))
sum = 0
if A <= K:
K -= A
sum += 1 * A
elif K > 0:
sum += 1 * K
K = 0
if B <= K:
K -= B
elif K > 0:
K = 0
if C <= K:
K -= C
sum -= 1 * C
elif K > 0:
sum -= 1 * K
print(sum)
| a, b, c, k = list(map(int, input().split()))
if k <= a:
print(k)
elif k <= a + b:
print(a)
else:
print((a - (k - (a + b))))
| false | 57.894737 | [
"-A, B, C, K = list(map(int, input().split()))",
"-sum = 0",
"-if A <= K:",
"- K -= A",
"- sum += 1 * A",
"-elif K > 0:",
"- sum += 1 * K",
"- K = 0",
"-if B <= K:",
"- K -= B",
"-elif K > 0:",
"- K = 0",
"-if C <= K:",
"- K -= C",
"- sum -= 1 * C",
"-elif K > 0... | false | 0.036734 | 0.046454 | 0.790745 | [
"s572284690",
"s518006578"
] |
u116038906 | p02714 | python | s712320704 | s609558671 | 1,224 | 973 | 9,252 | 9,312 | Accepted | Accepted | 20.51 | # 初期入力
N= int(eval(input()))
S =eval(input())
#
R_index=[]
G_index=[]
B_index=[]
for i,v in enumerate(S):
if v =="R":
R_index.append(i)
if v =="G":
G_index.append(i)
if v =="B":
B_index.append(i)
# 例 R_index各要素から等距離離れたところに左にG、右にBがあればOK
R_B =[]
B_G =[]
count_ij_jk_onaji =0
for r in R_index:
for g in G_index:
if 0<=g-(r-g) and g-(r-g)<N :
#if S[g-(r-g)]=="B" and r<g:
if S[g-(r-g)]=="B" :
count_ij_jk_onaji +=1
# print(r,g,g-(r-g),"B")
for b in B_index:
for r in R_index:
if 0<=r-(b-r) and r-(b-r)<N :
#if S[r-(b-r)] == "G" and b<r:
if S[r-(b-r)] == "G" :
count_ij_jk_onaji +=1
#print(r,b,r-(b-r),"G")
for g in G_index:
for b in B_index:
if 0<=b-(g-b) and b-(g-b)<N :
#if S[b-(g-b)] =="R" and g<b:
if S[b-(g-b)] =="R":
count_ij_jk_onaji +=1
#print(b,g,b-(g-b),"R")
#3つとも異なる文字=all
kotae_all = len(R_index) * len(G_index) * len(B_index)
print((kotae_all -count_ij_jk_onaji)) | # 初期入力
N= int(eval(input()))
S =input().strip()
# RGBの各index
R =set([i for i, x in enumerate(S) if x == 'R'])
G =set([i for i, x in enumerate(S) if x == 'G'])
B =set([i for i, x in enumerate(S) if x == 'B'])
count =0
rgb =[]
for i in R:
for j in G:
k1 =j +(j -i)
if k1 in B: #inはlistよりsetのほうが速い
count +=1
for i in B:
for j in R:
k1 =j +(j -i)
if k1 in G: #inはlistよりsetのほうが速い
count +=1
for i in G:
for j in B:
k1 =j +(j -i)
if k1 in R: #inはlistよりsetのほうが速い
count +=1
all =len(R) *len(G) *len(B)
print((all -count)) | 47 | 32 | 1,162 | 637 | # 初期入力
N = int(eval(input()))
S = eval(input())
#
R_index = []
G_index = []
B_index = []
for i, v in enumerate(S):
if v == "R":
R_index.append(i)
if v == "G":
G_index.append(i)
if v == "B":
B_index.append(i)
# 例 R_index各要素から等距離離れたところに左にG、右にBがあればOK
R_B = []
B_G = []
count_ij_jk_onaji = 0
for r in R_index:
for g in G_index:
if 0 <= g - (r - g) and g - (r - g) < N:
# if S[g-(r-g)]=="B" and r<g:
if S[g - (r - g)] == "B":
count_ij_jk_onaji += 1
# print(r,g,g-(r-g),"B")
for b in B_index:
for r in R_index:
if 0 <= r - (b - r) and r - (b - r) < N:
# if S[r-(b-r)] == "G" and b<r:
if S[r - (b - r)] == "G":
count_ij_jk_onaji += 1
# print(r,b,r-(b-r),"G")
for g in G_index:
for b in B_index:
if 0 <= b - (g - b) and b - (g - b) < N:
# if S[b-(g-b)] =="R" and g<b:
if S[b - (g - b)] == "R":
count_ij_jk_onaji += 1
# print(b,g,b-(g-b),"R")
# 3つとも異なる文字=all
kotae_all = len(R_index) * len(G_index) * len(B_index)
print((kotae_all - count_ij_jk_onaji))
| # 初期入力
N = int(eval(input()))
S = input().strip()
# RGBの各index
R = set([i for i, x in enumerate(S) if x == "R"])
G = set([i for i, x in enumerate(S) if x == "G"])
B = set([i for i, x in enumerate(S) if x == "B"])
count = 0
rgb = []
for i in R:
for j in G:
k1 = j + (j - i)
if k1 in B: # inはlistよりsetのほうが速い
count += 1
for i in B:
for j in R:
k1 = j + (j - i)
if k1 in G: # inはlistよりsetのほうが速い
count += 1
for i in G:
for j in B:
k1 = j + (j - i)
if k1 in R: # inはlistよりsetのほうが速い
count += 1
all = len(R) * len(G) * len(B)
print((all - count))
| false | 31.914894 | [
"-S = eval(input())",
"-#",
"-R_index = []",
"-G_index = []",
"-B_index = []",
"-for i, v in enumerate(S):",
"- if v == \"R\":",
"- R_index.append(i)",
"- if v == \"G\":",
"- G_index.append(i)",
"- if v == \"B\":",
"- B_index.append(i)",
"-# 例 R_index各要素から等距離離れた... | false | 0.101218 | 0.044016 | 2.299606 | [
"s712320704",
"s609558671"
] |
u879870653 | p03634 | python | s538391165 | s332595378 | 1,532 | 752 | 137,932 | 140,492 | Accepted | Accepted | 50.91 | import sys
sys.setrecursionlimit(10**9)
N = int(eval(input()))
T = [[] for _ in range(N+1)]
for _ in range(N-1) :
a,b,c = list(map(int,input().split()))
T[a].append([b,c])
T[b].append([a,c])
Q,K = list(map(int,input().split()))
dist = [None]*(N+1)
def dfs(now,d) :
dist[now] = d
for to,c in T[now] :
if dist[to] is not None :
continue
dfs(to,d+c)
dfs(K,0)
for _ in range(Q) :
u,v = list(map(int,input().split()))
print((dist[u] + dist[v]))
| import sys
sys.setrecursionlimit(10**9)
input = sys.stdin.readline
N = int(input())
T = [[] for _ in range(N+1)]
for _ in range(N-1) :
a,b,c = map(int,input().split())
T[a].append([b,c])
T[b].append([a,c])
Q,K = map(int,input().split())
dist = [None]*(N+1)
def dfs(now,d) :
dist[now] = d
for to,c in T[now] :
if dist[to] is not None :
continue
dfs(to,d+c)
dfs(K,0)
ans = [0]*Q
for i in range(Q) :
u,v = map(int,input().split())
ans[i] = dist[u]+dist[v]
print(*ans,sep="\n")
| 28 | 35 | 508 | 576 | import sys
sys.setrecursionlimit(10**9)
N = int(eval(input()))
T = [[] for _ in range(N + 1)]
for _ in range(N - 1):
a, b, c = list(map(int, input().split()))
T[a].append([b, c])
T[b].append([a, c])
Q, K = list(map(int, input().split()))
dist = [None] * (N + 1)
def dfs(now, d):
dist[now] = d
for to, c in T[now]:
if dist[to] is not None:
continue
dfs(to, d + c)
dfs(K, 0)
for _ in range(Q):
u, v = list(map(int, input().split()))
print((dist[u] + dist[v]))
| import sys
sys.setrecursionlimit(10**9)
input = sys.stdin.readline
N = int(input())
T = [[] for _ in range(N + 1)]
for _ in range(N - 1):
a, b, c = map(int, input().split())
T[a].append([b, c])
T[b].append([a, c])
Q, K = map(int, input().split())
dist = [None] * (N + 1)
def dfs(now, d):
dist[now] = d
for to, c in T[now]:
if dist[to] is not None:
continue
dfs(to, d + c)
dfs(K, 0)
ans = [0] * Q
for i in range(Q):
u, v = map(int, input().split())
ans[i] = dist[u] + dist[v]
print(*ans, sep="\n")
| false | 20 | [
"-N = int(eval(input()))",
"+input = sys.stdin.readline",
"+N = int(input())",
"- a, b, c = list(map(int, input().split()))",
"+ a, b, c = map(int, input().split())",
"-Q, K = list(map(int, input().split()))",
"+Q, K = map(int, input().split())",
"-for _ in range(Q):",
"- u, v = list(map(in... | false | 0.037914 | 0.038085 | 0.995526 | [
"s538391165",
"s332595378"
] |
u781262926 | p03252 | python | s609735959 | s447795297 | 132 | 120 | 4,076 | 3,632 | Accepted | Accepted | 9.09 | from collections import defaultdict
S, T = [x.strip() for x in open(0).read().split()]
ds, dt = defaultdict(str), defaultdict(str)
ans = 'Yes'
for s, t in zip(S, T):
if not ds[s] or ds[s] == t:
ds[s] = t
else:
ans = 'No'
break
if not dt[t] or dt[t] == s:
dt[t] = s
else:
ans = 'No'
break
print(ans) | S, T = input().strip(), input().strip()
ds, dt = {}, {}
for s, t in zip(S, T):
if s not in ds or ds[s] == t:
ds[s] = t
else:
print('No')
exit()
if t not in dt or dt[t] == s:
dt[t] = s
else:
print('No')
exit()
print('Yes') | 17 | 15 | 384 | 300 | from collections import defaultdict
S, T = [x.strip() for x in open(0).read().split()]
ds, dt = defaultdict(str), defaultdict(str)
ans = "Yes"
for s, t in zip(S, T):
if not ds[s] or ds[s] == t:
ds[s] = t
else:
ans = "No"
break
if not dt[t] or dt[t] == s:
dt[t] = s
else:
ans = "No"
break
print(ans)
| S, T = input().strip(), input().strip()
ds, dt = {}, {}
for s, t in zip(S, T):
if s not in ds or ds[s] == t:
ds[s] = t
else:
print("No")
exit()
if t not in dt or dt[t] == s:
dt[t] = s
else:
print("No")
exit()
print("Yes")
| false | 11.764706 | [
"-from collections import defaultdict",
"-",
"-S, T = [x.strip() for x in open(0).read().split()]",
"-ds, dt = defaultdict(str), defaultdict(str)",
"-ans = \"Yes\"",
"+S, T = input().strip(), input().strip()",
"+ds, dt = {}, {}",
"- if not ds[s] or ds[s] == t:",
"+ if s not in ds or ds[s] == t... | false | 0.037786 | 0.036352 | 1.039466 | [
"s609735959",
"s447795297"
] |
u912237403 | p00133 | python | s184117978 | s281291582 | 20 | 10 | 4,192 | 4,192 | Accepted | Accepted | 50 | x = [list(input()) for _ in [0]*8]
for i in [1,2,3]:
x = list(zip(*x[::-1]))
print(i*90)
for e in x: print("".join(e)) | x = [input() for _ in [0] * 8]
for i in [1, 2, 3]:
x = list(zip(*x[::-1]))
print(i*90)
for e in x:
print("".join(e)) | 5 | 6 | 124 | 127 | x = [list(input()) for _ in [0] * 8]
for i in [1, 2, 3]:
x = list(zip(*x[::-1]))
print(i * 90)
for e in x:
print("".join(e))
| x = [input() for _ in [0] * 8]
for i in [1, 2, 3]:
x = list(zip(*x[::-1]))
print(i * 90)
for e in x:
print("".join(e))
| false | 16.666667 | [
"-x = [list(input()) for _ in [0] * 8]",
"+x = [input() for _ in [0] * 8]"
] | false | 0.039204 | 0.041999 | 0.933446 | [
"s184117978",
"s281291582"
] |
u456936625 | p02555 | python | s105137510 | s820515585 | 131 | 118 | 77,520 | 77,420 | Accepted | Accepted | 9.92 | # @oj: atcoder
# @id: hitwanyang
# @email: 296866643@qq.com
# @date: 2020-09-15 19:45
# @url:
import sys,os
from io import BytesIO, IOBase
import collections,itertools,bisect,heapq,math,string
from decimal import *
# region fastio
BUFSIZE = 8192
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer = BytesIO()
self.writable = "x" in file.mode or "r" not in file.mode
self.write = self.buffer.write if self.writable else None
def read(self):
while True:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
if not b:
break
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines = 0
return self.buffer.read()
def readline(self):
while self.newlines == 0:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
self.newlines = b.count(b"\n") + (not b)
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines -= 1
return self.buffer.readline()
def flush(self):
if self.writable:
os.write(self._fd, self.buffer.getvalue())
self.buffer.truncate(0), self.buffer.seek(0)
class IOWrapper(IOBase):
def __init__(self, file):
self.buffer = FastIO(file)
self.flush = self.buffer.flush
self.writable = self.buffer.writable
self.write = lambda s: self.buffer.write(s.encode("ascii"))
self.read = lambda: self.buffer.read().decode("ascii")
self.readline = lambda: self.buffer.readline().decode("ascii")
sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip("\r\n")
# ------------------------------
## 注意嵌套括号!!!!!!
## 先有思路,再写代码,别着急!!!
## 先有朴素解法,不要有思维定式,试着换思路解决
def main():
x=int(eval(input()))
dp=[0]*(x+1)
mod=10**9+7
for i in range(x+1):
if i<3:
dp[i]=0
continue
dp[i]=1
for j in range(3,i-3+1):
if i-j>5:
dp[i]+=(1+dp[i-j]%mod-1)
else:
dp[i]+=dp[i-j]%mod
print((dp[-1]%mod))
if __name__ == "__main__":
main() | # @oj: atcoder
# @id: hitwanyang
# @email: 296866643@qq.com
# @date: 2020-09-15 19:45
# @url:
import sys,os
from io import BytesIO, IOBase
import collections,itertools,bisect,heapq,math,string
from decimal import *
# region fastio
BUFSIZE = 8192
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer = BytesIO()
self.writable = "x" in file.mode or "r" not in file.mode
self.write = self.buffer.write if self.writable else None
def read(self):
while True:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
if not b:
break
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines = 0
return self.buffer.read()
def readline(self):
while self.newlines == 0:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
self.newlines = b.count(b"\n") + (not b)
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines -= 1
return self.buffer.readline()
def flush(self):
if self.writable:
os.write(self._fd, self.buffer.getvalue())
self.buffer.truncate(0), self.buffer.seek(0)
class IOWrapper(IOBase):
def __init__(self, file):
self.buffer = FastIO(file)
self.flush = self.buffer.flush
self.writable = self.buffer.writable
self.write = lambda s: self.buffer.write(s.encode("ascii"))
self.read = lambda: self.buffer.read().decode("ascii")
self.readline = lambda: self.buffer.readline().decode("ascii")
sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip("\r\n")
# ------------------------------
## 注意嵌套括号!!!!!!
## 先有思路,再写代码,别着急!!!
## 先有朴素解法,不要有思维定式,试着换思路解决
def main():
x=int(eval(input()))
dp=[0]*(x+1)
mod=10**9+7
for i in range(x+1):
if i<3:
dp[i]=0
continue
dp[i]=1
for j in range(3,i-2):
dp[i]+=dp[i-j]%mod
print((dp[-1]%mod))
if __name__ == "__main__":
main() | 83 | 80 | 2,447 | 2,357 | # @oj: atcoder
# @id: hitwanyang
# @email: 296866643@qq.com
# @date: 2020-09-15 19:45
# @url:
import sys, os
from io import BytesIO, IOBase
import collections, itertools, bisect, heapq, math, string
from decimal import *
# region fastio
BUFSIZE = 8192
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer = BytesIO()
self.writable = "x" in file.mode or "r" not in file.mode
self.write = self.buffer.write if self.writable else None
def read(self):
while True:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
if not b:
break
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines = 0
return self.buffer.read()
def readline(self):
while self.newlines == 0:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
self.newlines = b.count(b"\n") + (not b)
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines -= 1
return self.buffer.readline()
def flush(self):
if self.writable:
os.write(self._fd, self.buffer.getvalue())
self.buffer.truncate(0), self.buffer.seek(0)
class IOWrapper(IOBase):
def __init__(self, file):
self.buffer = FastIO(file)
self.flush = self.buffer.flush
self.writable = self.buffer.writable
self.write = lambda s: self.buffer.write(s.encode("ascii"))
self.read = lambda: self.buffer.read().decode("ascii")
self.readline = lambda: self.buffer.readline().decode("ascii")
sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip("\r\n")
# ------------------------------
## 注意嵌套括号!!!!!!
## 先有思路,再写代码,别着急!!!
## 先有朴素解法,不要有思维定式,试着换思路解决
def main():
x = int(eval(input()))
dp = [0] * (x + 1)
mod = 10**9 + 7
for i in range(x + 1):
if i < 3:
dp[i] = 0
continue
dp[i] = 1
for j in range(3, i - 3 + 1):
if i - j > 5:
dp[i] += 1 + dp[i - j] % mod - 1
else:
dp[i] += dp[i - j] % mod
print((dp[-1] % mod))
if __name__ == "__main__":
main()
| # @oj: atcoder
# @id: hitwanyang
# @email: 296866643@qq.com
# @date: 2020-09-15 19:45
# @url:
import sys, os
from io import BytesIO, IOBase
import collections, itertools, bisect, heapq, math, string
from decimal import *
# region fastio
BUFSIZE = 8192
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer = BytesIO()
self.writable = "x" in file.mode or "r" not in file.mode
self.write = self.buffer.write if self.writable else None
def read(self):
while True:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
if not b:
break
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines = 0
return self.buffer.read()
def readline(self):
while self.newlines == 0:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
self.newlines = b.count(b"\n") + (not b)
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines -= 1
return self.buffer.readline()
def flush(self):
if self.writable:
os.write(self._fd, self.buffer.getvalue())
self.buffer.truncate(0), self.buffer.seek(0)
class IOWrapper(IOBase):
def __init__(self, file):
self.buffer = FastIO(file)
self.flush = self.buffer.flush
self.writable = self.buffer.writable
self.write = lambda s: self.buffer.write(s.encode("ascii"))
self.read = lambda: self.buffer.read().decode("ascii")
self.readline = lambda: self.buffer.readline().decode("ascii")
sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip("\r\n")
# ------------------------------
## 注意嵌套括号!!!!!!
## 先有思路,再写代码,别着急!!!
## 先有朴素解法,不要有思维定式,试着换思路解决
def main():
x = int(eval(input()))
dp = [0] * (x + 1)
mod = 10**9 + 7
for i in range(x + 1):
if i < 3:
dp[i] = 0
continue
dp[i] = 1
for j in range(3, i - 2):
dp[i] += dp[i - j] % mod
print((dp[-1] % mod))
if __name__ == "__main__":
main()
| false | 3.614458 | [
"- for j in range(3, i - 3 + 1):",
"- if i - j > 5:",
"- dp[i] += 1 + dp[i - j] % mod - 1",
"- else:",
"- dp[i] += dp[i - j] % mod",
"+ for j in range(3, i - 2):",
"+ dp[i] += dp[i - j] % mod"
] | false | 0.281408 | 0.102729 | 2.739327 | [
"s105137510",
"s820515585"
] |
u762955009 | p03112 | python | s320759183 | s908602314 | 1,840 | 1,113 | 35,360 | 35,368 | Accepted | Accepted | 39.51 | import bisect
A, B, Q = list(map(int, input().split()))
shrines = []
for i in range(A):
shrines.append(int(eval(input())))
temples = []
for i in range(B):
temples.append(int(eval(input())))
shortest_s_to_t = {}
for shrine in shrines:
index = bisect.bisect_left(temples, shrine)
if index == 0:
distance = abs(shrine - temples[index])
shortest_s_to_t[shrine] = distance
elif index == B:
distance = abs(shrine - temples[index - 1])
shortest_s_to_t[shrine] = distance
else:
distance_left = abs(shrine - temples[index - 1])
distance_right = abs(shrine - temples[index])
shortest_s_to_t[shrine] = min(distance_left, distance_right)
shortest_t_to_s = {}
for temple in temples:
index = bisect.bisect_left(shrines, temple)
if index == 0:
distance = abs(temple - shrines[index])
shortest_t_to_s[temple] = distance
elif index == A:
distance = abs(temple - shrines[index - 1])
shortest_t_to_s[temple] = distance
else:
distance_left = abs(temple - shrines[index - 1])
distance_right = abs(temple - shrines[index])
shortest_t_to_s[temple] = min(distance_left, distance_right)
for i in range(Q):
x = int(eval(input()))
# shrine to temple
index = bisect.bisect_left(shrines, x)
ans = 10**11
if index > 0:
left_shrine = shrines[index - 1]
candidate = abs(x - left_shrine) + shortest_s_to_t[left_shrine]
ans = min(ans, candidate)
if index < A:
right_shrine = shrines[index]
candidate = abs(x - right_shrine) + shortest_s_to_t[right_shrine]
ans = min(ans, candidate)
# temple to shrine
index = bisect.bisect_left(temples, x)
if index > 0:
left_temple = temples[index - 1]
candidate = abs(x - left_temple) + shortest_t_to_s[left_temple]
ans = min(ans, candidate)
if index < B:
right_temple = temples[index]
candidate = abs(x - right_temple) + shortest_t_to_s[right_temple]
ans = min(ans, candidate)
print(ans) | import bisect
import sys
def input():
return sys.stdin.readline()
A, B, Q = list(map(int, input().split()))
shrines = []
for i in range(A):
shrines.append(int(eval(input())))
temples = []
for i in range(B):
temples.append(int(eval(input())))
shortest_s_to_t = {}
for shrine in shrines:
index = bisect.bisect_left(temples, shrine)
if index == 0:
distance = abs(shrine - temples[index])
shortest_s_to_t[shrine] = distance
elif index == B:
distance = abs(shrine - temples[index - 1])
shortest_s_to_t[shrine] = distance
else:
distance_left = abs(shrine - temples[index - 1])
distance_right = abs(shrine - temples[index])
shortest_s_to_t[shrine] = min(distance_left, distance_right)
shortest_t_to_s = {}
for temple in temples:
index = bisect.bisect_left(shrines, temple)
if index == 0:
distance = abs(temple - shrines[index])
shortest_t_to_s[temple] = distance
elif index == A:
distance = abs(temple - shrines[index - 1])
shortest_t_to_s[temple] = distance
else:
distance_left = abs(temple - shrines[index - 1])
distance_right = abs(temple - shrines[index])
shortest_t_to_s[temple] = min(distance_left, distance_right)
for i in range(Q):
x = int(eval(input()))
# shrine to temple
index = bisect.bisect_left(shrines, x)
ans = 10**11
if index > 0:
left_shrine = shrines[index - 1]
candidate = abs(x - left_shrine) + shortest_s_to_t[left_shrine]
ans = min(ans, candidate)
if index < A:
right_shrine = shrines[index]
candidate = abs(x - right_shrine) + shortest_s_to_t[right_shrine]
ans = min(ans, candidate)
# temple to shrine
index = bisect.bisect_left(temples, x)
if index > 0:
left_temple = temples[index - 1]
candidate = abs(x - left_temple) + shortest_t_to_s[left_temple]
ans = min(ans, candidate)
if index < B:
right_temple = temples[index]
candidate = abs(x - right_temple) + shortest_t_to_s[right_temple]
ans = min(ans, candidate)
print(ans) | 67 | 71 | 2,132 | 2,193 | import bisect
A, B, Q = list(map(int, input().split()))
shrines = []
for i in range(A):
shrines.append(int(eval(input())))
temples = []
for i in range(B):
temples.append(int(eval(input())))
shortest_s_to_t = {}
for shrine in shrines:
index = bisect.bisect_left(temples, shrine)
if index == 0:
distance = abs(shrine - temples[index])
shortest_s_to_t[shrine] = distance
elif index == B:
distance = abs(shrine - temples[index - 1])
shortest_s_to_t[shrine] = distance
else:
distance_left = abs(shrine - temples[index - 1])
distance_right = abs(shrine - temples[index])
shortest_s_to_t[shrine] = min(distance_left, distance_right)
shortest_t_to_s = {}
for temple in temples:
index = bisect.bisect_left(shrines, temple)
if index == 0:
distance = abs(temple - shrines[index])
shortest_t_to_s[temple] = distance
elif index == A:
distance = abs(temple - shrines[index - 1])
shortest_t_to_s[temple] = distance
else:
distance_left = abs(temple - shrines[index - 1])
distance_right = abs(temple - shrines[index])
shortest_t_to_s[temple] = min(distance_left, distance_right)
for i in range(Q):
x = int(eval(input()))
# shrine to temple
index = bisect.bisect_left(shrines, x)
ans = 10**11
if index > 0:
left_shrine = shrines[index - 1]
candidate = abs(x - left_shrine) + shortest_s_to_t[left_shrine]
ans = min(ans, candidate)
if index < A:
right_shrine = shrines[index]
candidate = abs(x - right_shrine) + shortest_s_to_t[right_shrine]
ans = min(ans, candidate)
# temple to shrine
index = bisect.bisect_left(temples, x)
if index > 0:
left_temple = temples[index - 1]
candidate = abs(x - left_temple) + shortest_t_to_s[left_temple]
ans = min(ans, candidate)
if index < B:
right_temple = temples[index]
candidate = abs(x - right_temple) + shortest_t_to_s[right_temple]
ans = min(ans, candidate)
print(ans)
| import bisect
import sys
def input():
return sys.stdin.readline()
A, B, Q = list(map(int, input().split()))
shrines = []
for i in range(A):
shrines.append(int(eval(input())))
temples = []
for i in range(B):
temples.append(int(eval(input())))
shortest_s_to_t = {}
for shrine in shrines:
index = bisect.bisect_left(temples, shrine)
if index == 0:
distance = abs(shrine - temples[index])
shortest_s_to_t[shrine] = distance
elif index == B:
distance = abs(shrine - temples[index - 1])
shortest_s_to_t[shrine] = distance
else:
distance_left = abs(shrine - temples[index - 1])
distance_right = abs(shrine - temples[index])
shortest_s_to_t[shrine] = min(distance_left, distance_right)
shortest_t_to_s = {}
for temple in temples:
index = bisect.bisect_left(shrines, temple)
if index == 0:
distance = abs(temple - shrines[index])
shortest_t_to_s[temple] = distance
elif index == A:
distance = abs(temple - shrines[index - 1])
shortest_t_to_s[temple] = distance
else:
distance_left = abs(temple - shrines[index - 1])
distance_right = abs(temple - shrines[index])
shortest_t_to_s[temple] = min(distance_left, distance_right)
for i in range(Q):
x = int(eval(input()))
# shrine to temple
index = bisect.bisect_left(shrines, x)
ans = 10**11
if index > 0:
left_shrine = shrines[index - 1]
candidate = abs(x - left_shrine) + shortest_s_to_t[left_shrine]
ans = min(ans, candidate)
if index < A:
right_shrine = shrines[index]
candidate = abs(x - right_shrine) + shortest_s_to_t[right_shrine]
ans = min(ans, candidate)
# temple to shrine
index = bisect.bisect_left(temples, x)
if index > 0:
left_temple = temples[index - 1]
candidate = abs(x - left_temple) + shortest_t_to_s[left_temple]
ans = min(ans, candidate)
if index < B:
right_temple = temples[index]
candidate = abs(x - right_temple) + shortest_t_to_s[right_temple]
ans = min(ans, candidate)
print(ans)
| false | 5.633803 | [
"+import sys",
"+",
"+",
"+def input():",
"+ return sys.stdin.readline()",
"+"
] | false | 0.038233 | 0.045227 | 0.845351 | [
"s320759183",
"s908602314"
] |
u627803856 | p02713 | python | s068020422 | s931898897 | 1,869 | 56 | 75,856 | 65,160 | Accepted | Accepted | 97 | # 3重ループでテスト
from functools import reduce
k = int(eval(input()))
def gcd(a, b):
# 最大公約数
while b:
a, b = b, a % b
return a
def gcds(*nums):
return reduce(gcd, nums)
res = 0
for a in range(1, k + 1):
for b in range(1, k + 1):
for c in range(1, k + 1):
res += gcds(a, b, c)
print(res) | from math import gcd
k = int(eval(input()))
gcd_sum = [0] * 201
res = 0
for i in range(1, k + 1):
for j in range(1, k + 1):
gcd_sum[i] += gcd(i, j)
for a in range(1, k + 1):
for b in range(1, k + 1):
g = gcd(a, b)
res += gcd_sum[g]
print(res) | 22 | 17 | 328 | 265 | # 3重ループでテスト
from functools import reduce
k = int(eval(input()))
def gcd(a, b):
# 最大公約数
while b:
a, b = b, a % b
return a
def gcds(*nums):
return reduce(gcd, nums)
res = 0
for a in range(1, k + 1):
for b in range(1, k + 1):
for c in range(1, k + 1):
res += gcds(a, b, c)
print(res)
| from math import gcd
k = int(eval(input()))
gcd_sum = [0] * 201
res = 0
for i in range(1, k + 1):
for j in range(1, k + 1):
gcd_sum[i] += gcd(i, j)
for a in range(1, k + 1):
for b in range(1, k + 1):
g = gcd(a, b)
res += gcd_sum[g]
print(res)
| false | 22.727273 | [
"-# 3重ループでテスト",
"-from functools import reduce",
"+from math import gcd",
"-",
"-",
"-def gcd(a, b):",
"- # 最大公約数",
"- while b:",
"- a, b = b, a % b",
"- return a",
"-",
"-",
"-def gcds(*nums):",
"- return reduce(gcd, nums)",
"-",
"-",
"+gcd_sum = [0] * 201",
"+f... | false | 0.111158 | 0.038798 | 2.865081 | [
"s068020422",
"s931898897"
] |
u899759239 | p03573 | python | s244434566 | s185790274 | 454 | 10 | 4,392 | 2,572 | Accepted | Accepted | 97.8 | #!/usr/bin/env python
#-*- coding: utf-8 -*-
from collections import defaultdict
from math import factorial as f
from fractions import gcd as g
l = [int (i) for i in input ().split ()]
d = defaultdict (int)
for i in l: d [i] += 1
print([i for i in d if d [i] == 1][0])
| #!/usr/bin/env python
#-*- coding: utf-8 -*-
A, B, C = [int (i) for i in input ().split ()]
print(A ^ B ^ C) | 12 | 5 | 286 | 116 | #!/usr/bin/env python
# -*- coding: utf-8 -*-
from collections import defaultdict
from math import factorial as f
from fractions import gcd as g
l = [int(i) for i in input().split()]
d = defaultdict(int)
for i in l:
d[i] += 1
print([i for i in d if d[i] == 1][0])
| #!/usr/bin/env python
# -*- coding: utf-8 -*-
A, B, C = [int(i) for i in input().split()]
print(A ^ B ^ C)
| false | 58.333333 | [
"-from collections import defaultdict",
"-from math import factorial as f",
"-from fractions import gcd as g",
"-",
"-l = [int(i) for i in input().split()]",
"-d = defaultdict(int)",
"-for i in l:",
"- d[i] += 1",
"-print([i for i in d if d[i] == 1][0])",
"+A, B, C = [int(i) for i in input().sp... | false | 0.077102 | 0.036353 | 2.120926 | [
"s244434566",
"s185790274"
] |
u599114793 | p03014 | python | s038790294 | s244431520 | 1,980 | 1,555 | 320,008 | 287,112 | Accepted | Accepted | 21.46 | h,w = list(map(int,input().split()))
grid = []
grid_num1 = []
grid_num2 = []
for i in range(h):
lst = list(eval(input()))
lst.append("#")
grid.append(lst)
grid_num1.append([0]*w)
grid.append(["#"]*(w+1))
for j in range(w):
grid_num2.append([0]*h)
grid_t = [list(x) for x in zip(*grid)]
for i in range(h):
sw = []
tar_row = grid[i]
for j in range(w+1):
if j == 0 and tar_row[j] == ".":
sw.append(j)
elif tar_row[j] == "." and tar_row[j-1] == "#":
sw.append(j)
elif tar_row[j] == "#" and tar_row[j-1] == ".":
sw.append(j)
for j in range(0,len(sw),2):
l = sw[j]
r = sw[j+1]
for k in range(l, r):
grid_num1[i][k] += r-l
for i in range(w):
sw = []
tar_row = grid_t[i]
for j in range(h+1):
if j == 0 and tar_row[j] == ".":
sw.append(j)
elif tar_row[j] == "." and tar_row[j-1] == "#":
sw.append(j)
elif tar_row[j] == "#" and tar_row[j-1] == ".":
sw.append(j)
for j in range(0,len(sw),2):
l = sw[j]
r = sw[j+1]
for k in range(l, r):
grid_num2[i][k] += r-l
grid_num2 = [list(x) for x in zip(*grid_num2)]
ans = 0
for i in range(h):
for j in range(w):
ans = max(ans, grid_num1[i][j] + grid_num2[i][j]-1)
print(ans)
| h,w = list(map(int,input().split()))
grid = []
grid_num1 = []
grid_num2 = []
for i in range(h):
lst = list(eval(input()))
lst.append("#")
grid.append(lst)
grid_num1.append([0]*w)
grid.append(["#"]*(w+1))
for j in range(w):
grid_num2.append([0]*h)
grid_t = [list(x) for x in zip(*grid)]
for i in range(h):
sw = []
tar_row = grid[i]
for j in range(w+1):
if j == 0 and tar_row[j] == ".":
sw.append(j)
elif tar_row[j] == "." and tar_row[j-1] == "#":
sw.append(j)
elif tar_row[j] == "#" and tar_row[j-1] == ".":
sw.append(j)
for j in range(0,len(sw),2):
l = sw[j]
r = sw[j+1]
for k in range(l, r):
grid_num1[i][k] += r-l
for i in range(w):
sw = []
tar_row = grid_t[i]
for j in range(h+1):
if j == 0 and tar_row[j] == ".":
sw.append(j)
elif tar_row[j] == "." and tar_row[j-1] == "#":
sw.append(j)
elif tar_row[j] == "#" and tar_row[j-1] == ".":
sw.append(j)
for j in range(0,len(sw),2):
l = sw[j]
r = sw[j+1]
for k in range(l, r):
grid_num2[i][k] += r-l
# grid_num2 = [list(x) for x in zip(*grid_num2)]
ans = 0
for i in range(h):
for j in range(w):
ans = max(ans, grid_num1[i][j] + grid_num2[j][i]-1)
print(ans)
| 54 | 54 | 1,406 | 1,408 | h, w = list(map(int, input().split()))
grid = []
grid_num1 = []
grid_num2 = []
for i in range(h):
lst = list(eval(input()))
lst.append("#")
grid.append(lst)
grid_num1.append([0] * w)
grid.append(["#"] * (w + 1))
for j in range(w):
grid_num2.append([0] * h)
grid_t = [list(x) for x in zip(*grid)]
for i in range(h):
sw = []
tar_row = grid[i]
for j in range(w + 1):
if j == 0 and tar_row[j] == ".":
sw.append(j)
elif tar_row[j] == "." and tar_row[j - 1] == "#":
sw.append(j)
elif tar_row[j] == "#" and tar_row[j - 1] == ".":
sw.append(j)
for j in range(0, len(sw), 2):
l = sw[j]
r = sw[j + 1]
for k in range(l, r):
grid_num1[i][k] += r - l
for i in range(w):
sw = []
tar_row = grid_t[i]
for j in range(h + 1):
if j == 0 and tar_row[j] == ".":
sw.append(j)
elif tar_row[j] == "." and tar_row[j - 1] == "#":
sw.append(j)
elif tar_row[j] == "#" and tar_row[j - 1] == ".":
sw.append(j)
for j in range(0, len(sw), 2):
l = sw[j]
r = sw[j + 1]
for k in range(l, r):
grid_num2[i][k] += r - l
grid_num2 = [list(x) for x in zip(*grid_num2)]
ans = 0
for i in range(h):
for j in range(w):
ans = max(ans, grid_num1[i][j] + grid_num2[i][j] - 1)
print(ans)
| h, w = list(map(int, input().split()))
grid = []
grid_num1 = []
grid_num2 = []
for i in range(h):
lst = list(eval(input()))
lst.append("#")
grid.append(lst)
grid_num1.append([0] * w)
grid.append(["#"] * (w + 1))
for j in range(w):
grid_num2.append([0] * h)
grid_t = [list(x) for x in zip(*grid)]
for i in range(h):
sw = []
tar_row = grid[i]
for j in range(w + 1):
if j == 0 and tar_row[j] == ".":
sw.append(j)
elif tar_row[j] == "." and tar_row[j - 1] == "#":
sw.append(j)
elif tar_row[j] == "#" and tar_row[j - 1] == ".":
sw.append(j)
for j in range(0, len(sw), 2):
l = sw[j]
r = sw[j + 1]
for k in range(l, r):
grid_num1[i][k] += r - l
for i in range(w):
sw = []
tar_row = grid_t[i]
for j in range(h + 1):
if j == 0 and tar_row[j] == ".":
sw.append(j)
elif tar_row[j] == "." and tar_row[j - 1] == "#":
sw.append(j)
elif tar_row[j] == "#" and tar_row[j - 1] == ".":
sw.append(j)
for j in range(0, len(sw), 2):
l = sw[j]
r = sw[j + 1]
for k in range(l, r):
grid_num2[i][k] += r - l
# grid_num2 = [list(x) for x in zip(*grid_num2)]
ans = 0
for i in range(h):
for j in range(w):
ans = max(ans, grid_num1[i][j] + grid_num2[j][i] - 1)
print(ans)
| false | 0 | [
"-grid_num2 = [list(x) for x in zip(*grid_num2)]",
"+# grid_num2 = [list(x) for x in zip(*grid_num2)]",
"- ans = max(ans, grid_num1[i][j] + grid_num2[i][j] - 1)",
"+ ans = max(ans, grid_num1[i][j] + grid_num2[j][i] - 1)"
] | false | 0.044201 | 0.099165 | 0.445738 | [
"s038790294",
"s244431520"
] |
u562935282 | p03946 | python | s087645927 | s339986470 | 177 | 77 | 25,252 | 14,680 | Accepted | Accepted | 56.5 | n, t = list(map(int, input().split()))
a = list(map(int, input().split()))
vm = a[n - 1]#数列を右から見た時の最大値
d = dict()
for i in range(n - 2, -1, -1):
if a[i] > vm:
vm = a[i]
else:
df = vm - a[i]
d[df] = d.get(df, 0) + 1
df_cnt = sorted(list(d.items()), key = lambda x:x[0], reverse = True)#差が大きい方から並べる
print((df_cnt[0][1])) | n, t = list(map(int, input().split()))
a = list(map(int, input().split()))
vm = a[n - 1]#数列を右から見た時の最大値
dfm = 0
cnt = 0
for i in range(n - 2, -1, -1):
if a[i] > vm:
vm = a[i]
else:
df = vm - a[i]
if dfm < df:
dfm = df
cnt = 1
elif dfm == df:
cnt += 1
print(cnt) | 15 | 18 | 353 | 349 | n, t = list(map(int, input().split()))
a = list(map(int, input().split()))
vm = a[n - 1] # 数列を右から見た時の最大値
d = dict()
for i in range(n - 2, -1, -1):
if a[i] > vm:
vm = a[i]
else:
df = vm - a[i]
d[df] = d.get(df, 0) + 1
df_cnt = sorted(list(d.items()), key=lambda x: x[0], reverse=True) # 差が大きい方から並べる
print((df_cnt[0][1]))
| n, t = list(map(int, input().split()))
a = list(map(int, input().split()))
vm = a[n - 1] # 数列を右から見た時の最大値
dfm = 0
cnt = 0
for i in range(n - 2, -1, -1):
if a[i] > vm:
vm = a[i]
else:
df = vm - a[i]
if dfm < df:
dfm = df
cnt = 1
elif dfm == df:
cnt += 1
print(cnt)
| false | 16.666667 | [
"-d = dict()",
"+dfm = 0",
"+cnt = 0",
"- d[df] = d.get(df, 0) + 1",
"-df_cnt = sorted(list(d.items()), key=lambda x: x[0], reverse=True) # 差が大きい方から並べる",
"-print((df_cnt[0][1]))",
"+ if dfm < df:",
"+ dfm = df",
"+ cnt = 1",
"+ elif dfm == df:",
"+ ... | false | 0.079492 | 0.081682 | 0.973184 | [
"s087645927",
"s339986470"
] |
u623349537 | p03035 | python | s041697690 | s324116961 | 19 | 17 | 3,060 | 2,940 | Accepted | Accepted | 10.53 | A, B = list(map(int, input().split()))
if A >= 13:
print(B)
elif A >= 6:
print((B // 2))
else:
print((0)) | A, B = list(map(int, input().split()))
if A <= 5:
print((0))
elif A > 12:
print(B)
else:
print((B // 2)) | 7 | 7 | 113 | 112 | A, B = list(map(int, input().split()))
if A >= 13:
print(B)
elif A >= 6:
print((B // 2))
else:
print((0))
| A, B = list(map(int, input().split()))
if A <= 5:
print((0))
elif A > 12:
print(B)
else:
print((B // 2))
| false | 0 | [
"-if A >= 13:",
"+if A <= 5:",
"+ print((0))",
"+elif A > 12:",
"-elif A >= 6:",
"+else:",
"-else:",
"- print((0))"
] | false | 0.043058 | 0.044478 | 0.968087 | [
"s041697690",
"s324116961"
] |
u780962115 | p02763 | python | s681862221 | s177905099 | 1,234 | 1,068 | 604,896 | 392,196 | Accepted | Accepted | 13.45 | class SegTree():
def __init__(self, lists, function, basement):
self.n = len(lists)
self.K = (self.n-1).bit_length()
self.f = function
self.b = basement
self.seg = [basement]*2**(self.K+1)
self.lazy_seg = [basement]*2**(self.K+1)
X = 2**self.K
for i, v in enumerate(lists):
self.seg[i+X-1] = v
for i in range(2*X-2, 0, -2):
self.seg[(i-1) >> 1] = self.f(self.seg[i], self.seg[i-1])
def update(self, k, value):
# 0-indexでa[k]の値をvalueに変更
X = 2**self.K
k += X-1
self.seg[k] = value
while k:
k = (k-1) >> 1
self.seg[k] = self.f(self.seg[(k << 1)+1], self.seg[(k << 1)+2])
def query(self, L, R):
# 0-index で[L,R)
num = 2**self.K-1
L += num
R += num
vL = self.b
vR = self.b
while L < R:
if L & 1 == 0:
vL = self.f(vL, self.seg[L])
L += 1
if R & 1 == 0:
R -= 1
vR = self.f(self.seg[R], vR)
L >>= 1
R >>= 1
return self.f(vL, vR)
import sys
input=sys.stdin.readline
N=int(eval(input()))
S=list(eval(input()))
Q=int(eval(input()))
que=[tuple(input().split()) for i in range(Q)]
alpha="abcdefghijklmnopqrstuvwxyz"
Data={alpha[i]:[0]*N for i in range(26)}
for i in range(N):
Data[S[i]][i]+=1
SEG={alpha[i]:SegTree(Data[alpha[i]],max,0) for i in range(26)}
for X,u,v in que:
if X=="1":
u=int(u)-1
NOW=S[u]
S[u]=v
SEG[NOW].update(u,0)
SEG[v].update(u,1)
else:
u,v=int(u)-1,int(v)-1
res=0
for j in range(26):
res+=SEG[alpha[j]].query(u,v+1)
print(res)
| import sys
class SegTree():
def __init__(self, lists, function, basement):
self.n = len(lists)
self.K = (self.n-1).bit_length()
self.f = function
self.b = basement
self.seg = [basement]*2**(self.K+1)
X = 2**self.K
for i, v in enumerate(lists):
self.seg[i+X-1] = v
for i in range(2*X-2, 0, -2):
self.seg[(i-1) >> 1] = self.f(self.seg[i], self.seg[i-1])
def update(self, k, value):
X = 2**self.K
k += X-1
self.seg[k] = value
while k:
k = (k-1) >> 1
self.seg[k] = self.f(self.seg[(k << 1)+1], self.seg[(k << 1)+2])
def query(self, L, R):
num = 2**self.K-1
L += num
R += num
vL = self.b
vR = self.b
while L < R:
if L & 1 == 0:
vL = self.f(vL, self.seg[L])
L += 1
if R & 1 == 0:
R -= 1
vR = self.f(self.seg[R], vR)
L >>= 1
R >>= 1
return self.f(vL, vR)
input = sys.stdin.readline
def main():
N = int(eval(input()))
S = list(eval(input()))
Q = int(eval(input()))
que = [tuple(input().split()) for i in range(Q)]
alpha = "abcdefghijklmnopqrstuvwxyz"
Data = {alpha[i]: [0]*N for i in range(26)}
for i in range(N):
Data[S[i]][i] += 1
SEG = {alpha[i]: SegTree(Data[alpha[i]], max, 0) for i in range(26)}
for X, u, v in que:
if X == "1":
u = int(u)-1
NOW = S[u]
S[u] = v
SEG[NOW].update(u, 0)
SEG[v].update(u, 1)
else:
u, v = int(u)-1, int(v)-1
res = 0
for j in range(26):
res += SEG[alpha[j]].query(u, v+1)
print(res)
if __name__ == "__main__":
main() | 71 | 73 | 1,870 | 1,918 | class SegTree:
def __init__(self, lists, function, basement):
self.n = len(lists)
self.K = (self.n - 1).bit_length()
self.f = function
self.b = basement
self.seg = [basement] * 2 ** (self.K + 1)
self.lazy_seg = [basement] * 2 ** (self.K + 1)
X = 2**self.K
for i, v in enumerate(lists):
self.seg[i + X - 1] = v
for i in range(2 * X - 2, 0, -2):
self.seg[(i - 1) >> 1] = self.f(self.seg[i], self.seg[i - 1])
def update(self, k, value):
# 0-indexでa[k]の値をvalueに変更
X = 2**self.K
k += X - 1
self.seg[k] = value
while k:
k = (k - 1) >> 1
self.seg[k] = self.f(self.seg[(k << 1) + 1], self.seg[(k << 1) + 2])
def query(self, L, R):
# 0-index で[L,R)
num = 2**self.K - 1
L += num
R += num
vL = self.b
vR = self.b
while L < R:
if L & 1 == 0:
vL = self.f(vL, self.seg[L])
L += 1
if R & 1 == 0:
R -= 1
vR = self.f(self.seg[R], vR)
L >>= 1
R >>= 1
return self.f(vL, vR)
import sys
input = sys.stdin.readline
N = int(eval(input()))
S = list(eval(input()))
Q = int(eval(input()))
que = [tuple(input().split()) for i in range(Q)]
alpha = "abcdefghijklmnopqrstuvwxyz"
Data = {alpha[i]: [0] * N for i in range(26)}
for i in range(N):
Data[S[i]][i] += 1
SEG = {alpha[i]: SegTree(Data[alpha[i]], max, 0) for i in range(26)}
for X, u, v in que:
if X == "1":
u = int(u) - 1
NOW = S[u]
S[u] = v
SEG[NOW].update(u, 0)
SEG[v].update(u, 1)
else:
u, v = int(u) - 1, int(v) - 1
res = 0
for j in range(26):
res += SEG[alpha[j]].query(u, v + 1)
print(res)
| import sys
class SegTree:
def __init__(self, lists, function, basement):
self.n = len(lists)
self.K = (self.n - 1).bit_length()
self.f = function
self.b = basement
self.seg = [basement] * 2 ** (self.K + 1)
X = 2**self.K
for i, v in enumerate(lists):
self.seg[i + X - 1] = v
for i in range(2 * X - 2, 0, -2):
self.seg[(i - 1) >> 1] = self.f(self.seg[i], self.seg[i - 1])
def update(self, k, value):
X = 2**self.K
k += X - 1
self.seg[k] = value
while k:
k = (k - 1) >> 1
self.seg[k] = self.f(self.seg[(k << 1) + 1], self.seg[(k << 1) + 2])
def query(self, L, R):
num = 2**self.K - 1
L += num
R += num
vL = self.b
vR = self.b
while L < R:
if L & 1 == 0:
vL = self.f(vL, self.seg[L])
L += 1
if R & 1 == 0:
R -= 1
vR = self.f(self.seg[R], vR)
L >>= 1
R >>= 1
return self.f(vL, vR)
input = sys.stdin.readline
def main():
N = int(eval(input()))
S = list(eval(input()))
Q = int(eval(input()))
que = [tuple(input().split()) for i in range(Q)]
alpha = "abcdefghijklmnopqrstuvwxyz"
Data = {alpha[i]: [0] * N for i in range(26)}
for i in range(N):
Data[S[i]][i] += 1
SEG = {alpha[i]: SegTree(Data[alpha[i]], max, 0) for i in range(26)}
for X, u, v in que:
if X == "1":
u = int(u) - 1
NOW = S[u]
S[u] = v
SEG[NOW].update(u, 0)
SEG[v].update(u, 1)
else:
u, v = int(u) - 1, int(v) - 1
res = 0
for j in range(26):
res += SEG[alpha[j]].query(u, v + 1)
print(res)
if __name__ == "__main__":
main()
| false | 2.739726 | [
"+import sys",
"+",
"+",
"- self.lazy_seg = [basement] * 2 ** (self.K + 1)",
"- # 0-indexでa[k]の値をvalueに変更",
"- # 0-index で[L,R)",
"-import sys",
"+input = sys.stdin.readline",
"-input = sys.stdin.readline",
"-N = int(eval(input()))",
"-S = list(eval(input()))",
"-Q = int(e... | false | 0.047919 | 0.040688 | 1.177714 | [
"s681862221",
"s177905099"
] |
u780565479 | p03085 | python | s126049719 | s512561145 | 178 | 19 | 38,256 | 2,940 | Accepted | Accepted | 89.33 | print((*["A" if x=="T" else "T" if x=="A" else "C" if x=="G" else "G" for x in str(eval(input()))])) | print(({"A":"T","T":"A","G":"C","C":"G"}[eval(input())])) | 1 | 1 | 92 | 49 | print(
(
*[
"A" if x == "T" else "T" if x == "A" else "C" if x == "G" else "G"
for x in str(eval(input()))
]
)
)
| print(({"A": "T", "T": "A", "G": "C", "C": "G"}[eval(input())]))
| false | 0 | [
"-print(",
"- (",
"- *[",
"- \"A\" if x == \"T\" else \"T\" if x == \"A\" else \"C\" if x == \"G\" else \"G\"",
"- for x in str(eval(input()))",
"- ]",
"- )",
"-)",
"+print(({\"A\": \"T\", \"T\": \"A\", \"G\": \"C\", \"C\": \"G\"}[eval(input())]))"
] | false | 0.125409 | 0.040208 | 3.118996 | [
"s126049719",
"s512561145"
] |
u761320129 | p03657 | python | s717396757 | s067694366 | 20 | 17 | 3,316 | 2,940 | Accepted | Accepted | 15 | A,B = list(map(int, input().split()))
if A%3 == 0 or B%3==0 or (A+B)%3 ==0:
print('Possible')
else:
print('Impossible')
| A,B = list(map(int,input().split()))
print(('Possible' if A%3==0 or B%3==0 or (A+B)%3==0 else 'Impossible')) | 5 | 2 | 126 | 101 | A, B = list(map(int, input().split()))
if A % 3 == 0 or B % 3 == 0 or (A + B) % 3 == 0:
print("Possible")
else:
print("Impossible")
| A, B = list(map(int, input().split()))
print(("Possible" if A % 3 == 0 or B % 3 == 0 or (A + B) % 3 == 0 else "Impossible"))
| false | 60 | [
"-if A % 3 == 0 or B % 3 == 0 or (A + B) % 3 == 0:",
"- print(\"Possible\")",
"-else:",
"- print(\"Impossible\")",
"+print((\"Possible\" if A % 3 == 0 or B % 3 == 0 or (A + B) % 3 == 0 else \"Impossible\"))"
] | false | 0.048185 | 0.047613 | 1.011999 | [
"s717396757",
"s067694366"
] |
u948524308 | p02939 | python | s448936022 | s179019664 | 154 | 110 | 3,500 | 4,840 | Accepted | Accepted | 28.57 | S = eval(input())
S0 = S[-1]
i = -1
j = 0
ans = 1
while i > -len(S) + 1:
if S0 != S[i - (j + 1):i]:
S0 = S[i - (j + 1):i]
ans = ans + 1
i = i - (1 + j)
j = 0
else:
j = j + 1
if i == -len(S) + 1 and S[-len(S)] != S0:
ans = ans + 1
print(ans) | S = list(eval(input()))
temp1 = S[0]
temp2 = ""
i = 1
c = 1
while i < len(S):
temp2 += S[i]
if temp1 != temp2:
c += 1
temp1 = temp2
temp2 = ""
i += 1
print(c)
| 19 | 15 | 307 | 205 | S = eval(input())
S0 = S[-1]
i = -1
j = 0
ans = 1
while i > -len(S) + 1:
if S0 != S[i - (j + 1) : i]:
S0 = S[i - (j + 1) : i]
ans = ans + 1
i = i - (1 + j)
j = 0
else:
j = j + 1
if i == -len(S) + 1 and S[-len(S)] != S0:
ans = ans + 1
print(ans)
| S = list(eval(input()))
temp1 = S[0]
temp2 = ""
i = 1
c = 1
while i < len(S):
temp2 += S[i]
if temp1 != temp2:
c += 1
temp1 = temp2
temp2 = ""
i += 1
print(c)
| false | 21.052632 | [
"-S = eval(input())",
"-S0 = S[-1]",
"-i = -1",
"-j = 0",
"-ans = 1",
"-while i > -len(S) + 1:",
"- if S0 != S[i - (j + 1) : i]:",
"- S0 = S[i - (j + 1) : i]",
"- ans = ans + 1",
"- i = i - (1 + j)",
"- j = 0",
"- else:",
"- j = j + 1",
"-if i == -l... | false | 0.077691 | 0.076068 | 1.021342 | [
"s448936022",
"s179019664"
] |
u806976856 | p02982 | python | s837718617 | s300720548 | 19 | 17 | 3,316 | 3,060 | Accepted | Accepted | 10.53 | n,d=list(map(int,input().split()))
X=[]
for _ in range(n):
X.append(list(map(int,input().split())))
f=0
for i in range(n-1):
for j in range(i+1,n):
l=0
for a in range(d):
l+=(X[i][a]-X[j][a])**2
if int(l**(1/2))==l**(1/2):
f+=1
print(f) | n,d=list(map(int,input().split()))
X=[list(map(int,input().split())) for _ in range(n)]
f=0
for i in range(n-1):
for j in range(i+1,n):
l=0
for a in range(d):
l+=(X[i][a]-X[j][a])**2
if int(l**(1/2))==l**(1/2):
f+=1
print(f) | 14 | 11 | 276 | 256 | n, d = list(map(int, input().split()))
X = []
for _ in range(n):
X.append(list(map(int, input().split())))
f = 0
for i in range(n - 1):
for j in range(i + 1, n):
l = 0
for a in range(d):
l += (X[i][a] - X[j][a]) ** 2
if int(l ** (1 / 2)) == l ** (1 / 2):
f += 1
print(f)
| n, d = list(map(int, input().split()))
X = [list(map(int, input().split())) for _ in range(n)]
f = 0
for i in range(n - 1):
for j in range(i + 1, n):
l = 0
for a in range(d):
l += (X[i][a] - X[j][a]) ** 2
if int(l ** (1 / 2)) == l ** (1 / 2):
f += 1
print(f)
| false | 21.428571 | [
"-X = []",
"-for _ in range(n):",
"- X.append(list(map(int, input().split())))",
"+X = [list(map(int, input().split())) for _ in range(n)]"
] | false | 0.048738 | 0.067802 | 0.718825 | [
"s837718617",
"s300720548"
] |
u503228842 | p03043 | python | s269823676 | s200127162 | 43 | 28 | 7,064 | 3,864 | Accepted | Accepted | 34.88 | N, K = list(map(int,input().split()))
from math import ceil, log2
m_list = [ceil(log2(K/(n+1))) if n+1<K else 0 for n in range(N)]
#print(m_list) #各nに対し勝つのに必要な表の数
#
# m_list = []
# for n in range(N):
# if n+1 >=
def calc_prob(x):
return (1/2)**x
prob_list = list(map(calc_prob,m_list))
# Kより大きいインデックスのところは1に書き換え
#print(prob_list)
print((sum(prob_list)/N)) | N, K = list(map(int,input().split()))
from math import ceil, log2
m_list = [(1/2)**ceil(log2(K/(n+1))) if n+1<K else 1 for n in range(N)]
#print(m_list) #各nに対し勝つのに必要な表の数
print((sum(m_list)/N)) | 18 | 5 | 376 | 188 | N, K = list(map(int, input().split()))
from math import ceil, log2
m_list = [ceil(log2(K / (n + 1))) if n + 1 < K else 0 for n in range(N)]
# print(m_list) #各nに対し勝つのに必要な表の数
#
# m_list = []
# for n in range(N):
# if n+1 >=
def calc_prob(x):
return (1 / 2) ** x
prob_list = list(map(calc_prob, m_list))
# Kより大きいインデックスのところは1に書き換え
# print(prob_list)
print((sum(prob_list) / N))
| N, K = list(map(int, input().split()))
from math import ceil, log2
m_list = [(1 / 2) ** ceil(log2(K / (n + 1))) if n + 1 < K else 1 for n in range(N)]
# print(m_list) #各nに対し勝つのに必要な表の数
print((sum(m_list) / N))
| false | 72.222222 | [
"-m_list = [ceil(log2(K / (n + 1))) if n + 1 < K else 0 for n in range(N)]",
"+m_list = [(1 / 2) ** ceil(log2(K / (n + 1))) if n + 1 < K else 1 for n in range(N)]",
"-#",
"-# m_list = []",
"-# for n in range(N):",
"-# if n+1 >=",
"-def calc_prob(x):",
"- return (1 / 2) ** x",
"-",
"-",
"-... | false | 0.1851 | 0.05564 | 3.326734 | [
"s269823676",
"s200127162"
] |
u864202285 | p02727 | python | s234978414 | s999644765 | 322 | 274 | 21,552 | 23,008 | Accepted | Accepted | 14.91 | X, Y, A, B, C = list(map(int, input().split()))
p = sorted(list(map(int,input().split())), reverse=True)[:X]
q = sorted(list(map(int,input().split())), reverse=True)[:Y]
r = sorted(list(map(int,input().split())), reverse=True)
colored_p = []
colored_q = []
for i in r:
p_min = p[len(p) - 1] if len(p) > 0 else colored_p[len(colored_p) - 1]
q_min = q[len(q) - 1] if len(q) > 0 else colored_q[len(colored_q) - 1]
if p_min > i and q_min > i:
break
p_min_diff = i - p_min
q_min_diff = i - q_min
if p_min_diff >= q_min_diff and p_min_diff > 0:
if len(p) > 0:
p.pop()
colored_p.append(i)
elif q_min_diff >= p_min_diff and q_min_diff > 0:
if len(q) > 0:
q.pop()
colored_q.append(i)
print((sum(p) + sum(q) + sum(colored_p) + sum(colored_q))) | from collections import deque
X, Y, A, B, C = list(map(int, input().split()))
p = deque(sorted(list(map(int,input().split())))[-X:])
q = deque(sorted(list(map(int,input().split())))[-Y:])
r = sorted(list(map(int,input().split())), reverse=True)
for i in r:
p_min = p[0]
q_min = q[0]
if p_min > i and q_min > i:
break
p_min_diff = i - p_min
q_min_diff = i - q_min
if p_min_diff >= q_min_diff and p_min_diff > 0:
p.popleft()
p.append(i)
elif q_min_diff >= p_min_diff and q_min_diff > 0:
q.popleft()
q.append(i)
print((sum(p) + sum(q))) | 29 | 26 | 859 | 631 | X, Y, A, B, C = list(map(int, input().split()))
p = sorted(list(map(int, input().split())), reverse=True)[:X]
q = sorted(list(map(int, input().split())), reverse=True)[:Y]
r = sorted(list(map(int, input().split())), reverse=True)
colored_p = []
colored_q = []
for i in r:
p_min = p[len(p) - 1] if len(p) > 0 else colored_p[len(colored_p) - 1]
q_min = q[len(q) - 1] if len(q) > 0 else colored_q[len(colored_q) - 1]
if p_min > i and q_min > i:
break
p_min_diff = i - p_min
q_min_diff = i - q_min
if p_min_diff >= q_min_diff and p_min_diff > 0:
if len(p) > 0:
p.pop()
colored_p.append(i)
elif q_min_diff >= p_min_diff and q_min_diff > 0:
if len(q) > 0:
q.pop()
colored_q.append(i)
print((sum(p) + sum(q) + sum(colored_p) + sum(colored_q)))
| from collections import deque
X, Y, A, B, C = list(map(int, input().split()))
p = deque(sorted(list(map(int, input().split())))[-X:])
q = deque(sorted(list(map(int, input().split())))[-Y:])
r = sorted(list(map(int, input().split())), reverse=True)
for i in r:
p_min = p[0]
q_min = q[0]
if p_min > i and q_min > i:
break
p_min_diff = i - p_min
q_min_diff = i - q_min
if p_min_diff >= q_min_diff and p_min_diff > 0:
p.popleft()
p.append(i)
elif q_min_diff >= p_min_diff and q_min_diff > 0:
q.popleft()
q.append(i)
print((sum(p) + sum(q)))
| false | 10.344828 | [
"+from collections import deque",
"+",
"-p = sorted(list(map(int, input().split())), reverse=True)[:X]",
"-q = sorted(list(map(int, input().split())), reverse=True)[:Y]",
"+p = deque(sorted(list(map(int, input().split())))[-X:])",
"+q = deque(sorted(list(map(int, input().split())))[-Y:])",
"-colored_p =... | false | 0.078191 | 0.084817 | 0.921885 | [
"s234978414",
"s999644765"
] |
u022407960 | p02303 | python | s495201612 | s644194659 | 2,660 | 2,370 | 23,592 | 23,480 | Accepted | Accepted | 10.9 | #!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
input:
3
0.0 0.0
2.0 0.0
1.0 1.0
output:
1.41421356237
"""
import math
import sys
from operator import attrgetter
class ClosestPair(object):
def __init__(self, ):
"""
Init closest pairs points set.
"""
_input = sys.stdin.readlines()
p_num = int(_input[0])
points = [x.split() for x in _input[1:]]
p_list = [complex(float(x), float(y)) for x, y in points]
p_list.sort(key=attrgetter('real'))
# assert len(p_list) == p_num
# print(p_list)
ans = self.closest_pair(array=p_list, array_length=p_num)
print(('{:.6f}'.format(ans)))
def closest_pair(self, array, array_length):
if array_length <= 1:
return float('inf')
mid = array_length // 2
mid_real = array[mid].real
d = min(self.closest_pair(array[:mid], mid).real,
self.closest_pair(array[mid:], array_length - mid).real)
return self.brute_force(array, mid_real, d)
@staticmethod
def brute_force(array, mid_real, d=float('inf')):
array.sort(key=attrgetter('imag'))
min_stack = list()
for ele in array:
size = len(min_stack)
if abs(ele.real - mid_real) >= d:
continue
for j in range(size):
dx = ele.real - min_stack[size - j - 1].real
dy = ele.imag - min_stack[size - j - 1].imag
if dy >= d:
break
d = min(d, math.sqrt(dx ** 2 + dy ** 2))
min_stack.append(ele)
return d
if __name__ == '__main__':
case = ClosestPair() | #!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
input:
3
0.0 0.0
2.0 0.0
1.0 1.0
output:
1.41421356237
"""
import sys
from operator import attrgetter
class ClosestPair(object):
def __init__(self, ):
"""
Init closest pairs points set.
"""
_input = sys.stdin.readlines()
p_num = int(_input[0])
points = [x.split() for x in _input[1:]]
p_list = [complex(float(x), float(y)) for x, y in points]
# pre_sort by axis_X
p_list.sort(key=attrgetter('real'))
ans = self.closest_pair(array=p_list, array_length=p_num)
print(('{:.6f}'.format(ans)))
def closest_pair(self, array, array_length):
if array_length <= 1:
return float('inf')
mid = array_length // 2
mid_real = array[mid].real
d = min(self.closest_pair(array[:mid], mid),
self.closest_pair(array[mid:], array_length - mid))
# sort by axis_Y while recursively solve d
array.sort(key=attrgetter('imag'))
min_stack = list()
for ele in array:
size = len(min_stack)
if abs(ele.real - mid_real) >= d:
continue
for j in range(size):
alt = ele - min_stack[size - j - 1]
if alt.imag >= d:
break
d = min(d, abs(alt))
min_stack.append(ele)
return d
if __name__ == '__main__':
case = ClosestPair() | 67 | 64 | 1,762 | 1,549 | #!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
input:
3
0.0 0.0
2.0 0.0
1.0 1.0
output:
1.41421356237
"""
import math
import sys
from operator import attrgetter
class ClosestPair(object):
def __init__(
self,
):
"""
Init closest pairs points set.
"""
_input = sys.stdin.readlines()
p_num = int(_input[0])
points = [x.split() for x in _input[1:]]
p_list = [complex(float(x), float(y)) for x, y in points]
p_list.sort(key=attrgetter("real"))
# assert len(p_list) == p_num
# print(p_list)
ans = self.closest_pair(array=p_list, array_length=p_num)
print(("{:.6f}".format(ans)))
def closest_pair(self, array, array_length):
if array_length <= 1:
return float("inf")
mid = array_length // 2
mid_real = array[mid].real
d = min(
self.closest_pair(array[:mid], mid).real,
self.closest_pair(array[mid:], array_length - mid).real,
)
return self.brute_force(array, mid_real, d)
@staticmethod
def brute_force(array, mid_real, d=float("inf")):
array.sort(key=attrgetter("imag"))
min_stack = list()
for ele in array:
size = len(min_stack)
if abs(ele.real - mid_real) >= d:
continue
for j in range(size):
dx = ele.real - min_stack[size - j - 1].real
dy = ele.imag - min_stack[size - j - 1].imag
if dy >= d:
break
d = min(d, math.sqrt(dx**2 + dy**2))
min_stack.append(ele)
return d
if __name__ == "__main__":
case = ClosestPair()
| #!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
input:
3
0.0 0.0
2.0 0.0
1.0 1.0
output:
1.41421356237
"""
import sys
from operator import attrgetter
class ClosestPair(object):
def __init__(
self,
):
"""
Init closest pairs points set.
"""
_input = sys.stdin.readlines()
p_num = int(_input[0])
points = [x.split() for x in _input[1:]]
p_list = [complex(float(x), float(y)) for x, y in points]
# pre_sort by axis_X
p_list.sort(key=attrgetter("real"))
ans = self.closest_pair(array=p_list, array_length=p_num)
print(("{:.6f}".format(ans)))
def closest_pair(self, array, array_length):
if array_length <= 1:
return float("inf")
mid = array_length // 2
mid_real = array[mid].real
d = min(
self.closest_pair(array[:mid], mid),
self.closest_pair(array[mid:], array_length - mid),
)
# sort by axis_Y while recursively solve d
array.sort(key=attrgetter("imag"))
min_stack = list()
for ele in array:
size = len(min_stack)
if abs(ele.real - mid_real) >= d:
continue
for j in range(size):
alt = ele - min_stack[size - j - 1]
if alt.imag >= d:
break
d = min(d, abs(alt))
min_stack.append(ele)
return d
if __name__ == "__main__":
case = ClosestPair()
| false | 4.477612 | [
"-import math",
"+ # pre_sort by axis_X",
"- # assert len(p_list) == p_num",
"- # print(p_list)",
"- self.closest_pair(array[:mid], mid).real,",
"- self.closest_pair(array[mid:], array_length - mid).real,",
"+ self.closest_pair(array[:mid], mid),",
... | false | 0.046984 | 0.043697 | 1.075237 | [
"s495201612",
"s644194659"
] |
u089230684 | p02607 | python | s861308800 | s832386863 | 61 | 32 | 61,736 | 9,136 | Accepted | Accepted | 47.54 | n = int(eval(input()))
S = list(map(int, input().split()))
ans = 0
for i in range(0, n, 2):
if i%2 == 0 and S[i]%2 == 1:
ans += 1
print(ans)
| n = eval(input())
N = int(n)
list1 = input().split(" ")
Numbers = list1[:N]
count = 0
for i in range(0, N):
if (i+1) % 2 != 0:
if int(Numbers[i]) % 2 != 0:
count += 1
else:
continue
print(count)
| 7 | 14 | 153 | 240 | n = int(eval(input()))
S = list(map(int, input().split()))
ans = 0
for i in range(0, n, 2):
if i % 2 == 0 and S[i] % 2 == 1:
ans += 1
print(ans)
| n = eval(input())
N = int(n)
list1 = input().split(" ")
Numbers = list1[:N]
count = 0
for i in range(0, N):
if (i + 1) % 2 != 0:
if int(Numbers[i]) % 2 != 0:
count += 1
else:
continue
print(count)
| false | 50 | [
"-n = int(eval(input()))",
"-S = list(map(int, input().split()))",
"-ans = 0",
"-for i in range(0, n, 2):",
"- if i % 2 == 0 and S[i] % 2 == 1:",
"- ans += 1",
"-print(ans)",
"+n = eval(input())",
"+N = int(n)",
"+list1 = input().split(\" \")",
"+Numbers = list1[:N]",
"+count = 0",
... | false | 0.043636 | 0.03757 | 1.161448 | [
"s861308800",
"s832386863"
] |
u546285759 | p00423 | python | s648465711 | s156994982 | 120 | 110 | 7,688 | 7,576 | Accepted | Accepted | 8.33 | fin_a = []
fin_b = []
while True:
x = int(eval(input()))
if x == 0:
break
a = 0
b = 0
for i in range(x):
l = list(map(int, input().split()))
if l[0] > l[1]:
a += l[0] + l[1]
elif l[0] < l[1]:
b += l[0] + l[1]
else:
a += l[0]
b += l[1]
fin_a.append(a)
fin_b.append(b)
for x, y in zip(fin_a, fin_b):
print((x, y)) | while True:
n = int(eval(input()))
score = [0, 0]
if n == 0:
break
for _ in range(n):
A, B = list(map(int, input().split()))
if A == B:
score[0], score[1] = score[0]+A, score[1]+B
else:
score[A<B] += A+B
print((*score)) | 22 | 12 | 449 | 292 | fin_a = []
fin_b = []
while True:
x = int(eval(input()))
if x == 0:
break
a = 0
b = 0
for i in range(x):
l = list(map(int, input().split()))
if l[0] > l[1]:
a += l[0] + l[1]
elif l[0] < l[1]:
b += l[0] + l[1]
else:
a += l[0]
b += l[1]
fin_a.append(a)
fin_b.append(b)
for x, y in zip(fin_a, fin_b):
print((x, y))
| while True:
n = int(eval(input()))
score = [0, 0]
if n == 0:
break
for _ in range(n):
A, B = list(map(int, input().split()))
if A == B:
score[0], score[1] = score[0] + A, score[1] + B
else:
score[A < B] += A + B
print((*score))
| false | 45.454545 | [
"-fin_a = []",
"-fin_b = []",
"- x = int(eval(input()))",
"- if x == 0:",
"+ n = int(eval(input()))",
"+ score = [0, 0]",
"+ if n == 0:",
"- a = 0",
"- b = 0",
"- for i in range(x):",
"- l = list(map(int, input().split()))",
"- if l[0] > l[1]:",
"- ... | false | 0.036047 | 0.03638 | 0.990864 | [
"s648465711",
"s156994982"
] |
u729133443 | p02614 | python | s069129460 | s539684030 | 123 | 101 | 9,160 | 9,192 | Accepted | Accepted | 17.89 | h,*c=open(0)
h,w,k=list(map(int,h.split()))
print((sum(k==sum(y//2**w>>z//w&y%2**w>>z%w&1and'.'>c[z//w][z%w]for z in range(h*w))for y in range(1<<h+w)))) | h,*c=open(0)
h,w,k=list(map(int,h.split()))
print((sum(k==sum(y>>w>>z//w&y%2**w>>z%w&1and'.'>c[z//w][z%w]for z in range(h*w))for y in range(1<<h+w)))) | 3 | 3 | 147 | 144 | h, *c = open(0)
h, w, k = list(map(int, h.split()))
print(
(
sum(
k
== sum(
y // 2**w >> z // w & y % 2**w >> z % w & 1
and "." > c[z // w][z % w]
for z in range(h * w)
)
for y in range(1 << h + w)
)
)
)
| h, *c = open(0)
h, w, k = list(map(int, h.split()))
print(
(
sum(
k
== sum(
y >> w >> z // w & y % 2**w >> z % w & 1 and "." > c[z // w][z % w]
for z in range(h * w)
)
for y in range(1 << h + w)
)
)
)
| false | 0 | [
"- y // 2**w >> z // w & y % 2**w >> z % w & 1",
"- and \".\" > c[z // w][z % w]",
"+ y >> w >> z // w & y % 2**w >> z % w & 1 and \".\" > c[z // w][z % w]"
] | false | 0.044915 | 0.044884 | 1.000697 | [
"s069129460",
"s539684030"
] |
u809898133 | p03078 | python | s680288468 | s004217342 | 992 | 723 | 147,948 | 48,092 | Accepted | Accepted | 27.12 | x,y,z,k = list(map(int,input().split()))
a=list(map(int,input().split()))
b=list(map(int,input().split()))
c=list(map(int,input().split()))
tem = []
for i in range(x):
for j in range(y):
tem.append(a[i]+b[j])
tem.sort()
if(x*y > k):
tem2 = tem[x*y-k-1:]
else:
tem2 = tem
ans = []
for i in range(len(tem2)):
for j in range(z):
ans.append(tem2[i]+c[j])
ans.sort()
dd = len(tem2)*z
for i in list(reversed(list(range(dd-k,dd)))):
print((ans[i])) | x,y,z,k = list(map(int,input().split()))
a=list(map(int,input().split()))
b=list(map(int,input().split()))
c=list(map(int,input().split()))
a.sort(reverse=True)
b.sort(reverse=True)
c.sort(reverse=True)
def judge(p):
cnt = 0
for i in range(x):
for j in range(y):
for kk in range(z):
if a[i]+b[j]+c[kk] < p : break
cnt += 1
if (cnt >= k):return True
return False
ll,rr = 0,a[0]+b[0]+c[0]
while(rr- ll > 1):
md = (ll+rr) // 2
if(judge(md)) : ll = md
else : rr = md
ans = []
cnt=0
for i in range(x):
if(cnt >= k):break
for j in range(y):
if(cnt >= k):break
for kk in range(z):
if(cnt >= k):break
if a[i]+b[j]+c[kk] < rr : break
cnt += 1
ans.append(a[i]+b[j]+c[kk])
if len(ans) <k:
for i in range(k-len(ans)):
ans.append(ll)
ans.sort(reverse=True)
for i in ans:
print(i) | 26 | 46 | 493 | 993 | x, y, z, k = list(map(int, input().split()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
c = list(map(int, input().split()))
tem = []
for i in range(x):
for j in range(y):
tem.append(a[i] + b[j])
tem.sort()
if x * y > k:
tem2 = tem[x * y - k - 1 :]
else:
tem2 = tem
ans = []
for i in range(len(tem2)):
for j in range(z):
ans.append(tem2[i] + c[j])
ans.sort()
dd = len(tem2) * z
for i in list(reversed(list(range(dd - k, dd)))):
print((ans[i]))
| x, y, z, k = list(map(int, input().split()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
c = list(map(int, input().split()))
a.sort(reverse=True)
b.sort(reverse=True)
c.sort(reverse=True)
def judge(p):
cnt = 0
for i in range(x):
for j in range(y):
for kk in range(z):
if a[i] + b[j] + c[kk] < p:
break
cnt += 1
if cnt >= k:
return True
return False
ll, rr = 0, a[0] + b[0] + c[0]
while rr - ll > 1:
md = (ll + rr) // 2
if judge(md):
ll = md
else:
rr = md
ans = []
cnt = 0
for i in range(x):
if cnt >= k:
break
for j in range(y):
if cnt >= k:
break
for kk in range(z):
if cnt >= k:
break
if a[i] + b[j] + c[kk] < rr:
break
cnt += 1
ans.append(a[i] + b[j] + c[kk])
if len(ans) < k:
for i in range(k - len(ans)):
ans.append(ll)
ans.sort(reverse=True)
for i in ans:
print(i)
| false | 43.478261 | [
"-tem = []",
"+a.sort(reverse=True)",
"+b.sort(reverse=True)",
"+c.sort(reverse=True)",
"+",
"+",
"+def judge(p):",
"+ cnt = 0",
"+ for i in range(x):",
"+ for j in range(y):",
"+ for kk in range(z):",
"+ if a[i] + b[j] + c[kk] < p:",
"+ ... | false | 0.035021 | 0.035302 | 0.992045 | [
"s680288468",
"s004217342"
] |
u837673618 | p02725 | python | s762748236 | s727596351 | 166 | 84 | 18,672 | 19,140 | Accepted | Accepted | 49.4 | from itertools import chain
K, N = list(map(int, input().split()))
S = 0
M = 0
A = list(map(int, input().split()))
prev = next(A)
for a in chain(A, [prev+K]):
d = a - prev
S += d
M = max(M, d)
prev = a
print((S-M)) | from itertools import *
K, N = list(map(int, input().split()))
A, B = tee(list(map(int, input().split())), 2)
first = next(B)
M = max(b-a for a, b in zip_longest(A, B, fillvalue=first+K))
print((K-M))
| 15 | 8 | 225 | 196 | from itertools import chain
K, N = list(map(int, input().split()))
S = 0
M = 0
A = list(map(int, input().split()))
prev = next(A)
for a in chain(A, [prev + K]):
d = a - prev
S += d
M = max(M, d)
prev = a
print((S - M))
| from itertools import *
K, N = list(map(int, input().split()))
A, B = tee(list(map(int, input().split())), 2)
first = next(B)
M = max(b - a for a, b in zip_longest(A, B, fillvalue=first + K))
print((K - M))
| false | 46.666667 | [
"-from itertools import chain",
"+from itertools import *",
"-S = 0",
"-M = 0",
"-A = list(map(int, input().split()))",
"-prev = next(A)",
"-for a in chain(A, [prev + K]):",
"- d = a - prev",
"- S += d",
"- M = max(M, d)",
"- prev = a",
"-print((S - M))",
"+A, B = tee(list(map(in... | false | 0.035871 | 0.040411 | 0.887649 | [
"s762748236",
"s727596351"
] |
u554096168 | p03127 | python | s927356251 | s468940816 | 193 | 94 | 92,684 | 16,244 | Accepted | Accepted | 51.3 | import sys
import fractions
sys.setrecursionlimit(10**6)
def input(): return sys.stdin.readline().strip()
def INT(): return int(eval(input()))
def LIST(): return [int(x) for x in input().split()]
MOD = 10**9 + 7
N = INT()
A = LIST()
def gcd_all(n):
if len(n) == 1:
return n[0]
tail = n.pop(-1)
return fractions.gcd(tail, gcd_all(n))
print((gcd_all(A)))
| import sys, fractions
sys.setrecursionlimit(5 * 10**5)
input = sys.stdin.readline
N = int(eval(input()))
A = list(map(int, input().split()))
ans = A[0]
for i in range(1, N):
ans = fractions.gcd(ans, A[i])
print(ans)
| 21 | 14 | 391 | 232 | import sys
import fractions
sys.setrecursionlimit(10**6)
def input():
return sys.stdin.readline().strip()
def INT():
return int(eval(input()))
def LIST():
return [int(x) for x in input().split()]
MOD = 10**9 + 7
N = INT()
A = LIST()
def gcd_all(n):
if len(n) == 1:
return n[0]
tail = n.pop(-1)
return fractions.gcd(tail, gcd_all(n))
print((gcd_all(A)))
| import sys, fractions
sys.setrecursionlimit(5 * 10**5)
input = sys.stdin.readline
N = int(eval(input()))
A = list(map(int, input().split()))
ans = A[0]
for i in range(1, N):
ans = fractions.gcd(ans, A[i])
print(ans)
| false | 33.333333 | [
"-import sys",
"-import fractions",
"+import sys, fractions",
"-sys.setrecursionlimit(10**6)",
"-",
"-",
"-def input():",
"- return sys.stdin.readline().strip()",
"-",
"-",
"-def INT():",
"- return int(eval(input()))",
"-",
"-",
"-def LIST():",
"- return [int(x) for x in input... | false | 0.046005 | 0.045048 | 1.021238 | [
"s927356251",
"s468940816"
] |
u254871849 | p02720 | python | s802951701 | s316412687 | 80 | 54 | 9,048 | 6,180 | Accepted | Accepted | 32.5 | import sys
from string import digits
k = int(sys.stdin.readline().rstrip())
def main():
if k <= 9:
print(k)
return
res = list(digits[1:])
r = k - 9
nex = []
while True:
for n in res:
o = ord(n[-1])
for i in range(-1, 2):
d = chr(o + i)
if d < '0' or d > '9': continue
nex.append(n + d)
r -= 1
if not r:
print((nex[-1]))
return
res = nex.copy()
nex.clear()
if __name__ == '__main__':
main() | import sys
k = int(sys.stdin.readline().rstrip())
def main(k):
if k <= 9:
print(k)
return
res = list(range(1, 10))
k -= 9
while True:
nex = []
for n in res:
r = n % 10
n *= 10
for i in range(-1, 2):
if 0 <= r + i <= 9:
nex.append(n + r + i)
k -= 1
if not k:
print((nex[-1]))
return
res = nex.copy()
if __name__ == '__main__':
main(k) | 28 | 26 | 626 | 579 | import sys
from string import digits
k = int(sys.stdin.readline().rstrip())
def main():
if k <= 9:
print(k)
return
res = list(digits[1:])
r = k - 9
nex = []
while True:
for n in res:
o = ord(n[-1])
for i in range(-1, 2):
d = chr(o + i)
if d < "0" or d > "9":
continue
nex.append(n + d)
r -= 1
if not r:
print((nex[-1]))
return
res = nex.copy()
nex.clear()
if __name__ == "__main__":
main()
| import sys
k = int(sys.stdin.readline().rstrip())
def main(k):
if k <= 9:
print(k)
return
res = list(range(1, 10))
k -= 9
while True:
nex = []
for n in res:
r = n % 10
n *= 10
for i in range(-1, 2):
if 0 <= r + i <= 9:
nex.append(n + r + i)
k -= 1
if not k:
print((nex[-1]))
return
res = nex.copy()
if __name__ == "__main__":
main(k)
| false | 7.142857 | [
"-from string import digits",
"-def main():",
"+def main(k):",
"- res = list(digits[1:])",
"- r = k - 9",
"- nex = []",
"+ res = list(range(1, 10))",
"+ k -= 9",
"+ nex = []",
"- o = ord(n[-1])",
"+ r = n % 10",
"+ n *= 10",
"- ... | false | 0.044635 | 0.05054 | 0.883158 | [
"s802951701",
"s316412687"
] |
u140191608 | p02706 | python | s404964837 | s203750386 | 23 | 21 | 10,188 | 10,044 | Accepted | Accepted | 8.7 | N , M = (list(map(int , input().split())))
A = list(map(int , input().split()))
ans = N - sum(A)
if ans < 0:
print((-1))
else:
print(ans) | N , M = (list(map(int , input().split())))
A = list(map(int , input().split()))
a = sum(A)
if (N-a)<0:
print((-1))
else:
print((N-a)) | 7 | 7 | 143 | 133 | N, M = list(map(int, input().split()))
A = list(map(int, input().split()))
ans = N - sum(A)
if ans < 0:
print((-1))
else:
print(ans)
| N, M = list(map(int, input().split()))
A = list(map(int, input().split()))
a = sum(A)
if (N - a) < 0:
print((-1))
else:
print((N - a))
| false | 0 | [
"-ans = N - sum(A)",
"-if ans < 0:",
"+a = sum(A)",
"+if (N - a) < 0:",
"- print(ans)",
"+ print((N - a))"
] | false | 0.038897 | 0.044014 | 0.883746 | [
"s404964837",
"s203750386"
] |
u934442292 | p03032 | python | s932295351 | s079897721 | 44 | 32 | 3,064 | 9,132 | Accepted | Accepted | 27.27 | import sys
input = sys.stdin.readline
def main():
N, K = list(map(int, input().split()))
V = list(map(int, input().split()))
_V = V[::-1]
ans = 0
for k in range(K + 1):
n_pop = min(k, N)
n_push = K - n_pop
for i in range(n_pop + 1):
l, r = i, n_pop - i
L = V[:l] + _V[:r]
L.sort()
for j in range(min(n_pop, n_push)):
if L[j] < 0:
L[j] = 0
else:
break
v = sum(L)
if v > ans:
ans = v
print(ans)
if __name__ == "__main__":
main()
| import sys
input = sys.stdin.readline
def main():
N, K = list(map(int, input().split()))
V = list(map(int, input().split()))
ans = -float("inf")
for t in range(min(N, K) + 1):
s = K - t
for l in range(t + 1):
r = t - l
gem = V[:l]
gem += V[-r:] if r != 0 else []
gem.sort()
value = sum(gem)
for i in range(min(s, t)):
if gem[i] < 0:
value -= gem[i]
else:
break
ans = max(ans, value)
print(ans)
if __name__ == "__main__":
main()
| 32 | 30 | 671 | 654 | import sys
input = sys.stdin.readline
def main():
N, K = list(map(int, input().split()))
V = list(map(int, input().split()))
_V = V[::-1]
ans = 0
for k in range(K + 1):
n_pop = min(k, N)
n_push = K - n_pop
for i in range(n_pop + 1):
l, r = i, n_pop - i
L = V[:l] + _V[:r]
L.sort()
for j in range(min(n_pop, n_push)):
if L[j] < 0:
L[j] = 0
else:
break
v = sum(L)
if v > ans:
ans = v
print(ans)
if __name__ == "__main__":
main()
| import sys
input = sys.stdin.readline
def main():
N, K = list(map(int, input().split()))
V = list(map(int, input().split()))
ans = -float("inf")
for t in range(min(N, K) + 1):
s = K - t
for l in range(t + 1):
r = t - l
gem = V[:l]
gem += V[-r:] if r != 0 else []
gem.sort()
value = sum(gem)
for i in range(min(s, t)):
if gem[i] < 0:
value -= gem[i]
else:
break
ans = max(ans, value)
print(ans)
if __name__ == "__main__":
main()
| false | 6.25 | [
"- _V = V[::-1]",
"- ans = 0",
"- for k in range(K + 1):",
"- n_pop = min(k, N)",
"- n_push = K - n_pop",
"- for i in range(n_pop + 1):",
"- l, r = i, n_pop - i",
"- L = V[:l] + _V[:r]",
"- L.sort()",
"- for j in range(min(n... | false | 0.035692 | 0.034603 | 1.031454 | [
"s932295351",
"s079897721"
] |
u708255304 | p02862 | python | s395271442 | s218598165 | 722 | 257 | 82,464 | 62,320 | Accepted | Accepted | 64.4 | # 階乗は英語でfactrial, ifacは階乗に対する逆元
def cmb(n, k, mod, fac, ifac):
# nCkを求める
k = min(k, n-k)
return fac[n] * ifac[k] * ifac[n-k] % mod
def make_tables(mod, n): # (mod mod)の世界における割り算に従ってテーブルを作る
# 階乗, 階乗に対する逆元のテーブルを作成する
fac = [1, 1] # 階乗デーブル
ifac = [1, 1] # 階乗に対する逆元のテーブル
inverse = [0, 1] # 逆元そのもののテーブル
for i in range(2, n+1):
fac.append((fac[-1] * i) % mod)
inverse.append((-inverse[mod % i] * (mod//i)) % mod)
ifac.append((ifac[-1] * inverse[-1]) % mod)
return fac, ifac
X, Y = list(map(int, input().split()))
MOD = 1000000007
if (X+Y) % 3 != 0:
print((0))
else:
m = (2*X-Y)//3
n = X - 2*m
if n < 0 or m < 0:
print((0))
exit()
fac, ifac = make_tables(MOD, (X+Y)//3)
ans = cmb(n+m, n, MOD, fac, ifac)
print(ans)
| # 二項係数を"やるだけ"にしてくれるライブラリ
from collections import Counter
MAX = 1000010
MOD = 10**9+7
factrial = [0]*MAX
inverse = [0]*MAX
factrial_inverse = [0]*MAX
# テーブルを作る前処理
def COMinit():
global factrial, inverse, factrial_inverse
factrial[0] = 1
factrial[1] = 1
inverse[1] = 1
factrial_inverse[0] = 1
factrial_inverse[1] = 1
for i in range(2, MAX):
factrial[i] = factrial[i-1] * i % MOD
inverse[i] = MOD - inverse[MOD % i] * (MOD//i) % MOD
factrial_inverse[i] = factrial_inverse[i-1] * inverse[i] % MOD
# 二項係数計算
def COM(n, k):
global factrial, inverse, factrial_inverse
if n < k:
return 0
if n < 0 or k < 0:
return 0
return factrial[n] * (factrial_inverse[k] * factrial_inverse[n-k] % MOD) % MOD
# 前処理完了
COMinit()
X, Y = list(map(int, input().split()))
ans = 0
if (X+Y) % 3 != 0:
print((0))
else:
ans = 0
m = (2*X - Y) // 3
n = X - 2*m
if m < 0 or n < 0:
print((0))
else:
print((COM(n+m, n)))
| 33 | 48 | 842 | 1,049 | # 階乗は英語でfactrial, ifacは階乗に対する逆元
def cmb(n, k, mod, fac, ifac):
# nCkを求める
k = min(k, n - k)
return fac[n] * ifac[k] * ifac[n - k] % mod
def make_tables(mod, n): # (mod mod)の世界における割り算に従ってテーブルを作る
# 階乗, 階乗に対する逆元のテーブルを作成する
fac = [1, 1] # 階乗デーブル
ifac = [1, 1] # 階乗に対する逆元のテーブル
inverse = [0, 1] # 逆元そのもののテーブル
for i in range(2, n + 1):
fac.append((fac[-1] * i) % mod)
inverse.append((-inverse[mod % i] * (mod // i)) % mod)
ifac.append((ifac[-1] * inverse[-1]) % mod)
return fac, ifac
X, Y = list(map(int, input().split()))
MOD = 1000000007
if (X + Y) % 3 != 0:
print((0))
else:
m = (2 * X - Y) // 3
n = X - 2 * m
if n < 0 or m < 0:
print((0))
exit()
fac, ifac = make_tables(MOD, (X + Y) // 3)
ans = cmb(n + m, n, MOD, fac, ifac)
print(ans)
| # 二項係数を"やるだけ"にしてくれるライブラリ
from collections import Counter
MAX = 1000010
MOD = 10**9 + 7
factrial = [0] * MAX
inverse = [0] * MAX
factrial_inverse = [0] * MAX
# テーブルを作る前処理
def COMinit():
global factrial, inverse, factrial_inverse
factrial[0] = 1
factrial[1] = 1
inverse[1] = 1
factrial_inverse[0] = 1
factrial_inverse[1] = 1
for i in range(2, MAX):
factrial[i] = factrial[i - 1] * i % MOD
inverse[i] = MOD - inverse[MOD % i] * (MOD // i) % MOD
factrial_inverse[i] = factrial_inverse[i - 1] * inverse[i] % MOD
# 二項係数計算
def COM(n, k):
global factrial, inverse, factrial_inverse
if n < k:
return 0
if n < 0 or k < 0:
return 0
return factrial[n] * (factrial_inverse[k] * factrial_inverse[n - k] % MOD) % MOD
# 前処理完了
COMinit()
X, Y = list(map(int, input().split()))
ans = 0
if (X + Y) % 3 != 0:
print((0))
else:
ans = 0
m = (2 * X - Y) // 3
n = X - 2 * m
if m < 0 or n < 0:
print((0))
else:
print((COM(n + m, n)))
| false | 31.25 | [
"-# 階乗は英語でfactrial, ifacは階乗に対する逆元",
"-def cmb(n, k, mod, fac, ifac):",
"- # nCkを求める",
"- k = min(k, n - k)",
"- return fac[n] * ifac[k] * ifac[n - k] % mod",
"+# 二項係数を\"やるだけ\"にしてくれるライブラリ",
"+from collections import Counter",
"+",
"+MAX = 1000010",
"+MOD = 10**9 + 7",
"+factrial = [0] * ... | false | 0.188779 | 1.974684 | 0.0956 | [
"s395271442",
"s218598165"
] |
u735008991 | p02861 | python | s762687791 | s156944202 | 202 | 170 | 42,588 | 38,896 | Accepted | Accepted | 15.84 | import itertools
import math
def dist(a, b):
return math.sqrt((a[0] - b[0])**2 + (a[1] - b[1])**2)
N = int(eval(input()))
C = [tuple(map(int, input().split())) for _ in range(N)]
s = 0
for per in itertools.permutations(C):
for i in range(N-1):
s += dist(per[i], per[i+1])
print((s / len(list(itertools.permutations(C)))))
| import itertools
import math
def dist(a, b):
return math.sqrt((a[0] - b[0])**2 + (a[1] - b[1])**2)
N = int(eval(input()))
C = [tuple(map(int, input().split())) for _ in range(N)]
s = 0
for cmb in itertools.combinations(C, 2):
s += 2 * dist(cmb[0], cmb[1]) / N
print(s)
| 17 | 16 | 352 | 292 | import itertools
import math
def dist(a, b):
return math.sqrt((a[0] - b[0]) ** 2 + (a[1] - b[1]) ** 2)
N = int(eval(input()))
C = [tuple(map(int, input().split())) for _ in range(N)]
s = 0
for per in itertools.permutations(C):
for i in range(N - 1):
s += dist(per[i], per[i + 1])
print((s / len(list(itertools.permutations(C)))))
| import itertools
import math
def dist(a, b):
return math.sqrt((a[0] - b[0]) ** 2 + (a[1] - b[1]) ** 2)
N = int(eval(input()))
C = [tuple(map(int, input().split())) for _ in range(N)]
s = 0
for cmb in itertools.combinations(C, 2):
s += 2 * dist(cmb[0], cmb[1]) / N
print(s)
| false | 5.882353 | [
"-for per in itertools.permutations(C):",
"- for i in range(N - 1):",
"- s += dist(per[i], per[i + 1])",
"-print((s / len(list(itertools.permutations(C)))))",
"+for cmb in itertools.combinations(C, 2):",
"+ s += 2 * dist(cmb[0], cmb[1]) / N",
"+print(s)"
] | false | 0.039865 | 0.12841 | 0.310452 | [
"s762687791",
"s156944202"
] |
u093739220 | p03013 | python | s573394368 | s120232779 | 452 | 173 | 460,020 | 11,884 | Accepted | Accepted | 61.73 | N, M = list(map(int, input().split(" ")))
A = {int(eval(input())) for _ in range(M)}
memo = [0] * (N + 1)
memo[0] = 0 if 0 in A else 1
memo[1] = 0 if 1 in A else 1
for i in range(2, N + 1):
if i in A:
continue
memo[i] = memo[i - 2] + memo[i - 1]
print((memo[N] % 1000000007)) | N, M = list(map(int, input().split(" ")))
A = {int(eval(input())) for _ in range(M)}
memo = [0] * (N + 1)
memo[0] = 1
memo[1] = 0 if 1 in A else 1
if N == 1:
print((memo[1]))
else:
for i in range(2, N + 1):
if i in A:
continue
memo[i] = (memo[i - 2] + memo[i - 1]) % 1000000007
print((memo[N]))
| 13 | 16 | 298 | 343 | N, M = list(map(int, input().split(" ")))
A = {int(eval(input())) for _ in range(M)}
memo = [0] * (N + 1)
memo[0] = 0 if 0 in A else 1
memo[1] = 0 if 1 in A else 1
for i in range(2, N + 1):
if i in A:
continue
memo[i] = memo[i - 2] + memo[i - 1]
print((memo[N] % 1000000007))
| N, M = list(map(int, input().split(" ")))
A = {int(eval(input())) for _ in range(M)}
memo = [0] * (N + 1)
memo[0] = 1
memo[1] = 0 if 1 in A else 1
if N == 1:
print((memo[1]))
else:
for i in range(2, N + 1):
if i in A:
continue
memo[i] = (memo[i - 2] + memo[i - 1]) % 1000000007
print((memo[N]))
| false | 18.75 | [
"-memo[0] = 0 if 0 in A else 1",
"+memo[0] = 1",
"-for i in range(2, N + 1):",
"- if i in A:",
"- continue",
"- memo[i] = memo[i - 2] + memo[i - 1]",
"-print((memo[N] % 1000000007))",
"+if N == 1:",
"+ print((memo[1]))",
"+else:",
"+ for i in range(2, N + 1):",
"+ if ... | false | 0.034528 | 0.035595 | 0.970017 | [
"s573394368",
"s120232779"
] |
u133936772 | p03060 | python | s797521273 | s421685948 | 31 | 24 | 9,124 | 9,096 | Accepted | Accepted | 22.58 | n=int(eval(input()))
v=[*list(map(int,input().split()))]
c=[*list(map(int,input().split()))]
print((sum(max(x-y,0) for x,y in zip(v,c)))) | eval(input())
f=lambda:list(map(int,input().split()))
print((sum(max(x-y,0) for x,y in zip(f(),f())))) | 4 | 3 | 120 | 90 | n = int(eval(input()))
v = [*list(map(int, input().split()))]
c = [*list(map(int, input().split()))]
print((sum(max(x - y, 0) for x, y in zip(v, c))))
| eval(input())
f = lambda: list(map(int, input().split()))
print((sum(max(x - y, 0) for x, y in zip(f(), f()))))
| false | 25 | [
"-n = int(eval(input()))",
"-v = [*list(map(int, input().split()))]",
"-c = [*list(map(int, input().split()))]",
"-print((sum(max(x - y, 0) for x, y in zip(v, c))))",
"+eval(input())",
"+f = lambda: list(map(int, input().split()))",
"+print((sum(max(x - y, 0) for x, y in zip(f(), f()))))"
] | false | 0.059484 | 0.041389 | 1.4372 | [
"s797521273",
"s421685948"
] |
u062691227 | p04046 | python | s152419936 | s742225886 | 193 | 178 | 91,404 | 88,896 | Accepted | Accepted | 7.77 | H, W, A, B = list(map(int, open(0).read().split()))
MOD = 10**9+7
factorials = [1] * (H + W + 1)
inv_factorials = [1] * (H + W + 1)
for i in range(H + W):
factorials[i+1] = factorials[i] * (i + 1) % MOD
inv_factorials = list([pow(n, MOD - 2, MOD) for n in factorials])
def modcomb(m, n, mod):
return factorials[m] * inv_factorials[n] * inv_factorials[m - n] % MOD
total = modcomb(H + W - 2, W - 1, MOD)
for i in range(B):
total -= modcomb(H - A - 1 + i, i, MOD) * modcomb(A - 1 + W - 1 - i, W - 1 - i, MOD)
total %= MOD
print(total) | H, W, A, B = list(map(int, open(0).read().split()))
MOD = 10**9+7
factorials = [1] * (H + W + 1)
inv_factorials = [1] * (H + W + 1)
for i in range(H + W):
factorials[i+1] = factorials[i] * (i + 1) % MOD
inv_factorials = list([pow(n, MOD - 2, MOD) for n in factorials])
def modcomb(m, n, mod):
return factorials[m] * inv_factorials[n] % MOD * inv_factorials[m - n] % MOD
total = modcomb(H + W - 2, W - 1, MOD)
for i in range(B):
total -= modcomb(H - A - 1 + i, i, MOD) * modcomb(A - 1 + W - 1 - i, W - 1 - i, MOD)
total %= MOD
print(total) | 21 | 21 | 577 | 583 | H, W, A, B = list(map(int, open(0).read().split()))
MOD = 10**9 + 7
factorials = [1] * (H + W + 1)
inv_factorials = [1] * (H + W + 1)
for i in range(H + W):
factorials[i + 1] = factorials[i] * (i + 1) % MOD
inv_factorials = list([pow(n, MOD - 2, MOD) for n in factorials])
def modcomb(m, n, mod):
return factorials[m] * inv_factorials[n] * inv_factorials[m - n] % MOD
total = modcomb(H + W - 2, W - 1, MOD)
for i in range(B):
total -= modcomb(H - A - 1 + i, i, MOD) * modcomb(A - 1 + W - 1 - i, W - 1 - i, MOD)
total %= MOD
print(total)
| H, W, A, B = list(map(int, open(0).read().split()))
MOD = 10**9 + 7
factorials = [1] * (H + W + 1)
inv_factorials = [1] * (H + W + 1)
for i in range(H + W):
factorials[i + 1] = factorials[i] * (i + 1) % MOD
inv_factorials = list([pow(n, MOD - 2, MOD) for n in factorials])
def modcomb(m, n, mod):
return factorials[m] * inv_factorials[n] % MOD * inv_factorials[m - n] % MOD
total = modcomb(H + W - 2, W - 1, MOD)
for i in range(B):
total -= modcomb(H - A - 1 + i, i, MOD) * modcomb(A - 1 + W - 1 - i, W - 1 - i, MOD)
total %= MOD
print(total)
| false | 0 | [
"- return factorials[m] * inv_factorials[n] * inv_factorials[m - n] % MOD",
"+ return factorials[m] * inv_factorials[n] % MOD * inv_factorials[m - n] % MOD"
] | false | 0.113404 | 0.110102 | 1.029989 | [
"s152419936",
"s742225886"
] |
u991156486 | p02258 | python | s402013222 | s833308005 | 570 | 480 | 13,588 | 5,608 | Accepted | Accepted | 15.79 | n = int(eval(input()))
x = []
for i in range(n):
x.append(int(eval(input())))
imin=0
imax=1
maxVal=x[imax]-x[imin]
for i in range(1,n):
if x[imin] > x[i]:
imin=i
imax=i+1
if imax > n-1:
break
dx = x[imax]-x[imin]
if maxVal < dx:
maxVal = dx
elif x[imax] < x[i]:
imax = i
dx = x[imax]-x[imin]
if maxVal < dx:
maxVal = dx
print(maxVal)
| n = int(eval(input()))
maxVal = -2000000000
minVal = int(eval(input()))
for i in range(1,n):
x=int(eval(input()))
dx = x-minVal
if maxVal < dx:
maxVal = dx
if minVal > x:
minVal = x
print(maxVal)
| 24 | 11 | 459 | 220 | n = int(eval(input()))
x = []
for i in range(n):
x.append(int(eval(input())))
imin = 0
imax = 1
maxVal = x[imax] - x[imin]
for i in range(1, n):
if x[imin] > x[i]:
imin = i
imax = i + 1
if imax > n - 1:
break
dx = x[imax] - x[imin]
if maxVal < dx:
maxVal = dx
elif x[imax] < x[i]:
imax = i
dx = x[imax] - x[imin]
if maxVal < dx:
maxVal = dx
print(maxVal)
| n = int(eval(input()))
maxVal = -2000000000
minVal = int(eval(input()))
for i in range(1, n):
x = int(eval(input()))
dx = x - minVal
if maxVal < dx:
maxVal = dx
if minVal > x:
minVal = x
print(maxVal)
| false | 54.166667 | [
"-x = []",
"-for i in range(n):",
"- x.append(int(eval(input())))",
"-imin = 0",
"-imax = 1",
"-maxVal = x[imax] - x[imin]",
"+maxVal = -2000000000",
"+minVal = int(eval(input()))",
"- if x[imin] > x[i]:",
"- imin = i",
"- imax = i + 1",
"- if imax > n - 1:",
"- ... | false | 0.077277 | 0.036912 | 2.093535 | [
"s402013222",
"s833308005"
] |
u163783894 | p03241 | python | s030405075 | s480995367 | 1,811 | 32 | 9,188 | 9,108 | Accepted | Accepted | 98.23 | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
in_n = lambda: int(readline())
in_nn = lambda: list(map(int, readline().split()))
in_s = lambda: readline().rstrip().decode('utf-8')
def main():
N, M = in_nn()
ans = 1
inf = M // N + 1
for i in range(inf, 1, -1):
if i * N <= M and M % i == 0:
ans = i
break
print(ans)
if __name__ == '__main__':
main()
| import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
in_n = lambda: int(readline())
in_nn = lambda: list(map(int, readline().split()))
in_s = lambda: readline().rstrip().decode('utf-8')
def make_divisors(n):
lower_divisors, upper_divisors = [], []
i = 1
while i * i <= n:
if n % i == 0:
lower_divisors.append(i)
if i != n // i:
upper_divisors.append(n // i)
i += 1
return lower_divisors + upper_divisors[::-1]
def main():
N, M = in_nn()
ans = 1
for i in sorted(make_divisors(M), reverse=True):
if i * N <= M and M % i == 0:
ans = i
break
print(ans)
if __name__ == '__main__':
main()
| 25 | 36 | 461 | 770 | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
in_n = lambda: int(readline())
in_nn = lambda: list(map(int, readline().split()))
in_s = lambda: readline().rstrip().decode("utf-8")
def main():
N, M = in_nn()
ans = 1
inf = M // N + 1
for i in range(inf, 1, -1):
if i * N <= M and M % i == 0:
ans = i
break
print(ans)
if __name__ == "__main__":
main()
| import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
in_n = lambda: int(readline())
in_nn = lambda: list(map(int, readline().split()))
in_s = lambda: readline().rstrip().decode("utf-8")
def make_divisors(n):
lower_divisors, upper_divisors = [], []
i = 1
while i * i <= n:
if n % i == 0:
lower_divisors.append(i)
if i != n // i:
upper_divisors.append(n // i)
i += 1
return lower_divisors + upper_divisors[::-1]
def main():
N, M = in_nn()
ans = 1
for i in sorted(make_divisors(M), reverse=True):
if i * N <= M and M % i == 0:
ans = i
break
print(ans)
if __name__ == "__main__":
main()
| false | 30.555556 | [
"+def make_divisors(n):",
"+ lower_divisors, upper_divisors = [], []",
"+ i = 1",
"+ while i * i <= n:",
"+ if n % i == 0:",
"+ lower_divisors.append(i)",
"+ if i != n // i:",
"+ upper_divisors.append(n // i)",
"+ i += 1",
"+ return lo... | false | 0.111274 | 0.053686 | 2.072675 | [
"s030405075",
"s480995367"
] |
u222668979 | p03215 | python | s093076930 | s540543032 | 1,230 | 141 | 28,824 | 107,404 | Accepted | Accepted | 88.54 | from itertools import accumulate
def main():
n, k = list(map(int, input().split()))
a = [0] + list(accumulate(list(map(int, input().split()))))
btfl = []
for i in range(0, n):
for j in range(i + 1, n + 1):
btfl.append(a[j] - a[i])
# 解説AC
ans = 0
for i in range(50)[::-1]:
num, cnt = ans + pow(2, i), 0
for b in btfl:
if num == num & b:
cnt += 1
if cnt >= k:
ans = num
print(ans)
if __name__ == '__main__':
main()
| from itertools import accumulate
n, k = list(map(int, input().split()))
a = [0] + list(accumulate(list(map(int, input().split()))))
btfl = []
for i in range(0, n):
for j in range(i + 1, n + 1):
btfl.append(a[j] - a[i])
# 解説AC
ans = 0
for i in range(50)[::-1]:
num, cnt = ans + pow(2, i), 0
for b in btfl:
if num == num & b:
cnt += 1
if cnt >= k:
ans = num
print(ans)
| 24 | 19 | 548 | 427 | from itertools import accumulate
def main():
n, k = list(map(int, input().split()))
a = [0] + list(accumulate(list(map(int, input().split()))))
btfl = []
for i in range(0, n):
for j in range(i + 1, n + 1):
btfl.append(a[j] - a[i])
# 解説AC
ans = 0
for i in range(50)[::-1]:
num, cnt = ans + pow(2, i), 0
for b in btfl:
if num == num & b:
cnt += 1
if cnt >= k:
ans = num
print(ans)
if __name__ == "__main__":
main()
| from itertools import accumulate
n, k = list(map(int, input().split()))
a = [0] + list(accumulate(list(map(int, input().split()))))
btfl = []
for i in range(0, n):
for j in range(i + 1, n + 1):
btfl.append(a[j] - a[i])
# 解説AC
ans = 0
for i in range(50)[::-1]:
num, cnt = ans + pow(2, i), 0
for b in btfl:
if num == num & b:
cnt += 1
if cnt >= k:
ans = num
print(ans)
| false | 20.833333 | [
"-",
"-def main():",
"- n, k = list(map(int, input().split()))",
"- a = [0] + list(accumulate(list(map(int, input().split()))))",
"- btfl = []",
"- for i in range(0, n):",
"- for j in range(i + 1, n + 1):",
"- btfl.append(a[j] - a[i])",
"- # 解説AC",
"- ans = 0",
... | false | 0.053658 | 0.075855 | 0.707381 | [
"s093076930",
"s540543032"
] |
u377989038 | p02959 | python | s241145447 | s148806336 | 154 | 106 | 19,228 | 19,228 | Accepted | Accepted | 31.17 | import sys
input = sys.stdin.readline
def main():
n = int(eval(input()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
ans = 0
for i in range(n):
left = min(a[i], b[i])
ans += left
a[i] -= left
b[i] -= left
right = min(a[i + 1], b[i])
ans += right
a[i + 1] -= right
print(ans)
if __name__ == "__main__":
main() | import sys
input = sys.stdin.readline
def main():
n = int(eval(input()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
tmp = 0
ans = 0
for i in range(n):
mon = max(0, a[i] - tmp)
if b[i] <= mon:
ans += b[i] + tmp
tmp = 0
else:
ans += a[i]
tmp = b[i] - mon
if tmp <= a[i + 1]:
ans += tmp
else:
ans += a[i + 1]
print(ans)
if __name__ == "__main__":
main() | 23 | 28 | 441 | 545 | import sys
input = sys.stdin.readline
def main():
n = int(eval(input()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
ans = 0
for i in range(n):
left = min(a[i], b[i])
ans += left
a[i] -= left
b[i] -= left
right = min(a[i + 1], b[i])
ans += right
a[i + 1] -= right
print(ans)
if __name__ == "__main__":
main()
| import sys
input = sys.stdin.readline
def main():
n = int(eval(input()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
tmp = 0
ans = 0
for i in range(n):
mon = max(0, a[i] - tmp)
if b[i] <= mon:
ans += b[i] + tmp
tmp = 0
else:
ans += a[i]
tmp = b[i] - mon
if tmp <= a[i + 1]:
ans += tmp
else:
ans += a[i + 1]
print(ans)
if __name__ == "__main__":
main()
| false | 17.857143 | [
"+ tmp = 0",
"- left = min(a[i], b[i])",
"- ans += left",
"- a[i] -= left",
"- b[i] -= left",
"- right = min(a[i + 1], b[i])",
"- ans += right",
"- a[i + 1] -= right",
"+ mon = max(0, a[i] - tmp)",
"+ if b[i] <= mon:",
"+ ... | false | 0.038794 | 0.037543 | 1.033332 | [
"s241145447",
"s148806336"
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.