ETF  Euler Totient Function
https://codeforces.com/group/FLVn1Sc504/contest/274491/problem/D
In number theory, the totient φ of a positive integer n is defined to be the number of positive integers less than or equal to n that are coprime to n.
Given an integer n (1 <= n <= 10^6). Compute the value of the totient φ.
Input
First line contains an integer T, the number of test cases. (T <= 20000)
T following lines, each contains an integer n.
Output
T lines, one for the result of each test case.
Example
Input: 5 1 2 3 4 5 Output: 1 1 2 2 4
hide comments
prajjwal1999:
20200919 13:26:54
GOOD QUESTION


paxton:
20200901 16:52:41
@abhisek_1357, read this https://cpalgorithms.com/algebra/phifunction.html 

kishor_e:
20200811 09:40:37
read this topic


auler_:
20200715 15:52:51
@abhisek_1357, you need to divide it before multiplying. otherwise you will have integer overflow. 

abhisek_1357:
20200706 17:54:32
Can someone please share his/her approach ...and also if possible please debugg mine...


kumar_anubhav:
20200619 15:17:08
AC in one GO !! :)


coolboy7:
20200609 19:53:10
nice question 
Added by:  Race with time 
Date:  20090327 
Time limit:  1s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ERL JSRHINO NODEJS PERL6 VB.NET 