【开源社区openEuler实践】 G. Natlan Exploring

题目

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define fi first
#define se second
#define lson p << 1
#define rson p << 1 | 1
#define ll long long
#define pii pair<int, int>
#define ld long double
const int maxn = 1e6 + 5, inf = 1e9, maxm = 4e4 + 5, base = 337;
const int N = 1e6;
// const int mod = 1e9 + 7;
const int mod = 998244353;
// const __int128 mod = 212370440130137957LL;
int n, m;
int a[maxn], b[maxn];

void solve(){
    ll res = 0;
    int k, q;
    cin >> n;
    vector<int> a(n + 1);
    for(int i = 1; i <= n; i++){
        cin >> a[i];
    }
    vector<int> c(N + 1, 1);
    c[1] = 0;
    vector<vector<int>> divs(N + 1);
    for(int i = 2; i <= N; i++){
        for(int j = i; j <= N; j += i){
            divs[j].pb(i);
            if(j != i){
                c[j] -= c[i]; //容斥
            }
        }
    }
    vector<int> f(n + 1, 0), sum(N + 1, 0);
    f[1] = 1;
    for(auto j : divs[a[1]]){
        sum[j] = (sum[j] + f[1]) % mod;//sum[j] = 连加f[i](i满足a[i] % j == 0)
    }
    for(int i = 2; i <= n; i++){
        for(auto j : divs[a[i]]){
            f[i] = (f[i] + sum[j] * c[j] % mod + mod) % mod;
        }
        for(auto j : divs[a[i]]){
            sum[j] = (sum[j] + f[i]) % mod;
        }
    }
    cout << f[n] << '\n';
}

signed main(){
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout << fixed << setprecision(9);

    int T = 1;
    // cin >> T;
    while (T--){
        solve();
    }
    return 0;
}