ENG  RUSTimus 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
back to board

Discussion of Problem 1354. Palindrome. Again Palindrome

O(n), hashing!!!
Posted by hoan 3 Dec 2010 22:35
Re: O(n), hashing!!!
Posted by Vedernikoff 'Goryinyich' Sergey (HSE: АОП) 4 Dec 2010 01:51
O(n^2), brute-forcing!!! =)
Re: O(n), hashing!!!
Posted by waterlink 19 Aug 2011 17:16
solved by hashing too, so this problem could be expanded to n ~ 10^6

© 2000–2024 Timus Online Judge Team. All rights reserved.