Online Judge - 随笔分类(第6页) - NewPanderKing

ＨＤＵ　A + B Problem II

摘要：A + B Problem IITime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 307 Accepted Submission(s): 147 Problem DescriptionI have a very simple problem for you. Given two integers A and B, your job is to calculate the Sum of A + B.InputThe first line of 阅读全文

posted @ 2011-07-31 09:59 NewPanderKing 阅读(672) 评论(0) 推荐(0) 编辑

HDU Train Problem II

摘要：Train Problem IITime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 138 Accepted Submission(s): 80Problem DescriptionAs we all know the Train Problem I, the boss of the Ignatius Train Station want to know if all the trains come in strict-increasing or 阅读全文

posted @ 2011-07-29 16:07 NewPanderKing 阅读(564) 评论(0) 推荐(0) 编辑

HDU 献给杭电五十周年校庆的礼物

摘要：献给杭电五十周年校庆的礼物Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 119 Accepted Submission(s): 83Problem Description或许你曾经牢骚满腹或许你依然心怀忧伤或许你近在咫尺或许你我天各一方对于每一个学子母校永远航行在生命的海洋今年是我们杭电建校五十周年，这是一个值得祝福的日子。我们该送给母校一个怎样的礼物呢？对于目前的大家来说，最好的礼物当然是省赛中的好成绩，我不能参赛，就送给学校一个DOO 阅读全文

posted @ 2011-07-29 14:29 NewPanderKing 阅读(1247) 评论(0) 推荐(0) 编辑

HDU Wolf and Rabbit

摘要：Wolf and RabbitTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 335 Accepted Submission(s): 214Problem 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 ra 阅读全文

posted @ 2011-07-29 14:16 NewPanderKing 阅读(631) 评论(0) 推荐(0) 编辑

HDU 汉诺塔VII

摘要：汉诺塔VIITime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 203 Accepted Submission(s): 174 Problem Descriptionn个盘子的汉诺塔问题的最少移动次数是2^n-1,即在移动过程中会产生2^n个系列。由于发生错移产生的系列就增加了，这种错误是放错了柱子，并不会把大盘放到小盘上，即各柱子从下往上的大小仍保持如下关系： n=m+p+qa1>a2>...>amb1>b2> 阅读全文

posted @ 2011-07-29 14:14 NewPanderKing 阅读(888) 评论(0) 推荐(0) 编辑

HDU Digital Roots

摘要：Digital RootsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 176 Accepted Submission(s): 91Problem DescriptionThe digital root of a positive integer is found by summing the digits of the integer. If the resulting value is a single digit then that 阅读全文

posted @ 2011-07-26 21:48 NewPanderKing 阅读(269) 评论(0) 推荐(0) 编辑

HDU Fibonacci

摘要：FibonacciTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 448 Accepted Submission(s): 243Problem Description2007年到来了。经过2006年一年的修炼，数学神童zouyu终于把0到100000000的Fibonacci数列(f[0]=0,f[1]=1;f[i] = f[i-1]+f[i-2](i>=2))的值全部给背了下来。接下来，CodeStar决定要考考他，于是每问他一个数字阅读全文

posted @ 2011-07-26 21:47 NewPanderKing 阅读(552) 评论(0) 推荐(0) 编辑

Leftmost Digit

摘要：Leftmost DigitTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 453 Accepted Submission(s): 229Problem DescriptionGiven a positive integer N, you should output the leftmost digit of N^N.InputThe input contains several test cases. The first line of t 阅读全文

posted @ 2011-07-24 16:12 NewPanderKing 阅读(718) 评论(0) 推荐(0) 编辑

Elevator

摘要：Problem DescriptionThe highest building in our city has only one elevator. A request list is made up with N positive numbers. The numbers denote at which floors the elevator will stop, in specified order. It costs 6 seconds to move the elevator up one floor, and 4 seconds to move down one floor. The 阅读全文

posted @ 2011-07-23 16:35 NewPanderKing 阅读(266) 评论(0) 推荐(0) 编辑

Text Reverse

摘要：Text ReverseTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1027 Accepted Submission(s): 334Problem DescriptionIgnatius likes to write words in reverse way. Given a single line of text which is written by Ignatius, you should reverse all the words 阅读全文

posted @ 2011-07-23 16:34 NewPanderKing 阅读(1182) 评论(0) 推荐(0) 编辑

Box of Bricks

摘要：Box of BricksTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1450 Accepted Submission(s): 335Problem DescriptionLittle Bob likes playing with his box of bricks. He puts the bricks one upon another and builds stacks of different height. “Look, I\&# 阅读全文

posted @ 2011-07-23 16:30 NewPanderKing 阅读(1291) 评论(0) 推荐(0) 编辑

Nasty Hacks

摘要：Nasty HacksTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 483 Accepted Submission(s): 345Problem DescriptionYou are the CEO of Nasty Hacks Inc., a company that creates small pieces of malicious software which teenagers may useto fool their friend 阅读全文

posted @ 2011-07-23 16:29 NewPanderKing 阅读(359) 评论(0) 推荐(0) 编辑

The Seven Percent Solution

摘要：The Seven Percent SolutionTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 466 Accepted Submission(s): 307Problem DescriptionUniform Resource Identifiers (or URIs) are strings like http://icpc.baylor.edu/icpc/, mailto:foo@bar.org, ftp://127.0.0.1/p 阅读全文

posted @ 2011-07-23 16:28 NewPanderKing 阅读(1054) 评论(0) 推荐(0) 编辑

Identity Card

摘要：Identity CardTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 995 Accepted Submission(s): 310Problem DescriptionDo you own an ID card?You must have a identity card number in your family's Household Register. From the ID card you can get specifi 阅读全文

posted @ 2011-07-23 16:27 NewPanderKing 阅读(2862) 评论(0) 推荐(0) 编辑

Quicksum

摘要：QuicksumTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 447 Accepted Submission(s): 339Problem DescriptionA checksum is an algorithm that scans a packet of data and returns a single number. The idea is that if the packet is changed, the checksum w 阅读全文

posted @ 2011-07-23 16:15 NewPanderKing 阅读(1080) 评论(0) 推荐(0) 编辑

随笔分类 - Online Judge