101778C. Professor Agasa Lab

求出小于某数m与其互质的数的数量与(m-1)的乘积
用欧拉函数做很简单

#include <bits/stdc++.h>
#define push_back pb
#define make_pair mp;
#define int long long
using namespace std;
typedef pair<int,int> pii;
const int mod=1e9+7;
const int maxn=1e6+5;
int E[maxn];
void euler()
{
    E[1]=1;
    for(int i=2;i<maxn;i++){
        if(!E[i])
        for(int j=i;j<maxn;j+=i){
            if(!E[j])E[j]=j;
            E[j]=E[j]/i*(i-1);
        }
    }
}
signed main()
{
    ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);

    int _;
    cin>>_;
    euler();
    //cout<<q_pow(1,mod-2)<<endl;
    while(_--){
        int n;
        cin>>n;
        cout<<(n-1)*E[n]<<endl;
    }
}