2020ICPC 江西省大学生程序设计竞赛A-A Simple Math Problem 莫比乌斯反演

传送门： https://ac.nowcoder.com/acm/contest/8827/A

题意

$$求解\sum _{i=1}^n\sum _{j=1}^i[gcd(i,j)=1]F[j]$$
$F[j]为j各个数位之和，例如F[123]=1+2+3=6。$

思路

$前置技能：\phi \ast id=\mu \mu \ast I=\epsilon$
$先来看{\sum }_{i=1}^n{\sum }_{j=1}^{i}F[j]，可以直接等价于{\sum }_{i=1}^n{\sum }_{j=i}^{n}F[i]，可手动验证一下。$

$$\sum _{i=1}^n\sum _{j=1}^i[gcd(i,j)=1]F[j]$$

$$\sum _{i=1}^n\sum _{j=i}^{n}F[i]\sum _{d|id|j}\mu (d)$$

$枚举d：$
$$\sum _{i=1}^{n}F[i]\sum _{d|i}\mu (d)\sum _{\lfloor \frac{i}{d}\rfloor }^{\lfloor \frac{n}{d}\rfloor }1$$

$$\sum _{i=1}^{n}F[i]\left(\sum _{d|i}\mu (d)\ast (\frac{n-i}{d})\right)$$

$$\sum _{i=1}^{n}F[i]\left(\sum _{d|i}\mu (d)\frac{n}{d}-\sum _{d|i}\mu (d)\frac{i}{d}\right)$$

$设f(i)={\sum }_{d|i}\mu (d)\frac{n}{d}，{\sum }_{d|i}\mu (d)\frac{i}{d}=\phi ，得：$

$$\sum _{i=1}^{n}F[i]\ast (f(i)-\phi (i))$$

$\mu 、\phi 、F和f预处理，然后O(n)得答案。$

Code（20MS）

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pdd;

#define INF 0x3f3f3f3f
#define lowbit(x) x & (-x)
#define mem(a, b) memset(a , b , sizeof(a))
#define FOR(i, x, n) for(int i = x;i <= n; i++)

// const ll mod = 998244353;
const ll mod = 1e9 + 7;
// const double eps = 1e-6;
// const double PI = acos(-1);
// const double R = 0.57721566490153286060651209;

const int N = 1e6 + 10;

int mu[N], f[N], phi[N];
int F[N];
bool is_prime[N];
int prime[N];
int cnt;

int n;

int Clac(int x) {
    int res = 0;
    while(x) {
        res += x % 10;
        x /= 10;
    }
    return res;
}

void Init() {
    mu[1] = 1;is_prime[0] = is_prime[1] = true;
    for(int i = 2;i < N; i++) {
        if (!is_prime[i]) {
            mu[i] = -1;
            phi[i] = i - 1;
            prime[++cnt] = i;
        }
        for (int j = 1; j <= cnt && i * prime[j] < N; j++) {
            is_prime[i * prime[j]] = true;
            if(i % prime[j]) {
                phi[i * prime[j]] = phi[i] * (prime[j] - 1);
            }
            else {
                phi[i * prime[j]] = phi[i] * prime[j];
                mu[i * prime[j]] = 0;
                break;
            }
            mu[i * prime[j]] = -mu[i];
        }
    }
    for(int i = 1;i <= n; i++) {
        F[i] = Clac(i);
        for(int j = i;j <= n; j += i) {
            f[j] += mu[i] * (n / i);
        }
    }
}

void solve() {
    cin >> n;
    Init();
    ll ans = 0;
    for(int i = 1;i <= n; i++) {
        ans += 1ll * F[i] * (f[i] - phi[i]);
    }
    cout << ans << endl;
}

signed main() {
    ios_base::sync_with_stdio(false);
    //cin.tie(nullptr);
    //cout.tie(nullptr);
#ifdef FZT_ACM_LOCAL
    freopen("in.txt", "r", stdin);
    freopen("out.txt", "w", stdout);
    signed test_index_for_debug = 1;
    char acm_local_for_debug = 0;
    do {
        if (acm_local_for_debug == '$') exit(0);
        if (test_index_for_debug > 20)
            throw runtime_error("Check the stdin!!!");
        auto start_clock_for_debug = clock();
        solve();
        auto end_clock_for_debug = clock();
        cout << "Test " << test_index_for_debug << " successful" << endl;
        cerr << "Test " << test_index_for_debug++ << " Run Time: "
             << double(end_clock_for_debug - start_clock_for_debug) / CLOCKS_PER_SEC << "s" << endl;
        cout << "--------------------------------------------------" << endl;
    } while (cin >> acm_local_for_debug && cin.putback(acm_local_for_debug));
#else
    solve();
#endif
    return 0;
}