![](https://img-blog.csdnimg.cn/20201014180756926.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
矩阵快速幂
Usher_Ou
这个作者很懒,什么都没留下…
展开
-
矩阵快速幂模板
int mod;const int NUM;//定义矩阵能表示的最大维数int N;//N表示矩阵的维数,以下的矩阵加法、乘法、快速幂都是按N维矩阵运算的struct Mat{//矩阵的类 LL a[NUM][NUM]; void init()//将其初始化为单位矩阵 { memset(a,0,sizeof(a)); for(int i=原创 2017-04-09 15:52:44 · 285 阅读 · 0 评论 -
POJ 3641 Pseudoprime numbers (快速幂)
Pseudoprime numbers Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 9817 Accepted: 4170 Description Fermat’s theorem states that for any prime number p and for any int原创 2017-04-09 15:47:35 · 306 阅读 · 0 评论 -
UVa 1374 Power Calculus (快速幂计算)
题意:给出x和正整数n,问最少需要几次乘除法 可以得到n = x^m//打表法对1~1000的数打表#include #include using namespace std;const int ans[]={0,1,2,2,3,3,4,3,4,4,5,4,5,5,5,4,5,5,6,5,6,6,6,5,6,6,6,6,7,6,6,5,6,6,7,6,7,7,7,6,7,7原创 2017-03-09 17:31:00 · 464 阅读 · 0 评论 -
POJ 1995 Raising Module Numbers
Raising Modulo Numbers Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 7740 Accepted: 4685 Description People are different. Some secretly read magazines full of inter原创 2017-04-10 20:13:50 · 245 阅读 · 0 评论