摘要:Knapsack problem Given a set of n items, each with a weight w[i] and a value v[i], determine a way to choose the items into a knapsack so that the tot
阅读全文
摘要:Simple String Problem Recently, you have found your interest in string theory. Here is an interesting question about strings. You are given a string S
阅读全文
摘要:Mountain Number One integer number x is called "Mountain Number" if: (1) x>0 and x is an integer; (2) Assume x=a[0]a[1]...a[len-2]a[len-1](0≤a[i]≤9, a
阅读全文
摘要:Machine Schedule As we all know, machine scheduling is a very classical problem in computer science and has been studied for a very long history. Sche
阅读全文
摘要:String Reconstruction Ivan had string s consisting of small English letters. However, his friend Julia decided to make fun of him and hid the string s
阅读全文
摘要:Permutation Counting Given a permutation a1, a2, … aN of {1, 2, …, N}, we define its E-value as the amount of elements where ai > i. For example, the
阅读全文
摘要:Sum Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 3980 Accepted Submission(s): 1620 Problem D
阅读全文
摘要:Fibonacci-ish Yash has recently learnt about the Fibonacci sequence and is very excited about it. He calls a sequence Fibonacci-ish if You are given s
阅读全文
摘要:A Trivial Problem Mr. Santa asks all the great programmers of the world to solve a trivial problem. He gives them an integer m and asks for the number
阅读全文