poj2478

/* * poj2478.cpp * * Created on: 2010-8-9 * Author: friendy */ //欧拉函数 #include #include #include #define M 1000001 using namespace std; /* bool f[1000001]; int p[40000]; int N[1000001]; int pNum=0; void prime(){ int i,j; for(i=2;i<1000001;i++){ if(!f[i]){p[pNum++]=i;N[i]=i-1;} for(j=0;j <1000001;j++){ f[p[j]*i]=true; if(i%p[j]==0){ N[i*p[j]]=N[i]*p[j]; break; } else N[i*p[j]]=N[i]*(p[j]-1); } } } */ int p[400010], pNum; long long phi[M]; bool f[M]; void Prime() { int i, j; for(i = 2; i < M; i++) { if(!f[i]) { p[pNum++] = i; phi[i] = i-1;} for(j = 0; j < pNum && p[j] * i < M; j++ ) { f[p[j]*i] = 1; if(i % p[j] == 0){ phi[i*p[j]] = phi[i] * p[j]; break; } else phi[i*p[j]] = phi[i] *(p[j] - 1); } } } int main(){ int n,i; Prime(); phi[1]=0; for(i=2;i<1000001;i++){ phi[i]+=phi[i-1]; } while(scanf("%d",&n),n){ printf("%lld/n",phi[n]); } return 0; }