题解 | 压缩二维码

#include <iostream>
#include <vector>
#include <algorithm>
#include <cstring>
#include <cmath>
using namespace std;

int n;
vector<int> q;

int main() {
    cin >> n;
    string s;
    int t = pow(2, n);
    for (int i = 1; i <= t; i++) {
        cin >> s;
        for (int j = 0; j < t; j++) {
            if (s[j] == '.') {
                q.push_back(0);
            }
            else {
                q.push_back(1);
            }
        }
    }//for(int i=0;i<q.size();i++)cout<<q[i]<<endl;
    vector<int> ans;
    int flag = 0;
    int sum=0;
    for (int i = 0; i < q.size(); i++) {
        flag++;
    sum*=2;
        if (q[i] == 1) {
            sum += 1;
        }
        if (flag == 4) {
            ans.push_back(sum);
            sum = 0;
            flag = 0;
        }
    }
    for (int i = 0; i < ans.size(); i++) {
        cout << ans[i] << " ";
    }
    cout << endl;
    return 0;
}