Sorry for the spam -- we don't moderate posts from users who have previously
posted something reasonable. The user has now been banned.
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups
"google-codejam" group.
To post
Well, I've already seen in ACM-ICPC people that used an exactly and correct
brute-force algorithm for small test cases, and for the big ones the
solution wouldn't run on time. But big inputs normally are generated
automatically and most of them doesn't contain edge cases. So, sometimes an
heuristic
case 1:
state f(x): x new cards, C-x old cards
//meaning: piles needed to collect another x new cards
f(x) = 1+sum((x,i)*(C-x,N-i)/(C,N))*f(x-i)
=> fetch i from x new; fetch N-i from C-x old
case 2:
state f(x): x old cards, C-x new cards
//meaning: piles needed to collect x cards, among with i
Before 2008, Google Code Jam was run by a company called TopCoder. I don't
know where you can find their past GCJ problems, but I think most of their
tournaments would have stuff that's comparably similar to this year's
rounds.
On Sat, Sep 19, 2009 at 9:13 AM, freemasons wrote:
>
> I can only f
Any ideas on how to solve the large input case?
I downloaded correct solutions from the scoreboard, but couldnt
understand the approach completely. Could not find any discussion or
Contest analysis on the problem too.
thanks.
- Rajat.
--~--~-~--~~~---~--~~
You re
