Talk:UVa 10843 - Anne's game

I haven't solved this (or any uva problem in a few months :, but it seems that you can avoid big int. Simply use a 64 bit int and mod out after every multiplication.  Since 2000000011 is less than $$2^{32}$$, no multiplication will overflow.  --Rrenaud 00:04, 17 May 2005 (EDT)

Since we only have to print the answer mod 2000000011, this can be safely calculated without the use of BigNum.

(I solved this without BigNum.. but maybe I should reword that?) Larry 08:39, 17 May 2005 (EDT)

Wow, I need to read more carefully. Still, mentioning BigNum at all might be a bit misleading.--Rrenaud 08:58, 17 May 2005 (EDT)

Ya, maybe we ought to add emphasis on the "without" there too.. heh. Larry 09:16, 17 May 2005 (EDT)