摘要: BabelfishTime Limit:3000MSMemory Limit:65536KTotal Submissions:26333Accepted:11301DescriptionYou have just moved from Waterloo to a big city. The people here speak an incomprehensible dialect of a foreign language. Fortunately, you have a dictionary to he... 阅读全文
posted @ 2013-01-23 13:14 KRisen 阅读(164) 评论(0) 推荐(0) 编辑
摘要: 4 Values whose Sum is 0Time Limit:15000MSMemory Limit:228000KTotal Submissions:12224Accepted:3426Case Time Limit:5000MSDescriptionThe SUM problem can be formulated as follows: given four lists A, B, C, D of integer values, compute how many quadruplet (a, b, c, d ) ∈ A x B x C x D are such that a + b 阅读全文
posted @ 2013-01-23 09:52 KRisen 阅读(143) 评论(0) 推荐(0) 编辑
摘要: Sacrament of the sumTime Limit:1000MSMemory Limit:65536KTotal Submissions:1628Accepted:756Description— The Brother of mine, the Head of Monastic Order wants to know tomorrow about the results long-term researches. He wants to see neither more nor less than the Su... 阅读全文
posted @ 2013-01-22 16:38 KRisen 阅读(477) 评论(0) 推荐(0) 编辑
摘要: Can you find it?Time Limit: 10000/3000 MS (Java/Others)Memory Limit: 32768/10000 K (Java/Others)Total Submission(s): 6515Accepted Submission(s): 1706Problem DescriptionGive you three sequences of numbers A, B, C, then we give you a number X. Now you need to calculate if you can find the three number 阅读全文
posted @ 2013-01-22 15:13 KRisen 阅读(293) 评论(0) 推荐(1) 编辑
摘要: ProductThe ProblemThe problem is to multiply two integers X, Y. (0<=X,Y<10250)The InputThe input will consist of a set of pairs of lines. Each line in pair contains one multiplyer.The OutputFor each input pair of lines the output line should consist one integer the product.Sample Input12122222 阅读全文
posted @ 2013-01-20 18:12 KRisen 阅读(166) 评论(0) 推荐(0) 编辑
摘要: Integer InquiryOne of the first users of BIT's new supercomputer was Chip Diller. He extended his exploration of powers of 3 to go from 0 to 333 and h... 阅读全文
posted @ 2013-01-18 16:09 KRisen 阅读(474) 评论(0) 推荐(0) 编辑
摘要: PalindromesA regular palindrome is a string of numbers or letters that is the same forward as backward. For example, the string "ABCDEDCBA" is a palindrome because it is the same when the string is read from left to right as when the string is read from right to left. A mirrored string is 阅读全文
posted @ 2013-01-17 16:24 KRisen 阅读(228) 评论(0) 推荐(0) 编辑
摘要: FatMouse' TradeTime Limit : 2000/1000ms (Java/Other)Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 25Accepted Submission(s) : 1Problem DescriptionFatMouse prepared M pounds of cat food, ready to trade with the cats guarding the warehouse containing his favorite food, JavaBean. The 阅读全文
posted @ 2012-12-07 17:39 KRisen 阅读(212) 评论(0) 推荐(0) 编辑
摘要: Fibonacci AgainTime Limit : 2000/1000ms (Java/Other)Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 13Accepted Submission(s) : 5Problem DescriptionThere are another kind of Fibonacci numbers: F(0) = 7, F(1) = 11, F(n) = F(n-1) + F(n-2) (n>=2).InputInput consists of a sequence of lin 阅读全文
posted @ 2012-11-30 21:27 KRisen 阅读(161) 评论(0) 推荐(0) 编辑
摘要: N!Time Limit : 10000/5000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 54 Accepted Submission(s) : 11Problem 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 阅读全文
posted @ 2012-11-28 23:57 KRisen 阅读(290) 评论(0) 推荐(0) 编辑