Online JudgeProblem SetAuthorsOnline ContestsUser
Web Board
Home Page
F.A.Qs
Statistical Charts
Problems
Submit Problem
Online Status
Prob.ID:
Register
Update your info
Authors ranklist
Current Contest
Past Contests
Scheduled Contests
Award Contest
User ID:
Password:
  Register

Re:中国剩余定理的那个唯一最小值怎么求

Posted by idler1984 at 2006-05-07 20:18:32 on Problem 1006
In Reply To:中国剩余定理的那个唯一最小值怎么求 Posted by:xbh at 2006-04-18 01:14:47
其实这个就是求一次同余式组的解,有定理
a1为
x = 1 mod m1
x = 0 mod m2
x = 0 mod m3
的一个解;
a2为
x = 0 mod m1
x = 1 mod m2
x = 0 mod m3
的一个解;
a3为
x = 0 mod m1
x = 0 mod m2
x = 1 mod m3
的一个解;
那么n1*a1+n2*a2+n3*a3为一次同余式组:
x = n1 mod m1
x = n2 mod m2
x = n3 mod m3
的解。
接着就好办了。

Followed by:

Post your reply here:
User ID:
Password:
Title:

Content:

Home Page   Go Back  To top


All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator