結果
問題 | No.2902 ZERO!! |
ユーザー |
![]() |
提出日時 | 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 |
ソースコード
# import bisectimport copyimport heapqimport itertoolsimport mathimport operatorimport randomimport sysfrom bisect import bisect, bisect_left, bisect_right, insortfrom collections import Counter, dequefrom fractions import Fractionfrom functools import cmp_to_key, lru_cache, partialfrom inspect import currentframefrom math import ceil, gcd, log10, pi, sqrtfrom typing import Iterable, Iterator, List, Tuple, TypeVar, Union# import pypyjit# pypyjit.set_param('max_unroll_recursion=-1')# import string# import networkx as nxinput = sys.stdin.readlinesys.setrecursionlimit(10000000)# mod = 10 ** 9 + 7mod = 998244353# mod = 1 << 128# mod = 10 ** 30 + 1INF = 1 << 61DIFF = 10 ** -9DX = [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 = 1for i in range(1, N + 1):t *= ires = 0for b in range(2, t + 1):k = 0while t % (b ** k) == 0:k += 1# if k > 1:# print(b, k - 1)res += k - 1return resdef main():N = int(input())# print(solve(N))P = []F = [False] * (N + 1)for i in range(2, N + 1):if F[i]:continueF[i] = TrueP.append(i)for j in range(i, N + 1, i):F[j] = TrueC = []for p in P:c = 0r = pwhile N >= r:c += N // rr *= pC.append(c)# print(C)r = 1tmp = 0D = []for c in C:d = [0]for i in range(1, c + 1):k = c // id.append(k)r *= len(d)tmp += len(d)r %= modD.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 = 0for n in range(1, N + 1):for k in range(len(D)):if D[k][I[k]] == 0:breakwhile 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 % modres %= modr *= (t - 1)r %= modI[k] += 1print(res)if __name__ == "__main__":main()