随笔分类 -  water~

上一页 1 2 3 下一页
【Ignatius and the Princess IV - 专题训练-排序】
摘要：Ignatius and the Princess IVTime Limit:1000MSMemory Limit:32767KB64bit IO Format:%I64d & %I64uSubmitStatusAppoint description:Description"OK, you are not too bad, em... But you can never pass the next test." feng5166 says."I will tell you an odd number N, and then N integers. Ther 阅读全文
posted @ 2012-07-10 21:55 ismdeep 阅读(166) 评论(0) 推荐(0)
【As Easy As A+B - 专题训练-排序】
摘要：B -As Easy As A+BTime Limit:1000MSMemory Limit:32768KB64bit IO Format:%I64d & %I64uSubmitStatusAppoint description:DescriptionThese days, I am thinking about a question, how can I get a problem as easy as A+B? It is fairly difficulty to do such a thing. Of course, I got it after many waking nigh 阅读全文
posted @ 2012-07-10 21:27 ismdeep 阅读(252) 评论(0) 推荐(0)
【UVA - 488 Triangle Wave】
摘要：Triangle WaveIn this problem you are to generate a triangular wave form according to a specified pair of Amplitude and Frequency.Input and OutputThe input begins with a single positive integer on a line by itself indicating the number of the cases following, each of them as described below. This lin 阅读全文
posted @ 2012-07-10 21:01 ismdeep 阅读(231) 评论(0) 推荐(0)
【UVA - 494 Kindergarten Counting Game】
摘要：Kindergarten Counting GameEverybody sit down in a circle. Ok. Listen to me carefully.``Woooooo, you scwewy wabbit!''Now, could someone tell me how many words I just said?Input and OutputInput to your program will consist of a series of lines, each line containing multiple words (at least one 阅读全文
posted @ 2012-07-10 20:09 ismdeep 阅读(177) 评论(0) 推荐(0)
【uva - 458 The Decoder】
摘要：The DecoderWrite a complete program that will correctly decode a set of characters into a valid message. Your program should read a given file of a simple coded set of characters and print the exact message that the characters contain. The code key for this simple coding is a one for one character s 阅读全文
posted @ 2012-07-10 19:35 ismdeep 阅读(219) 评论(0) 推荐(0)
【uva - 10071 Back to High School Physics】
摘要：Back to High School PhysicsInput:standard inputOutput:standard outputA particle has initial velocity and constant acceleration. If its velocity after certain time is v then what will its displacement be in twice of that time?InputThe input will contain two integers in each line. Each line makes one 阅读全文
posted @ 2012-07-10 19:19 ismdeep 阅读(163) 评论(0) 推荐(0)
【uva - 10055 Hashmat the Brave Warrior】
摘要：Hashmat the brave warriorInput:standard inputOutput:standard outputHashmat is a brave warrior who with his group of young soldiers moves from one place to another to fight against his opponents. Before fighting he just calculates one thing, the difference between his soldier number and the opponent& 阅读全文
posted @ 2012-07-10 19:16 ismdeep 阅读(177) 评论(0) 推荐(0)
【hdu - 1049 Climbing Worm】
摘要：Climbing WormTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7713Accepted Submission(s): 4935Problem DescriptionAn inch worm is at the bottom of a well n inches deep. It has enough energy to climb u inches every minute, but then has to rest a minut 阅读全文
posted @ 2012-07-09 19:10 ismdeep 阅读(169) 评论(0) 推荐(0)
【hdu - 1070 Milks】
摘要：MilkTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7951Accepted Submission(s): 1893Problem DescriptionIgnatius drinks milk everyday, now he is in the supermarket and he wants to choose a bottle of milk. There are many kinds of milk in the supermar 阅读全文
posted @ 2012-07-09 17:14 ismdeep 阅读(186) 评论(0) 推荐(0)
【foj - 1746 A Water Problem】
摘要：真的是好水的题目啊，吓到了。。。Problem 1746 A Water Problem Accept: 169Submit: 351Time Limit: 1000 mSecMemory Limit : 32768 KB Problem DescriptionThis is a easy problem,I don't went to say any more. InputThere will be several test cases. OutputFor each test case, output only contain one line. Sample Input..... 阅读全文
posted @ 2012-07-09 14:31 ismdeep 阅读(294) 评论(0) 推荐(0)
【hdu - 1161 Eddy's mistakes】
摘要：Eddy's mistakesTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4754Accepted Submission(s): 2697Problem DescriptionEddy usually writes articles ,but he likes mixing the English letter uses, for example "computer science" is written fre 阅读全文
posted @ 2012-07-09 09:51 ismdeep 阅读(226) 评论(0) 推荐(0)
【hdu - 1061 Rightmost Digit】
摘要：Rightmost DigitTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 18122Accepted Submission(s): 6946Problem DescriptionGiven a positive integer N, you should output the most right digit of N^N.InputThe input contains several test cases. The first line 阅读全文
posted @ 2012-07-09 09:43 ismdeep 阅读(344) 评论(2) 推荐(0)
【hdu - 1164 Eddy's research I】
摘要：Eddy's research ITime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3554Accepted Submission(s): 2182Problem DescriptionEddy's interest is very extensive, recently he is interested in prime number. Eddy discover the all number owned can be divi 阅读全文
posted @ 2012-07-08 21:17 ismdeep 阅读(185) 评论(0) 推荐(0)
【hdu - 1163 Eddy's digital Roots 】
摘要：Eddy's digital RootsTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2355Accepted Submission(s): 1348Problem DescriptionThe digital root of a positive integer is found by summing the digits of the integer. If the resulting value is a single digi 阅读全文
posted @ 2012-07-08 21:04 ismdeep 阅读(169) 评论(0) 推荐(0)
【hdu - 1157 Who's in the Middle】
摘要：Who's in the MiddleTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4628Accepted Submission(s): 2347Problem DescriptionFJ is surveying his herd to find the most average cow. He wants to know how much milk this 'median' cow gives: half of 阅读全文
posted @ 2012-07-08 20:57 ismdeep 阅读(421) 评论(0) 推荐(0)
【hdu - 2099 整除的尾数】
摘要：整除的尾数Time Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 13580Accepted Submission(s): 5665Problem Description一个整数，只知道前几位，不知道末二位，被另一个整数除尽了，那么该数的末二位该是什么呢？Input输入数据有若干组，每组数据包含二个整数a，b（0<a<10000, 10<b<100），若遇到0 0则处理结束。Output对应每组数据，将满足条件的所有尾数在一行内 阅读全文
posted @ 2012-07-08 20:32 ismdeep 阅读(167) 评论(0) 推荐(0)
【hdu - 1219 AC Me】
摘要：AC MeTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7077Accepted Submission(s): 3165Problem DescriptionIgnatius is doing his homework now. The teacher gives him some articles and asks him to tell how many times each letter appears.It's really 阅读全文
posted @ 2012-07-08 20:03 ismdeep 阅读(211) 评论(0) 推荐(0)
【hdu - 1339 A Simple Task】
摘要：A Simple TaskTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2422Accepted Submission(s): 1354Problem DescriptionGiven a positive integer n and the odd integer o and the nonnegative integer p such that n = o2^p.ExampleFor n = 24, o = 3 and p = 3.Tas 阅读全文
posted @ 2012-07-08 19:39 ismdeep 阅读(186) 评论(0) 推荐(0)
【hdu - 1303 Doubles】
摘要：DoublesTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2176Accepted Submission(s): 1509Problem DescriptionAs part of an arithmetic competency program, your students will be given randomly generated lists of from 2 to 15 unique positive integers and 阅读全文
posted @ 2012-07-08 19:31 ismdeep 阅读(205) 评论(0) 推荐(0)
【hdu - 1302 The Snail】
摘要：The SnailTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 726Accepted Submission(s): 544Problem DescriptionA snail is at the bottom of a 6-foot well and wants to climb to the top. The snail can climb 3 feet while the sun is up, but slides down 1 foo 阅读全文
posted @ 2012-07-08 19:18 ismdeep 阅读(248) 评论(0) 推荐(0)

上一页 1 2 3 下一页