QOJ.ac

QOJ

Time Limit: 2 s Memory Limit: 512 MB Total points: 100

#8458. 操作序列计数

الإحصائيات

有个变量 $i$ ,初始 $i=1$ 。

现在有两种操作:

  1. $i=i+1$ ;
  2. $i=i \times k$ 。

给定 $n,k$ ,对于所有可能的 $L$ ,问有多少种操作序列,满足操作 $2$ 的个数为 $L$ ,且依次执行所有操作后,$i \le n$ 。

输入格式

第一行一个整数 $k$ 。

第二行一个整数 $n$ 。

输出格式

对于所有可能的 $L$ ,按 $L$ 从小到大的顺序,每行输出一个答案。

样例数据

样例输入

5
12

样例输出

12
11

子任务

对于所有数据,$2 \le k \le 10$,$1 \le n \le k^{50}$。

  • 子任务 $1$($3$ 分):$n \le 10^6$;
  • 子任务 $2$($10$ 分):$k=2$,$n\le 10^9$;
  • 子任务 $3$($20$ 分):$k=2$;
  • 子任务 $4$($20$ 分):$n \le 10^9$;
  • 子任务 $5$($20$ 分):$n \le 10^{18}$;
  • 子任务 $6$($27$ 分):无特殊限制。
About Issues

We understand that our problem archive is not perfect. If you find any issues with the problem, including the statement, scoring configuration, time/memory limits, test cases, etc.

You may use this form to submit an issue regarding the problem. A problem moderator will review your issue and proceed it properly.

STOP! Before you submit an issue, please READ the following guidelines:

  1. This is not a place to publish a discussion, editorial, or requests to debug your code. Your issue will only be visible by you and problem moderators. Other users will not be able to view or reply your issues.
  2. Do not submit duplicated issues. If you have already submitted one, please wait for an moderator to review it. Submitting multiple issues will not speed up the review process and might cause your account to be banned.
  3. Issues must be filed in English or Chinese only.
  4. Be sure your issue is related to this problem. If you need to submit an issue regarding another problem, contest, category, etc., you should submit it to the corresponding page.

Active Issues 0

No issues in this category.

Closed/Resolved Issues 0

No issues in this category.