这道题考的是对线性筛的理解,读懂题意,再根据题意模拟,最重要的是想想题目那些是必须要做的,那些是可以省略的,这就是算法,相差很大的。
#include <bits/stdc++.h>
#define IOS ios::sync_with_stdio(false)
#define endl '\n'
using namespace std;
typedef long long ll;
const int N = 1E7 + 10;
unordered_map<int, int> ump;
int n;
int prime[N];
bool vis[N];
ll ans = 1;
int f[N];
void oula(int n)
{
f[1] = 1;
for (int i = 2; i <= n; ++i)
{
if (!vis[i])
{
vis[i] = true;
prime[++prime[0]] = i;
ans++;
f[i] = 1;
}
for (int j = 1; j <= prime[0] && i * prime[j] <= n; ++j)
{
vis[i * prime[j]] = true;
if (i % prime[j] == 0)
{
int k = 1, p = prime[j], t = i;
while (t % p == 0)
{
t = t / p;
k++;
}
int z = k / 2;
ans = ans + pow(p, z) * (1ll*i * p / pow(p, k));
f[i * p] = pow(p, z) * (1ll*i * p / pow(p, k));
break;
}
int p = prime[j];
ans = ans + 1 * i;
f[i * p] = 1 * i;
}
}
}
int main()
{
IOS; cin.tie(0), cout.tie(0);
int n;
cin >> n;
oula(n);
cout << ans << endl;
return 0;
}