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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
u762420987 | p03575 | python | s028735453 | s928061270 | 460 | 21 | 27,952 | 3,064 | Accepted | Accepted | 95.43 | from copy import deepcopy
N, M = list(map(int, input().split()))
graph = dict()
for i in range(N):
graph[i] = []
ab = [tuple(map(int, input().split())) for _ in range(M)]
import numpy as np
from scipy.sparse.csgraph import shortest_path
from scipy.sparse import csr_matrix
inf = float("inf")
graph = np.zeros((N, N))
for a, b in ab:
graph[a - 1][b - 1] = 1
counter = 0
for a, b in ab:
g = deepcopy(graph)
g[a - 1][b - 1] = 0
g = csr_matrix(g)
shortest_paths = shortest_path(g, directed=False, method="D")
if inf in shortest_paths[0]:
counter += 1
print(counter)
| class UnionFind():
def __init__(self, n):
self.n = n
self.parents = [-1] * n
def find(self, x):
if self.parents[x] < 0:
return x
else:
self.parents[x] = self.find(self.parents[x])
return self.parents[x]
def union(self, x, y):
x = self.find(x)
y = self.find(y)
if x == y:
return
if self.parents[x] > self.parents[y]:
x, y = y, x
self.parents[x] += self.parents[y]
self.parents[y] = x
def size(self, x):
return -self.parents[self.find(x)]
def same(self, x, y):
return self.find(x) == self.find(y)
def members(self, x):
root = self.find(x)
return [i for i in range(self.n) if self.find(i) == root]
def roots(self):
return [i for i, x in enumerate(self.parents) if x < 0]
def group_count(self):
return len(self.roots())
def all_group_members(self):
return {r: self.members(r) for r in self.roots()}
N, M = list(map(int, input().split()))
def int_(num):
return int(num) - 1
ablist = [list(map(int_, input().split())) for _ in range(M)]
ans = 0
for ng in range(M):
uf = UnionFind(N)
for i in range(M):
if i != ng:
uf.union(*ablist[i])
if uf.group_count() != 1:
ans += 1
print(ans) | 25 | 57 | 619 | 1,412 | from copy import deepcopy
N, M = list(map(int, input().split()))
graph = dict()
for i in range(N):
graph[i] = []
ab = [tuple(map(int, input().split())) for _ in range(M)]
import numpy as np
from scipy.sparse.csgraph import shortest_path
from scipy.sparse import csr_matrix
inf = float("inf")
graph = np.zeros((N, N))
for a, b in ab:
graph[a - 1][b - 1] = 1
counter = 0
for a, b in ab:
g = deepcopy(graph)
g[a - 1][b - 1] = 0
g = csr_matrix(g)
shortest_paths = shortest_path(g, directed=False, method="D")
if inf in shortest_paths[0]:
counter += 1
print(counter)
| class UnionFind:
def __init__(self, n):
self.n = n
self.parents = [-1] * n
def find(self, x):
if self.parents[x] < 0:
return x
else:
self.parents[x] = self.find(self.parents[x])
return self.parents[x]
def union(self, x, y):
x = self.find(x)
y = self.find(y)
if x == y:
return
if self.parents[x] > self.parents[y]:
x, y = y, x
self.parents[x] += self.parents[y]
self.parents[y] = x
def size(self, x):
return -self.parents[self.find(x)]
def same(self, x, y):
return self.find(x) == self.find(y)
def members(self, x):
root = self.find(x)
return [i for i in range(self.n) if self.find(i) == root]
def roots(self):
return [i for i, x in enumerate(self.parents) if x < 0]
def group_count(self):
return len(self.roots())
def all_group_members(self):
return {r: self.members(r) for r in self.roots()}
N, M = list(map(int, input().split()))
def int_(num):
return int(num) - 1
ablist = [list(map(int_, input().split())) for _ in range(M)]
ans = 0
for ng in range(M):
uf = UnionFind(N)
for i in range(M):
if i != ng:
uf.union(*ablist[i])
if uf.group_count() != 1:
ans += 1
print(ans)
| false | 56.140351 | [
"-from copy import deepcopy",
"+class UnionFind:",
"+ def __init__(self, n):",
"+ self.n = n",
"+ self.parents = [-1] * n",
"+",
"+ def find(self, x):",
"+ if self.parents[x] < 0:",
"+ return x",
"+ else:",
"+ self.parents[x] = self.find(se... | false | 0.549816 | 0.037383 | 14.707827 | [
"s028735453",
"s928061270"
] |
u136869985 | p03658 | python | s344230730 | s939568619 | 21 | 17 | 3,316 | 3,060 | Accepted | Accepted | 19.05 | n,k=input().split()
print((sum(sorted(list(map(int,input().split())))[:-int(k)-1:-1]))) | N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
A = sorted(A, reverse = True)
ans = 0
for i in range(K):
ans += A[i]
print(ans) | 2 | 9 | 86 | 162 | n, k = input().split()
print((sum(sorted(list(map(int, input().split())))[: -int(k) - 1 : -1])))
| N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
A = sorted(A, reverse=True)
ans = 0
for i in range(K):
ans += A[i]
print(ans)
| false | 77.777778 | [
"-n, k = input().split()",
"-print((sum(sorted(list(map(int, input().split())))[: -int(k) - 1 : -1])))",
"+N, K = list(map(int, input().split()))",
"+A = list(map(int, input().split()))",
"+A = sorted(A, reverse=True)",
"+ans = 0",
"+for i in range(K):",
"+ ans += A[i]",
"+print(ans)"
] | false | 0.037884 | 0.038091 | 0.994566 | [
"s344230730",
"s939568619"
] |
u744920373 | p02803 | python | s784484720 | s850680795 | 694 | 614 | 3,188 | 3,316 | Accepted | Accepted | 11.53 | H, W = list(map(int,input().split()))
#A = [list(map(str,input().split())) for i in range(H)]
A = [list(eval(input())) for i in range(H)]
#from queue import Queue
#from collections import deque
dj = [1, 0, -1, 0]
di = [0, 1, 0, -1]
sum_sharp = sum([A[i].count('#') for i in range(H)])
fin_d_max = 1
for s_i in range(H):
for s_j in range(W):
#print(s_i,s_j)
d_max = 0
q_i = []
#q_i = Queue()
#q_i = deque()
q_j = []
#q_j = Queue()
#q_j = deque()
D = [[-1]*W for i in range(H)]
#flag = [[0]*W for i in range(H)]
flag = 1
if A[s_i][s_j] == '.':
D[s_i][s_j] = 0
#q_i.put(s_i)
q_i.append(s_i)
#q_j.put(s_j)
q_j.append(s_j)
#while sum(map(sum, flag)) != W*H - sum_sharp:
#while flag < W*H - sum_sharp:
#while q_i.empty() == False:
while len(q_i)!=0:
#for a in range(W*H):
#i = q_i.get()
i = q_i.pop(0)
#i = q_i.popleft()
#j = q_j.get()
j = q_j.pop(0)
#j = q_j.popleft()
for x in range(4):
ni = i+di[x]
nj = j+dj[x]
#if ni<0 or ni>=H or nj<0 or nj>=W or A[ni][nj]== '#' or 0<=D[ni][nj]<D[i][j]+1:
if ni<0 or ni>=H or nj<0 or nj>=W or A[ni][nj]== '#' or D[ni][nj]!=-1:
#if ni<0 or ni>=H or nj<0 or nj>=W:
continue
#elif A[ni][nj]== '#' or D[ni][nj] < D[i][j]+1:
#flag[ni][nj] = 1
#continue
else:
#if D[ni][nj] == -1:
#print(flag)
flag += 1
D[ni][nj] = D[i][j]+1
d_max = max(d_max, D[ni][nj])
#q_i.put(ni)
q_i.append(ni)
q_j.append(nj)
#q_j.put(nj)
fin_d_max = max(fin_d_max, d_max)
print(fin_d_max) | H, W = list(map(int,input().split()))
A = [list(eval(input())) for i in range(H)]
#from queue import Queue #キューを使ったら1ケースだけTLEになった。
from collections import deque
dj = [1, 0, -1, 0]
di = [0, 1, 0, -1]
sum_sharp = sum([A[i].count('#') for i in range(H)])
fin_d_max = 1
for s_i in range(H):
for s_j in range(W):
d_max = 0
#q_i = Queue()
q_i = deque()
#q_j = Queue()
q_j = deque()
D = [[-1]*W for i in range(H)]
flag = 1
if A[s_i][s_j] == '.':
D[s_i][s_j] = 0
#q_i.put(s_i)
q_i.append(s_i)
#q_j.put(s_j)
q_j.append(s_j)
#while q_i.empty() == False:
while len(q_i)!=0:
#i = q_i.get()
i = q_i.popleft()
#j = q_j.get()
j = q_j.popleft()
for x in range(4):
ni = i+di[x]
nj = j+dj[x]
if ni<0 or ni>=H or nj<0 or nj>=W or A[ni][nj]== '#' or D[ni][nj]!=-1:
continue
else:
flag += 1
D[ni][nj] = D[i][j]+1
d_max = max(d_max, D[ni][nj])
#q_i.put(ni)
q_i.append(ni)
#q_j.put(nj)
q_j.append(nj)
fin_d_max = max(fin_d_max, d_max)
print(fin_d_max) | 68 | 51 | 2,240 | 1,501 | H, W = list(map(int, input().split()))
# A = [list(map(str,input().split())) for i in range(H)]
A = [list(eval(input())) for i in range(H)]
# from queue import Queue
# from collections import deque
dj = [1, 0, -1, 0]
di = [0, 1, 0, -1]
sum_sharp = sum([A[i].count("#") for i in range(H)])
fin_d_max = 1
for s_i in range(H):
for s_j in range(W):
# print(s_i,s_j)
d_max = 0
q_i = []
# q_i = Queue()
# q_i = deque()
q_j = []
# q_j = Queue()
# q_j = deque()
D = [[-1] * W for i in range(H)]
# flag = [[0]*W for i in range(H)]
flag = 1
if A[s_i][s_j] == ".":
D[s_i][s_j] = 0
# q_i.put(s_i)
q_i.append(s_i)
# q_j.put(s_j)
q_j.append(s_j)
# while sum(map(sum, flag)) != W*H - sum_sharp:
# while flag < W*H - sum_sharp:
# while q_i.empty() == False:
while len(q_i) != 0:
# for a in range(W*H):
# i = q_i.get()
i = q_i.pop(0)
# i = q_i.popleft()
# j = q_j.get()
j = q_j.pop(0)
# j = q_j.popleft()
for x in range(4):
ni = i + di[x]
nj = j + dj[x]
# if ni<0 or ni>=H or nj<0 or nj>=W or A[ni][nj]== '#' or 0<=D[ni][nj]<D[i][j]+1:
if (
ni < 0
or ni >= H
or nj < 0
or nj >= W
or A[ni][nj] == "#"
or D[ni][nj] != -1
):
# if ni<0 or ni>=H or nj<0 or nj>=W:
continue
# elif A[ni][nj]== '#' or D[ni][nj] < D[i][j]+1:
# flag[ni][nj] = 1
# continue
else:
# if D[ni][nj] == -1:
# print(flag)
flag += 1
D[ni][nj] = D[i][j] + 1
d_max = max(d_max, D[ni][nj])
# q_i.put(ni)
q_i.append(ni)
q_j.append(nj)
# q_j.put(nj)
fin_d_max = max(fin_d_max, d_max)
print(fin_d_max)
| H, W = list(map(int, input().split()))
A = [list(eval(input())) for i in range(H)]
# from queue import Queue #キューを使ったら1ケースだけTLEになった。
from collections import deque
dj = [1, 0, -1, 0]
di = [0, 1, 0, -1]
sum_sharp = sum([A[i].count("#") for i in range(H)])
fin_d_max = 1
for s_i in range(H):
for s_j in range(W):
d_max = 0
# q_i = Queue()
q_i = deque()
# q_j = Queue()
q_j = deque()
D = [[-1] * W for i in range(H)]
flag = 1
if A[s_i][s_j] == ".":
D[s_i][s_j] = 0
# q_i.put(s_i)
q_i.append(s_i)
# q_j.put(s_j)
q_j.append(s_j)
# while q_i.empty() == False:
while len(q_i) != 0:
# i = q_i.get()
i = q_i.popleft()
# j = q_j.get()
j = q_j.popleft()
for x in range(4):
ni = i + di[x]
nj = j + dj[x]
if (
ni < 0
or ni >= H
or nj < 0
or nj >= W
or A[ni][nj] == "#"
or D[ni][nj] != -1
):
continue
else:
flag += 1
D[ni][nj] = D[i][j] + 1
d_max = max(d_max, D[ni][nj])
# q_i.put(ni)
q_i.append(ni)
# q_j.put(nj)
q_j.append(nj)
fin_d_max = max(fin_d_max, d_max)
print(fin_d_max)
| false | 25 | [
"-# A = [list(map(str,input().split())) for i in range(H)]",
"-# from queue import Queue",
"-# from collections import deque",
"+# from queue import Queue #キューを使ったら1ケースだけTLEになった。",
"+from collections import deque",
"+",
"- # print(s_i,s_j)",
"- q_i = []",
"- # q_i = deque()",
... | false | 0.039429 | 0.038215 | 1.031766 | [
"s784484720",
"s850680795"
] |
u170201762 | p02807 | python | s807091447 | s958295467 | 412 | 275 | 85,528 | 85,160 | Accepted | Accepted | 33.25 | mod = 10**9+7
N = int(eval(input()))
x = list(map(int,input().split()))
fact = [1]*(N+1)
for i in range(N):
fact[i+1] = (i+1)*fact[i]
fact[i+1] %= mod
inv = [1]*(N+1)
for i in range(N):
inv[i] = pow(i,mod-2,mod)
x1 = []
for m in range(1,N-1):
x1.append(x[m]*m*inv[m+1]%mod)
x2 = []
for n in range(N-2):
x2.append(x[n]*(N-n-2)*inv[N-n-1]%mod)
x3 = []
for n in range(N-1):
x3.append((x[N-1]-x[n])*inv[N-n-1])
ans = fact[N-1]*(sum(x1)-sum(x2)+sum(x3))
ans %= mod
print(ans) | mod = 10**9+7
N = int(eval(input()))
x = list(map(int,input().split()))
ans = 0
for j in range(1,N-1):
ans += x[j]*j*pow(j+1,mod-2,mod)
ans %= mod
for i in range(N-2):
ans += x[i]*(-N+i+2)*pow(N-i-1,mod-2,mod)
ans %= mod
for i in range(N-1):
ans += (x[N-1]-x[i])*pow(N-1-i,mod-2,mod)
ans %= mod
for i in range(1,N):
ans *= i
ans %= mod
print(ans) | 23 | 20 | 511 | 394 | mod = 10**9 + 7
N = int(eval(input()))
x = list(map(int, input().split()))
fact = [1] * (N + 1)
for i in range(N):
fact[i + 1] = (i + 1) * fact[i]
fact[i + 1] %= mod
inv = [1] * (N + 1)
for i in range(N):
inv[i] = pow(i, mod - 2, mod)
x1 = []
for m in range(1, N - 1):
x1.append(x[m] * m * inv[m + 1] % mod)
x2 = []
for n in range(N - 2):
x2.append(x[n] * (N - n - 2) * inv[N - n - 1] % mod)
x3 = []
for n in range(N - 1):
x3.append((x[N - 1] - x[n]) * inv[N - n - 1])
ans = fact[N - 1] * (sum(x1) - sum(x2) + sum(x3))
ans %= mod
print(ans)
| mod = 10**9 + 7
N = int(eval(input()))
x = list(map(int, input().split()))
ans = 0
for j in range(1, N - 1):
ans += x[j] * j * pow(j + 1, mod - 2, mod)
ans %= mod
for i in range(N - 2):
ans += x[i] * (-N + i + 2) * pow(N - i - 1, mod - 2, mod)
ans %= mod
for i in range(N - 1):
ans += (x[N - 1] - x[i]) * pow(N - 1 - i, mod - 2, mod)
ans %= mod
for i in range(1, N):
ans *= i
ans %= mod
print(ans)
| false | 13.043478 | [
"-fact = [1] * (N + 1)",
"-for i in range(N):",
"- fact[i + 1] = (i + 1) * fact[i]",
"- fact[i + 1] %= mod",
"-inv = [1] * (N + 1)",
"-for i in range(N):",
"- inv[i] = pow(i, mod - 2, mod)",
"-x1 = []",
"-for m in range(1, N - 1):",
"- x1.append(x[m] * m * inv[m + 1] % mod)",
"-x2 = ... | false | 0.048102 | 0.049158 | 0.978504 | [
"s807091447",
"s958295467"
] |
u426534722 | p02299 | python | s089517447 | s771080837 | 130 | 120 | 8,256 | 8,260 | Accepted | Accepted | 7.69 | import sys
from operator import itemgetter, attrgetter
from itertools import starmap
import cmath
from math import isinf, sqrt, acos, atan2
readline = sys.stdin.readline
EPS = 1e-9
ONLINE_FRONT = -2
CLOCKWISE = -1
ON_SEGMENT = 0
COUNTER_CLOCKWISE = 1
ONLINE_BACK = 2
class Circle(object):
__slots__ = ('c', 'r')
def __init__(self, c, r):
self.c = c
self.r = r
class Segment(object):
__slots__ = ('fi', 'se')
def __init__(self, fi, se):
self.fi = fi
self.se = se
Line = Segment
def cross(a, b):
return a.real * b.imag - a.imag * b.real
def dot(a, b):
return a.real * b.real + a.imag * b.imag
def norm(base):
return abs(base) ** 2
def project(s, p2):
base = s.fi - s.se
r = dot(p2 - s.fi, base) / norm(base)
return s.fi + base * r
def reflect(s, p):
return p + (project(s, p) - p) * 2.0
def ccw(p1, p2, p3):
a = p2 - p1
b = p3 - p1
if cross(a, b) > EPS: return 1
if cross(a, b) < -EPS: return -1
if dot(a, b) < -EPS: return 2
if norm(a) < norm(b): return -2
return 0
def intersect4(p1, p2, p3, p4):
return (ccw(p1, p2, p3) * ccw(p1, p2, p4) <= 0 and
ccw(p3, p4, p1) * ccw(p3, p4, p2) <= 0)
def intersect2(s1, s2):
return intersect4(s1.fi, s1.se, s2.fi, s2.se)
def getDistance(a, b): return abs(a - b)
def getDistanceLP(l, p):
return abs(cross(l.se - l.fi, p - l.fi) / abs(l.se - l.fi))
def getDistanceSP(s, p):
if dot(s.se - s.fi, p - s.fi) < 0.0: return abs(p - s.fi)
if dot(s.fi - s.se, p - s.se) < 0.0: return abs(p - s.se)
return getDistanceLP(s, p)
def getDistances(s1, s2):
if intersect2(s1, s2): return 0.0
return min(getDistanceSP(s1, s2.fi), getDistanceSP(s1, s2.se),
getDistanceSP(s2, s1.fi), getDistanceSP(s2, s1.se))
def getCrossPoint(s1, s2):
base = s2.se - s2.fi
d1 = abs(cross(base, s1.fi - s2.fi))
d2 = abs(cross(base, s1.se - s2.fi))
t = d1 / (d1 + d2)
return s1.fi + (s1.se - s1.fi) * t
def getCrossPointsCL(c, l):
pr = project(l, c.c)
e = (l.se - l.fi) / abs(l.se - l.fi)
base = sqrt(c.r * c.r - norm(pr - c.c))
return Segment(*sorted((pr + e * base, pr - e * base)), key=attrgetter('real', 'imag'))
def getCrossPointsCC(c1, c2):
d = abs(c1.c - c2.c)
a = acos((c1.r * c1.r + d * d - c2.r * c2.r) / (2.0 * c1.r * d))
t = cmath.phase(c2.c - c1.c)
return Segment(*sorted((c1.c + cmath.rect(c1.r, t + a), c1.c + cmath.rect(c1.r, t - a)), key=attrgetter('real', 'imag')))
def contains(g, p):
n = len(g)
x = False
for i in range(n):
a = g[i] - p
b = g[(i + 1) % n] - p
if abs(cross(a, b)) < EPS and dot(a, b) < EPS: return 1
if a.imag > b.imag: a, b = b, a
if a.imag < EPS and EPS < b.imag and cross(a, b) > EPS: x = not x
return 2 if x else 0
n = int(readline())
pg = tuple(complex(*list(map(int, readline().split()))) for _ in [0] * n)
q = int(readline())
for _ in [0] * q:
print((contains(pg, complex(*list(map(float, readline().split())))))) | import sys
from operator import itemgetter, attrgetter
from itertools import starmap
import cmath
from math import isinf, sqrt, acos, atan2
readline = sys.stdin.readline
EPS = 1e-9
ONLINE_FRONT = -2
CLOCKWISE = -1
ON_SEGMENT = 0
COUNTER_CLOCKWISE = 1
ONLINE_BACK = 2
class Circle(object):
__slots__ = ('c', 'r')
def __init__(self, c, r):
self.c = c
self.r = r
class Segment(object):
__slots__ = ('fi', 'se')
def __init__(self, fi, se):
self.fi = fi
self.se = se
Line = Segment
def cross(a, b):
return a.real * b.imag - a.imag * b.real
def dot(a, b):
return a.real * b.real + a.imag * b.imag
def norm(base):
return abs(base) ** 2
def project(s, p2):
base = s.fi - s.se
r = dot(p2 - s.fi, base) / norm(base)
return s.fi + base * r
def reflect(s, p):
return p + (project(s, p) - p) * 2.0
def ccw(p1, p2, p3):
a = p2 - p1
b = p3 - p1
if cross(a, b) > EPS: return 1
if cross(a, b) < -EPS: return -1
if dot(a, b) < -EPS: return 2
if norm(a) < norm(b): return -2
return 0
def intersect4(p1, p2, p3, p4):
return (ccw(p1, p2, p3) * ccw(p1, p2, p4) <= 0 and
ccw(p3, p4, p1) * ccw(p3, p4, p2) <= 0)
def intersect2(s1, s2):
return intersect4(s1.fi, s1.se, s2.fi, s2.se)
def getDistance(a, b): return abs(a - b)
def getDistanceLP(l, p):
return abs(cross(l.se - l.fi, p - l.fi) / abs(l.se - l.fi))
def getDistanceSP(s, p):
if dot(s.se - s.fi, p - s.fi) < 0.0: return abs(p - s.fi)
if dot(s.fi - s.se, p - s.se) < 0.0: return abs(p - s.se)
return getDistanceLP(s, p)
def getDistances(s1, s2):
if intersect2(s1, s2): return 0.0
return min(getDistanceSP(s1, s2.fi), getDistanceSP(s1, s2.se),
getDistanceSP(s2, s1.fi), getDistanceSP(s2, s1.se))
def getCrossPoint(s1, s2):
base = s2.se - s2.fi
d1 = abs(cross(base, s1.fi - s2.fi))
d2 = abs(cross(base, s1.se - s2.fi))
t = d1 / (d1 + d2)
return s1.fi + (s1.se - s1.fi) * t
def getCrossPointsCL(c, l):
pr = project(l, c.c)
e = (l.se - l.fi) / abs(l.se - l.fi)
base = sqrt(c.r * c.r - norm(pr - c.c))
return Segment(*sorted((pr + e * base, pr - e * base)), key=attrgetter('real', 'imag'))
def getCrossPointsCC(c1, c2):
d = abs(c1.c - c2.c)
a = acos((c1.r * c1.r + d * d - c2.r * c2.r) / (2.0 * c1.r * d))
t = cmath.phase(c2.c - c1.c)
return Segment(*sorted((c1.c + cmath.rect(c1.r, t + a), c1.c + cmath.rect(c1.r, t - a)), key=attrgetter('real', 'imag')))
def contains(g, p):
n = len(g)
x = False
for i in range(n):
a = g[i] - p
b = g[(i + 1) % n] - p
if abs(cross(a, b)) < EPS and dot(a, b) < EPS: return 1
if a.imag > b.imag: a, b = b, a
if a.imag < EPS and EPS < b.imag and cross(a, b) > EPS: x = not x
return 2 if x else 0
n = int(readline())
pg = tuple(complex(*list(map(int, readline().split()))) for _ in [0] * n)
q = int(readline())
for _ in [0] * q:
print((contains(pg, complex(*list(map(int, readline().split())))))) | 90 | 90 | 3,083 | 3,081 | import sys
from operator import itemgetter, attrgetter
from itertools import starmap
import cmath
from math import isinf, sqrt, acos, atan2
readline = sys.stdin.readline
EPS = 1e-9
ONLINE_FRONT = -2
CLOCKWISE = -1
ON_SEGMENT = 0
COUNTER_CLOCKWISE = 1
ONLINE_BACK = 2
class Circle(object):
__slots__ = ("c", "r")
def __init__(self, c, r):
self.c = c
self.r = r
class Segment(object):
__slots__ = ("fi", "se")
def __init__(self, fi, se):
self.fi = fi
self.se = se
Line = Segment
def cross(a, b):
return a.real * b.imag - a.imag * b.real
def dot(a, b):
return a.real * b.real + a.imag * b.imag
def norm(base):
return abs(base) ** 2
def project(s, p2):
base = s.fi - s.se
r = dot(p2 - s.fi, base) / norm(base)
return s.fi + base * r
def reflect(s, p):
return p + (project(s, p) - p) * 2.0
def ccw(p1, p2, p3):
a = p2 - p1
b = p3 - p1
if cross(a, b) > EPS:
return 1
if cross(a, b) < -EPS:
return -1
if dot(a, b) < -EPS:
return 2
if norm(a) < norm(b):
return -2
return 0
def intersect4(p1, p2, p3, p4):
return (
ccw(p1, p2, p3) * ccw(p1, p2, p4) <= 0
and ccw(p3, p4, p1) * ccw(p3, p4, p2) <= 0
)
def intersect2(s1, s2):
return intersect4(s1.fi, s1.se, s2.fi, s2.se)
def getDistance(a, b):
return abs(a - b)
def getDistanceLP(l, p):
return abs(cross(l.se - l.fi, p - l.fi) / abs(l.se - l.fi))
def getDistanceSP(s, p):
if dot(s.se - s.fi, p - s.fi) < 0.0:
return abs(p - s.fi)
if dot(s.fi - s.se, p - s.se) < 0.0:
return abs(p - s.se)
return getDistanceLP(s, p)
def getDistances(s1, s2):
if intersect2(s1, s2):
return 0.0
return min(
getDistanceSP(s1, s2.fi),
getDistanceSP(s1, s2.se),
getDistanceSP(s2, s1.fi),
getDistanceSP(s2, s1.se),
)
def getCrossPoint(s1, s2):
base = s2.se - s2.fi
d1 = abs(cross(base, s1.fi - s2.fi))
d2 = abs(cross(base, s1.se - s2.fi))
t = d1 / (d1 + d2)
return s1.fi + (s1.se - s1.fi) * t
def getCrossPointsCL(c, l):
pr = project(l, c.c)
e = (l.se - l.fi) / abs(l.se - l.fi)
base = sqrt(c.r * c.r - norm(pr - c.c))
return Segment(
*sorted((pr + e * base, pr - e * base)), key=attrgetter("real", "imag")
)
def getCrossPointsCC(c1, c2):
d = abs(c1.c - c2.c)
a = acos((c1.r * c1.r + d * d - c2.r * c2.r) / (2.0 * c1.r * d))
t = cmath.phase(c2.c - c1.c)
return Segment(
*sorted(
(c1.c + cmath.rect(c1.r, t + a), c1.c + cmath.rect(c1.r, t - a)),
key=attrgetter("real", "imag"),
)
)
def contains(g, p):
n = len(g)
x = False
for i in range(n):
a = g[i] - p
b = g[(i + 1) % n] - p
if abs(cross(a, b)) < EPS and dot(a, b) < EPS:
return 1
if a.imag > b.imag:
a, b = b, a
if a.imag < EPS and EPS < b.imag and cross(a, b) > EPS:
x = not x
return 2 if x else 0
n = int(readline())
pg = tuple(complex(*list(map(int, readline().split()))) for _ in [0] * n)
q = int(readline())
for _ in [0] * q:
print((contains(pg, complex(*list(map(float, readline().split()))))))
| import sys
from operator import itemgetter, attrgetter
from itertools import starmap
import cmath
from math import isinf, sqrt, acos, atan2
readline = sys.stdin.readline
EPS = 1e-9
ONLINE_FRONT = -2
CLOCKWISE = -1
ON_SEGMENT = 0
COUNTER_CLOCKWISE = 1
ONLINE_BACK = 2
class Circle(object):
__slots__ = ("c", "r")
def __init__(self, c, r):
self.c = c
self.r = r
class Segment(object):
__slots__ = ("fi", "se")
def __init__(self, fi, se):
self.fi = fi
self.se = se
Line = Segment
def cross(a, b):
return a.real * b.imag - a.imag * b.real
def dot(a, b):
return a.real * b.real + a.imag * b.imag
def norm(base):
return abs(base) ** 2
def project(s, p2):
base = s.fi - s.se
r = dot(p2 - s.fi, base) / norm(base)
return s.fi + base * r
def reflect(s, p):
return p + (project(s, p) - p) * 2.0
def ccw(p1, p2, p3):
a = p2 - p1
b = p3 - p1
if cross(a, b) > EPS:
return 1
if cross(a, b) < -EPS:
return -1
if dot(a, b) < -EPS:
return 2
if norm(a) < norm(b):
return -2
return 0
def intersect4(p1, p2, p3, p4):
return (
ccw(p1, p2, p3) * ccw(p1, p2, p4) <= 0
and ccw(p3, p4, p1) * ccw(p3, p4, p2) <= 0
)
def intersect2(s1, s2):
return intersect4(s1.fi, s1.se, s2.fi, s2.se)
def getDistance(a, b):
return abs(a - b)
def getDistanceLP(l, p):
return abs(cross(l.se - l.fi, p - l.fi) / abs(l.se - l.fi))
def getDistanceSP(s, p):
if dot(s.se - s.fi, p - s.fi) < 0.0:
return abs(p - s.fi)
if dot(s.fi - s.se, p - s.se) < 0.0:
return abs(p - s.se)
return getDistanceLP(s, p)
def getDistances(s1, s2):
if intersect2(s1, s2):
return 0.0
return min(
getDistanceSP(s1, s2.fi),
getDistanceSP(s1, s2.se),
getDistanceSP(s2, s1.fi),
getDistanceSP(s2, s1.se),
)
def getCrossPoint(s1, s2):
base = s2.se - s2.fi
d1 = abs(cross(base, s1.fi - s2.fi))
d2 = abs(cross(base, s1.se - s2.fi))
t = d1 / (d1 + d2)
return s1.fi + (s1.se - s1.fi) * t
def getCrossPointsCL(c, l):
pr = project(l, c.c)
e = (l.se - l.fi) / abs(l.se - l.fi)
base = sqrt(c.r * c.r - norm(pr - c.c))
return Segment(
*sorted((pr + e * base, pr - e * base)), key=attrgetter("real", "imag")
)
def getCrossPointsCC(c1, c2):
d = abs(c1.c - c2.c)
a = acos((c1.r * c1.r + d * d - c2.r * c2.r) / (2.0 * c1.r * d))
t = cmath.phase(c2.c - c1.c)
return Segment(
*sorted(
(c1.c + cmath.rect(c1.r, t + a), c1.c + cmath.rect(c1.r, t - a)),
key=attrgetter("real", "imag"),
)
)
def contains(g, p):
n = len(g)
x = False
for i in range(n):
a = g[i] - p
b = g[(i + 1) % n] - p
if abs(cross(a, b)) < EPS and dot(a, b) < EPS:
return 1
if a.imag > b.imag:
a, b = b, a
if a.imag < EPS and EPS < b.imag and cross(a, b) > EPS:
x = not x
return 2 if x else 0
n = int(readline())
pg = tuple(complex(*list(map(int, readline().split()))) for _ in [0] * n)
q = int(readline())
for _ in [0] * q:
print((contains(pg, complex(*list(map(int, readline().split()))))))
| false | 0 | [
"- print((contains(pg, complex(*list(map(float, readline().split()))))))",
"+ print((contains(pg, complex(*list(map(int, readline().split()))))))"
] | false | 0.045651 | 0.043785 | 1.042605 | [
"s089517447",
"s771080837"
] |
u167647458 | p02947 | python | s486762512 | s465259875 | 766 | 371 | 17,848 | 17,852 | Accepted | Accepted | 51.57 | import math
def combinations_count(n, r):
return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))
def main():
n = int(eval(input()))
d = {}
ans = 0
for _ in range(n):
ss = ''.join(sorted(eval(input())))
d[ss] = d.get(ss, 0) + 1
for k, v in list(d.items()):
if v != 1:
ans += combinations_count(v, 2)
print(ans)
if __name__ == '__main__':
main() | def main():
n = int(eval(input()))
d = {}
ans = 0
for _ in range(n):
ss = ''.join(sorted(eval(input())))
d[ss] = d.get(ss, 0) + 1
for k, v in list(d.items()):
if v != 1:
ans += (v*(v-1)) // 2
print(ans)
if __name__ == '__main__':
main() | 25 | 18 | 475 | 336 | import math
def combinations_count(n, r):
return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))
def main():
n = int(eval(input()))
d = {}
ans = 0
for _ in range(n):
ss = "".join(sorted(eval(input())))
d[ss] = d.get(ss, 0) + 1
for k, v in list(d.items()):
if v != 1:
ans += combinations_count(v, 2)
print(ans)
if __name__ == "__main__":
main()
| def main():
n = int(eval(input()))
d = {}
ans = 0
for _ in range(n):
ss = "".join(sorted(eval(input())))
d[ss] = d.get(ss, 0) + 1
for k, v in list(d.items()):
if v != 1:
ans += (v * (v - 1)) // 2
print(ans)
if __name__ == "__main__":
main()
| false | 28 | [
"-import math",
"-",
"-",
"-def combinations_count(n, r):",
"- return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))",
"-",
"-",
"- ans += combinations_count(v, 2)",
"+ ans += (v * (v - 1)) // 2"
] | false | 0.069109 | 0.032069 | 2.155016 | [
"s486762512",
"s465259875"
] |
u606045429 | p03168 | python | s883658326 | s590579948 | 2,000 | 278 | 3,444 | 20,640 | Accepted | Accepted | 86.1 | N = int(eval(input()))
P = list(map(float, input().split()))
dp = [1] + [0] * N
for p in P:
dp = [p * a + (1 - p) * b for a, b in zip([0] + dp, dp)]
print((sum(dp[-(-N // 2):]))) | from numpy import zeros
N = int(eval(input()))
P = list(map(float, input().split()))
dp = zeros(N + 1)
dp[0] = 1.0
for p in P:
T = dp
dp = T * (1 - p)
dp[1:] += T[:-1] * p
print((dp[-(-N // 2):].sum())) | 8 | 14 | 177 | 217 | N = int(eval(input()))
P = list(map(float, input().split()))
dp = [1] + [0] * N
for p in P:
dp = [p * a + (1 - p) * b for a, b in zip([0] + dp, dp)]
print((sum(dp[-(-N // 2) :])))
| from numpy import zeros
N = int(eval(input()))
P = list(map(float, input().split()))
dp = zeros(N + 1)
dp[0] = 1.0
for p in P:
T = dp
dp = T * (1 - p)
dp[1:] += T[:-1] * p
print((dp[-(-N // 2) :].sum()))
| false | 42.857143 | [
"+from numpy import zeros",
"+",
"-dp = [1] + [0] * N",
"+dp = zeros(N + 1)",
"+dp[0] = 1.0",
"- dp = [p * a + (1 - p) * b for a, b in zip([0] + dp, dp)]",
"-print((sum(dp[-(-N // 2) :])))",
"+ T = dp",
"+ dp = T * (1 - p)",
"+ dp[1:] += T[:-1] * p",
"+print((dp[-(-N // 2) :].sum()))... | false | 0.033888 | 0.398041 | 0.085138 | [
"s883658326",
"s590579948"
] |
u257162238 | p02788 | python | s226840372 | s859486117 | 1,761 | 1,484 | 43,108 | 43,092 | Accepted | Accepted | 15.73 | import bisect
import operator
import collections
class RAQ():
def __init__(self, size):
"""初期化"""
self.size = size
self.sub = [0 for i in range(size + 1)]
self.r = 0
self.v = 0
@classmethod
def from_array(cls, a):
st = cls(len(a))
for i, x in enumerate(a):
st.add(i, i+1, x)
return st
def add(self, a, b, value):
"""区間[a, b) に対する加算"""
if a > b:
raise ValueError("a must be less than equal b.")
self.sub[a] += value
self.sub[b] -= value
def get(self, key):
"""値の取得"""
if key < self.r - 1:
self.r = 0
self.v = 0
for i in range(self.r, key):
self.v += self.sub[i]
self.r = key
return self.v + self.sub[key]
def read():
N, D, A = list(map(int, input().strip().split()))
XH = list()
for i in range(N):
x, h = list(map(int, input().strip().split()))
XH.append((x, h))
return N, D, A, XH
def solve(N, D, A, XH):
XH = sorted(XH)
X = [x for x, h in XH]
H = [h for x, h in XH]
st = RAQ.from_array(H)
ans = 0
i = 0
while i < N:
x = XH[i][0]
h = st.get(i)
c = h // A + (h % A > 0)
ans += c
v = c * A
lidx = bisect.bisect_left(X, x)
ridx = bisect.bisect_left(X, x + 2 * D + 1)
st.add(lidx, ridx, -v)
m = -1
i += 1
while i < N:
h = st.get(i)
if h > 0:
break
i += 1
return ans
if __name__ == "__main__":
inputs = read()
print(("%s" % solve(*inputs)))
| import bisect
import operator
import collections
import sys
input = sys.stdin.readline
class RAQ():
def __init__(self, size):
"""初期化"""
self.size = size
self.sub = [0 for i in range(size + 1)]
self.r = 0
self.v = 0
@classmethod
def from_array(cls, a):
st = cls(len(a))
for i, x in enumerate(a):
st.add(i, i+1, x)
return st
def add(self, a, b, value):
"""区間[a, b) に対する加算"""
if a > b:
raise ValueError("a must be less than equal b.")
self.sub[a] += value
self.sub[b] -= value
def get(self, key):
"""値の取得"""
if key < self.r - 1:
self.r = 0
self.v = 0
for i in range(self.r, key):
self.v += self.sub[i]
self.r = key
return self.v + self.sub[key]
def read():
N, D, A = list(map(int, input().strip().split()))
XH = list()
for i in range(N):
x, h = list(map(int, input().strip().split()))
XH.append((x, h))
return N, D, A, XH
def solve(N, D, A, XH):
XH = sorted(XH)
X = [x for x, h in XH]
H = [h for x, h in XH]
st = RAQ.from_array(H)
ans = 0
i = 0
while i < N:
x = XH[i][0]
h = st.get(i)
c = h // A + (h % A > 0)
ans += c
v = c * A
lidx = bisect.bisect_left(X, x)
ridx = bisect.bisect_left(X, x + 2 * D + 1)
st.add(lidx, ridx, -v)
m = -1
i += 1
while i < N:
h = st.get(i)
if h > 0:
break
i += 1
return ans
if __name__ == "__main__":
inputs = read()
print(("%s" % solve(*inputs)))
| 79 | 81 | 1,762 | 1,802 | import bisect
import operator
import collections
class RAQ:
def __init__(self, size):
"""初期化"""
self.size = size
self.sub = [0 for i in range(size + 1)]
self.r = 0
self.v = 0
@classmethod
def from_array(cls, a):
st = cls(len(a))
for i, x in enumerate(a):
st.add(i, i + 1, x)
return st
def add(self, a, b, value):
"""区間[a, b) に対する加算"""
if a > b:
raise ValueError("a must be less than equal b.")
self.sub[a] += value
self.sub[b] -= value
def get(self, key):
"""値の取得"""
if key < self.r - 1:
self.r = 0
self.v = 0
for i in range(self.r, key):
self.v += self.sub[i]
self.r = key
return self.v + self.sub[key]
def read():
N, D, A = list(map(int, input().strip().split()))
XH = list()
for i in range(N):
x, h = list(map(int, input().strip().split()))
XH.append((x, h))
return N, D, A, XH
def solve(N, D, A, XH):
XH = sorted(XH)
X = [x for x, h in XH]
H = [h for x, h in XH]
st = RAQ.from_array(H)
ans = 0
i = 0
while i < N:
x = XH[i][0]
h = st.get(i)
c = h // A + (h % A > 0)
ans += c
v = c * A
lidx = bisect.bisect_left(X, x)
ridx = bisect.bisect_left(X, x + 2 * D + 1)
st.add(lidx, ridx, -v)
m = -1
i += 1
while i < N:
h = st.get(i)
if h > 0:
break
i += 1
return ans
if __name__ == "__main__":
inputs = read()
print(("%s" % solve(*inputs)))
| import bisect
import operator
import collections
import sys
input = sys.stdin.readline
class RAQ:
def __init__(self, size):
"""初期化"""
self.size = size
self.sub = [0 for i in range(size + 1)]
self.r = 0
self.v = 0
@classmethod
def from_array(cls, a):
st = cls(len(a))
for i, x in enumerate(a):
st.add(i, i + 1, x)
return st
def add(self, a, b, value):
"""区間[a, b) に対する加算"""
if a > b:
raise ValueError("a must be less than equal b.")
self.sub[a] += value
self.sub[b] -= value
def get(self, key):
"""値の取得"""
if key < self.r - 1:
self.r = 0
self.v = 0
for i in range(self.r, key):
self.v += self.sub[i]
self.r = key
return self.v + self.sub[key]
def read():
N, D, A = list(map(int, input().strip().split()))
XH = list()
for i in range(N):
x, h = list(map(int, input().strip().split()))
XH.append((x, h))
return N, D, A, XH
def solve(N, D, A, XH):
XH = sorted(XH)
X = [x for x, h in XH]
H = [h for x, h in XH]
st = RAQ.from_array(H)
ans = 0
i = 0
while i < N:
x = XH[i][0]
h = st.get(i)
c = h // A + (h % A > 0)
ans += c
v = c * A
lidx = bisect.bisect_left(X, x)
ridx = bisect.bisect_left(X, x + 2 * D + 1)
st.add(lidx, ridx, -v)
m = -1
i += 1
while i < N:
h = st.get(i)
if h > 0:
break
i += 1
return ans
if __name__ == "__main__":
inputs = read()
print(("%s" % solve(*inputs)))
| false | 2.469136 | [
"+import sys",
"+",
"+input = sys.stdin.readline"
] | false | 0.039501 | 0.046502 | 0.849455 | [
"s226840372",
"s859486117"
] |
u729133443 | p03455 | python | s890162166 | s394811747 | 163 | 17 | 38,256 | 2,940 | Accepted | Accepted | 89.57 | print(('EOvdedn'[eval(input().replace(' ','*'))%2::2])) | print(('EOvdedn'[sum(s in'04'for s in eval(input()))<1::2])) | 1 | 1 | 53 | 52 | print(("EOvdedn"[eval(input().replace(" ", "*")) % 2 :: 2]))
| print(("EOvdedn"[sum(s in "04" for s in eval(input())) < 1 :: 2]))
| false | 0 | [
"-print((\"EOvdedn\"[eval(input().replace(\" \", \"*\")) % 2 :: 2]))",
"+print((\"EOvdedn\"[sum(s in \"04\" for s in eval(input())) < 1 :: 2]))"
] | false | 0.061992 | 0.036987 | 1.676036 | [
"s890162166",
"s394811747"
] |
u332385682 | p03846 | python | s866921470 | s494368645 | 113 | 93 | 13,880 | 18,272 | Accepted | Accepted | 17.7 |
N = int(eval(input()))
A = [int(a) for a in input().split()]
check = []
if N % 2 == 0:
for i in range(1, N, 2):
check += [i, i]
else:
check += [0]
for i in range(2, N, 2):
check += [i, i]
if check == sorted(A):
print(((2 ** (N // 2)) % (10 ** 9 + 7)))
else:
print((0)) | from collections import Counter
N = int(eval(input()))
A = [int(a) for a in input().split()]
check = {}
if N % 2 == 0:
for i in range(1, N, 2):
check[i] = 2
else:
check[0] = 1
for i in range(2, N, 2):
check[i] = 2
if check == Counter(A):
print(((2 ** (N // 2)) % (10 ** 9 + 7)))
else:
print((0)) | 19 | 20 | 317 | 349 | N = int(eval(input()))
A = [int(a) for a in input().split()]
check = []
if N % 2 == 0:
for i in range(1, N, 2):
check += [i, i]
else:
check += [0]
for i in range(2, N, 2):
check += [i, i]
if check == sorted(A):
print(((2 ** (N // 2)) % (10**9 + 7)))
else:
print((0))
| from collections import Counter
N = int(eval(input()))
A = [int(a) for a in input().split()]
check = {}
if N % 2 == 0:
for i in range(1, N, 2):
check[i] = 2
else:
check[0] = 1
for i in range(2, N, 2):
check[i] = 2
if check == Counter(A):
print(((2 ** (N // 2)) % (10**9 + 7)))
else:
print((0))
| false | 5 | [
"+from collections import Counter",
"+",
"-check = []",
"+check = {}",
"- check += [i, i]",
"+ check[i] = 2",
"- check += [0]",
"+ check[0] = 1",
"- check += [i, i]",
"-if check == sorted(A):",
"+ check[i] = 2",
"+if check == Counter(A):"
] | false | 0.037368 | 0.056387 | 0.662701 | [
"s866921470",
"s494368645"
] |
u879309973 | p03291 | python | s924326850 | s536651978 | 1,611 | 1,144 | 16,800 | 13,048 | Accepted | Accepted | 28.99 | import numpy as np
MOD = 10**9 + 7
def solve(s):
n = len(s)
dp = np.zeros((n+1, 4), dtype=int)
dp[0,0] = 1
for i in range(n):
t = 2 * int(s[i] == "?") + 1
dp[i+1] = t * dp[i] % MOD
if s[i] == "A":
dp[i+1,1] += dp[i,0]
elif s[i] == "B":
dp[i+1,2] += dp[i,1]
elif s[i] == "C":
dp[i+1,3] += dp[i,2]
else:
dp[i+1,1:] += dp[i,:-1]
return dp[n][3] % MOD
s = eval(input())
print((solve(s))) | import numpy as np
MOD = 10**9 + 7
def solve(s):
n = len(s)
a = np.zeros(4, dtype=int)
b = a.copy()
a[0] = 1
for c in s:
t = 2 * int(c == "?") + 1
b = t * a % MOD
if c == "A":
b[1] += a[0]
elif c == "B":
b[2] += a[1]
elif c == "C":
b[3] += a[2]
else:
b[1:] += a[:-1]
a = b
return a[3] % MOD
s = eval(input())
print((solve(s))) | 21 | 23 | 512 | 469 | import numpy as np
MOD = 10**9 + 7
def solve(s):
n = len(s)
dp = np.zeros((n + 1, 4), dtype=int)
dp[0, 0] = 1
for i in range(n):
t = 2 * int(s[i] == "?") + 1
dp[i + 1] = t * dp[i] % MOD
if s[i] == "A":
dp[i + 1, 1] += dp[i, 0]
elif s[i] == "B":
dp[i + 1, 2] += dp[i, 1]
elif s[i] == "C":
dp[i + 1, 3] += dp[i, 2]
else:
dp[i + 1, 1:] += dp[i, :-1]
return dp[n][3] % MOD
s = eval(input())
print((solve(s)))
| import numpy as np
MOD = 10**9 + 7
def solve(s):
n = len(s)
a = np.zeros(4, dtype=int)
b = a.copy()
a[0] = 1
for c in s:
t = 2 * int(c == "?") + 1
b = t * a % MOD
if c == "A":
b[1] += a[0]
elif c == "B":
b[2] += a[1]
elif c == "C":
b[3] += a[2]
else:
b[1:] += a[:-1]
a = b
return a[3] % MOD
s = eval(input())
print((solve(s)))
| false | 8.695652 | [
"- dp = np.zeros((n + 1, 4), dtype=int)",
"- dp[0, 0] = 1",
"- for i in range(n):",
"- t = 2 * int(s[i] == \"?\") + 1",
"- dp[i + 1] = t * dp[i] % MOD",
"- if s[i] == \"A\":",
"- dp[i + 1, 1] += dp[i, 0]",
"- elif s[i] == \"B\":",
"- dp[i + ... | false | 0.394983 | 0.24803 | 1.592482 | [
"s924326850",
"s536651978"
] |
u063052907 | p03262 | python | s377687088 | s830274722 | 132 | 97 | 16,308 | 16,280 | Accepted | Accepted | 26.52 | from functools import reduce
from fractions import gcd
def gcd_arg(lst):
return reduce(gcd, lst)
N, X = list(map(int, input().split()))
lst_x = list(map(int, input().split())) + [X]
lst_x.sort()
lst_diff = [lst_x[i] - lst_x[i-1] for i in range(1, N+1)]
ans = gcd_arg(lst_diff)
print(ans)
| from fractions import gcd
N, X = list(map(int, input().split()))
lst_x = list(map(int, input().split()))
ans = abs(X - lst_x[0])
for x in lst_x[1::]:
ans = gcd(ans, abs(X - x))
print(ans)
| 14 | 11 | 303 | 200 | from functools import reduce
from fractions import gcd
def gcd_arg(lst):
return reduce(gcd, lst)
N, X = list(map(int, input().split()))
lst_x = list(map(int, input().split())) + [X]
lst_x.sort()
lst_diff = [lst_x[i] - lst_x[i - 1] for i in range(1, N + 1)]
ans = gcd_arg(lst_diff)
print(ans)
| from fractions import gcd
N, X = list(map(int, input().split()))
lst_x = list(map(int, input().split()))
ans = abs(X - lst_x[0])
for x in lst_x[1::]:
ans = gcd(ans, abs(X - x))
print(ans)
| false | 21.428571 | [
"-from functools import reduce",
"-",
"-def gcd_arg(lst):",
"- return reduce(gcd, lst)",
"-",
"-",
"-lst_x = list(map(int, input().split())) + [X]",
"-lst_x.sort()",
"-lst_diff = [lst_x[i] - lst_x[i - 1] for i in range(1, N + 1)]",
"-ans = gcd_arg(lst_diff)",
"+lst_x = list(map(int, input().s... | false | 0.049865 | 0.007173 | 6.951289 | [
"s377687088",
"s830274722"
] |
u145950990 | p03260 | python | s300206111 | s676658394 | 164 | 30 | 38,256 | 9,076 | Accepted | Accepted | 81.71 | a,b = list(map(int,input().split()))
print(('Yes' if a*b%2==1 else 'No')) | a,b = list(map(int,input().split()))
if a*b%2==0:
print('No')
else:
print('Yes') | 2 | 5 | 66 | 86 | a, b = list(map(int, input().split()))
print(("Yes" if a * b % 2 == 1 else "No"))
| a, b = list(map(int, input().split()))
if a * b % 2 == 0:
print("No")
else:
print("Yes")
| false | 60 | [
"-print((\"Yes\" if a * b % 2 == 1 else \"No\"))",
"+if a * b % 2 == 0:",
"+ print(\"No\")",
"+else:",
"+ print(\"Yes\")"
] | false | 0.036157 | 0.037583 | 0.962057 | [
"s300206111",
"s676658394"
] |
u936985471 | p03854 | python | s559298924 | s383455888 | 74 | 60 | 3,492 | 3,432 | Accepted | Accepted | 18.92 | S=eval(input())
datas=["dream","dreamer","erase","eraser"]
stack=[]
stack.append(0)
while stack:
index=stack.pop()
if index==len(S):
print("YES")
break
for data in datas:
if index+len(data)>len(S):
continue
if S[index:index+len(data)]==data:
stack.append(index+len(data))
else:
print("NO") | S=eval(input())
W=("dream","dreamer","erase","eraser")
s=[0]
while s:
i=s.pop()
if i==len(S):
print("YES")
break
for w in W:
if S[i:i+len(w)]==w:
s.append(i+len(w))
else:
print("NO") | 16 | 13 | 334 | 214 | S = eval(input())
datas = ["dream", "dreamer", "erase", "eraser"]
stack = []
stack.append(0)
while stack:
index = stack.pop()
if index == len(S):
print("YES")
break
for data in datas:
if index + len(data) > len(S):
continue
if S[index : index + len(data)] == data:
stack.append(index + len(data))
else:
print("NO")
| S = eval(input())
W = ("dream", "dreamer", "erase", "eraser")
s = [0]
while s:
i = s.pop()
if i == len(S):
print("YES")
break
for w in W:
if S[i : i + len(w)] == w:
s.append(i + len(w))
else:
print("NO")
| false | 18.75 | [
"-datas = [\"dream\", \"dreamer\", \"erase\", \"eraser\"]",
"-stack = []",
"-stack.append(0)",
"-while stack:",
"- index = stack.pop()",
"- if index == len(S):",
"+W = (\"dream\", \"dreamer\", \"erase\", \"eraser\")",
"+s = [0]",
"+while s:",
"+ i = s.pop()",
"+ if i == len(S):",
"... | false | 0.045732 | 0.056912 | 0.803557 | [
"s559298924",
"s383455888"
] |
u226155577 | p03203 | python | s420999253 | s621279765 | 1,036 | 599 | 65,996 | 30,168 | Accepted | Accepted | 42.18 | H, W, N = list(map(int, input().split()))
Y = [W+100]*(H+1)
P = [[] for i in range(W+1)]
for i in range(N):
x, y = list(map(int, input().split()))
if x < y:
continue
Y[x-y] = min(Y[x-y], y-1)
P[y-1].append(x-1)
base = 0
ans = H
for y in range(W):
while Y[base] == y:
base += 1
xmin = y + base
for x in P[y]:
if xmin <= x:
ans = min(x, ans)
print(ans) | readline = open(0).readline
write = open(1, 'w').write
H, W, N = list(map(int, readline().split()))
Y = [W+1]*(H+1)
P = [[] for i in range(W+1)]
for i in range(N):
x, y = list(map(int, readline().split()))
if x < y:
continue
Y[x-y] = min(Y[x-y], y-1)
P[y-1].append(x-1)
base = 0
ans = H
for y in range(W):
while Y[base] == y:
base += 1
xmin = y + base
for x in P[y]:
if xmin <= x:
ans = min(x, ans)
write("%d\n" % ans) | 20 | 23 | 422 | 494 | H, W, N = list(map(int, input().split()))
Y = [W + 100] * (H + 1)
P = [[] for i in range(W + 1)]
for i in range(N):
x, y = list(map(int, input().split()))
if x < y:
continue
Y[x - y] = min(Y[x - y], y - 1)
P[y - 1].append(x - 1)
base = 0
ans = H
for y in range(W):
while Y[base] == y:
base += 1
xmin = y + base
for x in P[y]:
if xmin <= x:
ans = min(x, ans)
print(ans)
| readline = open(0).readline
write = open(1, "w").write
H, W, N = list(map(int, readline().split()))
Y = [W + 1] * (H + 1)
P = [[] for i in range(W + 1)]
for i in range(N):
x, y = list(map(int, readline().split()))
if x < y:
continue
Y[x - y] = min(Y[x - y], y - 1)
P[y - 1].append(x - 1)
base = 0
ans = H
for y in range(W):
while Y[base] == y:
base += 1
xmin = y + base
for x in P[y]:
if xmin <= x:
ans = min(x, ans)
write("%d\n" % ans)
| false | 13.043478 | [
"-H, W, N = list(map(int, input().split()))",
"-Y = [W + 100] * (H + 1)",
"+readline = open(0).readline",
"+write = open(1, \"w\").write",
"+H, W, N = list(map(int, readline().split()))",
"+Y = [W + 1] * (H + 1)",
"- x, y = list(map(int, input().split()))",
"+ x, y = list(map(int, readline().spl... | false | 0.134356 | 0.062983 | 2.133211 | [
"s420999253",
"s621279765"
] |
u620084012 | p03151 | python | s323377782 | s778629422 | 282 | 133 | 82,224 | 93,804 | Accepted | Accepted | 52.84 | N = int(eval(input()))
A = list(map(int,input().split()))
B = list(map(int,input().split()))
if sum(A) < sum(B):
print((-1))
exit(0)
t = 0
m = 0
L = []
for k in range(N):
if A[k] > B[k]:
L.append(A[k]-B[k])
else:
m += B[k] - A[k]
t += 1
if m == 0:
print((0))
exit(0)
L = (sorted(L))[::-1]
for e in L:
m -= e
t += 1
if m <= 0:
break
print(t) | N = int(eval(input()))
A = list(map(int,input().split()))
B = list(map(int,input().split()))
if sum(A) < sum(B):
print((-1))
exit(0)
C = [A[k]-B[k] for k in range(N)]
C.sort()
t = 0
ans = 0
for k in range(N):
if C[k] >= 0:
break
else:
t -= C[k]
ans += 1
for k in range(N-1,-1,-1):
if t <= 0:
break
else:
t -= C[k]
ans += 1
print(ans)
| 29 | 26 | 430 | 426 | N = int(eval(input()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
if sum(A) < sum(B):
print((-1))
exit(0)
t = 0
m = 0
L = []
for k in range(N):
if A[k] > B[k]:
L.append(A[k] - B[k])
else:
m += B[k] - A[k]
t += 1
if m == 0:
print((0))
exit(0)
L = (sorted(L))[::-1]
for e in L:
m -= e
t += 1
if m <= 0:
break
print(t)
| N = int(eval(input()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
if sum(A) < sum(B):
print((-1))
exit(0)
C = [A[k] - B[k] for k in range(N)]
C.sort()
t = 0
ans = 0
for k in range(N):
if C[k] >= 0:
break
else:
t -= C[k]
ans += 1
for k in range(N - 1, -1, -1):
if t <= 0:
break
else:
t -= C[k]
ans += 1
print(ans)
| false | 10.344828 | [
"+C = [A[k] - B[k] for k in range(N)]",
"+C.sort()",
"-m = 0",
"-L = []",
"+ans = 0",
"- if A[k] > B[k]:",
"- L.append(A[k] - B[k])",
"+ if C[k] >= 0:",
"+ break",
"- m += B[k] - A[k]",
"- t += 1",
"-if m == 0:",
"- print((0))",
"- exit(0)",
"-L = ... | false | 0.04716 | 0.06586 | 0.716067 | [
"s323377782",
"s778629422"
] |
u013513417 | p03160 | python | s762256106 | s339843886 | 179 | 127 | 13,928 | 24,340 | Accepted | Accepted | 29.05 | N=int(eval(input()))
L=list(map(int,input().split()))
S=[0]*100010
for i in range(N):
S[i]=L[i]
DP=[10**12]*100010
DP[0]=0
for i in range(N):
if DP[i+1]>DP[i]+abs(S[i+1]-S[i]):
DP[i+1]=DP[i]+abs(S[i+1]-S[i])
if DP[i+2]>DP[i]+abs(S[i+2]-S[i]):
DP[i+2]=DP[i]+abs(S[i+2]-S[i])
print((DP[N-1]))
| N=int(eval(input()))
S=list(map(int,input().split()))
DP=[10**6]*(10**6)
def chmin(a,b):
if a>b:
return b
else:
return a
def chmax(a,b):
if a>b:
return a
else:
return b
DP[0]=0
DP[1]=abs(S[1]-S[0])
for i in range(2,N):
DP[i]=chmin(DP[i-1]+abs(S[i-1]-S[i]),DP[i-2]+abs(S[i-2]-S[i]))
print((DP[N-1])) | 20 | 24 | 348 | 375 | N = int(eval(input()))
L = list(map(int, input().split()))
S = [0] * 100010
for i in range(N):
S[i] = L[i]
DP = [10**12] * 100010
DP[0] = 0
for i in range(N):
if DP[i + 1] > DP[i] + abs(S[i + 1] - S[i]):
DP[i + 1] = DP[i] + abs(S[i + 1] - S[i])
if DP[i + 2] > DP[i] + abs(S[i + 2] - S[i]):
DP[i + 2] = DP[i] + abs(S[i + 2] - S[i])
print((DP[N - 1]))
| N = int(eval(input()))
S = list(map(int, input().split()))
DP = [10**6] * (10**6)
def chmin(a, b):
if a > b:
return b
else:
return a
def chmax(a, b):
if a > b:
return a
else:
return b
DP[0] = 0
DP[1] = abs(S[1] - S[0])
for i in range(2, N):
DP[i] = chmin(DP[i - 1] + abs(S[i - 1] - S[i]), DP[i - 2] + abs(S[i - 2] - S[i]))
print((DP[N - 1]))
| false | 16.666667 | [
"-L = list(map(int, input().split()))",
"-S = [0] * 100010",
"-for i in range(N):",
"- S[i] = L[i]",
"-DP = [10**12] * 100010",
"+S = list(map(int, input().split()))",
"+DP = [10**6] * (10**6)",
"+",
"+",
"+def chmin(a, b):",
"+ if a > b:",
"+ return b",
"+ else:",
"+ ... | false | 0.042998 | 0.149236 | 0.288117 | [
"s762256106",
"s339843886"
] |
u998435601 | p02402 | python | s162985848 | s179365337 | 20 | 10 | 7,056 | 7,088 | Accepted | Accepted | 50 | n = eval(input())
lis = list(map(int, input().split()))
mn = lis[0]
mx = lis[0]
for t in lis:
if mn > t:
mn = t
if mx < t:
mx = t
print(mn, mx, sum(lis)) | n = eval(input())
lis = list(map(int, input().split()))
mn = lis[0]
mx = lis[0]
for t in lis:
if mn > t:
mn = t
if mx < t:
mx = t
print("%s %s %s" % (mn, mx, sum(lis))) | 10 | 10 | 159 | 174 | n = eval(input())
lis = list(map(int, input().split()))
mn = lis[0]
mx = lis[0]
for t in lis:
if mn > t:
mn = t
if mx < t:
mx = t
print(mn, mx, sum(lis))
| n = eval(input())
lis = list(map(int, input().split()))
mn = lis[0]
mx = lis[0]
for t in lis:
if mn > t:
mn = t
if mx < t:
mx = t
print("%s %s %s" % (mn, mx, sum(lis)))
| false | 0 | [
"-print(mn, mx, sum(lis))",
"+print(\"%s %s %s\" % (mn, mx, sum(lis)))"
] | false | 0.039692 | 0.043307 | 0.916544 | [
"s162985848",
"s179365337"
] |
u592547545 | p02767 | python | s348992393 | s228547898 | 20 | 18 | 3,064 | 3,064 | Accepted | Accepted | 10 | def readinput():
n=int(eval(input()))
x=list(map(int,input().split()))
return n,x
def mean(x):
sum=0
for _ in x:
sum+=_
return sum/len(x)
def rss(x,xbar):
sum=0
for _ in x:
sum+=(_-xbar)**2
return sum
def main(n,x):
ans=0
xbar=mean(x)
xbar_int=xbar//1
if(xbar-xbar_int >0.5):
xbar_int+=1
ans=rss(x,xbar_int)
return int(ans)
def main2(n,x):
xmin=min(x)
xmax=max(x)
minsum=1000000
for p in range(xmin,xmax+1):
sum=0
for xx in x:
sum+=(xx-p)**2
if(sum<minsum):
minsum=sum
return minsum
if __name__=='__main__':
n,x=readinput()
ans=main2(n,x)
print(ans) | def readinput():
n=int(eval(input()))
x=list(map(int,input().split()))
return n,x
def mean(x):
sum=0
for _ in x:
sum+=_
return sum/len(x)
def rss(x,xbar):
sum=0
for _ in x:
sum+=(_-xbar)**2
return sum
def main(n,x):
ans=0
xbar=mean(x)
xbar_int=xbar//1
if(xbar-xbar_int >0.5):
xbar_int+=1
ans=rss(x,xbar_int)
return int(ans)
def main2(n,x):
xmin=min(x)
xmax=max(x)
minsum=1000000
for p in range(xmin,xmax+1):
sum=0
for xx in x:
sum+=(xx-p)**2
if(sum<minsum):
minsum=sum
return minsum
if __name__=='__main__':
n,x=readinput()
ans=main(n,x)
print(ans)
| 44 | 44 | 757 | 757 | def readinput():
n = int(eval(input()))
x = list(map(int, input().split()))
return n, x
def mean(x):
sum = 0
for _ in x:
sum += _
return sum / len(x)
def rss(x, xbar):
sum = 0
for _ in x:
sum += (_ - xbar) ** 2
return sum
def main(n, x):
ans = 0
xbar = mean(x)
xbar_int = xbar // 1
if xbar - xbar_int > 0.5:
xbar_int += 1
ans = rss(x, xbar_int)
return int(ans)
def main2(n, x):
xmin = min(x)
xmax = max(x)
minsum = 1000000
for p in range(xmin, xmax + 1):
sum = 0
for xx in x:
sum += (xx - p) ** 2
if sum < minsum:
minsum = sum
return minsum
if __name__ == "__main__":
n, x = readinput()
ans = main2(n, x)
print(ans)
| def readinput():
n = int(eval(input()))
x = list(map(int, input().split()))
return n, x
def mean(x):
sum = 0
for _ in x:
sum += _
return sum / len(x)
def rss(x, xbar):
sum = 0
for _ in x:
sum += (_ - xbar) ** 2
return sum
def main(n, x):
ans = 0
xbar = mean(x)
xbar_int = xbar // 1
if xbar - xbar_int > 0.5:
xbar_int += 1
ans = rss(x, xbar_int)
return int(ans)
def main2(n, x):
xmin = min(x)
xmax = max(x)
minsum = 1000000
for p in range(xmin, xmax + 1):
sum = 0
for xx in x:
sum += (xx - p) ** 2
if sum < minsum:
minsum = sum
return minsum
if __name__ == "__main__":
n, x = readinput()
ans = main(n, x)
print(ans)
| false | 0 | [
"- ans = main2(n, x)",
"+ ans = main(n, x)"
] | false | 0.03651 | 0.039241 | 0.930421 | [
"s348992393",
"s228547898"
] |
u413019025 | p03611 | python | s034093515 | s808364697 | 91 | 66 | 14,300 | 14,300 | Accepted | Accepted | 27.47 | #!/usr/bin/env python3
import sys
sys.setrecursionlimit(10**7)
def read_h(typ=int):
return list(map(typ, input().split()))
def read_v(n, m=1, typ=int):
return [read_h() if m > 1 else typ(eval(input())) for _ in range(n)]
def main():
N, = read_h()
arr = read_h()
from collections import Counter
c = Counter(arr)
cnt = 0
for X in list(c.keys()):
cnt = max(cnt, c.get(X - 1, 0) + c.get(X, 0) + c.get(X + 1, 0))
print(cnt)
if __name__ == '__main__':
main()
| #!/usr/bin/env python3
import sys
sys.setrecursionlimit(10**7)
def read_h(typ=int):
return list(map(typ, input().split()))
def read_v(n, m=1, typ=int):
return [read_h() if m > 1 else typ(eval(input())) for _ in range(n)]
def main():
N, = read_h()
arr = read_h()
cnts = [0] * 100000
for a in arr:
cnts[a] += 1
ans = 0
for i in range(len(cnts) - 2):
c = cnts[i] + cnts[i + 1] + cnts[i + 2]
if c > ans:
ans = c
print(ans)
if __name__ == '__main__':
main()
| 31 | 34 | 532 | 569 | #!/usr/bin/env python3
import sys
sys.setrecursionlimit(10**7)
def read_h(typ=int):
return list(map(typ, input().split()))
def read_v(n, m=1, typ=int):
return [read_h() if m > 1 else typ(eval(input())) for _ in range(n)]
def main():
(N,) = read_h()
arr = read_h()
from collections import Counter
c = Counter(arr)
cnt = 0
for X in list(c.keys()):
cnt = max(cnt, c.get(X - 1, 0) + c.get(X, 0) + c.get(X + 1, 0))
print(cnt)
if __name__ == "__main__":
main()
| #!/usr/bin/env python3
import sys
sys.setrecursionlimit(10**7)
def read_h(typ=int):
return list(map(typ, input().split()))
def read_v(n, m=1, typ=int):
return [read_h() if m > 1 else typ(eval(input())) for _ in range(n)]
def main():
(N,) = read_h()
arr = read_h()
cnts = [0] * 100000
for a in arr:
cnts[a] += 1
ans = 0
for i in range(len(cnts) - 2):
c = cnts[i] + cnts[i + 1] + cnts[i + 2]
if c > ans:
ans = c
print(ans)
if __name__ == "__main__":
main()
| false | 8.823529 | [
"- from collections import Counter",
"-",
"- c = Counter(arr)",
"- cnt = 0",
"- for X in list(c.keys()):",
"- cnt = max(cnt, c.get(X - 1, 0) + c.get(X, 0) + c.get(X + 1, 0))",
"- print(cnt)",
"+ cnts = [0] * 100000",
"+ for a in arr:",
"+ cnts[a] += 1",
"+ a... | false | 0.074242 | 0.066504 | 1.116341 | [
"s034093515",
"s808364697"
] |
u581187895 | p02685 | python | s398177660 | s901069791 | 671 | 351 | 33,004 | 32,908 | Accepted | Accepted | 47.69 | import sys
sys.setrecursionlimit(10 ** 7)
read = sys.stdin.buffer.read
inp = sys.stdin.buffer.readline
def resolve():
# nCk = n! / n!(n-k)! のテーブル作成
def COMinit(n, MOD):
fact = [1, 1]
fact_inv = [1, 1]
inv = [0, 1]
for i in range(2, n + 1):
fact.append((fact[-1] * i) % MOD)
inv.append((-inv[MOD % i] * (MOD // i)) % MOD)
fact_inv.append((fact_inv[-1] * inv[i]) % MOD)
return fact, fact_inv
# 二項係数計算
def Combination(n, k, MOD=998244353):
# fac, finv = COMinit(n, MOD)
if n < k: return 0
if n < 0 or k < 0: return 0
ret = fac[n] * (finv[k] * finv[n - k] % MOD) % MOD
return ret
MOD = 998244353
N, M, K = list(map(int, inp().split()))
# テーブルを作成し、K回使いまわす
fac, finv = COMinit(N-1, MOD)
ans = 0
for k in range(K+1):
cmb = Combination(N-1, k)
m_pow = pow(M-1, (N-k-1), MOD)
ans += M * m_pow * cmb
ans %= MOD
print(ans)
if __name__ == "__main__":
resolve() |
def resolve():
# nCk = n! / n!(n-k)! のテーブル作成
def COMinit(n, MOD):
fact = [1, 1]
fact_inv = [1, 1]
inv = [0, 1]
for i in range(2, n + 1):
fact.append((fact[-1] * i) % MOD)
inv.append((-inv[MOD % i] * (MOD // i)) % MOD)
fact_inv.append((fact_inv[-1] * inv[i]) % MOD)
return fact, fact_inv
# 二項係数計算
def Combination(n, k, MOD=998244353):
# fac, finv = COMinit(n, MOD)
if n < k: return 0
if n < 0 or k < 0: return 0
ret = fac[n] * (finv[k] * finv[n - k] % MOD) % MOD
return ret
MOD = 998244353
N, M, K = list(map(int, input().split()))
# テーブルを作成し、K回使いまわす
fac, finv = COMinit(N-1, MOD)
m_mod = [1]
for _ in range(N):
m_mod.append(m_mod[-1] * (M - 1) % MOD)
ans = 0
for k in range(K+1):
cmb = Combination(N-1, k)
ans += (M%MOD) * (m_mod[N-k-1]%MOD) * cmb
ans %= MOD
print(ans)
if __name__ == "__main__":
resolve() | 42 | 40 | 1,094 | 1,050 | import sys
sys.setrecursionlimit(10**7)
read = sys.stdin.buffer.read
inp = sys.stdin.buffer.readline
def resolve():
# nCk = n! / n!(n-k)! のテーブル作成
def COMinit(n, MOD):
fact = [1, 1]
fact_inv = [1, 1]
inv = [0, 1]
for i in range(2, n + 1):
fact.append((fact[-1] * i) % MOD)
inv.append((-inv[MOD % i] * (MOD // i)) % MOD)
fact_inv.append((fact_inv[-1] * inv[i]) % MOD)
return fact, fact_inv
# 二項係数計算
def Combination(n, k, MOD=998244353):
# fac, finv = COMinit(n, MOD)
if n < k:
return 0
if n < 0 or k < 0:
return 0
ret = fac[n] * (finv[k] * finv[n - k] % MOD) % MOD
return ret
MOD = 998244353
N, M, K = list(map(int, inp().split()))
# テーブルを作成し、K回使いまわす
fac, finv = COMinit(N - 1, MOD)
ans = 0
for k in range(K + 1):
cmb = Combination(N - 1, k)
m_pow = pow(M - 1, (N - k - 1), MOD)
ans += M * m_pow * cmb
ans %= MOD
print(ans)
if __name__ == "__main__":
resolve()
| def resolve():
# nCk = n! / n!(n-k)! のテーブル作成
def COMinit(n, MOD):
fact = [1, 1]
fact_inv = [1, 1]
inv = [0, 1]
for i in range(2, n + 1):
fact.append((fact[-1] * i) % MOD)
inv.append((-inv[MOD % i] * (MOD // i)) % MOD)
fact_inv.append((fact_inv[-1] * inv[i]) % MOD)
return fact, fact_inv
# 二項係数計算
def Combination(n, k, MOD=998244353):
# fac, finv = COMinit(n, MOD)
if n < k:
return 0
if n < 0 or k < 0:
return 0
ret = fac[n] * (finv[k] * finv[n - k] % MOD) % MOD
return ret
MOD = 998244353
N, M, K = list(map(int, input().split()))
# テーブルを作成し、K回使いまわす
fac, finv = COMinit(N - 1, MOD)
m_mod = [1]
for _ in range(N):
m_mod.append(m_mod[-1] * (M - 1) % MOD)
ans = 0
for k in range(K + 1):
cmb = Combination(N - 1, k)
ans += (M % MOD) * (m_mod[N - k - 1] % MOD) * cmb
ans %= MOD
print(ans)
if __name__ == "__main__":
resolve()
| false | 4.761905 | [
"-import sys",
"-",
"-sys.setrecursionlimit(10**7)",
"-read = sys.stdin.buffer.read",
"-inp = sys.stdin.buffer.readline",
"-",
"-",
"- N, M, K = list(map(int, inp().split()))",
"+ N, M, K = list(map(int, input().split()))",
"+ m_mod = [1]",
"+ for _ in range(N):",
"+ m_mod.a... | false | 0.151186 | 0.343868 | 0.439665 | [
"s398177660",
"s901069791"
] |
u680851063 | p02720 | python | s490784508 | s212204558 | 332 | 116 | 15,824 | 7,152 | Accepted | Accepted | 65.06 | n = int(eval(input()))
l = [_ for _ in range(1,10)]
for i in range(10**5):
if str(l[i])[-1] == '0':
l.append(l[i]*10 + int(str(l[i])[-1]))
l.append(l[i]*10 + int(str(l[i])[-1]) + 1)
elif str(l[i])[-1] == '9':
l.append(l[i]*10 + int(str(l[i])[-1]) - 1)
l.append(l[i]*10 + int(str(l[i])[-1]))
else:
l.append(l[i]*10 + int(str(l[i])[-1]) - 1)
l.append(l[i]*10 + int(str(l[i])[-1]))
l.append(l[i]*10 + int(str(l[i])[-1]) + 1)
print((l[n-1])) | n = int(eval(input()))
l = [_ for _ in range(1,10)]
cnt = 9
for i in range(10**5):
if cnt >= n:
break
if str(l[i])[-1] == '0':
l.append(l[i]*10 + int(str(l[i])[-1]))
l.append(l[i]*10 + int(str(l[i])[-1]) + 1)
cnt += 2
elif str(l[i])[-1] == '9':
l.append(l[i]*10 + int(str(l[i])[-1]) - 1)
l.append(l[i]*10 + int(str(l[i])[-1]))
cnt += 2
else:
l.append(l[i]*10 + int(str(l[i])[-1]) - 1)
l.append(l[i]*10 + int(str(l[i])[-1]))
l.append(l[i]*10 + int(str(l[i])[-1]) + 1)
cnt += 3
print((l[n-1])) | 18 | 24 | 518 | 614 | n = int(eval(input()))
l = [_ for _ in range(1, 10)]
for i in range(10**5):
if str(l[i])[-1] == "0":
l.append(l[i] * 10 + int(str(l[i])[-1]))
l.append(l[i] * 10 + int(str(l[i])[-1]) + 1)
elif str(l[i])[-1] == "9":
l.append(l[i] * 10 + int(str(l[i])[-1]) - 1)
l.append(l[i] * 10 + int(str(l[i])[-1]))
else:
l.append(l[i] * 10 + int(str(l[i])[-1]) - 1)
l.append(l[i] * 10 + int(str(l[i])[-1]))
l.append(l[i] * 10 + int(str(l[i])[-1]) + 1)
print((l[n - 1]))
| n = int(eval(input()))
l = [_ for _ in range(1, 10)]
cnt = 9
for i in range(10**5):
if cnt >= n:
break
if str(l[i])[-1] == "0":
l.append(l[i] * 10 + int(str(l[i])[-1]))
l.append(l[i] * 10 + int(str(l[i])[-1]) + 1)
cnt += 2
elif str(l[i])[-1] == "9":
l.append(l[i] * 10 + int(str(l[i])[-1]) - 1)
l.append(l[i] * 10 + int(str(l[i])[-1]))
cnt += 2
else:
l.append(l[i] * 10 + int(str(l[i])[-1]) - 1)
l.append(l[i] * 10 + int(str(l[i])[-1]))
l.append(l[i] * 10 + int(str(l[i])[-1]) + 1)
cnt += 3
print((l[n - 1]))
| false | 25 | [
"+cnt = 9",
"+ if cnt >= n:",
"+ break",
"+ cnt += 2",
"+ cnt += 2",
"+ cnt += 3"
] | false | 0.628743 | 0.062219 | 10.105351 | [
"s490784508",
"s212204558"
] |
u017810624 | p03112 | python | s081591706 | s826165174 | 1,511 | 747 | 85,676 | 65,628 | Accepted | Accepted | 50.56 | import bisect
a,b,q=list(map(int,input().split()))
s=[-999999999999]+[int(eval(input())) for i in range(a)]+[999999999999]
t=[-999999999999]+[int(eval(input())) for i in range(b)]+[999999999999]
x=[int(eval(input())) for i in range(q)]
for i in range(q):
a1=s[bisect.bisect_left(s,x[i])-1]
a2=s[bisect.bisect_left(s,x[i])]
b1=t[bisect.bisect_left(t,x[i])-1]
b2=t[bisect.bisect_left(t,x[i])]
l=[]
for j in [a1,a2]:
for k in [b1,b2]:
l.append(abs(j-k)+min(abs(x[i]-j),abs(x[i]-k)))
print((min(l))) | import bisect
import sys
input=sys.stdin.readline
a,b,q=list(map(int,input().split()))
s=[-999999999999]+[int(eval(input())) for i in range(a)]+[999999999999]
t=[-999999999999]+[int(eval(input())) for i in range(b)]+[999999999999]
x=[int(eval(input())) for i in range(q)]
for i in range(q):
a1=s[bisect.bisect_left(s,x[i])-1]
a2=s[bisect.bisect_left(s,x[i])]
b1=t[bisect.bisect_left(t,x[i])-1]
b2=t[bisect.bisect_left(t,x[i])]
l=[]
for j in [a1,a2]:
for k in [b1,b2]:
l.append(abs(j-k)+min(abs(x[i]-j),abs(x[i]-k)))
print((min(l))) | 15 | 17 | 507 | 545 | import bisect
a, b, q = list(map(int, input().split()))
s = [-999999999999] + [int(eval(input())) for i in range(a)] + [999999999999]
t = [-999999999999] + [int(eval(input())) for i in range(b)] + [999999999999]
x = [int(eval(input())) for i in range(q)]
for i in range(q):
a1 = s[bisect.bisect_left(s, x[i]) - 1]
a2 = s[bisect.bisect_left(s, x[i])]
b1 = t[bisect.bisect_left(t, x[i]) - 1]
b2 = t[bisect.bisect_left(t, x[i])]
l = []
for j in [a1, a2]:
for k in [b1, b2]:
l.append(abs(j - k) + min(abs(x[i] - j), abs(x[i] - k)))
print((min(l)))
| import bisect
import sys
input = sys.stdin.readline
a, b, q = list(map(int, input().split()))
s = [-999999999999] + [int(eval(input())) for i in range(a)] + [999999999999]
t = [-999999999999] + [int(eval(input())) for i in range(b)] + [999999999999]
x = [int(eval(input())) for i in range(q)]
for i in range(q):
a1 = s[bisect.bisect_left(s, x[i]) - 1]
a2 = s[bisect.bisect_left(s, x[i])]
b1 = t[bisect.bisect_left(t, x[i]) - 1]
b2 = t[bisect.bisect_left(t, x[i])]
l = []
for j in [a1, a2]:
for k in [b1, b2]:
l.append(abs(j - k) + min(abs(x[i] - j), abs(x[i] - k)))
print((min(l)))
| false | 11.764706 | [
"+import sys",
"+input = sys.stdin.readline"
] | false | 0.076709 | 0.040802 | 1.880004 | [
"s081591706",
"s826165174"
] |
u392319141 | p02881 | python | s849751093 | s201045852 | 140 | 120 | 2,940 | 3,268 | Accepted | Accepted | 14.29 | N = int(eval(input()))
ans = N - 1
for i in range(1, int(N**0.5) + 100):
if N % i != 0:
continue
j = N // i
ans = min(ans, i + j - 2)
print(ans)
| N = int(eval(input()))
# 約数の全列挙
def divisors(n):
divisors = []
R = int(n**(0.5)) + 1
for i in range(1, R):
if n % i == 0:
divisors.append(i)
if i != n // i:
divisors.append(n // i)
# divisors.sort(reverse=True) # ソート
return divisors
ans = 10**18
for d in divisors(N):
k = N // d
ans = min(ans, d + k - 2)
print(ans)
| 9 | 20 | 168 | 409 | N = int(eval(input()))
ans = N - 1
for i in range(1, int(N**0.5) + 100):
if N % i != 0:
continue
j = N // i
ans = min(ans, i + j - 2)
print(ans)
| N = int(eval(input()))
# 約数の全列挙
def divisors(n):
divisors = []
R = int(n ** (0.5)) + 1
for i in range(1, R):
if n % i == 0:
divisors.append(i)
if i != n // i:
divisors.append(n // i)
# divisors.sort(reverse=True) # ソート
return divisors
ans = 10**18
for d in divisors(N):
k = N // d
ans = min(ans, d + k - 2)
print(ans)
| false | 55 | [
"-ans = N - 1",
"-for i in range(1, int(N**0.5) + 100):",
"- if N % i != 0:",
"- continue",
"- j = N // i",
"- ans = min(ans, i + j - 2)",
"+# 約数の全列挙",
"+def divisors(n):",
"+ divisors = []",
"+ R = int(n ** (0.5)) + 1",
"+ for i in range(1, R):",
"+ if n % i ==... | false | 0.046531 | 0.085599 | 0.543592 | [
"s849751093",
"s201045852"
] |
u474232743 | p02413 | python | s223306364 | s739116534 | 40 | 30 | 7,780 | 7,708 | Accepted | Accepted | 25 | (r, c) = list(map(int, input().split()))
a = [[v for v in list(map(int, input().split()))] for r in range(r)]
add_c = [sum(l) for l in a]
for i in range(r):
a[i].append(add_c[i])
add_r = [sum([a[i][j] for i in range(r)]) for j in range(c + 1)]
a.append(add_r)
for i in range(r + 1):
print((' '.join(map(str, a[i])))) | (r, c) = list(map(int, input().split()))
a = [[v for v in list(map(int, input().split()))] for r in range(r)]
for i in range(r):
a[i].append(sum(a[i]))
add_r = [sum([a[i][j] for i in range(r)]) for j in range(c + 1)]
a.append(add_r)
for i in range(r + 1):
print((' '.join(map(str, a[i])))) | 9 | 8 | 324 | 296 | (r, c) = list(map(int, input().split()))
a = [[v for v in list(map(int, input().split()))] for r in range(r)]
add_c = [sum(l) for l in a]
for i in range(r):
a[i].append(add_c[i])
add_r = [sum([a[i][j] for i in range(r)]) for j in range(c + 1)]
a.append(add_r)
for i in range(r + 1):
print((" ".join(map(str, a[i]))))
| (r, c) = list(map(int, input().split()))
a = [[v for v in list(map(int, input().split()))] for r in range(r)]
for i in range(r):
a[i].append(sum(a[i]))
add_r = [sum([a[i][j] for i in range(r)]) for j in range(c + 1)]
a.append(add_r)
for i in range(r + 1):
print((" ".join(map(str, a[i]))))
| false | 11.111111 | [
"-add_c = [sum(l) for l in a]",
"- a[i].append(add_c[i])",
"+ a[i].append(sum(a[i]))"
] | false | 0.037139 | 0.041454 | 0.895912 | [
"s223306364",
"s739116534"
] |
u816631826 | p03437 | python | s491449168 | s960987014 | 19 | 17 | 2,940 | 2,940 | Accepted | Accepted | 10.53 | x,y = list(map(int,input().split()))
if x%y == 0:
print((-1))
else:
print(x) | a,c=list(map(int,input().split()))
print(((1+a)*(a%c>0)-1))
| 6 | 2 | 79 | 53 | x, y = list(map(int, input().split()))
if x % y == 0:
print((-1))
else:
print(x)
| a, c = list(map(int, input().split()))
print(((1 + a) * (a % c > 0) - 1))
| false | 66.666667 | [
"-x, y = list(map(int, input().split()))",
"-if x % y == 0:",
"- print((-1))",
"-else:",
"- print(x)",
"+a, c = list(map(int, input().split()))",
"+print(((1 + a) * (a % c > 0) - 1))"
] | false | 0.045206 | 0.046749 | 0.967009 | [
"s491449168",
"s960987014"
] |
u107915058 | p03611 | python | s800115899 | s150704886 | 289 | 97 | 92,648 | 22,412 | Accepted | Accepted | 66.44 | N = int(eval(input()))
a = list(map(int, input().split()))
cnt = [0]*(10**7)
for i in a:
cnt[i-1] += 1
cnt[i] += 1
cnt[i+1] += 1
print((max(cnt))) | N = int(eval(input()))
a = list(map(int, input().split()))
cnt = [0]*(10**6)
for i in a:
cnt[i-1] += 1
cnt[i] += 1
cnt[i+1] += 1
print((max(cnt))) | 8 | 8 | 157 | 157 | N = int(eval(input()))
a = list(map(int, input().split()))
cnt = [0] * (10**7)
for i in a:
cnt[i - 1] += 1
cnt[i] += 1
cnt[i + 1] += 1
print((max(cnt)))
| N = int(eval(input()))
a = list(map(int, input().split()))
cnt = [0] * (10**6)
for i in a:
cnt[i - 1] += 1
cnt[i] += 1
cnt[i + 1] += 1
print((max(cnt)))
| false | 0 | [
"-cnt = [0] * (10**7)",
"+cnt = [0] * (10**6)"
] | false | 0.549405 | 0.17796 | 3.087243 | [
"s800115899",
"s150704886"
] |
u896741788 | p03805 | python | s286778103 | s428655880 | 48 | 24 | 3,064 | 3,064 | Accepted | Accepted | 50 | from itertools import permutations as per
ty,he=list(map(int,input().split()))
l=[set(map(int,input().split())) for i in range(he)]
ans=0
for g in per(list(range(2,ty+1))):
co=[1]+list(g)
for sd in zip(co,co[1:]):
if set(sd) not in l:break
else:ans+=1
print(ans) | n,m=list(map(int,input().split()))
e=[[0 for _ in range(n)] for i in range(n)]
for i in range(m):
a,s=list(map(int,input().split()))
e[a-1][s-1]=1;e[s-1][a-1]=1
ans=0
from itertools import permutations as pe
for i in pe(list(range(1,n)),r=None):
#rは長さ、Noneでiteraterの長さ
pre=0
for a in i:
if e[pre][a]!=1:break
pre=a
else:ans+=1
print(ans) | 10 | 15 | 269 | 373 | from itertools import permutations as per
ty, he = list(map(int, input().split()))
l = [set(map(int, input().split())) for i in range(he)]
ans = 0
for g in per(list(range(2, ty + 1))):
co = [1] + list(g)
for sd in zip(co, co[1:]):
if set(sd) not in l:
break
else:
ans += 1
print(ans)
| n, m = list(map(int, input().split()))
e = [[0 for _ in range(n)] for i in range(n)]
for i in range(m):
a, s = list(map(int, input().split()))
e[a - 1][s - 1] = 1
e[s - 1][a - 1] = 1
ans = 0
from itertools import permutations as pe
for i in pe(list(range(1, n)), r=None):
# rは長さ、Noneでiteraterの長さ
pre = 0
for a in i:
if e[pre][a] != 1:
break
pre = a
else:
ans += 1
print(ans)
| false | 33.333333 | [
"-from itertools import permutations as per",
"+n, m = list(map(int, input().split()))",
"+e = [[0 for _ in range(n)] for i in range(n)]",
"+for i in range(m):",
"+ a, s = list(map(int, input().split()))",
"+ e[a - 1][s - 1] = 1",
"+ e[s - 1][a - 1] = 1",
"+ans = 0",
"+from itertools import... | false | 0.049331 | 0.110249 | 0.447451 | [
"s286778103",
"s428655880"
] |
u143492911 | p03854 | python | s828849506 | s488050412 | 72 | 23 | 3,188 | 6,516 | Accepted | Accepted | 68.06 | s=input()[::-1]
while 0<len(s):
if s[:5] in "maerd":
s=s[5:]
elif s[:5] in "esare":
s=s[5:]
elif s[:6] in "resare":
s=s[6:]
elif s[:7] in "remaerd":
s=s[7:]
else:
print("NO")
exit()
print("YES")
| import re
s=input()
print("YES") if re.match("^(dream|dreamer|erase|eraser)+$",s) else print("NO")
| 14 | 3 | 276 | 101 | s = input()[::-1]
while 0 < len(s):
if s[:5] in "maerd":
s = s[5:]
elif s[:5] in "esare":
s = s[5:]
elif s[:6] in "resare":
s = s[6:]
elif s[:7] in "remaerd":
s = s[7:]
else:
print("NO")
exit()
print("YES")
| import re
s = input()
print("YES") if re.match("^(dream|dreamer|erase|eraser)+$", s) else print("NO")
| false | 78.571429 | [
"-s = input()[::-1]",
"-while 0 < len(s):",
"- if s[:5] in \"maerd\":",
"- s = s[5:]",
"- elif s[:5] in \"esare\":",
"- s = s[5:]",
"- elif s[:6] in \"resare\":",
"- s = s[6:]",
"- elif s[:7] in \"remaerd\":",
"- s = s[7:]",
"- else:",
"- print... | false | 0.061244 | 0.046653 | 1.312766 | [
"s828849506",
"s488050412"
] |
u858748695 | p04040 | python | s473379121 | s985281543 | 1,203 | 1,001 | 3,064 | 18,980 | Accepted | Accepted | 16.79 | #!/usr/bin/env python3
mod = 10**9 + 7
def inv(x):
return pow(x, mod - 2, mod)
def comb(n, k):
res = 1
for i in range(k):
res = (res * (n - i) * inv(i + 1)) % mod
return res
H, W, A, B = list(map(int, input().split()))
c1 = comb(H - A - 1 + B, B)
c2 = comb(A - 1 + W - B - 1, W - B - 1)
ans = 0
for i in range(B + 1, W + 1):
ans = (ans + c1 * c2) % mod
c1 = (c1 * (H - A - 1 + i) * inv(i)) % mod
c2 = (c2 * (W - i) * inv(A - 1 + W - i)) % mod
print(ans)
| #!/usr/bin/env python3
mod = 10**9 + 7
H, W, A, B = list(map(int, input().split()))
fct = [1]
inv = [1]
for i in range(1, H + W - 1):
fct.append((fct[-1] * i) % mod)
inv.append(pow(fct[i], mod - 2, mod))
def comb(n, k):
return (fct[n] * inv[n - k] * inv[k]) % mod
ans = 0
for i in range(B, W):
c1 = comb(H - A - 1 + i, i)
c2 = comb(A - 1 + W - i - 1, W - i - 1)
ans = (ans + c1 * c2) % mod
print(ans)
| 23 | 20 | 511 | 442 | #!/usr/bin/env python3
mod = 10**9 + 7
def inv(x):
return pow(x, mod - 2, mod)
def comb(n, k):
res = 1
for i in range(k):
res = (res * (n - i) * inv(i + 1)) % mod
return res
H, W, A, B = list(map(int, input().split()))
c1 = comb(H - A - 1 + B, B)
c2 = comb(A - 1 + W - B - 1, W - B - 1)
ans = 0
for i in range(B + 1, W + 1):
ans = (ans + c1 * c2) % mod
c1 = (c1 * (H - A - 1 + i) * inv(i)) % mod
c2 = (c2 * (W - i) * inv(A - 1 + W - i)) % mod
print(ans)
| #!/usr/bin/env python3
mod = 10**9 + 7
H, W, A, B = list(map(int, input().split()))
fct = [1]
inv = [1]
for i in range(1, H + W - 1):
fct.append((fct[-1] * i) % mod)
inv.append(pow(fct[i], mod - 2, mod))
def comb(n, k):
return (fct[n] * inv[n - k] * inv[k]) % mod
ans = 0
for i in range(B, W):
c1 = comb(H - A - 1 + i, i)
c2 = comb(A - 1 + W - i - 1, W - i - 1)
ans = (ans + c1 * c2) % mod
print(ans)
| false | 13.043478 | [
"-",
"-",
"-def inv(x):",
"- return pow(x, mod - 2, mod)",
"+H, W, A, B = list(map(int, input().split()))",
"+fct = [1]",
"+inv = [1]",
"+for i in range(1, H + W - 1):",
"+ fct.append((fct[-1] * i) % mod)",
"+ inv.append(pow(fct[i], mod - 2, mod))",
"- res = 1",
"- for i in rang... | false | 0.392772 | 0.498662 | 0.787652 | [
"s473379121",
"s985281543"
] |
u131811591 | p02330 | python | s784541697 | s874127096 | 12,000 | 9,960 | 48,164 | 56,304 | Accepted | Accepted | 17 | import sys
import bisect
def main():
n, K, L, R = list(map(int, sys.stdin.readline().split()))
a = tuple(map(int, sys.stdin.readline().split()))
m = n//2
ls = [[] for _ in range(m+1)]
for i in range(1 << m):
ls[bin(i).count("1")].append(sum([a[j] for j in range(m) if i >> j & 1]))
for i in range(m+1):
ls[i].sort()
ans = 0
for i in range(1 << n-m):
cnt = bin(i).count("1")
val = sum([a[m+j] for j in range(n-m) if i >> j & 1])
if K-m <= cnt <= K:
ans += bisect.bisect_right(ls[K-cnt], R-val) - bisect.bisect_right(ls[K-cnt], L-val-1)
print(ans)
if __name__ == '__main__':
main()
| import sys
import bisect
import math
def combinations_count(n, r):
return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))
def main():
n, K, L, R = list(map(int, sys.stdin.readline().split()))
a = tuple(map(int, sys.stdin.readline().split()))
m = n//2
ls = [[0 for _ in range(combinations_count(m, i))] for i in range(m+1)]
index = [0]*(m+1)
for i in range(1 << m):
cnt = 0
val = 0
for j in range(m):
if i >> j & 1:
cnt += 1
val += a[j]
ls[cnt][index[cnt]] = val
index[cnt] += 1
for i in range(m+1):
ls[i].sort()
ans = 0
for i in range(1 << n-m):
cnt = 0
val = 0
for j in range(n-m):
if i >> j & 1:
cnt += 1
val += a[m+j]
if K-m <= cnt <= K:
ans += bisect.bisect_right(ls[K-cnt], R-val) - bisect.bisect_right(ls[K-cnt], L-val-1)
print(ans)
if __name__ == '__main__':
main()
| 25 | 42 | 695 | 1,060 | import sys
import bisect
def main():
n, K, L, R = list(map(int, sys.stdin.readline().split()))
a = tuple(map(int, sys.stdin.readline().split()))
m = n // 2
ls = [[] for _ in range(m + 1)]
for i in range(1 << m):
ls[bin(i).count("1")].append(sum([a[j] for j in range(m) if i >> j & 1]))
for i in range(m + 1):
ls[i].sort()
ans = 0
for i in range(1 << n - m):
cnt = bin(i).count("1")
val = sum([a[m + j] for j in range(n - m) if i >> j & 1])
if K - m <= cnt <= K:
ans += bisect.bisect_right(ls[K - cnt], R - val) - bisect.bisect_right(
ls[K - cnt], L - val - 1
)
print(ans)
if __name__ == "__main__":
main()
| import sys
import bisect
import math
def combinations_count(n, r):
return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))
def main():
n, K, L, R = list(map(int, sys.stdin.readline().split()))
a = tuple(map(int, sys.stdin.readline().split()))
m = n // 2
ls = [[0 for _ in range(combinations_count(m, i))] for i in range(m + 1)]
index = [0] * (m + 1)
for i in range(1 << m):
cnt = 0
val = 0
for j in range(m):
if i >> j & 1:
cnt += 1
val += a[j]
ls[cnt][index[cnt]] = val
index[cnt] += 1
for i in range(m + 1):
ls[i].sort()
ans = 0
for i in range(1 << n - m):
cnt = 0
val = 0
for j in range(n - m):
if i >> j & 1:
cnt += 1
val += a[m + j]
if K - m <= cnt <= K:
ans += bisect.bisect_right(ls[K - cnt], R - val) - bisect.bisect_right(
ls[K - cnt], L - val - 1
)
print(ans)
if __name__ == "__main__":
main()
| false | 40.47619 | [
"+import math",
"+",
"+",
"+def combinations_count(n, r):",
"+ return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))",
"- ls = [[] for _ in range(m + 1)]",
"+ ls = [[0 for _ in range(combinations_count(m, i))] for i in range(m + 1)]",
"+ index = [0] * (m + 1)",
"- ... | false | 0.042089 | 0.045791 | 0.919145 | [
"s784541697",
"s874127096"
] |
u528793636 | p02783 | python | s765486534 | s472437682 | 19 | 17 | 2,940 | 2,940 | Accepted | Accepted | 10.53 | H,A = list(map(int, input().split()))
count = 0
for i in range(10000):
if i*A >= H:
break
else:
i += 1
count += 1
print(count) | H,A = list(map(int, input().split()))
print((-(-H//A)))
| 10 | 3 | 162 | 51 | H, A = list(map(int, input().split()))
count = 0
for i in range(10000):
if i * A >= H:
break
else:
i += 1
count += 1
print(count)
| H, A = list(map(int, input().split()))
print((-(-H // A)))
| false | 70 | [
"-count = 0",
"-for i in range(10000):",
"- if i * A >= H:",
"- break",
"- else:",
"- i += 1",
"- count += 1",
"-print(count)",
"+print((-(-H // A)))"
] | false | 0.049949 | 0.049065 | 1.018015 | [
"s765486534",
"s472437682"
] |
u263830634 | p03088 | python | s698752690 | s744252116 | 294 | 129 | 47,320 | 3,880 | Accepted | Accepted | 56.12 | N = int(eval(input()))
mod = 10 ** 9 + 7
memo = [{} for i in range(N+1)]
#print (memo)
#4文字を与えて条件に合致するかを判断
def check(last4):
for i in range(4):
t = list(last4) #4文字をリストに格納
if i >= 1: #最初の文字以外に着目する時
t[i-1], t[i] = t[i], t[i-1] #i番目とi-1番目を交換
if ''.join(t).count('AGC') >= 1: #AGCが含まれているかどうかの確認
return False
return True
def dfs(cur, last3): #深さ優先探索
if last3 in memo[cur]:
return memo[cur][last3]
if cur == N:
return 1
ret = 0
for c in 'ATCG':
if check(last3+c):
ret = (ret+dfs(cur+1, last3[1:]+c))%mod
memo[cur][last3] = ret
return ret
print((dfs(0, 'TTT')))
#print (memo) | N = int(eval(input()))
MOD = 10 ** 9 + 7
memo = [{} for _ in range(N + 1)]
def ok(last4):
for i in range(4):
t = list(last4)
if i >= 1:
t[i - 1], t[i] = t[i], t[i - 1]
if ''.join(t).count('AGC') >= 1:
return False
return True
def dfs(cur, last3):
if last3 in memo[cur]:
return memo[cur][last3]
if cur == N:
return 1
ret = 0
for c in 'AGCT':
if ok(last3 + c):
ret = (ret + dfs(cur + 1, last3[1:] + c)) % MOD
memo[cur][last3] = ret
return ret
print((dfs(0, 'TTT'))) | 32 | 28 | 715 | 604 | N = int(eval(input()))
mod = 10**9 + 7
memo = [{} for i in range(N + 1)]
# print (memo)
# 4文字を与えて条件に合致するかを判断
def check(last4):
for i in range(4):
t = list(last4) # 4文字をリストに格納
if i >= 1: # 最初の文字以外に着目する時
t[i - 1], t[i] = t[i], t[i - 1] # i番目とi-1番目を交換
if "".join(t).count("AGC") >= 1: # AGCが含まれているかどうかの確認
return False
return True
def dfs(cur, last3): # 深さ優先探索
if last3 in memo[cur]:
return memo[cur][last3]
if cur == N:
return 1
ret = 0
for c in "ATCG":
if check(last3 + c):
ret = (ret + dfs(cur + 1, last3[1:] + c)) % mod
memo[cur][last3] = ret
return ret
print((dfs(0, "TTT")))
# print (memo)
| N = int(eval(input()))
MOD = 10**9 + 7
memo = [{} for _ in range(N + 1)]
def ok(last4):
for i in range(4):
t = list(last4)
if i >= 1:
t[i - 1], t[i] = t[i], t[i - 1]
if "".join(t).count("AGC") >= 1:
return False
return True
def dfs(cur, last3):
if last3 in memo[cur]:
return memo[cur][last3]
if cur == N:
return 1
ret = 0
for c in "AGCT":
if ok(last3 + c):
ret = (ret + dfs(cur + 1, last3[1:] + c)) % MOD
memo[cur][last3] = ret
return ret
print((dfs(0, "TTT")))
| false | 12.5 | [
"-mod = 10**9 + 7",
"-memo = [{} for i in range(N + 1)]",
"-# print (memo)",
"-# 4文字を与えて条件に合致するかを判断",
"-def check(last4):",
"+MOD = 10**9 + 7",
"+memo = [{} for _ in range(N + 1)]",
"+",
"+",
"+def ok(last4):",
"- t = list(last4) # 4文字をリストに格納",
"- if i >= 1: # 最初の文字以外に着目する時",
... | false | 0.080068 | 0.079062 | 1.012725 | [
"s698752690",
"s744252116"
] |
u730769327 | p03087 | python | s725404069 | s648267948 | 1,036 | 386 | 56,100 | 72,500 | Accepted | Accepted | 62.74 | n,q=list(map(int,input().split()))
s=eval(input())
a=[]
for i in range(len(s)-1):
a.append(s[i:i+2])
b=[0]
for i in a:
b.append(b[-1])
if i=='AC':
b[-1]+=1
for i in range(q):
l,r=list(map(int,input().split()))
print((b[r-1]-b[l-1])) | n,q=list(map(int,input().split()))
s=eval(input())
a=[0]*(n+1)
for i in range(n-1):
if s[i:i+2]=='AC':
a[i+1]=1
for i in range(n):
a[i+1]+=a[i]
for i in range(q):
l,r=list(map(int,input().split()))
print((a[r-1]-a[l-1])) | 14 | 11 | 240 | 222 | n, q = list(map(int, input().split()))
s = eval(input())
a = []
for i in range(len(s) - 1):
a.append(s[i : i + 2])
b = [0]
for i in a:
b.append(b[-1])
if i == "AC":
b[-1] += 1
for i in range(q):
l, r = list(map(int, input().split()))
print((b[r - 1] - b[l - 1]))
| n, q = list(map(int, input().split()))
s = eval(input())
a = [0] * (n + 1)
for i in range(n - 1):
if s[i : i + 2] == "AC":
a[i + 1] = 1
for i in range(n):
a[i + 1] += a[i]
for i in range(q):
l, r = list(map(int, input().split()))
print((a[r - 1] - a[l - 1]))
| false | 21.428571 | [
"-a = []",
"-for i in range(len(s) - 1):",
"- a.append(s[i : i + 2])",
"-b = [0]",
"-for i in a:",
"- b.append(b[-1])",
"- if i == \"AC\":",
"- b[-1] += 1",
"+a = [0] * (n + 1)",
"+for i in range(n - 1):",
"+ if s[i : i + 2] == \"AC\":",
"+ a[i + 1] = 1",
"+for i in... | false | 0.047383 | 0.086453 | 0.548077 | [
"s725404069",
"s648267948"
] |
u550488532 | p02819 | python | s297911038 | s298827071 | 316 | 29 | 3,060 | 3,060 | Accepted | Accepted | 90.82 | X = int(eval(input()))
count = 0
for i in range(2, X+1, 1):
if X % i == 0:
count += 1
if count == 1:
print(X)
else:
while True:
count = 0
X += 1
for i in range(2, X+1, 1):
if X % i == 0:
count += 1
if count == 1:
print(X)
break | x = int(eval(input()))
p = x - 1
prime = False
if x == 2:
print((2))
else:
while prime == False:
p += 1
prime = True
for i in range(2, p - 1):
if p % i == 0:
prime = False
break
print(p) | 20 | 17 | 351 | 297 | X = int(eval(input()))
count = 0
for i in range(2, X + 1, 1):
if X % i == 0:
count += 1
if count == 1:
print(X)
else:
while True:
count = 0
X += 1
for i in range(2, X + 1, 1):
if X % i == 0:
count += 1
if count == 1:
print(X)
break
| x = int(eval(input()))
p = x - 1
prime = False
if x == 2:
print((2))
else:
while prime == False:
p += 1
prime = True
for i in range(2, p - 1):
if p % i == 0:
prime = False
break
print(p)
| false | 15 | [
"-X = int(eval(input()))",
"-count = 0",
"-for i in range(2, X + 1, 1):",
"- if X % i == 0:",
"- count += 1",
"-if count == 1:",
"- print(X)",
"+x = int(eval(input()))",
"+p = x - 1",
"+prime = False",
"+if x == 2:",
"+ print((2))",
"- while True:",
"- count = 0",... | false | 0.069662 | 0.036251 | 1.921626 | [
"s297911038",
"s298827071"
] |
u714104087 | p03473 | python | s737900399 | s141792486 | 69 | 62 | 61,620 | 61,696 | Accepted | Accepted | 10.14 | M = int(eval(input()))
print((24 - M + 24))
| m = int(eval(input()))
print((24-m+24)) | 2 | 3 | 37 | 34 | M = int(eval(input()))
print((24 - M + 24))
| m = int(eval(input()))
print((24 - m + 24))
| false | 33.333333 | [
"-M = int(eval(input()))",
"-print((24 - M + 24))",
"+m = int(eval(input()))",
"+print((24 - m + 24))"
] | false | 0.039008 | 0.039521 | 0.986998 | [
"s737900399",
"s141792486"
] |
u644907318 | p02780 | python | s401467619 | s278861130 | 236 | 107 | 71,792 | 101,724 | Accepted | Accepted | 54.66 | N,K = list(map(int,input().split()))
P = list(map(int,input().split()))
cnt = 0
for i in range(K):
cnt += P[i]
cmax = cnt
for i in range(K,N):
cnt = cnt+P[i]-P[i-K]
cmax = max(cmax,cnt)
print(((K+cmax)/2)) | N,K = list(map(int,input().split()))
P = list(map(int,input().split()))
A = [0 for _ in range(N)]
for i in range(N):
A[i] = (P[i]+1)/2
cmax = sum(A[:K])
a = cmax
for i in range(1,N-K+1):
a = a+A[i+K-1]-A[i-1]
cmax = max(cmax,a)
print(cmax) | 10 | 11 | 218 | 255 | N, K = list(map(int, input().split()))
P = list(map(int, input().split()))
cnt = 0
for i in range(K):
cnt += P[i]
cmax = cnt
for i in range(K, N):
cnt = cnt + P[i] - P[i - K]
cmax = max(cmax, cnt)
print(((K + cmax) / 2))
| N, K = list(map(int, input().split()))
P = list(map(int, input().split()))
A = [0 for _ in range(N)]
for i in range(N):
A[i] = (P[i] + 1) / 2
cmax = sum(A[:K])
a = cmax
for i in range(1, N - K + 1):
a = a + A[i + K - 1] - A[i - 1]
cmax = max(cmax, a)
print(cmax)
| false | 9.090909 | [
"-cnt = 0",
"-for i in range(K):",
"- cnt += P[i]",
"-cmax = cnt",
"-for i in range(K, N):",
"- cnt = cnt + P[i] - P[i - K]",
"- cmax = max(cmax, cnt)",
"-print(((K + cmax) / 2))",
"+A = [0 for _ in range(N)]",
"+for i in range(N):",
"+ A[i] = (P[i] + 1) / 2",
"+cmax = sum(A[:K])",... | false | 0.037493 | 0.037437 | 1.00149 | [
"s401467619",
"s278861130"
] |
u644907318 | p03696 | python | s761887767 | s391397082 | 172 | 73 | 38,256 | 62,028 | Accepted | Accepted | 57.56 | N = int(eval(input()))
S = input().strip()
S1 = S
cur = 0
for i in range(len(S)):
if S[i]=="(":
cur += 1
else:
cur -= 1
if cur<0:
S1 = "("+S1
cur += 1
S1 = S1+")"*cur
print(S1) | N = int(eval(input()))
S = input().strip()
while True:
lv = 0
lmin = len(S)
for i in range(len(S)):
if S[i]=="(":
lv += 1
else:
lv -= 1
lmin = min(lmin,lv)
if lmin<0:
S = "("*(-lmin)+S
else:break
lv = 0
for i in range(len(S)):
if S[i]=="(":
lv += 1
else:
lv -= 1
if lv>0:
S = S+")"*lv
print(S) | 14 | 24 | 227 | 415 | N = int(eval(input()))
S = input().strip()
S1 = S
cur = 0
for i in range(len(S)):
if S[i] == "(":
cur += 1
else:
cur -= 1
if cur < 0:
S1 = "(" + S1
cur += 1
S1 = S1 + ")" * cur
print(S1)
| N = int(eval(input()))
S = input().strip()
while True:
lv = 0
lmin = len(S)
for i in range(len(S)):
if S[i] == "(":
lv += 1
else:
lv -= 1
lmin = min(lmin, lv)
if lmin < 0:
S = "(" * (-lmin) + S
else:
break
lv = 0
for i in range(len(S)):
if S[i] == "(":
lv += 1
else:
lv -= 1
if lv > 0:
S = S + ")" * lv
print(S)
| false | 41.666667 | [
"-S1 = S",
"-cur = 0",
"+while True:",
"+ lv = 0",
"+ lmin = len(S)",
"+ for i in range(len(S)):",
"+ if S[i] == \"(\":",
"+ lv += 1",
"+ else:",
"+ lv -= 1",
"+ lmin = min(lmin, lv)",
"+ if lmin < 0:",
"+ S = \"(\" * (-lmin) + S"... | false | 0.040021 | 0.072974 | 0.54843 | [
"s761887767",
"s391397082"
] |
u886747123 | p02990 | python | s899606605 | s579144050 | 1,788 | 1,403 | 481,020 | 479,484 | Accepted | Accepted | 21.53 | # D - Blue and Red Balls
# 青いボールを並べる→赤いボールを青いボールの間に挿入する→残りの赤いボールを両端に置く
N, K = list(map(int, input().split()))
MOD = 10**9 + 7
# nCkを漸化式で求め、メモしておく
combinations_table = [[0]*(N+1) for _ in range(N+1)]
for idx in range(N+1):
combinations_table[0][idx] = 1
combinations_table[idx][0] = 1
combinations_table[idx][1] = idx
for n in range(2, N+1):
for k in range(2, n+1):
combinations_table[n][k] = combinations_table[n-1][k-1] + combinations_table[n-1][k]
# 連続した同色のボールの数nと、それらを何分割するか示すaを与えると、分割のパターン数を返す関数
def separate_balls(n,a):
return combinations_table[n-1][a-1]
ans_list = []
for n_separate in range(1,K+1):
if N-K < n_separate-1: # 赤いボール不足でi分割不可
ans_list.append(0)
elif n_separate == 1:
ans_list.append(N-K+1)
else:
tmp_blue = separate_balls(K, n_separate) % MOD # K個の青いボールをi分割するパターン数
tmp_red = 0
for n_red_ball in range(n_separate-1, N-K+1): # 青いボールの分割に使う赤いボールの個数
tmp_red_inner = separate_balls(n_red_ball, n_separate-1) # j個の赤いボールをi-1分割して青いボールの隙間に入れるパターン数
tmp_red_side = N-K-n_red_ball+1 # N-K-j個の赤いボールを両端に置くパターン数
tmp_red += (tmp_red_inner * tmp_red_side) % MOD
ans_list.append((tmp_blue * tmp_red) % MOD) # 青いボールの置き方*赤いボールの置き方
for x in ans_list:
print(x) | # D - Blue and Red Balls
N, K = list(map(int, input().split()))
MOD = 10**9 + 7
# nCkを漸化式で求め、メモしておく
combinations_table = [[0]*(N+1) for _ in range(N+1)]
for idx in range(N+1):
combinations_table[0][idx] = 1
combinations_table[idx][0] = 1
combinations_table[idx][1] = idx
for n in range(2, N+1):
for k in range(2, n+1):
combinations_table[n][k] = combinations_table[n-1][k-1] + combinations_table[n-1][k]
# 連続した同色のボールの数nと、それらを何分割するか示すaを与えると、分割のパターン数を返す関数
def separate_balls(n,a):
return combinations_table[n-1][a-1]
# 青いボールを先に並べると赤いボールが両端にあるかどうかで場合分けが必要
# 赤いボールの隙間か両端から一部を選んで青いボールを挿入すれば場合分けが少なくて済む
ans_list = []
for n_separate in range(1,K+1):
if n_separate > K:
ans_list.append(0)
else:
tmp_insert = combinations_table[N-K+1][n_separate]
tmp_blue_group = separate_balls(K, n_separate)
ans_list.append((tmp_insert * tmp_blue_group) % MOD)
for x in ans_list:
print(x) | 38 | 32 | 1,325 | 967 | # D - Blue and Red Balls
# 青いボールを並べる→赤いボールを青いボールの間に挿入する→残りの赤いボールを両端に置く
N, K = list(map(int, input().split()))
MOD = 10**9 + 7
# nCkを漸化式で求め、メモしておく
combinations_table = [[0] * (N + 1) for _ in range(N + 1)]
for idx in range(N + 1):
combinations_table[0][idx] = 1
combinations_table[idx][0] = 1
combinations_table[idx][1] = idx
for n in range(2, N + 1):
for k in range(2, n + 1):
combinations_table[n][k] = (
combinations_table[n - 1][k - 1] + combinations_table[n - 1][k]
)
# 連続した同色のボールの数nと、それらを何分割するか示すaを与えると、分割のパターン数を返す関数
def separate_balls(n, a):
return combinations_table[n - 1][a - 1]
ans_list = []
for n_separate in range(1, K + 1):
if N - K < n_separate - 1: # 赤いボール不足でi分割不可
ans_list.append(0)
elif n_separate == 1:
ans_list.append(N - K + 1)
else:
tmp_blue = separate_balls(K, n_separate) % MOD # K個の青いボールをi分割するパターン数
tmp_red = 0
for n_red_ball in range(n_separate - 1, N - K + 1): # 青いボールの分割に使う赤いボールの個数
tmp_red_inner = separate_balls(
n_red_ball, n_separate - 1
) # j個の赤いボールをi-1分割して青いボールの隙間に入れるパターン数
tmp_red_side = N - K - n_red_ball + 1 # N-K-j個の赤いボールを両端に置くパターン数
tmp_red += (tmp_red_inner * tmp_red_side) % MOD
ans_list.append((tmp_blue * tmp_red) % MOD) # 青いボールの置き方*赤いボールの置き方
for x in ans_list:
print(x)
| # D - Blue and Red Balls
N, K = list(map(int, input().split()))
MOD = 10**9 + 7
# nCkを漸化式で求め、メモしておく
combinations_table = [[0] * (N + 1) for _ in range(N + 1)]
for idx in range(N + 1):
combinations_table[0][idx] = 1
combinations_table[idx][0] = 1
combinations_table[idx][1] = idx
for n in range(2, N + 1):
for k in range(2, n + 1):
combinations_table[n][k] = (
combinations_table[n - 1][k - 1] + combinations_table[n - 1][k]
)
# 連続した同色のボールの数nと、それらを何分割するか示すaを与えると、分割のパターン数を返す関数
def separate_balls(n, a):
return combinations_table[n - 1][a - 1]
# 青いボールを先に並べると赤いボールが両端にあるかどうかで場合分けが必要
# 赤いボールの隙間か両端から一部を選んで青いボールを挿入すれば場合分けが少なくて済む
ans_list = []
for n_separate in range(1, K + 1):
if n_separate > K:
ans_list.append(0)
else:
tmp_insert = combinations_table[N - K + 1][n_separate]
tmp_blue_group = separate_balls(K, n_separate)
ans_list.append((tmp_insert * tmp_blue_group) % MOD)
for x in ans_list:
print(x)
| false | 15.789474 | [
"-# 青いボールを並べる→赤いボールを青いボールの間に挿入する→残りの赤いボールを両端に置く",
"+# 青いボールを先に並べると赤いボールが両端にあるかどうかで場合分けが必要",
"+# 赤いボールの隙間か両端から一部を選んで青いボールを挿入すれば場合分けが少なくて済む",
"- if N - K < n_separate - 1: # 赤いボール不足でi分割不可",
"+ if n_separate > K:",
"- elif n_separate == 1:",
"- ans_list.append(N - K + 1)",
"- tmp_... | false | 0.843639 | 0.488538 | 1.726863 | [
"s899606605",
"s579144050"
] |
u314050667 | p02720 | python | s649743868 | s546708564 | 456 | 239 | 7,724 | 17,012 | Accepted | Accepted | 47.59 | import sys
k = int(eval(input()))
if k <= 9:
print(k)
sys.exit()
def judge(s):
for i in range(1,len(s)):
if abs(int(s[i-1]) - int(s[i])) > 1:
return 0
return 1
q = ['1','2','3','4','5','6','7','8','9']
cnt = 9
cond = False
while True:
cp = q.pop(0)
digit = int(cp[-1])
for d in range(-1,2):
if 0 <= digit + d <= 9:
cnt += 1
if cnt == k:
ans = cp+str(digit+d)
cond = True
break
q.append(cp+str(digit+d))
if cond:
break
print(ans)
| import sys
from collections import deque
K = int(eval(input()))
if K <= 9:
print(K)
sys.exit()
q = deque(['1', '2','3','4','5','6','7','8','9'])
cnt = 0
while True:
cp = q.popleft()
cnt += 1
if cnt == K:
ans = int(cp)
break
r = int(cp[-1])
for d in [-1,0,1]:
dd = r + d
if 0 <= dd < 10:
q.append(cp + str(dd))
print(ans) | 31 | 21 | 496 | 353 | import sys
k = int(eval(input()))
if k <= 9:
print(k)
sys.exit()
def judge(s):
for i in range(1, len(s)):
if abs(int(s[i - 1]) - int(s[i])) > 1:
return 0
return 1
q = ["1", "2", "3", "4", "5", "6", "7", "8", "9"]
cnt = 9
cond = False
while True:
cp = q.pop(0)
digit = int(cp[-1])
for d in range(-1, 2):
if 0 <= digit + d <= 9:
cnt += 1
if cnt == k:
ans = cp + str(digit + d)
cond = True
break
q.append(cp + str(digit + d))
if cond:
break
print(ans)
| import sys
from collections import deque
K = int(eval(input()))
if K <= 9:
print(K)
sys.exit()
q = deque(["1", "2", "3", "4", "5", "6", "7", "8", "9"])
cnt = 0
while True:
cp = q.popleft()
cnt += 1
if cnt == K:
ans = int(cp)
break
r = int(cp[-1])
for d in [-1, 0, 1]:
dd = r + d
if 0 <= dd < 10:
q.append(cp + str(dd))
print(ans)
| false | 32.258065 | [
"+from collections import deque",
"-k = int(eval(input()))",
"-if k <= 9:",
"- print(k)",
"+K = int(eval(input()))",
"+if K <= 9:",
"+ print(K)",
"-",
"-",
"-def judge(s):",
"- for i in range(1, len(s)):",
"- if abs(int(s[i - 1]) - int(s[i])) > 1:",
"- return 0",
... | false | 0.11166 | 0.093001 | 1.200634 | [
"s649743868",
"s546708564"
] |
u968166680 | p03488 | python | s281526285 | s169802787 | 261 | 210 | 81,020 | 75,692 | Accepted | Accepted | 19.54 | import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
def check(vec, init_pos, target_pos):
dp = {init_pos}
for nv in vec:
dp_next = set()
for v in dp:
dp_next.add(v - nv)
dp_next.add(v + nv)
dp = dp_next
return target_pos in dp
def main():
S = readline().strip()
x, y = list(map(int, readline().split()))
L = [len(commands) for commands in S.split('T')]
init_x = L[0]
x_commands = L[2::2]
y_commands = L[1::2]
ok = check(x_commands, init_x, x) and check(y_commands, 0, y)
if ok:
print('Yes')
else:
print('No')
return
if __name__ == '__main__':
main()
| import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
def check(vec, init_pos, target_pos):
dp = {init_pos}
for nv in vec:
dp_next = set()
for v in dp:
dp_next.add(v - nv)
dp_next.add(v + nv)
dp = dp_next
return target_pos in dp
def main():
S = readline().strip()
x, y = list(map(int, readline().split()))
L = [len(commands) for commands in S.split('T')]
init_x = L[0]
x_commands = [c for c in L[2::2] if c != 0]
y_commands = [c for c in L[1::2] if c != 0]
ok = check(x_commands, init_x, x) and check(y_commands, 0, y)
if ok:
print('Yes')
else:
print('No')
return
if __name__ == '__main__':
main()
| 45 | 45 | 827 | 873 | import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10**9)
INF = 1 << 60
MOD = 1000000007
def check(vec, init_pos, target_pos):
dp = {init_pos}
for nv in vec:
dp_next = set()
for v in dp:
dp_next.add(v - nv)
dp_next.add(v + nv)
dp = dp_next
return target_pos in dp
def main():
S = readline().strip()
x, y = list(map(int, readline().split()))
L = [len(commands) for commands in S.split("T")]
init_x = L[0]
x_commands = L[2::2]
y_commands = L[1::2]
ok = check(x_commands, init_x, x) and check(y_commands, 0, y)
if ok:
print("Yes")
else:
print("No")
return
if __name__ == "__main__":
main()
| import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10**9)
INF = 1 << 60
MOD = 1000000007
def check(vec, init_pos, target_pos):
dp = {init_pos}
for nv in vec:
dp_next = set()
for v in dp:
dp_next.add(v - nv)
dp_next.add(v + nv)
dp = dp_next
return target_pos in dp
def main():
S = readline().strip()
x, y = list(map(int, readline().split()))
L = [len(commands) for commands in S.split("T")]
init_x = L[0]
x_commands = [c for c in L[2::2] if c != 0]
y_commands = [c for c in L[1::2] if c != 0]
ok = check(x_commands, init_x, x) and check(y_commands, 0, y)
if ok:
print("Yes")
else:
print("No")
return
if __name__ == "__main__":
main()
| false | 0 | [
"- x_commands = L[2::2]",
"- y_commands = L[1::2]",
"+ x_commands = [c for c in L[2::2] if c != 0]",
"+ y_commands = [c for c in L[1::2] if c != 0]"
] | false | 0.094304 | 0.126905 | 0.743106 | [
"s281526285",
"s169802787"
] |
u844005364 | p03264 | python | s602706549 | s478996322 | 201 | 17 | 38,256 | 2,940 | Accepted | Accepted | 91.54 | n = int(eval(input()))
print(((n // 2) * (n - n // 2))) | k = int(eval(input()))
even = k // 2
odd = k - even
print((even * odd)) | 3 | 6 | 50 | 70 | n = int(eval(input()))
print(((n // 2) * (n - n // 2)))
| k = int(eval(input()))
even = k // 2
odd = k - even
print((even * odd))
| false | 50 | [
"-n = int(eval(input()))",
"-print(((n // 2) * (n - n // 2)))",
"+k = int(eval(input()))",
"+even = k // 2",
"+odd = k - even",
"+print((even * odd))"
] | false | 0.035967 | 0.047477 | 0.757569 | [
"s602706549",
"s478996322"
] |
u558242240 | p02901 | python | s181082201 | s240457616 | 480 | 432 | 46,424 | 45,912 | Accepted | Accepted | 10 | n, m = list(map(int, input().split()))
c = []
a = []
for _ in range(m):
ai, bi = list(map(int, input().split()))
ci = list([2 ** (int(x) - 1) for x in input().split()])
a.append(ai)
c.append(sum(ci))
INF = 100 ** 18
dp = [INF] * (2**n)
dp[0] = 0
for i in range(m):
for j in range(0, 2**n):
dp[j | c[i]] = min(dp[j | c[i]], dp[j] + a[i])
ans = dp[2**n-1]
if ans == INF:
print((-1))
exit()
print(ans)
| n, m = list(map(int, input().split()))
ac = []
for _ in range(m):
ai, bi = list(map(int, input().split()))
ci = list([2 ** (int(x) - 1) for x in input().split()])
ac.append((ai, sum(ci)))
INF = 100 ** 18
dp = [INF] * (2**n)
dp[0] = 0
for ai, ci in ac:
for j in range(0, 2**n):
dp[j | ci] = min(dp[j | ci], dp[j] + ai)
ans = dp[2**n-1]
if ans == INF:
print((-1))
exit()
print(ans)
| 22 | 20 | 451 | 426 | n, m = list(map(int, input().split()))
c = []
a = []
for _ in range(m):
ai, bi = list(map(int, input().split()))
ci = list([2 ** (int(x) - 1) for x in input().split()])
a.append(ai)
c.append(sum(ci))
INF = 100**18
dp = [INF] * (2**n)
dp[0] = 0
for i in range(m):
for j in range(0, 2**n):
dp[j | c[i]] = min(dp[j | c[i]], dp[j] + a[i])
ans = dp[2**n - 1]
if ans == INF:
print((-1))
exit()
print(ans)
| n, m = list(map(int, input().split()))
ac = []
for _ in range(m):
ai, bi = list(map(int, input().split()))
ci = list([2 ** (int(x) - 1) for x in input().split()])
ac.append((ai, sum(ci)))
INF = 100**18
dp = [INF] * (2**n)
dp[0] = 0
for ai, ci in ac:
for j in range(0, 2**n):
dp[j | ci] = min(dp[j | ci], dp[j] + ai)
ans = dp[2**n - 1]
if ans == INF:
print((-1))
exit()
print(ans)
| false | 9.090909 | [
"-c = []",
"-a = []",
"+ac = []",
"- a.append(ai)",
"- c.append(sum(ci))",
"+ ac.append((ai, sum(ci)))",
"-for i in range(m):",
"+for ai, ci in ac:",
"- dp[j | c[i]] = min(dp[j | c[i]], dp[j] + a[i])",
"+ dp[j | ci] = min(dp[j | ci], dp[j] + ai)"
] | false | 0.040015 | 0.041572 | 0.962538 | [
"s181082201",
"s240457616"
] |
u200887663 | p03061 | python | s618248576 | s044903142 | 230 | 208 | 14,076 | 14,428 | Accepted | Accepted | 9.57 | n=int(eval(input()))
al=list(map(int,input().split()))
import fractions
ans=0
left=[0]
for i in range(1,n):
ans=fractions.gcd(ans,al[i-1])
left.append(ans)
#print(left)
right=[0 for i in range(n+1)]
for i in range(1,n+1):
right[n-i]=fractions.gcd(right[n-i+1],al[n-i])
#print(right)
ans=0
for i in range(n):
ans=max(ans,(fractions.gcd(left[i],right[i+1])))
print(ans)
| n=int(eval(input()))
#n,m=map(int,input().split())
al=list(map(int,input().split()))
#l=[list(map(int,input().split())) for i in range(n)]
import fractions
#gcd=fractions.gcd(a,b)#最大公約数
left=[0 for i in range(n)]
right=[0 for i in range(n)]
left[0]=al[0]
right[n-1]=al[n-1]
for i in range(1,n):
left[i]=(fractions.gcd(al[i],left[i-1]))
for i in range(n-2,-1,-1):
right[i]=fractions.gcd(al[i],right[i+1])
ansl=[]
#左端の値
ansl.append(right[1])
#右端の値
ansl.append(left[n-2])
for i in range(1,n-1):
ansl.append(fractions.gcd(left[i-1],right[i+1]))
print((max(ansl)))
| 21 | 28 | 402 | 601 | n = int(eval(input()))
al = list(map(int, input().split()))
import fractions
ans = 0
left = [0]
for i in range(1, n):
ans = fractions.gcd(ans, al[i - 1])
left.append(ans)
# print(left)
right = [0 for i in range(n + 1)]
for i in range(1, n + 1):
right[n - i] = fractions.gcd(right[n - i + 1], al[n - i])
# print(right)
ans = 0
for i in range(n):
ans = max(ans, (fractions.gcd(left[i], right[i + 1])))
print(ans)
| n = int(eval(input()))
# n,m=map(int,input().split())
al = list(map(int, input().split()))
# l=[list(map(int,input().split())) for i in range(n)]
import fractions
# gcd=fractions.gcd(a,b)#最大公約数
left = [0 for i in range(n)]
right = [0 for i in range(n)]
left[0] = al[0]
right[n - 1] = al[n - 1]
for i in range(1, n):
left[i] = fractions.gcd(al[i], left[i - 1])
for i in range(n - 2, -1, -1):
right[i] = fractions.gcd(al[i], right[i + 1])
ansl = []
# 左端の値
ansl.append(right[1])
# 右端の値
ansl.append(left[n - 2])
for i in range(1, n - 1):
ansl.append(fractions.gcd(left[i - 1], right[i + 1]))
print((max(ansl)))
| false | 25 | [
"+# n,m=map(int,input().split())",
"+# l=[list(map(int,input().split())) for i in range(n)]",
"-ans = 0",
"-left = [0]",
"+# gcd=fractions.gcd(a,b)#最大公約数",
"+left = [0 for i in range(n)]",
"+right = [0 for i in range(n)]",
"+left[0] = al[0]",
"+right[n - 1] = al[n - 1]",
"- ans = fractions.gcd(... | false | 0.046143 | 0.04391 | 1.050872 | [
"s618248576",
"s044903142"
] |
u987164499 | p02947 | python | s514539201 | s557481641 | 681 | 269 | 39,040 | 39,040 | Accepted | Accepted | 60.5 | from sys import stdin
from math import factorial
def combinations_count(n, r):
return factorial(n) // (factorial(n - r) * factorial(r))
n = int(stdin.readline().rstrip())
li = [list(stdin.readline().rstrip()) for _ in range(n)]
set_list = {}
for i in li:
i.sort()
s = "".join(i)
if s in set_list:
set_list[s] += 1
else:
set_list[s] = 1
point = 0
for i in list(set_list.values()):
if i >= 2:
point += combinations_count(i,2)
print(point) | from sys import stdin
n = int(stdin.readline().rstrip())
li = [list(stdin.readline().rstrip()) for _ in range(n)]
set_list = {}
for i in li:
i.sort()
s = "".join(i)
if s in set_list:
set_list[s] += 1
else:
set_list[s] = 1
point = 0
for i in list(set_list.values()):
point += i*(i-1)//2
print(point) | 26 | 21 | 510 | 354 | from sys import stdin
from math import factorial
def combinations_count(n, r):
return factorial(n) // (factorial(n - r) * factorial(r))
n = int(stdin.readline().rstrip())
li = [list(stdin.readline().rstrip()) for _ in range(n)]
set_list = {}
for i in li:
i.sort()
s = "".join(i)
if s in set_list:
set_list[s] += 1
else:
set_list[s] = 1
point = 0
for i in list(set_list.values()):
if i >= 2:
point += combinations_count(i, 2)
print(point)
| from sys import stdin
n = int(stdin.readline().rstrip())
li = [list(stdin.readline().rstrip()) for _ in range(n)]
set_list = {}
for i in li:
i.sort()
s = "".join(i)
if s in set_list:
set_list[s] += 1
else:
set_list[s] = 1
point = 0
for i in list(set_list.values()):
point += i * (i - 1) // 2
print(point)
| false | 19.230769 | [
"-from math import factorial",
"-",
"-",
"-def combinations_count(n, r):",
"- return factorial(n) // (factorial(n - r) * factorial(r))",
"-",
"- if i >= 2:",
"- point += combinations_count(i, 2)",
"+ point += i * (i - 1) // 2"
] | false | 0.038238 | 0.037637 | 1.015977 | [
"s514539201",
"s557481641"
] |
u181295070 | p02887 | python | s860143315 | s819670465 | 49 | 43 | 3,956 | 3,316 | Accepted | Accepted | 12.24 | n = int(eval(input()))
s = eval(input())
l = [s[0]]
for i in range(1,n):
if s[i-1]!=s[i]:
l.append(s[i])
print((len(l))) | n = int(eval(input()))
s = eval(input())
cnt = 1
for i in range(1,n):
if s[i-1]!=s[i]:
cnt += 1
print(cnt) | 7 | 7 | 124 | 112 | n = int(eval(input()))
s = eval(input())
l = [s[0]]
for i in range(1, n):
if s[i - 1] != s[i]:
l.append(s[i])
print((len(l)))
| n = int(eval(input()))
s = eval(input())
cnt = 1
for i in range(1, n):
if s[i - 1] != s[i]:
cnt += 1
print(cnt)
| false | 0 | [
"-l = [s[0]]",
"+cnt = 1",
"- l.append(s[i])",
"-print((len(l)))",
"+ cnt += 1",
"+print(cnt)"
] | false | 0.038853 | 0.041892 | 0.927462 | [
"s860143315",
"s819670465"
] |
u678167152 | p02972 | python | s904213575 | s305555044 | 926 | 148 | 7,100 | 97,704 | Accepted | Accepted | 84.02 | N = int(input())
A = list(map(int, input().split()))
B = [0]*N
for i in range(N,0,-1):
s = A[i-1]
k = i*2
while k<=N:
s ^= B[k-1]
k += i
if s==1:
B[i-1] = s
if sum(B)==0:
print(0)
else:
print(sum(B))
for i in range(N):
if B[i]==1:
print(i+1,end=' ')
| N = int(eval(input()))
A = list(map(int, input().split()))
lis = [0]*(N+1)
for i in range(N,0,-1):
k = i*2
cnt = 0
while k<=N:
cnt ^= lis[k]
k += i
lis[i] = cnt^A[i-1]
print((lis.count(1)))
ans = []
for i in range(1,N+1):
if lis[i]==1:
ans.append(i)
if len(ans):
print((*ans)) | 18 | 17 | 302 | 306 | N = int(input())
A = list(map(int, input().split()))
B = [0] * N
for i in range(N, 0, -1):
s = A[i - 1]
k = i * 2
while k <= N:
s ^= B[k - 1]
k += i
if s == 1:
B[i - 1] = s
if sum(B) == 0:
print(0)
else:
print(sum(B))
for i in range(N):
if B[i] == 1:
print(i + 1, end=" ")
| N = int(eval(input()))
A = list(map(int, input().split()))
lis = [0] * (N + 1)
for i in range(N, 0, -1):
k = i * 2
cnt = 0
while k <= N:
cnt ^= lis[k]
k += i
lis[i] = cnt ^ A[i - 1]
print((lis.count(1)))
ans = []
for i in range(1, N + 1):
if lis[i] == 1:
ans.append(i)
if len(ans):
print((*ans))
| false | 5.555556 | [
"-N = int(input())",
"+N = int(eval(input()))",
"-B = [0] * N",
"+lis = [0] * (N + 1)",
"- s = A[i - 1]",
"+ cnt = 0",
"- s ^= B[k - 1]",
"+ cnt ^= lis[k]",
"- if s == 1:",
"- B[i - 1] = s",
"-if sum(B) == 0:",
"- print(0)",
"-else:",
"- print(sum(B))",
... | false | 0.037651 | 0.206353 | 0.182458 | [
"s904213575",
"s305555044"
] |
u102461423 | p02998 | python | s858470885 | s751208129 | 427 | 383 | 48,416 | 48,384 | Accepted | Accepted | 10.3 | import numpy as np
from scipy.sparse import *
U = 10**5
N = int(eval(input()))
XY = np.array([input().split() for _ in range(N)], dtype=np.int32)
graph = csr_matrix(([1]*N, (XY[:,0], U + XY[:,1])), (2*U+1, 2*U+1))
_, component = csgraph.connected_components(graph)
X_cnt = np.bincount(component[:U+1], minlength = 2*U+2)
Y_cnt = np.bincount(component[U+1:], minlength = 2*U+2)
pts_cnt = np.bincount(component[XY[:,0]], minlength = 2*U+2)
answer = (X_cnt * Y_cnt - pts_cnt).sum()
print(answer)
| import numpy as np
from scipy.sparse import *
import sys
input = sys.stdin.readline
U = 10**5
N = int(eval(input()))
XY = np.array([input().split() for _ in range(N)], dtype=np.int32)
graph = csr_matrix((np.ones(N,dtype=np.bool), (XY[:,0], U + XY[:,1])), (2*U+1, 2*U+1))
_, component = csgraph.connected_components(graph)
X_cnt = np.bincount(component[:U+1], minlength = 2*U+2)
Y_cnt = np.bincount(component[U+1:], minlength = 2*U+2)
pts_cnt = np.bincount(component[XY[:,0]], minlength = 2*U+2)
answer = (X_cnt * Y_cnt - pts_cnt).sum()
print(answer)
| 15 | 17 | 504 | 563 | import numpy as np
from scipy.sparse import *
U = 10**5
N = int(eval(input()))
XY = np.array([input().split() for _ in range(N)], dtype=np.int32)
graph = csr_matrix(([1] * N, (XY[:, 0], U + XY[:, 1])), (2 * U + 1, 2 * U + 1))
_, component = csgraph.connected_components(graph)
X_cnt = np.bincount(component[: U + 1], minlength=2 * U + 2)
Y_cnt = np.bincount(component[U + 1 :], minlength=2 * U + 2)
pts_cnt = np.bincount(component[XY[:, 0]], minlength=2 * U + 2)
answer = (X_cnt * Y_cnt - pts_cnt).sum()
print(answer)
| import numpy as np
from scipy.sparse import *
import sys
input = sys.stdin.readline
U = 10**5
N = int(eval(input()))
XY = np.array([input().split() for _ in range(N)], dtype=np.int32)
graph = csr_matrix(
(np.ones(N, dtype=np.bool), (XY[:, 0], U + XY[:, 1])), (2 * U + 1, 2 * U + 1)
)
_, component = csgraph.connected_components(graph)
X_cnt = np.bincount(component[: U + 1], minlength=2 * U + 2)
Y_cnt = np.bincount(component[U + 1 :], minlength=2 * U + 2)
pts_cnt = np.bincount(component[XY[:, 0]], minlength=2 * U + 2)
answer = (X_cnt * Y_cnt - pts_cnt).sum()
print(answer)
| false | 11.764706 | [
"+import sys",
"+input = sys.stdin.readline",
"-graph = csr_matrix(([1] * N, (XY[:, 0], U + XY[:, 1])), (2 * U + 1, 2 * U + 1))",
"+graph = csr_matrix(",
"+ (np.ones(N, dtype=np.bool), (XY[:, 0], U + XY[:, 1])), (2 * U + 1, 2 * U + 1)",
"+)"
] | false | 0.791332 | 0.801105 | 0.987802 | [
"s858470885",
"s751208129"
] |
u729217226 | p03486 | python | s623511175 | s209296011 | 108 | 18 | 3,064 | 2,940 | Accepted | Accepted | 83.33 | S = list(input())
T = list(input())
S.sort()
T.sort()
S.reverse()
T.reverse()
for i, s in enumerate(S):
for j, t in enumerate(T):
if s < t:
print('Yes')
exit()
if s > t:
for k, t2 in enumerate(T):
if s < t2:
print('Yes')
exit()
if all([x == S[0] for x in S]) \
and all([x == S[0] for x in T]) \
and len(S) < len(T):
print('Yes')
else:
print('No')
| s = eval(input())
t = eval(input())
sl = ''.join(sorted(s))
tl = ''.join(reversed(sorted(t)))
if sl < tl:
print('Yes')
else:
print('No')
| 23 | 10 | 506 | 144 | S = list(input())
T = list(input())
S.sort()
T.sort()
S.reverse()
T.reverse()
for i, s in enumerate(S):
for j, t in enumerate(T):
if s < t:
print("Yes")
exit()
if s > t:
for k, t2 in enumerate(T):
if s < t2:
print("Yes")
exit()
if all([x == S[0] for x in S]) and all([x == S[0] for x in T]) and len(S) < len(T):
print("Yes")
else:
print("No")
| s = eval(input())
t = eval(input())
sl = "".join(sorted(s))
tl = "".join(reversed(sorted(t)))
if sl < tl:
print("Yes")
else:
print("No")
| false | 56.521739 | [
"-S = list(input())",
"-T = list(input())",
"-S.sort()",
"-T.sort()",
"-S.reverse()",
"-T.reverse()",
"-for i, s in enumerate(S):",
"- for j, t in enumerate(T):",
"- if s < t:",
"- print(\"Yes\")",
"- exit()",
"- if s > t:",
"- for k, t2 in e... | false | 0.045158 | 0.007545 | 5.9853 | [
"s623511175",
"s209296011"
] |
u477343425 | p03292 | python | s146467903 | s895233059 | 19 | 17 | 3,060 | 2,940 | Accepted | Accepted | 10.53 | a,b,c = sorted(map(int, input().split()))
ans = c - a
print(ans)
| L = sorted(map(int, input().split()))
ans = max(L) - min(L)
print(ans) | 5 | 3 | 72 | 72 | a, b, c = sorted(map(int, input().split()))
ans = c - a
print(ans)
| L = sorted(map(int, input().split()))
ans = max(L) - min(L)
print(ans)
| false | 40 | [
"-a, b, c = sorted(map(int, input().split()))",
"-ans = c - a",
"+L = sorted(map(int, input().split()))",
"+ans = max(L) - min(L)"
] | false | 0.050798 | 0.047471 | 1.070083 | [
"s146467903",
"s895233059"
] |
u894265012 | p03160 | python | s114892902 | s288198000 | 192 | 176 | 13,976 | 15,512 | Accepted | Accepted | 8.33 | N = int(eval(input()))
h = list(map(int, input().split()))
INF = 10**9
dp = [INF] * N
dp[0] = 0
for i in range(1, N):
dp[i] = min(dp[i], dp[i-1]+abs(h[i] - h[i-1]))
if i > 1:
dp[i] = min(dp[i], dp[i-2]+abs(h[i] - h[i-2]))
print((dp[N-1])) | N = int(eval(input()))
h = [0] * (2*N)
h[:N] = list(map(int, input().split()))
INF = 10**9
dp = [INF] * (2*N)
dp[0] = 0
for i in range(N):
dp[i+1] = min(dp[i+1], dp[i]+abs(h[i] - h[i+1]))
dp[i+2] = min(dp[i+2], dp[i]+abs(h[i] - h[i+2]))
print((dp[N-1])) | 10 | 10 | 255 | 262 | N = int(eval(input()))
h = list(map(int, input().split()))
INF = 10**9
dp = [INF] * N
dp[0] = 0
for i in range(1, N):
dp[i] = min(dp[i], dp[i - 1] + abs(h[i] - h[i - 1]))
if i > 1:
dp[i] = min(dp[i], dp[i - 2] + abs(h[i] - h[i - 2]))
print((dp[N - 1]))
| N = int(eval(input()))
h = [0] * (2 * N)
h[:N] = list(map(int, input().split()))
INF = 10**9
dp = [INF] * (2 * N)
dp[0] = 0
for i in range(N):
dp[i + 1] = min(dp[i + 1], dp[i] + abs(h[i] - h[i + 1]))
dp[i + 2] = min(dp[i + 2], dp[i] + abs(h[i] - h[i + 2]))
print((dp[N - 1]))
| false | 0 | [
"-h = list(map(int, input().split()))",
"+h = [0] * (2 * N)",
"+h[:N] = list(map(int, input().split()))",
"-dp = [INF] * N",
"+dp = [INF] * (2 * N)",
"-for i in range(1, N):",
"- dp[i] = min(dp[i], dp[i - 1] + abs(h[i] - h[i - 1]))",
"- if i > 1:",
"- dp[i] = min(dp[i], dp[i - 2] + abs(... | false | 0.03939 | 0.116189 | 0.339014 | [
"s114892902",
"s288198000"
] |
u780962115 | p03634 | python | s271229792 | s447239356 | 1,115 | 782 | 134,740 | 134,328 | Accepted | Accepted | 29.87 | import sys
sys.setrecursionlimit(1000000)
n=int(eval(input()))
visitedlist=[-1 for i in range(n)]
kilist=[[] for i in range(n)]
anslist=[0 for i in range(n)]
searchedlist=[-1 for i in range(n)]
for i in range(n-1):
a,b,c=list(map(int,input().split()))
kilist[a-1].append((b,c))
kilist[b-1].append((a,c))
def search(i):
searchedlist[i-1]=1
visitedlist[i-1]=1
flag=0
for j in kilist[i-1]:
if visitedlist[j[0]-1]<0:
visitedlist[j[0]-1]=1
flag+=1
anslist[j[0]-1]=anslist[i-1]+j[1]
else:
pass
if flag>0:
for k in kilist[i-1]:
if searchedlist[k[0]-1]==-1:
search(k[0])
q,k=list(map(int,input().split()))
List=[0 for i in range(q)]
search(k)
for i in range(q):
x,y=list(map(int,input().split()))
List[i]=anslist[x-1]+anslist[y-1]
for j in List:
print(j)
| import sys
input=sys.stdin.readline
sys.setrecursionlimit(1000000)
n=int(eval(input()))
visitedlist=[-1 for i in range(n)]
kilist=[[] for i in range(n)]
anslist=[0 for i in range(n)]
searchedlist=[-1 for i in range(n)]
for i in range(n-1):
a,b,c=list(map(int,input().split()))
kilist[a-1].append((b,c))
kilist[b-1].append((a,c))
def search(i):
searchedlist[i-1]=1
visitedlist[i-1]=1
flag=0
for j in kilist[i-1]:
if visitedlist[j[0]-1]<0:
visitedlist[j[0]-1]=1
flag+=1
anslist[j[0]-1]=anslist[i-1]+j[1]
else:
pass
if flag>0:
for k in kilist[i-1]:
if searchedlist[k[0]-1]==-1:
search(k[0])
q,k=list(map(int,input().split()))
List=[0 for i in range(q)]
search(k)
for i in range(q):
x,y=list(map(int,input().split()))
List[i]=anslist[x-1]+anslist[y-1]
for j in List:
print(j)
| 35 | 36 | 975 | 1,001 | import sys
sys.setrecursionlimit(1000000)
n = int(eval(input()))
visitedlist = [-1 for i in range(n)]
kilist = [[] for i in range(n)]
anslist = [0 for i in range(n)]
searchedlist = [-1 for i in range(n)]
for i in range(n - 1):
a, b, c = list(map(int, input().split()))
kilist[a - 1].append((b, c))
kilist[b - 1].append((a, c))
def search(i):
searchedlist[i - 1] = 1
visitedlist[i - 1] = 1
flag = 0
for j in kilist[i - 1]:
if visitedlist[j[0] - 1] < 0:
visitedlist[j[0] - 1] = 1
flag += 1
anslist[j[0] - 1] = anslist[i - 1] + j[1]
else:
pass
if flag > 0:
for k in kilist[i - 1]:
if searchedlist[k[0] - 1] == -1:
search(k[0])
q, k = list(map(int, input().split()))
List = [0 for i in range(q)]
search(k)
for i in range(q):
x, y = list(map(int, input().split()))
List[i] = anslist[x - 1] + anslist[y - 1]
for j in List:
print(j)
| import sys
input = sys.stdin.readline
sys.setrecursionlimit(1000000)
n = int(eval(input()))
visitedlist = [-1 for i in range(n)]
kilist = [[] for i in range(n)]
anslist = [0 for i in range(n)]
searchedlist = [-1 for i in range(n)]
for i in range(n - 1):
a, b, c = list(map(int, input().split()))
kilist[a - 1].append((b, c))
kilist[b - 1].append((a, c))
def search(i):
searchedlist[i - 1] = 1
visitedlist[i - 1] = 1
flag = 0
for j in kilist[i - 1]:
if visitedlist[j[0] - 1] < 0:
visitedlist[j[0] - 1] = 1
flag += 1
anslist[j[0] - 1] = anslist[i - 1] + j[1]
else:
pass
if flag > 0:
for k in kilist[i - 1]:
if searchedlist[k[0] - 1] == -1:
search(k[0])
q, k = list(map(int, input().split()))
List = [0 for i in range(q)]
search(k)
for i in range(q):
x, y = list(map(int, input().split()))
List[i] = anslist[x - 1] + anslist[y - 1]
for j in List:
print(j)
| false | 2.777778 | [
"+input = sys.stdin.readline"
] | false | 0.042829 | 0.042713 | 1.002694 | [
"s271229792",
"s447239356"
] |
u411203878 | p02960 | python | s590133162 | s496800502 | 567 | 287 | 61,916 | 101,040 | Accepted | Accepted | 49.38 | s = eval(input())
mod = 10**9 + 7
n = len(s)
dp = [[0] * 13 for i in range(n+1)]
dp[0][0] = 1
for i in range(n):
ss = s[i]
for j in range(13):
if ss == '?':
for k in range(10):
dp[i+1][(j*10+k)%13] += dp[i][j]
else:
dp[i+1][(j*10+int(ss))%13] += dp[i][j]
dp[i+1][j] %= mod
print((dp[n][5]%mod)) | mod = 1000000007
S = list(eval(input()))
n = len(S)
dp = [[0]*13 for _ in range(n+1)]
dp[0][0] = 1
for i in range(n):
s = S[i]
for j in range(13):
if s == '?':
for k in range(10):
dp[i+1][(j*10+k)%13] += dp[i][j]
else:
dp[i+1][(j*10+int(s))%13] += dp[i][j]
dp[i+1][j] %= mod
print((dp[n][5]%mod)) | 15 | 19 | 372 | 386 | s = eval(input())
mod = 10**9 + 7
n = len(s)
dp = [[0] * 13 for i in range(n + 1)]
dp[0][0] = 1
for i in range(n):
ss = s[i]
for j in range(13):
if ss == "?":
for k in range(10):
dp[i + 1][(j * 10 + k) % 13] += dp[i][j]
else:
dp[i + 1][(j * 10 + int(ss)) % 13] += dp[i][j]
dp[i + 1][j] %= mod
print((dp[n][5] % mod))
| mod = 1000000007
S = list(eval(input()))
n = len(S)
dp = [[0] * 13 for _ in range(n + 1)]
dp[0][0] = 1
for i in range(n):
s = S[i]
for j in range(13):
if s == "?":
for k in range(10):
dp[i + 1][(j * 10 + k) % 13] += dp[i][j]
else:
dp[i + 1][(j * 10 + int(s)) % 13] += dp[i][j]
dp[i + 1][j] %= mod
print((dp[n][5] % mod))
| false | 21.052632 | [
"-s = eval(input())",
"-mod = 10**9 + 7",
"-n = len(s)",
"-dp = [[0] * 13 for i in range(n + 1)]",
"+mod = 1000000007",
"+S = list(eval(input()))",
"+n = len(S)",
"+dp = [[0] * 13 for _ in range(n + 1)]",
"- ss = s[i]",
"+ s = S[i]",
"- if ss == \"?\":",
"+ if s == \"?\":",... | false | 0.038582 | 0.088184 | 0.437515 | [
"s590133162",
"s496800502"
] |
u677121387 | p02762 | python | s552926667 | s629076495 | 1,171 | 958 | 11,832 | 33,032 | Accepted | Accepted | 18.19 | class DisjointSet:
def __init__(self,n):
self.parent = [i for i in range(n)]
self.siz = [1]*n
def root(self,x):
if x != self.parent[x]:
self.parent[x] = self.root(self.parent[x])
return self.parent[x]
def same(self,x,y):
return self.root(x) == self.root(y)
def unite(self,x,y):
x = self.root(x)
y = self.root(y)
if x == y:
return
if self.siz[x] < self.siz[y]:
x,y = y,x
self.parent[y] = x
self.siz[x] += self.siz[y]
def size(self,x):
return self.siz[self.root(x)]
n,m,k = list(map(int,input().split()))
cnt = [0]*n
ds = DisjointSet(n)
for _ in range(m):
a,b = list(map(int,input().split()))
a -= 1
b -= 1
cnt[a] += 1
cnt[b] += 1
ds.unite(a,b)
for _ in range(k):
c,d = list(map(int,input().split()))
c -= 1
d -= 1
if ds.same(c,d):
cnt[c] += 1
cnt[d] += 1
ans = [ds.size(i) - cnt[i] - 1 for i in range(n)]
print((*ans)) | from collections import deque,Counter
n,m,k = list(map(int,input().split()))
G = [[] for _ in range(n)]
exc = [0]*n
for _ in range(m):
a,b = list(map(int,input().split()))
a -= 1
b -= 1
G[a].append(b)
G[b].append(a)
exc[a] += 1
exc[b] += 1
stk = deque()
grp = [-1]*n
grpnum = 0
def dfs(s,g):
stk.append(s)
grp[s] = g
while stk:
cur = stk.pop()
for nxt in G[cur]:
if grp[nxt] != -1: continue
grp[nxt] = g
stk.append(nxt)
for i in range(n):
if grp[i] != -1: continue
dfs(i,grpnum)
grpnum += 1
cnt = Counter(grp)
for _ in range(k):
c,d = list(map(int,input().split()))
c -= 1
d -= 1
if grp[c] == grp[d]:
exc[c] += 1
exc[d] += 1
ans = [cnt[grp[i]] - exc[i] - 1 for i in range(n)]
print((*ans)) | 45 | 43 | 1,059 | 855 | class DisjointSet:
def __init__(self, n):
self.parent = [i for i in range(n)]
self.siz = [1] * n
def root(self, x):
if x != self.parent[x]:
self.parent[x] = self.root(self.parent[x])
return self.parent[x]
def same(self, x, y):
return self.root(x) == self.root(y)
def unite(self, x, y):
x = self.root(x)
y = self.root(y)
if x == y:
return
if self.siz[x] < self.siz[y]:
x, y = y, x
self.parent[y] = x
self.siz[x] += self.siz[y]
def size(self, x):
return self.siz[self.root(x)]
n, m, k = list(map(int, input().split()))
cnt = [0] * n
ds = DisjointSet(n)
for _ in range(m):
a, b = list(map(int, input().split()))
a -= 1
b -= 1
cnt[a] += 1
cnt[b] += 1
ds.unite(a, b)
for _ in range(k):
c, d = list(map(int, input().split()))
c -= 1
d -= 1
if ds.same(c, d):
cnt[c] += 1
cnt[d] += 1
ans = [ds.size(i) - cnt[i] - 1 for i in range(n)]
print((*ans))
| from collections import deque, Counter
n, m, k = list(map(int, input().split()))
G = [[] for _ in range(n)]
exc = [0] * n
for _ in range(m):
a, b = list(map(int, input().split()))
a -= 1
b -= 1
G[a].append(b)
G[b].append(a)
exc[a] += 1
exc[b] += 1
stk = deque()
grp = [-1] * n
grpnum = 0
def dfs(s, g):
stk.append(s)
grp[s] = g
while stk:
cur = stk.pop()
for nxt in G[cur]:
if grp[nxt] != -1:
continue
grp[nxt] = g
stk.append(nxt)
for i in range(n):
if grp[i] != -1:
continue
dfs(i, grpnum)
grpnum += 1
cnt = Counter(grp)
for _ in range(k):
c, d = list(map(int, input().split()))
c -= 1
d -= 1
if grp[c] == grp[d]:
exc[c] += 1
exc[d] += 1
ans = [cnt[grp[i]] - exc[i] - 1 for i in range(n)]
print((*ans))
| false | 4.444444 | [
"-class DisjointSet:",
"- def __init__(self, n):",
"- self.parent = [i for i in range(n)]",
"- self.siz = [1] * n",
"-",
"- def root(self, x):",
"- if x != self.parent[x]:",
"- self.parent[x] = self.root(self.parent[x])",
"- return self.parent[x]",
"-",... | false | 0.042817 | 0.086218 | 0.496612 | [
"s552926667",
"s629076495"
] |
u948911484 | p03108 | python | s993049333 | s473856280 | 1,109 | 510 | 105,560 | 29,484 | Accepted | Accepted | 54.01 | n,m = list(map(int,input().split()))
ab = [list(map(int,input().split())) for i in range(m)]
class UnionFind():
def __init__(self, n):
self.n = n
self.parents = [-1] * n
def find(self, x):
if self.parents[x] < 0:
return x
else:
self.parents[x] = self.find(self.parents[x])
return self.parents[x]
def union(self, x, y):
x = self.find(x)
y = self.find(y)
if x == y:
return
if self.parents[x] > self.parents[y]:
x, y = y, x
self.parents[x] += self.parents[y]
self.parents[y] = x
def size(self, x):
return -self.parents[self.find(x)]
def same(self, x, y):
return self.find(x) == self.find(y)
def members(self, x):
root = self.find(x)
return [i for i in range(self.n) if self.find(i) == root]
def roots(self):
return [i for i, x in enumerate(self.parents) if x < 0]
def group_count(self):
return len(self.roots())
def all_group_members(self):
return {r: self.members(r) for r in self.roots()}
def __str__(self):
return '\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots())
uf = UnionFind(n)
s = n*(n-1)//2
ans = [0]*m
for i in range(m-1,-1,-1):
if uf.find(ab[i][0]-1) != uf.find(ab[i][1]-1):
s -= uf.size(ab[i][0]-1)*uf.size(ab[i][1]-1)
uf.union(ab[i][0]-1,ab[i][1]-1)
ans[i-1] = s
ans[m-1] = n*(n-1)//2
for i in ans:
print(i) | class UnionFind():
def __init__(self, n):
self.n = n
self.parents = [-1] * n
def find(self, x):
if self.parents[x] < 0:
return x
else:
self.parents[x] = self.find(self.parents[x])
return self.parents[x]
def union(self, x, y):
x = self.find(x)
y = self.find(y)
if x == y:
return
if self.parents[x] > self.parents[y]:
x, y = y, x
self.parents[x] += self.parents[y]
self.parents[y] = x
def size(self, x):
return -self.parents[self.find(x)]
def same(self, x, y):
return self.find(x) == self.find(y)
def members(self, x):
root = self.find(x)
return [i for i in range(self.n) if self.find(i) == root]
def roots(self):
return [i for i, x in enumerate(self.parents) if x < 0]
def group_count(self):
return len(self.roots())
def all_group_members(self):
return {r: self.members(r) for r in self.roots()}
def __str__(self):
return '\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots())
n,m = list(map(int,input().split()))
uf = UnionFind(n)
q = []
for i in range(m):
a,b = list(map(int,input().split()))
q.append([a-1,b-1])
ans = n*(n-1)//2
l = []
for i in range(m-1,-1,-1):
a,b = q[i]
l.append(ans)
if not uf.same(a,b):
ans -= uf.size(a)*uf.size(b)
uf.union(a,b)
for i in l[::-1]:
print(i) | 60 | 64 | 1,564 | 1,539 | n, m = list(map(int, input().split()))
ab = [list(map(int, input().split())) for i in range(m)]
class UnionFind:
def __init__(self, n):
self.n = n
self.parents = [-1] * n
def find(self, x):
if self.parents[x] < 0:
return x
else:
self.parents[x] = self.find(self.parents[x])
return self.parents[x]
def union(self, x, y):
x = self.find(x)
y = self.find(y)
if x == y:
return
if self.parents[x] > self.parents[y]:
x, y = y, x
self.parents[x] += self.parents[y]
self.parents[y] = x
def size(self, x):
return -self.parents[self.find(x)]
def same(self, x, y):
return self.find(x) == self.find(y)
def members(self, x):
root = self.find(x)
return [i for i in range(self.n) if self.find(i) == root]
def roots(self):
return [i for i, x in enumerate(self.parents) if x < 0]
def group_count(self):
return len(self.roots())
def all_group_members(self):
return {r: self.members(r) for r in self.roots()}
def __str__(self):
return "\n".join("{}: {}".format(r, self.members(r)) for r in self.roots())
uf = UnionFind(n)
s = n * (n - 1) // 2
ans = [0] * m
for i in range(m - 1, -1, -1):
if uf.find(ab[i][0] - 1) != uf.find(ab[i][1] - 1):
s -= uf.size(ab[i][0] - 1) * uf.size(ab[i][1] - 1)
uf.union(ab[i][0] - 1, ab[i][1] - 1)
ans[i - 1] = s
ans[m - 1] = n * (n - 1) // 2
for i in ans:
print(i)
| class UnionFind:
def __init__(self, n):
self.n = n
self.parents = [-1] * n
def find(self, x):
if self.parents[x] < 0:
return x
else:
self.parents[x] = self.find(self.parents[x])
return self.parents[x]
def union(self, x, y):
x = self.find(x)
y = self.find(y)
if x == y:
return
if self.parents[x] > self.parents[y]:
x, y = y, x
self.parents[x] += self.parents[y]
self.parents[y] = x
def size(self, x):
return -self.parents[self.find(x)]
def same(self, x, y):
return self.find(x) == self.find(y)
def members(self, x):
root = self.find(x)
return [i for i in range(self.n) if self.find(i) == root]
def roots(self):
return [i for i, x in enumerate(self.parents) if x < 0]
def group_count(self):
return len(self.roots())
def all_group_members(self):
return {r: self.members(r) for r in self.roots()}
def __str__(self):
return "\n".join("{}: {}".format(r, self.members(r)) for r in self.roots())
n, m = list(map(int, input().split()))
uf = UnionFind(n)
q = []
for i in range(m):
a, b = list(map(int, input().split()))
q.append([a - 1, b - 1])
ans = n * (n - 1) // 2
l = []
for i in range(m - 1, -1, -1):
a, b = q[i]
l.append(ans)
if not uf.same(a, b):
ans -= uf.size(a) * uf.size(b)
uf.union(a, b)
for i in l[::-1]:
print(i)
| false | 6.25 | [
"-n, m = list(map(int, input().split()))",
"-ab = [list(map(int, input().split())) for i in range(m)]",
"-",
"-",
"+n, m = list(map(int, input().split()))",
"-s = n * (n - 1) // 2",
"-ans = [0] * m",
"+q = []",
"+for i in range(m):",
"+ a, b = list(map(int, input().split()))",
"+ q.append(... | false | 0.038539 | 0.038886 | 0.991086 | [
"s993049333",
"s473856280"
] |
u281303342 | p03148 | python | s623887604 | s017023042 | 1,581 | 299 | 21,252 | 19,216 | Accepted | Accepted | 81.09 | N,K = list(map(int,input().split()))
X = []
for i in range(N):
t,d = list(map(int,input().split()))
X.append((d,t))
X.sort(reverse=True)
p,v = 0,set([])
pp = []
for i in range(K):
p += X[i][0]
if X[i][1] not in v:
v.add(X[i][1])
else:
pp.append((X[i][0],X[i][1]))
Ans = p + len(v)**2
ans = Ans
for i in range(K,N):
if X[i][1] not in v and len(pp)>0:
temp = pp[-1]
pp = pp[:len(pp)-1]
ans = ans - temp[0] + X[i][0] - len(v)**2 + (len(v)+1)**2
v.add(X[i][1])
Ans = max(Ans,ans)
print(Ans)
| # Python3 (3.4.3)
import sys
input = sys.stdin.readline
# -------------------------------------------------------------
# function
# -------------------------------------------------------------
# -------------------------------------------------------------
# main
# -------------------------------------------------------------
N,K = list(map(int,input().split()))
TD = [tuple(map(int,input().split())) for _ in range(N)]
# 美味しい順にソートしておく
# t : ネタの種類
# d : 美味しさ基礎ポイント
TD.sort(key=lambda x:x[1], reverse=True)
# 美味しい順にK個食べた場合の満足ポイント
ans = 0
s = set() # 食べたネタの集合
r = list() # すでに食べたネタ, あとで交換する用
for i in range(K):
t,d = TD[i]
ans += d
if t not in s:
s.add(t) # 食べたネタの種類の集合
else:
r.append(TD[i])
ans += len(s)**2
Ans = ans
# 美味しい順のK+1番目から, ネタの種類が増えるような操作を順番に試していく
for i in range(K,N):
t0,d0 = TD[i]
# まだ食べてないネタ and 交換用の寿司があるなら
if t0 not in s and len(r) > 0:
# 交換用の寿司の一番美味しさ基礎ポイントが低いものを交換するのが最善
t1,d1 = r.pop()
# 満足ポイントの再計算
ans = ans - d1 + d0 - len(s)**2 + (len(s)+1)**2
# 食べたネタの集合に追加
s.add(t0)
# 満足度が大きくなったか都度確認
Ans = max(Ans,ans)
print(Ans) | 28 | 50 | 586 | 1,201 | N, K = list(map(int, input().split()))
X = []
for i in range(N):
t, d = list(map(int, input().split()))
X.append((d, t))
X.sort(reverse=True)
p, v = 0, set([])
pp = []
for i in range(K):
p += X[i][0]
if X[i][1] not in v:
v.add(X[i][1])
else:
pp.append((X[i][0], X[i][1]))
Ans = p + len(v) ** 2
ans = Ans
for i in range(K, N):
if X[i][1] not in v and len(pp) > 0:
temp = pp[-1]
pp = pp[: len(pp) - 1]
ans = ans - temp[0] + X[i][0] - len(v) ** 2 + (len(v) + 1) ** 2
v.add(X[i][1])
Ans = max(Ans, ans)
print(Ans)
| # Python3 (3.4.3)
import sys
input = sys.stdin.readline
# -------------------------------------------------------------
# function
# -------------------------------------------------------------
# -------------------------------------------------------------
# main
# -------------------------------------------------------------
N, K = list(map(int, input().split()))
TD = [tuple(map(int, input().split())) for _ in range(N)]
# 美味しい順にソートしておく
# t : ネタの種類
# d : 美味しさ基礎ポイント
TD.sort(key=lambda x: x[1], reverse=True)
# 美味しい順にK個食べた場合の満足ポイント
ans = 0
s = set() # 食べたネタの集合
r = list() # すでに食べたネタ, あとで交換する用
for i in range(K):
t, d = TD[i]
ans += d
if t not in s:
s.add(t) # 食べたネタの種類の集合
else:
r.append(TD[i])
ans += len(s) ** 2
Ans = ans
# 美味しい順のK+1番目から, ネタの種類が増えるような操作を順番に試していく
for i in range(K, N):
t0, d0 = TD[i]
# まだ食べてないネタ and 交換用の寿司があるなら
if t0 not in s and len(r) > 0:
# 交換用の寿司の一番美味しさ基礎ポイントが低いものを交換するのが最善
t1, d1 = r.pop()
# 満足ポイントの再計算
ans = ans - d1 + d0 - len(s) ** 2 + (len(s) + 1) ** 2
# 食べたネタの集合に追加
s.add(t0)
# 満足度が大きくなったか都度確認
Ans = max(Ans, ans)
print(Ans)
| false | 44 | [
"+# Python3 (3.4.3)",
"+import sys",
"+",
"+input = sys.stdin.readline",
"+# function",
"+# main",
"-X = []",
"-for i in range(N):",
"- t, d = list(map(int, input().split()))",
"- X.append((d, t))",
"-X.sort(reverse=True)",
"-p, v = 0, set([])",
"-pp = []",
"+TD = [tuple(map(int, inp... | false | 0.054539 | 0.035561 | 1.5337 | [
"s623887604",
"s017023042"
] |
u678505520 | p02924 | python | s966635345 | s841456225 | 1,362 | 65 | 62,820 | 61,528 | Accepted | Accepted | 95.23 | n = int(eval(input()))
ans = 0
for i in range(n):
ans += i
print(ans) | n = int(eval(input()))
print((n*(n-1)//2)) | 5 | 2 | 71 | 35 | n = int(eval(input()))
ans = 0
for i in range(n):
ans += i
print(ans)
| n = int(eval(input()))
print((n * (n - 1) // 2))
| false | 60 | [
"-ans = 0",
"-for i in range(n):",
"- ans += i",
"-print(ans)",
"+print((n * (n - 1) // 2))"
] | false | 0.134208 | 0.032254 | 4.160987 | [
"s966635345",
"s841456225"
] |
u072717685 | p03838 | python | s148725842 | s480354429 | 346 | 29 | 79,816 | 9,132 | Accepted | Accepted | 91.62 | import sys
read = sys.stdin.read
readlines = sys.stdin.readlines
def main():
x, y = list(map(int, input().split()))
if x < y:
if y == 0:
print((-x))
elif x == 0:
print(y)
elif 0 < x and 0 < y:
print((y - x))
elif x < 0 and 0 < y:
print((abs(y - abs(x)) + 1))
else:
print((y - x))
else:
if y == 0:
print((x + 1))
elif x == 0:
print((-y + 1))
elif 0 < y and 0 < x:
print((x - y + 2))
elif y < 0 and 0 < x:
print((abs(x - abs(y)) + 1))
else:
print(((x - y) + 2))
if __name__ == '__main__':
main()
| import sys
read = sys.stdin.read
readlines = sys.stdin.readlines
def main():
x, y = list(map(int, input().split()))
inf = float('inf')
r1 = y - x if y - x >= 0 else inf
r2 = y - -x + 1 if y - -x >= 0 else inf
r3 = -y - x + 1 if -y - x >= 0 else inf
r4 = -y - -x + 2 if -y - -x >= 0 else inf
r = min(r1, r2, r3, r4)
print(r)
if __name__ == '__main__':
main()
| 30 | 15 | 716 | 403 | import sys
read = sys.stdin.read
readlines = sys.stdin.readlines
def main():
x, y = list(map(int, input().split()))
if x < y:
if y == 0:
print((-x))
elif x == 0:
print(y)
elif 0 < x and 0 < y:
print((y - x))
elif x < 0 and 0 < y:
print((abs(y - abs(x)) + 1))
else:
print((y - x))
else:
if y == 0:
print((x + 1))
elif x == 0:
print((-y + 1))
elif 0 < y and 0 < x:
print((x - y + 2))
elif y < 0 and 0 < x:
print((abs(x - abs(y)) + 1))
else:
print(((x - y) + 2))
if __name__ == "__main__":
main()
| import sys
read = sys.stdin.read
readlines = sys.stdin.readlines
def main():
x, y = list(map(int, input().split()))
inf = float("inf")
r1 = y - x if y - x >= 0 else inf
r2 = y - -x + 1 if y - -x >= 0 else inf
r3 = -y - x + 1 if -y - x >= 0 else inf
r4 = -y - -x + 2 if -y - -x >= 0 else inf
r = min(r1, r2, r3, r4)
print(r)
if __name__ == "__main__":
main()
| false | 50 | [
"- if x < y:",
"- if y == 0:",
"- print((-x))",
"- elif x == 0:",
"- print(y)",
"- elif 0 < x and 0 < y:",
"- print((y - x))",
"- elif x < 0 and 0 < y:",
"- print((abs(y - abs(x)) + 1))",
"- else:",
"- p... | false | 0.042238 | 0.034554 | 1.222376 | [
"s148725842",
"s480354429"
] |
u459150945 | p02725 | python | s796703096 | s125864759 | 231 | 149 | 26,420 | 26,444 | Accepted | Accepted | 35.5 | K, N = list(map(int, input().split()))
An = list(map(int, input().split()))
An_1 = [A for A in An if A <= K/2]
An_2 = [A-K for A in An if A > K/2]
An_new = An_1 + An_2
ans = 0
for i in range(len(An)-1):
ans = max(ans, An[i+1]-An[i])
ans = max(ans, An_new[0] - An_new[-1])
print((K-ans)) | K, N = list(map(int, input().split()))
An = list(map(int, input().split()))
ans = 0
for i in range(len(An)-1):
ans = max(ans, An[i+1]-An[i])
ans = max(ans, An[0] - (An[-1]-K))
print((K-ans))
| 14 | 12 | 303 | 203 | K, N = list(map(int, input().split()))
An = list(map(int, input().split()))
An_1 = [A for A in An if A <= K / 2]
An_2 = [A - K for A in An if A > K / 2]
An_new = An_1 + An_2
ans = 0
for i in range(len(An) - 1):
ans = max(ans, An[i + 1] - An[i])
ans = max(ans, An_new[0] - An_new[-1])
print((K - ans))
| K, N = list(map(int, input().split()))
An = list(map(int, input().split()))
ans = 0
for i in range(len(An) - 1):
ans = max(ans, An[i + 1] - An[i])
ans = max(ans, An[0] - (An[-1] - K))
print((K - ans))
| false | 14.285714 | [
"-An_1 = [A for A in An if A <= K / 2]",
"-An_2 = [A - K for A in An if A > K / 2]",
"-An_new = An_1 + An_2",
"-ans = max(ans, An_new[0] - An_new[-1])",
"+ans = max(ans, An[0] - (An[-1] - K))"
] | false | 0.037663 | 0.037677 | 0.999644 | [
"s796703096",
"s125864759"
] |
u125269142 | p03308 | python | s882139835 | s809629226 | 114 | 28 | 27,228 | 9,160 | Accepted | Accepted | 75.44 | import numpy as np
n = int(eval(input()))
lists = list(map(int, input().split()))
arr = np.array(lists)
maximum = arr.max()
minimum = arr.min()
print((maximum - minimum)) | n = int(eval(input()))
lists = list(map(int, input().split()))
lists.sort()
print((lists[-1] - lists[0])) | 9 | 5 | 172 | 103 | import numpy as np
n = int(eval(input()))
lists = list(map(int, input().split()))
arr = np.array(lists)
maximum = arr.max()
minimum = arr.min()
print((maximum - minimum))
| n = int(eval(input()))
lists = list(map(int, input().split()))
lists.sort()
print((lists[-1] - lists[0]))
| false | 44.444444 | [
"-import numpy as np",
"-",
"-arr = np.array(lists)",
"-maximum = arr.max()",
"-minimum = arr.min()",
"-print((maximum - minimum))",
"+lists.sort()",
"+print((lists[-1] - lists[0]))"
] | false | 0.144977 | 0.052157 | 2.779617 | [
"s882139835",
"s809629226"
] |
u608088992 | p02954 | python | s316277572 | s938374658 | 252 | 100 | 54,748 | 15,296 | Accepted | Accepted | 60.32 | import sys
from bisect import bisect_left, bisect
def solve():
S = eval(input())
N = len(S)
RL = []
B = [0] * N
for i in range(N):
if S[i] == "R":
if i < N - 1 and S[i + 1] == "L": RL.append(i)
for i in range(N):
j = bisect_left(RL, i)
if S[i] == "R":
if (RL[j] - i) % 2 == 0: B[RL[j]] += 1
else: B[RL[j] + 1] += 1
else:
if (i - RL[j - 1]) % 2 == 0: B[RL[j - 1]] += 1
else: B[RL[j - 1] + 1] += 1
print((" ".join(map(str, B))))
return 0
if __name__ == "__main__":
solve() | import sys
def solve():
input = sys.stdin.readline
S = input().strip("\n")
N = len(S)
nL, nR = [N-1] * N, [0] * N
cl, cr = N-1, 0
for i in range(1, N):
if S[i] == "R": cr = i
nR[i] = cr
if S[N-i-1] == "L": cl = N-i-1
nL[N-i-1] = cl
sumC = [0] * N
for i in range(N):
if S[i] == "R":
move = nL[i] - i
if move % 2 == 0: sumC[nL[i]] += 1
else: sumC[nL[i] - 1] += 1
else:
move = i - nR[i]
if move % 2 == 0: sumC[nR[i]] += 1
else: sumC[nR[i] + 1] += 1
print((" ".join(map(str, sumC))))
return 0
if __name__ == "__main__":
solve() | 24 | 32 | 615 | 722 | import sys
from bisect import bisect_left, bisect
def solve():
S = eval(input())
N = len(S)
RL = []
B = [0] * N
for i in range(N):
if S[i] == "R":
if i < N - 1 and S[i + 1] == "L":
RL.append(i)
for i in range(N):
j = bisect_left(RL, i)
if S[i] == "R":
if (RL[j] - i) % 2 == 0:
B[RL[j]] += 1
else:
B[RL[j] + 1] += 1
else:
if (i - RL[j - 1]) % 2 == 0:
B[RL[j - 1]] += 1
else:
B[RL[j - 1] + 1] += 1
print((" ".join(map(str, B))))
return 0
if __name__ == "__main__":
solve()
| import sys
def solve():
input = sys.stdin.readline
S = input().strip("\n")
N = len(S)
nL, nR = [N - 1] * N, [0] * N
cl, cr = N - 1, 0
for i in range(1, N):
if S[i] == "R":
cr = i
nR[i] = cr
if S[N - i - 1] == "L":
cl = N - i - 1
nL[N - i - 1] = cl
sumC = [0] * N
for i in range(N):
if S[i] == "R":
move = nL[i] - i
if move % 2 == 0:
sumC[nL[i]] += 1
else:
sumC[nL[i] - 1] += 1
else:
move = i - nR[i]
if move % 2 == 0:
sumC[nR[i]] += 1
else:
sumC[nR[i] + 1] += 1
print((" ".join(map(str, sumC))))
return 0
if __name__ == "__main__":
solve()
| false | 25 | [
"-from bisect import bisect_left, bisect",
"- S = eval(input())",
"+ input = sys.stdin.readline",
"+ S = input().strip(\"\\n\")",
"- RL = []",
"- B = [0] * N",
"+ nL, nR = [N - 1] * N, [0] * N",
"+ cl, cr = N - 1, 0",
"+ for i in range(1, N):",
"+ if S[i] == \"R\":",... | false | 0.107971 | 0.154963 | 0.69675 | [
"s316277572",
"s938374658"
] |
u562767072 | p02684 | python | s310004962 | s012616915 | 285 | 209 | 51,012 | 51,080 | Accepted | Accepted | 26.67 | #!/usr/bin/env python3
import numpy as np
# def input():
# return sys.stdin.readline().rstrip()
def main():
n, k = list(map(int, input().split()))
warps = list(map(int, input().split()))
warps = [0] + warps
warps = np.array(warps, dtype=int)
order_num = np.zeros(len(warps) + 1, dtype=int)
path_history = []
node = 1
while order_num[node] == 0:
path_history.append(node)
order_num[node] = len(path_history)
node = warps[node]
# print(order_num)
# print(path_history)
begin = order_num[node]
# print(tail)
if k <= begin:
print((path_history[k]))
else:
# path_history = path_history[tail:]
# print(path_history)
leng = len(path_history) - order_num[node] + 1
# print(leng)
index = (k - (begin - 1)) % leng
# print(index)
print((path_history[begin - 1 + index]))
main()
| #!/usr/bin/env python3
import numpy as np
# def input():
# return sys.stdin.readline().rstrip()
def main():
n, k = list(map(int, input().split()))
warps = list(map(int, input().split()))
warps = [0] + warps
# warps = np.array(warps, dtype=int)
# order_num = np.zeros(len(warps) + 1, dtype=int)
order_num = [0 for i in range(len(warps))]
path_history = []
node = 1
while order_num[node] == 0:
path_history.append(node)
order_num[node] = len(path_history)
node = warps[node]
# print(order_num)
# print(path_history)
begin = order_num[node]
# print(tail)
if k <= begin:
print((path_history[k]))
else:
# path_history = path_history[tail:]
# print(path_history)
leng = len(path_history) - order_num[node] + 1
# print(leng)
index = (k - (begin - 1)) % leng
# print(index)
print((path_history[begin - 1 + index]))
main()
| 43 | 44 | 959 | 1,011 | #!/usr/bin/env python3
import numpy as np
# def input():
# return sys.stdin.readline().rstrip()
def main():
n, k = list(map(int, input().split()))
warps = list(map(int, input().split()))
warps = [0] + warps
warps = np.array(warps, dtype=int)
order_num = np.zeros(len(warps) + 1, dtype=int)
path_history = []
node = 1
while order_num[node] == 0:
path_history.append(node)
order_num[node] = len(path_history)
node = warps[node]
# print(order_num)
# print(path_history)
begin = order_num[node]
# print(tail)
if k <= begin:
print((path_history[k]))
else:
# path_history = path_history[tail:]
# print(path_history)
leng = len(path_history) - order_num[node] + 1
# print(leng)
index = (k - (begin - 1)) % leng
# print(index)
print((path_history[begin - 1 + index]))
main()
| #!/usr/bin/env python3
import numpy as np
# def input():
# return sys.stdin.readline().rstrip()
def main():
n, k = list(map(int, input().split()))
warps = list(map(int, input().split()))
warps = [0] + warps
# warps = np.array(warps, dtype=int)
# order_num = np.zeros(len(warps) + 1, dtype=int)
order_num = [0 for i in range(len(warps))]
path_history = []
node = 1
while order_num[node] == 0:
path_history.append(node)
order_num[node] = len(path_history)
node = warps[node]
# print(order_num)
# print(path_history)
begin = order_num[node]
# print(tail)
if k <= begin:
print((path_history[k]))
else:
# path_history = path_history[tail:]
# print(path_history)
leng = len(path_history) - order_num[node] + 1
# print(leng)
index = (k - (begin - 1)) % leng
# print(index)
print((path_history[begin - 1 + index]))
main()
| false | 2.272727 | [
"- warps = np.array(warps, dtype=int)",
"- order_num = np.zeros(len(warps) + 1, dtype=int)",
"+ # warps = np.array(warps, dtype=int)",
"+ # order_num = np.zeros(len(warps) + 1, dtype=int)",
"+ order_num = [0 for i in range(len(warps))]"
] | false | 0.187221 | 0.040199 | 4.657327 | [
"s310004962",
"s012616915"
] |
u652057333 | p03026 | python | s605841457 | s850187078 | 1,809 | 81 | 14,880 | 14,752 | Accepted | Accepted | 95.52 | from collections import defaultdict
import sys
sys.setrecursionlimit(20000000)
connection = defaultdict(lambda: [])
n = int(eval(input()))
ab = []
for i in range(n-1):
a, b = list(map(int, input().split()))
connection[a].append(b)
connection[b].append(a)
ab.append((a, b))
c = list(map(int, input().split()))
c.sort()
ans = [0] * (n+1)
checked_list = []
def dfs(num):
checked_list.append(num)
ans[num] = c.pop()
for next_num in connection[num]:
if next_num not in checked_list:
dfs(next_num)
dfs(1)
score = 0
for a, b in ab:
score += min(ans[a], ans[b])
print(score)
print((" ".join(map(str, ans[1:]))))
| from collections import defaultdict
import sys
sys.setrecursionlimit(20000000)
connection = defaultdict(lambda: [])
n = int(eval(input()))
ab = []
for i in range(n-1):
a, b = list(map(int, input().split()))
connection[a].append(b)
connection[b].append(a)
ab.append((a, b))
c = list(map(int, input().split()))
c.sort()
ans = [0] * (n+1)
def dfs(num):
ans[num] = c.pop()
for next_num in connection[num]:
if ans[next_num] == 0 :
dfs(next_num)
dfs(1)
score = 0
for a, b in ab:
score += min(ans[a], ans[b])
print(score)
print((" ".join(map(str, ans[1:]))))
| 35 | 32 | 684 | 624 | from collections import defaultdict
import sys
sys.setrecursionlimit(20000000)
connection = defaultdict(lambda: [])
n = int(eval(input()))
ab = []
for i in range(n - 1):
a, b = list(map(int, input().split()))
connection[a].append(b)
connection[b].append(a)
ab.append((a, b))
c = list(map(int, input().split()))
c.sort()
ans = [0] * (n + 1)
checked_list = []
def dfs(num):
checked_list.append(num)
ans[num] = c.pop()
for next_num in connection[num]:
if next_num not in checked_list:
dfs(next_num)
dfs(1)
score = 0
for a, b in ab:
score += min(ans[a], ans[b])
print(score)
print((" ".join(map(str, ans[1:]))))
| from collections import defaultdict
import sys
sys.setrecursionlimit(20000000)
connection = defaultdict(lambda: [])
n = int(eval(input()))
ab = []
for i in range(n - 1):
a, b = list(map(int, input().split()))
connection[a].append(b)
connection[b].append(a)
ab.append((a, b))
c = list(map(int, input().split()))
c.sort()
ans = [0] * (n + 1)
def dfs(num):
ans[num] = c.pop()
for next_num in connection[num]:
if ans[next_num] == 0:
dfs(next_num)
dfs(1)
score = 0
for a, b in ab:
score += min(ans[a], ans[b])
print(score)
print((" ".join(map(str, ans[1:]))))
| false | 8.571429 | [
"-checked_list = []",
"- checked_list.append(num)",
"- if next_num not in checked_list:",
"+ if ans[next_num] == 0:"
] | false | 0.135452 | 0.037715 | 3.591431 | [
"s605841457",
"s850187078"
] |
u347640436 | p03476 | python | s915523109 | s624427937 | 867 | 489 | 7,156 | 12,540 | Accepted | Accepted | 43.6 | from math import sqrt
max_lr = 10 ** 5
sieve = [True] * (max_lr + 1)
sieve[0] = False
sieve[1] = False
for i in range(2, int(sqrt(max_lr)) + 1):
if not sieve[i]:
continue
for j in range(i * i, max_lr + 1, i):
sieve[j] = False
cs = [0] * (max_lr + 1)
for i in range(3, max_lr + 1, 2):
if sieve[i] and sieve[(i + 1) // 2]:
cs[i] = 1
for i in range(1, max_lr + 1):
cs[i] += cs[i - 1]
Q = int(eval(input()))
for _ in range(Q):
l, r = list(map(int, input().split()))
print((cs[r] - cs[l - 1]))
| # エラトステネスの篩, 累積和
def make_prime_table(N):
sieve = [0] * (N + 1)
sieve[0] = -1
sieve[1] = -1
for i in range(2, N + 1):
if sieve[i] != 0:
continue
sieve[i] = i
for j in range(i * i, N + 1, i):
if sieve[j] == 0:
sieve[j] = i
return sieve
max_lr = 10 ** 5
prime_table = make_prime_table(max_lr)
cs = [0] * (max_lr + 1)
for i in range(3, max_lr + 1, 2):
if prime_table[i] == i and prime_table[(i + 1) // 2] == (i + 1) // 2:
cs[i] = 1
for i in range(1, max_lr + 1):
cs[i] += cs[i - 1]
Q = int(eval(input()))
for _ in range(Q):
l, r = list(map(int, input().split()))
print((cs[r] - cs[l - 1]))
| 24 | 29 | 550 | 713 | from math import sqrt
max_lr = 10**5
sieve = [True] * (max_lr + 1)
sieve[0] = False
sieve[1] = False
for i in range(2, int(sqrt(max_lr)) + 1):
if not sieve[i]:
continue
for j in range(i * i, max_lr + 1, i):
sieve[j] = False
cs = [0] * (max_lr + 1)
for i in range(3, max_lr + 1, 2):
if sieve[i] and sieve[(i + 1) // 2]:
cs[i] = 1
for i in range(1, max_lr + 1):
cs[i] += cs[i - 1]
Q = int(eval(input()))
for _ in range(Q):
l, r = list(map(int, input().split()))
print((cs[r] - cs[l - 1]))
| # エラトステネスの篩, 累積和
def make_prime_table(N):
sieve = [0] * (N + 1)
sieve[0] = -1
sieve[1] = -1
for i in range(2, N + 1):
if sieve[i] != 0:
continue
sieve[i] = i
for j in range(i * i, N + 1, i):
if sieve[j] == 0:
sieve[j] = i
return sieve
max_lr = 10**5
prime_table = make_prime_table(max_lr)
cs = [0] * (max_lr + 1)
for i in range(3, max_lr + 1, 2):
if prime_table[i] == i and prime_table[(i + 1) // 2] == (i + 1) // 2:
cs[i] = 1
for i in range(1, max_lr + 1):
cs[i] += cs[i - 1]
Q = int(eval(input()))
for _ in range(Q):
l, r = list(map(int, input().split()))
print((cs[r] - cs[l - 1]))
| false | 17.241379 | [
"-from math import sqrt",
"+# エラトステネスの篩, 累積和",
"+def make_prime_table(N):",
"+ sieve = [0] * (N + 1)",
"+ sieve[0] = -1",
"+ sieve[1] = -1",
"+ for i in range(2, N + 1):",
"+ if sieve[i] != 0:",
"+ continue",
"+ sieve[i] = i",
"+ for j in range(i * i, ... | false | 0.127215 | 0.166376 | 0.764622 | [
"s915523109",
"s624427937"
] |
u670961163 | p02880 | python | s454232989 | s345242921 | 170 | 17 | 38,256 | 2,940 | Accepted | Accepted | 90 | x = int(eval(input()))
count =0
for n in range(1, 10):
for k in range(1, 10):
a = n * k
if a == x:
print('Yes')
exit()
else:
pass
print('No') | x = int(eval(input()))
for n in range(1, 10):
for k in range(1, 10):
a = n * k
if a == x:
print('Yes')
exit()
else:
pass
print('No') | 12 | 11 | 211 | 201 | x = int(eval(input()))
count = 0
for n in range(1, 10):
for k in range(1, 10):
a = n * k
if a == x:
print("Yes")
exit()
else:
pass
print("No")
| x = int(eval(input()))
for n in range(1, 10):
for k in range(1, 10):
a = n * k
if a == x:
print("Yes")
exit()
else:
pass
print("No")
| false | 8.333333 | [
"-count = 0"
] | false | 0.091924 | 0.0359 | 2.560568 | [
"s454232989",
"s345242921"
] |
u954858867 | p02402 | python | s502860531 | s584880119 | 30 | 10 | 7,056 | 7,128 | Accepted | Accepted | 66.67 | n = input()
x = list(map(int, input().split()))
print(('%s %s %s' % (min(x), max(x), sum(x)))) | n = list(map(int, input()))
x = list(map(int, input().split()))
print(('%s %s %s' % (min(x), max(x), sum(x)))) | 3 | 3 | 96 | 106 | n = input()
x = list(map(int, input().split()))
print(("%s %s %s" % (min(x), max(x), sum(x))))
| n = list(map(int, input()))
x = list(map(int, input().split()))
print(("%s %s %s" % (min(x), max(x), sum(x))))
| false | 0 | [
"-n = input()",
"+n = list(map(int, input()))"
] | false | 0.162653 | 0.043778 | 3.71544 | [
"s502860531",
"s584880119"
] |
u963343620 | p03399 | python | s328099583 | s803549176 | 19 | 17 | 3,060 | 2,940 | Accepted | Accepted | 10.53 | a, b, c, d = [int(eval(input())) for i in range(4)]
print((min(a, b)+min(c, d))) | a,b,c,d = (int(eval(input())) for i in range(4))
print((min(a,b)+min(c,d))) | 2 | 2 | 73 | 68 | a, b, c, d = [int(eval(input())) for i in range(4)]
print((min(a, b) + min(c, d)))
| a, b, c, d = (int(eval(input())) for i in range(4))
print((min(a, b) + min(c, d)))
| false | 0 | [
"-a, b, c, d = [int(eval(input())) for i in range(4)]",
"+a, b, c, d = (int(eval(input())) for i in range(4))"
] | false | 0.047522 | 0.066075 | 0.719204 | [
"s328099583",
"s803549176"
] |
u883203948 | p02911 | python | s713002774 | s872617264 | 304 | 281 | 9,420 | 7,844 | Accepted | Accepted | 7.57 | n,k,q = list(map(int,input().split()))
ans = [0] * n
data = [k] * n
data2 = [0] * n
for i in range(q):
tmp = int(eval(input()))
data2[tmp-1] += 1
for i in range(n):
ans[i] = data2[i] + data[i] - q
for i in range(n):
if ans[i] >0 :
print("Yes")
else:
print("No")
| n,k,q = list(map(int,input().split()))
data = [k] * n
for i in range(q):
answer = int(eval(input()))
data[answer-1] += 1
for i in range(n):
data[i] = data[i] - q
for i in range(n):
if data[i] >= 1:
print('Yes')
else:
print('No')
| 18 | 14 | 296 | 257 | n, k, q = list(map(int, input().split()))
ans = [0] * n
data = [k] * n
data2 = [0] * n
for i in range(q):
tmp = int(eval(input()))
data2[tmp - 1] += 1
for i in range(n):
ans[i] = data2[i] + data[i] - q
for i in range(n):
if ans[i] > 0:
print("Yes")
else:
print("No")
| n, k, q = list(map(int, input().split()))
data = [k] * n
for i in range(q):
answer = int(eval(input()))
data[answer - 1] += 1
for i in range(n):
data[i] = data[i] - q
for i in range(n):
if data[i] >= 1:
print("Yes")
else:
print("No")
| false | 22.222222 | [
"-ans = [0] * n",
"-data2 = [0] * n",
"- tmp = int(eval(input()))",
"- data2[tmp - 1] += 1",
"+ answer = int(eval(input()))",
"+ data[answer - 1] += 1",
"- ans[i] = data2[i] + data[i] - q",
"+ data[i] = data[i] - q",
"- if ans[i] > 0:",
"+ if data[i] >= 1:"
] | false | 0.046347 | 0.00786 | 5.896858 | [
"s713002774",
"s872617264"
] |
u774160580 | p02984 | python | s068816224 | s068000239 | 858 | 165 | 23,120 | 14,020 | Accepted | Accepted | 80.77 | import numpy as np
N = int(eval(input()))
A = np.array([int(i) for i in input().split()])
# dif = A1-A2+A3-A4 ...
dif = sum([A[i] * pow(-1, i) for i in range(N - 1)])
ans = [0] * N
ans[0] = A[-1] + dif
ans[-1] = A[-1] - dif
for i in range(1, N - 1):
ans[i] = 2 * A[i - 1] - ans[i - 1]
print((*ans))
| N = int(eval(input()))
A = [int(i) for i in input().split()]
# dif = A1-A2+A3-A4 ...
dif = sum([A[i] * pow(-1, i) for i in range(N - 1)])
ans = [0] * N
ans[0] = A[-1] + dif
ans[-1] = A[-1] - dif
for i in range(1, N - 1):
ans[i] = 2 * A[i - 1] - ans[i - 1]
print((*ans))
| 12 | 10 | 307 | 275 | import numpy as np
N = int(eval(input()))
A = np.array([int(i) for i in input().split()])
# dif = A1-A2+A3-A4 ...
dif = sum([A[i] * pow(-1, i) for i in range(N - 1)])
ans = [0] * N
ans[0] = A[-1] + dif
ans[-1] = A[-1] - dif
for i in range(1, N - 1):
ans[i] = 2 * A[i - 1] - ans[i - 1]
print((*ans))
| N = int(eval(input()))
A = [int(i) for i in input().split()]
# dif = A1-A2+A3-A4 ...
dif = sum([A[i] * pow(-1, i) for i in range(N - 1)])
ans = [0] * N
ans[0] = A[-1] + dif
ans[-1] = A[-1] - dif
for i in range(1, N - 1):
ans[i] = 2 * A[i - 1] - ans[i - 1]
print((*ans))
| false | 16.666667 | [
"-import numpy as np",
"-",
"-A = np.array([int(i) for i in input().split()])",
"+A = [int(i) for i in input().split()]"
] | false | 0.200421 | 0.036347 | 5.514137 | [
"s068816224",
"s068000239"
] |
u997641430 | p02913 | python | s318157600 | s120732717 | 1,147 | 589 | 61,660 | 155,272 | Accepted | Accepted | 48.65 | def zalgo(S):
# SとS[i:n]のlcpの長さを記録した配列を返す
n = len(S)
A = [0] * n
j = 0
for i in range(1, n):
if i+A[i-j] < j+A[j]:
A[i] = A[i-j]
else:
k = max(0, A[j]-i+j)
while i+k < n and S[k] == S[i+k]:
k += 1
A[i] = k
j = i
A[0] = n
return A
n = int(eval(input()))
S = eval(input())
l = 0
for i in range(n):
A = zalgo(S[i:])
B = [min(j, a) for j, a in enumerate(A)]
l = max(l, max(B))
print(l)
| def ok(l):
# 長さlの連続部分列で重ならずに2回以上現れるものがある
D = {}
for i in range(n-l+1):
try:
if D[S[i:i+l]]+l <= i:
return True
except:
D[S[i:i+l]] = i
return False
n = int(eval(input()))
S = eval(input())
# 二分探索でTrueになる最大のkを求める
l, r = 0, n+1
while r-l > 1:
c = (l+r)//2
if ok(c):
l = c
else:
r = c
print(l)
| 26 | 23 | 529 | 403 | def zalgo(S):
# SとS[i:n]のlcpの長さを記録した配列を返す
n = len(S)
A = [0] * n
j = 0
for i in range(1, n):
if i + A[i - j] < j + A[j]:
A[i] = A[i - j]
else:
k = max(0, A[j] - i + j)
while i + k < n and S[k] == S[i + k]:
k += 1
A[i] = k
j = i
A[0] = n
return A
n = int(eval(input()))
S = eval(input())
l = 0
for i in range(n):
A = zalgo(S[i:])
B = [min(j, a) for j, a in enumerate(A)]
l = max(l, max(B))
print(l)
| def ok(l):
# 長さlの連続部分列で重ならずに2回以上現れるものがある
D = {}
for i in range(n - l + 1):
try:
if D[S[i : i + l]] + l <= i:
return True
except:
D[S[i : i + l]] = i
return False
n = int(eval(input()))
S = eval(input())
# 二分探索でTrueになる最大のkを求める
l, r = 0, n + 1
while r - l > 1:
c = (l + r) // 2
if ok(c):
l = c
else:
r = c
print(l)
| false | 11.538462 | [
"-def zalgo(S):",
"- # SとS[i:n]のlcpの長さを記録した配列を返す",
"- n = len(S)",
"- A = [0] * n",
"- j = 0",
"- for i in range(1, n):",
"- if i + A[i - j] < j + A[j]:",
"- A[i] = A[i - j]",
"- else:",
"- k = max(0, A[j] - i + j)",
"- while i + k < ... | false | 0.088563 | 0.088528 | 1.000389 | [
"s318157600",
"s120732717"
] |
u492910842 | p03493 | python | s168895775 | s265083483 | 151 | 60 | 61,540 | 61,724 | Accepted | Accepted | 60.26 | s=list(eval(input()))
print((s.count("1"))) | s=eval(input())
ans=0
for i in range(3):
if s[i]=="1":
ans+=1
print(ans) | 2 | 6 | 36 | 77 | s = list(eval(input()))
print((s.count("1")))
| s = eval(input())
ans = 0
for i in range(3):
if s[i] == "1":
ans += 1
print(ans)
| false | 66.666667 | [
"-s = list(eval(input()))",
"-print((s.count(\"1\")))",
"+s = eval(input())",
"+ans = 0",
"+for i in range(3):",
"+ if s[i] == \"1\":",
"+ ans += 1",
"+print(ans)"
] | false | 0.038973 | 0.039061 | 0.997726 | [
"s168895775",
"s265083483"
] |
u332906195 | p02631 | python | s931261418 | s323067046 | 1,529 | 137 | 354,920 | 33,464 | Accepted | Accepted | 91.04 | N = int(eval(input()))
A = list(map(int, input().split()))
maxl = len(bin(max(A))[2:])
ans = [['0'] * N for _ in range(maxl)]
for n in range(N):
for d, a in enumerate(bin(A[n])[2:].zfill(maxl)):
ans[d][n] = a
for dn in range(maxl):
n1 = sum([1 for d in ans[dn] if d == '1'])
if n1 % 2 == 1:
for n in range(N):
ans[dn][n] = '0' if ans[dn][n] == '1' else '1'
prt = [int(''.join([ans[d][n] for d in range(maxl)]), 2) for n in range(N)]
print((' '.join(map(str, prt))))
| N = int(eval(input()))
A = list(map(int, input().split()))
S = 0
for a in A:
S ^= a
print((" ".join([str(S ^ a) for a in A])))
| 16 | 6 | 515 | 128 | N = int(eval(input()))
A = list(map(int, input().split()))
maxl = len(bin(max(A))[2:])
ans = [["0"] * N for _ in range(maxl)]
for n in range(N):
for d, a in enumerate(bin(A[n])[2:].zfill(maxl)):
ans[d][n] = a
for dn in range(maxl):
n1 = sum([1 for d in ans[dn] if d == "1"])
if n1 % 2 == 1:
for n in range(N):
ans[dn][n] = "0" if ans[dn][n] == "1" else "1"
prt = [int("".join([ans[d][n] for d in range(maxl)]), 2) for n in range(N)]
print((" ".join(map(str, prt))))
| N = int(eval(input()))
A = list(map(int, input().split()))
S = 0
for a in A:
S ^= a
print((" ".join([str(S ^ a) for a in A])))
| false | 62.5 | [
"-maxl = len(bin(max(A))[2:])",
"-ans = [[\"0\"] * N for _ in range(maxl)]",
"-for n in range(N):",
"- for d, a in enumerate(bin(A[n])[2:].zfill(maxl)):",
"- ans[d][n] = a",
"-for dn in range(maxl):",
"- n1 = sum([1 for d in ans[dn] if d == \"1\"])",
"- if n1 % 2 == 1:",
"- fo... | false | 0.087763 | 0.043132 | 2.034744 | [
"s931261418",
"s323067046"
] |
u463775490 | p03854 | python | s943649873 | s745161639 | 71 | 18 | 3,316 | 3,188 | Accepted | Accepted | 74.65 | s = input()[::-1]
ans = 'YES'
while s:
if s[:5] == 'maerd' or s[0:5] == 'esare':
s = s[5:]
elif s[:6] == 'resare':
s = s[6:]
elif s[:7] == 'remaerd':
s = s[7:]
else:
ans = 'NO'
break
print(ans) | s = eval(input())
s = s.replace('eraser', '')
s = s.replace('erase', '')
s = s.replace('dreamer', '')
s = s.replace('dream', '')
print(('NO' if s else 'YES')) | 13 | 8 | 261 | 159 | s = input()[::-1]
ans = "YES"
while s:
if s[:5] == "maerd" or s[0:5] == "esare":
s = s[5:]
elif s[:6] == "resare":
s = s[6:]
elif s[:7] == "remaerd":
s = s[7:]
else:
ans = "NO"
break
print(ans)
| s = eval(input())
s = s.replace("eraser", "")
s = s.replace("erase", "")
s = s.replace("dreamer", "")
s = s.replace("dream", "")
print(("NO" if s else "YES"))
| false | 38.461538 | [
"-s = input()[::-1]",
"-ans = \"YES\"",
"-while s:",
"- if s[:5] == \"maerd\" or s[0:5] == \"esare\":",
"- s = s[5:]",
"- elif s[:6] == \"resare\":",
"- s = s[6:]",
"- elif s[:7] == \"remaerd\":",
"- s = s[7:]",
"- else:",
"- ans = \"NO\"",
"- bre... | false | 0.034577 | 0.036608 | 0.944526 | [
"s943649873",
"s745161639"
] |
u631277801 | p02936 | python | s886366325 | s352741789 | 1,019 | 937 | 125,020 | 123,120 | Accepted | Accepted | 8.05 | import sys
stdin = sys.stdin
sys.setrecursionlimit(10 ** 7)
def li(): return list(map(int, stdin.readline().split()))
def li_(): return [int(x) - 1 for x in stdin.readline().split()]
def lf(): return list(map(float, stdin.readline().split()))
def ls(): return stdin.readline().split()
def ns(): return stdin.readline().rstrip()
def lc(): return list(ns())
def ni(): return int(stdin.readline())
def nf(): return float(stdin.readline())
n, q = li()
edge = [list(li_()) for _ in range(n-1)]
query = [list(li()) for _ in range(q)]
# 各頂点に指定の数字を入れる
num = [0]*n
for pi, xi in query:
pi -= 1
num[pi] += xi
# 木を構築
tree = [[] for _ in range(n)]
for ai, bi in edge:
tree[ai].append(bi)
tree[bi].append(ai)
# ルートから、親+自分の数字を入れる
visited = [False]*n
stack = [0]
visited[0] = True
while stack:
cur = stack.pop()
for nex in tree[cur]:
if visited[nex]:
continue
visited[nex] = True
num[nex] += num[cur]
stack.append(nex)
# 出力
print((*num))
| import sys
stdin = sys.stdin
sys.setrecursionlimit(10 ** 7)
def li(): return list(map(int, stdin.readline().split()))
def li_(): return [int(x) - 1 for x in stdin.readline().split()]
def lf(): return list(map(float, stdin.readline().split()))
def ls(): return stdin.readline().split()
def ns(): return stdin.readline().rstrip()
def lc(): return list(ns())
def ni(): return int(stdin.readline())
def nf(): return float(stdin.readline())
class Node(object):
def __init__(self, num: int):
self.num = num
self.cnt = 0
self.visited = False
def dfs(init_node: Node, graph: list):
stack = [init_node]
init_node.visited = True
while stack:
cur = stack.pop()
for nex in graph[cur.num]:
if nex.visited:
cur.cnt += nex.cnt
cur.visited = True
else:
stack.append(nex)
n, q = li()
nodes = [Node(i) for i in range(n)]
graph = [[] for _ in range(n)]
for _ in range(n-1):
ai, bi = li_()
graph[ai].append(nodes[bi])
graph[bi].append(nodes[ai])
for _ in range(q):
pi, xi = li()
pi -= 1
nodes[pi].cnt += xi
dfs(nodes[0], graph)
ans = [nodes[i].cnt for i in range(n)]
print((*ans)) | 49 | 50 | 1,041 | 1,261 | import sys
stdin = sys.stdin
sys.setrecursionlimit(10**7)
def li():
return list(map(int, stdin.readline().split()))
def li_():
return [int(x) - 1 for x in stdin.readline().split()]
def lf():
return list(map(float, stdin.readline().split()))
def ls():
return stdin.readline().split()
def ns():
return stdin.readline().rstrip()
def lc():
return list(ns())
def ni():
return int(stdin.readline())
def nf():
return float(stdin.readline())
n, q = li()
edge = [list(li_()) for _ in range(n - 1)]
query = [list(li()) for _ in range(q)]
# 各頂点に指定の数字を入れる
num = [0] * n
for pi, xi in query:
pi -= 1
num[pi] += xi
# 木を構築
tree = [[] for _ in range(n)]
for ai, bi in edge:
tree[ai].append(bi)
tree[bi].append(ai)
# ルートから、親+自分の数字を入れる
visited = [False] * n
stack = [0]
visited[0] = True
while stack:
cur = stack.pop()
for nex in tree[cur]:
if visited[nex]:
continue
visited[nex] = True
num[nex] += num[cur]
stack.append(nex)
# 出力
print((*num))
| import sys
stdin = sys.stdin
sys.setrecursionlimit(10**7)
def li():
return list(map(int, stdin.readline().split()))
def li_():
return [int(x) - 1 for x in stdin.readline().split()]
def lf():
return list(map(float, stdin.readline().split()))
def ls():
return stdin.readline().split()
def ns():
return stdin.readline().rstrip()
def lc():
return list(ns())
def ni():
return int(stdin.readline())
def nf():
return float(stdin.readline())
class Node(object):
def __init__(self, num: int):
self.num = num
self.cnt = 0
self.visited = False
def dfs(init_node: Node, graph: list):
stack = [init_node]
init_node.visited = True
while stack:
cur = stack.pop()
for nex in graph[cur.num]:
if nex.visited:
cur.cnt += nex.cnt
cur.visited = True
else:
stack.append(nex)
n, q = li()
nodes = [Node(i) for i in range(n)]
graph = [[] for _ in range(n)]
for _ in range(n - 1):
ai, bi = li_()
graph[ai].append(nodes[bi])
graph[bi].append(nodes[ai])
for _ in range(q):
pi, xi = li()
pi -= 1
nodes[pi].cnt += xi
dfs(nodes[0], graph)
ans = [nodes[i].cnt for i in range(n)]
print((*ans))
| false | 2 | [
"+class Node(object):",
"+ def __init__(self, num: int):",
"+ self.num = num",
"+ self.cnt = 0",
"+ self.visited = False",
"+",
"+",
"+def dfs(init_node: Node, graph: list):",
"+ stack = [init_node]",
"+ init_node.visited = True",
"+ while stack:",
"+ cu... | false | 0.037947 | 0.037757 | 1.005018 | [
"s886366325",
"s352741789"
] |
u970109776 | p02577 | python | s752493543 | s555664320 | 73 | 55 | 9,564 | 9,076 | Accepted | Accepted | 24.66 | #coding: utf-8
from collections import defaultdict
import sys
N = eval(input())
s = 0
for c in N:
s += int(c)
if s % 9 == 0:
print("Yes")
else:
print("No")
| N = eval(input())
s = sum(int(x) for x in N)
if s % 9 == 0:
print("Yes")
else:
print("No") | 16 | 7 | 183 | 99 | # coding: utf-8
from collections import defaultdict
import sys
N = eval(input())
s = 0
for c in N:
s += int(c)
if s % 9 == 0:
print("Yes")
else:
print("No")
| N = eval(input())
s = sum(int(x) for x in N)
if s % 9 == 0:
print("Yes")
else:
print("No")
| false | 56.25 | [
"-# coding: utf-8",
"-from collections import defaultdict",
"-import sys",
"-",
"-s = 0",
"-for c in N:",
"- s += int(c)",
"+s = sum(int(x) for x in N)"
] | false | 0.122792 | 0.044725 | 2.745507 | [
"s752493543",
"s555664320"
] |
u941753895 | p03695 | python | s006587655 | s463902124 | 53 | 42 | 6,172 | 5,416 | Accepted | Accepted | 20.75 | import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time
sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7
def LI(): return list(map(int,input().split()))
def I(): return int(eval(input()))
def LS(): return input().split()
def S(): return eval(input())
def main():
n=I()
l=LI()
l2=[]
c=0
for x in l:
if x>=3200:
c+=1
l2.append(8)
else:
l2.append(x//400)
l2=list(set(l2))
if len(l2)!=1 and l2.count(8):
l2.remove(8)
if len(l2)==1 and l2[0]==8:
c=max(0,c-1)
print((len(l2),len(l2)+c))
main()
| import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time
sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7
def LI(): return list(map(int,input().split()))
def I(): return int(eval(input()))
def LS(): return input().split()
def S(): return eval(input())
def main():
n=I()
l=LI()
a=[1,400,800,1200,1600,2000,2400,2800,3200]
b=[0]*9
c=0
for x in l:
for i in range(len(a)-1):
if a[i]<=x and x<a[i+1]:
b[i]+=1
if 3200<=x:
c+=1
d=0
for x in b:
if x>0:
d+=1
if d==0:
print((1,c))
else:
print((d,d+c))
main()
| 35 | 37 | 605 | 629 | import math, string, itertools, fractions, heapq, collections, re, array, bisect, sys, random, time
sys.setrecursionlimit(10**7)
inf = 10**20
mod = 10**9 + 7
def LI():
return list(map(int, input().split()))
def I():
return int(eval(input()))
def LS():
return input().split()
def S():
return eval(input())
def main():
n = I()
l = LI()
l2 = []
c = 0
for x in l:
if x >= 3200:
c += 1
l2.append(8)
else:
l2.append(x // 400)
l2 = list(set(l2))
if len(l2) != 1 and l2.count(8):
l2.remove(8)
if len(l2) == 1 and l2[0] == 8:
c = max(0, c - 1)
print((len(l2), len(l2) + c))
main()
| import math, string, itertools, fractions, heapq, collections, re, array, bisect, sys, random, time
sys.setrecursionlimit(10**7)
inf = 10**20
mod = 10**9 + 7
def LI():
return list(map(int, input().split()))
def I():
return int(eval(input()))
def LS():
return input().split()
def S():
return eval(input())
def main():
n = I()
l = LI()
a = [1, 400, 800, 1200, 1600, 2000, 2400, 2800, 3200]
b = [0] * 9
c = 0
for x in l:
for i in range(len(a) - 1):
if a[i] <= x and x < a[i + 1]:
b[i] += 1
if 3200 <= x:
c += 1
d = 0
for x in b:
if x > 0:
d += 1
if d == 0:
print((1, c))
else:
print((d, d + c))
main()
| false | 5.405405 | [
"- l2 = []",
"+ a = [1, 400, 800, 1200, 1600, 2000, 2400, 2800, 3200]",
"+ b = [0] * 9",
"- if x >= 3200:",
"+ for i in range(len(a) - 1):",
"+ if a[i] <= x and x < a[i + 1]:",
"+ b[i] += 1",
"+ if 3200 <= x:",
"- l2.append(8)",
"-... | false | 0.045684 | 0.036371 | 1.256054 | [
"s006587655",
"s463902124"
] |
u392319141 | p03674 | python | s802018310 | s001184796 | 456 | 401 | 30,560 | 32,424 | Accepted | Accepted | 12.06 | from collections import Counter, defaultdict
class Combination:
def __init__(self, size, mod=10**9 + 7):
self.size = size + 2
self.mod = mod
self.fact = [1, 1] + [0] * size
self.factInv = [1, 1] + [0] * size
self.inv = [0, 1] + [0] * size
for i in range(2, self.size):
self.fact[i] = self.fact[i - 1] * i % self.mod
self.inv[i] = -self.inv[self.mod % i] * (self.mod // i) % self.mod
self.factInv[i] = self.factInv[i - 1] * self.inv[i] % self.mod
def npr(self, n, r):
if n < r or n < 0 or r < 0:
return 0
return self.fact[n] * self.factInv[n - r] % self.mod
def ncr(self, n, r):
if n < r or n < 0 or r < 0:
return 0
return self.fact[n] * (self.factInv[r] * self.factInv[n - r] % self.mod) % self.mod
def nhr(self, n, r): # 重複組合せ
return self.ncr(n + r - 1, n - 1)
def factN(self, n):
if n < 0:
return 0
return self.fact[n]
N = int(eval(input()))
A = list(map(int, input().split()))
MOD = 10**9 + 7
comb = Combination(N + 100)
cntA = Counter(A)
I = [a for a, c in list(cntA.items()) if c == 2][0]
L, R = [i for i, a in enumerate(A) if a == I]
S = L + (N - R)
for i in range(1, N + 2):
if i == 1:
print(N)
continue
ans = comb.ncr(N + 1, i) - comb.ncr(S, i - 1)
print((ans % MOD))
| from collections import Counter
class Combination:
def __init__(self, size):
self.size = size + 2
self.fact = [1, 1] + [0] * size
self.factInv = [1, 1] + [0] * size
self.inv = [0, 1] + [0] * size
for i in range(2, self.size):
self.fact[i] = self.fact[i - 1] * i % MOD
self.inv[i] = -self.inv[MOD % i] * (MOD // i) % MOD
self.factInv[i] = self.factInv[i - 1] * self.inv[i] % MOD
def npr(self, n, r):
if n < r or n < 0 or r < 0:
return 0
return self.fact[n] * self.factInv[n - r] % MOD
def ncr(self, n, r):
if n < r or n < 0 or r < 0:
return 0
return self.fact[n] * (self.factInv[r] * self.factInv[n - r] % MOD) % MOD
def nhr(self, n, r): # 重複組合せ: x_1 + ... + x_n = r
return self.ncr(n + r - 1, n - 1)
N = int(input())
A = list(map(int, input().split()))
MOD = 10**9 + 7
comb = Combination(N + 100)
cntA = Counter(A)
X = [a for a, c in cntA.items() if c == 2][0]
l, r = [i for i, a in enumerate(A) if a == X]
ans = [N]
for leng in range(2, N + 2):
M = comb.ncr(N + 1, leng)
L = l + (N - r)
D = comb.ncr(L, leng - 1)
ans.append((M - D) % MOD)
print(*ans, sep='\n')
| 50 | 45 | 1,446 | 1,289 | from collections import Counter, defaultdict
class Combination:
def __init__(self, size, mod=10**9 + 7):
self.size = size + 2
self.mod = mod
self.fact = [1, 1] + [0] * size
self.factInv = [1, 1] + [0] * size
self.inv = [0, 1] + [0] * size
for i in range(2, self.size):
self.fact[i] = self.fact[i - 1] * i % self.mod
self.inv[i] = -self.inv[self.mod % i] * (self.mod // i) % self.mod
self.factInv[i] = self.factInv[i - 1] * self.inv[i] % self.mod
def npr(self, n, r):
if n < r or n < 0 or r < 0:
return 0
return self.fact[n] * self.factInv[n - r] % self.mod
def ncr(self, n, r):
if n < r or n < 0 or r < 0:
return 0
return (
self.fact[n] * (self.factInv[r] * self.factInv[n - r] % self.mod) % self.mod
)
def nhr(self, n, r): # 重複組合せ
return self.ncr(n + r - 1, n - 1)
def factN(self, n):
if n < 0:
return 0
return self.fact[n]
N = int(eval(input()))
A = list(map(int, input().split()))
MOD = 10**9 + 7
comb = Combination(N + 100)
cntA = Counter(A)
I = [a for a, c in list(cntA.items()) if c == 2][0]
L, R = [i for i, a in enumerate(A) if a == I]
S = L + (N - R)
for i in range(1, N + 2):
if i == 1:
print(N)
continue
ans = comb.ncr(N + 1, i) - comb.ncr(S, i - 1)
print((ans % MOD))
| from collections import Counter
class Combination:
def __init__(self, size):
self.size = size + 2
self.fact = [1, 1] + [0] * size
self.factInv = [1, 1] + [0] * size
self.inv = [0, 1] + [0] * size
for i in range(2, self.size):
self.fact[i] = self.fact[i - 1] * i % MOD
self.inv[i] = -self.inv[MOD % i] * (MOD // i) % MOD
self.factInv[i] = self.factInv[i - 1] * self.inv[i] % MOD
def npr(self, n, r):
if n < r or n < 0 or r < 0:
return 0
return self.fact[n] * self.factInv[n - r] % MOD
def ncr(self, n, r):
if n < r or n < 0 or r < 0:
return 0
return self.fact[n] * (self.factInv[r] * self.factInv[n - r] % MOD) % MOD
def nhr(self, n, r): # 重複組合せ: x_1 + ... + x_n = r
return self.ncr(n + r - 1, n - 1)
N = int(input())
A = list(map(int, input().split()))
MOD = 10**9 + 7
comb = Combination(N + 100)
cntA = Counter(A)
X = [a for a, c in cntA.items() if c == 2][0]
l, r = [i for i, a in enumerate(A) if a == X]
ans = [N]
for leng in range(2, N + 2):
M = comb.ncr(N + 1, leng)
L = l + (N - r)
D = comb.ncr(L, leng - 1)
ans.append((M - D) % MOD)
print(*ans, sep="\n")
| false | 10 | [
"-from collections import Counter, defaultdict",
"+from collections import Counter",
"- def __init__(self, size, mod=10**9 + 7):",
"+ def __init__(self, size):",
"- self.mod = mod",
"- self.fact[i] = self.fact[i - 1] * i % self.mod",
"- self.inv[i] = -self.inv[self.mod... | false | 0.036574 | 0.0464 | 0.788224 | [
"s802018310",
"s001184796"
] |
u701644092 | p02713 | python | s558614691 | s024890367 | 1,418 | 603 | 9,144 | 9,156 | Accepted | Accepted | 57.48 | K=int(eval(input()))
import math
ans=0
for a in range(1,K+1):
for b in range(1,K+1):
g=math.gcd(a,b)
for c in range(1,K+1):
ans += math.gcd(g,c)
print(ans) | K=int(eval(input()))
import math
ans=0
for a in range(1,K+1):
for b in range(1,K+1):
g=math.gcd(a,b)
if g==1:
ans += K
continue
for c in range(1,K+1):
ans += math.gcd(g,c)
print(ans)
| 9 | 12 | 173 | 220 | K = int(eval(input()))
import math
ans = 0
for a in range(1, K + 1):
for b in range(1, K + 1):
g = math.gcd(a, b)
for c in range(1, K + 1):
ans += math.gcd(g, c)
print(ans)
| K = int(eval(input()))
import math
ans = 0
for a in range(1, K + 1):
for b in range(1, K + 1):
g = math.gcd(a, b)
if g == 1:
ans += K
continue
for c in range(1, K + 1):
ans += math.gcd(g, c)
print(ans)
| false | 25 | [
"+ if g == 1:",
"+ ans += K",
"+ continue"
] | false | 0.249493 | 0.106416 | 2.344503 | [
"s558614691",
"s024890367"
] |
u413165887 | p03317 | python | s331635260 | s297391647 | 47 | 40 | 13,880 | 13,880 | Accepted | Accepted | 14.89 | n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
if k < n:
c = 1
n -= k
while n > 0:
n -= k-1
c += 1
print(c)
else:
print((1)) | n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
if k < n:
c = 1
n -= k
c += -((-n)//(k-1))
print(c)
else:
print((1)) | 12 | 10 | 192 | 165 | n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
if k < n:
c = 1
n -= k
while n > 0:
n -= k - 1
c += 1
print(c)
else:
print((1))
| n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
if k < n:
c = 1
n -= k
c += -((-n) // (k - 1))
print(c)
else:
print((1))
| false | 16.666667 | [
"- while n > 0:",
"- n -= k - 1",
"- c += 1",
"+ c += -((-n) // (k - 1))"
] | false | 0.071839 | 0.070444 | 1.019808 | [
"s331635260",
"s297391647"
] |
u046187684 | p03074 | python | s976719793 | s591360399 | 105 | 80 | 11,188 | 11,240 | Accepted | Accepted | 23.81 | def solve(string):
n, k, s = string.split()
n, k = list(map(int, [n, k]))
flip = [0]
for i, (s0, s1) in enumerate(zip(s, s[1:]), start=1):
if s0 != s1:
flip.append(i)
flip += [n]
return str(
max([
flip[min(len(flip) - 1, i + 2 * k + (i % 2 ^ int(s[0])))] - flip[i]
for i in range(len(flip))
]))
if __name__ == '__main__':
print((solve('\n'.join([eval(input()), eval(input())]))))
| def solve(string):
n, k, s = string.split()
n, k = list(map(int, [n, k]))
flip = [0]
for i, (s0, s1) in enumerate(zip(s, s[1:]), start=1):
if s0 != s1:
flip.append(i)
flip += [n]
start = int(s[0])
l = len(flip) - 1
return str(max([flip[min(l, i + 2 * k + (i % 2 ^ start))] - flip[i] for i in range(l + 1)]))
if __name__ == '__main__':
print((solve('\n'.join([eval(input()), eval(input())]))))
| 17 | 15 | 466 | 445 | def solve(string):
n, k, s = string.split()
n, k = list(map(int, [n, k]))
flip = [0]
for i, (s0, s1) in enumerate(zip(s, s[1:]), start=1):
if s0 != s1:
flip.append(i)
flip += [n]
return str(
max(
[
flip[min(len(flip) - 1, i + 2 * k + (i % 2 ^ int(s[0])))] - flip[i]
for i in range(len(flip))
]
)
)
if __name__ == "__main__":
print((solve("\n".join([eval(input()), eval(input())]))))
| def solve(string):
n, k, s = string.split()
n, k = list(map(int, [n, k]))
flip = [0]
for i, (s0, s1) in enumerate(zip(s, s[1:]), start=1):
if s0 != s1:
flip.append(i)
flip += [n]
start = int(s[0])
l = len(flip) - 1
return str(
max([flip[min(l, i + 2 * k + (i % 2 ^ start))] - flip[i] for i in range(l + 1)])
)
if __name__ == "__main__":
print((solve("\n".join([eval(input()), eval(input())]))))
| false | 11.764706 | [
"+ start = int(s[0])",
"+ l = len(flip) - 1",
"- max(",
"- [",
"- flip[min(len(flip) - 1, i + 2 * k + (i % 2 ^ int(s[0])))] - flip[i]",
"- for i in range(len(flip))",
"- ]",
"- )",
"+ max([flip[min(l, i + 2 * k + (i % 2 ^... | false | 0.110108 | 0.037643 | 2.925035 | [
"s976719793",
"s591360399"
] |
u013756322 | p03610 | python | s831771023 | s270364120 | 40 | 17 | 3,188 | 3,188 | Accepted | Accepted | 57.5 | s = eval(input())
ans = ''
i = 1
for c in s:
if (i % 2 == 1):
ans += c
i += 1
print(ans)
|
print((input()[0::2]))
| 9 | 2 | 100 | 23 | s = eval(input())
ans = ""
i = 1
for c in s:
if i % 2 == 1:
ans += c
i += 1
print(ans)
| print((input()[0::2]))
| false | 77.777778 | [
"-s = eval(input())",
"-ans = \"\"",
"-i = 1",
"-for c in s:",
"- if i % 2 == 1:",
"- ans += c",
"- i += 1",
"-print(ans)",
"+print((input()[0::2]))"
] | false | 0.038033 | 0.044093 | 0.86256 | [
"s831771023",
"s270364120"
] |
u345966487 | p03659 | python | s672252159 | s595323665 | 163 | 144 | 39,188 | 31,776 | Accepted | Accepted | 11.66 | import sys
from itertools import accumulate
sys.setrecursionlimit(10 ** 8)
ini = lambda: int(sys.stdin.readline())
inm = lambda: map(int, sys.stdin.readline().split())
inl = lambda: list(inm())
ins = lambda: sys.stdin.readline().rstrip()
debug = lambda *a, **kw: print("\033[33m", *a, "\033[0m", **dict(file=sys.stderr, **kw))
n = ini()
a = inl()
def solve():
al = list(accumulate(a))
ar = list(reversed(list(accumulate(a[::-1]))))
ans = 1 << 60
for i in range(1, n):
r = abs(al[i - 1] - ar[i])
ans = min(ans, r)
return ans
print(solve())
| import sys
import itertools
sys.setrecursionlimit(10 ** 8)
ini = lambda: int(sys.stdin.readline())
inl = lambda: [int(x) for x in sys.stdin.readline().split()]
ins = lambda: sys.stdin.readline().rstrip()
debug = lambda *a, **kw: print("\033[33m", *a, "\033[0m", **dict(file=sys.stderr, **kw))
N = ini()
A = inl()
def solve():
B = list(itertools.accumulate(A, initial=0))
s = 0
ans = 10 ** 12
for i in range(N - 1, 0, -1):
s += A[i]
ans = min(ans, abs(s - B[i]))
return ans
print(solve())
| 26 | 25 | 607 | 555 | import sys
from itertools import accumulate
sys.setrecursionlimit(10**8)
ini = lambda: int(sys.stdin.readline())
inm = lambda: map(int, sys.stdin.readline().split())
inl = lambda: list(inm())
ins = lambda: sys.stdin.readline().rstrip()
debug = lambda *a, **kw: print("\033[33m", *a, "\033[0m", **dict(file=sys.stderr, **kw))
n = ini()
a = inl()
def solve():
al = list(accumulate(a))
ar = list(reversed(list(accumulate(a[::-1]))))
ans = 1 << 60
for i in range(1, n):
r = abs(al[i - 1] - ar[i])
ans = min(ans, r)
return ans
print(solve())
| import sys
import itertools
sys.setrecursionlimit(10**8)
ini = lambda: int(sys.stdin.readline())
inl = lambda: [int(x) for x in sys.stdin.readline().split()]
ins = lambda: sys.stdin.readline().rstrip()
debug = lambda *a, **kw: print("\033[33m", *a, "\033[0m", **dict(file=sys.stderr, **kw))
N = ini()
A = inl()
def solve():
B = list(itertools.accumulate(A, initial=0))
s = 0
ans = 10**12
for i in range(N - 1, 0, -1):
s += A[i]
ans = min(ans, abs(s - B[i]))
return ans
print(solve())
| false | 3.846154 | [
"-from itertools import accumulate",
"+import itertools",
"-inm = lambda: map(int, sys.stdin.readline().split())",
"-inl = lambda: list(inm())",
"+inl = lambda: [int(x) for x in sys.stdin.readline().split()]",
"-n = ini()",
"-a = inl()",
"+N = ini()",
"+A = inl()",
"- al = list(accumulate(a))",... | false | 0.107112 | 0.047238 | 2.267512 | [
"s672252159",
"s595323665"
] |
u729133443 | p02889 | python | s332252714 | s206249493 | 404 | 350 | 40,760 | 40,864 | Accepted | Accepted | 13.37 | from scipy.sparse import*
def main():
f=csgraph.floyd_warshall
n,m,l,*t=list(map(int,open(0).read().split()))
d=[[0]*(n+1)for _ in range(n+1)]
for a,b,c in zip(*[iter(t[:m*3])]*3):d[a][b]=c
d=f(f(d,0)<=l)-1
d[d>n]=-1
print(('\n'.join(map(str,[d[i]for i in zip(*[iter(t[m*3+1:])]*2)]))))
main() | from scipy.sparse import*
def main():
f=csgraph.floyd_warshall
n,m,l,*t=list(map(int,open(0).read().split()))
d=[[0]*(n+1)for _ in range(n+1)]
for a,b,c in zip(*[iter(t[:m*3])]*3):d[a][b]=c
d=f(f(d,0)<=l)-1
d[d>n]=-1
print(('\n'.join(map(str,list(map(int,[d[i]for i in zip(*[iter(t[m*3+1:])]*2)]))))))
main() | 10 | 10 | 308 | 317 | from scipy.sparse import *
def main():
f = csgraph.floyd_warshall
n, m, l, *t = list(map(int, open(0).read().split()))
d = [[0] * (n + 1) for _ in range(n + 1)]
for a, b, c in zip(*[iter(t[: m * 3])] * 3):
d[a][b] = c
d = f(f(d, 0) <= l) - 1
d[d > n] = -1
print(("\n".join(map(str, [d[i] for i in zip(*[iter(t[m * 3 + 1 :])] * 2)]))))
main()
| from scipy.sparse import *
def main():
f = csgraph.floyd_warshall
n, m, l, *t = list(map(int, open(0).read().split()))
d = [[0] * (n + 1) for _ in range(n + 1)]
for a, b, c in zip(*[iter(t[: m * 3])] * 3):
d[a][b] = c
d = f(f(d, 0) <= l) - 1
d[d > n] = -1
print(
(
"\n".join(
map(
str,
list(map(int, [d[i] for i in zip(*[iter(t[m * 3 + 1 :])] * 2)])),
)
)
)
)
main()
| false | 0 | [
"- print((\"\\n\".join(map(str, [d[i] for i in zip(*[iter(t[m * 3 + 1 :])] * 2)]))))",
"+ print(",
"+ (",
"+ \"\\n\".join(",
"+ map(",
"+ str,",
"+ list(map(int, [d[i] for i in zip(*[iter(t[m * 3 + 1 :])] * 2)])),",
"+ ... | false | 0.500513 | 0.81855 | 0.611463 | [
"s332252714",
"s206249493"
] |
u204842730 | p02881 | python | s869383380 | s781734395 | 192 | 151 | 40,428 | 3,064 | Accepted | Accepted | 21.35 | import math
n = int(eval(input()))
b = 0
list = []
sqrt = math.ceil(math.sqrt(n))
for i in range(1,sqrt+1):
if(n%i==0):
b = i
print((b + (n//b) -2)) | N = int(eval(input()))
ans=1e+18
for i in range(1,int(N**0.5+1)):
if(N%i==0):
ans = min(ans,int(i+N/i-2))
print(ans) | 10 | 6 | 153 | 127 | import math
n = int(eval(input()))
b = 0
list = []
sqrt = math.ceil(math.sqrt(n))
for i in range(1, sqrt + 1):
if n % i == 0:
b = i
print((b + (n // b) - 2))
| N = int(eval(input()))
ans = 1e18
for i in range(1, int(N**0.5 + 1)):
if N % i == 0:
ans = min(ans, int(i + N / i - 2))
print(ans)
| false | 40 | [
"-import math",
"-",
"-n = int(eval(input()))",
"-b = 0",
"-list = []",
"-sqrt = math.ceil(math.sqrt(n))",
"-for i in range(1, sqrt + 1):",
"- if n % i == 0:",
"- b = i",
"-print((b + (n // b) - 2))",
"+N = int(eval(input()))",
"+ans = 1e18",
"+for i in range(1, int(N**0.5 + 1)):",... | false | 0.036377 | 0.060176 | 0.604512 | [
"s869383380",
"s781734395"
] |
u633068244 | p00162 | python | s091151110 | s122582874 | 2,220 | 10 | 35,924 | 4,244 | Accepted | Accepted | 99.55 | while True:
inp = input()
if inp == "0": break
m,n = list(map(int, inp.split()))
ans = 0
for i in range(m,n+1):
while i > 1:
if i%2 == 0:
i /= 2
elif i%3 == 0:
i /= 3
elif i%5 == 0:
i /= 5
else:
break
else:
ans += 1
print(ans) | def ham2(a):
global m,n,count
if m <= a:
count += 1
a2,a3,a5 = a*2, a*3, a*5
if a2 <= n: ham2(a2)
if a3 <= n: ham3(a3)
if a5 <= n: ham5(a5)
def ham3(a):
global m,n,count
if m <= a:
count += 1
a3,a5 = a*3, a*5
if a3 <= n: ham3(a3)
if a5 <= n: ham5(a5)
def ham5(a):
global m,n,count
if m <= a:
count += 1
a5 = a*5
if a5 <= n: ham5(a5)
while True:
inp = input()
if inp == "0": break
m,n = list(map(int, inp.split()))
count = 0
ham2(1)
print(count) | 18 | 31 | 281 | 502 | while True:
inp = input()
if inp == "0":
break
m, n = list(map(int, inp.split()))
ans = 0
for i in range(m, n + 1):
while i > 1:
if i % 2 == 0:
i /= 2
elif i % 3 == 0:
i /= 3
elif i % 5 == 0:
i /= 5
else:
break
else:
ans += 1
print(ans)
| def ham2(a):
global m, n, count
if m <= a:
count += 1
a2, a3, a5 = a * 2, a * 3, a * 5
if a2 <= n:
ham2(a2)
if a3 <= n:
ham3(a3)
if a5 <= n:
ham5(a5)
def ham3(a):
global m, n, count
if m <= a:
count += 1
a3, a5 = a * 3, a * 5
if a3 <= n:
ham3(a3)
if a5 <= n:
ham5(a5)
def ham5(a):
global m, n, count
if m <= a:
count += 1
a5 = a * 5
if a5 <= n:
ham5(a5)
while True:
inp = input()
if inp == "0":
break
m, n = list(map(int, inp.split()))
count = 0
ham2(1)
print(count)
| false | 41.935484 | [
"+def ham2(a):",
"+ global m, n, count",
"+ if m <= a:",
"+ count += 1",
"+ a2, a3, a5 = a * 2, a * 3, a * 5",
"+ if a2 <= n:",
"+ ham2(a2)",
"+ if a3 <= n:",
"+ ham3(a3)",
"+ if a5 <= n:",
"+ ham5(a5)",
"+",
"+",
"+def ham3(a):",
"+ globa... | false | 0.044649 | 0.046169 | 0.967076 | [
"s091151110",
"s122582874"
] |
u802234211 | p02657 | python | s225592060 | s300891636 | 23 | 20 | 9,152 | 9,156 | Accepted | Accepted | 13.04 | a,b = list(map(int,input().split()))
print((a*b)) | import math
a,b = list(map(str,input().split()))
a = int(a)
print((math.floor(a*int(float(b)*100+0.1)/100))) | 2 | 5 | 42 | 105 | a, b = list(map(int, input().split()))
print((a * b))
| import math
a, b = list(map(str, input().split()))
a = int(a)
print((math.floor(a * int(float(b) * 100 + 0.1) / 100)))
| false | 60 | [
"-a, b = list(map(int, input().split()))",
"-print((a * b))",
"+import math",
"+",
"+a, b = list(map(str, input().split()))",
"+a = int(a)",
"+print((math.floor(a * int(float(b) * 100 + 0.1) / 100)))"
] | false | 0.038904 | 0.043588 | 0.892528 | [
"s225592060",
"s300891636"
] |
u367130284 | p03044 | python | s764555580 | s456475283 | 954 | 876 | 8,924 | 10,252 | Accepted | Accepted | 8.18 | class UNION_FIND(object):
def __init__(self,n):
self.parent=[-1 for i in range(n)]
def root(self,x):
if self.parent[x]<0:
return x
else:
self.parent[x]=self.root(self.parent[x])
return self.parent[x]
def size(self,x):
return -self.parent[self.root(x)]
def union(self,x,y):
x=self.root(x)
y=self.root(y)
if x==y:
return False
if self.size(x)<self.size(y):
x,y=y,x
self.parent[x]+=self.parent[y] #Aのサイズを更新する
self.parent[y]=x #Bの親をAに変更する
return True
n=int(eval(input()))
u=UNION_FIND(2*n)
for i in range(n-1):
a,b,c=list(map(int,input().split()))
if c%2==0:
u.union(a-1,b-1)
u.union(a-1+n,b-1+n)
else:
u.union(a-1+n,b-1)
u.union(a-1,b-1+n)
#print(u.parent)
for i in range(n):
if u.root(i)<n:
print((1))
else:
print((0)) | class POTENTIAL_UNION_FIND(object):
def __init__(self, n):
self.parent = [-1 for i in range(n)]#非負なら親ノード，負ならグループの要素数
self.diff_p = [0 for i in range(n)]#親ノードを基準としたポテンシャル
def root(self, x): #root(x): xの根ノードを返す
if self.parent[x] < 0:
return x
else:
rx = self.root(self.parent[x]) #xをxの根rxに直接つなぎたい
self.diff_p[x] += self.diff_p[self.parent[x]] #そのために，diff(rx,x)を計算
self.parent[x] = rx #xをrxに直接つなげる
return rx
def size(self,x): #size(x): xのいるグループの要素数を返す
return -self.parent[self.root(x)]
def merge(self, x, y, dxy): #ポテンシャル差の条件p(y)-p(x)=dxyでxとyのグループをまとめる
rx = self.root(x) #rxを新たにxと名づける
ry = self.root(y) #ryを新たにyと名づける
dxy += self.diff_p[x] - self.diff_p[y] #dxyをdiff(rx,ry)で置き換え
x,y=rx,ry
if x == y:
return False
if self.parent[x] > self.parent[y]: #xの要素数がyの要素数より「小さい」とき入れ替える
x,y,dxy=y,x,-dxy
self.parent[x] += self.parent[y] #xの要素数を更新
self.parent[y] = x #yをxにつなぐ
self.diff_p[y] = dxy #yの相対ポテンシャルを更新
return True
def issame(self, x, y): #issame(x,y): xとyが同じグループにあるならTrue
return self.root(x) == self.root(y)
def diff(self,x,y): #diff(x,y): xを基準としたyのポテンシャルを返す
if self.root(x) == self.root(y): #この時点でxの親はroot(x)
return self.diff_p[y] - self.diff_p[x]
else:
return None
n=int(eval(input()))
u=POTENTIAL_UNION_FIND(n)
for i in range(n-1):
a,b,c=list(map(int,input().split()))
u.merge(a-1,b-1,c)
for i in range(n):
print((u.diff(0,i)%2)) | 40 | 47 | 986 | 1,664 | class UNION_FIND(object):
def __init__(self, n):
self.parent = [-1 for i in range(n)]
def root(self, x):
if self.parent[x] < 0:
return x
else:
self.parent[x] = self.root(self.parent[x])
return self.parent[x]
def size(self, x):
return -self.parent[self.root(x)]
def union(self, x, y):
x = self.root(x)
y = self.root(y)
if x == y:
return False
if self.size(x) < self.size(y):
x, y = y, x
self.parent[x] += self.parent[y] # Aのサイズを更新する
self.parent[y] = x # Bの親をAに変更する
return True
n = int(eval(input()))
u = UNION_FIND(2 * n)
for i in range(n - 1):
a, b, c = list(map(int, input().split()))
if c % 2 == 0:
u.union(a - 1, b - 1)
u.union(a - 1 + n, b - 1 + n)
else:
u.union(a - 1 + n, b - 1)
u.union(a - 1, b - 1 + n)
# print(u.parent)
for i in range(n):
if u.root(i) < n:
print((1))
else:
print((0))
| class POTENTIAL_UNION_FIND(object):
def __init__(self, n):
self.parent = [-1 for i in range(n)] # 非負なら親ノード，負ならグループの要素数
self.diff_p = [0 for i in range(n)] # 親ノードを基準としたポテンシャル
def root(self, x): # root(x): xの根ノードを返す
if self.parent[x] < 0:
return x
else:
rx = self.root(self.parent[x]) # xをxの根rxに直接つなぎたい
self.diff_p[x] += self.diff_p[self.parent[x]] # そのために，diff(rx,x)を計算
self.parent[x] = rx # xをrxに直接つなげる
return rx
def size(self, x): # size(x): xのいるグループの要素数を返す
return -self.parent[self.root(x)]
def merge(self, x, y, dxy): # ポテンシャル差の条件p(y)-p(x)=dxyでxとyのグループをまとめる
rx = self.root(x) # rxを新たにxと名づける
ry = self.root(y) # ryを新たにyと名づける
dxy += self.diff_p[x] - self.diff_p[y] # dxyをdiff(rx,ry)で置き換え
x, y = rx, ry
if x == y:
return False
if self.parent[x] > self.parent[y]: # xの要素数がyの要素数より「小さい」とき入れ替える
x, y, dxy = y, x, -dxy
self.parent[x] += self.parent[y] # xの要素数を更新
self.parent[y] = x # yをxにつなぐ
self.diff_p[y] = dxy # yの相対ポテンシャルを更新
return True
def issame(self, x, y): # issame(x,y): xとyが同じグループにあるならTrue
return self.root(x) == self.root(y)
def diff(self, x, y): # diff(x,y): xを基準としたyのポテンシャルを返す
if self.root(x) == self.root(y): # この時点でxの親はroot(x)
return self.diff_p[y] - self.diff_p[x]
else:
return None
n = int(eval(input()))
u = POTENTIAL_UNION_FIND(n)
for i in range(n - 1):
a, b, c = list(map(int, input().split()))
u.merge(a - 1, b - 1, c)
for i in range(n):
print((u.diff(0, i) % 2))
| false | 14.893617 | [
"-class UNION_FIND(object):",
"+class POTENTIAL_UNION_FIND(object):",
"- self.parent = [-1 for i in range(n)]",
"+ self.parent = [-1 for i in range(n)] # 非負なら親ノード，負ならグループの要素数",
"+ self.diff_p = [0 for i in range(n)] # 親ノードを基準としたポテンシャル",
"- def root(self, x):",
"+ def root(se... | false | 0.034049 | 0.037961 | 0.89694 | [
"s764555580",
"s456475283"
] |
u395117343 | p02831 | python | s489948698 | s539353203 | 290 | 150 | 17,796 | 12,484 | Accepted | Accepted | 48.28 | # coding:utf-8
import sys
import math
import time
import numpy as np
import collections
def gcd(m,n):
x = max(m,n)
y = min(m,n)
if x%y == 0:
return y
else:
while x%y != 0:
z = x%y
x = y
y = z
else:
return z
#X = str(raw_input()).split()
AB = str(input()).split()
A = int(AB[0])
B = int(AB[1])
ans = A * B / gcd(A,B)
print(ans);
| # coding:utf-8
import sys
import math
import time
import numpy as np
import collections
from collections import deque
import queue
import copy
# 最大公約数
def gcd(m,n):
x = max(m,n)
y = min(m,n)
if x%y == 0:
return y
else:
while x%y != 0:
z = x%y
x = y
y = z
else:
return z
# 幅優先探索(BFS)でスタート座標(x, y)からの最大距離返す
def bfs(SS, x, y, H, W):#入力(座標系(迷路), x, y, xの端, yの端)
x_next = [0, 0, -1, 1]
y_next = [1, -1, 0, 0]
tempx = x
tempy = y
mlength = 0
q = deque()
xytuple = (x, y, 0)
q.append(xytuple)
while q:
xytuple = q.popleft()
SS[xytuple[0]][xytuple[1]] = "x" #探索した場所は探索できないようにする
for i in range(4): #このforで上下左右を調べてる
tempx = xytuple[0] + x_next[i]
tempy = xytuple[1] + y_next[i]
#print(tempx, tempy, xytuple[2])
#print(S)
if(0 <= tempx and tempx < H and 0 <= tempy and tempy < W and SS[tempx][tempy] == "."):
temptuple = (tempx, tempy, xytuple[2]+1)
SS[temptuple[0]][temptuple[1]] = "x" #探索した場所は探索できないようにする
mlength = max(mlength, xytuple[2] +1)
q.append(temptuple)
#print(q)
return mlength
#X = str(input()).split()
AB = str(eval(input())).split()
A = int(AB[0])
B = int(AB[1])
ans = int(A * B /gcd(A,B))
print(ans)
| 29 | 63 | 409 | 1,315 | # coding:utf-8
import sys
import math
import time
import numpy as np
import collections
def gcd(m, n):
x = max(m, n)
y = min(m, n)
if x % y == 0:
return y
else:
while x % y != 0:
z = x % y
x = y
y = z
else:
return z
# X = str(raw_input()).split()
AB = str(input()).split()
A = int(AB[0])
B = int(AB[1])
ans = A * B / gcd(A, B)
print(ans)
| # coding:utf-8
import sys
import math
import time
import numpy as np
import collections
from collections import deque
import queue
import copy
# 最大公約数
def gcd(m, n):
x = max(m, n)
y = min(m, n)
if x % y == 0:
return y
else:
while x % y != 0:
z = x % y
x = y
y = z
else:
return z
# 幅優先探索(BFS)でスタート座標(x, y)からの最大距離返す
def bfs(SS, x, y, H, W): # 入力(座標系(迷路), x, y, xの端, yの端)
x_next = [0, 0, -1, 1]
y_next = [1, -1, 0, 0]
tempx = x
tempy = y
mlength = 0
q = deque()
xytuple = (x, y, 0)
q.append(xytuple)
while q:
xytuple = q.popleft()
SS[xytuple[0]][xytuple[1]] = "x" # 探索した場所は探索できないようにする
for i in range(4): # このforで上下左右を調べてる
tempx = xytuple[0] + x_next[i]
tempy = xytuple[1] + y_next[i]
# print(tempx, tempy, xytuple[2])
# print(S)
if (
0 <= tempx
and tempx < H
and 0 <= tempy
and tempy < W
and SS[tempx][tempy] == "."
):
temptuple = (tempx, tempy, xytuple[2] + 1)
SS[temptuple[0]][temptuple[1]] = "x" # 探索した場所は探索できないようにする
mlength = max(mlength, xytuple[2] + 1)
q.append(temptuple)
# print(q)
return mlength
# X = str(input()).split()
AB = str(eval(input())).split()
A = int(AB[0])
B = int(AB[1])
ans = int(A * B / gcd(A, B))
print(ans)
| false | 53.968254 | [
"+from collections import deque",
"+import queue",
"+import copy",
"-",
"+# 最大公約数",
"-# X = str(raw_input()).split()",
"-AB = str(input()).split()",
"+# 幅優先探索(BFS)でスタート座標(x, y)からの最大距離返す",
"+def bfs(SS, x, y, H, W): # 入力(座標系(迷路), x, y, xの端, yの端)",
"+ x_next = [0, 0, -1, 1]",
"+ y_next = [1... | false | 0.045553 | 0.047089 | 0.967379 | [
"s489948698",
"s539353203"
] |
u825460912 | p03434 | python | s017289149 | s528674138 | 20 | 17 | 3,060 | 3,060 | Accepted | Accepted | 15 | N = int(eval(input()))
A = list(map(int, input().split()))
A.sort(reverse = True)
alice = bob = 0
for i in range(N):
if i%2 == 0:
alice += A.pop(0)
else:
bob += A.pop(0)
print((alice - bob)) | N = int(eval(input()))
A = list(map(int, input().split()))
A.sort(reverse = True)
alice = bob = 0
for i in range(N):
if i%2 == 0:
alice += A[i]
else:
bob += A[i]
print((alice - bob)) | 11 | 11 | 221 | 213 | N = int(eval(input()))
A = list(map(int, input().split()))
A.sort(reverse=True)
alice = bob = 0
for i in range(N):
if i % 2 == 0:
alice += A.pop(0)
else:
bob += A.pop(0)
print((alice - bob))
| N = int(eval(input()))
A = list(map(int, input().split()))
A.sort(reverse=True)
alice = bob = 0
for i in range(N):
if i % 2 == 0:
alice += A[i]
else:
bob += A[i]
print((alice - bob))
| false | 0 | [
"- alice += A.pop(0)",
"+ alice += A[i]",
"- bob += A.pop(0)",
"+ bob += A[i]"
] | false | 0.077166 | 0.052003 | 1.483875 | [
"s017289149",
"s528674138"
] |
u325282913 | p03549 | python | s136532499 | s370732127 | 19 | 17 | 2,940 | 2,940 | Accepted | Accepted | 10.53 | N, M = list(map(int, input().split()))
t = 1900*M + 100*(N-M)
p = 1/((1/2)**M)
print((int(t*p))) | N, M = list(map(int,input().split()))
print(((M * 1900 + (N-M) * 100)*(2 ** M))) | 4 | 2 | 91 | 73 | N, M = list(map(int, input().split()))
t = 1900 * M + 100 * (N - M)
p = 1 / ((1 / 2) ** M)
print((int(t * p)))
| N, M = list(map(int, input().split()))
print(((M * 1900 + (N - M) * 100) * (2**M)))
| false | 50 | [
"-t = 1900 * M + 100 * (N - M)",
"-p = 1 / ((1 / 2) ** M)",
"-print((int(t * p)))",
"+print(((M * 1900 + (N - M) * 100) * (2**M)))"
] | false | 0.049835 | 0.049696 | 1.002798 | [
"s136532499",
"s370732127"
] |
u900139929 | p03478 | python | s389933214 | s602908735 | 34 | 29 | 2,940 | 2,940 | Accepted | Accepted | 14.71 | #!/usr/bin/env python3
import sys
sys.setrecursionlimit(10**7)
n, a, b = list(map(int, input().split()))
ans = 0
for i in range(n+1):
s = str(i)
sum = 0
for j in s:
sum += int(j)
if a <= sum <= b:
ans += i
print(ans)
| #!/usr/bin/env python3
import sys
sys.setrecursionlimit(10**7)
n, a, b = list(map(int, input().split()))
ans = 0
# for i in range(1, n+1):
# s = str(i)
# sum = 0
# for j in s:
# sum += int(j)
# if a <= sum <= b:
# ans += i
for i in range(1, n+1):
sum = 0
num = i
while num > 0:
sum += num%10 # 10で割ったあまりを取得することで最下位桁を取る
num = num//10 # 10で割った商を取得することで一桁ずらす
if a <= sum <=b:
ans += i
print(ans)
| 17 | 26 | 263 | 489 | #!/usr/bin/env python3
import sys
sys.setrecursionlimit(10**7)
n, a, b = list(map(int, input().split()))
ans = 0
for i in range(n + 1):
s = str(i)
sum = 0
for j in s:
sum += int(j)
if a <= sum <= b:
ans += i
print(ans)
| #!/usr/bin/env python3
import sys
sys.setrecursionlimit(10**7)
n, a, b = list(map(int, input().split()))
ans = 0
# for i in range(1, n+1):
# s = str(i)
# sum = 0
# for j in s:
# sum += int(j)
# if a <= sum <= b:
# ans += i
for i in range(1, n + 1):
sum = 0
num = i
while num > 0:
sum += num % 10 # 10で割ったあまりを取得することで最下位桁を取る
num = num // 10 # 10で割った商を取得することで一桁ずらす
if a <= sum <= b:
ans += i
print(ans)
| false | 34.615385 | [
"-for i in range(n + 1):",
"- s = str(i)",
"+# for i in range(1, n+1):",
"+# s = str(i)",
"+# sum = 0",
"+# for j in s:",
"+# sum += int(j)",
"+# if a <= sum <= b:",
"+# ans += i",
"+for i in range(1, n + 1):",
"- for j in s:",
"- sum += int(j)",
... | false | 0.036081 | 0.036844 | 0.979268 | [
"s389933214",
"s602908735"
] |
u634208461 | p03309 | python | s722775299 | s153307875 | 304 | 215 | 26,180 | 26,180 | Accepted | Accepted | 29.28 | N = int(eval(input()))
A = list(map(int, input().split()))
B = [A[i] - 1 - i for i in range(N)]
B.sort()
if N % 2 == 0:
med = [B[int(N / 2) - 1], int((B[int(N / 2) - 1] + B[int(N / 2)]) / 2), B[int(N / 2)]]
else:
med = [B[int((N + 1) / 2) - 1]]
ans = 10 ** 100
for b in med:
S = 0
for i in range(N):
S += abs(B[i] - b)
ans = min(ans, S)
print(ans)
| N = int(eval(input()))
A = list(map(int, input().split()))
B = [A[i] - 1 - i for i in range(N)]
B.sort()
if N % 2 == 0:
med = int((B[int(N / 2) - 1] + B[int(N / 2)]) / 2)
else:
med = B[int((N + 1) / 2) - 1]
S = 0
for i in range(N):
S += abs(B[i] - med)
print(S)
| 15 | 12 | 384 | 279 | N = int(eval(input()))
A = list(map(int, input().split()))
B = [A[i] - 1 - i for i in range(N)]
B.sort()
if N % 2 == 0:
med = [
B[int(N / 2) - 1],
int((B[int(N / 2) - 1] + B[int(N / 2)]) / 2),
B[int(N / 2)],
]
else:
med = [B[int((N + 1) / 2) - 1]]
ans = 10**100
for b in med:
S = 0
for i in range(N):
S += abs(B[i] - b)
ans = min(ans, S)
print(ans)
| N = int(eval(input()))
A = list(map(int, input().split()))
B = [A[i] - 1 - i for i in range(N)]
B.sort()
if N % 2 == 0:
med = int((B[int(N / 2) - 1] + B[int(N / 2)]) / 2)
else:
med = B[int((N + 1) / 2) - 1]
S = 0
for i in range(N):
S += abs(B[i] - med)
print(S)
| false | 20 | [
"- med = [",
"- B[int(N / 2) - 1],",
"- int((B[int(N / 2) - 1] + B[int(N / 2)]) / 2),",
"- B[int(N / 2)],",
"- ]",
"+ med = int((B[int(N / 2) - 1] + B[int(N / 2)]) / 2)",
"- med = [B[int((N + 1) / 2) - 1]]",
"-ans = 10**100",
"-for b in med:",
"- S = 0",
"- ... | false | 0.093204 | 0.042266 | 2.205166 | [
"s722775299",
"s153307875"
] |
u200887663 | p03137 | python | s660014161 | s407627908 | 120 | 93 | 13,964 | 20,476 | Accepted | Accepted | 22.5 | #x=int(input())
n,m=list(map(int,input().split()))
xl=list(map(int,input().split()))
#l=[list(map(int,input().split())) for i in range(n)]
ans=0
if n>=m:
pass
else:
cum=[]
xl.sort()
ans=xl[m-1]-xl[0]
for i in range(m-1):
cum.append(xl[i+1]-xl[i])
cum.sort(reverse=True)
for i in range(n-1):
ans-=cum[i]
print(ans) | #n = int(input())
n, m = list(map(int, input().split()))
xl = list(map(int, input().split()))
#al=[list(input()) for i in range(n)]
xl.sort()
difl = []
for i in range(1, m):
difl.append(xl[i]-xl[i-1])
difl.sort(reverse=True)
if n >= m:
ans = 0
else:
ans = xl[-1]-xl[0]-sum(difl[:n-1])
print(ans) | 18 | 17 | 369 | 320 | # x=int(input())
n, m = list(map(int, input().split()))
xl = list(map(int, input().split()))
# l=[list(map(int,input().split())) for i in range(n)]
ans = 0
if n >= m:
pass
else:
cum = []
xl.sort()
ans = xl[m - 1] - xl[0]
for i in range(m - 1):
cum.append(xl[i + 1] - xl[i])
cum.sort(reverse=True)
for i in range(n - 1):
ans -= cum[i]
print(ans)
| # n = int(input())
n, m = list(map(int, input().split()))
xl = list(map(int, input().split()))
# al=[list(input()) for i in range(n)]
xl.sort()
difl = []
for i in range(1, m):
difl.append(xl[i] - xl[i - 1])
difl.sort(reverse=True)
if n >= m:
ans = 0
else:
ans = xl[-1] - xl[0] - sum(difl[: n - 1])
print(ans)
| false | 5.555556 | [
"-# x=int(input())",
"+# n = int(input())",
"-# l=[list(map(int,input().split())) for i in range(n)]",
"-ans = 0",
"+# al=[list(input()) for i in range(n)]",
"+xl.sort()",
"+difl = []",
"+for i in range(1, m):",
"+ difl.append(xl[i] - xl[i - 1])",
"+difl.sort(reverse=True)",
"- pass",
"+... | false | 0.045276 | 0.046035 | 0.983513 | [
"s660014161",
"s407627908"
] |
u403331159 | p02732 | python | s658195726 | s963799026 | 525 | 467 | 30,916 | 26,780 | Accepted | Accepted | 11.05 | from collections import Counter
def Comb(n,k):
comb_ans=1
for i in range(1,k+1):
comb_ans*=(n-i+1)/i
comb_ans=int(comb_ans)
return comb_ans
N=int(eval(input()))
A=list(map(int,input().split()))
C=Counter()
C.update(A)
ans=0
L=[0]*N
for i in range(N):
L[A[i]-1]+=1
Most=C.most_common()
#print(Most)
for i in range(len(C)):
ans+=Comb(Most[i][1],2)
for i in range(N):
pri=ans
pri=ans-L[A[i]-1]+1
print(pri) | from collections import Counter
def Comb(n,k):
comb_ans=1
for i in range(1,k+1):
comb_ans*=(n-i+1)/i
comb_ans=int(comb_ans)
return comb_ans
N=int(eval(input()))
A=list(map(int,input().split()))
C=Counter(A)
ans=0
for i in list(C.values()):
ans+=Comb(i,2)
for i in A:
print((ans-C[i]+1)) | 25 | 17 | 467 | 322 | from collections import Counter
def Comb(n, k):
comb_ans = 1
for i in range(1, k + 1):
comb_ans *= (n - i + 1) / i
comb_ans = int(comb_ans)
return comb_ans
N = int(eval(input()))
A = list(map(int, input().split()))
C = Counter()
C.update(A)
ans = 0
L = [0] * N
for i in range(N):
L[A[i] - 1] += 1
Most = C.most_common()
# print(Most)
for i in range(len(C)):
ans += Comb(Most[i][1], 2)
for i in range(N):
pri = ans
pri = ans - L[A[i] - 1] + 1
print(pri)
| from collections import Counter
def Comb(n, k):
comb_ans = 1
for i in range(1, k + 1):
comb_ans *= (n - i + 1) / i
comb_ans = int(comb_ans)
return comb_ans
N = int(eval(input()))
A = list(map(int, input().split()))
C = Counter(A)
ans = 0
for i in list(C.values()):
ans += Comb(i, 2)
for i in A:
print((ans - C[i] + 1))
| false | 32 | [
"-C = Counter()",
"-C.update(A)",
"+C = Counter(A)",
"-L = [0] * N",
"-for i in range(N):",
"- L[A[i] - 1] += 1",
"-Most = C.most_common()",
"-# print(Most)",
"-for i in range(len(C)):",
"- ans += Comb(Most[i][1], 2)",
"-for i in range(N):",
"- pri = ans",
"- pri = ans - L[A[i] -... | false | 0.047327 | 0.046079 | 1.027078 | [
"s658195726",
"s963799026"
] |
u875291233 | p03566 | python | s142255737 | s341123009 | 39 | 18 | 5,368 | 3,064 | Accepted | Accepted | 53.85 |
import sys, collections, bisect, math, itertools
from fractions import gcd
input = sys.stdin.readline #文字列入力のときは注意
n = int(eval(input()))
t = [int(i) for i in input().split()]
v = [int(i) for i in input().split()]
maxspeed = [0]*(n+1)
for i in range(n-1,0,-1):
maxspeed[i] = min(v[i], v[i-1], t[i] + maxspeed[i+1])
#print(t)
#print(v)
#print(maxspeed)
def dist(first,i): # distance,lastspeed
ti = t[i]
vi = v[i]
mi1= maxspeed[i+1]
ta = vi - first
tb = vi - mi1
if ta + tb <= ti:
c = (first+vi)*ta/2 + vi*(ti-ta-tb) + (mi1+vi)*tb/2
lastspeed = mi1
elif mi1 - first > ti:
c = (first + first + ti)*ti/2
lastspeed = first + ti
else:
a = (mi1+ti-first)/2
c = (first+first+a)*a/2 + (first+a+mi1)*(ti-a)/2
# print(a,'a',c,first,(first+first+a)*a/2, (first+a+mi1)*(ti-a)/2)
lastspeed = mi1
# print(c)
return c, lastspeed
ans = 0
firstspeed = 0
for i in range(n):
d,firstspeed = dist(firstspeed,i)
# print(d,firstspeed)
ans += d
print(ans)
| n = int(eval(input()))
t = [int(i) for i in input().split()]
v = [int(i) for i in input().split()]
maxspeed = [0]*(n+1)
for i in range(n-1,0,-1):
maxspeed[i] = min(v[i], v[i-1], t[i] + maxspeed[i+1])
def dist(i,first): # distance,lastspeed
ta = v[i] - first
tb = v[i] - maxspeed[i+1]
if ta + tb <= t[i]:
c = (first+v[i])*ta/2 + v[i]*(t[i]-ta-tb) + (maxspeed[i+1]+v[i])*tb/2
lastspeed = maxspeed[i+1]
elif maxspeed[i+1] - first > t[i]:
c = (first + first + t[i])*t[i]/2
lastspeed = first + t[i]
else:
a = (maxspeed[i+1]+t[i]-first)/2
c = (first+first+a)*a/2 + (first+a+maxspeed[i+1])*(t[i]-a)/2
lastspeed = maxspeed[i+1]
return c, lastspeed
ans = 0
firstspeed = 0
for i in range(n):
d,firstspeed = dist(i,firstspeed)
ans += d
print(ans)
| 55 | 31 | 1,122 | 861 | import sys, collections, bisect, math, itertools
from fractions import gcd
input = sys.stdin.readline # 文字列入力のときは注意
n = int(eval(input()))
t = [int(i) for i in input().split()]
v = [int(i) for i in input().split()]
maxspeed = [0] * (n + 1)
for i in range(n - 1, 0, -1):
maxspeed[i] = min(v[i], v[i - 1], t[i] + maxspeed[i + 1])
# print(t)
# print(v)
# print(maxspeed)
def dist(first, i): # distance,lastspeed
ti = t[i]
vi = v[i]
mi1 = maxspeed[i + 1]
ta = vi - first
tb = vi - mi1
if ta + tb <= ti:
c = (first + vi) * ta / 2 + vi * (ti - ta - tb) + (mi1 + vi) * tb / 2
lastspeed = mi1
elif mi1 - first > ti:
c = (first + first + ti) * ti / 2
lastspeed = first + ti
else:
a = (mi1 + ti - first) / 2
c = (first + first + a) * a / 2 + (first + a + mi1) * (ti - a) / 2
# print(a,'a',c,first,(first+first+a)*a/2, (first+a+mi1)*(ti-a)/2)
lastspeed = mi1
# print(c)
return c, lastspeed
ans = 0
firstspeed = 0
for i in range(n):
d, firstspeed = dist(firstspeed, i)
# print(d,firstspeed)
ans += d
print(ans)
| n = int(eval(input()))
t = [int(i) for i in input().split()]
v = [int(i) for i in input().split()]
maxspeed = [0] * (n + 1)
for i in range(n - 1, 0, -1):
maxspeed[i] = min(v[i], v[i - 1], t[i] + maxspeed[i + 1])
def dist(i, first): # distance,lastspeed
ta = v[i] - first
tb = v[i] - maxspeed[i + 1]
if ta + tb <= t[i]:
c = (
(first + v[i]) * ta / 2
+ v[i] * (t[i] - ta - tb)
+ (maxspeed[i + 1] + v[i]) * tb / 2
)
lastspeed = maxspeed[i + 1]
elif maxspeed[i + 1] - first > t[i]:
c = (first + first + t[i]) * t[i] / 2
lastspeed = first + t[i]
else:
a = (maxspeed[i + 1] + t[i] - first) / 2
c = (first + first + a) * a / 2 + (first + a + maxspeed[i + 1]) * (t[i] - a) / 2
lastspeed = maxspeed[i + 1]
return c, lastspeed
ans = 0
firstspeed = 0
for i in range(n):
d, firstspeed = dist(i, firstspeed)
ans += d
print(ans)
| false | 43.636364 | [
"-import sys, collections, bisect, math, itertools",
"-from fractions import gcd",
"-",
"-input = sys.stdin.readline # 文字列入力のときは注意",
"-# print(t)",
"-# print(v)",
"-# print(maxspeed)",
"-def dist(first, i): # distance,lastspeed",
"- ti = t[i]",
"- vi = v[i]",
"- mi1 = maxspeed[i + 1]"... | false | 0.139663 | 0.072858 | 1.91692 | [
"s142255737",
"s341123009"
] |
u312025627 | p03324 | python | s933115293 | s458431335 | 162 | 17 | 38,256 | 2,940 | Accepted | Accepted | 89.51 | def main():
D, N = (int(i) for i in input().split())
if N == 100:
N += 1
print((N * 100**D))
if __name__ == '__main__':
main()
| def main():
D, N = (int(i) for i in input().split())
if N == 100:
N += 1
print((N*(100**D)))
if __name__ == '__main__':
main()
| 9 | 9 | 159 | 159 | def main():
D, N = (int(i) for i in input().split())
if N == 100:
N += 1
print((N * 100**D))
if __name__ == "__main__":
main()
| def main():
D, N = (int(i) for i in input().split())
if N == 100:
N += 1
print((N * (100**D)))
if __name__ == "__main__":
main()
| false | 0 | [
"- print((N * 100**D))",
"+ print((N * (100**D)))"
] | false | 0.035801 | 0.036723 | 0.974882 | [
"s933115293",
"s458431335"
] |
u224353074 | p03164 | python | s509295435 | s614834520 | 708 | 397 | 124,932 | 120,812 | Accepted | Accepted | 43.93 | N, W = list(map(int, input().split()))
WV = [list(map(int, input().split())) for i in range(N)]
INF = 10**9+1000
SUM_V = sum([A[1] for A in WV])
dp = [[INF]*(SUM_V+1) for i in range(N+1)]
dp[0][0] = 0
for i in range(N+1):
dp[i][0] = 0
for n in range(0, N):
for v in range(0, SUM_V+1):
if v >= WV[n][1]:
dp[n+1][v] = min(dp[n][v-WV[n][1]] + WV[n][0], dp[n][v])
else:
dp[n+1][v] = dp[n][v]
for n in range(0, N+1):
for v in range(0, SUM_V+1):
if dp[n][v] <= W:
dp[n][v] = -1
print((max([max([i for i,v in enumerate(dd) if v == -1]) for dd in dp]))) | import bisect
N, W = list(map(int, input().split()))
w = [0] * (N + 1)
v = [0] * (N + 1)
for i in range(1, N + 1):
w[i], v[i] = list(map(int, input().split()))
INF = 1000000010
MAX_V = 100010
dp = [[INF] * MAX_V for _ in range(N + 1)]
dp[0][0] = 0
for i in range(1, N + 1):
for value in range(MAX_V):
if value <= v[i]:
dp[i][value] = min(dp[i-1][value], w[i])
else:
dp[i][value] = min(dp[i - 1][value], dp[i-1][value-v[i]] + w[i])
print((bisect.bisect_right(dp[N], W)-1)) | 23 | 21 | 635 | 529 | N, W = list(map(int, input().split()))
WV = [list(map(int, input().split())) for i in range(N)]
INF = 10**9 + 1000
SUM_V = sum([A[1] for A in WV])
dp = [[INF] * (SUM_V + 1) for i in range(N + 1)]
dp[0][0] = 0
for i in range(N + 1):
dp[i][0] = 0
for n in range(0, N):
for v in range(0, SUM_V + 1):
if v >= WV[n][1]:
dp[n + 1][v] = min(dp[n][v - WV[n][1]] + WV[n][0], dp[n][v])
else:
dp[n + 1][v] = dp[n][v]
for n in range(0, N + 1):
for v in range(0, SUM_V + 1):
if dp[n][v] <= W:
dp[n][v] = -1
print((max([max([i for i, v in enumerate(dd) if v == -1]) for dd in dp])))
| import bisect
N, W = list(map(int, input().split()))
w = [0] * (N + 1)
v = [0] * (N + 1)
for i in range(1, N + 1):
w[i], v[i] = list(map(int, input().split()))
INF = 1000000010
MAX_V = 100010
dp = [[INF] * MAX_V for _ in range(N + 1)]
dp[0][0] = 0
for i in range(1, N + 1):
for value in range(MAX_V):
if value <= v[i]:
dp[i][value] = min(dp[i - 1][value], w[i])
else:
dp[i][value] = min(dp[i - 1][value], dp[i - 1][value - v[i]] + w[i])
print((bisect.bisect_right(dp[N], W) - 1))
| false | 8.695652 | [
"+import bisect",
"+",
"-WV = [list(map(int, input().split())) for i in range(N)]",
"-INF = 10**9 + 1000",
"-SUM_V = sum([A[1] for A in WV])",
"-dp = [[INF] * (SUM_V + 1) for i in range(N + 1)]",
"+w = [0] * (N + 1)",
"+v = [0] * (N + 1)",
"+for i in range(1, N + 1):",
"+ w[i], v[i] = list(map(... | false | 0.048406 | 0.540099 | 0.089625 | [
"s509295435",
"s614834520"
] |
u714642969 | p02586 | python | s983790585 | s885522322 | 2,146 | 1,597 | 209,028 | 145,904 | Accepted | Accepted | 25.58 | # -*- coding: utf-8 -*-
import sys
sys.setrecursionlimit(10**9)
INF=10**18
MOD=10**9+7
input=lambda: sys.stdin.readline().rstrip()
YesNo=lambda b: bool([print('Yes')] if b else print('No'))
YESNO=lambda b: bool([print('YES')] if b else print('NO'))
int1=lambda x:int(x)-1
R,C,K=map(int,input().split())
V=[[0]*C for _ in range(R)]
for i in range(K):
r,c,v=map(int,input().split())
r-=1
c-=1
V[r][c]=v
dp=[[0]*4 for _ in range(C)]
prev_dp=[[0]*4 for _ in range(C)]
for y in range(R):
for x in range(C):
for i in range(2,-1,-1):
dp[x][i+1]=max(dp[x][i+1],dp[x][i]+V[y][x])
if x<C-1:
for i in range(3,-1,-1):
dp[x+1][i]=max(dp[x+1][i],dp[x][i])
if y+1<R:
prev_dp=dp
dp=[[0]*4 for _ in range(C)]
for x in range(C):
dp[x][0]=max(prev_dp[x])
print(max(dp[-1]))
| # -*- coding: utf-8 -*-
import sys
sys.setrecursionlimit(10**9)
INF=10**18
MOD=10**9+7
input=lambda: sys.stdin.readline().rstrip()
YesNo=lambda b: bool([print('Yes')] if b else print('No'))
YESNO=lambda b: bool([print('YES')] if b else print('NO'))
int1=lambda x:int(x)-1
R,C,K=map(int,input().split())
V=[[0]*C for _ in range(R)]
for i in range(K):
r,c,v=map(int,input().split())
r-=1
c-=1
V[r][c]=v
dp=[[0]*C for _ in range(4)]
for y in range(R):
for x in range(C):
for i in range(2,-1,-1):
dp[i+1][x]=max(dp[i+1][x],dp[i][x]+V[y][x])
if x<C-1:
for i in range(3,-1,-1):
dp[i][x+1]=max(dp[i][x+1],dp[i][x])
if y+1<R:
MAX=0
for x in range(C):
for i in range(4):
MAX=max(MAX,dp[i][x])
dp[i][x]=0
dp[0][x]=MAX
print(max(dp[0][-1],dp[1][-1],dp[2][-1],dp[3][-1]))
| 32 | 33 | 902 | 944 | # -*- coding: utf-8 -*-
import sys
sys.setrecursionlimit(10**9)
INF = 10**18
MOD = 10**9 + 7
input = lambda: sys.stdin.readline().rstrip()
YesNo = lambda b: bool([print("Yes")] if b else print("No"))
YESNO = lambda b: bool([print("YES")] if b else print("NO"))
int1 = lambda x: int(x) - 1
R, C, K = map(int, input().split())
V = [[0] * C for _ in range(R)]
for i in range(K):
r, c, v = map(int, input().split())
r -= 1
c -= 1
V[r][c] = v
dp = [[0] * 4 for _ in range(C)]
prev_dp = [[0] * 4 for _ in range(C)]
for y in range(R):
for x in range(C):
for i in range(2, -1, -1):
dp[x][i + 1] = max(dp[x][i + 1], dp[x][i] + V[y][x])
if x < C - 1:
for i in range(3, -1, -1):
dp[x + 1][i] = max(dp[x + 1][i], dp[x][i])
if y + 1 < R:
prev_dp = dp
dp = [[0] * 4 for _ in range(C)]
for x in range(C):
dp[x][0] = max(prev_dp[x])
print(max(dp[-1]))
| # -*- coding: utf-8 -*-
import sys
sys.setrecursionlimit(10**9)
INF = 10**18
MOD = 10**9 + 7
input = lambda: sys.stdin.readline().rstrip()
YesNo = lambda b: bool([print("Yes")] if b else print("No"))
YESNO = lambda b: bool([print("YES")] if b else print("NO"))
int1 = lambda x: int(x) - 1
R, C, K = map(int, input().split())
V = [[0] * C for _ in range(R)]
for i in range(K):
r, c, v = map(int, input().split())
r -= 1
c -= 1
V[r][c] = v
dp = [[0] * C for _ in range(4)]
for y in range(R):
for x in range(C):
for i in range(2, -1, -1):
dp[i + 1][x] = max(dp[i + 1][x], dp[i][x] + V[y][x])
if x < C - 1:
for i in range(3, -1, -1):
dp[i][x + 1] = max(dp[i][x + 1], dp[i][x])
if y + 1 < R:
MAX = 0
for x in range(C):
for i in range(4):
MAX = max(MAX, dp[i][x])
dp[i][x] = 0
dp[0][x] = MAX
print(max(dp[0][-1], dp[1][-1], dp[2][-1], dp[3][-1]))
| false | 3.030303 | [
"-dp = [[0] * 4 for _ in range(C)]",
"-prev_dp = [[0] * 4 for _ in range(C)]",
"+dp = [[0] * C for _ in range(4)]",
"- dp[x][i + 1] = max(dp[x][i + 1], dp[x][i] + V[y][x])",
"+ dp[i + 1][x] = max(dp[i + 1][x], dp[i][x] + V[y][x])",
"- dp[x + 1][i] = max(dp[x + 1][i], d... | false | 0.044609 | 0.065151 | 0.684709 | [
"s983790585",
"s885522322"
] |
u279718559 | p03457 | python | s856515830 | s259454533 | 403 | 321 | 3,060 | 3,060 | Accepted | Accepted | 20.35 | # https://atcoder.jp/contests/abc086/tasks/arc089_a
t0 = 0
x0 = 0
y0 = 0
n = int(eval(input()))
result = "Yes"
for i in range(n):
t1, x1, y1 = list(map(int, input().split()))
dt = t1 - t0
dx = x1 - x0
dy = y1 - y0
if ((dx + dy)%2 == dt % 2) and (dx + dy) <= dt:
t0 = t1
x0 = x1
y0 = y1
else:
result = "No"
print(result)
| n = int(eval(input()))
for i in range(n):
t,x,y=list(map(int,input().split()))
if (x + y) > t or (x + y + t) % 2:
print("No")
exit()
print("Yes") | 20 | 7 | 391 | 163 | # https://atcoder.jp/contests/abc086/tasks/arc089_a
t0 = 0
x0 = 0
y0 = 0
n = int(eval(input()))
result = "Yes"
for i in range(n):
t1, x1, y1 = list(map(int, input().split()))
dt = t1 - t0
dx = x1 - x0
dy = y1 - y0
if ((dx + dy) % 2 == dt % 2) and (dx + dy) <= dt:
t0 = t1
x0 = x1
y0 = y1
else:
result = "No"
print(result)
| n = int(eval(input()))
for i in range(n):
t, x, y = list(map(int, input().split()))
if (x + y) > t or (x + y + t) % 2:
print("No")
exit()
print("Yes")
| false | 65 | [
"-# https://atcoder.jp/contests/abc086/tasks/arc089_a",
"-t0 = 0",
"-x0 = 0",
"-y0 = 0",
"-result = \"Yes\"",
"- t1, x1, y1 = list(map(int, input().split()))",
"- dt = t1 - t0",
"- dx = x1 - x0",
"- dy = y1 - y0",
"- if ((dx + dy) % 2 == dt % 2) and (dx + dy) <= dt:",
"- t0... | false | 0.038896 | 0.08208 | 0.47388 | [
"s856515830",
"s259454533"
] |
u969850098 | p03804 | python | s232693153 | s512793934 | 21 | 19 | 4,468 | 3,064 | Accepted | Accepted | 9.52 | N, M = list(map(int, input().split()))
A_list = [eval(input()) for i in range(N)]
B_list = [eval(input()) for i in range(M)]
all_segment = []
for width in range(N - M + 1):
for height in range(N - M + 1):
segment = [width_list[width: width + M] for width_list in A_list[height: height + M]]
all_segment.append(segment)
if B_list in all_segment:
print('Yes')
else:
print('No')
| import sys
readline = sys.stdin.readline
def main():
N, M = list(map(int, readline().rstrip().split()))
A = [readline().rstrip() for _ in range(N)]
B = [readline().rstrip() for _ in range(M)]
if A == B:
print('Yes')
return
for h in range(N-M):
for w in range(N-M):
a = [l[w:w+M] for l in A[h:h+M]]
if a == B:
print('Yes')
return
print('No')
if __name__ == '__main__':
main() | 14 | 21 | 401 | 499 | N, M = list(map(int, input().split()))
A_list = [eval(input()) for i in range(N)]
B_list = [eval(input()) for i in range(M)]
all_segment = []
for width in range(N - M + 1):
for height in range(N - M + 1):
segment = [
width_list[width : width + M] for width_list in A_list[height : height + M]
]
all_segment.append(segment)
if B_list in all_segment:
print("Yes")
else:
print("No")
| import sys
readline = sys.stdin.readline
def main():
N, M = list(map(int, readline().rstrip().split()))
A = [readline().rstrip() for _ in range(N)]
B = [readline().rstrip() for _ in range(M)]
if A == B:
print("Yes")
return
for h in range(N - M):
for w in range(N - M):
a = [l[w : w + M] for l in A[h : h + M]]
if a == B:
print("Yes")
return
print("No")
if __name__ == "__main__":
main()
| false | 33.333333 | [
"-N, M = list(map(int, input().split()))",
"-A_list = [eval(input()) for i in range(N)]",
"-B_list = [eval(input()) for i in range(M)]",
"-all_segment = []",
"-for width in range(N - M + 1):",
"- for height in range(N - M + 1):",
"- segment = [",
"- width_list[width : width + M] f... | false | 0.04297 | 0.041398 | 1.03797 | [
"s232693153",
"s512793934"
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.