Discussion @ 1705. Gangster Hares @ Timus Online Judge

TNT_wjx how about n=1? [8] // Problem 1705. Gangster Hares 4 Apr 2009 13:58

yaho0o0 Re: how about n=1? [7] // Problem 1705. Gangster Hares 4 Apr 2009 14:48

I think when n=1 k must be 0

Michail Yudin Re: how about n=1? [6] // Problem 1705. Gangster Hares 4 Apr 2009 17:36

o_O, i think 2

yaho0o0 Re: how about n=1? [5] // Problem 1705. Gangster Hares 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

Al.Cash Re: how about n=1? [4] // Problem 1705. Gangster Hares 5 Apr 2009 00:29

Then why does my AC program output 2???

partisan Re: how about n=1? [3] // Problem 1705. Gangster Hares 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.

yaho0o0 Re: how about n=1? [2] // Problem 1705. Gangster Hares 6 Apr 2009 21:44

I'm sorry maby I was not understood the problem

partisan Re: how about n=1? [1] // Problem 1705. Gangster Hares 10 Jun 2009 00:33

K is the minimum integer that [n/k]=[n/(k+1)]

Quyon Re: how about n=1? // Problem 1705. Gangster Hares 19 Aug 2009 09:14

if n=1 then output 2
1/2=0 and 1/3=0

Discussion of Problem 1705. Gangster Hares