Results of Comment Search

Search:    Place:    Show:

Title User Message Date Posted
endl vasavrules watch out for the endl.... Oct 20, 2014 - 4:31:45 am UTC
Re: how to do? hansonw1 First you should come up with the loops solution - it's completely doable. (BTW it seems you changed it to 150/200) Jan 11, 2009 - 2:43:19 am UTC
Re: how to do? bbi5291 It used to be doable using only loops, but I added an extra test case, so now Hanson's loops-only solution gets 180/200. The suffix array solution is the easiest. Jan 11, 2009 - 2:23:58 am UTC
how to do? bleung91 Ok how do we do this problem (without using tries or suffix arrays or any 1337 thing that only brian, hanson, jacob know and are capable of coding becuase they're experienced)? Jan 11, 2009 - 2:09:36 am UTC
Test cases updated hansonw1 There can now be up to 5000 characters. (Now sets/maps will not work - no matter what.) Again the points will revert to 20, so no one loses (in fact most of you win, since partial marks are now on) Dec 24, 2008 - 7:36:56 pm UTC
Re: when i compiled #4 hansonw1 Notice your memory use: it's getting close to 256MB! Uncaught exception can mean a lot of things, and one of those things is running out of memory. Nov 25, 2008 - 1:06:58 pm UTC
when i compiled #4 qinhaotian it worked on my computer. can someone help :P? Nov 25, 2008 - 4:56:05 am UTC
omgosh qinhaotian damn these uncaught exceptions Nov 25, 2008 - 4:53:45 am UTC