题解 | #压缩二维码#

模拟。

#include<bits/stdc++.h>
#define int long long
#define double long double
#define x first
#define y second
using namespace std;
typedef long long LL;
typedef long long ll;
typedef pair<int, int> PII;
const int N = 3e5 + 10;
const int M = 1e3 + 10;
int mod = 1e9 + 7;
int a[N];

void solve() {
    int n;
    cin >> n;
    int ans = 0, cnt = 0;
    for (int i = 1; i <= (1ll << n); i++) {
        for (int j = 1; j <= (1ll << n); j++) {
            char ch;
            cin >> ch;
            if (ch == '.') ans = ans * 2;
            else ans = ans * 2 + 1;
            cnt++;
            if (cnt == 4) {
                cnt = 0;
                cout << ans << " ";
                ans = 0;
            }
        }
    }
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);
    int _;
    _ = 1;
    //cin>>_;
    while (_--) {
        solve();
    }
}