文章分类 -  HDOJ

1042 N!
摘要:Problem DescriptionGiven an integer N(0 ≤ N ≤ 10000), your task is to calculate N!InputOne N in one line, process to the end of file.OutputFor each N, output N! in one line.Sample InputSample Ou... 阅读全文

posted @ 2010-09-20 21:18 にんじゃ 阅读(537) 评论(0) 推荐(0)

1040 As Easy As A+B
摘要:As Easy As A+BTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 12502Accepted Submission(s): 5006Problem DescriptionThese days, I am thinking about a ... 阅读全文

posted @ 2010-09-20 16:38 にんじゃ 阅读(718) 评论(0) 推荐(0)

1039 Easier Done Than Said?
摘要:Problem DescriptionPassword security is a tricky thing. Users prefer simple passwords that are easy to remember (like buddy), but such passwords are often insecure. Some sites use random computer-gene... 阅读全文

posted @ 2010-09-16 21:58 にんじゃ 阅读(362) 评论(0) 推荐(0)

1038 Biker's Trip Odometer
摘要:Problem DescriptionMost bicycle speedometers work by using a Hall Effect sensor fastened to the front fork of the bicycle. A magnet is attached to one of the spokes on the front wheel so that it will ... 阅读全文

posted @ 2010-09-15 16:22 にんじゃ 阅读(382) 评论(0) 推荐(0)

1037 Keep on Truckin'
摘要:Problem DescriptionBoudreaux and Thibodeaux are on the road again . . ."Boudreaux, we have to get this shipment of mudbugs to Baton Rouge by tonight!""Don't worry, Thibodeaux, I already checked ahead.... 阅读全文

posted @ 2010-09-15 15:32 にんじゃ 阅读(351) 评论(0) 推荐(0)

1036 Average is not Fast Enough!
摘要:Problem DescriptionA relay is a race for two or more teams of runners. Each member of a team runs one section of the race. Your task is to help to evaluate the results of a relay race.You have to proc... 阅读全文

posted @ 2010-09-15 15:00 にんじゃ 阅读(312) 评论(0) 推荐(0)

hdoj 1035 Robot Motion
摘要:Robot MotionTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1287Accepted Submission(s): 592Problem DescriptionA robot has been programmed to follow ... 阅读全文

posted @ 2010-05-21 19:02 にんじゃ 阅读(419) 评论(0) 推荐(0)

hdoj 1034 Candy Sharing Game
摘要:Candy Sharing GameTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 800Accepted Submission(s): 485Problem DescriptionA number of students sit in a cir... 阅读全文

posted @ 2010-05-14 16:16 にんじゃ 阅读(446) 评论(0) 推荐(0)

hdoj 1033 Edge
摘要:EdgeTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 346Accepted Submission(s): 214Problem DescriptionFor products that are wrapped in small packings... 阅读全文

posted @ 2010-05-14 15:04 にんじゃ 阅读(260) 评论(0) 推荐(0)

hdoj 1032 The 3n + 1 problem
摘要:The 3n + 1 problemTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5146Accepted Submission(s): 1848Problem DescriptionProblems in Computer Science ar... 阅读全文

posted @ 2010-05-10 16:23 にんじゃ 阅读(704) 评论(0) 推荐(0)

HDOJ 1031 Design T-Shirt
摘要:Design T-ShirtTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 778Accepted Submission(s): 388Problem DescriptionSoon after he decided to design a T-s... 阅读全文

posted @ 2010-05-10 15:35 にんじゃ 阅读(479) 评论(0) 推荐(0)

hdoj 1030 Delta-wave
摘要:Problem DescriptionA triangle field is numbered with successive integers in the way shown on the picture below. The traveller needs to go from the cell with number M to the cell with number N. The tra... 阅读全文

posted @ 2010-05-09 16:58 にんじゃ 阅读(520) 评论(0) 推荐(0)

HDOJ 1029 Ignatius and the Princess IV
摘要:[代码] 阅读全文

posted @ 2010-05-09 15:32 にんじゃ 阅读(1197) 评论(0) 推荐(1)

hdoj 1028 Ignatius and the Princess III
摘要:[代码]Problem Description"Well, it seems the first problem is too easy. I will let you know how foolish you are later." feng5166 says."The second problem is, given an positive integer N, we define an eq... 阅读全文

posted @ 2010-04-19 10:46 にんじゃ 阅读(612) 评论(0) 推荐(0)

hdoj 1027 Ignatius and the Princess II
摘要:[代码] 阅读全文

posted @ 2010-04-19 10:36 にんじゃ 阅读(617) 评论(0) 推荐(0)

1026
摘要:[代码] 阅读全文

posted @ 2010-04-15 23:26 にんじゃ 阅读(308) 评论(0) 推荐(0)

1025
摘要:Problem DescriptionJGShining's kingdom consists of 2n(n is no more than 500,000) small cities which are located in two parallel lines.Half of these cities are rich in resource (we call them rich citie... 阅读全文

posted @ 2010-04-15 23:25 にんじゃ 阅读(459) 评论(0) 推荐(0)

1024
摘要:[代码] 阅读全文

posted @ 2010-04-15 23:24 にんじゃ 阅读(24929) 评论(0) 推荐(0)

1023
摘要:[代码] 阅读全文

posted @ 2010-04-15 23:22 にんじゃ 阅读(273) 评论(0) 推荐(0)

1022
摘要:Problem DescriptionAs the new term comes, the Ignatius Train Station is very busy nowadays. A lot of student want to get back to school by train(because the trains in the Ignatius Train Station is the... 阅读全文

posted @ 2010-04-15 23:20 にんじゃ 阅读(172) 评论(0) 推荐(0)