题解 | #压缩二维码#

#include <bits/stdc++.h>
using namespace std;

int main() {
    long long n, bit = 0;
    string s, ss, sub;
    cin >> n;
    for (int i = 0; i < pow(2, n); i++) {
        cin >> s;
        ss += s;
    }
    for (int i = 0; i < ss.size(); i += 4) {
        sub = ss.substr(i, 4);
        for (int j = 0; j < 4; j++) {
            if (sub[j] == '#') {
                bit += pow(2, (4 - j - 1));
            }
        }
        cout << bit << ' ';
        bit = 0;
    }
    return 0;
}