結果
問題 | No.2903 A Round-the-World Trip with the Tent |
ユーザー | cleantted |
提出日時 | 2023-10-30 21:24:19 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,796 bytes |
コンパイル時間 | 429 ms |
コンパイル使用メモリ | 82,736 KB |
実行使用メモリ | 90,732 KB |
最終ジャッジ日時 | 2024-09-27 19:30:30 |
合計ジャッジ時間 | 9,565 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 169 ms
90,388 KB |
testcase_01 | AC | 170 ms
90,524 KB |
testcase_02 | AC | 170 ms
90,300 KB |
testcase_03 | WA | - |
testcase_04 | WA | - |
testcase_05 | AC | 169 ms
90,596 KB |
testcase_06 | AC | 172 ms
90,488 KB |
testcase_07 | AC | 170 ms
90,188 KB |
testcase_08 | AC | 168 ms
90,484 KB |
testcase_09 | AC | 168 ms
90,156 KB |
testcase_10 | AC | 166 ms
90,296 KB |
testcase_11 | AC | 169 ms
89,992 KB |
testcase_12 | AC | 170 ms
90,196 KB |
testcase_13 | AC | 171 ms
90,396 KB |
testcase_14 | AC | 170 ms
90,244 KB |
testcase_15 | AC | 170 ms
90,536 KB |
testcase_16 | AC | 171 ms
90,404 KB |
testcase_17 | AC | 169 ms
90,412 KB |
testcase_18 | AC | 169 ms
90,132 KB |
testcase_19 | AC | 169 ms
90,540 KB |
testcase_20 | AC | 171 ms
90,308 KB |
testcase_21 | AC | 170 ms
90,536 KB |
testcase_22 | AC | 170 ms
90,108 KB |
testcase_23 | AC | 171 ms
90,528 KB |
testcase_24 | AC | 169 ms
90,440 KB |
testcase_25 | AC | 167 ms
90,148 KB |
testcase_26 | AC | 170 ms
90,392 KB |
testcase_27 | AC | 173 ms
90,432 KB |
testcase_28 | AC | 175 ms
90,564 KB |
testcase_29 | AC | 170 ms
90,160 KB |
testcase_30 | AC | 170 ms
90,324 KB |
testcase_31 | AC | 169 ms
90,300 KB |
testcase_32 | AC | 169 ms
90,412 KB |
testcase_33 | AC | 171 ms
90,324 KB |
testcase_34 | AC | 170 ms
90,520 KB |
testcase_35 | AC | 167 ms
90,016 KB |
testcase_36 | AC | 167 ms
90,452 KB |
testcase_37 | AC | 169 ms
90,356 KB |
testcase_38 | AC | 168 ms
90,340 KB |
testcase_39 | AC | 172 ms
90,056 KB |
testcase_40 | AC | 169 ms
90,472 KB |
testcase_41 | AC | 168 ms
90,072 KB |
testcase_42 | AC | 171 ms
90,056 KB |
testcase_43 | AC | 175 ms
89,984 KB |
testcase_44 | AC | 170 ms
90,260 KB |
ソースコード
# 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 main(): K, N = read_values() if K == 1: print(54) return P = [] for n in range(1, int(N**0.5) + 1): if N % n == 0: P.append(n) if n * n != N: P.append(N // n) P.sort() T = {} for p in P: r = pow(2, p, mod) + 1 for q in P: if q == p: break if p % q: continue r -= T[q] r %= mod T[p] = r % mod print(T[N]) if __name__ == "__main__": main()