ENG
RUS
Timus Online Judge
Online Judge
Problems
Authors
Online contests
About Online Judge
Frequently asked questions
Site news
Webboard
Links
Problem set
Submit solution
Judge status
Guide
Register
Update your info
Authors ranklist
Current contest
Scheduled contests
Past contests
Rules
back to board
Discussion of Problem
1032
. Find a Multiple
MadPsyentist/Sam
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
[2] // Problem
1032. Find a Multiple
3 Feb 2002 13:47
Thank you in advance :)
MadPsyentist/Sam
I mean the problem 1032 , Find a multiple
[1] // Problem
1032. Find a Multiple
3 Feb 2002 13:48
> Thank you in advance :)
Tran Nam Trung (trungduck@yahoo.com)
Re: Use Dirichlet method to solve !!!
// Problem
1032. Find a Multiple
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.
© 2000–2025
Timus Online Judge Team
. All rights reserved.