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... |
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)... | 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)
... | #--初期の並びを圧縮表示,逆立ち、正立を目印--#
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)
... | 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
... | 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
... | 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)
... | 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)
... | 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 s... | 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 s... | 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:
an... | #!/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... | 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
... | 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
n... | #!/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... | 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:
... | 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 __n... | 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:]
... | 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 ... | # -*- 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]
... | 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)... | # 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]):
... | 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... | 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(... | 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))
... | 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
c... | 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:
pr... | #-*-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 = F... | #!/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:
... | 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:
... | 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 = lis... | 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):
s... | 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))
... | 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:
prin... | 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
... | 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]:
... | 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)]
... | 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)]
... | 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] + ... | 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... | 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... | 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
... | 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... | #!/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... | 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
... | 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 // ... | 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
... | 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
... | 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 ... | 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
... | 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(kaij... | # -*- 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(kaij... | 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
... | 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 ran... | 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 ran... | 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):
... | 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):
... | 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... | 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()))... | 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): ... | 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): ... | 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 ... | 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... | 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
prin... | 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 = lambd... | 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 = lambd... | 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':
... | 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__':
m... | 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... | 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)
a... | 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]*... | 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)
... | 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)
... | 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)
... | 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)
... | 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)
retur... | 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)
... | 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)
... | 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... | 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)
# ... | 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... | 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 ... | 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... | #! /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 = ... | 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... | 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... | 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... | 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 += ... | 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 fa... | # -*- 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 fa... | 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 fa... | # -*- 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 fa... | 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)... | # 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 = (... | 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... | 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
... | 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)... | 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 < ... | 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_upp... | 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_d... | 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... | 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... | p03253 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.