快速幂
acblacktea
永不放弃
展开
-
codeforces PLEASE 逆元快速幂
a[i] = (1-a[i-1])/2递推式推出正式公式 然后快速幂加逆元求出公式结果就行了#include<cstdio> #include<algorithm> #include<iostream> #include<cstring> #define mod 1000000007ll #define LL long long using namespace std; LL n; LL fast原创 2016-07-18 23:20:22 · 356 阅读 · 0 评论 -
codeforces 373div1 Sasha and Array 矩阵+线段树
用线段树储存价值和,因为矩阵 a1 * b + a2 * b + a3 * b + a4 * b + a5 * b = (a1 + a2 + a3 + a4 + a5) * b; 然后进行下优化,尽量减少快速幂的运算数量#include<cstdio> #include<algorithm> #include<iostream> #include<cstring> #define lson i<原创 2016-10-07 14:58:21 · 430 阅读 · 0 评论