qyxpsx7的博客

图的传递闭包 判断结点 iii 到 jjj 是否有路径 for(int i = 1; i <= n; i++) can[i][i] = true; for(int k = 1; k <= n; k++) for(int i = 1; i <= n; i++) for(int j = 1; j <= n; j++) can[i][j] |= (cam[i][k...

高精度加法 int i; struct bignum{int len, num[260];} a,b,c; void strtobig(string s,bignum &d) { reverse(s.begin(), s.end()); for(i = 0; i < s.size(); i++) d.num[i+1] = int(s[i]-'0'); d....

取模模板 快速幂 inline ll P(ll a, ll b){ll c = 1;while{if(b&1) c = }}

截图来自xwm