結果

問題 No.2857 Div Array
ユーザー mkawa2
提出日時 2024-08-25 14:49:45
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 145 ms / 2,000 ms
コード長 1,868 bytes
コンパイル時間 316 ms
コンパイル使用メモリ 82,484 KB
実行使用メモリ 76,784 KB
最終ジャッジ日時 2024-08-25 14:49:49
合計ジャッジ時間 3,691 ms
ジャッジサーバーID
(参考情報)
judge2 / judge4
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
other AC * 30
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

import sys
sys.setrecursionlimit(200005)
# sys.set_int_max_str_digits(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()
dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
# inf = -1-(-1 << 31)
inf = -1-(-1 << 62)
# md = 10**9+7
md = 998244353
from collections import Counter
def dot(aa, bb):
h = len(aa)
w = len(bb[0])
res = [[0]*w for _ in range(h)]
for j, col in enumerate(zip(*bb)):
for i in range(h):
v = 0
# for a, b in zip(row, col): v += a*b
# res[i][j] = v
for a, b in zip(aa[i], col): v += a*b%md
res[i][j] = v%md
return res
def matpow(mat, e):
n = len(mat)
res = [[1 if i == j else 0 for j in range(n)] for i in range(n)]
while e:
if e & 1: res = dot(res, mat)
mat = dot(mat, mat)
e >>= 1
return res
def modsum(aa):
res=0
for a in aa:
res+=a
res%=md
return res
n,m,k=LI()
cnt=Counter()
for a in range(1,m+1):cnt[m//a]+=1
# print(cnt)
cc=sorted(cnt)
# print(cc)
l=len(cc)
mat=[[0]*l for _ in range(l)]
for i,c in enumerate(cc):
for j in range(i,l):
if cc[j]-c>k:break
mat[i][j]=cnt[cc[j]]
for j in range(i-1,-1,-1):
if c-cc[j]>k:break
mat[i][j]=cnt[cc[j]]
mat=matpow(mat,n-1)
ans=dot([[cnt[c] for c in cc]],mat)
print(modsum(ans[0]))
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0