Participate in exhilarating programming contests, solve unique algorithm and data structure challenges and be a part of an awesome community.

The Great Khami is learning Number Theory. He is very excited to know that Euler’s Totient Function is very useful in Cryptography. Euler’s Totient function, also known as the Phi function is defined over all positive integers. For each input value n, the function returns the number of co-primes with n that are less than n. Two numbers are said to be co-primes if their greatest common divisor is 1. Khami started exploring different properties of Euler’s Totient function. He became fascinated with one property of this function, it states:

Phi( N * M ) = Phi( N ) * Phi( M ), where N and M are co-primes.

Excited by this property, Khami went on to prove it. But it turned out that the proof itself is a demanding problem. It requires some fundamentals of number theory along with a complicated theorem called the Chinese Remainder Theorem or CRT.

Khami’s expedition continued as he mastered CRT and finally managed to prove the multiplicative property of Phi function. Desperate to show off his skills, he challenged others with the following problem:

”““For any integer N, find the sum of the numbers x from 1 to N-1, where the GCD of x and N, denoted as (x,n) is greater than 1. “””

The first line of the input contains T (<=1000000), the number of test cases. The next T lines have one number, each positive and within the range of 1000000.

For each test case, print the answer on a line by itself.

Input | Output |
---|---|

2 2 3 | 0 0 |

46% Solution Ratio

YouKnowWhoEarliest,

BSMRSTU_SurvivFastest, 0.1s

LU_TriSkeletonLightest, 11 MB

Shourav.978380Shortest, 410B

Login to submit