2021黑龙江省赛F-function

用欧拉线性筛的性质来求最小质数进而求得所求得函数
第二种情况
第三种情况

#include <iostream>
#include <algorithm>
#include <stdio.h>
#include <math.h>
#include <cstdio>
#include <iomanip>
#include <stack>
#include <string>
#include <cstring>
#include <queue>
#include <set>
#include <map>
#include <unordered_map>
#include <list>
#include <sstream>
#define endl '\n';
#pragma comment(linker,"/STACK:102400000,102400000")
const int inf = 0x3f3f3f3f;
typedef long long ll;
typedef unsigned long long ull;
typedef int itn;
const long double PI = acos(-1);
using namespace std;

const int N = 1e7 + 10;
int  vis[N], cnt,n, prime[N]; ll f[N];
ll get_prime(int n) {
    f[1] = 1;
    for (int i = 2; i <= n; i++) {
        if (!vis[i]) {
            prime[cnt++] = i;
            f[i] = 1;//本身是质数则f[i]为1
        }
        for (int j = 0; prime[j] <= n / i; j++) {
            vis[prime[j] * i] = 1;
            if (i % prime[j] == 0) {
            //这里是n为p1^k次方的情况
                int k = 1, p1 = prime[j], t = i;
                while (t % p1 == 0) {
                    t /= p1;
                    k++;
                }
                int e1 = floor(k / 2);
                //cout << i*p1<<' '<<e1 << ' ' << k  << endl;
                f[i*p1] = pow(p1, e1) * (1ll*i*p1 / pow(p1, k));
                //这里公式和第三种情况是一样的不过i是n^k所以后结果是p1^(k/2)
                break;
            }
            //如果没有在上面break则是三种情况
            int k = 1, p1 = prime[j], t = i;
            while (t % p1 == 0) {
                t /= p1;
                k++;
            }
            int e1 = floor(k / 2);
            f[i * p1] = pow(p1, e1) * (1ll * i * p1 / pow(p1, k));
        }
    }
    ll res = 0;
    for (int i = 1; i <= n; i++) {
        //cout << f[i] << ' ';
        res += f[i];
    }
    return res;
}
int main() {
    ios::sync_with_stdio(0); cin.tie(0);
    cin >> n;
    cout <<get_prime(n)  << endl;
}