![](https://img-blog.csdnimg.cn/20201014180756930.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
hdu
revstar_
分享快乐
展开
-
hdu 2524
hdu 2524N - 暴力求解、打表Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uDescription给你一个高为n ,宽为m列的网格,计算出这个网格中有多少个矩形,下图为高为2,宽为4的网格. Input第一行输入一个原创 2015-07-28 09:50:20 · 525 阅读 · 0 评论 -
hdu 1405
DescriptionTomorrow is contest day, Are you all ready? We have been training for 45 days, and all guys must be tired.But , you are so lucky comparing with many excellent boys who have no chance原创 2015-08-19 15:55:29 · 632 阅读 · 0 评论 -
hdu 2669
DescriptionThe Sky is Sprite. The Birds is Fly in the Sky. The Wind is Wonderful. Blew Throw the Trees Trees are Shaking, Leaves are Falling. Lovers Walk passing, and so are You. .....原创 2015-08-18 20:09:15 · 841 阅读 · 0 评论 -
hdu 1969
PieTime Limit: 5000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 109 Accepted Submission(s): 52Problem Description原创 2015-08-05 09:20:01 · 594 阅读 · 0 评论 -
hdu 1222
DescriptionThere is a hill with n holes around. The holes are signed from 0 to n-1.A rabbit must hide in one of the holes. A wolf searches the rabbit in anticlockwise order. The原创 2015-08-18 08:53:50 · 866 阅读 · 0 评论 -
poj 4548
Description 小明对数的研究比较热爱,一谈到数,脑子里就涌现出好多数的问题,今天,小明想考考你对素数的认识。 问题是这样的:一个十进制数,如果是素数,而且它的各位数字和也是素数,则称之为“美素数”,如29,本身是素数,而且2+9 = 11也是素数,所以它是美素数。 给定一个区间,你能计算出这个区间内有多少个美素数吗? Input第原创 2015-08-17 21:06:47 · 506 阅读 · 0 评论 -
HDU1372:Knight Moves(BFS)
DescriptionA friend of you is doing research on theTraveling Knight Problem (TKP) where you are to find the shortest closed tour of knight moves that visits each square of a given set ofn square原创 2015-07-22 08:06:50 · 363 阅读 · 0 评论 -
hdu 2602
DescriptionMany years ago , in Teddy’s hometown there was a man who was called “Bone Collector”. This man like to collect varies of bones , such as dog’s , cow’s , also he went to the grave …T原创 2015-08-13 10:59:41 · 917 阅读 · 0 评论 -
HDU 1276 士兵队列训练问题
Description某部队进行新兵队列训练,将新兵从一开始按顺序依次编号,并排成一行横队,训练的规则如下:从头开始一至二报数,凡报到二的出列,剩下的向小序号方向靠拢,再从头开始进行一至三报数,凡报到三的出列,剩下的向小序号方向靠拢,继续从头开始进行一至二报数。。。,以后从头开始轮流进行一至二报数、一至三报数直到剩下的人数不超过三人为止。原创 2015-07-21 10:30:10 · 680 阅读 · 0 评论 -
hdu 2955
DescriptionThe aspiring Roy the Robber has seen a lot of American movies, and knows that the bad guys usually gets caught in the end, often because they become too greedy. He has decided to work i原创 2015-08-12 21:54:13 · 521 阅读 · 0 评论 -
Missing number HDU5166
DescriptionThere is a permutation without two numbers in it, and now you know what numbers the permutation has. Please find the two numbers it lose. InputThere is a number s原创 2015-07-17 09:46:51 · 398 阅读 · 0 评论 -
acm HDU1005
DescriptionA number sequence is defined as follows: f(1) = 1, f(2) = 1, f(n) = (A * f(n - 1) + B * f(n - 2)) mod 7. Given A, B, and n, you are to calculate the value of f(n).原创 2015-07-17 09:43:14 · 412 阅读 · 0 评论 -
hdu 1003
DescriptionGiven a sequence a[1],a[2],a[3]......a[n], your job is to calculate the max sum of a sub-sequence. For example, given (6,-1,5,4,-7), the max sum in this sequence is 6 + (-1) + 5 + 4 = 1原创 2015-08-10 20:57:06 · 636 阅读 · 0 评论 -
HDU 1799
Description 我们知道,在编程中,我们时常需要考虑到时间复杂度,特别是对于循环的部分。例如, 如果代码中出现 for(i=1;i那么做了n次OP运算,如果代码中出现 fori=1;i for(j=i+1;j那么做了n*(n-1)/2 次OP 操作。 现在给你已知有m层for循环操作,且每次fo原创 2015-07-28 19:30:37 · 501 阅读 · 0 评论 -
hdu 4911Inversion
Descriptionbobo has a sequence a 1,a2,…,a n. He is allowed to swap twoadjacent numbers for no more than k times. Find the minimum number of inversions after his swaps. Note: The number原创 2015-08-09 18:42:39 · 830 阅读 · 0 评论 -
hdu 1465
Description大家常常感慨,要做好一件事情真的不容易,确实,失败比成功容易多了! 做好“一件”事情尚且不易,若想永远成功而总从不失败,那更是难上加难了,就像花钱总是比挣钱容易的道理一样。 话虽这样说,我还是要告诉大家,要想失败到一定程度也是不容易的。比如,我高中的时候,就有一个神奇的女生,在英语考试的时候,竟然把40个单项选择题全部做错了!大家都学过概率论,应该知道出现这种原创 2015-08-19 20:31:35 · 759 阅读 · 0 评论