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
1696
. Salary for Robots
Complexity
Posted by
Zayakin A. [Perm SU]
10 Jul 2011 03:55
Can this solve with complexity lower than O(N*k^2)?
© 2000–2024
Timus Online Judge Team
. All rights reserved.
