| ENG RUS | Timus Online Judge |
Обсуждение задачи 1297. ПалиндромыThis problem is very easy.We can solve it with O(N^2).But it seems like that exist a O(N) algorithm. Послано zhougelin 15 сен 2004 21:40 Re: This problem is very easy.We can solve it with O(N^2).But it seems like that exist a O(N) algorithm. Послано Gheorghe Stefan 16 сен 2004 19:36 Re: This problem is very easy.We can solve it with O(N^2).But it seems like that exist a O(N) algorithm. Послано zhougelin 18 сен 2004 20:10 |