結果

問題 No.2902 ZERO!!
ユーザー cleanttedcleantted
提出日時 2023-09-12 20:46:03
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 1,971 ms / 2,000 ms
コード長 2,774 bytes
コンパイル時間 693 ms
コンパイル使用メモリ 82,432 KB
実行使用メモリ 260,608 KB
最終ジャッジ日時 2024-12-26 12:06:52
合計ジャッジ時間 34,801 ms
ジャッジサーバーID
(参考情報)
judge2 / judge5
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 41
権限があれば一括ダウンロードができます

ソースコード

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

# import bisect
import copy
import heapq
import itertools
import math
import operator
import random
import sys
from bisect import bisect, bisect_left, bisect_right, insort
from collections import Counter, deque
from fractions import Fraction
from functools import cmp_to_key, lru_cache, partial
from inspect import currentframe
from math import ceil, gcd, log10, pi, sqrt
from typing import Iterable, Iterator, List, Tuple, TypeVar, Union
# import pypyjit
# pypyjit.set_param('max_unroll_recursion=-1')
# import string
# import networkx as nx
input = sys.stdin.readline
sys.setrecursionlimit(10000000)
# mod = 10 ** 9 + 7
mod = 998244353
# mod = 1 << 128
# mod = 10 ** 30 + 1
INF = 1 << 61
DIFF = 10 ** -9
DX = [1, 0, -1, 0, 1, 1, -1, -1]
DY = [0, 1, 0, -1, 1, -1, 1, -1]
def read_values(): return tuple(map(int, input().split()))
def read_index(): return tuple(map(lambda x: int(x) - 1, input().split()))
def read_list(): return list(read_values())
def read_lists(N): return [read_list() for _ in range(N)]
def dprint(*values): print(*values, file=sys.stderr)
def dprint2(*values):
names = {id(v): k for k, v in currentframe().f_back.f_locals.items()}
dprint(", ".join(f"{names.get(id(value), '???')}={repr(value)}" for value in values))
def solve(N):
t = 1
for i in range(1, N + 1):
t *= i
res = 0
for b in range(2, t + 1):
k = 0
while t % (b ** k) == 0:
k += 1
# if k > 1:
# print(b, k - 1)
res += k - 1
return res
def main():
N = int(input())
# print(solve(N))
P = []
F = [False] * (N + 1)
for i in range(2, N + 1):
if F[i]:
continue
F[i] = True
P.append(i)
for j in range(i, N + 1, i):
F[j] = True
C = []
for p in P:
c = 0
r = p
while N >= r:
c += N // r
r *= p
C.append(c)
# print(C)
r = 1
tmp = 0
D = []
for c in C:
d = [0]
for i in range(1, c + 1):
k = c // i
d.append(k)
r *= len(d)
tmp += len(d)
r %= mod
D.append(list(reversed(d)))
# print(r, D)
Inv = [0] + [pow(i, mod - 2, mod) for i in range(1, N + 1)]
I = [0] * len(P)
res = 0
for n in range(1, N + 1):
for k in range(len(D)):
if D[k][I[k]] == 0:
break
while D[k][I[k]] == n:
t = len(D[k]) - I[k]
r *= Inv[t]
r %= mod
# print(n, k, I[k], r)
res += r * n % mod
res %= mod
r *= (t - 1)
r %= mod
I[k] += 1
print(res)
if __name__ == "__main__":
main()
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0