因子统计 (Ex) - 問題

#401. 因子统计 (Ex)

統計

この問題は以下のコンテストで使用されています：

Elegia's Forgotten Hill

This problem is prepared by Elegia .

题目描述

你有 $q$ 组询问，每组询问你需要计算出组合数 $\binom{n}{m}$ 的因子数量。

由于答案可能很大，你只需要输出将答案对 $p = 10^9 + 7$ 取模的结果即可。

输入格式

第一行一个正整数 $q$ 表示询问数量。

接下来 $q$ 行，每行两个整数 $n, m$，保证 $0\le m \le n$。

输出格式

输出 $q$ 行，每行一个整数对应该询问的答案。

样例数据

样例 1 输入

样例 1 输出

样例 2 输入

样例 2 输出

子任务

对于 $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}$。

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:

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.
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.
Issues must be filed in English or Chinese only.
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