ENG
RUS
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
back to board
Discussion of Problem
2199
. Company Question
What is the complexity of the algorithm?
Posted by
ilya trofimov
19 Feb 2026 19:24
O(n*sqrt(n)*log(n)) enough?
© 2000–2026
Timus Online Judge Team
. All rights reserved.