欧拉函数

#include"string"
#include"sstream"
#include"iostream"
#include"stack"
using namespace std;
const int maxn=100000;
int minDiv[maxn],phi[maxn],sum[maxn];
int n;
void genPhi()
{
for(int i=1;i<maxn;++i)
minDiv[i]=i;
for(int i=2;i*i<maxn;++i)
if(minDiv[i]==i)
for(int j=i*i;j<maxn;j+=i)
minDiv[j]=i;
phi[1]=1;
for(int i=2;i<maxn;++i)
{
phi[i]=phi[i/minDiv[i]];
if((i/minDiv[i])%minDiv[i]==0)
phi[i]*=minDiv[i];
else
phi[i]*=minDiv[i]-1;
}
}
int main()
{
genPhi();
while(cin>>n)
{
cout<<phi
<<endl;
}
return 0;
}