QOJ.ac

QOJ

Limite de temps : 1 s Limite de mémoire : 256 MB Points totaux : 100

#848. 組合數

Statistiques

定義

$$ f(n, m) = \sum_{i = 0}^m\binom n i $$

其中

$$ \binom{n}{i} = \frac{n!}{i!(n-i)!} $$

給定 $l, r, m$,請你對於 $l \le n \le r$,計算出 $f(n, m)$ 的值。

答案對 $P = 10^9 + 7$ 取模。

輸入格式

一行三個非負整數 $l, r, m$,保證 $m \le l \le r$。

輸出格式

輸出一行 $r - l + 1$ 個整數,第 $i$ 個表示 $f(l + i - 1, m)$ 的值。

範例

範例 1 輸入

10 20 10

範例 1 輸出

1024 2047 4083 8100 15914 30827 58651 109294 199140 354522 616666

說明 1

該組範例的資料範圍同第 8 個測試點。

子任務

對於 $100\%$ 的資料,$l, r, m \le 3\times 10^5$

測試點 $m,l,r$ 特殊限制
$1$ $\leq 1$ A
$2,3,4$ $\leq 100$ A
$5,6$ $\leq 2000$ B
$7$ $\leq 3\times 10^5$ B
$8,9$ $\leq 2000$
$10$ $\leq 3\times 10^5$

性質 A:滿足 $m=l=r$

性質 B:滿足 $l=r$

Discussions

About Discussions

The discussion section is only for posting: General Discussions (problem-solving strategies, alternative approaches), and Off-topic conversations.

This is NOT for reporting issues! If you want to report bugs or errors, please use the Issues section below.

Open Discussions 0
No discussions in this category.

Issues

About Issues

If you find any issues with the problem (statement, scoring, time/memory limits, test cases, etc.), you may submit an issue here. A problem moderator will review your issue.

Guidelines:

  1. This is not a place to publish discussions, editorials, or requests to debug your code. Issues are only visible to you and problem moderators.
  2. Do not submit duplicated issues.
  3. Issues must be filed in English or Chinese only.
Active Issues 0
No issues in this category.
Closed/Resolved Issues 0
No issues in this category.