python/TangDou/AcWing/RongChi/HDU2204_2.cpp

#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int N = 100 + 100;
ll mu[N * 100], primes[N * 100], st[N * 100];
int cnt;

void get_mobius() {
    mu[1] = 1;
    for (int i = 2; i < N; i++) {
        if (!st[i]) {
            primes[cnt++] = i;
            mu[i] = -1;
        }
        for (int j = 0; j < cnt; j++) {
            ll t = primes[j] * i;
            if (primes[j] > N / i) {
                break;
            }
            st[t] = 1;
            if (i % primes[j] == 0) {
                mu[t] = 0;
                break;
            }
            mu[t] = -mu[i];
        }
    }
}
int main() {
    get_mobius();
    ll tmp;
    while (cin >> tmp) {
        ll sum = 1;
        for (ll i = 2; i <= 64; i++) {
            sum -= mu[i] * (ll)(pow(tmp * 1.0, 1.0 / i) - 1);
        }
        cout << sum << endl;
    }
    return 0;
}