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
1720
. Summit Online Judge
what is the fastest algorithm?
Posted by
Klyuchnikov Nikita
1 Apr 2010 19:16
To do calculations while [kx,ky] and [(k+1)x,(k+1)y] not intersect is very slow solution
Re: what is the fastest algorithm?
Posted by
2rf [Perm School #9]
13 Aug 2010 18:40
There is an O(1) solution.
© 2000–2024
Timus Online Judge Team
. All rights reserved.