矩阵快速幂
c_3Po_
这个作者很懒,什么都没留下…
展开
-
POJ - 3070 Fibonacci (矩阵快速幂)
推出构造矩阵是 {1,1,1,0}剩下就好写了,矩阵相乘就行了//#include <bits/stdc++.h>#include <cstdio>#include <cstring>using namespace std;typedef long long LL;const int maxn=1e5+5;const int maxm=5...原创 2019-03-05 22:46:16 · 116 阅读 · 0 评论 -
CodeForces - 450B Jzzhu and Sequences (矩阵快速幂)
Jzzhu has invented a kind of sequences, they meet the following property:You are givenxandy, please calculatefnmodulo1000000007(109 + 7).InputThe first line contains two integersxand...原创 2019-03-06 21:04:02 · 222 阅读 · 0 评论 -
hdu 4990 Reading comprehension (矩阵快速幂)
题目链接根据题目中给的程序,跑出来前几个数,推导一下如果 i 为奇数ans = (ans * 2 + 1) % m反之ans = ans * 2 % m矩阵快速幂加速即可#include<bits/stdc++.h>using namespace std;const int maxn=3000+5;typedef long long ll;ll...原创 2019-03-07 13:40:04 · 153 阅读 · 0 评论 -
hdu 4549 M斐波那契数列 (矩阵快速幂)
题目链接题意及做法很简单,但是答案会溢出,看了看网上大佬们的题解,发现这么个东西,学到了费马小定理:若p是素数,gcd(a,p)=1,则a^(p-1)1(mod p)。若a^b mod p 中b很大,则可以简化为a^b mod p=a^[b mod (p-1)] mod p证明如下:b=t*(p-1)+r,其中r为b除以(p-1)的余数,即为b mod (p-1)。a^...原创 2019-03-07 21:22:04 · 244 阅读 · 0 评论 -
UVA - 10689 Yet another Number Sequence (矩阵快速幂)
题目链接基本是裸题,取模要处理一下用一个mod数组记录值int md[] = {0, 10, 100, 1000, 10000};#include<bits/stdc++.h>using namespace std;const int maxn=3000+5;//const int mod=1e9+7;typedef long long ll;int a,b,...原创 2019-03-07 23:35:16 · 128 阅读 · 0 评论 -
华南理工大学“三七互娱杯”程序设计竞赛(重现赛)B HRY and fibonacci
链接:https://ac.nowcoder.com/acm/contest/874/B来源:牛客网题目描述HRY is a pupil. He has just learned about Fibonacci sequence recently, and he made some new sequences :fic(n)=∑ni=1fib(i)fic(n)=∑i=1n...原创 2019-04-28 20:18:53 · 296 阅读 · 0 评论