给定 $n, k$，计算 $\binom{n}{k} = \frac{n!}{k!(n-k)!} \pmod{2^{32}}$。
输入格式
两个整数 $n, k$ ($1 \le n \le 10^{18}, 0 \le k \le n$)。
输出格式
输出一个整数，表示计算结果。
样例
输入 1
4 2
输出 1
6
输入 2
1000000000 500000000
输出 2
4209467392
QOJ.ac
QOJ
Límite de tiempo: 1.0 s
Límite de memoria: 512 MB
Puntuación total: 100
#7124. 二项式系数
Estadísticas
Este problema fue utilizado en los siguientes concursos:
Este problema fue preparado por
ftiasch .
AI Translation —
This statement was translated using AI and may contain inaccuracies. Please refer to the original statement if in doubt.
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
No issues in this category.