Discussion @ 1238. Folding @ Timus Online Judge

Online Judge	Problems	Authors	Online contests
About Online Judge Frequently asked questions Site news Webboard Links	Problem set Submit solution Judge status Guide	Register Update your info Authors ranklist	Current contest Scheduled contests Past contests Rules

Discussion of Problem 1238. Folding

O(N^3) Is there more quick solution?

Posted by Burunduk1 4 Apr 2005 22:25

I has written O(N^3) solution.
But I think there is O(N^2) one...
If somebody knows please tell me (here or sk1@hotbox.ru)