算法模板
Unango
打怪升级
展开
-
矩阵快速幂模板
#include<bits/stdc++.h>using namespace std;typedef long long ll;const int Matr = 4;const ll mod = 1e9 + 7;class mat{public: ll a[Matr][Matr], size; mat(int len){ size = len; memse...原创 2018-08-14 11:07:04 · 157 阅读 · 0 评论 -
求组合数模板
typedef long long ll;const ll mod = 1e9+7;const int mmax = 1e5 + 10;ll fac[mmax + 5];ll inv[mmax + 5];ll qpow(ll a, ll b) { ll r = 1, t = a; while (b) { if (b & 1)r = (r*...转载 2018-08-16 11:38:29 · 225 阅读 · 0 评论