矩阵快速幂
关注
分享
扫一扫
mengxiang000000
这个作者很懒，什么都没留下…
展开
专栏收录文章
- 默认排序
- 最新发布
- 最早发布
- 最多阅读
- 最少阅读
-
杭电1575（矩阵快速幂）Tr A
Tr ATime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3778 Accepted Submission(s): 2820Problem DescriptionA为一个方阵，则Tr A表示A的迹（就是主对角原创 2015-12-03 18:08:10 · 551 阅读 · 0 评论 -
Poj 3734 Blocks【递推+矩阵快速幂】好题
BlocksTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 6239 Accepted: 2998DescriptionPanda has received an assignment of painting a line of blocks. Sin原创 2016-10-12 13:02:13 · 622 阅读 · 0 评论 -
51nod 1113 矩阵快速幂【裸题】【内含黑科技】
1113 矩阵快速幂基准时间限制：3 秒 空间限制：131072 KB 分值: 40 难度：4级算法题给出一个N * N的矩阵，其中的元素均为正整数。求这个矩阵的M次方。由于M次方的计算结果太大，只需要输出每个元素Mod (10^9 + 7）的结果。Input第1行：2个数N和M，中间用空格分隔。N为矩阵的大小，M为M次方原创 2016-12-02 19:35:00 · 706 阅读 · 0 评论 -
Codeforces 514E Darth Vader and Tree【Dp+矩阵快速幂优化】
E. Darth Vader and Treetime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputWhen Darth Vader gets bored, he sits down on原创 2017-02-04 20:55:56 · 625 阅读 · 0 评论 -
51nod 1358 浮波那契【思维+矩阵快速幂】好题！
1358 浮波那契基准时间限制：1 秒 空间限制：131072 KB 分值: 40 难度：4级算法题TengBieBie已经学习了很多关于斐波那切数列的性质，所以他感到一些些厌烦。现在他遇到了一个新的数列，这个数列叫做Float-Bonacci。这里有一个关于Float-Bonacci的定义。对于一个具体的n，TengBieBie想要快速计算FB原创 2017-01-30 19:01:50 · 592 阅读 · 0 评论 -
Codeforces 621E Wet Shark and Blocks【Dp+矩阵快速幂】
E. Wet Shark and Blockstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputThere are b blocks of digits. Each one consis原创 2017-04-19 17:04:47 · 578 阅读 · 0 评论 -
Fzu 2198 快来快来数一数【矩阵快速幂】
Problem 2198 快来快来数一数Accept: 218 Submit: 704Time Limit: 1000 mSec Memory Limit : 65536 KB Problem Descriptionn个六边形排成一行，相邻两个六边形共用一条边，如下图所示：记这个图形的生成树个数为t(n)（由于每条边都是不同的，不存在同构的问题）原创 2017-06-07 15:41:56 · 403 阅读 · 0 评论 -
Codeforces 821E Okabe and El Psy Kongroo【Dp+矩阵快速幂】套路题
E. Okabe and El Psy Kongrootime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputOkabe likes to take walks but knows that原创 2017-06-26 15:48:23 · 1835 阅读 · 0 评论 -
Hrbust 1401 九连环【递推+矩阵快速幂】
九连环Time Limit: 1000 MSMemory Limit: 65536 KTotal Submit: 66(38 users)Total Accepted: 35(32 users)Rating: Special Judge: NoDescription相信大家都玩过九连原创 2017-07-17 11:19:47 · 654 阅读 · 0 评论 -
Hdu 6030 Happy Necklace【Dp+矩阵快速幂】
Happy NecklaceTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 513 Accepted Submission(s): 223Problem DescriptionLittle Q wa原创 2017-07-07 19:57:54 · 585 阅读 · 0 评论 -
Hdu 6198 number number number【矩阵快速幂】
number number numberTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 224 Accepted Submission(s): 145Problem DescriptionWe defi原创 2017-09-11 10:49:23 · 450 阅读 · 0 评论 -
hdu 5411 CRB and Puzzle【矩阵快速幂】
CRB and PuzzleTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1013 Accepted Submission(s): 402Problem DescriptionCRB is now playi原创 2016-06-18 17:25:45 · 417 阅读 · 0 评论 -
hrbust 1375 The Active Leyni【暴力打表+递推+矩阵快速幂】
The Active LeyniTime Limit: 1000 MSMemory Limit: 65536 K Total Submit: 111(43 users)Total Accepted: 51(40 users)Rating: Special Judge: No原创 2016-05-23 21:48:09 · 460 阅读 · 0 评论 -
hrbust/哈理工oj 1787 New Fibonacci Number【欧拉降幂+矩阵快速幂】
New Fibonacci NumberTime Limit: 1000 MSMemory Limit: 32768 KTotal Submit: 42(18 users)Total Accepted: 15(12 users)Rating: Special Judge: NoDescripti原创 2016-05-07 15:00:56 · 819 阅读 · 0 评论 -
hdu 5171 GTY's birthday gift【矩阵快速幂】【思维】【感受矩阵和数论的神奇】
GTY's birthday giftTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1176 Accepted Submission(s): 449Problem DescriptionFFZ's bir原创 2016-01-26 20:25:55 · 624 阅读 · 0 评论 -
POJ 3070 Fibonacci【矩阵快速幂】【感受数论的神奇】
FibonacciTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 11750 Accepted: 8341DescriptionIn the Fibonacci integer sequence, F0 = 0,F1 = 1, and Fn =Fn原创 2016-01-27 16:31:42 · 1056 阅读 · 0 评论 -
hrbust/哈理工oj 1126 Final Destination II【矩阵快速幂+递推】
Final Destination IITime Limit: 1000 MSMemory Limit: 65536 KTotal Submit: 342(97 users)Total Accepted: 139(75 users)Rating: Special Judge: NoDescripti原创 2016-03-22 15:09:47 · 903 阅读 · 1 评论 -
hrbust 1430 哈理工oj 1430 神秘植物【递推+矩阵快速幂】
神秘植物Time Limit: 1000 MSMemory Limit: 65536 KTotal Submit: 55(26 users)Total Accepted: 24(20 users)Rating: Special Judge: NoDescriptionLeyni有原创 2016-03-23 15:25:11 · 795 阅读 · 0 评论 -
hdu 2855 Fibonacci Check-up【递推+矩阵快速幂】
Fibonacci Check-upTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1306 Accepted Submission(s): 741Problem DescriptionEvery ALPC h原创 2016-04-29 21:26:13 · 713 阅读 · 0 评论 -
hdu 5667 Sequence【矩阵快速幂】
SequenceTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 285 Accepted Submission(s): 92Problem Description Holion August will原创 2016-04-16 23:36:54 · 5166 阅读 · 6 评论 -
hdu 4686 Arc of Dream【矩阵快速幂】
Arc of DreamTime Limit: 2000/2000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 3523 Accepted Submission(s): 1108Problem DescriptionAn Arc of Dre原创 2016-04-05 15:13:32 · 593 阅读 · 0 评论 -
hdu 2604 Queuing【递推+矩阵快速幂】
QueuingTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4185 Accepted Submission(s): 1858Problem DescriptionQueues and Priori原创 2016-03-31 15:12:19 · 636 阅读 · 0 评论 -
hdu 1757 A Simple Math Problem【矩阵快速幂】
A Simple Math ProblemTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3880 Accepted Submission(s): 2342Problem DescriptionLele原创 2016-03-29 17:01:17 · 604 阅读 · 0 评论 -
hrbust/哈理工oj 1592 六芒星【矩阵快速幂】
六芒星Time Limit: 1000 MSMemory Limit: 32768 K Total Submit: 115(44 users)Total Accepted: 49(37 users)Rating: Special Judge: No原创 2016-05-30 13:18:17 · 669 阅读 · 0 评论 -
Hdu 6185 Covering【递推+矩阵快速幂】
CoveringTime Limit: 5000/2500 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 317 Accepted Submission(s): 163Problem DescriptionBob's school has a原创 2017-09-02 15:35:40 · 1212 阅读 · 0 评论