题目传送:UVA - 10820
思路:找出1~n之间的所有互质的整数对,可以用欧拉函数做,先打出50000以内的欧拉函数的表,然后累加即可
AC代码:
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <cmath>
#include <queue>
#include <stack>
#include <vector>
#include <map>
#include <set>
#include <deque>
#include <cctype>
#define LL long long
#define INF 0x7fffffff
using namespace std;
int phi[50005];
void phi_table(int n, int* phi) {
for(int i = 0; i <= n; i ++) phi[i] = 0;
phi[1] = 1;
for(int i = 2; i <= n; i ++) {
if(!phi[i]) {
for(int j = i; j <= n; j += i) {
if(!phi[j]) phi[j] = j;
phi[j] = phi[j] / i * (i - 1);
}
}
}
}
int main() {
phi_table(50005, phi);
int n;
while(scanf("%d", &n) != EOF) {
if(n == 0) break;
int ans = 0;
for(int i = 2; i <= n; i ++) {
ans += phi[i];
}
ans *= 2;
ans ++;
printf("%d\n", ans);
}
return 0;
}