For this Question: In number theory, the totient Q(N) of a positive integer N is defined as the number of positive integers less than or equal to N that are co-prime to N.

Given an integer N. Compute the value of the totient Q(N) .First line contain integer t denoting number of test cases.
Next t lines contains an integer x. 

Constraints 
1<=t<=5
1<=x<=10^12For each test case print Q(n) in separate lineSample Input
4
1
2
3
6

Sample output
1
1
2
2, I have written this Solution Code: #include<bits/stdc++.h>
using namespace std;

#define pu push_back
#define fi first
#define se second
#define mp make_pair
#define int long long
#define pii pair<int,int>
#define mm (s+e)/2
#define all(x) x.begin(), x.end()
#define For(i, st, en) for(int i=st; i<en; i++)
#define tr(x) for(auto it=x.begin(); it!=x.end(); it++)
#define fast std::ios::sync_with_stdio(false);cin.tie(NULL);
#define sz 200000
int mod=1000000007;
int fact[sz];
int ifact[sz];
int lpf[2000000];
int power(int a,int b)
{
	if(a==0) return 0;
	if(a==1) return 1;
	if(b==0) return 1;
	if(b==1) return a;

	int xx=power(a,b/2);
	int yy=(xx*xx)%mod;
	if(b%2==0) return xx;
	else return (xx*a)%mod;
}
int inverse(int a)
{
	return power(a,mod-2LL);
}
int nCr(int a,int b)
{
	if(b>a) return 0;
	int x=fact[a];
	x=(x*ifact[b])%mod;
	x=(x*ifact[a-b])%mod;
	return x;
}
void seiv()
{
	lpf[1]=1;
	for(int i=2;i<=1000000;i++)
	{
		if(lpf[i]==0)
		{
			for(int j=i;j<=1000000;j+=i)
			{
				if(lpf[j]==0) lpf[j]=i;
			}
		}
	}
}
int totient(int n)
{     if(n==1) return 1;
	  
	  int vh=1;
    for(int i=2;i*i<=n;i++)
    	{      if(n%i==0)
    		{
               int x=i;
               int cnt=0;
               while(n%x==0) {
               	n/=x;
               	cnt++;
               }
               vh*=(pow(x,cnt)-pow(x,cnt-1));
           }

    }
    if(n>1) vh*=(n-1LL);
    return vh;

}
signed main()
{
	
        
			
      int t;
      cin>>t;
      while(t>0)
      	{t--;
      		int n;
      		cin>>n;
      cout<<totient(n)<<endl;

  }

          







	
}, In this Programming Language: C++, Now tell me if this Code is compilable or not?