input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
def resolve():
N, K = map(int, input().split())
S = input()
# even:1
# odd:0
# 1-0-1-0-1 の配列にする. 両端は1にする
L = []
pre = "1"
cnt = 0
for i in range(N):
if pre == S[i]:
cnt += 1
else:
L.append(cnt)
cnt = 1
pre = S[i]
L.append(cnt)
# 最後が0で終わっていたら、仮の1を付け足す。(値が0なので影響ない)
if pre == "0":
L.append(0)
# 1-0-1-0-1の配列を作成し、K＝2だとする。
# 0を2個含めた個数は, 1＝3、0＝2の長さが作成できる
length = 2 * K + 1
# 0をすべて変換できる
if len(L) <= length:
return print(N)
# 1-0-1-0-1の配列なので間に0を含んだ数え上げ
# なので偶数とびに1を起点に数え上げ
left = 0
right = 0
tmp = 0
# しゃくとり
ans = 0
for i in range(0, len(L), 2):
nextL = i
nextR = min(i + length, len(L))
while nextL > left:
tmp -= L[left]
left += 1
while nextR > right:
tmp += L[right]
right += 1
ans = max(ans, tmp)
print(ans)
if __name__ == "__main__":
resolve()
|
from itertools import accumulate
def resolve():
N, K = map(int, input().split())
S = input()
# even:1
# odd:0
# 1-0-1-0-1 の配列にする. 両端は1にする
L = []
pre = "1"
cnt = 0
for i in range(N):
if pre == S[i]:
cnt += 1
else:
L.append(cnt)
cnt = 1
pre = S[i]
L.append(cnt)
# 最後が0で終わっていたら、仮の1を付け足す。(値が0なので影響ない)
if pre == "0":
L.append(0)
# 1-0-1-0-1の配列を作成し、K＝2だとする。
# 0を2個含めた個数は, 1＝3、0＝2の長さが作成できる
length = 2 * K + 1
# 0をすべて変換できる
if len(L) <= length:
return print(N)
# 1-0-1-0-1の配列なので間に0を含んだ数え上げ
# なので偶数とびに1を起点に数え上げ
# 累積
acc = [0] + list(accumulate(L))
ans = 0
for i in range(0, len(L), 2):
left = i
right = min(i + length, len(L))
tmp = acc[right] - acc[left]
ans = max(ans, tmp)
print(ans)
if __name__ == "__main__":
resolve()
| p03074 |
#--初期の並びを圧縮表示,逆立ち、正立を目印--#
import sys,math,collections,itertools
input = sys.stdin.readline
N,K = list(map(int,input().split()))
S = input().rstrip()
stand = []
s_or_r = []
s_bf = '.'
cnt = 0
for i in range(N):
if s_bf != S[i] and i != 0:
stand.append(cnt)
s_or_r.append(s_bf)
cnt = 1
s_bf=S[i]
else:
cnt += 1
s_bf =S[i]
stand.append(cnt)
s_or_r.append(s_bf)
#--正立kまで許容して足す。maxが答え
if s_or_r.count('0')<=K:
print((len(S)))
exit()
ans = 0
for start in range(len(stand)):
rev = 0
tmp = 0
i=0
flag = 0
while rev+(s_or_r[start+i] == '0')<=K:
tmp += stand[start+i]
if s_or_r[start+i] == '0':
rev += 1
if start + i == len(stand)-1:
flag =1
break
i += 1
ans = max(ans,tmp)
if flag == 1:
break
print(ans)
| #--初期の並びを圧縮表示,逆立ち、正立を目印--#
import sys,math,collections,itertools
input = sys.stdin.readline
N,K = list(map(int,input().split()))
S = input().rstrip()
stand = []
s_or_r = []
s_bf = '.'
cnt = 0
for i in range(N):
if s_bf != S[i] and i != 0:
stand.append(cnt)
s_or_r.append(s_bf)
cnt = 1
s_bf=S[i]
else:
cnt += 1
s_bf =S[i]
stand.append(cnt)
s_or_r.append(s_bf)
#--正立kまで許容して足す。maxが答え
if s_or_r.count('0')<=K:
print((len(S)))
exit()
#--成形==#
if s_or_r[0]=='0':
s_or_r=['1']+s_or_r
stand = [0]+stand
if s_or_r[-1]=='0':
s_or_r.append('1')
stand.append(0)
#初期条件#
tmp = sum(stand[0:2*K+1])
ans = tmp
for i in range(2,len(stand)-2*K,2):
tmp += -(stand[i-1]+stand[i-2])+stand[i+2*K-1]+stand[i+2*K]
ans = max(ans,tmp)
print(ans)
| p03074 |
t,s=open(0)
n,k=list(map(int,t.split()))
l=2*k+1
x=[0]*2+[i+1for i in range(n-1)if s[i]!=s[i+1]]+[n]*l
print((max(x[i+l]-x[i]for i in range(s>'1',len(x)-l,2)))) | t,s=open(0)
n,k=list(map(int,t.split()))
l=2*k+1
x=[0]*2+[i for i in range(1,n)if s[i]!=s[i-1]]+[n]*l
print((max(x[i+l]-x[i]for i in range(s>'1',len(x)-l,2)))) | p03074 |
n, k = list(map(int, input().split()))
s = list(map(int, list(input().strip())))
streaks = []
c = s[0]
i = 1
count = 1
while True:
if i == n:
streaks.append(count)
count = 1
break
if s[i] == c:
i += 1
count += 1
else:
c = s[i]
i += 1
streaks.append(count)
count = 1
start = s[0]
res = []
for i in range(len(streaks)):
x = 0
stop = min(len(streaks), i + 2 * k + start)
for j in range(i, stop):
x += streaks[j]
res.append(x)
start = 1 - start
print((max(res))) | n, k = list(map(int, input().split()))
s = list(input().strip())
streaks = []
c = s[0]
i = 1
count = 1
while True:
if i == n:
streaks.append(count)
break
if s[i] == c:
i += 1
count += 1
else:
streaks.append(count)
c = s[i]
i += 1
count = 1
accs = [0]
for num in streaks:
accs.append(accs[-1] + num)
if accs[-1] != n:
accs.append(n)
flag = s[0] == '0'
res = []
for i in range(len(accs)):
if flag:
index = i + 2 * k
else:
index = i + 2 * k + 1
index = min(index, len(accs) - 1)
res.append(accs[index] - accs[i])
flag = not flag
print((max(res))) | p03074 |
from sys import stdin
from collections import deque
N, K = [int(x) for x in stdin.readline().rstrip().split()]
S = deque([int(x) for x in stdin.readline().rstrip()])
# 0の始点と終点のインデックスリスト
# 始点→終点→始点→終点→...の順
# 従って、必ず偶数個になる（インデックスが偶数の場合は始点で、奇数の場合は終点）
index_list = []
if S[0] == 0:
index_list.append(0)
res = []
for i in range(1, len(S)):
if S[i] != S[i-1]:
if S[i] == 0:
index_list.append(i)
else:
index_list.append(i-1)
if S[-1] == 0:
index_list.append(len(S)-1)
if K < len(index_list) // 2:
for i in range(len(index_list)//2 - K + 1):
start = 0
end = 0
if i == 0:
start = 0
else:
# 1から始まるところ
# index_list[2*i-1]は0の終点のインデックス
start = index_list[2*i-1] + 1
if i == len(index_list)//2 - K:
end = len(S) - 1
else:
# 1で終わるところ
# index_list[2*(i+K)]は0の始点
end = index_list[2*(i+K)] - 1
res.append(end-start+1)
# 全部反転できる
if K >= len(index_list)//2:
res.append(len(S))
print((max(res)))
| from sys import stdin
N, K = [int(x) for x in stdin.readline().rstrip().split()]
# -1は終端
S = [int(x) for x in stdin.readline().rstrip()] + [-1]
# 連続して立っている人のカウント
straight_stand_cnt = 0
if S[0] == 0:
straight_stand_cnt = 1
l = 0
r = 0
ans = -999
while r < N:
# for DEBUG
#print(l, r)
if straight_stand_cnt <= K:
if S[r] == 1 and S[r+1] == 0:
straight_stand_cnt += 1
ans = max(ans, r-l+1)
r += 1
else:
if S[l] == 0 and S[l+1] == 1:
straight_stand_cnt -= 1
l += 1
print(ans)
| p03074 |
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**13
mod = 10**9+7
dd = [(-1,0),(0,1),(1,0),(0,-1)]
ddn = [(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
def pf(s): return print(s, flush=True)
def main():
rr = []
def f(n):
a,b = LS()
a = [int(c) for c in a]
b = [int(c) for c in b]
aa = [a]
ad = set()
ad.add(tuple(a))
r = 0
while True:
r += 1
na = []
for a in aa:
ti = 0
for i in range(r-1,n):
if a[i] != b[i]:
ti = i
break
sa = b[ti] - a[ti]
for j in range(ti+1, n+1):
t = [(a[i] + sa) % 10 if ti <= i < j else a[i] for i in range(n)]
k = tuple(t)
if k in ad:
continue
if t == b:
return r
ad.add(k)
na.append(t)
aa = na
while True:
n = I()
if n == 0:
break
rr.append(f(n))
return '\n'.join(map(str,rr))
print(main())
| import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**13
mod = 10**9+7
dd = [(-1,0),(0,1),(1,0),(0,-1)]
ddn = [(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
def pf(s): return print(s, flush=True)
def main():
rr = []
def f(n):
a,b = LS()
if a == b:
return 0
a = [int(c) for c in a]
b = [int(c) for c in b]
aa = [a]
ad = set()
ad.add(tuple(a))
r = 0
while True:
r += 1
na = []
for a in aa:
ti = 0
for i in range(r-1,n):
if a[i] != b[i]:
ti = i
break
sa = b[ti] - a[ti]
for j in range(ti+1, n+1):
t = [(a[i] + sa) % 10 if ti <= i < j else a[i] for i in range(n)]
k = tuple(t)
if k in ad:
continue
if t == b:
return r
ad.add(k)
na.append(t)
aa = na
while True:
n = I()
if n == 0:
break
rr.append(f(n))
return '\n'.join(map(str,rr))
print(main())
| p01275 |
#!/usr/bin/env python3
from collections import defaultdict
import sys
sys.setrecursionlimit(10**8)
input = sys.stdin.readline
s = input().rstrip()
ans = []
for ch in s:
if ch == "0":
ans.append("0")
elif ch == "1":
ans.append("1")
else:
if len(ans) > 0:
ans.pop()
print(("".join([item for item in ans]))) | #!/usr/bin/env python3
import sys
input = sys.stdin.readline
s = input().rstrip()
ans = []
for ch in s:
if ch in "01":
ans.append(ch)
if ch == "B" and ans:
ans.pop()
print(("".join([item for item in ans]))) | p04030 |
s = str(input())
ans = []
for i in s:
if i == '0':
ans.append('0')
elif i == '1':
ans.append('1')
elif i == 'B':
if ans == []:
continue
else:
ans.pop()
print(*ans, sep='')
| s=input()
data=[]
for i in range(len(s)):
if s[i]=='0':
data.append('0')
elif s[i]=='1':
data.append('1')
else:
if len(data)==0:
continue
else:
data.pop()
print(*data,sep='')
| p04030 |
s = input()
l = list(s)
r = []
for i in l:
if i == "0":
r.append("0")
elif i =="1":
r.append("1")
else:
if r == []:
continue
else:
del r[-1]
print(*r, sep="")
| s = input()
r = []
for i in s:
if i == "B":
if r:
del r[-1]
else:
r.append(i)
print(*r, sep="")
| p04030 |
def gcd(x,y):
while y>0:
x,y = y,x%y
return x
N,M = list(map(int,input().split()))
S = input().strip()
T = input().strip()
a = gcd(N,M)
L = (N//a)*(M//a)*a
ks = L//N
kt = L//M
flag = 0
if S[0]!=T[0]:
flag = 1
else:
b = gcd(ks,kt)
kl = (ks//b)*(kt//b)*b
for i in range(min(N,M)):
if (kl//ks)*i<N and (kl//kt)*i<M and S[(kl//ks)*i]!=T[(kl//kt)*i]:
flag = 1
break
if flag==1:
print((-1))
else:
print(L) | def gcd(x,y):
while y>0:
x,y = y,x%y
return x
N,M = list(map(int,input().split()))
S = input().strip()
T = input().strip()
a = gcd(N,M)
K = (N//a)*M
t = (N//a)*(M//a)
flag = 0
k = 0
while (k*t)//(K//N)<N and (k*t)//(K//M)<M:
if S[(k*t)//(K//N)]!=T[(k*t)//(K//M)]:
flag = 1
break
k += 1
if flag==0:
print(K)
else:
print((-1)) | p03231 |
s = str(eval(input()))
k = int(eval(input()))
t = 0
for i in range(len(s)):
temp = s[i]
if temp == '1':
t += 1
else:
break
if t == 0:
print((s[0]))
else:
if k <= t:
print('1')
else:
print(temp)
| s = str(eval(input()))
k = int(eval(input()))
cnt = 0
for i in range(len(s)):
if s[i] == '1':
cnt += 1
else:
c = s[i]
break
if cnt:
if cnt >= k:
print('1')
else:
print(c)
else:
print(c)
| p03282 |
print((input()[:int(eval(input()))].replace('1','')[:1]or'1')) | print((input()[:int(eval(input()))].replace('1','')[:1]or 1)) | p03282 |
#!/usr/bin/env python3
import sys
import itertools
import collections
import functools
import math
from queue import Queue
# import numpy as np
INF = float("inf")
def solve(S: int, K: int):
n = -1
nc = 1
for i, c in enumerate(str(S)):
if c != "1":
n = i+1
nc = c
break
# print(n, nc, K)
if n == -1:
print((1))
return
if K < n:
print((1))
else:
print(nc)
return
def main():
def iterate_tokens():
for line in sys.stdin:
for word in line.split():
yield word
tokens = iterate_tokens()
S = int(next(tokens)) # type: int
K = int(next(tokens)) # type: int
solve(S, K)
if __name__ == '__main__':
main()
| #!/usr/bin/env python3
import sys
INF = float("inf")
def solve(S: str, K: int):
for i in range(K):
if S[i] != "1":
c = S[i]
break
else:
print((1))
return
print(c)
return
def main():
def iterate_tokens():
for line in sys.stdin:
for word in line.split():
yield word
tokens = iterate_tokens()
S = str(next(tokens)) # type: str
K = int(next(tokens)) # type: int
solve(S, K)
if __name__ == '__main__':
main()
| p03282 |
# ARC095C - Many Medians (ABC094C)
def main():
n = int(eval(input()))
x = list(map(int, input().rstrip().split()))
l, h = sorted(x)[n // 2 - 1 : n // 2 + 1]
for i in x:
if i <= l:
print(h)
else:
print(l)
if __name__ == "__main__":
main() | # ARC095C - Many Medians (ABC094C)
def main():
n = int(eval(input()))
x = tuple(map(int, input().rstrip().split()))
l, h = sorted(x)[n // 2 - 1 : n // 2 + 1]
for i in x:
if i <= l:
print(h)
else:
print(l)
if __name__ == "__main__":
main() | p03381 |
def binsearch(x,value):
left=0; right=len(x)-1
if x[right] == value:
return right
elif x[left] == value:
return left
while True:
m = (right+left)//2
if x[m] == value:
return m
elif x[m] > value:
right = m
else:
left = m
def main():
n = int(eval(input()))
x = [int(i) for i in input().split()]
newx = sorted(x)
for i in x:
index = binsearch(newx,i)
del newx[index]
print((newx[(n-1)//2]))
newx.insert(index,i)
if __name__ == '__main__':
main()
| def main():
n = int(eval(input()))
x = [int(i) for i in input().split()]
newx = sorted(x)
ans = dict()
for i,xx in enumerate(newx):
if i+1 <= n//2:
ans[xx] = newx[n//2]
else:
ans[xx] = newx[n//2-1]
for xx in x:
print((ans[xx]))
if __name__ == '__main__':
main()
| p03381 |
import statistics
N=int(eval(input()))
X=list(map(int, input().split()))
for i in range(0,N):
print((statistics.median(X[:i]+X[i+1:]))) | N=int(eval(input()))
X=list(map(int, input().split()))
sortX=sorted(X)
small=sortX[int(N/2)-1]
big=sortX[int(N/2)]
if small==big:
for i in range(0,N):
print(small)
exit()
for i in range(0,N):
if X[i]>small:
print(small)
else:
print(big) | p03381 |
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)
##############################
N = int(eval(input()))
X = list(map(int, input().split()))
for i in range(N):
x = X[0:i]+X[i+1:]
x.sort(reverse=True)
# print(x)
print(( x[((len(x)+1) // 2)-1] ))
|
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)
##############################
N = int(eval(input()))
X = list(map(int, input().split()))
x = X[:]
x.sort()
m1 = x[N//2 - 1]
m2 = x[N//2]
for a in X:
if a <= m1:
print(m2)
else:
print(m1) | p03381 |
from statistics import mean, median,variance,stdev
n = int(eval(input()))
x = list(map(int, input().split()))
for i in range(n):
print((median(x[:i]+x[i+1:])))
|
n = int(eval(input()))
x = list(map(int, input().split()))
x_sort = x.copy()
x_sort.sort()
row = x_sort[n//2 - 1]
high = x_sort[n//2]
for i in range(n):
if x[i] <= row:
print(high)
else:
print(row)
| p03381 |
def median(lista):
lista = sorted(lista)
return lista[int((len(lista)+ 1)/ 2)- 1]
N = int(eval(input()))
lista = list(map(int, input().split()))
for i in range(N):
if(i == 0):
newlista = lista[1:]
elif(i == N- 1):
newlista = lista[:N- 1]
else:
newlista = lista[:i]+ lista[i+ 1:]
print((median(newlista))) | N = int(eval(input()))
lista = list(map(int, input().split()))
newlista = sorted(lista)
lowermedian = newlista[int(len(lista)/ 2- 1)]
highermedian = newlista[int(len(lista)/2)]
for i in range(N):
if(lista[i] <= lowermedian):
print(highermedian)
else:
print(lowermedian) | p03381 |
n=int(eval(input()));*a,=list(map(int,input().split()))
for i in range(n):print((sorted(a[:i]+a[-~i:])[~-n//2])) | n=int(eval(input()));*a,=list(map(int,input().split()));b=sorted(a);l,m=b[n//2-1],b[n//2]
for x in a:print(([l,m][x<m])) | p03381 |
n = int(eval(input()))
x = list(map(int, input().split()))
xs = sorted(x)
a = xs[n // 2 - 1]
b = xs[n // 2]
for i in range(n):
if xs.index(x[i]) < n // 2:
print(b)
else:
print(a) | n = int(eval(input()))
x = list(map(int, input().split()))
xs = sorted(x)
a = xs[n // 2 - 1]
b = xs[n // 2]
for i in x:
if i <= a:
print(b)
else:
print(a) | p03381 |
N = int(eval(input()))
X = input().split()
for i in range(N):
x2 = [int(x) for x in X]
del x2[i]
x2.sort()
print(("%d"%x2[int((N/2)-1)])) | N = int(eval(input()))
X = input().split()
x1 = [int(x) for x in X]
x2 = [int(x) for x in X]
x2.sort()
ml = x2[int((N/2)-1)]
mr = x2[int(N/2)]
for i in range(N):
if x1[i] <= ml:
print(("%d"%mr))
else:
print(("%d"%ml))
| p03381 |
# -*- coding: utf-8 -*-
"""
Contents : AtCoder Regular Contest 095 c問題
Author : Kitaura Hiromi
LastUpdate : 20180414
Since : 20180414
"""
import random
import copy
def quickselect(items, item_index):
def select(lst, l, r, index):
# base case
if r == l:
return lst[l]
# choose random pivot
pivot_index = random.randint(l, r)
# move pivot to beginning of list
lst[l], lst[pivot_index] = lst[pivot_index], lst[l]
# partition
i = l
for j in range(l+1, r+1):
if lst[j] < lst[l]:
i += 1
lst[i], lst[j] = lst[j], lst[i]
# move pivot to correct location
lst[i], lst[l] = lst[l], lst[i]
# recursively partition one side only
if index == i:
return lst[i]
elif index < i:
return select(lst, l, i-1, index)
else:
return select(lst, i+1, r, index)
if items is None or len(items) < 1:
return None
if item_index < 0 or item_index > len(items) - 1:
raise IndexError()
return select(items, 0, len(items) - 1, item_index)
N = int(eval(input()))
X = list(map(int, input().split(" ")))
med1 = quickselect(copy.deepcopy(X), N//2-1)
med2 = quickselect(copy.deepcopy(X), N//2)
for i in range(N):
if X[i] <= med1:
print(med2)
else:
print(med1) | # -*- coding: utf-8 -*-
"""
Contents : AtCoder Regular Contest 095 c問題
Author : Kitaura Hiromi
LastUpdate : 20180414
Since : 20180414
"""
import random
import copy
N = int(eval(input()))
X = list(map(int, input().split(" ")))
sorted_X = sorted(X)
med1 = sorted_X[N//2-1]
med2 = sorted_X[N//2]
for i in range(N):
if X[i] <= med1:
print(med2)
else:
print(med1) | p03381 |
# coding: utf-8
import sys
import copy
# 標準入力
n = int(sys.stdin.readline().strip())
xArray = list(map(int, sys.stdin.readline().strip().split(" ")))
result = []
# 演算処理
for i in range(n):
tmp = copy.copy(xArray)
del tmp[i]
tmp = sorted(tmp)
result.append(tmp[int((n/2) - 1)]) # (l + 1)/2 の要素を参照
# 標準出力
print(('\n'.join(map(str, result))))
| # coding: utf-8
import sys
import copy
# 標準入力
n = int(sys.stdin.readline().strip())
xArray = list(map(int, sys.stdin.readline().strip().split(" ")))
result = []
sortedArray = sorted(xArray)
# 中央値を算出する
for i in range(n):
middle = sortedArray[int((n / 2) - 1)]
if (middle >= xArray[i]):
result.append(sortedArray[int(n / 2)])
else:
result.append(middle)
# 標準出力
print(('\n'.join(map(str, result))))
| p03381 |
N = int(eval(input()))
X = list(map(int, input().split()))
L = []
for i in range(N):
L.append([X[i], i])
L.sort()
for i in range(N):
if i < N // 2:
L[i].append(L[N // 2][0])
else:
L[i].append(L[N // 2 - 1][0])
for i in range(N):
L[i][0], L[i][1] = L[i][1], L[i][0]
L.sort()
for i in range(N):
print((L[i][2])) | N = int(eval(input()))
X = list(map(int, input().split()))
L = [0 for _ in range(N)]
for i in range(N):
X[i] = X[i] * N + i
X.sort()
d = N // 2
for i in range(N):
if i < d:
L[X[i]%N] = X[d] // N
else:
L[X[i]%N] = X[d-1] // N
for i in range(N):
print((L[i])) | p03381 |
A, B, C, K = list(map(int, input().split()))
if A == B:
print((0))
else:
for _ in range(K):
tmp_A = B + C
tmp_B = A + C
C = A + B
A = tmp_A
B = tmp_B
if A - B >= 10 ** 18:
print(Unfair)
break
else:
print((A-B)) | A, B, C, K = list(map(int, input().split()))
if K % 2 == 1:
print((B-A))
elif K % 2 == 0:
print((A-B)) | p03345 |
A, B, C, K = list(map(int, input().split()))
if K % 2 == 1:
print((B-A))
elif K % 2 == 0:
print((A-B)) | A, B, C, K = list(map(int, input().split()))
if K % 2 == 1:
print((B-A))
elif K % 2 == 0:
print((A-B))
else:
print('Unfair') | p03345 |
def change(A,B,C):
move=True
a=A
b=B
c=C
A=b+c
B=a+c
C=a+b
if B-A==b-a:
move=False
return A,B,C,move
A,B,C,K=list(map(int,input().split()))
ans=A-B
for i in range(K):
A,B,C,move=change(A,B,C)
ans=A-B
if abs(ans)>1000000000000000000:
print("Unfair")
break
elif not(move):
print(ans)
break
else:
print(ans) | A,B,C,K=list(map(int,input().split()))
if K%2==0:
ans=A-B
else:
ans=B-A
if ans>1000000000000000000:
ans="Unfair"
print(ans) | p03345 |
import sys
def input(): return sys.stdin.readline().strip()
def mapint(): return list(map(int, input().split()))
sys.setrecursionlimit(10**9)
A, B, C, K = mapint()
for _ in range(K):
A, B, C = B+C, A+C, A+B
if abs(A-B)>10**18:
print('Unfair')
break
if A-B==0:
print((0))
break
else:
print((A-B)) | import sys
def input(): return sys.stdin.readline().strip()
def mapint(): return list(map(int, input().split()))
sys.setrecursionlimit(10**9)
A, B, C, K = mapint()
if K%2==0:
print((A-B))
else:
print((B-A)) | p03345 |
A, B, C, K = list(map(int, input().split()))
ans = A - B
if K%2==1:
ans = -ans
if abs(ans) > 10**18:
ans = "Unfair"
print(ans) | A, B, C, K = list(map(int, input().split()))
ans = A - B
if K%2==1:
ans = -ans
print(ans) | p03345 |
a, b, c, k = list(map(int, input().split()))
limit = pow(10, 18)
ans = 0
unfair = False
for v in range(k):
if a == b and b == c:
break
na = b + c
nb = a + c
nc = a + b
a = na
b = nb
c = nc
ans = a - b
if abs(ans) > limit:
print("Unfair")
else:
print(ans)
| a, b, c, k = list(map(int, input().split()))
if k % 2 == 0:
print((a - b))
else:
print((b - a)) | p03345 |
a,b,c,k=list(map(int,input().split()))
if k%2==0:
print((a-b))
else:
print((b-a)) | a,b,c,k = list(map(int, input().split()))
if k % 2:
print((b - a))
else:
print((a - b)) | p03345 |
import copy
a,b,c,k = list(map(int,input().split()))
if a == b == c:
print((0))
exit()
cnt = 0
while True:
if cnt >= k:
print((a - b))
break
aa = copy.deepcopy(a)
bb = copy.deepcopy(b)
cc = copy.deepcopy(c)
a = bb + cc
b = aa+cc
c = aa + bb
cnt += 1
if abs(a-b) >= 10**18:
print('Unfair')
break
| a,b,c,k = list(map(int,input().split()))
x = abs(a-b)
if x > 10**18:
print('Unfair')
else:
if k % 2 == 0:
print((a - b))
else:
print((b-a)) | p03345 |
#-*-coding:utf-8-*-
import sys
input=sys.stdin.readline
def main():
a,b,c,k = list(map(int,input().split()))
high=a
middle=b
low=c
count=0
while count<k:
if abs(high-middle) >10**18:
print("Unfair")
exit()
elif a == b == c:
print((0))
exit()
high = b+c
middle = a+c
low = a+b
a=high
b=middle
c=low
count+=1
print((high-middle))
if __name__=="__main__":
main() | #-*-coding:utf-8-*-
import sys
input=sys.stdin.readline
def main():
a,b,c,k = list(map(int,input().split()))
if abs(a-b)>10**18:
print("Unfair")
elif k % 2==0:
print((a-b))
else:
print((b-a))
if __name__=="__main__":
main() | p03345 |
s = input().rstrip().split()
a = int(s[0])
b = int(s[1])
c = int(s[2])
k = int(s[3])
for i in range(k):
n_a = b+c
n_b = a+c
n_c = a+b
a = n_a
b = n_b
c = n_c
if(a == b and b == c ):
break
d = a - b
if(abs(d) < 100000000):
print((a-b))
else:
print("Unfair") | s = input().rstrip().split()
a = int(s[0])
b = int(s[1])
c = int(s[2])
k = int(s[3])
ans = a - b
if(k%2==1):
ans = -1 * ans
if(abs(ans) < 1000000000000000000):
print(ans)
else:
print("Unfair") | p03345 |
A, B, C, K = list(map(int, input().split()))
for _ in range(K):
if A == B == C:
break
A, B, C = B + C, A + C, A + B
if abs(A - B) > 10 ** 18:
print('Unfair')
else:
print((A-B)) | A, B, C, K = list(map(int, input().split()))
o = B - A
e = A - B
if K % 2 == 0:
r = e
else:
r = o
print(r) | p03345 |
A, B, C, K = list(map(int, input().split()))
for i in range(K):
tmpA = B + C
tmpB = A + C
tmpC = A + B
A = tmpA
B = tmpB
C = tmpC
if A == B and B == C:
break
if (A - B) >= 10**18:
print("Unfair")
else:
print((A - B)) | A, B, C, K = list(map(int, input().split()))
if K % 2 == 0:
print((A - B))
else:
print((B - A)) | p03345 |
a, b, c, k = list(map(int, input().split()))
if k%2==0:
if b-a < 10**18:
print((a-b))
else:
print("Unfair")
else:
if a-b < 10**18:
print((b-a))
else:
print("Unfair") | a,b,_c,k=list(map(int,input().split()))
if k%2==0:print((a-b))
else:print((b-a)) | p03345 |
#!/usr/bin/env python3
def main():
A, B, C, K = list(map(int, open(0).read().split()))
flag = True
for i in range(0, K):
if abs(A - B) > 10**18:
print('Unfair')
flag = False
break
elif A == B == C:
print((0))
flag = False
break
else:
tmpA = B + C
tmpB = A + C
tmpC = A + B
A = tmpA
B = tmpB
C = tmpC
if flag:
print((A - B))
main() | #!/usr/bin/env python3
def main():
A, B, C, K = list(map(int, open(0).read().split()))
if abs(A - B) > 10**18:
print('Unfair')
else:
if K % 2:
print((B - A))
else:
print((A - B))
main() | p03345 |
A,B,C,K = list(map(int,input().split()))
if A == B == C:
print((0))
exit()
for _ in range(K):
A,B,C = B+C,A+C,A+B
ans = abs(A-B)
if ans > 10**18:
print('Unfair')
exit()
print((A-B)) | A,B,C,K = list(map(int,input().split()))
ans = A-B
if abs(ans) > 10**18:
ans = 'Unfair'
else:
if K%2 != 0:
ans = B-A
print(ans) | p03345 |
a,b,c,k=list(map(int,input().split()))
if a==b==c:
print((0))
exit()
for i in range(k):
A=c+b;B=a+c;C=a+b
a=A;b=B;c=C
if abs(a-b)>10**18:
print("Unfair")
else:
print((a-b)) | a,b,c,k=list(map(int,input().split()))
if a==b==c:
print((0))
exit()
elif abs(a-b)>10**18:
print("Unfair")
elif k%2==1:
print((b-a))
else:
print((a-b)) | p03345 |
N = [int(i) for i in input().split()]
A = N[0]
B = N[1]
C = N[2]
K = N[3]
if A == B == C:
print((0))
else:
for i in range(K):
NA = B + C
NB = A + C
NC = A + B
A = NA
B = NB
C = NC
if abs(A-B) > 10 ** 18:
print('Unfair')
else:
print((A-B)) | N = [int(i) for i in input().split()]
A = N[0]
B = N[1]
C = N[2]
K = N[3]
if K % 2 == 0:
if abs(A - B) > 10 ** 18:
print('Unfair')
else:
print((A - B))
else :
if abs(A - B) > 10 ** 18:
print('Unfair')
else:
print((B - A)) | p03345 |
a,b,c,k = list(map(int,input().split()))
if a == b:
print((0))
exit()
for i in range(k):
a_o = a
b_o = b
c_o = c
a = b_o + c_o
b = a_o + c_o
c = a_o + b_o
if abs(a-b) > 10**18:
print("Unfair")
break
print((a-b))
| a,b,c,k = list(map(int,input().split()))
ans = a - b
if k % 2 == 0:
print(ans)
else:
print((-ans)) | p03345 |
A, B, C, K = list(map(int, input().split()))
for i in range(K):
if A == B and B == C:
break
next_A = B + C
next_B = A + C
next_C = A + B
A = next_A
B = next_B
C = next_C
if abs(A - B) > 10**18:
print('Unfair')
else:
print((A - B)) | A, B, C, K = list(map(int, input().split()))
if abs(A - B) > 10**18:
print('Unfair')
else:
print(((A -B)*(-1)**K)) | p03345 |
A, B, C, K = list(map(int, input().split()))
if A == B == C:
print((0))
exit()
for i in range(K):
nA = B + C
nB = A + C
nC = A + B
A, B, C = nA, nB, nC
if abs(A - B) >= int(1e18):
print("Unfair")
break
else:
print((A - B)) | A, B, C, K = list(map(int, input().split()))
if K % 2 == 0:
if abs(A - B) >= int(1e18):
print("Unfair")
else:
print((A - B))
else:
if abs(A - B) >= int(1e18):
print("Unfair")
else:
print((B - A)) | p03345 |
A, B, C, K = list(map(int,input().split()))
ans = 0
if A == B == C:
ans = 0
K = 0
while K > 0:
a = A
b = B
c = C
A = b + c
B = a + c
C = a + b
K -= 1
ans = A - B
if abs(ans) > 10 ** 18:
ans = 10 ** 18
print(ans) | A, B, C, K = list(map(int,input().split()))
ans = A - B
if abs(ans) > 10 ** 18:
print('Unfair')
elif K % 2 == 1:
ans *= -1
print(ans)
else:
print(ans) | p03345 |
a, b, c, k = list(map(int, input().split()))
flag = True
for i in range(10**18):
if k == 0:
break
if a == b and b == c:
break
A = a
B = b
C = c
a = B + C
b = A + C
c = A + B
if i == k - 1:
break
if a - b > 10**18 or a-b < -10**18:
flag = False
break
if flag:
print((a - b))
else:
print('Unfair')
| a, b, c, k = list(map(int, input().split()))
x = a - b
if x > 10**18:
print('Unfair')
elif k % 2 == 0:
print(x)
else:
print((-x)) | p03345 |
A, B, C, K = list(map(int, input().split()))
if A == B == C:
print((0))
else:
x = 10**18
for _ in range(K):
a = B+C
b = A+C
c = A+B
A=a
B=b
C=c
if A - B > x:
print("Unfair")
break
else:
print((A-B)) | A, B, C, K = list(map(int, input().split()))
if K % 2 == 0:
print((A-B))
else:
print((B-A)) | p03345 |
a,b,c,k = list(map(int,input().split()))
if k % 2 == 0:
print((a-b))
else:
print((b-a)) | a,b,c,k = list(map(int,input().split()))
print(((a-b)*(-1)**(k%2)))
| p03345 |
a, b, c, k = list(map(int, input().split()))
if a == b == c:
print((0))
exit()
for i in range(k):
tmp1 = a+b
tmp2 = b+c
tmp3 = c+a
a = tmp2
b = tmp3
c = tmp1
if a-b > 10**18:
print('Unfair')
exit()
print((a-b))
| a, b, c, k = list(map(int, input().split()))
if a == b == c:
print((0))
elif a-b > 10**18:
print('Unfair')
else:
if k % 2 == 0:
print((a-b))
else:
print((b-a))
| p03345 |
list1 = list(map(int, input().split()))
a = list1[0]
b = list1[1]
c = list1[2]
k = list1[3]
pointH =a
pointM =b
pointL =c
if a ==b and b ==c:
print((0))
else:
index =0
while index<k:
list2 = [pointM+pointL,pointL+pointH,pointH+pointM]
pointH = list2[0]
pointM = list2[1]
pointL = list2[2]
index+=1
if pointH-pointM>10**18:
print("Unfair")
else:
print((pointH-pointM)) | list1 = list(map(int, input().split()))
a = list1[0]
b = list1[1]
c = list1[2]
k = list1[3]
if k%2 ==0:
ans = a-b
else:
ans = b-a
if ans>10**18:
print("Unfair")
else:
print(ans) | p03345 |
A, B, C, K = list(map(int, input().split()))
if A==B and B==C:
ans = 0
else:
for i in range(K):
A, B, C = B+C, A+C, A+B
if abs(A-B)>10**18:
break
ans = A-B
if abs(ans)>10**18:
print("Unfair")
else:
print(ans) | A, B, C, K = list(map(int, input().split()))
if K%2==1:
print((-A+B))
else:
print((A-B)) | p03345 |
A,B,C,K = list(map(int,input().split()))
print((B-A if K%2 else A-B))
| A,B,C,K = list(map(int,input().split()))
if K%2:
print((B-A))
else:
print((A-B)) | p03345 |
A,B,C,K = list(map(int,input().split()))
if K%2:
print((B-A))
else:
print((A-B)) | A,B,C,K = list(map(int,input().split()))
print((B-A if K%2 else A-B)) | p03345 |
A, B, C, K = list(map(int, input().split()))
def judge(n):
if abs(n) > 10**18:
print('Unfair')
else:
print(n)
if K == 0:
judge(A-B)
else:
if A == B and B == C and C == A :
print((0))
else:
sum = A + B + C
for i in range(1, K+1):
sum *= K
A = sum - A
B = sum - B
judge(A-B) | A, B, C, K = list(map(int, input().split()))
def judge(n):
if abs(n) > 10**18:
print('Unfair')
else:
print(n)
if K % 2 == 0:
judge(A-B)
else:
judge(B-A) | p03345 |
inputs = list(map(int, input().split()))
K = inputs.pop()
if inputs[0] == inputs[1] == inputs[2]:
print((0))
else:
for k in range(K):
total = sum(inputs)
inputs = [total-inputs[i] for i in range(3)]
if abs(inputs[0] - inputs[1]) > 10 ** 18:
print((-1))
break
else:
print((inputs[0] - inputs[1]))
| inputs = list(map(int, input().split()))
K = inputs.pop()
ans = inputs[0] - inputs[1]
print((-1 if abs(ans) > 10 ** 18 else ans * ((-1)**K)))
| p03345 |
a,b,c,k = list(map(int, input().split()))
ans = 0
if a==b:
ans = 0
else:
for i in range(k):
a1 = b+c
b1 = c+a
c1 = a+b
a = a1
b = b1
c = c1
if abs(a-b)>=10**18:
ans = 'Unfair'
else:
ans = a-b
print(ans) | a,b,c,k = list(map(int, input().split()))
print((0 if a==b else a-b if k%2==0 else b-a)) | p03345 |
import sys
from functools import lru_cache
A, B, C, K = list(map(int, input().split()))
@lru_cache(maxsize=None)
def operation(A, B, C):
return(B+C, C+A, A+B)
if (A==B) & (B==C):
print((0))
sys.exit()
for _ in range(K):
A, B, C = operation(A, B, C)
if A - B > 10**18:
print("Unfair")
sys.exit()
print((A - B)) | A, B, C, K = map(int, input().split())
print(A-B) if K%2==0 else print(B-A)
| p03345 |
a,b,c,K=list(map(int,input().split()))
if a==b and b==c:
print("0")
exit()
for i in range(K):
an=a
bn=b
cn=c
a=bn+cn
b=an+cn
c=an+bn
S=a-b
if a-b>=10**18:
print("Unfair")
exit()
print((a-b)) | a,b,c,K=list(map(int,input().split()))
print(((a-b)*((-1)**K))) | p03345 |
inf = 10**18
A,B,C,K = list(map(int,input().split(" ")))
if K % 2 == 1:
if (B-A) > inf:
print("Unfair")
else:
print((B-A))
else:
if (A-B) > inf:
print("Unfair")
else:
print((A-B)) | A,B,C,K = list(map(int,input().split(" ")))
if K % 2 == 1:
print((B-A))
else:
print((A-B))
| p03345 |
a,b,c,k=list(map(int,input().split()))
n1=1
n2=0
if a==b:print((0));exit()
for i in range(k):
n1,n2=n2*2,n1+n2
if abs((n1-n2)*(a-b))>10**18:print("Unfair");exit()
print(((n1-n2)*(a-b))) | a,b,c,k=list(map(int,input().split()))
t=-1
if k%2==0:t=1
print((t*(a-b))) | p03345 |
n=eval(input())
a=input()
count=0
for r in range(n):
b=input()
lb=len(b)
flag=0
for s in range(lb):
for i in range(lb-(s+1)*(len(a)-1)):
if b[i:i+(s+1)*len(a):s+1]==a:
count+=1
flag=1
break
if flag==1:break
print(count)
| n=eval(input())
a=input()
la=len(a)
count=0
for r in range(n):
b=input()
lb=len(b)
flag=0
for skip in range(lb):
for ini in range(lb-(skip+1)*(la-1)):
if b[ini:ini+(skip+1)*la:skip+1]==a:
count+=1
flag=1
break
if flag==1:break
print(count)
| p00501 |
n = eval(input())
s = input()
cnt = 0
for i in range(n):
judge = False
p = input()
for k in range(len(p)):
for j in range(1, len(p)):
for l in range(len(s)):
if k+l*j < len(p) and p[k+l*j] == s[l]:
if l+1 >= len(s): judge = True
continue
break
if judge == True: cnt += 1
print(cnt) | n = eval(input())
s = input()
cnt = 0
for i in range(n):
judge = False
p = input()
for k in range(len(p)):
if judge: break
for j in range(1, len(p)):
if judge: break
for l in range(len(s)):
if k+l*j < len(p) and p[k+l*j] == s[l]:
if l+1 >= len(s): judge = True
continue
break
if judge == True: cnt += 1
print(cnt) | p00501 |
import sys
def LI():
return list(map(int,sys.stdin.readline().rstrip().split())) #空白あり
k,q = LI()
d = LI()
from itertools import accumulate
for _ in range(q):
n,x,m = LI()
e = [0] + [d[i] % m for i in range(k)]
f = list(accumulate(e))
g = [0] + [d[i] % m == 0 for i in range(k)]
h = list(accumulate(g))
p = (n-1) // k
r = (n-1) % k
print((n - 1 - p*h[k] - h[r] - (p*f[k] + f[r] + x % m) // m))
| import sys
def LI():
return list(map(int,sys.stdin.readline().rstrip().split())) #空白あり
k,q = LI()
d = LI()
from itertools import accumulate
for _ in range(q):
n,x,m = LI()
e = [0] + [d[i] % m for i in range(k)]
f = list(accumulate(e))
g = [0] + [d[i] % m == 0 for i in range(k)]
h = list(accumulate(g))
p,r = divmod(n - 1,k)
print((n - 1 - p*h[k] - h[r] - (p*f[k] + f[r] + x % m) // m))
| p02770 |
import bisect
import sys
stdin = sys.stdin
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().rstrip() # ignore trailing spaces
K, Q = na()
d = na()
# K, Q = 2, 1000
# d = [1, 2]
u = [0] * (K+1)
for i in range(1, K+1):
u[i] = u[i - 1] + d[i%K]
import math
# count ax < k (mod p), 0 <= x < n
def countle(l, r, a, n, p):
if l == r:
return 0
if n == 0:
return 0
a %= p
# naive = 0
# ans = 0
# for i in range(n):
# x = a*i%p
# if l < r:
# if l <= x and x < r:
# ans += 1
# else:
# if x < r or l <= x:
# ans += 1
s = min(n, int(math.sqrt(n)))
# s = int(math.sqrt(n))
comb = []
q = 0
for i in range(s):
comb.append(q)
q += a
if q >= p:
q -= p
comb.sort()
# print(p, comb)
ll, rr = l, r
ret = 0
b = a * s % p
for u in range(n//s):
num = bisect.bisect_left(comb, r) - bisect.bisect_left(comb, l)
if r < l:
num += s
ret += num
# print(comb, l, r, num)
l -= b
r -= b
if l < 0:
l += p
if r < 0:
r += p
if ll < rr:
t = a*(n//s*s) % p
for i in range(n//s*s, n):
if ll <= t < rr:
ret += 1
t += a
if t >= p:
t -= p
else:
t = a*(n//s*s) % p
for i in range(n // s * s, n):
if t < rr or ll <= t:
ret += 1
t += a
if t >= p:
t -= p
# print(ret, ans)
# assert ret == ans
return ret
# 2 3 5 7
# 0 2 3 5: 3
# 2 4 5 0: 2
# 4 6 0 2: 2
# 6 1 2 4
# a+k < b+k (mod p)
# a < bなら、k in [-a,p-1-b]
# a > bなら、k in [p-a, p-1-b]
# [-a,-1-b][-b, ...]
# a = bなら無
for z in range(Q):
n, x, m = na()
# n, x, m = 10+z, 1+z, 5+z
# 36, 27, 31
# 32, 33, 26
# d0 = x
# ex = 0
# for i in range(n-1):
# d1 = d0 + d[i%K]
# if d0 % m < d1 % m:
# ex += 1
# d0 = d1
n -= 1
rem = n%K
pre = m-1
x %= m
ans = 0
for i in range(rem):
pre = x
x = (x + d[i]) % m
if pre < x:
ans += 1
# print(x, n, K, rem, ans)
l = [0]
# print(d[rem:] + d[:rem])
for v in d[rem:] + d[:rem]:
l.append((l[-1] + v) % m)
# print(l)
turn = 0
for i in range(len(l)-1):
# if m-l[i+1] > m-1-l[i]
if l[i] < l[i+1]:
turn += 1
last = m-1-l[-1]
if 0 == (last+1) % m:
turn += 1
# 0 3 6 ... 48 31
# 0 3 6 9 12 15 18 21 24 27 30 33 36 39 42 45 48
# % 31 0 <= <= 2
# print(ans, turn, last, -x%m, (-x+last+1)%m, l[-1], n//K)
le = countle(-x%m, (-x+last+1)%m, l[-1], n//K, m)
# print(le)
ans += le*turn + (n//K-le)*(turn-1)
print(ans)
# assert ans == ex
# x = turn - (start > last ? 1 : 0)
| import sys
stdin = sys.stdin
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().rstrip() # ignore trailing spaces
K, Q = na()
d = na()
# K, Q = 2, 1000
# d = [1, 2]
u = [0] * (K+1)
for i in range(1, K+1):
u[i] = u[i - 1] + d[i%K]
for z in range(Q):
n, x, m = na()
n -= 1
rem = n%K
pre = m-1
x %= m
ans = 0
for i in range(rem):
pre = x
x = (x + d[i]) % m
if pre < x:
ans += 1
# print(x, n, K, rem, ans)
l = [0]
# print(d[rem:] + d[:rem])
for v in d[rem:] + d[:rem]:
l.append((l[-1] + v) % m)
# print(l)
turn = 0
for i in range(len(l)-1):
if l[i] < l[i+1]:
turn += 1
my = turn*m - l[-1]
# print(turn, m, my, n//K, x)
ans += (my * (n//K) + m-x-1) // m - (m-x-1)//m
print(ans)
| p02770 |
import sys
stdin = sys.stdin
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().rstrip() # ignore trailing spaces
K, Q = na()
d = na()
# K, Q = 2, 1000
# d = [1, 2]
u = [0] * (K+1)
for i in range(1, K+1):
u[i] = u[i - 1] + d[i%K]
for z in range(Q):
n, x, m = na()
n -= 1
rem = n%K
pre = m-1
x %= m
ans = 0
for i in range(rem):
pre = x
x = (x + d[i]) % m
if pre < x:
ans += 1
# print(x, n, K, rem, ans)
l = [0]
# print(d[rem:] + d[:rem])
for v in d[rem:] + d[:rem]:
l.append((l[-1] + v) % m)
# print(l)
turn = 0
for i in range(len(l)-1):
if l[i] < l[i+1]:
turn += 1
my = turn*m - l[-1]
# print(turn, m, my, n//K, x)
ans += (my * (n//K) + m-x-1) // m - (m-x-1)//m
print(ans)
| import sys
stdin = sys.stdin
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().rstrip() # ignore trailing spaces
K, Q = na()
d = na()
for z in range(Q):
n, x, m = na()
n -= 1
rem = n%K
pre = m-1
x %= m
ans = 0
for i in range(rem):
pre = x
x = (x + d[i]) % m
if pre < x:
ans += 1
lpre = 0
turn = 0
# print(d[rem:] + d[:rem])
for v in d[rem:] + d[:rem]:
cur = (lpre + v) % m
if lpre < cur:
turn += 1
lpre = cur
my = turn*m - lpre
# print(turn, m, my, n//K, x)
ans += (my * (n//K) + m-x-1) // m - (m-x-1)//m
print(ans)
| p02770 |
#!/usr/bin/env python3
import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7
inf = float('inf')
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
k,q = LI()
d = LI()
nxm = [LI() for _ in range(q)]
for n,x,m in nxm:
e = list([x%m for x in d])
zero = e.count(0)
zero = zero*((n-1)//k)
for i in range((n-1)%k):
if e[i] == 0:
zero += 1
f = list(accumulate(e))
s = f[-1] * ((n-1)//k)
if (n-1)%k != 0:
s += f[(n-1)%k-1]
tmp = (s+x%m)//m
print((n-1-zero-tmp))
| #!/usr/bin/env python3
import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7
inf = float('inf')
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
k,q = LI()
d = LI()
nxm = [LI() for _ in range(q)]
for n,x,m in nxm:
e = list([(x-1)%m+1 for x in d])
f = list(accumulate(e))
s = f[-1] * ((n-1)//k)
if (n-1)%k != 0:
s += f[(n-1)%k-1]
tmp = (s+x%m)//m
print((n-1-tmp))
| p02770 |
import sys
input = sys.stdin.readline
k, q = list(map(int, input().split()))
d = list(map(int, input().split()))
query = []
for _ in range(q):
query.append(list(map(int, input().split())))
for n, x, m in query:
l = [d[i]%m for i in range(k)]
n -= 1
zero = l.count(0)
count = n // k
zero_total = zero*count
rem = n % k
total = sum(l)%m * count + x%m + sum(l[:rem])
total //= m
total += sum(l)//m * count
zero_total += l[:rem].count(0)
print((n-total-zero_total))
| import sys
input = sys.stdin.readline
k, q = list(map(int, input().split()))
d = list(map(int, input().split()))
query = []
for _ in range(q):
query.append(list(map(int, input().split())))
def answer_query(n, x, m):
l = [d[i]%m for i in range(k)]
n -= 1
zero = l.count(0)
count = n // k
zero_total = zero*count
rem = n % k
s = sum(l)
total = s%m * count + x%m
for i in range(rem):
total += l[i]
if l[i] == 0:
zero_total += 1
total //= m
total += s//m * count
print((n-total-zero_total))
for n, x, m in query:
answer_query(n, x, m)
| p02770 |
import sys
input = sys.stdin.buffer.readline
k, q = list(map(int, (input().split())))
d = list(map(int, (input().split())))
for qi in range(q):
n, x, m = list(map(int, input().split()))
last = x
eq = 0
for i in range(k):
num = (n-1-i+k-1)//k
last += (d[i]%m) * num
if d[i]%m == 0: eq += num
ans = (n-1) - (last//m - x//m) - eq
print(ans) | import sys
input = sys.stdin.buffer.readline
k, q = list(map(int, (input().split())))
d = list(map(int, (input().split())))
for qi in range(q):
n, x, m = list(map(int, input().split()))
last = x
eq = 0
for i in range(k):
num = ((n-1-i)+(k-1))//k
last += (d[i]%m) * num
if d[i]%m == 0: eq += num
ans = (n-1) - (last//m - x//m) - eq
print(ans) | p02770 |
from itertools import accumulate
k, q = list(map(int, input().split()))
d = list(map(int, input().split()))
def sof(n, a, b, c):
if a == 0:
return (n + 1) * (b // c)
if a >= c or b >= c:
return n * (n + 1) // 2 * (a // c) + (n + 1) * (b // c) + sof(n, a % c, b % c, c)
m = (a * n + b) // c
return n * m - sof(m - 1, c, c - b - 1, a)
def solve():
n, x, m = list(map(int, input().split()))
a = [0] + list([i % m for i in accumulate(d)])
ans = 0
rn = (n - 1) % k
for i in range(k):
u = (x + a[i]) % m
v = (x + a[i + 1]) % m
if i < rn:
c = (n - 1) // k + 1
else:
c = (n - 1) // k
if u == v:
continue
elif u < v:
ans += c - (sof(c - 1, a[-1], v, m) - sof(c - 1, a[-1], u, m))
else:
ans += sof(c - 1, a[-1], u, m) - sof(c - 1, a[-1], v, m)
print(ans)
for _ in range(q):
solve() | k, q = list(map(int, input().split()))
d = list(map(int, input().split()))
def solve():
n, x, m = list(map(int, input().split()))
ans = 0
rn = (n - 1) % k
f = x % m
for i in range(k):
if d[i] % m == 0:
continue
if i < rn:
c = (n - 1) // k + 1
else:
c = (n - 1) // k
ans += c
f += c * (d[i] % m)
ans -= f // m
print(ans)
for _ in range(q):
solve() | p02770 |
# -*- coding: utf-8 -*-
#############
# Libraries #
#############
import math
#############
# Constants #
#############
MOD = 10**9 +7
INF = float('inf')
#############
# Functions #
#############
kaijo_memo = []
def kaijo(n):
if(len(kaijo_memo) > n):
return kaijo_memo[n]
if(len(kaijo_memo) == 0):
kaijo_memo.append(1)
while(len(kaijo_memo) <= n):
kaijo_memo.append(kaijo_memo[-1] * len(kaijo_memo) % MOD)
return kaijo_memo[n]
gyaku_kaijo_memo = []
def gyaku_kaijo(n):
if(len(gyaku_kaijo_memo) > n):
return gyaku_kaijo_memo[n]
if(len(gyaku_kaijo_memo) == 0):
gyaku_kaijo_memo.append(1)
while(len(gyaku_kaijo_memo) <= n):
gyaku_kaijo_memo.append(gyaku_kaijo_memo[-1] * pow(len(gyaku_kaijo_memo),MOD-2,MOD) % MOD)
return gyaku_kaijo_memo[n]
def nCr(n,r):
if(n == r):
return 1
if(n < r or r < 0):
return 0
ret = 1
ret = ret * kaijo(n) % MOD
ret = ret * gyaku_kaijo(r) % MOD
ret = ret * gyaku_kaijo(n-r) % MOD
return ret
#############
# Main Code #
#############
k,q = list(map(int, input().split()))
d = list(map(int, input().split()))
def query(n,x,m):
x %= m
ans = n-1
n -= 1
s1 = 0
t1 = 0
for i in range(k):
s1 += d[i] % m
if d[i] % m == 0:
t1 += 1
s2 = 0
t2 = 0
for i in range(n%k):
s2 += d[i] % m
if d[i] % m == 0:
t2 += 1
x += s1 * (n//k) + s2
ans -= x//m
ans -= t1 * (n//k) + t2
return ans
for _ in range(q):
n,x,m = list(map(int, input().split()))
print((query(n,x,m)))
| # -*- coding: utf-8 -*-
#############
# Libraries #
#############
import math
#############
# Constants #
#############
MOD = 10**9 +7
INF = float('inf')
#############
# Functions #
#############
kaijo_memo = []
def kaijo(n):
if(len(kaijo_memo) > n):
return kaijo_memo[n]
if(len(kaijo_memo) == 0):
kaijo_memo.append(1)
while(len(kaijo_memo) <= n):
kaijo_memo.append(kaijo_memo[-1] * len(kaijo_memo) % MOD)
return kaijo_memo[n]
gyaku_kaijo_memo = []
def gyaku_kaijo(n):
if(len(gyaku_kaijo_memo) > n):
return gyaku_kaijo_memo[n]
if(len(gyaku_kaijo_memo) == 0):
gyaku_kaijo_memo.append(1)
while(len(gyaku_kaijo_memo) <= n):
gyaku_kaijo_memo.append(gyaku_kaijo_memo[-1] * pow(len(gyaku_kaijo_memo),MOD-2,MOD) % MOD)
return gyaku_kaijo_memo[n]
def nCr(n,r):
if(n == r):
return 1
if(n < r or r < 0):
return 0
ret = 1
ret = ret * kaijo(n) % MOD
ret = ret * gyaku_kaijo(r) % MOD
ret = ret * gyaku_kaijo(n-r) % MOD
return ret
#############
# Main Code #
#############
k,q = list(map(int, input().split()))
d = list(map(int, input().split()))
def query(n,x,m):
x %= m
ans = n-1
n -= 1
s1 = 0
t1 = 0
for i in range(k):
s1 += d[i] % m
if d[i] % m == 0:
t1 += 1
s2 = 0
t2 = 0
for i in range(n%k):
s2 += d[i] % m
if d[i] % m == 0:
t2 += 1
x += s1 * (n//k) + s2
ans -= x//m
ans -= t1 * (n//k) + t2
print(ans)
for _ in range(q):
n,x,m = list(map(int, input().split()))
query(n,x,m)
| p02770 |
from math import ceil
import sys
input=sys.stdin.readline
k,q=list(map(int,input().split()))
d=list(map(int,input().split()))
for _ in range(q):
n,x,m=list(map(int,input().split()))
dd=[d[i]%m for i in range(k)]
cnt1=0
cnt2=0
for i in range(k):
if dd[i]==0:
cnt1+=ceil((n-i-1)/k)
a=x
for i in range(k):
a+=ceil((n-i-1)/k)*dd[i]
cnt2=a//m-x//m
print((n-1-cnt1-cnt2)) | import sys
input=sys.stdin.readline
k,q=list(map(int,input().split()))
d=list(map(int,input().split()))
for _ in range(q):
n,x,m=list(map(int,input().split()))
dd=[d[i]%m for i in range(k)]
for i in range(k):
if dd[i]==0:
dd[i]=m
s=x%m+sum(dd)*((n-1)//k)+sum(dd[:(n-1)%k])
print((n-1-s//m)) | p02770 |
import sys
input = sys.stdin.readline
def main():
K, Q = list(map(int, input().split()))
D = list(map(int, input().split()))
for _ in range(Q):
n, x, m = list(map(int, input().split()))
md = [D[i] % m for i in range(K)]
smda = 0
mda0 = 0
for i in range((n - 1) % K):
if md[i] == 0:
mda0 += 1
smda += md[i]
roop = (n - 1) // K
res = n - 1 - (x % m + sum(md) * roop + smda) // m - md.count(0) * roop - mda0
print(res)
main()
| import sys
input = sys.stdin.readline
def main():
K, Q = list(map(int, input().split()))
D = list(map(int, input().split()))
for _ in range(Q):
n, x, m = list(map(int, input().split()))
md = [D[i] % m for i in range(K)]
smda = 0
mda0 = 0
for i in range((n - 1) % K):
if md[i] == 0:
mda0 += 1
smda += md[i]
smd = smda
md0 = mda0
for i in range((n - 1) % K, K):
if md[i] == 0:
md0 += 1
smd += md[i]
roop = (n - 1) // K
res = n - 1 - (x % m + smd * roop + smda) // m - md0 * roop - mda0
print(res)
main()
| p02770 |
import sys
def main():
K, Q = list(map(int, input().split()))
D = list(map(int, input().split()))
for _ in range(Q):
n, x, m = list(map(int, input().split()))
md = [D[i] % m for i in range(K)]
smda = 0
mda0 = 0
for i in range((n - 1) % K):
if md[i] == 0:
mda0 += 1
smda += md[i]
smd = smda
md0 = mda0
for i in range((n - 1) % K, K):
if md[i] == 0:
md0 += 1
smd += md[i]
roop = (n - 1) // K
res = n - 1 - (x % m + smd * roop + smda) // m - md.count(0) * roop - mda0
print(res)
main()
| import sys
def main():
K, Q = list(map(int, input().split()))
D = list(map(int, input().split()))
for _ in range(Q):
n, x, m = list(map(int, input().split()))
md = [D[i] % m for i in range(K)]
smda = 0
mda0 = 0
for i in range((n - 1) % K):
if md[i] == 0:
mda0 += 1
smda += md[i]
smd = smda
md0 = mda0
for i in range((n - 1) % K, K):
if md[i] == 0:
md0 += 1
smd += md[i]
roop = (n - 1) // K
res = n - 1 - (x % m + smd * roop + smda) // m - md0 * roop - mda0
print(res)
main()
| p02770 |
import sys
input = sys.stdin.readline
k,q=list(map(int,input().split()))
D=tuple(map(int,input().split()))
for query in range(q):
n,x,m=list(map(int,input().split()))
D2=[d%m for d in D]
S=sum(D2)
D0=D2.count(0)
R=(n-1)//k
ANS=R*(k-D0) - S//m*R-(S%m*R+x%m)//m
x2=(x+S%m*R)%m
rest=n-R*k-1
S2=sum(D2[:rest])
DR0=D2[:rest].count(0)
ANSR=rest - DR0 - (x2+S2)//m
print((ANS+ANSR)) | import sys
input = sys.stdin.readline
k,q=list(map(int,input().split()))
D=tuple(map(int,input().split()))
def sum_count(A):
S=0
C=0
for a in A:
if a==0:
C+=1
else:
S+=a
return S,C
for query in range(q):
n,x,m=list(map(int,input().split()))
D2=[d%m for d in D]
S,D0=sum_count(D2)
R=(n-1)//k
ANS=R*(k-D0) - (R*S+x%m)//m
x2=(x+S*R)%m
rest=n-R*k-1
S2,DR0=sum_count(D2[:rest])
ANSR=rest - DR0 - (x2+S2)//m
print((ANS+ANSR)) | p02770 |
import sys,collections as cl,bisect as bs
sys.setrecursionlimit(100000)
input = sys.stdin.readline
mod = 10**9+7
Max = sys.maxsize
def l(): #intのlist
return list(map(int,input().split()))
def m(): #複数文字
return list(map(int,input().split()))
def onem(): #Nとかの取得
return int(eval(input()))
def s(x): #圧縮
a = []
aa = x[0]
su = 1
for i in range(len(x)-1):
if aa != x[i+1]:
a.append([aa,su])
aa = x[i+1]
su = 1
else:
su += 1
a.append([aa,su])
return a
def jo(x): #listをスペースごとに分ける
return " ".join(map(str,x))
def max2(x): #他のときもどうように作成可能
return max(list(map(max,x)))
def In(x,a): #aがリスト(sorted)
k = bs.bisect_left(a,x)
if k != len(a) and a[k] == x:
return True
else:
return False
"""
def nibu(x,n,r):
ll = 0
rr = r
while True:
mid = (ll+rr)//2
if rr == mid:
return ll
if (ここに評価入れる):
rr = mid
else:
ll = mid+1
"""
mod = 10**9+7 #出力の制限
N = 10**5 * 2
def cmb(n, r):
if ( r<0 or r>n ):
return 0
r = min(r, n-r)
return g1[n] * g2[r] * g2[n-r] % mod
def p(n,r):
if ( r<0 or r>n ):
return 0
return g1[n] * g2[n-r] % mod
g1 = [1, 1] # 元テーブル
g2 = [1, 1] #逆元テーブル
inverse = [0, 1] #逆元テーブル計算用テーブル
for i in range( 2, N + 1 ):
g1.append( ( g1[-1] * i ) % mod )
inverse.append( ( -inverse[mod % i] * (mod//i) ) % mod )
g2.append( (g2[-1] * inverse[-1]) % mod )
# a = cmb(n,r)
import fractions
from functools import reduce
def gcd(*numbers):
return reduce(fractions.gcd, numbers)
def gcd_list(numbers):
return reduce(fractions.gcd, numbers)
def lcm_base(x, y):
return (x * y) // fractions.gcd(x, y)
def lcm(*numbers):
return reduce(lcm_base, numbers, 1)
def lcm_list(numbers):
return reduce(lcm_base, numbers, 1)
k,q = m()
d = l()
for i in range(q):
n,x,mm = m()
co = 0
po = []
for j in range(k):
po.append(d[j] % mm if d[j] % mm > 0 else mm)
"""
for j in range(k):
if po[j] == 0:
ccc = ((n-1)//k)
if (n-1)%k >= j:
ccc += 1
co += ccc
"""
pp = sum(po) * ((n-1)//k)
pp += x
for j in range((n-1)%k):
pp += po[j]
co += (pp//mm) - (x//mm)
print((n-co-1))
| import sys,collections as cl,bisect as bs
sys.setrecursionlimit(100000)
input = sys.stdin.readline
mod = 10**9+7
Max = sys.maxsize
def l(): #intのlist
return list(map(int,input().split()))
def m(): #複数文字
return list(map(int,input().split()))
def onem(): #Nとかの取得
return int(eval(input()))
def s(x): #圧縮
a = []
aa = x[0]
su = 1
for i in range(len(x)-1):
if aa != x[i+1]:
a.append([aa,su])
aa = x[i+1]
su = 1
else:
su += 1
a.append([aa,su])
return a
def jo(x): #listをスペースごとに分ける
return " ".join(map(str,x))
def max2(x): #他のときもどうように作成可能
return max(list(map(max,x)))
def In(x,a): #aがリスト(sorted)
k = bs.bisect_left(a,x)
if k != len(a) and a[k] == x:
return True
else:
return False
"""
def nibu(x,n,r):
ll = 0
rr = r
while True:
mid = (ll+rr)//2
if rr == mid:
return ll
if (ここに評価入れる):
rr = mid
else:
ll = mid+1
"""
mod = 10**9+7 #出力の制限
N = 10**5 * 2
def cmb(n, r):
if ( r<0 or r>n ):
return 0
r = min(r, n-r)
return g1[n] * g2[r] * g2[n-r] % mod
def p(n,r):
if ( r<0 or r>n ):
return 0
return g1[n] * g2[n-r] % mod
g1 = [1, 1] # 元テーブル
g2 = [1, 1] #逆元テーブル
inverse = [0, 1] #逆元テーブル計算用テーブル
for i in range( 2, N + 1 ):
g1.append( ( g1[-1] * i ) % mod )
inverse.append( ( -inverse[mod % i] * (mod//i) ) % mod )
g2.append( (g2[-1] * inverse[-1]) % mod )
# a = cmb(n,r)
import fractions
from functools import reduce
def gcd(*numbers):
return reduce(fractions.gcd, numbers)
def gcd_list(numbers):
return reduce(fractions.gcd, numbers)
def lcm_base(x, y):
return (x * y) // fractions.gcd(x, y)
def lcm(*numbers):
return reduce(lcm_base, numbers, 1)
def lcm_list(numbers):
return reduce(lcm_base, numbers, 1)
k,q = m()
d = l()
for i in range(q):
n,x,mm = m()
co = 0
po = []
for j in range(k):
#po.append(d[j] % mm if d[j] % mm > 0 else mm)
po.append(d[j] % mm)
for j in range(k):
if po[j] == 0:
ccc = ((n-1)//k)
if (n-1)%k >= j+1:
ccc += 1
co += ccc
pp = sum(po) * ((n-1)//k)
pp += x
for j in range((n-1)%k):
pp += po[j]
co += (pp//mm) - (x//mm)
print((n-co-1))
| p02770 |
import sys
input=sys.stdin.readline
k,q=list(map(int,input().split()))
D=[int(i) for i in input().split()]
for _ in range(q):
n,x,m=list(map(int,input().split()))
DD=[d%m for d in D]
x%=m
ans=n-1
u,v=(n-1)//k,(n-1)%k
z=DD.count(0)*u
a_n=x+sum(DD)*u
for i in range(v):
a_n+=DD[i]
if DD[i]==0:
z+=1
ans-=z+a_n//m
print(ans) | import sys
input=sys.stdin.readline
k,q=list(map(int,input().split()))
D=[int(i) for i in input().split()]
for _ in range(q):
n,x,m=list(map(int,input().split()))
DD=[d%m for d in D]
x%=m
ans=n-1
u,v=(n-1)//k,(n-1)%k
z1,z2,r,s=0,0,0,0
for i,d in enumerate(DD):
s+=d
if i<v:
r+=d
if d==0:
z1+=1
z2+=1
elif d==0:
z2+=1
ans-=(z2*u+z1)+(x+s*u+r)//m
print(ans) | p02770 |
#!/usr/bin/env python3
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 7)
n = int(readline())
s = str(readline())
answer = s.count('ABC')
print(answer) | #!/usr/bin/env python3
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 7)
n = int(readline())
s = str(readline())
count = 0
for i in range(0,n - 2):
if s[i] == 'A' and s[i + 1] == 'B' and s[i + 2] == 'C':
count +=1
print(count) | p02812 |
import sys
import os
import math
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)]
iss = lambda: sys.stdin.buffer.readline().decode().rstrip()
sl = lambda: list(map(str, sys.stdin.buffer.readline().decode().split()))
isn = lambda n: [sys.stdin.buffer.readline().decode().rstrip() for _ in range(n)]
MOD = 10 ** 9 + 7
def main():
if os.getenv("LOCAL"):
sys.stdin = open("input.txt", "r")
N = ii()
S = iss()
print((S.count('ABC')))
if __name__ == '__main__':
main()
| import sys
import os
import math
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)]
iss = lambda: sys.stdin.buffer.readline().decode().rstrip()
sl = lambda: list(map(str, sys.stdin.buffer.readline().decode().split()))
isn = lambda n: [sys.stdin.buffer.readline().decode().rstrip() for _ in range(n)]
MOD = 10 ** 9 + 7
def main():
if os.getenv("LOCAL"):
sys.stdin = open("input.txt", "r")
N = ii()
S = iss()
ret = 0
print((sum((S[n:n+3] == 'ABC') for n in range(N-2))))
if __name__ == '__main__':
main()
| p02812 |
import sys
def solve():
readline = sys.stdin.buffer.readline
mod = 10 ** 9 + 7
n = int(readline())
s = str(readline().rstrip().decode('utf-8'))
print((s.count("ABC")))
if __name__ == '__main__':
solve()
| import sys
def solve():
readline = sys.stdin.buffer.readline
mod = 10 ** 9 + 7
n = int(readline())
print((str(readline().rstrip().decode('utf-8')).count("ABC")))
if __name__ == '__main__':
solve()
| p02812 |
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
def main():
N = int(readline())
S = readline().strip()
ans = 0
for i in range(N - 2):
if S[i : i + 3] == 'ABC':
ans += 1
print(ans)
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 main():
N = int(readline())
S = readline().strip()
print((S.count('ABC')))
return
if __name__ == '__main__':
main()
| p02812 |
w = int(input())
n = int(input())
am = [i for i in range(w+1)]
for _ in range(n):
a, b = map(int, input().split(','))
am[a], am[b] = am[b], am[a]
print(*am[1:], sep="\n")
| w = int(input())
n = int(input())
kuji = [i+1 for i in range(w)]
for _ in range(n):
a, b = map(int, input().split(','))
kuji[a-1], kuji[b-1] = kuji[b-1], kuji[a-1]
print(*kuji, sep="\n")
| p00011 |
r = 1000000007
N = 100000
l = [1]*N
def egcd(a, b):
(x, lastx) = (0, 1)
(y, lasty) = (1, 0)
while b != 0:
q = a // b
(a, b) = (b, a % b)
(x, lastx) = (lastx - q * x, x)
(y, lasty) = (lasty - q * y, y)
return (lastx, lasty, a)
# ax ≡ 1 (mod m)
def modinv(a, m):
(inv, q, gcd_val) = egcd(a, m)
return inv % m
for i in range(1,N):
l[i] = l[i-1]+modinv(i+1,r)
N = int(eval(input()))
A = list(map(int,input().split()))
exp = 0
for i in range(N):
exp += (l[i]+l[N-i-1]-1)*A[i]%r
ans = exp
for i in range(1,N+1):
ans = ans*i%r
print(ans) | N = int(eval(input()))
A = list(map(int,input().split()))
mod = 10**9+7
def inv(n):
n %= mod
return pow(n,mod-2,mod)
H = [0]*(N+1)
for n in range(1,N+1):
H[n] = (inv(n)+H[n-1])%mod
N_f = 1
for n in range(1,N+1):
N_f = N_f*n%mod
ans = 0
for n in range(1,N+1):
ans += A[n-1]*(H[N-n+1]+H[n]-1)
ans %= mod
ans *= N_f
ans %= mod
print(ans) | p03232 |
n = int(eval(input()))
A = [int(i) for i in input().split()]
p = 10 ** 9 + 7
def fact(n, p=10**9 + 7):
f = [1]
for i in range(1, n+1):
f.append(f[-1]*i%p)
return f
def invfact(n, f, p=10**9 + 7):
inv = [pow(f[n], p-2, p)]
for i in range(n, 0, -1):
inv.append(inv[-1]*i%p)
return inv[::-1]
def get_inv(n, f, invf, p=10**9 + 7):
inv = [0]
for i in range(n):
inv.append(invf[i+1] * f[i] % p)
return inv
f = fact(30+10**5)
invf = invfact(30+10**5, f)
inv = get_inv(30+10**5, f, invf)
def comb(a, b):
return f[a] * invf[b] * invf[a-b] % p
csum = [0]
for i in range(1, n+1):
csum.append((csum[-1] + inv[i]) % p)
ans = 0
for i, a in enumerate(A):
ans += (csum[i+1] + csum[n-i] - csum[1] + p) % p * a
ans %= p
print((ans * f[n] % p)) | n = int(eval(input()))
A = [int(i) for i in input().split()]
p = 10 ** 9 + 7
def fact(n, p=10**9 + 7):
f = [1]
for i in range(1, n+1):
f.append(f[-1]*i%p)
return f
def get_inv(n, p=10**9 + 7):
inv = [0, 1]
for i in range(2, n+1):
inv.append(-(p//i * inv[p%i]) % p)
return inv
f = fact(30+10**5)
inv = get_inv(30+10**5)
csum = [0]
for i in range(1, n+1):
csum.append((csum[-1] + inv[i]) % p)
ans = 0
for i, a in enumerate(A):
ans += (csum[i+1] + csum[n-i] - csum[1] + p) % p * a
ans %= p
print((ans * f[n] % p)) | p03232 |
n = int(eval(input()))
A = [int(i) for i in input().split()]
p = 10 ** 9 + 7
def fact(n, p=10**9 + 7):
f = [1]
for i in range(1, n+1):
f.append(f[-1]*i%p)
return f
def get_inv(n, p=10**9 + 7):
inv = [0, 1]
for i in range(2, n+1):
inv.append(-(p//i * inv[p%i]) % p)
return inv
f = fact(30+10**5)
inv = get_inv(30+10**5)
csum = [0]
for i in range(1, n+1):
csum.append((csum[-1] + inv[i]) % p)
ans = 0
for i, a in enumerate(A):
ans += (csum[i+1] + csum[n-i] - csum[1] + p) % p * a
ans %= p
print((ans * f[n] % p)) | n = int(eval(input()))
A = [int(i) for i in input().split()]
p = 10 ** 9 + 7
def fact(n, p=10**9 + 7):
f = [1]
for i in range(1, n+1):
f.append(f[-1]*i%p)
return f
def get_inv(n, p=10**9 + 7):
inv = [0, 1]
for i in range(2, n+1):
inv.append(-(p//i * inv[p%i]) % p)
return inv
f = fact(n)
inv = get_inv(n)
csum = [0]
for i in range(1, n+1):
csum.append((csum[-1] + inv[i]) % p)
ans = 0
for i, a in enumerate(A):
ans += (csum[i+1] + csum[n-i] - csum[1] + p) % p * a
ans %= p
print((ans * f[n] % p)) | p03232 |
n = int(eval(input()))
A = [int(i) for i in input().split()]
p = 10 ** 9 + 7
def fact(n, p=10**9 + 7):
f = [1]
for i in range(1, n+1):
f.append(f[-1]*i%p)
return f
def get_inv(n, p=10**9 + 7):
inv = [0, 1]
for i in range(2, n+1):
inv.append(-(p//i * inv[p%i]) % p)
return inv
f = fact(n)
inv = get_inv(n)
csum = [0]
for i in range(1, n+1):
csum.append((csum[-1] + inv[i]) % p)
ans = 0
for i, a in enumerate(A):
ans += (csum[i+1] + csum[n-i] - csum[1] + p) % p * a
ans %= p
print((ans * f[n] % p)) | n = int(eval(input()))
A = [int(i) for i in input().split()]
p = 10 ** 9 + 7
def fact(n, p=10**9 + 7):
f = 1
for i in range(1, n+1):
f = f * i % p
return f
def get_inv(n, p=10**9 + 7):
inv = [0, 1]
for i in range(2, n+1):
inv.append(-(p//i * inv[p%i]) % p)
return inv
f = fact(n)
inv = get_inv(n)
csum = [0]
for i in range(1, n+1):
csum.append((csum[-1] + inv[i]) % p)
ans = 0
for i, a in enumerate(A):
ans += (csum[i+1] + csum[n-i] - csum[1] + p) % p * a
ans %= p
print((ans * f % p)) | p03232 |
n = int(eval(input()))
A = [int(i) for i in input().split()]
p = 10 ** 9 + 7
def fact(n, p=10**9 + 7):
f = 1
for i in range(1, n+1):
f *= i
f %= p
return f
def get_inv(n, p=10**9 + 7):
inv = [0, 1]
for i in range(2, n+1):
inv.append(-(p//i * inv[p%i]) % p)
return inv
f = fact(n)
inv = get_inv(n)
csum = [0]
for i in range(1, n+1):
csum.append((csum[-1] + inv[i]) % p)
ans = 0
for i, a in enumerate(A):
ans += (csum[i+1] + csum[n-i] - csum[1] + p) % p * a
ans %= p
print((ans * f % p)) | n = int(eval(input()))
A = [int(i) for i in input().split()]
p = 10 ** 9 + 7
def fact(n, p=10**9 + 7):
f = 1
for i in range(1, n+1):
f *= i
f %= p
return f
def get_inv(n, p=10**9 + 7):
inv = [0, 1]
for i in range(2, n+1):
inv.append(-(p//i * inv[p%i]) % p)
return inv
f = fact(n)
inv = get_inv(n)
csum = [0]
for i in range(1, n+1):
csum.append((csum[-1] + inv[i]) % p)
ans = 0
for i, a in enumerate(A):
ans += (csum[i+1] + csum[n-i] - csum[1]) * a
ans %= p
print((ans * f % p)) | p03232 |
m=10**9+7
eval(input())
i=s=r=0
f=1
a=input().split()
for _ in a:
s+=pow(i+1,m-2,m)
r+=int(a[i])*~-s+int(a[~i])*s
i+=1
f*=i
print((r*f%m)) | m=10**9+7
eval(input())
i=s=r=0
f=1
a=input().split()
for _ in a:
s+=pow(i+1,m-2,m);r+=int(a[i])*~-s+int(a[~i])*s;i+=1;f=f*i%m
print((r*f%m)) | p03232 |
from fractions import Fraction
MOD = 10 ** 9 + 7
n = int(eval(input()))
a = list(map(int, input().split()))
csum = [0]
t = 0
for i in range(1, n + 1):
t += Fraction(1, i)
csum.append(t)
fact = 1
t = 1
while t <= n:
fact *= t
fact %= MOD
t += 1
# jが何回加算されるか
ans = 0
for j in range(n):
coef = 0
coef += csum[abs(j - 0) + 1] # 左側加算
coef += csum[abs(j - (n - 1)) + 1] # 右側加算
coef -= 1 # 自身を減算
# print(coef, a[j])
ans += coef * a[j]
ans %= MOD
ans *= fact
ans %= MOD
print(ans) | MOD = 10 ** 9 + 7
n = int(eval(input()))
a = list(map(int, input().split()))
csum_invs = [0]
t = 0
for i in range(1, n + 1):
t += pow(i, MOD - 2, MOD)
t %= MOD
csum_invs.append(t)
# print(csum_invs)
fact = []
t = 1
for i in range(1, n + 1):
t *= i
t %= MOD
fact.append(t)
# print(fact)
ans = 0
for i in range(n):
# print(i)
t = a[i] * (csum_invs[n - i] + csum_invs[i + 1] - 1)
t %= MOD
ans += t
ans *= fact[-1]
ans %= MOD
print(ans)
'''
逆元の求め方: フェルマーの小定理
a ** (-1) ≡ a ** (p - 2) (mod p)
b / a ≡ b * a **(p - 2)
だから、/ a をしたければ、* a ** (p -2) をすればよい
''' | p03232 |
n = int(eval(input()))
a = list(map(int, input().split()))
ret = 0
mod = int(1e9) + 7
cum = [0] * (n + 1)
for i in range(n):
cum[i + 1] = cum[i] + a[i]
def inv(x):
return pow(x, mod - 2, mod)
for i in range(n):
for j in range(n):
if i == j:
continue
ret += inv(abs(j - i)+1) * (a[j])
ret %= mod
ret += cum[-1]
ret %= mod
for i in range(2, n + 1):
ret *= i
ret %= mod
print(ret)
| n = int(eval(input()))
a = list(map(int, input().split()))
ret = 0
mod = int(1e9) + 7
def inv(x):
return pow(x, mod - 2, mod)
inv_memo = [inv(i) for i in range(1, n+1)]
cum = [0] * (n + 1)
for i in range(n):
cum[i + 1] = (cum[i] + inv_memo[i]) % mod
for i in range(n):
ret += (cum[n - i] + cum[i+1] - 1) * a[i]
ret %= mod
for i in range(2, n + 1):
ret *= i
ret %= mod
print(ret)
| p03232 |
#! /usr/bin/env python
# -*- coding: utf-8 -*-
# vim:fenc=utf-8
#
"""
AGC028 B
"""
import itertools
n = int(eval(input()))
ali = list(map(int, input().split()))
cut = 10**9+7
def modInverse(a, b, divmod=divmod):
r0, r1, s0, s1 = a, b, 1, 0
while r1 != 0:
q, rtmp = divmod(r0, r1)
stmp = s0-q*s1
r0, s0 = r1, s1
r1, s1 = rtmp, stmp
return s0 % cut
def factorial(n):
nn = 1
for i in range(2, n+1):
nn = nn*i
return(nn)
invlist = [modInverse(i, cut) for i in range(1, n+1)]
accuminv = list(itertools.accumulate(invlist, func=lambda x, y: x+y % cut))
ans = 0
nfact = factorial(n)
for i in range(n):
sump = accuminv[i]+accuminv[n-1-i] - 1
ans += ali[i]*sump % cut
ans = ans*nfact % cut
print(ans)
| #! /usr/bin/env python
# -*- coding: utf-8 -*-
# vim:fenc=utf-8
#
"""
AGC028 B
"""
import itertools
import math
n = int(eval(input()))
ali = list(map(int, input().split()))
cut = 10**9+7
def modInverse(a, b, divmod=divmod):
r0, r1, s0, s1 = a, b, 1, 0
while r1 != 0:
q, rtmp = divmod(r0, r1)
stmp = s0-q*s1
r0, s0 = r1, s1
r1, s1 = rtmp, stmp
return s0 % cut
# def factorial(n):
# nn = 1
# for i in range(2, n+1):
# nn = nn*i
# return(nn)
invlist = [modInverse(i, cut) for i in range(1, n+1)]
accuminv = list(itertools.accumulate(invlist, func=lambda x, y: x+y % cut))
ans = 0
nfact = math.factorial(n)
for i in range(n):
sump = accuminv[i]+accuminv[n-1-i] - 1
ans += ali[i]*sump % cut
ans = ans*nfact % cut
print(ans)
| p03232 |
N = int(eval(input()))
A = [int(a) for a in input().split()]
def fact(n):
if n==0:
return 1
else:
return n*fact(n-1) % p
def mod_combination(n, k, mod):
# nCk (mod m)
def mod_permutation(n, k, mod):
if n<=k:
return 1
else:
return (n * mod_permutation(n-1,k,mod))%mod
def mod_inv_permutation(k, mod):
k, mod = int(k), int(mod)
if k<=1:
return 1
else:
return (pow(k,mod-2,mod) * mod_inv_permutation(k-1, mod))%mod
return (mod_permutation(n,n-k,mod) * mod_inv_permutation(k, mod))%mod
X = [[0,0],[0,1,0]]
p = 10**9 + 7
for i in range(2, N+1):
# print ("i=",i)
s = [0] * (i+2)
for j in range(i):
a = j + 1 - 1
b = i - (j + 1)
# print (i, j, a, b)
# print ("Bef", s)
for k in range(a):
# print ("s[", k+1, "] +=", X[a][k+1]*mod_combination(a+b,a,p)*fact(b)+fact(i-1))
s[k+1] += ((X[a][k+1]*mod_combination(a+b,a,p) % p)*fact(b) % p +fact(i-1)) % p
for k in range(b):
# print ("s[", i-k, "] +=", X[b][k+1]*mod_combination(a+b,a,p)*fact(a)+fact(i-1))
s[i-k] += ((X[b][k+1]*mod_combination(a+b,a,p) % p) *fact(a) % p +fact(i-1)) % p
# print ("s[", j+1, "] +=", fact(i-1))
s[j+1] += fact(i-1)
# print ("Aft", s)
X.append(s)
# print (X)
ans = 0
for i in range(N):
ans += X[N][i+1] * A[i]
ans %= p
print (ans) | def mod_inv(n,p):
if n<0:
return - mod_inv(-n,p) % p
if n>p:
return mod_inv(n % p, p)
def mod_inv_calc(a,b):
if b==0:
return (a,1)
else:
s,t = mod_inv_calc(b, a % b)
d = a//b
return (t, -t*d+s)
return mod_inv_calc(p,n)[1] % p
N = int(eval(input()))
A = [int(a) for a in input().split()]
p = 10**9+7
inv_list = [mod_inv(i+1,p) for i in range(N+2)]
fact_list = [1]
for i in range(N):
fact_list.append(fact_list[i] * (i+1) % p)
s = 0
sum_list = [inv_list[i] * fact_list[N] % p for i in range(N+2)]
for i in range(N):
s += inv_list[i]
s *= fact_list[N]
s %= p
ans = 0
for i in range(N):
ans += A[i]*s
ans %= p
s += (sum_list[i+1] - sum_list[N-i-1])
s %= p
print (ans) | p03232 |
N = int(eval(input()))
A = list(map(int,input().split(" ")))
mod = 10**9+7
fact = 1
for i in range(2,N+1):
fact *= i
fact %= mod
rev = [ pow((i),mod-2,mod) for i in range(1,N+1) ]
for i in range(N-1):
rev[i+1] += rev[i]
ans = 0
for i in range(N):
ans += A[i] * (fact * (rev[i] + rev[N-1-i] - rev[0])) % mod
ans %= mod
print(ans)
| N = int(eval(input()))
A = list(map(int,input().split(" ")))
mod = 10**9+7
fact = 1
for i in range(2,N+1):
fact *= i
fact %= mod
rev = [ (pow((i),mod-2,mod)*fact)%mod for i in range(1,N+1) ]
for i in range(N-1):
rev[i+1] += rev[i]
rev[i+1] %= mod
ans = 0
for i in range(N):
ans += A[i] * (rev[i] + rev[N-1-i] - rev[0]) % mod
ans %= mod
print(ans)
| p03232 |
# -*- coding: utf-8 -*-
from sys import stdin
from itertools import accumulate
s_in = lambda: stdin.readline()[:-1] # s = s_in()
d_in = lambda: int(stdin.readline()) # N = d_in()
ds_in = lambda: list(map(int, stdin.readline().split())) # List = ds_in()
MOD = 10**9 + 7
N = d_in()
A_list = ds_in()
def factorial(N):
val = 1
for i in range(1, N+1):
val = (val * i) % MOD
return val
def recursive_square(n, m, p):
""" n**p (mod m) """
if p == 0:
return 1 % m
if p % 2 == 0:
root = recursive_square(n, m, p//2) % m
return (root ** 2) % m
else:
return ((n % m) * recursive_square(n, m, p-1)) % m
N_factorial = factorial(N)
Coefs = []
for i in range(1, N+1):
Coefs.append((N_factorial * recursive_square(i, MOD, MOD-2)) % MOD)
def CumSum(x):
c = []
last = 0
for i in range(len(x)):
last = (last + x[i]) % MOD
c.append(last)
return c
Cum_Coefs = CumSum(Coefs)
if N == 1:
print((A_list[0]))
else:
ans = 0
for i in range(N):
ans = (ans + A_list[i] * (Cum_Coefs[i] + Cum_Coefs[N-i-1] - Cum_Coefs[0])) % MOD
print(ans)
| # -*- coding: utf-8 -*-
from sys import stdin
from itertools import accumulate
s_in = lambda: stdin.readline()[:-1] # s = s_in()
d_in = lambda: int(stdin.readline()) # N = d_in()
ds_in = lambda: list(map(int, stdin.readline().split())) # List = ds_in()
MOD = 10**9 + 7
N = d_in()
A_list = ds_in()
def factorial(N):
val = 1
for i in range(1, N+1):
val = (val * i) % MOD
return val
def recursive_square(n, m, p):
""" n**p (mod m) """
if p == 0:
return 1 % m
if p % 2 == 0:
root = recursive_square(n, m, p//2) % m
return (root ** 2) % m
else:
return ((n % m) * recursive_square(n, m, p-1)) % m
def factorize(n):
if n == 1:
return [(1, 1)]
fct = []
b, e = 2, 0
while b * b <= n:
while n % b == 0:
n //= b
e += 1
if e > 0:
fct.append((b, e))
b, e = b + 1, 0
if n > 1:
fct.append((n, 1))
return fct
N_factorial = factorial(N)
Coefs = []
lastval = 0
Inv = dict()
for i in range(1, N+1):
fac = factorize(i)
temp = N_factorial
for f in fac:
if f[0] not in list(Inv.keys()):
Inv[f[0]] = recursive_square(f[0], MOD, MOD-2)
for _ in range(f[1]):
temp = (temp * Inv[f[0]]) % MOD
lastval = (lastval + temp) % MOD
Coefs.append(lastval)
if N == 1:
print((A_list[0]))
else:
ans = 0
for i in range(N):
ans = (ans + A_list[i] * (Coefs[i] + Coefs[N-i-1] - Coefs[0])) % MOD
print(ans)
| p03232 |
# -*- coding: utf-8 -*-
from sys import stdin
from itertools import accumulate
s_in = lambda: stdin.readline()[:-1] # s = s_in()
d_in = lambda: int(stdin.readline()) # N = d_in()
ds_in = lambda: list(map(int, stdin.readline().split())) # List = ds_in()
MOD = 10**9 + 7
N = d_in()
A_list = ds_in()
def factorial(N):
val = 1
for i in range(1, N+1):
val = (val * i) % MOD
return val
def recursive_square(n, m, p):
""" n**p (mod m) """
if p == 0:
return 1 % m
if p % 2 == 0:
root = recursive_square(n, m, p//2) % m
return (root ** 2) % m
else:
return ((n % m) * recursive_square(n, m, p-1)) % m
def factorize(n):
if n == 1:
return [(1, 1)]
fct = []
b, e = 2, 0
while b * b <= n:
while n % b == 0:
n //= b
e += 1
if e > 0:
fct.append((b, e))
b, e = b + 1, 0
if n > 1:
fct.append((n, 1))
return fct
N_factorial = factorial(N)
Coefs = []
lastval = 0
Inv = dict()
for i in range(1, N+1):
fac = factorize(i)
temp = N_factorial
for f in fac:
if f[0] not in list(Inv.keys()):
Inv[f[0]] = recursive_square(f[0], MOD, MOD-2)
for _ in range(f[1]):
temp = (temp * Inv[f[0]]) % MOD
lastval = (lastval + temp) % MOD
Coefs.append(lastval)
if N == 1:
print((A_list[0]))
else:
ans = 0
for i in range(N):
ans = (ans + A_list[i] * (Coefs[i] + Coefs[N-i-1] - Coefs[0])) % MOD
print(ans)
| # -*- coding: utf-8 -*-
from sys import stdin
from itertools import accumulate
s_in = lambda: stdin.readline()[:-1] # s = s_in()
d_in = lambda: int(stdin.readline()) # N = d_in()
ds_in = lambda: list(map(int, stdin.readline().split())) # List = ds_in()
MOD = 10**9 + 7
N = d_in()
A_list = ds_in()
def factorial(N):
val = 1
for i in range(1, N+1):
val = (val * i) % MOD
return val
N_factorial = factorial(N)
Coefs = []
lastval = 0
for i in range(1, N+1):
temp = (N_factorial * pow(i, MOD-2, MOD)) % MOD
lastval = (lastval + temp) % MOD
Coefs.append(lastval)
if N == 1:
print((A_list[0]))
else:
ans = 0
for i in range(N):
ans = (ans + A_list[i] * (Coefs[i] + Coefs[N-i-1] - Coefs[0])) % MOD
print(ans)
| p03232 |
# Sum Difference
N, X, D = list(map(int, input().split()))
if D < 0:
X, D = -X, -D
# D>=0 として一般性を失わない
if D == 0:
Sets = set()
for i in range(N+1):
Sets.add(i*X)
print((len(Sets)))
exit()
# D>0
ans = 0
Sets = set()
#TLE O(N**3)
for j in range(N+1):
for k in range((j-1)*j//2, (2*N-1-j)*j//2+1):
Sets.add(X*j+D*k)
print((len(Sets))) | # Sum Difference
from collections import defaultdict
N, X, D = list(map(int, input().split()))
if D < 0:
X, D = -X, -D
if D == 0:
Sets = set()
for i in range(N+1):
Sets.add(i*X)
print((len(Sets)))
exit()
# D>0
ans = 0
Mode = defaultdict(list)
for i in range(N+1):
L = (i*X+D*i*(i-1)//2-i*X % D)//D
R = (i*X+D*i*(2*N-1-i)//2-i*X % D)//D
Mode[i*X % D].append((L, 1))
Mode[i*X % D].append((R+1, -1))
Data = []
for key in list(Mode.keys()):
Mode[key].sort()
cnt = 1
sums = Mode[key][0][0]
for num, which in Mode[key][1:]:
Data.append((sums, num, cnt))
cnt += which
sums = num
ans = 0
for l, r, v in Data:
if v > 0:
ans += r-l
print(ans) | p02840 |
from collections import defaultdict
from math import factorial
MOD = 10 ** 9 + 7
def factorize(n):
facts = defaultdict(int)
while n % 2 == 0:
n //= 2
facts[2] += 1
m = 3
while m * m <= n:
while n % m == 0:
facts[m] += 1
n //= m
m += 2
if 1 < n:
facts[n] += 1
return facts
def nCr(n, r):
return factorial(n) // (factorial(r) * factorial(n - r))
N, M = list(map(int, input().split()))
factors = factorize(M)
ans = 1
for p, e in list(factors.items()):
ans = ans * nCr(N - 1 + e, e) % MOD
print(ans) | from collections import defaultdict
def factorize(n):
facts = defaultdict(int)
while n % 2 == 0:
n //= 2
facts[2] += 1
m = 3
while m * m <= n:
while n % m == 0:
facts[m] += 1
n //= m
m += 2
if 1 < n:
facts[n] += 1
return facts
MOD = 10 ** 9 + 7 # should be a prime number
MAX = 10 ** 5 + 100
FACTS = [1] * (MAX + 1)
for i in range(1, MAX + 1):
FACTS[i] = FACTS[i - 1] * i % MOD
FACTINVS = [1] * (MAX + 1)
INVS = [1] * (MAX + 1)
for i in range(2, MAX + 1):
q, r = divmod(MOD, i)
INVS[i] = -INVS[r] * q % MOD
FACTINVS[i] = FACTINVS[i - 1] * INVS[i] % MOD
def nCr(n, r):
return FACTS[n] * FACTINVS[r] * FACTINVS[n - r]
N, M = list(map(int, input().split()))
factors = factorize(M)
ans = 1
for p, e in list(factors.items()):
ans = ans * nCr(N - 1 + e, e) % MOD
print(ans) | p03253 |
import math
def getPrimeFactorsDict(num):
pn = 2 #素数は2から
pfdict = {} #素因数のリスト
while pn * pn <= num: #√numまで調べる
while num % pn == 0: #現在の素数で割り切れる範囲でループ
num = num / pn
pfdict[pn] = pfdict.get(pn, 0) + 1
pn += 1 #割り切れなくなったら次の素数へ
if num > 1:
pfdict[int(num)] = pfdict.get(int(num), 0) + 1
return pfdict
N, M = list(map(int, input().split()))
d = getPrimeFactorsDict(M)
ans = 1
for key in list(d.keys()):
if d[key] == 1:
ans *= N
else:
ans *= math.factorial(N+d[key]-1) // (math.factorial(N-1) * math.factorial(d[key]))
print((ans % (10**9+7))) | from collections import defaultdict
N,M = list(map(int, input().split()))
MOD = 10**9+7
# 素因数分解
d = defaultdict(int)
i = 2
while i*i <= M:
if M % i == 0:
d[i] += 1
M //= i
else:
i += 1
if M > 1:
d[M] += 1
# 素因数をN個に分配する方法
def nCr(n,r):
if n < 0 or r < 0 or n < r: return 0
if n - r < r: r = n - r
if r == 0: return 1
if r == 1: return n
# 分子のn*(n-1)*...がr個分続くやつ
numerator = [n-r+k+1 for k in range(r)]
# 分母：r!=r*(r-1)*...*3*2の要素
denominator = [k+1 for k in range(r)]
# 分母の要素で割れる部分を割っていく部分
for p in range(2, r+1):
# 分母は1,2,3,...rのようになっており、1は意味がないのでスキップした形か
pivot = denominator[p-1]
if pivot > 1:
# 分子のX番目と分母のX-offset番目が共通の約数を持つということだと思う。piv分ずれているのだから、pivの倍数というところか
offset = (n-r) % p
for k in range(p-1, r, p):
# 約分できる要素について割る
numerator[k - offset] /= pivot
denominator[k] /= pivot
ret = 1
for k in range(r):
if numerator[k] > 1: ret *= int(numerator[k])
return ret
"""
それぞれの素数についてどの用意分配するか考える
例：2が5個あり、3箇所に分ける（２を受け取らない場所があってもよい）とは
並んでいる５つの２の間にしきりを二つ入れる、のと同じ
なので、5つの２と２つの仕切りの重複順列といえる。
上の例は3H5と表せて、
nHr = (n+r-1)Crとなる
"""
ans = 1
for k in list(d.keys()):
ans *= nCr((N+d[k]-1), d[k])
ans %= MOD
print(ans) | p03253 |
num = (10 ** 9) + 7
n, m = list(map(int, input().split()))
prime_upper = int(m ** (1/2) + 10)
prime_dict = {}
check = [False] * prime_upper
prime = [2]
while m % 2 == 0:
m //= 2
if not 2 in list(prime_dict.keys()):
prime_dict[2] = 0
prime_dict[2] += 1
for j in range(2, prime_upper, 2):
check[j] = True
for i in range(3, prime_upper, 2):
if not check[i]:
prime.append(i)
while m % i == 0:
m //= i
if not i in list(prime_dict.keys()):
prime_dict[i] = 0
prime_dict[i] += 1
for j in range(i, prime_upper, i):
check[j] = True
com2 = [[0] * 50 for _ in range(n + 1)]
for i in range(1, n + 1):
for j in range(1, 50):
if i == 1:
com2[i][j] = 1
elif j == 1:
com2[i][j] = i
else:
com2[i][j] = (com2[i][j - 1] + com2[i - 1][j]) % num
if m != 1:
ans = n
else:
ans = 1
for key, value in list(prime_dict.items()):
ans = (ans * com2[n][value]) % num
print(ans) | num = (10 ** 9) + 7
n, m = list(map(int, input().split()))
if m == 1:
print((1))
exit()
prime_upper = int(m ** (1/2) + 50)
prime_dict = {}
check = [False] * prime_upper
prime = [2]
while m % 2 == 0:
m //= 2
if not 2 in list(prime_dict.keys()):
prime_dict[2] = 0
prime_dict[2] += 1
for j in range(2, prime_upper, 2):
check[j] = True
for i in range(3, prime_upper, 2):
if not check[i]:
prime.append(i)
while m % i == 0:
m //= i
if not i in list(prime_dict.keys()):
prime_dict[i] = 0
prime_dict[i] += 1
for j in range(i, prime_upper, i):
check[j] = True
if len(list(prime_dict.values())) != 0:
value_max = max(prime_dict.values())
com2 = [[0] * (value_max + 1) for _ in range(n + 1)]
for i in range(1, n + 1):
for j in range(1, value_max + 1):
if i == 1:
com2[i][j] = 1
elif j == 1:
com2[i][j] = i
else:
com2[i][j] = (com2[i][j - 1] + com2[i - 1][j]) % num
if m != 1:
ans = n
else:
ans = 1
for key, value in list(prime_dict.items()):
ans = (ans * com2[n][value]) % num
print(ans)
else:
print(n)
| p03253 |
import collections
import math
n, m = [int(item) for item in input().split()]
def trial_division_sqrt(n):
prime_count = collections.Counter()
for i in range(2, int(math.sqrt(n)) + 2):
while n % i == 0:
n /= i
prime_count[i] += 1
if n > 1:
prime_count[int(n)] += 1
return prime_count
cnt = trial_division_sqrt(m)
ans = 1
for item in cnt:
ans *= int(math.factorial(n + cnt[item] - 1) // int(math.factorial(cnt[item]) * math.factorial(n-1)))
ans = int(ans) % (1000000000 + 7)
print(ans) | import collections
import math
n, m = [int(item) for item in input().split()]
def trial_division_sqrt(n):
prime_count = collections.Counter()
for i in range(2, int(math.sqrt(n)) + 2):
while n % i == 0:
n /= i
prime_count[i] += 1
if n > 1:
prime_count[int(n)] += 1
return prime_count
cnt = trial_division_sqrt(m)
ans = 1
for item in cnt:
h = 1
k_fact = 1
for i in range(cnt[item]):
h *= n + cnt[item] - 1 - i
k_fact *= (i+1)
ans *= h
ans = ans // k_fact
ans = ans % (1000000000 + 7)
print(ans) | p03253 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.