UVa 10368 — Euclid's Game ... proof ?

Revision en1, by MohamedHamada_, 2018-09-26 08:38:35

I was solving the problem UVa 10368 and after thinking for a while i came up with this solution:

The first player have a number n%m == 0 or n/m > 1 is the winner and got AC ! :D

I just observed this solution when i tried some numbers on a paper but i actually don't have a rigorous proof for that ! could you demonstrate why this solution works ?

Thanks in advance :)


  Rev. Lang. By When Δ Comment
en1 English MohamedHamada_ 2018-09-26 08:38:35 616 Initial revision (published)