hdu4556(欧拉函数)

#include<cstdio>
#include<iostream>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<queue>
using namespace std;
#define lc l,m,index<<1
#define rc m+1,r,index<<1|1
#define ll long long
#define inf 0x3f3f3f3f
#define N 1000005
ll n;
ll phi[N],ans[N]; 
void mkphilist() 
{ 
	int i,j; 
	phi[1]=1;
	for(i=2;i<N;++i) 
	{
		if(!phi[i]) 
		{
			for(j=i;j<N;j+=i) 
			{ 
				if(!phi[j])phi[j]=j; 
				phi[j]-=phi[j]/i; 
			} 
		}
	}
	//以上是计算欧拉函数
	ans[1]=3;
	for(i=2;i<N;i++)ans[i]=ans[i-1]+2*phi[i];
}
int main()
{
	mkphilist();
	while(scanf("%I64d",&n)!=EOF)
	{
		printf("%I64d\n",ans[n]);
	}
	return 0;
}