Time Limit: 1s → 0.5s
Longge 的数学成绩非常好，并且他非常乐于挑战高难度的数学问题。现在问题来了：给定一个整数 $N$，你需要求出 $\sum_{i=1}^N \gcd(i, N)$。
输入格式
一个整数，为 $N$。
输出格式
一个整数，为所求的答案。
样例数据
样例输入
6样例输出
15子任务
对于 $60\%$ 的数据，$0 < N \leq 2^{16}$。
对于 $100\%$ 的数据，$0 < N \leq 2^{32}$。
QOJ.ac
QOJ
As we are currently experiencing an overwhelming number of web requests for fetching user submissions, we have temporarily disabled the full submissions list. You must now be logged in to view submissions.
Time Limit:
0.5 s
Memory Limit:
128 MB
Total points:
100
#4136. Longge 的问题
الإحصائيات
تم استخدام هذه المسألة في المسابقات التالية:
Discussions
About Discussions
The discussion section is only for posting: Editorials, 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. Submitting multiple issues may cause your account to be banned.
- 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.