{"trustable":false,"sections":[{"title":"","value":{"format":"MD","content":"给你一个01矩阵,矩阵大小为M x N。***(1 \u003c\u003d M , N \u003c\u003d 15)***\n每次操作选择一个格子,使得该格子与上下左右四个格子的值翻转。\n至少多少次操作可以使得矩阵中所有的值变为0?\n请输出翻转方案,若没有方案,输出***\"IMPOSSIBLE”*** 。\n若有多种方案符合题意,请首先输出翻转次数最少的方案;若方案个数仍不唯一,则输出字典序最小的方案。"}},{"title":"Input","value":{"format":"MD","content":"第一行输入两个数:M和N。***(1 \u003c\u003d M , N \u003c\u003d 15)***\n接下来M行,每行N个数,其值只为0或1。"}},{"title":"Output","value":{"format":"MD","content":"输出M行,每行N个数。\n每个数代表该位置翻转次数"}},{"title":"Sample Input","value":{"format":"MD","content":"4 4\n1 0 0 1\n0 1 1 0\n0 1 1 0\n1 0 0 1"}},{"title":"Sample Output","value":{"format":"MD","content":"0 0 0 0\n1 0 0 1\n1 0 0 1\n0 0 0 0"}}]}