All you have to do is optimize the algorithm, and in case optimization is
not possible for the method u have chosen , u'll have to think of another
approach to solve it.
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups
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
Thanks shreyas p and token0!
I have optimized my algorithm.Now I have got it.
It's so difficult fo me.
Mousetrap was a hard problem: 1715 people got points in the contest; and of
those, 387 tried Mousetrap's Large input; and of those, only 95 got it
correct. You should be proud of yourself
