input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
n, k = list(map(int, input().split()))
ps = list(map(int, input().split()))
cs = list(map(int, input().split()))
ps = [p-1 for p in ps]
visited = [False] * n
from collections import deque
ds = []
sums = []
for i in range(n):
if visited[i]: continue
q = deque([])
q.append(i)
s = cs[i]
d ... | n, k = list(map(int, input().split()))
ps = list(map(int, input().split()))
cs = list(map(int, input().split()))
ps = [p-1 for p in ps]
# doubling使う
vers = [] # vers[b][i] 頂点iから2^b回移動した時にどの頂点にいるか
score = [] # score[b][i]頂点iから2^b回移動した時に何点もらえるか
vers.append(ps)
score.append(cs)
m = 31
# ダブリング
for b in rang... | p02585 |
int1 = lambda x: int(x) - 1
N, K = list(map(int, input().split()))
P = tuple(map(int1, input().split()))
C = tuple(map(int, input().split()))
visited = set()
cycles = []
for i in range(N):
if i not in visited:
cur = P[i]
cycle = [i]
while cur != i:
visited.add(cur)... | int1 = lambda x: int(x) - 1
N, K = list(map(int, input().split()))
P = tuple(map(int1, input().split()))
C = tuple(map(int, input().split()))
visited = set()
cycles = []
for i in range(N):
if i not in visited:
cur = P[i]
cycle = [i]
while cur != i:
visited.add(cur)... | p02585 |
n, k =list(map(int, input().split()))
p = list(map(int, input().split()))
c = list(map(int, input().split()))
roop = []
seen = [0 for _ in range(n)]
count = 0
for i in range(n):
if seen[i]>0:
continue
else:
count+=1
seen[i] = count
roop.append([c[i]])
t = i
... | n, k =list(map(int, input().split()))
p = list(map(int, input().split()))
c = list(map(int, input().split()))
roop = []
seen = [0 for _ in range(n)]
count = 0
for i in range(n):
if seen[i]>0:
continue
else:
count+=1
seen[i] = count
roop.append([c[i]])
t = i
... | p02585 |
n, k = list(map(int, input().split()))
p = list(map(int, input().split()))
c = list(map(int, input().split()))
s = [[0] for _ in range(n)]
ans = -10**18
for i in range(n):
flag = 0
a = p[i]
s[i].append(c[a-1])
while flag == 0:
a = p[a-1]
if a == i + 1:
flag = 1... | N, K = list(map(int, input().split()))
P = list(map(int, input().split()))
for i in range(N):
P[i] -= 1
C = list(map(int, input().split()))
ans = -(10 ** 18)
for si in range(N):
x = si
loop = []
total = 0
while 1:
x = P[x]
loop.append(C[x])
total += C[x]
... | p02585 |
n,k=list(map(int,input().split()))
p=list(map(int,input().split()))
c=list(map(int,input().split()))
check=[0]*n
group=[]
for i in range(n):
tmp=i
if check[tmp]==0:
tmp_group=[]
while check[tmp]==0:
tmp_group.append(tmp)
check[tmp]=1
tmp=p[tm... | n,k=list(map(int,input().split()))
p=list(map(int,input().split()))
score=list(map(int,input().split()))
group_score=[]
checked=[0]*n
for i in range(n):
if checked[i]==0:
tmp_group=[]
tmp=i
while checked[tmp]==0:
checked[tmp]=1
tmp_group.append(score[... | p02585 |
from copy import copy
n, k = list(map(int, input().split()))
p = list(map(int,input().split()))
c = list(map(int, input().split()))
di = {}
for i in range(n):
di[i+1] = False
l = 1
cc = 0
per = [] # ループの順番
while cc < n:
tmp = []
while True:
if di[l]:
break
else:
... | from copy import copy
n, k = list(map(int, input().split()))
p = list(map(int,input().split()))
c = list(map(int, input().split()))
di = {}
for i in range(n):
di[i+1] = False
l = 1
cc = 0
per = [] # ループの順番
while cc < n:
tmp = []
while True:
if di[l]:
break
else:
... | p02585 |
import sys
input = lambda: sys.stdin.readline().rstrip("\r\n")
n, k = list(map(int, input().split()))
p = [int(x) - 1 for x in input().split()]
c = [int(x) for x in input().split()]
from collections import defaultdict
ans = -float('inf')
for i in range(n):
now = i
cnt = 0
score = []
c_s... | import sys
input = lambda: sys.stdin.readline().rstrip("\r\n")
n, k = list(map(int, input().split()))
p = [int(x) - 1 for x in input().split()]
c = [int(x) for x in input().split()]
ans = -float('inf')
for i in range(n):
now = i
c_sum = [0]
s = set()
cnt = 0
while True:
s.add... | p02585 |
N, K = list(map(int, input().split()))
P = list(map(int, input().split()))
C = list(map(int, input().split()))
for k in range(N):
P[k] -= 1
scorelist = []
roop = []
now = 0
visited = [-1 for _ in range(N)]
for k in range(N):
now = k
if visited[now] == -1:
roop.append([])
scorelist.append([])
... | N, K = list(map(int, input().split()))
P = list(map(int, input().split()))
C = list(map(int, input().split()))
for k in range(N):
P[k] -= 1
scorelist = []
roop = []
now = 0
visited = [-1 for _ in range(N)]
for k in range(N):
now = k
if visited[now] == -1:
roop.append([])
scorelist.append([])
... | p02585 |
N, K = list(map(int, input().split()))
P = list([int(x) - 1 for x in input().split()])
C = list(map(int, input().split()))
ans = -10**9-1
for i in range(N):
seen = [-1]*N
cumsum = [0]*(N+1)
now = i
j = 0
while seen[now] == -1:
seen[now] = 1
now = P[now]
cumsum[j... | from itertools import accumulate
N, K = list(map(int, input().split()))
P = list([int(x) - 1 for x in input().split()])
C = list(map(int, input().split()))
ans = -10**18-1
seen = [False]*N
for i in range(N):
if seen[i]:
continue
loop = []
now = i
while seen[now] == False:
... | p02585 |
from itertools import accumulate
N, K = list(map(int, input().split()))
P = list([int(x) - 1 for x in input().split()])
C = list(map(int, input().split()))
ans = -10**18-1
seen = [False]*N
for i in range(N):
if seen[i]:
continue
loop = []
now = i
while seen[now] == False:
... | from itertools import accumulate
N, K = list(map(int, input().split()))
P = list([int(x) - 1 for x in input().split()])
C = list(map(int, input().split()))
ans = -10**18-1
seen = [False]*N
for i in range(N):
if seen[i]:
continue
loop = []
now = i
while seen[now] == False:
... | p02585 |
N, K = list(map(int, input().split()))
P = [int(p) - 1 for p in input().split()]
C = list(map(int, input().split()))
max_score = -10**9
for i in range(N):
memo = [P[i]]
score = C[P[i]]
move = 1
max_score = max(score, max_score)
while move < K and P[memo[-1]] not in memo:
memo.a... | N, K = list(map(int, input().split()))
P = [int(p) - 1 for p in input().split()]
C = list(map(int, input().split()))
max_score = -10 ** 9
for i in range(N):
memo = set()
score = 0
cur = i
move = 0
while move < K and P[cur] not in memo:
cur = P[cur]
memo.add(cur)
... | p02585 |
n,k = list(map(int,input().split()))
p = [int(i)-1 for i in input().split()]
c = [int(i) for i in input().split()]
INF = float("INF")
ans = -INF
for i in range(n):
flag = [False]*n
now = i
cnt = 0
j = 0
mlst = [-INF]*n
m = -INF
while not flag[now]:
flag[now] = True
... | n,k = list(map(int,input().split()))
p = [int(i)-1 for i in input().split()]
c = [int(i) for i in input().split()]
INF = float("INF")
ans = -INF
for si in range(n):
x = si
S = []
tot = 0
while True:
x = p[x]
S.append(c[x])
tot += c[x]
if x == si: break
... | p02585 |
n, k = list(map(int, input().split()))
p = list(map(int, input().split()))
c = list(map(int, input().split()))
point_start_with = [0 for i in range(n)]
roop_count = [1 for i in range(n)]
for i in range(n):
now = (i + 1)
now_score = 0
while p[now - 1] != (i + 1):
now = p[now - 1]
no... | n, k = list(map(int, input().split()))
p = list(map(int, input().split()))
c = list(map(int, input().split()))
point_start_with = [0 for i in range(n)]
roop_count = [1 for i in range(n)]
for i in range(n):
now = (i + 1)
now_score = 0
while p[now - 1] != (i + 1):
now = p[now - 1]
no... | p02585 |
import sys
input = sys.stdin.readline
N, K = list(map(int, input().split()))
P = list([int(x)-1 for x in input().split()])
C = list(map(int, input().split()))
ans = -float("inf")
for st in range(N):
S = []
temp = P[st]
S.append(C[temp])
while temp != st:
temp = P[temp]
S.append(S[-1] +... | N, K = list(map(int, input().split()))
P = list([int(x)-1 for x in input().split()])
C = list(map(int, input().split()))
ans = -float("inf")
for st in range(N):
S = []
temp = P[st]
S.append(C[temp])
while temp != st:
temp = P[temp]
S.append(S[-1] + C[temp])
cnt = len(S)
loop, k = div... | p02585 |
import sys
sys.setrecursionlimit(10**9)
N,K = list(map(int,input().split()))
P = [ i-1 for i in list(map(int,input().split())) ]
C = list(map(int,input().split()))
g = [ [] for _ in range(N) ]
for i in range(N):
g[i].append(P[i])
def dfs(i):
global cycle
nei = g[i][0]
if nei in cycle: return
... | import sys
sys.setrecursionlimit(10**9)
N,K = list(map(int,input().split()))
P = [ i-1 for i in list(map(int,input().split())) ]
C = list(map(int,input().split()))
ans = -float('inf')
for i in range(N):
cycle = []
tot = 0
nex = i
while True:
nex = P[nex]
cycle.append(C[nex])
tot += ... | p02585 |
N, K = list(map(int, input().split()))
P = list(map(int, input().split()))
C = list(map(int, input().split()))
ans = -float('inf')
for i in range(N):
score = -float('inf')
cnt = 0
k = 0
while k < K:
ni = P[i] - 1
cnt += C[ni]
score = max(cnt, score)
i = ni
... | N, K = list(map(int, input().split()))
P = list(map(int, input().split()))
C = list(map(int, input().split()))
ans = -float('inf')
for i in range(N):
cnt = 0
k = 0
done = set()
S = []
while i not in done:
done.add(i)
ni = P[i] - 1
if len(S):
S.appen... | p02585 |
import sys
import heapq, math
from itertools import zip_longest, permutations, combinations, combinations_with_replacement
from itertools import accumulate, dropwhile, takewhile, groupby
from functools import lru_cache
from copy import deepcopy
from typing import List
N, K = list(map(int, input().split()))
P ... | from typing import List
N, K = list(map(int, input().split()))
P = list(map(int, input().split()))
C = list(map(int, input().split()))
def solve(N: int, K: int, P: List[int], C: List[int]):
ans = max(C)
visited = [False] * N
for i in range(N):
if visited[i]:
continue
... | p02585 |
(n,k),p,c=[[*list(map(int,t.split()))]for t in open(0)]
a=-9e9
for i in range(n):
s=f=0;x,j,*l=i,k
while~f:x=p[x]-1;s+=c[x];l+=s,;f-=x==i
for t in l[:k]:j-=1;a=max(a,t+j//len(l)*s*(s>0))
print(a) | (n,k),p,c=[[*list(map(int,t.split()))]for t in open(0)]
a=-9e9
while n:
n-=1;s,x,*l=0,n;f=j=k
while f:x=p[x]-1;s+=c[x];l+=s,;f=x!=n
for t in l[:k]:j-=1;a=max(a,t+j//len(l)*s*(s>0))
print(a) | p02585 |
(n,k),p,c,*a=[[*list(map(int,t.split()))]for t in open(0)]
while n:
n-=1;s,x,*l=0,n;f=j=k
while f:x=p[x]-1;s+=c[x];l+=s,;f=x!=n
for t in l[:k]:j-=1;a+=t+j//len(l)*s*(s>0),
print((max(a))) | (n,k),p,c,*a=[[*list(map(int,t.split()))]for t in open(0)]
while n:
n-=1;s,x,*l=0,n;f=j=k
while f:x=p[x]-1;s+=c[x];l+=s,;f=x!=n
for t in l[:k]:j-=1;a+=[t+j//len(l)*s*(s>0)]
print((max(a))) | p02585 |
n,k = list(map(int,input().split()))
p = [0] + list(map(int,input().split()))
c = [0] + list(map(int,input().split()))
ans = max(c[1:])
t = 0
for i in range(1,n+1):
# print(ans)
j = p[i]
temp = c[i]
cnt = 1
ans = max(ans,temp)
tempans = 0
while i!=j:
temp += c[... | n,k = list(map(int,input().split()))
p = [0] + list(map(int,input().split()))
c = [0] + list(map(int,input().split()))
ans = max(c[1:])
t = 0
for i in range(1,n+1):
# print(ans)
j = p[i]
temp = c[i]
cnt = 1
ans = max(ans,temp)
tempans = 0
while i!=j:
temp += c[... | p02585 |
n, k = list(map(int, input().split()))
p = [int(x) for x in input().split()]
c = [int(x) for x in input().split()]
p_flag = [0 for _ in range(len(p))]
loop_max = []
loop_len = []
S = []
S_max = []
ans = []
for i in range(len(p)):
# if p_flag[i] == 1:
# continue
now = i
temp_len = ... | n, k = list(map(int, input().split()))
p = [int(x) for x in input().split()]
c = [int(x) for x in input().split()]
loop_max = []
loop_len = []
S = []
ans = []
for i in range(len(p)):
now = i
temp_len = 0
temp_s = 0
temp_l = []
while True:
now = p[now] - 1
temp_len... | p02585 |
n,k = list(map(int, input().split()))
p = list(map(int, input().split()))
c = list(map(int, input().split()))
r = -10**9
for i in range(n):
ans=c[i]
e =[ans]
f = i
a = 1
while a<k:
i = p[i]-1
if i == f:
break
a+=1
ans+=c[i]
e.append(ans)
if e[-1]>0 and a<k:
w ... | n,k = list(map(int, input().split()))
p = list(map(int, input().split()))
c = list(map(int, input().split()))
g = []
for i in range(n):
ans=c[i]
e =[ans]
f = i
a = 1
while a<k:
i = p[i]-1
if i == f:
break
a+=1
ans+=c[i]
e.append(ans)
if e[-1]>0 and a<k:
w = k%... | p02585 |
N,K = list(map(int,input().split()))
P = list(map(int,input().split()))
C = list(map(int,input().split()))
ans = -float('inf')
for i in range(N):
s = 0
for k in range(K):
i = P[i]-1
s += C[i]
ans = max(ans, s)
print(ans) | N,K = list(map(int,input().split()))
P = list(map(int,input().split()))
C = list(map(int,input().split()))
ans = -float('inf')
for i in range(N):
s = 0
j = i
for k in range(K):
j = P[j]-1
s += C[j]
ans = max(ans, s)
if j==i: break
d,m = divmod(K, k+1)
i... | p02585 |
# どう考えてもK>5000でループが起きるので，
# dp[k][i]:= k回まで，移動したときの最大の値とすればよい
# -infで初期化
N,K = list(map(int,input().split()))
P = list(map(int,input().split()))
C = list(map(int,input().split()))
dp = [[-float('inf') for _ in range(N)] for __ in range(5000)]
for i,c in enumerate(C):
dp[0][i] = 0
max_val = -float('inf')
... | N,K = list(map(int,input().split()))
P = list(map(int,input().split()))
C = list(map(int,input().split()))
LC = [-1] * N
# Pが順列なので，結局それぞれのマスはループのどれかにいる事がわかる．あとは，ループの長さとループ1回分のコスト(a->a)を計算しておく
# ループ1回分のコストが正の場合はループをなるべく回す．負の場合は1回もループしないほうがいい．ただし最初のa->aは考慮する.
# 1回は最低でも動かないといけないから
max_score = -float('inf')
for i... | p02585 |
from collections import defaultdict
n, k = list(map(int, input().split()))
P = list(map(int, input().split()))
C = list(map(int, input().split()))
P = [p - 1 for p in P]
SB = defaultdict(int)
sumC = sum(C)
# if sumC > 0:
# d, k = divmod(k, n)
# if d > 0:
# pscore = (d - 1) * sumC
# k += ... | from collections import defaultdict
n, k = list(map(int, input().split()))
P = list(map(int, input().split()))
C = list(map(int, input().split()))
P = [p - 1 for p in P]
# Pの要素の中で循環するモノ同士をまとめる
sep = []
visited = [0] * n
for i in range(n):
s = i
box = []
while visited[s] == 0:
box.append(s)
... | p02585 |
n,k=list(map(int,input().split()))
p=list(map(int,input().split()))
c=list(map(int,input().split()))
ans=-10**9
for i in range(1,n+1):
m=i
co=0
an=0
for j in range(n):
m=p[m-1]
co+=1
if m==i:
break
m=i
x=[0 for j in range(co+1)]
for ... | n,k=list(map(int,input().split()))
p=list(map(int,input().split()))
c=list(map(int,input().split()))
ans=-10**9
for i in range(1,n+1):
m=i
co=0
an=0
for j in range(n):
m=p[m-1]
co+=1
if m==i:
break
m=i
x=[0 for j in range(2*co)]
for ... | p02585 |
# -*- coding: utf-8 -*-
N, K = list(map(int, input().split()))
P_list = list(map(int, input().split()))
C_list = list(map(int, input().split()))
checked_list = [0 for _ in range(N)]
min_INF = -1 * 10 ** 10
max_score = min_INF
for i in range(N):
if checked_list[i] == 1:
continue
posit = i
... | # D not completed
# -*- coding: utf-8 -*-
N, K = list(map(int, input().split()))
P_list = list(map(int, input().split()))
C_list = list(map(int, input().split()))
checked_list = [0 for _ in range(N)]
min_INF = -1 * 10 ** 10
max_score = min_INF
for i in range(N):
if checked_list[i] == 1:
continue... | p02585 |
N, K = list(map(int, input().split()))
p = list(map(int, input().split()))
c = list(map(int, input().split()))
for i in range(len(p)):
p[i] -= 1
ans = float("-inf")
for i in range(N):
#iはスタートポジション
pos = i
#移動先のマスにかかれたポイント
point = []
total = 0
while True:
pos = p[... | N, K = list(map(int, input().split()))
p = list(map(int, input().split()))
c = list(map(int, input().split()))
for i in range(len(p)):
p[i] -= 1
ans = float("-inf")
for i in range(N):
#iはスタートポジション
pos = i
#移動先のマスにかかれたポイント
point = []
total = 0
while True:
pos = p[... | p02585 |
N, K = list(map(int, input().split()))
p = list(map(int, input().split()))
c = list(map(int, input().split()))
for i in range(len(p)):
p[i] -= 1
ans = float("-inf")
for i in range(N):
#iはスタートポジション
pos = i
#移動先のマスにかかれたポイント
point = []
total = 0
while True:
pos = p[... | N, K = list(map(int, input().split()))
P = list(map(int, input().split()))
C = list(map(int, input().split()))
for i in range(len(P)):
P[i] -= 1
ans = float("-inf")
for i in range(N):
cycle = []
pos = i
total = 0
while True:
pos = P[pos]
cycle.append(C[pos])
... | p02585 |
import itertools
N, K = [int(_) for _ in input().split()]
P = [int(_) - 1 for _ in input().split()]
C = [int(_) for _ in input().split()]
class SegmentTree():
def __init__(self, array, f, ti):
"""
Parameters
----------
array : list
to construct segment tree ... | import itertools
N, K = [int(_) for _ in input().split()]
P = [int(_) - 1 for _ in input().split()]
C = [int(_) for _ in input().split()]
class SegmentTree():
def __init__(self, array, f, ti):
"""
Parameters
----------
array : list
to construct segment tree ... | p02585 |
import sys
import math
import collections
import bisect
import itertools
# import numpy as np
sys.setrecursionlimit(10 ** 7)
INF = 10 ** 20
MOD = 10 ** 9 + 7
# MOD = 998244353
ni = lambda: int(sys.stdin.readline().rstrip())
ns = lambda: list(map(int, sys.stdin.readline().rstrip().split()))
na = lambda... | import sys
import math
import collections
import bisect
import itertools
# import numpy as np
sys.setrecursionlimit(10 ** 7)
INF = 10 ** 20
MOD = 10 ** 9 + 7
# MOD = 998244353
ni = lambda: int(sys.stdin.readline().rstrip())
ns = lambda: list(map(int, sys.stdin.readline().rstrip().split()))
na = lambda... | p02585 |
N, K = [int(i) for i in input().split()]
ps = [int(i) for i in input().split()]
cs = [int(i) for i in input().split()]
global_max = -10**10
past_score = [[]]*N
past_time = [[]]*N
for n in range(N):
score = 0
itta = set([])
iru = n
k = 0
while k < K:
score += cs[ps[iru]-1]
... | N, K = [int(i) for i in input().split()]
ps = [int(i) for i in input().split()]
cs = [int(i) for i in input().split()]
global_max = -10**10
past_score = [[]]*N
past_time = [[]]*N
for n in range(N):
score = 0
itta = [0]*N
iru = n
k = 0
while k < K:
score += cs[ps[iru]-1]
... | p02585 |
class UnionFind():
def __init__(self,n):
self.n=n
self.root=[-1]*n
self.rank=[-1]*n
def Find_Root(self,x):
if self.root[x]<0:return x
else:
self.root[x]=self.Find_Root(self.root[x])
return self.root[x]
def Unite(self,x,y):
... | N,K=list(map(int,input().split()))
P=list(map(int,input().split()))
C=list(map(int,input().split()))
E=[]
color=["white" for _ in range(N)]
for i in range(N):
if color[i]=="white":
index,F=i,[]
while 1:
if color[index]=="white":
color[index]="black"
... | p02585 |
n, k = list(map(int, input().split()))
Ps = list(map(int, input().split()))
Ps.insert(0,0)
Cs = list(map(int, input().split()))
Cs.insert(0,0)
Ls = [0] * (n + 1) # 周期
As = [] # 回答候補
# 周期を見つける
for i in range(1,n + 1):
count = 1
temp = Ps[i]
while temp != i:
temp = Ps[temp]
count += 1
Ls[... | n, k = list(map(int, input().split()))
Ps = list(map(int, input().split()))
Ps.insert(0,0)
Cs = list(map(int, input().split()))
Cs.insert(0,0)
Ls = [0] * (n + 1) # 周期
As = [0] * (n) # 回答候補
# 周期を見つける
for i in range(1,n + 1):
count = 1
temp = Ps[i]
while temp != i:
temp = Ps[temp]
count += 1... | p02585 |
N,K = list(map(int, input().split()))
p = list(map(int, input().split()))
c = list(map(int, input().split()))
ans = -1*10**9
for si in range(N):
x = si
total = 0
l = 0
s = list()
while(1):
x = p[x]-1
s.append(c[x])
l += 1
total += c[x]
if x == si:
break
t = 0
f... | N,K = list(map(int, input().split()))
p = list(map(int, input().split()))
c = list(map(int, input().split()))
ans = -1* 10**9
for si in range(N):
s = list()
total = 0
l = 0
x = si
while(1):
x = p[x] - 1
s.append(c[x])
total += c[x]
l += 1
if x == si:
break
t = 0
... | p02585 |
n,k = list(map(int,input().split()))
score = [0 for i in range(n)]
P = list(map(int,input().split()))
C = list(map(int,input().split()))
ans = -float('inf')
for i in range(n):
start = i
cur = i
i_s_score = 0
i_s_score_max = C[P[cur]-1]
move_num = 0
for j in range(n):
cur = P[... | n,k = list(map(int,input().split()))
P = list(map(int,input().split()))
C = list(map(int,input().split()))
ans = -10**100
for i in range(n):
start = i
cur = i
i_s_score = 0
i_s_score_max = C[P[cur]-1]
move_num = 0
for j in range(n):
cur = P[cur]-1
i_s_score += C[cur]
... | p02585 |
N,K = list(map(int,input().split()))
P = list(map(int,input().split()))
C = list(map(int,input().split()))
##################################################################
max_point = -10000000000000
for i in range(N):
point = 0
now = i
for j in range(K):
next_place = P[now]-1
point += C[next_... | n,k = list(map(int, input().split()))
p = list([int(z)-1 for z in input().split()])
c = list(map(int, input().split()))
data = [[0 for i in range(n+1)] for j in range(n)]
loop = [10**10 for i in range(n)]
for i in range(n):
j = i
for t in range(1,n+1):
j = p[j]
data[i][t] += data[i][t... | p02585 |
N, K = [int(_) for _ in input().split()]
P = [int(_) - 1 for _ in input().split()]
C = [int(_) for _ in input().split()]
X = [False for _ in range(N)]
V = []
for i in range(N):
if X[i]:
continue
t = i
v = []
while X[t] is False:
X[t] = True
v.append(C[t])
... | N, K = [int(_) for _ in input().split()]
P = [int(_) - 1 for _ in input().split()]
C = [int(_) for _ in input().split()]
def f(v, K):
if K == 0:
return 0
if max(v) < 0:
return max(v)
n = len(v)
X = [0]
for i in range(n):
X.append(X[-1] + v[i])
ans = -(10... | p02585 |
n, k = list(map(int, input().split()))
ps = list(map(int, input().split()))
cs = list(map(int, input().split()))
graphs = []
vGraphs = []
flags = [False]*n
for i in range(len(ps)):
p = ps[i]
index = p - 1
if flags[index]:
continue
current = set()
values = set()
curre... | n, k = list(map(int, input().split()))
ps = list(map(int, input().split()))
cs = list(map(int, input().split()))
graphs = []
vGraphs = []
flags = [False]*n
sumDict = dict()
for i in range(len(ps)):
p = ps[i]
index = p - 1
if flags[index]:
continue
current = set()
values ... | p02585 |
n, k = list(map(int, input().split()))
p = list(map(int, input().split()))
c = list(map(int, input().split()))
ans = -10**18
for i in range(n):
tmp_score = 0
pos = i
# cycle = 0
for l in range(k):
pos = p[pos]-1
tmp_score += c[pos]
ans = max(ans,tmp_score)
... | n, k = list(map(int, input().split()))
p = list(map(int, input().split()))
c = list(map(int, input().split()))
ans = -10**18
for i in range(n):
tmp_score = 0
pos = i
cycle = 0
for l in range(k):
pos = p[pos]-1
tmp_score += c[pos]
ans = max(ans,tmp_score)
c... | p02585 |
N,K=list(map(int,input().split()))
P=list(map(int,input().split()))
C=list(map(int,input().split()))
a=[]
s=set()
for i in range(N):
idx=P[i]-1
z=set()
tl=[]
rl=[]
c=0
tc=0
while idx not in z and c<K:
tl.append(C[idx])
tc+=C[idx]
rl.append(tc)
... | N,K=list(map(int,input().split()))
P=list(map(int,input().split()))
C=list(map(int,input().split()))
a=[]
ans=-10**10
for i in range(N):
idx=P[i]-1
z=set()
rl=[]
c=0
tc=0
while idx not in z and c<K:
tc+=C[idx]
rl.append(tc)
ans=max(ans,tc)
z.add(idx... | p02585 |
cache = {0: 1, 1: 1, 2: 2}
combo_cache = {}
def prepare_cache():
val = 1
for i in range(1, 10000):
val *= i
cache[i] = val
def permutation(n):
if n in cache:
return cache[n]
ret = n
for i in range(n-1, 0, -1):
if i in cache:
ret *=... | count = int(eval(input()))
li = list(map(int, input().split()))
sli = sorted(li)
pair_a = sli[len(sli) - 1]
pair_b = 0
current_max = 0
i = sli[len(sli) - 1]
diff = 10**9
for j in range(0, len(sli) - 1):
h = pair_a / 2
if abs(h - sli[j]) < diff:
diff = abs(h - sli[j])
pair_b =... | p03382 |
import math
def comb(n, r):
return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))
n = int(eval(input()))
a = [int(x) for x in input().split()]
x = max(a)
maxc = 0
maxy = 0
for y in sorted(a):
if x == y or y < x // 2:
continue
c = comb(x, y)
if maxc < c:
... | import math
n = int(eval(input()))
a = [int(x) for x in input().split()]
a.sort()
x = max(a)
a.remove(x)
maxi = 0
mind = x
for i in range(len(a)):
d = abs((x+1) // 2 - a[i])
if d < mind:
maxi = i
mind = d
print((str(x) + ' ' + str(a[maxi])))
| p03382 |
s = input().strip()
t = input().strip()
for i in range(len(s)):
if s[i] != t[i]:
s = s.translate(str.maketrans({s[i]:t[i], t[i]:s[i]}))
if s == t:
print("Yes")
else:
print("No") | s = input().strip()
t = input().strip()
scount = []
tcount = []
for x in [chr(i) for i in range(97,97+26)]:
scount.append(s.count(x))
tcount.append(t.count(x))
if sorted(scount) == sorted(tcount):
print("Yes")
else:
print("No") | p03252 |
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
from collections import Counter, deque
from collections import defaultdict
from itertools import combinations, permutations, accumulate, groupby, product
from bisect import bisect_left,bisect_right
from heapq import heapify, heappop, heappush
fr... | import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
from collections import Counter, deque
from collections import defaultdict
from itertools import combinations, permutations, accumulate, groupby, product
from bisect import bisect_left,bisect_right
from heapq import heapify, heappop, heappush
fr... | p03252 |
S = input()
T = input()
CS = [S.count(s) for s in S]
TS = [T.count(t) for t in T]
if False in [CS[i] == TS[i] for i in range(len(CS))]:
print('No')
else:
print('Yes')
| S = input()
T = input()
CS = {}
for s in S:
if s not in CS:
CS[s] = 1
else:
CS[s] += 1
TS = {}
for t in T:
if t not in TS:
TS[t] = 1
else:
TS[t] += 1
if False in [CS[S[i]] == TS[T[i]] for i in range(len(T))]:
print('No')
else:
print('Yes')
| p03252 |
#!/usr/bin/env python3
S = input().strip()
T = input().strip()
for i in range(len(S)):
S = S.translate(str.maketrans({S[i]: T[i], T[i]: S[i]}))
print(('Yes' if S == T else 'No')) | #!/usr/bin/env python3
S = input().strip()
T = input().strip()
trans = dict()
ans = True
for s, t in zip(S, T):
if trans.get(s, t) != t:
ans = False
break
trans[s] = t
# print(trans)
print(('Yes' if ans and len(set(trans.values())) == len(trans) else 'No')) | p03252 |
import sys
import os
import math
import string
ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: list(map(int, sys.stdin.buffer.readline().split()))
fl = lambda: list(map(float, sys.stdin.buffer.readline().split()))
iln = lambda n: [int(sys.stdin.buffer.readline().rstrip()) for _ in range(n)]... | import sys
import os
import math
import string
ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: list(map(int, sys.stdin.buffer.readline().split()))
fl = lambda: list(map(float, sys.stdin.buffer.readline().split()))
iln = lambda n: [int(sys.stdin.buffer.readline().rstrip()) for _ in range(n)]... | p03252 |
import sys
import os
import math
import string
ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: list(map(int, sys.stdin.buffer.readline().split()))
fl = lambda: list(map(float, sys.stdin.buffer.readline().split()))
iln = lambda n: [int(sys.stdin.buffer.readline().rstrip()) for _ in range(n)]... | import sys
import os
import math
import bisect
import collections
import itertools
ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: list(map(int, sys.stdin.buffer.readline().split()))
fl = lambda: list(map(float, sys.stdin.buffer.readline().split()))
iln = lambda n: [int(sys.stdin.buffer.r... | p03252 |
import sys
## io ##
def IS(): return sys.stdin.readline().rstrip()
def II(): return int(IS())
def MII(): return list(map(int, IS().split()))
def MIIZ(): return list([x-1 for x in MII()])
## dp ##
def DD2(d1,d2,init=0): return [[init]*d2 for _ in range(d1)]
def DD3(d1,d2,d3,init=0): return [DD2(d2,d3,init) for _... | import sys
## io ##
def IS(): return sys.stdin.readline().rstrip()
def II(): return int(IS())
def MII(): return list(map(int, IS().split()))
def MIIZ(): return list([x-1 for x in MII()])
## dp ##
def DD2(d1,d2,init=0): return [[init]*d2 for _ in range(d1)]
def DD3(d1,d2,d3,init=0): return [DD2(d2,d3,init) for _... | p03252 |
A = {chr(i):0 for i in range(97,123)}
S = input().strip()
T = input().strip()
N = len(S)
G = {}
for i in range(N):
a = S[i]
if a not in G:
G[a]=[]
b = T[i]
if b not in G[a]:
G[a].append(b)
flag = 0
cnt = 0
for a in G:
cnt += 1
if len(G[a])>1:
flag = 1
... | S = input().strip()
T = input().strip()
N = len(S)
C = {}
D = {}
flag = 0
for i in range(N):
if S[i] not in C:
C[S[i]] = T[i]
elif C[S[i]]!=T[i]:
flag = 1
break
if T[i] not in D:
D[T[i]] = S[i]
elif D[T[i]] != S[i]:
flag = 1
break
if flag=... | p03252 |
s,t=[sorted(x.count(i)for i in x) for x in open(0)]
print(('YNeos'[s!=t::2])) | s,t=[sorted(t.count(i)for i in set(t))for t in open(0)]
print(('YNeos'[s!=t::2])) | p03252 |
from collections import defaultdict
S, T = [x.strip() for x in open(0).read().split()]
ds, dt = defaultdict(str), defaultdict(str)
ans = 'Yes'
for s, t in zip(S, T):
if not ds[s] or ds[s] == t:
ds[s] = t
else:
ans = 'No'
break
if not dt[t] or dt[t] == s:
dt[t] = ... | S, T = input().strip(), input().strip()
ds, dt = {}, {}
for s, t in zip(S, T):
if s not in ds or ds[s] == t:
ds[s] = t
else:
print('No')
exit()
if t not in dt or dt[t] == s:
dt[t] = s
else:
print('No')
exit()
print('Yes') | p03252 |
sS = input().rstrip()
sT = input().rstrip()
def fConv2B(sA):
iL = len(sA)
dA = {}
for s in "abcdefghijklmnopqrstuvwxyz":
dA[s] = 0
iCounter = 1
for i in range(iL):
s = sA[i]
if s in dA:
if dA[sA[i]] == 0:
dA[sA[i]] = iCounter
... | sS = input().rstrip()
sT = input().rstrip()
aS = [0] * 26
aT = [0] * 26
sABC = "abcdefghijklmnopqrstuvwxyz"
for i in range(26):
aS[i]=sS.count(sABC[i])
aT[i]=sT.count(sABC[i])
aS.sort()
aT.sort()
if aS == aT:
print ("Yes")
else:
print ("No")
| p03252 |
import sys
from sys import exit
from collections import deque
from bisect import bisect_left, bisect_right, insort_left, insort_right
from heapq import heapify, heappop, heappush
from itertools import product, permutations, combinations, combinations_with_replacement
from functools import reduce
from math import... | import sys
from sys import exit
from collections import deque
from bisect import bisect_left, bisect_right, insort_left, insort_right
from heapq import heapify, heappop, heappush
from itertools import product, permutations, combinations, combinations_with_replacement
from functools import reduce
from math import... | p03252 |
from math import ceil
N = int(eval(input()))
A, B = [], []
for _ in range(N):
ai, bi = list(map(int, input().split()))
A.append(ai)
B.append(bi)
# print(" ", A, B)
# 後ろから順番にすれば良い気がする (iのボタンは1からiまでしか作用しないので)
count = 0
for j in range(N - 1, -1, -1):
# j番目の足りない回数を決定
if A[j] % B[j] == 0:... | from math import ceil
N = int(eval(input()))
A, B = [], []
for _ in range(N):
ai, bi = list(map(int, input().split()))
A.append(ai)
B.append(bi)
# 回数だけ確定する
# 後ろから順番にすれば良い気がする (iのボタンは1からiまでしか作用しないので)
count = 0
for j in range(N - 1, -1, -1):
if (count + A[j]) % B[j] == 0:
continue
... | p03821 |
n=int(eval(input()))
a=[list(map(int, input().split())) for i in range(n)]
a=a[::-1]
count=0
for i in range(n):
b=a[i][0]+count
if b%a[i][1]!=0:
count+=a[i][1]-b%a[i][1]
print(count) | n=int(eval(input()))
a=[list(map(int, input().split())) for i in range(n)]
c=0
for i,j in a[::-1]:
if (c+i)%j!=0:
c+=j-(c+i)%j
print(c) | p03821 |
# AGC009A - Multiple Array
# greedy algorithm
import sys
input = sys.stdin.readline
def main():
n = int(eval(input()))
A = tuple(tuple(map(int, input().split())) for _ in range(n))
ans = 0
for i, j in A[::-1]: # # decide from the last one
ans += -(i + ans) % j
print(ans)
if... | # AGC009A - Multiple Array
def main():
N, *AB = list(map(int, open(0).read().split()))
ans = 0
for i, j in zip(*[iter(AB[::-1])] * 2): # decide from the last one greedily
ans += -(j + ans) % i
print(ans)
if __name__ == "__main__":
main() | p03821 |
N = int(eval(input()))
A = [None] * N
B = [None] * N
for i in range(N):
A[i],B[i] = list(map(int, input().split()))
ans = 0
for i in range(N):
p = A[N-1-i] % B[N-1-i]
if p != 0:
for j in range(N-i):
A[j] += B[N-1-i] - p
ans += B[N-1-i] - p
print(ans) | N = int(eval(input()))
A = [None] * N
B = [None] * N
for i in range(N):
A[i],B[i] = list(map(int, input().split()))
ans = 0
for i in range(N):
p = (A[N-1-i] + ans) % B[N-1-i]
ans += (B[N-1-i] - p) % B[N-1-i]
print(ans) | p03821 |
n = int(eval(input()))
a_list = []
b_list = []
for _ in range(n):
a, b = list(map(int, input().split()))
a_list.append(a)
b_list.append(b)
a_list = list(reversed(a_list))
b_list = list(reversed(b_list))
ans = 0
for i in range(n):
a = a_list[i]
b = b_list[i]
a += ans
while (a % ... | n = int(eval(input()))
a_list = []
b_list = []
for _ in range(n):
a, b = list(map(int, input().split()))
a_list.append(a)
b_list.append(b)
a_list = list(reversed(a_list))
b_list = list(reversed(b_list))
ans = 0
for i in range(n):
a = a_list[i]
b = b_list[i]
a += ans
if (a % b) ... | p03821 |
#!/usr/bin/env python3
(n, ), *s = [[*list(map(int, i.split()))] for i in open(0)]
a, b = list(zip(*s))
c = 0
for i in reversed(list(range(n))):
q = (a[i] + c) % b[i]
c += b[i] - q if q > 0 else 0
print(c)
| #!/usr/bin/env python3
(n, ), *s = [[*list(map(int, i.split()))] for i in open(0)]
c = 0
for a, b in reversed(s):
q = (a + c) % b
c += b * (q > 0) - q
print(c)
| p03821 |
list_ab = []
n = int(eval(input()))
for i in range(n):
list_ab.append(list(map(int, input().split())))
j = n - 1
count = 0
while j >= 0:
if list_ab[j][0] % list_ab[j][1] == 0:
j -= 1
else:
ad = list_ab[j][1] * (list_ab[j][0] // list_ab[j][1] + 1) - list_ab[j][0]
count +=... | list_ab = []
n = int(eval(input()))
for i in range(n):
list_ab.append(list(map(int, input().split())))
j = n - 1
ad = 0
while j >= 0:
list_ab[j][0] += ad
if list_ab[j][0] % list_ab[j][1] == 0:
j -= 1
else:
ad += list_ab[j][1] * (list_ab[j][0] // list_ab[j][1] + 1) - list_ab[... | p03821 |
import math
n = int(eval(input()))
a = []
b = []
for i in range(n):
c, d= list(map(int, input().split()))
a.append(c)
b.append(d)
a.reverse()
b.reverse()
tot = 0
for i in range(n):
if (a[i]+tot)%b[i] == 0:
continue
x = b[i] - (a[i]+tot)%b[i]
tot += x
print (tot) | n = int(eval(input()))
a = []
b = []
for i in range(n):
c, d= list(map(int, input().split()))
a.append(c)
b.append(d)
a.reverse()
b.reverse()
tot = 0
for i in range(n):
if (a[i]+tot)%b[i] == 0: continue
x = b[i] - (a[i]+tot)%b[i]
tot += x
print (tot) | p03821 |
n = int(eval(input()))
a, b = [0]*n,[0]*n
count = 0
for i in range(n):
a[i],b[i] = list(map(int,input().split()))
while(n > 0):
if((a[n-1]+count)%b[n-1] == 0):
n -= 1
else:
count += 1
print(count) | n = int(eval(input()))
a, b = [0]*n,[0]*n
count = 0
for i in range(n):
a[i],b[i] = list(map(int,input().split()))
while(n > 0):
n -= 1
count += (b[n] if (a[n]+count)%b[n]!=0 else 0)-(a[n]+count)%b[n]
print(count) | p03821 |
N = int(eval(input()))
AB = []
for _ in range(N):
AB.append(tuple(map(int, input().split())))
cnt = 0
AB.reverse()
for el in AB:
A, B = el
A += cnt
while A % B != 0:
A += 1
cnt += 1
print(cnt) | N = int(eval(input()))
AB = []
for _ in range(N):
AB.append(tuple(map(int, input().split())))
cnt = 0
AB.reverse()
for el in AB:
A, B = el
A += cnt
if A % B != 0:
cnt += (B - A % B)
print(cnt) | p03821 |
import math
N=int(eval(input()))
A=[]
B=[]
for _ in range(N):
a,b=list(map(int,input().split()))
A.append(a)
B.append(b)
A.reverse()
B.reverse()
#print("initial A B")
#print(A)
#print(B)
cnt=0
for i in range(N):
tmp=math.ceil(A[i]/B[i])*B[i]-A[i]
for j in range(i,N):
A[j... | import math
N=int(eval(input()))
A=[]
B=[]
for _ in range(N):
a,b=list(map(int,input().split()))
A.append(a)
B.append(b)
A.reverse()
B.reverse()
cnt=0
for i in range(N):
A[i]+=cnt
tmp=math.ceil(A[i]/B[i])*B[i]-A[i]
cnt+=tmp
print(cnt) | p03821 |
n = int(eval(input()))
x = [0]*n
y = [0]*n
for i in range(n-1, -1, -1):
a,b = list(map(int, input().split()))
x[i] = a
y[i] = b
ans = 0
for i in range(n):
while (x[i]+ans) % y[i] != 0:
ans += 1
print(ans) | n = int(eval(input()))
x = [0]*n
y = [0]*n
for i in range(n-1, -1, -1):
a,b = list(map(int, input().split()))
x[i] = a
y[i] = b
ans = 0
for i in range(n):
if (x[i]+ans) % y[i] != 0:
ans += y[i]-(x[i]+ans)%y[i]
print(ans) | p03821 |
n = int(eval(input()))
a_li = []
b_li = []
for _ in range(n):
a,b = list(map(int, input().split()))
a_li.append(a)
b_li.append(b)
cnt = 0
for i in range(1,n+1):
if (a_li[-i]+cnt) % b_li[-i] != 0:
cnt += b_li[-i] - ((a_li[-i]+cnt) % b_li[-i])
print(cnt)
| n = int(eval(input()))
cnt = 0
ab_l = [list(map(int, input().split())) for _ in range(n)]
for ab in ab_l[::-1]:
a, b = ab[0], ab[1]
a += cnt
if a % b != 0:
cnt += b - a%b
print(cnt) | p03821 |
_, *AB = list(map(int, open(0).read().split()))
AB = iter(AB[::-1])
increment = 0
for b, a in zip(AB, AB):
a += increment
if a % b:
increment += b - a % b
print(increment) | def main():
_, *AB = list(map(int, open(0).read().split()))
AB = iter(AB[::-1])
increment = 0
for b, a in zip(AB, AB):
a += increment
if a % b:
increment += b - a % b
print(increment)
if __name__=="__main__":
main() | p03821 |
n=int(input())
ab=[list(map(int,input().split())) for _ in range(n)]
cnt=0
for i in range(n-1,-1,-1):
a,b=ab[i][0],ab[i][1]
if (a+cnt)%b==0:continue
cnt+=b-(a+cnt)%b
print(cnt) | n=int(input())
a=[]
b=[]
for i in range(n):
A,B=list(map(int,input().split()))
a.append(A)
b.append(B)
ans=0
for i in range(n-1,-1,-1):
if (a[i]+ans)%b[i]!=0:
ans+=b[i]-(a[i]+ans)%b[i]
print(ans) | p03821 |
# AGC009a
def main():
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)
# map(int, input().split())
n = int(eval(input()))
a = list()
b = list()
for _ in range(n):
aa, bb = list(map(int, input().split()))
a.append(aa)
b.append(bb)
... | # AGC009a
def main():
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)
# map(int, input().split())
n = int(eval(input()))
a = list()
b = list()
for _ in range(n):
aa, bb = list(map(int, input().split()))
a.append(aa)
b.append(bb)
... | p03821 |
n = int(eval(input()))
a = []
b = []
for i in range(n):
x,y = list(map(int,input().split()))
a.append(x)
b.append(y)
res = 0
for i in range(n):
a[n-1-i] += res
c = a[n-1-i]%b[n-1-i]
if c != 0:
res += b[n-1-i]-c
print(res) | import sys
input = sys.stdin.readline
n = int(eval(input()))
a = []
b = []
for i in range(n):
aa,bb = list(map(int,input().split()))
a.append(aa)
b.append(bb)
s = 0
res = 0
for i in range(n-1,-1,-1):
a[i] += res
if a[i]%b[i] == 0:
continue
res += b[i]-(a[... | p03821 |
n = int(eval(input()))
list_a = []
list_b = []
su = 0
for i in range(n):
a,b = list(map(int,input().split()))
list_a.append(a)
list_b.append(b)
list_a = list_a[::-1]
list_b = list_b[::-1]
for i in range(n):
if list_a[i]%list_b[i]==0:
continue
else:
x = list_b[i]-(list_a[i]%list_b[i])
... | n = int(eval(input()))
list_a = []
list_b = []
su = 0
for i in range(n):
a,b = list(map(int,input().split()))
list_a.append(a)
list_b.append(b)
list_a = list_a[::-1]
list_b = list_b[::-1]
for i in range(n):
list_a[i] += su
if list_a[i]%list_b[i]==0:
continue
else:
x = list_b[i]-(list_... | p03821 |
N = int(eval(input()))
A = [0 for _ in range(N)]
B = [0 for _ in range(N)]
for i in range(N):
a, b = list(map(int, input().split()))
A[i] = a
B[i] = b
A = A[::-1]
B = B[::-1]
R = [0 for _ in range(N)]
for i, (a, b) in enumerate(zip(A, B)):
r = a % b
if r > 0:
r = b - r
R[... | N = int(eval(input()))
A = [0 for _ in range(N)]
B = [0 for _ in range(N)]
for i in range(N):
a, b = list(map(int, input().split()))
A[i] = a
B[i] = b
A = A[::-1]
B = B[::-1]
R = [0 for _ in range(N)]
for i, (a, b) in enumerate(zip(A, B)):
r = a % b
if r > 0:
r = b - r
R[... | p03821 |
# coding: utf-8
# Your code here!
kai = int(eval(input()))
a = 0
b = 0
cou = 0
kaz = []
for i in range(kai):
a,b = list(map(int,input().split(" ")))
kaz.append(a)
kaz.append(b)
for j in range(kai):
while True:
if (kaz[(kai-j)*2 -2]+cou) % kaz [(kai-j)*2 -1] == 0:
br... | n = int(eval(input()))
p = []
for i in range(n):
a , b = list(map(int,input().split()))
p.append([a,b])
ans = 0
for i in reversed(list(range(n))):
if (p[i][0] + ans) % p[i][1] != 0:
ans += p[i][1] - ((p[i][0] + ans)%p[i][1])
print(ans) | p03821 |
N = int(eval(input()))
A = [list(map(int, input().split())) for _ in range(N)]
ans = 0
for i in range(N-1, -1, -1):
ans += (A[i][1] - (A[i][0]+ans) % A[i][1]) % A[i][1]
print(ans)
| ans = 0
for A, B in [list(map(int, input().split())) for _ in range(int(eval(input())))][::-1]:
ans += (B - A - ans) % B
print(ans)
| p03821 |
n,*a=list(map(int,open(0).read().split()))
#print(a)
sumcount=0
for s in range(n*2-1,-1,-2):
hidari=a[s-1]+sumcount
# print(hidari,a[s],sumcount)
if hidari%a[s]==0:
continue
elif hidari%a[s]!=0 and hidari//a[s]==0:
sumcount+=a[s]-hidari
elif hidari%a[s]!=0 and hidari//a[s]!=0:
sumcount+=... | n,*a=list(map(int,open(0).read().split()))
sumcount=0
for s in range(n*2-1,-1,-2):
hidari=a[s-1]+sumcount
if hidari%a[s]!=0 and hidari//a[s]==0:
sumcount+=a[s]-hidari
if hidari%a[s]!=0 and hidari//a[s]!=0:
sumcount+=(hidari//a[s]+1)*a[s]-hidari
print(sumcount) | p03821 |
#!/usr/bin/env python3
n, *d = list(map(int, open(0).read().split()))
a = d[::2]
b = d[1::2]
s = 0
for i in range(n):
t = a[-i-1] % b[-i-1]
if t: t = b[-i-1] - t
*a, = [x+t for x in a]
s += t
print(s) | #!/usr/bin/env python3
_, *s = open(0)
c = 0
for t in s[::-1]:
a, b = list(map(int, t.split()))
c += (-a-c) % b
print(c) | p03821 |
def floor(a, b):
return (-a)//b*(-1)
def inc_list(i, l):
for j in range(i):
l[j] += 1
return l
def inc_mult(i, n, l):
for _ in range(n):
l = inc_list(i, l)
return l
N = int(eval(input()))
A = []
B = []
for _ in range(N):
a, b = list(map(int, input().spli... | def floor(a, b):
return (-a)//b*(-1)
N = int(eval(input()))
A = []
B = []
total_add = 0
for _ in range(N):
a, b = list(map(int, input().split()))
A.append(a)
B.append(b)
ans = 0
for i in reversed(list(range(N))):
a = A.pop(-1)
a += total_add
b = B.pop(-1)
inc = b*f... | p03821 |
n=int(eval(input()))
ab=[list(map(int, input().split())) for _ in range(n)]
cnt=0
for i in range(n):
a=ab[n-i-1][0]
b=ab[n-i-1][1]
a+=cnt
amari=a%b
shou=a//b
if amari!=0:
cnt+=b-amari
print(cnt) | n=int(eval(input()))
ab=[list(map(int, input().split())) for _ in range(n)]
cnt=0
for i in range(n):
a=ab[n-i-1][0]
b=ab[n-i-1][1]
a+=cnt
amari=a%b
if amari!=0:
cnt+=b-amari
print(cnt) | p03821 |
N = int(eval(input()))
A=[]
B=[]
for i in range(N):
a,b=[int(n) for n in input().split()]
A.append(a)
B.append(b)
cnt=0
# print(list(reversed(range(N))))
for i in reversed(list(range(N))):
if A[i]%B[i]==0:
r=0
else:
r=B[i]-A[i]%B[i]
cnt+=r
A=[A[n]+r if n<=i... | N = int(eval(input()))
A=[]
B=[]
for i in range(N):
a,b=[int(n) for n in input().split()]
A.append(a)
B.append(b)
cnt=0
# print(list(reversed(range(N))))
for i in reversed(list(range(N))):
if (A[i]+cnt)%B[i]==0:
d=0
else:
d=B[i]-(A[i]+cnt)%B[i]
cnt+=d
# A=[A... | p03821 |
N = int(eval(input()))
A = []
B = []
for i in range(N):
a, b = list(map(int, input().split()))
A.append(a)
B.append(b)
A = A[::-1]
B = B[::-1]
ans = 0
for a, b in zip(A, B):
a += ans
if a % b != 0:
m = b - (a % b)
ans += m
print(ans) | N = int(eval(input()))
AB = reversed([[int(j) for j in input().split()] for i in range(N)])
ans = 0
for a, b in AB:
a += ans
if a % b != 0:
ans += b - (a % b)
print(ans) | p03821 |
N=int(eval(input()))
AB=[list(map(int,input().split())) for i in range(N)][::-1]
plus=0
for j in range(N):
AB[j][0]+=plus
while AB[j][0]%AB[j][1]!=0:
AB[j][0]+=1
plus+=1
print(plus) | N=int(eval(input()))
AB=[list(map(int,input().split())) for i in range(N)][::-1]
plus=0
for j in range(N):
AB[j][0]+=plus
if AB[j][0]%AB[j][1]!=0:
a=AB[j][1]-(AB[j][0]%AB[j][1])
AB[j][0]+=a
plus+=a
print(plus) | p03821 |
N = int(eval(input()))
A = []
B = []
for i in range(N):
a,b = list(map(int,input().split()))
A.append(a)
B.append(b)
k = 0
for i in range(N-1,-1,-1):
if A[i] % B[i] == 0 :
continue
else :
c = (B[i] - A[i] % B[i])
k += c
for j in range(i):
A... | N = int(eval(input()))
A = []
B = []
for i in range(N):
a,b = list(map(int,input().split()))
A.append(a)
B.append(b)
k = 0
for i in range(N-1,-1,-1):
A[i] += k
if A[i] % B[i] == 0 :
pass
else :
c = (B[i] - A[i] % B[i])
k += c
print(k) | p03821 |
n=int(eval(input()))
A=[]
B=[]
for i in range(n):
a,b=input().split()
A.append(a)
B.append(b)
A.reverse()
B.reverse()
A.append(0)
B.append(0)
A=list(map(int,A))
B=list(map(int,B))
v=[0]
for i in range(0,n):
cnt=0
if A[i]%B[i]!=0:
cnt+=(B[i]-A[i]%B[i])
A[i]+=(B[i]-... | n=int(eval(input()))
A=[]
B=[]
for i in range(n):
a,b=input().split()
A.append(a)
B.append(b)
A.reverse()
B.reverse()
A.append(0)
B.append(0)
A=list(map(int,A))
B=list(map(int,B))
x=0
for i in range(0,n):
cnt=0
if A[i]%B[i]!=0:
cnt+=(B[i]-A[i]%B[i])
A[i]+=(B[i]-A[... | p03821 |
n = int(eval(input()))
a_input = [0]*n
b_input = [0]*n
for i in range(n):
a_input[i],b_input[i]=list(map(int,input().split()))
ans=0
for i in range(n-1,-1,-1):
if a_input[i]%b_input[i]==0:
continue
tmp = b_input[i]-a_input[i]%b_input[i]
ans += tmp
for j in range(i+1):
a... | n = int(eval(input()))
a_input = [0]*n
b_input = [0]*n
for i in range(n):
a_input[i],b_input[i]=list(map(int,input().split()))
a_input=a_input[::-1]
b_input=b_input[::-1]
ans=0
for i in range(n):
a = a_input[i]+ans
b = b_input[i]
tmp = a%b
if tmp==0:
continue
ans+=(a//b... | p03821 |
N = int(eval(input()))
A = []
B = []
for i in range(N):
a,b = list(map(int,input().split()))
A.append(a)
B.append(b)
count2 = 0
for i in range(N-1,-1,-1):
count = B[i]*((A[i]-1)//B[i] + 1) - A[i]
count2 += count
for j in range(i+1):
A[j] += count
print(count2)
| N = int(eval(input()))
A = []
B = []
for i in range(N):
a,b = list(map(int,input().split()))
A.append(a)
B.append(b)
count2 = 0
for i in range(N-1,-1,-1):
count = B[i]*((A[i]+count2-1)//B[i] + 1) - A[i]-count2
count2 += count
print(count2) | p03821 |
n = int(eval(input()))
l = []
for i in range(n):
i = list(map(int,input().split()))
l.append(i)
tmp = 0
for j in reversed(list(range(n))):
l[j][0] += tmp
while l[j][0]%l[j][1] != 0:
l[j][0] += 1
tmp += 1
print(tmp) | n = int(eval(input()))
l = []
for i in range(n):
i = list(map(int,input().split()))
l.append(i)
tmp = 0
for j in reversed(list(range(n))):
l[j][0] += tmp
if l[j][0]%l[j][1] != 0:
tmp += l[j][1] - l[j][0]%l[j][1]
print(tmp) | p03821 |
n = int(eval(input()))
a, b = [], []
for _ in range(n):
ta, tb = list(map(int, input().split()))
a.append(ta)
b.append(tb)
ans = 0
i = n - 1
while i >= 0:
r = a[i] % b[i]
if r != 0:
t = b[i] - r
ans += t
for j in range(i):
a[j] += t
i -= 1
... | n = int(eval(input()))
a, b = [], []
for _ in range(n):
ta, tb = list(map(int, input().split()))
a.append(ta)
b.append(tb)
ans = 0
i = n - 1
while i >= 0:
a[i] += ans
r = a[i] % b[i]
if r != 0:
ans += b[i] - r
i -= 1
print(ans) | p03821 |
n = int(eval(input()))
a, b = [], []
for _ in range(n):
ta, tb = list(map(int, input().split()))
a.append(ta)
b.append(tb)
ans = 0
i = n - 1
while i >= 0:
a[i] += ans
r = a[i] % b[i]
if r != 0:
ans += b[i] - r
i -= 1
print(ans) | N = int(eval(input()))
a, b = [], []
for _ in range(N):
aa, bb = list(map(int, input().split()))
a.append(aa)
b.append(bb)
ans = 0
add_v = 0
i = N - 1
while i >= 0:
r = (a[i] + add_v) % b[i]
if r != 0:
to_add = b[i] - r
add_v += to_add
ans += to_add
i -= ... | p03821 |
N=int(eval(input()))
Z=[list(map(int,input().split())) for i in range(N)]
A,B=list(zip(*Z))
A=list(A[::-1])
B=list(B[::-1])
ans=0
for i in range(N):
A[i]+=ans
while A[i]%B[i]!=0:
ans+=1
A[i]+=1
print(ans) | N=int(eval(input()))
Z=[list(map(int,input().split())) for i in range(N)]
A,B=list(zip(*Z))
A=list(A[::-1])
B=list(B[::-1])
ans=0
for i in range(N):
A[i]+=ans
if A[i]%B[i]!=0:
a=B[i]-(A[i]%B[i])
ans+=a
print(ans) | p03821 |
n = int(eval(input()))
cnt = 0
a = [0] * n
b = [0] * n
for i in range(n):
a[i], b[i] = list(map(int, input().split()))
for i in range(n - 1, -1, -1):
if a[i] % b[i] != 0:
r = b[i] - a[i] % b[i]
cnt += r
for j in range(i + 1):
a[j] += r
print(cnt)
| n = int(eval(input()))
cnt = 0
a = [0] * n
b = [0] * n
for i in range(n):
a[i], b[i] = list(map(int, input().split()))
for i in range(n - 1, -1, -1):
r = b[i] - (a[i] + cnt) % b[i]
if r != b[i]:
cnt += r
print(cnt)
| p03821 |
N=int(eval(input()))
AB=[list(map(int,input().split())) for i in range(N)][::-1]
count=0
for i in range(N):
AB[i][0]+=count
if AB[i][0]%AB[i][1]!=0:
count+=AB[i][1]-(AB[i][0]%AB[i][1])
print(count) | N=int(eval(input()))
AB=[list(map(int,input().split())) for i in range(N)]
count=0
for a,b in AB[::-1]:
a+=count
if a%b!=0:
count+=b-(a%b)
print(count) | p03821 |
"""
Nは10**5以下。O(N)なら通る
"""
N = int(eval(input()))
A = []
B = []
for i in range(N):
s = list(map(int, input().split()))
A.append(s[0])
B.append(s[1])
count = 0
for i in reversed(list(range(N))):
if A[i] % B[i] == 0:
continue
else:
s = B[i] - (A[i] % B[i])
A... | """
Nは10**5以下。O(N)なら通る
"""
N = int(eval(input()))
A = []
B = []
for i in range(N):
s = list(map(int, input().split()))
A.append(s[0])
B.append(s[1])
count = 0
for i in reversed(list(range(N))):
if (count + A[i]) % B[i] == 0:
continue
else:
s = B[i] - (count + A[i])... | p03821 |
N = int(eval(input()))
A = [None] * N
B = [None] * N
for i in range(1, N+1):
a, b = list(map(int, input().split()))
A[N-i] = a
B[N-i] = b
cnt = 0
for i in range(N):
A_add = A[i] + cnt
r = A_add % B[i]
if r == 0:
pass
else:
cnt += B[i] - r
print(cnt)
| import sys
N = int(eval(input()))
A = [None] * N
B = [None] * N
for i in range(1, N+1):
a, b = list(map(int, sys.stdin.readline().split()))
A[N-i] = a
B[N-i] = b
cnt = 0
for i in range(N):
A_add = A[i] + cnt
r = A_add % B[i]
if r == 0:
pass
else:
cnt += ... | p03821 |
N = int(eval(input()))
AB = [[int(i) for i in input().split()] for j in range(N)]
ans = 0
for i in reversed(list(range(N))):
Atemp = AB[i][0] + ans
ans += (0 if Atemp%AB[i][1] == 0 else AB[i][1]-Atemp%AB[i][1])
print(ans) | import sys
def solve():
input = sys.stdin.readline
N = int(eval(input()))
array = [[int(a) for a in input().split()] for _ in range(N)]
count = 0
for i in reversed(list(range(N))):
a, b = array[i]
if (a + count) % b == 0: continue
else: count += b - ((a + count) %... | p03821 |
N = int(eval(input()))
A = [list(map(int,input().split())) for k in range(N)]
ans = 0
for k in range(N):
A[N-1-k][0] += ans
while A[N-1-k][0]%A[N-1-k][1]!=0:
A[N-1-k][0] += 1
ans += 1
print(ans) | N = int(eval(input()))
A = [list(map(int,input().split())) for k in range(N)]
ans = 0
for k in range(N):
A[N-1-k][0] += ans
if A[N-1-k][0]%A[N-1-k][1]!=0:
d = A[N-1-k][1]*(1+A[N-1-k][0]//A[N-1-k][1])-A[N-1-k][0]
ans += d
A[N-1-k][0] += d
print(ans) | p03821 |
# -*- coding: utf-8 -*-
n = int(eval(input()))
ab = []
for _ in range(n):
a,b = list(map(int, input().split()))
ab.append((a,b))
res = 0
for i in range(n-1,-1,-1):
a,b = ab[i]
a += res
if a%b==0:
pass
elif b>=a:
res += b-a
else:
res += b-a%b
print(re... | # -*- coding: utf-8 -*-
n = int(eval(input()))
ab = []
for _ in range(n):
a,b = list(map(int, input().split()))
ab.append((a,b))
res = 0
for i in range(n-1,-1,-1):
a,b = ab[i]
a += res
if b>=a>0:
res += b-a
elif a%b==0:
pass
else:
res += b-a%b
print(... | p03821 |
n=int(eval(input()))
a=[0]*n;b=a[:]
for i in range(n):
c,d=list(map(int,input().split()))
a[i]=c;b[i]=d
ans=0
for i in range(n)[::-1]:
a[i]+=ans
while a[i]%b[i]!=0:
a[i]+=1
ans+=1
print(ans)
| n=int(eval(input()))
a=[0]*n;b=a[:]
for i in range(n):
c,d=list(map(int,input().split()))
a[i]=c;b[i]=d
ans=0
for i in range(n)[::-1]:
a[i]+=ans
if a[i]%b[i]==0:continue
ans+=b[i]-(a[i]%b[i])
print(ans)
| p03821 |
n = int(eval(input()))
A = []
B = []
for i in range(n):
a, b = list(map(int, input().split()))
A.append(a)
B.append(b)
ans = 0
for i in range(n)[-1::-1]:
val = B[i] - A[i]%B[i]
if val == B[i]:
continue
ans += val
j = 0
while j != i:
A[j] += val
j... | n = int(eval(input()))
A = []
B = []
for i in range(n):
a, b = list(map(int, input().split()))
A.append(a)
B.append(b)
ans = 0
for i in range(n)[-1::-1]:
val = B[i] - (A[i] + ans)%B[i]
if val == B[i]:
continue
ans += val
print(ans) | p03821 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.