快速矩阵幂
相知无悔
这个作者很懒,什么都没留下…
展开
-
poj3744 Scout YYF I
Scout YYF ITime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 4023 Accepted: 1029DescriptionYYF is a couragous scout. Now he is on a dangerous mission whic原创 2013-08-20 09:52:57 · 678 阅读 · 0 评论 -
hdu4546 So Easy! 矩阵乘法
So Easy!Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 899 Accepted Submission(s): 244Problem Description A sequence Sn is defined as原创 2013-08-14 21:45:18 · 791 阅读 · 0 评论 -
poj3519 Lucky Coins Sequence矩阵快速幂
Lucky Coins SequenceTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 608 Accepted Submission(s): 319Problem DescriptionAs we all know,ev原创 2013-07-31 08:51:29 · 1240 阅读 · 0 评论 -
Codeforces Round #196 (Div. 2) C. Quiz
C. Quiztime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputManao is taking part in a quiz. The quiz consists of原创 2013-08-17 10:01:23 · 885 阅读 · 0 评论 -
Codeforces Round #209 (Div. 2) C. Prime Number
C. Prime Numbertime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputSimon has a prime number x and an array of n原创 2013-11-03 00:26:11 · 1896 阅读 · 5 评论 -
Codeforces Round #291 (Div. 2) E. Darth Vader and Tree 矩阵快速幂
E. Darth Vader and Treetime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputWhen Darth Vader gets bored, he sit原创 2015-07-06 12:29:23 · 951 阅读 · 0 评论 -
Codeforces Round #313 (Div. 2) E. Gerald and Giant Chess 定理Lucas求大组合数
E. Gerald and Giant Chesstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputGiant chess is quite common in Ge原创 2015-07-24 00:36:30 · 1952 阅读 · 0 评论 -
foj2198 Problem 2198 快来快来数一数 dp 矩阵快速幂
Problem 2198 快来快来数一数 Accept: 67 Submit: 194 Time Limit: 1000 mSec Memory Limit : 65536 KB Problem Description n个六边形排成一行,相邻两个六边形共用一条边,如下图所示:记这个图形的生成树个数为t(n)(由于每条边都是不同的,不存在同构的问题)。那么t(1)=6,t(2原创 2015-10-07 00:25:23 · 591 阅读 · 0 评论