It's often that way - small inputs can be solved with a relatively
easy idea (sometimes by simple brute-force), but large inputs require
an optimal algorithm.
If you believe your algorithm is fast (something smaller than O(K^2)),
then tell what language you used, and try to describe your algorithm.
--~--~---------~--~----~------------~-------~--~----~
You received this message because you are subscribed to the Google Groups
"google-codejam" group.
To post to this group, send email to [email protected]
To unsubscribe from this group, send email to
[email protected]
For more options, visit this group at
http://groups.google.com/group/google-code?hl=en
-~----------~----~----~----~------~----~------~--~---
