Discussion @ 1032. Find a Multiple @ Timus Online Judge

Please send solution wtih O(N) to me (I used back tracking and optimization to get 0.05s AC) here or piyawut@se-ed.net

Posted by MadPsyentist/Sam 3 Feb 2002 13:47

Thank you in advance :)

I mean the problem 1032 , Find a multiple

Posted by MadPsyentist/Sam 3 Feb 2002 13:48

> Thank you in advance :)

Re: Use Dirichlet method to solve !!!

Posted by Tran Nam Trung (trungduck@yahoo.com) 3 Feb 2002 15:49

> > Thank you in advance :)
B[i] := a[i] mod n, so there always exist i that b[i] = 0 or exist i
and j that b[i] = b[j] --> segment from i->j is the answer.

Discussion of Problem 1032. Find a Multiple