ENG  RUS Timus Online Judge
Online Judge
Problems
Authors
Online contests
Site news
Webboard
Problem set
Submit solution
Judge status
Guide
Register
Authors ranklist
Current contest
Scheduled contests
Past contests
Rules
back to board

## Discussion of Problem 1705. Gangster Hares

Posted by TNT_wjx 4 Apr 2009 13:58
Re: how about n=1?
Posted by yaho0o0 4 Apr 2009 14:48
I think when n=1 k must be 0
Re: how about n=1?
Posted by Michail Yudin 4 Apr 2009 17:36
o_O, i think 2
Re: how about n=1?
Posted by yaho0o0 4 Apr 2009 20:34
no it is not 2 it is 0 you were not understand the problem

Edited by author 04.04.2009 20:34
Re: how about n=1?
Posted by Al.Cash 5 Apr 2009 00:29
Then why does my AC program output 2???
Re: how about n=1?
Posted by partisan 5 Apr 2009 22:45
k cannot be 0 because we cannot divide on it. There will be no answer on question "How much heads of cabbage receive each hare?" because even 1=0*1000000+1 is true.
The answer is 2 because for 1 we have 1/1=1 but 1/2=0. And for 2 we have 1/2=1/3=0.
Re: how about n=1?
Posted by yaho0o0 6 Apr 2009 21:44
I'm sorry maby I was not understood the problem
Re: how about n=1?
Posted by partisan 10 Jun 2009 00:33
K is the minimum integer that [n/k]=[n/(k+1)]
Re: how about n=1?
Posted by Quyon 19 Aug 2009 09:14
if n=1 then output 2
1/2=0 and 1/3=0