基于广为流传的gao(v, n-1)重构,删去了所有define,删减了断言语句(感觉问题不大), 适合没有define习惯得小伙伴取用.
下面是模板代码:
#define ll long long
using namespace std;
const ll mod = 998244353;
ll _pow(ll a, ll b)
{
ll res = 1;
a %= mod;
while(b)
{
if (b & 1) res = res * a % mod;
b >>= 1;
a = a * a % mod;
}
return res;
}
int n;
namespace BM
{
const int N = 1e3+5;
ll res[N], base[N], _c[N], _md[N];
vector<int> Md;
void mul(ll *a, ll *b, int k)
{
for (int i = 0; i < k + k; i++) _c[i] = 0;
for (int i = 0; i < k; i++) if (a[i])
for (int j = 0; j < k; j++)
_c[i+j] = (_c[i+j] + a[i] * b[j]) % mod;
for (int i = k+k-1; i>=k; i--) if (_c[i])
for (int j = 0; j < Md.size(); j++)
_c[i-k+Md[j]]=(_c[i-k+Md[j]]-_c[i]*_md[Md[j]])%mod;
for (int i = 0; i < k; i++)
a[i] = _c[i];
}
int solve(ll n, vector<int> a, vector<int> b)
{
ll ans = 0, pnt = 0;
int k = a.size();
for (int i = 0; i < k; i++) _md[k-1-i] = -a[i];
_md[k] = 1;
Md.clear();
for (int i = 0; i < k; i++) if (_md[i] != 0)
Md.push_back(i);
for (int i = 0; i < k; i++) res[i] = base[i] = 0;
res[0] = 1;
while((1ll << pnt) <= n) pnt++;
for (int p = pnt; p >= 0; p--)
{
mul(res, res, k);
if ((n >> p) & 1)
{
for (int i = k - 1; i >= 0; i--)
res[i+1] = res[i];
res[0] = 0;
for (int j = 0; j < Md.size(); j++)
res[Md[j]] = (res[Md[j]] - res[k] * _md[Md[j]]) % mod;
}
}
for (int i = 0; i < k; i++) ans = (ans + res[i] * b[i]) % mod;
if (ans < 0) ans += mod;
return ans;
}
vector<int> CalBM(vector<int> s)
{
vector<int> C(1, 1), B(1, 1);
int L = 0, m = 1, b = 1;
for (int n = 0; n < s.size(); n++)
{
ll d = 0;
for (int i = 0; i <= L; i++)
d = (d + 1ll * C[i] * s[n-i]) % mod;
if (d == 0) m++;
else if (L<<1 <= n)
{
vector<int> T = C;
ll c = mod - d * _pow(b, mod-2) % mod;
while(C.size() < B.size() + m) C.push_back(0);
for (int i = 0; i < B.size(); i++)
C[i+m] = (C[i+m] + c * B[i]) % mod;
L = n+1-L; B = T; b = d; m = 1;
}
else
{
ll c = mod - d * _pow(b, mod-2) % mod;
while(C.size() < B.size() + m) C.push_back(0);
for (int i = 0; i < B.size(); i++)
C[i+m] = (C[i+m] + c * B[i]) % mod;
m++;
}
}
return C;
}
int giao(vector<int> a, ll n)
{
vector<int> c =CalBM(a);
c.erase(c.begin());
for (int i = 0; i < c.size(); i++) c[i] = (mod - c[i]) % mod;
return solve(n, c, vector<int>(a.begin(), a.begin() + c.size()));
}
}