結果
問題 | No.1581 Multiple Sequence |
ユーザー | ansain |
提出日時 | 2021-07-02 21:45:19 |
言語 | Python3 (3.12.2 + numpy 1.26.4 + scipy 1.12.0) |
結果 |
AC
|
実行時間 | 1,313 ms / 2,000 ms |
コード長 | 1,509 bytes |
コンパイル時間 | 164 ms |
コンパイル使用メモリ | 10,860 KB |
実行使用メモリ | 12,908 KB |
最終ジャッジ日時 | 2023-09-11 21:36:41 |
合計ジャッジ時間 | 32,206 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1,205 ms
12,764 KB |
testcase_01 | AC | 1,212 ms
12,904 KB |
testcase_02 | AC | 1,221 ms
12,792 KB |
testcase_03 | AC | 1,220 ms
12,768 KB |
testcase_04 | AC | 1,210 ms
12,772 KB |
testcase_05 | AC | 1,219 ms
12,732 KB |
testcase_06 | AC | 1,211 ms
12,760 KB |
testcase_07 | AC | 1,207 ms
12,832 KB |
testcase_08 | AC | 1,222 ms
12,908 KB |
testcase_09 | AC | 1,219 ms
12,676 KB |
testcase_10 | AC | 1,225 ms
12,732 KB |
testcase_11 | AC | 1,230 ms
12,900 KB |
testcase_12 | AC | 1,200 ms
12,792 KB |
testcase_13 | AC | 1,313 ms
12,768 KB |
testcase_14 | AC | 1,233 ms
12,776 KB |
testcase_15 | AC | 1,225 ms
12,740 KB |
testcase_16 | AC | 1,225 ms
12,904 KB |
testcase_17 | AC | 1,224 ms
12,748 KB |
testcase_18 | AC | 1,219 ms
12,896 KB |
testcase_19 | AC | 1,224 ms
12,748 KB |
testcase_20 | AC | 1,234 ms
12,724 KB |
testcase_21 | AC | 1,226 ms
12,652 KB |
testcase_22 | AC | 1,227 ms
12,768 KB |
testcase_23 | AC | 1,224 ms
12,868 KB |
ソースコード
import sys from collections import defaultdict, Counter, deque from itertools import permutations, combinations, product, combinations_with_replacement, groupby, accumulate import operator from math import sqrt, gcd, factorial # from math import isqrt, prod,comb # python3.8用(notpypy) #from bisect import bisect_left,bisect_right from functools import lru_cache, reduce #from heapq import heappush,heappop,heapify,heappushpop,heapreplace #import numpy as np #import networkx as nx #from networkx.utils import UnionFind #from numba import njit, b1, i1, i4, i8, f8 #from scipy.sparse import csr_matrix #from scipy.sparse.csgraph import shortest_path, floyd_warshall, dijkstra, bellman_ford, johnson, NegativeCycleError # numba例 @njit(i1(i4[:], i8[:, :]),cache=True) 引数i4配列、i8 2次元配列,戻り値i1 def input(): return sys.stdin.readline().rstrip() def divceil(n, k): return 1+(n-1)//k # n/kの切り上げを返す def yn(hantei, yes='Yes', no='No'): print(yes if hantei else no) def divisorlist(n): a, b = [], [] for i in range(1, int(n**0.5)+1): if n % i == 0: a.append(i) b.append(n//i) if a[-1] == b[-1]: a.pop() return a+b[::-1] def main(): mod = 10**9+7 mod2 = 998244353 solve = [0]*(10**5+5) solve[0] = 1 for m in range(1, 10**5+3): for div in divisorlist(m): solve[m] += solve[m//div-1] solve[m] %= mod print(solve[int(input())]) if __name__ == '__main__': main()