上一页 1 ··· 13 14 15 16 17 18 19 20 21 ··· 29 下一页
摘要: Virtual FriendsTime Limit: 4000/2000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3677Accepted Submission(s): 1059Problem DescriptionThese days, you can do all sorts of things online. For example, you can use various websites to make virtual friends. For some people, 阅读全文
posted @ 2014-03-24 20:31 heaventouch 阅读(328) 评论(0) 推荐(0) 编辑
摘要: Dragon BallsTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2373Accepted Submission(s): 926Problem DescriptionFive hundred years later, the number of dragon balls will increase unexpectedly, so it's too difficult for Monkey King(WuKong) to gath 阅读全文
posted @ 2014-03-24 13:15 heaventouch 阅读(549) 评论(0) 推荐(0) 编辑
摘要: find the most comfortable roadTime Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3240Accepted Submission(s): 1373Problem DescriptionXX星有许多城市,城市之间通过一种奇怪的高速公路SARS(Super Air Roam Structure---超级空中漫游结构)进行交流,每条SARS都对行驶在上面的Flycar限制了固定的Speed,同时XX星人对 Flycar的“舒 阅读全文
posted @ 2014-03-23 11:55 heaventouch 阅读(326) 评论(0) 推荐(0) 编辑
摘要: More is betterTime Limit: 5000/1000 MS (Java/Others)Memory Limit: 327680/102400 K (Java/Others)Total Submission(s): 12171Accepted Submission(s): 4481Problem DescriptionMr Wang wants some boys to help him with a project. Because the project is rather complex,the more boys come, the better it will be. 阅读全文
posted @ 2014-03-22 17:10 heaventouch 阅读(250) 评论(0) 推荐(0) 编辑
摘要: Is It A Tree?Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 12108Accepted Submission(s): 2757Problem DescriptionA tree is a well-known data structure that is either empty (null, void, nothing) or is a set of one or more nodes connected by directed 阅读全文
posted @ 2014-03-22 16:16 heaventouch 阅读(2131) 评论(0) 推荐(0) 编辑
摘要: PusherTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/65536 K (Java/Others)Total Submission(s): 754Accepted Submission(s): 264Special JudgeProblem DescriptionPusherBoy is an online game http://www.hacker.org/push . There is an R * C grid, and there are piles of blocks on some positions. Th 阅读全文
posted @ 2014-03-22 15:01 heaventouch 阅读(325) 评论(0) 推荐(0) 编辑
摘要: A Bug's LifeTime Limit: 15000/5000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 7176Accepted Submission(s): 2330Problem DescriptionBackgroundProfessor Hopper is researching the sexual behavior of a rare species of bugs. He assumes that they feature two different 阅读全文
posted @ 2014-03-21 18:28 heaventouch 阅读(792) 评论(0) 推荐(0) 编辑
摘要: 非常可乐Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4142Accepted Submission(s): 1691Problem Description大家一定觉的运动以后喝可乐是一件很惬意的事情,但是seeyou却不这么认为。因为每次当seeyou买了可乐以后,阿牛就要求和seeyou一起分享这一瓶可乐,而且一定要喝的和seeyou一样多。但seeyou的手中只有两个杯子,它们的容量分别是N 毫升和M 毫升 可乐的体积为S (S13 # 阅读全文
posted @ 2014-03-21 13:35 heaventouch 阅读(233) 评论(0) 推荐(0) 编辑
摘要: 乘法逆元 1 /*************************************** 2 函数:ExGcd 3 功能:求两个数的最大公约数和模P的乘法逆元。 4 输入:a,b 输入参数,求这两个数的最大公约数 5 和a模b的逆元 或 b模a的逆元。 6 输出:x,y 分别表示a模b的逆元和b模a的逆元。 7 返回:r 表示a b 的最大公约数。 8 *************************************/ 9 int Exgcd(int a,int b,int &x,int &y)10 {11 if(b==0){12 x=1;13... 阅读全文
posted @ 2014-03-20 21:30 heaventouch 阅读(166) 评论(0) 推荐(0) 编辑
摘要: RSATime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1243Accepted Submission(s): 901Problem DescriptionRSA is one of the most powerful methods to encrypt data. The RSA algorithm is described as follow:> choose two large prime integer p, q> calc 阅读全文
posted @ 2014-03-20 21:23 heaventouch 阅读(491) 评论(0) 推荐(0) 编辑
摘要: Rank of TetrisTime Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4323Accepted Submission(s): 1220Problem Description自从Lele开发了Rating系统,他的Tetris事业更是如虎添翼,不久他遍把这个游戏推向了全球。为了更好的符合那些爱好者的喜好,Lele又想了一个新点子:他将制作一个全球Tetris高手排行榜,定时更新,名堂要比福布斯富豪榜还响。关于如何排名,这个不用说都知道是根据 阅读全文
posted @ 2014-03-20 13:44 heaventouch 阅读(340) 评论(0) 推荐(0) 编辑
摘要: 仙人球的残影Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4742Accepted Submission(s): 2120Problem Description在美丽的HDU,有一名大三的同学,他的速度是众所周知的,跑100米仅仅用了2秒47,在他跑步过程中会留下残影的哎,大家很想知道他是谁了吧,他叫仙人球,既然名字这样了,于是他的思想是单一的,他总是喜欢从一点出发,经过3次转折(每次向右转90°),回到出发点,而且呢,他每次转折前 阅读全文
posted @ 2014-03-19 18:26 heaventouch 阅读(291) 评论(0) 推荐(0) 编辑
摘要: Sudoku KillerTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3674Accepted Submission(s): 1160Problem Description自从2006年3月10日至11日的首届数独世界锦标赛以后,数独这项游戏越来越受到人们的喜爱和重视。据说,在2008北京奥运会上,会将数独列为一个单独的项目进行比赛,冠军将有可能获得的一份巨大的奖品———HDU免费七日游外加lcy亲笔签名以及同hdu acm team合影留 阅读全文
posted @ 2014-03-18 21:16 heaventouch 阅读(277) 评论(0) 推荐(0) 编辑
摘要: 符号三角形Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 811Accepted Submission(s): 403Problem Description符号三角形的 第1行有n个由“+”和”-“组成的符号 ,以后每行符号比上行少1个,2个同号下面是”+“,2个异 号下面是”-“ 。计算有多少个不同的符号三角形,使其所含”+“ 和”-“ 的个数相同 。 n=7时的1个符号三角形如下:+ + - + - + ++ - - - - +- + + 阅读全文
posted @ 2014-03-17 20:06 heaventouch 阅读(614) 评论(0) 推荐(0) 编辑
摘要: Fire NetTime Limit:2 Seconds Memory Limit:65536 KBSuppose that we have a square city with straight streets. A map of a city is a square board with n rows and n columns, each representing a street or a piece of wall.A blockhouse is a small castle that has four openings through which to shoot. The fou 阅读全文
posted @ 2014-03-16 19:33 heaventouch 阅读(470) 评论(0) 推荐(0) 编辑
上一页 1 ··· 13 14 15 16 17 18 19 20 21 ··· 29 下一页