 |
| ||||
Home Page
F.A.Qs
Statistical Charts
Past Contests
Scheduled Contests
Award Contest
| ||||||||||
| 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 | |||||||||
我估计这种方法是通过高斯消元法推出来的。In Reply To:Re:能不能讲下具体的方法.. Posted by:XCOOL at 2007-07-25 15:30:06 > 解模线性方程组解法,IJ处变换可以看成I行J行为1的矩阵,这样共有16种该矩阵,记为a1到a16,没一种变换可以看成原矩阵s(记close为0,open为1)+变换矩阵 mod 2,这样问题就变成求c1*a1+..+cn*an mod2=1街该方程组求c1,c2..cn,要求c1+c2+..+cn的和最小,网上可以查到解模线形方程组的方法,应该是这样的吧 Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
