September 20th, 2013, 03:15 AM
Thanks for the assistance dazzle.
September 19th, 2013, 12:43 AM
At a restaurant there is a chef and his job is to cook pancakes. The problem is that he is not a good cook and as a result all the pancakes he creates are of different sizes. Now when the waiter is...
September 18th, 2013, 05:52 AM
Watch some videos on the latest stuff on C++ here
September 18th, 2013, 05:47 AM
September 17th, 2013, 05:31 PM
On a mountain there are two types of people - consistent and inconsistent. The consistent people always speak the truth, while the inconsistent people cannot be trusted (they may speak the truth or...
September 11th, 2012, 10:28 PM
Thanks nuzzle for thorough explanation. I actually implemented a greedy algorithm and it worked perfectly. Thanks for your time.
September 7th, 2012, 09:55 PM
If we are given an equation say 3x + 2y <= 10, we want to find the value of x and y such that
x + y = maximum and 10 - 3x - 2y is minimized. How can this be done? I am thinking of it as a...
January 25th, 2011, 08:58 PM
Thanks nuzzle ! The O(n) algorithm I used is exactly same as yours. Thanks for your time.
January 9th, 2011, 08:42 PM
Don't worry guys ! I found out the O (n) algorithm.
January 9th, 2011, 05:35 PM
I am trying to find a O (n) algorithm for this problem but unable to do so even after spending 3 - 4 hours. The brute force method times out (O (n^2)). I am confused as to how to do it ? Does...
April 29th, 2009, 11:53 PM
I have written an inefficient program for string matching. In this program we are suppose to tell whether it is possible to have all possible permutations of the first string (all distinct...
April 5th, 2009, 05:18 PM
I have written a program, in which it will ask the user to enter a string of length exactly 9. I have got a dictionary file with me which contains over two hundred thousand words. My job is to...