题目链接:
POJ 2478 Farey Sequence
题意:
求n级法雷数列的元素个数。(不包含0/1, 1/1)
分析:
考虑n级法雷数列比n-1级法雷数列多出来的元素,可以得到:f[n] = f[n - 1] + euler[n]
#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <algorithm>
#include <climits>
#include <cmath>
#include <ctime>
#include <cassert>
#define IOS ios_base::sync_with_stdio(0); cin.tie(0);
using namespace std;
typedef long long ll;
const int MAX_N = 1000010;
int n;
ll euler[MAX_N], f[MAX_N];
void GetEuler()
{
memset(euler, 0, sizeof(euler));
euler[1] = 1;
for(int i = 2; i < MAX_N; i++){
if(euler[i] == 0){
for(int j = i; j < MAX_N; j += i){
if(euler[j] == 0) euler[j] = j;
euler[j] = euler[j] / i * (i - 1);
}
}
}
}
void init()
{
GetEuler();
f[2] = 1;
for(int i = 3; i < MAX_N; i++){
f[i] = f[i - 1] + euler[i];
}
}
int main()
{
init();
while(~scanf("%d", &n) && n){
printf("%lld\n", f[n]);
}
return 0;
}