ACM_(矩阵)快速幂
RaAlGhul
这个作者很懒,什么都没留下…
展开
-
集训队专题(2)1001 Fibonacci
FibonacciTime Limit : 2000/1000ms (Java/Other) Memory Limit : 131072/65536K (Java/Other)Total Submission(s) : 53 Accepted Submission(s) : 41Problem DescriptionIn the Fibonacci原创 2016-01-30 23:02:09 · 560 阅读 · 0 评论 -
集训队专题(2)1002 Tr A
Tr ATime Limit : 1000/1000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 35 Accepted Submission(s) : 24Problem DescriptionA为一个方阵,则Tr A表示A的迹(就是主对角线上各项原创 2016-01-30 23:05:09 · 622 阅读 · 0 评论 -
集训队专题(2)1003 Matrix Power Series
Matrix Power SeriesTime Limit : 6000/3000ms (Java/Other) Memory Limit : 262144/131072K (Java/Other)Total Submission(s) : 51 Accepted Submission(s) : 26Problem DescriptionGiven原创 2016-01-30 23:07:50 · 571 阅读 · 0 评论 -
集训队专题(2)1005 A Simple Math Problem
A Simple Math ProblemTime Limit : 3000/1000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 25 Accepted Submission(s) : 23Problem DescriptionLele now i原创 2016-01-30 23:37:25 · 686 阅读 · 0 评论 -
集训队专题(2)1006 Mistwald
MistwaldTime Limit : 4000/2000ms (Java/Other) Memory Limit : 131072/65536K (Java/Other)Total Submission(s) : 54 Accepted Submission(s) : 23Problem DescriptionIn chapter 4 of the ga原创 2016-01-30 23:48:05 · 512 阅读 · 0 评论 -
集训队专题(2)1007 Evolution
EvolutionTime Limit : 10000/5000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 52 Accepted Submission(s) : 18Problem DescriptionEvolution is a long,原创 2016-01-30 23:54:30 · 555 阅读 · 0 评论 -
集训队专题(2)1004 Queuing
QueuingTime Limit : 10000/5000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 29 Accepted Submission(s) : 18Problem DescriptionQueues and Priority Que原创 2016-01-30 23:14:45 · 488 阅读 · 0 评论 -
HDOJ 1420 Prepared for New Acmer
Prepared for New AcmerTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 8103 Accepted Submission(s): 3098Problem Description集训进原创 2016-02-11 18:11:39 · 341 阅读 · 0 评论 -
BestCoder Round #80 Segment
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=5666让我们先看看这道题目的官方题解1002考虑一条以(0,0)(0,0)为起点,(x,y)(x,y)为终点的线段上格点的个数(不包含端点时),一定是gcd(x,y)-1gcd(x,y)−1,这个很显然吧.然后整个网格图范围内的格点数目是\frac {q*(q-1原创 2016-04-17 10:22:03 · 510 阅读 · 0 评论