Discussion @ 1041. Nikifor @ Timus Online Judge

1041Gauss forever

Posted by svr 1 Mar 2007 18:14

I was beaten by newtesrmakers having gauss solution
in __int64- overflow.
Rewrited the same program in my long arithm.
300- digits- MLE
200-digits-not enough.
270- digits- AC.
Some new tests and the problem will become unsolvable.

Hint

Posted by [SPbSU ITMO] WiNGeR 2 Mar 2007 00:02

You can use gauss over prime modular ring instead of long arithmetics
Just select lucky module =)

Re: Hint

Posted by Denis Koshman 26 Aug 2008 10:47

Thanks Godz my ID at Valladolid is prime! :D

Re: Hint

Posted by Timur Sitdikov (MSU TB) 16 Apr 2011 09:23

Great idea) I used ortogonalization over prime module) Thanks.

Discussion of Problem 1041. Nikifor