Results of Comment Search

Search:    Place:    Show:

Title User Message Place Date Posted
Hint bbi5291 See if you can determine, for each circle, how much of its circumference lies on the boundary. detectors Feb 09, 2009 - 2:55:59 am UTC
Hint SourSpinach This is a basic example of a "Knapsack Problem". Think of breaking this down into the subproblem "what's the maximum number of points I can get in X hours, using some set of the first Y problems". spree Feb 09, 2009 - 2:46:56 am UTC
Hint SourSpinach Rather than calculating the number of ships in each snatch separately, try thinking the other way around - count how many snatches each ship appears in! bship Feb 09, 2009 - 2:44:29 am UTC
Re: help? bbi5291 Nice that you learned how to code a binary search tree. So, Jacob tried the same, and he also got only 90/100. The last test case is specially designed to be worst-case in terms of runtime, so you pro... ccc05s5 Feb 07, 2009 - 4:43:54 pm UTC
help? Daniel is there any other way to speed up my binary search tree? ccc05s5 Feb 07, 2009 - 3:44:42 pm UTC
= = javic didn't see that there is possibly no such sequence...... that makes my algorithm totally fail = = gonna take a break XD seq Feb 06, 2009 - 3:16:12 am UTC
Re: Re: Re: Re: Spam Submitting Saravannan How can you accidentally submit code over and over again? General Feb 05, 2009 - 3:47:43 am UTC
Re: Re: Re: Spam Submitting Bryan I don't do it intentionally General Feb 05, 2009 - 1:42:42 am UTC
Re: Re: Spam Submitting jargon It is not that you can reduce your time. It's simply (as stated in another post) that run-times vary for each submission. Regardless, this was (at first, anyway) completely unintentional. General Feb 05, 2009 - 1:39:19 am UTC
Re: Spam Submitting Bryan Ok, at first this was not intentional, and it still isn't. It seems that sometimes if you submit the same program, you can get different run-times. So of course, by "spam" submitting, you can lower yo... General Feb 05, 2009 - 1:22:58 am UTC