|
|
back to boardI think 1 second for this problem is quite enough! Mine is 0.03, and I agree with you (-) Re: Mine is 0.03, and I agree with you (-) How did you do this? My algorithm is (n*2^n); Re: I think 1 second for this problem is quite enough! I'm a bit faster than you and I used less memory than you ! 870224 Pascal Accepted 0.001 157 KB Edited by author 02.07.2005 08:06 Edited by author 02.07.2005 08:07 |
|
|