关闭

HDU 5171 GTY's birthday gift(矩阵快速幂)

GTY's birthday gift Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 1080    Accepted Submission(s): 413 Problem Description FFZ's b...
阅读(184) 评论(0)

指数循环节

指数循环节 在有些题目中我们需要对指数进行降幂处理才能计算。比如计算             其中和   这里由于很大,所以需要进行降幂。那么实际上有如下降幂公式              有了上述公式,很多题目就可以得到解决。 题目:http://acm.fzu.edu.cn/problem.php?pid=1759...
阅读(651) 评论(0)

HDU 5167 Fibonacci(DFS暴力搜索)

Fibonacci Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 1905    Accepted Submission(s): 479 Problem Description Following is the ...
阅读(185) 评论(0)

HDU 5154 Harry and Magical Computer(找环)

Harry and Magical Computer Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1743    Accepted Submission(s): 684 Problem Description ...
阅读(205) 评论(0)

ZOJ 3818 Pretty Poem

Pretty Poem Time Limit:2000MS     Memory Limit:65536KB     64bit IO Format:%lld & %llu Submit Status Practice ZOJ 3818 Description Poetry is a form of literature that uses aesthetic ...
阅读(217) 评论(0)

HDU 5147 Sequence II (线段树求前缀和、后缀和)

Problem Description Long long ago, there is a sequence A with length n. All numbers in this sequence is no smaller than 1 and no bigger than n, and all numbers are different in this sequence. Pleas...
阅读(157) 评论(0)

HDU 4998 Rotate (几何变换——旋转)

Rotate Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 815    Accepted Submission(s): 389 Special Judge Problem Description Noting i...
阅读(364) 评论(0)

几何变换(二维、三维)

几何变换 窗口区到视图区的坐标变换     实际的窗口区与视图区往往不一样大小,要在视图区正确地显示形体的,必须将其从窗口区变换到视图区。    比例关系,两者的变换公式为:     可以简单地将两者的关系表示为:        二维图形的几何变换     正如我们在附录中提到的那样,用齐次坐标表示点的变换将非常方便,因此在本节中所有的几何变换都将采用齐次坐标进...
阅读(1104) 评论(0)

HDU 5139 Formula(递推公式、离线处理)

Formula Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1094    Accepted Submission(s): 384 Problem Description f(n)=(∏i=1nin−i+1)%...
阅读(254) 评论(0)

HDU 5144 NPY and shot(三分角度)

NPY and shot Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 761    Accepted Submission(s): 309 Problem Description NPY is going to...
阅读(272) 评论(0)

HDU 5143 NPY and arithmetic progression (枚举基本类型123、234、1234的个数)

NPY and arithmetic progression Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 799    Accepted Submission(s): 254 Problem Description...
阅读(304) 评论(0)

HDU 5407 CRB and Candies

CRB and Candies Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 584    Accepted Submission(s): 292 Problem Description CRB has N di...
阅读(263) 评论(0)

HDU 5419 Victor and Toys ()

Victor and Toys Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 262144/131072 K (Java/Others) Total Submission(s): 467    Accepted Submission(s): 157 Problem Description Victor has...
阅读(199) 评论(0)

HDU 5056 Boring count(不超过k个字符的子串个数)

Boring count Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 828    Accepted Submission(s): 342 Problem Description You are given a...
阅读(508) 评论(0)

莫比乌斯函数

莫比乌斯函数 在讲这个函数之前。最好先了解欧拉函数。 我们用 \  记为整除。 记得小学的时候整除和整除以的概念么?别混淆。 2整除4 记作 2\4。 欧拉函数用来表示。 那么根据法里级数的展开(这个感觉和ACM关系不大就先不介绍了。大概讲的就是构造所有最简分数的一种树。而法里级数n定义分母 比如对于分母为12. 化简后: 分别...
阅读(318) 评论(0)
137条 共10页1 2 3 4 5 ... 下一页 尾页
    个人资料
    • 访问:47170次
    • 积分:1788
    • 等级:
    • 排名:千里之外
    • 原创:137篇
    • 转载:0篇
    • 译文:0篇
    • 评论:4条
    文章分类
    最新评论