题目分析:
0.知识点:欧拉函数
1.参考详见:
题解
code:
#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
const int N = 1010;
int primes[N], cnt;
bool st[N];
int phi[N];
void init(int n)
{
phi[1] = 1;
for(int i = 2; i <= n; i ++)
{
if(!st[i])
{
primes[cnt ++] = i;
phi[i] = i - 1;
}
for(int j = 0; primes[j] <= n / i; j ++)
{
st[primes[j] * i] = true;
if(i % primes[j] == 0)
{
phi[i * primes[j]] = phi[i] * primes[j];
break;
}
else phi[i * primes[j]] = phi[i] * (primes[j] - 1);
}
}
}
int main()
{
init(N - 1);
int T;
cin >> T;
for(int i = 1; i <= T; i ++)
{
int n;
scanf("%d", &n);
int res = 1;
for(int i = 1; i <= n; i ++) res += phi[i] * 2;
cout << i << " " << n << " " << res << endl;
}
return 0;
}
总结:
1.输出答案时要写测试数据编号的用for循环。