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
1342
. Enterprise
Is there an O(nm) Solution for this problem?
Posted by
Geekmen
28 Mar 2025 17:00
Any solution with time complexity strictly lower than O(nmk) will be helpful. Thanks!
© 2000–2025
Timus Online Judge Team
. All rights reserved.