| ENG RUS | Timus Online Judge |
Обсуждение задачи 1028. ЗвёздыMy solution on Pascal is 247 bytes only! Послано Dmitry 'Diman_YES' Kovalioff 24 ноя 2002 18:08 But uses more memory and time than others :) (-) Послано Miguel Angel 25 ноя 2002 21:21 O(n^2)? I think it will get TLE. Послано Maigo Akisame (maigoakisame@yahoo.com.cn) 22 июл 2004 15:06 I know O(N*logN) solution (rather simple), but O(N^2) passes TL easily - computers became faster since 2000 (-) Послано Dmitry 'Diman_YES' Kovalioff 22 июл 2004 15:15 |