poj 2478

euler函数的简单应用，只是要叠加，不过记得开long long

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<vector>
#include<algorithm>
#include<map>
using namespace std;
const int maxn = 1000000 + 10;
#define INF 0x3f3f3f3f
#define clr(x,y) memset(x,y,sizeof x )
typedef long long ll;
#define eps 10e-10
const ll Mod = 1000000007;
typedef pair<ll, ll> P;
int euler[maxn];
ll a[maxn];
void Init()
{
    euler[1] = 1;
    for(int i = 2; i < maxn; i ++)
        euler[i] = i;
    for(int i = 2; i < maxn; i ++)
        if(euler[i] == i)
        for(int j = i ; j < maxn; j += i)
        euler[j] = euler[j] /i *(i - 1);
    a[0] = 0;
    a[1] = 0;
    for(int i = 2; i < maxn; i ++)
        a[i] = a[i - 1] + euler[i];
//    cout << a[1] << " " << a[2] << endl;
}
int main()
{
    int n;
    Init();
    while( ~ scanf("%d",&n) && n)
    {
        printf("%lld\n",a[n]);
    }
    return 0;
}