結果

問題 No.1581 Multiple Sequence
ユーザー 已经死了
提出日時 2025-03-13 14:22:33
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 361 ms / 2,000 ms
コード長 3,062 bytes
コンパイル時間 392 ms
コンパイル使用メモリ 82,324 KB
実行使用メモリ 107,528 KB
最終ジャッジ日時 2025-03-13 14:22:44
合計ジャッジ時間 10,161 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 21
権限があれば一括ダウンロードができます

ソースコード

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

import os,sys,random,threading
#sys.exit() 退出程序
#sys.setrecursionlimit(10**6) #调整栈空间
from random import randint,choice,shuffle
#randint(a,b)从[a,b]范围随机选择一个数
#choice(seq)seq可以是一个列表,元组或字符串,从seq中随机选取一个元素
#shuffle(x)将一个可变的序列x中的元素打乱
from copy import deepcopy
from io import BytesIO,IOBase
from types import GeneratorType
from functools import lru_cache,reduce
#reduce(op,迭代对象)
from bisect import bisect_left,bisect_right
#bisect_left(x) 大于等于x的第一个下标
#bisect_right(x) 大于x的第一个下标
from collections import Counter,defaultdict,deque
from itertools import accumulate,combinations,permutations
#accumulate(a)用a序列生成一个累积迭代器，一般list化前面放个[0]做前缀和用
#combinations(a,k)a序列选k个 组合迭代器
#permutations(a,k)a序列选k个 排列迭代器
from heapq import  heapify,heappop,heappush
#heapify将列表转为堆
from typing import Generic,Iterable,Iterator,TypeVar,Union,List
from string import ascii_lowercase,ascii_uppercase,digits
#小写字母，大写字母，十进制数字
from math import ceil,floor,sqrt,pi,factorial,gcd,log,log10,log2,inf
#ceil向上取整，floor向下取整 ，sqrt开方 ，factorial阶乘
from decimal import Decimal,getcontext
#Decimal(s) 实例化Decimal对象,一般使用字符串
#getcontext().prec=100 修改精度
from sys import stdin, stdout, setrecursionlimit
input = lambda: sys.stdin.readline().rstrip("\r\n")
MI = lambda :map(int,input().split())
li = lambda :list(MI())
ii = lambda :int(input())
mod = int(1e9 + 7) #998244353
inf = 1<<60
py = lambda :print("YES")
pn = lambda :print("NO")
DIRS = [(0, 1), (1, 0), (0, -1), (-1, 0)]  # 右下左上
DIRS8 = [(0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1), (-1, 0),(-1, 1)]  # →↘↓↙←↖↑↗
# https://ac.nowcoder.com/acm/problem/list?tagId=14419%2C145467%2C145471%2C145474&sourceTagId=0&order=acceptPerson&asc=false
# https://www.baidu.com/s?ie=utf-8&f=8&rsv_bp=1&rsv_idx=1&tn=baidu&wd=%E7%BB%83%E4%B9%A0%E8%B5%9B%20%E7%BB%84%E5%90%88&fenlei=256&oq
    =%25E5%25B0%258F%25E7%2599%25BD%25E6%259C%2588%25E8%25B5%259B%2520%25E7%25BB%2584%25E5%2590%2588&rsv_pq=df67afaa01009013&rsv_t
    =b982WdmOKf8jiVhqVV7y79masa4Syl3F1yo52oKebsH0C99azfBAnzSgBXk&rqlang=cn&rsv_enter=1&rsv_dl=tb&rsv_sug3=16&rsv_sug1=11&rsv_sug7=100&bs
    =%E5%B0%8F%E7%99%BD%E6%9C%88%E8%B5%9B%20%E7%BB%84%E5%90%88
max_m = 100005
# Preprocess divisors for each number up to max_m
divisors = [[] for _ in range(max_m + 1)]
for d in range(1, max_m + 1):
    for multiple in range(d, max_m + 1, d):
        divisors[multiple].append(d)
# Precompute f(n)
max_f = max_m
f = [0] * (max_f + 1)
f[0] = 1
for n in range(1, max_f + 1):
    total = 0
    for c in divisors[n]:
        q = (n // c) - 1
        if q >= 0:
            total += f[q]
    f[n] = total%mod
# Read input m and compute the answer
m = ii()
ans = 0
for d in divisors[m]:
    k = (m // d) - 1
    if k >= 0:
        ans += f[k]
print(ans%mod)
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0