给定一个整数 $n$ ($2 \le n \le 100000000$)。请编写一个程序，求出使得 $m$ 的阶乘能被 $n$ 整除的最小正整数 $m$。其中，对于正整数 $m$，$m$ 的阶乘是指从 $1$ 到 $m$ 的所有整数的乘积。
输入
输入在文件 factorial.in 中给出。该文件由一行组成，写有一个整数 $n$。
输出
程序需将结果输出到标准输出。请输出仅包含整数 $m$ 的一行。
样例
输入 1
10
输出 1
5
输入 2
12
输出 2
4
QOJ.ac
QOJ
Time Limit: 0.5 s
Memory Limit: 64 MB
Total points: 100
#23685. 阶乘
Statistics
The problem was used in the following contests:
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.