![](https://img-blog.csdnimg.cn/20201014180756927.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
数论
文章平均质量分 83
spring371327
奋力攀爬的蜗牛!
展开
-
矩阵快速幂
FibonacciTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 13372 Accepted: 9517DescriptionIn the Fibonacci integer sequence, F0 = 0, F1 = 1, and Fn = Fn原创 2016-09-23 19:48:12 · 220 阅读 · 0 评论 -
FOJ 1683(构造矩阵求递推式的前N项和)
Problem 1683 纪念SlingShotAccept: 564 Submit: 1975Time Limit: 1000 mSec Memory Limit : 32768 KB Problem Description已知 F(n)=3 * F(n-1)+2 * F(n-2)+7 * F(n-3),n>=3,其中F(0)=1,F(1)=3原创 2016-10-05 17:34:51 · 334 阅读 · 0 评论 -
CF 185A(递推式构造矩阵求解)
A. Planttime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputDwarfs have planted a very interesting plant, whic原创 2016-10-05 16:25:50 · 354 阅读 · 0 评论 -
根据递推公式构造系数矩阵用于快速幂
简单的例子Fibonacci数列考虑Fibonacci数列,F(n)=F(n−1)+F(n−2)将右边两项看做是一个列向量的形式,令 Xn−1={Fn−1Fn−2}很容易得到Xn的形式,即Xn={FnFn−1}现在的任务就是找到一个系数矩阵A,使得AXn−1=Xn,且A需与n无关。如果能够找到这个A,则易知An−1X1=Xn,转载 2016-10-05 12:55:37 · 518 阅读 · 0 评论 -
HDU 2855(由递推式构造矩阵+矩阵快速幂)
Fibonacci Check-upTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1356 Accepted Submission(s): 778Problem DescriptionEvery AL原创 2016-10-05 12:23:39 · 518 阅读 · 0 评论 -
POJ 2891(线性同余方程组的求解)
Strange Way to Express IntegersTime Limit: 1000MS Memory Limit: 131072KTotal Submissions: 14494 Accepted: 4743DescriptionElina is reading a book written by Ruji原创 2016-10-04 21:36:09 · 759 阅读 · 0 评论 -
POJ 1006(中国剩余定理)
BiorhythmsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 130708 Accepted: 41657DescriptionSome people believe that there are three cycles in a person's原创 2016-10-04 15:33:54 · 300 阅读 · 0 评论 -
POJ 1061(不定方程的最小正整数解)
青蛙的约会Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 108469 Accepted: 21745Description两只青蛙在网上相识了,它们聊得很开心,于是觉得很有必要见一面。它们很高兴地发现它们住在同一条纬度线上,于是它们约定各自朝西跳,直到碰原创 2016-10-04 14:31:55 · 3490 阅读 · 0 评论 -
C. Line(扩展欧几里得求不定方程的解)
C. Linetime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputA line on the plane is described by an equation Ax +原创 2016-10-04 12:50:43 · 459 阅读 · 0 评论 -
HDU 2588(欧拉函数的应用)
GCDTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1788 Accepted Submission(s): 895Problem DescriptionThe greatest common div原创 2016-10-03 11:19:54 · 353 阅读 · 0 评论 -
POJ 1845(Sumdiv) 数论好题
SumdivTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 19733 Accepted: 4987DescriptionConsider two natural numbers A and B. Let S be the sum of all nat原创 2016-10-02 21:37:07 · 734 阅读 · 0 评论 -
D. Soldier and Number Game
D. Soldier and Number Gametime limit per test3 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputTwo soldiers are playing a game.原创 2016-10-02 17:28:49 · 343 阅读 · 0 评论 -
HDU 5666(二进制模拟乘法)
SegmentTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1560 Accepted Submission(s): 577Problem Description Silen Aug原创 2016-10-02 15:40:55 · 502 阅读 · 1 评论 -
HDU 5833
Zhu and 772002Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1521 Accepted Submission(s): 542Problem DescriptionZhu and 7720原创 2016-10-02 00:32:58 · 641 阅读 · 0 评论 -
高斯消元模板
开关问题Time Limit: 1000MS Memory Limit: 30000KTotal Submissions: 7752 Accepted: 3047Description有N个相同的开关,每个开关都与某些开关有着联系,每当你打开或者关闭某个开关的时候,其他的与此开关相关联的开关也会相应地发生变化,即这些相联系原创 2016-09-30 17:25:49 · 548 阅读 · 0 评论 -
大数模板
#define MAXN 9999#define MAXSIZE 10#define DLEN 4class BigNum{ private: int a[500]; //可以控制大数的位数 int len; //大数长度public: BigNum(){ len = 1;memset(a,0,sizeof(a)); } //构造函数 BigNum转载 2016-09-25 21:45:21 · 218 阅读 · 0 评论 -
HDU 5950(Recursive sequence)
Recursive sequenceTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 29 Accepted Submission(s): 19Problem DescriptionFarmer John原创 2016-10-30 19:25:49 · 2915 阅读 · 1 评论