給定一個整數 $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
Limite de temps : 0.5 s
Limite de mémoire : 64 MB
Points totaux : 100
#23685. 階乘
Statistiques
Problème utilisé dans ces concours :
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.