POJ 2478 Farey Sequence

欧拉函数- -！

#include<iostream>
#include<string>
#include<cstring>
#include<cmath>
#include<cstdio>
#define N 1000010
#define maxn 1000000
using namespace std;
long long phi[N],ans[N];
int main()
{
    int i,j,n;
    for(i=1;i<=maxn;i++)
        phi[i]=i;
    for(i=2;i<=maxn;i+=2)
        phi[i]/=2;
    for(i=3;i<=maxn;i+=2)
        if(phi[i]==i)
            for(j=i;j<=maxn;j+=i)
                phi[j]=phi[j]/i*(i-1);
    ans[2]=phi[2];
    for(i=3;i<=maxn;i++)
        ans[i]=ans[i-1]+phi[i];
  //  freopen("sample.txt","r",stdin);
    while(cin>>n,n)
        cout<<ans[n]<<endl;
	return 0;
}

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
using namespace std;
#define maxn 1000000
bool vis[1000010];
int prime[1000010];
long long phi[1000010],ans[1000010];
int main()
{
	int n,i,j,cnt=0;
	memset(vis,false,sizeof(vis));
	for(i=2;i<=maxn;i++)
		if(!vis[i])
		{
			prime[cnt++]=i;
			for(j=i<<1;j<=maxn;j+=i)
				vis[j]=true;
		}
	phi[1]=1;
	for(i=1;i<=maxn;i++)
		for(j=0;j<cnt&&i*prime[j]<=maxn;j++)
			if(i%prime[j])
				phi[i*prime[j]]=(prime[j]-1)*phi[i];
			else
			{
				phi[i*prime[j]]=prime[j]*phi[i];
				break;
			}
	ans[2]=1;
	for(i=3;i<=maxn;i++)
		ans[i]=ans[i-1]+phi[i];
	//freopen("sample.txt","r",stdin);
	while(cin>>n,n)
		cout<<ans[n]<<endl;
	//system("pause");
	return 0;
}