[原根][数论][二项式定理] LOJ #6247. 九个太阳

$Solution$

原题

$$\begin{eqnarray} w & = & G^{P-1\over k}\\ ans & = & \sum_{i=0}^n{n\choose i}[k\mid i]\\ & = & \sum_{i=0}^n{n\choose i}{1\over k}\sum_{j=0}^{k-1}w_{ij}\\ & = & {1\over k}\sum_{j=0}^{k-1}(w^j+1)^n \end{eqnarray}$$

#include <bits/stdc++.h>
#define show(x) cerr << #x << " = " << x << endl
using namespace std;
typedef long long ll;
typedef pair<int, int> Pairs;

const int G = 3;
const int MOD = 998244353;

inline int pow(int a, int b) {
    int c = 1;
    while (b) {
        if (b & 1) c = (ll)c * a % MOD;
        b >>= 1; a = (ll)a * a % MOD;
    }
    return c;
}
inline int inv(int x) {
    return pow(x, MOD - 2);
}
inline void add(int &x, int a) {
    x += a; while (x >= MOD) x -= MOD;
}

ll nn;
int n, k, w, w0, ans;

int main(void) {
    cin >> nn >> k; n = nn % (MOD - 1);
    w0 = w = pow(G, (MOD - 1) / k);
    for (int j = 0; j < k; j++) {
        add(ans, pow(w0 + 1, n));
        w0 = (ll)w0 * w % MOD;
    }
    ans = (ll)ans * inv(k) % MOD;
    cout << ans << endl;
    return 0;
}