Discussion @ 1051. Simple Game on a Grid @ Timus Online Judge

Li Yi What's the algorithm to this problem? [3] // Problem 1051. Simple Game on a Grid 7 Oct 2001 13:54

Hieu Nguyen Re: What's the algorithm to this problem? [2] // Problem 1051. Simple Game on a Grid 8 Oct 2001 00:50

> This is a my solution:
Suppose: m<=n
if m=1 then sol:=(n+1) div 2 else
begin
if (m mod 3=0)or(n mod 3=0) then sol:=2 else sol:=1;
end;

Vinicius Fortuna How did you realise this algorithm? [1] // Problem 1051. Simple Game on a Grid 8 Oct 2001 04:17

How did you realise this algorithm?
How can you proof that?
This solution really impressed me! :-)
You may e-mail me: fortuna@acm.org

Thank you

> > This is a my solution:
> Suppose: m<=n
> if m=1 then sol:=(n+1) div 2 else
> begin
> if (m mod 3=0)or(n mod 3=0) then sol:=2 else sol:=1;
> end;
>

aaakkk Why after m and n mod 3, The situation havn't change? and the result either 1 or 2 ? // Problem 1051. Simple Game on a Grid 3 Mar 2002 07:55

>
> > > This is a my solution:
> > Suppose: m<=n
> > if m=1 then sol:=(n+1) div 2 else
> > begin
> > if (m mod 3=0)or(n mod 3=0) then sol:=2 else sol:=1;
> > end;
> >

Discussion of Problem 1051. Simple Game on a Grid