
ACM_(矩阵)快速幂
文章平均质量分 83
RaAlGhul
这个作者很懒,什么都没留下…
展开
-
集训队专题(2)1001 Fibonacci
Fibonacci Time Limit : 2000/1000ms (Java/Other) Memory Limit : 131072/65536K (Java/Other) Total Submission(s) : 53 Accepted Submission(s) : 41 Problem Description In the Fibonacci原创 2016-01-30 23:02:09 · 610 阅读 · 0 评论 -
集训队专题(2)1002 Tr A
Tr A Time Limit : 1000/1000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other) Total Submission(s) : 35 Accepted Submission(s) : 24 Problem Description A为一个方阵,则Tr A表示A的迹(就是主对角线上各项原创 2016-01-30 23:05:09 · 657 阅读 · 0 评论 -
集训队专题(2)1003 Matrix Power Series
Matrix Power Series Time Limit : 6000/3000ms (Java/Other) Memory Limit : 262144/131072K (Java/Other) Total Submission(s) : 51 Accepted Submission(s) : 26 Problem Description Given原创 2016-01-30 23:07:50 · 604 阅读 · 0 评论 -
集训队专题(2)1005 A Simple Math Problem
A Simple Math Problem Time Limit : 3000/1000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other) Total Submission(s) : 25 Accepted Submission(s) : 23 Problem Description Lele now i原创 2016-01-30 23:37:25 · 722 阅读 · 0 评论 -
集训队专题(2)1006 Mistwald
Mistwald Time Limit : 4000/2000ms (Java/Other) Memory Limit : 131072/65536K (Java/Other) Total Submission(s) : 54 Accepted Submission(s) : 23 Problem Description In chapter 4 of the ga原创 2016-01-30 23:48:05 · 552 阅读 · 0 评论 -
集训队专题(2)1007 Evolution
Evolution Time Limit : 10000/5000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other) Total Submission(s) : 52 Accepted Submission(s) : 18 Problem Description Evolution is a long,原创 2016-01-30 23:54:30 · 584 阅读 · 0 评论 -
集训队专题(2)1004 Queuing
Queuing Time Limit : 10000/5000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other) Total Submission(s) : 29 Accepted Submission(s) : 18 Problem Description Queues and Priority Que原创 2016-01-30 23:14:45 · 529 阅读 · 0 评论 -
HDOJ 1420 Prepared for New Acmer
Prepared for New Acmer Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 8103 Accepted Submission(s): 3098 Problem Description 集训进原创 2016-02-11 18:11:39 · 378 阅读 · 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 · 543 阅读 · 0 评论