题目传送门：https://uva.onlinejudge.org/index.php&problem=2459
中文题面：《算法竞赛·入门经典·训练指南》P15
瞄一眼，觉得是这道题：http://www.lydsy.com/JudgeOnline/problem.php?id=3503
结果仔细一看：这题居然不能用线性基来搞，因为没法保证改变的数最少QAQ
还是是能用std的做法：
枚举第一行的所有状态，之后递推出整个棋盘的局面
然后计算更改量，最后用更改量来更新答案
复杂度：\(O({2^n} \cdot {n^2})\)
Hi there very cool site!! Guy .. Excellent .. Superb .. I’ll bookmark your web site and take the feeds additionallyKI’m glad to find so many useful info here within the publish, we want develop extra strategies in this regard, thank you for sharing. . . . . .
You have noted very interesting details ! ps decent website .