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
1705
. Gangster Hares
Mr.Arsalan
I don't understand the problem statement.
[2] // Problem
1705. Gangster Hares
26 Apr 2009 01:52
Just as title. Would somebody explain it to me without spoiling the problem?
Bunenkoff Nikita
Re: I don't understand the problem statement.
[1] // Problem
1705. Gangster Hares
26 Apr 2009 03:52
You have to find the minimum number k, which satisfy the condition (n div k) = (n div (k + 1)). Number n is given by the input.
Mr.Arsalan
Re: I don't understand the problem statement.
// Problem
1705. Gangster Hares
26 Apr 2009 21:57
Thank you so much.
© 2000–2026
Timus Online Judge Team
. All rights reserved.