Starry

NTT那块还要再看一下。。。 #include <cstdio> #include <iostream> #include <cmath> typedef long long ll; const int NR = 1 << 22, g = 3, gi = 332748118, mod = 998244353; using namespace std; int n, m, rev[NR]; ll a[NR], b[NR],c[NR],d[NR]; ll quikpow(ll a, ll k) {

NTT的做法 ec好像是linux的机子，回头学下gdb调试 #include <cstdio> #include <iostream> #include <cmath> typedef long long ll; const int NR = 1 << 22, g = 3, gi = 332748118, mod = 998244353; using namespace std; int n, m, rev[NR]; ll a[NR], b[NR]; ll quikpow(ll a, ll k)

#include<cstdio> #include<queue> #include<cstring> using namespace std; const int N=125100; int n,m,s,t,tot=1,hd[(int)6e4],cur[(int)6e4],ss,tt,dep[(int)6e4]; long long flow[(int)6e4],l[N]; struct Edge { int to,nxt; long long val; }e[N*3+99]; inline voi

cf predictor引入的jquery墙了，控制台插入： var script = document.createElement('script'); script.src = "https://lib.baomitu.com/jquery/3.3.1/jquery.min.js"; document.getElementsByTagName('head')[0].appendChild(script);

#include <algorithm> #include <bitset> #include <map> #include <vector> #include <string> #include <cstring> #include <iostream> #include <cmath> #include <stack> #include <set> #include <queue> /* #include<ext/pb_ds/