SPOJ ETF - Euler Totient Function Solution

     Solution in c++:
     ///**********ALLAH IS ALMIGHTY************///
     ///AH Tonmoy
    ///Department of CSE,23rd batch
    ///Islamic University,Bangladesh
   #include<bits/stdc++.h>
using namespace std;
int phi(int n)
{
    float result = n;
    for (int p = 2; p * p <= n; ++p)
    {

        if (n % p == 0)
        {

            while (n % p == 0)
                n /= p;
            result *= (1.0 - (1.0 / (float)p));
        }
    }
    if (n > 1)
        result *= (1.0 - (1.0 / (float)n));

    return (int)result;
}

int main()
{
    int n,t;
    cin>>t;
    while(t--)
    {
      cin>>n;
      cout<<phi(n)<<endl;
    }

    return 0;
}