ETF - Euler Totient Function
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 φ.
First line contains an integer T, the number of test cases. (T <= 20000)
T following lines, each contains an integer n.
T lines, one for the result of each test case.
Input: 5 1 2 3 4 5 Output: 1 1 2 2 4
@abhisek_1357, read this https://cp-algorithms.com/algebra/phi-function.html
read this topic
@abhisek_1357, you need to divide it before multiplying. otherwise you will have integer overflow.
Can someone please share his/her approach ...and also if possible please debugg mine...
AC in one GO !! :)