Kerin的博客

参考 class TrieNode { public: vector<TrieNode*> children; bool isWord; TrieNode() : isWord(false), children(26, nullptr) { } ~TrieNode() { for (auto& c : children) delete c; } };

#include <iostream> #include <bits/stdc++.h> using namespace std; #define mod 998244353 #define ll long long ll numa[100005]={0};//numa[i]当前位置往后有多少a ll fastPow(ll base,ll n){ ll ans=1;//单位元 while(n){ if(n&1) ans=(ans*base)%m

a156=a100111002=a27∗1+26∗0+25∗0+24∗1+23∗1+22∗1+21∗0+20∗0a^{156}=a^{10011100_2}=a^{2^7*1 + 2^6*0 + 2^5*0+2^4*1+2^3*1+2^2*1+2^1*0+2^0*0}a156=a100111002​=a27∗1+26∗0+25∗0+24∗1+23∗1+22∗1+21∗0+20∗0 普通快速幂的模板： int fastPow(int base,int n,int mod){ int ans=1;//单