因子統計 (Ex) - المسألة

#401. 因子統計 (Ex)

الإحصائيات

تم استخدام هذه المسألة في المسابقات التالية:

Elegia's Forgotten Hill

تم إعداد هذه المسألة بواسطة Elegia .

AI Translation — This statement was translated using AI and may contain inaccuracies. Please refer to the original statement if in doubt.

題目描述

你有 $q$ 組詢問，每組詢問你需要計算出組合數 $\binom{n}{m}$ 的因子數量。

由於答案可能很大，你只需要輸出將答案對 $p = 10^9 + 7$ 取模的結果即可。

輸入格式

第一行一個正整數 $q$ 表示詢問數量。

接下來 $q$ 行，每行兩個整數 $n, m$，保證 $0\le m \le n$。

輸出格式

輸出 $q$ 行，每行一個整數對應該詢問的答案。

子任務

對於 $10\%$ 的資料，保證 $q \le 10^{3}, n \le 10^{3}$。

對於 $50\%$ 的資料，保證 $q \le 10^{5}, n \le 10^{5}$。

對於 $100\%$ 的資料，保證 $q \le 5\times 10^{5}, n \le 10^{6}$。

範例數據

範例 1 輸入

範例 1 輸出

範例 2 輸入

範例 2 輸出

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:

This is not a place to publish discussions, editorials, or requests to debug your code. Issues are only visible to you and problem moderators.
Do not submit duplicated issues.
Issues must be filed in English or Chinese only.

Active Issues 0

No issues in this category.

Closed/Resolved Issues 0