Problems > Sum of GCDs with N

Sum of GCDs with N

Difficulty: 1900 5000 ms 128 MB

number-theory

Print ∑i=1..N gcd(i, N).

Input: one integer N.

Output: the sum of gcd(i, N).

Constraints:

  • 1 ≤ N ≤ 1012

Sample Tests

Input 1
6
Output 1
15
Input 2
1
Output 2
1

Read the Editorial

Discussion (opens after you solve — no spoilers before)

No comments yet.

Submit Your Solution

Log in or create a free account to run and submit code.