Online Judge | Problem Set | Authors | Online Contests | User | ||||||
---|---|---|---|---|---|---|---|---|---|---|
Web Board Home Page F.A.Qs Statistical Charts | Current Contest Past Contests Scheduled Contests Award Contest |
Re:中国剩余定理的那个唯一最小值怎么求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: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator