| ENG RUS | Timus Online Judge |
Discussion of Problem 1028. StarsMy solution on Pascal is 247 bytes only! Posted by Dmitry 'Diman_YES' Kovalioff 24 Nov 2002 18:08 But uses more memory and time than others :) (-) Posted by Miguel Angel 25 Nov 2002 21:21 O(n^2)? I think it will get TLE. Posted by Maigo Akisame (maigoakisame@yahoo.com.cn) 22 Jul 2004 15:06 I know O(N*logN) solution (rather simple), but O(N^2) passes TL easily - computers became faster since 2000 (-) Posted by Dmitry 'Diman_YES' Kovalioff 22 Jul 2004 15:15 |