2015年5月17日
POJ 3233 Matrix Power Series(矩阵快速幂+二分)
摘要： Time Limit:3000MSMemory Limit:131072KTotal Submissions:16986Accepted:7233DescriptionGiven an×nmatrixAand a positive integerk, find the sumS=A+A2+A3+ …... 阅读全文
posted @ 2015-05-17 00:32 BYYB_0506 阅读(191) 评论(0) 推荐(0) 编辑
POJ 3070 Fibonacci (矩阵快速幂)
摘要： FibonacciTime Limit:1000MSMemory Limit:65536KTotal Submissions:10440Accepted:7421DescriptionIn the Fibonacci integer sequence,F0= 0,F1= 1, andFn=Fn− 1... 阅读全文
posted @ 2015-05-17 00:17 BYYB_0506 阅读(138) 评论(0) 推荐(0) 编辑
HDU 2157 How many ways??(矩阵快速幂)
摘要： How many ways??Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1912Accepted Submission(s): 692Prob... 阅读全文
posted @ 2015-05-17 00:08 BYYB_0506 阅读(159) 评论(0) 推荐(0) 编辑