提交时间:2025-06-08 13:41:47
运行 ID: 37963
#include <bits/stdc++.h> using namespace std; int n,k; int a[11][45]; int b[11][45]; signed mian () { return 0; } signed main () { cin >> n >> k; if (n == 1) { mian(); return 0; } for (int i = 0;i <= k;i++) { for (int j = 0;j <= k;j++) { cin >> a[i][j]; } } for (int i = 0;i < (1ll << ((k + 1) * (k + i)));i++) { for (int x = 0;x <= k;x++) { for (int y = 0;y <= k;y++) { b[x][y] = (bool)(i & (1ll << ((k + 1) * x + y))); } } bool ans = 1; for (int x = 0;x <= k;x++) { for (int y = 0;y <= k;y++) { int sum = 0; for (int xx = max(0,x - 1);xx <= min(k,x + 1);xx++) { for (int yy = max(0,y - 1);yy <= min(k,y + 1);yy++) { sum += b[x][y]; } } if (sum != a[x][y]) { ans = 0; goto brk; } } } brk: if (ans) { for (int x = 0;x <= k;x++) { for (int y = 0;y <= k;y++) { cout << b[x][y] << ' '; } cout << endl; } return 0; } } return 0; }