Discussion @ 1255. Graveyard of the Cosa Nostra @ Timus Online Judge

My thoughts

Posted by Perov Rodion 17 Mar 2003 13:58

As I think if n > k then the solution is (n*n - 1) div k and that's
why the answer for 7 4 is 12
1 2 3 4 4 4 4
1 2 3 5 5 5 5
1 2 3 6 6 6 6
1 2 3 7 8 9
10 10 10 10 7 8 9
11 11 11 11 7 8 9
12 12 12 12 7 8 9
And when n < k then it's quite difficult => wait and bleed)))

look here Rodion

Posted by Aleksey S.S. 17 Mar 2003 14:06

> As I think if n > k then the solution is (n*n - 1) div k and that's
> why the answer for 7 4 is 12
> 1 2 3 4 4 4 4
> 1 2 3 5 5 5 5
> 1 2 3 6 6 6 6
> 1 2 3 7 8 9
> 10 10 10 10 7 8 9
> 11 11 11 11 7 8 9
> 12 12 12 12 7 8 9
> And when n < k then it's quite difficult => wait and bleed)))

Re: look here Rodion

Posted by BycovD 21 Mar 2003 01:19

> > As I think if n > k then the solution is (n*n - 1) div k and
that's
> > why the answer for 7 4 is 12
> > 1 2 3 4 4 4 4
> > 1 2 3 5 5 5 5
> > 1 2 3 6 6 6 6
> > 1 2 3 7 8 9
> > 10 10 10 10 7 8 9
> > 11 11 11 11 7 8 9
> > 12 12 12 12 7 8 9
> > And when n < k then it's quite difficult => wait and
bleed)))
What about (2, 1) or (4, 2) ???

Re: look here Rodion

Posted by Perov Rodion 24 Mar 2003 20:37

> > > As I think if n > k then the solution is (n*n - 1) div k and
> that's
> > > why the answer for 7 4 is 12
> > > 1 2 3 4 4 4 4
> > > 1 2 3 5 5 5 5
> > > 1 2 3 6 6 6 6
> > > 1 2 3 7 8 9
> > > 10 10 10 10 7 8 9
> > > 11 11 11 11 7 8 9
> > > 12 12 12 12 7 8 9
> > > And when n < k then it's quite difficult => wait and
> bleed)))
> What about (2, 1) or (4, 2) ???
Не ну это понятно что если n делится на k то ответ N*N div K- я
просто не успел до конца набить а потом лень переделывать было))

Discussion of Problem 1255. Graveyard of the Cosa Nostra